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_OK, tret;
1919 location_t loc = EXPR_LOCATION (*expr_p);
1921 /* Create a stack of the subexpressions so later we can walk them in
1922 order from inner to outer. */
1923 stack = VEC_alloc (tree, heap, 10);
1925 /* We can handle anything that get_inner_reference can deal with. */
1926 for (p = expr_p; ; p = &TREE_OPERAND (*p, 0))
1929 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1930 if (TREE_CODE (*p) == INDIRECT_REF)
1931 *p = fold_indirect_ref_loc (loc, *p);
1933 if (handled_component_p (*p))
1935 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
1936 additional COMPONENT_REFs. */
1937 else if ((TREE_CODE (*p) == VAR_DECL || TREE_CODE (*p) == PARM_DECL)
1938 && gimplify_var_or_parm_decl (p) == GS_OK)
1943 VEC_safe_push (tree, heap, stack, *p);
1946 gcc_assert (VEC_length (tree, stack));
1948 /* Now STACK is a stack of pointers to all the refs we've walked through
1949 and P points to the innermost expression.
1951 Java requires that we elaborated nodes in source order. That
1952 means we must gimplify the inner expression followed by each of
1953 the indices, in order. But we can't gimplify the inner
1954 expression until we deal with any variable bounds, sizes, or
1955 positions in order to deal with PLACEHOLDER_EXPRs.
1957 So we do this in three steps. First we deal with the annotations
1958 for any variables in the components, then we gimplify the base,
1959 then we gimplify any indices, from left to right. */
1960 for (i = VEC_length (tree, stack) - 1; i >= 0; i--)
1962 tree t = VEC_index (tree, stack, i);
1964 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
1966 /* Gimplify the low bound and element type size and put them into
1967 the ARRAY_REF. If these values are set, they have already been
1969 if (TREE_OPERAND (t, 2) == NULL_TREE)
1971 tree low = unshare_expr (array_ref_low_bound (t));
1972 if (!is_gimple_min_invariant (low))
1974 TREE_OPERAND (t, 2) = low;
1975 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p,
1976 post_p, is_gimple_reg,
1978 ret = MIN (ret, tret);
1982 if (!TREE_OPERAND (t, 3))
1984 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (t, 0)));
1985 tree elmt_size = unshare_expr (array_ref_element_size (t));
1986 tree factor = size_int (TYPE_ALIGN_UNIT (elmt_type));
1988 /* Divide the element size by the alignment of the element
1990 elmt_size = size_binop_loc (loc, EXACT_DIV_EXPR, elmt_size, factor);
1992 if (!is_gimple_min_invariant (elmt_size))
1994 TREE_OPERAND (t, 3) = elmt_size;
1995 tret = gimplify_expr (&TREE_OPERAND (t, 3), pre_p,
1996 post_p, is_gimple_reg,
1998 ret = MIN (ret, tret);
2002 else if (TREE_CODE (t) == COMPONENT_REF)
2004 /* Set the field offset into T and gimplify it. */
2005 if (!TREE_OPERAND (t, 2))
2007 tree offset = unshare_expr (component_ref_field_offset (t));
2008 tree field = TREE_OPERAND (t, 1);
2010 = size_int (DECL_OFFSET_ALIGN (field) / BITS_PER_UNIT);
2012 /* Divide the offset by its alignment. */
2013 offset = size_binop_loc (loc, EXACT_DIV_EXPR, offset, factor);
2015 if (!is_gimple_min_invariant (offset))
2017 TREE_OPERAND (t, 2) = offset;
2018 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p,
2019 post_p, is_gimple_reg,
2021 ret = MIN (ret, tret);
2027 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
2028 so as to match the min_lval predicate. Failure to do so may result
2029 in the creation of large aggregate temporaries. */
2030 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval,
2031 fallback | fb_lvalue);
2032 ret = MIN (ret, tret);
2034 /* And finally, the indices and operands to BIT_FIELD_REF. During this
2035 loop we also remove any useless conversions. */
2036 for (; VEC_length (tree, stack) > 0; )
2038 tree t = VEC_pop (tree, stack);
2040 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
2042 /* Gimplify the dimension. */
2043 if (!is_gimple_min_invariant (TREE_OPERAND (t, 1)))
2045 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
2046 is_gimple_val, fb_rvalue);
2047 ret = MIN (ret, tret);
2050 else if (TREE_CODE (t) == BIT_FIELD_REF)
2052 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
2053 is_gimple_val, fb_rvalue);
2054 ret = MIN (ret, tret);
2055 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
2056 is_gimple_val, fb_rvalue);
2057 ret = MIN (ret, tret);
2060 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t, 0));
2062 /* The innermost expression P may have originally had
2063 TREE_SIDE_EFFECTS set which would have caused all the outer
2064 expressions in *EXPR_P leading to P to also have had
2065 TREE_SIDE_EFFECTS set. */
2066 recalculate_side_effects (t);
2069 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
2070 if ((fallback & fb_rvalue) && TREE_CODE (*expr_p) == COMPONENT_REF)
2072 canonicalize_component_ref (expr_p);
2073 ret = MIN (ret, GS_OK);
2076 VEC_free (tree, heap, stack);
2081 /* Gimplify the self modifying expression pointed to by EXPR_P
2084 PRE_P points to the list where side effects that must happen before
2085 *EXPR_P should be stored.
2087 POST_P points to the list where side effects that must happen after
2088 *EXPR_P should be stored.
2090 WANT_VALUE is nonzero iff we want to use the value of this expression
2091 in another expression. */
2093 static enum gimplify_status
2094 gimplify_self_mod_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
2097 enum tree_code code;
2098 tree lhs, lvalue, rhs, t1;
2099 gimple_seq post = NULL, *orig_post_p = post_p;
2101 enum tree_code arith_code;
2102 enum gimplify_status ret;
2103 location_t loc = EXPR_LOCATION (*expr_p);
2105 code = TREE_CODE (*expr_p);
2107 gcc_assert (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR
2108 || code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR);
2110 /* Prefix or postfix? */
2111 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
2112 /* Faster to treat as prefix if result is not used. */
2113 postfix = want_value;
2117 /* For postfix, make sure the inner expression's post side effects
2118 are executed after side effects from this expression. */
2122 /* Add or subtract? */
2123 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2124 arith_code = PLUS_EXPR;
2126 arith_code = MINUS_EXPR;
2128 /* Gimplify the LHS into a GIMPLE lvalue. */
2129 lvalue = TREE_OPERAND (*expr_p, 0);
2130 ret = gimplify_expr (&lvalue, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
2131 if (ret == GS_ERROR)
2134 /* Extract the operands to the arithmetic operation. */
2136 rhs = TREE_OPERAND (*expr_p, 1);
2138 /* For postfix operator, we evaluate the LHS to an rvalue and then use
2139 that as the result value and in the postqueue operation. We also
2140 make sure to make lvalue a minimal lval, see
2141 gcc.c-torture/execute/20040313-1.c for an example where this matters. */
2144 if (!is_gimple_min_lval (lvalue))
2146 mark_addressable (lvalue);
2147 lvalue = build_fold_addr_expr_loc (input_location, lvalue);
2148 gimplify_expr (&lvalue, pre_p, post_p, is_gimple_val, fb_rvalue);
2149 lvalue = build_fold_indirect_ref_loc (input_location, lvalue);
2151 ret = gimplify_expr (&lhs, pre_p, post_p, is_gimple_val, fb_rvalue);
2152 if (ret == GS_ERROR)
2156 /* For POINTERs increment, use POINTER_PLUS_EXPR. */
2157 if (POINTER_TYPE_P (TREE_TYPE (lhs)))
2159 rhs = fold_convert_loc (loc, sizetype, rhs);
2160 if (arith_code == MINUS_EXPR)
2161 rhs = fold_build1_loc (loc, NEGATE_EXPR, TREE_TYPE (rhs), rhs);
2162 arith_code = POINTER_PLUS_EXPR;
2165 t1 = build2 (arith_code, TREE_TYPE (*expr_p), lhs, rhs);
2169 gimplify_assign (lvalue, t1, orig_post_p);
2170 gimplify_seq_add_seq (orig_post_p, post);
2176 *expr_p = build2 (MODIFY_EXPR, TREE_TYPE (lvalue), lvalue, t1);
2182 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
2185 maybe_with_size_expr (tree *expr_p)
2187 tree expr = *expr_p;
2188 tree type = TREE_TYPE (expr);
2191 /* If we've already wrapped this or the type is error_mark_node, we can't do
2193 if (TREE_CODE (expr) == WITH_SIZE_EXPR
2194 || type == error_mark_node)
2197 /* If the size isn't known or is a constant, we have nothing to do. */
2198 size = TYPE_SIZE_UNIT (type);
2199 if (!size || TREE_CODE (size) == INTEGER_CST)
2202 /* Otherwise, make a WITH_SIZE_EXPR. */
2203 size = unshare_expr (size);
2204 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, expr);
2205 *expr_p = build2 (WITH_SIZE_EXPR, type, expr, size);
2209 /* Helper for gimplify_call_expr. Gimplify a single argument *ARG_P
2210 Store any side-effects in PRE_P. CALL_LOCATION is the location of
2213 static enum gimplify_status
2214 gimplify_arg (tree *arg_p, gimple_seq *pre_p, location_t call_location)
2216 bool (*test) (tree);
2219 /* In general, we allow lvalues for function arguments to avoid
2220 extra overhead of copying large aggregates out of even larger
2221 aggregates into temporaries only to copy the temporaries to
2222 the argument list. Make optimizers happy by pulling out to
2223 temporaries those types that fit in registers. */
2224 if (is_gimple_reg_type (TREE_TYPE (*arg_p)))
2225 test = is_gimple_val, fb = fb_rvalue;
2227 test = is_gimple_lvalue, fb = fb_either;
2229 /* If this is a variable sized type, we must remember the size. */
2230 maybe_with_size_expr (arg_p);
2232 /* FIXME diagnostics: This will mess up gcc.dg/Warray-bounds.c. */
2233 /* Make sure arguments have the same location as the function call
2235 protected_set_expr_location (*arg_p, call_location);
2237 /* There is a sequence point before a function call. Side effects in
2238 the argument list must occur before the actual call. So, when
2239 gimplifying arguments, force gimplify_expr to use an internal
2240 post queue which is then appended to the end of PRE_P. */
2241 return gimplify_expr (arg_p, pre_p, NULL, test, fb);
2245 /* Gimplify the CALL_EXPR node *EXPR_P into the GIMPLE sequence PRE_P.
2246 WANT_VALUE is true if the result of the call is desired. */
2248 static enum gimplify_status
2249 gimplify_call_expr (tree *expr_p, gimple_seq *pre_p, bool want_value)
2251 tree fndecl, parms, p;
2252 enum gimplify_status ret;
2255 bool builtin_va_start_p = FALSE;
2256 location_t loc = EXPR_LOCATION (*expr_p);
2258 gcc_assert (TREE_CODE (*expr_p) == CALL_EXPR);
2260 /* For reliable diagnostics during inlining, it is necessary that
2261 every call_expr be annotated with file and line. */
2262 if (! EXPR_HAS_LOCATION (*expr_p))
2263 SET_EXPR_LOCATION (*expr_p, input_location);
2265 /* This may be a call to a builtin function.
2267 Builtin function calls may be transformed into different
2268 (and more efficient) builtin function calls under certain
2269 circumstances. Unfortunately, gimplification can muck things
2270 up enough that the builtin expanders are not aware that certain
2271 transformations are still valid.
2273 So we attempt transformation/gimplification of the call before
2274 we gimplify the CALL_EXPR. At this time we do not manage to
2275 transform all calls in the same manner as the expanders do, but
2276 we do transform most of them. */
2277 fndecl = get_callee_fndecl (*expr_p);
2278 if (fndecl && DECL_BUILT_IN (fndecl))
2280 tree new_tree = fold_call_expr (input_location, *expr_p, !want_value);
2282 if (new_tree && new_tree != *expr_p)
2284 /* There was a transformation of this call which computes the
2285 same value, but in a more efficient way. Return and try
2291 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
2292 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_VA_START)
2294 builtin_va_start_p = TRUE;
2295 if (call_expr_nargs (*expr_p) < 2)
2297 error ("too few arguments to function %<va_start%>");
2298 *expr_p = build_empty_stmt (EXPR_LOCATION (*expr_p));
2302 if (fold_builtin_next_arg (*expr_p, true))
2304 *expr_p = build_empty_stmt (EXPR_LOCATION (*expr_p));
2310 /* There is a sequence point before the call, so any side effects in
2311 the calling expression must occur before the actual call. Force
2312 gimplify_expr to use an internal post queue. */
2313 ret = gimplify_expr (&CALL_EXPR_FN (*expr_p), pre_p, NULL,
2314 is_gimple_call_addr, fb_rvalue);
2316 nargs = call_expr_nargs (*expr_p);
2318 /* Get argument types for verification. */
2319 fndecl = get_callee_fndecl (*expr_p);
2322 parms = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
2323 else if (POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_FN (*expr_p))))
2324 parms = TYPE_ARG_TYPES (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (*expr_p))));
2326 if (fndecl && DECL_ARGUMENTS (fndecl))
2327 p = DECL_ARGUMENTS (fndecl);
2332 for (i = 0; i < nargs && p; i++, p = TREE_CHAIN (p))
2335 /* If the last argument is __builtin_va_arg_pack () and it is not
2336 passed as a named argument, decrease the number of CALL_EXPR
2337 arguments and set instead the CALL_EXPR_VA_ARG_PACK flag. */
2340 && TREE_CODE (CALL_EXPR_ARG (*expr_p, nargs - 1)) == CALL_EXPR)
2342 tree last_arg = CALL_EXPR_ARG (*expr_p, nargs - 1);
2343 tree last_arg_fndecl = get_callee_fndecl (last_arg);
2346 && TREE_CODE (last_arg_fndecl) == FUNCTION_DECL
2347 && DECL_BUILT_IN_CLASS (last_arg_fndecl) == BUILT_IN_NORMAL
2348 && DECL_FUNCTION_CODE (last_arg_fndecl) == BUILT_IN_VA_ARG_PACK)
2350 tree call = *expr_p;
2353 *expr_p = build_call_array_loc (loc, TREE_TYPE (call),
2354 CALL_EXPR_FN (call),
2355 nargs, CALL_EXPR_ARGP (call));
2357 /* Copy all CALL_EXPR flags, location and block, except
2358 CALL_EXPR_VA_ARG_PACK flag. */
2359 CALL_EXPR_STATIC_CHAIN (*expr_p) = CALL_EXPR_STATIC_CHAIN (call);
2360 CALL_EXPR_TAILCALL (*expr_p) = CALL_EXPR_TAILCALL (call);
2361 CALL_EXPR_RETURN_SLOT_OPT (*expr_p)
2362 = CALL_EXPR_RETURN_SLOT_OPT (call);
2363 CALL_FROM_THUNK_P (*expr_p) = CALL_FROM_THUNK_P (call);
2364 CALL_CANNOT_INLINE_P (*expr_p) = CALL_CANNOT_INLINE_P (call);
2365 SET_EXPR_LOCATION (*expr_p, EXPR_LOCATION (call));
2366 TREE_BLOCK (*expr_p) = TREE_BLOCK (call);
2368 /* Set CALL_EXPR_VA_ARG_PACK. */
2369 CALL_EXPR_VA_ARG_PACK (*expr_p) = 1;
2373 /* Finally, gimplify the function arguments. */
2376 for (i = (PUSH_ARGS_REVERSED ? nargs - 1 : 0);
2377 PUSH_ARGS_REVERSED ? i >= 0 : i < nargs;
2378 PUSH_ARGS_REVERSED ? i-- : i++)
2380 enum gimplify_status t;
2382 /* Avoid gimplifying the second argument to va_start, which needs to
2383 be the plain PARM_DECL. */
2384 if ((i != 1) || !builtin_va_start_p)
2386 t = gimplify_arg (&CALL_EXPR_ARG (*expr_p, i), pre_p,
2387 EXPR_LOCATION (*expr_p));
2395 /* Verify the function result. */
2396 if (want_value && fndecl
2397 && VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fndecl))))
2399 error_at (loc, "using result of function returning %<void%>");
2403 /* Try this again in case gimplification exposed something. */
2404 if (ret != GS_ERROR)
2406 tree new_tree = fold_call_expr (input_location, *expr_p, !want_value);
2408 if (new_tree && new_tree != *expr_p)
2410 /* There was a transformation of this call which computes the
2411 same value, but in a more efficient way. Return and try
2419 *expr_p = error_mark_node;
2423 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2424 decl. This allows us to eliminate redundant or useless
2425 calls to "const" functions. */
2426 if (TREE_CODE (*expr_p) == CALL_EXPR)
2428 int flags = call_expr_flags (*expr_p);
2429 if (flags & (ECF_CONST | ECF_PURE)
2430 /* An infinite loop is considered a side effect. */
2431 && !(flags & (ECF_LOOPING_CONST_OR_PURE)))
2432 TREE_SIDE_EFFECTS (*expr_p) = 0;
2435 /* If the value is not needed by the caller, emit a new GIMPLE_CALL
2436 and clear *EXPR_P. Otherwise, leave *EXPR_P in its gimplified
2437 form and delegate the creation of a GIMPLE_CALL to
2438 gimplify_modify_expr. This is always possible because when
2439 WANT_VALUE is true, the caller wants the result of this call into
2440 a temporary, which means that we will emit an INIT_EXPR in
2441 internal_get_tmp_var which will then be handled by
2442 gimplify_modify_expr. */
2445 /* The CALL_EXPR in *EXPR_P is already in GIMPLE form, so all we
2446 have to do is replicate it as a GIMPLE_CALL tuple. */
2447 call = gimple_build_call_from_tree (*expr_p);
2448 gimplify_seq_add_stmt (pre_p, call);
2449 *expr_p = NULL_TREE;
2455 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2456 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2458 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2459 condition is true or false, respectively. If null, we should generate
2460 our own to skip over the evaluation of this specific expression.
2462 LOCUS is the source location of the COND_EXPR.
2464 This function is the tree equivalent of do_jump.
2466 shortcut_cond_r should only be called by shortcut_cond_expr. */
2469 shortcut_cond_r (tree pred, tree *true_label_p, tree *false_label_p,
2472 tree local_label = NULL_TREE;
2473 tree t, expr = NULL;
2475 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2476 retain the shortcut semantics. Just insert the gotos here;
2477 shortcut_cond_expr will append the real blocks later. */
2478 if (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2480 location_t new_locus;
2482 /* Turn if (a && b) into
2484 if (a); else goto no;
2485 if (b) goto yes; else goto no;
2488 if (false_label_p == NULL)
2489 false_label_p = &local_label;
2491 /* Keep the original source location on the first 'if'. */
2492 t = shortcut_cond_r (TREE_OPERAND (pred, 0), NULL, false_label_p, locus);
2493 append_to_statement_list (t, &expr);
2495 /* Set the source location of the && on the second 'if'. */
2496 new_locus = EXPR_HAS_LOCATION (pred) ? EXPR_LOCATION (pred) : locus;
2497 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p, false_label_p,
2499 append_to_statement_list (t, &expr);
2501 else if (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2503 location_t new_locus;
2505 /* Turn if (a || b) into
2508 if (b) goto yes; else goto no;
2511 if (true_label_p == NULL)
2512 true_label_p = &local_label;
2514 /* Keep the original source location on the first 'if'. */
2515 t = shortcut_cond_r (TREE_OPERAND (pred, 0), true_label_p, NULL, locus);
2516 append_to_statement_list (t, &expr);
2518 /* Set the source location of the || on the second 'if'. */
2519 new_locus = EXPR_HAS_LOCATION (pred) ? EXPR_LOCATION (pred) : locus;
2520 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p, false_label_p,
2522 append_to_statement_list (t, &expr);
2524 else if (TREE_CODE (pred) == COND_EXPR)
2526 location_t new_locus;
2528 /* As long as we're messing with gotos, turn if (a ? b : c) into
2530 if (b) goto yes; else goto no;
2532 if (c) goto yes; else goto no; */
2534 /* Keep the original source location on the first 'if'. Set the source
2535 location of the ? on the second 'if'. */
2536 new_locus = EXPR_HAS_LOCATION (pred) ? EXPR_LOCATION (pred) : locus;
2537 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (pred, 0),
2538 shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2539 false_label_p, locus),
2540 shortcut_cond_r (TREE_OPERAND (pred, 2), true_label_p,
2541 false_label_p, new_locus));
2545 expr = build3 (COND_EXPR, void_type_node, pred,
2546 build_and_jump (true_label_p),
2547 build_and_jump (false_label_p));
2548 SET_EXPR_LOCATION (expr, locus);
2553 t = build1 (LABEL_EXPR, void_type_node, local_label);
2554 append_to_statement_list (t, &expr);
2560 /* Given a conditional expression EXPR with short-circuit boolean
2561 predicates using TRUTH_ANDIF_EXPR or TRUTH_ORIF_EXPR, break the
2562 predicate appart into the equivalent sequence of conditionals. */
2565 shortcut_cond_expr (tree expr)
2567 tree pred = TREE_OPERAND (expr, 0);
2568 tree then_ = TREE_OPERAND (expr, 1);
2569 tree else_ = TREE_OPERAND (expr, 2);
2570 tree true_label, false_label, end_label, t;
2572 tree *false_label_p;
2573 bool emit_end, emit_false, jump_over_else;
2574 bool then_se = then_ && TREE_SIDE_EFFECTS (then_);
2575 bool else_se = else_ && TREE_SIDE_EFFECTS (else_);
2577 /* First do simple transformations. */
2580 /* If there is no 'else', turn
2583 if (a) if (b) then c. */
2584 while (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2586 /* Keep the original source location on the first 'if'. */
2587 location_t locus = EXPR_HAS_LOCATION (expr)
2588 ? EXPR_LOCATION (expr) : input_location;
2589 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2590 /* Set the source location of the && on the second 'if'. */
2591 if (EXPR_HAS_LOCATION (pred))
2592 SET_EXPR_LOCATION (expr, EXPR_LOCATION (pred));
2593 then_ = shortcut_cond_expr (expr);
2594 then_se = then_ && TREE_SIDE_EFFECTS (then_);
2595 pred = TREE_OPERAND (pred, 0);
2596 expr = build3 (COND_EXPR, void_type_node, pred, then_, NULL_TREE);
2597 SET_EXPR_LOCATION (expr, locus);
2603 /* If there is no 'then', turn
2606 if (a); else if (b); else d. */
2607 while (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2609 /* Keep the original source location on the first 'if'. */
2610 location_t locus = EXPR_HAS_LOCATION (expr)
2611 ? EXPR_LOCATION (expr) : input_location;
2612 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2613 /* Set the source location of the || on the second 'if'. */
2614 if (EXPR_HAS_LOCATION (pred))
2615 SET_EXPR_LOCATION (expr, EXPR_LOCATION (pred));
2616 else_ = shortcut_cond_expr (expr);
2617 else_se = else_ && TREE_SIDE_EFFECTS (else_);
2618 pred = TREE_OPERAND (pred, 0);
2619 expr = build3 (COND_EXPR, void_type_node, pred, NULL_TREE, else_);
2620 SET_EXPR_LOCATION (expr, locus);
2624 /* If we're done, great. */
2625 if (TREE_CODE (pred) != TRUTH_ANDIF_EXPR
2626 && TREE_CODE (pred) != TRUTH_ORIF_EXPR)
2629 /* Otherwise we need to mess with gotos. Change
2632 if (a); else goto no;
2635 and recursively gimplify the condition. */
2637 true_label = false_label = end_label = NULL_TREE;
2639 /* If our arms just jump somewhere, hijack those labels so we don't
2640 generate jumps to jumps. */
2643 && TREE_CODE (then_) == GOTO_EXPR
2644 && TREE_CODE (GOTO_DESTINATION (then_)) == LABEL_DECL)
2646 true_label = GOTO_DESTINATION (then_);
2652 && TREE_CODE (else_) == GOTO_EXPR
2653 && TREE_CODE (GOTO_DESTINATION (else_)) == LABEL_DECL)
2655 false_label = GOTO_DESTINATION (else_);
2660 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2662 true_label_p = &true_label;
2664 true_label_p = NULL;
2666 /* The 'else' branch also needs a label if it contains interesting code. */
2667 if (false_label || else_se)
2668 false_label_p = &false_label;
2670 false_label_p = NULL;
2672 /* If there was nothing else in our arms, just forward the label(s). */
2673 if (!then_se && !else_se)
2674 return shortcut_cond_r (pred, true_label_p, false_label_p,
2675 EXPR_HAS_LOCATION (expr)
2676 ? EXPR_LOCATION (expr) : input_location);
2678 /* If our last subexpression already has a terminal label, reuse it. */
2680 t = expr_last (else_);
2682 t = expr_last (then_);
2685 if (t && TREE_CODE (t) == LABEL_EXPR)
2686 end_label = LABEL_EXPR_LABEL (t);
2688 /* If we don't care about jumping to the 'else' branch, jump to the end
2689 if the condition is false. */
2691 false_label_p = &end_label;
2693 /* We only want to emit these labels if we aren't hijacking them. */
2694 emit_end = (end_label == NULL_TREE);
2695 emit_false = (false_label == NULL_TREE);
2697 /* We only emit the jump over the else clause if we have to--if the
2698 then clause may fall through. Otherwise we can wind up with a
2699 useless jump and a useless label at the end of gimplified code,
2700 which will cause us to think that this conditional as a whole
2701 falls through even if it doesn't. If we then inline a function
2702 which ends with such a condition, that can cause us to issue an
2703 inappropriate warning about control reaching the end of a
2704 non-void function. */
2705 jump_over_else = block_may_fallthru (then_);
2707 pred = shortcut_cond_r (pred, true_label_p, false_label_p,
2708 EXPR_HAS_LOCATION (expr)
2709 ? EXPR_LOCATION (expr) : input_location);
2712 append_to_statement_list (pred, &expr);
2714 append_to_statement_list (then_, &expr);
2719 tree last = expr_last (expr);
2720 t = build_and_jump (&end_label);
2721 if (EXPR_HAS_LOCATION (last))
2722 SET_EXPR_LOCATION (t, EXPR_LOCATION (last));
2723 append_to_statement_list (t, &expr);
2727 t = build1 (LABEL_EXPR, void_type_node, false_label);
2728 append_to_statement_list (t, &expr);
2730 append_to_statement_list (else_, &expr);
2732 if (emit_end && end_label)
2734 t = build1 (LABEL_EXPR, void_type_node, end_label);
2735 append_to_statement_list (t, &expr);
2741 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2744 gimple_boolify (tree expr)
2746 tree type = TREE_TYPE (expr);
2747 location_t loc = EXPR_LOCATION (expr);
2749 if (TREE_CODE (expr) == NE_EXPR
2750 && TREE_CODE (TREE_OPERAND (expr, 0)) == CALL_EXPR
2751 && integer_zerop (TREE_OPERAND (expr, 1)))
2753 tree call = TREE_OPERAND (expr, 0);
2754 tree fn = get_callee_fndecl (call);
2756 /* For __builtin_expect ((long) (x), y) recurse into x as well
2757 if x is truth_value_p. */
2759 && DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2760 && DECL_FUNCTION_CODE (fn) == BUILT_IN_EXPECT
2761 && call_expr_nargs (call) == 2)
2763 tree arg = CALL_EXPR_ARG (call, 0);
2766 if (TREE_CODE (arg) == NOP_EXPR
2767 && TREE_TYPE (arg) == TREE_TYPE (call))
2768 arg = TREE_OPERAND (arg, 0);
2769 if (truth_value_p (TREE_CODE (arg)))
2771 arg = gimple_boolify (arg);
2772 CALL_EXPR_ARG (call, 0)
2773 = fold_convert_loc (loc, TREE_TYPE (call), arg);
2779 if (TREE_CODE (type) == BOOLEAN_TYPE)
2782 switch (TREE_CODE (expr))
2784 case TRUTH_AND_EXPR:
2786 case TRUTH_XOR_EXPR:
2787 case TRUTH_ANDIF_EXPR:
2788 case TRUTH_ORIF_EXPR:
2789 /* Also boolify the arguments of truth exprs. */
2790 TREE_OPERAND (expr, 1) = gimple_boolify (TREE_OPERAND (expr, 1));
2793 case TRUTH_NOT_EXPR:
2794 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2797 case EQ_EXPR: case NE_EXPR:
2798 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2799 /* These expressions always produce boolean results. */
2800 TREE_TYPE (expr) = boolean_type_node;
2804 /* Other expressions that get here must have boolean values, but
2805 might need to be converted to the appropriate mode. */
2806 return fold_convert_loc (loc, boolean_type_node, expr);
2810 /* Given a conditional expression *EXPR_P without side effects, gimplify
2811 its operands. New statements are inserted to PRE_P. */
2813 static enum gimplify_status
2814 gimplify_pure_cond_expr (tree *expr_p, gimple_seq *pre_p)
2816 tree expr = *expr_p, cond;
2817 enum gimplify_status ret, tret;
2818 enum tree_code code;
2820 cond = gimple_boolify (COND_EXPR_COND (expr));
2822 /* We need to handle && and || specially, as their gimplification
2823 creates pure cond_expr, thus leading to an infinite cycle otherwise. */
2824 code = TREE_CODE (cond);
2825 if (code == TRUTH_ANDIF_EXPR)
2826 TREE_SET_CODE (cond, TRUTH_AND_EXPR);
2827 else if (code == TRUTH_ORIF_EXPR)
2828 TREE_SET_CODE (cond, TRUTH_OR_EXPR);
2829 ret = gimplify_expr (&cond, pre_p, NULL, is_gimple_condexpr, fb_rvalue);
2830 COND_EXPR_COND (*expr_p) = cond;
2832 tret = gimplify_expr (&COND_EXPR_THEN (expr), pre_p, NULL,
2833 is_gimple_val, fb_rvalue);
2834 ret = MIN (ret, tret);
2835 tret = gimplify_expr (&COND_EXPR_ELSE (expr), pre_p, NULL,
2836 is_gimple_val, fb_rvalue);
2838 return MIN (ret, tret);
2841 /* Returns true if evaluating EXPR could trap.
2842 EXPR is GENERIC, while tree_could_trap_p can be called
2846 generic_expr_could_trap_p (tree expr)
2850 if (!expr || is_gimple_val (expr))
2853 if (!EXPR_P (expr) || tree_could_trap_p (expr))
2856 n = TREE_OPERAND_LENGTH (expr);
2857 for (i = 0; i < n; i++)
2858 if (generic_expr_could_trap_p (TREE_OPERAND (expr, i)))
2864 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2873 The second form is used when *EXPR_P is of type void.
2875 PRE_P points to the list where side effects that must happen before
2876 *EXPR_P should be stored. */
2878 static enum gimplify_status
2879 gimplify_cond_expr (tree *expr_p, gimple_seq *pre_p, fallback_t fallback)
2881 tree expr = *expr_p;
2882 tree type = TREE_TYPE (expr);
2883 location_t loc = EXPR_LOCATION (expr);
2884 tree tmp, arm1, arm2;
2885 enum gimplify_status ret;
2886 tree label_true, label_false, label_cont;
2887 bool have_then_clause_p, have_else_clause_p;
2889 enum tree_code pred_code;
2890 gimple_seq seq = NULL;
2892 /* If this COND_EXPR has a value, copy the values into a temporary within
2894 if (!VOID_TYPE_P (type))
2896 tree then_ = TREE_OPERAND (expr, 1), else_ = TREE_OPERAND (expr, 2);
2899 /* If either an rvalue is ok or we do not require an lvalue, create the
2900 temporary. But we cannot do that if the type is addressable. */
2901 if (((fallback & fb_rvalue) || !(fallback & fb_lvalue))
2902 && !TREE_ADDRESSABLE (type))
2904 if (gimplify_ctxp->allow_rhs_cond_expr
2905 /* If either branch has side effects or could trap, it can't be
2906 evaluated unconditionally. */
2907 && !TREE_SIDE_EFFECTS (then_)
2908 && !generic_expr_could_trap_p (then_)
2909 && !TREE_SIDE_EFFECTS (else_)
2910 && !generic_expr_could_trap_p (else_))
2911 return gimplify_pure_cond_expr (expr_p, pre_p);
2913 tmp = create_tmp_var (type, "iftmp");
2917 /* Otherwise, only create and copy references to the values. */
2920 type = build_pointer_type (type);
2922 if (!VOID_TYPE_P (TREE_TYPE (then_)))
2923 then_ = build_fold_addr_expr_loc (loc, then_);
2925 if (!VOID_TYPE_P (TREE_TYPE (else_)))
2926 else_ = build_fold_addr_expr_loc (loc, else_);
2929 = build3 (COND_EXPR, type, TREE_OPERAND (expr, 0), then_, else_);
2931 tmp = create_tmp_var (type, "iftmp");
2932 result = build_fold_indirect_ref_loc (loc, tmp);
2935 /* Build the new then clause, `tmp = then_;'. But don't build the
2936 assignment if the value is void; in C++ it can be if it's a throw. */
2937 if (!VOID_TYPE_P (TREE_TYPE (then_)))
2938 TREE_OPERAND (expr, 1) = build2 (MODIFY_EXPR, type, tmp, then_);
2940 /* Similarly, build the new else clause, `tmp = else_;'. */
2941 if (!VOID_TYPE_P (TREE_TYPE (else_)))
2942 TREE_OPERAND (expr, 2) = build2 (MODIFY_EXPR, type, tmp, else_);
2944 TREE_TYPE (expr) = void_type_node;
2945 recalculate_side_effects (expr);
2947 /* Move the COND_EXPR to the prequeue. */
2948 gimplify_stmt (&expr, pre_p);
2954 /* Make sure the condition has BOOLEAN_TYPE. */
2955 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2957 /* Break apart && and || conditions. */
2958 if (TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ANDIF_EXPR
2959 || TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ORIF_EXPR)
2961 expr = shortcut_cond_expr (expr);
2963 if (expr != *expr_p)
2967 /* We can't rely on gimplify_expr to re-gimplify the expanded
2968 form properly, as cleanups might cause the target labels to be
2969 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2970 set up a conditional context. */
2971 gimple_push_condition ();
2972 gimplify_stmt (expr_p, &seq);
2973 gimple_pop_condition (pre_p);
2974 gimple_seq_add_seq (pre_p, seq);
2980 /* Now do the normal gimplification. */
2982 /* Gimplify condition. */
2983 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL, is_gimple_condexpr,
2985 if (ret == GS_ERROR)
2987 gcc_assert (TREE_OPERAND (expr, 0) != NULL_TREE);
2989 gimple_push_condition ();
2991 have_then_clause_p = have_else_clause_p = false;
2992 if (TREE_OPERAND (expr, 1) != NULL
2993 && TREE_CODE (TREE_OPERAND (expr, 1)) == GOTO_EXPR
2994 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr, 1))) == LABEL_DECL
2995 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr, 1)))
2996 == current_function_decl)
2997 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
2998 have different locations, otherwise we end up with incorrect
2999 location information on the branches. */
3001 || !EXPR_HAS_LOCATION (expr)
3002 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr, 1))
3003 || EXPR_LOCATION (expr) == EXPR_LOCATION (TREE_OPERAND (expr, 1))))
3005 label_true = GOTO_DESTINATION (TREE_OPERAND (expr, 1));
3006 have_then_clause_p = true;
3009 label_true = create_artificial_label (UNKNOWN_LOCATION);
3010 if (TREE_OPERAND (expr, 2) != NULL
3011 && TREE_CODE (TREE_OPERAND (expr, 2)) == GOTO_EXPR
3012 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr, 2))) == LABEL_DECL
3013 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr, 2)))
3014 == current_function_decl)
3015 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
3016 have different locations, otherwise we end up with incorrect
3017 location information on the branches. */
3019 || !EXPR_HAS_LOCATION (expr)
3020 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr, 2))
3021 || EXPR_LOCATION (expr) == EXPR_LOCATION (TREE_OPERAND (expr, 2))))
3023 label_false = GOTO_DESTINATION (TREE_OPERAND (expr, 2));
3024 have_else_clause_p = true;
3027 label_false = create_artificial_label (UNKNOWN_LOCATION);
3029 gimple_cond_get_ops_from_tree (COND_EXPR_COND (expr), &pred_code, &arm1,
3032 gimple_cond = gimple_build_cond (pred_code, arm1, arm2, label_true,
3035 gimplify_seq_add_stmt (&seq, gimple_cond);
3036 label_cont = NULL_TREE;
3037 if (!have_then_clause_p)
3039 /* For if (...) {} else { code; } put label_true after
3041 if (TREE_OPERAND (expr, 1) == NULL_TREE
3042 && !have_else_clause_p
3043 && TREE_OPERAND (expr, 2) != NULL_TREE)
3044 label_cont = label_true;
3047 gimplify_seq_add_stmt (&seq, gimple_build_label (label_true));
3048 have_then_clause_p = gimplify_stmt (&TREE_OPERAND (expr, 1), &seq);
3049 /* For if (...) { code; } else {} or
3050 if (...) { code; } else goto label; or
3051 if (...) { code; return; } else { ... }
3052 label_cont isn't needed. */
3053 if (!have_else_clause_p
3054 && TREE_OPERAND (expr, 2) != NULL_TREE
3055 && gimple_seq_may_fallthru (seq))
3058 label_cont = create_artificial_label (UNKNOWN_LOCATION);
3060 g = gimple_build_goto (label_cont);
3062 /* GIMPLE_COND's are very low level; they have embedded
3063 gotos. This particular embedded goto should not be marked
3064 with the location of the original COND_EXPR, as it would
3065 correspond to the COND_EXPR's condition, not the ELSE or the
3066 THEN arms. To avoid marking it with the wrong location, flag
3067 it as "no location". */
3068 gimple_set_do_not_emit_location (g);
3070 gimplify_seq_add_stmt (&seq, g);
3074 if (!have_else_clause_p)
3076 gimplify_seq_add_stmt (&seq, gimple_build_label (label_false));
3077 have_else_clause_p = gimplify_stmt (&TREE_OPERAND (expr, 2), &seq);
3080 gimplify_seq_add_stmt (&seq, gimple_build_label (label_cont));
3082 gimple_pop_condition (pre_p);
3083 gimple_seq_add_seq (pre_p, seq);
3085 if (ret == GS_ERROR)
3087 else if (have_then_clause_p || have_else_clause_p)
3091 /* Both arms are empty; replace the COND_EXPR with its predicate. */
3092 expr = TREE_OPERAND (expr, 0);
3093 gimplify_stmt (&expr, pre_p);
3100 /* Prepare the node pointed to by EXPR_P, an is_gimple_addressable expression,
3101 to be marked addressable.
3103 We cannot rely on such an expression being directly markable if a temporary
3104 has been created by the gimplification. In this case, we create another
3105 temporary and initialize it with a copy, which will become a store after we
3106 mark it addressable. This can happen if the front-end passed us something
3107 that it could not mark addressable yet, like a Fortran pass-by-reference
3108 parameter (int) floatvar. */
3111 prepare_gimple_addressable (tree *expr_p, gimple_seq *seq_p)
3113 while (handled_component_p (*expr_p))
3114 expr_p = &TREE_OPERAND (*expr_p, 0);
3115 if (is_gimple_reg (*expr_p))
3116 *expr_p = get_initialized_tmp_var (*expr_p, seq_p, NULL);
3119 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3120 a call to __builtin_memcpy. */
3122 static enum gimplify_status
3123 gimplify_modify_expr_to_memcpy (tree *expr_p, tree size, bool want_value,
3126 tree t, to, to_ptr, from, from_ptr;
3128 location_t loc = EXPR_LOCATION (*expr_p);
3130 to = TREE_OPERAND (*expr_p, 0);
3131 from = TREE_OPERAND (*expr_p, 1);
3133 /* Mark the RHS addressable. Beware that it may not be possible to do so
3134 directly if a temporary has been created by the gimplification. */
3135 prepare_gimple_addressable (&from, seq_p);
3137 mark_addressable (from);
3138 from_ptr = build_fold_addr_expr_loc (loc, from);
3139 gimplify_arg (&from_ptr, seq_p, loc);
3141 mark_addressable (to);
3142 to_ptr = build_fold_addr_expr_loc (loc, to);
3143 gimplify_arg (&to_ptr, seq_p, loc);
3145 t = implicit_built_in_decls[BUILT_IN_MEMCPY];
3147 gs = gimple_build_call (t, 3, to_ptr, from_ptr, size);
3151 /* tmp = memcpy() */
3152 t = create_tmp_var (TREE_TYPE (to_ptr), NULL);
3153 gimple_call_set_lhs (gs, t);
3154 gimplify_seq_add_stmt (seq_p, gs);
3156 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (to), t);
3160 gimplify_seq_add_stmt (seq_p, gs);
3165 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3166 a call to __builtin_memset. In this case we know that the RHS is
3167 a CONSTRUCTOR with an empty element list. */
3169 static enum gimplify_status
3170 gimplify_modify_expr_to_memset (tree *expr_p, tree size, bool want_value,
3173 tree t, from, to, to_ptr;
3175 location_t loc = EXPR_LOCATION (*expr_p);
3177 /* Assert our assumptions, to abort instead of producing wrong code
3178 silently if they are not met. Beware that the RHS CONSTRUCTOR might
3179 not be immediately exposed. */
3180 from = TREE_OPERAND (*expr_p, 1);
3181 if (TREE_CODE (from) == WITH_SIZE_EXPR)
3182 from = TREE_OPERAND (from, 0);
3184 gcc_assert (TREE_CODE (from) == CONSTRUCTOR
3185 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (from)));
3188 to = TREE_OPERAND (*expr_p, 0);
3190 to_ptr = build_fold_addr_expr_loc (loc, to);
3191 gimplify_arg (&to_ptr, seq_p, loc);
3192 t = implicit_built_in_decls[BUILT_IN_MEMSET];
3194 gs = gimple_build_call (t, 3, to_ptr, integer_zero_node, size);
3198 /* tmp = memset() */
3199 t = create_tmp_var (TREE_TYPE (to_ptr), NULL);
3200 gimple_call_set_lhs (gs, t);
3201 gimplify_seq_add_stmt (seq_p, gs);
3203 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (to), t);
3207 gimplify_seq_add_stmt (seq_p, gs);
3212 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
3213 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
3214 assignment. Returns non-null if we detect a potential overlap. */
3216 struct gimplify_init_ctor_preeval_data
3218 /* The base decl of the lhs object. May be NULL, in which case we
3219 have to assume the lhs is indirect. */
3222 /* The alias set of the lhs object. */
3223 alias_set_type lhs_alias_set;
3227 gimplify_init_ctor_preeval_1 (tree *tp, int *walk_subtrees, void *xdata)
3229 struct gimplify_init_ctor_preeval_data *data
3230 = (struct gimplify_init_ctor_preeval_data *) xdata;
3233 /* If we find the base object, obviously we have overlap. */
3234 if (data->lhs_base_decl == t)
3237 /* If the constructor component is indirect, determine if we have a
3238 potential overlap with the lhs. The only bits of information we
3239 have to go on at this point are addressability and alias sets. */
3240 if (TREE_CODE (t) == INDIRECT_REF
3241 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
3242 && alias_sets_conflict_p (data->lhs_alias_set, get_alias_set (t)))
3245 /* If the constructor component is a call, determine if it can hide a
3246 potential overlap with the lhs through an INDIRECT_REF like above. */
3247 if (TREE_CODE (t) == CALL_EXPR)
3249 tree type, fntype = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (t)));
3251 for (type = TYPE_ARG_TYPES (fntype); type; type = TREE_CHAIN (type))
3252 if (POINTER_TYPE_P (TREE_VALUE (type))
3253 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
3254 && alias_sets_conflict_p (data->lhs_alias_set,
3256 (TREE_TYPE (TREE_VALUE (type)))))
3260 if (IS_TYPE_OR_DECL_P (t))
3265 /* A subroutine of gimplify_init_constructor. Pre-evaluate EXPR,
3266 force values that overlap with the lhs (as described by *DATA)
3267 into temporaries. */
3270 gimplify_init_ctor_preeval (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
3271 struct gimplify_init_ctor_preeval_data *data)
3273 enum gimplify_status one;
3275 /* If the value is constant, then there's nothing to pre-evaluate. */
3276 if (TREE_CONSTANT (*expr_p))
3278 /* Ensure it does not have side effects, it might contain a reference to
3279 the object we're initializing. */
3280 gcc_assert (!TREE_SIDE_EFFECTS (*expr_p));
3284 /* If the type has non-trivial constructors, we can't pre-evaluate. */
3285 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p)))
3288 /* Recurse for nested constructors. */
3289 if (TREE_CODE (*expr_p) == CONSTRUCTOR)
3291 unsigned HOST_WIDE_INT ix;
3292 constructor_elt *ce;
3293 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (*expr_p);
3295 for (ix = 0; VEC_iterate (constructor_elt, v, ix, ce); ix++)
3296 gimplify_init_ctor_preeval (&ce->value, pre_p, post_p, data);
3301 /* If this is a variable sized type, we must remember the size. */
3302 maybe_with_size_expr (expr_p);
3304 /* Gimplify the constructor element to something appropriate for the rhs
3305 of a MODIFY_EXPR. Given that we know the LHS is an aggregate, we know
3306 the gimplifier will consider this a store to memory. Doing this
3307 gimplification now means that we won't have to deal with complicated
3308 language-specific trees, nor trees like SAVE_EXPR that can induce
3309 exponential search behavior. */
3310 one = gimplify_expr (expr_p, pre_p, post_p, is_gimple_mem_rhs, fb_rvalue);
3311 if (one == GS_ERROR)
3317 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
3318 with the lhs, since "a = { .x=a }" doesn't make sense. This will
3319 always be true for all scalars, since is_gimple_mem_rhs insists on a
3320 temporary variable for them. */
3321 if (DECL_P (*expr_p))
3324 /* If this is of variable size, we have no choice but to assume it doesn't
3325 overlap since we can't make a temporary for it. */
3326 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (*expr_p))) != INTEGER_CST)
3329 /* Otherwise, we must search for overlap ... */
3330 if (!walk_tree (expr_p, gimplify_init_ctor_preeval_1, data, NULL))
3333 /* ... and if found, force the value into a temporary. */
3334 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
3337 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
3338 a RANGE_EXPR in a CONSTRUCTOR for an array.
3342 object[var] = value;
3349 We increment var _after_ the loop exit check because we might otherwise
3350 fail if upper == TYPE_MAX_VALUE (type for upper).
3352 Note that we never have to deal with SAVE_EXPRs here, because this has
3353 already been taken care of for us, in gimplify_init_ctor_preeval(). */
3355 static void gimplify_init_ctor_eval (tree, VEC(constructor_elt,gc) *,
3356 gimple_seq *, bool);
3359 gimplify_init_ctor_eval_range (tree object, tree lower, tree upper,
3360 tree value, tree array_elt_type,
3361 gimple_seq *pre_p, bool cleared)
3363 tree loop_entry_label, loop_exit_label, fall_thru_label;
3364 tree var, var_type, cref, tmp;
3366 loop_entry_label = create_artificial_label (UNKNOWN_LOCATION);
3367 loop_exit_label = create_artificial_label (UNKNOWN_LOCATION);
3368 fall_thru_label = create_artificial_label (UNKNOWN_LOCATION);
3370 /* Create and initialize the index variable. */
3371 var_type = TREE_TYPE (upper);
3372 var = create_tmp_var (var_type, NULL);
3373 gimplify_seq_add_stmt (pre_p, gimple_build_assign (var, lower));
3375 /* Add the loop entry label. */
3376 gimplify_seq_add_stmt (pre_p, gimple_build_label (loop_entry_label));
3378 /* Build the reference. */
3379 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
3380 var, NULL_TREE, NULL_TREE);
3382 /* If we are a constructor, just call gimplify_init_ctor_eval to do
3383 the store. Otherwise just assign value to the reference. */
3385 if (TREE_CODE (value) == CONSTRUCTOR)
3386 /* NB we might have to call ourself recursively through
3387 gimplify_init_ctor_eval if the value is a constructor. */
3388 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
3391 gimplify_seq_add_stmt (pre_p, gimple_build_assign (cref, value));
3393 /* We exit the loop when the index var is equal to the upper bound. */
3394 gimplify_seq_add_stmt (pre_p,
3395 gimple_build_cond (EQ_EXPR, var, upper,
3396 loop_exit_label, fall_thru_label));
3398 gimplify_seq_add_stmt (pre_p, gimple_build_label (fall_thru_label));
3400 /* Otherwise, increment the index var... */
3401 tmp = build2 (PLUS_EXPR, var_type, var,
3402 fold_convert (var_type, integer_one_node));
3403 gimplify_seq_add_stmt (pre_p, gimple_build_assign (var, tmp));
3405 /* ...and jump back to the loop entry. */
3406 gimplify_seq_add_stmt (pre_p, gimple_build_goto (loop_entry_label));
3408 /* Add the loop exit label. */
3409 gimplify_seq_add_stmt (pre_p, gimple_build_label (loop_exit_label));
3412 /* Return true if FDECL is accessing a field that is zero sized. */
3415 zero_sized_field_decl (const_tree fdecl)
3417 if (TREE_CODE (fdecl) == FIELD_DECL && DECL_SIZE (fdecl)
3418 && integer_zerop (DECL_SIZE (fdecl)))
3423 /* Return true if TYPE is zero sized. */
3426 zero_sized_type (const_tree type)
3428 if (AGGREGATE_TYPE_P (type) && TYPE_SIZE (type)
3429 && integer_zerop (TYPE_SIZE (type)))
3434 /* A subroutine of gimplify_init_constructor. Generate individual
3435 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
3436 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
3437 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
3441 gimplify_init_ctor_eval (tree object, VEC(constructor_elt,gc) *elts,
3442 gimple_seq *pre_p, bool cleared)
3444 tree array_elt_type = NULL;
3445 unsigned HOST_WIDE_INT ix;
3446 tree purpose, value;
3448 if (TREE_CODE (TREE_TYPE (object)) == ARRAY_TYPE)
3449 array_elt_type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object)));
3451 FOR_EACH_CONSTRUCTOR_ELT (elts, ix, purpose, value)
3455 /* NULL values are created above for gimplification errors. */
3459 if (cleared && initializer_zerop (value))
3462 /* ??? Here's to hoping the front end fills in all of the indices,
3463 so we don't have to figure out what's missing ourselves. */
3464 gcc_assert (purpose);
3466 /* Skip zero-sized fields, unless value has side-effects. This can
3467 happen with calls to functions returning a zero-sized type, which
3468 we shouldn't discard. As a number of downstream passes don't
3469 expect sets of zero-sized fields, we rely on the gimplification of
3470 the MODIFY_EXPR we make below to drop the assignment statement. */
3471 if (! TREE_SIDE_EFFECTS (value) && zero_sized_field_decl (purpose))
3474 /* If we have a RANGE_EXPR, we have to build a loop to assign the
3476 if (TREE_CODE (purpose) == RANGE_EXPR)
3478 tree lower = TREE_OPERAND (purpose, 0);
3479 tree upper = TREE_OPERAND (purpose, 1);
3481 /* If the lower bound is equal to upper, just treat it as if
3482 upper was the index. */
3483 if (simple_cst_equal (lower, upper))
3487 gimplify_init_ctor_eval_range (object, lower, upper, value,
3488 array_elt_type, pre_p, cleared);
3495 /* Do not use bitsizetype for ARRAY_REF indices. */
3496 if (TYPE_DOMAIN (TREE_TYPE (object)))
3497 purpose = fold_convert (TREE_TYPE (TYPE_DOMAIN (TREE_TYPE (object))),
3499 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
3500 purpose, NULL_TREE, NULL_TREE);
3504 gcc_assert (TREE_CODE (purpose) == FIELD_DECL);
3505 cref = build3 (COMPONENT_REF, TREE_TYPE (purpose),
3506 unshare_expr (object), purpose, NULL_TREE);
3509 if (TREE_CODE (value) == CONSTRUCTOR
3510 && TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE)
3511 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
3515 tree init = build2 (INIT_EXPR, TREE_TYPE (cref), cref, value);
3516 gimplify_and_add (init, pre_p);
3523 /* Returns the appropriate RHS predicate for this LHS. */
3526 rhs_predicate_for (tree lhs)
3528 if (is_gimple_reg (lhs))
3529 return is_gimple_reg_rhs_or_call;
3531 return is_gimple_mem_rhs_or_call;
3534 /* Gimplify a C99 compound literal expression. This just means adding
3535 the DECL_EXPR before the current statement and using its anonymous
3538 static enum gimplify_status
3539 gimplify_compound_literal_expr (tree *expr_p, gimple_seq *pre_p)
3541 tree decl_s = COMPOUND_LITERAL_EXPR_DECL_EXPR (*expr_p);
3542 tree decl = DECL_EXPR_DECL (decl_s);
3543 /* Mark the decl as addressable if the compound literal
3544 expression is addressable now, otherwise it is marked too late
3545 after we gimplify the initialization expression. */
3546 if (TREE_ADDRESSABLE (*expr_p))
3547 TREE_ADDRESSABLE (decl) = 1;
3549 /* Preliminarily mark non-addressed complex variables as eligible
3550 for promotion to gimple registers. We'll transform their uses
3552 if ((TREE_CODE (TREE_TYPE (decl)) == COMPLEX_TYPE
3553 || TREE_CODE (TREE_TYPE (decl)) == VECTOR_TYPE)
3554 && !TREE_THIS_VOLATILE (decl)
3555 && !needs_to_live_in_memory (decl))
3556 DECL_GIMPLE_REG_P (decl) = 1;
3558 /* This decl isn't mentioned in the enclosing block, so add it to the
3559 list of temps. FIXME it seems a bit of a kludge to say that
3560 anonymous artificial vars aren't pushed, but everything else is. */
3561 if (DECL_NAME (decl) == NULL_TREE && !DECL_SEEN_IN_BIND_EXPR_P (decl))
3562 gimple_add_tmp_var (decl);
3564 gimplify_and_add (decl_s, pre_p);
3569 /* Optimize embedded COMPOUND_LITERAL_EXPRs within a CONSTRUCTOR,
3570 return a new CONSTRUCTOR if something changed. */
3573 optimize_compound_literals_in_ctor (tree orig_ctor)
3575 tree ctor = orig_ctor;
3576 VEC(constructor_elt,gc) *elts = CONSTRUCTOR_ELTS (ctor);
3577 unsigned int idx, num = VEC_length (constructor_elt, elts);
3579 for (idx = 0; idx < num; idx++)
3581 tree value = VEC_index (constructor_elt, elts, idx)->value;
3582 tree newval = value;
3583 if (TREE_CODE (value) == CONSTRUCTOR)
3584 newval = optimize_compound_literals_in_ctor (value);
3585 else if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
3587 tree decl_s = COMPOUND_LITERAL_EXPR_DECL_EXPR (value);
3588 tree decl = DECL_EXPR_DECL (decl_s);
3589 tree init = DECL_INITIAL (decl);
3591 if (!TREE_ADDRESSABLE (value)
3592 && !TREE_ADDRESSABLE (decl)
3594 newval = optimize_compound_literals_in_ctor (init);
3596 if (newval == value)
3599 if (ctor == orig_ctor)
3601 ctor = copy_node (orig_ctor);
3602 CONSTRUCTOR_ELTS (ctor) = VEC_copy (constructor_elt, gc, elts);
3603 elts = CONSTRUCTOR_ELTS (ctor);
3605 VEC_index (constructor_elt, elts, idx)->value = newval;
3612 /* A subroutine of gimplify_modify_expr. Break out elements of a
3613 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
3615 Note that we still need to clear any elements that don't have explicit
3616 initializers, so if not all elements are initialized we keep the
3617 original MODIFY_EXPR, we just remove all of the constructor elements.
3619 If NOTIFY_TEMP_CREATION is true, do not gimplify, just return
3620 GS_ERROR if we would have to create a temporary when gimplifying
3621 this constructor. Otherwise, return GS_OK.
3623 If NOTIFY_TEMP_CREATION is false, just do the gimplification. */
3625 static enum gimplify_status
3626 gimplify_init_constructor (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
3627 bool want_value, bool notify_temp_creation)
3629 tree object, ctor, type;
3630 enum gimplify_status ret;
3631 VEC(constructor_elt,gc) *elts;
3633 gcc_assert (TREE_CODE (TREE_OPERAND (*expr_p, 1)) == CONSTRUCTOR);
3635 if (!notify_temp_creation)
3637 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3638 is_gimple_lvalue, fb_lvalue);
3639 if (ret == GS_ERROR)
3643 object = TREE_OPERAND (*expr_p, 0);
3644 ctor = TREE_OPERAND (*expr_p, 1) =
3645 optimize_compound_literals_in_ctor (TREE_OPERAND (*expr_p, 1));
3646 type = TREE_TYPE (ctor);
3647 elts = CONSTRUCTOR_ELTS (ctor);
3650 switch (TREE_CODE (type))
3654 case QUAL_UNION_TYPE:
3657 struct gimplify_init_ctor_preeval_data preeval_data;
3658 HOST_WIDE_INT num_type_elements, num_ctor_elements;
3659 HOST_WIDE_INT num_nonzero_elements;
3660 bool cleared, valid_const_initializer;
3662 /* Aggregate types must lower constructors to initialization of
3663 individual elements. The exception is that a CONSTRUCTOR node
3664 with no elements indicates zero-initialization of the whole. */
3665 if (VEC_empty (constructor_elt, elts))
3667 if (notify_temp_creation)
3672 /* Fetch information about the constructor to direct later processing.
3673 We might want to make static versions of it in various cases, and
3674 can only do so if it known to be a valid constant initializer. */
3675 valid_const_initializer
3676 = categorize_ctor_elements (ctor, &num_nonzero_elements,
3677 &num_ctor_elements, &cleared);
3679 /* If a const aggregate variable is being initialized, then it
3680 should never be a lose to promote the variable to be static. */
3681 if (valid_const_initializer
3682 && num_nonzero_elements > 1
3683 && TREE_READONLY (object)
3684 && TREE_CODE (object) == VAR_DECL
3685 && (flag_merge_constants >= 2 || !TREE_ADDRESSABLE (object)))
3687 if (notify_temp_creation)
3689 DECL_INITIAL (object) = ctor;
3690 TREE_STATIC (object) = 1;
3691 if (!DECL_NAME (object))
3692 DECL_NAME (object) = create_tmp_var_name ("C");
3693 walk_tree (&DECL_INITIAL (object), force_labels_r, NULL, NULL);
3695 /* ??? C++ doesn't automatically append a .<number> to the
3696 assembler name, and even when it does, it looks a FE private
3697 data structures to figure out what that number should be,
3698 which are not set for this variable. I suppose this is
3699 important for local statics for inline functions, which aren't
3700 "local" in the object file sense. So in order to get a unique
3701 TU-local symbol, we must invoke the lhd version now. */
3702 lhd_set_decl_assembler_name (object);
3704 *expr_p = NULL_TREE;
3708 /* If there are "lots" of initialized elements, even discounting
3709 those that are not address constants (and thus *must* be
3710 computed at runtime), then partition the constructor into
3711 constant and non-constant parts. Block copy the constant
3712 parts in, then generate code for the non-constant parts. */
3713 /* TODO. There's code in cp/typeck.c to do this. */
3715 num_type_elements = count_type_elements (type, true);
3717 /* If count_type_elements could not determine number of type elements
3718 for a constant-sized object, assume clearing is needed.
3719 Don't do this for variable-sized objects, as store_constructor
3720 will ignore the clearing of variable-sized objects. */
3721 if (num_type_elements < 0 && int_size_in_bytes (type) >= 0)
3723 /* If there are "lots" of zeros, then block clear the object first. */
3724 else if (num_type_elements - num_nonzero_elements
3725 > CLEAR_RATIO (optimize_function_for_speed_p (cfun))
3726 && num_nonzero_elements < num_type_elements/4)
3728 /* ??? This bit ought not be needed. For any element not present
3729 in the initializer, we should simply set them to zero. Except
3730 we'd need to *find* the elements that are not present, and that
3731 requires trickery to avoid quadratic compile-time behavior in
3732 large cases or excessive memory use in small cases. */
3733 else if (num_ctor_elements < num_type_elements)
3736 /* If there are "lots" of initialized elements, and all of them
3737 are valid address constants, then the entire initializer can
3738 be dropped to memory, and then memcpy'd out. Don't do this
3739 for sparse arrays, though, as it's more efficient to follow
3740 the standard CONSTRUCTOR behavior of memset followed by
3741 individual element initialization. Also don't do this for small
3742 all-zero initializers (which aren't big enough to merit
3743 clearing), and don't try to make bitwise copies of
3744 TREE_ADDRESSABLE types. */
3745 if (valid_const_initializer
3746 && !(cleared || num_nonzero_elements == 0)
3747 && !TREE_ADDRESSABLE (type))
3749 HOST_WIDE_INT size = int_size_in_bytes (type);
3752 /* ??? We can still get unbounded array types, at least
3753 from the C++ front end. This seems wrong, but attempt
3754 to work around it for now. */
3757 size = int_size_in_bytes (TREE_TYPE (object));
3759 TREE_TYPE (ctor) = type = TREE_TYPE (object);
3762 /* Find the maximum alignment we can assume for the object. */
3763 /* ??? Make use of DECL_OFFSET_ALIGN. */
3764 if (DECL_P (object))
3765 align = DECL_ALIGN (object);
3767 align = TYPE_ALIGN (type);
3770 && num_nonzero_elements > 1
3771 && !can_move_by_pieces (size, align))
3773 if (notify_temp_creation)
3776 walk_tree (&ctor, force_labels_r, NULL, NULL);
3777 TREE_OPERAND (*expr_p, 1) = tree_output_constant_def (ctor);
3779 /* This is no longer an assignment of a CONSTRUCTOR, but
3780 we still may have processing to do on the LHS. So
3781 pretend we didn't do anything here to let that happen. */
3782 return GS_UNHANDLED;
3786 /* If the target is volatile and we have non-zero elements
3787 initialize the target from a temporary. */
3788 if (TREE_THIS_VOLATILE (object)
3789 && !TREE_ADDRESSABLE (type)
3790 && num_nonzero_elements > 0)
3792 tree temp = create_tmp_var (TYPE_MAIN_VARIANT (type), NULL);
3793 TREE_OPERAND (*expr_p, 0) = temp;
3794 *expr_p = build2 (COMPOUND_EXPR, TREE_TYPE (*expr_p),
3796 build2 (MODIFY_EXPR, void_type_node,
3801 if (notify_temp_creation)
3804 /* If there are nonzero elements and if needed, pre-evaluate to capture
3805 elements overlapping with the lhs into temporaries. We must do this
3806 before clearing to fetch the values before they are zeroed-out. */
3807 if (num_nonzero_elements > 0 && TREE_CODE (*expr_p) != INIT_EXPR)
3809 preeval_data.lhs_base_decl = get_base_address (object);
3810 if (!DECL_P (preeval_data.lhs_base_decl))
3811 preeval_data.lhs_base_decl = NULL;
3812 preeval_data.lhs_alias_set = get_alias_set (object);
3814 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p, 1),
3815 pre_p, post_p, &preeval_data);
3820 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3821 Note that we still have to gimplify, in order to handle the
3822 case of variable sized types. Avoid shared tree structures. */
3823 CONSTRUCTOR_ELTS (ctor) = NULL;
3824 TREE_SIDE_EFFECTS (ctor) = 0;
3825 object = unshare_expr (object);
3826 gimplify_stmt (expr_p, pre_p);
3829 /* If we have not block cleared the object, or if there are nonzero
3830 elements in the constructor, add assignments to the individual
3831 scalar fields of the object. */
3832 if (!cleared || num_nonzero_elements > 0)
3833 gimplify_init_ctor_eval (object, elts, pre_p, cleared);
3835 *expr_p = NULL_TREE;
3843 if (notify_temp_creation)
3846 /* Extract the real and imaginary parts out of the ctor. */
3847 gcc_assert (VEC_length (constructor_elt, elts) == 2);
3848 r = VEC_index (constructor_elt, elts, 0)->value;
3849 i = VEC_index (constructor_elt, elts, 1)->value;
3850 if (r == NULL || i == NULL)
3852 tree zero = fold_convert (TREE_TYPE (type), integer_zero_node);
3859 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3860 represent creation of a complex value. */
3861 if (TREE_CONSTANT (r) && TREE_CONSTANT (i))
3863 ctor = build_complex (type, r, i);
3864 TREE_OPERAND (*expr_p, 1) = ctor;
3868 ctor = build2 (COMPLEX_EXPR, type, r, i);
3869 TREE_OPERAND (*expr_p, 1) = ctor;
3870 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 1),
3873 rhs_predicate_for (TREE_OPERAND (*expr_p, 0)),
3881 unsigned HOST_WIDE_INT ix;
3882 constructor_elt *ce;
3884 if (notify_temp_creation)
3887 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3888 if (TREE_CONSTANT (ctor))
3890 bool constant_p = true;
3893 /* Even when ctor is constant, it might contain non-*_CST
3894 elements, such as addresses or trapping values like
3895 1.0/0.0 - 1.0/0.0. Such expressions don't belong
3896 in VECTOR_CST nodes. */
3897 FOR_EACH_CONSTRUCTOR_VALUE (elts, ix, value)
3898 if (!CONSTANT_CLASS_P (value))
3906 TREE_OPERAND (*expr_p, 1) = build_vector_from_ctor (type, elts);
3910 /* Don't reduce an initializer constant even if we can't
3911 make a VECTOR_CST. It won't do anything for us, and it'll
3912 prevent us from representing it as a single constant. */
3913 if (initializer_constant_valid_p (ctor, type))
3916 TREE_CONSTANT (ctor) = 0;
3919 /* Vector types use CONSTRUCTOR all the way through gimple
3920 compilation as a general initializer. */
3921 for (ix = 0; VEC_iterate (constructor_elt, elts, ix, ce); ix++)
3923 enum gimplify_status tret;
3924 tret = gimplify_expr (&ce->value, pre_p, post_p, is_gimple_val,
3926 if (tret == GS_ERROR)
3929 if (!is_gimple_reg (TREE_OPERAND (*expr_p, 0)))
3930 TREE_OPERAND (*expr_p, 1) = get_formal_tmp_var (ctor, pre_p);
3935 /* So how did we get a CONSTRUCTOR for a scalar type? */
3939 if (ret == GS_ERROR)
3941 else if (want_value)
3948 /* If we have gimplified both sides of the initializer but have
3949 not emitted an assignment, do so now. */
3952 tree lhs = TREE_OPERAND (*expr_p, 0);
3953 tree rhs = TREE_OPERAND (*expr_p, 1);
3954 gimple init = gimple_build_assign (lhs, rhs);
3955 gimplify_seq_add_stmt (pre_p, init);
3963 /* Given a pointer value OP0, return a simplified version of an
3964 indirection through OP0, or NULL_TREE if no simplification is
3965 possible. Note that the resulting type may be different from
3966 the type pointed to in the sense that it is still compatible
3967 from the langhooks point of view. */
3970 gimple_fold_indirect_ref (tree t)
3972 tree type = TREE_TYPE (TREE_TYPE (t));
3977 subtype = TREE_TYPE (sub);
3978 if (!POINTER_TYPE_P (subtype))
3981 if (TREE_CODE (sub) == ADDR_EXPR)
3983 tree op = TREE_OPERAND (sub, 0);
3984 tree optype = TREE_TYPE (op);
3986 if (useless_type_conversion_p (type, optype))
3989 /* *(foo *)&fooarray => fooarray[0] */
3990 if (TREE_CODE (optype) == ARRAY_TYPE
3991 && TREE_CODE (TYPE_SIZE (TREE_TYPE (optype))) == INTEGER_CST
3992 && useless_type_conversion_p (type, TREE_TYPE (optype)))
3994 tree type_domain = TYPE_DOMAIN (optype);
3995 tree min_val = size_zero_node;
3996 if (type_domain && TYPE_MIN_VALUE (type_domain))
3997 min_val = TYPE_MIN_VALUE (type_domain);
3998 if (TREE_CODE (min_val) == INTEGER_CST)
3999 return build4 (ARRAY_REF, type, op, min_val, NULL_TREE, NULL_TREE);
4001 /* *(foo *)&complexfoo => __real__ complexfoo */
4002 else if (TREE_CODE (optype) == COMPLEX_TYPE
4003 && useless_type_conversion_p (type, TREE_TYPE (optype)))
4004 return fold_build1 (REALPART_EXPR, type, op);
4005 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
4006 else if (TREE_CODE (optype) == VECTOR_TYPE
4007 && useless_type_conversion_p (type, TREE_TYPE (optype)))
4009 tree part_width = TYPE_SIZE (type);
4010 tree index = bitsize_int (0);
4011 return fold_build3 (BIT_FIELD_REF, type, op, part_width, index);
4015 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
4016 if (TREE_CODE (sub) == POINTER_PLUS_EXPR
4017 && TREE_CODE (TREE_OPERAND (sub, 1)) == INTEGER_CST)
4019 tree op00 = TREE_OPERAND (sub, 0);
4020 tree op01 = TREE_OPERAND (sub, 1);
4024 op00type = TREE_TYPE (op00);
4025 if (TREE_CODE (op00) == ADDR_EXPR
4026 && TREE_CODE (TREE_TYPE (op00type)) == VECTOR_TYPE
4027 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (op00type))))
4029 HOST_WIDE_INT offset = tree_low_cst (op01, 0);
4030 tree part_width = TYPE_SIZE (type);
4031 unsigned HOST_WIDE_INT part_widthi
4032 = tree_low_cst (part_width, 0) / BITS_PER_UNIT;
4033 unsigned HOST_WIDE_INT indexi = offset * BITS_PER_UNIT;
4034 tree index = bitsize_int (indexi);
4035 if (offset / part_widthi
4036 <= TYPE_VECTOR_SUBPARTS (TREE_TYPE (op00type)))
4037 return fold_build3 (BIT_FIELD_REF, type, TREE_OPERAND (op00, 0),
4042 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
4043 if (TREE_CODE (sub) == POINTER_PLUS_EXPR
4044 && TREE_CODE (TREE_OPERAND (sub, 1)) == INTEGER_CST)
4046 tree op00 = TREE_OPERAND (sub, 0);
4047 tree op01 = TREE_OPERAND (sub, 1);
4051 op00type = TREE_TYPE (op00);
4052 if (TREE_CODE (op00) == ADDR_EXPR
4053 && TREE_CODE (TREE_TYPE (op00type)) == COMPLEX_TYPE
4054 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (op00type))))
4056 tree size = TYPE_SIZE_UNIT (type);
4057 if (tree_int_cst_equal (size, op01))
4058 return fold_build1 (IMAGPART_EXPR, type, TREE_OPERAND (op00, 0));
4062 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
4063 if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
4064 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (subtype)))) == INTEGER_CST
4065 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (subtype))))
4068 tree min_val = size_zero_node;
4070 sub = gimple_fold_indirect_ref (sub);
4072 sub = build1 (INDIRECT_REF, TREE_TYPE (subtype), osub);
4073 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
4074 if (type_domain && TYPE_MIN_VALUE (type_domain))
4075 min_val = TYPE_MIN_VALUE (type_domain);
4076 if (TREE_CODE (min_val) == INTEGER_CST)
4077 return build4 (ARRAY_REF, type, sub, min_val, NULL_TREE, NULL_TREE);
4083 /* Given a pointer value OP0, return a simplified version of an
4084 indirection through OP0, or NULL_TREE if no simplification is
4085 possible. This may only be applied to a rhs of an expression.
4086 Note that the resulting type may be different from the type pointed
4087 to in the sense that it is still compatible from the langhooks
4091 gimple_fold_indirect_ref_rhs (tree t)
4093 return gimple_fold_indirect_ref (t);
4096 /* Subroutine of gimplify_modify_expr to do simplifications of
4097 MODIFY_EXPRs based on the code of the RHS. We loop for as long as
4098 something changes. */
4100 static enum gimplify_status
4101 gimplify_modify_expr_rhs (tree *expr_p, tree *from_p, tree *to_p,
4102 gimple_seq *pre_p, gimple_seq *post_p,
4105 enum gimplify_status ret = GS_UNHANDLED;
4111 switch (TREE_CODE (*from_p))
4114 /* If we're assigning from a read-only variable initialized with
4115 a constructor, do the direct assignment from the constructor,
4116 but only if neither source nor target are volatile since this
4117 latter assignment might end up being done on a per-field basis. */
4118 if (DECL_INITIAL (*from_p)
4119 && TREE_READONLY (*from_p)
4120 && !TREE_THIS_VOLATILE (*from_p)
4121 && !TREE_THIS_VOLATILE (*to_p)
4122 && TREE_CODE (DECL_INITIAL (*from_p)) == CONSTRUCTOR)
4124 tree old_from = *from_p;
4125 enum gimplify_status subret;
4127 /* Move the constructor into the RHS. */
4128 *from_p = unshare_expr (DECL_INITIAL (*from_p));
4130 /* Let's see if gimplify_init_constructor will need to put
4132 subret = gimplify_init_constructor (expr_p, NULL, NULL,
4134 if (subret == GS_ERROR)
4136 /* If so, revert the change. */
4148 /* If we have code like
4152 where the type of "x" is a (possibly cv-qualified variant
4153 of "A"), treat the entire expression as identical to "x".
4154 This kind of code arises in C++ when an object is bound
4155 to a const reference, and if "x" is a TARGET_EXPR we want
4156 to take advantage of the optimization below. */
4157 tree t = gimple_fold_indirect_ref_rhs (TREE_OPERAND (*from_p, 0));
4169 /* If we are initializing something from a TARGET_EXPR, strip the
4170 TARGET_EXPR and initialize it directly, if possible. This can't
4171 be done if the initializer is void, since that implies that the
4172 temporary is set in some non-trivial way.
4174 ??? What about code that pulls out the temp and uses it
4175 elsewhere? I think that such code never uses the TARGET_EXPR as
4176 an initializer. If I'm wrong, we'll die because the temp won't
4177 have any RTL. In that case, I guess we'll need to replace
4178 references somehow. */
4179 tree init = TARGET_EXPR_INITIAL (*from_p);
4182 && !VOID_TYPE_P (TREE_TYPE (init)))
4192 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
4194 gimplify_compound_expr (from_p, pre_p, true);
4200 /* If we're initializing from a CONSTRUCTOR, break this into
4201 individual MODIFY_EXPRs. */
4202 return gimplify_init_constructor (expr_p, pre_p, post_p, want_value,
4206 /* If we're assigning to a non-register type, push the assignment
4207 down into the branches. This is mandatory for ADDRESSABLE types,
4208 since we cannot generate temporaries for such, but it saves a
4209 copy in other cases as well. */
4210 if (!is_gimple_reg_type (TREE_TYPE (*from_p)))
4212 /* This code should mirror the code in gimplify_cond_expr. */
4213 enum tree_code code = TREE_CODE (*expr_p);
4214 tree cond = *from_p;
4215 tree result = *to_p;
4217 ret = gimplify_expr (&result, pre_p, post_p,
4218 is_gimple_lvalue, fb_lvalue);
4219 if (ret != GS_ERROR)
4222 if (TREE_TYPE (TREE_OPERAND (cond, 1)) != void_type_node)
4223 TREE_OPERAND (cond, 1)
4224 = build2 (code, void_type_node, result,
4225 TREE_OPERAND (cond, 1));
4226 if (TREE_TYPE (TREE_OPERAND (cond, 2)) != void_type_node)
4227 TREE_OPERAND (cond, 2)
4228 = build2 (code, void_type_node, unshare_expr (result),
4229 TREE_OPERAND (cond, 2));
4231 TREE_TYPE (cond) = void_type_node;
4232 recalculate_side_effects (cond);
4236 gimplify_and_add (cond, pre_p);
4237 *expr_p = unshare_expr (result);
4246 /* For calls that return in memory, give *to_p as the CALL_EXPR's
4247 return slot so that we don't generate a temporary. */
4248 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p)
4249 && aggregate_value_p (*from_p, *from_p))
4253 if (!(rhs_predicate_for (*to_p))(*from_p))
4254 /* If we need a temporary, *to_p isn't accurate. */
4256 else if (TREE_CODE (*to_p) == RESULT_DECL
4257 && DECL_NAME (*to_p) == NULL_TREE
4258 && needs_to_live_in_memory (*to_p))
4259 /* It's OK to use the return slot directly unless it's an NRV. */
4261 else if (is_gimple_reg_type (TREE_TYPE (*to_p))
4262 || (DECL_P (*to_p) && DECL_REGISTER (*to_p)))
4263 /* Don't force regs into memory. */
4265 else if (TREE_CODE (*expr_p) == INIT_EXPR)
4266 /* It's OK to use the target directly if it's being
4269 else if (!is_gimple_non_addressable (*to_p))
4270 /* Don't use the original target if it's already addressable;
4271 if its address escapes, and the called function uses the
4272 NRV optimization, a conforming program could see *to_p
4273 change before the called function returns; see c++/19317.
4274 When optimizing, the return_slot pass marks more functions
4275 as safe after we have escape info. */
4282 CALL_EXPR_RETURN_SLOT_OPT (*from_p) = 1;
4283 mark_addressable (*to_p);
4288 case WITH_SIZE_EXPR:
4289 /* Likewise for calls that return an aggregate of non-constant size,
4290 since we would not be able to generate a temporary at all. */
4291 if (TREE_CODE (TREE_OPERAND (*from_p, 0)) == CALL_EXPR)
4293 *from_p = TREE_OPERAND (*from_p, 0);
4294 /* We don't change ret in this case because the
4295 WITH_SIZE_EXPR might have been added in
4296 gimplify_modify_expr, so returning GS_OK would lead to an
4302 /* If we're initializing from a container, push the initialization
4304 case CLEANUP_POINT_EXPR:
4306 case STATEMENT_LIST:
4308 tree wrap = *from_p;
4311 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_min_lval,
4313 if (ret != GS_ERROR)
4316 t = voidify_wrapper_expr (wrap, *expr_p);
4317 gcc_assert (t == *expr_p);
4321 gimplify_and_add (wrap, pre_p);
4322 *expr_p = unshare_expr (*to_p);
4329 case COMPOUND_LITERAL_EXPR:
4331 tree complit = TREE_OPERAND (*expr_p, 1);
4332 tree decl_s = COMPOUND_LITERAL_EXPR_DECL_EXPR (complit);
4333 tree decl = DECL_EXPR_DECL (decl_s);
4334 tree init = DECL_INITIAL (decl);
4336 /* struct T x = (struct T) { 0, 1, 2 } can be optimized
4337 into struct T x = { 0, 1, 2 } if the address of the
4338 compound literal has never been taken. */
4339 if (!TREE_ADDRESSABLE (complit)
4340 && !TREE_ADDRESSABLE (decl)
4343 *expr_p = copy_node (*expr_p);
4344 TREE_OPERAND (*expr_p, 1) = init;
4359 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
4360 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
4361 DECL_GIMPLE_REG_P set.
4363 IMPORTANT NOTE: This promotion is performed by introducing a load of the
4364 other, unmodified part of the complex object just before the total store.
4365 As a consequence, if the object is still uninitialized, an undefined value
4366 will be loaded into a register, which may result in a spurious exception
4367 if the register is floating-point and the value happens to be a signaling
4368 NaN for example. Then the fully-fledged complex operations lowering pass
4369 followed by a DCE pass are necessary in order to fix things up. */
4371 static enum gimplify_status
4372 gimplify_modify_expr_complex_part (tree *expr_p, gimple_seq *pre_p,
4375 enum tree_code code, ocode;
4376 tree lhs, rhs, new_rhs, other, realpart, imagpart;
4378 lhs = TREE_OPERAND (*expr_p, 0);
4379 rhs = TREE_OPERAND (*expr_p, 1);
4380 code = TREE_CODE (lhs);
4381 lhs = TREE_OPERAND (lhs, 0);
4383 ocode = code == REALPART_EXPR ? IMAGPART_EXPR : REALPART_EXPR;
4384 other = build1 (ocode, TREE_TYPE (rhs), lhs);
4385 other = get_formal_tmp_var (other, pre_p);
4387 realpart = code == REALPART_EXPR ? rhs : other;
4388 imagpart = code == REALPART_EXPR ? other : rhs;
4390 if (TREE_CONSTANT (realpart) && TREE_CONSTANT (imagpart))
4391 new_rhs = build_complex (TREE_TYPE (lhs), realpart, imagpart);
4393 new_rhs = build2 (COMPLEX_EXPR, TREE_TYPE (lhs), realpart, imagpart);
4395 gimplify_seq_add_stmt (pre_p, gimple_build_assign (lhs, new_rhs));
4396 *expr_p = (want_value) ? rhs : NULL_TREE;
4402 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
4408 PRE_P points to the list where side effects that must happen before
4409 *EXPR_P should be stored.
4411 POST_P points to the list where side effects that must happen after
4412 *EXPR_P should be stored.
4414 WANT_VALUE is nonzero iff we want to use the value of this expression
4415 in another expression. */
4417 static enum gimplify_status
4418 gimplify_modify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
4421 tree *from_p = &TREE_OPERAND (*expr_p, 1);
4422 tree *to_p = &TREE_OPERAND (*expr_p, 0);
4423 enum gimplify_status ret = GS_UNHANDLED;
4425 location_t loc = EXPR_LOCATION (*expr_p);
4427 gcc_assert (TREE_CODE (*expr_p) == MODIFY_EXPR
4428 || TREE_CODE (*expr_p) == INIT_EXPR);
4430 /* Insert pointer conversions required by the middle-end that are not
4431 required by the frontend. This fixes middle-end type checking for
4432 for example gcc.dg/redecl-6.c. */
4433 if (POINTER_TYPE_P (TREE_TYPE (*to_p)))
4435 STRIP_USELESS_TYPE_CONVERSION (*from_p);
4436 if (!useless_type_conversion_p (TREE_TYPE (*to_p), TREE_TYPE (*from_p)))
4437 *from_p = fold_convert_loc (loc, TREE_TYPE (*to_p), *from_p);
4440 /* See if any simplifications can be done based on what the RHS is. */
4441 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
4443 if (ret != GS_UNHANDLED)
4446 /* For zero sized types only gimplify the left hand side and right hand
4447 side as statements and throw away the assignment. Do this after
4448 gimplify_modify_expr_rhs so we handle TARGET_EXPRs of addressable
4450 if (zero_sized_type (TREE_TYPE (*from_p)) && !want_value)
4452 gimplify_stmt (from_p, pre_p);
4453 gimplify_stmt (to_p, pre_p);
4454 *expr_p = NULL_TREE;
4458 /* If the value being copied is of variable width, compute the length
4459 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
4460 before gimplifying any of the operands so that we can resolve any
4461 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
4462 the size of the expression to be copied, not of the destination, so
4463 that is what we must do here. */
4464 maybe_with_size_expr (from_p);
4466 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
4467 if (ret == GS_ERROR)
4470 /* As a special case, we have to temporarily allow for assignments
4471 with a CALL_EXPR on the RHS. Since in GIMPLE a function call is
4472 a toplevel statement, when gimplifying the GENERIC expression
4473 MODIFY_EXPR <a, CALL_EXPR <foo>>, we cannot create the tuple
4474 GIMPLE_ASSIGN <a, GIMPLE_CALL <foo>>.
4476 Instead, we need to create the tuple GIMPLE_CALL <a, foo>. To
4477 prevent gimplify_expr from trying to create a new temporary for
4478 foo's LHS, we tell it that it should only gimplify until it
4479 reaches the CALL_EXPR. On return from gimplify_expr, the newly
4480 created GIMPLE_CALL <foo> will be the last statement in *PRE_P
4481 and all we need to do here is set 'a' to be its LHS. */
4482 ret = gimplify_expr (from_p, pre_p, post_p, rhs_predicate_for (*to_p),
4484 if (ret == GS_ERROR)
4487 /* Now see if the above changed *from_p to something we handle specially. */
4488 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
4490 if (ret != GS_UNHANDLED)
4493 /* If we've got a variable sized assignment between two lvalues (i.e. does
4494 not involve a call), then we can make things a bit more straightforward
4495 by converting the assignment to memcpy or memset. */
4496 if (TREE_CODE (*from_p) == WITH_SIZE_EXPR)
4498 tree from = TREE_OPERAND (*from_p, 0);
4499 tree size = TREE_OPERAND (*from_p, 1);
4501 if (TREE_CODE (from) == CONSTRUCTOR)
4502 return gimplify_modify_expr_to_memset (expr_p, size, want_value, pre_p);
4504 if (is_gimple_addressable (from))
4507 return gimplify_modify_expr_to_memcpy (expr_p, size, want_value,
4512 /* Transform partial stores to non-addressable complex variables into
4513 total stores. This allows us to use real instead of virtual operands
4514 for these variables, which improves optimization. */
4515 if ((TREE_CODE (*to_p) == REALPART_EXPR
4516 || TREE_CODE (*to_p) == IMAGPART_EXPR)
4517 && is_gimple_reg (TREE_OPERAND (*to_p, 0)))
4518 return gimplify_modify_expr_complex_part (expr_p, pre_p, want_value);
4520 /* Try to alleviate the effects of the gimplification creating artificial
4521 temporaries (see for example is_gimple_reg_rhs) on the debug info. */
4522 if (!gimplify_ctxp->into_ssa
4524 && DECL_IGNORED_P (*from_p)
4526 && !DECL_IGNORED_P (*to_p))
4528 if (!DECL_NAME (*from_p) && DECL_NAME (*to_p))
4530 = create_tmp_var_name (IDENTIFIER_POINTER (DECL_NAME (*to_p)));
4531 DECL_DEBUG_EXPR_IS_FROM (*from_p) = 1;
4532 SET_DECL_DEBUG_EXPR (*from_p, *to_p);
4535 if (TREE_CODE (*from_p) == CALL_EXPR)
4537 /* Since the RHS is a CALL_EXPR, we need to create a GIMPLE_CALL
4538 instead of a GIMPLE_ASSIGN. */
4539 assign = gimple_build_call_from_tree (*from_p);
4540 if (!gimple_call_noreturn_p (assign))
4541 gimple_call_set_lhs (assign, *to_p);
4545 assign = gimple_build_assign (*to_p, *from_p);
4546 gimple_set_location (assign, EXPR_LOCATION (*expr_p));
4549 gimplify_seq_add_stmt (pre_p, assign);
4551 if (gimplify_ctxp->into_ssa && is_gimple_reg (*to_p))
4553 /* If we've somehow already got an SSA_NAME on the LHS, then
4554 we've probably modified it twice. Not good. */
4555 gcc_assert (TREE_CODE (*to_p) != SSA_NAME);
4556 *to_p = make_ssa_name (*to_p, assign);
4557 gimple_set_lhs (assign, *to_p);
4562 *expr_p = unshare_expr (*to_p);
4571 /* Gimplify a comparison between two variable-sized objects. Do this
4572 with a call to BUILT_IN_MEMCMP. */
4574 static enum gimplify_status
4575 gimplify_variable_sized_compare (tree *expr_p)
4577 tree op0 = TREE_OPERAND (*expr_p, 0);
4578 tree op1 = TREE_OPERAND (*expr_p, 1);
4579 tree t, arg, dest, src;
4580 location_t loc = EXPR_LOCATION (*expr_p);
4582 arg = TYPE_SIZE_UNIT (TREE_TYPE (op0));
4583 arg = unshare_expr (arg);
4584 arg = SUBSTITUTE_PLACEHOLDER_IN_EXPR (arg, op0);
4585 src = build_fold_addr_expr_loc (loc, op1);
4586 dest = build_fold_addr_expr_loc (loc, op0);
4587 t = implicit_built_in_decls[BUILT_IN_MEMCMP];
4588 t = build_call_expr_loc (loc, t, 3, dest, src, arg);
4590 = build2 (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), t, integer_zero_node);
4595 /* Gimplify a comparison between two aggregate objects of integral scalar
4596 mode as a comparison between the bitwise equivalent scalar values. */
4598 static enum gimplify_status
4599 gimplify_scalar_mode_aggregate_compare (tree *expr_p)
4601 location_t loc = EXPR_LOCATION (*expr_p);
4602 tree op0 = TREE_OPERAND (*expr_p, 0);
4603 tree op1 = TREE_OPERAND (*expr_p, 1);
4605 tree type = TREE_TYPE (op0);
4606 tree scalar_type = lang_hooks.types.type_for_mode (TYPE_MODE (type), 1);
4608 op0 = fold_build1_loc (loc, VIEW_CONVERT_EXPR, scalar_type, op0);
4609 op1 = fold_build1_loc (loc, VIEW_CONVERT_EXPR, scalar_type, op1);
4612 = fold_build2_loc (loc, TREE_CODE (*expr_p), TREE_TYPE (*expr_p), op0, op1);
4617 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
4618 points to the expression to gimplify.
4620 Expressions of the form 'a && b' are gimplified to:
4622 a && b ? true : false
4624 LOCUS is the source location to be put on the generated COND_EXPR.
4625 gimplify_cond_expr will do the rest. */
4627 static enum gimplify_status
4628 gimplify_boolean_expr (tree *expr_p, location_t locus)
4630 /* Preserve the original type of the expression. */
4631 tree type = TREE_TYPE (*expr_p);
4633 *expr_p = build3 (COND_EXPR, type, *expr_p,
4634 fold_convert_loc (locus, type, boolean_true_node),
4635 fold_convert_loc (locus, type, boolean_false_node));
4637 SET_EXPR_LOCATION (*expr_p, locus);
4642 /* Gimplifies an expression sequence. This function gimplifies each
4643 expression and re-writes the original expression with the last
4644 expression of the sequence in GIMPLE form.
4646 PRE_P points to the list where the side effects for all the
4647 expressions in the sequence will be emitted.
4649 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
4651 static enum gimplify_status
4652 gimplify_compound_expr (tree *expr_p, gimple_seq *pre_p, bool want_value)
4658 tree *sub_p = &TREE_OPERAND (t, 0);
4660 if (TREE_CODE (*sub_p) == COMPOUND_EXPR)
4661 gimplify_compound_expr (sub_p, pre_p, false);
4663 gimplify_stmt (sub_p, pre_p);
4665 t = TREE_OPERAND (t, 1);
4667 while (TREE_CODE (t) == COMPOUND_EXPR);
4674 gimplify_stmt (expr_p, pre_p);
4680 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
4681 gimplify. After gimplification, EXPR_P will point to a new temporary
4682 that holds the original value of the SAVE_EXPR node.
4684 PRE_P points to the list where side effects that must happen before
4685 *EXPR_P should be stored. */
4687 static enum gimplify_status
4688 gimplify_save_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4690 enum gimplify_status ret = GS_ALL_DONE;
4693 gcc_assert (TREE_CODE (*expr_p) == SAVE_EXPR);
4694 val = TREE_OPERAND (*expr_p, 0);
4696 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
4697 if (!SAVE_EXPR_RESOLVED_P (*expr_p))
4699 /* The operand may be a void-valued expression such as SAVE_EXPRs
4700 generated by the Java frontend for class initialization. It is
4701 being executed only for its side-effects. */
4702 if (TREE_TYPE (val) == void_type_node)
4704 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
4705 is_gimple_stmt, fb_none);
4709 val = get_initialized_tmp_var (val, pre_p, post_p);
4711 TREE_OPERAND (*expr_p, 0) = val;
4712 SAVE_EXPR_RESOLVED_P (*expr_p) = 1;
4720 /* Re-write the ADDR_EXPR node pointed to by EXPR_P
4727 PRE_P points to the list where side effects that must happen before
4728 *EXPR_P should be stored.
4730 POST_P points to the list where side effects that must happen after
4731 *EXPR_P should be stored. */
4733 static enum gimplify_status
4734 gimplify_addr_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4736 tree expr = *expr_p;
4737 tree op0 = TREE_OPERAND (expr, 0);
4738 enum gimplify_status ret;
4739 location_t loc = EXPR_LOCATION (*expr_p);
4741 switch (TREE_CODE (op0))
4744 case MISALIGNED_INDIRECT_REF:
4746 /* Check if we are dealing with an expression of the form '&*ptr'.
4747 While the front end folds away '&*ptr' into 'ptr', these
4748 expressions may be generated internally by the compiler (e.g.,
4749 builtins like __builtin_va_end). */
4750 /* Caution: the silent array decomposition semantics we allow for
4751 ADDR_EXPR means we can't always discard the pair. */
4752 /* Gimplification of the ADDR_EXPR operand may drop
4753 cv-qualification conversions, so make sure we add them if
4756 tree op00 = TREE_OPERAND (op0, 0);
4757 tree t_expr = TREE_TYPE (expr);
4758 tree t_op00 = TREE_TYPE (op00);
4760 if (!useless_type_conversion_p (t_expr, t_op00))
4761 op00 = fold_convert_loc (loc, TREE_TYPE (expr), op00);
4767 case VIEW_CONVERT_EXPR:
4768 /* Take the address of our operand and then convert it to the type of
4771 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
4772 all clear. The impact of this transformation is even less clear. */
4774 /* If the operand is a useless conversion, look through it. Doing so
4775 guarantees that the ADDR_EXPR and its operand will remain of the
4777 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0, 0)))
4778 op0 = TREE_OPERAND (op0, 0);
4780 *expr_p = fold_convert_loc (loc, TREE_TYPE (expr),
4781 build_fold_addr_expr_loc (loc,
4782 TREE_OPERAND (op0, 0)));
4787 /* We use fb_either here because the C frontend sometimes takes
4788 the address of a call that returns a struct; see
4789 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
4790 the implied temporary explicit. */
4792 /* Make the operand addressable. */
4793 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, post_p,
4794 is_gimple_addressable, fb_either);
4795 if (ret == GS_ERROR)
4798 /* Then mark it. Beware that it may not be possible to do so directly
4799 if a temporary has been created by the gimplification. */
4800 prepare_gimple_addressable (&TREE_OPERAND (expr, 0), pre_p);
4802 op0 = TREE_OPERAND (expr, 0);
4804 /* For various reasons, the gimplification of the expression
4805 may have made a new INDIRECT_REF. */
4806 if (TREE_CODE (op0) == INDIRECT_REF)
4807 goto do_indirect_ref;
4809 mark_addressable (TREE_OPERAND (expr, 0));
4811 /* The FEs may end up building ADDR_EXPRs early on a decl with
4812 an incomplete type. Re-build ADDR_EXPRs in canonical form
4814 if (!types_compatible_p (TREE_TYPE (op0), TREE_TYPE (TREE_TYPE (expr))))
4815 *expr_p = build_fold_addr_expr (op0);
4817 /* Make sure TREE_CONSTANT and TREE_SIDE_EFFECTS are set properly. */
4818 recompute_tree_invariant_for_addr_expr (*expr_p);
4820 /* If we re-built the ADDR_EXPR add a conversion to the original type
4822 if (!useless_type_conversion_p (TREE_TYPE (expr), TREE_TYPE (*expr_p)))
4823 *expr_p = fold_convert (TREE_TYPE (expr), *expr_p);
4831 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
4832 value; output operands should be a gimple lvalue. */
4834 static enum gimplify_status
4835 gimplify_asm_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4839 const char **oconstraints;
4842 const char *constraint;
4843 bool allows_mem, allows_reg, is_inout;
4844 enum gimplify_status ret, tret;
4846 VEC(tree, gc) *inputs;
4847 VEC(tree, gc) *outputs;
4848 VEC(tree, gc) *clobbers;
4849 VEC(tree, gc) *labels;
4853 noutputs = list_length (ASM_OUTPUTS (expr));
4854 oconstraints = (const char **) alloca ((noutputs) * sizeof (const char *));
4856 inputs = outputs = clobbers = labels = NULL;
4859 link_next = NULL_TREE;
4860 for (i = 0, link = ASM_OUTPUTS (expr); link; ++i, link = link_next)
4863 size_t constraint_len;
4865 link_next = TREE_CHAIN (link);
4869 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4870 constraint_len = strlen (constraint);
4871 if (constraint_len == 0)
4874 ok = parse_output_constraint (&constraint, i, 0, 0,
4875 &allows_mem, &allows_reg, &is_inout);
4882 if (!allows_reg && allows_mem)
4883 mark_addressable (TREE_VALUE (link));
4885 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4886 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
4887 fb_lvalue | fb_mayfail);
4888 if (tret == GS_ERROR)
4890 error ("invalid lvalue in asm output %d", i);
4894 VEC_safe_push (tree, gc, outputs, link);
4895 TREE_CHAIN (link) = NULL_TREE;
4899 /* An input/output operand. To give the optimizers more
4900 flexibility, split it into separate input and output
4905 /* Turn the in/out constraint into an output constraint. */
4906 char *p = xstrdup (constraint);
4908 TREE_VALUE (TREE_PURPOSE (link)) = build_string (constraint_len, p);
4910 /* And add a matching input constraint. */
4913 sprintf (buf, "%d", i);
4915 /* If there are multiple alternatives in the constraint,
4916 handle each of them individually. Those that allow register
4917 will be replaced with operand number, the others will stay
4919 if (strchr (p, ',') != NULL)
4921 size_t len = 0, buflen = strlen (buf);
4922 char *beg, *end, *str, *dst;
4926 end = strchr (beg, ',');
4928 end = strchr (beg, '\0');
4929 if ((size_t) (end - beg) < buflen)
4932 len += end - beg + 1;
4939 str = (char *) alloca (len);
4940 for (beg = p + 1, dst = str;;)
4943 bool mem_p, reg_p, inout_p;
4945 end = strchr (beg, ',');
4950 parse_output_constraint (&tem, i, 0, 0,
4951 &mem_p, ®_p, &inout_p);
4956 memcpy (dst, buf, buflen);
4965 memcpy (dst, beg, len);
4974 input = build_string (dst - str, str);
4977 input = build_string (strlen (buf), buf);
4980 input = build_string (constraint_len - 1, constraint + 1);
4984 input = build_tree_list (build_tree_list (NULL_TREE, input),
4985 unshare_expr (TREE_VALUE (link)));
4986 ASM_INPUTS (expr) = chainon (ASM_INPUTS (expr), input);
4990 link_next = NULL_TREE;
4991 for (link = ASM_INPUTS (expr); link; ++i, link = link_next)
4993 link_next = TREE_CHAIN (link);
4994 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4995 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
4996 oconstraints, &allows_mem, &allows_reg);
4998 /* If we can't make copies, we can only accept memory. */
4999 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (link))))
5005 error ("impossible constraint in %<asm%>");
5006 error ("non-memory input %d must stay in memory", i);
5011 /* If the operand is a memory input, it should be an lvalue. */
5012 if (!allows_reg && allows_mem)
5014 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
5015 is_gimple_lvalue, fb_lvalue | fb_mayfail);
5016 mark_addressable (TREE_VALUE (link));
5017 if (tret == GS_ERROR)
5019 if (EXPR_HAS_LOCATION (TREE_VALUE (link)))
5020 input_location = EXPR_LOCATION (TREE_VALUE (link));
5021 error ("memory input %d is not directly addressable", i);
5027 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
5028 is_gimple_asm_val, fb_rvalue);
5029 if (tret == GS_ERROR)
5033 TREE_CHAIN (link) = NULL_TREE;
5034 VEC_safe_push (tree, gc, inputs, link);
5037 for (link = ASM_CLOBBERS (expr); link; ++i, link = TREE_CHAIN (link))
5038 VEC_safe_push (tree, gc, clobbers, link);
5040 for (link = ASM_LABELS (expr); link; ++i, link = TREE_CHAIN (link))
5041 VEC_safe_push (tree, gc, labels, link);
5043 /* Do not add ASMs with errors to the gimple IL stream. */
5044 if (ret != GS_ERROR)
5046 stmt = gimple_build_asm_vec (TREE_STRING_POINTER (ASM_STRING (expr)),
5047 inputs, outputs, clobbers, labels);
5049 gimple_asm_set_volatile (stmt, ASM_VOLATILE_P (expr));
5050 gimple_asm_set_input (stmt, ASM_INPUT_P (expr));
5052 gimplify_seq_add_stmt (pre_p, stmt);
5058 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
5059 GIMPLE_WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
5060 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
5061 return to this function.
5063 FIXME should we complexify the prequeue handling instead? Or use flags
5064 for all the cleanups and let the optimizer tighten them up? The current
5065 code seems pretty fragile; it will break on a cleanup within any
5066 non-conditional nesting. But any such nesting would be broken, anyway;
5067 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
5068 and continues out of it. We can do that at the RTL level, though, so
5069 having an optimizer to tighten up try/finally regions would be a Good
5072 static enum gimplify_status
5073 gimplify_cleanup_point_expr (tree *expr_p, gimple_seq *pre_p)
5075 gimple_stmt_iterator iter;
5076 gimple_seq body_sequence = NULL;
5078 tree temp = voidify_wrapper_expr (*expr_p, NULL);
5080 /* We only care about the number of conditions between the innermost
5081 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
5082 any cleanups collected outside the CLEANUP_POINT_EXPR. */
5083 int old_conds = gimplify_ctxp->conditions;
5084 gimple_seq old_cleanups = gimplify_ctxp->conditional_cleanups;
5085 gimplify_ctxp->conditions = 0;
5086 gimplify_ctxp->conditional_cleanups = NULL;
5088 gimplify_stmt (&TREE_OPERAND (*expr_p, 0), &body_sequence);
5090 gimplify_ctxp->conditions = old_conds;
5091 gimplify_ctxp->conditional_cleanups = old_cleanups;
5093 for (iter = gsi_start (body_sequence); !gsi_end_p (iter); )
5095 gimple wce = gsi_stmt (iter);
5097 if (gimple_code (wce) == GIMPLE_WITH_CLEANUP_EXPR)
5099 if (gsi_one_before_end_p (iter))
5101 /* Note that gsi_insert_seq_before and gsi_remove do not
5102 scan operands, unlike some other sequence mutators. */
5103 gsi_insert_seq_before_without_update (&iter,
5104 gimple_wce_cleanup (wce),
5106 gsi_remove (&iter, true);
5113 enum gimple_try_flags kind;
5115 if (gimple_wce_cleanup_eh_only (wce))
5116 kind = GIMPLE_TRY_CATCH;
5118 kind = GIMPLE_TRY_FINALLY;
5119 seq = gsi_split_seq_after (iter);
5121 gtry = gimple_build_try (seq, gimple_wce_cleanup (wce), kind);
5122 /* Do not use gsi_replace here, as it may scan operands.
5123 We want to do a simple structural modification only. */
5124 *gsi_stmt_ptr (&iter) = gtry;
5125 iter = gsi_start (seq);
5132 gimplify_seq_add_seq (pre_p, body_sequence);
5145 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
5146 is the cleanup action required. EH_ONLY is true if the cleanup should
5147 only be executed if an exception is thrown, not on normal exit. */
5150 gimple_push_cleanup (tree var, tree cleanup, bool eh_only, gimple_seq *pre_p)
5153 gimple_seq cleanup_stmts = NULL;
5155 /* Errors can result in improperly nested cleanups. Which results in
5156 confusion when trying to resolve the GIMPLE_WITH_CLEANUP_EXPR. */
5157 if (errorcount || sorrycount)
5160 if (gimple_conditional_context ())
5162 /* If we're in a conditional context, this is more complex. We only
5163 want to run the cleanup if we actually ran the initialization that
5164 necessitates it, but we want to run it after the end of the
5165 conditional context. So we wrap the try/finally around the
5166 condition and use a flag to determine whether or not to actually
5167 run the destructor. Thus
5171 becomes (approximately)
5175 if (test) { A::A(temp); flag = 1; val = f(temp); }
5178 if (flag) A::~A(temp);
5182 tree flag = create_tmp_var (boolean_type_node, "cleanup");
5183 gimple ffalse = gimple_build_assign (flag, boolean_false_node);
5184 gimple ftrue = gimple_build_assign (flag, boolean_true_node);
5186 cleanup = build3 (COND_EXPR, void_type_node, flag, cleanup, NULL);
5187 gimplify_stmt (&cleanup, &cleanup_stmts);
5188 wce = gimple_build_wce (cleanup_stmts);
5190 gimplify_seq_add_stmt (&gimplify_ctxp->conditional_cleanups, ffalse);
5191 gimplify_seq_add_stmt (&gimplify_ctxp->conditional_cleanups, wce);
5192 gimplify_seq_add_stmt (pre_p, ftrue);
5194 /* Because of this manipulation, and the EH edges that jump
5195 threading cannot redirect, the temporary (VAR) will appear
5196 to be used uninitialized. Don't warn. */
5197 TREE_NO_WARNING (var) = 1;
5201 gimplify_stmt (&cleanup, &cleanup_stmts);
5202 wce = gimple_build_wce (cleanup_stmts);
5203 gimple_wce_set_cleanup_eh_only (wce, eh_only);
5204 gimplify_seq_add_stmt (pre_p, wce);
5208 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
5210 static enum gimplify_status
5211 gimplify_target_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
5213 tree targ = *expr_p;
5214 tree temp = TARGET_EXPR_SLOT (targ);
5215 tree init = TARGET_EXPR_INITIAL (targ);
5216 enum gimplify_status ret;
5220 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
5221 to the temps list. Handle also variable length TARGET_EXPRs. */
5222 if (TREE_CODE (DECL_SIZE (temp)) != INTEGER_CST)
5224 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (temp)))
5225 gimplify_type_sizes (TREE_TYPE (temp), pre_p);
5226 gimplify_vla_decl (temp, pre_p);
5229 gimple_add_tmp_var (temp);
5231 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
5232 expression is supposed to initialize the slot. */
5233 if (VOID_TYPE_P (TREE_TYPE (init)))
5234 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
5237 tree init_expr = build2 (INIT_EXPR, void_type_node, temp, init);
5239 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
5241 ggc_free (init_expr);
5243 if (ret == GS_ERROR)
5245 /* PR c++/28266 Make sure this is expanded only once. */
5246 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
5250 gimplify_and_add (init, pre_p);
5252 /* If needed, push the cleanup for the temp. */
5253 if (TARGET_EXPR_CLEANUP (targ))
5254 gimple_push_cleanup (temp, TARGET_EXPR_CLEANUP (targ),
5255 CLEANUP_EH_ONLY (targ), pre_p);
5257 /* Only expand this once. */
5258 TREE_OPERAND (targ, 3) = init;
5259 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
5262 /* We should have expanded this before. */
5263 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp));
5269 /* Gimplification of expression trees. */
5271 /* Gimplify an expression which appears at statement context. The
5272 corresponding GIMPLE statements are added to *SEQ_P. If *SEQ_P is
5273 NULL, a new sequence is allocated.
5275 Return true if we actually added a statement to the queue. */
5278 gimplify_stmt (tree *stmt_p, gimple_seq *seq_p)
5280 gimple_seq_node last;
5283 *seq_p = gimple_seq_alloc ();
5285 last = gimple_seq_last (*seq_p);
5286 gimplify_expr (stmt_p, seq_p, NULL, is_gimple_stmt, fb_none);
5287 return last != gimple_seq_last (*seq_p);
5291 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
5292 to CTX. If entries already exist, force them to be some flavor of private.
5293 If there is no enclosing parallel, do nothing. */
5296 omp_firstprivatize_variable (struct gimplify_omp_ctx *ctx, tree decl)
5300 if (decl == NULL || !DECL_P (decl))
5305 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5308 if (n->value & GOVD_SHARED)
5309 n->value = GOVD_FIRSTPRIVATE | (n->value & GOVD_SEEN);
5313 else if (ctx->region_type != ORT_WORKSHARE)
5314 omp_add_variable (ctx, decl, GOVD_FIRSTPRIVATE);
5316 ctx = ctx->outer_context;
5321 /* Similarly for each of the type sizes of TYPE. */
5324 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx *ctx, tree type)
5326 if (type == NULL || type == error_mark_node)
5328 type = TYPE_MAIN_VARIANT (type);
5330 if (pointer_set_insert (ctx->privatized_types, type))
5333 switch (TREE_CODE (type))
5339 case FIXED_POINT_TYPE:
5340 omp_firstprivatize_variable (ctx, TYPE_MIN_VALUE (type));
5341 omp_firstprivatize_variable (ctx, TYPE_MAX_VALUE (type));
5345 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
5346 omp_firstprivatize_type_sizes (ctx, TYPE_DOMAIN (type));
5351 case QUAL_UNION_TYPE:
5354 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
5355 if (TREE_CODE (field) == FIELD_DECL)
5357 omp_firstprivatize_variable (ctx, DECL_FIELD_OFFSET (field));
5358 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (field));
5364 case REFERENCE_TYPE:
5365 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
5372 omp_firstprivatize_variable (ctx, TYPE_SIZE (type));
5373 omp_firstprivatize_variable (ctx, TYPE_SIZE_UNIT (type));
5374 lang_hooks.types.omp_firstprivatize_type_sizes (ctx, type);
5377 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
5380 omp_add_variable (struct gimplify_omp_ctx *ctx, tree decl, unsigned int flags)
5383 unsigned int nflags;
5386 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5389 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
5390 there are constructors involved somewhere. */
5391 if (TREE_ADDRESSABLE (TREE_TYPE (decl))
5392 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
5395 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5398 /* We shouldn't be re-adding the decl with the same data
5400 gcc_assert ((n->value & GOVD_DATA_SHARE_CLASS & flags) == 0);
5401 /* The only combination of data sharing classes we should see is
5402 FIRSTPRIVATE and LASTPRIVATE. */
5403 nflags = n->value | flags;
5404 gcc_assert ((nflags & GOVD_DATA_SHARE_CLASS)
5405 == (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE));
5410 /* When adding a variable-sized variable, we have to handle all sorts
5411 of additional bits of data: the pointer replacement variable, and
5412 the parameters of the type. */
5413 if (DECL_SIZE (decl) && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
5415 /* Add the pointer replacement variable as PRIVATE if the variable
5416 replacement is private, else FIRSTPRIVATE since we'll need the
5417 address of the original variable either for SHARED, or for the
5418 copy into or out of the context. */
5419 if (!(flags & GOVD_LOCAL))
5421 nflags = flags & GOVD_PRIVATE ? GOVD_PRIVATE : GOVD_FIRSTPRIVATE;
5422 nflags |= flags & GOVD_SEEN;
5423 t = DECL_VALUE_EXPR (decl);
5424 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
5425 t = TREE_OPERAND (t, 0);
5426 gcc_assert (DECL_P (t));
5427 omp_add_variable (ctx, t, nflags);
5430 /* Add all of the variable and type parameters (which should have
5431 been gimplified to a formal temporary) as FIRSTPRIVATE. */
5432 omp_firstprivatize_variable (ctx, DECL_SIZE_UNIT (decl));
5433 omp_firstprivatize_variable (ctx, DECL_SIZE (decl));
5434 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
5436 /* The variable-sized variable itself is never SHARED, only some form
5437 of PRIVATE. The sharing would take place via the pointer variable
5438 which we remapped above. */
5439 if (flags & GOVD_SHARED)
5440 flags = GOVD_PRIVATE | GOVD_DEBUG_PRIVATE
5441 | (flags & (GOVD_SEEN | GOVD_EXPLICIT));
5443 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
5444 alloca statement we generate for the variable, so make sure it
5445 is available. This isn't automatically needed for the SHARED
5446 case, since we won't be allocating local storage then.
5447 For local variables TYPE_SIZE_UNIT might not be gimplified yet,
5448 in this case omp_notice_variable will be called later
5449 on when it is gimplified. */
5450 else if (! (flags & GOVD_LOCAL))
5451 omp_notice_variable (ctx, TYPE_SIZE_UNIT (TREE_TYPE (decl)), true);
5453 else if (lang_hooks.decls.omp_privatize_by_reference (decl))
5455 gcc_assert ((flags & GOVD_LOCAL) == 0);
5456 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
5458 /* Similar to the direct variable sized case above, we'll need the
5459 size of references being privatized. */
5460 if ((flags & GOVD_SHARED) == 0)
5462 t = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl)));
5463 if (TREE_CODE (t) != INTEGER_CST)
5464 omp_notice_variable (ctx, t, true);
5468 splay_tree_insert (ctx->variables, (splay_tree_key)decl, flags);
5471 /* Record the fact that DECL was used within the OpenMP context CTX.
5472 IN_CODE is true when real code uses DECL, and false when we should
5473 merely emit default(none) errors. Return true if DECL is going to
5474 be remapped and thus DECL shouldn't be gimplified into its
5475 DECL_VALUE_EXPR (if any). */
5478 omp_notice_variable (struct gimplify_omp_ctx *ctx, tree decl, bool in_code)
5481 unsigned flags = in_code ? GOVD_SEEN : 0;
5482 bool ret = false, shared;
5484 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5487 /* Threadprivate variables are predetermined. */
5488 if (is_global_var (decl))
5490 if (DECL_THREAD_LOCAL_P (decl))
5493 if (DECL_HAS_VALUE_EXPR_P (decl))
5495 tree value = get_base_address (DECL_VALUE_EXPR (decl));
5497 if (value && DECL_P (value) && DECL_THREAD_LOCAL_P (value))
5502 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5505 enum omp_clause_default_kind default_kind, kind;
5506 struct gimplify_omp_ctx *octx;
5508 if (ctx->region_type == ORT_WORKSHARE)
5511 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
5512 remapped firstprivate instead of shared. To some extent this is
5513 addressed in omp_firstprivatize_type_sizes, but not effectively. */
5514 default_kind = ctx->default_kind;
5515 kind = lang_hooks.decls.omp_predetermined_sharing (decl);
5516 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
5517 default_kind = kind;
5519 switch (default_kind)
5521 case OMP_CLAUSE_DEFAULT_NONE:
5522 error ("%qE not specified in enclosing parallel",
5524 error_at (ctx->location, "enclosing parallel");
5526 case OMP_CLAUSE_DEFAULT_SHARED:
5527 flags |= GOVD_SHARED;
5529 case OMP_CLAUSE_DEFAULT_PRIVATE:
5530 flags |= GOVD_PRIVATE;
5532 case OMP_CLAUSE_DEFAULT_FIRSTPRIVATE:
5533 flags |= GOVD_FIRSTPRIVATE;
5535 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
5536 /* decl will be either GOVD_FIRSTPRIVATE or GOVD_SHARED. */
5537 gcc_assert (ctx->region_type == ORT_TASK);
5538 if (ctx->outer_context)
5539 omp_notice_variable (ctx->outer_context, decl, in_code);
5540 for (octx = ctx->outer_context; octx; octx = octx->outer_context)
5544 n2 = splay_tree_lookup (octx->variables, (splay_tree_key) decl);
5545 if (n2 && (n2->value & GOVD_DATA_SHARE_CLASS) != GOVD_SHARED)
5547 flags |= GOVD_FIRSTPRIVATE;
5550 if ((octx->region_type & ORT_PARALLEL) != 0)
5553 if (flags & GOVD_FIRSTPRIVATE)
5556 && (TREE_CODE (decl) == PARM_DECL
5557 || (!is_global_var (decl)
5558 && DECL_CONTEXT (decl) == current_function_decl)))
5560 flags |= GOVD_FIRSTPRIVATE;
5563 flags |= GOVD_SHARED;
5569 if ((flags & GOVD_PRIVATE)
5570 && lang_hooks.decls.omp_private_outer_ref (decl))
5571 flags |= GOVD_PRIVATE_OUTER_REF;
5573 omp_add_variable (ctx, decl, flags);
5575 shared = (flags & GOVD_SHARED) != 0;
5576 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
5580 if ((n->value & (GOVD_SEEN | GOVD_LOCAL)) == 0
5581 && (flags & (GOVD_SEEN | GOVD_LOCAL)) == GOVD_SEEN
5583 && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
5586 tree t = DECL_VALUE_EXPR (decl);
5587 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
5588 t = TREE_OPERAND (t, 0);
5589 gcc_assert (DECL_P (t));
5590 n2 = splay_tree_lookup (ctx->variables, (splay_tree_key) t);
5591 n2->value |= GOVD_SEEN;
5594 shared = ((flags | n->value) & GOVD_SHARED) != 0;
5595 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
5597 /* If nothing changed, there's nothing left to do. */
5598 if ((n->value & flags) == flags)
5604 /* If the variable is private in the current context, then we don't
5605 need to propagate anything to an outer context. */
5606 if ((flags & GOVD_PRIVATE) && !(flags & GOVD_PRIVATE_OUTER_REF))
5608 if (ctx->outer_context
5609 && omp_notice_variable (ctx->outer_context, decl, in_code))
5614 /* Verify that DECL is private within CTX. If there's specific information
5615 to the contrary in the innermost scope, generate an error. */
5618 omp_is_private (struct gimplify_omp_ctx *ctx, tree decl)
5622 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5625 if (n->value & GOVD_SHARED)
5627 if (ctx == gimplify_omp_ctxp)
5629 error ("iteration variable %qE should be private",
5631 n->value = GOVD_PRIVATE;
5637 else if ((n->value & GOVD_EXPLICIT) != 0
5638 && (ctx == gimplify_omp_ctxp
5639 || (ctx->region_type == ORT_COMBINED_PARALLEL
5640 && gimplify_omp_ctxp->outer_context == ctx)))
5642 if ((n->value & GOVD_FIRSTPRIVATE) != 0)
5643 error ("iteration variable %qE should not be firstprivate",
5645 else if ((n->value & GOVD_REDUCTION) != 0)
5646 error ("iteration variable %qE should not be reduction",
5649 return (ctx == gimplify_omp_ctxp
5650 || (ctx->region_type == ORT_COMBINED_PARALLEL
5651 && gimplify_omp_ctxp->outer_context == ctx));
5654 if (ctx->region_type != ORT_WORKSHARE)
5656 else if (ctx->outer_context)
5657 return omp_is_private (ctx->outer_context, decl);
5661 /* Return true if DECL is private within a parallel region
5662 that binds to the current construct's context or in parallel
5663 region's REDUCTION clause. */
5666 omp_check_private (struct gimplify_omp_ctx *ctx, tree decl)
5672 ctx = ctx->outer_context;
5674 return !(is_global_var (decl)
5675 /* References might be private, but might be shared too. */
5676 || lang_hooks.decls.omp_privatize_by_reference (decl));
5678 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5680 return (n->value & GOVD_SHARED) == 0;
5682 while (ctx->region_type == ORT_WORKSHARE);
5686 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
5687 and previous omp contexts. */
5690 gimplify_scan_omp_clauses (tree *list_p, gimple_seq *pre_p,
5691 enum omp_region_type region_type)
5693 struct gimplify_omp_ctx *ctx, *outer_ctx;
5694 struct gimplify_ctx gctx;
5697 ctx = new_omp_context (region_type);
5698 outer_ctx = ctx->outer_context;
5700 while ((c = *list_p) != NULL)
5702 bool remove = false;
5703 bool notice_outer = true;
5704 const char *check_non_private = NULL;
5708 switch (OMP_CLAUSE_CODE (c))
5710 case OMP_CLAUSE_PRIVATE:
5711 flags = GOVD_PRIVATE | GOVD_EXPLICIT;
5712 if (lang_hooks.decls.omp_private_outer_ref (OMP_CLAUSE_DECL (c)))
5714 flags |= GOVD_PRIVATE_OUTER_REF;
5715 OMP_CLAUSE_PRIVATE_OUTER_REF (c) = 1;
5718 notice_outer = false;
5720 case OMP_CLAUSE_SHARED:
5721 flags = GOVD_SHARED | GOVD_EXPLICIT;
5723 case OMP_CLAUSE_FIRSTPRIVATE:
5724 flags = GOVD_FIRSTPRIVATE | GOVD_EXPLICIT;
5725 check_non_private = "firstprivate";
5727 case OMP_CLAUSE_LASTPRIVATE:
5728 flags = GOVD_LASTPRIVATE | GOVD_SEEN | GOVD_EXPLICIT;
5729 check_non_private = "lastprivate";
5731 case OMP_CLAUSE_REDUCTION:
5732 flags = GOVD_REDUCTION | GOVD_SEEN | GOVD_EXPLICIT;
5733 check_non_private = "reduction";
5737 decl = OMP_CLAUSE_DECL (c);
5738 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5743 omp_add_variable (ctx, decl, flags);
5744 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION
5745 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c))
5747 omp_add_variable (ctx, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c),
5748 GOVD_LOCAL | GOVD_SEEN);
5749 gimplify_omp_ctxp = ctx;
5750 push_gimplify_context (&gctx);
5752 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c) = gimple_seq_alloc ();
5753 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c) = gimple_seq_alloc ();
5755 gimplify_and_add (OMP_CLAUSE_REDUCTION_INIT (c),
5756 &OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c));
5757 pop_gimplify_context
5758 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c)));
5759 push_gimplify_context (&gctx);
5760 gimplify_and_add (OMP_CLAUSE_REDUCTION_MERGE (c),
5761 &OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c));
5762 pop_gimplify_context
5763 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c)));
5764 OMP_CLAUSE_REDUCTION_INIT (c) = NULL_TREE;
5765 OMP_CLAUSE_REDUCTION_MERGE (c) = NULL_TREE;
5767 gimplify_omp_ctxp = outer_ctx;
5769 else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
5770 && OMP_CLAUSE_LASTPRIVATE_STMT (c))
5772 gimplify_omp_ctxp = ctx;
5773 push_gimplify_context (&gctx);
5774 if (TREE_CODE (OMP_CLAUSE_LASTPRIVATE_STMT (c)) != BIND_EXPR)
5776 tree bind = build3 (BIND_EXPR, void_type_node, NULL,
5778 TREE_SIDE_EFFECTS (bind) = 1;
5779 BIND_EXPR_BODY (bind) = OMP_CLAUSE_LASTPRIVATE_STMT (c);
5780 OMP_CLAUSE_LASTPRIVATE_STMT (c) = bind;
5782 gimplify_and_add (OMP_CLAUSE_LASTPRIVATE_STMT (c),
5783 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c));
5784 pop_gimplify_context
5785 (gimple_seq_first_stmt (OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c)));
5786 OMP_CLAUSE_LASTPRIVATE_STMT (c) = NULL_TREE;
5788 gimplify_omp_ctxp = outer_ctx;
5794 case OMP_CLAUSE_COPYIN:
5795 case OMP_CLAUSE_COPYPRIVATE:
5796 decl = OMP_CLAUSE_DECL (c);
5797 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5804 omp_notice_variable (outer_ctx, decl, true);
5805 if (check_non_private
5806 && region_type == ORT_WORKSHARE
5807 && omp_check_private (ctx, decl))
5809 error ("%s variable %qE is private in outer context",
5810 check_non_private, DECL_NAME (decl));
5816 OMP_CLAUSE_OPERAND (c, 0)
5817 = gimple_boolify (OMP_CLAUSE_OPERAND (c, 0));
5820 case OMP_CLAUSE_SCHEDULE:
5821 case OMP_CLAUSE_NUM_THREADS:
5822 if (gimplify_expr (&OMP_CLAUSE_OPERAND (c, 0), pre_p, NULL,
5823 is_gimple_val, fb_rvalue) == GS_ERROR)
5827 case OMP_CLAUSE_NOWAIT:
5828 case OMP_CLAUSE_ORDERED:
5829 case OMP_CLAUSE_UNTIED:
5830 case OMP_CLAUSE_COLLAPSE:
5833 case OMP_CLAUSE_DEFAULT:
5834 ctx->default_kind = OMP_CLAUSE_DEFAULT_KIND (c);
5842 *list_p = OMP_CLAUSE_CHAIN (c);
5844 list_p = &OMP_CLAUSE_CHAIN (c);
5847 gimplify_omp_ctxp = ctx;
5850 /* For all variables that were not actually used within the context,
5851 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
5854 gimplify_adjust_omp_clauses_1 (splay_tree_node n, void *data)
5856 tree *list_p = (tree *) data;
5857 tree decl = (tree) n->key;
5858 unsigned flags = n->value;
5859 enum omp_clause_code code;
5863 if (flags & (GOVD_EXPLICIT | GOVD_LOCAL))
5865 if ((flags & GOVD_SEEN) == 0)
5867 if (flags & GOVD_DEBUG_PRIVATE)
5869 gcc_assert ((flags & GOVD_DATA_SHARE_CLASS) == GOVD_PRIVATE);
5870 private_debug = true;
5874 = lang_hooks.decls.omp_private_debug_clause (decl,
5875 !!(flags & GOVD_SHARED));
5877 code = OMP_CLAUSE_PRIVATE;
5878 else if (flags & GOVD_SHARED)
5880 if (is_global_var (decl))
5882 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp->outer_context;
5886 = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5887 if (on && (on->value & (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE
5888 | GOVD_PRIVATE | GOVD_REDUCTION)) != 0)
5890 ctx = ctx->outer_context;
5895 code = OMP_CLAUSE_SHARED;
5897 else if (flags & GOVD_PRIVATE)
5898 code = OMP_CLAUSE_PRIVATE;
5899 else if (flags & GOVD_FIRSTPRIVATE)
5900 code = OMP_CLAUSE_FIRSTPRIVATE;
5904 clause = build_omp_clause (input_location, code);
5905 OMP_CLAUSE_DECL (clause) = decl;
5906 OMP_CLAUSE_CHAIN (clause) = *list_p;
5908 OMP_CLAUSE_PRIVATE_DEBUG (clause) = 1;
5909 else if (code == OMP_CLAUSE_PRIVATE && (flags & GOVD_PRIVATE_OUTER_REF))
5910 OMP_CLAUSE_PRIVATE_OUTER_REF (clause) = 1;
5912 lang_hooks.decls.omp_finish_clause (clause);
5918 gimplify_adjust_omp_clauses (tree *list_p)
5920 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
5923 while ((c = *list_p) != NULL)
5926 bool remove = false;
5928 switch (OMP_CLAUSE_CODE (c))
5930 case OMP_CLAUSE_PRIVATE:
5931 case OMP_CLAUSE_SHARED:
5932 case OMP_CLAUSE_FIRSTPRIVATE:
5933 decl = OMP_CLAUSE_DECL (c);
5934 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5935 remove = !(n->value & GOVD_SEEN);
5938 bool shared = OMP_CLAUSE_CODE (c) == OMP_CLAUSE_SHARED;
5939 if ((n->value & GOVD_DEBUG_PRIVATE)
5940 || lang_hooks.decls.omp_private_debug_clause (decl, shared))
5942 gcc_assert ((n->value & GOVD_DEBUG_PRIVATE) == 0
5943 || ((n->value & GOVD_DATA_SHARE_CLASS)
5945 OMP_CLAUSE_SET_CODE (c, OMP_CLAUSE_PRIVATE);
5946 OMP_CLAUSE_PRIVATE_DEBUG (c) = 1;
5951 case OMP_CLAUSE_LASTPRIVATE:
5952 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
5953 accurately reflect the presence of a FIRSTPRIVATE clause. */
5954 decl = OMP_CLAUSE_DECL (c);
5955 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5956 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)
5957 = (n->value & GOVD_FIRSTPRIVATE) != 0;
5960 case OMP_CLAUSE_REDUCTION:
5961 case OMP_CLAUSE_COPYIN:
5962 case OMP_CLAUSE_COPYPRIVATE:
5964 case OMP_CLAUSE_NUM_THREADS:
5965 case OMP_CLAUSE_SCHEDULE:
5966 case OMP_CLAUSE_NOWAIT:
5967 case OMP_CLAUSE_ORDERED:
5968 case OMP_CLAUSE_DEFAULT:
5969 case OMP_CLAUSE_UNTIED:
5970 case OMP_CLAUSE_COLLAPSE:
5978 *list_p = OMP_CLAUSE_CHAIN (c);
5980 list_p = &OMP_CLAUSE_CHAIN (c);
5983 /* Add in any implicit data sharing. */
5984 splay_tree_foreach (ctx->variables, gimplify_adjust_omp_clauses_1, list_p);
5986 gimplify_omp_ctxp = ctx->outer_context;
5987 delete_omp_context (ctx);
5990 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
5991 gimplification of the body, as well as scanning the body for used
5992 variables. We need to do this scan now, because variable-sized
5993 decls will be decomposed during gimplification. */
5996 gimplify_omp_parallel (tree *expr_p, gimple_seq *pre_p)
5998 tree expr = *expr_p;
6000 gimple_seq body = NULL;
6001 struct gimplify_ctx gctx;
6003 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr), pre_p,
6004 OMP_PARALLEL_COMBINED (expr)
6005 ? ORT_COMBINED_PARALLEL
6008 push_gimplify_context (&gctx);
6010 g = gimplify_and_return_first (OMP_PARALLEL_BODY (expr), &body);
6011 if (gimple_code (g) == GIMPLE_BIND)
6012 pop_gimplify_context (g);
6014 pop_gimplify_context (NULL);
6016 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr));
6018 g = gimple_build_omp_parallel (body,
6019 OMP_PARALLEL_CLAUSES (expr),
6020 NULL_TREE, NULL_TREE);
6021 if (OMP_PARALLEL_COMBINED (expr))
6022 gimple_omp_set_subcode (g, GF_OMP_PARALLEL_COMBINED);
6023 gimplify_seq_add_stmt (pre_p, g);
6024 *expr_p = NULL_TREE;
6027 /* Gimplify the contents of an OMP_TASK statement. This involves
6028 gimplification of the body, as well as scanning the body for used
6029 variables. We need to do this scan now, because variable-sized
6030 decls will be decomposed during gimplification. */
6033 gimplify_omp_task (tree *expr_p, gimple_seq *pre_p)
6035 tree expr = *expr_p;
6037 gimple_seq body = NULL;
6038 struct gimplify_ctx gctx;
6040 gimplify_scan_omp_clauses (&OMP_TASK_CLAUSES (expr), pre_p, ORT_TASK);
6042 push_gimplify_context (&gctx);
6044 g = gimplify_and_return_first (OMP_TASK_BODY (expr), &body);
6045 if (gimple_code (g) == GIMPLE_BIND)
6046 pop_gimplify_context (g);
6048 pop_gimplify_context (NULL);
6050 gimplify_adjust_omp_clauses (&OMP_TASK_CLAUSES (expr));
6052 g = gimple_build_omp_task (body,
6053 OMP_TASK_CLAUSES (expr),
6054 NULL_TREE, NULL_TREE,
6055 NULL_TREE, NULL_TREE, NULL_TREE);
6056 gimplify_seq_add_stmt (pre_p, g);
6057 *expr_p = NULL_TREE;
6060 /* Gimplify the gross structure of an OMP_FOR statement. */
6062 static enum gimplify_status
6063 gimplify_omp_for (tree *expr_p, gimple_seq *pre_p)
6065 tree for_stmt, decl, var, t;
6066 enum gimplify_status ret = GS_ALL_DONE;
6067 enum gimplify_status tret;
6069 gimple_seq for_body, for_pre_body;
6074 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt), pre_p,
6077 /* Handle OMP_FOR_INIT. */
6078 for_pre_body = NULL;
6079 gimplify_and_add (OMP_FOR_PRE_BODY (for_stmt), &for_pre_body);
6080 OMP_FOR_PRE_BODY (for_stmt) = NULL_TREE;
6082 for_body = gimple_seq_alloc ();
6083 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt))
6084 == TREE_VEC_LENGTH (OMP_FOR_COND (for_stmt)));
6085 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt))
6086 == TREE_VEC_LENGTH (OMP_FOR_INCR (for_stmt)));
6087 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)); i++)
6089 t = TREE_VEC_ELT (OMP_FOR_INIT (for_stmt), i);
6090 gcc_assert (TREE_CODE (t) == MODIFY_EXPR);
6091 decl = TREE_OPERAND (t, 0);
6092 gcc_assert (DECL_P (decl));
6093 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl))
6094 || POINTER_TYPE_P (TREE_TYPE (decl)));
6096 /* Make sure the iteration variable is private. */
6097 if (omp_is_private (gimplify_omp_ctxp, decl))
6098 omp_notice_variable (gimplify_omp_ctxp, decl, true);
6100 omp_add_variable (gimplify_omp_ctxp, decl, GOVD_PRIVATE | GOVD_SEEN);
6102 /* If DECL is not a gimple register, create a temporary variable to act
6103 as an iteration counter. This is valid, since DECL cannot be
6104 modified in the body of the loop. */
6105 if (!is_gimple_reg (decl))
6107 var = create_tmp_var (TREE_TYPE (decl), get_name (decl));
6108 TREE_OPERAND (t, 0) = var;
6110 gimplify_seq_add_stmt (&for_body, gimple_build_assign (decl, var));
6112 omp_add_variable (gimplify_omp_ctxp, var, GOVD_PRIVATE | GOVD_SEEN);
6117 tret = gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
6118 is_gimple_val, fb_rvalue);
6119 ret = MIN (ret, tret);
6120 if (ret == GS_ERROR)
6123 /* Handle OMP_FOR_COND. */
6124 t = TREE_VEC_ELT (OMP_FOR_COND (for_stmt), i);
6125 gcc_assert (COMPARISON_CLASS_P (t));
6126 gcc_assert (TREE_OPERAND (t, 0) == decl);
6128 tret = gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
6129 is_gimple_val, fb_rvalue);
6130 ret = MIN (ret, tret);
6132 /* Handle OMP_FOR_INCR. */
6133 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6134 switch (TREE_CODE (t))
6136 case PREINCREMENT_EXPR:
6137 case POSTINCREMENT_EXPR:
6138 t = build_int_cst (TREE_TYPE (decl), 1);
6139 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
6140 t = build2 (MODIFY_EXPR, TREE_TYPE (var), var, t);
6141 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i) = t;
6144 case PREDECREMENT_EXPR:
6145 case POSTDECREMENT_EXPR:
6146 t = build_int_cst (TREE_TYPE (decl), -1);
6147 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
6148 t = build2 (MODIFY_EXPR, TREE_TYPE (var), var, t);
6149 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i) = t;
6153 gcc_assert (TREE_OPERAND (t, 0) == decl);
6154 TREE_OPERAND (t, 0) = var;
6156 t = TREE_OPERAND (t, 1);
6157 switch (TREE_CODE (t))
6160 if (TREE_OPERAND (t, 1) == decl)
6162 TREE_OPERAND (t, 1) = TREE_OPERAND (t, 0);
6163 TREE_OPERAND (t, 0) = var;
6169 case POINTER_PLUS_EXPR:
6170 gcc_assert (TREE_OPERAND (t, 0) == decl);
6171 TREE_OPERAND (t, 0) = var;
6177 tret = gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
6178 is_gimple_val, fb_rvalue);
6179 ret = MIN (ret, tret);
6186 if (var != decl || TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)) > 1)
6189 for (c = OMP_FOR_CLAUSES (for_stmt); c ; c = OMP_CLAUSE_CHAIN (c))
6190 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
6191 && OMP_CLAUSE_DECL (c) == decl
6192 && OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c) == NULL)
6194 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6195 gcc_assert (TREE_CODE (t) == MODIFY_EXPR);
6196 gcc_assert (TREE_OPERAND (t, 0) == var);
6197 t = TREE_OPERAND (t, 1);
6198 gcc_assert (TREE_CODE (t) == PLUS_EXPR
6199 || TREE_CODE (t) == MINUS_EXPR
6200 || TREE_CODE (t) == POINTER_PLUS_EXPR);
6201 gcc_assert (TREE_OPERAND (t, 0) == var);
6202 t = build2 (TREE_CODE (t), TREE_TYPE (decl), decl,
6203 TREE_OPERAND (t, 1));
6204 gimplify_assign (decl, t,
6205 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c));
6210 gimplify_and_add (OMP_FOR_BODY (for_stmt), &for_body);
6212 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt));
6214 gfor = gimple_build_omp_for (for_body, OMP_FOR_CLAUSES (for_stmt),
6215 TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)),
6218 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)); i++)
6220 t = TREE_VEC_ELT (OMP_FOR_INIT (for_stmt), i);
6221 gimple_omp_for_set_index (gfor, i, TREE_OPERAND (t, 0));
6222 gimple_omp_for_set_initial (gfor, i, TREE_OPERAND (t, 1));
6223 t = TREE_VEC_ELT (OMP_FOR_COND (for_stmt), i);
6224 gimple_omp_for_set_cond (gfor, i, TREE_CODE (t));
6225 gimple_omp_for_set_final (gfor, i, TREE_OPERAND (t, 1));
6226 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6227 gimple_omp_for_set_incr (gfor, i, TREE_OPERAND (t, 1));
6230 gimplify_seq_add_stmt (pre_p, gfor);
6231 return ret == GS_ALL_DONE ? GS_ALL_DONE : GS_ERROR;
6234 /* Gimplify the gross structure of other OpenMP worksharing constructs.
6235 In particular, OMP_SECTIONS and OMP_SINGLE. */
6238 gimplify_omp_workshare (tree *expr_p, gimple_seq *pre_p)
6240 tree expr = *expr_p;
6242 gimple_seq body = NULL;
6244 gimplify_scan_omp_clauses (&OMP_CLAUSES (expr), pre_p, ORT_WORKSHARE);
6245 gimplify_and_add (OMP_BODY (expr), &body);
6246 gimplify_adjust_omp_clauses (&OMP_CLAUSES (expr));
6248 if (TREE_CODE (expr) == OMP_SECTIONS)
6249 stmt = gimple_build_omp_sections (body, OMP_CLAUSES (expr));
6250 else if (TREE_CODE (expr) == OMP_SINGLE)
6251 stmt = gimple_build_omp_single (body, OMP_CLAUSES (expr));
6255 gimplify_seq_add_stmt (pre_p, stmt);
6258 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
6259 stabilized the lhs of the atomic operation as *ADDR. Return true if
6260 EXPR is this stabilized form. */
6263 goa_lhs_expr_p (tree expr, tree addr)
6265 /* Also include casts to other type variants. The C front end is fond
6266 of adding these for e.g. volatile variables. This is like
6267 STRIP_TYPE_NOPS but includes the main variant lookup. */
6268 STRIP_USELESS_TYPE_CONVERSION (expr);
6270 if (TREE_CODE (expr) == INDIRECT_REF)
6272 expr = TREE_OPERAND (expr, 0);
6274 && (CONVERT_EXPR_P (expr)
6275 || TREE_CODE (expr) == NON_LVALUE_EXPR)
6276 && TREE_CODE (expr) == TREE_CODE (addr)
6277 && types_compatible_p (TREE_TYPE (expr), TREE_TYPE (addr)))
6279 expr = TREE_OPERAND (expr, 0);
6280 addr = TREE_OPERAND (addr, 0);
6284 return (TREE_CODE (addr) == ADDR_EXPR
6285 && TREE_CODE (expr) == ADDR_EXPR
6286 && TREE_OPERAND (addr, 0) == TREE_OPERAND (expr, 0));
6288 if (TREE_CODE (addr) == ADDR_EXPR && expr == TREE_OPERAND (addr, 0))
6293 /* Walk *EXPR_P and replace
6294 appearances of *LHS_ADDR with LHS_VAR. If an expression does not involve
6295 the lhs, evaluate it into a temporary. Return 1 if the lhs appeared as
6296 a subexpression, 0 if it did not, or -1 if an error was encountered. */
6299 goa_stabilize_expr (tree *expr_p, gimple_seq *pre_p, tree lhs_addr,
6302 tree expr = *expr_p;
6305 if (goa_lhs_expr_p (expr, lhs_addr))
6310 if (is_gimple_val (expr))
6314 switch (TREE_CODE_CLASS (TREE_CODE (expr)))
6317 case tcc_comparison:
6318 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p, lhs_addr,
6321 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p, lhs_addr,
6324 case tcc_expression:
6325 switch (TREE_CODE (expr))
6327 case TRUTH_ANDIF_EXPR:
6328 case TRUTH_ORIF_EXPR:
6329 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p,
6331 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p,
6344 enum gimplify_status gs;
6345 gs = gimplify_expr (expr_p, pre_p, NULL, is_gimple_val, fb_rvalue);
6346 if (gs != GS_ALL_DONE)
6354 /* Gimplify an OMP_ATOMIC statement. */
6356 static enum gimplify_status
6357 gimplify_omp_atomic (tree *expr_p, gimple_seq *pre_p)
6359 tree addr = TREE_OPERAND (*expr_p, 0);
6360 tree rhs = TREE_OPERAND (*expr_p, 1);
6361 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr)));
6364 tmp_load = create_tmp_reg (type, NULL);
6365 if (goa_stabilize_expr (&rhs, pre_p, addr, tmp_load) < 0)
6368 if (gimplify_expr (&addr, pre_p, NULL, is_gimple_val, fb_rvalue)
6372 gimplify_seq_add_stmt (pre_p, gimple_build_omp_atomic_load (tmp_load, addr));
6373 if (gimplify_expr (&rhs, pre_p, NULL, is_gimple_val, fb_rvalue)
6376 gimplify_seq_add_stmt (pre_p, gimple_build_omp_atomic_store (rhs));
6383 /* Converts the GENERIC expression tree *EXPR_P to GIMPLE. If the
6384 expression produces a value to be used as an operand inside a GIMPLE
6385 statement, the value will be stored back in *EXPR_P. This value will
6386 be a tree of class tcc_declaration, tcc_constant, tcc_reference or
6387 an SSA_NAME. The corresponding sequence of GIMPLE statements is
6388 emitted in PRE_P and POST_P.
6390 Additionally, this process may overwrite parts of the input
6391 expression during gimplification. Ideally, it should be
6392 possible to do non-destructive gimplification.
6394 EXPR_P points to the GENERIC expression to convert to GIMPLE. If
6395 the expression needs to evaluate to a value to be used as
6396 an operand in a GIMPLE statement, this value will be stored in
6397 *EXPR_P on exit. This happens when the caller specifies one
6398 of fb_lvalue or fb_rvalue fallback flags.
6400 PRE_P will contain the sequence of GIMPLE statements corresponding
6401 to the evaluation of EXPR and all the side-effects that must
6402 be executed before the main expression. On exit, the last
6403 statement of PRE_P is the core statement being gimplified. For
6404 instance, when gimplifying 'if (++a)' the last statement in
6405 PRE_P will be 'if (t.1)' where t.1 is the result of
6406 pre-incrementing 'a'.
6408 POST_P will contain the sequence of GIMPLE statements corresponding
6409 to the evaluation of all the side-effects that must be executed
6410 after the main expression. If this is NULL, the post
6411 side-effects are stored at the end of PRE_P.
6413 The reason why the output is split in two is to handle post
6414 side-effects explicitly. In some cases, an expression may have
6415 inner and outer post side-effects which need to be emitted in
6416 an order different from the one given by the recursive
6417 traversal. For instance, for the expression (*p--)++ the post
6418 side-effects of '--' must actually occur *after* the post
6419 side-effects of '++'. However, gimplification will first visit
6420 the inner expression, so if a separate POST sequence was not
6421 used, the resulting sequence would be:
6428 However, the post-decrement operation in line #2 must not be
6429 evaluated until after the store to *p at line #4, so the
6430 correct sequence should be:
6437 So, by specifying a separate post queue, it is possible
6438 to emit the post side-effects in the correct order.
6439 If POST_P is NULL, an internal queue will be used. Before
6440 returning to the caller, the sequence POST_P is appended to
6441 the main output sequence PRE_P.
6443 GIMPLE_TEST_F points to a function that takes a tree T and
6444 returns nonzero if T is in the GIMPLE form requested by the
6445 caller. The GIMPLE predicates are in tree-gimple.c.
6447 FALLBACK tells the function what sort of a temporary we want if
6448 gimplification cannot produce an expression that complies with
6451 fb_none means that no temporary should be generated
6452 fb_rvalue means that an rvalue is OK to generate
6453 fb_lvalue means that an lvalue is OK to generate
6454 fb_either means that either is OK, but an lvalue is preferable.
6455 fb_mayfail means that gimplification may fail (in which case
6456 GS_ERROR will be returned)
6458 The return value is either GS_ERROR or GS_ALL_DONE, since this
6459 function iterates until EXPR is completely gimplified or an error
6462 enum gimplify_status
6463 gimplify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
6464 bool (*gimple_test_f) (tree), fallback_t fallback)
6467 gimple_seq internal_pre = NULL;
6468 gimple_seq internal_post = NULL;
6471 location_t saved_location;
6472 enum gimplify_status ret;
6473 gimple_stmt_iterator pre_last_gsi, post_last_gsi;
6475 save_expr = *expr_p;
6476 if (save_expr == NULL_TREE)
6479 /* If we are gimplifying a top-level statement, PRE_P must be valid. */
6480 is_statement = gimple_test_f == is_gimple_stmt;
6484 /* Consistency checks. */
6485 if (gimple_test_f == is_gimple_reg)
6486 gcc_assert (fallback & (fb_rvalue | fb_lvalue));
6487 else if (gimple_test_f == is_gimple_val
6488 || gimple_test_f == is_gimple_call_addr
6489 || gimple_test_f == is_gimple_condexpr
6490 || gimple_test_f == is_gimple_mem_rhs
6491 || gimple_test_f == is_gimple_mem_rhs_or_call
6492 || gimple_test_f == is_gimple_reg_rhs
6493 || gimple_test_f == is_gimple_reg_rhs_or_call
6494 || gimple_test_f == is_gimple_asm_val)
6495 gcc_assert (fallback & fb_rvalue);
6496 else if (gimple_test_f == is_gimple_min_lval
6497 || gimple_test_f == is_gimple_lvalue)
6498 gcc_assert (fallback & fb_lvalue);
6499 else if (gimple_test_f == is_gimple_addressable)
6500 gcc_assert (fallback & fb_either);
6501 else if (gimple_test_f == is_gimple_stmt)
6502 gcc_assert (fallback == fb_none);
6505 /* We should have recognized the GIMPLE_TEST_F predicate to
6506 know what kind of fallback to use in case a temporary is
6507 needed to hold the value or address of *EXPR_P. */
6511 /* We used to check the predicate here and return immediately if it
6512 succeeds. This is wrong; the design is for gimplification to be
6513 idempotent, and for the predicates to only test for valid forms, not
6514 whether they are fully simplified. */
6516 pre_p = &internal_pre;
6519 post_p = &internal_post;
6521 /* Remember the last statements added to PRE_P and POST_P. Every
6522 new statement added by the gimplification helpers needs to be
6523 annotated with location information. To centralize the
6524 responsibility, we remember the last statement that had been
6525 added to both queues before gimplifying *EXPR_P. If
6526 gimplification produces new statements in PRE_P and POST_P, those
6527 statements will be annotated with the same location information
6529 pre_last_gsi = gsi_last (*pre_p);
6530 post_last_gsi = gsi_last (*post_p);
6532 saved_location = input_location;
6533 if (save_expr != error_mark_node
6534 && EXPR_HAS_LOCATION (*expr_p))
6535 input_location = EXPR_LOCATION (*expr_p);
6537 /* Loop over the specific gimplifiers until the toplevel node
6538 remains the same. */
6541 /* Strip away as many useless type conversions as possible
6543 STRIP_USELESS_TYPE_CONVERSION (*expr_p);
6545 /* Remember the expr. */
6546 save_expr = *expr_p;
6548 /* Die, die, die, my darling. */
6549 if (save_expr == error_mark_node
6550 || (TREE_TYPE (save_expr)
6551 && TREE_TYPE (save_expr) == error_mark_node))
6557 /* Do any language-specific gimplification. */
6558 ret = ((enum gimplify_status)
6559 lang_hooks.gimplify_expr (expr_p, pre_p, post_p));
6562 if (*expr_p == NULL_TREE)
6564 if (*expr_p != save_expr)
6567 else if (ret != GS_UNHANDLED)
6571 switch (TREE_CODE (*expr_p))
6573 /* First deal with the special cases. */
6575 case POSTINCREMENT_EXPR:
6576 case POSTDECREMENT_EXPR:
6577 case PREINCREMENT_EXPR:
6578 case PREDECREMENT_EXPR:
6579 ret = gimplify_self_mod_expr (expr_p, pre_p, post_p,
6580 fallback != fb_none);
6584 case ARRAY_RANGE_REF:
6588 case VIEW_CONVERT_EXPR:
6589 ret = gimplify_compound_lval (expr_p, pre_p, post_p,
6590 fallback ? fallback : fb_rvalue);
6594 ret = gimplify_cond_expr (expr_p, pre_p, fallback);
6596 /* C99 code may assign to an array in a structure value of a
6597 conditional expression, and this has undefined behavior
6598 only on execution, so create a temporary if an lvalue is
6600 if (fallback == fb_lvalue)
6602 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6603 mark_addressable (*expr_p);
6608 ret = gimplify_call_expr (expr_p, pre_p, fallback != fb_none);
6610 /* C99 code may assign to an array in a structure returned
6611 from a function, and this has undefined behavior only on
6612 execution, so create a temporary if an lvalue is
6614 if (fallback == fb_lvalue)
6616 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6617 mark_addressable (*expr_p);
6625 ret = gimplify_compound_expr (expr_p, pre_p, fallback != fb_none);
6628 case COMPOUND_LITERAL_EXPR:
6629 ret = gimplify_compound_literal_expr (expr_p, pre_p);
6634 ret = gimplify_modify_expr (expr_p, pre_p, post_p,
6635 fallback != fb_none);
6636 /* Don't let the end of loop logic change GS_OK to GS_ALL_DONE;
6637 gimplify_modify_expr_rhs might have changed the RHS. */
6638 if (ret == GS_OK && *expr_p)
6642 case TRUTH_ANDIF_EXPR:
6643 case TRUTH_ORIF_EXPR:
6644 /* Pass the source location of the outer expression. */
6645 ret = gimplify_boolean_expr (expr_p, saved_location);
6648 case TRUTH_NOT_EXPR:
6649 if (TREE_CODE (TREE_TYPE (*expr_p)) != BOOLEAN_TYPE)
6651 tree type = TREE_TYPE (*expr_p);
6652 *expr_p = fold_convert (type, gimple_boolify (*expr_p));
6657 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6658 is_gimple_val, fb_rvalue);
6659 recalculate_side_effects (*expr_p);
6663 ret = gimplify_addr_expr (expr_p, pre_p, post_p);
6667 ret = gimplify_va_arg_expr (expr_p, pre_p, post_p);
6671 if (IS_EMPTY_STMT (*expr_p))
6677 if (VOID_TYPE_P (TREE_TYPE (*expr_p))
6678 || fallback == fb_none)
6680 /* Just strip a conversion to void (or in void context) and
6682 *expr_p = TREE_OPERAND (*expr_p, 0);
6686 ret = gimplify_conversion (expr_p);
6687 if (ret == GS_ERROR)
6689 if (*expr_p != save_expr)
6693 case FIX_TRUNC_EXPR:
6694 /* unary_expr: ... | '(' cast ')' val | ... */
6695 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6696 is_gimple_val, fb_rvalue);
6697 recalculate_side_effects (*expr_p);
6701 *expr_p = fold_indirect_ref_loc (input_location, *expr_p);
6702 if (*expr_p != save_expr)
6704 /* else fall through. */
6705 case ALIGN_INDIRECT_REF:
6706 case MISALIGNED_INDIRECT_REF:
6707 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6708 is_gimple_reg, fb_rvalue);
6709 recalculate_side_effects (*expr_p);
6712 /* Constants need not be gimplified. */
6723 /* If we require an lvalue, such as for ADDR_EXPR, retain the
6724 CONST_DECL node. Otherwise the decl is replaceable by its
6726 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
6727 if (fallback & fb_lvalue)
6730 *expr_p = DECL_INITIAL (*expr_p);
6734 ret = gimplify_decl_expr (expr_p, pre_p);
6738 ret = gimplify_bind_expr (expr_p, pre_p);
6742 ret = gimplify_loop_expr (expr_p, pre_p);
6746 ret = gimplify_switch_expr (expr_p, pre_p);
6750 ret = gimplify_exit_expr (expr_p);
6754 /* If the target is not LABEL, then it is a computed jump
6755 and the target needs to be gimplified. */
6756 if (TREE_CODE (GOTO_DESTINATION (*expr_p)) != LABEL_DECL)
6758 ret = gimplify_expr (&GOTO_DESTINATION (*expr_p), pre_p,
6759 NULL, is_gimple_val, fb_rvalue);
6760 if (ret == GS_ERROR)
6763 gimplify_seq_add_stmt (pre_p,
6764 gimple_build_goto (GOTO_DESTINATION (*expr_p)));
6768 gimplify_seq_add_stmt (pre_p,
6769 gimple_build_predict (PREDICT_EXPR_PREDICTOR (*expr_p),
6770 PREDICT_EXPR_OUTCOME (*expr_p)));
6776 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p))
6777 == current_function_decl);
6778 gimplify_seq_add_stmt (pre_p,
6779 gimple_build_label (LABEL_EXPR_LABEL (*expr_p)));
6782 case CASE_LABEL_EXPR:
6783 ret = gimplify_case_label_expr (expr_p, pre_p);
6787 ret = gimplify_return_expr (*expr_p, pre_p);
6791 /* Don't reduce this in place; let gimplify_init_constructor work its
6792 magic. Buf if we're just elaborating this for side effects, just
6793 gimplify any element that has side-effects. */
6794 if (fallback == fb_none)
6796 unsigned HOST_WIDE_INT ix;
6797 constructor_elt *ce;
6798 tree temp = NULL_TREE;
6800 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (*expr_p),
6803 if (TREE_SIDE_EFFECTS (ce->value))
6804 append_to_statement_list (ce->value, &temp);
6809 /* C99 code may assign to an array in a constructed
6810 structure or union, and this has undefined behavior only
6811 on execution, so create a temporary if an lvalue is
6813 else if (fallback == fb_lvalue)
6815 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6816 mark_addressable (*expr_p);
6822 /* The following are special cases that are not handled by the
6823 original GIMPLE grammar. */
6825 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
6828 ret = gimplify_save_expr (expr_p, pre_p, post_p);
6833 enum gimplify_status r0, r1, r2;
6835 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6836 post_p, is_gimple_lvalue, fb_either);
6837 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
6838 post_p, is_gimple_val, fb_rvalue);
6839 r2 = gimplify_expr (&TREE_OPERAND (*expr_p, 2), pre_p,
6840 post_p, is_gimple_val, fb_rvalue);
6841 recalculate_side_effects (*expr_p);
6843 ret = MIN (r0, MIN (r1, r2));
6847 case TARGET_MEM_REF:
6849 enum gimplify_status r0 = GS_ALL_DONE, r1 = GS_ALL_DONE;
6851 if (TMR_SYMBOL (*expr_p))
6852 r0 = gimplify_expr (&TMR_SYMBOL (*expr_p), pre_p,
6853 post_p, is_gimple_lvalue, fb_either);
6854 else if (TMR_BASE (*expr_p))
6855 r0 = gimplify_expr (&TMR_BASE (*expr_p), pre_p,
6856 post_p, is_gimple_val, fb_either);
6857 if (TMR_INDEX (*expr_p))
6858 r1 = gimplify_expr (&TMR_INDEX (*expr_p), pre_p,
6859 post_p, is_gimple_val, fb_rvalue);
6860 /* TMR_STEP and TMR_OFFSET are always integer constants. */
6865 case NON_LVALUE_EXPR:
6866 /* This should have been stripped above. */
6870 ret = gimplify_asm_expr (expr_p, pre_p, post_p);
6873 case TRY_FINALLY_EXPR:
6874 case TRY_CATCH_EXPR:
6876 gimple_seq eval, cleanup;
6879 eval = cleanup = NULL;
6880 gimplify_and_add (TREE_OPERAND (*expr_p, 0), &eval);
6881 gimplify_and_add (TREE_OPERAND (*expr_p, 1), &cleanup);
6882 /* Don't create bogus GIMPLE_TRY with empty cleanup. */
6883 if (gimple_seq_empty_p (cleanup))
6885 gimple_seq_add_seq (pre_p, eval);
6889 try_ = gimple_build_try (eval, cleanup,
6890 TREE_CODE (*expr_p) == TRY_FINALLY_EXPR
6891 ? GIMPLE_TRY_FINALLY
6892 : GIMPLE_TRY_CATCH);
6893 if (TREE_CODE (*expr_p) == TRY_CATCH_EXPR)
6894 gimple_try_set_catch_is_cleanup (try_,
6895 TRY_CATCH_IS_CLEANUP (*expr_p));
6896 gimplify_seq_add_stmt (pre_p, try_);
6901 case CLEANUP_POINT_EXPR:
6902 ret = gimplify_cleanup_point_expr (expr_p, pre_p);
6906 ret = gimplify_target_expr (expr_p, pre_p, post_p);
6912 gimple_seq handler = NULL;
6913 gimplify_and_add (CATCH_BODY (*expr_p), &handler);
6914 c = gimple_build_catch (CATCH_TYPES (*expr_p), handler);
6915 gimplify_seq_add_stmt (pre_p, c);
6920 case EH_FILTER_EXPR:
6923 gimple_seq failure = NULL;
6925 gimplify_and_add (EH_FILTER_FAILURE (*expr_p), &failure);
6926 ehf = gimple_build_eh_filter (EH_FILTER_TYPES (*expr_p), failure);
6927 gimple_set_no_warning (ehf, TREE_NO_WARNING (*expr_p));
6928 gimplify_seq_add_stmt (pre_p, ehf);
6935 enum gimplify_status r0, r1;
6936 r0 = gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p), pre_p,
6937 post_p, is_gimple_val, fb_rvalue);
6938 r1 = gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p), pre_p,
6939 post_p, is_gimple_val, fb_rvalue);
6940 TREE_SIDE_EFFECTS (*expr_p) = 0;
6946 /* We get here when taking the address of a label. We mark
6947 the label as "forced"; meaning it can never be removed and
6948 it is a potential target for any computed goto. */
6949 FORCED_LABEL (*expr_p) = 1;
6953 case STATEMENT_LIST:
6954 ret = gimplify_statement_list (expr_p, pre_p);
6957 case WITH_SIZE_EXPR:
6959 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6960 post_p == &internal_post ? NULL : post_p,
6961 gimple_test_f, fallback);
6962 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
6963 is_gimple_val, fb_rvalue);
6969 ret = gimplify_var_or_parm_decl (expr_p);
6973 /* When within an OpenMP context, notice uses of variables. */
6974 if (gimplify_omp_ctxp)
6975 omp_notice_variable (gimplify_omp_ctxp, *expr_p, true);
6980 /* Allow callbacks into the gimplifier during optimization. */
6985 gimplify_omp_parallel (expr_p, pre_p);
6990 gimplify_omp_task (expr_p, pre_p);
6995 ret = gimplify_omp_for (expr_p, pre_p);
7000 gimplify_omp_workshare (expr_p, pre_p);
7009 gimple_seq body = NULL;
7012 gimplify_and_add (OMP_BODY (*expr_p), &body);
7013 switch (TREE_CODE (*expr_p))
7016 g = gimple_build_omp_section (body);
7019 g = gimple_build_omp_master (body);
7022 g = gimple_build_omp_ordered (body);
7025 g = gimple_build_omp_critical (body,
7026 OMP_CRITICAL_NAME (*expr_p));
7031 gimplify_seq_add_stmt (pre_p, g);
7037 ret = gimplify_omp_atomic (expr_p, pre_p);
7040 case POINTER_PLUS_EXPR:
7041 /* Convert ((type *)A)+offset into &A->field_of_type_and_offset.
7042 The second is gimple immediate saving a need for extra statement.
7044 if (TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
7045 && (tmp = maybe_fold_offset_to_address
7046 (EXPR_LOCATION (*expr_p),
7047 TREE_OPERAND (*expr_p, 0), TREE_OPERAND (*expr_p, 1),
7048 TREE_TYPE (*expr_p))))
7053 /* Convert (void *)&a + 4 into (void *)&a[1]. */
7054 if (TREE_CODE (TREE_OPERAND (*expr_p, 0)) == NOP_EXPR
7055 && TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
7056 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p,
7058 && (tmp = maybe_fold_offset_to_address
7059 (EXPR_LOCATION (*expr_p),
7060 TREE_OPERAND (TREE_OPERAND (*expr_p, 0), 0),
7061 TREE_OPERAND (*expr_p, 1),
7062 TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p, 0),
7065 *expr_p = fold_convert (TREE_TYPE (*expr_p), tmp);
7071 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p)))
7073 case tcc_comparison:
7074 /* Handle comparison of objects of non scalar mode aggregates
7075 with a call to memcmp. It would be nice to only have to do
7076 this for variable-sized objects, but then we'd have to allow
7077 the same nest of reference nodes we allow for MODIFY_EXPR and
7080 Compare scalar mode aggregates as scalar mode values. Using
7081 memcmp for them would be very inefficient at best, and is
7082 plain wrong if bitfields are involved. */
7084 tree type = TREE_TYPE (TREE_OPERAND (*expr_p, 1));
7086 if (!AGGREGATE_TYPE_P (type))
7088 else if (TYPE_MODE (type) != BLKmode)
7089 ret = gimplify_scalar_mode_aggregate_compare (expr_p);
7091 ret = gimplify_variable_sized_compare (expr_p);
7096 /* If *EXPR_P does not need to be special-cased, handle it
7097 according to its class. */
7099 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7100 post_p, is_gimple_val, fb_rvalue);
7106 enum gimplify_status r0, r1;
7108 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7109 post_p, is_gimple_val, fb_rvalue);
7110 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
7111 post_p, is_gimple_val, fb_rvalue);
7117 case tcc_declaration:
7120 goto dont_recalculate;
7123 gcc_assert (TREE_CODE (*expr_p) == TRUTH_AND_EXPR
7124 || TREE_CODE (*expr_p) == TRUTH_OR_EXPR
7125 || TREE_CODE (*expr_p) == TRUTH_XOR_EXPR);
7129 recalculate_side_effects (*expr_p);
7135 /* If we replaced *expr_p, gimplify again. */
7136 if (ret == GS_OK && (*expr_p == NULL || *expr_p == save_expr))
7139 while (ret == GS_OK);
7141 /* If we encountered an error_mark somewhere nested inside, either
7142 stub out the statement or propagate the error back out. */
7143 if (ret == GS_ERROR)
7150 /* This was only valid as a return value from the langhook, which
7151 we handled. Make sure it doesn't escape from any other context. */
7152 gcc_assert (ret != GS_UNHANDLED);
7154 if (fallback == fb_none && *expr_p && !is_gimple_stmt (*expr_p))
7156 /* We aren't looking for a value, and we don't have a valid
7157 statement. If it doesn't have side-effects, throw it away. */
7158 if (!TREE_SIDE_EFFECTS (*expr_p))
7160 else if (!TREE_THIS_VOLATILE (*expr_p))
7162 /* This is probably a _REF that contains something nested that
7163 has side effects. Recurse through the operands to find it. */
7164 enum tree_code code = TREE_CODE (*expr_p);
7171 case VIEW_CONVERT_EXPR:
7172 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
7173 gimple_test_f, fallback);
7177 case ARRAY_RANGE_REF:
7178 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
7179 gimple_test_f, fallback);
7180 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
7181 gimple_test_f, fallback);
7185 /* Anything else with side-effects must be converted to
7186 a valid statement before we get here. */
7192 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p))
7193 && TYPE_MODE (TREE_TYPE (*expr_p)) != BLKmode)
7195 /* Historically, the compiler has treated a bare reference
7196 to a non-BLKmode volatile lvalue as forcing a load. */
7197 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p));
7199 /* Normally, we do not want to create a temporary for a
7200 TREE_ADDRESSABLE type because such a type should not be
7201 copied by bitwise-assignment. However, we make an
7202 exception here, as all we are doing here is ensuring that
7203 we read the bytes that make up the type. We use
7204 create_tmp_var_raw because create_tmp_var will abort when
7205 given a TREE_ADDRESSABLE type. */
7206 tree tmp = create_tmp_var_raw (type, "vol");
7207 gimple_add_tmp_var (tmp);
7208 gimplify_assign (tmp, *expr_p, pre_p);
7212 /* We can't do anything useful with a volatile reference to
7213 an incomplete type, so just throw it away. Likewise for
7214 a BLKmode type, since any implicit inner load should
7215 already have been turned into an explicit one by the
7216 gimplification process. */
7220 /* If we are gimplifying at the statement level, we're done. Tack
7221 everything together and return. */
7222 if (fallback == fb_none || is_statement)
7224 /* Since *EXPR_P has been converted into a GIMPLE tuple, clear
7225 it out for GC to reclaim it. */
7226 *expr_p = NULL_TREE;
7228 if (!gimple_seq_empty_p (internal_pre)
7229 || !gimple_seq_empty_p (internal_post))
7231 gimplify_seq_add_seq (&internal_pre, internal_post);
7232 gimplify_seq_add_seq (pre_p, internal_pre);
7235 /* The result of gimplifying *EXPR_P is going to be the last few
7236 statements in *PRE_P and *POST_P. Add location information
7237 to all the statements that were added by the gimplification
7239 if (!gimple_seq_empty_p (*pre_p))
7240 annotate_all_with_location_after (*pre_p, pre_last_gsi, input_location);
7242 if (!gimple_seq_empty_p (*post_p))
7243 annotate_all_with_location_after (*post_p, post_last_gsi,
7249 #ifdef ENABLE_GIMPLE_CHECKING
7252 enum tree_code code = TREE_CODE (*expr_p);
7253 /* These expressions should already be in gimple IR form. */
7254 gcc_assert (code != MODIFY_EXPR
7256 && code != BIND_EXPR
7257 && code != CATCH_EXPR
7258 && (code != COND_EXPR || gimplify_ctxp->allow_rhs_cond_expr)
7259 && code != EH_FILTER_EXPR
7260 && code != GOTO_EXPR
7261 && code != LABEL_EXPR
7262 && code != LOOP_EXPR
7263 && code != SWITCH_EXPR
7264 && code != TRY_FINALLY_EXPR
7265 && code != OMP_CRITICAL
7267 && code != OMP_MASTER
7268 && code != OMP_ORDERED
7269 && code != OMP_PARALLEL
7270 && code != OMP_SECTIONS
7271 && code != OMP_SECTION
7272 && code != OMP_SINGLE);
7276 /* Otherwise we're gimplifying a subexpression, so the resulting
7277 value is interesting. If it's a valid operand that matches
7278 GIMPLE_TEST_F, we're done. Unless we are handling some
7279 post-effects internally; if that's the case, we need to copy into
7280 a temporary before adding the post-effects to POST_P. */
7281 if (gimple_seq_empty_p (internal_post) && (*gimple_test_f) (*expr_p))
7284 /* Otherwise, we need to create a new temporary for the gimplified
7287 /* We can't return an lvalue if we have an internal postqueue. The
7288 object the lvalue refers to would (probably) be modified by the
7289 postqueue; we need to copy the value out first, which means an
7291 if ((fallback & fb_lvalue)
7292 && gimple_seq_empty_p (internal_post)
7293 && is_gimple_addressable (*expr_p))
7295 /* An lvalue will do. Take the address of the expression, store it
7296 in a temporary, and replace the expression with an INDIRECT_REF of
7298 tmp = build_fold_addr_expr_loc (input_location, *expr_p);
7299 gimplify_expr (&tmp, pre_p, post_p, is_gimple_reg, fb_rvalue);
7300 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (tmp)), tmp);
7302 else if ((fallback & fb_rvalue) && is_gimple_reg_rhs_or_call (*expr_p))
7304 /* An rvalue will do. Assign the gimplified expression into a
7305 new temporary TMP and replace the original expression with
7306 TMP. First, make sure that the expression has a type so that
7307 it can be assigned into a temporary. */
7308 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p)));
7310 if (!gimple_seq_empty_p (internal_post) || (fallback & fb_lvalue))
7311 /* The postqueue might change the value of the expression between
7312 the initialization and use of the temporary, so we can't use a
7313 formal temp. FIXME do we care? */
7315 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
7316 if (TREE_CODE (TREE_TYPE (*expr_p)) == COMPLEX_TYPE
7317 || TREE_CODE (TREE_TYPE (*expr_p)) == VECTOR_TYPE)
7318 DECL_GIMPLE_REG_P (*expr_p) = 1;
7321 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
7325 #ifdef ENABLE_GIMPLE_CHECKING
7326 if (!(fallback & fb_mayfail))
7328 fprintf (stderr, "gimplification failed:\n");
7329 print_generic_expr (stderr, *expr_p, 0);
7330 debug_tree (*expr_p);
7331 internal_error ("gimplification failed");
7334 gcc_assert (fallback & fb_mayfail);
7336 /* If this is an asm statement, and the user asked for the
7337 impossible, don't die. Fail and let gimplify_asm_expr
7343 /* Make sure the temporary matches our predicate. */
7344 gcc_assert ((*gimple_test_f) (*expr_p));
7346 if (!gimple_seq_empty_p (internal_post))
7348 annotate_all_with_location (internal_post, input_location);
7349 gimplify_seq_add_seq (pre_p, internal_post);
7353 input_location = saved_location;
7357 /* Look through TYPE for variable-sized objects and gimplify each such
7358 size that we find. Add to LIST_P any statements generated. */
7361 gimplify_type_sizes (tree type, gimple_seq *list_p)
7365 if (type == NULL || type == error_mark_node)
7368 /* We first do the main variant, then copy into any other variants. */
7369 type = TYPE_MAIN_VARIANT (type);
7371 /* Avoid infinite recursion. */
7372 if (TYPE_SIZES_GIMPLIFIED (type))
7375 TYPE_SIZES_GIMPLIFIED (type) = 1;
7377 switch (TREE_CODE (type))
7383 case FIXED_POINT_TYPE:
7384 gimplify_one_sizepos (&TYPE_MIN_VALUE (type), list_p);
7385 gimplify_one_sizepos (&TYPE_MAX_VALUE (type), list_p);
7387 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
7389 TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (type);
7390 TYPE_MAX_VALUE (t) = TYPE_MAX_VALUE (type);
7395 /* These types may not have declarations, so handle them here. */
7396 gimplify_type_sizes (TREE_TYPE (type), list_p);
7397 gimplify_type_sizes (TYPE_DOMAIN (type), list_p);
7398 /* Ensure VLA bounds aren't removed, for -O0 they should be variables
7399 with assigned stack slots, for -O1+ -g they should be tracked
7401 if (TYPE_DOMAIN (type)
7402 && INTEGRAL_TYPE_P (TYPE_DOMAIN (type)))
7404 t = TYPE_MIN_VALUE (TYPE_DOMAIN (type));
7405 if (t && TREE_CODE (t) == VAR_DECL && DECL_ARTIFICIAL (t))
7406 DECL_IGNORED_P (t) = 0;
7407 t = TYPE_MAX_VALUE (TYPE_DOMAIN (type));
7408 if (t && TREE_CODE (t) == VAR_DECL && DECL_ARTIFICIAL (t))
7409 DECL_IGNORED_P (t) = 0;
7415 case QUAL_UNION_TYPE:
7416 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
7417 if (TREE_CODE (field) == FIELD_DECL)
7419 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field), list_p);
7420 gimplify_one_sizepos (&DECL_SIZE (field), list_p);
7421 gimplify_one_sizepos (&DECL_SIZE_UNIT (field), list_p);
7422 gimplify_type_sizes (TREE_TYPE (field), list_p);
7427 case REFERENCE_TYPE:
7428 /* We used to recurse on the pointed-to type here, which turned out to
7429 be incorrect because its definition might refer to variables not
7430 yet initialized at this point if a forward declaration is involved.
7432 It was actually useful for anonymous pointed-to types to ensure
7433 that the sizes evaluation dominates every possible later use of the
7434 values. Restricting to such types here would be safe since there
7435 is no possible forward declaration around, but would introduce an
7436 undesirable middle-end semantic to anonymity. We then defer to
7437 front-ends the responsibility of ensuring that the sizes are
7438 evaluated both early and late enough, e.g. by attaching artificial
7439 type declarations to the tree. */
7446 gimplify_one_sizepos (&TYPE_SIZE (type), list_p);
7447 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type), list_p);
7449 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
7451 TYPE_SIZE (t) = TYPE_SIZE (type);
7452 TYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (type);
7453 TYPE_SIZES_GIMPLIFIED (t) = 1;
7457 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
7458 a size or position, has had all of its SAVE_EXPRs evaluated.
7459 We add any required statements to *STMT_P. */
7462 gimplify_one_sizepos (tree *expr_p, gimple_seq *stmt_p)
7464 tree type, expr = *expr_p;
7466 /* We don't do anything if the value isn't there, is constant, or contains
7467 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
7468 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
7469 will want to replace it with a new variable, but that will cause problems
7470 if this type is from outside the function. It's OK to have that here. */
7471 if (expr == NULL_TREE || TREE_CONSTANT (expr)
7472 || TREE_CODE (expr) == VAR_DECL
7473 || CONTAINS_PLACEHOLDER_P (expr))
7476 type = TREE_TYPE (expr);
7477 *expr_p = unshare_expr (expr);
7479 gimplify_expr (expr_p, stmt_p, NULL, is_gimple_val, fb_rvalue);
7482 /* Verify that we've an exact type match with the original expression.
7483 In particular, we do not wish to drop a "sizetype" in favour of a
7484 type of similar dimensions. We don't want to pollute the generic
7485 type-stripping code with this knowledge because it doesn't matter
7486 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
7487 and friends retain their "sizetype-ness". */
7488 if (TREE_TYPE (expr) != type
7489 && TREE_CODE (type) == INTEGER_TYPE
7490 && TYPE_IS_SIZETYPE (type))
7495 *expr_p = create_tmp_var (type, NULL);
7496 tmp = build1 (NOP_EXPR, type, expr);
7497 stmt = gimplify_assign (*expr_p, tmp, stmt_p);
7498 if (EXPR_HAS_LOCATION (expr))
7499 gimple_set_location (stmt, EXPR_LOCATION (expr));
7501 gimple_set_location (stmt, input_location);
7506 /* Gimplify the body of statements pointed to by BODY_P and return a
7507 GIMPLE_BIND containing the sequence of GIMPLE statements
7508 corresponding to BODY_P. FNDECL is the function decl containing
7512 gimplify_body (tree *body_p, tree fndecl, bool do_parms)
7514 location_t saved_location = input_location;
7515 gimple_seq parm_stmts, seq;
7517 struct gimplify_ctx gctx;
7519 timevar_push (TV_TREE_GIMPLIFY);
7521 /* Initialize for optimize_insn_for_s{ize,peed}_p possibly called during
7523 default_rtl_profile ();
7525 gcc_assert (gimplify_ctxp == NULL);
7526 push_gimplify_context (&gctx);
7528 /* Unshare most shared trees in the body and in that of any nested functions.
7529 It would seem we don't have to do this for nested functions because
7530 they are supposed to be output and then the outer function gimplified
7531 first, but the g++ front end doesn't always do it that way. */
7532 unshare_body (body_p, fndecl);
7533 unvisit_body (body_p, fndecl);
7535 if (cgraph_node (fndecl)->origin)
7536 nonlocal_vlas = pointer_set_create ();
7538 /* Make sure input_location isn't set to something weird. */
7539 input_location = DECL_SOURCE_LOCATION (fndecl);
7541 /* Resolve callee-copies. This has to be done before processing
7542 the body so that DECL_VALUE_EXPR gets processed correctly. */
7543 parm_stmts = (do_parms) ? gimplify_parameters () : NULL;
7545 /* Gimplify the function's body. */
7547 gimplify_stmt (body_p, &seq);
7548 outer_bind = gimple_seq_first_stmt (seq);
7551 outer_bind = gimple_build_nop ();
7552 gimplify_seq_add_stmt (&seq, outer_bind);
7555 /* The body must contain exactly one statement, a GIMPLE_BIND. If this is
7556 not the case, wrap everything in a GIMPLE_BIND to make it so. */
7557 if (gimple_code (outer_bind) == GIMPLE_BIND
7558 && gimple_seq_first (seq) == gimple_seq_last (seq))
7561 outer_bind = gimple_build_bind (NULL_TREE, seq, NULL);
7563 *body_p = NULL_TREE;
7565 /* If we had callee-copies statements, insert them at the beginning
7566 of the function and clear DECL_VALUE_EXPR_P on the parameters. */
7567 if (!gimple_seq_empty_p (parm_stmts))
7571 gimplify_seq_add_seq (&parm_stmts, gimple_bind_body (outer_bind));
7572 gimple_bind_set_body (outer_bind, parm_stmts);
7574 for (parm = DECL_ARGUMENTS (current_function_decl);
7575 parm; parm = TREE_CHAIN (parm))
7576 if (DECL_HAS_VALUE_EXPR_P (parm))
7578 DECL_HAS_VALUE_EXPR_P (parm) = 0;
7579 DECL_IGNORED_P (parm) = 0;
7585 pointer_set_destroy (nonlocal_vlas);
7586 nonlocal_vlas = NULL;
7589 pop_gimplify_context (outer_bind);
7590 gcc_assert (gimplify_ctxp == NULL);
7592 #ifdef ENABLE_TYPES_CHECKING
7593 if (!errorcount && !sorrycount)
7594 verify_types_in_gimple_seq (gimple_bind_body (outer_bind));
7597 timevar_pop (TV_TREE_GIMPLIFY);
7598 input_location = saved_location;
7603 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
7604 node for the function we want to gimplify.
7606 Returns the sequence of GIMPLE statements corresponding to the body
7610 gimplify_function_tree (tree fndecl)
7612 tree oldfn, parm, ret;
7616 gcc_assert (!gimple_body (fndecl));
7618 oldfn = current_function_decl;
7619 current_function_decl = fndecl;
7620 if (DECL_STRUCT_FUNCTION (fndecl))
7621 push_cfun (DECL_STRUCT_FUNCTION (fndecl));
7623 push_struct_function (fndecl);
7625 for (parm = DECL_ARGUMENTS (fndecl); parm ; parm = TREE_CHAIN (parm))
7627 /* Preliminarily mark non-addressed complex variables as eligible
7628 for promotion to gimple registers. We'll transform their uses
7630 if ((TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
7631 || TREE_CODE (TREE_TYPE (parm)) == VECTOR_TYPE)
7632 && !TREE_THIS_VOLATILE (parm)
7633 && !needs_to_live_in_memory (parm))
7634 DECL_GIMPLE_REG_P (parm) = 1;
7637 ret = DECL_RESULT (fndecl);
7638 if ((TREE_CODE (TREE_TYPE (ret)) == COMPLEX_TYPE
7639 || TREE_CODE (TREE_TYPE (ret)) == VECTOR_TYPE)
7640 && !needs_to_live_in_memory (ret))
7641 DECL_GIMPLE_REG_P (ret) = 1;
7643 bind = gimplify_body (&DECL_SAVED_TREE (fndecl), fndecl, true);
7645 /* The tree body of the function is no longer needed, replace it
7646 with the new GIMPLE body. */
7647 seq = gimple_seq_alloc ();
7648 gimple_seq_add_stmt (&seq, bind);
7649 gimple_set_body (fndecl, seq);
7651 /* If we're instrumenting function entry/exit, then prepend the call to
7652 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
7653 catch the exit hook. */
7654 /* ??? Add some way to ignore exceptions for this TFE. */
7655 if (flag_instrument_function_entry_exit
7656 && !DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl)
7657 && !flag_instrument_functions_exclude_p (fndecl))
7662 gimple_seq cleanup = NULL, body = NULL;
7664 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_EXIT];
7665 gimplify_seq_add_stmt (&cleanup, gimple_build_call (x, 0));
7666 tf = gimple_build_try (seq, cleanup, GIMPLE_TRY_FINALLY);
7668 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_ENTER];
7669 gimplify_seq_add_stmt (&body, gimple_build_call (x, 0));
7670 gimplify_seq_add_stmt (&body, tf);
7671 new_bind = gimple_build_bind (NULL, body, gimple_bind_block (bind));
7672 /* Clear the block for BIND, since it is no longer directly inside
7673 the function, but within a try block. */
7674 gimple_bind_set_block (bind, NULL);
7676 /* Replace the current function body with the body
7677 wrapped in the try/finally TF. */
7678 seq = gimple_seq_alloc ();
7679 gimple_seq_add_stmt (&seq, new_bind);
7680 gimple_set_body (fndecl, seq);
7683 DECL_SAVED_TREE (fndecl) = NULL_TREE;
7684 cfun->curr_properties = PROP_gimple_any;
7686 current_function_decl = oldfn;
7691 /* Some transformations like inlining may invalidate the GIMPLE form
7692 for operands. This function traverses all the operands in STMT and
7693 gimplifies anything that is not a valid gimple operand. Any new
7694 GIMPLE statements are inserted before *GSI_P. */
7697 gimple_regimplify_operands (gimple stmt, gimple_stmt_iterator *gsi_p)
7700 tree orig_lhs = NULL_TREE, lhs, t;
7701 gimple_seq pre = NULL;
7702 gimple post_stmt = NULL;
7703 struct gimplify_ctx gctx;
7705 push_gimplify_context (&gctx);
7706 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
7708 switch (gimple_code (stmt))
7711 gimplify_expr (gimple_cond_lhs_ptr (stmt), &pre, NULL,
7712 is_gimple_val, fb_rvalue);
7713 gimplify_expr (gimple_cond_rhs_ptr (stmt), &pre, NULL,
7714 is_gimple_val, fb_rvalue);
7717 gimplify_expr (gimple_switch_index_ptr (stmt), &pre, NULL,
7718 is_gimple_val, fb_rvalue);
7720 case GIMPLE_OMP_ATOMIC_LOAD:
7721 gimplify_expr (gimple_omp_atomic_load_rhs_ptr (stmt), &pre, NULL,
7722 is_gimple_val, fb_rvalue);
7726 size_t i, noutputs = gimple_asm_noutputs (stmt);
7727 const char *constraint, **oconstraints;
7728 bool allows_mem, allows_reg, is_inout;
7731 = (const char **) alloca ((noutputs) * sizeof (const char *));
7732 for (i = 0; i < noutputs; i++)
7734 tree op = gimple_asm_output_op (stmt, i);
7735 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
7736 oconstraints[i] = constraint;
7737 parse_output_constraint (&constraint, i, 0, 0, &allows_mem,
7738 &allows_reg, &is_inout);
7739 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
7740 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
7741 fb_lvalue | fb_mayfail);
7743 for (i = 0; i < gimple_asm_ninputs (stmt); i++)
7745 tree op = gimple_asm_input_op (stmt, i);
7746 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
7747 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
7748 oconstraints, &allows_mem, &allows_reg);
7749 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (op))) && allows_mem)
7751 if (!allows_reg && allows_mem)
7752 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
7753 is_gimple_lvalue, fb_lvalue | fb_mayfail);
7755 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
7756 is_gimple_asm_val, fb_rvalue);
7761 /* NOTE: We start gimplifying operands from last to first to
7762 make sure that side-effects on the RHS of calls, assignments
7763 and ASMs are executed before the LHS. The ordering is not
7764 important for other statements. */
7765 num_ops = gimple_num_ops (stmt);
7766 orig_lhs = gimple_get_lhs (stmt);
7767 for (i = num_ops; i > 0; i--)
7769 tree op = gimple_op (stmt, i - 1);
7770 if (op == NULL_TREE)
7772 if (i == 1 && (is_gimple_call (stmt) || is_gimple_assign (stmt)))
7773 gimplify_expr (&op, &pre, NULL, is_gimple_lvalue, fb_lvalue);
7775 && is_gimple_assign (stmt)
7777 && get_gimple_rhs_class (gimple_expr_code (stmt))
7778 == GIMPLE_SINGLE_RHS)
7779 gimplify_expr (&op, &pre, NULL,
7780 rhs_predicate_for (gimple_assign_lhs (stmt)),
7782 else if (i == 2 && is_gimple_call (stmt))
7784 if (TREE_CODE (op) == FUNCTION_DECL)
7786 gimplify_expr (&op, &pre, NULL, is_gimple_call_addr, fb_rvalue);
7789 gimplify_expr (&op, &pre, NULL, is_gimple_val, fb_rvalue);
7790 gimple_set_op (stmt, i - 1, op);
7793 lhs = gimple_get_lhs (stmt);
7794 /* If the LHS changed it in a way that requires a simple RHS,
7795 create temporary. */
7796 if (lhs && !is_gimple_reg (lhs))
7798 bool need_temp = false;
7800 if (is_gimple_assign (stmt)
7802 && get_gimple_rhs_class (gimple_expr_code (stmt))
7803 == GIMPLE_SINGLE_RHS)
7804 gimplify_expr (gimple_assign_rhs1_ptr (stmt), &pre, NULL,
7805 rhs_predicate_for (gimple_assign_lhs (stmt)),
7807 else if (is_gimple_reg (lhs))
7809 if (is_gimple_reg_type (TREE_TYPE (lhs)))
7811 if (is_gimple_call (stmt))
7813 i = gimple_call_flags (stmt);
7814 if ((i & ECF_LOOPING_CONST_OR_PURE)
7815 || !(i & (ECF_CONST | ECF_PURE)))
7818 if (stmt_can_throw_internal (stmt))
7824 if (is_gimple_reg_type (TREE_TYPE (lhs)))
7826 else if (TYPE_MODE (TREE_TYPE (lhs)) != BLKmode)
7828 if (is_gimple_call (stmt))
7830 tree fndecl = gimple_call_fndecl (stmt);
7832 if (!aggregate_value_p (TREE_TYPE (lhs), fndecl)
7833 && !(fndecl && DECL_RESULT (fndecl)
7834 && DECL_BY_REFERENCE (DECL_RESULT (fndecl))))
7843 tree temp = create_tmp_reg (TREE_TYPE (lhs), NULL);
7845 if (TREE_CODE (orig_lhs) == SSA_NAME)
7846 orig_lhs = SSA_NAME_VAR (orig_lhs);
7848 if (gimple_in_ssa_p (cfun))
7849 temp = make_ssa_name (temp, NULL);
7850 gimple_set_lhs (stmt, temp);
7851 post_stmt = gimple_build_assign (lhs, temp);
7852 if (TREE_CODE (lhs) == SSA_NAME)
7853 SSA_NAME_DEF_STMT (lhs) = post_stmt;
7859 if (gimple_referenced_vars (cfun))
7860 for (t = gimplify_ctxp->temps; t ; t = TREE_CHAIN (t))
7861 add_referenced_var (t);
7863 if (!gimple_seq_empty_p (pre))
7865 if (gimple_in_ssa_p (cfun))
7867 gimple_stmt_iterator i;
7869 for (i = gsi_start (pre); !gsi_end_p (i); gsi_next (&i))
7870 mark_symbols_for_renaming (gsi_stmt (i));
7872 gsi_insert_seq_before (gsi_p, pre, GSI_SAME_STMT);
7875 gsi_insert_after (gsi_p, post_stmt, GSI_NEW_STMT);
7877 pop_gimplify_context (NULL);
7881 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
7882 force the result to be either ssa_name or an invariant, otherwise
7883 just force it to be a rhs expression. If VAR is not NULL, make the
7884 base variable of the final destination be VAR if suitable. */
7887 force_gimple_operand (tree expr, gimple_seq *stmts, bool simple, tree var)
7890 enum gimplify_status ret;
7891 gimple_predicate gimple_test_f;
7892 struct gimplify_ctx gctx;
7896 if (is_gimple_val (expr))
7899 gimple_test_f = simple ? is_gimple_val : is_gimple_reg_rhs;
7901 push_gimplify_context (&gctx);
7902 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
7903 gimplify_ctxp->allow_rhs_cond_expr = true;
7906 expr = build2 (MODIFY_EXPR, TREE_TYPE (var), var, expr);
7908 if (TREE_CODE (expr) != MODIFY_EXPR
7909 && TREE_TYPE (expr) == void_type_node)
7911 gimplify_and_add (expr, stmts);
7916 ret = gimplify_expr (&expr, stmts, NULL, gimple_test_f, fb_rvalue);
7917 gcc_assert (ret != GS_ERROR);
7920 if (gimple_referenced_vars (cfun))
7921 for (t = gimplify_ctxp->temps; t ; t = TREE_CHAIN (t))
7922 add_referenced_var (t);
7924 pop_gimplify_context (NULL);
7929 /* Invokes force_gimple_operand for EXPR with parameters SIMPLE_P and VAR. If
7930 some statements are produced, emits them at GSI. If BEFORE is true.
7931 the statements are appended before GSI, otherwise they are appended after
7932 it. M specifies the way GSI moves after insertion (GSI_SAME_STMT or
7933 GSI_CONTINUE_LINKING are the usual values). */
7936 force_gimple_operand_gsi (gimple_stmt_iterator *gsi, tree expr,
7937 bool simple_p, tree var, bool before,
7938 enum gsi_iterator_update m)
7942 expr = force_gimple_operand (expr, &stmts, simple_p, var);
7944 if (!gimple_seq_empty_p (stmts))
7946 if (gimple_in_ssa_p (cfun))
7948 gimple_stmt_iterator i;
7950 for (i = gsi_start (stmts); !gsi_end_p (i); gsi_next (&i))
7951 mark_symbols_for_renaming (gsi_stmt (i));
7955 gsi_insert_seq_before (gsi, stmts, m);
7957 gsi_insert_seq_after (gsi, stmts, m);
7963 #include "gt-gimplify.h"