1 /* Tree lowering pass. This pass converts the GENERIC functions-as-trees
2 tree representation into the GIMPLE form.
3 Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
5 Major work done by Sebastian Pop <s.pop@laposte.net>,
6 Diego Novillo <dnovillo@redhat.com> and Jason Merrill <jason@redhat.com>.
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify it under
11 the terms of the GNU General Public License as published by the Free
12 Software Foundation; either version 3, or (at your option) any later
15 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
16 WARRANTY; without even the implied warranty of MERCHANTABILITY or
17 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
26 #include "coretypes.h"
31 #include "tree-iterator.h"
32 #include "tree-inline.h"
33 #include "diagnostic.h"
34 #include "langhooks.h"
35 #include "langhooks-def.h"
36 #include "tree-flow.h"
50 #include "pointer-set.h"
51 #include "splay-tree.h"
54 #include "tree-pass.h"
57 enum gimplify_omp_var_data
63 GOVD_FIRSTPRIVATE = 16,
64 GOVD_LASTPRIVATE = 32,
67 GOVD_DEBUG_PRIVATE = 256,
68 GOVD_PRIVATE_OUTER_REF = 512,
69 GOVD_DATA_SHARE_CLASS = (GOVD_SHARED | GOVD_PRIVATE | GOVD_FIRSTPRIVATE
70 | GOVD_LASTPRIVATE | GOVD_REDUCTION | GOVD_LOCAL)
79 ORT_COMBINED_PARALLEL = 3
82 struct gimplify_omp_ctx
84 struct gimplify_omp_ctx *outer_context;
86 struct pointer_set_t *privatized_types;
88 enum omp_clause_default_kind default_kind;
89 enum omp_region_type region_type;
92 static struct gimplify_ctx *gimplify_ctxp;
93 static struct gimplify_omp_ctx *gimplify_omp_ctxp;
96 /* Formal (expression) temporary table handling: Multiple occurrences of
97 the same scalar expression are evaluated into the same temporary. */
99 typedef struct gimple_temp_hash_elt
102 tree temp; /* Value */
105 /* Forward declarations. */
106 static enum gimplify_status gimplify_compound_expr (tree *, gimple_seq *, bool);
108 /* Mark X addressable. Unlike the langhook we expect X to be in gimple
109 form and we don't do any syntax checking. */
111 mark_addressable (tree x)
113 while (handled_component_p (x))
114 x = TREE_OPERAND (x, 0);
115 if (TREE_CODE (x) != VAR_DECL
116 && TREE_CODE (x) != PARM_DECL
117 && TREE_CODE (x) != RESULT_DECL)
119 TREE_ADDRESSABLE (x) = 1;
122 /* Return a hash value for a formal temporary table entry. */
125 gimple_tree_hash (const void *p)
127 tree t = ((const elt_t *) p)->val;
128 return iterative_hash_expr (t, 0);
131 /* Compare two formal temporary table entries. */
134 gimple_tree_eq (const void *p1, const void *p2)
136 tree t1 = ((const elt_t *) p1)->val;
137 tree t2 = ((const elt_t *) p2)->val;
138 enum tree_code code = TREE_CODE (t1);
140 if (TREE_CODE (t2) != code
141 || TREE_TYPE (t1) != TREE_TYPE (t2))
144 if (!operand_equal_p (t1, t2, 0))
147 /* Only allow them to compare equal if they also hash equal; otherwise
148 results are nondeterminate, and we fail bootstrap comparison. */
149 gcc_assert (gimple_tree_hash (p1) == gimple_tree_hash (p2));
154 /* Link gimple statement GS to the end of the sequence *SEQ_P. If
155 *SEQ_P is NULL, a new sequence is allocated. This function is
156 similar to gimple_seq_add_stmt, but does not scan the operands.
157 During gimplification, we need to manipulate statement sequences
158 before the def/use vectors have been constructed. */
161 gimplify_seq_add_stmt (gimple_seq *seq_p, gimple gs)
163 gimple_stmt_iterator si;
169 *seq_p = gimple_seq_alloc ();
171 si = gsi_last (*seq_p);
173 gsi_insert_after_without_update (&si, gs, GSI_NEW_STMT);
176 /* Append sequence SRC to the end of sequence *DST_P. If *DST_P is
177 NULL, a new sequence is allocated. This function is
178 similar to gimple_seq_add_seq, but does not scan the operands.
179 During gimplification, we need to manipulate statement sequences
180 before the def/use vectors have been constructed. */
183 gimplify_seq_add_seq (gimple_seq *dst_p, gimple_seq src)
185 gimple_stmt_iterator si;
191 *dst_p = gimple_seq_alloc ();
193 si = gsi_last (*dst_p);
194 gsi_insert_seq_after_without_update (&si, src, GSI_NEW_STMT);
197 /* Set up a context for the gimplifier. */
200 push_gimplify_context (struct gimplify_ctx *c)
202 memset (c, '\0', sizeof (*c));
203 c->prev_context = gimplify_ctxp;
207 /* Tear down a context for the gimplifier. If BODY is non-null, then
208 put the temporaries into the outer BIND_EXPR. Otherwise, put them
211 BODY is not a sequence, but the first tuple in a sequence. */
214 pop_gimplify_context (gimple body)
216 struct gimplify_ctx *c = gimplify_ctxp;
218 gcc_assert (c && (c->bind_expr_stack == NULL
219 || VEC_empty (gimple, c->bind_expr_stack)));
220 VEC_free (gimple, heap, c->bind_expr_stack);
221 gimplify_ctxp = c->prev_context;
224 declare_vars (c->temps, body, false);
226 record_vars (c->temps);
229 htab_delete (c->temp_htab);
233 gimple_push_bind_expr (gimple gimple_bind)
235 if (gimplify_ctxp->bind_expr_stack == NULL)
236 gimplify_ctxp->bind_expr_stack = VEC_alloc (gimple, heap, 8);
237 VEC_safe_push (gimple, heap, gimplify_ctxp->bind_expr_stack, gimple_bind);
241 gimple_pop_bind_expr (void)
243 VEC_pop (gimple, gimplify_ctxp->bind_expr_stack);
247 gimple_current_bind_expr (void)
249 return VEC_last (gimple, gimplify_ctxp->bind_expr_stack);
252 /* Return the stack GIMPLE_BINDs created during gimplification. */
255 gimple_bind_expr_stack (void)
257 return gimplify_ctxp->bind_expr_stack;
260 /* Returns true iff there is a COND_EXPR between us and the innermost
261 CLEANUP_POINT_EXPR. This info is used by gimple_push_cleanup. */
264 gimple_conditional_context (void)
266 return gimplify_ctxp->conditions > 0;
269 /* Note that we've entered a COND_EXPR. */
272 gimple_push_condition (void)
274 #ifdef ENABLE_GIMPLE_CHECKING
275 if (gimplify_ctxp->conditions == 0)
276 gcc_assert (gimple_seq_empty_p (gimplify_ctxp->conditional_cleanups));
278 ++(gimplify_ctxp->conditions);
281 /* Note that we've left a COND_EXPR. If we're back at unconditional scope
282 now, add any conditional cleanups we've seen to the prequeue. */
285 gimple_pop_condition (gimple_seq *pre_p)
287 int conds = --(gimplify_ctxp->conditions);
289 gcc_assert (conds >= 0);
292 gimplify_seq_add_seq (pre_p, gimplify_ctxp->conditional_cleanups);
293 gimplify_ctxp->conditional_cleanups = NULL;
297 /* A stable comparison routine for use with splay trees and DECLs. */
300 splay_tree_compare_decl_uid (splay_tree_key xa, splay_tree_key xb)
305 return DECL_UID (a) - DECL_UID (b);
308 /* Create a new omp construct that deals with variable remapping. */
310 static struct gimplify_omp_ctx *
311 new_omp_context (enum omp_region_type region_type)
313 struct gimplify_omp_ctx *c;
315 c = XCNEW (struct gimplify_omp_ctx);
316 c->outer_context = gimplify_omp_ctxp;
317 c->variables = splay_tree_new (splay_tree_compare_decl_uid, 0, 0);
318 c->privatized_types = pointer_set_create ();
319 c->location = input_location;
320 c->region_type = region_type;
321 if (region_type != ORT_TASK)
322 c->default_kind = OMP_CLAUSE_DEFAULT_SHARED;
324 c->default_kind = OMP_CLAUSE_DEFAULT_UNSPECIFIED;
329 /* Destroy an omp construct that deals with variable remapping. */
332 delete_omp_context (struct gimplify_omp_ctx *c)
334 splay_tree_delete (c->variables);
335 pointer_set_destroy (c->privatized_types);
339 static void omp_add_variable (struct gimplify_omp_ctx *, tree, unsigned int);
340 static bool omp_notice_variable (struct gimplify_omp_ctx *, tree, bool);
342 /* A subroutine of append_to_statement_list{,_force}. T is not NULL. */
345 append_to_statement_list_1 (tree t, tree *list_p)
348 tree_stmt_iterator i;
352 if (t && TREE_CODE (t) == STATEMENT_LIST)
357 *list_p = list = alloc_stmt_list ();
361 tsi_link_after (&i, t, TSI_CONTINUE_LINKING);
364 /* Add T to the end of the list container pointed to by LIST_P.
365 If T is an expression with no effects, it is ignored. */
368 append_to_statement_list (tree t, tree *list_p)
370 if (t && TREE_SIDE_EFFECTS (t))
371 append_to_statement_list_1 (t, list_p);
374 /* Similar, but the statement is always added, regardless of side effects. */
377 append_to_statement_list_force (tree t, tree *list_p)
380 append_to_statement_list_1 (t, list_p);
383 /* Both gimplify the statement T and append it to *SEQ_P. This function
384 behaves exactly as gimplify_stmt, but you don't have to pass T as a
388 gimplify_and_add (tree t, gimple_seq *seq_p)
390 gimplify_stmt (&t, seq_p);
393 /* Gimplify statement T into sequence *SEQ_P, and return the first
394 tuple in the sequence of generated tuples for this statement.
395 Return NULL if gimplifying T produced no tuples. */
398 gimplify_and_return_first (tree t, gimple_seq *seq_p)
400 gimple_stmt_iterator last = gsi_last (*seq_p);
402 gimplify_and_add (t, seq_p);
404 if (!gsi_end_p (last))
407 return gsi_stmt (last);
410 return gimple_seq_first_stmt (*seq_p);
413 /* Strip off a legitimate source ending from the input string NAME of
414 length LEN. Rather than having to know the names used by all of
415 our front ends, we strip off an ending of a period followed by
416 up to five characters. (Java uses ".class".) */
419 remove_suffix (char *name, int len)
423 for (i = 2; i < 8 && len > i; i++)
425 if (name[len - i] == '.')
427 name[len - i] = '\0';
433 /* Create a new temporary name with PREFIX. Returns an identifier. */
435 static GTY(()) unsigned int tmp_var_id_num;
438 create_tmp_var_name (const char *prefix)
444 char *preftmp = ASTRDUP (prefix);
446 remove_suffix (preftmp, strlen (preftmp));
450 ASM_FORMAT_PRIVATE_NAME (tmp_name, prefix ? prefix : "T", tmp_var_id_num++);
451 return get_identifier (tmp_name);
455 /* Create a new temporary variable declaration of type TYPE.
456 Does NOT push it into the current binding. */
459 create_tmp_var_raw (tree type, const char *prefix)
464 /* Make the type of the variable writable. */
465 new_type = build_type_variant (type, 0, 0);
466 TYPE_ATTRIBUTES (new_type) = TYPE_ATTRIBUTES (type);
468 tmp_var = build_decl (input_location,
469 VAR_DECL, prefix ? create_tmp_var_name (prefix) : NULL,
472 /* The variable was declared by the compiler. */
473 DECL_ARTIFICIAL (tmp_var) = 1;
474 /* And we don't want debug info for it. */
475 DECL_IGNORED_P (tmp_var) = 1;
477 /* Make the variable writable. */
478 TREE_READONLY (tmp_var) = 0;
480 DECL_EXTERNAL (tmp_var) = 0;
481 TREE_STATIC (tmp_var) = 0;
482 TREE_USED (tmp_var) = 1;
487 /* Create a new temporary variable declaration of type TYPE. DOES push the
488 variable into the current binding. Further, assume that this is called
489 only from gimplification or optimization, at which point the creation of
490 certain types are bugs. */
493 create_tmp_var (tree type, const char *prefix)
497 /* We don't allow types that are addressable (meaning we can't make copies),
498 or incomplete. We also used to reject every variable size objects here,
499 but now support those for which a constant upper bound can be obtained.
500 The processing for variable sizes is performed in gimple_add_tmp_var,
501 point at which it really matters and possibly reached via paths not going
502 through this function, e.g. after direct calls to create_tmp_var_raw. */
503 gcc_assert (!TREE_ADDRESSABLE (type) && COMPLETE_TYPE_P (type));
505 tmp_var = create_tmp_var_raw (type, prefix);
506 gimple_add_tmp_var (tmp_var);
510 /* Create a new temporary variable declaration of type TYPE by calling
511 create_tmp_var and if TYPE is a vector or a complex number, mark the new
512 temporary as gimple register. */
515 create_tmp_reg (tree type, const char *prefix)
519 tmp = create_tmp_var (type, prefix);
520 if (TREE_CODE (type) == COMPLEX_TYPE
521 || TREE_CODE (type) == VECTOR_TYPE)
522 DECL_GIMPLE_REG_P (tmp) = 1;
527 /* Create a temporary with a name derived from VAL. Subroutine of
528 lookup_tmp_var; nobody else should call this function. */
531 create_tmp_from_val (tree val)
533 return create_tmp_var (TREE_TYPE (val), get_name (val));
536 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
537 an existing expression temporary. */
540 lookup_tmp_var (tree val, bool is_formal)
544 /* If not optimizing, never really reuse a temporary. local-alloc
545 won't allocate any variable that is used in more than one basic
546 block, which means it will go into memory, causing much extra
547 work in reload and final and poorer code generation, outweighing
548 the extra memory allocation here. */
549 if (!optimize || !is_formal || TREE_SIDE_EFFECTS (val))
550 ret = create_tmp_from_val (val);
557 if (gimplify_ctxp->temp_htab == NULL)
558 gimplify_ctxp->temp_htab
559 = htab_create (1000, gimple_tree_hash, gimple_tree_eq, free);
560 slot = htab_find_slot (gimplify_ctxp->temp_htab, (void *)&elt, INSERT);
563 elt_p = XNEW (elt_t);
565 elt_p->temp = ret = create_tmp_from_val (val);
566 *slot = (void *) elt_p;
570 elt_p = (elt_t *) *slot;
579 /* Return true if T is a CALL_EXPR or an expression that can be
580 assignmed to a temporary. Note that this predicate should only be
581 used during gimplification. See the rationale for this in
582 gimplify_modify_expr. */
585 is_gimple_reg_rhs_or_call (tree t)
587 return (get_gimple_rhs_class (TREE_CODE (t)) != GIMPLE_INVALID_RHS
588 || TREE_CODE (t) == CALL_EXPR);
591 /* Return true if T is a valid memory RHS or a CALL_EXPR. Note that
592 this predicate should only be used during gimplification. See the
593 rationale for this in gimplify_modify_expr. */
596 is_gimple_mem_rhs_or_call (tree t)
598 /* If we're dealing with a renamable type, either source or dest must be
599 a renamed variable. */
600 if (is_gimple_reg_type (TREE_TYPE (t)))
601 return is_gimple_val (t);
603 return (is_gimple_val (t) || is_gimple_lvalue (t)
604 || TREE_CODE (t) == CALL_EXPR);
607 /* Helper for get_formal_tmp_var and get_initialized_tmp_var. */
610 internal_get_tmp_var (tree val, gimple_seq *pre_p, gimple_seq *post_p,
615 /* Notice that we explicitly allow VAL to be a CALL_EXPR so that we
616 can create an INIT_EXPR and convert it into a GIMPLE_CALL below. */
617 gimplify_expr (&val, pre_p, post_p, is_gimple_reg_rhs_or_call,
620 t = lookup_tmp_var (val, is_formal);
623 && (TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
624 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE))
625 DECL_GIMPLE_REG_P (t) = 1;
627 mod = build2 (INIT_EXPR, TREE_TYPE (t), t, unshare_expr (val));
629 if (EXPR_HAS_LOCATION (val))
630 SET_EXPR_LOCATION (mod, EXPR_LOCATION (val));
632 SET_EXPR_LOCATION (mod, input_location);
634 /* gimplify_modify_expr might want to reduce this further. */
635 gimplify_and_add (mod, pre_p);
638 /* If we're gimplifying into ssa, gimplify_modify_expr will have
639 given our temporary an SSA name. Find and return it. */
640 if (gimplify_ctxp->into_ssa)
642 gimple last = gimple_seq_last_stmt (*pre_p);
643 t = gimple_get_lhs (last);
649 /* Returns a formal temporary variable initialized with VAL. PRE_P is as
650 in gimplify_expr. Only use this function if:
652 1) The value of the unfactored expression represented by VAL will not
653 change between the initialization and use of the temporary, and
654 2) The temporary will not be otherwise modified.
656 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
657 and #2 means it is inappropriate for && temps.
659 For other cases, use get_initialized_tmp_var instead. */
662 get_formal_tmp_var (tree val, gimple_seq *pre_p)
664 return internal_get_tmp_var (val, pre_p, NULL, true);
667 /* Returns a temporary variable initialized with VAL. PRE_P and POST_P
668 are as in gimplify_expr. */
671 get_initialized_tmp_var (tree val, gimple_seq *pre_p, gimple_seq *post_p)
673 return internal_get_tmp_var (val, pre_p, post_p, false);
676 /* Declares all the variables in VARS in SCOPE. If DEBUG_INFO is
677 true, generate debug info for them; otherwise don't. */
680 declare_vars (tree vars, gimple scope, bool debug_info)
687 gcc_assert (gimple_code (scope) == GIMPLE_BIND);
689 temps = nreverse (last);
691 block = gimple_bind_block (scope);
692 gcc_assert (!block || TREE_CODE (block) == BLOCK);
693 if (!block || !debug_info)
695 TREE_CHAIN (last) = gimple_bind_vars (scope);
696 gimple_bind_set_vars (scope, temps);
700 /* We need to attach the nodes both to the BIND_EXPR and to its
701 associated BLOCK for debugging purposes. The key point here
702 is that the BLOCK_VARS of the BIND_EXPR_BLOCK of a BIND_EXPR
703 is a subchain of the BIND_EXPR_VARS of the BIND_EXPR. */
704 if (BLOCK_VARS (block))
705 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), temps);
708 gimple_bind_set_vars (scope,
709 chainon (gimple_bind_vars (scope), temps));
710 BLOCK_VARS (block) = temps;
716 /* For VAR a VAR_DECL of variable size, try to find a constant upper bound
717 for the size and adjust DECL_SIZE/DECL_SIZE_UNIT accordingly. Abort if
718 no such upper bound can be obtained. */
721 force_constant_size (tree var)
723 /* The only attempt we make is by querying the maximum size of objects
724 of the variable's type. */
726 HOST_WIDE_INT max_size;
728 gcc_assert (TREE_CODE (var) == VAR_DECL);
730 max_size = max_int_size_in_bytes (TREE_TYPE (var));
732 gcc_assert (max_size >= 0);
735 = build_int_cst (TREE_TYPE (DECL_SIZE_UNIT (var)), max_size);
737 = build_int_cst (TREE_TYPE (DECL_SIZE (var)), max_size * BITS_PER_UNIT);
741 gimple_add_tmp_var (tree tmp)
743 gcc_assert (!TREE_CHAIN (tmp) && !DECL_SEEN_IN_BIND_EXPR_P (tmp));
745 /* Later processing assumes that the object size is constant, which might
746 not be true at this point. Force the use of a constant upper bound in
748 if (!host_integerp (DECL_SIZE_UNIT (tmp), 1))
749 force_constant_size (tmp);
751 DECL_CONTEXT (tmp) = current_function_decl;
752 DECL_SEEN_IN_BIND_EXPR_P (tmp) = 1;
756 TREE_CHAIN (tmp) = gimplify_ctxp->temps;
757 gimplify_ctxp->temps = tmp;
759 /* Mark temporaries local within the nearest enclosing parallel. */
760 if (gimplify_omp_ctxp)
762 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
763 while (ctx && ctx->region_type == ORT_WORKSHARE)
764 ctx = ctx->outer_context;
766 omp_add_variable (ctx, tmp, GOVD_LOCAL | GOVD_SEEN);
775 /* This case is for nested functions. We need to expose the locals
777 body_seq = gimple_body (current_function_decl);
778 declare_vars (tmp, gimple_seq_first_stmt (body_seq), false);
782 /* Determines whether to assign a location to the statement GS. */
785 should_carry_location_p (gimple gs)
787 /* Don't emit a line note for a label. We particularly don't want to
788 emit one for the break label, since it doesn't actually correspond
789 to the beginning of the loop/switch. */
790 if (gimple_code (gs) == GIMPLE_LABEL)
797 /* Return true if a location should not be emitted for this statement
798 by annotate_one_with_location. */
801 gimple_do_not_emit_location_p (gimple g)
803 return gimple_plf (g, GF_PLF_1);
806 /* Mark statement G so a location will not be emitted by
807 annotate_one_with_location. */
810 gimple_set_do_not_emit_location (gimple g)
812 /* The PLF flags are initialized to 0 when a new tuple is created,
813 so no need to initialize it anywhere. */
814 gimple_set_plf (g, GF_PLF_1, true);
817 /* Set the location for gimple statement GS to LOCATION. */
820 annotate_one_with_location (gimple gs, location_t location)
822 if (!gimple_has_location (gs)
823 && !gimple_do_not_emit_location_p (gs)
824 && should_carry_location_p (gs))
825 gimple_set_location (gs, location);
829 /* Set LOCATION for all the statements after iterator GSI in sequence
830 SEQ. If GSI is pointing to the end of the sequence, start with the
831 first statement in SEQ. */
834 annotate_all_with_location_after (gimple_seq seq, gimple_stmt_iterator gsi,
838 gsi = gsi_start (seq);
842 for (; !gsi_end_p (gsi); gsi_next (&gsi))
843 annotate_one_with_location (gsi_stmt (gsi), location);
847 /* Set the location for all the statements in a sequence STMT_P to LOCATION. */
850 annotate_all_with_location (gimple_seq stmt_p, location_t location)
852 gimple_stmt_iterator i;
854 if (gimple_seq_empty_p (stmt_p))
857 for (i = gsi_start (stmt_p); !gsi_end_p (i); gsi_next (&i))
859 gimple gs = gsi_stmt (i);
860 annotate_one_with_location (gs, location);
865 /* Similar to copy_tree_r() but do not copy SAVE_EXPR or TARGET_EXPR nodes.
866 These nodes model computations that should only be done once. If we
867 were to unshare something like SAVE_EXPR(i++), the gimplification
868 process would create wrong code. */
871 mostly_copy_tree_r (tree *tp, int *walk_subtrees, void *data)
873 enum tree_code code = TREE_CODE (*tp);
874 /* Don't unshare types, decls, constants and SAVE_EXPR nodes. */
875 if (TREE_CODE_CLASS (code) == tcc_type
876 || TREE_CODE_CLASS (code) == tcc_declaration
877 || TREE_CODE_CLASS (code) == tcc_constant
878 || code == SAVE_EXPR || code == TARGET_EXPR
879 /* We can't do anything sensible with a BLOCK used as an expression,
880 but we also can't just die when we see it because of non-expression
881 uses. So just avert our eyes and cross our fingers. Silly Java. */
886 gcc_assert (code != BIND_EXPR);
887 copy_tree_r (tp, walk_subtrees, data);
893 /* Callback for walk_tree to unshare most of the shared trees rooted at
894 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
895 then *TP is deep copied by calling copy_tree_r.
897 This unshares the same trees as copy_tree_r with the exception of
898 SAVE_EXPR nodes. These nodes model computations that should only be
899 done once. If we were to unshare something like SAVE_EXPR(i++), the
900 gimplification process would create wrong code. */
903 copy_if_shared_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
904 void *data ATTRIBUTE_UNUSED)
907 enum tree_code code = TREE_CODE (t);
909 /* Skip types, decls, and constants. But we do want to look at their
910 types and the bounds of types. Mark them as visited so we properly
911 unmark their subtrees on the unmark pass. If we've already seen them,
912 don't look down further. */
913 if (TREE_CODE_CLASS (code) == tcc_type
914 || TREE_CODE_CLASS (code) == tcc_declaration
915 || TREE_CODE_CLASS (code) == tcc_constant)
917 if (TREE_VISITED (t))
920 TREE_VISITED (t) = 1;
923 /* If this node has been visited already, unshare it and don't look
925 else if (TREE_VISITED (t))
927 walk_tree (tp, mostly_copy_tree_r, NULL, NULL);
931 /* Otherwise, mark the tree as visited and keep looking. */
933 TREE_VISITED (t) = 1;
939 unmark_visited_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
940 void *data ATTRIBUTE_UNUSED)
942 if (TREE_VISITED (*tp))
943 TREE_VISITED (*tp) = 0;
950 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
951 bodies of any nested functions if we are unsharing the entire body of
955 unshare_body (tree *body_p, tree fndecl)
957 struct cgraph_node *cgn = cgraph_node (fndecl);
959 walk_tree (body_p, copy_if_shared_r, NULL, NULL);
960 if (body_p == &DECL_SAVED_TREE (fndecl))
961 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
962 unshare_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
965 /* Likewise, but mark all trees as not visited. */
968 unvisit_body (tree *body_p, tree fndecl)
970 struct cgraph_node *cgn = cgraph_node (fndecl);
972 walk_tree (body_p, unmark_visited_r, NULL, NULL);
973 if (body_p == &DECL_SAVED_TREE (fndecl))
974 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
975 unvisit_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
978 /* Unconditionally make an unshared copy of EXPR. This is used when using
979 stored expressions which span multiple functions, such as BINFO_VTABLE,
980 as the normal unsharing process can't tell that they're shared. */
983 unshare_expr (tree expr)
985 walk_tree (&expr, mostly_copy_tree_r, NULL, NULL);
989 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
990 contain statements and have a value. Assign its value to a temporary
991 and give it void_type_node. Returns the temporary, or NULL_TREE if
992 WRAPPER was already void. */
995 voidify_wrapper_expr (tree wrapper, tree temp)
997 tree type = TREE_TYPE (wrapper);
998 if (type && !VOID_TYPE_P (type))
1002 /* Set p to point to the body of the wrapper. Loop until we find
1003 something that isn't a wrapper. */
1004 for (p = &wrapper; p && *p; )
1006 switch (TREE_CODE (*p))
1009 TREE_SIDE_EFFECTS (*p) = 1;
1010 TREE_TYPE (*p) = void_type_node;
1011 /* For a BIND_EXPR, the body is operand 1. */
1012 p = &BIND_EXPR_BODY (*p);
1015 case CLEANUP_POINT_EXPR:
1016 case TRY_FINALLY_EXPR:
1017 case TRY_CATCH_EXPR:
1018 TREE_SIDE_EFFECTS (*p) = 1;
1019 TREE_TYPE (*p) = void_type_node;
1020 p = &TREE_OPERAND (*p, 0);
1023 case STATEMENT_LIST:
1025 tree_stmt_iterator i = tsi_last (*p);
1026 TREE_SIDE_EFFECTS (*p) = 1;
1027 TREE_TYPE (*p) = void_type_node;
1028 p = tsi_end_p (i) ? NULL : tsi_stmt_ptr (i);
1033 /* Advance to the last statement. Set all container types to void. */
1034 for (; TREE_CODE (*p) == COMPOUND_EXPR; p = &TREE_OPERAND (*p, 1))
1036 TREE_SIDE_EFFECTS (*p) = 1;
1037 TREE_TYPE (*p) = void_type_node;
1047 if (p == NULL || IS_EMPTY_STMT (*p))
1051 /* The wrapper is on the RHS of an assignment that we're pushing
1053 gcc_assert (TREE_CODE (temp) == INIT_EXPR
1054 || TREE_CODE (temp) == MODIFY_EXPR);
1055 TREE_OPERAND (temp, 1) = *p;
1060 temp = create_tmp_var (type, "retval");
1061 *p = build2 (INIT_EXPR, type, temp, *p);
1070 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
1071 a temporary through which they communicate. */
1074 build_stack_save_restore (gimple *save, gimple *restore)
1078 *save = gimple_build_call (implicit_built_in_decls[BUILT_IN_STACK_SAVE], 0);
1079 tmp_var = create_tmp_var (ptr_type_node, "saved_stack");
1080 gimple_call_set_lhs (*save, tmp_var);
1082 *restore = gimple_build_call (implicit_built_in_decls[BUILT_IN_STACK_RESTORE],
1086 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
1088 static enum gimplify_status
1089 gimplify_bind_expr (tree *expr_p, gimple_seq *pre_p)
1091 tree bind_expr = *expr_p;
1092 bool old_save_stack = gimplify_ctxp->save_stack;
1097 tree temp = voidify_wrapper_expr (bind_expr, NULL);
1099 /* Mark variables seen in this bind expr. */
1100 for (t = BIND_EXPR_VARS (bind_expr); t ; t = TREE_CHAIN (t))
1102 if (TREE_CODE (t) == VAR_DECL)
1104 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
1106 /* Mark variable as local. */
1107 if (ctx && !is_global_var (t)
1108 && (! DECL_SEEN_IN_BIND_EXPR_P (t)
1109 || splay_tree_lookup (ctx->variables,
1110 (splay_tree_key) t) == NULL))
1111 omp_add_variable (gimplify_omp_ctxp, t, GOVD_LOCAL | GOVD_SEEN);
1113 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
1115 if (DECL_HARD_REGISTER (t) && !is_global_var (t) && cfun)
1116 cfun->has_local_explicit_reg_vars = true;
1119 /* Preliminarily mark non-addressed complex variables as eligible
1120 for promotion to gimple registers. We'll transform their uses
1122 We exclude complex types if not optimizing because they can be
1123 subject to partial stores in GNU C by means of the __real__ and
1124 __imag__ operators and we cannot promote them to total stores
1125 (see gimplify_modify_expr_complex_part). */
1127 && (TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
1128 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
1129 && !TREE_THIS_VOLATILE (t)
1130 && (TREE_CODE (t) == VAR_DECL && !DECL_HARD_REGISTER (t))
1131 && !needs_to_live_in_memory (t))
1132 DECL_GIMPLE_REG_P (t) = 1;
1135 gimple_bind = gimple_build_bind (BIND_EXPR_VARS (bind_expr), NULL,
1136 BIND_EXPR_BLOCK (bind_expr));
1137 gimple_push_bind_expr (gimple_bind);
1139 gimplify_ctxp->save_stack = false;
1141 /* Gimplify the body into the GIMPLE_BIND tuple's body. */
1143 gimplify_stmt (&BIND_EXPR_BODY (bind_expr), &body);
1144 gimple_bind_set_body (gimple_bind, body);
1146 if (gimplify_ctxp->save_stack)
1148 gimple stack_save, stack_restore, gs;
1149 gimple_seq cleanup, new_body;
1151 /* Save stack on entry and restore it on exit. Add a try_finally
1152 block to achieve this. Note that mudflap depends on the
1153 format of the emitted code: see mx_register_decls(). */
1154 build_stack_save_restore (&stack_save, &stack_restore);
1156 cleanup = new_body = NULL;
1157 gimplify_seq_add_stmt (&cleanup, stack_restore);
1158 gs = gimple_build_try (gimple_bind_body (gimple_bind), cleanup,
1159 GIMPLE_TRY_FINALLY);
1161 gimplify_seq_add_stmt (&new_body, stack_save);
1162 gimplify_seq_add_stmt (&new_body, gs);
1163 gimple_bind_set_body (gimple_bind, new_body);
1166 gimplify_ctxp->save_stack = old_save_stack;
1167 gimple_pop_bind_expr ();
1169 gimplify_seq_add_stmt (pre_p, gimple_bind);
1177 *expr_p = NULL_TREE;
1181 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1182 GIMPLE value, it is assigned to a new temporary and the statement is
1183 re-written to return the temporary.
1185 PRE_P points to the sequence where side effects that must happen before
1186 STMT should be stored. */
1188 static enum gimplify_status
1189 gimplify_return_expr (tree stmt, gimple_seq *pre_p)
1192 tree ret_expr = TREE_OPERAND (stmt, 0);
1193 tree result_decl, result;
1195 if (ret_expr == error_mark_node)
1199 || TREE_CODE (ret_expr) == RESULT_DECL
1200 || ret_expr == error_mark_node)
1202 gimple ret = gimple_build_return (ret_expr);
1203 gimple_set_no_warning (ret, TREE_NO_WARNING (stmt));
1204 gimplify_seq_add_stmt (pre_p, ret);
1208 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
1209 result_decl = NULL_TREE;
1212 result_decl = TREE_OPERAND (ret_expr, 0);
1214 /* See through a return by reference. */
1215 if (TREE_CODE (result_decl) == INDIRECT_REF)
1216 result_decl = TREE_OPERAND (result_decl, 0);
1218 gcc_assert ((TREE_CODE (ret_expr) == MODIFY_EXPR
1219 || TREE_CODE (ret_expr) == INIT_EXPR)
1220 && TREE_CODE (result_decl) == RESULT_DECL);
1223 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1224 Recall that aggregate_value_p is FALSE for any aggregate type that is
1225 returned in registers. If we're returning values in registers, then
1226 we don't want to extend the lifetime of the RESULT_DECL, particularly
1227 across another call. In addition, for those aggregates for which
1228 hard_function_value generates a PARALLEL, we'll die during normal
1229 expansion of structure assignments; there's special code in expand_return
1230 to handle this case that does not exist in expand_expr. */
1233 else if (aggregate_value_p (result_decl, TREE_TYPE (current_function_decl)))
1235 if (TREE_CODE (DECL_SIZE (result_decl)) != INTEGER_CST)
1237 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (result_decl)))
1238 gimplify_type_sizes (TREE_TYPE (result_decl), pre_p);
1239 /* Note that we don't use gimplify_vla_decl because the RESULT_DECL
1240 should be effectively allocated by the caller, i.e. all calls to
1241 this function must be subject to the Return Slot Optimization. */
1242 gimplify_one_sizepos (&DECL_SIZE (result_decl), pre_p);
1243 gimplify_one_sizepos (&DECL_SIZE_UNIT (result_decl), pre_p);
1245 result = result_decl;
1247 else if (gimplify_ctxp->return_temp)
1248 result = gimplify_ctxp->return_temp;
1251 result = create_tmp_reg (TREE_TYPE (result_decl), NULL);
1253 /* ??? With complex control flow (usually involving abnormal edges),
1254 we can wind up warning about an uninitialized value for this. Due
1255 to how this variable is constructed and initialized, this is never
1256 true. Give up and never warn. */
1257 TREE_NO_WARNING (result) = 1;
1259 gimplify_ctxp->return_temp = result;
1262 /* Smash the lhs of the MODIFY_EXPR to the temporary we plan to use.
1263 Then gimplify the whole thing. */
1264 if (result != result_decl)
1265 TREE_OPERAND (ret_expr, 0) = result;
1267 gimplify_and_add (TREE_OPERAND (stmt, 0), pre_p);
1269 ret = gimple_build_return (result);
1270 gimple_set_no_warning (ret, TREE_NO_WARNING (stmt));
1271 gimplify_seq_add_stmt (pre_p, ret);
1277 gimplify_vla_decl (tree decl, gimple_seq *seq_p)
1279 /* This is a variable-sized decl. Simplify its size and mark it
1280 for deferred expansion. Note that mudflap depends on the format
1281 of the emitted code: see mx_register_decls(). */
1282 tree t, addr, ptr_type;
1284 gimplify_one_sizepos (&DECL_SIZE (decl), seq_p);
1285 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl), seq_p);
1287 /* All occurrences of this decl in final gimplified code will be
1288 replaced by indirection. Setting DECL_VALUE_EXPR does two
1289 things: First, it lets the rest of the gimplifier know what
1290 replacement to use. Second, it lets the debug info know
1291 where to find the value. */
1292 ptr_type = build_pointer_type (TREE_TYPE (decl));
1293 addr = create_tmp_var (ptr_type, get_name (decl));
1294 DECL_IGNORED_P (addr) = 0;
1295 t = build_fold_indirect_ref (addr);
1296 SET_DECL_VALUE_EXPR (decl, t);
1297 DECL_HAS_VALUE_EXPR_P (decl) = 1;
1299 t = built_in_decls[BUILT_IN_ALLOCA];
1300 t = build_call_expr (t, 1, DECL_SIZE_UNIT (decl));
1301 t = fold_convert (ptr_type, t);
1302 t = build2 (MODIFY_EXPR, TREE_TYPE (addr), addr, t);
1304 gimplify_and_add (t, seq_p);
1306 /* Indicate that we need to restore the stack level when the
1307 enclosing BIND_EXPR is exited. */
1308 gimplify_ctxp->save_stack = true;
1312 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
1313 and initialization explicit. */
1315 static enum gimplify_status
1316 gimplify_decl_expr (tree *stmt_p, gimple_seq *seq_p)
1318 tree stmt = *stmt_p;
1319 tree decl = DECL_EXPR_DECL (stmt);
1321 *stmt_p = NULL_TREE;
1323 if (TREE_TYPE (decl) == error_mark_node)
1326 if ((TREE_CODE (decl) == TYPE_DECL
1327 || TREE_CODE (decl) == VAR_DECL)
1328 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl)))
1329 gimplify_type_sizes (TREE_TYPE (decl), seq_p);
1331 if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl))
1333 tree init = DECL_INITIAL (decl);
1335 if (TREE_CODE (DECL_SIZE_UNIT (decl)) != INTEGER_CST
1336 || (!TREE_STATIC (decl)
1337 && flag_stack_check == GENERIC_STACK_CHECK
1338 && compare_tree_int (DECL_SIZE_UNIT (decl),
1339 STACK_CHECK_MAX_VAR_SIZE) > 0))
1340 gimplify_vla_decl (decl, seq_p);
1342 if (init && init != error_mark_node)
1344 if (!TREE_STATIC (decl))
1346 DECL_INITIAL (decl) = NULL_TREE;
1347 init = build2 (INIT_EXPR, void_type_node, decl, init);
1348 gimplify_and_add (init, seq_p);
1352 /* We must still examine initializers for static variables
1353 as they may contain a label address. */
1354 walk_tree (&init, force_labels_r, NULL, NULL);
1357 /* Some front ends do not explicitly declare all anonymous
1358 artificial variables. We compensate here by declaring the
1359 variables, though it would be better if the front ends would
1360 explicitly declare them. */
1361 if (!DECL_SEEN_IN_BIND_EXPR_P (decl)
1362 && DECL_ARTIFICIAL (decl) && DECL_NAME (decl) == NULL_TREE)
1363 gimple_add_tmp_var (decl);
1369 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1370 and replacing the LOOP_EXPR with goto, but if the loop contains an
1371 EXIT_EXPR, we need to append a label for it to jump to. */
1373 static enum gimplify_status
1374 gimplify_loop_expr (tree *expr_p, gimple_seq *pre_p)
1376 tree saved_label = gimplify_ctxp->exit_label;
1377 tree start_label = create_artificial_label (UNKNOWN_LOCATION);
1379 gimplify_seq_add_stmt (pre_p, gimple_build_label (start_label));
1381 gimplify_ctxp->exit_label = NULL_TREE;
1383 gimplify_and_add (LOOP_EXPR_BODY (*expr_p), pre_p);
1385 gimplify_seq_add_stmt (pre_p, gimple_build_goto (start_label));
1387 if (gimplify_ctxp->exit_label)
1388 gimplify_seq_add_stmt (pre_p, gimple_build_label (gimplify_ctxp->exit_label));
1390 gimplify_ctxp->exit_label = saved_label;
1396 /* Gimplifies a statement list onto a sequence. These may be created either
1397 by an enlightened front-end, or by shortcut_cond_expr. */
1399 static enum gimplify_status
1400 gimplify_statement_list (tree *expr_p, gimple_seq *pre_p)
1402 tree temp = voidify_wrapper_expr (*expr_p, NULL);
1404 tree_stmt_iterator i = tsi_start (*expr_p);
1406 while (!tsi_end_p (i))
1408 gimplify_stmt (tsi_stmt_ptr (i), pre_p);
1421 /* Compare two case labels. Because the front end should already have
1422 made sure that case ranges do not overlap, it is enough to only compare
1423 the CASE_LOW values of each case label. */
1426 compare_case_labels (const void *p1, const void *p2)
1428 const_tree const case1 = *(const_tree const*)p1;
1429 const_tree const case2 = *(const_tree const*)p2;
1431 /* The 'default' case label always goes first. */
1432 if (!CASE_LOW (case1))
1434 else if (!CASE_LOW (case2))
1437 return tree_int_cst_compare (CASE_LOW (case1), CASE_LOW (case2));
1441 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1444 sort_case_labels (VEC(tree,heap)* label_vec)
1446 size_t len = VEC_length (tree, label_vec);
1447 qsort (VEC_address (tree, label_vec), len, sizeof (tree),
1448 compare_case_labels);
1452 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1455 static enum gimplify_status
1456 gimplify_switch_expr (tree *expr_p, gimple_seq *pre_p)
1458 tree switch_expr = *expr_p;
1459 gimple_seq switch_body_seq = NULL;
1460 enum gimplify_status ret;
1462 ret = gimplify_expr (&SWITCH_COND (switch_expr), pre_p, NULL, is_gimple_val,
1464 if (ret == GS_ERROR || ret == GS_UNHANDLED)
1467 if (SWITCH_BODY (switch_expr))
1469 VEC (tree,heap) *labels;
1470 VEC (tree,heap) *saved_labels;
1471 tree default_case = NULL_TREE;
1473 gimple gimple_switch;
1475 /* If someone can be bothered to fill in the labels, they can
1476 be bothered to null out the body too. */
1477 gcc_assert (!SWITCH_LABELS (switch_expr));
1479 /* save old labels, get new ones from body, then restore the old
1480 labels. Save all the things from the switch body to append after. */
1481 saved_labels = gimplify_ctxp->case_labels;
1482 gimplify_ctxp->case_labels = VEC_alloc (tree, heap, 8);
1484 gimplify_stmt (&SWITCH_BODY (switch_expr), &switch_body_seq);
1485 labels = gimplify_ctxp->case_labels;
1486 gimplify_ctxp->case_labels = saved_labels;
1489 while (i < VEC_length (tree, labels))
1491 tree elt = VEC_index (tree, labels, i);
1492 tree low = CASE_LOW (elt);
1493 bool remove_element = FALSE;
1497 /* Discard empty ranges. */
1498 tree high = CASE_HIGH (elt);
1499 if (high && tree_int_cst_lt (high, low))
1500 remove_element = TRUE;
1504 /* The default case must be the last label in the list. */
1505 gcc_assert (!default_case);
1507 remove_element = TRUE;
1511 VEC_ordered_remove (tree, labels, i);
1517 if (!VEC_empty (tree, labels))
1518 sort_case_labels (labels);
1522 tree type = TREE_TYPE (switch_expr);
1524 /* If the switch has no default label, add one, so that we jump
1525 around the switch body. If the labels already cover the whole
1526 range of type, add the default label pointing to one of the
1528 if (type == void_type_node)
1529 type = TREE_TYPE (SWITCH_COND (switch_expr));
1531 && INTEGRAL_TYPE_P (type)
1532 && TYPE_MIN_VALUE (type)
1533 && TYPE_MAX_VALUE (type)
1534 && tree_int_cst_equal (CASE_LOW (VEC_index (tree, labels, 0)),
1535 TYPE_MIN_VALUE (type)))
1537 tree low, high = CASE_HIGH (VEC_index (tree, labels, len - 1));
1539 high = CASE_LOW (VEC_index (tree, labels, len - 1));
1540 if (tree_int_cst_equal (high, TYPE_MAX_VALUE (type)))
1542 for (i = 1; i < len; i++)
1544 high = CASE_LOW (VEC_index (tree, labels, i));
1545 low = CASE_HIGH (VEC_index (tree, labels, i - 1));
1547 low = CASE_LOW (VEC_index (tree, labels, i - 1));
1548 if ((TREE_INT_CST_LOW (low) + 1
1549 != TREE_INT_CST_LOW (high))
1550 || (TREE_INT_CST_HIGH (low)
1551 + (TREE_INT_CST_LOW (high) == 0)
1552 != TREE_INT_CST_HIGH (high)))
1556 default_case = build3 (CASE_LABEL_EXPR, void_type_node,
1557 NULL_TREE, NULL_TREE,
1558 CASE_LABEL (VEC_index (tree,
1568 = build3 (CASE_LABEL_EXPR, void_type_node,
1569 NULL_TREE, NULL_TREE,
1570 create_artificial_label (UNKNOWN_LOCATION));
1571 new_default = gimple_build_label (CASE_LABEL (default_case));
1572 gimplify_seq_add_stmt (&switch_body_seq, new_default);
1576 gimple_switch = gimple_build_switch_vec (SWITCH_COND (switch_expr),
1577 default_case, labels);
1578 gimplify_seq_add_stmt (pre_p, gimple_switch);
1579 gimplify_seq_add_seq (pre_p, switch_body_seq);
1580 VEC_free(tree, heap, labels);
1583 gcc_assert (SWITCH_LABELS (switch_expr));
1589 static enum gimplify_status
1590 gimplify_case_label_expr (tree *expr_p, gimple_seq *pre_p)
1592 struct gimplify_ctx *ctxp;
1593 gimple gimple_label;
1595 /* Invalid OpenMP programs can play Duff's Device type games with
1596 #pragma omp parallel. At least in the C front end, we don't
1597 detect such invalid branches until after gimplification. */
1598 for (ctxp = gimplify_ctxp; ; ctxp = ctxp->prev_context)
1599 if (ctxp->case_labels)
1602 gimple_label = gimple_build_label (CASE_LABEL (*expr_p));
1603 VEC_safe_push (tree, heap, ctxp->case_labels, *expr_p);
1604 gimplify_seq_add_stmt (pre_p, gimple_label);
1609 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1613 build_and_jump (tree *label_p)
1615 if (label_p == NULL)
1616 /* If there's nowhere to jump, just fall through. */
1619 if (*label_p == NULL_TREE)
1621 tree label = create_artificial_label (UNKNOWN_LOCATION);
1625 return build1 (GOTO_EXPR, void_type_node, *label_p);
1628 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1629 This also involves building a label to jump to and communicating it to
1630 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1632 static enum gimplify_status
1633 gimplify_exit_expr (tree *expr_p)
1635 tree cond = TREE_OPERAND (*expr_p, 0);
1638 expr = build_and_jump (&gimplify_ctxp->exit_label);
1639 expr = build3 (COND_EXPR, void_type_node, cond, expr, NULL_TREE);
1645 /* A helper function to be called via walk_tree. Mark all labels under *TP
1646 as being forced. To be called for DECL_INITIAL of static variables. */
1649 force_labels_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
1653 if (TREE_CODE (*tp) == LABEL_DECL)
1654 FORCED_LABEL (*tp) = 1;
1659 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1660 different from its canonical type, wrap the whole thing inside a
1661 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1664 The canonical type of a COMPONENT_REF is the type of the field being
1665 referenced--unless the field is a bit-field which can be read directly
1666 in a smaller mode, in which case the canonical type is the
1667 sign-appropriate type corresponding to that mode. */
1670 canonicalize_component_ref (tree *expr_p)
1672 tree expr = *expr_p;
1675 gcc_assert (TREE_CODE (expr) == COMPONENT_REF);
1677 if (INTEGRAL_TYPE_P (TREE_TYPE (expr)))
1678 type = TREE_TYPE (get_unwidened (expr, NULL_TREE));
1680 type = TREE_TYPE (TREE_OPERAND (expr, 1));
1682 /* One could argue that all the stuff below is not necessary for
1683 the non-bitfield case and declare it a FE error if type
1684 adjustment would be needed. */
1685 if (TREE_TYPE (expr) != type)
1687 #ifdef ENABLE_TYPES_CHECKING
1688 tree old_type = TREE_TYPE (expr);
1692 /* We need to preserve qualifiers and propagate them from
1694 type_quals = TYPE_QUALS (type)
1695 | TYPE_QUALS (TREE_TYPE (TREE_OPERAND (expr, 0)));
1696 if (TYPE_QUALS (type) != type_quals)
1697 type = build_qualified_type (TYPE_MAIN_VARIANT (type), type_quals);
1699 /* Set the type of the COMPONENT_REF to the underlying type. */
1700 TREE_TYPE (expr) = type;
1702 #ifdef ENABLE_TYPES_CHECKING
1703 /* It is now a FE error, if the conversion from the canonical
1704 type to the original expression type is not useless. */
1705 gcc_assert (useless_type_conversion_p (old_type, type));
1710 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1711 to foo, embed that change in the ADDR_EXPR by converting
1716 where L is the lower bound. For simplicity, only do this for constant
1718 The constraint is that the type of &array[L] is trivially convertible
1722 canonicalize_addr_expr (tree *expr_p)
1724 tree expr = *expr_p;
1725 tree addr_expr = TREE_OPERAND (expr, 0);
1726 tree datype, ddatype, pddatype;
1728 /* We simplify only conversions from an ADDR_EXPR to a pointer type. */
1729 if (!POINTER_TYPE_P (TREE_TYPE (expr))
1730 || TREE_CODE (addr_expr) != ADDR_EXPR)
1733 /* The addr_expr type should be a pointer to an array. */
1734 datype = TREE_TYPE (TREE_TYPE (addr_expr));
1735 if (TREE_CODE (datype) != ARRAY_TYPE)
1738 /* The pointer to element type shall be trivially convertible to
1739 the expression pointer type. */
1740 ddatype = TREE_TYPE (datype);
1741 pddatype = build_pointer_type (ddatype);
1742 if (!useless_type_conversion_p (TYPE_MAIN_VARIANT (TREE_TYPE (expr)),
1746 /* The lower bound and element sizes must be constant. */
1747 if (!TYPE_SIZE_UNIT (ddatype)
1748 || TREE_CODE (TYPE_SIZE_UNIT (ddatype)) != INTEGER_CST
1749 || !TYPE_DOMAIN (datype) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype))
1750 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype))) != INTEGER_CST)
1753 /* All checks succeeded. Build a new node to merge the cast. */
1754 *expr_p = build4 (ARRAY_REF, ddatype, TREE_OPERAND (addr_expr, 0),
1755 TYPE_MIN_VALUE (TYPE_DOMAIN (datype)),
1756 NULL_TREE, NULL_TREE);
1757 *expr_p = build1 (ADDR_EXPR, pddatype, *expr_p);
1759 /* We can have stripped a required restrict qualifier above. */
1760 if (!useless_type_conversion_p (TREE_TYPE (expr), TREE_TYPE (*expr_p)))
1761 *expr_p = fold_convert (TREE_TYPE (expr), *expr_p);
1764 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1765 underneath as appropriate. */
1767 static enum gimplify_status
1768 gimplify_conversion (tree *expr_p)
1771 location_t loc = EXPR_LOCATION (*expr_p);
1772 gcc_assert (CONVERT_EXPR_P (*expr_p));
1774 /* Then strip away all but the outermost conversion. */
1775 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p, 0));
1777 /* And remove the outermost conversion if it's useless. */
1778 if (tree_ssa_useless_type_conversion (*expr_p))
1779 *expr_p = TREE_OPERAND (*expr_p, 0);
1781 /* Attempt to avoid NOP_EXPR by producing reference to a subtype.
1782 For example this fold (subclass *)&A into &A->subclass avoiding
1783 a need for statement. */
1784 if (CONVERT_EXPR_P (*expr_p)
1785 && POINTER_TYPE_P (TREE_TYPE (*expr_p))
1786 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p, 0)))
1787 && (tem = maybe_fold_offset_to_address
1788 (EXPR_LOCATION (*expr_p), TREE_OPERAND (*expr_p, 0),
1789 integer_zero_node, TREE_TYPE (*expr_p))) != NULL_TREE)
1792 /* If we still have a conversion at the toplevel,
1793 then canonicalize some constructs. */
1794 if (CONVERT_EXPR_P (*expr_p))
1796 tree sub = TREE_OPERAND (*expr_p, 0);
1798 /* If a NOP conversion is changing the type of a COMPONENT_REF
1799 expression, then canonicalize its type now in order to expose more
1800 redundant conversions. */
1801 if (TREE_CODE (sub) == COMPONENT_REF)
1802 canonicalize_component_ref (&TREE_OPERAND (*expr_p, 0));
1804 /* If a NOP conversion is changing a pointer to array of foo
1805 to a pointer to foo, embed that change in the ADDR_EXPR. */
1806 else if (TREE_CODE (sub) == ADDR_EXPR)
1807 canonicalize_addr_expr (expr_p);
1810 /* If we have a conversion to a non-register type force the
1811 use of a VIEW_CONVERT_EXPR instead. */
1812 if (CONVERT_EXPR_P (*expr_p) && !is_gimple_reg_type (TREE_TYPE (*expr_p)))
1813 *expr_p = fold_build1_loc (loc, VIEW_CONVERT_EXPR, TREE_TYPE (*expr_p),
1814 TREE_OPERAND (*expr_p, 0));
1819 /* Nonlocal VLAs seen in the current function. */
1820 static struct pointer_set_t *nonlocal_vlas;
1822 /* Gimplify a VAR_DECL or PARM_DECL. Returns GS_OK if we expanded a
1823 DECL_VALUE_EXPR, and it's worth re-examining things. */
1825 static enum gimplify_status
1826 gimplify_var_or_parm_decl (tree *expr_p)
1828 tree decl = *expr_p;
1830 /* ??? If this is a local variable, and it has not been seen in any
1831 outer BIND_EXPR, then it's probably the result of a duplicate
1832 declaration, for which we've already issued an error. It would
1833 be really nice if the front end wouldn't leak these at all.
1834 Currently the only known culprit is C++ destructors, as seen
1835 in g++.old-deja/g++.jason/binding.C. */
1836 if (TREE_CODE (decl) == VAR_DECL
1837 && !DECL_SEEN_IN_BIND_EXPR_P (decl)
1838 && !TREE_STATIC (decl) && !DECL_EXTERNAL (decl)
1839 && decl_function_context (decl) == current_function_decl)
1841 gcc_assert (errorcount || sorrycount);
1845 /* When within an OpenMP context, notice uses of variables. */
1846 if (gimplify_omp_ctxp && omp_notice_variable (gimplify_omp_ctxp, decl, true))
1849 /* If the decl is an alias for another expression, substitute it now. */
1850 if (DECL_HAS_VALUE_EXPR_P (decl))
1852 tree value_expr = DECL_VALUE_EXPR (decl);
1854 /* For referenced nonlocal VLAs add a decl for debugging purposes
1855 to the current function. */
1856 if (TREE_CODE (decl) == VAR_DECL
1857 && TREE_CODE (DECL_SIZE_UNIT (decl)) != INTEGER_CST
1858 && nonlocal_vlas != NULL
1859 && TREE_CODE (value_expr) == INDIRECT_REF
1860 && TREE_CODE (TREE_OPERAND (value_expr, 0)) == VAR_DECL
1861 && decl_function_context (decl) != current_function_decl)
1863 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
1864 while (ctx && ctx->region_type == ORT_WORKSHARE)
1865 ctx = ctx->outer_context;
1866 if (!ctx && !pointer_set_insert (nonlocal_vlas, decl))
1868 tree copy = copy_node (decl), block;
1870 lang_hooks.dup_lang_specific_decl (copy);
1871 SET_DECL_RTL (copy, NULL_RTX);
1872 TREE_USED (copy) = 1;
1873 block = DECL_INITIAL (current_function_decl);
1874 TREE_CHAIN (copy) = BLOCK_VARS (block);
1875 BLOCK_VARS (block) = copy;
1876 SET_DECL_VALUE_EXPR (copy, unshare_expr (value_expr));
1877 DECL_HAS_VALUE_EXPR_P (copy) = 1;
1881 *expr_p = unshare_expr (value_expr);
1889 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1893 : min_lval '[' val ']'
1895 | compound_lval '[' val ']'
1896 | compound_lval '.' ID
1898 This is not part of the original SIMPLE definition, which separates
1899 array and member references, but it seems reasonable to handle them
1900 together. Also, this way we don't run into problems with union
1901 aliasing; gcc requires that for accesses through a union to alias, the
1902 union reference must be explicit, which was not always the case when we
1903 were splitting up array and member refs.
1905 PRE_P points to the sequence where side effects that must happen before
1906 *EXPR_P should be stored.
1908 POST_P points to the sequence where side effects that must happen after
1909 *EXPR_P should be stored. */
1911 static enum gimplify_status
1912 gimplify_compound_lval (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
1913 fallback_t fallback)
1916 VEC(tree,heap) *stack;
1917 enum gimplify_status ret = GS_ALL_DONE, tret;
1919 location_t loc = EXPR_LOCATION (*expr_p);
1920 tree expr = *expr_p;
1922 /* Create a stack of the subexpressions so later we can walk them in
1923 order from inner to outer. */
1924 stack = VEC_alloc (tree, heap, 10);
1926 /* We can handle anything that get_inner_reference can deal with. */
1927 for (p = expr_p; ; p = &TREE_OPERAND (*p, 0))
1930 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1931 if (TREE_CODE (*p) == INDIRECT_REF)
1932 *p = fold_indirect_ref_loc (loc, *p);
1934 if (handled_component_p (*p))
1936 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
1937 additional COMPONENT_REFs. */
1938 else if ((TREE_CODE (*p) == VAR_DECL || TREE_CODE (*p) == PARM_DECL)
1939 && gimplify_var_or_parm_decl (p) == GS_OK)
1944 VEC_safe_push (tree, heap, stack, *p);
1947 gcc_assert (VEC_length (tree, stack));
1949 /* Now STACK is a stack of pointers to all the refs we've walked through
1950 and P points to the innermost expression.
1952 Java requires that we elaborated nodes in source order. That
1953 means we must gimplify the inner expression followed by each of
1954 the indices, in order. But we can't gimplify the inner
1955 expression until we deal with any variable bounds, sizes, or
1956 positions in order to deal with PLACEHOLDER_EXPRs.
1958 So we do this in three steps. First we deal with the annotations
1959 for any variables in the components, then we gimplify the base,
1960 then we gimplify any indices, from left to right. */
1961 for (i = VEC_length (tree, stack) - 1; i >= 0; i--)
1963 tree t = VEC_index (tree, stack, i);
1965 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
1967 /* Gimplify the low bound and element type size and put them into
1968 the ARRAY_REF. If these values are set, they have already been
1970 if (TREE_OPERAND (t, 2) == NULL_TREE)
1972 tree low = unshare_expr (array_ref_low_bound (t));
1973 if (!is_gimple_min_invariant (low))
1975 TREE_OPERAND (t, 2) = low;
1976 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p,
1977 post_p, is_gimple_reg,
1979 ret = MIN (ret, tret);
1983 if (!TREE_OPERAND (t, 3))
1985 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (t, 0)));
1986 tree elmt_size = unshare_expr (array_ref_element_size (t));
1987 tree factor = size_int (TYPE_ALIGN_UNIT (elmt_type));
1989 /* Divide the element size by the alignment of the element
1991 elmt_size = size_binop_loc (loc, EXACT_DIV_EXPR, elmt_size, factor);
1993 if (!is_gimple_min_invariant (elmt_size))
1995 TREE_OPERAND (t, 3) = elmt_size;
1996 tret = gimplify_expr (&TREE_OPERAND (t, 3), pre_p,
1997 post_p, is_gimple_reg,
1999 ret = MIN (ret, tret);
2003 else if (TREE_CODE (t) == COMPONENT_REF)
2005 /* Set the field offset into T and gimplify it. */
2006 if (!TREE_OPERAND (t, 2))
2008 tree offset = unshare_expr (component_ref_field_offset (t));
2009 tree field = TREE_OPERAND (t, 1);
2011 = size_int (DECL_OFFSET_ALIGN (field) / BITS_PER_UNIT);
2013 /* Divide the offset by its alignment. */
2014 offset = size_binop_loc (loc, EXACT_DIV_EXPR, offset, factor);
2016 if (!is_gimple_min_invariant (offset))
2018 TREE_OPERAND (t, 2) = offset;
2019 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p,
2020 post_p, is_gimple_reg,
2022 ret = MIN (ret, tret);
2028 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
2029 so as to match the min_lval predicate. Failure to do so may result
2030 in the creation of large aggregate temporaries. */
2031 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval,
2032 fallback | fb_lvalue);
2033 ret = MIN (ret, tret);
2035 /* And finally, the indices and operands to BIT_FIELD_REF. During this
2036 loop we also remove any useless conversions. */
2037 for (; VEC_length (tree, stack) > 0; )
2039 tree t = VEC_pop (tree, stack);
2041 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
2043 /* Gimplify the dimension. */
2044 if (!is_gimple_min_invariant (TREE_OPERAND (t, 1)))
2046 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
2047 is_gimple_val, fb_rvalue);
2048 ret = MIN (ret, tret);
2051 else if (TREE_CODE (t) == BIT_FIELD_REF)
2053 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
2054 is_gimple_val, fb_rvalue);
2055 ret = MIN (ret, tret);
2056 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
2057 is_gimple_val, fb_rvalue);
2058 ret = MIN (ret, tret);
2061 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t, 0));
2063 /* The innermost expression P may have originally had
2064 TREE_SIDE_EFFECTS set which would have caused all the outer
2065 expressions in *EXPR_P leading to P to also have had
2066 TREE_SIDE_EFFECTS set. */
2067 recalculate_side_effects (t);
2070 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
2071 if ((fallback & fb_rvalue) && TREE_CODE (*expr_p) == COMPONENT_REF)
2073 canonicalize_component_ref (expr_p);
2076 VEC_free (tree, heap, stack);
2078 gcc_assert (*expr_p == expr || ret != GS_ALL_DONE);
2083 /* Gimplify the self modifying expression pointed to by EXPR_P
2086 PRE_P points to the list where side effects that must happen before
2087 *EXPR_P should be stored.
2089 POST_P points to the list where side effects that must happen after
2090 *EXPR_P should be stored.
2092 WANT_VALUE is nonzero iff we want to use the value of this expression
2093 in another expression. */
2095 static enum gimplify_status
2096 gimplify_self_mod_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
2099 enum tree_code code;
2100 tree lhs, lvalue, rhs, t1;
2101 gimple_seq post = NULL, *orig_post_p = post_p;
2103 enum tree_code arith_code;
2104 enum gimplify_status ret;
2105 location_t loc = EXPR_LOCATION (*expr_p);
2107 code = TREE_CODE (*expr_p);
2109 gcc_assert (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR
2110 || code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR);
2112 /* Prefix or postfix? */
2113 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
2114 /* Faster to treat as prefix if result is not used. */
2115 postfix = want_value;
2119 /* For postfix, make sure the inner expression's post side effects
2120 are executed after side effects from this expression. */
2124 /* Add or subtract? */
2125 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2126 arith_code = PLUS_EXPR;
2128 arith_code = MINUS_EXPR;
2130 /* Gimplify the LHS into a GIMPLE lvalue. */
2131 lvalue = TREE_OPERAND (*expr_p, 0);
2132 ret = gimplify_expr (&lvalue, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
2133 if (ret == GS_ERROR)
2136 /* Extract the operands to the arithmetic operation. */
2138 rhs = TREE_OPERAND (*expr_p, 1);
2140 /* For postfix operator, we evaluate the LHS to an rvalue and then use
2141 that as the result value and in the postqueue operation. We also
2142 make sure to make lvalue a minimal lval, see
2143 gcc.c-torture/execute/20040313-1.c for an example where this matters. */
2146 if (!is_gimple_min_lval (lvalue))
2148 mark_addressable (lvalue);
2149 lvalue = build_fold_addr_expr_loc (input_location, lvalue);
2150 gimplify_expr (&lvalue, pre_p, post_p, is_gimple_val, fb_rvalue);
2151 lvalue = build_fold_indirect_ref_loc (input_location, lvalue);
2153 ret = gimplify_expr (&lhs, pre_p, post_p, is_gimple_val, fb_rvalue);
2154 if (ret == GS_ERROR)
2158 /* For POINTERs increment, use POINTER_PLUS_EXPR. */
2159 if (POINTER_TYPE_P (TREE_TYPE (lhs)))
2161 rhs = fold_convert_loc (loc, sizetype, rhs);
2162 if (arith_code == MINUS_EXPR)
2163 rhs = fold_build1_loc (loc, NEGATE_EXPR, TREE_TYPE (rhs), rhs);
2164 arith_code = POINTER_PLUS_EXPR;
2167 t1 = build2 (arith_code, TREE_TYPE (*expr_p), lhs, rhs);
2171 gimplify_assign (lvalue, t1, orig_post_p);
2172 gimplify_seq_add_seq (orig_post_p, post);
2178 *expr_p = build2 (MODIFY_EXPR, TREE_TYPE (lvalue), lvalue, t1);
2184 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
2187 maybe_with_size_expr (tree *expr_p)
2189 tree expr = *expr_p;
2190 tree type = TREE_TYPE (expr);
2193 /* If we've already wrapped this or the type is error_mark_node, we can't do
2195 if (TREE_CODE (expr) == WITH_SIZE_EXPR
2196 || type == error_mark_node)
2199 /* If the size isn't known or is a constant, we have nothing to do. */
2200 size = TYPE_SIZE_UNIT (type);
2201 if (!size || TREE_CODE (size) == INTEGER_CST)
2204 /* Otherwise, make a WITH_SIZE_EXPR. */
2205 size = unshare_expr (size);
2206 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, expr);
2207 *expr_p = build2 (WITH_SIZE_EXPR, type, expr, size);
2211 /* Helper for gimplify_call_expr. Gimplify a single argument *ARG_P
2212 Store any side-effects in PRE_P. CALL_LOCATION is the location of
2215 static enum gimplify_status
2216 gimplify_arg (tree *arg_p, gimple_seq *pre_p, location_t call_location)
2218 bool (*test) (tree);
2221 /* In general, we allow lvalues for function arguments to avoid
2222 extra overhead of copying large aggregates out of even larger
2223 aggregates into temporaries only to copy the temporaries to
2224 the argument list. Make optimizers happy by pulling out to
2225 temporaries those types that fit in registers. */
2226 if (is_gimple_reg_type (TREE_TYPE (*arg_p)))
2227 test = is_gimple_val, fb = fb_rvalue;
2229 test = is_gimple_lvalue, fb = fb_either;
2231 /* If this is a variable sized type, we must remember the size. */
2232 maybe_with_size_expr (arg_p);
2234 /* FIXME diagnostics: This will mess up gcc.dg/Warray-bounds.c. */
2235 /* Make sure arguments have the same location as the function call
2237 protected_set_expr_location (*arg_p, call_location);
2239 /* There is a sequence point before a function call. Side effects in
2240 the argument list must occur before the actual call. So, when
2241 gimplifying arguments, force gimplify_expr to use an internal
2242 post queue which is then appended to the end of PRE_P. */
2243 return gimplify_expr (arg_p, pre_p, NULL, test, fb);
2247 /* Gimplify the CALL_EXPR node *EXPR_P into the GIMPLE sequence PRE_P.
2248 WANT_VALUE is true if the result of the call is desired. */
2250 static enum gimplify_status
2251 gimplify_call_expr (tree *expr_p, gimple_seq *pre_p, bool want_value)
2253 tree fndecl, parms, p;
2254 enum gimplify_status ret;
2257 bool builtin_va_start_p = FALSE;
2258 location_t loc = EXPR_LOCATION (*expr_p);
2260 gcc_assert (TREE_CODE (*expr_p) == CALL_EXPR);
2262 /* For reliable diagnostics during inlining, it is necessary that
2263 every call_expr be annotated with file and line. */
2264 if (! EXPR_HAS_LOCATION (*expr_p))
2265 SET_EXPR_LOCATION (*expr_p, input_location);
2267 /* This may be a call to a builtin function.
2269 Builtin function calls may be transformed into different
2270 (and more efficient) builtin function calls under certain
2271 circumstances. Unfortunately, gimplification can muck things
2272 up enough that the builtin expanders are not aware that certain
2273 transformations are still valid.
2275 So we attempt transformation/gimplification of the call before
2276 we gimplify the CALL_EXPR. At this time we do not manage to
2277 transform all calls in the same manner as the expanders do, but
2278 we do transform most of them. */
2279 fndecl = get_callee_fndecl (*expr_p);
2280 if (fndecl && DECL_BUILT_IN (fndecl))
2282 tree new_tree = fold_call_expr (input_location, *expr_p, !want_value);
2284 if (new_tree && new_tree != *expr_p)
2286 /* There was a transformation of this call which computes the
2287 same value, but in a more efficient way. Return and try
2293 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
2294 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_VA_START)
2296 builtin_va_start_p = TRUE;
2297 if (call_expr_nargs (*expr_p) < 2)
2299 error ("too few arguments to function %<va_start%>");
2300 *expr_p = build_empty_stmt (EXPR_LOCATION (*expr_p));
2304 if (fold_builtin_next_arg (*expr_p, true))
2306 *expr_p = build_empty_stmt (EXPR_LOCATION (*expr_p));
2312 /* There is a sequence point before the call, so any side effects in
2313 the calling expression must occur before the actual call. Force
2314 gimplify_expr to use an internal post queue. */
2315 ret = gimplify_expr (&CALL_EXPR_FN (*expr_p), pre_p, NULL,
2316 is_gimple_call_addr, fb_rvalue);
2318 nargs = call_expr_nargs (*expr_p);
2320 /* Get argument types for verification. */
2321 fndecl = get_callee_fndecl (*expr_p);
2324 parms = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
2325 else if (POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_FN (*expr_p))))
2326 parms = TYPE_ARG_TYPES (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (*expr_p))));
2328 if (fndecl && DECL_ARGUMENTS (fndecl))
2329 p = DECL_ARGUMENTS (fndecl);
2334 for (i = 0; i < nargs && p; i++, p = TREE_CHAIN (p))
2337 /* If the last argument is __builtin_va_arg_pack () and it is not
2338 passed as a named argument, decrease the number of CALL_EXPR
2339 arguments and set instead the CALL_EXPR_VA_ARG_PACK flag. */
2342 && TREE_CODE (CALL_EXPR_ARG (*expr_p, nargs - 1)) == CALL_EXPR)
2344 tree last_arg = CALL_EXPR_ARG (*expr_p, nargs - 1);
2345 tree last_arg_fndecl = get_callee_fndecl (last_arg);
2348 && TREE_CODE (last_arg_fndecl) == FUNCTION_DECL
2349 && DECL_BUILT_IN_CLASS (last_arg_fndecl) == BUILT_IN_NORMAL
2350 && DECL_FUNCTION_CODE (last_arg_fndecl) == BUILT_IN_VA_ARG_PACK)
2352 tree call = *expr_p;
2355 *expr_p = build_call_array_loc (loc, TREE_TYPE (call),
2356 CALL_EXPR_FN (call),
2357 nargs, CALL_EXPR_ARGP (call));
2359 /* Copy all CALL_EXPR flags, location and block, except
2360 CALL_EXPR_VA_ARG_PACK flag. */
2361 CALL_EXPR_STATIC_CHAIN (*expr_p) = CALL_EXPR_STATIC_CHAIN (call);
2362 CALL_EXPR_TAILCALL (*expr_p) = CALL_EXPR_TAILCALL (call);
2363 CALL_EXPR_RETURN_SLOT_OPT (*expr_p)
2364 = CALL_EXPR_RETURN_SLOT_OPT (call);
2365 CALL_FROM_THUNK_P (*expr_p) = CALL_FROM_THUNK_P (call);
2366 CALL_CANNOT_INLINE_P (*expr_p) = CALL_CANNOT_INLINE_P (call);
2367 SET_EXPR_LOCATION (*expr_p, EXPR_LOCATION (call));
2368 TREE_BLOCK (*expr_p) = TREE_BLOCK (call);
2370 /* Set CALL_EXPR_VA_ARG_PACK. */
2371 CALL_EXPR_VA_ARG_PACK (*expr_p) = 1;
2375 /* Finally, gimplify the function arguments. */
2378 for (i = (PUSH_ARGS_REVERSED ? nargs - 1 : 0);
2379 PUSH_ARGS_REVERSED ? i >= 0 : i < nargs;
2380 PUSH_ARGS_REVERSED ? i-- : i++)
2382 enum gimplify_status t;
2384 /* Avoid gimplifying the second argument to va_start, which needs to
2385 be the plain PARM_DECL. */
2386 if ((i != 1) || !builtin_va_start_p)
2388 t = gimplify_arg (&CALL_EXPR_ARG (*expr_p, i), pre_p,
2389 EXPR_LOCATION (*expr_p));
2397 /* Verify the function result. */
2398 if (want_value && fndecl
2399 && VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fndecl))))
2401 error_at (loc, "using result of function returning %<void%>");
2405 /* Try this again in case gimplification exposed something. */
2406 if (ret != GS_ERROR)
2408 tree new_tree = fold_call_expr (input_location, *expr_p, !want_value);
2410 if (new_tree && new_tree != *expr_p)
2412 /* There was a transformation of this call which computes the
2413 same value, but in a more efficient way. Return and try
2421 *expr_p = error_mark_node;
2425 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2426 decl. This allows us to eliminate redundant or useless
2427 calls to "const" functions. */
2428 if (TREE_CODE (*expr_p) == CALL_EXPR)
2430 int flags = call_expr_flags (*expr_p);
2431 if (flags & (ECF_CONST | ECF_PURE)
2432 /* An infinite loop is considered a side effect. */
2433 && !(flags & (ECF_LOOPING_CONST_OR_PURE)))
2434 TREE_SIDE_EFFECTS (*expr_p) = 0;
2437 /* If the value is not needed by the caller, emit a new GIMPLE_CALL
2438 and clear *EXPR_P. Otherwise, leave *EXPR_P in its gimplified
2439 form and delegate the creation of a GIMPLE_CALL to
2440 gimplify_modify_expr. This is always possible because when
2441 WANT_VALUE is true, the caller wants the result of this call into
2442 a temporary, which means that we will emit an INIT_EXPR in
2443 internal_get_tmp_var which will then be handled by
2444 gimplify_modify_expr. */
2447 /* The CALL_EXPR in *EXPR_P is already in GIMPLE form, so all we
2448 have to do is replicate it as a GIMPLE_CALL tuple. */
2449 call = gimple_build_call_from_tree (*expr_p);
2450 gimplify_seq_add_stmt (pre_p, call);
2451 *expr_p = NULL_TREE;
2457 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2458 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2460 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2461 condition is true or false, respectively. If null, we should generate
2462 our own to skip over the evaluation of this specific expression.
2464 LOCUS is the source location of the COND_EXPR.
2466 This function is the tree equivalent of do_jump.
2468 shortcut_cond_r should only be called by shortcut_cond_expr. */
2471 shortcut_cond_r (tree pred, tree *true_label_p, tree *false_label_p,
2474 tree local_label = NULL_TREE;
2475 tree t, expr = NULL;
2477 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2478 retain the shortcut semantics. Just insert the gotos here;
2479 shortcut_cond_expr will append the real blocks later. */
2480 if (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2482 location_t new_locus;
2484 /* Turn if (a && b) into
2486 if (a); else goto no;
2487 if (b) goto yes; else goto no;
2490 if (false_label_p == NULL)
2491 false_label_p = &local_label;
2493 /* Keep the original source location on the first 'if'. */
2494 t = shortcut_cond_r (TREE_OPERAND (pred, 0), NULL, false_label_p, locus);
2495 append_to_statement_list (t, &expr);
2497 /* Set the source location of the && on the second 'if'. */
2498 new_locus = EXPR_HAS_LOCATION (pred) ? EXPR_LOCATION (pred) : locus;
2499 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p, false_label_p,
2501 append_to_statement_list (t, &expr);
2503 else if (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2505 location_t new_locus;
2507 /* Turn if (a || b) into
2510 if (b) goto yes; else goto no;
2513 if (true_label_p == NULL)
2514 true_label_p = &local_label;
2516 /* Keep the original source location on the first 'if'. */
2517 t = shortcut_cond_r (TREE_OPERAND (pred, 0), true_label_p, NULL, locus);
2518 append_to_statement_list (t, &expr);
2520 /* Set the source location of the || on the second 'if'. */
2521 new_locus = EXPR_HAS_LOCATION (pred) ? EXPR_LOCATION (pred) : locus;
2522 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p, false_label_p,
2524 append_to_statement_list (t, &expr);
2526 else if (TREE_CODE (pred) == COND_EXPR)
2528 location_t new_locus;
2530 /* As long as we're messing with gotos, turn if (a ? b : c) into
2532 if (b) goto yes; else goto no;
2534 if (c) goto yes; else goto no; */
2536 /* Keep the original source location on the first 'if'. Set the source
2537 location of the ? on the second 'if'. */
2538 new_locus = EXPR_HAS_LOCATION (pred) ? EXPR_LOCATION (pred) : locus;
2539 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (pred, 0),
2540 shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2541 false_label_p, locus),
2542 shortcut_cond_r (TREE_OPERAND (pred, 2), true_label_p,
2543 false_label_p, new_locus));
2547 expr = build3 (COND_EXPR, void_type_node, pred,
2548 build_and_jump (true_label_p),
2549 build_and_jump (false_label_p));
2550 SET_EXPR_LOCATION (expr, locus);
2555 t = build1 (LABEL_EXPR, void_type_node, local_label);
2556 append_to_statement_list (t, &expr);
2562 /* Given a conditional expression EXPR with short-circuit boolean
2563 predicates using TRUTH_ANDIF_EXPR or TRUTH_ORIF_EXPR, break the
2564 predicate appart into the equivalent sequence of conditionals. */
2567 shortcut_cond_expr (tree expr)
2569 tree pred = TREE_OPERAND (expr, 0);
2570 tree then_ = TREE_OPERAND (expr, 1);
2571 tree else_ = TREE_OPERAND (expr, 2);
2572 tree true_label, false_label, end_label, t;
2574 tree *false_label_p;
2575 bool emit_end, emit_false, jump_over_else;
2576 bool then_se = then_ && TREE_SIDE_EFFECTS (then_);
2577 bool else_se = else_ && TREE_SIDE_EFFECTS (else_);
2579 /* First do simple transformations. */
2582 /* If there is no 'else', turn
2585 if (a) if (b) then c. */
2586 while (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2588 /* Keep the original source location on the first 'if'. */
2589 location_t locus = EXPR_HAS_LOCATION (expr)
2590 ? EXPR_LOCATION (expr) : input_location;
2591 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2592 /* Set the source location of the && on the second 'if'. */
2593 if (EXPR_HAS_LOCATION (pred))
2594 SET_EXPR_LOCATION (expr, EXPR_LOCATION (pred));
2595 then_ = shortcut_cond_expr (expr);
2596 then_se = then_ && TREE_SIDE_EFFECTS (then_);
2597 pred = TREE_OPERAND (pred, 0);
2598 expr = build3 (COND_EXPR, void_type_node, pred, then_, NULL_TREE);
2599 SET_EXPR_LOCATION (expr, locus);
2605 /* If there is no 'then', turn
2608 if (a); else if (b); else d. */
2609 while (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2611 /* Keep the original source location on the first 'if'. */
2612 location_t locus = EXPR_HAS_LOCATION (expr)
2613 ? EXPR_LOCATION (expr) : input_location;
2614 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2615 /* Set the source location of the || on the second 'if'. */
2616 if (EXPR_HAS_LOCATION (pred))
2617 SET_EXPR_LOCATION (expr, EXPR_LOCATION (pred));
2618 else_ = shortcut_cond_expr (expr);
2619 else_se = else_ && TREE_SIDE_EFFECTS (else_);
2620 pred = TREE_OPERAND (pred, 0);
2621 expr = build3 (COND_EXPR, void_type_node, pred, NULL_TREE, else_);
2622 SET_EXPR_LOCATION (expr, locus);
2626 /* If we're done, great. */
2627 if (TREE_CODE (pred) != TRUTH_ANDIF_EXPR
2628 && TREE_CODE (pred) != TRUTH_ORIF_EXPR)
2631 /* Otherwise we need to mess with gotos. Change
2634 if (a); else goto no;
2637 and recursively gimplify the condition. */
2639 true_label = false_label = end_label = NULL_TREE;
2641 /* If our arms just jump somewhere, hijack those labels so we don't
2642 generate jumps to jumps. */
2645 && TREE_CODE (then_) == GOTO_EXPR
2646 && TREE_CODE (GOTO_DESTINATION (then_)) == LABEL_DECL)
2648 true_label = GOTO_DESTINATION (then_);
2654 && TREE_CODE (else_) == GOTO_EXPR
2655 && TREE_CODE (GOTO_DESTINATION (else_)) == LABEL_DECL)
2657 false_label = GOTO_DESTINATION (else_);
2662 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2664 true_label_p = &true_label;
2666 true_label_p = NULL;
2668 /* The 'else' branch also needs a label if it contains interesting code. */
2669 if (false_label || else_se)
2670 false_label_p = &false_label;
2672 false_label_p = NULL;
2674 /* If there was nothing else in our arms, just forward the label(s). */
2675 if (!then_se && !else_se)
2676 return shortcut_cond_r (pred, true_label_p, false_label_p,
2677 EXPR_HAS_LOCATION (expr)
2678 ? EXPR_LOCATION (expr) : input_location);
2680 /* If our last subexpression already has a terminal label, reuse it. */
2682 t = expr_last (else_);
2684 t = expr_last (then_);
2687 if (t && TREE_CODE (t) == LABEL_EXPR)
2688 end_label = LABEL_EXPR_LABEL (t);
2690 /* If we don't care about jumping to the 'else' branch, jump to the end
2691 if the condition is false. */
2693 false_label_p = &end_label;
2695 /* We only want to emit these labels if we aren't hijacking them. */
2696 emit_end = (end_label == NULL_TREE);
2697 emit_false = (false_label == NULL_TREE);
2699 /* We only emit the jump over the else clause if we have to--if the
2700 then clause may fall through. Otherwise we can wind up with a
2701 useless jump and a useless label at the end of gimplified code,
2702 which will cause us to think that this conditional as a whole
2703 falls through even if it doesn't. If we then inline a function
2704 which ends with such a condition, that can cause us to issue an
2705 inappropriate warning about control reaching the end of a
2706 non-void function. */
2707 jump_over_else = block_may_fallthru (then_);
2709 pred = shortcut_cond_r (pred, true_label_p, false_label_p,
2710 EXPR_HAS_LOCATION (expr)
2711 ? EXPR_LOCATION (expr) : input_location);
2714 append_to_statement_list (pred, &expr);
2716 append_to_statement_list (then_, &expr);
2721 tree last = expr_last (expr);
2722 t = build_and_jump (&end_label);
2723 if (EXPR_HAS_LOCATION (last))
2724 SET_EXPR_LOCATION (t, EXPR_LOCATION (last));
2725 append_to_statement_list (t, &expr);
2729 t = build1 (LABEL_EXPR, void_type_node, false_label);
2730 append_to_statement_list (t, &expr);
2732 append_to_statement_list (else_, &expr);
2734 if (emit_end && end_label)
2736 t = build1 (LABEL_EXPR, void_type_node, end_label);
2737 append_to_statement_list (t, &expr);
2743 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2746 gimple_boolify (tree expr)
2748 tree type = TREE_TYPE (expr);
2749 location_t loc = EXPR_LOCATION (expr);
2751 if (TREE_CODE (expr) == NE_EXPR
2752 && TREE_CODE (TREE_OPERAND (expr, 0)) == CALL_EXPR
2753 && integer_zerop (TREE_OPERAND (expr, 1)))
2755 tree call = TREE_OPERAND (expr, 0);
2756 tree fn = get_callee_fndecl (call);
2758 /* For __builtin_expect ((long) (x), y) recurse into x as well
2759 if x is truth_value_p. */
2761 && DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2762 && DECL_FUNCTION_CODE (fn) == BUILT_IN_EXPECT
2763 && call_expr_nargs (call) == 2)
2765 tree arg = CALL_EXPR_ARG (call, 0);
2768 if (TREE_CODE (arg) == NOP_EXPR
2769 && TREE_TYPE (arg) == TREE_TYPE (call))
2770 arg = TREE_OPERAND (arg, 0);
2771 if (truth_value_p (TREE_CODE (arg)))
2773 arg = gimple_boolify (arg);
2774 CALL_EXPR_ARG (call, 0)
2775 = fold_convert_loc (loc, TREE_TYPE (call), arg);
2781 if (TREE_CODE (type) == BOOLEAN_TYPE)
2784 switch (TREE_CODE (expr))
2786 case TRUTH_AND_EXPR:
2788 case TRUTH_XOR_EXPR:
2789 case TRUTH_ANDIF_EXPR:
2790 case TRUTH_ORIF_EXPR:
2791 /* Also boolify the arguments of truth exprs. */
2792 TREE_OPERAND (expr, 1) = gimple_boolify (TREE_OPERAND (expr, 1));
2795 case TRUTH_NOT_EXPR:
2796 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2799 case EQ_EXPR: case NE_EXPR:
2800 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2801 /* These expressions always produce boolean results. */
2802 TREE_TYPE (expr) = boolean_type_node;
2806 /* Other expressions that get here must have boolean values, but
2807 might need to be converted to the appropriate mode. */
2808 return fold_convert_loc (loc, boolean_type_node, expr);
2812 /* Given a conditional expression *EXPR_P without side effects, gimplify
2813 its operands. New statements are inserted to PRE_P. */
2815 static enum gimplify_status
2816 gimplify_pure_cond_expr (tree *expr_p, gimple_seq *pre_p)
2818 tree expr = *expr_p, cond;
2819 enum gimplify_status ret, tret;
2820 enum tree_code code;
2822 cond = gimple_boolify (COND_EXPR_COND (expr));
2824 /* We need to handle && and || specially, as their gimplification
2825 creates pure cond_expr, thus leading to an infinite cycle otherwise. */
2826 code = TREE_CODE (cond);
2827 if (code == TRUTH_ANDIF_EXPR)
2828 TREE_SET_CODE (cond, TRUTH_AND_EXPR);
2829 else if (code == TRUTH_ORIF_EXPR)
2830 TREE_SET_CODE (cond, TRUTH_OR_EXPR);
2831 ret = gimplify_expr (&cond, pre_p, NULL, is_gimple_condexpr, fb_rvalue);
2832 COND_EXPR_COND (*expr_p) = cond;
2834 tret = gimplify_expr (&COND_EXPR_THEN (expr), pre_p, NULL,
2835 is_gimple_val, fb_rvalue);
2836 ret = MIN (ret, tret);
2837 tret = gimplify_expr (&COND_EXPR_ELSE (expr), pre_p, NULL,
2838 is_gimple_val, fb_rvalue);
2840 return MIN (ret, tret);
2843 /* Returns true if evaluating EXPR could trap.
2844 EXPR is GENERIC, while tree_could_trap_p can be called
2848 generic_expr_could_trap_p (tree expr)
2852 if (!expr || is_gimple_val (expr))
2855 if (!EXPR_P (expr) || tree_could_trap_p (expr))
2858 n = TREE_OPERAND_LENGTH (expr);
2859 for (i = 0; i < n; i++)
2860 if (generic_expr_could_trap_p (TREE_OPERAND (expr, i)))
2866 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2875 The second form is used when *EXPR_P is of type void.
2877 PRE_P points to the list where side effects that must happen before
2878 *EXPR_P should be stored. */
2880 static enum gimplify_status
2881 gimplify_cond_expr (tree *expr_p, gimple_seq *pre_p, fallback_t fallback)
2883 tree expr = *expr_p;
2884 tree type = TREE_TYPE (expr);
2885 location_t loc = EXPR_LOCATION (expr);
2886 tree tmp, arm1, arm2;
2887 enum gimplify_status ret;
2888 tree label_true, label_false, label_cont;
2889 bool have_then_clause_p, have_else_clause_p;
2891 enum tree_code pred_code;
2892 gimple_seq seq = NULL;
2894 /* If this COND_EXPR has a value, copy the values into a temporary within
2896 if (!VOID_TYPE_P (type))
2898 tree then_ = TREE_OPERAND (expr, 1), else_ = TREE_OPERAND (expr, 2);
2901 /* If either an rvalue is ok or we do not require an lvalue, create the
2902 temporary. But we cannot do that if the type is addressable. */
2903 if (((fallback & fb_rvalue) || !(fallback & fb_lvalue))
2904 && !TREE_ADDRESSABLE (type))
2906 if (gimplify_ctxp->allow_rhs_cond_expr
2907 /* If either branch has side effects or could trap, it can't be
2908 evaluated unconditionally. */
2909 && !TREE_SIDE_EFFECTS (then_)
2910 && !generic_expr_could_trap_p (then_)
2911 && !TREE_SIDE_EFFECTS (else_)
2912 && !generic_expr_could_trap_p (else_))
2913 return gimplify_pure_cond_expr (expr_p, pre_p);
2915 tmp = create_tmp_var (type, "iftmp");
2919 /* Otherwise, only create and copy references to the values. */
2922 type = build_pointer_type (type);
2924 if (!VOID_TYPE_P (TREE_TYPE (then_)))
2925 then_ = build_fold_addr_expr_loc (loc, then_);
2927 if (!VOID_TYPE_P (TREE_TYPE (else_)))
2928 else_ = build_fold_addr_expr_loc (loc, else_);
2931 = build3 (COND_EXPR, type, TREE_OPERAND (expr, 0), then_, else_);
2933 tmp = create_tmp_var (type, "iftmp");
2934 result = build_fold_indirect_ref_loc (loc, tmp);
2937 /* Build the new then clause, `tmp = then_;'. But don't build the
2938 assignment if the value is void; in C++ it can be if it's a throw. */
2939 if (!VOID_TYPE_P (TREE_TYPE (then_)))
2940 TREE_OPERAND (expr, 1) = build2 (MODIFY_EXPR, type, tmp, then_);
2942 /* Similarly, build the new else clause, `tmp = else_;'. */
2943 if (!VOID_TYPE_P (TREE_TYPE (else_)))
2944 TREE_OPERAND (expr, 2) = build2 (MODIFY_EXPR, type, tmp, else_);
2946 TREE_TYPE (expr) = void_type_node;
2947 recalculate_side_effects (expr);
2949 /* Move the COND_EXPR to the prequeue. */
2950 gimplify_stmt (&expr, pre_p);
2956 /* Make sure the condition has BOOLEAN_TYPE. */
2957 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2959 /* Break apart && and || conditions. */
2960 if (TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ANDIF_EXPR
2961 || TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ORIF_EXPR)
2963 expr = shortcut_cond_expr (expr);
2965 if (expr != *expr_p)
2969 /* We can't rely on gimplify_expr to re-gimplify the expanded
2970 form properly, as cleanups might cause the target labels to be
2971 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2972 set up a conditional context. */
2973 gimple_push_condition ();
2974 gimplify_stmt (expr_p, &seq);
2975 gimple_pop_condition (pre_p);
2976 gimple_seq_add_seq (pre_p, seq);
2982 /* Now do the normal gimplification. */
2984 /* Gimplify condition. */
2985 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL, is_gimple_condexpr,
2987 if (ret == GS_ERROR)
2989 gcc_assert (TREE_OPERAND (expr, 0) != NULL_TREE);
2991 gimple_push_condition ();
2993 have_then_clause_p = have_else_clause_p = false;
2994 if (TREE_OPERAND (expr, 1) != NULL
2995 && TREE_CODE (TREE_OPERAND (expr, 1)) == GOTO_EXPR
2996 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr, 1))) == LABEL_DECL
2997 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr, 1)))
2998 == current_function_decl)
2999 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
3000 have different locations, otherwise we end up with incorrect
3001 location information on the branches. */
3003 || !EXPR_HAS_LOCATION (expr)
3004 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr, 1))
3005 || EXPR_LOCATION (expr) == EXPR_LOCATION (TREE_OPERAND (expr, 1))))
3007 label_true = GOTO_DESTINATION (TREE_OPERAND (expr, 1));
3008 have_then_clause_p = true;
3011 label_true = create_artificial_label (UNKNOWN_LOCATION);
3012 if (TREE_OPERAND (expr, 2) != NULL
3013 && TREE_CODE (TREE_OPERAND (expr, 2)) == GOTO_EXPR
3014 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr, 2))) == LABEL_DECL
3015 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr, 2)))
3016 == current_function_decl)
3017 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
3018 have different locations, otherwise we end up with incorrect
3019 location information on the branches. */
3021 || !EXPR_HAS_LOCATION (expr)
3022 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr, 2))
3023 || EXPR_LOCATION (expr) == EXPR_LOCATION (TREE_OPERAND (expr, 2))))
3025 label_false = GOTO_DESTINATION (TREE_OPERAND (expr, 2));
3026 have_else_clause_p = true;
3029 label_false = create_artificial_label (UNKNOWN_LOCATION);
3031 gimple_cond_get_ops_from_tree (COND_EXPR_COND (expr), &pred_code, &arm1,
3034 gimple_cond = gimple_build_cond (pred_code, arm1, arm2, label_true,
3037 gimplify_seq_add_stmt (&seq, gimple_cond);
3038 label_cont = NULL_TREE;
3039 if (!have_then_clause_p)
3041 /* For if (...) {} else { code; } put label_true after
3043 if (TREE_OPERAND (expr, 1) == NULL_TREE
3044 && !have_else_clause_p
3045 && TREE_OPERAND (expr, 2) != NULL_TREE)
3046 label_cont = label_true;
3049 gimplify_seq_add_stmt (&seq, gimple_build_label (label_true));
3050 have_then_clause_p = gimplify_stmt (&TREE_OPERAND (expr, 1), &seq);
3051 /* For if (...) { code; } else {} or
3052 if (...) { code; } else goto label; or
3053 if (...) { code; return; } else { ... }
3054 label_cont isn't needed. */
3055 if (!have_else_clause_p
3056 && TREE_OPERAND (expr, 2) != NULL_TREE
3057 && gimple_seq_may_fallthru (seq))
3060 label_cont = create_artificial_label (UNKNOWN_LOCATION);
3062 g = gimple_build_goto (label_cont);
3064 /* GIMPLE_COND's are very low level; they have embedded
3065 gotos. This particular embedded goto should not be marked
3066 with the location of the original COND_EXPR, as it would
3067 correspond to the COND_EXPR's condition, not the ELSE or the
3068 THEN arms. To avoid marking it with the wrong location, flag
3069 it as "no location". */
3070 gimple_set_do_not_emit_location (g);
3072 gimplify_seq_add_stmt (&seq, g);
3076 if (!have_else_clause_p)
3078 gimplify_seq_add_stmt (&seq, gimple_build_label (label_false));
3079 have_else_clause_p = gimplify_stmt (&TREE_OPERAND (expr, 2), &seq);
3082 gimplify_seq_add_stmt (&seq, gimple_build_label (label_cont));
3084 gimple_pop_condition (pre_p);
3085 gimple_seq_add_seq (pre_p, seq);
3087 if (ret == GS_ERROR)
3089 else if (have_then_clause_p || have_else_clause_p)
3093 /* Both arms are empty; replace the COND_EXPR with its predicate. */
3094 expr = TREE_OPERAND (expr, 0);
3095 gimplify_stmt (&expr, pre_p);
3102 /* Prepare the node pointed to by EXPR_P, an is_gimple_addressable expression,
3103 to be marked addressable.
3105 We cannot rely on such an expression being directly markable if a temporary
3106 has been created by the gimplification. In this case, we create another
3107 temporary and initialize it with a copy, which will become a store after we
3108 mark it addressable. This can happen if the front-end passed us something
3109 that it could not mark addressable yet, like a Fortran pass-by-reference
3110 parameter (int) floatvar. */
3113 prepare_gimple_addressable (tree *expr_p, gimple_seq *seq_p)
3115 while (handled_component_p (*expr_p))
3116 expr_p = &TREE_OPERAND (*expr_p, 0);
3117 if (is_gimple_reg (*expr_p))
3118 *expr_p = get_initialized_tmp_var (*expr_p, seq_p, NULL);
3121 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3122 a call to __builtin_memcpy. */
3124 static enum gimplify_status
3125 gimplify_modify_expr_to_memcpy (tree *expr_p, tree size, bool want_value,
3128 tree t, to, to_ptr, from, from_ptr;
3130 location_t loc = EXPR_LOCATION (*expr_p);
3132 to = TREE_OPERAND (*expr_p, 0);
3133 from = TREE_OPERAND (*expr_p, 1);
3135 /* Mark the RHS addressable. Beware that it may not be possible to do so
3136 directly if a temporary has been created by the gimplification. */
3137 prepare_gimple_addressable (&from, seq_p);
3139 mark_addressable (from);
3140 from_ptr = build_fold_addr_expr_loc (loc, from);
3141 gimplify_arg (&from_ptr, seq_p, loc);
3143 mark_addressable (to);
3144 to_ptr = build_fold_addr_expr_loc (loc, to);
3145 gimplify_arg (&to_ptr, seq_p, loc);
3147 t = implicit_built_in_decls[BUILT_IN_MEMCPY];
3149 gs = gimple_build_call (t, 3, to_ptr, from_ptr, size);
3153 /* tmp = memcpy() */
3154 t = create_tmp_var (TREE_TYPE (to_ptr), NULL);
3155 gimple_call_set_lhs (gs, t);
3156 gimplify_seq_add_stmt (seq_p, gs);
3158 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (to), t);
3162 gimplify_seq_add_stmt (seq_p, gs);
3167 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3168 a call to __builtin_memset. In this case we know that the RHS is
3169 a CONSTRUCTOR with an empty element list. */
3171 static enum gimplify_status
3172 gimplify_modify_expr_to_memset (tree *expr_p, tree size, bool want_value,
3175 tree t, from, to, to_ptr;
3177 location_t loc = EXPR_LOCATION (*expr_p);
3179 /* Assert our assumptions, to abort instead of producing wrong code
3180 silently if they are not met. Beware that the RHS CONSTRUCTOR might
3181 not be immediately exposed. */
3182 from = TREE_OPERAND (*expr_p, 1);
3183 if (TREE_CODE (from) == WITH_SIZE_EXPR)
3184 from = TREE_OPERAND (from, 0);
3186 gcc_assert (TREE_CODE (from) == CONSTRUCTOR
3187 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (from)));
3190 to = TREE_OPERAND (*expr_p, 0);
3192 to_ptr = build_fold_addr_expr_loc (loc, to);
3193 gimplify_arg (&to_ptr, seq_p, loc);
3194 t = implicit_built_in_decls[BUILT_IN_MEMSET];
3196 gs = gimple_build_call (t, 3, to_ptr, integer_zero_node, size);
3200 /* tmp = memset() */
3201 t = create_tmp_var (TREE_TYPE (to_ptr), NULL);
3202 gimple_call_set_lhs (gs, t);
3203 gimplify_seq_add_stmt (seq_p, gs);
3205 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (to), t);
3209 gimplify_seq_add_stmt (seq_p, gs);
3214 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
3215 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
3216 assignment. Returns non-null if we detect a potential overlap. */
3218 struct gimplify_init_ctor_preeval_data
3220 /* The base decl of the lhs object. May be NULL, in which case we
3221 have to assume the lhs is indirect. */
3224 /* The alias set of the lhs object. */
3225 alias_set_type lhs_alias_set;
3229 gimplify_init_ctor_preeval_1 (tree *tp, int *walk_subtrees, void *xdata)
3231 struct gimplify_init_ctor_preeval_data *data
3232 = (struct gimplify_init_ctor_preeval_data *) xdata;
3235 /* If we find the base object, obviously we have overlap. */
3236 if (data->lhs_base_decl == t)
3239 /* If the constructor component is indirect, determine if we have a
3240 potential overlap with the lhs. The only bits of information we
3241 have to go on at this point are addressability and alias sets. */
3242 if (TREE_CODE (t) == INDIRECT_REF
3243 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
3244 && alias_sets_conflict_p (data->lhs_alias_set, get_alias_set (t)))
3247 /* If the constructor component is a call, determine if it can hide a
3248 potential overlap with the lhs through an INDIRECT_REF like above. */
3249 if (TREE_CODE (t) == CALL_EXPR)
3251 tree type, fntype = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (t)));
3253 for (type = TYPE_ARG_TYPES (fntype); type; type = TREE_CHAIN (type))
3254 if (POINTER_TYPE_P (TREE_VALUE (type))
3255 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
3256 && alias_sets_conflict_p (data->lhs_alias_set,
3258 (TREE_TYPE (TREE_VALUE (type)))))
3262 if (IS_TYPE_OR_DECL_P (t))
3267 /* A subroutine of gimplify_init_constructor. Pre-evaluate EXPR,
3268 force values that overlap with the lhs (as described by *DATA)
3269 into temporaries. */
3272 gimplify_init_ctor_preeval (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
3273 struct gimplify_init_ctor_preeval_data *data)
3275 enum gimplify_status one;
3277 /* If the value is constant, then there's nothing to pre-evaluate. */
3278 if (TREE_CONSTANT (*expr_p))
3280 /* Ensure it does not have side effects, it might contain a reference to
3281 the object we're initializing. */
3282 gcc_assert (!TREE_SIDE_EFFECTS (*expr_p));
3286 /* If the type has non-trivial constructors, we can't pre-evaluate. */
3287 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p)))
3290 /* Recurse for nested constructors. */
3291 if (TREE_CODE (*expr_p) == CONSTRUCTOR)
3293 unsigned HOST_WIDE_INT ix;
3294 constructor_elt *ce;
3295 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (*expr_p);
3297 for (ix = 0; VEC_iterate (constructor_elt, v, ix, ce); ix++)
3298 gimplify_init_ctor_preeval (&ce->value, pre_p, post_p, data);
3303 /* If this is a variable sized type, we must remember the size. */
3304 maybe_with_size_expr (expr_p);
3306 /* Gimplify the constructor element to something appropriate for the rhs
3307 of a MODIFY_EXPR. Given that we know the LHS is an aggregate, we know
3308 the gimplifier will consider this a store to memory. Doing this
3309 gimplification now means that we won't have to deal with complicated
3310 language-specific trees, nor trees like SAVE_EXPR that can induce
3311 exponential search behavior. */
3312 one = gimplify_expr (expr_p, pre_p, post_p, is_gimple_mem_rhs, fb_rvalue);
3313 if (one == GS_ERROR)
3319 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
3320 with the lhs, since "a = { .x=a }" doesn't make sense. This will
3321 always be true for all scalars, since is_gimple_mem_rhs insists on a
3322 temporary variable for them. */
3323 if (DECL_P (*expr_p))
3326 /* If this is of variable size, we have no choice but to assume it doesn't
3327 overlap since we can't make a temporary for it. */
3328 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (*expr_p))) != INTEGER_CST)
3331 /* Otherwise, we must search for overlap ... */
3332 if (!walk_tree (expr_p, gimplify_init_ctor_preeval_1, data, NULL))
3335 /* ... and if found, force the value into a temporary. */
3336 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
3339 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
3340 a RANGE_EXPR in a CONSTRUCTOR for an array.
3344 object[var] = value;
3351 We increment var _after_ the loop exit check because we might otherwise
3352 fail if upper == TYPE_MAX_VALUE (type for upper).
3354 Note that we never have to deal with SAVE_EXPRs here, because this has
3355 already been taken care of for us, in gimplify_init_ctor_preeval(). */
3357 static void gimplify_init_ctor_eval (tree, VEC(constructor_elt,gc) *,
3358 gimple_seq *, bool);
3361 gimplify_init_ctor_eval_range (tree object, tree lower, tree upper,
3362 tree value, tree array_elt_type,
3363 gimple_seq *pre_p, bool cleared)
3365 tree loop_entry_label, loop_exit_label, fall_thru_label;
3366 tree var, var_type, cref, tmp;
3368 loop_entry_label = create_artificial_label (UNKNOWN_LOCATION);
3369 loop_exit_label = create_artificial_label (UNKNOWN_LOCATION);
3370 fall_thru_label = create_artificial_label (UNKNOWN_LOCATION);
3372 /* Create and initialize the index variable. */
3373 var_type = TREE_TYPE (upper);
3374 var = create_tmp_var (var_type, NULL);
3375 gimplify_seq_add_stmt (pre_p, gimple_build_assign (var, lower));
3377 /* Add the loop entry label. */
3378 gimplify_seq_add_stmt (pre_p, gimple_build_label (loop_entry_label));
3380 /* Build the reference. */
3381 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
3382 var, NULL_TREE, NULL_TREE);
3384 /* If we are a constructor, just call gimplify_init_ctor_eval to do
3385 the store. Otherwise just assign value to the reference. */
3387 if (TREE_CODE (value) == CONSTRUCTOR)
3388 /* NB we might have to call ourself recursively through
3389 gimplify_init_ctor_eval if the value is a constructor. */
3390 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
3393 gimplify_seq_add_stmt (pre_p, gimple_build_assign (cref, value));
3395 /* We exit the loop when the index var is equal to the upper bound. */
3396 gimplify_seq_add_stmt (pre_p,
3397 gimple_build_cond (EQ_EXPR, var, upper,
3398 loop_exit_label, fall_thru_label));
3400 gimplify_seq_add_stmt (pre_p, gimple_build_label (fall_thru_label));
3402 /* Otherwise, increment the index var... */
3403 tmp = build2 (PLUS_EXPR, var_type, var,
3404 fold_convert (var_type, integer_one_node));
3405 gimplify_seq_add_stmt (pre_p, gimple_build_assign (var, tmp));
3407 /* ...and jump back to the loop entry. */
3408 gimplify_seq_add_stmt (pre_p, gimple_build_goto (loop_entry_label));
3410 /* Add the loop exit label. */
3411 gimplify_seq_add_stmt (pre_p, gimple_build_label (loop_exit_label));
3414 /* Return true if FDECL is accessing a field that is zero sized. */
3417 zero_sized_field_decl (const_tree fdecl)
3419 if (TREE_CODE (fdecl) == FIELD_DECL && DECL_SIZE (fdecl)
3420 && integer_zerop (DECL_SIZE (fdecl)))
3425 /* Return true if TYPE is zero sized. */
3428 zero_sized_type (const_tree type)
3430 if (AGGREGATE_TYPE_P (type) && TYPE_SIZE (type)
3431 && integer_zerop (TYPE_SIZE (type)))
3436 /* A subroutine of gimplify_init_constructor. Generate individual
3437 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
3438 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
3439 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
3443 gimplify_init_ctor_eval (tree object, VEC(constructor_elt,gc) *elts,
3444 gimple_seq *pre_p, bool cleared)
3446 tree array_elt_type = NULL;
3447 unsigned HOST_WIDE_INT ix;
3448 tree purpose, value;
3450 if (TREE_CODE (TREE_TYPE (object)) == ARRAY_TYPE)
3451 array_elt_type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object)));
3453 FOR_EACH_CONSTRUCTOR_ELT (elts, ix, purpose, value)
3457 /* NULL values are created above for gimplification errors. */
3461 if (cleared && initializer_zerop (value))
3464 /* ??? Here's to hoping the front end fills in all of the indices,
3465 so we don't have to figure out what's missing ourselves. */
3466 gcc_assert (purpose);
3468 /* Skip zero-sized fields, unless value has side-effects. This can
3469 happen with calls to functions returning a zero-sized type, which
3470 we shouldn't discard. As a number of downstream passes don't
3471 expect sets of zero-sized fields, we rely on the gimplification of
3472 the MODIFY_EXPR we make below to drop the assignment statement. */
3473 if (! TREE_SIDE_EFFECTS (value) && zero_sized_field_decl (purpose))
3476 /* If we have a RANGE_EXPR, we have to build a loop to assign the
3478 if (TREE_CODE (purpose) == RANGE_EXPR)
3480 tree lower = TREE_OPERAND (purpose, 0);
3481 tree upper = TREE_OPERAND (purpose, 1);
3483 /* If the lower bound is equal to upper, just treat it as if
3484 upper was the index. */
3485 if (simple_cst_equal (lower, upper))
3489 gimplify_init_ctor_eval_range (object, lower, upper, value,
3490 array_elt_type, pre_p, cleared);
3497 /* Do not use bitsizetype for ARRAY_REF indices. */
3498 if (TYPE_DOMAIN (TREE_TYPE (object)))
3499 purpose = fold_convert (TREE_TYPE (TYPE_DOMAIN (TREE_TYPE (object))),
3501 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
3502 purpose, NULL_TREE, NULL_TREE);
3506 gcc_assert (TREE_CODE (purpose) == FIELD_DECL);
3507 cref = build3 (COMPONENT_REF, TREE_TYPE (purpose),
3508 unshare_expr (object), purpose, NULL_TREE);
3511 if (TREE_CODE (value) == CONSTRUCTOR
3512 && TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE)
3513 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
3517 tree init = build2 (INIT_EXPR, TREE_TYPE (cref), cref, value);
3518 gimplify_and_add (init, pre_p);
3525 /* Returns the appropriate RHS predicate for this LHS. */
3528 rhs_predicate_for (tree lhs)
3530 if (is_gimple_reg (lhs))
3531 return is_gimple_reg_rhs_or_call;
3533 return is_gimple_mem_rhs_or_call;
3536 /* Gimplify a C99 compound literal expression. This just means adding
3537 the DECL_EXPR before the current statement and using its anonymous
3540 static enum gimplify_status
3541 gimplify_compound_literal_expr (tree *expr_p, gimple_seq *pre_p)
3543 tree decl_s = COMPOUND_LITERAL_EXPR_DECL_EXPR (*expr_p);
3544 tree decl = DECL_EXPR_DECL (decl_s);
3545 /* Mark the decl as addressable if the compound literal
3546 expression is addressable now, otherwise it is marked too late
3547 after we gimplify the initialization expression. */
3548 if (TREE_ADDRESSABLE (*expr_p))
3549 TREE_ADDRESSABLE (decl) = 1;
3551 /* Preliminarily mark non-addressed complex variables as eligible
3552 for promotion to gimple registers. We'll transform their uses
3554 if ((TREE_CODE (TREE_TYPE (decl)) == COMPLEX_TYPE
3555 || TREE_CODE (TREE_TYPE (decl)) == VECTOR_TYPE)
3556 && !TREE_THIS_VOLATILE (decl)
3557 && !needs_to_live_in_memory (decl))
3558 DECL_GIMPLE_REG_P (decl) = 1;
3560 /* This decl isn't mentioned in the enclosing block, so add it to the
3561 list of temps. FIXME it seems a bit of a kludge to say that
3562 anonymous artificial vars aren't pushed, but everything else is. */
3563 if (DECL_NAME (decl) == NULL_TREE && !DECL_SEEN_IN_BIND_EXPR_P (decl))
3564 gimple_add_tmp_var (decl);
3566 gimplify_and_add (decl_s, pre_p);
3571 /* Optimize embedded COMPOUND_LITERAL_EXPRs within a CONSTRUCTOR,
3572 return a new CONSTRUCTOR if something changed. */
3575 optimize_compound_literals_in_ctor (tree orig_ctor)
3577 tree ctor = orig_ctor;
3578 VEC(constructor_elt,gc) *elts = CONSTRUCTOR_ELTS (ctor);
3579 unsigned int idx, num = VEC_length (constructor_elt, elts);
3581 for (idx = 0; idx < num; idx++)
3583 tree value = VEC_index (constructor_elt, elts, idx)->value;
3584 tree newval = value;
3585 if (TREE_CODE (value) == CONSTRUCTOR)
3586 newval = optimize_compound_literals_in_ctor (value);
3587 else if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
3589 tree decl_s = COMPOUND_LITERAL_EXPR_DECL_EXPR (value);
3590 tree decl = DECL_EXPR_DECL (decl_s);
3591 tree init = DECL_INITIAL (decl);
3593 if (!TREE_ADDRESSABLE (value)
3594 && !TREE_ADDRESSABLE (decl)
3596 newval = optimize_compound_literals_in_ctor (init);
3598 if (newval == value)
3601 if (ctor == orig_ctor)
3603 ctor = copy_node (orig_ctor);
3604 CONSTRUCTOR_ELTS (ctor) = VEC_copy (constructor_elt, gc, elts);
3605 elts = CONSTRUCTOR_ELTS (ctor);
3607 VEC_index (constructor_elt, elts, idx)->value = newval;
3614 /* A subroutine of gimplify_modify_expr. Break out elements of a
3615 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
3617 Note that we still need to clear any elements that don't have explicit
3618 initializers, so if not all elements are initialized we keep the
3619 original MODIFY_EXPR, we just remove all of the constructor elements.
3621 If NOTIFY_TEMP_CREATION is true, do not gimplify, just return
3622 GS_ERROR if we would have to create a temporary when gimplifying
3623 this constructor. Otherwise, return GS_OK.
3625 If NOTIFY_TEMP_CREATION is false, just do the gimplification. */
3627 static enum gimplify_status
3628 gimplify_init_constructor (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
3629 bool want_value, bool notify_temp_creation)
3631 tree object, ctor, type;
3632 enum gimplify_status ret;
3633 VEC(constructor_elt,gc) *elts;
3635 gcc_assert (TREE_CODE (TREE_OPERAND (*expr_p, 1)) == CONSTRUCTOR);
3637 if (!notify_temp_creation)
3639 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3640 is_gimple_lvalue, fb_lvalue);
3641 if (ret == GS_ERROR)
3645 object = TREE_OPERAND (*expr_p, 0);
3646 ctor = TREE_OPERAND (*expr_p, 1) =
3647 optimize_compound_literals_in_ctor (TREE_OPERAND (*expr_p, 1));
3648 type = TREE_TYPE (ctor);
3649 elts = CONSTRUCTOR_ELTS (ctor);
3652 switch (TREE_CODE (type))
3656 case QUAL_UNION_TYPE:
3659 struct gimplify_init_ctor_preeval_data preeval_data;
3660 HOST_WIDE_INT num_type_elements, num_ctor_elements;
3661 HOST_WIDE_INT num_nonzero_elements;
3662 bool cleared, valid_const_initializer;
3664 /* Aggregate types must lower constructors to initialization of
3665 individual elements. The exception is that a CONSTRUCTOR node
3666 with no elements indicates zero-initialization of the whole. */
3667 if (VEC_empty (constructor_elt, elts))
3669 if (notify_temp_creation)
3674 /* Fetch information about the constructor to direct later processing.
3675 We might want to make static versions of it in various cases, and
3676 can only do so if it known to be a valid constant initializer. */
3677 valid_const_initializer
3678 = categorize_ctor_elements (ctor, &num_nonzero_elements,
3679 &num_ctor_elements, &cleared);
3681 /* If a const aggregate variable is being initialized, then it
3682 should never be a lose to promote the variable to be static. */
3683 if (valid_const_initializer
3684 && num_nonzero_elements > 1
3685 && TREE_READONLY (object)
3686 && TREE_CODE (object) == VAR_DECL
3687 && (flag_merge_constants >= 2 || !TREE_ADDRESSABLE (object)))
3689 if (notify_temp_creation)
3691 DECL_INITIAL (object) = ctor;
3692 TREE_STATIC (object) = 1;
3693 if (!DECL_NAME (object))
3694 DECL_NAME (object) = create_tmp_var_name ("C");
3695 walk_tree (&DECL_INITIAL (object), force_labels_r, NULL, NULL);
3697 /* ??? C++ doesn't automatically append a .<number> to the
3698 assembler name, and even when it does, it looks a FE private
3699 data structures to figure out what that number should be,
3700 which are not set for this variable. I suppose this is
3701 important for local statics for inline functions, which aren't
3702 "local" in the object file sense. So in order to get a unique
3703 TU-local symbol, we must invoke the lhd version now. */
3704 lhd_set_decl_assembler_name (object);
3706 *expr_p = NULL_TREE;
3710 /* If there are "lots" of initialized elements, even discounting
3711 those that are not address constants (and thus *must* be
3712 computed at runtime), then partition the constructor into
3713 constant and non-constant parts. Block copy the constant
3714 parts in, then generate code for the non-constant parts. */
3715 /* TODO. There's code in cp/typeck.c to do this. */
3717 num_type_elements = count_type_elements (type, true);
3719 /* If count_type_elements could not determine number of type elements
3720 for a constant-sized object, assume clearing is needed.
3721 Don't do this for variable-sized objects, as store_constructor
3722 will ignore the clearing of variable-sized objects. */
3723 if (num_type_elements < 0 && int_size_in_bytes (type) >= 0)
3725 /* If there are "lots" of zeros, then block clear the object first. */
3726 else if (num_type_elements - num_nonzero_elements
3727 > CLEAR_RATIO (optimize_function_for_speed_p (cfun))
3728 && num_nonzero_elements < num_type_elements/4)
3730 /* ??? This bit ought not be needed. For any element not present
3731 in the initializer, we should simply set them to zero. Except
3732 we'd need to *find* the elements that are not present, and that
3733 requires trickery to avoid quadratic compile-time behavior in
3734 large cases or excessive memory use in small cases. */
3735 else if (num_ctor_elements < num_type_elements)
3738 /* If there are "lots" of initialized elements, and all of them
3739 are valid address constants, then the entire initializer can
3740 be dropped to memory, and then memcpy'd out. Don't do this
3741 for sparse arrays, though, as it's more efficient to follow
3742 the standard CONSTRUCTOR behavior of memset followed by
3743 individual element initialization. Also don't do this for small
3744 all-zero initializers (which aren't big enough to merit
3745 clearing), and don't try to make bitwise copies of
3746 TREE_ADDRESSABLE types. */
3747 if (valid_const_initializer
3748 && !(cleared || num_nonzero_elements == 0)
3749 && !TREE_ADDRESSABLE (type))
3751 HOST_WIDE_INT size = int_size_in_bytes (type);
3754 /* ??? We can still get unbounded array types, at least
3755 from the C++ front end. This seems wrong, but attempt
3756 to work around it for now. */
3759 size = int_size_in_bytes (TREE_TYPE (object));
3761 TREE_TYPE (ctor) = type = TREE_TYPE (object);
3764 /* Find the maximum alignment we can assume for the object. */
3765 /* ??? Make use of DECL_OFFSET_ALIGN. */
3766 if (DECL_P (object))
3767 align = DECL_ALIGN (object);
3769 align = TYPE_ALIGN (type);
3772 && num_nonzero_elements > 1
3773 && !can_move_by_pieces (size, align))
3775 if (notify_temp_creation)
3778 walk_tree (&ctor, force_labels_r, NULL, NULL);
3779 TREE_OPERAND (*expr_p, 1) = tree_output_constant_def (ctor);
3781 /* This is no longer an assignment of a CONSTRUCTOR, but
3782 we still may have processing to do on the LHS. So
3783 pretend we didn't do anything here to let that happen. */
3784 return GS_UNHANDLED;
3788 /* If the target is volatile and we have non-zero elements
3789 initialize the target from a temporary. */
3790 if (TREE_THIS_VOLATILE (object)
3791 && !TREE_ADDRESSABLE (type)
3792 && num_nonzero_elements > 0)
3794 tree temp = create_tmp_var (TYPE_MAIN_VARIANT (type), NULL);
3795 TREE_OPERAND (*expr_p, 0) = temp;
3796 *expr_p = build2 (COMPOUND_EXPR, TREE_TYPE (*expr_p),
3798 build2 (MODIFY_EXPR, void_type_node,
3803 if (notify_temp_creation)
3806 /* If there are nonzero elements and if needed, pre-evaluate to capture
3807 elements overlapping with the lhs into temporaries. We must do this
3808 before clearing to fetch the values before they are zeroed-out. */
3809 if (num_nonzero_elements > 0 && TREE_CODE (*expr_p) != INIT_EXPR)
3811 preeval_data.lhs_base_decl = get_base_address (object);
3812 if (!DECL_P (preeval_data.lhs_base_decl))
3813 preeval_data.lhs_base_decl = NULL;
3814 preeval_data.lhs_alias_set = get_alias_set (object);
3816 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p, 1),
3817 pre_p, post_p, &preeval_data);
3822 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3823 Note that we still have to gimplify, in order to handle the
3824 case of variable sized types. Avoid shared tree structures. */
3825 CONSTRUCTOR_ELTS (ctor) = NULL;
3826 TREE_SIDE_EFFECTS (ctor) = 0;
3827 object = unshare_expr (object);
3828 gimplify_stmt (expr_p, pre_p);
3831 /* If we have not block cleared the object, or if there are nonzero
3832 elements in the constructor, add assignments to the individual
3833 scalar fields of the object. */
3834 if (!cleared || num_nonzero_elements > 0)
3835 gimplify_init_ctor_eval (object, elts, pre_p, cleared);
3837 *expr_p = NULL_TREE;
3845 if (notify_temp_creation)
3848 /* Extract the real and imaginary parts out of the ctor. */
3849 gcc_assert (VEC_length (constructor_elt, elts) == 2);
3850 r = VEC_index (constructor_elt, elts, 0)->value;
3851 i = VEC_index (constructor_elt, elts, 1)->value;
3852 if (r == NULL || i == NULL)
3854 tree zero = fold_convert (TREE_TYPE (type), integer_zero_node);
3861 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3862 represent creation of a complex value. */
3863 if (TREE_CONSTANT (r) && TREE_CONSTANT (i))
3865 ctor = build_complex (type, r, i);
3866 TREE_OPERAND (*expr_p, 1) = ctor;
3870 ctor = build2 (COMPLEX_EXPR, type, r, i);
3871 TREE_OPERAND (*expr_p, 1) = ctor;
3872 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 1),
3875 rhs_predicate_for (TREE_OPERAND (*expr_p, 0)),
3883 unsigned HOST_WIDE_INT ix;
3884 constructor_elt *ce;
3886 if (notify_temp_creation)
3889 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3890 if (TREE_CONSTANT (ctor))
3892 bool constant_p = true;
3895 /* Even when ctor is constant, it might contain non-*_CST
3896 elements, such as addresses or trapping values like
3897 1.0/0.0 - 1.0/0.0. Such expressions don't belong
3898 in VECTOR_CST nodes. */
3899 FOR_EACH_CONSTRUCTOR_VALUE (elts, ix, value)
3900 if (!CONSTANT_CLASS_P (value))
3908 TREE_OPERAND (*expr_p, 1) = build_vector_from_ctor (type, elts);
3912 /* Don't reduce an initializer constant even if we can't
3913 make a VECTOR_CST. It won't do anything for us, and it'll
3914 prevent us from representing it as a single constant. */
3915 if (initializer_constant_valid_p (ctor, type))
3918 TREE_CONSTANT (ctor) = 0;
3921 /* Vector types use CONSTRUCTOR all the way through gimple
3922 compilation as a general initializer. */
3923 for (ix = 0; VEC_iterate (constructor_elt, elts, ix, ce); ix++)
3925 enum gimplify_status tret;
3926 tret = gimplify_expr (&ce->value, pre_p, post_p, is_gimple_val,
3928 if (tret == GS_ERROR)
3931 if (!is_gimple_reg (TREE_OPERAND (*expr_p, 0)))
3932 TREE_OPERAND (*expr_p, 1) = get_formal_tmp_var (ctor, pre_p);
3937 /* So how did we get a CONSTRUCTOR for a scalar type? */
3941 if (ret == GS_ERROR)
3943 else if (want_value)
3950 /* If we have gimplified both sides of the initializer but have
3951 not emitted an assignment, do so now. */
3954 tree lhs = TREE_OPERAND (*expr_p, 0);
3955 tree rhs = TREE_OPERAND (*expr_p, 1);
3956 gimple init = gimple_build_assign (lhs, rhs);
3957 gimplify_seq_add_stmt (pre_p, init);
3965 /* Given a pointer value OP0, return a simplified version of an
3966 indirection through OP0, or NULL_TREE if no simplification is
3967 possible. Note that the resulting type may be different from
3968 the type pointed to in the sense that it is still compatible
3969 from the langhooks point of view. */
3972 gimple_fold_indirect_ref (tree t)
3974 tree type = TREE_TYPE (TREE_TYPE (t));
3979 subtype = TREE_TYPE (sub);
3980 if (!POINTER_TYPE_P (subtype))
3983 if (TREE_CODE (sub) == ADDR_EXPR)
3985 tree op = TREE_OPERAND (sub, 0);
3986 tree optype = TREE_TYPE (op);
3988 if (useless_type_conversion_p (type, optype))
3991 /* *(foo *)&fooarray => fooarray[0] */
3992 if (TREE_CODE (optype) == ARRAY_TYPE
3993 && TREE_CODE (TYPE_SIZE (TREE_TYPE (optype))) == INTEGER_CST
3994 && useless_type_conversion_p (type, TREE_TYPE (optype)))
3996 tree type_domain = TYPE_DOMAIN (optype);
3997 tree min_val = size_zero_node;
3998 if (type_domain && TYPE_MIN_VALUE (type_domain))
3999 min_val = TYPE_MIN_VALUE (type_domain);
4000 if (TREE_CODE (min_val) == INTEGER_CST)
4001 return build4 (ARRAY_REF, type, op, min_val, NULL_TREE, NULL_TREE);
4003 /* *(foo *)&complexfoo => __real__ complexfoo */
4004 else if (TREE_CODE (optype) == COMPLEX_TYPE
4005 && useless_type_conversion_p (type, TREE_TYPE (optype)))
4006 return fold_build1 (REALPART_EXPR, type, op);
4007 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
4008 else if (TREE_CODE (optype) == VECTOR_TYPE
4009 && useless_type_conversion_p (type, TREE_TYPE (optype)))
4011 tree part_width = TYPE_SIZE (type);
4012 tree index = bitsize_int (0);
4013 return fold_build3 (BIT_FIELD_REF, type, op, part_width, index);
4017 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
4018 if (TREE_CODE (sub) == POINTER_PLUS_EXPR
4019 && TREE_CODE (TREE_OPERAND (sub, 1)) == INTEGER_CST)
4021 tree op00 = TREE_OPERAND (sub, 0);
4022 tree op01 = TREE_OPERAND (sub, 1);
4026 op00type = TREE_TYPE (op00);
4027 if (TREE_CODE (op00) == ADDR_EXPR
4028 && TREE_CODE (TREE_TYPE (op00type)) == VECTOR_TYPE
4029 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (op00type))))
4031 HOST_WIDE_INT offset = tree_low_cst (op01, 0);
4032 tree part_width = TYPE_SIZE (type);
4033 unsigned HOST_WIDE_INT part_widthi
4034 = tree_low_cst (part_width, 0) / BITS_PER_UNIT;
4035 unsigned HOST_WIDE_INT indexi = offset * BITS_PER_UNIT;
4036 tree index = bitsize_int (indexi);
4037 if (offset / part_widthi
4038 <= TYPE_VECTOR_SUBPARTS (TREE_TYPE (op00type)))
4039 return fold_build3 (BIT_FIELD_REF, type, TREE_OPERAND (op00, 0),
4044 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
4045 if (TREE_CODE (sub) == POINTER_PLUS_EXPR
4046 && TREE_CODE (TREE_OPERAND (sub, 1)) == INTEGER_CST)
4048 tree op00 = TREE_OPERAND (sub, 0);
4049 tree op01 = TREE_OPERAND (sub, 1);
4053 op00type = TREE_TYPE (op00);
4054 if (TREE_CODE (op00) == ADDR_EXPR
4055 && TREE_CODE (TREE_TYPE (op00type)) == COMPLEX_TYPE
4056 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (op00type))))
4058 tree size = TYPE_SIZE_UNIT (type);
4059 if (tree_int_cst_equal (size, op01))
4060 return fold_build1 (IMAGPART_EXPR, type, TREE_OPERAND (op00, 0));
4064 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
4065 if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
4066 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (subtype)))) == INTEGER_CST
4067 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (subtype))))
4070 tree min_val = size_zero_node;
4072 sub = gimple_fold_indirect_ref (sub);
4074 sub = build1 (INDIRECT_REF, TREE_TYPE (subtype), osub);
4075 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
4076 if (type_domain && TYPE_MIN_VALUE (type_domain))
4077 min_val = TYPE_MIN_VALUE (type_domain);
4078 if (TREE_CODE (min_val) == INTEGER_CST)
4079 return build4 (ARRAY_REF, type, sub, min_val, NULL_TREE, NULL_TREE);
4085 /* Given a pointer value OP0, return a simplified version of an
4086 indirection through OP0, or NULL_TREE if no simplification is
4087 possible. This may only be applied to a rhs of an expression.
4088 Note that the resulting type may be different from the type pointed
4089 to in the sense that it is still compatible from the langhooks
4093 gimple_fold_indirect_ref_rhs (tree t)
4095 return gimple_fold_indirect_ref (t);
4098 /* Subroutine of gimplify_modify_expr to do simplifications of
4099 MODIFY_EXPRs based on the code of the RHS. We loop for as long as
4100 something changes. */
4102 static enum gimplify_status
4103 gimplify_modify_expr_rhs (tree *expr_p, tree *from_p, tree *to_p,
4104 gimple_seq *pre_p, gimple_seq *post_p,
4107 enum gimplify_status ret = GS_UNHANDLED;
4113 switch (TREE_CODE (*from_p))
4116 /* If we're assigning from a read-only variable initialized with
4117 a constructor, do the direct assignment from the constructor,
4118 but only if neither source nor target are volatile since this
4119 latter assignment might end up being done on a per-field basis. */
4120 if (DECL_INITIAL (*from_p)
4121 && TREE_READONLY (*from_p)
4122 && !TREE_THIS_VOLATILE (*from_p)
4123 && !TREE_THIS_VOLATILE (*to_p)
4124 && TREE_CODE (DECL_INITIAL (*from_p)) == CONSTRUCTOR)
4126 tree old_from = *from_p;
4127 enum gimplify_status subret;
4129 /* Move the constructor into the RHS. */
4130 *from_p = unshare_expr (DECL_INITIAL (*from_p));
4132 /* Let's see if gimplify_init_constructor will need to put
4134 subret = gimplify_init_constructor (expr_p, NULL, NULL,
4136 if (subret == GS_ERROR)
4138 /* If so, revert the change. */
4150 /* If we have code like
4154 where the type of "x" is a (possibly cv-qualified variant
4155 of "A"), treat the entire expression as identical to "x".
4156 This kind of code arises in C++ when an object is bound
4157 to a const reference, and if "x" is a TARGET_EXPR we want
4158 to take advantage of the optimization below. */
4159 tree t = gimple_fold_indirect_ref_rhs (TREE_OPERAND (*from_p, 0));
4171 /* If we are initializing something from a TARGET_EXPR, strip the
4172 TARGET_EXPR and initialize it directly, if possible. This can't
4173 be done if the initializer is void, since that implies that the
4174 temporary is set in some non-trivial way.
4176 ??? What about code that pulls out the temp and uses it
4177 elsewhere? I think that such code never uses the TARGET_EXPR as
4178 an initializer. If I'm wrong, we'll die because the temp won't
4179 have any RTL. In that case, I guess we'll need to replace
4180 references somehow. */
4181 tree init = TARGET_EXPR_INITIAL (*from_p);
4184 && !VOID_TYPE_P (TREE_TYPE (init)))
4194 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
4196 gimplify_compound_expr (from_p, pre_p, true);
4202 /* If we're initializing from a CONSTRUCTOR, break this into
4203 individual MODIFY_EXPRs. */
4204 return gimplify_init_constructor (expr_p, pre_p, post_p, want_value,
4208 /* If we're assigning to a non-register type, push the assignment
4209 down into the branches. This is mandatory for ADDRESSABLE types,
4210 since we cannot generate temporaries for such, but it saves a
4211 copy in other cases as well. */
4212 if (!is_gimple_reg_type (TREE_TYPE (*from_p)))
4214 /* This code should mirror the code in gimplify_cond_expr. */
4215 enum tree_code code = TREE_CODE (*expr_p);
4216 tree cond = *from_p;
4217 tree result = *to_p;
4219 ret = gimplify_expr (&result, pre_p, post_p,
4220 is_gimple_lvalue, fb_lvalue);
4221 if (ret != GS_ERROR)
4224 if (TREE_TYPE (TREE_OPERAND (cond, 1)) != void_type_node)
4225 TREE_OPERAND (cond, 1)
4226 = build2 (code, void_type_node, result,
4227 TREE_OPERAND (cond, 1));
4228 if (TREE_TYPE (TREE_OPERAND (cond, 2)) != void_type_node)
4229 TREE_OPERAND (cond, 2)
4230 = build2 (code, void_type_node, unshare_expr (result),
4231 TREE_OPERAND (cond, 2));
4233 TREE_TYPE (cond) = void_type_node;
4234 recalculate_side_effects (cond);
4238 gimplify_and_add (cond, pre_p);
4239 *expr_p = unshare_expr (result);
4248 /* For calls that return in memory, give *to_p as the CALL_EXPR's
4249 return slot so that we don't generate a temporary. */
4250 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p)
4251 && aggregate_value_p (*from_p, *from_p))
4255 if (!(rhs_predicate_for (*to_p))(*from_p))
4256 /* If we need a temporary, *to_p isn't accurate. */
4258 else if (TREE_CODE (*to_p) == RESULT_DECL
4259 && DECL_NAME (*to_p) == NULL_TREE
4260 && needs_to_live_in_memory (*to_p))
4261 /* It's OK to use the return slot directly unless it's an NRV. */
4263 else if (is_gimple_reg_type (TREE_TYPE (*to_p))
4264 || (DECL_P (*to_p) && DECL_REGISTER (*to_p)))
4265 /* Don't force regs into memory. */
4267 else if (TREE_CODE (*expr_p) == INIT_EXPR)
4268 /* It's OK to use the target directly if it's being
4271 else if (!is_gimple_non_addressable (*to_p))
4272 /* Don't use the original target if it's already addressable;
4273 if its address escapes, and the called function uses the
4274 NRV optimization, a conforming program could see *to_p
4275 change before the called function returns; see c++/19317.
4276 When optimizing, the return_slot pass marks more functions
4277 as safe after we have escape info. */
4284 CALL_EXPR_RETURN_SLOT_OPT (*from_p) = 1;
4285 mark_addressable (*to_p);
4290 case WITH_SIZE_EXPR:
4291 /* Likewise for calls that return an aggregate of non-constant size,
4292 since we would not be able to generate a temporary at all. */
4293 if (TREE_CODE (TREE_OPERAND (*from_p, 0)) == CALL_EXPR)
4295 *from_p = TREE_OPERAND (*from_p, 0);
4296 /* We don't change ret in this case because the
4297 WITH_SIZE_EXPR might have been added in
4298 gimplify_modify_expr, so returning GS_OK would lead to an
4304 /* If we're initializing from a container, push the initialization
4306 case CLEANUP_POINT_EXPR:
4308 case STATEMENT_LIST:
4310 tree wrap = *from_p;
4313 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_min_lval,
4315 if (ret != GS_ERROR)
4318 t = voidify_wrapper_expr (wrap, *expr_p);
4319 gcc_assert (t == *expr_p);
4323 gimplify_and_add (wrap, pre_p);
4324 *expr_p = unshare_expr (*to_p);
4331 case COMPOUND_LITERAL_EXPR:
4333 tree complit = TREE_OPERAND (*expr_p, 1);
4334 tree decl_s = COMPOUND_LITERAL_EXPR_DECL_EXPR (complit);
4335 tree decl = DECL_EXPR_DECL (decl_s);
4336 tree init = DECL_INITIAL (decl);
4338 /* struct T x = (struct T) { 0, 1, 2 } can be optimized
4339 into struct T x = { 0, 1, 2 } if the address of the
4340 compound literal has never been taken. */
4341 if (!TREE_ADDRESSABLE (complit)
4342 && !TREE_ADDRESSABLE (decl)
4345 *expr_p = copy_node (*expr_p);
4346 TREE_OPERAND (*expr_p, 1) = init;
4361 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
4362 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
4363 DECL_GIMPLE_REG_P set.
4365 IMPORTANT NOTE: This promotion is performed by introducing a load of the
4366 other, unmodified part of the complex object just before the total store.
4367 As a consequence, if the object is still uninitialized, an undefined value
4368 will be loaded into a register, which may result in a spurious exception
4369 if the register is floating-point and the value happens to be a signaling
4370 NaN for example. Then the fully-fledged complex operations lowering pass
4371 followed by a DCE pass are necessary in order to fix things up. */
4373 static enum gimplify_status
4374 gimplify_modify_expr_complex_part (tree *expr_p, gimple_seq *pre_p,
4377 enum tree_code code, ocode;
4378 tree lhs, rhs, new_rhs, other, realpart, imagpart;
4380 lhs = TREE_OPERAND (*expr_p, 0);
4381 rhs = TREE_OPERAND (*expr_p, 1);
4382 code = TREE_CODE (lhs);
4383 lhs = TREE_OPERAND (lhs, 0);
4385 ocode = code == REALPART_EXPR ? IMAGPART_EXPR : REALPART_EXPR;
4386 other = build1 (ocode, TREE_TYPE (rhs), lhs);
4387 other = get_formal_tmp_var (other, pre_p);
4389 realpart = code == REALPART_EXPR ? rhs : other;
4390 imagpart = code == REALPART_EXPR ? other : rhs;
4392 if (TREE_CONSTANT (realpart) && TREE_CONSTANT (imagpart))
4393 new_rhs = build_complex (TREE_TYPE (lhs), realpart, imagpart);
4395 new_rhs = build2 (COMPLEX_EXPR, TREE_TYPE (lhs), realpart, imagpart);
4397 gimplify_seq_add_stmt (pre_p, gimple_build_assign (lhs, new_rhs));
4398 *expr_p = (want_value) ? rhs : NULL_TREE;
4404 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
4410 PRE_P points to the list where side effects that must happen before
4411 *EXPR_P should be stored.
4413 POST_P points to the list where side effects that must happen after
4414 *EXPR_P should be stored.
4416 WANT_VALUE is nonzero iff we want to use the value of this expression
4417 in another expression. */
4419 static enum gimplify_status
4420 gimplify_modify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
4423 tree *from_p = &TREE_OPERAND (*expr_p, 1);
4424 tree *to_p = &TREE_OPERAND (*expr_p, 0);
4425 enum gimplify_status ret = GS_UNHANDLED;
4427 location_t loc = EXPR_LOCATION (*expr_p);
4429 gcc_assert (TREE_CODE (*expr_p) == MODIFY_EXPR
4430 || TREE_CODE (*expr_p) == INIT_EXPR);
4432 /* Insert pointer conversions required by the middle-end that are not
4433 required by the frontend. This fixes middle-end type checking for
4434 for example gcc.dg/redecl-6.c. */
4435 if (POINTER_TYPE_P (TREE_TYPE (*to_p)))
4437 STRIP_USELESS_TYPE_CONVERSION (*from_p);
4438 if (!useless_type_conversion_p (TREE_TYPE (*to_p), TREE_TYPE (*from_p)))
4439 *from_p = fold_convert_loc (loc, TREE_TYPE (*to_p), *from_p);
4442 /* See if any simplifications can be done based on what the RHS is. */
4443 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
4445 if (ret != GS_UNHANDLED)
4448 /* For zero sized types only gimplify the left hand side and right hand
4449 side as statements and throw away the assignment. Do this after
4450 gimplify_modify_expr_rhs so we handle TARGET_EXPRs of addressable
4452 if (zero_sized_type (TREE_TYPE (*from_p)) && !want_value)
4454 gimplify_stmt (from_p, pre_p);
4455 gimplify_stmt (to_p, pre_p);
4456 *expr_p = NULL_TREE;
4460 /* If the value being copied is of variable width, compute the length
4461 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
4462 before gimplifying any of the operands so that we can resolve any
4463 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
4464 the size of the expression to be copied, not of the destination, so
4465 that is what we must do here. */
4466 maybe_with_size_expr (from_p);
4468 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
4469 if (ret == GS_ERROR)
4472 /* As a special case, we have to temporarily allow for assignments
4473 with a CALL_EXPR on the RHS. Since in GIMPLE a function call is
4474 a toplevel statement, when gimplifying the GENERIC expression
4475 MODIFY_EXPR <a, CALL_EXPR <foo>>, we cannot create the tuple
4476 GIMPLE_ASSIGN <a, GIMPLE_CALL <foo>>.
4478 Instead, we need to create the tuple GIMPLE_CALL <a, foo>. To
4479 prevent gimplify_expr from trying to create a new temporary for
4480 foo's LHS, we tell it that it should only gimplify until it
4481 reaches the CALL_EXPR. On return from gimplify_expr, the newly
4482 created GIMPLE_CALL <foo> will be the last statement in *PRE_P
4483 and all we need to do here is set 'a' to be its LHS. */
4484 ret = gimplify_expr (from_p, pre_p, post_p, rhs_predicate_for (*to_p),
4486 if (ret == GS_ERROR)
4489 /* Now see if the above changed *from_p to something we handle specially. */
4490 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
4492 if (ret != GS_UNHANDLED)
4495 /* If we've got a variable sized assignment between two lvalues (i.e. does
4496 not involve a call), then we can make things a bit more straightforward
4497 by converting the assignment to memcpy or memset. */
4498 if (TREE_CODE (*from_p) == WITH_SIZE_EXPR)
4500 tree from = TREE_OPERAND (*from_p, 0);
4501 tree size = TREE_OPERAND (*from_p, 1);
4503 if (TREE_CODE (from) == CONSTRUCTOR)
4504 return gimplify_modify_expr_to_memset (expr_p, size, want_value, pre_p);
4506 if (is_gimple_addressable (from))
4509 return gimplify_modify_expr_to_memcpy (expr_p, size, want_value,
4514 /* Transform partial stores to non-addressable complex variables into
4515 total stores. This allows us to use real instead of virtual operands
4516 for these variables, which improves optimization. */
4517 if ((TREE_CODE (*to_p) == REALPART_EXPR
4518 || TREE_CODE (*to_p) == IMAGPART_EXPR)
4519 && is_gimple_reg (TREE_OPERAND (*to_p, 0)))
4520 return gimplify_modify_expr_complex_part (expr_p, pre_p, want_value);
4522 /* Try to alleviate the effects of the gimplification creating artificial
4523 temporaries (see for example is_gimple_reg_rhs) on the debug info. */
4524 if (!gimplify_ctxp->into_ssa
4526 && DECL_IGNORED_P (*from_p)
4528 && !DECL_IGNORED_P (*to_p))
4530 if (!DECL_NAME (*from_p) && DECL_NAME (*to_p))
4532 = create_tmp_var_name (IDENTIFIER_POINTER (DECL_NAME (*to_p)));
4533 DECL_DEBUG_EXPR_IS_FROM (*from_p) = 1;
4534 SET_DECL_DEBUG_EXPR (*from_p, *to_p);
4537 if (TREE_CODE (*from_p) == CALL_EXPR)
4539 /* Since the RHS is a CALL_EXPR, we need to create a GIMPLE_CALL
4540 instead of a GIMPLE_ASSIGN. */
4541 assign = gimple_build_call_from_tree (*from_p);
4542 if (!gimple_call_noreturn_p (assign))
4543 gimple_call_set_lhs (assign, *to_p);
4547 assign = gimple_build_assign (*to_p, *from_p);
4548 gimple_set_location (assign, EXPR_LOCATION (*expr_p));
4551 gimplify_seq_add_stmt (pre_p, assign);
4553 if (gimplify_ctxp->into_ssa && is_gimple_reg (*to_p))
4555 /* If we've somehow already got an SSA_NAME on the LHS, then
4556 we've probably modified it twice. Not good. */
4557 gcc_assert (TREE_CODE (*to_p) != SSA_NAME);
4558 *to_p = make_ssa_name (*to_p, assign);
4559 gimple_set_lhs (assign, *to_p);
4564 *expr_p = unshare_expr (*to_p);
4573 /* Gimplify a comparison between two variable-sized objects. Do this
4574 with a call to BUILT_IN_MEMCMP. */
4576 static enum gimplify_status
4577 gimplify_variable_sized_compare (tree *expr_p)
4579 tree op0 = TREE_OPERAND (*expr_p, 0);
4580 tree op1 = TREE_OPERAND (*expr_p, 1);
4581 tree t, arg, dest, src;
4582 location_t loc = EXPR_LOCATION (*expr_p);
4584 arg = TYPE_SIZE_UNIT (TREE_TYPE (op0));
4585 arg = unshare_expr (arg);
4586 arg = SUBSTITUTE_PLACEHOLDER_IN_EXPR (arg, op0);
4587 src = build_fold_addr_expr_loc (loc, op1);
4588 dest = build_fold_addr_expr_loc (loc, op0);
4589 t = implicit_built_in_decls[BUILT_IN_MEMCMP];
4590 t = build_call_expr_loc (loc, t, 3, dest, src, arg);
4592 = build2 (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), t, integer_zero_node);
4597 /* Gimplify a comparison between two aggregate objects of integral scalar
4598 mode as a comparison between the bitwise equivalent scalar values. */
4600 static enum gimplify_status
4601 gimplify_scalar_mode_aggregate_compare (tree *expr_p)
4603 location_t loc = EXPR_LOCATION (*expr_p);
4604 tree op0 = TREE_OPERAND (*expr_p, 0);
4605 tree op1 = TREE_OPERAND (*expr_p, 1);
4607 tree type = TREE_TYPE (op0);
4608 tree scalar_type = lang_hooks.types.type_for_mode (TYPE_MODE (type), 1);
4610 op0 = fold_build1_loc (loc, VIEW_CONVERT_EXPR, scalar_type, op0);
4611 op1 = fold_build1_loc (loc, VIEW_CONVERT_EXPR, scalar_type, op1);
4614 = fold_build2_loc (loc, TREE_CODE (*expr_p), TREE_TYPE (*expr_p), op0, op1);
4619 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
4620 points to the expression to gimplify.
4622 Expressions of the form 'a && b' are gimplified to:
4624 a && b ? true : false
4626 LOCUS is the source location to be put on the generated COND_EXPR.
4627 gimplify_cond_expr will do the rest. */
4629 static enum gimplify_status
4630 gimplify_boolean_expr (tree *expr_p, location_t locus)
4632 /* Preserve the original type of the expression. */
4633 tree type = TREE_TYPE (*expr_p);
4635 *expr_p = build3 (COND_EXPR, type, *expr_p,
4636 fold_convert_loc (locus, type, boolean_true_node),
4637 fold_convert_loc (locus, type, boolean_false_node));
4639 SET_EXPR_LOCATION (*expr_p, locus);
4644 /* Gimplifies an expression sequence. This function gimplifies each
4645 expression and re-writes the original expression with the last
4646 expression of the sequence in GIMPLE form.
4648 PRE_P points to the list where the side effects for all the
4649 expressions in the sequence will be emitted.
4651 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
4653 static enum gimplify_status
4654 gimplify_compound_expr (tree *expr_p, gimple_seq *pre_p, bool want_value)
4660 tree *sub_p = &TREE_OPERAND (t, 0);
4662 if (TREE_CODE (*sub_p) == COMPOUND_EXPR)
4663 gimplify_compound_expr (sub_p, pre_p, false);
4665 gimplify_stmt (sub_p, pre_p);
4667 t = TREE_OPERAND (t, 1);
4669 while (TREE_CODE (t) == COMPOUND_EXPR);
4676 gimplify_stmt (expr_p, pre_p);
4682 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
4683 gimplify. After gimplification, EXPR_P will point to a new temporary
4684 that holds the original value of the SAVE_EXPR node.
4686 PRE_P points to the list where side effects that must happen before
4687 *EXPR_P should be stored. */
4689 static enum gimplify_status
4690 gimplify_save_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4692 enum gimplify_status ret = GS_ALL_DONE;
4695 gcc_assert (TREE_CODE (*expr_p) == SAVE_EXPR);
4696 val = TREE_OPERAND (*expr_p, 0);
4698 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
4699 if (!SAVE_EXPR_RESOLVED_P (*expr_p))
4701 /* The operand may be a void-valued expression such as SAVE_EXPRs
4702 generated by the Java frontend for class initialization. It is
4703 being executed only for its side-effects. */
4704 if (TREE_TYPE (val) == void_type_node)
4706 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
4707 is_gimple_stmt, fb_none);
4711 val = get_initialized_tmp_var (val, pre_p, post_p);
4713 TREE_OPERAND (*expr_p, 0) = val;
4714 SAVE_EXPR_RESOLVED_P (*expr_p) = 1;
4722 /* Re-write the ADDR_EXPR node pointed to by EXPR_P
4729 PRE_P points to the list where side effects that must happen before
4730 *EXPR_P should be stored.
4732 POST_P points to the list where side effects that must happen after
4733 *EXPR_P should be stored. */
4735 static enum gimplify_status
4736 gimplify_addr_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4738 tree expr = *expr_p;
4739 tree op0 = TREE_OPERAND (expr, 0);
4740 enum gimplify_status ret;
4741 location_t loc = EXPR_LOCATION (*expr_p);
4743 switch (TREE_CODE (op0))
4746 case MISALIGNED_INDIRECT_REF:
4748 /* Check if we are dealing with an expression of the form '&*ptr'.
4749 While the front end folds away '&*ptr' into 'ptr', these
4750 expressions may be generated internally by the compiler (e.g.,
4751 builtins like __builtin_va_end). */
4752 /* Caution: the silent array decomposition semantics we allow for
4753 ADDR_EXPR means we can't always discard the pair. */
4754 /* Gimplification of the ADDR_EXPR operand may drop
4755 cv-qualification conversions, so make sure we add them if
4758 tree op00 = TREE_OPERAND (op0, 0);
4759 tree t_expr = TREE_TYPE (expr);
4760 tree t_op00 = TREE_TYPE (op00);
4762 if (!useless_type_conversion_p (t_expr, t_op00))
4763 op00 = fold_convert_loc (loc, TREE_TYPE (expr), op00);
4769 case VIEW_CONVERT_EXPR:
4770 /* Take the address of our operand and then convert it to the type of
4773 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
4774 all clear. The impact of this transformation is even less clear. */
4776 /* If the operand is a useless conversion, look through it. Doing so
4777 guarantees that the ADDR_EXPR and its operand will remain of the
4779 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0, 0)))
4780 op0 = TREE_OPERAND (op0, 0);
4782 *expr_p = fold_convert_loc (loc, TREE_TYPE (expr),
4783 build_fold_addr_expr_loc (loc,
4784 TREE_OPERAND (op0, 0)));
4789 /* We use fb_either here because the C frontend sometimes takes
4790 the address of a call that returns a struct; see
4791 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
4792 the implied temporary explicit. */
4794 /* Make the operand addressable. */
4795 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, post_p,
4796 is_gimple_addressable, fb_either);
4797 if (ret == GS_ERROR)
4800 /* Then mark it. Beware that it may not be possible to do so directly
4801 if a temporary has been created by the gimplification. */
4802 prepare_gimple_addressable (&TREE_OPERAND (expr, 0), pre_p);
4804 op0 = TREE_OPERAND (expr, 0);
4806 /* For various reasons, the gimplification of the expression
4807 may have made a new INDIRECT_REF. */
4808 if (TREE_CODE (op0) == INDIRECT_REF)
4809 goto do_indirect_ref;
4811 mark_addressable (TREE_OPERAND (expr, 0));
4813 /* The FEs may end up building ADDR_EXPRs early on a decl with
4814 an incomplete type. Re-build ADDR_EXPRs in canonical form
4816 if (!types_compatible_p (TREE_TYPE (op0), TREE_TYPE (TREE_TYPE (expr))))
4817 *expr_p = build_fold_addr_expr (op0);
4819 /* Make sure TREE_CONSTANT and TREE_SIDE_EFFECTS are set properly. */
4820 recompute_tree_invariant_for_addr_expr (*expr_p);
4822 /* If we re-built the ADDR_EXPR add a conversion to the original type
4824 if (!useless_type_conversion_p (TREE_TYPE (expr), TREE_TYPE (*expr_p)))
4825 *expr_p = fold_convert (TREE_TYPE (expr), *expr_p);
4833 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
4834 value; output operands should be a gimple lvalue. */
4836 static enum gimplify_status
4837 gimplify_asm_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4841 const char **oconstraints;
4844 const char *constraint;
4845 bool allows_mem, allows_reg, is_inout;
4846 enum gimplify_status ret, tret;
4848 VEC(tree, gc) *inputs;
4849 VEC(tree, gc) *outputs;
4850 VEC(tree, gc) *clobbers;
4851 VEC(tree, gc) *labels;
4855 noutputs = list_length (ASM_OUTPUTS (expr));
4856 oconstraints = (const char **) alloca ((noutputs) * sizeof (const char *));
4858 inputs = outputs = clobbers = labels = NULL;
4861 link_next = NULL_TREE;
4862 for (i = 0, link = ASM_OUTPUTS (expr); link; ++i, link = link_next)
4865 size_t constraint_len;
4867 link_next = TREE_CHAIN (link);
4871 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4872 constraint_len = strlen (constraint);
4873 if (constraint_len == 0)
4876 ok = parse_output_constraint (&constraint, i, 0, 0,
4877 &allows_mem, &allows_reg, &is_inout);
4884 if (!allows_reg && allows_mem)
4885 mark_addressable (TREE_VALUE (link));
4887 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4888 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
4889 fb_lvalue | fb_mayfail);
4890 if (tret == GS_ERROR)
4892 error ("invalid lvalue in asm output %d", i);
4896 VEC_safe_push (tree, gc, outputs, link);
4897 TREE_CHAIN (link) = NULL_TREE;
4901 /* An input/output operand. To give the optimizers more
4902 flexibility, split it into separate input and output
4907 /* Turn the in/out constraint into an output constraint. */
4908 char *p = xstrdup (constraint);
4910 TREE_VALUE (TREE_PURPOSE (link)) = build_string (constraint_len, p);
4912 /* And add a matching input constraint. */
4915 sprintf (buf, "%d", i);
4917 /* If there are multiple alternatives in the constraint,
4918 handle each of them individually. Those that allow register
4919 will be replaced with operand number, the others will stay
4921 if (strchr (p, ',') != NULL)
4923 size_t len = 0, buflen = strlen (buf);
4924 char *beg, *end, *str, *dst;
4928 end = strchr (beg, ',');
4930 end = strchr (beg, '\0');
4931 if ((size_t) (end - beg) < buflen)
4934 len += end - beg + 1;
4941 str = (char *) alloca (len);
4942 for (beg = p + 1, dst = str;;)
4945 bool mem_p, reg_p, inout_p;
4947 end = strchr (beg, ',');
4952 parse_output_constraint (&tem, i, 0, 0,
4953 &mem_p, ®_p, &inout_p);
4958 memcpy (dst, buf, buflen);
4967 memcpy (dst, beg, len);
4976 input = build_string (dst - str, str);
4979 input = build_string (strlen (buf), buf);
4982 input = build_string (constraint_len - 1, constraint + 1);
4986 input = build_tree_list (build_tree_list (NULL_TREE, input),
4987 unshare_expr (TREE_VALUE (link)));
4988 ASM_INPUTS (expr) = chainon (ASM_INPUTS (expr), input);
4992 link_next = NULL_TREE;
4993 for (link = ASM_INPUTS (expr); link; ++i, link = link_next)
4995 link_next = TREE_CHAIN (link);
4996 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4997 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
4998 oconstraints, &allows_mem, &allows_reg);
5000 /* If we can't make copies, we can only accept memory. */
5001 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (link))))
5007 error ("impossible constraint in %<asm%>");
5008 error ("non-memory input %d must stay in memory", i);
5013 /* If the operand is a memory input, it should be an lvalue. */
5014 if (!allows_reg && allows_mem)
5016 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
5017 is_gimple_lvalue, fb_lvalue | fb_mayfail);
5018 mark_addressable (TREE_VALUE (link));
5019 if (tret == GS_ERROR)
5021 if (EXPR_HAS_LOCATION (TREE_VALUE (link)))
5022 input_location = EXPR_LOCATION (TREE_VALUE (link));
5023 error ("memory input %d is not directly addressable", i);
5029 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
5030 is_gimple_asm_val, fb_rvalue);
5031 if (tret == GS_ERROR)
5035 TREE_CHAIN (link) = NULL_TREE;
5036 VEC_safe_push (tree, gc, inputs, link);
5039 for (link = ASM_CLOBBERS (expr); link; ++i, link = TREE_CHAIN (link))
5040 VEC_safe_push (tree, gc, clobbers, link);
5042 for (link = ASM_LABELS (expr); link; ++i, link = TREE_CHAIN (link))
5043 VEC_safe_push (tree, gc, labels, link);
5045 /* Do not add ASMs with errors to the gimple IL stream. */
5046 if (ret != GS_ERROR)
5048 stmt = gimple_build_asm_vec (TREE_STRING_POINTER (ASM_STRING (expr)),
5049 inputs, outputs, clobbers, labels);
5051 gimple_asm_set_volatile (stmt, ASM_VOLATILE_P (expr));
5052 gimple_asm_set_input (stmt, ASM_INPUT_P (expr));
5054 gimplify_seq_add_stmt (pre_p, stmt);
5060 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
5061 GIMPLE_WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
5062 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
5063 return to this function.
5065 FIXME should we complexify the prequeue handling instead? Or use flags
5066 for all the cleanups and let the optimizer tighten them up? The current
5067 code seems pretty fragile; it will break on a cleanup within any
5068 non-conditional nesting. But any such nesting would be broken, anyway;
5069 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
5070 and continues out of it. We can do that at the RTL level, though, so
5071 having an optimizer to tighten up try/finally regions would be a Good
5074 static enum gimplify_status
5075 gimplify_cleanup_point_expr (tree *expr_p, gimple_seq *pre_p)
5077 gimple_stmt_iterator iter;
5078 gimple_seq body_sequence = NULL;
5080 tree temp = voidify_wrapper_expr (*expr_p, NULL);
5082 /* We only care about the number of conditions between the innermost
5083 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
5084 any cleanups collected outside the CLEANUP_POINT_EXPR. */
5085 int old_conds = gimplify_ctxp->conditions;
5086 gimple_seq old_cleanups = gimplify_ctxp->conditional_cleanups;
5087 gimplify_ctxp->conditions = 0;
5088 gimplify_ctxp->conditional_cleanups = NULL;
5090 gimplify_stmt (&TREE_OPERAND (*expr_p, 0), &body_sequence);
5092 gimplify_ctxp->conditions = old_conds;
5093 gimplify_ctxp->conditional_cleanups = old_cleanups;
5095 for (iter = gsi_start (body_sequence); !gsi_end_p (iter); )
5097 gimple wce = gsi_stmt (iter);
5099 if (gimple_code (wce) == GIMPLE_WITH_CLEANUP_EXPR)
5101 if (gsi_one_before_end_p (iter))
5103 /* Note that gsi_insert_seq_before and gsi_remove do not
5104 scan operands, unlike some other sequence mutators. */
5105 gsi_insert_seq_before_without_update (&iter,
5106 gimple_wce_cleanup (wce),
5108 gsi_remove (&iter, true);
5115 enum gimple_try_flags kind;
5117 if (gimple_wce_cleanup_eh_only (wce))
5118 kind = GIMPLE_TRY_CATCH;
5120 kind = GIMPLE_TRY_FINALLY;
5121 seq = gsi_split_seq_after (iter);
5123 gtry = gimple_build_try (seq, gimple_wce_cleanup (wce), kind);
5124 /* Do not use gsi_replace here, as it may scan operands.
5125 We want to do a simple structural modification only. */
5126 *gsi_stmt_ptr (&iter) = gtry;
5127 iter = gsi_start (seq);
5134 gimplify_seq_add_seq (pre_p, body_sequence);
5147 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
5148 is the cleanup action required. EH_ONLY is true if the cleanup should
5149 only be executed if an exception is thrown, not on normal exit. */
5152 gimple_push_cleanup (tree var, tree cleanup, bool eh_only, gimple_seq *pre_p)
5155 gimple_seq cleanup_stmts = NULL;
5157 /* Errors can result in improperly nested cleanups. Which results in
5158 confusion when trying to resolve the GIMPLE_WITH_CLEANUP_EXPR. */
5159 if (errorcount || sorrycount)
5162 if (gimple_conditional_context ())
5164 /* If we're in a conditional context, this is more complex. We only
5165 want to run the cleanup if we actually ran the initialization that
5166 necessitates it, but we want to run it after the end of the
5167 conditional context. So we wrap the try/finally around the
5168 condition and use a flag to determine whether or not to actually
5169 run the destructor. Thus
5173 becomes (approximately)
5177 if (test) { A::A(temp); flag = 1; val = f(temp); }
5180 if (flag) A::~A(temp);
5184 tree flag = create_tmp_var (boolean_type_node, "cleanup");
5185 gimple ffalse = gimple_build_assign (flag, boolean_false_node);
5186 gimple ftrue = gimple_build_assign (flag, boolean_true_node);
5188 cleanup = build3 (COND_EXPR, void_type_node, flag, cleanup, NULL);
5189 gimplify_stmt (&cleanup, &cleanup_stmts);
5190 wce = gimple_build_wce (cleanup_stmts);
5192 gimplify_seq_add_stmt (&gimplify_ctxp->conditional_cleanups, ffalse);
5193 gimplify_seq_add_stmt (&gimplify_ctxp->conditional_cleanups, wce);
5194 gimplify_seq_add_stmt (pre_p, ftrue);
5196 /* Because of this manipulation, and the EH edges that jump
5197 threading cannot redirect, the temporary (VAR) will appear
5198 to be used uninitialized. Don't warn. */
5199 TREE_NO_WARNING (var) = 1;
5203 gimplify_stmt (&cleanup, &cleanup_stmts);
5204 wce = gimple_build_wce (cleanup_stmts);
5205 gimple_wce_set_cleanup_eh_only (wce, eh_only);
5206 gimplify_seq_add_stmt (pre_p, wce);
5210 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
5212 static enum gimplify_status
5213 gimplify_target_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
5215 tree targ = *expr_p;
5216 tree temp = TARGET_EXPR_SLOT (targ);
5217 tree init = TARGET_EXPR_INITIAL (targ);
5218 enum gimplify_status ret;
5222 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
5223 to the temps list. Handle also variable length TARGET_EXPRs. */
5224 if (TREE_CODE (DECL_SIZE (temp)) != INTEGER_CST)
5226 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (temp)))
5227 gimplify_type_sizes (TREE_TYPE (temp), pre_p);
5228 gimplify_vla_decl (temp, pre_p);
5231 gimple_add_tmp_var (temp);
5233 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
5234 expression is supposed to initialize the slot. */
5235 if (VOID_TYPE_P (TREE_TYPE (init)))
5236 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
5239 tree init_expr = build2 (INIT_EXPR, void_type_node, temp, init);
5241 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
5243 ggc_free (init_expr);
5245 if (ret == GS_ERROR)
5247 /* PR c++/28266 Make sure this is expanded only once. */
5248 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
5252 gimplify_and_add (init, pre_p);
5254 /* If needed, push the cleanup for the temp. */
5255 if (TARGET_EXPR_CLEANUP (targ))
5256 gimple_push_cleanup (temp, TARGET_EXPR_CLEANUP (targ),
5257 CLEANUP_EH_ONLY (targ), pre_p);
5259 /* Only expand this once. */
5260 TREE_OPERAND (targ, 3) = init;
5261 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
5264 /* We should have expanded this before. */
5265 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp));
5271 /* Gimplification of expression trees. */
5273 /* Gimplify an expression which appears at statement context. The
5274 corresponding GIMPLE statements are added to *SEQ_P. If *SEQ_P is
5275 NULL, a new sequence is allocated.
5277 Return true if we actually added a statement to the queue. */
5280 gimplify_stmt (tree *stmt_p, gimple_seq *seq_p)
5282 gimple_seq_node last;
5285 *seq_p = gimple_seq_alloc ();
5287 last = gimple_seq_last (*seq_p);
5288 gimplify_expr (stmt_p, seq_p, NULL, is_gimple_stmt, fb_none);
5289 return last != gimple_seq_last (*seq_p);
5293 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
5294 to CTX. If entries already exist, force them to be some flavor of private.
5295 If there is no enclosing parallel, do nothing. */
5298 omp_firstprivatize_variable (struct gimplify_omp_ctx *ctx, tree decl)
5302 if (decl == NULL || !DECL_P (decl))
5307 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5310 if (n->value & GOVD_SHARED)
5311 n->value = GOVD_FIRSTPRIVATE | (n->value & GOVD_SEEN);
5315 else if (ctx->region_type != ORT_WORKSHARE)
5316 omp_add_variable (ctx, decl, GOVD_FIRSTPRIVATE);
5318 ctx = ctx->outer_context;
5323 /* Similarly for each of the type sizes of TYPE. */
5326 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx *ctx, tree type)
5328 if (type == NULL || type == error_mark_node)
5330 type = TYPE_MAIN_VARIANT (type);
5332 if (pointer_set_insert (ctx->privatized_types, type))
5335 switch (TREE_CODE (type))
5341 case FIXED_POINT_TYPE:
5342 omp_firstprivatize_variable (ctx, TYPE_MIN_VALUE (type));
5343 omp_firstprivatize_variable (ctx, TYPE_MAX_VALUE (type));
5347 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
5348 omp_firstprivatize_type_sizes (ctx, TYPE_DOMAIN (type));
5353 case QUAL_UNION_TYPE:
5356 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
5357 if (TREE_CODE (field) == FIELD_DECL)
5359 omp_firstprivatize_variable (ctx, DECL_FIELD_OFFSET (field));
5360 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (field));
5366 case REFERENCE_TYPE:
5367 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
5374 omp_firstprivatize_variable (ctx, TYPE_SIZE (type));
5375 omp_firstprivatize_variable (ctx, TYPE_SIZE_UNIT (type));
5376 lang_hooks.types.omp_firstprivatize_type_sizes (ctx, type);
5379 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
5382 omp_add_variable (struct gimplify_omp_ctx *ctx, tree decl, unsigned int flags)
5385 unsigned int nflags;
5388 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5391 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
5392 there are constructors involved somewhere. */
5393 if (TREE_ADDRESSABLE (TREE_TYPE (decl))
5394 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
5397 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5400 /* We shouldn't be re-adding the decl with the same data
5402 gcc_assert ((n->value & GOVD_DATA_SHARE_CLASS & flags) == 0);
5403 /* The only combination of data sharing classes we should see is
5404 FIRSTPRIVATE and LASTPRIVATE. */
5405 nflags = n->value | flags;
5406 gcc_assert ((nflags & GOVD_DATA_SHARE_CLASS)
5407 == (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE));
5412 /* When adding a variable-sized variable, we have to handle all sorts
5413 of additional bits of data: the pointer replacement variable, and
5414 the parameters of the type. */
5415 if (DECL_SIZE (decl) && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
5417 /* Add the pointer replacement variable as PRIVATE if the variable
5418 replacement is private, else FIRSTPRIVATE since we'll need the
5419 address of the original variable either for SHARED, or for the
5420 copy into or out of the context. */
5421 if (!(flags & GOVD_LOCAL))
5423 nflags = flags & GOVD_PRIVATE ? GOVD_PRIVATE : GOVD_FIRSTPRIVATE;
5424 nflags |= flags & GOVD_SEEN;
5425 t = DECL_VALUE_EXPR (decl);
5426 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
5427 t = TREE_OPERAND (t, 0);
5428 gcc_assert (DECL_P (t));
5429 omp_add_variable (ctx, t, nflags);
5432 /* Add all of the variable and type parameters (which should have
5433 been gimplified to a formal temporary) as FIRSTPRIVATE. */
5434 omp_firstprivatize_variable (ctx, DECL_SIZE_UNIT (decl));
5435 omp_firstprivatize_variable (ctx, DECL_SIZE (decl));
5436 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
5438 /* The variable-sized variable itself is never SHARED, only some form
5439 of PRIVATE. The sharing would take place via the pointer variable
5440 which we remapped above. */
5441 if (flags & GOVD_SHARED)
5442 flags = GOVD_PRIVATE | GOVD_DEBUG_PRIVATE
5443 | (flags & (GOVD_SEEN | GOVD_EXPLICIT));
5445 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
5446 alloca statement we generate for the variable, so make sure it
5447 is available. This isn't automatically needed for the SHARED
5448 case, since we won't be allocating local storage then.
5449 For local variables TYPE_SIZE_UNIT might not be gimplified yet,
5450 in this case omp_notice_variable will be called later
5451 on when it is gimplified. */
5452 else if (! (flags & GOVD_LOCAL))
5453 omp_notice_variable (ctx, TYPE_SIZE_UNIT (TREE_TYPE (decl)), true);
5455 else if (lang_hooks.decls.omp_privatize_by_reference (decl))
5457 gcc_assert ((flags & GOVD_LOCAL) == 0);
5458 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
5460 /* Similar to the direct variable sized case above, we'll need the
5461 size of references being privatized. */
5462 if ((flags & GOVD_SHARED) == 0)
5464 t = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl)));
5465 if (TREE_CODE (t) != INTEGER_CST)
5466 omp_notice_variable (ctx, t, true);
5470 splay_tree_insert (ctx->variables, (splay_tree_key)decl, flags);
5473 /* Record the fact that DECL was used within the OpenMP context CTX.
5474 IN_CODE is true when real code uses DECL, and false when we should
5475 merely emit default(none) errors. Return true if DECL is going to
5476 be remapped and thus DECL shouldn't be gimplified into its
5477 DECL_VALUE_EXPR (if any). */
5480 omp_notice_variable (struct gimplify_omp_ctx *ctx, tree decl, bool in_code)
5483 unsigned flags = in_code ? GOVD_SEEN : 0;
5484 bool ret = false, shared;
5486 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5489 /* Threadprivate variables are predetermined. */
5490 if (is_global_var (decl))
5492 if (DECL_THREAD_LOCAL_P (decl))
5495 if (DECL_HAS_VALUE_EXPR_P (decl))
5497 tree value = get_base_address (DECL_VALUE_EXPR (decl));
5499 if (value && DECL_P (value) && DECL_THREAD_LOCAL_P (value))
5504 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5507 enum omp_clause_default_kind default_kind, kind;
5508 struct gimplify_omp_ctx *octx;
5510 if (ctx->region_type == ORT_WORKSHARE)
5513 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
5514 remapped firstprivate instead of shared. To some extent this is
5515 addressed in omp_firstprivatize_type_sizes, but not effectively. */
5516 default_kind = ctx->default_kind;
5517 kind = lang_hooks.decls.omp_predetermined_sharing (decl);
5518 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
5519 default_kind = kind;
5521 switch (default_kind)
5523 case OMP_CLAUSE_DEFAULT_NONE:
5524 error ("%qE not specified in enclosing parallel",
5526 error_at (ctx->location, "enclosing parallel");
5528 case OMP_CLAUSE_DEFAULT_SHARED:
5529 flags |= GOVD_SHARED;
5531 case OMP_CLAUSE_DEFAULT_PRIVATE:
5532 flags |= GOVD_PRIVATE;
5534 case OMP_CLAUSE_DEFAULT_FIRSTPRIVATE:
5535 flags |= GOVD_FIRSTPRIVATE;
5537 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
5538 /* decl will be either GOVD_FIRSTPRIVATE or GOVD_SHARED. */
5539 gcc_assert (ctx->region_type == ORT_TASK);
5540 if (ctx->outer_context)
5541 omp_notice_variable (ctx->outer_context, decl, in_code);
5542 for (octx = ctx->outer_context; octx; octx = octx->outer_context)
5546 n2 = splay_tree_lookup (octx->variables, (splay_tree_key) decl);
5547 if (n2 && (n2->value & GOVD_DATA_SHARE_CLASS) != GOVD_SHARED)
5549 flags |= GOVD_FIRSTPRIVATE;
5552 if ((octx->region_type & ORT_PARALLEL) != 0)
5555 if (flags & GOVD_FIRSTPRIVATE)
5558 && (TREE_CODE (decl) == PARM_DECL
5559 || (!is_global_var (decl)
5560 && DECL_CONTEXT (decl) == current_function_decl)))
5562 flags |= GOVD_FIRSTPRIVATE;
5565 flags |= GOVD_SHARED;
5571 if ((flags & GOVD_PRIVATE)
5572 && lang_hooks.decls.omp_private_outer_ref (decl))
5573 flags |= GOVD_PRIVATE_OUTER_REF;
5575 omp_add_variable (ctx, decl, flags);
5577 shared = (flags & GOVD_SHARED) != 0;
5578 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
5582 if ((n->value & (GOVD_SEEN | GOVD_LOCAL)) == 0
5583 && (flags & (GOVD_SEEN | GOVD_LOCAL)) == GOVD_SEEN
5585 && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
5588 tree t = DECL_VALUE_EXPR (decl);
5589 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
5590 t = TREE_OPERAND (t, 0);
5591 gcc_assert (DECL_P (t));
5592 n2 = splay_tree_lookup (ctx->variables, (splay_tree_key) t);
5593 n2->value |= GOVD_SEEN;
5596 shared = ((flags | n->value) & GOVD_SHARED) != 0;
5597 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
5599 /* If nothing changed, there's nothing left to do. */
5600 if ((n->value & flags) == flags)
5606 /* If the variable is private in the current context, then we don't
5607 need to propagate anything to an outer context. */
5608 if ((flags & GOVD_PRIVATE) && !(flags & GOVD_PRIVATE_OUTER_REF))
5610 if (ctx->outer_context
5611 && omp_notice_variable (ctx->outer_context, decl, in_code))
5616 /* Verify that DECL is private within CTX. If there's specific information
5617 to the contrary in the innermost scope, generate an error. */
5620 omp_is_private (struct gimplify_omp_ctx *ctx, tree decl)
5624 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5627 if (n->value & GOVD_SHARED)
5629 if (ctx == gimplify_omp_ctxp)
5631 error ("iteration variable %qE should be private",
5633 n->value = GOVD_PRIVATE;
5639 else if ((n->value & GOVD_EXPLICIT) != 0
5640 && (ctx == gimplify_omp_ctxp
5641 || (ctx->region_type == ORT_COMBINED_PARALLEL
5642 && gimplify_omp_ctxp->outer_context == ctx)))
5644 if ((n->value & GOVD_FIRSTPRIVATE) != 0)
5645 error ("iteration variable %qE should not be firstprivate",
5647 else if ((n->value & GOVD_REDUCTION) != 0)
5648 error ("iteration variable %qE should not be reduction",
5651 return (ctx == gimplify_omp_ctxp
5652 || (ctx->region_type == ORT_COMBINED_PARALLEL
5653 && gimplify_omp_ctxp->outer_context == ctx));
5656 if (ctx->region_type != ORT_WORKSHARE)
5658 else if (ctx->outer_context)
5659 return omp_is_private (ctx->outer_context, decl);
5663 /* Return true if DECL is private within a parallel region
5664 that binds to the current construct's context or in parallel
5665 region's REDUCTION clause. */
5668 omp_check_private (struct gimplify_omp_ctx *ctx, tree decl)
5674 ctx = ctx->outer_context;
5676 return !(is_global_var (decl)
5677 /* References might be private, but might be shared too. */
5678 || lang_hooks.decls.omp_privatize_by_reference (decl));
5680 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5682 return (n->value & GOVD_SHARED) == 0;
5684 while (ctx->region_type == ORT_WORKSHARE);
5688 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
5689 and previous omp contexts. */
5692 gimplify_scan_omp_clauses (tree *list_p, gimple_seq *pre_p,
5693 enum omp_region_type region_type)
5695 struct gimplify_omp_ctx *ctx, *outer_ctx;
5696 struct gimplify_ctx gctx;
5699 ctx = new_omp_context (region_type);
5700 outer_ctx = ctx->outer_context;
5702 while ((c = *list_p) != NULL)
5704 bool remove = false;
5705 bool notice_outer = true;
5706 const char *check_non_private = NULL;
5710 switch (OMP_CLAUSE_CODE (c))
5712 case OMP_CLAUSE_PRIVATE:
5713 flags = GOVD_PRIVATE | GOVD_EXPLICIT;
5714 if (lang_hooks.decls.omp_private_outer_ref (OMP_CLAUSE_DECL (c)))
5716 flags |= GOVD_PRIVATE_OUTER_REF;
5717 OMP_CLAUSE_PRIVATE_OUTER_REF (c) = 1;
5720 notice_outer = false;
5722 case OMP_CLAUSE_SHARED:
5723 flags = GOVD_SHARED | GOVD_EXPLICIT;
5725 case OMP_CLAUSE_FIRSTPRIVATE:
5726 flags = GOVD_FIRSTPRIVATE | GOVD_EXPLICIT;
5727 check_non_private = "firstprivate";
5729 case OMP_CLAUSE_LASTPRIVATE:
5730 flags = GOVD_LASTPRIVATE | GOVD_SEEN | GOVD_EXPLICIT;
5731 check_non_private = "lastprivate";
5733 case OMP_CLAUSE_REDUCTION:
5734 flags = GOVD_REDUCTION | GOVD_SEEN | GOVD_EXPLICIT;
5735 check_non_private = "reduction";
5739 decl = OMP_CLAUSE_DECL (c);
5740 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5745 omp_add_variable (ctx, decl, flags);
5746 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION
5747 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c))
5749 omp_add_variable (ctx, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c),
5750 GOVD_LOCAL | GOVD_SEEN);
5751 gimplify_omp_ctxp = ctx;
5752 push_gimplify_context (&gctx);
5754 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c) = gimple_seq_alloc ();
5755 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c) = gimple_seq_alloc ();
5757 gimplify_and_add (OMP_CLAUSE_REDUCTION_INIT (c),
5758 &OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c));
5759 pop_gimplify_context
5760 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c)));
5761 push_gimplify_context (&gctx);
5762 gimplify_and_add (OMP_CLAUSE_REDUCTION_MERGE (c),
5763 &OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c));
5764 pop_gimplify_context
5765 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c)));
5766 OMP_CLAUSE_REDUCTION_INIT (c) = NULL_TREE;
5767 OMP_CLAUSE_REDUCTION_MERGE (c) = NULL_TREE;
5769 gimplify_omp_ctxp = outer_ctx;
5771 else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
5772 && OMP_CLAUSE_LASTPRIVATE_STMT (c))
5774 gimplify_omp_ctxp = ctx;
5775 push_gimplify_context (&gctx);
5776 if (TREE_CODE (OMP_CLAUSE_LASTPRIVATE_STMT (c)) != BIND_EXPR)
5778 tree bind = build3 (BIND_EXPR, void_type_node, NULL,
5780 TREE_SIDE_EFFECTS (bind) = 1;
5781 BIND_EXPR_BODY (bind) = OMP_CLAUSE_LASTPRIVATE_STMT (c);
5782 OMP_CLAUSE_LASTPRIVATE_STMT (c) = bind;
5784 gimplify_and_add (OMP_CLAUSE_LASTPRIVATE_STMT (c),
5785 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c));
5786 pop_gimplify_context
5787 (gimple_seq_first_stmt (OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c)));
5788 OMP_CLAUSE_LASTPRIVATE_STMT (c) = NULL_TREE;
5790 gimplify_omp_ctxp = outer_ctx;
5796 case OMP_CLAUSE_COPYIN:
5797 case OMP_CLAUSE_COPYPRIVATE:
5798 decl = OMP_CLAUSE_DECL (c);
5799 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5806 omp_notice_variable (outer_ctx, decl, true);
5807 if (check_non_private
5808 && region_type == ORT_WORKSHARE
5809 && omp_check_private (ctx, decl))
5811 error ("%s variable %qE is private in outer context",
5812 check_non_private, DECL_NAME (decl));
5818 OMP_CLAUSE_OPERAND (c, 0)
5819 = gimple_boolify (OMP_CLAUSE_OPERAND (c, 0));
5822 case OMP_CLAUSE_SCHEDULE:
5823 case OMP_CLAUSE_NUM_THREADS:
5824 if (gimplify_expr (&OMP_CLAUSE_OPERAND (c, 0), pre_p, NULL,
5825 is_gimple_val, fb_rvalue) == GS_ERROR)
5829 case OMP_CLAUSE_NOWAIT:
5830 case OMP_CLAUSE_ORDERED:
5831 case OMP_CLAUSE_UNTIED:
5832 case OMP_CLAUSE_COLLAPSE:
5835 case OMP_CLAUSE_DEFAULT:
5836 ctx->default_kind = OMP_CLAUSE_DEFAULT_KIND (c);
5844 *list_p = OMP_CLAUSE_CHAIN (c);
5846 list_p = &OMP_CLAUSE_CHAIN (c);
5849 gimplify_omp_ctxp = ctx;
5852 /* For all variables that were not actually used within the context,
5853 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
5856 gimplify_adjust_omp_clauses_1 (splay_tree_node n, void *data)
5858 tree *list_p = (tree *) data;
5859 tree decl = (tree) n->key;
5860 unsigned flags = n->value;
5861 enum omp_clause_code code;
5865 if (flags & (GOVD_EXPLICIT | GOVD_LOCAL))
5867 if ((flags & GOVD_SEEN) == 0)
5869 if (flags & GOVD_DEBUG_PRIVATE)
5871 gcc_assert ((flags & GOVD_DATA_SHARE_CLASS) == GOVD_PRIVATE);
5872 private_debug = true;
5876 = lang_hooks.decls.omp_private_debug_clause (decl,
5877 !!(flags & GOVD_SHARED));
5879 code = OMP_CLAUSE_PRIVATE;
5880 else if (flags & GOVD_SHARED)
5882 if (is_global_var (decl))
5884 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp->outer_context;
5888 = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5889 if (on && (on->value & (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE
5890 | GOVD_PRIVATE | GOVD_REDUCTION)) != 0)
5892 ctx = ctx->outer_context;
5897 code = OMP_CLAUSE_SHARED;
5899 else if (flags & GOVD_PRIVATE)
5900 code = OMP_CLAUSE_PRIVATE;
5901 else if (flags & GOVD_FIRSTPRIVATE)
5902 code = OMP_CLAUSE_FIRSTPRIVATE;
5906 clause = build_omp_clause (input_location, code);
5907 OMP_CLAUSE_DECL (clause) = decl;
5908 OMP_CLAUSE_CHAIN (clause) = *list_p;
5910 OMP_CLAUSE_PRIVATE_DEBUG (clause) = 1;
5911 else if (code == OMP_CLAUSE_PRIVATE && (flags & GOVD_PRIVATE_OUTER_REF))
5912 OMP_CLAUSE_PRIVATE_OUTER_REF (clause) = 1;
5914 lang_hooks.decls.omp_finish_clause (clause);
5920 gimplify_adjust_omp_clauses (tree *list_p)
5922 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
5925 while ((c = *list_p) != NULL)
5928 bool remove = false;
5930 switch (OMP_CLAUSE_CODE (c))
5932 case OMP_CLAUSE_PRIVATE:
5933 case OMP_CLAUSE_SHARED:
5934 case OMP_CLAUSE_FIRSTPRIVATE:
5935 decl = OMP_CLAUSE_DECL (c);
5936 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5937 remove = !(n->value & GOVD_SEEN);
5940 bool shared = OMP_CLAUSE_CODE (c) == OMP_CLAUSE_SHARED;
5941 if ((n->value & GOVD_DEBUG_PRIVATE)
5942 || lang_hooks.decls.omp_private_debug_clause (decl, shared))
5944 gcc_assert ((n->value & GOVD_DEBUG_PRIVATE) == 0
5945 || ((n->value & GOVD_DATA_SHARE_CLASS)
5947 OMP_CLAUSE_SET_CODE (c, OMP_CLAUSE_PRIVATE);
5948 OMP_CLAUSE_PRIVATE_DEBUG (c) = 1;
5953 case OMP_CLAUSE_LASTPRIVATE:
5954 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
5955 accurately reflect the presence of a FIRSTPRIVATE clause. */
5956 decl = OMP_CLAUSE_DECL (c);
5957 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5958 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)
5959 = (n->value & GOVD_FIRSTPRIVATE) != 0;
5962 case OMP_CLAUSE_REDUCTION:
5963 case OMP_CLAUSE_COPYIN:
5964 case OMP_CLAUSE_COPYPRIVATE:
5966 case OMP_CLAUSE_NUM_THREADS:
5967 case OMP_CLAUSE_SCHEDULE:
5968 case OMP_CLAUSE_NOWAIT:
5969 case OMP_CLAUSE_ORDERED:
5970 case OMP_CLAUSE_DEFAULT:
5971 case OMP_CLAUSE_UNTIED:
5972 case OMP_CLAUSE_COLLAPSE:
5980 *list_p = OMP_CLAUSE_CHAIN (c);
5982 list_p = &OMP_CLAUSE_CHAIN (c);
5985 /* Add in any implicit data sharing. */
5986 splay_tree_foreach (ctx->variables, gimplify_adjust_omp_clauses_1, list_p);
5988 gimplify_omp_ctxp = ctx->outer_context;
5989 delete_omp_context (ctx);
5992 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
5993 gimplification of the body, as well as scanning the body for used
5994 variables. We need to do this scan now, because variable-sized
5995 decls will be decomposed during gimplification. */
5998 gimplify_omp_parallel (tree *expr_p, gimple_seq *pre_p)
6000 tree expr = *expr_p;
6002 gimple_seq body = NULL;
6003 struct gimplify_ctx gctx;
6005 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr), pre_p,
6006 OMP_PARALLEL_COMBINED (expr)
6007 ? ORT_COMBINED_PARALLEL
6010 push_gimplify_context (&gctx);
6012 g = gimplify_and_return_first (OMP_PARALLEL_BODY (expr), &body);
6013 if (gimple_code (g) == GIMPLE_BIND)
6014 pop_gimplify_context (g);
6016 pop_gimplify_context (NULL);
6018 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr));
6020 g = gimple_build_omp_parallel (body,
6021 OMP_PARALLEL_CLAUSES (expr),
6022 NULL_TREE, NULL_TREE);
6023 if (OMP_PARALLEL_COMBINED (expr))
6024 gimple_omp_set_subcode (g, GF_OMP_PARALLEL_COMBINED);
6025 gimplify_seq_add_stmt (pre_p, g);
6026 *expr_p = NULL_TREE;
6029 /* Gimplify the contents of an OMP_TASK statement. This involves
6030 gimplification of the body, as well as scanning the body for used
6031 variables. We need to do this scan now, because variable-sized
6032 decls will be decomposed during gimplification. */
6035 gimplify_omp_task (tree *expr_p, gimple_seq *pre_p)
6037 tree expr = *expr_p;
6039 gimple_seq body = NULL;
6040 struct gimplify_ctx gctx;
6042 gimplify_scan_omp_clauses (&OMP_TASK_CLAUSES (expr), pre_p, ORT_TASK);
6044 push_gimplify_context (&gctx);
6046 g = gimplify_and_return_first (OMP_TASK_BODY (expr), &body);
6047 if (gimple_code (g) == GIMPLE_BIND)
6048 pop_gimplify_context (g);
6050 pop_gimplify_context (NULL);
6052 gimplify_adjust_omp_clauses (&OMP_TASK_CLAUSES (expr));
6054 g = gimple_build_omp_task (body,
6055 OMP_TASK_CLAUSES (expr),
6056 NULL_TREE, NULL_TREE,
6057 NULL_TREE, NULL_TREE, NULL_TREE);
6058 gimplify_seq_add_stmt (pre_p, g);
6059 *expr_p = NULL_TREE;
6062 /* Gimplify the gross structure of an OMP_FOR statement. */
6064 static enum gimplify_status
6065 gimplify_omp_for (tree *expr_p, gimple_seq *pre_p)
6067 tree for_stmt, decl, var, t;
6068 enum gimplify_status ret = GS_ALL_DONE;
6069 enum gimplify_status tret;
6071 gimple_seq for_body, for_pre_body;
6076 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt), pre_p,
6079 /* Handle OMP_FOR_INIT. */
6080 for_pre_body = NULL;
6081 gimplify_and_add (OMP_FOR_PRE_BODY (for_stmt), &for_pre_body);
6082 OMP_FOR_PRE_BODY (for_stmt) = NULL_TREE;
6084 for_body = gimple_seq_alloc ();
6085 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt))
6086 == TREE_VEC_LENGTH (OMP_FOR_COND (for_stmt)));
6087 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt))
6088 == TREE_VEC_LENGTH (OMP_FOR_INCR (for_stmt)));
6089 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)); i++)
6091 t = TREE_VEC_ELT (OMP_FOR_INIT (for_stmt), i);
6092 gcc_assert (TREE_CODE (t) == MODIFY_EXPR);
6093 decl = TREE_OPERAND (t, 0);
6094 gcc_assert (DECL_P (decl));
6095 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl))
6096 || POINTER_TYPE_P (TREE_TYPE (decl)));
6098 /* Make sure the iteration variable is private. */
6099 if (omp_is_private (gimplify_omp_ctxp, decl))
6100 omp_notice_variable (gimplify_omp_ctxp, decl, true);
6102 omp_add_variable (gimplify_omp_ctxp, decl, GOVD_PRIVATE | GOVD_SEEN);
6104 /* If DECL is not a gimple register, create a temporary variable to act
6105 as an iteration counter. This is valid, since DECL cannot be
6106 modified in the body of the loop. */
6107 if (!is_gimple_reg (decl))
6109 var = create_tmp_var (TREE_TYPE (decl), get_name (decl));
6110 TREE_OPERAND (t, 0) = var;
6112 gimplify_seq_add_stmt (&for_body, gimple_build_assign (decl, var));
6114 omp_add_variable (gimplify_omp_ctxp, var, GOVD_PRIVATE | GOVD_SEEN);
6119 tret = gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
6120 is_gimple_val, fb_rvalue);
6121 ret = MIN (ret, tret);
6122 if (ret == GS_ERROR)
6125 /* Handle OMP_FOR_COND. */
6126 t = TREE_VEC_ELT (OMP_FOR_COND (for_stmt), i);
6127 gcc_assert (COMPARISON_CLASS_P (t));
6128 gcc_assert (TREE_OPERAND (t, 0) == decl);
6130 tret = gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
6131 is_gimple_val, fb_rvalue);
6132 ret = MIN (ret, tret);
6134 /* Handle OMP_FOR_INCR. */
6135 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6136 switch (TREE_CODE (t))
6138 case PREINCREMENT_EXPR:
6139 case POSTINCREMENT_EXPR:
6140 t = build_int_cst (TREE_TYPE (decl), 1);
6141 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
6142 t = build2 (MODIFY_EXPR, TREE_TYPE (var), var, t);
6143 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i) = t;
6146 case PREDECREMENT_EXPR:
6147 case POSTDECREMENT_EXPR:
6148 t = build_int_cst (TREE_TYPE (decl), -1);
6149 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
6150 t = build2 (MODIFY_EXPR, TREE_TYPE (var), var, t);
6151 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i) = t;
6155 gcc_assert (TREE_OPERAND (t, 0) == decl);
6156 TREE_OPERAND (t, 0) = var;
6158 t = TREE_OPERAND (t, 1);
6159 switch (TREE_CODE (t))
6162 if (TREE_OPERAND (t, 1) == decl)
6164 TREE_OPERAND (t, 1) = TREE_OPERAND (t, 0);
6165 TREE_OPERAND (t, 0) = var;
6171 case POINTER_PLUS_EXPR:
6172 gcc_assert (TREE_OPERAND (t, 0) == decl);
6173 TREE_OPERAND (t, 0) = var;
6179 tret = gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
6180 is_gimple_val, fb_rvalue);
6181 ret = MIN (ret, tret);
6188 if (var != decl || TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)) > 1)
6191 for (c = OMP_FOR_CLAUSES (for_stmt); c ; c = OMP_CLAUSE_CHAIN (c))
6192 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
6193 && OMP_CLAUSE_DECL (c) == decl
6194 && OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c) == NULL)
6196 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6197 gcc_assert (TREE_CODE (t) == MODIFY_EXPR);
6198 gcc_assert (TREE_OPERAND (t, 0) == var);
6199 t = TREE_OPERAND (t, 1);
6200 gcc_assert (TREE_CODE (t) == PLUS_EXPR
6201 || TREE_CODE (t) == MINUS_EXPR
6202 || TREE_CODE (t) == POINTER_PLUS_EXPR);
6203 gcc_assert (TREE_OPERAND (t, 0) == var);
6204 t = build2 (TREE_CODE (t), TREE_TYPE (decl), decl,
6205 TREE_OPERAND (t, 1));
6206 gimplify_assign (decl, t,
6207 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c));
6212 gimplify_and_add (OMP_FOR_BODY (for_stmt), &for_body);
6214 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt));
6216 gfor = gimple_build_omp_for (for_body, OMP_FOR_CLAUSES (for_stmt),
6217 TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)),
6220 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)); i++)
6222 t = TREE_VEC_ELT (OMP_FOR_INIT (for_stmt), i);
6223 gimple_omp_for_set_index (gfor, i, TREE_OPERAND (t, 0));
6224 gimple_omp_for_set_initial (gfor, i, TREE_OPERAND (t, 1));
6225 t = TREE_VEC_ELT (OMP_FOR_COND (for_stmt), i);
6226 gimple_omp_for_set_cond (gfor, i, TREE_CODE (t));
6227 gimple_omp_for_set_final (gfor, i, TREE_OPERAND (t, 1));
6228 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6229 gimple_omp_for_set_incr (gfor, i, TREE_OPERAND (t, 1));
6232 gimplify_seq_add_stmt (pre_p, gfor);
6233 return ret == GS_ALL_DONE ? GS_ALL_DONE : GS_ERROR;
6236 /* Gimplify the gross structure of other OpenMP worksharing constructs.
6237 In particular, OMP_SECTIONS and OMP_SINGLE. */
6240 gimplify_omp_workshare (tree *expr_p, gimple_seq *pre_p)
6242 tree expr = *expr_p;
6244 gimple_seq body = NULL;
6246 gimplify_scan_omp_clauses (&OMP_CLAUSES (expr), pre_p, ORT_WORKSHARE);
6247 gimplify_and_add (OMP_BODY (expr), &body);
6248 gimplify_adjust_omp_clauses (&OMP_CLAUSES (expr));
6250 if (TREE_CODE (expr) == OMP_SECTIONS)
6251 stmt = gimple_build_omp_sections (body, OMP_CLAUSES (expr));
6252 else if (TREE_CODE (expr) == OMP_SINGLE)
6253 stmt = gimple_build_omp_single (body, OMP_CLAUSES (expr));
6257 gimplify_seq_add_stmt (pre_p, stmt);
6260 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
6261 stabilized the lhs of the atomic operation as *ADDR. Return true if
6262 EXPR is this stabilized form. */
6265 goa_lhs_expr_p (tree expr, tree addr)
6267 /* Also include casts to other type variants. The C front end is fond
6268 of adding these for e.g. volatile variables. This is like
6269 STRIP_TYPE_NOPS but includes the main variant lookup. */
6270 STRIP_USELESS_TYPE_CONVERSION (expr);
6272 if (TREE_CODE (expr) == INDIRECT_REF)
6274 expr = TREE_OPERAND (expr, 0);
6276 && (CONVERT_EXPR_P (expr)
6277 || TREE_CODE (expr) == NON_LVALUE_EXPR)
6278 && TREE_CODE (expr) == TREE_CODE (addr)
6279 && types_compatible_p (TREE_TYPE (expr), TREE_TYPE (addr)))
6281 expr = TREE_OPERAND (expr, 0);
6282 addr = TREE_OPERAND (addr, 0);
6286 return (TREE_CODE (addr) == ADDR_EXPR
6287 && TREE_CODE (expr) == ADDR_EXPR
6288 && TREE_OPERAND (addr, 0) == TREE_OPERAND (expr, 0));
6290 if (TREE_CODE (addr) == ADDR_EXPR && expr == TREE_OPERAND (addr, 0))
6295 /* Walk *EXPR_P and replace
6296 appearances of *LHS_ADDR with LHS_VAR. If an expression does not involve
6297 the lhs, evaluate it into a temporary. Return 1 if the lhs appeared as
6298 a subexpression, 0 if it did not, or -1 if an error was encountered. */
6301 goa_stabilize_expr (tree *expr_p, gimple_seq *pre_p, tree lhs_addr,
6304 tree expr = *expr_p;
6307 if (goa_lhs_expr_p (expr, lhs_addr))
6312 if (is_gimple_val (expr))
6316 switch (TREE_CODE_CLASS (TREE_CODE (expr)))
6319 case tcc_comparison:
6320 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p, lhs_addr,
6323 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p, lhs_addr,
6326 case tcc_expression:
6327 switch (TREE_CODE (expr))
6329 case TRUTH_ANDIF_EXPR:
6330 case TRUTH_ORIF_EXPR:
6331 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p,
6333 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p,
6346 enum gimplify_status gs;
6347 gs = gimplify_expr (expr_p, pre_p, NULL, is_gimple_val, fb_rvalue);
6348 if (gs != GS_ALL_DONE)
6356 /* Gimplify an OMP_ATOMIC statement. */
6358 static enum gimplify_status
6359 gimplify_omp_atomic (tree *expr_p, gimple_seq *pre_p)
6361 tree addr = TREE_OPERAND (*expr_p, 0);
6362 tree rhs = TREE_OPERAND (*expr_p, 1);
6363 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr)));
6366 tmp_load = create_tmp_reg (type, NULL);
6367 if (goa_stabilize_expr (&rhs, pre_p, addr, tmp_load) < 0)
6370 if (gimplify_expr (&addr, pre_p, NULL, is_gimple_val, fb_rvalue)
6374 gimplify_seq_add_stmt (pre_p, gimple_build_omp_atomic_load (tmp_load, addr));
6375 if (gimplify_expr (&rhs, pre_p, NULL, is_gimple_val, fb_rvalue)
6378 gimplify_seq_add_stmt (pre_p, gimple_build_omp_atomic_store (rhs));
6385 /* Converts the GENERIC expression tree *EXPR_P to GIMPLE. If the
6386 expression produces a value to be used as an operand inside a GIMPLE
6387 statement, the value will be stored back in *EXPR_P. This value will
6388 be a tree of class tcc_declaration, tcc_constant, tcc_reference or
6389 an SSA_NAME. The corresponding sequence of GIMPLE statements is
6390 emitted in PRE_P and POST_P.
6392 Additionally, this process may overwrite parts of the input
6393 expression during gimplification. Ideally, it should be
6394 possible to do non-destructive gimplification.
6396 EXPR_P points to the GENERIC expression to convert to GIMPLE. If
6397 the expression needs to evaluate to a value to be used as
6398 an operand in a GIMPLE statement, this value will be stored in
6399 *EXPR_P on exit. This happens when the caller specifies one
6400 of fb_lvalue or fb_rvalue fallback flags.
6402 PRE_P will contain the sequence of GIMPLE statements corresponding
6403 to the evaluation of EXPR and all the side-effects that must
6404 be executed before the main expression. On exit, the last
6405 statement of PRE_P is the core statement being gimplified. For
6406 instance, when gimplifying 'if (++a)' the last statement in
6407 PRE_P will be 'if (t.1)' where t.1 is the result of
6408 pre-incrementing 'a'.
6410 POST_P will contain the sequence of GIMPLE statements corresponding
6411 to the evaluation of all the side-effects that must be executed
6412 after the main expression. If this is NULL, the post
6413 side-effects are stored at the end of PRE_P.
6415 The reason why the output is split in two is to handle post
6416 side-effects explicitly. In some cases, an expression may have
6417 inner and outer post side-effects which need to be emitted in
6418 an order different from the one given by the recursive
6419 traversal. For instance, for the expression (*p--)++ the post
6420 side-effects of '--' must actually occur *after* the post
6421 side-effects of '++'. However, gimplification will first visit
6422 the inner expression, so if a separate POST sequence was not
6423 used, the resulting sequence would be:
6430 However, the post-decrement operation in line #2 must not be
6431 evaluated until after the store to *p at line #4, so the
6432 correct sequence should be:
6439 So, by specifying a separate post queue, it is possible
6440 to emit the post side-effects in the correct order.
6441 If POST_P is NULL, an internal queue will be used. Before
6442 returning to the caller, the sequence POST_P is appended to
6443 the main output sequence PRE_P.
6445 GIMPLE_TEST_F points to a function that takes a tree T and
6446 returns nonzero if T is in the GIMPLE form requested by the
6447 caller. The GIMPLE predicates are in tree-gimple.c.
6449 FALLBACK tells the function what sort of a temporary we want if
6450 gimplification cannot produce an expression that complies with
6453 fb_none means that no temporary should be generated
6454 fb_rvalue means that an rvalue is OK to generate
6455 fb_lvalue means that an lvalue is OK to generate
6456 fb_either means that either is OK, but an lvalue is preferable.
6457 fb_mayfail means that gimplification may fail (in which case
6458 GS_ERROR will be returned)
6460 The return value is either GS_ERROR or GS_ALL_DONE, since this
6461 function iterates until EXPR is completely gimplified or an error
6464 enum gimplify_status
6465 gimplify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
6466 bool (*gimple_test_f) (tree), fallback_t fallback)
6469 gimple_seq internal_pre = NULL;
6470 gimple_seq internal_post = NULL;
6473 location_t saved_location;
6474 enum gimplify_status ret;
6475 gimple_stmt_iterator pre_last_gsi, post_last_gsi;
6477 save_expr = *expr_p;
6478 if (save_expr == NULL_TREE)
6481 /* If we are gimplifying a top-level statement, PRE_P must be valid. */
6482 is_statement = gimple_test_f == is_gimple_stmt;
6486 /* Consistency checks. */
6487 if (gimple_test_f == is_gimple_reg)
6488 gcc_assert (fallback & (fb_rvalue | fb_lvalue));
6489 else if (gimple_test_f == is_gimple_val
6490 || gimple_test_f == is_gimple_call_addr
6491 || gimple_test_f == is_gimple_condexpr
6492 || gimple_test_f == is_gimple_mem_rhs
6493 || gimple_test_f == is_gimple_mem_rhs_or_call
6494 || gimple_test_f == is_gimple_reg_rhs
6495 || gimple_test_f == is_gimple_reg_rhs_or_call
6496 || gimple_test_f == is_gimple_asm_val)
6497 gcc_assert (fallback & fb_rvalue);
6498 else if (gimple_test_f == is_gimple_min_lval
6499 || gimple_test_f == is_gimple_lvalue)
6500 gcc_assert (fallback & fb_lvalue);
6501 else if (gimple_test_f == is_gimple_addressable)
6502 gcc_assert (fallback & fb_either);
6503 else if (gimple_test_f == is_gimple_stmt)
6504 gcc_assert (fallback == fb_none);
6507 /* We should have recognized the GIMPLE_TEST_F predicate to
6508 know what kind of fallback to use in case a temporary is
6509 needed to hold the value or address of *EXPR_P. */
6513 /* We used to check the predicate here and return immediately if it
6514 succeeds. This is wrong; the design is for gimplification to be
6515 idempotent, and for the predicates to only test for valid forms, not
6516 whether they are fully simplified. */
6518 pre_p = &internal_pre;
6521 post_p = &internal_post;
6523 /* Remember the last statements added to PRE_P and POST_P. Every
6524 new statement added by the gimplification helpers needs to be
6525 annotated with location information. To centralize the
6526 responsibility, we remember the last statement that had been
6527 added to both queues before gimplifying *EXPR_P. If
6528 gimplification produces new statements in PRE_P and POST_P, those
6529 statements will be annotated with the same location information
6531 pre_last_gsi = gsi_last (*pre_p);
6532 post_last_gsi = gsi_last (*post_p);
6534 saved_location = input_location;
6535 if (save_expr != error_mark_node
6536 && EXPR_HAS_LOCATION (*expr_p))
6537 input_location = EXPR_LOCATION (*expr_p);
6539 /* Loop over the specific gimplifiers until the toplevel node
6540 remains the same. */
6543 /* Strip away as many useless type conversions as possible
6545 STRIP_USELESS_TYPE_CONVERSION (*expr_p);
6547 /* Remember the expr. */
6548 save_expr = *expr_p;
6550 /* Die, die, die, my darling. */
6551 if (save_expr == error_mark_node
6552 || (TREE_TYPE (save_expr)
6553 && TREE_TYPE (save_expr) == error_mark_node))
6559 /* Do any language-specific gimplification. */
6560 ret = ((enum gimplify_status)
6561 lang_hooks.gimplify_expr (expr_p, pre_p, post_p));
6564 if (*expr_p == NULL_TREE)
6566 if (*expr_p != save_expr)
6569 else if (ret != GS_UNHANDLED)
6572 /* Make sure that all the cases set 'ret' appropriately. */
6574 switch (TREE_CODE (*expr_p))
6576 /* First deal with the special cases. */
6578 case POSTINCREMENT_EXPR:
6579 case POSTDECREMENT_EXPR:
6580 case PREINCREMENT_EXPR:
6581 case PREDECREMENT_EXPR:
6582 ret = gimplify_self_mod_expr (expr_p, pre_p, post_p,
6583 fallback != fb_none);
6587 case ARRAY_RANGE_REF:
6591 case VIEW_CONVERT_EXPR:
6592 ret = gimplify_compound_lval (expr_p, pre_p, post_p,
6593 fallback ? fallback : fb_rvalue);
6597 ret = gimplify_cond_expr (expr_p, pre_p, fallback);
6599 /* C99 code may assign to an array in a structure value of a
6600 conditional expression, and this has undefined behavior
6601 only on execution, so create a temporary if an lvalue is
6603 if (fallback == fb_lvalue)
6605 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6606 mark_addressable (*expr_p);
6612 ret = gimplify_call_expr (expr_p, pre_p, fallback != fb_none);
6614 /* C99 code may assign to an array in a structure returned
6615 from a function, and this has undefined behavior only on
6616 execution, so create a temporary if an lvalue is
6618 if (fallback == fb_lvalue)
6620 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6621 mark_addressable (*expr_p);
6630 ret = gimplify_compound_expr (expr_p, pre_p, fallback != fb_none);
6633 case COMPOUND_LITERAL_EXPR:
6634 ret = gimplify_compound_literal_expr (expr_p, pre_p);
6639 ret = gimplify_modify_expr (expr_p, pre_p, post_p,
6640 fallback != fb_none);
6643 case TRUTH_ANDIF_EXPR:
6644 case TRUTH_ORIF_EXPR:
6645 /* Pass the source location of the outer expression. */
6646 ret = gimplify_boolean_expr (expr_p, saved_location);
6649 case TRUTH_NOT_EXPR:
6650 if (TREE_CODE (TREE_TYPE (*expr_p)) != BOOLEAN_TYPE)
6652 tree type = TREE_TYPE (*expr_p);
6653 *expr_p = fold_convert (type, gimple_boolify (*expr_p));
6658 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6659 is_gimple_val, fb_rvalue);
6660 recalculate_side_effects (*expr_p);
6664 ret = gimplify_addr_expr (expr_p, pre_p, post_p);
6668 ret = gimplify_va_arg_expr (expr_p, pre_p, post_p);
6672 if (IS_EMPTY_STMT (*expr_p))
6678 if (VOID_TYPE_P (TREE_TYPE (*expr_p))
6679 || fallback == fb_none)
6681 /* Just strip a conversion to void (or in void context) and
6683 *expr_p = TREE_OPERAND (*expr_p, 0);
6688 ret = gimplify_conversion (expr_p);
6689 if (ret == GS_ERROR)
6691 if (*expr_p != save_expr)
6695 case FIX_TRUNC_EXPR:
6696 /* unary_expr: ... | '(' cast ')' val | ... */
6697 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6698 is_gimple_val, fb_rvalue);
6699 recalculate_side_effects (*expr_p);
6703 *expr_p = fold_indirect_ref_loc (input_location, *expr_p);
6704 if (*expr_p != save_expr)
6709 /* else fall through. */
6710 case ALIGN_INDIRECT_REF:
6711 case MISALIGNED_INDIRECT_REF:
6712 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6713 is_gimple_reg, fb_rvalue);
6714 recalculate_side_effects (*expr_p);
6717 /* Constants need not be gimplified. */
6728 /* If we require an lvalue, such as for ADDR_EXPR, retain the
6729 CONST_DECL node. Otherwise the decl is replaceable by its
6731 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
6732 if (fallback & fb_lvalue)
6736 *expr_p = DECL_INITIAL (*expr_p);
6742 ret = gimplify_decl_expr (expr_p, pre_p);
6746 ret = gimplify_bind_expr (expr_p, pre_p);
6750 ret = gimplify_loop_expr (expr_p, pre_p);
6754 ret = gimplify_switch_expr (expr_p, pre_p);
6758 ret = gimplify_exit_expr (expr_p);
6762 /* If the target is not LABEL, then it is a computed jump
6763 and the target needs to be gimplified. */
6764 if (TREE_CODE (GOTO_DESTINATION (*expr_p)) != LABEL_DECL)
6766 ret = gimplify_expr (&GOTO_DESTINATION (*expr_p), pre_p,
6767 NULL, is_gimple_val, fb_rvalue);
6768 if (ret == GS_ERROR)
6771 gimplify_seq_add_stmt (pre_p,
6772 gimple_build_goto (GOTO_DESTINATION (*expr_p)));
6777 gimplify_seq_add_stmt (pre_p,
6778 gimple_build_predict (PREDICT_EXPR_PREDICTOR (*expr_p),
6779 PREDICT_EXPR_OUTCOME (*expr_p)));
6785 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p))
6786 == current_function_decl);
6787 gimplify_seq_add_stmt (pre_p,
6788 gimple_build_label (LABEL_EXPR_LABEL (*expr_p)));
6791 case CASE_LABEL_EXPR:
6792 ret = gimplify_case_label_expr (expr_p, pre_p);
6796 ret = gimplify_return_expr (*expr_p, pre_p);
6800 /* Don't reduce this in place; let gimplify_init_constructor work its
6801 magic. Buf if we're just elaborating this for side effects, just
6802 gimplify any element that has side-effects. */
6803 if (fallback == fb_none)
6805 unsigned HOST_WIDE_INT ix;
6806 constructor_elt *ce;
6807 tree temp = NULL_TREE;
6809 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (*expr_p),
6812 if (TREE_SIDE_EFFECTS (ce->value))
6813 append_to_statement_list (ce->value, &temp);
6816 ret = temp ? GS_OK : GS_ALL_DONE;
6818 /* C99 code may assign to an array in a constructed
6819 structure or union, and this has undefined behavior only
6820 on execution, so create a temporary if an lvalue is
6822 else if (fallback == fb_lvalue)
6824 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6825 mark_addressable (*expr_p);
6832 /* The following are special cases that are not handled by the
6833 original GIMPLE grammar. */
6835 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
6838 ret = gimplify_save_expr (expr_p, pre_p, post_p);
6843 enum gimplify_status r0, r1, r2;
6845 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6846 post_p, is_gimple_lvalue, fb_either);
6847 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
6848 post_p, is_gimple_val, fb_rvalue);
6849 r2 = gimplify_expr (&TREE_OPERAND (*expr_p, 2), pre_p,
6850 post_p, is_gimple_val, fb_rvalue);
6851 recalculate_side_effects (*expr_p);
6853 ret = MIN (r0, MIN (r1, r2));
6857 case TARGET_MEM_REF:
6859 enum gimplify_status r0 = GS_ALL_DONE, r1 = GS_ALL_DONE;
6861 if (TMR_SYMBOL (*expr_p))
6862 r0 = gimplify_expr (&TMR_SYMBOL (*expr_p), pre_p,
6863 post_p, is_gimple_lvalue, fb_either);
6864 else if (TMR_BASE (*expr_p))
6865 r0 = gimplify_expr (&TMR_BASE (*expr_p), pre_p,
6866 post_p, is_gimple_val, fb_either);
6867 if (TMR_INDEX (*expr_p))
6868 r1 = gimplify_expr (&TMR_INDEX (*expr_p), pre_p,
6869 post_p, is_gimple_val, fb_rvalue);
6870 /* TMR_STEP and TMR_OFFSET are always integer constants. */
6875 case NON_LVALUE_EXPR:
6876 /* This should have been stripped above. */
6880 ret = gimplify_asm_expr (expr_p, pre_p, post_p);
6883 case TRY_FINALLY_EXPR:
6884 case TRY_CATCH_EXPR:
6886 gimple_seq eval, cleanup;
6889 eval = cleanup = NULL;
6890 gimplify_and_add (TREE_OPERAND (*expr_p, 0), &eval);
6891 gimplify_and_add (TREE_OPERAND (*expr_p, 1), &cleanup);
6892 /* Don't create bogus GIMPLE_TRY with empty cleanup. */
6893 if (gimple_seq_empty_p (cleanup))
6895 gimple_seq_add_seq (pre_p, eval);
6899 try_ = gimple_build_try (eval, cleanup,
6900 TREE_CODE (*expr_p) == TRY_FINALLY_EXPR
6901 ? GIMPLE_TRY_FINALLY
6902 : GIMPLE_TRY_CATCH);
6903 if (TREE_CODE (*expr_p) == TRY_CATCH_EXPR)
6904 gimple_try_set_catch_is_cleanup (try_,
6905 TRY_CATCH_IS_CLEANUP (*expr_p));
6906 gimplify_seq_add_stmt (pre_p, try_);
6911 case CLEANUP_POINT_EXPR:
6912 ret = gimplify_cleanup_point_expr (expr_p, pre_p);
6916 ret = gimplify_target_expr (expr_p, pre_p, post_p);
6922 gimple_seq handler = NULL;
6923 gimplify_and_add (CATCH_BODY (*expr_p), &handler);
6924 c = gimple_build_catch (CATCH_TYPES (*expr_p), handler);
6925 gimplify_seq_add_stmt (pre_p, c);
6930 case EH_FILTER_EXPR:
6933 gimple_seq failure = NULL;
6935 gimplify_and_add (EH_FILTER_FAILURE (*expr_p), &failure);
6936 ehf = gimple_build_eh_filter (EH_FILTER_TYPES (*expr_p), failure);
6937 gimple_set_no_warning (ehf, TREE_NO_WARNING (*expr_p));
6938 gimplify_seq_add_stmt (pre_p, ehf);
6945 enum gimplify_status r0, r1;
6946 r0 = gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p), pre_p,
6947 post_p, is_gimple_val, fb_rvalue);
6948 r1 = gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p), pre_p,
6949 post_p, is_gimple_val, fb_rvalue);
6950 TREE_SIDE_EFFECTS (*expr_p) = 0;
6956 /* We get here when taking the address of a label. We mark
6957 the label as "forced"; meaning it can never be removed and
6958 it is a potential target for any computed goto. */
6959 FORCED_LABEL (*expr_p) = 1;
6963 case STATEMENT_LIST:
6964 ret = gimplify_statement_list (expr_p, pre_p);
6967 case WITH_SIZE_EXPR:
6969 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6970 post_p == &internal_post ? NULL : post_p,
6971 gimple_test_f, fallback);
6972 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
6973 is_gimple_val, fb_rvalue);
6980 ret = gimplify_var_or_parm_decl (expr_p);
6984 /* When within an OpenMP context, notice uses of variables. */
6985 if (gimplify_omp_ctxp)
6986 omp_notice_variable (gimplify_omp_ctxp, *expr_p, true);
6991 /* Allow callbacks into the gimplifier during optimization. */
6996 gimplify_omp_parallel (expr_p, pre_p);
7001 gimplify_omp_task (expr_p, pre_p);
7006 ret = gimplify_omp_for (expr_p, pre_p);
7011 gimplify_omp_workshare (expr_p, pre_p);
7020 gimple_seq body = NULL;
7023 gimplify_and_add (OMP_BODY (*expr_p), &body);
7024 switch (TREE_CODE (*expr_p))
7027 g = gimple_build_omp_section (body);
7030 g = gimple_build_omp_master (body);
7033 g = gimple_build_omp_ordered (body);
7036 g = gimple_build_omp_critical (body,
7037 OMP_CRITICAL_NAME (*expr_p));
7042 gimplify_seq_add_stmt (pre_p, g);
7048 ret = gimplify_omp_atomic (expr_p, pre_p);
7051 case POINTER_PLUS_EXPR:
7052 /* Convert ((type *)A)+offset into &A->field_of_type_and_offset.
7053 The second is gimple immediate saving a need for extra statement.
7055 if (TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
7056 && (tmp = maybe_fold_offset_to_address
7057 (EXPR_LOCATION (*expr_p),
7058 TREE_OPERAND (*expr_p, 0), TREE_OPERAND (*expr_p, 1),
7059 TREE_TYPE (*expr_p))))
7065 /* Convert (void *)&a + 4 into (void *)&a[1]. */
7066 if (TREE_CODE (TREE_OPERAND (*expr_p, 0)) == NOP_EXPR
7067 && TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
7068 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p,
7070 && (tmp = maybe_fold_offset_to_address
7071 (EXPR_LOCATION (*expr_p),
7072 TREE_OPERAND (TREE_OPERAND (*expr_p, 0), 0),
7073 TREE_OPERAND (*expr_p, 1),
7074 TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p, 0),
7077 *expr_p = fold_convert (TREE_TYPE (*expr_p), tmp);
7084 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p)))
7086 case tcc_comparison:
7087 /* Handle comparison of objects of non scalar mode aggregates
7088 with a call to memcmp. It would be nice to only have to do
7089 this for variable-sized objects, but then we'd have to allow
7090 the same nest of reference nodes we allow for MODIFY_EXPR and
7093 Compare scalar mode aggregates as scalar mode values. Using
7094 memcmp for them would be very inefficient at best, and is
7095 plain wrong if bitfields are involved. */
7097 tree type = TREE_TYPE (TREE_OPERAND (*expr_p, 1));
7099 if (!AGGREGATE_TYPE_P (type))
7101 else if (TYPE_MODE (type) != BLKmode)
7102 ret = gimplify_scalar_mode_aggregate_compare (expr_p);
7104 ret = gimplify_variable_sized_compare (expr_p);
7109 /* If *EXPR_P does not need to be special-cased, handle it
7110 according to its class. */
7112 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7113 post_p, is_gimple_val, fb_rvalue);
7119 enum gimplify_status r0, r1;
7121 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7122 post_p, is_gimple_val, fb_rvalue);
7123 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
7124 post_p, is_gimple_val, fb_rvalue);
7130 case tcc_declaration:
7133 goto dont_recalculate;
7136 gcc_assert (TREE_CODE (*expr_p) == TRUTH_AND_EXPR
7137 || TREE_CODE (*expr_p) == TRUTH_OR_EXPR
7138 || TREE_CODE (*expr_p) == TRUTH_XOR_EXPR);
7142 recalculate_side_effects (*expr_p);
7148 gcc_assert (*expr_p || ret != GS_OK);
7150 while (ret == GS_OK);
7152 /* If we encountered an error_mark somewhere nested inside, either
7153 stub out the statement or propagate the error back out. */
7154 if (ret == GS_ERROR)
7161 /* This was only valid as a return value from the langhook, which
7162 we handled. Make sure it doesn't escape from any other context. */
7163 gcc_assert (ret != GS_UNHANDLED);
7165 if (fallback == fb_none && *expr_p && !is_gimple_stmt (*expr_p))
7167 /* We aren't looking for a value, and we don't have a valid
7168 statement. If it doesn't have side-effects, throw it away. */
7169 if (!TREE_SIDE_EFFECTS (*expr_p))
7171 else if (!TREE_THIS_VOLATILE (*expr_p))
7173 /* This is probably a _REF that contains something nested that
7174 has side effects. Recurse through the operands to find it. */
7175 enum tree_code code = TREE_CODE (*expr_p);
7182 case VIEW_CONVERT_EXPR:
7183 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
7184 gimple_test_f, fallback);
7188 case ARRAY_RANGE_REF:
7189 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
7190 gimple_test_f, fallback);
7191 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
7192 gimple_test_f, fallback);
7196 /* Anything else with side-effects must be converted to
7197 a valid statement before we get here. */
7203 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p))
7204 && TYPE_MODE (TREE_TYPE (*expr_p)) != BLKmode)
7206 /* Historically, the compiler has treated a bare reference
7207 to a non-BLKmode volatile lvalue as forcing a load. */
7208 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p));
7210 /* Normally, we do not want to create a temporary for a
7211 TREE_ADDRESSABLE type because such a type should not be
7212 copied by bitwise-assignment. However, we make an
7213 exception here, as all we are doing here is ensuring that
7214 we read the bytes that make up the type. We use
7215 create_tmp_var_raw because create_tmp_var will abort when
7216 given a TREE_ADDRESSABLE type. */
7217 tree tmp = create_tmp_var_raw (type, "vol");
7218 gimple_add_tmp_var (tmp);
7219 gimplify_assign (tmp, *expr_p, pre_p);
7223 /* We can't do anything useful with a volatile reference to
7224 an incomplete type, so just throw it away. Likewise for
7225 a BLKmode type, since any implicit inner load should
7226 already have been turned into an explicit one by the
7227 gimplification process. */
7231 /* If we are gimplifying at the statement level, we're done. Tack
7232 everything together and return. */
7233 if (fallback == fb_none || is_statement)
7235 /* Since *EXPR_P has been converted into a GIMPLE tuple, clear
7236 it out for GC to reclaim it. */
7237 *expr_p = NULL_TREE;
7239 if (!gimple_seq_empty_p (internal_pre)
7240 || !gimple_seq_empty_p (internal_post))
7242 gimplify_seq_add_seq (&internal_pre, internal_post);
7243 gimplify_seq_add_seq (pre_p, internal_pre);
7246 /* The result of gimplifying *EXPR_P is going to be the last few
7247 statements in *PRE_P and *POST_P. Add location information
7248 to all the statements that were added by the gimplification
7250 if (!gimple_seq_empty_p (*pre_p))
7251 annotate_all_with_location_after (*pre_p, pre_last_gsi, input_location);
7253 if (!gimple_seq_empty_p (*post_p))
7254 annotate_all_with_location_after (*post_p, post_last_gsi,
7260 #ifdef ENABLE_GIMPLE_CHECKING
7263 enum tree_code code = TREE_CODE (*expr_p);
7264 /* These expressions should already be in gimple IR form. */
7265 gcc_assert (code != MODIFY_EXPR
7267 && code != BIND_EXPR
7268 && code != CATCH_EXPR
7269 && (code != COND_EXPR || gimplify_ctxp->allow_rhs_cond_expr)
7270 && code != EH_FILTER_EXPR
7271 && code != GOTO_EXPR
7272 && code != LABEL_EXPR
7273 && code != LOOP_EXPR
7274 && code != SWITCH_EXPR
7275 && code != TRY_FINALLY_EXPR
7276 && code != OMP_CRITICAL
7278 && code != OMP_MASTER
7279 && code != OMP_ORDERED
7280 && code != OMP_PARALLEL
7281 && code != OMP_SECTIONS
7282 && code != OMP_SECTION
7283 && code != OMP_SINGLE);
7287 /* Otherwise we're gimplifying a subexpression, so the resulting
7288 value is interesting. If it's a valid operand that matches
7289 GIMPLE_TEST_F, we're done. Unless we are handling some
7290 post-effects internally; if that's the case, we need to copy into
7291 a temporary before adding the post-effects to POST_P. */
7292 if (gimple_seq_empty_p (internal_post) && (*gimple_test_f) (*expr_p))
7295 /* Otherwise, we need to create a new temporary for the gimplified
7298 /* We can't return an lvalue if we have an internal postqueue. The
7299 object the lvalue refers to would (probably) be modified by the
7300 postqueue; we need to copy the value out first, which means an
7302 if ((fallback & fb_lvalue)
7303 && gimple_seq_empty_p (internal_post)
7304 && is_gimple_addressable (*expr_p))
7306 /* An lvalue will do. Take the address of the expression, store it
7307 in a temporary, and replace the expression with an INDIRECT_REF of
7309 tmp = build_fold_addr_expr_loc (input_location, *expr_p);
7310 gimplify_expr (&tmp, pre_p, post_p, is_gimple_reg, fb_rvalue);
7311 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (tmp)), tmp);
7313 else if ((fallback & fb_rvalue) && is_gimple_reg_rhs_or_call (*expr_p))
7315 /* An rvalue will do. Assign the gimplified expression into a
7316 new temporary TMP and replace the original expression with
7317 TMP. First, make sure that the expression has a type so that
7318 it can be assigned into a temporary. */
7319 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p)));
7321 if (!gimple_seq_empty_p (internal_post) || (fallback & fb_lvalue))
7322 /* The postqueue might change the value of the expression between
7323 the initialization and use of the temporary, so we can't use a
7324 formal temp. FIXME do we care? */
7326 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
7327 if (TREE_CODE (TREE_TYPE (*expr_p)) == COMPLEX_TYPE
7328 || TREE_CODE (TREE_TYPE (*expr_p)) == VECTOR_TYPE)
7329 DECL_GIMPLE_REG_P (*expr_p) = 1;
7332 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
7336 #ifdef ENABLE_GIMPLE_CHECKING
7337 if (!(fallback & fb_mayfail))
7339 fprintf (stderr, "gimplification failed:\n");
7340 print_generic_expr (stderr, *expr_p, 0);
7341 debug_tree (*expr_p);
7342 internal_error ("gimplification failed");
7345 gcc_assert (fallback & fb_mayfail);
7347 /* If this is an asm statement, and the user asked for the
7348 impossible, don't die. Fail and let gimplify_asm_expr
7354 /* Make sure the temporary matches our predicate. */
7355 gcc_assert ((*gimple_test_f) (*expr_p));
7357 if (!gimple_seq_empty_p (internal_post))
7359 annotate_all_with_location (internal_post, input_location);
7360 gimplify_seq_add_seq (pre_p, internal_post);
7364 input_location = saved_location;
7368 /* Look through TYPE for variable-sized objects and gimplify each such
7369 size that we find. Add to LIST_P any statements generated. */
7372 gimplify_type_sizes (tree type, gimple_seq *list_p)
7376 if (type == NULL || type == error_mark_node)
7379 /* We first do the main variant, then copy into any other variants. */
7380 type = TYPE_MAIN_VARIANT (type);
7382 /* Avoid infinite recursion. */
7383 if (TYPE_SIZES_GIMPLIFIED (type))
7386 TYPE_SIZES_GIMPLIFIED (type) = 1;
7388 switch (TREE_CODE (type))
7394 case FIXED_POINT_TYPE:
7395 gimplify_one_sizepos (&TYPE_MIN_VALUE (type), list_p);
7396 gimplify_one_sizepos (&TYPE_MAX_VALUE (type), list_p);
7398 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
7400 TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (type);
7401 TYPE_MAX_VALUE (t) = TYPE_MAX_VALUE (type);
7406 /* These types may not have declarations, so handle them here. */
7407 gimplify_type_sizes (TREE_TYPE (type), list_p);
7408 gimplify_type_sizes (TYPE_DOMAIN (type), list_p);
7409 /* Ensure VLA bounds aren't removed, for -O0 they should be variables
7410 with assigned stack slots, for -O1+ -g they should be tracked
7412 if (TYPE_DOMAIN (type)
7413 && INTEGRAL_TYPE_P (TYPE_DOMAIN (type)))
7415 t = TYPE_MIN_VALUE (TYPE_DOMAIN (type));
7416 if (t && TREE_CODE (t) == VAR_DECL && DECL_ARTIFICIAL (t))
7417 DECL_IGNORED_P (t) = 0;
7418 t = TYPE_MAX_VALUE (TYPE_DOMAIN (type));
7419 if (t && TREE_CODE (t) == VAR_DECL && DECL_ARTIFICIAL (t))
7420 DECL_IGNORED_P (t) = 0;
7426 case QUAL_UNION_TYPE:
7427 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
7428 if (TREE_CODE (field) == FIELD_DECL)
7430 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field), list_p);
7431 gimplify_one_sizepos (&DECL_SIZE (field), list_p);
7432 gimplify_one_sizepos (&DECL_SIZE_UNIT (field), list_p);
7433 gimplify_type_sizes (TREE_TYPE (field), list_p);
7438 case REFERENCE_TYPE:
7439 /* We used to recurse on the pointed-to type here, which turned out to
7440 be incorrect because its definition might refer to variables not
7441 yet initialized at this point if a forward declaration is involved.
7443 It was actually useful for anonymous pointed-to types to ensure
7444 that the sizes evaluation dominates every possible later use of the
7445 values. Restricting to such types here would be safe since there
7446 is no possible forward declaration around, but would introduce an
7447 undesirable middle-end semantic to anonymity. We then defer to
7448 front-ends the responsibility of ensuring that the sizes are
7449 evaluated both early and late enough, e.g. by attaching artificial
7450 type declarations to the tree. */
7457 gimplify_one_sizepos (&TYPE_SIZE (type), list_p);
7458 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type), list_p);
7460 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
7462 TYPE_SIZE (t) = TYPE_SIZE (type);
7463 TYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (type);
7464 TYPE_SIZES_GIMPLIFIED (t) = 1;
7468 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
7469 a size or position, has had all of its SAVE_EXPRs evaluated.
7470 We add any required statements to *STMT_P. */
7473 gimplify_one_sizepos (tree *expr_p, gimple_seq *stmt_p)
7475 tree type, expr = *expr_p;
7477 /* We don't do anything if the value isn't there, is constant, or contains
7478 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
7479 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
7480 will want to replace it with a new variable, but that will cause problems
7481 if this type is from outside the function. It's OK to have that here. */
7482 if (expr == NULL_TREE || TREE_CONSTANT (expr)
7483 || TREE_CODE (expr) == VAR_DECL
7484 || CONTAINS_PLACEHOLDER_P (expr))
7487 type = TREE_TYPE (expr);
7488 *expr_p = unshare_expr (expr);
7490 gimplify_expr (expr_p, stmt_p, NULL, is_gimple_val, fb_rvalue);
7493 /* Verify that we've an exact type match with the original expression.
7494 In particular, we do not wish to drop a "sizetype" in favour of a
7495 type of similar dimensions. We don't want to pollute the generic
7496 type-stripping code with this knowledge because it doesn't matter
7497 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
7498 and friends retain their "sizetype-ness". */
7499 if (TREE_TYPE (expr) != type
7500 && TREE_CODE (type) == INTEGER_TYPE
7501 && TYPE_IS_SIZETYPE (type))
7506 *expr_p = create_tmp_var (type, NULL);
7507 tmp = build1 (NOP_EXPR, type, expr);
7508 stmt = gimplify_assign (*expr_p, tmp, stmt_p);
7509 if (EXPR_HAS_LOCATION (expr))
7510 gimple_set_location (stmt, EXPR_LOCATION (expr));
7512 gimple_set_location (stmt, input_location);
7517 /* Gimplify the body of statements pointed to by BODY_P and return a
7518 GIMPLE_BIND containing the sequence of GIMPLE statements
7519 corresponding to BODY_P. FNDECL is the function decl containing
7523 gimplify_body (tree *body_p, tree fndecl, bool do_parms)
7525 location_t saved_location = input_location;
7526 gimple_seq parm_stmts, seq;
7528 struct gimplify_ctx gctx;
7530 timevar_push (TV_TREE_GIMPLIFY);
7532 /* Initialize for optimize_insn_for_s{ize,peed}_p possibly called during
7534 default_rtl_profile ();
7536 gcc_assert (gimplify_ctxp == NULL);
7537 push_gimplify_context (&gctx);
7539 /* Unshare most shared trees in the body and in that of any nested functions.
7540 It would seem we don't have to do this for nested functions because
7541 they are supposed to be output and then the outer function gimplified
7542 first, but the g++ front end doesn't always do it that way. */
7543 unshare_body (body_p, fndecl);
7544 unvisit_body (body_p, fndecl);
7546 if (cgraph_node (fndecl)->origin)
7547 nonlocal_vlas = pointer_set_create ();
7549 /* Make sure input_location isn't set to something weird. */
7550 input_location = DECL_SOURCE_LOCATION (fndecl);
7552 /* Resolve callee-copies. This has to be done before processing
7553 the body so that DECL_VALUE_EXPR gets processed correctly. */
7554 parm_stmts = (do_parms) ? gimplify_parameters () : NULL;
7556 /* Gimplify the function's body. */
7558 gimplify_stmt (body_p, &seq);
7559 outer_bind = gimple_seq_first_stmt (seq);
7562 outer_bind = gimple_build_nop ();
7563 gimplify_seq_add_stmt (&seq, outer_bind);
7566 /* The body must contain exactly one statement, a GIMPLE_BIND. If this is
7567 not the case, wrap everything in a GIMPLE_BIND to make it so. */
7568 if (gimple_code (outer_bind) == GIMPLE_BIND
7569 && gimple_seq_first (seq) == gimple_seq_last (seq))
7572 outer_bind = gimple_build_bind (NULL_TREE, seq, NULL);
7574 *body_p = NULL_TREE;
7576 /* If we had callee-copies statements, insert them at the beginning
7577 of the function and clear DECL_VALUE_EXPR_P on the parameters. */
7578 if (!gimple_seq_empty_p (parm_stmts))
7582 gimplify_seq_add_seq (&parm_stmts, gimple_bind_body (outer_bind));
7583 gimple_bind_set_body (outer_bind, parm_stmts);
7585 for (parm = DECL_ARGUMENTS (current_function_decl);
7586 parm; parm = TREE_CHAIN (parm))
7587 if (DECL_HAS_VALUE_EXPR_P (parm))
7589 DECL_HAS_VALUE_EXPR_P (parm) = 0;
7590 DECL_IGNORED_P (parm) = 0;
7596 pointer_set_destroy (nonlocal_vlas);
7597 nonlocal_vlas = NULL;
7600 pop_gimplify_context (outer_bind);
7601 gcc_assert (gimplify_ctxp == NULL);
7603 #ifdef ENABLE_TYPES_CHECKING
7604 if (!errorcount && !sorrycount)
7605 verify_types_in_gimple_seq (gimple_bind_body (outer_bind));
7608 timevar_pop (TV_TREE_GIMPLIFY);
7609 input_location = saved_location;
7614 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
7615 node for the function we want to gimplify.
7617 Returns the sequence of GIMPLE statements corresponding to the body
7621 gimplify_function_tree (tree fndecl)
7623 tree oldfn, parm, ret;
7627 gcc_assert (!gimple_body (fndecl));
7629 oldfn = current_function_decl;
7630 current_function_decl = fndecl;
7631 if (DECL_STRUCT_FUNCTION (fndecl))
7632 push_cfun (DECL_STRUCT_FUNCTION (fndecl));
7634 push_struct_function (fndecl);
7636 for (parm = DECL_ARGUMENTS (fndecl); parm ; parm = TREE_CHAIN (parm))
7638 /* Preliminarily mark non-addressed complex variables as eligible
7639 for promotion to gimple registers. We'll transform their uses
7641 if ((TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
7642 || TREE_CODE (TREE_TYPE (parm)) == VECTOR_TYPE)
7643 && !TREE_THIS_VOLATILE (parm)
7644 && !needs_to_live_in_memory (parm))
7645 DECL_GIMPLE_REG_P (parm) = 1;
7648 ret = DECL_RESULT (fndecl);
7649 if ((TREE_CODE (TREE_TYPE (ret)) == COMPLEX_TYPE
7650 || TREE_CODE (TREE_TYPE (ret)) == VECTOR_TYPE)
7651 && !needs_to_live_in_memory (ret))
7652 DECL_GIMPLE_REG_P (ret) = 1;
7654 bind = gimplify_body (&DECL_SAVED_TREE (fndecl), fndecl, true);
7656 /* The tree body of the function is no longer needed, replace it
7657 with the new GIMPLE body. */
7658 seq = gimple_seq_alloc ();
7659 gimple_seq_add_stmt (&seq, bind);
7660 gimple_set_body (fndecl, seq);
7662 /* If we're instrumenting function entry/exit, then prepend the call to
7663 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
7664 catch the exit hook. */
7665 /* ??? Add some way to ignore exceptions for this TFE. */
7666 if (flag_instrument_function_entry_exit
7667 && !DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl)
7668 && !flag_instrument_functions_exclude_p (fndecl))
7673 gimple_seq cleanup = NULL, body = NULL;
7675 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_EXIT];
7676 gimplify_seq_add_stmt (&cleanup, gimple_build_call (x, 0));
7677 tf = gimple_build_try (seq, cleanup, GIMPLE_TRY_FINALLY);
7679 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_ENTER];
7680 gimplify_seq_add_stmt (&body, gimple_build_call (x, 0));
7681 gimplify_seq_add_stmt (&body, tf);
7682 new_bind = gimple_build_bind (NULL, body, gimple_bind_block (bind));
7683 /* Clear the block for BIND, since it is no longer directly inside
7684 the function, but within a try block. */
7685 gimple_bind_set_block (bind, NULL);
7687 /* Replace the current function body with the body
7688 wrapped in the try/finally TF. */
7689 seq = gimple_seq_alloc ();
7690 gimple_seq_add_stmt (&seq, new_bind);
7691 gimple_set_body (fndecl, seq);
7694 DECL_SAVED_TREE (fndecl) = NULL_TREE;
7695 cfun->curr_properties = PROP_gimple_any;
7697 current_function_decl = oldfn;
7702 /* Some transformations like inlining may invalidate the GIMPLE form
7703 for operands. This function traverses all the operands in STMT and
7704 gimplifies anything that is not a valid gimple operand. Any new
7705 GIMPLE statements are inserted before *GSI_P. */
7708 gimple_regimplify_operands (gimple stmt, gimple_stmt_iterator *gsi_p)
7711 tree orig_lhs = NULL_TREE, lhs, t;
7712 gimple_seq pre = NULL;
7713 gimple post_stmt = NULL;
7714 struct gimplify_ctx gctx;
7716 push_gimplify_context (&gctx);
7717 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
7719 switch (gimple_code (stmt))
7722 gimplify_expr (gimple_cond_lhs_ptr (stmt), &pre, NULL,
7723 is_gimple_val, fb_rvalue);
7724 gimplify_expr (gimple_cond_rhs_ptr (stmt), &pre, NULL,
7725 is_gimple_val, fb_rvalue);
7728 gimplify_expr (gimple_switch_index_ptr (stmt), &pre, NULL,
7729 is_gimple_val, fb_rvalue);
7731 case GIMPLE_OMP_ATOMIC_LOAD:
7732 gimplify_expr (gimple_omp_atomic_load_rhs_ptr (stmt), &pre, NULL,
7733 is_gimple_val, fb_rvalue);
7737 size_t i, noutputs = gimple_asm_noutputs (stmt);
7738 const char *constraint, **oconstraints;
7739 bool allows_mem, allows_reg, is_inout;
7742 = (const char **) alloca ((noutputs) * sizeof (const char *));
7743 for (i = 0; i < noutputs; i++)
7745 tree op = gimple_asm_output_op (stmt, i);
7746 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
7747 oconstraints[i] = constraint;
7748 parse_output_constraint (&constraint, i, 0, 0, &allows_mem,
7749 &allows_reg, &is_inout);
7750 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
7751 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
7752 fb_lvalue | fb_mayfail);
7754 for (i = 0; i < gimple_asm_ninputs (stmt); i++)
7756 tree op = gimple_asm_input_op (stmt, i);
7757 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
7758 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
7759 oconstraints, &allows_mem, &allows_reg);
7760 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (op))) && allows_mem)
7762 if (!allows_reg && allows_mem)
7763 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
7764 is_gimple_lvalue, fb_lvalue | fb_mayfail);
7766 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
7767 is_gimple_asm_val, fb_rvalue);
7772 /* NOTE: We start gimplifying operands from last to first to
7773 make sure that side-effects on the RHS of calls, assignments
7774 and ASMs are executed before the LHS. The ordering is not
7775 important for other statements. */
7776 num_ops = gimple_num_ops (stmt);
7777 orig_lhs = gimple_get_lhs (stmt);
7778 for (i = num_ops; i > 0; i--)
7780 tree op = gimple_op (stmt, i - 1);
7781 if (op == NULL_TREE)
7783 if (i == 1 && (is_gimple_call (stmt) || is_gimple_assign (stmt)))
7784 gimplify_expr (&op, &pre, NULL, is_gimple_lvalue, fb_lvalue);
7786 && is_gimple_assign (stmt)
7788 && get_gimple_rhs_class (gimple_expr_code (stmt))
7789 == GIMPLE_SINGLE_RHS)
7790 gimplify_expr (&op, &pre, NULL,
7791 rhs_predicate_for (gimple_assign_lhs (stmt)),
7793 else if (i == 2 && is_gimple_call (stmt))
7795 if (TREE_CODE (op) == FUNCTION_DECL)
7797 gimplify_expr (&op, &pre, NULL, is_gimple_call_addr, fb_rvalue);
7800 gimplify_expr (&op, &pre, NULL, is_gimple_val, fb_rvalue);
7801 gimple_set_op (stmt, i - 1, op);
7804 lhs = gimple_get_lhs (stmt);
7805 /* If the LHS changed it in a way that requires a simple RHS,
7806 create temporary. */
7807 if (lhs && !is_gimple_reg (lhs))
7809 bool need_temp = false;
7811 if (is_gimple_assign (stmt)
7813 && get_gimple_rhs_class (gimple_expr_code (stmt))
7814 == GIMPLE_SINGLE_RHS)
7815 gimplify_expr (gimple_assign_rhs1_ptr (stmt), &pre, NULL,
7816 rhs_predicate_for (gimple_assign_lhs (stmt)),
7818 else if (is_gimple_reg (lhs))
7820 if (is_gimple_reg_type (TREE_TYPE (lhs)))
7822 if (is_gimple_call (stmt))
7824 i = gimple_call_flags (stmt);
7825 if ((i & ECF_LOOPING_CONST_OR_PURE)
7826 || !(i & (ECF_CONST | ECF_PURE)))
7829 if (stmt_can_throw_internal (stmt))
7835 if (is_gimple_reg_type (TREE_TYPE (lhs)))
7837 else if (TYPE_MODE (TREE_TYPE (lhs)) != BLKmode)
7839 if (is_gimple_call (stmt))
7841 tree fndecl = gimple_call_fndecl (stmt);
7843 if (!aggregate_value_p (TREE_TYPE (lhs), fndecl)
7844 && !(fndecl && DECL_RESULT (fndecl)
7845 && DECL_BY_REFERENCE (DECL_RESULT (fndecl))))
7854 tree temp = create_tmp_reg (TREE_TYPE (lhs), NULL);
7856 if (TREE_CODE (orig_lhs) == SSA_NAME)
7857 orig_lhs = SSA_NAME_VAR (orig_lhs);
7859 if (gimple_in_ssa_p (cfun))
7860 temp = make_ssa_name (temp, NULL);
7861 gimple_set_lhs (stmt, temp);
7862 post_stmt = gimple_build_assign (lhs, temp);
7863 if (TREE_CODE (lhs) == SSA_NAME)
7864 SSA_NAME_DEF_STMT (lhs) = post_stmt;
7870 if (gimple_referenced_vars (cfun))
7871 for (t = gimplify_ctxp->temps; t ; t = TREE_CHAIN (t))
7872 add_referenced_var (t);
7874 if (!gimple_seq_empty_p (pre))
7876 if (gimple_in_ssa_p (cfun))
7878 gimple_stmt_iterator i;
7880 for (i = gsi_start (pre); !gsi_end_p (i); gsi_next (&i))
7881 mark_symbols_for_renaming (gsi_stmt (i));
7883 gsi_insert_seq_before (gsi_p, pre, GSI_SAME_STMT);
7886 gsi_insert_after (gsi_p, post_stmt, GSI_NEW_STMT);
7888 pop_gimplify_context (NULL);
7892 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
7893 force the result to be either ssa_name or an invariant, otherwise
7894 just force it to be a rhs expression. If VAR is not NULL, make the
7895 base variable of the final destination be VAR if suitable. */
7898 force_gimple_operand (tree expr, gimple_seq *stmts, bool simple, tree var)
7901 enum gimplify_status ret;
7902 gimple_predicate gimple_test_f;
7903 struct gimplify_ctx gctx;
7907 if (is_gimple_val (expr))
7910 gimple_test_f = simple ? is_gimple_val : is_gimple_reg_rhs;
7912 push_gimplify_context (&gctx);
7913 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
7914 gimplify_ctxp->allow_rhs_cond_expr = true;
7917 expr = build2 (MODIFY_EXPR, TREE_TYPE (var), var, expr);
7919 if (TREE_CODE (expr) != MODIFY_EXPR
7920 && TREE_TYPE (expr) == void_type_node)
7922 gimplify_and_add (expr, stmts);
7927 ret = gimplify_expr (&expr, stmts, NULL, gimple_test_f, fb_rvalue);
7928 gcc_assert (ret != GS_ERROR);
7931 if (gimple_referenced_vars (cfun))
7932 for (t = gimplify_ctxp->temps; t ; t = TREE_CHAIN (t))
7933 add_referenced_var (t);
7935 pop_gimplify_context (NULL);
7940 /* Invokes force_gimple_operand for EXPR with parameters SIMPLE_P and VAR. If
7941 some statements are produced, emits them at GSI. If BEFORE is true.
7942 the statements are appended before GSI, otherwise they are appended after
7943 it. M specifies the way GSI moves after insertion (GSI_SAME_STMT or
7944 GSI_CONTINUE_LINKING are the usual values). */
7947 force_gimple_operand_gsi (gimple_stmt_iterator *gsi, tree expr,
7948 bool simple_p, tree var, bool before,
7949 enum gsi_iterator_update m)
7953 expr = force_gimple_operand (expr, &stmts, simple_p, var);
7955 if (!gimple_seq_empty_p (stmts))
7957 if (gimple_in_ssa_p (cfun))
7959 gimple_stmt_iterator i;
7961 for (i = gsi_start (stmts); !gsi_end_p (i); gsi_next (&i))
7962 mark_symbols_for_renaming (gsi_stmt (i));
7966 gsi_insert_seq_before (gsi, stmts, m);
7968 gsi_insert_seq_after (gsi, stmts, m);
7974 #include "gt-gimplify.h"