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
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"
32 #include "tree-iterator.h"
33 #include "tree-inline.h"
34 #include "diagnostic.h"
35 #include "langhooks.h"
36 #include "langhooks-def.h"
37 #include "tree-flow.h"
51 #include "pointer-set.h"
52 #include "splay-tree.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;
219 gcc_assert (c && (c->bind_expr_stack == NULL
220 || VEC_empty (gimple, c->bind_expr_stack)));
221 VEC_free (gimple, heap, c->bind_expr_stack);
222 gimplify_ctxp = c->prev_context;
224 for (t = c->temps; t ; t = TREE_CHAIN (t))
225 DECL_GIMPLE_FORMAL_TEMP_P (t) = 0;
228 declare_vars (c->temps, body, false);
230 record_vars (c->temps);
233 htab_delete (c->temp_htab);
237 gimple_push_bind_expr (gimple gimple_bind)
239 if (gimplify_ctxp->bind_expr_stack == NULL)
240 gimplify_ctxp->bind_expr_stack = VEC_alloc (gimple, heap, 8);
241 VEC_safe_push (gimple, heap, gimplify_ctxp->bind_expr_stack, gimple_bind);
245 gimple_pop_bind_expr (void)
247 VEC_pop (gimple, gimplify_ctxp->bind_expr_stack);
251 gimple_current_bind_expr (void)
253 return VEC_last (gimple, gimplify_ctxp->bind_expr_stack);
256 /* Return the stack GIMPLE_BINDs created during gimplification. */
259 gimple_bind_expr_stack (void)
261 return gimplify_ctxp->bind_expr_stack;
264 /* Returns true iff there is a COND_EXPR between us and the innermost
265 CLEANUP_POINT_EXPR. This info is used by gimple_push_cleanup. */
268 gimple_conditional_context (void)
270 return gimplify_ctxp->conditions > 0;
273 /* Note that we've entered a COND_EXPR. */
276 gimple_push_condition (void)
278 #ifdef ENABLE_GIMPLE_CHECKING
279 if (gimplify_ctxp->conditions == 0)
280 gcc_assert (gimple_seq_empty_p (gimplify_ctxp->conditional_cleanups));
282 ++(gimplify_ctxp->conditions);
285 /* Note that we've left a COND_EXPR. If we're back at unconditional scope
286 now, add any conditional cleanups we've seen to the prequeue. */
289 gimple_pop_condition (gimple_seq *pre_p)
291 int conds = --(gimplify_ctxp->conditions);
293 gcc_assert (conds >= 0);
296 gimplify_seq_add_seq (pre_p, gimplify_ctxp->conditional_cleanups);
297 gimplify_ctxp->conditional_cleanups = NULL;
301 /* A stable comparison routine for use with splay trees and DECLs. */
304 splay_tree_compare_decl_uid (splay_tree_key xa, splay_tree_key xb)
309 return DECL_UID (a) - DECL_UID (b);
312 /* Create a new omp construct that deals with variable remapping. */
314 static struct gimplify_omp_ctx *
315 new_omp_context (enum omp_region_type region_type)
317 struct gimplify_omp_ctx *c;
319 c = XCNEW (struct gimplify_omp_ctx);
320 c->outer_context = gimplify_omp_ctxp;
321 c->variables = splay_tree_new (splay_tree_compare_decl_uid, 0, 0);
322 c->privatized_types = pointer_set_create ();
323 c->location = input_location;
324 c->region_type = region_type;
325 if (region_type != ORT_TASK)
326 c->default_kind = OMP_CLAUSE_DEFAULT_SHARED;
328 c->default_kind = OMP_CLAUSE_DEFAULT_UNSPECIFIED;
333 /* Destroy an omp construct that deals with variable remapping. */
336 delete_omp_context (struct gimplify_omp_ctx *c)
338 splay_tree_delete (c->variables);
339 pointer_set_destroy (c->privatized_types);
343 static void omp_add_variable (struct gimplify_omp_ctx *, tree, unsigned int);
344 static bool omp_notice_variable (struct gimplify_omp_ctx *, tree, bool);
346 /* A subroutine of append_to_statement_list{,_force}. T is not NULL. */
349 append_to_statement_list_1 (tree t, tree *list_p)
352 tree_stmt_iterator i;
356 if (t && TREE_CODE (t) == STATEMENT_LIST)
361 *list_p = list = alloc_stmt_list ();
365 tsi_link_after (&i, t, TSI_CONTINUE_LINKING);
368 /* Add T to the end of the list container pointed to by LIST_P.
369 If T is an expression with no effects, it is ignored. */
372 append_to_statement_list (tree t, tree *list_p)
374 if (t && TREE_SIDE_EFFECTS (t))
375 append_to_statement_list_1 (t, list_p);
378 /* Similar, but the statement is always added, regardless of side effects. */
381 append_to_statement_list_force (tree t, tree *list_p)
384 append_to_statement_list_1 (t, list_p);
387 /* Both gimplify the statement T and append it to *SEQ_P. This function
388 behaves exactly as gimplify_stmt, but you don't have to pass T as a
392 gimplify_and_add (tree t, gimple_seq *seq_p)
394 gimplify_stmt (&t, seq_p);
397 /* Gimplify statement T into sequence *SEQ_P, and return the first
398 tuple in the sequence of generated tuples for this statement.
399 Return NULL if gimplifying T produced no tuples. */
402 gimplify_and_return_first (tree t, gimple_seq *seq_p)
404 gimple_stmt_iterator last = gsi_last (*seq_p);
406 gimplify_and_add (t, seq_p);
408 if (!gsi_end_p (last))
411 return gsi_stmt (last);
414 return gimple_seq_first_stmt (*seq_p);
417 /* Strip off a legitimate source ending from the input string NAME of
418 length LEN. Rather than having to know the names used by all of
419 our front ends, we strip off an ending of a period followed by
420 up to five characters. (Java uses ".class".) */
423 remove_suffix (char *name, int len)
427 for (i = 2; i < 8 && len > i; i++)
429 if (name[len - i] == '.')
431 name[len - i] = '\0';
437 /* Subroutine for find_single_pointer_decl. */
440 find_single_pointer_decl_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
443 tree *pdecl = (tree *) data;
445 /* We are only looking for pointers at the same level as the
446 original tree; we must not look through any indirections.
447 Returning anything other than NULL_TREE will cause the caller to
449 if (REFERENCE_CLASS_P (*tp))
452 if (DECL_P (*tp) && POINTER_TYPE_P (TREE_TYPE (*tp)))
456 /* We already found a pointer decl; return anything other
457 than NULL_TREE to unwind from walk_tree signalling that
458 we have a duplicate. */
467 /* Find the single DECL of pointer type in the tree T, used directly
468 rather than via an indirection, and return it. If there are zero
469 or more than one such DECLs, return NULL. */
472 find_single_pointer_decl (tree t)
474 tree decl = NULL_TREE;
476 if (walk_tree (&t, find_single_pointer_decl_1, &decl, NULL))
478 /* find_single_pointer_decl_1 returns a nonzero value, causing
479 walk_tree to return a nonzero value, to indicate that it
480 found more than one pointer DECL or that it found an
488 /* Create a new temporary name with PREFIX. Returns an identifier. */
490 static GTY(()) unsigned int tmp_var_id_num;
493 create_tmp_var_name (const char *prefix)
499 char *preftmp = ASTRDUP (prefix);
501 remove_suffix (preftmp, strlen (preftmp));
505 ASM_FORMAT_PRIVATE_NAME (tmp_name, prefix ? prefix : "T", tmp_var_id_num++);
506 return get_identifier (tmp_name);
510 /* Create a new temporary variable declaration of type TYPE.
511 Does NOT push it into the current binding. */
514 create_tmp_var_raw (tree type, const char *prefix)
519 /* Make the type of the variable writable. */
520 new_type = build_type_variant (type, 0, 0);
521 TYPE_ATTRIBUTES (new_type) = TYPE_ATTRIBUTES (type);
523 tmp_var = build_decl (VAR_DECL, prefix ? create_tmp_var_name (prefix) : NULL,
526 /* The variable was declared by the compiler. */
527 DECL_ARTIFICIAL (tmp_var) = 1;
528 /* And we don't want debug info for it. */
529 DECL_IGNORED_P (tmp_var) = 1;
531 /* Make the variable writable. */
532 TREE_READONLY (tmp_var) = 0;
534 DECL_EXTERNAL (tmp_var) = 0;
535 TREE_STATIC (tmp_var) = 0;
536 TREE_USED (tmp_var) = 1;
541 /* Create a new temporary variable declaration of type TYPE. DOES push the
542 variable into the current binding. Further, assume that this is called
543 only from gimplification or optimization, at which point the creation of
544 certain types are bugs. */
547 create_tmp_var (tree type, const char *prefix)
551 /* We don't allow types that are addressable (meaning we can't make copies),
552 or incomplete. We also used to reject every variable size objects here,
553 but now support those for which a constant upper bound can be obtained.
554 The processing for variable sizes is performed in gimple_add_tmp_var,
555 point at which it really matters and possibly reached via paths not going
556 through this function, e.g. after direct calls to create_tmp_var_raw. */
557 gcc_assert (!TREE_ADDRESSABLE (type) && COMPLETE_TYPE_P (type));
559 tmp_var = create_tmp_var_raw (type, prefix);
560 gimple_add_tmp_var (tmp_var);
564 /* Create a temporary with a name derived from VAL. Subroutine of
565 lookup_tmp_var; nobody else should call this function. */
568 create_tmp_from_val (tree val)
570 return create_tmp_var (TREE_TYPE (val), get_name (val));
573 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
574 an existing expression temporary. */
577 lookup_tmp_var (tree val, bool is_formal)
581 /* If not optimizing, never really reuse a temporary. local-alloc
582 won't allocate any variable that is used in more than one basic
583 block, which means it will go into memory, causing much extra
584 work in reload and final and poorer code generation, outweighing
585 the extra memory allocation here. */
586 if (!optimize || !is_formal || TREE_SIDE_EFFECTS (val))
587 ret = create_tmp_from_val (val);
594 if (gimplify_ctxp->temp_htab == NULL)
595 gimplify_ctxp->temp_htab
596 = htab_create (1000, gimple_tree_hash, gimple_tree_eq, free);
597 slot = htab_find_slot (gimplify_ctxp->temp_htab, (void *)&elt, INSERT);
600 elt_p = XNEW (elt_t);
602 elt_p->temp = ret = create_tmp_from_val (val);
603 *slot = (void *) elt_p;
607 elt_p = (elt_t *) *slot;
613 DECL_GIMPLE_FORMAL_TEMP_P (ret) = 1;
619 /* Return true if T is a CALL_EXPR or an expression that can be
620 assignmed to a temporary. Note that this predicate should only be
621 used during gimplification. See the rationale for this in
622 gimplify_modify_expr. */
625 is_gimple_formal_tmp_or_call_rhs (tree t)
627 return TREE_CODE (t) == CALL_EXPR || is_gimple_formal_tmp_rhs (t);
630 /* Returns true iff T is a valid RHS for an assignment to a renamed
631 user -- or front-end generated artificial -- variable. */
634 is_gimple_reg_or_call_rhs (tree t)
636 /* If the RHS of the MODIFY_EXPR may throw or make a nonlocal goto
637 and the LHS is a user variable, then we need to introduce a formal
638 temporary. This way the optimizers can determine that the user
639 variable is only modified if evaluation of the RHS does not throw.
641 Don't force a temp of a non-renamable type; the copy could be
642 arbitrarily expensive. Instead we will generate a VDEF for
645 if (is_gimple_reg_type (TREE_TYPE (t))
646 && ((TREE_CODE (t) == CALL_EXPR && TREE_SIDE_EFFECTS (t))
647 || tree_could_throw_p (t)))
650 return is_gimple_formal_tmp_or_call_rhs (t);
653 /* Return true if T is a valid memory RHS or a CALL_EXPR. Note that
654 this predicate should only be used during gimplification. See the
655 rationale for this in gimplify_modify_expr. */
658 is_gimple_mem_or_call_rhs (tree t)
660 /* If we're dealing with a renamable type, either source or dest must be
661 a renamed variable. */
662 if (is_gimple_reg_type (TREE_TYPE (t)))
663 return is_gimple_val (t);
665 return is_gimple_formal_tmp_or_call_rhs (t);
669 /* Returns a formal temporary variable initialized with VAL. PRE_P is as
670 in gimplify_expr. Only use this function if:
672 1) The value of the unfactored expression represented by VAL will not
673 change between the initialization and use of the temporary, and
674 2) The temporary will not be otherwise modified.
676 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
677 and #2 means it is inappropriate for && temps.
679 For other cases, use get_initialized_tmp_var instead. */
682 internal_get_tmp_var (tree val, gimple_seq *pre_p, gimple_seq *post_p,
687 /* Notice that we explicitly allow VAL to be a CALL_EXPR so that we
688 can create an INIT_EXPR and convert it into a GIMPLE_CALL below. */
689 gimplify_expr (&val, pre_p, post_p, is_gimple_formal_tmp_or_call_rhs,
692 t = lookup_tmp_var (val, is_formal);
696 tree u = find_single_pointer_decl (val);
698 if (u && TREE_CODE (u) == VAR_DECL && DECL_BASED_ON_RESTRICT_P (u))
699 u = DECL_GET_RESTRICT_BASE (u);
700 if (u && TYPE_RESTRICT (TREE_TYPE (u)))
702 if (DECL_BASED_ON_RESTRICT_P (t))
703 gcc_assert (u == DECL_GET_RESTRICT_BASE (t));
706 DECL_BASED_ON_RESTRICT_P (t) = 1;
707 SET_DECL_RESTRICT_BASE (t, u);
712 if (TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
713 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
714 DECL_GIMPLE_REG_P (t) = 1;
716 mod = build2 (INIT_EXPR, TREE_TYPE (t), t, unshare_expr (val));
718 if (EXPR_HAS_LOCATION (val))
719 SET_EXPR_LOCUS (mod, EXPR_LOCUS (val));
721 SET_EXPR_LOCATION (mod, input_location);
723 /* gimplify_modify_expr might want to reduce this further. */
724 gimplify_and_add (mod, pre_p);
727 /* If we're gimplifying into ssa, gimplify_modify_expr will have
728 given our temporary an SSA name. Find and return it. */
729 if (gimplify_ctxp->into_ssa)
731 gimple last = gimple_seq_last_stmt (*pre_p);
732 t = gimple_get_lhs (last);
738 /* Returns a formal temporary variable initialized with VAL. PRE_P
739 points to a sequence where side-effects needed to compute VAL should be
743 get_formal_tmp_var (tree val, gimple_seq *pre_p)
745 return internal_get_tmp_var (val, pre_p, NULL, true);
748 /* Returns a temporary variable initialized with VAL. PRE_P and POST_P
749 are as in gimplify_expr. */
752 get_initialized_tmp_var (tree val, gimple_seq *pre_p, gimple_seq *post_p)
754 return internal_get_tmp_var (val, pre_p, post_p, false);
757 /* Declares all the variables in VARS in SCOPE. If DEBUG_INFO is
758 true, generate debug info for them; otherwise don't. */
761 declare_vars (tree vars, gimple scope, bool debug_info)
768 gcc_assert (gimple_code (scope) == GIMPLE_BIND);
770 temps = nreverse (last);
772 block = gimple_bind_block (scope);
773 gcc_assert (!block || TREE_CODE (block) == BLOCK);
774 if (!block || !debug_info)
776 TREE_CHAIN (last) = gimple_bind_vars (scope);
777 gimple_bind_set_vars (scope, temps);
781 /* We need to attach the nodes both to the BIND_EXPR and to its
782 associated BLOCK for debugging purposes. The key point here
783 is that the BLOCK_VARS of the BIND_EXPR_BLOCK of a BIND_EXPR
784 is a subchain of the BIND_EXPR_VARS of the BIND_EXPR. */
785 if (BLOCK_VARS (block))
786 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), temps);
789 gimple_bind_set_vars (scope,
790 chainon (gimple_bind_vars (scope), temps));
791 BLOCK_VARS (block) = temps;
797 /* For VAR a VAR_DECL of variable size, try to find a constant upper bound
798 for the size and adjust DECL_SIZE/DECL_SIZE_UNIT accordingly. Abort if
799 no such upper bound can be obtained. */
802 force_constant_size (tree var)
804 /* The only attempt we make is by querying the maximum size of objects
805 of the variable's type. */
807 HOST_WIDE_INT max_size;
809 gcc_assert (TREE_CODE (var) == VAR_DECL);
811 max_size = max_int_size_in_bytes (TREE_TYPE (var));
813 gcc_assert (max_size >= 0);
816 = build_int_cst (TREE_TYPE (DECL_SIZE_UNIT (var)), max_size);
818 = build_int_cst (TREE_TYPE (DECL_SIZE (var)), max_size * BITS_PER_UNIT);
822 gimple_add_tmp_var (tree tmp)
824 gcc_assert (!TREE_CHAIN (tmp) && !DECL_SEEN_IN_BIND_EXPR_P (tmp));
826 /* Later processing assumes that the object size is constant, which might
827 not be true at this point. Force the use of a constant upper bound in
829 if (!host_integerp (DECL_SIZE_UNIT (tmp), 1))
830 force_constant_size (tmp);
832 DECL_CONTEXT (tmp) = current_function_decl;
833 DECL_SEEN_IN_BIND_EXPR_P (tmp) = 1;
837 TREE_CHAIN (tmp) = gimplify_ctxp->temps;
838 gimplify_ctxp->temps = tmp;
840 /* Mark temporaries local within the nearest enclosing parallel. */
841 if (gimplify_omp_ctxp)
843 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
844 while (ctx && ctx->region_type == ORT_WORKSHARE)
845 ctx = ctx->outer_context;
847 omp_add_variable (ctx, tmp, GOVD_LOCAL | GOVD_SEEN);
856 /* This case is for nested functions. We need to expose the locals
858 body_seq = gimple_body (current_function_decl);
859 declare_vars (tmp, gimple_seq_first_stmt (body_seq), false);
863 /* Determines whether to assign a location to the statement GS. */
866 should_carry_location_p (gimple gs)
868 /* Don't emit a line note for a label. We particularly don't want to
869 emit one for the break label, since it doesn't actually correspond
870 to the beginning of the loop/switch. */
871 if (gimple_code (gs) == GIMPLE_LABEL)
877 /* Same, but for a tree. */
880 tree_should_carry_location_p (const_tree stmt)
882 /* Don't emit a line note for a label. We particularly don't want to
883 emit one for the break label, since it doesn't actually correspond
884 to the beginning of the loop/switch. */
885 if (TREE_CODE (stmt) == LABEL_EXPR)
888 /* Do not annotate empty statements, since it confuses gcov. */
889 if (!TREE_SIDE_EFFECTS (stmt))
895 /* Return true if a location should not be emitted for this statement
896 by annotate_one_with_location. */
899 gimple_do_not_emit_location_p (gimple g)
901 return gimple_plf (g, GF_PLF_1);
904 /* Mark statement G so a location will not be emitted by
905 annotate_one_with_location. */
908 gimple_set_do_not_emit_location (gimple g)
910 /* The PLF flags are initialized to 0 when a new tuple is created,
911 so no need to initialize it anywhere. */
912 gimple_set_plf (g, GF_PLF_1, true);
915 /* Set the location for gimple statement GS to LOCUS. */
918 annotate_one_with_location (gimple gs, location_t location)
920 if (!gimple_has_location (gs)
921 && !gimple_do_not_emit_location_p (gs)
922 && should_carry_location_p (gs))
923 gimple_set_location (gs, location);
926 /* Same, but for tree T. */
929 tree_annotate_one_with_location (tree t, location_t location)
931 if (CAN_HAVE_LOCATION_P (t)
932 && ! EXPR_HAS_LOCATION (t) && tree_should_carry_location_p (t))
933 SET_EXPR_LOCATION (t, location);
937 /* Set LOCATION for all the statements after iterator GSI in sequence
938 SEQ. If GSI is pointing to the end of the sequence, start with the
939 first statement in SEQ. */
942 annotate_all_with_location_after (gimple_seq seq, gimple_stmt_iterator gsi,
946 gsi = gsi_start (seq);
950 for (; !gsi_end_p (gsi); gsi_next (&gsi))
951 annotate_one_with_location (gsi_stmt (gsi), location);
955 /* Set the location for all the statements in a sequence STMT_P to LOCUS. */
958 annotate_all_with_location (gimple_seq stmt_p, location_t location)
960 gimple_stmt_iterator i;
962 if (gimple_seq_empty_p (stmt_p))
965 for (i = gsi_start (stmt_p); !gsi_end_p (i); gsi_next (&i))
967 gimple gs = gsi_stmt (i);
968 annotate_one_with_location (gs, location);
972 /* Same, but for statement or statement list in *STMT_P. */
975 tree_annotate_all_with_location (tree *stmt_p, location_t location)
977 tree_stmt_iterator i;
982 for (i = tsi_start (*stmt_p); !tsi_end_p (i); tsi_next (&i))
984 tree t = tsi_stmt (i);
986 /* Assuming we've already been gimplified, we shouldn't
987 see nested chaining constructs anymore. */
988 gcc_assert (TREE_CODE (t) != STATEMENT_LIST
989 && TREE_CODE (t) != COMPOUND_EXPR);
991 tree_annotate_one_with_location (t, location);
996 /* Similar to copy_tree_r() but do not copy SAVE_EXPR or TARGET_EXPR nodes.
997 These nodes model computations that should only be done once. If we
998 were to unshare something like SAVE_EXPR(i++), the gimplification
999 process would create wrong code. */
1002 mostly_copy_tree_r (tree *tp, int *walk_subtrees, void *data)
1004 enum tree_code code = TREE_CODE (*tp);
1005 /* Don't unshare types, decls, constants and SAVE_EXPR nodes. */
1006 if (TREE_CODE_CLASS (code) == tcc_type
1007 || TREE_CODE_CLASS (code) == tcc_declaration
1008 || TREE_CODE_CLASS (code) == tcc_constant
1009 || code == SAVE_EXPR || code == TARGET_EXPR
1010 /* We can't do anything sensible with a BLOCK used as an expression,
1011 but we also can't just die when we see it because of non-expression
1012 uses. So just avert our eyes and cross our fingers. Silly Java. */
1017 gcc_assert (code != BIND_EXPR);
1018 copy_tree_r (tp, walk_subtrees, data);
1024 /* Callback for walk_tree to unshare most of the shared trees rooted at
1025 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
1026 then *TP is deep copied by calling copy_tree_r.
1028 This unshares the same trees as copy_tree_r with the exception of
1029 SAVE_EXPR nodes. These nodes model computations that should only be
1030 done once. If we were to unshare something like SAVE_EXPR(i++), the
1031 gimplification process would create wrong code. */
1034 copy_if_shared_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
1035 void *data ATTRIBUTE_UNUSED)
1038 enum tree_code code = TREE_CODE (t);
1040 /* Skip types, decls, and constants. But we do want to look at their
1041 types and the bounds of types. Mark them as visited so we properly
1042 unmark their subtrees on the unmark pass. If we've already seen them,
1043 don't look down further. */
1044 if (TREE_CODE_CLASS (code) == tcc_type
1045 || TREE_CODE_CLASS (code) == tcc_declaration
1046 || TREE_CODE_CLASS (code) == tcc_constant)
1048 if (TREE_VISITED (t))
1051 TREE_VISITED (t) = 1;
1054 /* If this node has been visited already, unshare it and don't look
1056 else if (TREE_VISITED (t))
1058 walk_tree (tp, mostly_copy_tree_r, NULL, NULL);
1062 /* Otherwise, mark the tree as visited and keep looking. */
1064 TREE_VISITED (t) = 1;
1070 unmark_visited_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
1071 void *data ATTRIBUTE_UNUSED)
1073 if (TREE_VISITED (*tp))
1074 TREE_VISITED (*tp) = 0;
1081 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
1082 bodies of any nested functions if we are unsharing the entire body of
1086 unshare_body (tree *body_p, tree fndecl)
1088 struct cgraph_node *cgn = cgraph_node (fndecl);
1090 walk_tree (body_p, copy_if_shared_r, NULL, NULL);
1091 if (body_p == &DECL_SAVED_TREE (fndecl))
1092 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
1093 unshare_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
1096 /* Likewise, but mark all trees as not visited. */
1099 unvisit_body (tree *body_p, tree fndecl)
1101 struct cgraph_node *cgn = cgraph_node (fndecl);
1103 walk_tree (body_p, unmark_visited_r, NULL, NULL);
1104 if (body_p == &DECL_SAVED_TREE (fndecl))
1105 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
1106 unvisit_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
1109 /* Unconditionally make an unshared copy of EXPR. This is used when using
1110 stored expressions which span multiple functions, such as BINFO_VTABLE,
1111 as the normal unsharing process can't tell that they're shared. */
1114 unshare_expr (tree expr)
1116 walk_tree (&expr, mostly_copy_tree_r, NULL, NULL);
1120 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
1121 contain statements and have a value. Assign its value to a temporary
1122 and give it void_type_node. Returns the temporary, or NULL_TREE if
1123 WRAPPER was already void. */
1126 voidify_wrapper_expr (tree wrapper, tree temp)
1128 tree type = TREE_TYPE (wrapper);
1129 if (type && !VOID_TYPE_P (type))
1133 /* Set p to point to the body of the wrapper. Loop until we find
1134 something that isn't a wrapper. */
1135 for (p = &wrapper; p && *p; )
1137 switch (TREE_CODE (*p))
1140 TREE_SIDE_EFFECTS (*p) = 1;
1141 TREE_TYPE (*p) = void_type_node;
1142 /* For a BIND_EXPR, the body is operand 1. */
1143 p = &BIND_EXPR_BODY (*p);
1146 case CLEANUP_POINT_EXPR:
1147 case TRY_FINALLY_EXPR:
1148 case TRY_CATCH_EXPR:
1149 TREE_SIDE_EFFECTS (*p) = 1;
1150 TREE_TYPE (*p) = void_type_node;
1151 p = &TREE_OPERAND (*p, 0);
1154 case STATEMENT_LIST:
1156 tree_stmt_iterator i = tsi_last (*p);
1157 TREE_SIDE_EFFECTS (*p) = 1;
1158 TREE_TYPE (*p) = void_type_node;
1159 p = tsi_end_p (i) ? NULL : tsi_stmt_ptr (i);
1164 /* Advance to the last statement. Set all container types to void. */
1165 for (; TREE_CODE (*p) == COMPOUND_EXPR; p = &TREE_OPERAND (*p, 1))
1167 TREE_SIDE_EFFECTS (*p) = 1;
1168 TREE_TYPE (*p) = void_type_node;
1178 if (p == NULL || IS_EMPTY_STMT (*p))
1182 /* The wrapper is on the RHS of an assignment that we're pushing
1184 gcc_assert (TREE_CODE (temp) == INIT_EXPR
1185 || TREE_CODE (temp) == MODIFY_EXPR);
1186 TREE_OPERAND (temp, 1) = *p;
1191 temp = create_tmp_var (type, "retval");
1192 *p = build2 (INIT_EXPR, type, temp, *p);
1201 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
1202 a temporary through which they communicate. */
1205 build_stack_save_restore (gimple *save, gimple *restore)
1209 *save = gimple_build_call (implicit_built_in_decls[BUILT_IN_STACK_SAVE], 0);
1210 tmp_var = create_tmp_var (ptr_type_node, "saved_stack");
1211 gimple_call_set_lhs (*save, tmp_var);
1213 *restore = gimple_build_call (implicit_built_in_decls[BUILT_IN_STACK_RESTORE],
1217 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
1219 static enum gimplify_status
1220 gimplify_bind_expr (tree *expr_p, gimple_seq *pre_p)
1222 tree bind_expr = *expr_p;
1223 bool old_save_stack = gimplify_ctxp->save_stack;
1228 tree temp = voidify_wrapper_expr (bind_expr, NULL);
1230 /* Mark variables seen in this bind expr. */
1231 for (t = BIND_EXPR_VARS (bind_expr); t ; t = TREE_CHAIN (t))
1233 if (TREE_CODE (t) == VAR_DECL)
1235 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
1237 /* Mark variable as local. */
1238 if (ctx && !is_global_var (t)
1239 && (! DECL_SEEN_IN_BIND_EXPR_P (t)
1240 || splay_tree_lookup (ctx->variables,
1241 (splay_tree_key) t) == NULL))
1242 omp_add_variable (gimplify_omp_ctxp, t, GOVD_LOCAL | GOVD_SEEN);
1244 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
1246 if (DECL_HARD_REGISTER (t) && !is_global_var (t) && cfun)
1247 cfun->has_local_explicit_reg_vars = true;
1250 /* Preliminarily mark non-addressed complex variables as eligible
1251 for promotion to gimple registers. We'll transform their uses
1253 if ((TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
1254 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
1255 && !TREE_THIS_VOLATILE (t)
1256 && (TREE_CODE (t) == VAR_DECL && !DECL_HARD_REGISTER (t))
1257 && !needs_to_live_in_memory (t))
1258 DECL_GIMPLE_REG_P (t) = 1;
1261 gimple_bind = gimple_build_bind (BIND_EXPR_VARS (bind_expr), NULL,
1262 BIND_EXPR_BLOCK (bind_expr));
1263 gimple_push_bind_expr (gimple_bind);
1265 gimplify_ctxp->save_stack = false;
1267 /* Gimplify the body into the GIMPLE_BIND tuple's body. */
1269 gimplify_stmt (&BIND_EXPR_BODY (bind_expr), &body);
1270 gimple_bind_set_body (gimple_bind, body);
1272 if (gimplify_ctxp->save_stack)
1274 gimple stack_save, stack_restore, gs;
1275 gimple_seq cleanup, new_body;
1277 /* Save stack on entry and restore it on exit. Add a try_finally
1278 block to achieve this. Note that mudflap depends on the
1279 format of the emitted code: see mx_register_decls(). */
1280 build_stack_save_restore (&stack_save, &stack_restore);
1282 cleanup = new_body = NULL;
1283 gimplify_seq_add_stmt (&cleanup, stack_restore);
1284 gs = gimple_build_try (gimple_bind_body (gimple_bind), cleanup,
1285 GIMPLE_TRY_FINALLY);
1287 gimplify_seq_add_stmt (&new_body, stack_save);
1288 gimplify_seq_add_stmt (&new_body, gs);
1289 gimple_bind_set_body (gimple_bind, new_body);
1292 gimplify_ctxp->save_stack = old_save_stack;
1293 gimple_pop_bind_expr ();
1295 gimplify_seq_add_stmt (pre_p, gimple_bind);
1303 *expr_p = NULL_TREE;
1307 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1308 GIMPLE value, it is assigned to a new temporary and the statement is
1309 re-written to return the temporary.
1311 PRE_P points to the sequence where side effects that must happen before
1312 STMT should be stored. */
1314 static enum gimplify_status
1315 gimplify_return_expr (tree stmt, gimple_seq *pre_p)
1318 tree ret_expr = TREE_OPERAND (stmt, 0);
1319 tree result_decl, result;
1321 if (ret_expr == error_mark_node)
1325 || TREE_CODE (ret_expr) == RESULT_DECL
1326 || ret_expr == error_mark_node)
1328 gimple ret = gimple_build_return (ret_expr);
1329 gimple_set_no_warning (ret, TREE_NO_WARNING (stmt));
1330 gimplify_seq_add_stmt (pre_p, ret);
1334 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
1335 result_decl = NULL_TREE;
1338 result_decl = TREE_OPERAND (ret_expr, 0);
1340 /* See through a return by reference. */
1341 if (TREE_CODE (result_decl) == INDIRECT_REF)
1342 result_decl = TREE_OPERAND (result_decl, 0);
1344 gcc_assert ((TREE_CODE (ret_expr) == MODIFY_EXPR
1345 || TREE_CODE (ret_expr) == INIT_EXPR)
1346 && TREE_CODE (result_decl) == RESULT_DECL);
1349 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1350 Recall that aggregate_value_p is FALSE for any aggregate type that is
1351 returned in registers. If we're returning values in registers, then
1352 we don't want to extend the lifetime of the RESULT_DECL, particularly
1353 across another call. In addition, for those aggregates for which
1354 hard_function_value generates a PARALLEL, we'll die during normal
1355 expansion of structure assignments; there's special code in expand_return
1356 to handle this case that does not exist in expand_expr. */
1358 || aggregate_value_p (result_decl, TREE_TYPE (current_function_decl)))
1359 result = result_decl;
1360 else if (gimplify_ctxp->return_temp)
1361 result = gimplify_ctxp->return_temp;
1364 result = create_tmp_var (TREE_TYPE (result_decl), NULL);
1365 if (TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
1366 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
1367 DECL_GIMPLE_REG_P (result) = 1;
1369 /* ??? With complex control flow (usually involving abnormal edges),
1370 we can wind up warning about an uninitialized value for this. Due
1371 to how this variable is constructed and initialized, this is never
1372 true. Give up and never warn. */
1373 TREE_NO_WARNING (result) = 1;
1375 gimplify_ctxp->return_temp = result;
1378 /* Smash the lhs of the MODIFY_EXPR to the temporary we plan to use.
1379 Then gimplify the whole thing. */
1380 if (result != result_decl)
1381 TREE_OPERAND (ret_expr, 0) = result;
1383 gimplify_and_add (TREE_OPERAND (stmt, 0), pre_p);
1385 ret = gimple_build_return (result);
1386 gimple_set_no_warning (ret, TREE_NO_WARNING (stmt));
1387 gimplify_seq_add_stmt (pre_p, ret);
1393 gimplify_vla_decl (tree decl, gimple_seq *seq_p)
1395 /* This is a variable-sized decl. Simplify its size and mark it
1396 for deferred expansion. Note that mudflap depends on the format
1397 of the emitted code: see mx_register_decls(). */
1398 tree t, addr, ptr_type;
1400 gimplify_one_sizepos (&DECL_SIZE (decl), seq_p);
1401 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl), seq_p);
1403 /* All occurrences of this decl in final gimplified code will be
1404 replaced by indirection. Setting DECL_VALUE_EXPR does two
1405 things: First, it lets the rest of the gimplifier know what
1406 replacement to use. Second, it lets the debug info know
1407 where to find the value. */
1408 ptr_type = build_pointer_type (TREE_TYPE (decl));
1409 addr = create_tmp_var (ptr_type, get_name (decl));
1410 DECL_IGNORED_P (addr) = 0;
1411 t = build_fold_indirect_ref (addr);
1412 SET_DECL_VALUE_EXPR (decl, t);
1413 DECL_HAS_VALUE_EXPR_P (decl) = 1;
1415 t = built_in_decls[BUILT_IN_ALLOCA];
1416 t = build_call_expr (t, 1, DECL_SIZE_UNIT (decl));
1417 t = fold_convert (ptr_type, t);
1418 t = build2 (MODIFY_EXPR, TREE_TYPE (addr), addr, t);
1420 gimplify_and_add (t, seq_p);
1422 /* Indicate that we need to restore the stack level when the
1423 enclosing BIND_EXPR is exited. */
1424 gimplify_ctxp->save_stack = true;
1428 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
1429 and initialization explicit. */
1431 static enum gimplify_status
1432 gimplify_decl_expr (tree *stmt_p, gimple_seq *seq_p)
1434 tree stmt = *stmt_p;
1435 tree decl = DECL_EXPR_DECL (stmt);
1437 *stmt_p = NULL_TREE;
1439 if (TREE_TYPE (decl) == error_mark_node)
1442 if ((TREE_CODE (decl) == TYPE_DECL
1443 || TREE_CODE (decl) == VAR_DECL)
1444 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl)))
1445 gimplify_type_sizes (TREE_TYPE (decl), seq_p);
1447 if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl))
1449 tree init = DECL_INITIAL (decl);
1451 if (TREE_CODE (DECL_SIZE_UNIT (decl)) != INTEGER_CST
1452 || (!TREE_STATIC (decl)
1453 && flag_stack_check == GENERIC_STACK_CHECK
1454 && compare_tree_int (DECL_SIZE_UNIT (decl),
1455 STACK_CHECK_MAX_VAR_SIZE) > 0))
1456 gimplify_vla_decl (decl, seq_p);
1458 if (init && init != error_mark_node)
1460 if (!TREE_STATIC (decl))
1462 DECL_INITIAL (decl) = NULL_TREE;
1463 init = build2 (INIT_EXPR, void_type_node, decl, init);
1464 gimplify_and_add (init, seq_p);
1468 /* We must still examine initializers for static variables
1469 as they may contain a label address. */
1470 walk_tree (&init, force_labels_r, NULL, NULL);
1473 /* Some front ends do not explicitly declare all anonymous
1474 artificial variables. We compensate here by declaring the
1475 variables, though it would be better if the front ends would
1476 explicitly declare them. */
1477 if (!DECL_SEEN_IN_BIND_EXPR_P (decl)
1478 && DECL_ARTIFICIAL (decl) && DECL_NAME (decl) == NULL_TREE)
1479 gimple_add_tmp_var (decl);
1485 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1486 and replacing the LOOP_EXPR with goto, but if the loop contains an
1487 EXIT_EXPR, we need to append a label for it to jump to. */
1489 static enum gimplify_status
1490 gimplify_loop_expr (tree *expr_p, gimple_seq *pre_p)
1492 tree saved_label = gimplify_ctxp->exit_label;
1493 tree start_label = create_artificial_label ();
1495 gimplify_seq_add_stmt (pre_p, gimple_build_label (start_label));
1497 gimplify_ctxp->exit_label = NULL_TREE;
1499 gimplify_and_add (LOOP_EXPR_BODY (*expr_p), pre_p);
1501 gimplify_seq_add_stmt (pre_p, gimple_build_goto (start_label));
1503 if (gimplify_ctxp->exit_label)
1504 gimplify_seq_add_stmt (pre_p, gimple_build_label (gimplify_ctxp->exit_label));
1506 gimplify_ctxp->exit_label = saved_label;
1512 /* Gimplifies a statement list onto a sequence. These may be created either
1513 by an enlightened front-end, or by shortcut_cond_expr. */
1515 static enum gimplify_status
1516 gimplify_statement_list (tree *expr_p, gimple_seq *pre_p)
1518 tree temp = voidify_wrapper_expr (*expr_p, NULL);
1520 tree_stmt_iterator i = tsi_start (*expr_p);
1522 while (!tsi_end_p (i))
1524 gimplify_stmt (tsi_stmt_ptr (i), pre_p);
1537 /* Compare two case labels. Because the front end should already have
1538 made sure that case ranges do not overlap, it is enough to only compare
1539 the CASE_LOW values of each case label. */
1542 compare_case_labels (const void *p1, const void *p2)
1544 const_tree const case1 = *(const_tree const*)p1;
1545 const_tree const case2 = *(const_tree const*)p2;
1547 /* The 'default' case label always goes first. */
1548 if (!CASE_LOW (case1))
1550 else if (!CASE_LOW (case2))
1553 return tree_int_cst_compare (CASE_LOW (case1), CASE_LOW (case2));
1557 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1560 sort_case_labels (VEC(tree,heap)* label_vec)
1562 size_t len = VEC_length (tree, label_vec);
1563 qsort (VEC_address (tree, label_vec), len, sizeof (tree),
1564 compare_case_labels);
1568 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1571 static enum gimplify_status
1572 gimplify_switch_expr (tree *expr_p, gimple_seq *pre_p)
1574 tree switch_expr = *expr_p;
1575 gimple_seq switch_body_seq = NULL;
1576 enum gimplify_status ret;
1578 ret = gimplify_expr (&SWITCH_COND (switch_expr), pre_p, NULL, is_gimple_val,
1580 if (ret == GS_ERROR || ret == GS_UNHANDLED)
1583 if (SWITCH_BODY (switch_expr))
1585 VEC (tree,heap) *labels;
1586 VEC (tree,heap) *saved_labels;
1587 tree default_case = NULL_TREE;
1589 gimple gimple_switch;
1591 /* If someone can be bothered to fill in the labels, they can
1592 be bothered to null out the body too. */
1593 gcc_assert (!SWITCH_LABELS (switch_expr));
1595 /* save old labels, get new ones from body, then restore the old
1596 labels. Save all the things from the switch body to append after. */
1597 saved_labels = gimplify_ctxp->case_labels;
1598 gimplify_ctxp->case_labels = VEC_alloc (tree, heap, 8);
1600 gimplify_stmt (&SWITCH_BODY (switch_expr), &switch_body_seq);
1601 labels = gimplify_ctxp->case_labels;
1602 gimplify_ctxp->case_labels = saved_labels;
1605 while (i < VEC_length (tree, labels))
1607 tree elt = VEC_index (tree, labels, i);
1608 tree low = CASE_LOW (elt);
1609 bool remove_element = FALSE;
1613 /* Discard empty ranges. */
1614 tree high = CASE_HIGH (elt);
1615 if (high && tree_int_cst_lt (high, low))
1616 remove_element = TRUE;
1620 /* The default case must be the last label in the list. */
1621 gcc_assert (!default_case);
1623 remove_element = TRUE;
1627 VEC_ordered_remove (tree, labels, i);
1637 /* If the switch has no default label, add one, so that we jump
1638 around the switch body. */
1639 default_case = build3 (CASE_LABEL_EXPR, void_type_node, NULL_TREE,
1640 NULL_TREE, create_artificial_label ());
1641 new_default = gimple_build_label (CASE_LABEL (default_case));
1642 gimplify_seq_add_stmt (&switch_body_seq, new_default);
1645 if (!VEC_empty (tree, labels))
1646 sort_case_labels (labels);
1648 gimple_switch = gimple_build_switch_vec (SWITCH_COND (switch_expr),
1649 default_case, labels);
1650 gimplify_seq_add_stmt (pre_p, gimple_switch);
1651 gimplify_seq_add_seq (pre_p, switch_body_seq);
1652 VEC_free(tree, heap, labels);
1655 gcc_assert (SWITCH_LABELS (switch_expr));
1661 static enum gimplify_status
1662 gimplify_case_label_expr (tree *expr_p, gimple_seq *pre_p)
1664 struct gimplify_ctx *ctxp;
1665 gimple gimple_label;
1667 /* Invalid OpenMP programs can play Duff's Device type games with
1668 #pragma omp parallel. At least in the C front end, we don't
1669 detect such invalid branches until after gimplification. */
1670 for (ctxp = gimplify_ctxp; ; ctxp = ctxp->prev_context)
1671 if (ctxp->case_labels)
1674 gimple_label = gimple_build_label (CASE_LABEL (*expr_p));
1675 VEC_safe_push (tree, heap, ctxp->case_labels, *expr_p);
1676 gimplify_seq_add_stmt (pre_p, gimple_label);
1681 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1685 build_and_jump (tree *label_p)
1687 if (label_p == NULL)
1688 /* If there's nowhere to jump, just fall through. */
1691 if (*label_p == NULL_TREE)
1693 tree label = create_artificial_label ();
1697 return build1 (GOTO_EXPR, void_type_node, *label_p);
1700 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1701 This also involves building a label to jump to and communicating it to
1702 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1704 static enum gimplify_status
1705 gimplify_exit_expr (tree *expr_p)
1707 tree cond = TREE_OPERAND (*expr_p, 0);
1710 expr = build_and_jump (&gimplify_ctxp->exit_label);
1711 expr = build3 (COND_EXPR, void_type_node, cond, expr, NULL_TREE);
1717 /* A helper function to be called via walk_tree. Mark all labels under *TP
1718 as being forced. To be called for DECL_INITIAL of static variables. */
1721 force_labels_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
1725 if (TREE_CODE (*tp) == LABEL_DECL)
1726 FORCED_LABEL (*tp) = 1;
1731 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1732 different from its canonical type, wrap the whole thing inside a
1733 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1736 The canonical type of a COMPONENT_REF is the type of the field being
1737 referenced--unless the field is a bit-field which can be read directly
1738 in a smaller mode, in which case the canonical type is the
1739 sign-appropriate type corresponding to that mode. */
1742 canonicalize_component_ref (tree *expr_p)
1744 tree expr = *expr_p;
1747 gcc_assert (TREE_CODE (expr) == COMPONENT_REF);
1749 if (INTEGRAL_TYPE_P (TREE_TYPE (expr)))
1750 type = TREE_TYPE (get_unwidened (expr, NULL_TREE));
1752 type = TREE_TYPE (TREE_OPERAND (expr, 1));
1754 /* One could argue that all the stuff below is not necessary for
1755 the non-bitfield case and declare it a FE error if type
1756 adjustment would be needed. */
1757 if (TREE_TYPE (expr) != type)
1759 #ifdef ENABLE_TYPES_CHECKING
1760 tree old_type = TREE_TYPE (expr);
1764 /* We need to preserve qualifiers and propagate them from
1766 type_quals = TYPE_QUALS (type)
1767 | TYPE_QUALS (TREE_TYPE (TREE_OPERAND (expr, 0)));
1768 if (TYPE_QUALS (type) != type_quals)
1769 type = build_qualified_type (TYPE_MAIN_VARIANT (type), type_quals);
1771 /* Set the type of the COMPONENT_REF to the underlying type. */
1772 TREE_TYPE (expr) = type;
1774 #ifdef ENABLE_TYPES_CHECKING
1775 /* It is now a FE error, if the conversion from the canonical
1776 type to the original expression type is not useless. */
1777 gcc_assert (useless_type_conversion_p (old_type, type));
1782 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1783 to foo, embed that change in the ADDR_EXPR by converting
1788 where L is the lower bound. For simplicity, only do this for constant
1790 The constraint is that the type of &array[L] is trivially convertible
1794 canonicalize_addr_expr (tree *expr_p)
1796 tree expr = *expr_p;
1797 tree addr_expr = TREE_OPERAND (expr, 0);
1798 tree datype, ddatype, pddatype;
1800 /* We simplify only conversions from an ADDR_EXPR to a pointer type. */
1801 if (!POINTER_TYPE_P (TREE_TYPE (expr))
1802 || TREE_CODE (addr_expr) != ADDR_EXPR)
1805 /* The addr_expr type should be a pointer to an array. */
1806 datype = TREE_TYPE (TREE_TYPE (addr_expr));
1807 if (TREE_CODE (datype) != ARRAY_TYPE)
1810 /* The pointer to element type shall be trivially convertible to
1811 the expression pointer type. */
1812 ddatype = TREE_TYPE (datype);
1813 pddatype = build_pointer_type (ddatype);
1814 if (!useless_type_conversion_p (pddatype, ddatype))
1817 /* The lower bound and element sizes must be constant. */
1818 if (!TYPE_SIZE_UNIT (ddatype)
1819 || TREE_CODE (TYPE_SIZE_UNIT (ddatype)) != INTEGER_CST
1820 || !TYPE_DOMAIN (datype) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype))
1821 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype))) != INTEGER_CST)
1824 /* All checks succeeded. Build a new node to merge the cast. */
1825 *expr_p = build4 (ARRAY_REF, ddatype, TREE_OPERAND (addr_expr, 0),
1826 TYPE_MIN_VALUE (TYPE_DOMAIN (datype)),
1827 NULL_TREE, NULL_TREE);
1828 *expr_p = build1 (ADDR_EXPR, pddatype, *expr_p);
1831 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1832 underneath as appropriate. */
1834 static enum gimplify_status
1835 gimplify_conversion (tree *expr_p)
1838 gcc_assert (CONVERT_EXPR_P (*expr_p));
1840 /* Then strip away all but the outermost conversion. */
1841 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p, 0));
1843 /* And remove the outermost conversion if it's useless. */
1844 if (tree_ssa_useless_type_conversion (*expr_p))
1845 *expr_p = TREE_OPERAND (*expr_p, 0);
1847 /* Attempt to avoid NOP_EXPR by producing reference to a subtype.
1848 For example this fold (subclass *)&A into &A->subclass avoiding
1849 a need for statement. */
1850 if (CONVERT_EXPR_P (*expr_p)
1851 && POINTER_TYPE_P (TREE_TYPE (*expr_p))
1852 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p, 0)))
1853 && (tem = maybe_fold_offset_to_address
1854 (TREE_OPERAND (*expr_p, 0),
1855 integer_zero_node, TREE_TYPE (*expr_p))) != NULL_TREE)
1858 /* If we still have a conversion at the toplevel,
1859 then canonicalize some constructs. */
1860 if (CONVERT_EXPR_P (*expr_p))
1862 tree sub = TREE_OPERAND (*expr_p, 0);
1864 /* If a NOP conversion is changing the type of a COMPONENT_REF
1865 expression, then canonicalize its type now in order to expose more
1866 redundant conversions. */
1867 if (TREE_CODE (sub) == COMPONENT_REF)
1868 canonicalize_component_ref (&TREE_OPERAND (*expr_p, 0));
1870 /* If a NOP conversion is changing a pointer to array of foo
1871 to a pointer to foo, embed that change in the ADDR_EXPR. */
1872 else if (TREE_CODE (sub) == ADDR_EXPR)
1873 canonicalize_addr_expr (expr_p);
1876 /* If we have a conversion to a non-register type force the
1877 use of a VIEW_CONVERT_EXPR instead. */
1878 if (!is_gimple_reg_type (TREE_TYPE (*expr_p)))
1879 *expr_p = fold_build1 (VIEW_CONVERT_EXPR, TREE_TYPE (*expr_p),
1880 TREE_OPERAND (*expr_p, 0));
1885 /* Gimplify a VAR_DECL or PARM_DECL. Returns GS_OK if we expanded a
1886 DECL_VALUE_EXPR, and it's worth re-examining things. */
1888 static enum gimplify_status
1889 gimplify_var_or_parm_decl (tree *expr_p)
1891 tree decl = *expr_p;
1893 /* ??? If this is a local variable, and it has not been seen in any
1894 outer BIND_EXPR, then it's probably the result of a duplicate
1895 declaration, for which we've already issued an error. It would
1896 be really nice if the front end wouldn't leak these at all.
1897 Currently the only known culprit is C++ destructors, as seen
1898 in g++.old-deja/g++.jason/binding.C. */
1899 if (TREE_CODE (decl) == VAR_DECL
1900 && !DECL_SEEN_IN_BIND_EXPR_P (decl)
1901 && !TREE_STATIC (decl) && !DECL_EXTERNAL (decl)
1902 && decl_function_context (decl) == current_function_decl)
1904 gcc_assert (errorcount || sorrycount);
1908 /* When within an OpenMP context, notice uses of variables. */
1909 if (gimplify_omp_ctxp && omp_notice_variable (gimplify_omp_ctxp, decl, true))
1912 /* If the decl is an alias for another expression, substitute it now. */
1913 if (DECL_HAS_VALUE_EXPR_P (decl))
1915 *expr_p = unshare_expr (DECL_VALUE_EXPR (decl));
1923 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1927 : min_lval '[' val ']'
1929 | compound_lval '[' val ']'
1930 | compound_lval '.' ID
1932 This is not part of the original SIMPLE definition, which separates
1933 array and member references, but it seems reasonable to handle them
1934 together. Also, this way we don't run into problems with union
1935 aliasing; gcc requires that for accesses through a union to alias, the
1936 union reference must be explicit, which was not always the case when we
1937 were splitting up array and member refs.
1939 PRE_P points to the sequence where side effects that must happen before
1940 *EXPR_P should be stored.
1942 POST_P points to the sequence where side effects that must happen after
1943 *EXPR_P should be stored. */
1945 static enum gimplify_status
1946 gimplify_compound_lval (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
1947 fallback_t fallback)
1950 VEC(tree,heap) *stack;
1951 enum gimplify_status ret = GS_OK, tret;
1954 /* Create a stack of the subexpressions so later we can walk them in
1955 order from inner to outer. */
1956 stack = VEC_alloc (tree, heap, 10);
1958 /* We can handle anything that get_inner_reference can deal with. */
1959 for (p = expr_p; ; p = &TREE_OPERAND (*p, 0))
1962 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1963 if (TREE_CODE (*p) == INDIRECT_REF)
1964 *p = fold_indirect_ref (*p);
1966 if (handled_component_p (*p))
1968 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
1969 additional COMPONENT_REFs. */
1970 else if ((TREE_CODE (*p) == VAR_DECL || TREE_CODE (*p) == PARM_DECL)
1971 && gimplify_var_or_parm_decl (p) == GS_OK)
1976 VEC_safe_push (tree, heap, stack, *p);
1979 gcc_assert (VEC_length (tree, stack));
1981 /* Now STACK is a stack of pointers to all the refs we've walked through
1982 and P points to the innermost expression.
1984 Java requires that we elaborated nodes in source order. That
1985 means we must gimplify the inner expression followed by each of
1986 the indices, in order. But we can't gimplify the inner
1987 expression until we deal with any variable bounds, sizes, or
1988 positions in order to deal with PLACEHOLDER_EXPRs.
1990 So we do this in three steps. First we deal with the annotations
1991 for any variables in the components, then we gimplify the base,
1992 then we gimplify any indices, from left to right. */
1993 for (i = VEC_length (tree, stack) - 1; i >= 0; i--)
1995 tree t = VEC_index (tree, stack, i);
1997 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
1999 /* Gimplify the low bound and element type size and put them into
2000 the ARRAY_REF. If these values are set, they have already been
2002 if (TREE_OPERAND (t, 2) == NULL_TREE)
2004 tree low = unshare_expr (array_ref_low_bound (t));
2005 if (!is_gimple_min_invariant (low))
2007 TREE_OPERAND (t, 2) = low;
2008 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p,
2009 post_p, is_gimple_formal_tmp_reg,
2011 ret = MIN (ret, tret);
2015 if (!TREE_OPERAND (t, 3))
2017 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (t, 0)));
2018 tree elmt_size = unshare_expr (array_ref_element_size (t));
2019 tree factor = size_int (TYPE_ALIGN_UNIT (elmt_type));
2021 /* Divide the element size by the alignment of the element
2023 elmt_size = size_binop (EXACT_DIV_EXPR, elmt_size, factor);
2025 if (!is_gimple_min_invariant (elmt_size))
2027 TREE_OPERAND (t, 3) = elmt_size;
2028 tret = gimplify_expr (&TREE_OPERAND (t, 3), pre_p,
2029 post_p, is_gimple_formal_tmp_reg,
2031 ret = MIN (ret, tret);
2035 else if (TREE_CODE (t) == COMPONENT_REF)
2037 /* Set the field offset into T and gimplify it. */
2038 if (!TREE_OPERAND (t, 2))
2040 tree offset = unshare_expr (component_ref_field_offset (t));
2041 tree field = TREE_OPERAND (t, 1);
2043 = size_int (DECL_OFFSET_ALIGN (field) / BITS_PER_UNIT);
2045 /* Divide the offset by its alignment. */
2046 offset = size_binop (EXACT_DIV_EXPR, offset, factor);
2048 if (!is_gimple_min_invariant (offset))
2050 TREE_OPERAND (t, 2) = offset;
2051 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p,
2052 post_p, is_gimple_formal_tmp_reg,
2054 ret = MIN (ret, tret);
2060 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
2061 so as to match the min_lval predicate. Failure to do so may result
2062 in the creation of large aggregate temporaries. */
2063 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval,
2064 fallback | fb_lvalue);
2065 ret = MIN (ret, tret);
2067 /* And finally, the indices and operands to BIT_FIELD_REF. During this
2068 loop we also remove any useless conversions. */
2069 for (; VEC_length (tree, stack) > 0; )
2071 tree t = VEC_pop (tree, stack);
2073 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
2075 /* Gimplify the dimension.
2076 Temporary fix for gcc.c-torture/execute/20040313-1.c.
2077 Gimplify non-constant array indices into a temporary
2079 FIXME - The real fix is to gimplify post-modify
2080 expressions into a minimal gimple lvalue. However, that
2081 exposes bugs in alias analysis. The alias analyzer does
2082 not handle &PTR->FIELD very well. Will fix after the
2083 branch is merged into mainline (dnovillo 2004-05-03). */
2084 if (!is_gimple_min_invariant (TREE_OPERAND (t, 1)))
2086 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
2087 is_gimple_formal_tmp_reg, fb_rvalue);
2088 ret = MIN (ret, tret);
2091 else if (TREE_CODE (t) == BIT_FIELD_REF)
2093 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
2094 is_gimple_val, fb_rvalue);
2095 ret = MIN (ret, tret);
2096 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
2097 is_gimple_val, fb_rvalue);
2098 ret = MIN (ret, tret);
2101 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t, 0));
2103 /* The innermost expression P may have originally had
2104 TREE_SIDE_EFFECTS set which would have caused all the outer
2105 expressions in *EXPR_P leading to P to also have had
2106 TREE_SIDE_EFFECTS set. */
2107 recalculate_side_effects (t);
2110 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
2111 if ((fallback & fb_rvalue) && TREE_CODE (*expr_p) == COMPONENT_REF)
2113 canonicalize_component_ref (expr_p);
2114 ret = MIN (ret, GS_OK);
2117 VEC_free (tree, heap, stack);
2122 /* Gimplify the self modifying expression pointed to by EXPR_P
2125 PRE_P points to the list where side effects that must happen before
2126 *EXPR_P should be stored.
2128 POST_P points to the list where side effects that must happen after
2129 *EXPR_P should be stored.
2131 WANT_VALUE is nonzero iff we want to use the value of this expression
2132 in another expression. */
2134 static enum gimplify_status
2135 gimplify_self_mod_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
2138 enum tree_code code;
2139 tree lhs, lvalue, rhs, t1;
2140 gimple_seq post = NULL, *orig_post_p = post_p;
2142 enum tree_code arith_code;
2143 enum gimplify_status ret;
2145 code = TREE_CODE (*expr_p);
2147 gcc_assert (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR
2148 || code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR);
2150 /* Prefix or postfix? */
2151 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
2152 /* Faster to treat as prefix if result is not used. */
2153 postfix = want_value;
2157 /* For postfix, make sure the inner expression's post side effects
2158 are executed after side effects from this expression. */
2162 /* Add or subtract? */
2163 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2164 arith_code = PLUS_EXPR;
2166 arith_code = MINUS_EXPR;
2168 /* Gimplify the LHS into a GIMPLE lvalue. */
2169 lvalue = TREE_OPERAND (*expr_p, 0);
2170 ret = gimplify_expr (&lvalue, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
2171 if (ret == GS_ERROR)
2174 /* Extract the operands to the arithmetic operation. */
2176 rhs = TREE_OPERAND (*expr_p, 1);
2178 /* For postfix operator, we evaluate the LHS to an rvalue and then use
2179 that as the result value and in the postqueue operation. */
2182 ret = gimplify_expr (&lhs, pre_p, post_p, is_gimple_val, fb_rvalue);
2183 if (ret == GS_ERROR)
2187 /* For POINTERs increment, use POINTER_PLUS_EXPR. */
2188 if (POINTER_TYPE_P (TREE_TYPE (lhs)))
2190 rhs = fold_convert (sizetype, rhs);
2191 if (arith_code == MINUS_EXPR)
2192 rhs = fold_build1 (NEGATE_EXPR, TREE_TYPE (rhs), rhs);
2193 arith_code = POINTER_PLUS_EXPR;
2196 t1 = build2 (arith_code, TREE_TYPE (*expr_p), lhs, rhs);
2200 gimplify_assign (lvalue, t1, orig_post_p);
2201 gimplify_seq_add_seq (orig_post_p, post);
2207 *expr_p = build2 (MODIFY_EXPR, TREE_TYPE (lvalue), lvalue, t1);
2213 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
2216 maybe_with_size_expr (tree *expr_p)
2218 tree expr = *expr_p;
2219 tree type = TREE_TYPE (expr);
2222 /* If we've already wrapped this or the type is error_mark_node, we can't do
2224 if (TREE_CODE (expr) == WITH_SIZE_EXPR
2225 || type == error_mark_node)
2228 /* If the size isn't known or is a constant, we have nothing to do. */
2229 size = TYPE_SIZE_UNIT (type);
2230 if (!size || TREE_CODE (size) == INTEGER_CST)
2233 /* Otherwise, make a WITH_SIZE_EXPR. */
2234 size = unshare_expr (size);
2235 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, expr);
2236 *expr_p = build2 (WITH_SIZE_EXPR, type, expr, size);
2240 /* Helper for gimplify_call_expr. Gimplify a single argument *ARG_P
2241 Store any side-effects in PRE_P. CALL_LOCATION is the location of
2244 static enum gimplify_status
2245 gimplify_arg (tree *arg_p, gimple_seq *pre_p, location_t call_location)
2247 bool (*test) (tree);
2250 /* In general, we allow lvalues for function arguments to avoid
2251 extra overhead of copying large aggregates out of even larger
2252 aggregates into temporaries only to copy the temporaries to
2253 the argument list. Make optimizers happy by pulling out to
2254 temporaries those types that fit in registers. */
2255 if (is_gimple_reg_type (TREE_TYPE (*arg_p)))
2256 test = is_gimple_val, fb = fb_rvalue;
2258 test = is_gimple_lvalue, fb = fb_either;
2260 /* If this is a variable sized type, we must remember the size. */
2261 maybe_with_size_expr (arg_p);
2263 /* Make sure arguments have the same location as the function call
2265 protected_set_expr_location (*arg_p, call_location);
2267 /* There is a sequence point before a function call. Side effects in
2268 the argument list must occur before the actual call. So, when
2269 gimplifying arguments, force gimplify_expr to use an internal
2270 post queue which is then appended to the end of PRE_P. */
2271 return gimplify_expr (arg_p, pre_p, NULL, test, fb);
2275 /* Gimplify the CALL_EXPR node *EXPR_P into the GIMPLE sequence PRE_P.
2276 WANT_VALUE is true if the result of the call is desired. */
2278 static enum gimplify_status
2279 gimplify_call_expr (tree *expr_p, gimple_seq *pre_p, bool want_value)
2281 tree fndecl, parms, p;
2282 enum gimplify_status ret;
2285 bool builtin_va_start_p = FALSE;
2287 gcc_assert (TREE_CODE (*expr_p) == CALL_EXPR);
2289 /* For reliable diagnostics during inlining, it is necessary that
2290 every call_expr be annotated with file and line. */
2291 if (! EXPR_HAS_LOCATION (*expr_p))
2292 SET_EXPR_LOCATION (*expr_p, input_location);
2294 /* This may be a call to a builtin function.
2296 Builtin function calls may be transformed into different
2297 (and more efficient) builtin function calls under certain
2298 circumstances. Unfortunately, gimplification can muck things
2299 up enough that the builtin expanders are not aware that certain
2300 transformations are still valid.
2302 So we attempt transformation/gimplification of the call before
2303 we gimplify the CALL_EXPR. At this time we do not manage to
2304 transform all calls in the same manner as the expanders do, but
2305 we do transform most of them. */
2306 fndecl = get_callee_fndecl (*expr_p);
2307 if (fndecl && DECL_BUILT_IN (fndecl))
2309 tree new_tree = fold_call_expr (*expr_p, !want_value);
2311 if (new_tree && new_tree != *expr_p)
2313 /* There was a transformation of this call which computes the
2314 same value, but in a more efficient way. Return and try
2320 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
2321 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_VA_START)
2323 builtin_va_start_p = TRUE;
2324 if (call_expr_nargs (*expr_p) < 2)
2326 error ("too few arguments to function %<va_start%>");
2327 *expr_p = build_empty_stmt ();
2331 if (fold_builtin_next_arg (*expr_p, true))
2333 *expr_p = build_empty_stmt ();
2339 /* There is a sequence point before the call, so any side effects in
2340 the calling expression must occur before the actual call. Force
2341 gimplify_expr to use an internal post queue. */
2342 ret = gimplify_expr (&CALL_EXPR_FN (*expr_p), pre_p, NULL,
2343 is_gimple_call_addr, fb_rvalue);
2345 nargs = call_expr_nargs (*expr_p);
2347 /* Get argument types for verification. */
2348 fndecl = get_callee_fndecl (*expr_p);
2351 parms = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
2352 else if (POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_FN (*expr_p))))
2353 parms = TYPE_ARG_TYPES (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (*expr_p))));
2355 if (fndecl && DECL_ARGUMENTS (fndecl))
2356 p = DECL_ARGUMENTS (fndecl);
2361 for (i = 0; i < nargs && p; i++, p = TREE_CHAIN (p))
2364 /* If the last argument is __builtin_va_arg_pack () and it is not
2365 passed as a named argument, decrease the number of CALL_EXPR
2366 arguments and set instead the CALL_EXPR_VA_ARG_PACK flag. */
2369 && TREE_CODE (CALL_EXPR_ARG (*expr_p, nargs - 1)) == CALL_EXPR)
2371 tree last_arg = CALL_EXPR_ARG (*expr_p, nargs - 1);
2372 tree last_arg_fndecl = get_callee_fndecl (last_arg);
2375 && TREE_CODE (last_arg_fndecl) == FUNCTION_DECL
2376 && DECL_BUILT_IN_CLASS (last_arg_fndecl) == BUILT_IN_NORMAL
2377 && DECL_FUNCTION_CODE (last_arg_fndecl) == BUILT_IN_VA_ARG_PACK)
2379 tree call = *expr_p;
2382 *expr_p = build_call_array (TREE_TYPE (call), CALL_EXPR_FN (call),
2383 nargs, CALL_EXPR_ARGP (call));
2385 /* Copy all CALL_EXPR flags, location and block, except
2386 CALL_EXPR_VA_ARG_PACK flag. */
2387 CALL_EXPR_STATIC_CHAIN (*expr_p) = CALL_EXPR_STATIC_CHAIN (call);
2388 CALL_EXPR_TAILCALL (*expr_p) = CALL_EXPR_TAILCALL (call);
2389 CALL_EXPR_RETURN_SLOT_OPT (*expr_p)
2390 = CALL_EXPR_RETURN_SLOT_OPT (call);
2391 CALL_FROM_THUNK_P (*expr_p) = CALL_FROM_THUNK_P (call);
2392 CALL_CANNOT_INLINE_P (*expr_p) = CALL_CANNOT_INLINE_P (call);
2393 SET_EXPR_LOCUS (*expr_p, EXPR_LOCUS (call));
2394 TREE_BLOCK (*expr_p) = TREE_BLOCK (call);
2396 /* Set CALL_EXPR_VA_ARG_PACK. */
2397 CALL_EXPR_VA_ARG_PACK (*expr_p) = 1;
2401 /* Finally, gimplify the function arguments. */
2404 for (i = (PUSH_ARGS_REVERSED ? nargs - 1 : 0);
2405 PUSH_ARGS_REVERSED ? i >= 0 : i < nargs;
2406 PUSH_ARGS_REVERSED ? i-- : i++)
2408 enum gimplify_status t;
2410 /* Avoid gimplifying the second argument to va_start, which needs to
2411 be the plain PARM_DECL. */
2412 if ((i != 1) || !builtin_va_start_p)
2414 t = gimplify_arg (&CALL_EXPR_ARG (*expr_p, i), pre_p,
2415 EXPR_LOCATION (*expr_p));
2423 /* Try this again in case gimplification exposed something. */
2424 if (ret != GS_ERROR)
2426 tree new_tree = fold_call_expr (*expr_p, !want_value);
2428 if (new_tree && new_tree != *expr_p)
2430 /* There was a transformation of this call which computes the
2431 same value, but in a more efficient way. Return and try
2439 *expr_p = error_mark_node;
2443 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2444 decl. This allows us to eliminate redundant or useless
2445 calls to "const" functions. */
2446 if (TREE_CODE (*expr_p) == CALL_EXPR)
2448 int flags = call_expr_flags (*expr_p);
2449 if (flags & (ECF_CONST | ECF_PURE)
2450 /* An infinite loop is considered a side effect. */
2451 && !(flags & (ECF_LOOPING_CONST_OR_PURE)))
2452 TREE_SIDE_EFFECTS (*expr_p) = 0;
2455 /* If the value is not needed by the caller, emit a new GIMPLE_CALL
2456 and clear *EXPR_P. Otherwise, leave *EXPR_P in its gimplified
2457 form and delegate the creation of a GIMPLE_CALL to
2458 gimplify_modify_expr. This is always possible because when
2459 WANT_VALUE is true, the caller wants the result of this call into
2460 a temporary, which means that we will emit an INIT_EXPR in
2461 internal_get_tmp_var which will then be handled by
2462 gimplify_modify_expr. */
2465 /* The CALL_EXPR in *EXPR_P is already in GIMPLE form, so all we
2466 have to do is replicate it as a GIMPLE_CALL tuple. */
2467 call = gimple_build_call_from_tree (*expr_p);
2468 gimplify_seq_add_stmt (pre_p, call);
2469 *expr_p = NULL_TREE;
2475 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2476 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2478 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2479 condition is true or false, respectively. If null, we should generate
2480 our own to skip over the evaluation of this specific expression.
2482 This function is the tree equivalent of do_jump.
2484 shortcut_cond_r should only be called by shortcut_cond_expr. */
2487 shortcut_cond_r (tree pred, tree *true_label_p, tree *false_label_p)
2489 tree local_label = NULL_TREE;
2490 tree t, expr = NULL;
2492 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2493 retain the shortcut semantics. Just insert the gotos here;
2494 shortcut_cond_expr will append the real blocks later. */
2495 if (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2497 /* Turn if (a && b) into
2499 if (a); else goto no;
2500 if (b) goto yes; else goto no;
2503 if (false_label_p == NULL)
2504 false_label_p = &local_label;
2506 t = shortcut_cond_r (TREE_OPERAND (pred, 0), NULL, false_label_p);
2507 append_to_statement_list (t, &expr);
2509 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2511 append_to_statement_list (t, &expr);
2513 else if (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2515 /* Turn if (a || b) into
2518 if (b) goto yes; else goto no;
2521 if (true_label_p == NULL)
2522 true_label_p = &local_label;
2524 t = shortcut_cond_r (TREE_OPERAND (pred, 0), true_label_p, NULL);
2525 append_to_statement_list (t, &expr);
2527 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2529 append_to_statement_list (t, &expr);
2531 else if (TREE_CODE (pred) == COND_EXPR)
2533 /* As long as we're messing with gotos, turn if (a ? b : c) into
2535 if (b) goto yes; else goto no;
2537 if (c) goto yes; else goto no; */
2538 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (pred, 0),
2539 shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2541 shortcut_cond_r (TREE_OPERAND (pred, 2), true_label_p,
2546 expr = build3 (COND_EXPR, void_type_node, pred,
2547 build_and_jump (true_label_p),
2548 build_and_jump (false_label_p));
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 (a && b) into if (a) if (b). */
2581 while (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2583 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2584 then_ = shortcut_cond_expr (expr);
2585 then_se = then_ && TREE_SIDE_EFFECTS (then_);
2586 pred = TREE_OPERAND (pred, 0);
2587 expr = build3 (COND_EXPR, void_type_node, pred, then_, NULL_TREE);
2593 /* If there is no 'then', turn
2596 if (a); else if (b); else d. */
2597 while (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2599 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2600 else_ = shortcut_cond_expr (expr);
2601 else_se = else_ && TREE_SIDE_EFFECTS (else_);
2602 pred = TREE_OPERAND (pred, 0);
2603 expr = build3 (COND_EXPR, void_type_node, pred, NULL_TREE, else_);
2607 /* If we're done, great. */
2608 if (TREE_CODE (pred) != TRUTH_ANDIF_EXPR
2609 && TREE_CODE (pred) != TRUTH_ORIF_EXPR)
2612 /* Otherwise we need to mess with gotos. Change
2615 if (a); else goto no;
2618 and recursively gimplify the condition. */
2620 true_label = false_label = end_label = NULL_TREE;
2622 /* If our arms just jump somewhere, hijack those labels so we don't
2623 generate jumps to jumps. */
2626 && TREE_CODE (then_) == GOTO_EXPR
2627 && TREE_CODE (GOTO_DESTINATION (then_)) == LABEL_DECL)
2629 true_label = GOTO_DESTINATION (then_);
2635 && TREE_CODE (else_) == GOTO_EXPR
2636 && TREE_CODE (GOTO_DESTINATION (else_)) == LABEL_DECL)
2638 false_label = GOTO_DESTINATION (else_);
2643 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2645 true_label_p = &true_label;
2647 true_label_p = NULL;
2649 /* The 'else' branch also needs a label if it contains interesting code. */
2650 if (false_label || else_se)
2651 false_label_p = &false_label;
2653 false_label_p = NULL;
2655 /* If there was nothing else in our arms, just forward the label(s). */
2656 if (!then_se && !else_se)
2657 return shortcut_cond_r (pred, true_label_p, false_label_p);
2659 /* If our last subexpression already has a terminal label, reuse it. */
2661 expr = expr_last (else_);
2663 expr = expr_last (then_);
2666 if (expr && TREE_CODE (expr) == LABEL_EXPR)
2667 end_label = LABEL_EXPR_LABEL (expr);
2669 /* If we don't care about jumping to the 'else' branch, jump to the end
2670 if the condition is false. */
2672 false_label_p = &end_label;
2674 /* We only want to emit these labels if we aren't hijacking them. */
2675 emit_end = (end_label == NULL_TREE);
2676 emit_false = (false_label == NULL_TREE);
2678 /* We only emit the jump over the else clause if we have to--if the
2679 then clause may fall through. Otherwise we can wind up with a
2680 useless jump and a useless label at the end of gimplified code,
2681 which will cause us to think that this conditional as a whole
2682 falls through even if it doesn't. If we then inline a function
2683 which ends with such a condition, that can cause us to issue an
2684 inappropriate warning about control reaching the end of a
2685 non-void function. */
2686 jump_over_else = block_may_fallthru (then_);
2688 pred = shortcut_cond_r (pred, true_label_p, false_label_p);
2691 append_to_statement_list (pred, &expr);
2693 append_to_statement_list (then_, &expr);
2698 t = build_and_jump (&end_label);
2699 append_to_statement_list (t, &expr);
2703 t = build1 (LABEL_EXPR, void_type_node, false_label);
2704 append_to_statement_list (t, &expr);
2706 append_to_statement_list (else_, &expr);
2708 if (emit_end && end_label)
2710 t = build1 (LABEL_EXPR, void_type_node, end_label);
2711 append_to_statement_list (t, &expr);
2717 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2720 gimple_boolify (tree expr)
2722 tree type = TREE_TYPE (expr);
2724 if (TREE_CODE (type) == BOOLEAN_TYPE)
2727 switch (TREE_CODE (expr))
2729 case TRUTH_AND_EXPR:
2731 case TRUTH_XOR_EXPR:
2732 case TRUTH_ANDIF_EXPR:
2733 case TRUTH_ORIF_EXPR:
2734 /* Also boolify the arguments of truth exprs. */
2735 TREE_OPERAND (expr, 1) = gimple_boolify (TREE_OPERAND (expr, 1));
2738 case TRUTH_NOT_EXPR:
2739 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2742 case EQ_EXPR: case NE_EXPR:
2743 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2744 /* These expressions always produce boolean results. */
2745 TREE_TYPE (expr) = boolean_type_node;
2749 /* Other expressions that get here must have boolean values, but
2750 might need to be converted to the appropriate mode. */
2751 return fold_convert (boolean_type_node, expr);
2755 /* Given a conditional expression *EXPR_P without side effects, gimplify
2756 its operands. New statements are inserted to PRE_P. */
2758 static enum gimplify_status
2759 gimplify_pure_cond_expr (tree *expr_p, gimple_seq *pre_p)
2761 tree expr = *expr_p, cond;
2762 enum gimplify_status ret, tret;
2763 enum tree_code code;
2765 cond = gimple_boolify (COND_EXPR_COND (expr));
2767 /* We need to handle && and || specially, as their gimplification
2768 creates pure cond_expr, thus leading to an infinite cycle otherwise. */
2769 code = TREE_CODE (cond);
2770 if (code == TRUTH_ANDIF_EXPR)
2771 TREE_SET_CODE (cond, TRUTH_AND_EXPR);
2772 else if (code == TRUTH_ORIF_EXPR)
2773 TREE_SET_CODE (cond, TRUTH_OR_EXPR);
2774 ret = gimplify_expr (&cond, pre_p, NULL, is_gimple_condexpr, fb_rvalue);
2775 COND_EXPR_COND (*expr_p) = cond;
2777 tret = gimplify_expr (&COND_EXPR_THEN (expr), pre_p, NULL,
2778 is_gimple_val, fb_rvalue);
2779 ret = MIN (ret, tret);
2780 tret = gimplify_expr (&COND_EXPR_ELSE (expr), pre_p, NULL,
2781 is_gimple_val, fb_rvalue);
2783 return MIN (ret, tret);
2786 /* Returns true if evaluating EXPR could trap.
2787 EXPR is GENERIC, while tree_could_trap_p can be called
2791 generic_expr_could_trap_p (tree expr)
2795 if (!expr || is_gimple_val (expr))
2798 if (!EXPR_P (expr) || tree_could_trap_p (expr))
2801 n = TREE_OPERAND_LENGTH (expr);
2802 for (i = 0; i < n; i++)
2803 if (generic_expr_could_trap_p (TREE_OPERAND (expr, i)))
2809 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2818 The second form is used when *EXPR_P is of type void.
2820 PRE_P points to the list where side effects that must happen before
2821 *EXPR_P should be stored. */
2823 static enum gimplify_status
2824 gimplify_cond_expr (tree *expr_p, gimple_seq *pre_p, fallback_t fallback)
2826 tree expr = *expr_p;
2827 tree tmp, type, arm1, arm2;
2828 enum gimplify_status ret;
2829 tree label_true, label_false, label_cont;
2830 bool have_then_clause_p, have_else_clause_p;
2832 enum tree_code pred_code;
2833 gimple_seq seq = NULL;
2835 type = TREE_TYPE (expr);
2837 /* If this COND_EXPR has a value, copy the values into a temporary within
2839 if (! VOID_TYPE_P (type))
2843 /* If an rvalue is ok or we do not require an lvalue, avoid creating
2844 an addressable temporary. */
2845 if (((fallback & fb_rvalue)
2846 || !(fallback & fb_lvalue))
2847 && !TREE_ADDRESSABLE (type))
2849 if (gimplify_ctxp->allow_rhs_cond_expr
2850 /* If either branch has side effects or could trap, it can't be
2851 evaluated unconditionally. */
2852 && !TREE_SIDE_EFFECTS (TREE_OPERAND (*expr_p, 1))
2853 && !generic_expr_could_trap_p (TREE_OPERAND (*expr_p, 1))
2854 && !TREE_SIDE_EFFECTS (TREE_OPERAND (*expr_p, 2))
2855 && !generic_expr_could_trap_p (TREE_OPERAND (*expr_p, 2)))
2856 return gimplify_pure_cond_expr (expr_p, pre_p);
2858 result = tmp = create_tmp_var (TREE_TYPE (expr), "iftmp");
2863 tree type = build_pointer_type (TREE_TYPE (expr));
2865 if (TREE_TYPE (TREE_OPERAND (expr, 1)) != void_type_node)
2866 TREE_OPERAND (expr, 1) =
2867 build_fold_addr_expr (TREE_OPERAND (expr, 1));
2869 if (TREE_TYPE (TREE_OPERAND (expr, 2)) != void_type_node)
2870 TREE_OPERAND (expr, 2) =
2871 build_fold_addr_expr (TREE_OPERAND (expr, 2));
2873 tmp = create_tmp_var (type, "iftmp");
2875 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (expr, 0),
2876 TREE_OPERAND (expr, 1), TREE_OPERAND (expr, 2));
2878 result = build_fold_indirect_ref (tmp);
2881 /* Build the then clause, 't1 = a;'. But don't build an assignment
2882 if this branch is void; in C++ it can be, if it's a throw. */
2883 if (TREE_TYPE (TREE_OPERAND (expr, 1)) != void_type_node)
2884 TREE_OPERAND (expr, 1)
2885 = build2 (MODIFY_EXPR, TREE_TYPE (tmp), tmp, TREE_OPERAND (expr, 1));
2887 /* Build the else clause, 't1 = b;'. */
2888 if (TREE_TYPE (TREE_OPERAND (expr, 2)) != void_type_node)
2889 TREE_OPERAND (expr, 2)
2890 = build2 (MODIFY_EXPR, TREE_TYPE (tmp), tmp, TREE_OPERAND (expr, 2));
2892 TREE_TYPE (expr) = void_type_node;
2893 recalculate_side_effects (expr);
2895 /* Move the COND_EXPR to the prequeue. */
2896 gimplify_stmt (&expr, pre_p);
2902 /* Make sure the condition has BOOLEAN_TYPE. */
2903 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2905 /* Break apart && and || conditions. */
2906 if (TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ANDIF_EXPR
2907 || TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ORIF_EXPR)
2909 expr = shortcut_cond_expr (expr);
2911 if (expr != *expr_p)
2915 /* We can't rely on gimplify_expr to re-gimplify the expanded
2916 form properly, as cleanups might cause the target labels to be
2917 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2918 set up a conditional context. */
2919 gimple_push_condition ();
2920 gimplify_stmt (expr_p, &seq);
2921 gimple_pop_condition (pre_p);
2922 gimple_seq_add_seq (pre_p, seq);
2928 /* Now do the normal gimplification. */
2930 /* Gimplify condition. */
2931 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL, is_gimple_condexpr,
2933 if (ret == GS_ERROR)
2935 gcc_assert (TREE_OPERAND (expr, 0) != NULL_TREE);
2937 gimple_push_condition ();
2939 have_then_clause_p = have_else_clause_p = false;
2940 if (TREE_OPERAND (expr, 1) != NULL
2941 && TREE_CODE (TREE_OPERAND (expr, 1)) == GOTO_EXPR
2942 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr, 1))) == LABEL_DECL
2943 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr, 1)))
2944 == current_function_decl)
2945 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
2946 have different locations, otherwise we end up with incorrect
2947 location information on the branches. */
2949 || !EXPR_HAS_LOCATION (expr)
2950 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr, 1))
2951 || EXPR_LOCATION (expr) == EXPR_LOCATION (TREE_OPERAND (expr, 1))))
2953 label_true = GOTO_DESTINATION (TREE_OPERAND (expr, 1));
2954 have_then_clause_p = true;
2957 label_true = create_artificial_label ();
2958 if (TREE_OPERAND (expr, 2) != NULL
2959 && TREE_CODE (TREE_OPERAND (expr, 2)) == GOTO_EXPR
2960 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr, 2))) == LABEL_DECL
2961 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr, 2)))
2962 == current_function_decl)
2963 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
2964 have different locations, otherwise we end up with incorrect
2965 location information on the branches. */
2967 || !EXPR_HAS_LOCATION (expr)
2968 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr, 2))
2969 || EXPR_LOCATION (expr) == EXPR_LOCATION (TREE_OPERAND (expr, 2))))
2971 label_false = GOTO_DESTINATION (TREE_OPERAND (expr, 2));
2972 have_else_clause_p = true;
2975 label_false = create_artificial_label ();
2977 gimple_cond_get_ops_from_tree (COND_EXPR_COND (expr), &pred_code, &arm1,
2980 gimple_cond = gimple_build_cond (pred_code, arm1, arm2, label_true,
2983 gimplify_seq_add_stmt (&seq, gimple_cond);
2984 label_cont = NULL_TREE;
2985 if (!have_then_clause_p)
2987 /* For if (...) {} else { code; } put label_true after
2989 if (TREE_OPERAND (expr, 1) == NULL_TREE
2990 && !have_else_clause_p
2991 && TREE_OPERAND (expr, 2) != NULL_TREE)
2992 label_cont = label_true;
2995 gimplify_seq_add_stmt (&seq, gimple_build_label (label_true));
2996 have_then_clause_p = gimplify_stmt (&TREE_OPERAND (expr, 1), &seq);
2997 /* For if (...) { code; } else {} or
2998 if (...) { code; } else goto label; or
2999 if (...) { code; return; } else { ... }
3000 label_cont isn't needed. */
3001 if (!have_else_clause_p
3002 && TREE_OPERAND (expr, 2) != NULL_TREE
3003 && gimple_seq_may_fallthru (seq))
3006 label_cont = create_artificial_label ();
3008 g = gimple_build_goto (label_cont);
3010 /* GIMPLE_COND's are very low level; they have embedded
3011 gotos. This particular embedded goto should not be marked
3012 with the location of the original COND_EXPR, as it would
3013 correspond to the COND_EXPR's condition, not the ELSE or the
3014 THEN arms. To avoid marking it with the wrong location, flag
3015 it as "no location". */
3016 gimple_set_do_not_emit_location (g);
3018 gimplify_seq_add_stmt (&seq, g);
3022 if (!have_else_clause_p)
3024 gimplify_seq_add_stmt (&seq, gimple_build_label (label_false));
3025 have_else_clause_p = gimplify_stmt (&TREE_OPERAND (expr, 2), &seq);
3028 gimplify_seq_add_stmt (&seq, gimple_build_label (label_cont));
3030 gimple_pop_condition (pre_p);
3031 gimple_seq_add_seq (pre_p, seq);
3033 if (ret == GS_ERROR)
3035 else if (have_then_clause_p || have_else_clause_p)
3039 /* Both arms are empty; replace the COND_EXPR with its predicate. */
3040 expr = TREE_OPERAND (expr, 0);
3041 gimplify_stmt (&expr, pre_p);
3048 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3049 a call to __builtin_memcpy. */
3051 static enum gimplify_status
3052 gimplify_modify_expr_to_memcpy (tree *expr_p, tree size, bool want_value,
3055 tree t, to, to_ptr, from, from_ptr;
3058 to = TREE_OPERAND (*expr_p, 0);
3059 from = TREE_OPERAND (*expr_p, 1);
3061 mark_addressable (from);
3062 from_ptr = build_fold_addr_expr (from);
3063 gimplify_arg (&from_ptr, seq_p, EXPR_LOCATION (*expr_p));
3065 mark_addressable (to);
3066 to_ptr = build_fold_addr_expr (to);
3067 gimplify_arg (&to_ptr, seq_p, EXPR_LOCATION (*expr_p));
3069 t = implicit_built_in_decls[BUILT_IN_MEMCPY];
3071 gs = gimple_build_call (t, 3, to_ptr, from_ptr, size);
3075 /* tmp = memcpy() */
3076 t = create_tmp_var (TREE_TYPE (to_ptr), NULL);
3077 gimple_call_set_lhs (gs, t);
3078 gimplify_seq_add_stmt (seq_p, gs);
3080 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (to), t);
3084 gimplify_seq_add_stmt (seq_p, gs);
3089 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3090 a call to __builtin_memset. In this case we know that the RHS is
3091 a CONSTRUCTOR with an empty element list. */
3093 static enum gimplify_status
3094 gimplify_modify_expr_to_memset (tree *expr_p, tree size, bool want_value,
3097 tree t, from, to, to_ptr;
3100 /* Assert our assumptions, to abort instead of producing wrong code
3101 silently if they are not met. Beware that the RHS CONSTRUCTOR might
3102 not be immediately exposed. */
3103 from = TREE_OPERAND (*expr_p, 1);
3104 if (TREE_CODE (from) == WITH_SIZE_EXPR)
3105 from = TREE_OPERAND (from, 0);
3107 gcc_assert (TREE_CODE (from) == CONSTRUCTOR
3108 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (from)));
3111 to = TREE_OPERAND (*expr_p, 0);
3113 to_ptr = build_fold_addr_expr (to);
3114 gimplify_arg (&to_ptr, seq_p, EXPR_LOCATION (*expr_p));
3115 t = implicit_built_in_decls[BUILT_IN_MEMSET];
3117 gs = gimple_build_call (t, 3, to_ptr, integer_zero_node, size);
3121 /* tmp = memset() */
3122 t = create_tmp_var (TREE_TYPE (to_ptr), NULL);
3123 gimple_call_set_lhs (gs, t);
3124 gimplify_seq_add_stmt (seq_p, gs);
3126 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (to), t);
3130 gimplify_seq_add_stmt (seq_p, gs);
3135 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
3136 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
3137 assignment. Returns non-null if we detect a potential overlap. */
3139 struct gimplify_init_ctor_preeval_data
3141 /* The base decl of the lhs object. May be NULL, in which case we
3142 have to assume the lhs is indirect. */
3145 /* The alias set of the lhs object. */
3146 alias_set_type lhs_alias_set;
3150 gimplify_init_ctor_preeval_1 (tree *tp, int *walk_subtrees, void *xdata)
3152 struct gimplify_init_ctor_preeval_data *data
3153 = (struct gimplify_init_ctor_preeval_data *) xdata;
3156 /* If we find the base object, obviously we have overlap. */
3157 if (data->lhs_base_decl == t)
3160 /* If the constructor component is indirect, determine if we have a
3161 potential overlap with the lhs. The only bits of information we
3162 have to go on at this point are addressability and alias sets. */
3163 if (TREE_CODE (t) == INDIRECT_REF
3164 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
3165 && alias_sets_conflict_p (data->lhs_alias_set, get_alias_set (t)))
3168 /* If the constructor component is a call, determine if it can hide a
3169 potential overlap with the lhs through an INDIRECT_REF like above. */
3170 if (TREE_CODE (t) == CALL_EXPR)
3172 tree type, fntype = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (t)));
3174 for (type = TYPE_ARG_TYPES (fntype); type; type = TREE_CHAIN (type))
3175 if (POINTER_TYPE_P (TREE_VALUE (type))
3176 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
3177 && alias_sets_conflict_p (data->lhs_alias_set,
3179 (TREE_TYPE (TREE_VALUE (type)))))
3183 if (IS_TYPE_OR_DECL_P (t))
3188 /* A subroutine of gimplify_init_constructor. Pre-evaluate EXPR,
3189 force values that overlap with the lhs (as described by *DATA)
3190 into temporaries. */
3193 gimplify_init_ctor_preeval (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
3194 struct gimplify_init_ctor_preeval_data *data)
3196 enum gimplify_status one;
3198 /* If the value is constant, then there's nothing to pre-evaluate. */
3199 if (TREE_CONSTANT (*expr_p))
3201 /* Ensure it does not have side effects, it might contain a reference to
3202 the object we're initializing. */
3203 gcc_assert (!TREE_SIDE_EFFECTS (*expr_p));
3207 /* If the type has non-trivial constructors, we can't pre-evaluate. */
3208 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p)))
3211 /* Recurse for nested constructors. */
3212 if (TREE_CODE (*expr_p) == CONSTRUCTOR)
3214 unsigned HOST_WIDE_INT ix;
3215 constructor_elt *ce;
3216 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (*expr_p);
3218 for (ix = 0; VEC_iterate (constructor_elt, v, ix, ce); ix++)
3219 gimplify_init_ctor_preeval (&ce->value, pre_p, post_p, data);
3224 /* If this is a variable sized type, we must remember the size. */
3225 maybe_with_size_expr (expr_p);
3227 /* Gimplify the constructor element to something appropriate for the rhs
3228 of a MODIFY_EXPR. Given that we know the LHS is an aggregate, we know
3229 the gimplifier will consider this a store to memory. Doing this
3230 gimplification now means that we won't have to deal with complicated
3231 language-specific trees, nor trees like SAVE_EXPR that can induce
3232 exponential search behavior. */
3233 one = gimplify_expr (expr_p, pre_p, post_p, is_gimple_mem_rhs, fb_rvalue);
3234 if (one == GS_ERROR)
3240 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
3241 with the lhs, since "a = { .x=a }" doesn't make sense. This will
3242 always be true for all scalars, since is_gimple_mem_rhs insists on a
3243 temporary variable for them. */
3244 if (DECL_P (*expr_p))
3247 /* If this is of variable size, we have no choice but to assume it doesn't
3248 overlap since we can't make a temporary for it. */
3249 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (*expr_p))) != INTEGER_CST)
3252 /* Otherwise, we must search for overlap ... */
3253 if (!walk_tree (expr_p, gimplify_init_ctor_preeval_1, data, NULL))
3256 /* ... and if found, force the value into a temporary. */
3257 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
3260 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
3261 a RANGE_EXPR in a CONSTRUCTOR for an array.
3265 object[var] = value;
3272 We increment var _after_ the loop exit check because we might otherwise
3273 fail if upper == TYPE_MAX_VALUE (type for upper).
3275 Note that we never have to deal with SAVE_EXPRs here, because this has
3276 already been taken care of for us, in gimplify_init_ctor_preeval(). */
3278 static void gimplify_init_ctor_eval (tree, VEC(constructor_elt,gc) *,
3279 gimple_seq *, bool);
3282 gimplify_init_ctor_eval_range (tree object, tree lower, tree upper,
3283 tree value, tree array_elt_type,
3284 gimple_seq *pre_p, bool cleared)
3286 tree loop_entry_label, loop_exit_label, fall_thru_label;
3287 tree var, var_type, cref, tmp;
3289 loop_entry_label = create_artificial_label ();
3290 loop_exit_label = create_artificial_label ();
3291 fall_thru_label = create_artificial_label ();
3293 /* Create and initialize the index variable. */
3294 var_type = TREE_TYPE (upper);
3295 var = create_tmp_var (var_type, NULL);
3296 gimplify_seq_add_stmt (pre_p, gimple_build_assign (var, lower));
3298 /* Add the loop entry label. */
3299 gimplify_seq_add_stmt (pre_p, gimple_build_label (loop_entry_label));
3301 /* Build the reference. */
3302 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
3303 var, NULL_TREE, NULL_TREE);
3305 /* If we are a constructor, just call gimplify_init_ctor_eval to do
3306 the store. Otherwise just assign value to the reference. */
3308 if (TREE_CODE (value) == CONSTRUCTOR)
3309 /* NB we might have to call ourself recursively through
3310 gimplify_init_ctor_eval if the value is a constructor. */
3311 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
3314 gimplify_seq_add_stmt (pre_p, gimple_build_assign (cref, value));
3316 /* We exit the loop when the index var is equal to the upper bound. */
3317 gimplify_seq_add_stmt (pre_p,
3318 gimple_build_cond (EQ_EXPR, var, upper,
3319 loop_exit_label, fall_thru_label));
3321 gimplify_seq_add_stmt (pre_p, gimple_build_label (fall_thru_label));
3323 /* Otherwise, increment the index var... */
3324 tmp = build2 (PLUS_EXPR, var_type, var,
3325 fold_convert (var_type, integer_one_node));
3326 gimplify_seq_add_stmt (pre_p, gimple_build_assign (var, tmp));
3328 /* ...and jump back to the loop entry. */
3329 gimplify_seq_add_stmt (pre_p, gimple_build_goto (loop_entry_label));
3331 /* Add the loop exit label. */
3332 gimplify_seq_add_stmt (pre_p, gimple_build_label (loop_exit_label));
3335 /* Return true if FDECL is accessing a field that is zero sized. */
3338 zero_sized_field_decl (const_tree fdecl)
3340 if (TREE_CODE (fdecl) == FIELD_DECL && DECL_SIZE (fdecl)
3341 && integer_zerop (DECL_SIZE (fdecl)))
3346 /* Return true if TYPE is zero sized. */
3349 zero_sized_type (const_tree type)
3351 if (AGGREGATE_TYPE_P (type) && TYPE_SIZE (type)
3352 && integer_zerop (TYPE_SIZE (type)))
3357 /* A subroutine of gimplify_init_constructor. Generate individual
3358 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
3359 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
3360 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
3364 gimplify_init_ctor_eval (tree object, VEC(constructor_elt,gc) *elts,
3365 gimple_seq *pre_p, bool cleared)
3367 tree array_elt_type = NULL;
3368 unsigned HOST_WIDE_INT ix;
3369 tree purpose, value;
3371 if (TREE_CODE (TREE_TYPE (object)) == ARRAY_TYPE)
3372 array_elt_type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object)));
3374 FOR_EACH_CONSTRUCTOR_ELT (elts, ix, purpose, value)
3378 /* NULL values are created above for gimplification errors. */
3382 if (cleared && initializer_zerop (value))
3385 /* ??? Here's to hoping the front end fills in all of the indices,
3386 so we don't have to figure out what's missing ourselves. */
3387 gcc_assert (purpose);
3389 /* Skip zero-sized fields, unless value has side-effects. This can
3390 happen with calls to functions returning a zero-sized type, which
3391 we shouldn't discard. As a number of downstream passes don't
3392 expect sets of zero-sized fields, we rely on the gimplification of
3393 the MODIFY_EXPR we make below to drop the assignment statement. */
3394 if (! TREE_SIDE_EFFECTS (value) && zero_sized_field_decl (purpose))
3397 /* If we have a RANGE_EXPR, we have to build a loop to assign the
3399 if (TREE_CODE (purpose) == RANGE_EXPR)
3401 tree lower = TREE_OPERAND (purpose, 0);
3402 tree upper = TREE_OPERAND (purpose, 1);
3404 /* If the lower bound is equal to upper, just treat it as if
3405 upper was the index. */
3406 if (simple_cst_equal (lower, upper))
3410 gimplify_init_ctor_eval_range (object, lower, upper, value,
3411 array_elt_type, pre_p, cleared);
3418 /* Do not use bitsizetype for ARRAY_REF indices. */
3419 if (TYPE_DOMAIN (TREE_TYPE (object)))
3420 purpose = fold_convert (TREE_TYPE (TYPE_DOMAIN (TREE_TYPE (object))),
3422 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
3423 purpose, NULL_TREE, NULL_TREE);
3427 gcc_assert (TREE_CODE (purpose) == FIELD_DECL);
3428 cref = build3 (COMPONENT_REF, TREE_TYPE (purpose),
3429 unshare_expr (object), purpose, NULL_TREE);
3432 if (TREE_CODE (value) == CONSTRUCTOR
3433 && TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE)
3434 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
3438 tree init = build2 (INIT_EXPR, TREE_TYPE (cref), cref, value);
3439 gimplify_and_add (init, pre_p);
3446 /* Returns the appropriate RHS predicate for this LHS. */
3449 rhs_predicate_for (tree lhs)
3451 if (is_gimple_formal_tmp_var (lhs))
3452 return is_gimple_formal_tmp_or_call_rhs;
3453 else if (is_gimple_reg (lhs))
3454 return is_gimple_reg_or_call_rhs;
3456 return is_gimple_mem_or_call_rhs;
3460 /* A subroutine of gimplify_modify_expr. Break out elements of a
3461 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
3463 Note that we still need to clear any elements that don't have explicit
3464 initializers, so if not all elements are initialized we keep the
3465 original MODIFY_EXPR, we just remove all of the constructor elements.
3467 If NOTIFY_TEMP_CREATION is true, do not gimplify, just return
3468 GS_ERROR if we would have to create a temporary when gimplifying
3469 this constructor. Otherwise, return GS_OK.
3471 If NOTIFY_TEMP_CREATION is false, just do the gimplification. */
3473 static enum gimplify_status
3474 gimplify_init_constructor (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
3475 bool want_value, bool notify_temp_creation)
3478 tree ctor = TREE_OPERAND (*expr_p, 1);
3479 tree type = TREE_TYPE (ctor);
3480 enum gimplify_status ret;
3481 VEC(constructor_elt,gc) *elts;
3483 if (TREE_CODE (ctor) != CONSTRUCTOR)
3484 return GS_UNHANDLED;
3486 if (!notify_temp_creation)
3488 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3489 is_gimple_lvalue, fb_lvalue);
3490 if (ret == GS_ERROR)
3494 object = TREE_OPERAND (*expr_p, 0);
3495 elts = CONSTRUCTOR_ELTS (ctor);
3498 switch (TREE_CODE (type))
3502 case QUAL_UNION_TYPE:
3505 struct gimplify_init_ctor_preeval_data preeval_data;
3506 HOST_WIDE_INT num_type_elements, num_ctor_elements;
3507 HOST_WIDE_INT num_nonzero_elements;
3508 bool cleared, valid_const_initializer;
3510 /* Aggregate types must lower constructors to initialization of
3511 individual elements. The exception is that a CONSTRUCTOR node
3512 with no elements indicates zero-initialization of the whole. */
3513 if (VEC_empty (constructor_elt, elts))
3515 if (notify_temp_creation)
3520 /* Fetch information about the constructor to direct later processing.
3521 We might want to make static versions of it in various cases, and
3522 can only do so if it known to be a valid constant initializer. */
3523 valid_const_initializer
3524 = categorize_ctor_elements (ctor, &num_nonzero_elements,
3525 &num_ctor_elements, &cleared);
3527 /* If a const aggregate variable is being initialized, then it
3528 should never be a lose to promote the variable to be static. */
3529 if (valid_const_initializer
3530 && num_nonzero_elements > 1
3531 && TREE_READONLY (object)
3532 && TREE_CODE (object) == VAR_DECL
3533 && (flag_merge_constants >= 2 || !TREE_ADDRESSABLE (object)))
3535 if (notify_temp_creation)
3537 DECL_INITIAL (object) = ctor;
3538 TREE_STATIC (object) = 1;
3539 if (!DECL_NAME (object))
3540 DECL_NAME (object) = create_tmp_var_name ("C");
3541 walk_tree (&DECL_INITIAL (object), force_labels_r, NULL, NULL);
3543 /* ??? C++ doesn't automatically append a .<number> to the
3544 assembler name, and even when it does, it looks a FE private
3545 data structures to figure out what that number should be,
3546 which are not set for this variable. I suppose this is
3547 important for local statics for inline functions, which aren't
3548 "local" in the object file sense. So in order to get a unique
3549 TU-local symbol, we must invoke the lhd version now. */
3550 lhd_set_decl_assembler_name (object);
3552 *expr_p = NULL_TREE;
3556 /* If there are "lots" of initialized elements, even discounting
3557 those that are not address constants (and thus *must* be
3558 computed at runtime), then partition the constructor into
3559 constant and non-constant parts. Block copy the constant
3560 parts in, then generate code for the non-constant parts. */
3561 /* TODO. There's code in cp/typeck.c to do this. */
3563 num_type_elements = count_type_elements (type, true);
3565 /* If count_type_elements could not determine number of type elements
3566 for a constant-sized object, assume clearing is needed.
3567 Don't do this for variable-sized objects, as store_constructor
3568 will ignore the clearing of variable-sized objects. */
3569 if (num_type_elements < 0 && int_size_in_bytes (type) >= 0)
3571 /* If there are "lots" of zeros, then block clear the object first. */
3572 else if (num_type_elements - num_nonzero_elements
3573 > CLEAR_RATIO (optimize_function_for_speed_p (cfun))
3574 && num_nonzero_elements < num_type_elements/4)
3576 /* ??? This bit ought not be needed. For any element not present
3577 in the initializer, we should simply set them to zero. Except
3578 we'd need to *find* the elements that are not present, and that
3579 requires trickery to avoid quadratic compile-time behavior in
3580 large cases or excessive memory use in small cases. */
3581 else if (num_ctor_elements < num_type_elements)
3584 /* If there are "lots" of initialized elements, and all of them
3585 are valid address constants, then the entire initializer can
3586 be dropped to memory, and then memcpy'd out. Don't do this
3587 for sparse arrays, though, as it's more efficient to follow
3588 the standard CONSTRUCTOR behavior of memset followed by
3589 individual element initialization. Also don't do this for small
3590 all-zero initializers (which aren't big enough to merit
3591 clearing), and don't try to make bitwise copies of
3592 TREE_ADDRESSABLE types. */
3593 if (valid_const_initializer
3594 && !(cleared || num_nonzero_elements == 0)
3595 && !TREE_ADDRESSABLE (type))
3597 HOST_WIDE_INT size = int_size_in_bytes (type);
3600 /* ??? We can still get unbounded array types, at least
3601 from the C++ front end. This seems wrong, but attempt
3602 to work around it for now. */
3605 size = int_size_in_bytes (TREE_TYPE (object));
3607 TREE_TYPE (ctor) = type = TREE_TYPE (object);
3610 /* Find the maximum alignment we can assume for the object. */
3611 /* ??? Make use of DECL_OFFSET_ALIGN. */
3612 if (DECL_P (object))
3613 align = DECL_ALIGN (object);
3615 align = TYPE_ALIGN (type);
3618 && num_nonzero_elements > 1
3619 && !can_move_by_pieces (size, align))
3623 if (notify_temp_creation)
3626 new_tree = create_tmp_var_raw (type, "C");
3628 gimple_add_tmp_var (new_tree);
3629 TREE_STATIC (new_tree) = 1;
3630 TREE_READONLY (new_tree) = 1;
3631 DECL_INITIAL (new_tree) = ctor;
3632 if (align > DECL_ALIGN (new_tree))
3634 DECL_ALIGN (new_tree) = align;
3635 DECL_USER_ALIGN (new_tree) = 1;
3637 walk_tree (&DECL_INITIAL (new_tree), force_labels_r, NULL, NULL);
3639 TREE_OPERAND (*expr_p, 1) = new_tree;
3641 /* This is no longer an assignment of a CONSTRUCTOR, but
3642 we still may have processing to do on the LHS. So
3643 pretend we didn't do anything here to let that happen. */
3644 return GS_UNHANDLED;
3648 if (notify_temp_creation)
3651 /* If there are nonzero elements, pre-evaluate to capture elements
3652 overlapping with the lhs into temporaries. We must do this before
3653 clearing to fetch the values before they are zeroed-out. */
3654 if (num_nonzero_elements > 0)
3656 preeval_data.lhs_base_decl = get_base_address (object);
3657 if (!DECL_P (preeval_data.lhs_base_decl))
3658 preeval_data.lhs_base_decl = NULL;
3659 preeval_data.lhs_alias_set = get_alias_set (object);
3661 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p, 1),
3662 pre_p, post_p, &preeval_data);
3667 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3668 Note that we still have to gimplify, in order to handle the
3669 case of variable sized types. Avoid shared tree structures. */
3670 CONSTRUCTOR_ELTS (ctor) = NULL;
3671 TREE_SIDE_EFFECTS (ctor) = 0;
3672 object = unshare_expr (object);
3673 gimplify_stmt (expr_p, pre_p);
3676 /* If we have not block cleared the object, or if there are nonzero
3677 elements in the constructor, add assignments to the individual
3678 scalar fields of the object. */
3679 if (!cleared || num_nonzero_elements > 0)
3680 gimplify_init_ctor_eval (object, elts, pre_p, cleared);
3682 *expr_p = NULL_TREE;
3690 if (notify_temp_creation)
3693 /* Extract the real and imaginary parts out of the ctor. */
3694 gcc_assert (VEC_length (constructor_elt, elts) == 2);
3695 r = VEC_index (constructor_elt, elts, 0)->value;
3696 i = VEC_index (constructor_elt, elts, 1)->value;
3697 if (r == NULL || i == NULL)
3699 tree zero = fold_convert (TREE_TYPE (type), integer_zero_node);
3706 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3707 represent creation of a complex value. */
3708 if (TREE_CONSTANT (r) && TREE_CONSTANT (i))
3710 ctor = build_complex (type, r, i);
3711 TREE_OPERAND (*expr_p, 1) = ctor;
3715 ctor = build2 (COMPLEX_EXPR, type, r, i);
3716 TREE_OPERAND (*expr_p, 1) = ctor;
3717 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 1),
3720 rhs_predicate_for (TREE_OPERAND (*expr_p, 0)),
3728 unsigned HOST_WIDE_INT ix;
3729 constructor_elt *ce;
3731 if (notify_temp_creation)
3734 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3735 if (TREE_CONSTANT (ctor))
3737 bool constant_p = true;
3740 /* Even when ctor is constant, it might contain non-*_CST
3741 elements, such as addresses or trapping values like
3742 1.0/0.0 - 1.0/0.0. Such expressions don't belong
3743 in VECTOR_CST nodes. */
3744 FOR_EACH_CONSTRUCTOR_VALUE (elts, ix, value)
3745 if (!CONSTANT_CLASS_P (value))
3753 TREE_OPERAND (*expr_p, 1) = build_vector_from_ctor (type, elts);
3757 /* Don't reduce an initializer constant even if we can't
3758 make a VECTOR_CST. It won't do anything for us, and it'll
3759 prevent us from representing it as a single constant. */
3760 if (initializer_constant_valid_p (ctor, type))
3763 TREE_CONSTANT (ctor) = 0;
3766 /* Vector types use CONSTRUCTOR all the way through gimple
3767 compilation as a general initializer. */
3768 for (ix = 0; VEC_iterate (constructor_elt, elts, ix, ce); ix++)
3770 enum gimplify_status tret;
3771 tret = gimplify_expr (&ce->value, pre_p, post_p, is_gimple_val,
3773 if (tret == GS_ERROR)
3776 if (!is_gimple_reg (TREE_OPERAND (*expr_p, 0)))
3777 TREE_OPERAND (*expr_p, 1) = get_formal_tmp_var (ctor, pre_p);
3782 /* So how did we get a CONSTRUCTOR for a scalar type? */
3786 if (ret == GS_ERROR)
3788 else if (want_value)
3795 /* If we have gimplified both sides of the initializer but have
3796 not emitted an assignment, do so now. */
3799 tree lhs = TREE_OPERAND (*expr_p, 0);
3800 tree rhs = TREE_OPERAND (*expr_p, 1);
3801 gimple init = gimple_build_assign (lhs, rhs);
3802 gimplify_seq_add_stmt (pre_p, init);
3810 /* Given a pointer value OP0, return a simplified version of an
3811 indirection through OP0, or NULL_TREE if no simplification is
3812 possible. Note that the resulting type may be different from
3813 the type pointed to in the sense that it is still compatible
3814 from the langhooks point of view. */
3817 gimple_fold_indirect_ref (tree t)
3819 tree type = TREE_TYPE (TREE_TYPE (t));
3823 STRIP_USELESS_TYPE_CONVERSION (sub);
3824 subtype = TREE_TYPE (sub);
3825 if (!POINTER_TYPE_P (subtype))
3828 if (TREE_CODE (sub) == ADDR_EXPR)
3830 tree op = TREE_OPERAND (sub, 0);
3831 tree optype = TREE_TYPE (op);
3833 if (useless_type_conversion_p (type, optype))
3836 /* *(foo *)&fooarray => fooarray[0] */
3837 if (TREE_CODE (optype) == ARRAY_TYPE
3838 && useless_type_conversion_p (type, TREE_TYPE (optype)))
3840 tree type_domain = TYPE_DOMAIN (optype);
3841 tree min_val = size_zero_node;
3842 if (type_domain && TYPE_MIN_VALUE (type_domain))
3843 min_val = TYPE_MIN_VALUE (type_domain);
3844 return build4 (ARRAY_REF, type, op, min_val, NULL_TREE, NULL_TREE);
3848 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
3849 if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
3850 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (subtype))))
3853 tree min_val = size_zero_node;
3855 sub = gimple_fold_indirect_ref (sub);
3857 sub = build1 (INDIRECT_REF, TREE_TYPE (subtype), osub);
3858 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
3859 if (type_domain && TYPE_MIN_VALUE (type_domain))
3860 min_val = TYPE_MIN_VALUE (type_domain);
3861 return build4 (ARRAY_REF, type, sub, min_val, NULL_TREE, NULL_TREE);
3867 /* Given a pointer value OP0, return a simplified version of an
3868 indirection through OP0, or NULL_TREE if no simplification is
3869 possible. This may only be applied to a rhs of an expression.
3870 Note that the resulting type may be different from the type pointed
3871 to in the sense that it is still compatible from the langhooks
3875 gimple_fold_indirect_ref_rhs (tree t)
3877 return gimple_fold_indirect_ref (t);
3880 /* Subroutine of gimplify_modify_expr to do simplifications of
3881 MODIFY_EXPRs based on the code of the RHS. We loop for as long as
3882 something changes. */
3884 static enum gimplify_status
3885 gimplify_modify_expr_rhs (tree *expr_p, tree *from_p, tree *to_p,
3886 gimple_seq *pre_p, gimple_seq *post_p,
3889 enum gimplify_status ret = GS_OK;
3891 while (ret != GS_UNHANDLED)
3892 switch (TREE_CODE (*from_p))
3895 /* If we're assigning from a constant constructor, move the
3896 constructor expression to the RHS of the MODIFY_EXPR. */
3897 if (DECL_INITIAL (*from_p)
3898 && TREE_READONLY (*from_p)
3899 && !TREE_THIS_VOLATILE (*from_p)
3900 && TREE_CODE (DECL_INITIAL (*from_p)) == CONSTRUCTOR)
3902 tree old_from = *from_p;
3904 /* Move the constructor into the RHS. */
3905 *from_p = unshare_expr (DECL_INITIAL (*from_p));
3907 /* Let's see if gimplify_init_constructor will need to put
3908 it in memory. If so, revert the change. */
3909 ret = gimplify_init_constructor (expr_p, NULL, NULL, false, true);
3910 if (ret == GS_ERROR)
3925 /* If we have code like
3929 where the type of "x" is a (possibly cv-qualified variant
3930 of "A"), treat the entire expression as identical to "x".
3931 This kind of code arises in C++ when an object is bound
3932 to a const reference, and if "x" is a TARGET_EXPR we want
3933 to take advantage of the optimization below. */
3934 tree t = gimple_fold_indirect_ref_rhs (TREE_OPERAND (*from_p, 0));
3947 /* If we are initializing something from a TARGET_EXPR, strip the
3948 TARGET_EXPR and initialize it directly, if possible. This can't
3949 be done if the initializer is void, since that implies that the
3950 temporary is set in some non-trivial way.
3952 ??? What about code that pulls out the temp and uses it
3953 elsewhere? I think that such code never uses the TARGET_EXPR as
3954 an initializer. If I'm wrong, we'll die because the temp won't
3955 have any RTL. In that case, I guess we'll need to replace
3956 references somehow. */
3957 tree init = TARGET_EXPR_INITIAL (*from_p);
3960 && !VOID_TYPE_P (TREE_TYPE (init)))
3971 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
3973 gimplify_compound_expr (from_p, pre_p, true);
3978 /* If we're initializing from a CONSTRUCTOR, break this into
3979 individual MODIFY_EXPRs. */
3980 return gimplify_init_constructor (expr_p, pre_p, post_p, want_value,
3984 /* If we're assigning to a non-register type, push the assignment
3985 down into the branches. This is mandatory for ADDRESSABLE types,
3986 since we cannot generate temporaries for such, but it saves a
3987 copy in other cases as well. */
3988 if (!is_gimple_reg_type (TREE_TYPE (*from_p)))
3990 /* This code should mirror the code in gimplify_cond_expr. */
3991 enum tree_code code = TREE_CODE (*expr_p);
3992 tree cond = *from_p;
3993 tree result = *to_p;
3995 ret = gimplify_expr (&result, pre_p, post_p,
3996 is_gimple_lvalue, fb_lvalue);
3997 if (ret != GS_ERROR)
4000 if (TREE_TYPE (TREE_OPERAND (cond, 1)) != void_type_node)
4001 TREE_OPERAND (cond, 1)
4002 = build2 (code, void_type_node, result,
4003 TREE_OPERAND (cond, 1));
4004 if (TREE_TYPE (TREE_OPERAND (cond, 2)) != void_type_node)
4005 TREE_OPERAND (cond, 2)
4006 = build2 (code, void_type_node, unshare_expr (result),
4007 TREE_OPERAND (cond, 2));
4009 TREE_TYPE (cond) = void_type_node;
4010 recalculate_side_effects (cond);
4014 gimplify_and_add (cond, pre_p);
4015 *expr_p = unshare_expr (result);
4026 /* For calls that return in memory, give *to_p as the CALL_EXPR's
4027 return slot so that we don't generate a temporary. */
4028 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p)
4029 && aggregate_value_p (*from_p, *from_p))
4033 if (!(rhs_predicate_for (*to_p))(*from_p))
4034 /* If we need a temporary, *to_p isn't accurate. */
4036 else if (TREE_CODE (*to_p) == RESULT_DECL
4037 && DECL_NAME (*to_p) == NULL_TREE
4038 && needs_to_live_in_memory (*to_p))
4039 /* It's OK to use the return slot directly unless it's an NRV. */
4041 else if (is_gimple_reg_type (TREE_TYPE (*to_p))
4042 || (DECL_P (*to_p) && DECL_REGISTER (*to_p)))
4043 /* Don't force regs into memory. */
4045 else if (TREE_CODE (*to_p) == VAR_DECL
4046 && DECL_GIMPLE_FORMAL_TEMP_P (*to_p))
4047 /* Don't use the original target if it's a formal temp; we
4048 don't want to take their addresses. */
4050 else if (TREE_CODE (*expr_p) == INIT_EXPR)
4051 /* It's OK to use the target directly if it's being
4054 else if (!is_gimple_non_addressable (*to_p))
4055 /* Don't use the original target if it's already addressable;
4056 if its address escapes, and the called function uses the
4057 NRV optimization, a conforming program could see *to_p
4058 change before the called function returns; see c++/19317.
4059 When optimizing, the return_slot pass marks more functions
4060 as safe after we have escape info. */
4067 CALL_EXPR_RETURN_SLOT_OPT (*from_p) = 1;
4068 mark_addressable (*to_p);
4075 /* If we're initializing from a container, push the initialization
4077 case CLEANUP_POINT_EXPR:
4079 case STATEMENT_LIST:
4081 tree wrap = *from_p;
4084 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_min_lval,
4086 if (ret != GS_ERROR)
4089 t = voidify_wrapper_expr (wrap, *expr_p);
4090 gcc_assert (t == *expr_p);
4094 gimplify_and_add (wrap, pre_p);
4095 *expr_p = unshare_expr (*to_p);
4111 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
4112 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
4113 DECL_GIMPLE_REG_P set.
4115 IMPORTANT NOTE: This promotion is performed by introducing a load of the
4116 other, unmodified part of the complex object just before the total store.
4117 As a consequence, if the object is still uninitialized, an undefined value
4118 will be loaded into a register, which may result in a spurious exception
4119 if the register is floating-point and the value happens to be a signaling
4120 NaN for example. Then the fully-fledged complex operations lowering pass
4121 followed by a DCE pass are necessary in order to fix things up. */
4123 static enum gimplify_status
4124 gimplify_modify_expr_complex_part (tree *expr_p, gimple_seq *pre_p,
4127 enum tree_code code, ocode;
4128 tree lhs, rhs, new_rhs, other, realpart, imagpart;
4130 lhs = TREE_OPERAND (*expr_p, 0);
4131 rhs = TREE_OPERAND (*expr_p, 1);
4132 code = TREE_CODE (lhs);
4133 lhs = TREE_OPERAND (lhs, 0);
4135 ocode = code == REALPART_EXPR ? IMAGPART_EXPR : REALPART_EXPR;
4136 other = build1 (ocode, TREE_TYPE (rhs), lhs);
4137 other = get_formal_tmp_var (other, pre_p);
4139 realpart = code == REALPART_EXPR ? rhs : other;
4140 imagpart = code == REALPART_EXPR ? other : rhs;
4142 if (TREE_CONSTANT (realpart) && TREE_CONSTANT (imagpart))
4143 new_rhs = build_complex (TREE_TYPE (lhs), realpart, imagpart);
4145 new_rhs = build2 (COMPLEX_EXPR, TREE_TYPE (lhs), realpart, imagpart);
4147 gimplify_seq_add_stmt (pre_p, gimple_build_assign (lhs, new_rhs));
4148 *expr_p = (want_value) ? rhs : NULL_TREE;
4154 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
4160 PRE_P points to the list where side effects that must happen before
4161 *EXPR_P should be stored.
4163 POST_P points to the list where side effects that must happen after
4164 *EXPR_P should be stored.
4166 WANT_VALUE is nonzero iff we want to use the value of this expression
4167 in another expression. */
4169 static enum gimplify_status
4170 gimplify_modify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
4173 tree *from_p = &TREE_OPERAND (*expr_p, 1);
4174 tree *to_p = &TREE_OPERAND (*expr_p, 0);
4175 enum gimplify_status ret = GS_UNHANDLED;
4178 gcc_assert (TREE_CODE (*expr_p) == MODIFY_EXPR
4179 || TREE_CODE (*expr_p) == INIT_EXPR);
4181 /* Insert pointer conversions required by the middle-end that are not
4182 required by the frontend. This fixes middle-end type checking for
4183 for example gcc.dg/redecl-6.c. */
4184 if (POINTER_TYPE_P (TREE_TYPE (*to_p))
4185 && lang_hooks.types_compatible_p (TREE_TYPE (*to_p), TREE_TYPE (*from_p)))
4187 STRIP_USELESS_TYPE_CONVERSION (*from_p);
4188 if (!useless_type_conversion_p (TREE_TYPE (*to_p), TREE_TYPE (*from_p)))
4189 *from_p = fold_convert (TREE_TYPE (*to_p), *from_p);
4192 /* See if any simplifications can be done based on what the RHS is. */
4193 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
4195 if (ret != GS_UNHANDLED)
4198 /* For zero sized types only gimplify the left hand side and right hand
4199 side as statements and throw away the assignment. Do this after
4200 gimplify_modify_expr_rhs so we handle TARGET_EXPRs of addressable
4202 if (zero_sized_type (TREE_TYPE (*from_p)) && !want_value)
4204 gimplify_stmt (from_p, pre_p);
4205 gimplify_stmt (to_p, pre_p);
4206 *expr_p = NULL_TREE;
4210 /* If the value being copied is of variable width, compute the length
4211 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
4212 before gimplifying any of the operands so that we can resolve any
4213 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
4214 the size of the expression to be copied, not of the destination, so
4215 that is what we must do here. */
4216 maybe_with_size_expr (from_p);
4218 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
4219 if (ret == GS_ERROR)
4222 /* As a special case, we have to temporarily allow for assignments
4223 with a CALL_EXPR on the RHS. Since in GIMPLE a function call is
4224 a toplevel statement, when gimplifying the GENERIC expression
4225 MODIFY_EXPR <a, CALL_EXPR <foo>>, we cannot create the tuple
4226 GIMPLE_ASSIGN <a, GIMPLE_CALL <foo>>.
4228 Instead, we need to create the tuple GIMPLE_CALL <a, foo>. To
4229 prevent gimplify_expr from trying to create a new temporary for
4230 foo's LHS, we tell it that it should only gimplify until it
4231 reaches the CALL_EXPR. On return from gimplify_expr, the newly
4232 created GIMPLE_CALL <foo> will be the last statement in *PRE_P
4233 and all we need to do here is set 'a' to be its LHS. */
4234 ret = gimplify_expr (from_p, pre_p, post_p, rhs_predicate_for (*to_p),
4236 if (ret == GS_ERROR)
4239 /* Now see if the above changed *from_p to something we handle specially. */
4240 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
4242 if (ret != GS_UNHANDLED)
4245 /* If we've got a variable sized assignment between two lvalues (i.e. does
4246 not involve a call), then we can make things a bit more straightforward
4247 by converting the assignment to memcpy or memset. */
4248 if (TREE_CODE (*from_p) == WITH_SIZE_EXPR)
4250 tree from = TREE_OPERAND (*from_p, 0);
4251 tree size = TREE_OPERAND (*from_p, 1);
4253 if (TREE_CODE (from) == CONSTRUCTOR)
4254 return gimplify_modify_expr_to_memset (expr_p, size, want_value, pre_p);
4256 if (is_gimple_addressable (from))
4259 return gimplify_modify_expr_to_memcpy (expr_p, size, want_value,
4264 /* Transform partial stores to non-addressable complex variables into
4265 total stores. This allows us to use real instead of virtual operands
4266 for these variables, which improves optimization. */
4267 if ((TREE_CODE (*to_p) == REALPART_EXPR
4268 || TREE_CODE (*to_p) == IMAGPART_EXPR)
4269 && is_gimple_reg (TREE_OPERAND (*to_p, 0)))
4270 return gimplify_modify_expr_complex_part (expr_p, pre_p, want_value);
4272 /* Try to alleviate the effects of the gimplification creating artificial
4273 temporaries (see for example is_gimple_reg_rhs) on the debug info. */
4274 if (!gimplify_ctxp->into_ssa
4276 && DECL_IGNORED_P (*from_p)
4278 && !DECL_IGNORED_P (*to_p))
4280 if (!DECL_NAME (*from_p) && DECL_NAME (*to_p))
4282 = create_tmp_var_name (IDENTIFIER_POINTER (DECL_NAME (*to_p)));
4283 DECL_DEBUG_EXPR_IS_FROM (*from_p) = 1;
4284 SET_DECL_DEBUG_EXPR (*from_p, *to_p);
4287 if (TREE_CODE (*from_p) == CALL_EXPR)
4289 /* Since the RHS is a CALL_EXPR, we need to create a GIMPLE_CALL
4290 instead of a GIMPLE_ASSIGN. */
4291 assign = gimple_build_call_from_tree (*from_p);
4292 gimple_call_set_lhs (assign, *to_p);
4295 assign = gimple_build_assign (*to_p, *from_p);
4297 gimplify_seq_add_stmt (pre_p, assign);
4299 if (gimplify_ctxp->into_ssa && is_gimple_reg (*to_p))
4301 /* If we've somehow already got an SSA_NAME on the LHS, then
4302 we've probably modified it twice. Not good. */
4303 gcc_assert (TREE_CODE (*to_p) != SSA_NAME);
4304 *to_p = make_ssa_name (*to_p, assign);
4305 gimple_set_lhs (assign, *to_p);
4310 *expr_p = unshare_expr (*to_p);
4319 /* Gimplify a comparison between two variable-sized objects. Do this
4320 with a call to BUILT_IN_MEMCMP. */
4322 static enum gimplify_status
4323 gimplify_variable_sized_compare (tree *expr_p)
4325 tree op0 = TREE_OPERAND (*expr_p, 0);
4326 tree op1 = TREE_OPERAND (*expr_p, 1);
4327 tree t, arg, dest, src;
4329 arg = TYPE_SIZE_UNIT (TREE_TYPE (op0));
4330 arg = unshare_expr (arg);
4331 arg = SUBSTITUTE_PLACEHOLDER_IN_EXPR (arg, op0);
4332 src = build_fold_addr_expr (op1);
4333 dest = build_fold_addr_expr (op0);
4334 t = implicit_built_in_decls[BUILT_IN_MEMCMP];
4335 t = build_call_expr (t, 3, dest, src, arg);
4337 = build2 (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), t, integer_zero_node);
4342 /* Gimplify a comparison between two aggregate objects of integral scalar
4343 mode as a comparison between the bitwise equivalent scalar values. */
4345 static enum gimplify_status
4346 gimplify_scalar_mode_aggregate_compare (tree *expr_p)
4348 tree op0 = TREE_OPERAND (*expr_p, 0);
4349 tree op1 = TREE_OPERAND (*expr_p, 1);
4351 tree type = TREE_TYPE (op0);
4352 tree scalar_type = lang_hooks.types.type_for_mode (TYPE_MODE (type), 1);
4354 op0 = fold_build1 (VIEW_CONVERT_EXPR, scalar_type, op0);
4355 op1 = fold_build1 (VIEW_CONVERT_EXPR, scalar_type, op1);
4358 = fold_build2 (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), op0, op1);
4363 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
4364 points to the expression to gimplify.
4366 Expressions of the form 'a && b' are gimplified to:
4368 a && b ? true : false
4370 gimplify_cond_expr will do the rest.
4372 PRE_P points to the list where side effects that must happen before
4373 *EXPR_P should be stored. */
4375 static enum gimplify_status
4376 gimplify_boolean_expr (tree *expr_p)
4378 /* Preserve the original type of the expression. */
4379 tree type = TREE_TYPE (*expr_p);
4381 *expr_p = build3 (COND_EXPR, type, *expr_p,
4382 fold_convert (type, boolean_true_node),
4383 fold_convert (type, boolean_false_node));
4388 /* Gimplifies an expression sequence. This function gimplifies each
4389 expression and re-writes the original expression with the last
4390 expression of the sequence in GIMPLE form.
4392 PRE_P points to the list where the side effects for all the
4393 expressions in the sequence will be emitted.
4395 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
4397 static enum gimplify_status
4398 gimplify_compound_expr (tree *expr_p, gimple_seq *pre_p, bool want_value)
4404 tree *sub_p = &TREE_OPERAND (t, 0);
4406 if (TREE_CODE (*sub_p) == COMPOUND_EXPR)
4407 gimplify_compound_expr (sub_p, pre_p, false);
4409 gimplify_stmt (sub_p, pre_p);
4411 t = TREE_OPERAND (t, 1);
4413 while (TREE_CODE (t) == COMPOUND_EXPR);
4420 gimplify_stmt (expr_p, pre_p);
4426 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
4427 gimplify. After gimplification, EXPR_P will point to a new temporary
4428 that holds the original value of the SAVE_EXPR node.
4430 PRE_P points to the list where side effects that must happen before
4431 *EXPR_P should be stored. */
4433 static enum gimplify_status
4434 gimplify_save_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4436 enum gimplify_status ret = GS_ALL_DONE;
4439 gcc_assert (TREE_CODE (*expr_p) == SAVE_EXPR);
4440 val = TREE_OPERAND (*expr_p, 0);
4442 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
4443 if (!SAVE_EXPR_RESOLVED_P (*expr_p))
4445 /* The operand may be a void-valued expression such as SAVE_EXPRs
4446 generated by the Java frontend for class initialization. It is
4447 being executed only for its side-effects. */
4448 if (TREE_TYPE (val) == void_type_node)
4450 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
4451 is_gimple_stmt, fb_none);
4455 val = get_initialized_tmp_var (val, pre_p, post_p);
4457 TREE_OPERAND (*expr_p, 0) = val;
4458 SAVE_EXPR_RESOLVED_P (*expr_p) = 1;
4466 /* Re-write the ADDR_EXPR node pointed to by EXPR_P
4473 PRE_P points to the list where side effects that must happen before
4474 *EXPR_P should be stored.
4476 POST_P points to the list where side effects that must happen after
4477 *EXPR_P should be stored. */
4479 static enum gimplify_status
4480 gimplify_addr_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4482 tree expr = *expr_p;
4483 tree op0 = TREE_OPERAND (expr, 0);
4484 enum gimplify_status ret;
4486 switch (TREE_CODE (op0))
4489 case MISALIGNED_INDIRECT_REF:
4491 /* Check if we are dealing with an expression of the form '&*ptr'.
4492 While the front end folds away '&*ptr' into 'ptr', these
4493 expressions may be generated internally by the compiler (e.g.,
4494 builtins like __builtin_va_end). */
4495 /* Caution: the silent array decomposition semantics we allow for
4496 ADDR_EXPR means we can't always discard the pair. */
4497 /* Gimplification of the ADDR_EXPR operand may drop
4498 cv-qualification conversions, so make sure we add them if
4501 tree op00 = TREE_OPERAND (op0, 0);
4502 tree t_expr = TREE_TYPE (expr);
4503 tree t_op00 = TREE_TYPE (op00);
4505 if (!useless_type_conversion_p (t_expr, t_op00))
4506 op00 = fold_convert (TREE_TYPE (expr), op00);
4512 case VIEW_CONVERT_EXPR:
4513 /* Take the address of our operand and then convert it to the type of
4516 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
4517 all clear. The impact of this transformation is even less clear. */
4519 /* If the operand is a useless conversion, look through it. Doing so
4520 guarantees that the ADDR_EXPR and its operand will remain of the
4522 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0, 0)))
4523 op0 = TREE_OPERAND (op0, 0);
4525 *expr_p = fold_convert (TREE_TYPE (expr),
4526 build_fold_addr_expr (TREE_OPERAND (op0, 0)));
4531 /* We use fb_either here because the C frontend sometimes takes
4532 the address of a call that returns a struct; see
4533 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
4534 the implied temporary explicit. */
4536 /* Mark the RHS addressable. */
4537 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, post_p,
4538 is_gimple_addressable, fb_either);
4539 if (ret == GS_ERROR)
4542 /* We cannot rely on making the RHS addressable if it is
4543 a temporary created by gimplification. In this case create a
4544 new temporary that is initialized by a copy (which will
4545 become a store after we mark it addressable).
4546 This mostly happens if the frontend passed us something that
4547 it could not mark addressable yet, like a fortran
4548 pass-by-reference parameter (int) floatvar. */
4549 if (is_gimple_formal_tmp_var (TREE_OPERAND (expr, 0)))
4550 TREE_OPERAND (expr, 0)
4551 = get_initialized_tmp_var (TREE_OPERAND (expr, 0), pre_p, post_p);
4553 op0 = TREE_OPERAND (expr, 0);
4555 /* For various reasons, the gimplification of the expression
4556 may have made a new INDIRECT_REF. */
4557 if (TREE_CODE (op0) == INDIRECT_REF)
4558 goto do_indirect_ref;
4560 /* Make sure TREE_CONSTANT and TREE_SIDE_EFFECTS are set properly. */
4561 recompute_tree_invariant_for_addr_expr (expr);
4563 mark_addressable (TREE_OPERAND (expr, 0));
4570 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
4571 value; output operands should be a gimple lvalue. */
4573 static enum gimplify_status
4574 gimplify_asm_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4578 const char **oconstraints;
4581 const char *constraint;
4582 bool allows_mem, allows_reg, is_inout;
4583 enum gimplify_status ret, tret;
4585 VEC(tree, gc) *inputs;
4586 VEC(tree, gc) *outputs;
4587 VEC(tree, gc) *clobbers;
4591 noutputs = list_length (ASM_OUTPUTS (expr));
4592 oconstraints = (const char **) alloca ((noutputs) * sizeof (const char *));
4594 inputs = outputs = clobbers = NULL;
4597 link_next = NULL_TREE;
4598 for (i = 0, link = ASM_OUTPUTS (expr); link; ++i, link = link_next)
4601 size_t constraint_len;
4603 link_next = TREE_CHAIN (link);
4607 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4608 constraint_len = strlen (constraint);
4609 if (constraint_len == 0)
4612 ok = parse_output_constraint (&constraint, i, 0, 0,
4613 &allows_mem, &allows_reg, &is_inout);
4620 if (!allows_reg && allows_mem)
4621 mark_addressable (TREE_VALUE (link));
4623 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4624 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
4625 fb_lvalue | fb_mayfail);
4626 if (tret == GS_ERROR)
4628 error ("invalid lvalue in asm output %d", i);
4632 VEC_safe_push (tree, gc, outputs, link);
4633 TREE_CHAIN (link) = NULL_TREE;
4637 /* An input/output operand. To give the optimizers more
4638 flexibility, split it into separate input and output
4643 /* Turn the in/out constraint into an output constraint. */
4644 char *p = xstrdup (constraint);
4646 TREE_VALUE (TREE_PURPOSE (link)) = build_string (constraint_len, p);
4648 /* And add a matching input constraint. */
4651 sprintf (buf, "%d", i);
4653 /* If there are multiple alternatives in the constraint,
4654 handle each of them individually. Those that allow register
4655 will be replaced with operand number, the others will stay
4657 if (strchr (p, ',') != NULL)
4659 size_t len = 0, buflen = strlen (buf);
4660 char *beg, *end, *str, *dst;
4664 end = strchr (beg, ',');
4666 end = strchr (beg, '\0');
4667 if ((size_t) (end - beg) < buflen)
4670 len += end - beg + 1;
4677 str = (char *) alloca (len);
4678 for (beg = p + 1, dst = str;;)
4681 bool mem_p, reg_p, inout_p;
4683 end = strchr (beg, ',');
4688 parse_output_constraint (&tem, i, 0, 0,
4689 &mem_p, ®_p, &inout_p);
4694 memcpy (dst, buf, buflen);
4703 memcpy (dst, beg, len);
4712 input = build_string (dst - str, str);
4715 input = build_string (strlen (buf), buf);
4718 input = build_string (constraint_len - 1, constraint + 1);
4722 input = build_tree_list (build_tree_list (NULL_TREE, input),
4723 unshare_expr (TREE_VALUE (link)));
4724 ASM_INPUTS (expr) = chainon (ASM_INPUTS (expr), input);
4728 link_next = NULL_TREE;
4729 for (link = ASM_INPUTS (expr); link; ++i, link = link_next)
4731 link_next = TREE_CHAIN (link);
4732 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4733 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
4734 oconstraints, &allows_mem, &allows_reg);
4736 /* If we can't make copies, we can only accept memory. */
4737 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (link))))
4743 error ("impossible constraint in %<asm%>");
4744 error ("non-memory input %d must stay in memory", i);
4749 /* If the operand is a memory input, it should be an lvalue. */
4750 if (!allows_reg && allows_mem)
4752 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4753 is_gimple_lvalue, fb_lvalue | fb_mayfail);
4754 mark_addressable (TREE_VALUE (link));
4755 if (tret == GS_ERROR)
4757 if (EXPR_HAS_LOCATION (TREE_VALUE (link)))
4758 input_location = EXPR_LOCATION (TREE_VALUE (link));
4759 error ("memory input %d is not directly addressable", i);
4765 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4766 is_gimple_asm_val, fb_rvalue);
4767 if (tret == GS_ERROR)
4771 TREE_CHAIN (link) = NULL_TREE;
4772 VEC_safe_push (tree, gc, inputs, link);
4775 for (link = ASM_CLOBBERS (expr); link; ++i, link = TREE_CHAIN (link))
4776 VEC_safe_push (tree, gc, clobbers, link);
4778 stmt = gimple_build_asm_vec (TREE_STRING_POINTER (ASM_STRING (expr)),
4779 inputs, outputs, clobbers);
4781 gimple_asm_set_volatile (stmt, ASM_VOLATILE_P (expr));
4782 gimple_asm_set_input (stmt, ASM_INPUT_P (expr));
4784 gimplify_seq_add_stmt (pre_p, stmt);
4789 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
4790 GIMPLE_WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
4791 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
4792 return to this function.
4794 FIXME should we complexify the prequeue handling instead? Or use flags
4795 for all the cleanups and let the optimizer tighten them up? The current
4796 code seems pretty fragile; it will break on a cleanup within any
4797 non-conditional nesting. But any such nesting would be broken, anyway;
4798 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
4799 and continues out of it. We can do that at the RTL level, though, so
4800 having an optimizer to tighten up try/finally regions would be a Good
4803 static enum gimplify_status
4804 gimplify_cleanup_point_expr (tree *expr_p, gimple_seq *pre_p)
4806 gimple_stmt_iterator iter;
4807 gimple_seq body_sequence = NULL;
4809 tree temp = voidify_wrapper_expr (*expr_p, NULL);
4811 /* We only care about the number of conditions between the innermost
4812 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
4813 any cleanups collected outside the CLEANUP_POINT_EXPR. */
4814 int old_conds = gimplify_ctxp->conditions;
4815 gimple_seq old_cleanups = gimplify_ctxp->conditional_cleanups;
4816 gimplify_ctxp->conditions = 0;
4817 gimplify_ctxp->conditional_cleanups = NULL;
4819 gimplify_stmt (&TREE_OPERAND (*expr_p, 0), &body_sequence);
4821 gimplify_ctxp->conditions = old_conds;
4822 gimplify_ctxp->conditional_cleanups = old_cleanups;
4824 for (iter = gsi_start (body_sequence); !gsi_end_p (iter); )
4826 gimple wce = gsi_stmt (iter);
4828 if (gimple_code (wce) == GIMPLE_WITH_CLEANUP_EXPR)
4830 if (gsi_one_before_end_p (iter))
4832 /* Note that gsi_insert_seq_before and gsi_remove do not
4833 scan operands, unlike some other sequence mutators. */
4834 gsi_insert_seq_before_without_update (&iter,
4835 gimple_wce_cleanup (wce),
4837 gsi_remove (&iter, true);
4844 enum gimple_try_flags kind;
4846 if (gimple_wce_cleanup_eh_only (wce))
4847 kind = GIMPLE_TRY_CATCH;
4849 kind = GIMPLE_TRY_FINALLY;
4850 seq = gsi_split_seq_after (iter);
4852 gtry = gimple_build_try (seq, gimple_wce_cleanup (wce), kind);
4853 /* Do not use gsi_replace here, as it may scan operands.
4854 We want to do a simple structural modification only. */
4855 *gsi_stmt_ptr (&iter) = gtry;
4856 iter = gsi_start (seq);
4863 gimplify_seq_add_seq (pre_p, body_sequence);
4876 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
4877 is the cleanup action required. EH_ONLY is true if the cleanup should
4878 only be executed if an exception is thrown, not on normal exit. */
4881 gimple_push_cleanup (tree var, tree cleanup, bool eh_only, gimple_seq *pre_p)
4884 gimple_seq cleanup_stmts = NULL;
4886 /* Errors can result in improperly nested cleanups. Which results in
4887 confusion when trying to resolve the GIMPLE_WITH_CLEANUP_EXPR. */
4888 if (errorcount || sorrycount)
4891 if (gimple_conditional_context ())
4893 /* If we're in a conditional context, this is more complex. We only
4894 want to run the cleanup if we actually ran the initialization that
4895 necessitates it, but we want to run it after the end of the
4896 conditional context. So we wrap the try/finally around the
4897 condition and use a flag to determine whether or not to actually
4898 run the destructor. Thus
4902 becomes (approximately)
4906 if (test) { A::A(temp); flag = 1; val = f(temp); }
4909 if (flag) A::~A(temp);
4913 tree flag = create_tmp_var (boolean_type_node, "cleanup");
4914 gimple ffalse = gimple_build_assign (flag, boolean_false_node);
4915 gimple ftrue = gimple_build_assign (flag, boolean_true_node);
4917 cleanup = build3 (COND_EXPR, void_type_node, flag, cleanup, NULL);
4918 gimplify_stmt (&cleanup, &cleanup_stmts);
4919 wce = gimple_build_wce (cleanup_stmts);
4921 gimplify_seq_add_stmt (&gimplify_ctxp->conditional_cleanups, ffalse);
4922 gimplify_seq_add_stmt (&gimplify_ctxp->conditional_cleanups, wce);
4923 gimplify_seq_add_stmt (pre_p, ftrue);
4925 /* Because of this manipulation, and the EH edges that jump
4926 threading cannot redirect, the temporary (VAR) will appear
4927 to be used uninitialized. Don't warn. */
4928 TREE_NO_WARNING (var) = 1;
4932 gimplify_stmt (&cleanup, &cleanup_stmts);
4933 wce = gimple_build_wce (cleanup_stmts);
4934 gimple_wce_set_cleanup_eh_only (wce, eh_only);
4935 gimplify_seq_add_stmt (pre_p, wce);
4939 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
4941 static enum gimplify_status
4942 gimplify_target_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4944 tree targ = *expr_p;
4945 tree temp = TARGET_EXPR_SLOT (targ);
4946 tree init = TARGET_EXPR_INITIAL (targ);
4947 enum gimplify_status ret;
4951 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
4952 to the temps list. Handle also variable length TARGET_EXPRs. */
4953 if (TREE_CODE (DECL_SIZE (temp)) != INTEGER_CST)
4955 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (temp)))
4956 gimplify_type_sizes (TREE_TYPE (temp), pre_p);
4957 gimplify_vla_decl (temp, pre_p);
4960 gimple_add_tmp_var (temp);
4962 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
4963 expression is supposed to initialize the slot. */
4964 if (VOID_TYPE_P (TREE_TYPE (init)))
4965 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
4968 tree init_expr = build2 (INIT_EXPR, void_type_node, temp, init);
4970 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
4972 ggc_free (init_expr);
4974 if (ret == GS_ERROR)
4976 /* PR c++/28266 Make sure this is expanded only once. */
4977 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
4981 gimplify_and_add (init, pre_p);
4983 /* If needed, push the cleanup for the temp. */
4984 if (TARGET_EXPR_CLEANUP (targ))
4985 gimple_push_cleanup (temp, TARGET_EXPR_CLEANUP (targ),
4986 CLEANUP_EH_ONLY (targ), pre_p);
4988 /* Only expand this once. */
4989 TREE_OPERAND (targ, 3) = init;
4990 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
4993 /* We should have expanded this before. */
4994 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp));
5000 /* Gimplification of expression trees. */
5002 /* Gimplify an expression which appears at statement context. The
5003 corresponding GIMPLE statements are added to *SEQ_P. If *SEQ_P is
5004 NULL, a new sequence is allocated.
5006 Return true if we actually added a statement to the queue. */
5009 gimplify_stmt (tree *stmt_p, gimple_seq *seq_p)
5011 gimple_seq_node last;
5014 *seq_p = gimple_seq_alloc ();
5016 last = gimple_seq_last (*seq_p);
5017 gimplify_expr (stmt_p, seq_p, NULL, is_gimple_stmt, fb_none);
5018 return last != gimple_seq_last (*seq_p);
5022 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
5023 to CTX. If entries already exist, force them to be some flavor of private.
5024 If there is no enclosing parallel, do nothing. */
5027 omp_firstprivatize_variable (struct gimplify_omp_ctx *ctx, tree decl)
5031 if (decl == NULL || !DECL_P (decl))
5036 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5039 if (n->value & GOVD_SHARED)
5040 n->value = GOVD_FIRSTPRIVATE | (n->value & GOVD_SEEN);
5044 else if (ctx->region_type != ORT_WORKSHARE)
5045 omp_add_variable (ctx, decl, GOVD_FIRSTPRIVATE);
5047 ctx = ctx->outer_context;
5052 /* Similarly for each of the type sizes of TYPE. */
5055 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx *ctx, tree type)
5057 if (type == NULL || type == error_mark_node)
5059 type = TYPE_MAIN_VARIANT (type);
5061 if (pointer_set_insert (ctx->privatized_types, type))
5064 switch (TREE_CODE (type))
5070 case FIXED_POINT_TYPE:
5071 omp_firstprivatize_variable (ctx, TYPE_MIN_VALUE (type));
5072 omp_firstprivatize_variable (ctx, TYPE_MAX_VALUE (type));
5076 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
5077 omp_firstprivatize_type_sizes (ctx, TYPE_DOMAIN (type));
5082 case QUAL_UNION_TYPE:
5085 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
5086 if (TREE_CODE (field) == FIELD_DECL)
5088 omp_firstprivatize_variable (ctx, DECL_FIELD_OFFSET (field));
5089 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (field));
5095 case REFERENCE_TYPE:
5096 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
5103 omp_firstprivatize_variable (ctx, TYPE_SIZE (type));
5104 omp_firstprivatize_variable (ctx, TYPE_SIZE_UNIT (type));
5105 lang_hooks.types.omp_firstprivatize_type_sizes (ctx, type);
5108 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
5111 omp_add_variable (struct gimplify_omp_ctx *ctx, tree decl, unsigned int flags)
5114 unsigned int nflags;
5117 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5120 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
5121 there are constructors involved somewhere. */
5122 if (TREE_ADDRESSABLE (TREE_TYPE (decl))
5123 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
5126 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5129 /* We shouldn't be re-adding the decl with the same data
5131 gcc_assert ((n->value & GOVD_DATA_SHARE_CLASS & flags) == 0);
5132 /* The only combination of data sharing classes we should see is
5133 FIRSTPRIVATE and LASTPRIVATE. */
5134 nflags = n->value | flags;
5135 gcc_assert ((nflags & GOVD_DATA_SHARE_CLASS)
5136 == (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE));
5141 /* When adding a variable-sized variable, we have to handle all sorts
5142 of additional bits of data: the pointer replacement variable, and
5143 the parameters of the type. */
5144 if (DECL_SIZE (decl) && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
5146 /* Add the pointer replacement variable as PRIVATE if the variable
5147 replacement is private, else FIRSTPRIVATE since we'll need the
5148 address of the original variable either for SHARED, or for the
5149 copy into or out of the context. */
5150 if (!(flags & GOVD_LOCAL))
5152 nflags = flags & GOVD_PRIVATE ? GOVD_PRIVATE : GOVD_FIRSTPRIVATE;
5153 nflags |= flags & GOVD_SEEN;
5154 t = DECL_VALUE_EXPR (decl);
5155 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
5156 t = TREE_OPERAND (t, 0);
5157 gcc_assert (DECL_P (t));
5158 omp_add_variable (ctx, t, nflags);
5161 /* Add all of the variable and type parameters (which should have
5162 been gimplified to a formal temporary) as FIRSTPRIVATE. */
5163 omp_firstprivatize_variable (ctx, DECL_SIZE_UNIT (decl));
5164 omp_firstprivatize_variable (ctx, DECL_SIZE (decl));
5165 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
5167 /* The variable-sized variable itself is never SHARED, only some form
5168 of PRIVATE. The sharing would take place via the pointer variable
5169 which we remapped above. */
5170 if (flags & GOVD_SHARED)
5171 flags = GOVD_PRIVATE | GOVD_DEBUG_PRIVATE
5172 | (flags & (GOVD_SEEN | GOVD_EXPLICIT));
5174 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
5175 alloca statement we generate for the variable, so make sure it
5176 is available. This isn't automatically needed for the SHARED
5177 case, since we won't be allocating local storage then.
5178 For local variables TYPE_SIZE_UNIT might not be gimplified yet,
5179 in this case omp_notice_variable will be called later
5180 on when it is gimplified. */
5181 else if (! (flags & GOVD_LOCAL))
5182 omp_notice_variable (ctx, TYPE_SIZE_UNIT (TREE_TYPE (decl)), true);
5184 else if (lang_hooks.decls.omp_privatize_by_reference (decl))
5186 gcc_assert ((flags & GOVD_LOCAL) == 0);
5187 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
5189 /* Similar to the direct variable sized case above, we'll need the
5190 size of references being privatized. */
5191 if ((flags & GOVD_SHARED) == 0)
5193 t = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl)));
5194 if (TREE_CODE (t) != INTEGER_CST)
5195 omp_notice_variable (ctx, t, true);
5199 splay_tree_insert (ctx->variables, (splay_tree_key)decl, flags);
5202 /* Record the fact that DECL was used within the OpenMP context CTX.
5203 IN_CODE is true when real code uses DECL, and false when we should
5204 merely emit default(none) errors. Return true if DECL is going to
5205 be remapped and thus DECL shouldn't be gimplified into its
5206 DECL_VALUE_EXPR (if any). */
5209 omp_notice_variable (struct gimplify_omp_ctx *ctx, tree decl, bool in_code)
5212 unsigned flags = in_code ? GOVD_SEEN : 0;
5213 bool ret = false, shared;
5215 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5218 /* Threadprivate variables are predetermined. */
5219 if (is_global_var (decl))
5221 if (DECL_THREAD_LOCAL_P (decl))
5224 if (DECL_HAS_VALUE_EXPR_P (decl))
5226 tree value = get_base_address (DECL_VALUE_EXPR (decl));
5228 if (value && DECL_P (value) && DECL_THREAD_LOCAL_P (value))
5233 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5236 enum omp_clause_default_kind default_kind, kind;
5237 struct gimplify_omp_ctx *octx;
5239 if (ctx->region_type == ORT_WORKSHARE)
5242 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
5243 remapped firstprivate instead of shared. To some extent this is
5244 addressed in omp_firstprivatize_type_sizes, but not effectively. */
5245 default_kind = ctx->default_kind;
5246 kind = lang_hooks.decls.omp_predetermined_sharing (decl);
5247 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
5248 default_kind = kind;
5250 switch (default_kind)
5252 case OMP_CLAUSE_DEFAULT_NONE:
5253 error ("%qs not specified in enclosing parallel",
5254 IDENTIFIER_POINTER (DECL_NAME (decl)));
5255 error ("%Henclosing parallel", &ctx->location);
5257 case OMP_CLAUSE_DEFAULT_SHARED:
5258 flags |= GOVD_SHARED;
5260 case OMP_CLAUSE_DEFAULT_PRIVATE:
5261 flags |= GOVD_PRIVATE;
5263 case OMP_CLAUSE_DEFAULT_FIRSTPRIVATE:
5264 flags |= GOVD_FIRSTPRIVATE;
5266 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
5267 /* decl will be either GOVD_FIRSTPRIVATE or GOVD_SHARED. */
5268 gcc_assert (ctx->region_type == ORT_TASK);
5269 if (ctx->outer_context)
5270 omp_notice_variable (ctx->outer_context, decl, in_code);
5271 for (octx = ctx->outer_context; octx; octx = octx->outer_context)
5275 n2 = splay_tree_lookup (octx->variables, (splay_tree_key) decl);
5276 if (n2 && (n2->value & GOVD_DATA_SHARE_CLASS) != GOVD_SHARED)
5278 flags |= GOVD_FIRSTPRIVATE;
5281 if ((octx->region_type & ORT_PARALLEL) != 0)
5284 if (flags & GOVD_FIRSTPRIVATE)
5287 && (TREE_CODE (decl) == PARM_DECL
5288 || (!is_global_var (decl)
5289 && DECL_CONTEXT (decl) == current_function_decl)))
5291 flags |= GOVD_FIRSTPRIVATE;
5294 flags |= GOVD_SHARED;
5300 if ((flags & GOVD_PRIVATE)
5301 && lang_hooks.decls.omp_private_outer_ref (decl))
5302 flags |= GOVD_PRIVATE_OUTER_REF;
5304 omp_add_variable (ctx, decl, flags);
5306 shared = (flags & GOVD_SHARED) != 0;
5307 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
5311 if ((n->value & (GOVD_SEEN | GOVD_LOCAL)) == 0
5312 && (flags & (GOVD_SEEN | GOVD_LOCAL)) == GOVD_SEEN
5314 && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
5317 tree t = DECL_VALUE_EXPR (decl);
5318 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
5319 t = TREE_OPERAND (t, 0);
5320 gcc_assert (DECL_P (t));
5321 n2 = splay_tree_lookup (ctx->variables, (splay_tree_key) t);
5322 n2->value |= GOVD_SEEN;
5325 shared = ((flags | n->value) & GOVD_SHARED) != 0;
5326 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
5328 /* If nothing changed, there's nothing left to do. */
5329 if ((n->value & flags) == flags)
5335 /* If the variable is private in the current context, then we don't
5336 need to propagate anything to an outer context. */
5337 if ((flags & GOVD_PRIVATE) && !(flags & GOVD_PRIVATE_OUTER_REF))
5339 if (ctx->outer_context
5340 && omp_notice_variable (ctx->outer_context, decl, in_code))
5345 /* Verify that DECL is private within CTX. If there's specific information
5346 to the contrary in the innermost scope, generate an error. */
5349 omp_is_private (struct gimplify_omp_ctx *ctx, tree decl)
5353 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5356 if (n->value & GOVD_SHARED)
5358 if (ctx == gimplify_omp_ctxp)
5360 error ("iteration variable %qs should be private",
5361 IDENTIFIER_POINTER (DECL_NAME (decl)));
5362 n->value = GOVD_PRIVATE;
5368 else if ((n->value & GOVD_EXPLICIT) != 0
5369 && (ctx == gimplify_omp_ctxp
5370 || (ctx->region_type == ORT_COMBINED_PARALLEL
5371 && gimplify_omp_ctxp->outer_context == ctx)))
5373 if ((n->value & GOVD_FIRSTPRIVATE) != 0)
5374 error ("iteration variable %qs should not be firstprivate",
5375 IDENTIFIER_POINTER (DECL_NAME (decl)));
5376 else if ((n->value & GOVD_REDUCTION) != 0)
5377 error ("iteration variable %qs should not be reduction",
5378 IDENTIFIER_POINTER (DECL_NAME (decl)));
5380 return (ctx == gimplify_omp_ctxp
5381 || (ctx->region_type == ORT_COMBINED_PARALLEL
5382 && gimplify_omp_ctxp->outer_context == ctx));
5385 if (ctx->region_type != ORT_WORKSHARE)
5387 else if (ctx->outer_context)
5388 return omp_is_private (ctx->outer_context, decl);
5392 /* Return true if DECL is private within a parallel region
5393 that binds to the current construct's context or in parallel
5394 region's REDUCTION clause. */
5397 omp_check_private (struct gimplify_omp_ctx *ctx, tree decl)
5403 ctx = ctx->outer_context;
5405 return !(is_global_var (decl)
5406 /* References might be private, but might be shared too. */
5407 || lang_hooks.decls.omp_privatize_by_reference (decl));
5409 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5411 return (n->value & GOVD_SHARED) == 0;
5413 while (ctx->region_type == ORT_WORKSHARE);
5417 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
5418 and previous omp contexts. */
5421 gimplify_scan_omp_clauses (tree *list_p, gimple_seq *pre_p,
5422 enum omp_region_type region_type)
5424 struct gimplify_omp_ctx *ctx, *outer_ctx;
5425 struct gimplify_ctx gctx;
5428 ctx = new_omp_context (region_type);
5429 outer_ctx = ctx->outer_context;
5431 while ((c = *list_p) != NULL)
5433 bool remove = false;
5434 bool notice_outer = true;
5435 const char *check_non_private = NULL;
5439 switch (OMP_CLAUSE_CODE (c))
5441 case OMP_CLAUSE_PRIVATE:
5442 flags = GOVD_PRIVATE | GOVD_EXPLICIT;
5443 if (lang_hooks.decls.omp_private_outer_ref (OMP_CLAUSE_DECL (c)))
5445 flags |= GOVD_PRIVATE_OUTER_REF;
5446 OMP_CLAUSE_PRIVATE_OUTER_REF (c) = 1;
5449 notice_outer = false;
5451 case OMP_CLAUSE_SHARED:
5452 flags = GOVD_SHARED | GOVD_EXPLICIT;
5454 case OMP_CLAUSE_FIRSTPRIVATE:
5455 flags = GOVD_FIRSTPRIVATE | GOVD_EXPLICIT;
5456 check_non_private = "firstprivate";
5458 case OMP_CLAUSE_LASTPRIVATE:
5459 flags = GOVD_LASTPRIVATE | GOVD_SEEN | GOVD_EXPLICIT;
5460 check_non_private = "lastprivate";
5462 case OMP_CLAUSE_REDUCTION:
5463 flags = GOVD_REDUCTION | GOVD_SEEN | GOVD_EXPLICIT;
5464 check_non_private = "reduction";
5468 decl = OMP_CLAUSE_DECL (c);
5469 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5474 omp_add_variable (ctx, decl, flags);
5475 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION
5476 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c))
5478 omp_add_variable (ctx, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c),
5479 GOVD_LOCAL | GOVD_SEEN);
5480 gimplify_omp_ctxp = ctx;
5481 push_gimplify_context (&gctx);
5483 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c) = gimple_seq_alloc ();
5484 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c) = gimple_seq_alloc ();
5486 gimplify_and_add (OMP_CLAUSE_REDUCTION_INIT (c),
5487 &OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c));
5488 pop_gimplify_context
5489 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c)));
5490 push_gimplify_context (&gctx);
5491 gimplify_and_add (OMP_CLAUSE_REDUCTION_MERGE (c),
5492 &OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c));
5493 pop_gimplify_context
5494 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c)));
5495 OMP_CLAUSE_REDUCTION_INIT (c) = NULL_TREE;
5496 OMP_CLAUSE_REDUCTION_MERGE (c) = NULL_TREE;
5498 gimplify_omp_ctxp = outer_ctx;
5500 else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
5501 && OMP_CLAUSE_LASTPRIVATE_STMT (c))
5503 gimplify_omp_ctxp = ctx;
5504 push_gimplify_context (&gctx);
5505 if (TREE_CODE (OMP_CLAUSE_LASTPRIVATE_STMT (c)) != BIND_EXPR)
5507 tree bind = build3 (BIND_EXPR, void_type_node, NULL,
5509 TREE_SIDE_EFFECTS (bind) = 1;
5510 BIND_EXPR_BODY (bind) = OMP_CLAUSE_LASTPRIVATE_STMT (c);
5511 OMP_CLAUSE_LASTPRIVATE_STMT (c) = bind;
5513 gimplify_and_add (OMP_CLAUSE_LASTPRIVATE_STMT (c),
5514 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c));
5515 pop_gimplify_context
5516 (gimple_seq_first_stmt (OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c)));
5517 OMP_CLAUSE_LASTPRIVATE_STMT (c) = NULL_TREE;
5519 gimplify_omp_ctxp = outer_ctx;
5525 case OMP_CLAUSE_COPYIN:
5526 case OMP_CLAUSE_COPYPRIVATE:
5527 decl = OMP_CLAUSE_DECL (c);
5528 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5535 omp_notice_variable (outer_ctx, decl, true);
5536 if (check_non_private
5537 && region_type == ORT_WORKSHARE
5538 && omp_check_private (ctx, decl))
5540 error ("%s variable %qs is private in outer context",
5541 check_non_private, IDENTIFIER_POINTER (DECL_NAME (decl)));
5547 OMP_CLAUSE_OPERAND (c, 0)
5548 = gimple_boolify (OMP_CLAUSE_OPERAND (c, 0));
5551 case OMP_CLAUSE_SCHEDULE:
5552 case OMP_CLAUSE_NUM_THREADS:
5553 if (gimplify_expr (&OMP_CLAUSE_OPERAND (c, 0), pre_p, NULL,
5554 is_gimple_val, fb_rvalue) == GS_ERROR)
5558 case OMP_CLAUSE_NOWAIT:
5559 case OMP_CLAUSE_ORDERED:
5560 case OMP_CLAUSE_UNTIED:
5561 case OMP_CLAUSE_COLLAPSE:
5564 case OMP_CLAUSE_DEFAULT:
5565 ctx->default_kind = OMP_CLAUSE_DEFAULT_KIND (c);
5573 *list_p = OMP_CLAUSE_CHAIN (c);
5575 list_p = &OMP_CLAUSE_CHAIN (c);
5578 gimplify_omp_ctxp = ctx;
5581 /* For all variables that were not actually used within the context,
5582 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
5585 gimplify_adjust_omp_clauses_1 (splay_tree_node n, void *data)
5587 tree *list_p = (tree *) data;
5588 tree decl = (tree) n->key;
5589 unsigned flags = n->value;
5590 enum omp_clause_code code;
5594 if (flags & (GOVD_EXPLICIT | GOVD_LOCAL))
5596 if ((flags & GOVD_SEEN) == 0)
5598 if (flags & GOVD_DEBUG_PRIVATE)
5600 gcc_assert ((flags & GOVD_DATA_SHARE_CLASS) == GOVD_PRIVATE);
5601 private_debug = true;
5605 = lang_hooks.decls.omp_private_debug_clause (decl,
5606 !!(flags & GOVD_SHARED));
5608 code = OMP_CLAUSE_PRIVATE;
5609 else if (flags & GOVD_SHARED)
5611 if (is_global_var (decl))
5613 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp->outer_context;
5617 = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5618 if (on && (on->value & (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE
5619 | GOVD_PRIVATE | GOVD_REDUCTION)) != 0)
5621 ctx = ctx->outer_context;
5626 code = OMP_CLAUSE_SHARED;
5628 else if (flags & GOVD_PRIVATE)
5629 code = OMP_CLAUSE_PRIVATE;
5630 else if (flags & GOVD_FIRSTPRIVATE)
5631 code = OMP_CLAUSE_FIRSTPRIVATE;
5635 clause = build_omp_clause (code);
5636 OMP_CLAUSE_DECL (clause) = decl;
5637 OMP_CLAUSE_CHAIN (clause) = *list_p;
5639 OMP_CLAUSE_PRIVATE_DEBUG (clause) = 1;
5640 else if (code == OMP_CLAUSE_PRIVATE && (flags & GOVD_PRIVATE_OUTER_REF))
5641 OMP_CLAUSE_PRIVATE_OUTER_REF (clause) = 1;
5643 lang_hooks.decls.omp_finish_clause (clause);
5649 gimplify_adjust_omp_clauses (tree *list_p)
5651 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
5654 while ((c = *list_p) != NULL)
5657 bool remove = false;
5659 switch (OMP_CLAUSE_CODE (c))
5661 case OMP_CLAUSE_PRIVATE:
5662 case OMP_CLAUSE_SHARED:
5663 case OMP_CLAUSE_FIRSTPRIVATE:
5664 decl = OMP_CLAUSE_DECL (c);
5665 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5666 remove = !(n->value & GOVD_SEEN);
5669 bool shared = OMP_CLAUSE_CODE (c) == OMP_CLAUSE_SHARED;
5670 if ((n->value & GOVD_DEBUG_PRIVATE)
5671 || lang_hooks.decls.omp_private_debug_clause (decl, shared))
5673 gcc_assert ((n->value & GOVD_DEBUG_PRIVATE) == 0
5674 || ((n->value & GOVD_DATA_SHARE_CLASS)
5676 OMP_CLAUSE_SET_CODE (c, OMP_CLAUSE_PRIVATE);
5677 OMP_CLAUSE_PRIVATE_DEBUG (c) = 1;
5682 case OMP_CLAUSE_LASTPRIVATE:
5683 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
5684 accurately reflect the presence of a FIRSTPRIVATE clause. */
5685 decl = OMP_CLAUSE_DECL (c);
5686 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5687 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)
5688 = (n->value & GOVD_FIRSTPRIVATE) != 0;
5691 case OMP_CLAUSE_REDUCTION:
5692 case OMP_CLAUSE_COPYIN:
5693 case OMP_CLAUSE_COPYPRIVATE:
5695 case OMP_CLAUSE_NUM_THREADS:
5696 case OMP_CLAUSE_SCHEDULE:
5697 case OMP_CLAUSE_NOWAIT:
5698 case OMP_CLAUSE_ORDERED:
5699 case OMP_CLAUSE_DEFAULT:
5700 case OMP_CLAUSE_UNTIED:
5701 case OMP_CLAUSE_COLLAPSE:
5709 *list_p = OMP_CLAUSE_CHAIN (c);
5711 list_p = &OMP_CLAUSE_CHAIN (c);
5714 /* Add in any implicit data sharing. */
5715 splay_tree_foreach (ctx->variables, gimplify_adjust_omp_clauses_1, list_p);
5717 gimplify_omp_ctxp = ctx->outer_context;
5718 delete_omp_context (ctx);
5721 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
5722 gimplification of the body, as well as scanning the body for used
5723 variables. We need to do this scan now, because variable-sized
5724 decls will be decomposed during gimplification. */
5727 gimplify_omp_parallel (tree *expr_p, gimple_seq *pre_p)
5729 tree expr = *expr_p;
5731 gimple_seq body = NULL;
5732 struct gimplify_ctx gctx;
5734 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr), pre_p,
5735 OMP_PARALLEL_COMBINED (expr)
5736 ? ORT_COMBINED_PARALLEL
5739 push_gimplify_context (&gctx);
5741 g = gimplify_and_return_first (OMP_PARALLEL_BODY (expr), &body);
5742 if (gimple_code (g) == GIMPLE_BIND)
5743 pop_gimplify_context (g);
5745 pop_gimplify_context (NULL);
5747 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr));
5749 g = gimple_build_omp_parallel (body,
5750 OMP_PARALLEL_CLAUSES (expr),
5751 NULL_TREE, NULL_TREE);
5752 if (OMP_PARALLEL_COMBINED (expr))
5753 gimple_omp_set_subcode (g, GF_OMP_PARALLEL_COMBINED);
5754 gimplify_seq_add_stmt (pre_p, g);
5755 *expr_p = NULL_TREE;
5758 /* Gimplify the contents of an OMP_TASK statement. This involves
5759 gimplification of the body, as well as scanning the body for used
5760 variables. We need to do this scan now, because variable-sized
5761 decls will be decomposed during gimplification. */
5764 gimplify_omp_task (tree *expr_p, gimple_seq *pre_p)
5766 tree expr = *expr_p;
5768 gimple_seq body = NULL;
5769 struct gimplify_ctx gctx;
5771 gimplify_scan_omp_clauses (&OMP_TASK_CLAUSES (expr), pre_p, ORT_TASK);
5773 push_gimplify_context (&gctx);
5775 g = gimplify_and_return_first (OMP_TASK_BODY (expr), &body);
5776 if (gimple_code (g) == GIMPLE_BIND)
5777 pop_gimplify_context (g);
5779 pop_gimplify_context (NULL);
5781 gimplify_adjust_omp_clauses (&OMP_TASK_CLAUSES (expr));
5783 g = gimple_build_omp_task (body,
5784 OMP_TASK_CLAUSES (expr),
5785 NULL_TREE, NULL_TREE,
5786 NULL_TREE, NULL_TREE, NULL_TREE);
5787 gimplify_seq_add_stmt (pre_p, g);
5788 *expr_p = NULL_TREE;
5791 /* Gimplify the gross structure of an OMP_FOR statement. */
5793 static enum gimplify_status
5794 gimplify_omp_for (tree *expr_p, gimple_seq *pre_p)
5796 tree for_stmt, decl, var, t;
5797 enum gimplify_status ret = GS_OK;
5799 gimple_seq for_body, for_pre_body;
5804 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt), pre_p,
5807 /* Handle OMP_FOR_INIT. */
5808 for_pre_body = NULL;
5809 gimplify_and_add (OMP_FOR_PRE_BODY (for_stmt), &for_pre_body);
5810 OMP_FOR_PRE_BODY (for_stmt) = NULL_TREE;
5812 for_body = gimple_seq_alloc ();
5813 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt))
5814 == TREE_VEC_LENGTH (OMP_FOR_COND (for_stmt)));
5815 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt))
5816 == TREE_VEC_LENGTH (OMP_FOR_INCR (for_stmt)));
5817 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)); i++)
5819 t = TREE_VEC_ELT (OMP_FOR_INIT (for_stmt), i);
5820 gcc_assert (TREE_CODE (t) == MODIFY_EXPR);
5821 decl = TREE_OPERAND (t, 0);
5822 gcc_assert (DECL_P (decl));
5823 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl))
5824 || POINTER_TYPE_P (TREE_TYPE (decl)));
5826 /* Make sure the iteration variable is private. */
5827 if (omp_is_private (gimplify_omp_ctxp, decl))
5828 omp_notice_variable (gimplify_omp_ctxp, decl, true);
5830 omp_add_variable (gimplify_omp_ctxp, decl, GOVD_PRIVATE | GOVD_SEEN);
5832 /* If DECL is not a gimple register, create a temporary variable to act
5833 as an iteration counter. This is valid, since DECL cannot be
5834 modified in the body of the loop. */
5835 if (!is_gimple_reg (decl))
5837 var = create_tmp_var (TREE_TYPE (decl), get_name (decl));
5838 TREE_OPERAND (t, 0) = var;
5840 gimplify_seq_add_stmt (&for_body, gimple_build_assign (decl, var));
5842 omp_add_variable (gimplify_omp_ctxp, var, GOVD_PRIVATE | GOVD_SEEN);
5847 ret |= gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
5848 is_gimple_val, fb_rvalue);
5849 if (ret == GS_ERROR)
5852 /* Handle OMP_FOR_COND. */
5853 t = TREE_VEC_ELT (OMP_FOR_COND (for_stmt), i);
5854 gcc_assert (COMPARISON_CLASS_P (t));
5855 gcc_assert (TREE_OPERAND (t, 0) == decl);
5857 ret |= gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
5858 is_gimple_val, fb_rvalue);
5860 /* Handle OMP_FOR_INCR. */
5861 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
5862 switch (TREE_CODE (t))
5864 case PREINCREMENT_EXPR:
5865 case POSTINCREMENT_EXPR:
5866 t = build_int_cst (TREE_TYPE (decl), 1);
5867 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
5868 t = build2 (MODIFY_EXPR, TREE_TYPE (var), var, t);
5869 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i) = t;
5872 case PREDECREMENT_EXPR:
5873 case POSTDECREMENT_EXPR:
5874 t = build_int_cst (TREE_TYPE (decl), -1);
5875 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
5876 t = build2 (MODIFY_EXPR, TREE_TYPE (var), var, t);
5877 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i) = t;
5881 gcc_assert (TREE_OPERAND (t, 0) == decl);
5882 TREE_OPERAND (t, 0) = var;
5884 t = TREE_OPERAND (t, 1);
5885 switch (TREE_CODE (t))
5888 if (TREE_OPERAND (t, 1) == decl)
5890 TREE_OPERAND (t, 1) = TREE_OPERAND (t, 0);
5891 TREE_OPERAND (t, 0) = var;
5897 case POINTER_PLUS_EXPR:
5898 gcc_assert (TREE_OPERAND (t, 0) == decl);
5899 TREE_OPERAND (t, 0) = var;
5905 ret |= gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
5906 is_gimple_val, fb_rvalue);
5913 if (var != decl || TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)) > 1)
5916 for (c = OMP_FOR_CLAUSES (for_stmt); c ; c = OMP_CLAUSE_CHAIN (c))
5917 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
5918 && OMP_CLAUSE_DECL (c) == decl
5919 && OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c) == NULL)
5921 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
5922 gcc_assert (TREE_CODE (t) == MODIFY_EXPR);
5923 gcc_assert (TREE_OPERAND (t, 0) == var);
5924 t = TREE_OPERAND (t, 1);
5925 gcc_assert (TREE_CODE (t) == PLUS_EXPR
5926 || TREE_CODE (t) == MINUS_EXPR
5927 || TREE_CODE (t) == POINTER_PLUS_EXPR);
5928 gcc_assert (TREE_OPERAND (t, 0) == var);
5929 t = build2 (TREE_CODE (t), TREE_TYPE (decl), decl,
5930 TREE_OPERAND (t, 1));
5931 gimplify_assign (decl, t,
5932 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c));
5937 gimplify_and_add (OMP_FOR_BODY (for_stmt), &for_body);
5939 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt));
5941 gfor = gimple_build_omp_for (for_body, OMP_FOR_CLAUSES (for_stmt),
5942 TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)),
5945 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)); i++)
5947 t = TREE_VEC_ELT (OMP_FOR_INIT (for_stmt), i);
5948 gimple_omp_for_set_index (gfor, i, TREE_OPERAND (t, 0));
5949 gimple_omp_for_set_initial (gfor, i, TREE_OPERAND (t, 1));
5950 t = TREE_VEC_ELT (OMP_FOR_COND (for_stmt), i);
5951 gimple_omp_for_set_cond (gfor, i, TREE_CODE (t));
5952 gimple_omp_for_set_final (gfor, i, TREE_OPERAND (t, 1));
5953 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
5954 gimple_omp_for_set_incr (gfor, i, TREE_OPERAND (t, 1));
5957 gimplify_seq_add_stmt (pre_p, gfor);
5958 return ret == GS_ALL_DONE ? GS_ALL_DONE : GS_ERROR;
5961 /* Gimplify the gross structure of other OpenMP worksharing constructs.
5962 In particular, OMP_SECTIONS and OMP_SINGLE. */
5965 gimplify_omp_workshare (tree *expr_p, gimple_seq *pre_p)
5967 tree expr = *expr_p;
5969 gimple_seq body = NULL;
5971 gimplify_scan_omp_clauses (&OMP_CLAUSES (expr), pre_p, ORT_WORKSHARE);
5972 gimplify_and_add (OMP_BODY (expr), &body);
5973 gimplify_adjust_omp_clauses (&OMP_CLAUSES (expr));
5975 if (TREE_CODE (expr) == OMP_SECTIONS)
5976 stmt = gimple_build_omp_sections (body, OMP_CLAUSES (expr));
5977 else if (TREE_CODE (expr) == OMP_SINGLE)
5978 stmt = gimple_build_omp_single (body, OMP_CLAUSES (expr));
5982 gimplify_seq_add_stmt (pre_p, stmt);
5985 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
5986 stabilized the lhs of the atomic operation as *ADDR. Return true if
5987 EXPR is this stabilized form. */
5990 goa_lhs_expr_p (tree expr, tree addr)
5992 /* Also include casts to other type variants. The C front end is fond
5993 of adding these for e.g. volatile variables. This is like
5994 STRIP_TYPE_NOPS but includes the main variant lookup. */
5995 while ((CONVERT_EXPR_P (expr)
5996 || TREE_CODE (expr) == NON_LVALUE_EXPR)
5997 && TREE_OPERAND (expr, 0) != error_mark_node
5998 && (TYPE_MAIN_VARIANT (TREE_TYPE (expr))
5999 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (expr, 0)))))
6000 expr = TREE_OPERAND (expr, 0);
6002 if (TREE_CODE (expr) == INDIRECT_REF)
6004 expr = TREE_OPERAND (expr, 0);
6006 && (CONVERT_EXPR_P (expr)
6007 || TREE_CODE (expr) == NON_LVALUE_EXPR)
6008 && TREE_CODE (expr) == TREE_CODE (addr)
6009 && TYPE_MAIN_VARIANT (TREE_TYPE (expr))
6010 == TYPE_MAIN_VARIANT (TREE_TYPE (addr)))
6012 expr = TREE_OPERAND (expr, 0);
6013 addr = TREE_OPERAND (addr, 0);
6017 return (TREE_CODE (addr) == ADDR_EXPR
6018 && TREE_CODE (expr) == ADDR_EXPR
6019 && TREE_OPERAND (addr, 0) == TREE_OPERAND (expr, 0));
6021 if (TREE_CODE (addr) == ADDR_EXPR && expr == TREE_OPERAND (addr, 0))
6026 /* Walk *EXPR_P and replace
6027 appearances of *LHS_ADDR with LHS_VAR. If an expression does not involve
6028 the lhs, evaluate it into a temporary. Return 1 if the lhs appeared as
6029 a subexpression, 0 if it did not, or -1 if an error was encountered. */
6032 goa_stabilize_expr (tree *expr_p, gimple_seq *pre_p, tree lhs_addr,
6035 tree expr = *expr_p;
6038 if (goa_lhs_expr_p (expr, lhs_addr))
6043 if (is_gimple_val (expr))
6047 switch (TREE_CODE_CLASS (TREE_CODE (expr)))
6050 case tcc_comparison:
6051 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p, lhs_addr,
6054 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p, lhs_addr,
6057 case tcc_expression:
6058 switch (TREE_CODE (expr))
6060 case TRUTH_ANDIF_EXPR:
6061 case TRUTH_ORIF_EXPR:
6062 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p,
6064 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p,
6077 enum gimplify_status gs;
6078 gs = gimplify_expr (expr_p, pre_p, NULL, is_gimple_val, fb_rvalue);
6079 if (gs != GS_ALL_DONE)
6087 /* Gimplify an OMP_ATOMIC statement. */
6089 static enum gimplify_status
6090 gimplify_omp_atomic (tree *expr_p, gimple_seq *pre_p)
6092 tree addr = TREE_OPERAND (*expr_p, 0);
6093 tree rhs = TREE_OPERAND (*expr_p, 1);
6094 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr)));
6097 tmp_load = create_tmp_var (type, NULL);
6098 if (goa_stabilize_expr (&rhs, pre_p, addr, tmp_load) < 0)
6101 if (gimplify_expr (&addr, pre_p, NULL, is_gimple_val, fb_rvalue)
6105 gimplify_seq_add_stmt (pre_p, gimple_build_omp_atomic_load (tmp_load, addr));
6106 if (gimplify_expr (&rhs, pre_p, NULL, is_gimple_val, fb_rvalue)
6109 gimplify_seq_add_stmt (pre_p, gimple_build_omp_atomic_store (rhs));
6116 /* Converts the GENERIC expression tree *EXPR_P to GIMPLE. If the
6117 expression produces a value to be used as an operand inside a GIMPLE
6118 statement, the value will be stored back in *EXPR_P. This value will
6119 be a tree of class tcc_declaration, tcc_constant, tcc_reference or
6120 an SSA_NAME. The corresponding sequence of GIMPLE statements is
6121 emitted in PRE_P and POST_P.
6123 Additionally, this process may overwrite parts of the input
6124 expression during gimplification. Ideally, it should be
6125 possible to do non-destructive gimplification.
6127 EXPR_P points to the GENERIC expression to convert to GIMPLE. If
6128 the expression needs to evaluate to a value to be used as
6129 an operand in a GIMPLE statement, this value will be stored in
6130 *EXPR_P on exit. This happens when the caller specifies one
6131 of fb_lvalue or fb_rvalue fallback flags.
6133 PRE_P will contain the sequence of GIMPLE statements corresponding
6134 to the evaluation of EXPR and all the side-effects that must
6135 be executed before the main expression. On exit, the last
6136 statement of PRE_P is the core statement being gimplified. For
6137 instance, when gimplifying 'if (++a)' the last statement in
6138 PRE_P will be 'if (t.1)' where t.1 is the result of
6139 pre-incrementing 'a'.
6141 POST_P will contain the sequence of GIMPLE statements corresponding
6142 to the evaluation of all the side-effects that must be executed
6143 after the main expression. If this is NULL, the post
6144 side-effects are stored at the end of PRE_P.
6146 The reason why the output is split in two is to handle post
6147 side-effects explicitly. In some cases, an expression may have
6148 inner and outer post side-effects which need to be emitted in
6149 an order different from the one given by the recursive
6150 traversal. For instance, for the expression (*p--)++ the post
6151 side-effects of '--' must actually occur *after* the post
6152 side-effects of '++'. However, gimplification will first visit
6153 the inner expression, so if a separate POST sequence was not
6154 used, the resulting sequence would be:
6161 However, the post-decrement operation in line #2 must not be
6162 evaluated until after the store to *p at line #4, so the
6163 correct sequence should be:
6170 So, by specifying a separate post queue, it is possible
6171 to emit the post side-effects in the correct order.
6172 If POST_P is NULL, an internal queue will be used. Before
6173 returning to the caller, the sequence POST_P is appended to
6174 the main output sequence PRE_P.
6176 GIMPLE_TEST_F points to a function that takes a tree T and
6177 returns nonzero if T is in the GIMPLE form requested by the
6178 caller. The GIMPLE predicates are in tree-gimple.c.
6180 FALLBACK tells the function what sort of a temporary we want if
6181 gimplification cannot produce an expression that complies with
6184 fb_none means that no temporary should be generated
6185 fb_rvalue means that an rvalue is OK to generate
6186 fb_lvalue means that an lvalue is OK to generate
6187 fb_either means that either is OK, but an lvalue is preferable.
6188 fb_mayfail means that gimplification may fail (in which case
6189 GS_ERROR will be returned)
6191 The return value is either GS_ERROR or GS_ALL_DONE, since this
6192 function iterates until EXPR is completely gimplified or an error
6195 enum gimplify_status
6196 gimplify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
6197 bool (*gimple_test_f) (tree), fallback_t fallback)
6200 gimple_seq internal_pre = NULL;
6201 gimple_seq internal_post = NULL;
6204 location_t saved_location;
6205 enum gimplify_status ret;
6206 gimple_stmt_iterator pre_last_gsi, post_last_gsi;
6208 save_expr = *expr_p;
6209 if (save_expr == NULL_TREE)
6212 /* If we are gimplifying a top-level statement, PRE_P must be valid. */
6213 is_statement = gimple_test_f == is_gimple_stmt;
6217 /* Consistency checks. */
6218 if (gimple_test_f == is_gimple_reg)
6219 gcc_assert (fallback & (fb_rvalue | fb_lvalue));
6220 else if (gimple_test_f == is_gimple_val
6221 || gimple_test_f == is_gimple_formal_tmp_rhs
6222 || gimple_test_f == is_gimple_formal_tmp_or_call_rhs
6223 || gimple_test_f == is_gimple_formal_tmp_reg
6224 || gimple_test_f == is_gimple_formal_tmp_var
6225 || gimple_test_f == is_gimple_call_addr
6226 || gimple_test_f == is_gimple_condexpr
6227 || gimple_test_f == is_gimple_mem_rhs
6228 || gimple_test_f == is_gimple_mem_or_call_rhs
6229 || gimple_test_f == is_gimple_reg_rhs
6230 || gimple_test_f == is_gimple_reg_or_call_rhs
6231 || gimple_test_f == is_gimple_asm_val)
6232 gcc_assert (fallback & fb_rvalue);
6233 else if (gimple_test_f == is_gimple_min_lval
6234 || gimple_test_f == is_gimple_lvalue)
6235 gcc_assert (fallback & fb_lvalue);
6236 else if (gimple_test_f == is_gimple_addressable)
6237 gcc_assert (fallback & fb_either);
6238 else if (gimple_test_f == is_gimple_stmt)
6239 gcc_assert (fallback == fb_none);
6242 /* We should have recognized the GIMPLE_TEST_F predicate to
6243 know what kind of fallback to use in case a temporary is
6244 needed to hold the value or address of *EXPR_P. */
6248 /* We used to check the predicate here and return immediately if it
6249 succeeds. This is wrong; the design is for gimplification to be
6250 idempotent, and for the predicates to only test for valid forms, not
6251 whether they are fully simplified. */
6253 pre_p = &internal_pre;
6256 post_p = &internal_post;
6258 /* Remember the last statements added to PRE_P and POST_P. Every
6259 new statement added by the gimplification helpers needs to be
6260 annotated with location information. To centralize the
6261 responsibility, we remember the last statement that had been
6262 added to both queues before gimplifying *EXPR_P. If
6263 gimplification produces new statements in PRE_P and POST_P, those
6264 statements will be annotated with the same location information
6266 pre_last_gsi = gsi_last (*pre_p);
6267 post_last_gsi = gsi_last (*post_p);
6269 saved_location = input_location;
6270 if (save_expr != error_mark_node
6271 && EXPR_HAS_LOCATION (*expr_p))
6272 input_location = EXPR_LOCATION (*expr_p);
6274 /* Loop over the specific gimplifiers until the toplevel node
6275 remains the same. */
6278 /* Strip away as many useless type conversions as possible
6280 STRIP_USELESS_TYPE_CONVERSION (*expr_p);
6282 /* Remember the expr. */
6283 save_expr = *expr_p;
6285 /* Die, die, die, my darling. */
6286 if (save_expr == error_mark_node
6287 || (TREE_TYPE (save_expr)
6288 && TREE_TYPE (save_expr) == error_mark_node))
6294 /* Do any language-specific gimplification. */
6295 ret = lang_hooks.gimplify_expr (expr_p, pre_p, post_p);
6298 if (*expr_p == NULL_TREE)
6300 if (*expr_p != save_expr)
6303 else if (ret != GS_UNHANDLED)
6307 switch (TREE_CODE (*expr_p))
6309 /* First deal with the special cases. */
6311 case POSTINCREMENT_EXPR:
6312 case POSTDECREMENT_EXPR:
6313 case PREINCREMENT_EXPR:
6314 case PREDECREMENT_EXPR:
6315 ret = gimplify_self_mod_expr (expr_p, pre_p, post_p,
6316 fallback != fb_none);
6320 case ARRAY_RANGE_REF:
6324 case VIEW_CONVERT_EXPR:
6325 ret = gimplify_compound_lval (expr_p, pre_p, post_p,
6326 fallback ? fallback : fb_rvalue);
6330 ret = gimplify_cond_expr (expr_p, pre_p, fallback);
6332 /* C99 code may assign to an array in a structure value of a
6333 conditional expression, and this has undefined behavior
6334 only on execution, so create a temporary if an lvalue is
6336 if (fallback == fb_lvalue)
6338 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6339 mark_addressable (*expr_p);
6344 ret = gimplify_call_expr (expr_p, pre_p, fallback != fb_none);
6346 /* C99 code may assign to an array in a structure returned
6347 from a function, and this has undefined behavior only on
6348 execution, so create a temporary if an lvalue is
6350 if (fallback == fb_lvalue)
6352 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6353 mark_addressable (*expr_p);
6361 ret = gimplify_compound_expr (expr_p, pre_p, fallback != fb_none);
6366 ret = gimplify_modify_expr (expr_p, pre_p, post_p,
6367 fallback != fb_none);
6370 case TRUTH_ANDIF_EXPR:
6371 case TRUTH_ORIF_EXPR:
6372 ret = gimplify_boolean_expr (expr_p);
6375 case TRUTH_NOT_EXPR:
6376 if (TREE_CODE (TREE_TYPE (*expr_p)) != BOOLEAN_TYPE)
6378 tree type = TREE_TYPE (*expr_p);
6379 *expr_p = fold_convert (type, gimple_boolify (*expr_p));
6384 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6385 is_gimple_val, fb_rvalue);
6386 recalculate_side_effects (*expr_p);
6390 ret = gimplify_addr_expr (expr_p, pre_p, post_p);
6394 ret = gimplify_va_arg_expr (expr_p, pre_p, post_p);
6398 if (IS_EMPTY_STMT (*expr_p))
6404 if (VOID_TYPE_P (TREE_TYPE (*expr_p))
6405 || fallback == fb_none)
6407 /* Just strip a conversion to void (or in void context) and
6409 *expr_p = TREE_OPERAND (*expr_p, 0);
6413 ret = gimplify_conversion (expr_p);
6414 if (ret == GS_ERROR)
6416 if (*expr_p != save_expr)
6420 case FIX_TRUNC_EXPR:
6421 /* unary_expr: ... | '(' cast ')' val | ... */
6422 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6423 is_gimple_val, fb_rvalue);
6424 recalculate_side_effects (*expr_p);
6428 *expr_p = fold_indirect_ref (*expr_p);
6429 if (*expr_p != save_expr)
6431 /* else fall through. */
6432 case ALIGN_INDIRECT_REF:
6433 case MISALIGNED_INDIRECT_REF:
6434 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6435 is_gimple_reg, fb_rvalue);
6436 recalculate_side_effects (*expr_p);
6439 /* Constants need not be gimplified. */
6450 /* If we require an lvalue, such as for ADDR_EXPR, retain the
6451 CONST_DECL node. Otherwise the decl is replaceable by its
6453 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
6454 if (fallback & fb_lvalue)
6457 *expr_p = DECL_INITIAL (*expr_p);
6461 ret = gimplify_decl_expr (expr_p, pre_p);
6465 /* FIXME make this a decl. */
6470 ret = gimplify_bind_expr (expr_p, pre_p);
6474 ret = gimplify_loop_expr (expr_p, pre_p);
6478 ret = gimplify_switch_expr (expr_p, pre_p);
6482 ret = gimplify_exit_expr (expr_p);
6486 /* If the target is not LABEL, then it is a computed jump
6487 and the target needs to be gimplified. */
6488 if (TREE_CODE (GOTO_DESTINATION (*expr_p)) != LABEL_DECL)
6490 ret = gimplify_expr (&GOTO_DESTINATION (*expr_p), pre_p,
6491 NULL, is_gimple_val, fb_rvalue);
6492 if (ret == GS_ERROR)
6495 gimplify_seq_add_stmt (pre_p,
6496 gimple_build_goto (GOTO_DESTINATION (*expr_p)));
6500 gimplify_seq_add_stmt (pre_p,
6501 gimple_build_predict (PREDICT_EXPR_PREDICTOR (*expr_p),
6502 PREDICT_EXPR_OUTCOME (*expr_p)));
6508 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p))
6509 == current_function_decl);
6510 gimplify_seq_add_stmt (pre_p,
6511 gimple_build_label (LABEL_EXPR_LABEL (*expr_p)));
6514 case CASE_LABEL_EXPR:
6515 ret = gimplify_case_label_expr (expr_p, pre_p);
6519 ret = gimplify_return_expr (*expr_p, pre_p);
6523 /* Don't reduce this in place; let gimplify_init_constructor work its
6524 magic. Buf if we're just elaborating this for side effects, just
6525 gimplify any element that has side-effects. */
6526 if (fallback == fb_none)
6528 unsigned HOST_WIDE_INT ix;
6529 constructor_elt *ce;
6530 tree temp = NULL_TREE;
6532 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (*expr_p),
6535 if (TREE_SIDE_EFFECTS (ce->value))
6536 append_to_statement_list (ce->value, &temp);
6541 /* C99 code may assign to an array in a constructed
6542 structure or union, and this has undefined behavior only
6543 on execution, so create a temporary if an lvalue is
6545 else if (fallback == fb_lvalue)
6547 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6548 mark_addressable (*expr_p);
6554 /* The following are special cases that are not handled by the
6555 original GIMPLE grammar. */
6557 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
6560 ret = gimplify_save_expr (expr_p, pre_p, post_p);
6565 enum gimplify_status r0, r1, r2;
6567 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6568 post_p, is_gimple_lvalue, fb_either);
6569 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
6570 post_p, is_gimple_val, fb_rvalue);
6571 r2 = gimplify_expr (&TREE_OPERAND (*expr_p, 2), pre_p,
6572 post_p, is_gimple_val, fb_rvalue);
6573 recalculate_side_effects (*expr_p);
6575 ret = MIN (r0, MIN (r1, r2));
6579 case NON_LVALUE_EXPR:
6580 /* This should have been stripped above. */
6584 ret = gimplify_asm_expr (expr_p, pre_p, post_p);
6587 case TRY_FINALLY_EXPR:
6588 case TRY_CATCH_EXPR:
6590 gimple_seq eval, cleanup;
6593 eval = cleanup = NULL;
6594 gimplify_and_add (TREE_OPERAND (*expr_p, 0), &eval);
6595 gimplify_and_add (TREE_OPERAND (*expr_p, 1), &cleanup);
6596 /* Don't create bogus GIMPLE_TRY with empty cleanup. */
6597 if (gimple_seq_empty_p (cleanup))
6599 gimple_seq_add_seq (pre_p, eval);
6603 try_ = gimple_build_try (eval, cleanup,
6604 TREE_CODE (*expr_p) == TRY_FINALLY_EXPR
6605 ? GIMPLE_TRY_FINALLY
6606 : GIMPLE_TRY_CATCH);
6607 if (TREE_CODE (*expr_p) == TRY_CATCH_EXPR)
6608 gimple_try_set_catch_is_cleanup (try_,
6609 TRY_CATCH_IS_CLEANUP (*expr_p));
6610 gimplify_seq_add_stmt (pre_p, try_);
6615 case CLEANUP_POINT_EXPR:
6616 ret = gimplify_cleanup_point_expr (expr_p, pre_p);
6620 ret = gimplify_target_expr (expr_p, pre_p, post_p);
6626 gimple_seq handler = NULL;
6627 gimplify_and_add (CATCH_BODY (*expr_p), &handler);
6628 c = gimple_build_catch (CATCH_TYPES (*expr_p), handler);
6629 gimplify_seq_add_stmt (pre_p, c);
6634 case EH_FILTER_EXPR:
6637 gimple_seq failure = NULL;
6639 gimplify_and_add (EH_FILTER_FAILURE (*expr_p), &failure);
6640 ehf = gimple_build_eh_filter (EH_FILTER_TYPES (*expr_p), failure);
6641 gimple_eh_filter_set_must_not_throw
6642 (ehf, EH_FILTER_MUST_NOT_THROW (*expr_p));
6643 gimplify_seq_add_stmt (pre_p, ehf);
6648 case CHANGE_DYNAMIC_TYPE_EXPR:
6652 ret = gimplify_expr (&CHANGE_DYNAMIC_TYPE_LOCATION (*expr_p),
6653 pre_p, post_p, is_gimple_reg, fb_lvalue);
6654 cdt = gimple_build_cdt (CHANGE_DYNAMIC_TYPE_NEW_TYPE (*expr_p),
6655 CHANGE_DYNAMIC_TYPE_LOCATION (*expr_p));
6656 gimplify_seq_add_stmt (pre_p, cdt);
6663 enum gimplify_status r0, r1;
6664 r0 = gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p), pre_p,
6665 post_p, is_gimple_val, fb_rvalue);
6666 r1 = gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p), pre_p,
6667 post_p, is_gimple_val, fb_rvalue);
6668 TREE_SIDE_EFFECTS (*expr_p) = 0;
6674 /* We get here when taking the address of a label. We mark
6675 the label as "forced"; meaning it can never be removed and
6676 it is a potential target for any computed goto. */
6677 FORCED_LABEL (*expr_p) = 1;
6681 case STATEMENT_LIST:
6682 ret = gimplify_statement_list (expr_p, pre_p);
6685 case WITH_SIZE_EXPR:
6687 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6688 post_p == &internal_post ? NULL : post_p,
6689 gimple_test_f, fallback);
6690 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
6691 is_gimple_val, fb_rvalue);
6697 ret = gimplify_var_or_parm_decl (expr_p);
6701 /* When within an OpenMP context, notice uses of variables. */
6702 if (gimplify_omp_ctxp)
6703 omp_notice_variable (gimplify_omp_ctxp, *expr_p, true);
6708 /* Allow callbacks into the gimplifier during optimization. */
6713 gimplify_omp_parallel (expr_p, pre_p);
6718 gimplify_omp_task (expr_p, pre_p);
6723 ret = gimplify_omp_for (expr_p, pre_p);
6728 gimplify_omp_workshare (expr_p, pre_p);
6737 gimple_seq body = NULL;
6740 gimplify_and_add (OMP_BODY (*expr_p), &body);
6741 switch (TREE_CODE (*expr_p))
6744 g = gimple_build_omp_section (body);
6747 g = gimple_build_omp_master (body);
6750 g = gimple_build_omp_ordered (body);
6753 g = gimple_build_omp_critical (body,
6754 OMP_CRITICAL_NAME (*expr_p));
6759 gimplify_seq_add_stmt (pre_p, g);
6765 ret = gimplify_omp_atomic (expr_p, pre_p);
6768 case POINTER_PLUS_EXPR:
6769 /* Convert ((type *)A)+offset into &A->field_of_type_and_offset.
6770 The second is gimple immediate saving a need for extra statement.
6772 if (TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
6773 && (tmp = maybe_fold_offset_to_address
6774 (TREE_OPERAND (*expr_p, 0), TREE_OPERAND (*expr_p, 1),
6775 TREE_TYPE (*expr_p))))
6780 /* Convert (void *)&a + 4 into (void *)&a[1]. */
6781 if (TREE_CODE (TREE_OPERAND (*expr_p, 0)) == NOP_EXPR
6782 && TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
6783 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p,
6785 && (tmp = maybe_fold_offset_to_address
6786 (TREE_OPERAND (TREE_OPERAND (*expr_p, 0), 0),
6787 TREE_OPERAND (*expr_p, 1),
6788 TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p, 0),
6791 *expr_p = fold_convert (TREE_TYPE (*expr_p), tmp);
6797 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p)))
6799 case tcc_comparison:
6800 /* Handle comparison of objects of non scalar mode aggregates
6801 with a call to memcmp. It would be nice to only have to do
6802 this for variable-sized objects, but then we'd have to allow
6803 the same nest of reference nodes we allow for MODIFY_EXPR and
6806 Compare scalar mode aggregates as scalar mode values. Using
6807 memcmp for them would be very inefficient at best, and is
6808 plain wrong if bitfields are involved. */
6810 tree type = TREE_TYPE (TREE_OPERAND (*expr_p, 1));
6812 if (!AGGREGATE_TYPE_P (type))
6814 else if (TYPE_MODE (type) != BLKmode)
6815 ret = gimplify_scalar_mode_aggregate_compare (expr_p);
6817 ret = gimplify_variable_sized_compare (expr_p);
6822 /* If *EXPR_P does not need to be special-cased, handle it
6823 according to its class. */
6825 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6826 post_p, is_gimple_val, fb_rvalue);
6832 enum gimplify_status r0, r1;
6834 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6835 post_p, is_gimple_val, fb_rvalue);
6836 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
6837 post_p, is_gimple_val, fb_rvalue);
6843 case tcc_declaration:
6846 goto dont_recalculate;
6849 gcc_assert (TREE_CODE (*expr_p) == TRUTH_AND_EXPR
6850 || TREE_CODE (*expr_p) == TRUTH_OR_EXPR
6851 || TREE_CODE (*expr_p) == TRUTH_XOR_EXPR);
6855 recalculate_side_effects (*expr_p);
6861 /* If we replaced *expr_p, gimplify again. */
6862 if (ret == GS_OK && (*expr_p == NULL || *expr_p == save_expr))
6865 while (ret == GS_OK);
6867 /* If we encountered an error_mark somewhere nested inside, either
6868 stub out the statement or propagate the error back out. */
6869 if (ret == GS_ERROR)
6876 /* This was only valid as a return value from the langhook, which
6877 we handled. Make sure it doesn't escape from any other context. */
6878 gcc_assert (ret != GS_UNHANDLED);
6880 if (fallback == fb_none && *expr_p && !is_gimple_stmt (*expr_p))
6882 /* We aren't looking for a value, and we don't have a valid
6883 statement. If it doesn't have side-effects, throw it away. */
6884 if (!TREE_SIDE_EFFECTS (*expr_p))
6886 else if (!TREE_THIS_VOLATILE (*expr_p))
6888 /* This is probably a _REF that contains something nested that
6889 has side effects. Recurse through the operands to find it. */
6890 enum tree_code code = TREE_CODE (*expr_p);
6897 case VIEW_CONVERT_EXPR:
6898 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6899 gimple_test_f, fallback);
6903 case ARRAY_RANGE_REF:
6904 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6905 gimple_test_f, fallback);
6906 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
6907 gimple_test_f, fallback);
6911 /* Anything else with side-effects must be converted to
6912 a valid statement before we get here. */
6918 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p))
6919 && TYPE_MODE (TREE_TYPE (*expr_p)) != BLKmode)
6921 /* Historically, the compiler has treated a bare reference
6922 to a non-BLKmode volatile lvalue as forcing a load. */
6923 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p));
6925 /* Normally, we do not want to create a temporary for a
6926 TREE_ADDRESSABLE type because such a type should not be
6927 copied by bitwise-assignment. However, we make an
6928 exception here, as all we are doing here is ensuring that
6929 we read the bytes that make up the type. We use
6930 create_tmp_var_raw because create_tmp_var will abort when
6931 given a TREE_ADDRESSABLE type. */
6932 tree tmp = create_tmp_var_raw (type, "vol");
6933 gimple_add_tmp_var (tmp);
6934 gimplify_assign (tmp, *expr_p, pre_p);
6938 /* We can't do anything useful with a volatile reference to
6939 an incomplete type, so just throw it away. Likewise for
6940 a BLKmode type, since any implicit inner load should
6941 already have been turned into an explicit one by the
6942 gimplification process. */
6946 /* If we are gimplifying at the statement level, we're done. Tack
6947 everything together and return. */
6948 if (fallback == fb_none || is_statement)
6950 /* Since *EXPR_P has been converted into a GIMPLE tuple, clear
6951 it out for GC to reclaim it. */
6952 *expr_p = NULL_TREE;
6954 if (!gimple_seq_empty_p (internal_pre)
6955 || !gimple_seq_empty_p (internal_post))
6957 gimplify_seq_add_seq (&internal_pre, internal_post);
6958 gimplify_seq_add_seq (pre_p, internal_pre);
6961 /* The result of gimplifying *EXPR_P is going to be the last few
6962 statements in *PRE_P and *POST_P. Add location information
6963 to all the statements that were added by the gimplification
6965 if (!gimple_seq_empty_p (*pre_p))
6966 annotate_all_with_location_after (*pre_p, pre_last_gsi, input_location);
6968 if (!gimple_seq_empty_p (*post_p))
6969 annotate_all_with_location_after (*post_p, post_last_gsi,
6975 #ifdef ENABLE_GIMPLE_CHECKING
6978 enum tree_code code = TREE_CODE (*expr_p);
6979 /* These expressions should already be in gimple IR form. */
6980 gcc_assert (code != MODIFY_EXPR
6982 && code != BIND_EXPR
6983 && code != CATCH_EXPR
6984 && (code != COND_EXPR || gimplify_ctxp->allow_rhs_cond_expr)
6985 && code != EH_FILTER_EXPR
6986 && code != GOTO_EXPR
6987 && code != LABEL_EXPR
6988 && code != LOOP_EXPR
6989 && code != RESX_EXPR
6990 && code != SWITCH_EXPR
6991 && code != TRY_FINALLY_EXPR
6992 && code != OMP_CRITICAL
6994 && code != OMP_MASTER
6995 && code != OMP_ORDERED
6996 && code != OMP_PARALLEL
6997 && code != OMP_SECTIONS
6998 && code != OMP_SECTION
6999 && code != OMP_SINGLE);
7003 /* Otherwise we're gimplifying a subexpression, so the resulting
7004 value is interesting. If it's a valid operand that matches
7005 GIMPLE_TEST_F, we're done. Unless we are handling some
7006 post-effects internally; if that's the case, we need to copy into
7007 a temporary before adding the post-effects to POST_P. */
7008 if (gimple_seq_empty_p (internal_post) && (*gimple_test_f) (*expr_p))
7011 /* Otherwise, we need to create a new temporary for the gimplified
7014 /* We can't return an lvalue if we have an internal postqueue. The
7015 object the lvalue refers to would (probably) be modified by the
7016 postqueue; we need to copy the value out first, which means an
7018 if ((fallback & fb_lvalue)
7019 && gimple_seq_empty_p (internal_post)
7020 && is_gimple_addressable (*expr_p))
7022 /* An lvalue will do. Take the address of the expression, store it
7023 in a temporary, and replace the expression with an INDIRECT_REF of
7025 tmp = build_fold_addr_expr (*expr_p);
7026 gimplify_expr (&tmp, pre_p, post_p, is_gimple_reg, fb_rvalue);
7027 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (tmp)), tmp);
7029 else if ((fallback & fb_rvalue) && is_gimple_formal_tmp_or_call_rhs (*expr_p))
7031 /* An rvalue will do. Assign the gimplified expression into a
7032 new temporary TMP and replace the original expression with
7033 TMP. First, make sure that the expression has a type so that
7034 it can be assigned into a temporary. */
7035 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p)));
7037 if (!gimple_seq_empty_p (internal_post) || (fallback & fb_lvalue))
7038 /* The postqueue might change the value of the expression between
7039 the initialization and use of the temporary, so we can't use a
7040 formal temp. FIXME do we care? */
7041 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
7043 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
7045 if (TREE_CODE (*expr_p) != SSA_NAME)
7046 DECL_GIMPLE_FORMAL_TEMP_P (*expr_p) = 1;
7050 #ifdef ENABLE_GIMPLE_CHECKING
7051 if (!(fallback & fb_mayfail))
7053 fprintf (stderr, "gimplification failed:\n");
7054 print_generic_expr (stderr, *expr_p, 0);
7055 debug_tree (*expr_p);
7056 internal_error ("gimplification failed");
7059 gcc_assert (fallback & fb_mayfail);
7061 /* If this is an asm statement, and the user asked for the
7062 impossible, don't die. Fail and let gimplify_asm_expr
7068 /* Make sure the temporary matches our predicate. */
7069 gcc_assert ((*gimple_test_f) (*expr_p));
7071 if (!gimple_seq_empty_p (internal_post))
7073 annotate_all_with_location (internal_post, input_location);
7074 gimplify_seq_add_seq (pre_p, internal_post);
7078 input_location = saved_location;
7082 /* Look through TYPE for variable-sized objects and gimplify each such
7083 size that we find. Add to LIST_P any statements generated. */
7086 gimplify_type_sizes (tree type, gimple_seq *list_p)
7090 if (type == NULL || type == error_mark_node)
7093 /* We first do the main variant, then copy into any other variants. */
7094 type = TYPE_MAIN_VARIANT (type);
7096 /* Avoid infinite recursion. */
7097 if (TYPE_SIZES_GIMPLIFIED (type))
7100 TYPE_SIZES_GIMPLIFIED (type) = 1;
7102 switch (TREE_CODE (type))
7108 case FIXED_POINT_TYPE:
7109 gimplify_one_sizepos (&TYPE_MIN_VALUE (type), list_p);
7110 gimplify_one_sizepos (&TYPE_MAX_VALUE (type), list_p);
7112 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
7114 TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (type);
7115 TYPE_MAX_VALUE (t) = TYPE_MAX_VALUE (type);
7120 /* These types may not have declarations, so handle them here. */
7121 gimplify_type_sizes (TREE_TYPE (type), list_p);
7122 gimplify_type_sizes (TYPE_DOMAIN (type), list_p);
7123 /* When not optimizing, ensure VLA bounds aren't removed. */
7125 && TYPE_DOMAIN (type)
7126 && INTEGRAL_TYPE_P (TYPE_DOMAIN (type)))
7128 t = TYPE_MIN_VALUE (TYPE_DOMAIN (type));
7129 if (t && TREE_CODE (t) == VAR_DECL && DECL_ARTIFICIAL (t))
7130 DECL_IGNORED_P (t) = 0;
7131 t = TYPE_MAX_VALUE (TYPE_DOMAIN (type));
7132 if (t && TREE_CODE (t) == VAR_DECL && DECL_ARTIFICIAL (t))
7133 DECL_IGNORED_P (t) = 0;
7139 case QUAL_UNION_TYPE:
7140 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
7141 if (TREE_CODE (field) == FIELD_DECL)
7143 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field), list_p);
7144 gimplify_one_sizepos (&DECL_SIZE (field), list_p);
7145 gimplify_one_sizepos (&DECL_SIZE_UNIT (field), list_p);
7146 gimplify_type_sizes (TREE_TYPE (field), list_p);
7151 case REFERENCE_TYPE:
7152 /* We used to recurse on the pointed-to type here, which turned out to
7153 be incorrect because its definition might refer to variables not
7154 yet initialized at this point if a forward declaration is involved.
7156 It was actually useful for anonymous pointed-to types to ensure
7157 that the sizes evaluation dominates every possible later use of the
7158 values. Restricting to such types here would be safe since there
7159 is no possible forward declaration around, but would introduce an
7160 undesirable middle-end semantic to anonymity. We then defer to
7161 front-ends the responsibility of ensuring that the sizes are
7162 evaluated both early and late enough, e.g. by attaching artificial
7163 type declarations to the tree. */
7170 gimplify_one_sizepos (&TYPE_SIZE (type), list_p);
7171 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type), list_p);
7173 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
7175 TYPE_SIZE (t) = TYPE_SIZE (type);
7176 TYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (type);
7177 TYPE_SIZES_GIMPLIFIED (t) = 1;
7181 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
7182 a size or position, has had all of its SAVE_EXPRs evaluated.
7183 We add any required statements to *STMT_P. */
7186 gimplify_one_sizepos (tree *expr_p, gimple_seq *stmt_p)
7188 tree type, expr = *expr_p;
7190 /* We don't do anything if the value isn't there, is constant, or contains
7191 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
7192 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
7193 will want to replace it with a new variable, but that will cause problems
7194 if this type is from outside the function. It's OK to have that here. */
7195 if (expr == NULL_TREE || TREE_CONSTANT (expr)
7196 || TREE_CODE (expr) == VAR_DECL
7197 || CONTAINS_PLACEHOLDER_P (expr))
7200 type = TREE_TYPE (expr);
7201 *expr_p = unshare_expr (expr);
7203 gimplify_expr (expr_p, stmt_p, NULL, is_gimple_val, fb_rvalue);
7206 /* Verify that we've an exact type match with the original expression.
7207 In particular, we do not wish to drop a "sizetype" in favour of a
7208 type of similar dimensions. We don't want to pollute the generic
7209 type-stripping code with this knowledge because it doesn't matter
7210 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
7211 and friends retain their "sizetype-ness". */
7212 if (TREE_TYPE (expr) != type
7213 && TREE_CODE (type) == INTEGER_TYPE
7214 && TYPE_IS_SIZETYPE (type))
7219 *expr_p = create_tmp_var (type, NULL);
7220 tmp = build1 (NOP_EXPR, type, expr);
7221 stmt = gimplify_assign (*expr_p, tmp, stmt_p);
7222 if (EXPR_HAS_LOCATION (expr))
7223 gimple_set_location (stmt, *EXPR_LOCUS (expr));
7225 gimple_set_location (stmt, input_location);
7230 /* Gimplify the body of statements pointed to by BODY_P and return a
7231 GIMPLE_BIND containing the sequence of GIMPLE statements
7232 corresponding to BODY_P. FNDECL is the function decl containing
7236 gimplify_body (tree *body_p, tree fndecl, bool do_parms)
7238 location_t saved_location = input_location;
7239 gimple_seq parm_stmts, seq;
7241 struct gimplify_ctx gctx;
7243 timevar_push (TV_TREE_GIMPLIFY);
7245 /* Initialize for optimize_insn_for_s{ize,peed}_p possibly called during
7247 default_rtl_profile ();
7249 gcc_assert (gimplify_ctxp == NULL);
7250 push_gimplify_context (&gctx);
7252 /* Unshare most shared trees in the body and in that of any nested functions.
7253 It would seem we don't have to do this for nested functions because
7254 they are supposed to be output and then the outer function gimplified
7255 first, but the g++ front end doesn't always do it that way. */
7256 unshare_body (body_p, fndecl);
7257 unvisit_body (body_p, fndecl);
7259 /* Make sure input_location isn't set to something weird. */
7260 input_location = DECL_SOURCE_LOCATION (fndecl);
7262 /* Resolve callee-copies. This has to be done before processing
7263 the body so that DECL_VALUE_EXPR gets processed correctly. */
7264 parm_stmts = (do_parms) ? gimplify_parameters () : NULL;
7266 /* Gimplify the function's body. */
7268 gimplify_stmt (body_p, &seq);
7269 outer_bind = gimple_seq_first_stmt (seq);
7272 outer_bind = gimple_build_nop ();
7273 gimplify_seq_add_stmt (&seq, outer_bind);
7276 /* The body must contain exactly one statement, a GIMPLE_BIND. If this is
7277 not the case, wrap everything in a GIMPLE_BIND to make it so. */
7278 if (gimple_code (outer_bind) == GIMPLE_BIND
7279 && gimple_seq_first (seq) == gimple_seq_last (seq))
7282 outer_bind = gimple_build_bind (NULL_TREE, seq, NULL);
7284 *body_p = NULL_TREE;
7286 /* If we had callee-copies statements, insert them at the beginning
7288 if (!gimple_seq_empty_p (parm_stmts))
7290 gimplify_seq_add_seq (&parm_stmts, gimple_bind_body (outer_bind));
7291 gimple_bind_set_body (outer_bind, parm_stmts);
7294 pop_gimplify_context (outer_bind);
7295 gcc_assert (gimplify_ctxp == NULL);
7297 #ifdef ENABLE_TYPES_CHECKING
7298 if (!errorcount && !sorrycount)
7299 verify_types_in_gimple_seq (gimple_bind_body (outer_bind));
7302 timevar_pop (TV_TREE_GIMPLIFY);
7303 input_location = saved_location;
7308 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
7309 node for the function we want to gimplify.
7311 Returns the sequence of GIMPLE statements corresponding to the body
7315 gimplify_function_tree (tree fndecl)
7317 tree oldfn, parm, ret;
7321 oldfn = current_function_decl;
7322 current_function_decl = fndecl;
7323 if (DECL_STRUCT_FUNCTION (fndecl))
7324 push_cfun (DECL_STRUCT_FUNCTION (fndecl));
7326 push_struct_function (fndecl);
7328 for (parm = DECL_ARGUMENTS (fndecl); parm ; parm = TREE_CHAIN (parm))
7330 /* Preliminarily mark non-addressed complex variables as eligible
7331 for promotion to gimple registers. We'll transform their uses
7333 if ((TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
7334 || TREE_CODE (TREE_TYPE (parm)) == VECTOR_TYPE)
7335 && !TREE_THIS_VOLATILE (parm)
7336 && !needs_to_live_in_memory (parm))
7337 DECL_GIMPLE_REG_P (parm) = 1;
7340 ret = DECL_RESULT (fndecl);
7341 if ((TREE_CODE (TREE_TYPE (ret)) == COMPLEX_TYPE
7342 || TREE_CODE (TREE_TYPE (ret)) == VECTOR_TYPE)
7343 && !needs_to_live_in_memory (ret))
7344 DECL_GIMPLE_REG_P (ret) = 1;
7346 bind = gimplify_body (&DECL_SAVED_TREE (fndecl), fndecl, true);
7348 /* The tree body of the function is no longer needed, replace it
7349 with the new GIMPLE body. */
7350 seq = gimple_seq_alloc ();
7351 gimple_seq_add_stmt (&seq, bind);
7352 gimple_set_body (fndecl, seq);
7354 /* If we're instrumenting function entry/exit, then prepend the call to
7355 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
7356 catch the exit hook. */
7357 /* ??? Add some way to ignore exceptions for this TFE. */
7358 if (flag_instrument_function_entry_exit
7359 && !DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl)
7360 && !flag_instrument_functions_exclude_p (fndecl))
7365 gimple_seq cleanup = NULL, body = NULL;
7367 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_EXIT];
7368 gimplify_seq_add_stmt (&cleanup, gimple_build_call (x, 0));
7369 tf = gimple_build_try (seq, cleanup, GIMPLE_TRY_FINALLY);
7371 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_ENTER];
7372 gimplify_seq_add_stmt (&body, gimple_build_call (x, 0));
7373 gimplify_seq_add_stmt (&body, tf);
7374 new_bind = gimple_build_bind (NULL, body, gimple_bind_block (bind));
7375 /* Clear the block for BIND, since it is no longer directly inside
7376 the function, but within a try block. */
7377 gimple_bind_set_block (bind, NULL);
7379 /* Replace the current function body with the body
7380 wrapped in the try/finally TF. */
7381 seq = gimple_seq_alloc ();
7382 gimple_seq_add_stmt (&seq, new_bind);
7383 gimple_set_body (fndecl, seq);
7386 DECL_SAVED_TREE (fndecl) = NULL_TREE;
7388 current_function_decl = oldfn;
7393 /* Some transformations like inlining may invalidate the GIMPLE form
7394 for operands. This function traverses all the operands in STMT and
7395 gimplifies anything that is not a valid gimple operand. Any new
7396 GIMPLE statements are inserted before *GSI_P. */
7399 gimple_regimplify_operands (gimple stmt, gimple_stmt_iterator *gsi_p)
7402 tree orig_lhs = NULL_TREE, lhs, t;
7403 gimple_seq pre = NULL;
7404 gimple post_stmt = NULL;
7405 struct gimplify_ctx gctx;
7407 push_gimplify_context (&gctx);
7408 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
7410 switch (gimple_code (stmt))
7413 gimplify_expr (gimple_cond_lhs_ptr (stmt), &pre, NULL,
7414 is_gimple_val, fb_rvalue);
7415 gimplify_expr (gimple_cond_rhs_ptr (stmt), &pre, NULL,
7416 is_gimple_val, fb_rvalue);
7419 gimplify_expr (gimple_switch_index_ptr (stmt), &pre, NULL,
7420 is_gimple_val, fb_rvalue);
7422 case GIMPLE_OMP_ATOMIC_LOAD:
7423 gimplify_expr (gimple_omp_atomic_load_rhs_ptr (stmt), &pre, NULL,
7424 is_gimple_val, fb_rvalue);
7428 size_t i, noutputs = gimple_asm_noutputs (stmt);
7429 const char *constraint, **oconstraints;
7430 bool allows_mem, allows_reg, is_inout;
7433 = (const char **) alloca ((noutputs) * sizeof (const char *));
7434 for (i = 0; i < noutputs; i++)
7436 tree op = gimple_asm_output_op (stmt, i);
7437 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
7438 oconstraints[i] = constraint;
7439 parse_output_constraint (&constraint, i, 0, 0, &allows_mem,
7440 &allows_reg, &is_inout);
7441 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
7442 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
7443 fb_lvalue | fb_mayfail);
7445 for (i = 0; i < gimple_asm_ninputs (stmt); i++)
7447 tree op = gimple_asm_input_op (stmt, i);
7448 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
7449 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
7450 oconstraints, &allows_mem, &allows_reg);
7451 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (op))) && allows_mem)
7453 if (!allows_reg && allows_mem)
7454 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
7455 is_gimple_lvalue, fb_lvalue | fb_mayfail);
7457 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
7458 is_gimple_asm_val, fb_rvalue);
7463 /* NOTE: We start gimplifying operands from last to first to
7464 make sure that side-effects on the RHS of calls, assignments
7465 and ASMs are executed before the LHS. The ordering is not
7466 important for other statements. */
7467 num_ops = gimple_num_ops (stmt);
7468 orig_lhs = gimple_get_lhs (stmt);
7469 for (i = num_ops; i > 0; i--)
7471 tree op = gimple_op (stmt, i - 1);
7472 if (op == NULL_TREE)
7474 if (i == 1 && (is_gimple_call (stmt) || is_gimple_assign (stmt)))
7475 gimplify_expr (&op, &pre, NULL, is_gimple_lvalue, fb_lvalue);
7477 && is_gimple_assign (stmt)
7479 && get_gimple_rhs_class (gimple_expr_code (stmt))
7480 == GIMPLE_SINGLE_RHS)
7481 gimplify_expr (&op, &pre, NULL,
7482 rhs_predicate_for (gimple_assign_lhs (stmt)),
7484 else if (i == 2 && is_gimple_call (stmt))
7486 if (TREE_CODE (op) == FUNCTION_DECL)
7488 gimplify_expr (&op, &pre, NULL, is_gimple_call_addr, fb_rvalue);
7491 gimplify_expr (&op, &pre, NULL, is_gimple_val, fb_rvalue);
7492 gimple_set_op (stmt, i - 1, op);
7495 lhs = gimple_get_lhs (stmt);
7496 /* If the LHS changed it in a way that requires a simple RHS,
7497 create temporary. */
7498 if (lhs && !is_gimple_formal_tmp_var (lhs))
7500 bool need_temp = false;
7502 if (is_gimple_assign (stmt)
7504 && get_gimple_rhs_class (gimple_expr_code (stmt))
7505 == GIMPLE_SINGLE_RHS)
7506 gimplify_expr (gimple_assign_rhs1_ptr (stmt), &pre, NULL,
7507 rhs_predicate_for (gimple_assign_lhs (stmt)),
7509 else if (is_gimple_reg (lhs))
7511 if (is_gimple_reg_type (TREE_TYPE (lhs)))
7513 if (is_gimple_call (stmt))
7515 i = gimple_call_flags (stmt);
7516 if ((i & ECF_LOOPING_CONST_OR_PURE)
7517 || !(i & (ECF_CONST | ECF_PURE)))
7520 if (stmt_can_throw_internal (stmt))
7526 if (is_gimple_reg_type (TREE_TYPE (lhs)))
7528 else if (TYPE_MODE (TREE_TYPE (lhs)) != BLKmode)
7530 if (is_gimple_call (stmt))
7532 tree fndecl = gimple_call_fndecl (stmt);
7534 if (!aggregate_value_p (TREE_TYPE (lhs), fndecl)
7535 && !(fndecl && DECL_RESULT (fndecl)
7536 && DECL_BY_REFERENCE (DECL_RESULT (fndecl))))
7545 tree temp = create_tmp_var (TREE_TYPE (lhs), NULL);
7547 DECL_GIMPLE_FORMAL_TEMP_P (temp) = 1;
7548 if (TREE_CODE (TREE_TYPE (lhs)) == COMPLEX_TYPE
7549 || TREE_CODE (TREE_TYPE (lhs)) == VECTOR_TYPE)
7550 DECL_GIMPLE_REG_P (temp) = 1;
7551 if (TREE_CODE (orig_lhs) == SSA_NAME)
7552 orig_lhs = SSA_NAME_VAR (orig_lhs);
7553 if (TREE_CODE (orig_lhs) == VAR_DECL
7554 && DECL_BASED_ON_RESTRICT_P (orig_lhs))
7556 DECL_BASED_ON_RESTRICT_P (temp) = 1;
7557 SET_DECL_RESTRICT_BASE (temp,
7558 DECL_GET_RESTRICT_BASE (orig_lhs));
7561 if (gimple_in_ssa_p (cfun))
7562 temp = make_ssa_name (temp, NULL);
7563 gimple_set_lhs (stmt, temp);
7564 post_stmt = gimple_build_assign (lhs, temp);
7565 if (TREE_CODE (lhs) == SSA_NAME)
7566 SSA_NAME_DEF_STMT (lhs) = post_stmt;
7572 if (gimple_referenced_vars (cfun))
7573 for (t = gimplify_ctxp->temps; t ; t = TREE_CHAIN (t))
7574 add_referenced_var (t);
7576 if (!gimple_seq_empty_p (pre))
7578 if (gimple_in_ssa_p (cfun))
7580 gimple_stmt_iterator i;
7582 for (i = gsi_start (pre); !gsi_end_p (i); gsi_next (&i))
7583 mark_symbols_for_renaming (gsi_stmt (i));
7585 gsi_insert_seq_before (gsi_p, pre, GSI_SAME_STMT);
7588 gsi_insert_after (gsi_p, post_stmt, GSI_NEW_STMT);
7590 pop_gimplify_context (NULL);
7594 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
7595 force the result to be either ssa_name or an invariant, otherwise
7596 just force it to be a rhs expression. If VAR is not NULL, make the
7597 base variable of the final destination be VAR if suitable. */
7600 force_gimple_operand (tree expr, gimple_seq *stmts, bool simple, tree var)
7603 enum gimplify_status ret;
7604 gimple_predicate gimple_test_f;
7605 struct gimplify_ctx gctx;
7609 if (is_gimple_val (expr))
7612 gimple_test_f = simple ? is_gimple_val : is_gimple_reg_rhs;
7614 push_gimplify_context (&gctx);
7615 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
7616 gimplify_ctxp->allow_rhs_cond_expr = true;
7619 expr = build2 (MODIFY_EXPR, TREE_TYPE (var), var, expr);
7621 if (TREE_CODE (expr) != MODIFY_EXPR
7622 && TREE_TYPE (expr) == void_type_node)
7624 gimplify_and_add (expr, stmts);
7629 ret = gimplify_expr (&expr, stmts, NULL, gimple_test_f, fb_rvalue);
7630 gcc_assert (ret != GS_ERROR);
7633 if (gimple_referenced_vars (cfun))
7634 for (t = gimplify_ctxp->temps; t ; t = TREE_CHAIN (t))
7635 add_referenced_var (t);
7637 pop_gimplify_context (NULL);
7642 /* Invokes force_gimple_operand for EXPR with parameters SIMPLE_P and VAR. If
7643 some statements are produced, emits them at GSI. If BEFORE is true.
7644 the statements are appended before GSI, otherwise they are appended after
7645 it. M specifies the way GSI moves after insertion (GSI_SAME_STMT or
7646 GSI_CONTINUE_LINKING are the usual values). */
7649 force_gimple_operand_gsi (gimple_stmt_iterator *gsi, tree expr,
7650 bool simple_p, tree var, bool before,
7651 enum gsi_iterator_update m)
7655 expr = force_gimple_operand (expr, &stmts, simple_p, var);
7657 if (!gimple_seq_empty_p (stmts))
7659 if (gimple_in_ssa_p (cfun))
7661 gimple_stmt_iterator i;
7663 for (i = gsi_start (stmts); !gsi_end_p (i); gsi_next (&i))
7664 mark_symbols_for_renaming (gsi_stmt (i));
7668 gsi_insert_seq_before (gsi, stmts, m);
7670 gsi_insert_seq_after (gsi, stmts, m);
7676 #include "gt-gimplify.h"