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
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 && TREE_CODE (x) != PARM_DECL)
117 TREE_ADDRESSABLE (x) = 1;
120 /* Return a hash value for a formal temporary table entry. */
123 gimple_tree_hash (const void *p)
125 tree t = ((const elt_t *) p)->val;
126 return iterative_hash_expr (t, 0);
129 /* Compare two formal temporary table entries. */
132 gimple_tree_eq (const void *p1, const void *p2)
134 tree t1 = ((const elt_t *) p1)->val;
135 tree t2 = ((const elt_t *) p2)->val;
136 enum tree_code code = TREE_CODE (t1);
138 if (TREE_CODE (t2) != code
139 || TREE_TYPE (t1) != TREE_TYPE (t2))
142 if (!operand_equal_p (t1, t2, 0))
145 /* Only allow them to compare equal if they also hash equal; otherwise
146 results are nondeterminate, and we fail bootstrap comparison. */
147 gcc_assert (gimple_tree_hash (p1) == gimple_tree_hash (p2));
152 /* Link gimple statement GS to the end of the sequence *SEQ_P. If
153 *SEQ_P is NULL, a new sequence is allocated. This function is
154 similar to gimple_seq_add_stmt, but does not scan the operands.
155 During gimplification, we need to manipulate statement sequences
156 before the def/use vectors have been constructed. */
159 gimplify_seq_add_stmt (gimple_seq *seq_p, gimple gs)
161 gimple_stmt_iterator si;
167 *seq_p = gimple_seq_alloc ();
169 si = gsi_last (*seq_p);
171 gsi_insert_after_without_update (&si, gs, GSI_NEW_STMT);
174 /* Append sequence SRC to the end of sequence *DST_P. If *DST_P is
175 NULL, a new sequence is allocated. This function is
176 similar to gimple_seq_add_seq, but does not scan the operands.
177 During gimplification, we need to manipulate statement sequences
178 before the def/use vectors have been constructed. */
181 gimplify_seq_add_seq (gimple_seq *dst_p, gimple_seq src)
183 gimple_stmt_iterator si;
189 *dst_p = gimple_seq_alloc ();
191 si = gsi_last (*dst_p);
192 gsi_insert_seq_after_without_update (&si, src, GSI_NEW_STMT);
195 /* Set up a context for the gimplifier. */
198 push_gimplify_context (struct gimplify_ctx *c)
200 memset (c, '\0', sizeof (*c));
201 c->prev_context = gimplify_ctxp;
205 /* Tear down a context for the gimplifier. If BODY is non-null, then
206 put the temporaries into the outer BIND_EXPR. Otherwise, put them
209 BODY is not a sequence, but the first tuple in a sequence. */
212 pop_gimplify_context (gimple body)
214 struct gimplify_ctx *c = gimplify_ctxp;
217 gcc_assert (c && (c->bind_expr_stack == NULL
218 || VEC_empty (gimple, c->bind_expr_stack)));
219 VEC_free (gimple, heap, c->bind_expr_stack);
220 gimplify_ctxp = c->prev_context;
222 for (t = c->temps; t ; t = TREE_CHAIN (t))
223 DECL_GIMPLE_FORMAL_TEMP_P (t) = 0;
226 declare_vars (c->temps, body, false);
228 record_vars (c->temps);
231 htab_delete (c->temp_htab);
235 gimple_push_bind_expr (gimple gimple_bind)
237 if (gimplify_ctxp->bind_expr_stack == NULL)
238 gimplify_ctxp->bind_expr_stack = VEC_alloc (gimple, heap, 8);
239 VEC_safe_push (gimple, heap, gimplify_ctxp->bind_expr_stack, gimple_bind);
243 gimple_pop_bind_expr (void)
245 VEC_pop (gimple, gimplify_ctxp->bind_expr_stack);
249 gimple_current_bind_expr (void)
251 return VEC_last (gimple, gimplify_ctxp->bind_expr_stack);
254 /* Return the stack GIMPLE_BINDs created during gimplification. */
257 gimple_bind_expr_stack (void)
259 return gimplify_ctxp->bind_expr_stack;
262 /* Returns true iff there is a COND_EXPR between us and the innermost
263 CLEANUP_POINT_EXPR. This info is used by gimple_push_cleanup. */
266 gimple_conditional_context (void)
268 return gimplify_ctxp->conditions > 0;
271 /* Note that we've entered a COND_EXPR. */
274 gimple_push_condition (void)
276 #ifdef ENABLE_GIMPLE_CHECKING
277 if (gimplify_ctxp->conditions == 0)
278 gcc_assert (gimple_seq_empty_p (gimplify_ctxp->conditional_cleanups));
280 ++(gimplify_ctxp->conditions);
283 /* Note that we've left a COND_EXPR. If we're back at unconditional scope
284 now, add any conditional cleanups we've seen to the prequeue. */
287 gimple_pop_condition (gimple_seq *pre_p)
289 int conds = --(gimplify_ctxp->conditions);
291 gcc_assert (conds >= 0);
294 gimplify_seq_add_seq (pre_p, gimplify_ctxp->conditional_cleanups);
295 gimplify_ctxp->conditional_cleanups = NULL;
299 /* A stable comparison routine for use with splay trees and DECLs. */
302 splay_tree_compare_decl_uid (splay_tree_key xa, splay_tree_key xb)
307 return DECL_UID (a) - DECL_UID (b);
310 /* Create a new omp construct that deals with variable remapping. */
312 static struct gimplify_omp_ctx *
313 new_omp_context (enum omp_region_type region_type)
315 struct gimplify_omp_ctx *c;
317 c = XCNEW (struct gimplify_omp_ctx);
318 c->outer_context = gimplify_omp_ctxp;
319 c->variables = splay_tree_new (splay_tree_compare_decl_uid, 0, 0);
320 c->privatized_types = pointer_set_create ();
321 c->location = input_location;
322 c->region_type = region_type;
323 if (region_type != ORT_TASK)
324 c->default_kind = OMP_CLAUSE_DEFAULT_SHARED;
326 c->default_kind = OMP_CLAUSE_DEFAULT_UNSPECIFIED;
331 /* Destroy an omp construct that deals with variable remapping. */
334 delete_omp_context (struct gimplify_omp_ctx *c)
336 splay_tree_delete (c->variables);
337 pointer_set_destroy (c->privatized_types);
341 static void omp_add_variable (struct gimplify_omp_ctx *, tree, unsigned int);
342 static bool omp_notice_variable (struct gimplify_omp_ctx *, tree, bool);
344 /* A subroutine of append_to_statement_list{,_force}. T is not NULL. */
347 append_to_statement_list_1 (tree t, tree *list_p)
350 tree_stmt_iterator i;
354 if (t && TREE_CODE (t) == STATEMENT_LIST)
359 *list_p = list = alloc_stmt_list ();
363 tsi_link_after (&i, t, TSI_CONTINUE_LINKING);
366 /* Add T to the end of the list container pointed to by LIST_P.
367 If T is an expression with no effects, it is ignored. */
370 append_to_statement_list (tree t, tree *list_p)
372 if (t && TREE_SIDE_EFFECTS (t))
373 append_to_statement_list_1 (t, list_p);
376 /* Similar, but the statement is always added, regardless of side effects. */
379 append_to_statement_list_force (tree t, tree *list_p)
382 append_to_statement_list_1 (t, list_p);
385 /* Both gimplify the statement T and append it to *SEQ_P. This function
386 behaves exactly as gimplify_stmt, but you don't have to pass T as a
390 gimplify_and_add (tree t, gimple_seq *seq_p)
392 gimplify_stmt (&t, seq_p);
395 /* Gimplify statement T into sequence *SEQ_P, and return the first
396 tuple in the sequence of generated tuples for this statement.
397 Return NULL if gimplifying T produced no tuples. */
400 gimplify_and_return_first (tree t, gimple_seq *seq_p)
402 gimple_stmt_iterator last = gsi_last (*seq_p);
404 gimplify_and_add (t, seq_p);
406 if (!gsi_end_p (last))
409 return gsi_stmt (last);
412 return gimple_seq_first_stmt (*seq_p);
415 /* Strip off a legitimate source ending from the input string NAME of
416 length LEN. Rather than having to know the names used by all of
417 our front ends, we strip off an ending of a period followed by
418 up to five characters. (Java uses ".class".) */
421 remove_suffix (char *name, int len)
425 for (i = 2; i < 8 && len > i; i++)
427 if (name[len - i] == '.')
429 name[len - i] = '\0';
435 /* Subroutine for find_single_pointer_decl. */
438 find_single_pointer_decl_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
441 tree *pdecl = (tree *) data;
443 /* We are only looking for pointers at the same level as the
444 original tree; we must not look through any indirections.
445 Returning anything other than NULL_TREE will cause the caller to
447 if (REFERENCE_CLASS_P (*tp))
450 if (DECL_P (*tp) && POINTER_TYPE_P (TREE_TYPE (*tp)))
454 /* We already found a pointer decl; return anything other
455 than NULL_TREE to unwind from walk_tree signalling that
456 we have a duplicate. */
465 /* Find the single DECL of pointer type in the tree T, used directly
466 rather than via an indirection, and return it. If there are zero
467 or more than one such DECLs, return NULL. */
470 find_single_pointer_decl (tree t)
472 tree decl = NULL_TREE;
474 if (walk_tree (&t, find_single_pointer_decl_1, &decl, NULL))
476 /* find_single_pointer_decl_1 returns a nonzero value, causing
477 walk_tree to return a nonzero value, to indicate that it
478 found more than one pointer DECL or that it found an
486 /* Create a new temporary name with PREFIX. Returns an identifier. */
488 static GTY(()) unsigned int tmp_var_id_num;
491 create_tmp_var_name (const char *prefix)
497 char *preftmp = ASTRDUP (prefix);
499 remove_suffix (preftmp, strlen (preftmp));
503 ASM_FORMAT_PRIVATE_NAME (tmp_name, prefix ? prefix : "T", tmp_var_id_num++);
504 return get_identifier (tmp_name);
508 /* Create a new temporary variable declaration of type TYPE.
509 Does NOT push it into the current binding. */
512 create_tmp_var_raw (tree type, const char *prefix)
517 /* Make the type of the variable writable. */
518 new_type = build_type_variant (type, 0, 0);
519 TYPE_ATTRIBUTES (new_type) = TYPE_ATTRIBUTES (type);
521 tmp_var = build_decl (VAR_DECL, prefix ? create_tmp_var_name (prefix) : NULL,
524 /* The variable was declared by the compiler. */
525 DECL_ARTIFICIAL (tmp_var) = 1;
526 /* And we don't want debug info for it. */
527 DECL_IGNORED_P (tmp_var) = 1;
529 /* Make the variable writable. */
530 TREE_READONLY (tmp_var) = 0;
532 DECL_EXTERNAL (tmp_var) = 0;
533 TREE_STATIC (tmp_var) = 0;
534 TREE_USED (tmp_var) = 1;
539 /* Create a new temporary variable declaration of type TYPE. DOES push the
540 variable into the current binding. Further, assume that this is called
541 only from gimplification or optimization, at which point the creation of
542 certain types are bugs. */
545 create_tmp_var (tree type, const char *prefix)
549 /* We don't allow types that are addressable (meaning we can't make copies),
550 or incomplete. We also used to reject every variable size objects here,
551 but now support those for which a constant upper bound can be obtained.
552 The processing for variable sizes is performed in gimple_add_tmp_var,
553 point at which it really matters and possibly reached via paths not going
554 through this function, e.g. after direct calls to create_tmp_var_raw. */
555 gcc_assert (!TREE_ADDRESSABLE (type) && COMPLETE_TYPE_P (type));
557 tmp_var = create_tmp_var_raw (type, prefix);
558 gimple_add_tmp_var (tmp_var);
562 /* Create a temporary with a name derived from VAL. Subroutine of
563 lookup_tmp_var; nobody else should call this function. */
566 create_tmp_from_val (tree val)
568 return create_tmp_var (TREE_TYPE (val), get_name (val));
571 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
572 an existing expression temporary. */
575 lookup_tmp_var (tree val, bool is_formal)
579 /* If not optimizing, never really reuse a temporary. local-alloc
580 won't allocate any variable that is used in more than one basic
581 block, which means it will go into memory, causing much extra
582 work in reload and final and poorer code generation, outweighing
583 the extra memory allocation here. */
584 if (!optimize || !is_formal || TREE_SIDE_EFFECTS (val))
585 ret = create_tmp_from_val (val);
592 if (gimplify_ctxp->temp_htab == NULL)
593 gimplify_ctxp->temp_htab
594 = htab_create (1000, gimple_tree_hash, gimple_tree_eq, free);
595 slot = htab_find_slot (gimplify_ctxp->temp_htab, (void *)&elt, INSERT);
598 elt_p = XNEW (elt_t);
600 elt_p->temp = ret = create_tmp_from_val (val);
601 *slot = (void *) elt_p;
605 elt_p = (elt_t *) *slot;
611 DECL_GIMPLE_FORMAL_TEMP_P (ret) = 1;
617 /* Return true if T is a CALL_EXPR or an expression that can be
618 assignmed to a temporary. Note that this predicate should only be
619 used during gimplification. See the rationale for this in
620 gimplify_modify_expr. */
623 is_gimple_formal_tmp_or_call_rhs (tree t)
625 return TREE_CODE (t) == CALL_EXPR || is_gimple_formal_tmp_rhs (t);
628 /* Returns true iff T is a valid RHS for an assignment to a renamed
629 user -- or front-end generated artificial -- variable. */
632 is_gimple_reg_or_call_rhs (tree t)
634 /* If the RHS of the MODIFY_EXPR may throw or make a nonlocal goto
635 and the LHS is a user variable, then we need to introduce a formal
636 temporary. This way the optimizers can determine that the user
637 variable is only modified if evaluation of the RHS does not throw.
639 Don't force a temp of a non-renamable type; the copy could be
640 arbitrarily expensive. Instead we will generate a VDEF for
643 if (is_gimple_reg_type (TREE_TYPE (t))
644 && ((TREE_CODE (t) == CALL_EXPR && TREE_SIDE_EFFECTS (t))
645 || tree_could_throw_p (t)))
648 return is_gimple_formal_tmp_or_call_rhs (t);
651 /* Return true if T is a valid memory RHS or a CALL_EXPR. Note that
652 this predicate should only be used during gimplification. See the
653 rationale for this in gimplify_modify_expr. */
656 is_gimple_mem_or_call_rhs (tree t)
658 /* If we're dealing with a renamable type, either source or dest must be
659 a renamed variable. */
660 if (is_gimple_reg_type (TREE_TYPE (t)))
661 return is_gimple_val (t);
663 return is_gimple_formal_tmp_or_call_rhs (t);
667 /* Returns a formal temporary variable initialized with VAL. PRE_P is as
668 in gimplify_expr. Only use this function if:
670 1) The value of the unfactored expression represented by VAL will not
671 change between the initialization and use of the temporary, and
672 2) The temporary will not be otherwise modified.
674 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
675 and #2 means it is inappropriate for && temps.
677 For other cases, use get_initialized_tmp_var instead. */
680 internal_get_tmp_var (tree val, gimple_seq *pre_p, gimple_seq *post_p,
685 /* Notice that we explicitly allow VAL to be a CALL_EXPR so that we
686 can create an INIT_EXPR and convert it into a GIMPLE_CALL below. */
687 gimplify_expr (&val, pre_p, post_p, is_gimple_formal_tmp_or_call_rhs,
690 t = lookup_tmp_var (val, is_formal);
694 tree u = find_single_pointer_decl (val);
696 if (u && TREE_CODE (u) == VAR_DECL && DECL_BASED_ON_RESTRICT_P (u))
697 u = DECL_GET_RESTRICT_BASE (u);
698 if (u && TYPE_RESTRICT (TREE_TYPE (u)))
700 if (DECL_BASED_ON_RESTRICT_P (t))
701 gcc_assert (u == DECL_GET_RESTRICT_BASE (t));
704 DECL_BASED_ON_RESTRICT_P (t) = 1;
705 SET_DECL_RESTRICT_BASE (t, u);
710 if (TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
711 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
712 DECL_GIMPLE_REG_P (t) = 1;
714 mod = build2 (INIT_EXPR, TREE_TYPE (t), t, unshare_expr (val));
716 if (EXPR_HAS_LOCATION (val))
717 SET_EXPR_LOCUS (mod, EXPR_LOCUS (val));
719 SET_EXPR_LOCATION (mod, input_location);
721 /* gimplify_modify_expr might want to reduce this further. */
722 gimplify_and_add (mod, pre_p);
725 /* If we're gimplifying into ssa, gimplify_modify_expr will have
726 given our temporary an SSA name. Find and return it. */
727 if (gimplify_ctxp->into_ssa)
729 gimple last = gimple_seq_last_stmt (*pre_p);
730 t = gimple_get_lhs (last);
736 /* Returns a formal temporary variable initialized with VAL. PRE_P
737 points to a sequence where side-effects needed to compute VAL should be
741 get_formal_tmp_var (tree val, gimple_seq *pre_p)
743 return internal_get_tmp_var (val, pre_p, NULL, true);
746 /* Returns a temporary variable initialized with VAL. PRE_P and POST_P
747 are as in gimplify_expr. */
750 get_initialized_tmp_var (tree val, gimple_seq *pre_p, gimple_seq *post_p)
752 return internal_get_tmp_var (val, pre_p, post_p, false);
755 /* Declares all the variables in VARS in SCOPE. If DEBUG_INFO is
756 true, generate debug info for them; otherwise don't. */
759 declare_vars (tree vars, gimple scope, bool debug_info)
766 gcc_assert (gimple_code (scope) == GIMPLE_BIND);
768 temps = nreverse (last);
770 block = gimple_bind_block (scope);
771 gcc_assert (!block || TREE_CODE (block) == BLOCK);
772 if (!block || !debug_info)
774 TREE_CHAIN (last) = gimple_bind_vars (scope);
775 gimple_bind_set_vars (scope, temps);
779 /* We need to attach the nodes both to the BIND_EXPR and to its
780 associated BLOCK for debugging purposes. The key point here
781 is that the BLOCK_VARS of the BIND_EXPR_BLOCK of a BIND_EXPR
782 is a subchain of the BIND_EXPR_VARS of the BIND_EXPR. */
783 if (BLOCK_VARS (block))
784 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), temps);
787 gimple_bind_set_vars (scope,
788 chainon (gimple_bind_vars (scope), temps));
789 BLOCK_VARS (block) = temps;
795 /* For VAR a VAR_DECL of variable size, try to find a constant upper bound
796 for the size and adjust DECL_SIZE/DECL_SIZE_UNIT accordingly. Abort if
797 no such upper bound can be obtained. */
800 force_constant_size (tree var)
802 /* The only attempt we make is by querying the maximum size of objects
803 of the variable's type. */
805 HOST_WIDE_INT max_size;
807 gcc_assert (TREE_CODE (var) == VAR_DECL);
809 max_size = max_int_size_in_bytes (TREE_TYPE (var));
811 gcc_assert (max_size >= 0);
814 = build_int_cst (TREE_TYPE (DECL_SIZE_UNIT (var)), max_size);
816 = build_int_cst (TREE_TYPE (DECL_SIZE (var)), max_size * BITS_PER_UNIT);
820 gimple_add_tmp_var (tree tmp)
822 gcc_assert (!TREE_CHAIN (tmp) && !DECL_SEEN_IN_BIND_EXPR_P (tmp));
824 /* Later processing assumes that the object size is constant, which might
825 not be true at this point. Force the use of a constant upper bound in
827 if (!host_integerp (DECL_SIZE_UNIT (tmp), 1))
828 force_constant_size (tmp);
830 DECL_CONTEXT (tmp) = current_function_decl;
831 DECL_SEEN_IN_BIND_EXPR_P (tmp) = 1;
835 TREE_CHAIN (tmp) = gimplify_ctxp->temps;
836 gimplify_ctxp->temps = tmp;
838 /* Mark temporaries local within the nearest enclosing parallel. */
839 if (gimplify_omp_ctxp)
841 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
842 while (ctx && ctx->region_type == ORT_WORKSHARE)
843 ctx = ctx->outer_context;
845 omp_add_variable (ctx, tmp, GOVD_LOCAL | GOVD_SEEN);
854 /* This case is for nested functions. We need to expose the locals
856 body_seq = gimple_body (current_function_decl);
857 declare_vars (tmp, gimple_seq_first_stmt (body_seq), false);
861 /* Determines whether to assign a location to the statement GS. */
864 should_carry_location_p (gimple gs)
866 /* Don't emit a line note for a label. We particularly don't want to
867 emit one for the break label, since it doesn't actually correspond
868 to the beginning of the loop/switch. */
869 if (gimple_code (gs) == GIMPLE_LABEL)
875 /* Same, but for a tree. */
878 tree_should_carry_location_p (const_tree stmt)
880 /* Don't emit a line note for a label. We particularly don't want to
881 emit one for the break label, since it doesn't actually correspond
882 to the beginning of the loop/switch. */
883 if (TREE_CODE (stmt) == LABEL_EXPR)
886 /* Do not annotate empty statements, since it confuses gcov. */
887 if (!TREE_SIDE_EFFECTS (stmt))
893 /* Return true if a location should not be emitted for this statement
894 by annotate_one_with_location. */
897 gimple_do_not_emit_location_p (gimple g)
899 return gimple_plf (g, GF_PLF_1);
902 /* Mark statement G so a location will not be emitted by
903 annotate_one_with_location. */
906 gimple_set_do_not_emit_location (gimple g)
908 /* The PLF flags are initialized to 0 when a new tuple is created,
909 so no need to initialize it anywhere. */
910 gimple_set_plf (g, GF_PLF_1, true);
913 /* Set the location for gimple statement GS to LOCUS. */
916 annotate_one_with_location (gimple gs, location_t location)
918 if (!gimple_has_location (gs)
919 && !gimple_do_not_emit_location_p (gs)
920 && should_carry_location_p (gs))
921 gimple_set_location (gs, location);
924 /* Same, but for tree T. */
927 tree_annotate_one_with_location (tree t, location_t location)
929 if (CAN_HAVE_LOCATION_P (t)
930 && ! EXPR_HAS_LOCATION (t) && tree_should_carry_location_p (t))
931 SET_EXPR_LOCATION (t, location);
935 /* Set LOCATION for all the statements after iterator GSI in sequence
936 SEQ. If GSI is pointing to the end of the sequence, start with the
937 first statement in SEQ. */
940 annotate_all_with_location_after (gimple_seq seq, gimple_stmt_iterator gsi,
944 gsi = gsi_start (seq);
948 for (; !gsi_end_p (gsi); gsi_next (&gsi))
949 annotate_one_with_location (gsi_stmt (gsi), location);
953 /* Set the location for all the statements in a sequence STMT_P to LOCUS. */
956 annotate_all_with_location (gimple_seq stmt_p, location_t location)
958 gimple_stmt_iterator i;
960 if (gimple_seq_empty_p (stmt_p))
963 for (i = gsi_start (stmt_p); !gsi_end_p (i); gsi_next (&i))
965 gimple gs = gsi_stmt (i);
966 annotate_one_with_location (gs, location);
970 /* Same, but for statement or statement list in *STMT_P. */
973 tree_annotate_all_with_location (tree *stmt_p, location_t location)
975 tree_stmt_iterator i;
980 for (i = tsi_start (*stmt_p); !tsi_end_p (i); tsi_next (&i))
982 tree t = tsi_stmt (i);
984 /* Assuming we've already been gimplified, we shouldn't
985 see nested chaining constructs anymore. */
986 gcc_assert (TREE_CODE (t) != STATEMENT_LIST
987 && TREE_CODE (t) != COMPOUND_EXPR);
989 tree_annotate_one_with_location (t, location);
994 /* Similar to copy_tree_r() but do not copy SAVE_EXPR or TARGET_EXPR nodes.
995 These nodes model computations that should only be done once. If we
996 were to unshare something like SAVE_EXPR(i++), the gimplification
997 process would create wrong code. */
1000 mostly_copy_tree_r (tree *tp, int *walk_subtrees, void *data)
1002 enum tree_code code = TREE_CODE (*tp);
1003 /* Don't unshare types, decls, constants and SAVE_EXPR nodes. */
1004 if (TREE_CODE_CLASS (code) == tcc_type
1005 || TREE_CODE_CLASS (code) == tcc_declaration
1006 || TREE_CODE_CLASS (code) == tcc_constant
1007 || code == SAVE_EXPR || code == TARGET_EXPR
1008 /* We can't do anything sensible with a BLOCK used as an expression,
1009 but we also can't just die when we see it because of non-expression
1010 uses. So just avert our eyes and cross our fingers. Silly Java. */
1015 gcc_assert (code != BIND_EXPR);
1016 copy_tree_r (tp, walk_subtrees, data);
1022 /* Callback for walk_tree to unshare most of the shared trees rooted at
1023 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
1024 then *TP is deep copied by calling copy_tree_r.
1026 This unshares the same trees as copy_tree_r with the exception of
1027 SAVE_EXPR nodes. These nodes model computations that should only be
1028 done once. If we were to unshare something like SAVE_EXPR(i++), the
1029 gimplification process would create wrong code. */
1032 copy_if_shared_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
1033 void *data ATTRIBUTE_UNUSED)
1036 enum tree_code code = TREE_CODE (t);
1038 /* Skip types, decls, and constants. But we do want to look at their
1039 types and the bounds of types. Mark them as visited so we properly
1040 unmark their subtrees on the unmark pass. If we've already seen them,
1041 don't look down further. */
1042 if (TREE_CODE_CLASS (code) == tcc_type
1043 || TREE_CODE_CLASS (code) == tcc_declaration
1044 || TREE_CODE_CLASS (code) == tcc_constant)
1046 if (TREE_VISITED (t))
1049 TREE_VISITED (t) = 1;
1052 /* If this node has been visited already, unshare it and don't look
1054 else if (TREE_VISITED (t))
1056 walk_tree (tp, mostly_copy_tree_r, NULL, NULL);
1060 /* Otherwise, mark the tree as visited and keep looking. */
1062 TREE_VISITED (t) = 1;
1068 unmark_visited_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
1069 void *data ATTRIBUTE_UNUSED)
1071 if (TREE_VISITED (*tp))
1072 TREE_VISITED (*tp) = 0;
1079 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
1080 bodies of any nested functions if we are unsharing the entire body of
1084 unshare_body (tree *body_p, tree fndecl)
1086 struct cgraph_node *cgn = cgraph_node (fndecl);
1088 walk_tree (body_p, copy_if_shared_r, NULL, NULL);
1089 if (body_p == &DECL_SAVED_TREE (fndecl))
1090 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
1091 unshare_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
1094 /* Likewise, but mark all trees as not visited. */
1097 unvisit_body (tree *body_p, tree fndecl)
1099 struct cgraph_node *cgn = cgraph_node (fndecl);
1101 walk_tree (body_p, unmark_visited_r, NULL, NULL);
1102 if (body_p == &DECL_SAVED_TREE (fndecl))
1103 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
1104 unvisit_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
1107 /* Unconditionally make an unshared copy of EXPR. This is used when using
1108 stored expressions which span multiple functions, such as BINFO_VTABLE,
1109 as the normal unsharing process can't tell that they're shared. */
1112 unshare_expr (tree expr)
1114 walk_tree (&expr, mostly_copy_tree_r, NULL, NULL);
1118 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
1119 contain statements and have a value. Assign its value to a temporary
1120 and give it void_type_node. Returns the temporary, or NULL_TREE if
1121 WRAPPER was already void. */
1124 voidify_wrapper_expr (tree wrapper, tree temp)
1126 tree type = TREE_TYPE (wrapper);
1127 if (type && !VOID_TYPE_P (type))
1131 /* Set p to point to the body of the wrapper. Loop until we find
1132 something that isn't a wrapper. */
1133 for (p = &wrapper; p && *p; )
1135 switch (TREE_CODE (*p))
1138 TREE_SIDE_EFFECTS (*p) = 1;
1139 TREE_TYPE (*p) = void_type_node;
1140 /* For a BIND_EXPR, the body is operand 1. */
1141 p = &BIND_EXPR_BODY (*p);
1144 case CLEANUP_POINT_EXPR:
1145 case TRY_FINALLY_EXPR:
1146 case TRY_CATCH_EXPR:
1147 TREE_SIDE_EFFECTS (*p) = 1;
1148 TREE_TYPE (*p) = void_type_node;
1149 p = &TREE_OPERAND (*p, 0);
1152 case STATEMENT_LIST:
1154 tree_stmt_iterator i = tsi_last (*p);
1155 TREE_SIDE_EFFECTS (*p) = 1;
1156 TREE_TYPE (*p) = void_type_node;
1157 p = tsi_end_p (i) ? NULL : tsi_stmt_ptr (i);
1162 /* Advance to the last statement. Set all container types to void. */
1163 for (; TREE_CODE (*p) == COMPOUND_EXPR; p = &TREE_OPERAND (*p, 1))
1165 TREE_SIDE_EFFECTS (*p) = 1;
1166 TREE_TYPE (*p) = void_type_node;
1176 if (p == NULL || IS_EMPTY_STMT (*p))
1180 /* The wrapper is on the RHS of an assignment that we're pushing
1182 gcc_assert (TREE_CODE (temp) == INIT_EXPR
1183 || TREE_CODE (temp) == MODIFY_EXPR);
1184 TREE_OPERAND (temp, 1) = *p;
1189 temp = create_tmp_var (type, "retval");
1190 *p = build2 (INIT_EXPR, type, temp, *p);
1199 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
1200 a temporary through which they communicate. */
1203 build_stack_save_restore (gimple *save, gimple *restore)
1207 *save = gimple_build_call (implicit_built_in_decls[BUILT_IN_STACK_SAVE], 0);
1208 tmp_var = create_tmp_var (ptr_type_node, "saved_stack");
1209 gimple_call_set_lhs (*save, tmp_var);
1211 *restore = gimple_build_call (implicit_built_in_decls[BUILT_IN_STACK_RESTORE],
1215 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
1217 static enum gimplify_status
1218 gimplify_bind_expr (tree *expr_p, gimple_seq *pre_p)
1220 tree bind_expr = *expr_p;
1221 bool old_save_stack = gimplify_ctxp->save_stack;
1226 tree temp = voidify_wrapper_expr (bind_expr, NULL);
1228 /* Mark variables seen in this bind expr. */
1229 for (t = BIND_EXPR_VARS (bind_expr); t ; t = TREE_CHAIN (t))
1231 if (TREE_CODE (t) == VAR_DECL)
1233 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
1235 /* Mark variable as local. */
1236 if (ctx && !is_global_var (t)
1237 && (! DECL_SEEN_IN_BIND_EXPR_P (t)
1238 || splay_tree_lookup (ctx->variables,
1239 (splay_tree_key) t) == NULL))
1240 omp_add_variable (gimplify_omp_ctxp, t, GOVD_LOCAL | GOVD_SEEN);
1242 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
1245 /* Preliminarily mark non-addressed complex variables as eligible
1246 for promotion to gimple registers. We'll transform their uses
1248 if ((TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
1249 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
1250 && !TREE_THIS_VOLATILE (t)
1251 && (TREE_CODE (t) == VAR_DECL && !DECL_HARD_REGISTER (t))
1252 && !needs_to_live_in_memory (t))
1253 DECL_GIMPLE_REG_P (t) = 1;
1256 gimple_bind = gimple_build_bind (BIND_EXPR_VARS (bind_expr), NULL,
1257 BIND_EXPR_BLOCK (bind_expr));
1258 gimple_push_bind_expr (gimple_bind);
1260 gimplify_ctxp->save_stack = false;
1262 /* Gimplify the body into the GIMPLE_BIND tuple's body. */
1264 gimplify_stmt (&BIND_EXPR_BODY (bind_expr), &body);
1265 gimple_bind_set_body (gimple_bind, body);
1267 if (gimplify_ctxp->save_stack)
1269 gimple stack_save, stack_restore, gs;
1270 gimple_seq cleanup, new_body;
1272 /* Save stack on entry and restore it on exit. Add a try_finally
1273 block to achieve this. Note that mudflap depends on the
1274 format of the emitted code: see mx_register_decls(). */
1275 build_stack_save_restore (&stack_save, &stack_restore);
1277 cleanup = new_body = NULL;
1278 gimplify_seq_add_stmt (&cleanup, stack_restore);
1279 gs = gimple_build_try (gimple_bind_body (gimple_bind), cleanup,
1280 GIMPLE_TRY_FINALLY);
1282 gimplify_seq_add_stmt (&new_body, stack_save);
1283 gimplify_seq_add_stmt (&new_body, gs);
1284 gimple_bind_set_body (gimple_bind, new_body);
1287 gimplify_ctxp->save_stack = old_save_stack;
1288 gimple_pop_bind_expr ();
1290 gimplify_seq_add_stmt (pre_p, gimple_bind);
1298 *expr_p = NULL_TREE;
1302 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1303 GIMPLE value, it is assigned to a new temporary and the statement is
1304 re-written to return the temporary.
1306 PRE_P points to the sequence where side effects that must happen before
1307 STMT should be stored. */
1309 static enum gimplify_status
1310 gimplify_return_expr (tree stmt, gimple_seq *pre_p)
1313 tree ret_expr = TREE_OPERAND (stmt, 0);
1314 tree result_decl, result;
1316 if (ret_expr == error_mark_node)
1320 || TREE_CODE (ret_expr) == RESULT_DECL
1321 || ret_expr == error_mark_node)
1323 gimple ret = gimple_build_return (ret_expr);
1324 gimple_set_no_warning (ret, TREE_NO_WARNING (stmt));
1325 gimplify_seq_add_stmt (pre_p, ret);
1329 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
1330 result_decl = NULL_TREE;
1333 result_decl = TREE_OPERAND (ret_expr, 0);
1335 /* See through a return by reference. */
1336 if (TREE_CODE (result_decl) == INDIRECT_REF)
1337 result_decl = TREE_OPERAND (result_decl, 0);
1339 gcc_assert ((TREE_CODE (ret_expr) == MODIFY_EXPR
1340 || TREE_CODE (ret_expr) == INIT_EXPR)
1341 && TREE_CODE (result_decl) == RESULT_DECL);
1344 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1345 Recall that aggregate_value_p is FALSE for any aggregate type that is
1346 returned in registers. If we're returning values in registers, then
1347 we don't want to extend the lifetime of the RESULT_DECL, particularly
1348 across another call. In addition, for those aggregates for which
1349 hard_function_value generates a PARALLEL, we'll die during normal
1350 expansion of structure assignments; there's special code in expand_return
1351 to handle this case that does not exist in expand_expr. */
1353 || aggregate_value_p (result_decl, TREE_TYPE (current_function_decl)))
1354 result = result_decl;
1355 else if (gimplify_ctxp->return_temp)
1356 result = gimplify_ctxp->return_temp;
1359 result = create_tmp_var (TREE_TYPE (result_decl), NULL);
1360 if (TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
1361 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
1362 DECL_GIMPLE_REG_P (result) = 1;
1364 /* ??? With complex control flow (usually involving abnormal edges),
1365 we can wind up warning about an uninitialized value for this. Due
1366 to how this variable is constructed and initialized, this is never
1367 true. Give up and never warn. */
1368 TREE_NO_WARNING (result) = 1;
1370 gimplify_ctxp->return_temp = result;
1373 /* Smash the lhs of the MODIFY_EXPR to the temporary we plan to use.
1374 Then gimplify the whole thing. */
1375 if (result != result_decl)
1376 TREE_OPERAND (ret_expr, 0) = result;
1378 gimplify_and_add (TREE_OPERAND (stmt, 0), pre_p);
1380 ret = gimple_build_return (result);
1381 gimple_set_no_warning (ret, TREE_NO_WARNING (stmt));
1382 gimplify_seq_add_stmt (pre_p, ret);
1388 gimplify_vla_decl (tree decl, gimple_seq *seq_p)
1390 /* This is a variable-sized decl. Simplify its size and mark it
1391 for deferred expansion. Note that mudflap depends on the format
1392 of the emitted code: see mx_register_decls(). */
1393 tree t, addr, ptr_type;
1395 gimplify_one_sizepos (&DECL_SIZE (decl), seq_p);
1396 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl), seq_p);
1398 /* All occurrences of this decl in final gimplified code will be
1399 replaced by indirection. Setting DECL_VALUE_EXPR does two
1400 things: First, it lets the rest of the gimplifier know what
1401 replacement to use. Second, it lets the debug info know
1402 where to find the value. */
1403 ptr_type = build_pointer_type (TREE_TYPE (decl));
1404 addr = create_tmp_var (ptr_type, get_name (decl));
1405 DECL_IGNORED_P (addr) = 0;
1406 t = build_fold_indirect_ref (addr);
1407 SET_DECL_VALUE_EXPR (decl, t);
1408 DECL_HAS_VALUE_EXPR_P (decl) = 1;
1410 t = built_in_decls[BUILT_IN_ALLOCA];
1411 t = build_call_expr (t, 1, DECL_SIZE_UNIT (decl));
1412 t = fold_convert (ptr_type, t);
1413 t = build2 (MODIFY_EXPR, TREE_TYPE (addr), addr, t);
1415 gimplify_and_add (t, seq_p);
1417 /* Indicate that we need to restore the stack level when the
1418 enclosing BIND_EXPR is exited. */
1419 gimplify_ctxp->save_stack = true;
1423 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
1424 and initialization explicit. */
1426 static enum gimplify_status
1427 gimplify_decl_expr (tree *stmt_p, gimple_seq *seq_p)
1429 tree stmt = *stmt_p;
1430 tree decl = DECL_EXPR_DECL (stmt);
1432 *stmt_p = NULL_TREE;
1434 if (TREE_TYPE (decl) == error_mark_node)
1437 if ((TREE_CODE (decl) == TYPE_DECL
1438 || TREE_CODE (decl) == VAR_DECL)
1439 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl)))
1440 gimplify_type_sizes (TREE_TYPE (decl), seq_p);
1442 if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl))
1444 tree init = DECL_INITIAL (decl);
1446 if (TREE_CODE (DECL_SIZE_UNIT (decl)) != INTEGER_CST
1447 || (!TREE_STATIC (decl)
1448 && flag_stack_check == GENERIC_STACK_CHECK
1449 && compare_tree_int (DECL_SIZE_UNIT (decl),
1450 STACK_CHECK_MAX_VAR_SIZE) > 0))
1451 gimplify_vla_decl (decl, seq_p);
1453 if (init && init != error_mark_node)
1455 if (!TREE_STATIC (decl))
1457 DECL_INITIAL (decl) = NULL_TREE;
1458 init = build2 (INIT_EXPR, void_type_node, decl, init);
1459 gimplify_and_add (init, seq_p);
1463 /* We must still examine initializers for static variables
1464 as they may contain a label address. */
1465 walk_tree (&init, force_labels_r, NULL, NULL);
1468 /* Some front ends do not explicitly declare all anonymous
1469 artificial variables. We compensate here by declaring the
1470 variables, though it would be better if the front ends would
1471 explicitly declare them. */
1472 if (!DECL_SEEN_IN_BIND_EXPR_P (decl)
1473 && DECL_ARTIFICIAL (decl) && DECL_NAME (decl) == NULL_TREE)
1474 gimple_add_tmp_var (decl);
1480 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1481 and replacing the LOOP_EXPR with goto, but if the loop contains an
1482 EXIT_EXPR, we need to append a label for it to jump to. */
1484 static enum gimplify_status
1485 gimplify_loop_expr (tree *expr_p, gimple_seq *pre_p)
1487 tree saved_label = gimplify_ctxp->exit_label;
1488 tree start_label = create_artificial_label ();
1490 gimplify_seq_add_stmt (pre_p, gimple_build_label (start_label));
1492 gimplify_ctxp->exit_label = NULL_TREE;
1494 gimplify_and_add (LOOP_EXPR_BODY (*expr_p), pre_p);
1496 gimplify_seq_add_stmt (pre_p, gimple_build_goto (start_label));
1498 if (gimplify_ctxp->exit_label)
1499 gimplify_seq_add_stmt (pre_p, gimple_build_label (gimplify_ctxp->exit_label));
1501 gimplify_ctxp->exit_label = saved_label;
1507 /* Gimplifies a statement list onto a sequence. These may be created either
1508 by an enlightened front-end, or by shortcut_cond_expr. */
1510 static enum gimplify_status
1511 gimplify_statement_list (tree *expr_p, gimple_seq *pre_p)
1513 tree temp = voidify_wrapper_expr (*expr_p, NULL);
1515 tree_stmt_iterator i = tsi_start (*expr_p);
1517 while (!tsi_end_p (i))
1519 gimplify_stmt (tsi_stmt_ptr (i), pre_p);
1532 /* Compare two case labels. Because the front end should already have
1533 made sure that case ranges do not overlap, it is enough to only compare
1534 the CASE_LOW values of each case label. */
1537 compare_case_labels (const void *p1, const void *p2)
1539 const_tree const case1 = *(const_tree const*)p1;
1540 const_tree const case2 = *(const_tree const*)p2;
1542 /* The 'default' case label always goes first. */
1543 if (!CASE_LOW (case1))
1545 else if (!CASE_LOW (case2))
1548 return tree_int_cst_compare (CASE_LOW (case1), CASE_LOW (case2));
1552 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1555 sort_case_labels (VEC(tree,heap)* label_vec)
1557 size_t len = VEC_length (tree, label_vec);
1558 qsort (VEC_address (tree, label_vec), len, sizeof (tree),
1559 compare_case_labels);
1563 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1566 static enum gimplify_status
1567 gimplify_switch_expr (tree *expr_p, gimple_seq *pre_p)
1569 tree switch_expr = *expr_p;
1570 gimple_seq switch_body_seq = NULL;
1571 enum gimplify_status ret;
1573 ret = gimplify_expr (&SWITCH_COND (switch_expr), pre_p, NULL, is_gimple_val,
1575 if (ret == GS_ERROR || ret == GS_UNHANDLED)
1578 if (SWITCH_BODY (switch_expr))
1580 VEC (tree,heap) *labels;
1581 VEC (tree,heap) *saved_labels;
1582 tree default_case = NULL_TREE;
1584 gimple gimple_switch;
1586 /* If someone can be bothered to fill in the labels, they can
1587 be bothered to null out the body too. */
1588 gcc_assert (!SWITCH_LABELS (switch_expr));
1590 /* save old labels, get new ones from body, then restore the old
1591 labels. Save all the things from the switch body to append after. */
1592 saved_labels = gimplify_ctxp->case_labels;
1593 gimplify_ctxp->case_labels = VEC_alloc (tree, heap, 8);
1595 gimplify_stmt (&SWITCH_BODY (switch_expr), &switch_body_seq);
1596 labels = gimplify_ctxp->case_labels;
1597 gimplify_ctxp->case_labels = saved_labels;
1600 while (i < VEC_length (tree, labels))
1602 tree elt = VEC_index (tree, labels, i);
1603 tree low = CASE_LOW (elt);
1604 bool remove_element = FALSE;
1608 /* Discard empty ranges. */
1609 tree high = CASE_HIGH (elt);
1610 if (high && tree_int_cst_lt (high, low))
1611 remove_element = TRUE;
1615 /* The default case must be the last label in the list. */
1616 gcc_assert (!default_case);
1618 remove_element = TRUE;
1622 VEC_ordered_remove (tree, labels, i);
1632 /* If the switch has no default label, add one, so that we jump
1633 around the switch body. */
1634 default_case = build3 (CASE_LABEL_EXPR, void_type_node, NULL_TREE,
1635 NULL_TREE, create_artificial_label ());
1636 new_default = gimple_build_label (CASE_LABEL (default_case));
1637 gimplify_seq_add_stmt (&switch_body_seq, new_default);
1640 if (!VEC_empty (tree, labels))
1641 sort_case_labels (labels);
1643 gimple_switch = gimple_build_switch_vec (SWITCH_COND (switch_expr),
1644 default_case, labels);
1645 gimplify_seq_add_stmt (pre_p, gimple_switch);
1646 gimplify_seq_add_seq (pre_p, switch_body_seq);
1647 VEC_free(tree, heap, labels);
1650 gcc_assert (SWITCH_LABELS (switch_expr));
1656 static enum gimplify_status
1657 gimplify_case_label_expr (tree *expr_p, gimple_seq *pre_p)
1659 struct gimplify_ctx *ctxp;
1660 gimple gimple_label;
1662 /* Invalid OpenMP programs can play Duff's Device type games with
1663 #pragma omp parallel. At least in the C front end, we don't
1664 detect such invalid branches until after gimplification. */
1665 for (ctxp = gimplify_ctxp; ; ctxp = ctxp->prev_context)
1666 if (ctxp->case_labels)
1669 gimple_label = gimple_build_label (CASE_LABEL (*expr_p));
1670 VEC_safe_push (tree, heap, ctxp->case_labels, *expr_p);
1671 gimplify_seq_add_stmt (pre_p, gimple_label);
1676 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1680 build_and_jump (tree *label_p)
1682 if (label_p == NULL)
1683 /* If there's nowhere to jump, just fall through. */
1686 if (*label_p == NULL_TREE)
1688 tree label = create_artificial_label ();
1692 return build1 (GOTO_EXPR, void_type_node, *label_p);
1695 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1696 This also involves building a label to jump to and communicating it to
1697 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1699 static enum gimplify_status
1700 gimplify_exit_expr (tree *expr_p)
1702 tree cond = TREE_OPERAND (*expr_p, 0);
1705 expr = build_and_jump (&gimplify_ctxp->exit_label);
1706 expr = build3 (COND_EXPR, void_type_node, cond, expr, NULL_TREE);
1712 /* A helper function to be called via walk_tree. Mark all labels under *TP
1713 as being forced. To be called for DECL_INITIAL of static variables. */
1716 force_labels_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
1720 if (TREE_CODE (*tp) == LABEL_DECL)
1721 FORCED_LABEL (*tp) = 1;
1726 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1727 different from its canonical type, wrap the whole thing inside a
1728 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1731 The canonical type of a COMPONENT_REF is the type of the field being
1732 referenced--unless the field is a bit-field which can be read directly
1733 in a smaller mode, in which case the canonical type is the
1734 sign-appropriate type corresponding to that mode. */
1737 canonicalize_component_ref (tree *expr_p)
1739 tree expr = *expr_p;
1742 gcc_assert (TREE_CODE (expr) == COMPONENT_REF);
1744 if (INTEGRAL_TYPE_P (TREE_TYPE (expr)))
1745 type = TREE_TYPE (get_unwidened (expr, NULL_TREE));
1747 type = TREE_TYPE (TREE_OPERAND (expr, 1));
1749 /* One could argue that all the stuff below is not necessary for
1750 the non-bitfield case and declare it a FE error if type
1751 adjustment would be needed. */
1752 if (TREE_TYPE (expr) != type)
1754 #ifdef ENABLE_TYPES_CHECKING
1755 tree old_type = TREE_TYPE (expr);
1759 /* We need to preserve qualifiers and propagate them from
1761 type_quals = TYPE_QUALS (type)
1762 | TYPE_QUALS (TREE_TYPE (TREE_OPERAND (expr, 0)));
1763 if (TYPE_QUALS (type) != type_quals)
1764 type = build_qualified_type (TYPE_MAIN_VARIANT (type), type_quals);
1766 /* Set the type of the COMPONENT_REF to the underlying type. */
1767 TREE_TYPE (expr) = type;
1769 #ifdef ENABLE_TYPES_CHECKING
1770 /* It is now a FE error, if the conversion from the canonical
1771 type to the original expression type is not useless. */
1772 gcc_assert (useless_type_conversion_p (old_type, type));
1777 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1778 to foo, embed that change in the ADDR_EXPR by converting
1783 where L is the lower bound. For simplicity, only do this for constant
1785 The constraint is that the type of &array[L] is trivially convertible
1789 canonicalize_addr_expr (tree *expr_p)
1791 tree expr = *expr_p;
1792 tree addr_expr = TREE_OPERAND (expr, 0);
1793 tree datype, ddatype, pddatype;
1795 /* We simplify only conversions from an ADDR_EXPR to a pointer type. */
1796 if (!POINTER_TYPE_P (TREE_TYPE (expr))
1797 || TREE_CODE (addr_expr) != ADDR_EXPR)
1800 /* The addr_expr type should be a pointer to an array. */
1801 datype = TREE_TYPE (TREE_TYPE (addr_expr));
1802 if (TREE_CODE (datype) != ARRAY_TYPE)
1805 /* The pointer to element type shall be trivially convertible to
1806 the expression pointer type. */
1807 ddatype = TREE_TYPE (datype);
1808 pddatype = build_pointer_type (ddatype);
1809 if (!useless_type_conversion_p (pddatype, ddatype))
1812 /* The lower bound and element sizes must be constant. */
1813 if (!TYPE_SIZE_UNIT (ddatype)
1814 || TREE_CODE (TYPE_SIZE_UNIT (ddatype)) != INTEGER_CST
1815 || !TYPE_DOMAIN (datype) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype))
1816 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype))) != INTEGER_CST)
1819 /* All checks succeeded. Build a new node to merge the cast. */
1820 *expr_p = build4 (ARRAY_REF, ddatype, TREE_OPERAND (addr_expr, 0),
1821 TYPE_MIN_VALUE (TYPE_DOMAIN (datype)),
1822 NULL_TREE, NULL_TREE);
1823 *expr_p = build1 (ADDR_EXPR, pddatype, *expr_p);
1826 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1827 underneath as appropriate. */
1829 static enum gimplify_status
1830 gimplify_conversion (tree *expr_p)
1833 gcc_assert (CONVERT_EXPR_P (*expr_p));
1835 /* Then strip away all but the outermost conversion. */
1836 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p, 0));
1838 /* And remove the outermost conversion if it's useless. */
1839 if (tree_ssa_useless_type_conversion (*expr_p))
1840 *expr_p = TREE_OPERAND (*expr_p, 0);
1842 /* Attempt to avoid NOP_EXPR by producing reference to a subtype.
1843 For example this fold (subclass *)&A into &A->subclass avoiding
1844 a need for statement. */
1845 if (CONVERT_EXPR_P (*expr_p)
1846 && POINTER_TYPE_P (TREE_TYPE (*expr_p))
1847 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p, 0)))
1848 && (tem = maybe_fold_offset_to_address
1849 (TREE_OPERAND (*expr_p, 0),
1850 integer_zero_node, TREE_TYPE (*expr_p))) != NULL_TREE)
1853 /* If we still have a conversion at the toplevel,
1854 then canonicalize some constructs. */
1855 if (CONVERT_EXPR_P (*expr_p))
1857 tree sub = TREE_OPERAND (*expr_p, 0);
1859 /* If a NOP conversion is changing the type of a COMPONENT_REF
1860 expression, then canonicalize its type now in order to expose more
1861 redundant conversions. */
1862 if (TREE_CODE (sub) == COMPONENT_REF)
1863 canonicalize_component_ref (&TREE_OPERAND (*expr_p, 0));
1865 /* If a NOP conversion is changing a pointer to array of foo
1866 to a pointer to foo, embed that change in the ADDR_EXPR. */
1867 else if (TREE_CODE (sub) == ADDR_EXPR)
1868 canonicalize_addr_expr (expr_p);
1871 /* If we have a conversion to a non-register type force the
1872 use of a VIEW_CONVERT_EXPR instead. */
1873 if (!is_gimple_reg_type (TREE_TYPE (*expr_p)))
1874 *expr_p = fold_build1 (VIEW_CONVERT_EXPR, TREE_TYPE (*expr_p),
1875 TREE_OPERAND (*expr_p, 0));
1880 /* Gimplify a VAR_DECL or PARM_DECL. Returns GS_OK if we expanded a
1881 DECL_VALUE_EXPR, and it's worth re-examining things. */
1883 static enum gimplify_status
1884 gimplify_var_or_parm_decl (tree *expr_p)
1886 tree decl = *expr_p;
1888 /* ??? If this is a local variable, and it has not been seen in any
1889 outer BIND_EXPR, then it's probably the result of a duplicate
1890 declaration, for which we've already issued an error. It would
1891 be really nice if the front end wouldn't leak these at all.
1892 Currently the only known culprit is C++ destructors, as seen
1893 in g++.old-deja/g++.jason/binding.C. */
1894 if (TREE_CODE (decl) == VAR_DECL
1895 && !DECL_SEEN_IN_BIND_EXPR_P (decl)
1896 && !TREE_STATIC (decl) && !DECL_EXTERNAL (decl)
1897 && decl_function_context (decl) == current_function_decl)
1899 gcc_assert (errorcount || sorrycount);
1903 /* When within an OpenMP context, notice uses of variables. */
1904 if (gimplify_omp_ctxp && omp_notice_variable (gimplify_omp_ctxp, decl, true))
1907 /* If the decl is an alias for another expression, substitute it now. */
1908 if (DECL_HAS_VALUE_EXPR_P (decl))
1910 *expr_p = unshare_expr (DECL_VALUE_EXPR (decl));
1918 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1922 : min_lval '[' val ']'
1924 | compound_lval '[' val ']'
1925 | compound_lval '.' ID
1927 This is not part of the original SIMPLE definition, which separates
1928 array and member references, but it seems reasonable to handle them
1929 together. Also, this way we don't run into problems with union
1930 aliasing; gcc requires that for accesses through a union to alias, the
1931 union reference must be explicit, which was not always the case when we
1932 were splitting up array and member refs.
1934 PRE_P points to the sequence where side effects that must happen before
1935 *EXPR_P should be stored.
1937 POST_P points to the sequence where side effects that must happen after
1938 *EXPR_P should be stored. */
1940 static enum gimplify_status
1941 gimplify_compound_lval (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
1942 fallback_t fallback)
1945 VEC(tree,heap) *stack;
1946 enum gimplify_status ret = GS_OK, tret;
1949 /* Create a stack of the subexpressions so later we can walk them in
1950 order from inner to outer. */
1951 stack = VEC_alloc (tree, heap, 10);
1953 /* We can handle anything that get_inner_reference can deal with. */
1954 for (p = expr_p; ; p = &TREE_OPERAND (*p, 0))
1957 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1958 if (TREE_CODE (*p) == INDIRECT_REF)
1959 *p = fold_indirect_ref (*p);
1961 if (handled_component_p (*p))
1963 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
1964 additional COMPONENT_REFs. */
1965 else if ((TREE_CODE (*p) == VAR_DECL || TREE_CODE (*p) == PARM_DECL)
1966 && gimplify_var_or_parm_decl (p) == GS_OK)
1971 VEC_safe_push (tree, heap, stack, *p);
1974 gcc_assert (VEC_length (tree, stack));
1976 /* Now STACK is a stack of pointers to all the refs we've walked through
1977 and P points to the innermost expression.
1979 Java requires that we elaborated nodes in source order. That
1980 means we must gimplify the inner expression followed by each of
1981 the indices, in order. But we can't gimplify the inner
1982 expression until we deal with any variable bounds, sizes, or
1983 positions in order to deal with PLACEHOLDER_EXPRs.
1985 So we do this in three steps. First we deal with the annotations
1986 for any variables in the components, then we gimplify the base,
1987 then we gimplify any indices, from left to right. */
1988 for (i = VEC_length (tree, stack) - 1; i >= 0; i--)
1990 tree t = VEC_index (tree, stack, i);
1992 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
1994 /* Gimplify the low bound and element type size and put them into
1995 the ARRAY_REF. If these values are set, they have already been
1997 if (TREE_OPERAND (t, 2) == NULL_TREE)
1999 tree low = unshare_expr (array_ref_low_bound (t));
2000 if (!is_gimple_min_invariant (low))
2002 TREE_OPERAND (t, 2) = low;
2003 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p,
2004 post_p, is_gimple_formal_tmp_reg,
2006 ret = MIN (ret, tret);
2010 if (!TREE_OPERAND (t, 3))
2012 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (t, 0)));
2013 tree elmt_size = unshare_expr (array_ref_element_size (t));
2014 tree factor = size_int (TYPE_ALIGN_UNIT (elmt_type));
2016 /* Divide the element size by the alignment of the element
2018 elmt_size = size_binop (EXACT_DIV_EXPR, elmt_size, factor);
2020 if (!is_gimple_min_invariant (elmt_size))
2022 TREE_OPERAND (t, 3) = elmt_size;
2023 tret = gimplify_expr (&TREE_OPERAND (t, 3), pre_p,
2024 post_p, is_gimple_formal_tmp_reg,
2026 ret = MIN (ret, tret);
2030 else if (TREE_CODE (t) == COMPONENT_REF)
2032 /* Set the field offset into T and gimplify it. */
2033 if (!TREE_OPERAND (t, 2))
2035 tree offset = unshare_expr (component_ref_field_offset (t));
2036 tree field = TREE_OPERAND (t, 1);
2038 = size_int (DECL_OFFSET_ALIGN (field) / BITS_PER_UNIT);
2040 /* Divide the offset by its alignment. */
2041 offset = size_binop (EXACT_DIV_EXPR, offset, factor);
2043 if (!is_gimple_min_invariant (offset))
2045 TREE_OPERAND (t, 2) = offset;
2046 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p,
2047 post_p, is_gimple_formal_tmp_reg,
2049 ret = MIN (ret, tret);
2055 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
2056 so as to match the min_lval predicate. Failure to do so may result
2057 in the creation of large aggregate temporaries. */
2058 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval,
2059 fallback | fb_lvalue);
2060 ret = MIN (ret, tret);
2062 /* And finally, the indices and operands to BIT_FIELD_REF. During this
2063 loop we also remove any useless conversions. */
2064 for (; VEC_length (tree, stack) > 0; )
2066 tree t = VEC_pop (tree, stack);
2068 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
2070 /* Gimplify the dimension.
2071 Temporary fix for gcc.c-torture/execute/20040313-1.c.
2072 Gimplify non-constant array indices into a temporary
2074 FIXME - The real fix is to gimplify post-modify
2075 expressions into a minimal gimple lvalue. However, that
2076 exposes bugs in alias analysis. The alias analyzer does
2077 not handle &PTR->FIELD very well. Will fix after the
2078 branch is merged into mainline (dnovillo 2004-05-03). */
2079 if (!is_gimple_min_invariant (TREE_OPERAND (t, 1)))
2081 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
2082 is_gimple_formal_tmp_reg, fb_rvalue);
2083 ret = MIN (ret, tret);
2086 else if (TREE_CODE (t) == BIT_FIELD_REF)
2088 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
2089 is_gimple_val, fb_rvalue);
2090 ret = MIN (ret, tret);
2091 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
2092 is_gimple_val, fb_rvalue);
2093 ret = MIN (ret, tret);
2096 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t, 0));
2098 /* The innermost expression P may have originally had
2099 TREE_SIDE_EFFECTS set which would have caused all the outer
2100 expressions in *EXPR_P leading to P to also have had
2101 TREE_SIDE_EFFECTS set. */
2102 recalculate_side_effects (t);
2105 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
2106 if ((fallback & fb_rvalue) && TREE_CODE (*expr_p) == COMPONENT_REF)
2108 canonicalize_component_ref (expr_p);
2109 ret = MIN (ret, GS_OK);
2112 VEC_free (tree, heap, stack);
2117 /* Gimplify the self modifying expression pointed to by EXPR_P
2120 PRE_P points to the list where side effects that must happen before
2121 *EXPR_P should be stored.
2123 POST_P points to the list where side effects that must happen after
2124 *EXPR_P should be stored.
2126 WANT_VALUE is nonzero iff we want to use the value of this expression
2127 in another expression. */
2129 static enum gimplify_status
2130 gimplify_self_mod_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
2133 enum tree_code code;
2134 tree lhs, lvalue, rhs, t1;
2135 gimple_seq post = NULL, *orig_post_p = post_p;
2137 enum tree_code arith_code;
2138 enum gimplify_status ret;
2140 code = TREE_CODE (*expr_p);
2142 gcc_assert (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR
2143 || code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR);
2145 /* Prefix or postfix? */
2146 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
2147 /* Faster to treat as prefix if result is not used. */
2148 postfix = want_value;
2152 /* For postfix, make sure the inner expression's post side effects
2153 are executed after side effects from this expression. */
2157 /* Add or subtract? */
2158 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2159 arith_code = PLUS_EXPR;
2161 arith_code = MINUS_EXPR;
2163 /* Gimplify the LHS into a GIMPLE lvalue. */
2164 lvalue = TREE_OPERAND (*expr_p, 0);
2165 ret = gimplify_expr (&lvalue, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
2166 if (ret == GS_ERROR)
2169 /* Extract the operands to the arithmetic operation. */
2171 rhs = TREE_OPERAND (*expr_p, 1);
2173 /* For postfix operator, we evaluate the LHS to an rvalue and then use
2174 that as the result value and in the postqueue operation. */
2177 ret = gimplify_expr (&lhs, pre_p, post_p, is_gimple_val, fb_rvalue);
2178 if (ret == GS_ERROR)
2182 /* For POINTERs increment, use POINTER_PLUS_EXPR. */
2183 if (POINTER_TYPE_P (TREE_TYPE (lhs)))
2185 rhs = fold_convert (sizetype, rhs);
2186 if (arith_code == MINUS_EXPR)
2187 rhs = fold_build1 (NEGATE_EXPR, TREE_TYPE (rhs), rhs);
2188 arith_code = POINTER_PLUS_EXPR;
2191 t1 = build2 (arith_code, TREE_TYPE (*expr_p), lhs, rhs);
2195 gimplify_assign (lvalue, t1, orig_post_p);
2196 gimplify_seq_add_seq (orig_post_p, post);
2202 *expr_p = build2 (MODIFY_EXPR, TREE_TYPE (lvalue), lvalue, t1);
2208 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
2211 maybe_with_size_expr (tree *expr_p)
2213 tree expr = *expr_p;
2214 tree type = TREE_TYPE (expr);
2217 /* If we've already wrapped this or the type is error_mark_node, we can't do
2219 if (TREE_CODE (expr) == WITH_SIZE_EXPR
2220 || type == error_mark_node)
2223 /* If the size isn't known or is a constant, we have nothing to do. */
2224 size = TYPE_SIZE_UNIT (type);
2225 if (!size || TREE_CODE (size) == INTEGER_CST)
2228 /* Otherwise, make a WITH_SIZE_EXPR. */
2229 size = unshare_expr (size);
2230 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, expr);
2231 *expr_p = build2 (WITH_SIZE_EXPR, type, expr, size);
2235 /* Helper for gimplify_call_expr. Gimplify a single argument *ARG_P
2236 Store any side-effects in PRE_P. CALL_LOCATION is the location of
2239 static enum gimplify_status
2240 gimplify_arg (tree *arg_p, gimple_seq *pre_p, location_t call_location)
2242 bool (*test) (tree);
2245 /* In general, we allow lvalues for function arguments to avoid
2246 extra overhead of copying large aggregates out of even larger
2247 aggregates into temporaries only to copy the temporaries to
2248 the argument list. Make optimizers happy by pulling out to
2249 temporaries those types that fit in registers. */
2250 if (is_gimple_reg_type (TREE_TYPE (*arg_p)))
2251 test = is_gimple_val, fb = fb_rvalue;
2253 test = is_gimple_lvalue, fb = fb_either;
2255 /* If this is a variable sized type, we must remember the size. */
2256 maybe_with_size_expr (arg_p);
2258 /* Make sure arguments have the same location as the function call
2260 protected_set_expr_location (*arg_p, call_location);
2262 /* There is a sequence point before a function call. Side effects in
2263 the argument list must occur before the actual call. So, when
2264 gimplifying arguments, force gimplify_expr to use an internal
2265 post queue which is then appended to the end of PRE_P. */
2266 return gimplify_expr (arg_p, pre_p, NULL, test, fb);
2270 /* Gimplify the CALL_EXPR node *EXPR_P into the GIMPLE sequence PRE_P.
2271 WANT_VALUE is true if the result of the call is desired. */
2273 static enum gimplify_status
2274 gimplify_call_expr (tree *expr_p, gimple_seq *pre_p, bool want_value)
2276 tree fndecl, parms, p;
2277 enum gimplify_status ret;
2280 bool builtin_va_start_p = FALSE;
2282 gcc_assert (TREE_CODE (*expr_p) == CALL_EXPR);
2284 /* For reliable diagnostics during inlining, it is necessary that
2285 every call_expr be annotated with file and line. */
2286 if (! EXPR_HAS_LOCATION (*expr_p))
2287 SET_EXPR_LOCATION (*expr_p, input_location);
2289 /* This may be a call to a builtin function.
2291 Builtin function calls may be transformed into different
2292 (and more efficient) builtin function calls under certain
2293 circumstances. Unfortunately, gimplification can muck things
2294 up enough that the builtin expanders are not aware that certain
2295 transformations are still valid.
2297 So we attempt transformation/gimplification of the call before
2298 we gimplify the CALL_EXPR. At this time we do not manage to
2299 transform all calls in the same manner as the expanders do, but
2300 we do transform most of them. */
2301 fndecl = get_callee_fndecl (*expr_p);
2302 if (fndecl && DECL_BUILT_IN (fndecl))
2304 tree new_tree = fold_call_expr (*expr_p, !want_value);
2306 if (new_tree && new_tree != *expr_p)
2308 /* There was a transformation of this call which computes the
2309 same value, but in a more efficient way. Return and try
2315 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
2316 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_VA_START)
2318 builtin_va_start_p = TRUE;
2319 if (call_expr_nargs (*expr_p) < 2)
2321 error ("too few arguments to function %<va_start%>");
2322 *expr_p = build_empty_stmt ();
2326 if (fold_builtin_next_arg (*expr_p, true))
2328 *expr_p = build_empty_stmt ();
2334 /* There is a sequence point before the call, so any side effects in
2335 the calling expression must occur before the actual call. Force
2336 gimplify_expr to use an internal post queue. */
2337 ret = gimplify_expr (&CALL_EXPR_FN (*expr_p), pre_p, NULL,
2338 is_gimple_call_addr, fb_rvalue);
2340 nargs = call_expr_nargs (*expr_p);
2342 /* Get argument types for verification. */
2343 fndecl = get_callee_fndecl (*expr_p);
2346 parms = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
2347 else if (POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_FN (*expr_p))))
2348 parms = TYPE_ARG_TYPES (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (*expr_p))));
2350 if (fndecl && DECL_ARGUMENTS (fndecl))
2351 p = DECL_ARGUMENTS (fndecl);
2357 CALL_CANNOT_INLINE_P (*expr_p) = 1;
2360 for (i = 0; i < nargs && p; i++, p = TREE_CHAIN (p))
2363 /* If the last argument is __builtin_va_arg_pack () and it is not
2364 passed as a named argument, decrease the number of CALL_EXPR
2365 arguments and set instead the CALL_EXPR_VA_ARG_PACK flag. */
2368 && TREE_CODE (CALL_EXPR_ARG (*expr_p, nargs - 1)) == CALL_EXPR)
2370 tree last_arg = CALL_EXPR_ARG (*expr_p, nargs - 1);
2371 tree last_arg_fndecl = get_callee_fndecl (last_arg);
2374 && TREE_CODE (last_arg_fndecl) == FUNCTION_DECL
2375 && DECL_BUILT_IN_CLASS (last_arg_fndecl) == BUILT_IN_NORMAL
2376 && DECL_FUNCTION_CODE (last_arg_fndecl) == BUILT_IN_VA_ARG_PACK)
2378 tree call = *expr_p;
2381 *expr_p = build_call_array (TREE_TYPE (call), CALL_EXPR_FN (call),
2382 nargs, CALL_EXPR_ARGP (call));
2384 /* Copy all CALL_EXPR flags, location and block, except
2385 CALL_EXPR_VA_ARG_PACK flag. */
2386 CALL_EXPR_STATIC_CHAIN (*expr_p) = CALL_EXPR_STATIC_CHAIN (call);
2387 CALL_EXPR_TAILCALL (*expr_p) = CALL_EXPR_TAILCALL (call);
2388 CALL_EXPR_RETURN_SLOT_OPT (*expr_p)
2389 = CALL_EXPR_RETURN_SLOT_OPT (call);
2390 CALL_FROM_THUNK_P (*expr_p) = CALL_FROM_THUNK_P (call);
2391 CALL_CANNOT_INLINE_P (*expr_p) = CALL_CANNOT_INLINE_P (call);
2392 SET_EXPR_LOCUS (*expr_p, EXPR_LOCUS (call));
2393 TREE_BLOCK (*expr_p) = TREE_BLOCK (call);
2395 /* Set CALL_EXPR_VA_ARG_PACK. */
2396 CALL_EXPR_VA_ARG_PACK (*expr_p) = 1;
2400 /* Finally, gimplify the function arguments. */
2403 for (i = (PUSH_ARGS_REVERSED ? nargs - 1 : 0);
2404 PUSH_ARGS_REVERSED ? i >= 0 : i < nargs;
2405 PUSH_ARGS_REVERSED ? i-- : i++)
2407 enum gimplify_status t;
2409 /* Avoid gimplifying the second argument to va_start, which needs to
2410 be the plain PARM_DECL. */
2411 if ((i != 1) || !builtin_va_start_p)
2413 t = gimplify_arg (&CALL_EXPR_ARG (*expr_p, i), pre_p,
2414 EXPR_LOCATION (*expr_p));
2422 /* Try this again in case gimplification exposed something. */
2423 if (ret != GS_ERROR)
2425 tree new_tree = fold_call_expr (*expr_p, !want_value);
2427 if (new_tree && new_tree != *expr_p)
2429 /* There was a transformation of this call which computes the
2430 same value, but in a more efficient way. Return and try
2438 *expr_p = error_mark_node;
2442 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2443 decl. This allows us to eliminate redundant or useless
2444 calls to "const" functions. */
2445 if (TREE_CODE (*expr_p) == CALL_EXPR)
2447 int flags = call_expr_flags (*expr_p);
2448 if (flags & (ECF_CONST | ECF_PURE)
2449 /* An infinite loop is considered a side effect. */
2450 && !(flags & (ECF_LOOPING_CONST_OR_PURE)))
2451 TREE_SIDE_EFFECTS (*expr_p) = 0;
2454 /* If the value is not needed by the caller, emit a new GIMPLE_CALL
2455 and clear *EXPR_P. Otherwise, leave *EXPR_P in its gimplified
2456 form and delegate the creation of a GIMPLE_CALL to
2457 gimplify_modify_expr. This is always possible because when
2458 WANT_VALUE is true, the caller wants the result of this call into
2459 a temporary, which means that we will emit an INIT_EXPR in
2460 internal_get_tmp_var which will then be handled by
2461 gimplify_modify_expr. */
2464 /* The CALL_EXPR in *EXPR_P is already in GIMPLE form, so all we
2465 have to do is replicate it as a GIMPLE_CALL tuple. */
2466 call = gimple_build_call_from_tree (*expr_p);
2467 gimplify_seq_add_stmt (pre_p, call);
2468 *expr_p = NULL_TREE;
2474 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2475 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2477 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2478 condition is true or false, respectively. If null, we should generate
2479 our own to skip over the evaluation of this specific expression.
2481 This function is the tree equivalent of do_jump.
2483 shortcut_cond_r should only be called by shortcut_cond_expr. */
2486 shortcut_cond_r (tree pred, tree *true_label_p, tree *false_label_p)
2488 tree local_label = NULL_TREE;
2489 tree t, expr = NULL;
2491 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2492 retain the shortcut semantics. Just insert the gotos here;
2493 shortcut_cond_expr will append the real blocks later. */
2494 if (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2496 /* Turn if (a && b) into
2498 if (a); else goto no;
2499 if (b) goto yes; else goto no;
2502 if (false_label_p == NULL)
2503 false_label_p = &local_label;
2505 t = shortcut_cond_r (TREE_OPERAND (pred, 0), NULL, false_label_p);
2506 append_to_statement_list (t, &expr);
2508 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2510 append_to_statement_list (t, &expr);
2512 else if (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2514 /* Turn if (a || b) into
2517 if (b) goto yes; else goto no;
2520 if (true_label_p == NULL)
2521 true_label_p = &local_label;
2523 t = shortcut_cond_r (TREE_OPERAND (pred, 0), true_label_p, NULL);
2524 append_to_statement_list (t, &expr);
2526 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2528 append_to_statement_list (t, &expr);
2530 else if (TREE_CODE (pred) == COND_EXPR)
2532 /* As long as we're messing with gotos, turn if (a ? b : c) into
2534 if (b) goto yes; else goto no;
2536 if (c) goto yes; else goto no; */
2537 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (pred, 0),
2538 shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2540 shortcut_cond_r (TREE_OPERAND (pred, 2), true_label_p,
2545 expr = build3 (COND_EXPR, void_type_node, pred,
2546 build_and_jump (true_label_p),
2547 build_and_jump (false_label_p));
2552 t = build1 (LABEL_EXPR, void_type_node, local_label);
2553 append_to_statement_list (t, &expr);
2559 /* Given a conditional expression EXPR with short-circuit boolean
2560 predicates using TRUTH_ANDIF_EXPR or TRUTH_ORIF_EXPR, break the
2561 predicate appart into the equivalent sequence of conditionals. */
2564 shortcut_cond_expr (tree expr)
2566 tree pred = TREE_OPERAND (expr, 0);
2567 tree then_ = TREE_OPERAND (expr, 1);
2568 tree else_ = TREE_OPERAND (expr, 2);
2569 tree true_label, false_label, end_label, t;
2571 tree *false_label_p;
2572 bool emit_end, emit_false, jump_over_else;
2573 bool then_se = then_ && TREE_SIDE_EFFECTS (then_);
2574 bool else_se = else_ && TREE_SIDE_EFFECTS (else_);
2576 /* First do simple transformations. */
2579 /* If there is no 'else', turn (a && b) into if (a) if (b). */
2580 while (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2582 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2583 then_ = shortcut_cond_expr (expr);
2584 then_se = then_ && TREE_SIDE_EFFECTS (then_);
2585 pred = TREE_OPERAND (pred, 0);
2586 expr = build3 (COND_EXPR, void_type_node, pred, then_, NULL_TREE);
2592 /* If there is no 'then', turn
2595 if (a); else if (b); else d. */
2596 while (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2598 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2599 else_ = shortcut_cond_expr (expr);
2600 else_se = else_ && TREE_SIDE_EFFECTS (else_);
2601 pred = TREE_OPERAND (pred, 0);
2602 expr = build3 (COND_EXPR, void_type_node, pred, NULL_TREE, else_);
2606 /* If we're done, great. */
2607 if (TREE_CODE (pred) != TRUTH_ANDIF_EXPR
2608 && TREE_CODE (pred) != TRUTH_ORIF_EXPR)
2611 /* Otherwise we need to mess with gotos. Change
2614 if (a); else goto no;
2617 and recursively gimplify the condition. */
2619 true_label = false_label = end_label = NULL_TREE;
2621 /* If our arms just jump somewhere, hijack those labels so we don't
2622 generate jumps to jumps. */
2625 && TREE_CODE (then_) == GOTO_EXPR
2626 && TREE_CODE (GOTO_DESTINATION (then_)) == LABEL_DECL)
2628 true_label = GOTO_DESTINATION (then_);
2634 && TREE_CODE (else_) == GOTO_EXPR
2635 && TREE_CODE (GOTO_DESTINATION (else_)) == LABEL_DECL)
2637 false_label = GOTO_DESTINATION (else_);
2642 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2644 true_label_p = &true_label;
2646 true_label_p = NULL;
2648 /* The 'else' branch also needs a label if it contains interesting code. */
2649 if (false_label || else_se)
2650 false_label_p = &false_label;
2652 false_label_p = NULL;
2654 /* If there was nothing else in our arms, just forward the label(s). */
2655 if (!then_se && !else_se)
2656 return shortcut_cond_r (pred, true_label_p, false_label_p);
2658 /* If our last subexpression already has a terminal label, reuse it. */
2660 expr = expr_last (else_);
2662 expr = expr_last (then_);
2665 if (expr && TREE_CODE (expr) == LABEL_EXPR)
2666 end_label = LABEL_EXPR_LABEL (expr);
2668 /* If we don't care about jumping to the 'else' branch, jump to the end
2669 if the condition is false. */
2671 false_label_p = &end_label;
2673 /* We only want to emit these labels if we aren't hijacking them. */
2674 emit_end = (end_label == NULL_TREE);
2675 emit_false = (false_label == NULL_TREE);
2677 /* We only emit the jump over the else clause if we have to--if the
2678 then clause may fall through. Otherwise we can wind up with a
2679 useless jump and a useless label at the end of gimplified code,
2680 which will cause us to think that this conditional as a whole
2681 falls through even if it doesn't. If we then inline a function
2682 which ends with such a condition, that can cause us to issue an
2683 inappropriate warning about control reaching the end of a
2684 non-void function. */
2685 jump_over_else = block_may_fallthru (then_);
2687 pred = shortcut_cond_r (pred, true_label_p, false_label_p);
2690 append_to_statement_list (pred, &expr);
2692 append_to_statement_list (then_, &expr);
2697 t = build_and_jump (&end_label);
2698 append_to_statement_list (t, &expr);
2702 t = build1 (LABEL_EXPR, void_type_node, false_label);
2703 append_to_statement_list (t, &expr);
2705 append_to_statement_list (else_, &expr);
2707 if (emit_end && end_label)
2709 t = build1 (LABEL_EXPR, void_type_node, end_label);
2710 append_to_statement_list (t, &expr);
2716 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2719 gimple_boolify (tree expr)
2721 tree type = TREE_TYPE (expr);
2723 if (TREE_CODE (type) == BOOLEAN_TYPE)
2726 switch (TREE_CODE (expr))
2728 case TRUTH_AND_EXPR:
2730 case TRUTH_XOR_EXPR:
2731 case TRUTH_ANDIF_EXPR:
2732 case TRUTH_ORIF_EXPR:
2733 /* Also boolify the arguments of truth exprs. */
2734 TREE_OPERAND (expr, 1) = gimple_boolify (TREE_OPERAND (expr, 1));
2737 case TRUTH_NOT_EXPR:
2738 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2741 case EQ_EXPR: case NE_EXPR:
2742 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2743 /* These expressions always produce boolean results. */
2744 TREE_TYPE (expr) = boolean_type_node;
2748 /* Other expressions that get here must have boolean values, but
2749 might need to be converted to the appropriate mode. */
2750 return fold_convert (boolean_type_node, expr);
2754 /* Given a conditional expression *EXPR_P without side effects, gimplify
2755 its operands. New statements are inserted to PRE_P. */
2757 static enum gimplify_status
2758 gimplify_pure_cond_expr (tree *expr_p, gimple_seq *pre_p)
2760 tree expr = *expr_p, cond;
2761 enum gimplify_status ret, tret;
2762 enum tree_code code;
2764 cond = gimple_boolify (COND_EXPR_COND (expr));
2766 /* We need to handle && and || specially, as their gimplification
2767 creates pure cond_expr, thus leading to an infinite cycle otherwise. */
2768 code = TREE_CODE (cond);
2769 if (code == TRUTH_ANDIF_EXPR)
2770 TREE_SET_CODE (cond, TRUTH_AND_EXPR);
2771 else if (code == TRUTH_ORIF_EXPR)
2772 TREE_SET_CODE (cond, TRUTH_OR_EXPR);
2773 ret = gimplify_expr (&cond, pre_p, NULL, is_gimple_condexpr, fb_rvalue);
2774 COND_EXPR_COND (*expr_p) = cond;
2776 tret = gimplify_expr (&COND_EXPR_THEN (expr), pre_p, NULL,
2777 is_gimple_val, fb_rvalue);
2778 ret = MIN (ret, tret);
2779 tret = gimplify_expr (&COND_EXPR_ELSE (expr), pre_p, NULL,
2780 is_gimple_val, fb_rvalue);
2782 return MIN (ret, tret);
2785 /* Returns true if evaluating EXPR could trap.
2786 EXPR is GENERIC, while tree_could_trap_p can be called
2790 generic_expr_could_trap_p (tree expr)
2794 if (!expr || is_gimple_val (expr))
2797 if (!EXPR_P (expr) || tree_could_trap_p (expr))
2800 n = TREE_OPERAND_LENGTH (expr);
2801 for (i = 0; i < n; i++)
2802 if (generic_expr_could_trap_p (TREE_OPERAND (expr, i)))
2808 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2817 The second form is used when *EXPR_P is of type void.
2819 PRE_P points to the list where side effects that must happen before
2820 *EXPR_P should be stored. */
2822 static enum gimplify_status
2823 gimplify_cond_expr (tree *expr_p, gimple_seq *pre_p, fallback_t fallback)
2825 tree expr = *expr_p;
2826 tree tmp, type, arm1, arm2;
2827 enum gimplify_status ret;
2828 tree label_true, label_false, label_cont;
2829 bool have_then_clause_p, have_else_clause_p;
2831 enum tree_code pred_code;
2832 gimple_seq seq = NULL;
2834 type = TREE_TYPE (expr);
2836 /* If this COND_EXPR has a value, copy the values into a temporary within
2838 if (! VOID_TYPE_P (type))
2842 /* If an rvalue is ok or we do not require an lvalue, avoid creating
2843 an addressable temporary. */
2844 if (((fallback & fb_rvalue)
2845 || !(fallback & fb_lvalue))
2846 && !TREE_ADDRESSABLE (type))
2848 if (gimplify_ctxp->allow_rhs_cond_expr
2849 /* If either branch has side effects or could trap, it can't be
2850 evaluated unconditionally. */
2851 && !TREE_SIDE_EFFECTS (TREE_OPERAND (*expr_p, 1))
2852 && !generic_expr_could_trap_p (TREE_OPERAND (*expr_p, 1))
2853 && !TREE_SIDE_EFFECTS (TREE_OPERAND (*expr_p, 2))
2854 && !generic_expr_could_trap_p (TREE_OPERAND (*expr_p, 2)))
2855 return gimplify_pure_cond_expr (expr_p, pre_p);
2857 result = tmp = create_tmp_var (TREE_TYPE (expr), "iftmp");
2862 tree type = build_pointer_type (TREE_TYPE (expr));
2864 if (TREE_TYPE (TREE_OPERAND (expr, 1)) != void_type_node)
2865 TREE_OPERAND (expr, 1) =
2866 build_fold_addr_expr (TREE_OPERAND (expr, 1));
2868 if (TREE_TYPE (TREE_OPERAND (expr, 2)) != void_type_node)
2869 TREE_OPERAND (expr, 2) =
2870 build_fold_addr_expr (TREE_OPERAND (expr, 2));
2872 tmp = create_tmp_var (type, "iftmp");
2874 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (expr, 0),
2875 TREE_OPERAND (expr, 1), TREE_OPERAND (expr, 2));
2877 result = build_fold_indirect_ref (tmp);
2880 /* Build the then clause, 't1 = a;'. But don't build an assignment
2881 if this branch is void; in C++ it can be, if it's a throw. */
2882 if (TREE_TYPE (TREE_OPERAND (expr, 1)) != void_type_node)
2883 TREE_OPERAND (expr, 1)
2884 = build2 (MODIFY_EXPR, TREE_TYPE (tmp), tmp, TREE_OPERAND (expr, 1));
2886 /* Build the else clause, 't1 = b;'. */
2887 if (TREE_TYPE (TREE_OPERAND (expr, 2)) != void_type_node)
2888 TREE_OPERAND (expr, 2)
2889 = build2 (MODIFY_EXPR, TREE_TYPE (tmp), tmp, TREE_OPERAND (expr, 2));
2891 TREE_TYPE (expr) = void_type_node;
2892 recalculate_side_effects (expr);
2894 /* Move the COND_EXPR to the prequeue. */
2895 gimplify_stmt (&expr, pre_p);
2901 /* Make sure the condition has BOOLEAN_TYPE. */
2902 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2904 /* Break apart && and || conditions. */
2905 if (TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ANDIF_EXPR
2906 || TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ORIF_EXPR)
2908 expr = shortcut_cond_expr (expr);
2910 if (expr != *expr_p)
2914 /* We can't rely on gimplify_expr to re-gimplify the expanded
2915 form properly, as cleanups might cause the target labels to be
2916 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2917 set up a conditional context. */
2918 gimple_push_condition ();
2919 gimplify_stmt (expr_p, &seq);
2920 gimple_pop_condition (pre_p);
2921 gimple_seq_add_seq (pre_p, seq);
2927 /* Now do the normal gimplification. */
2929 /* Gimplify condition. */
2930 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL, is_gimple_condexpr,
2932 if (ret == GS_ERROR)
2934 gcc_assert (TREE_OPERAND (expr, 0) != NULL_TREE);
2936 gimple_push_condition ();
2938 have_then_clause_p = have_else_clause_p = false;
2939 if (TREE_OPERAND (expr, 1) != NULL
2940 && TREE_CODE (TREE_OPERAND (expr, 1)) == GOTO_EXPR
2941 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr, 1))) == LABEL_DECL
2942 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr, 1)))
2943 == current_function_decl)
2944 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
2945 have different locations, otherwise we end up with incorrect
2946 location information on the branches. */
2948 || !EXPR_HAS_LOCATION (expr)
2949 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr, 1))
2950 || EXPR_LOCATION (expr) == EXPR_LOCATION (TREE_OPERAND (expr, 1))))
2952 label_true = GOTO_DESTINATION (TREE_OPERAND (expr, 1));
2953 have_then_clause_p = true;
2956 label_true = create_artificial_label ();
2957 if (TREE_OPERAND (expr, 2) != NULL
2958 && TREE_CODE (TREE_OPERAND (expr, 2)) == GOTO_EXPR
2959 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr, 2))) == LABEL_DECL
2960 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr, 2)))
2961 == current_function_decl)
2962 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
2963 have different locations, otherwise we end up with incorrect
2964 location information on the branches. */
2966 || !EXPR_HAS_LOCATION (expr)
2967 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr, 2))
2968 || EXPR_LOCATION (expr) == EXPR_LOCATION (TREE_OPERAND (expr, 2))))
2970 label_false = GOTO_DESTINATION (TREE_OPERAND (expr, 2));
2971 have_else_clause_p = true;
2974 label_false = create_artificial_label ();
2976 gimple_cond_get_ops_from_tree (COND_EXPR_COND (expr), &pred_code, &arm1,
2979 gimple_cond = gimple_build_cond (pred_code, arm1, arm2, label_true,
2982 gimplify_seq_add_stmt (&seq, gimple_cond);
2983 label_cont = NULL_TREE;
2984 if (!have_then_clause_p)
2986 /* For if (...) {} else { code; } put label_true after
2988 if (TREE_OPERAND (expr, 1) == NULL_TREE
2989 && !have_else_clause_p
2990 && TREE_OPERAND (expr, 2) != NULL_TREE)
2991 label_cont = label_true;
2994 gimplify_seq_add_stmt (&seq, gimple_build_label (label_true));
2995 have_then_clause_p = gimplify_stmt (&TREE_OPERAND (expr, 1), &seq);
2996 /* For if (...) { code; } else {} or
2997 if (...) { code; } else goto label; or
2998 if (...) { code; return; } else { ... }
2999 label_cont isn't needed. */
3000 if (!have_else_clause_p
3001 && TREE_OPERAND (expr, 2) != NULL_TREE
3002 && gimple_seq_may_fallthru (seq))
3005 label_cont = create_artificial_label ();
3007 g = gimple_build_goto (label_cont);
3009 /* GIMPLE_COND's are very low level; they have embedded
3010 gotos. This particular embedded goto should not be marked
3011 with the location of the original COND_EXPR, as it would
3012 correspond to the COND_EXPR's condition, not the ELSE or the
3013 THEN arms. To avoid marking it with the wrong location, flag
3014 it as "no location". */
3015 gimple_set_do_not_emit_location (g);
3017 gimplify_seq_add_stmt (&seq, g);
3021 if (!have_else_clause_p)
3023 gimplify_seq_add_stmt (&seq, gimple_build_label (label_false));
3024 have_else_clause_p = gimplify_stmt (&TREE_OPERAND (expr, 2), &seq);
3027 gimplify_seq_add_stmt (&seq, gimple_build_label (label_cont));
3029 gimple_pop_condition (pre_p);
3030 gimple_seq_add_seq (pre_p, seq);
3032 if (ret == GS_ERROR)
3034 else if (have_then_clause_p || have_else_clause_p)
3038 /* Both arms are empty; replace the COND_EXPR with its predicate. */
3039 expr = TREE_OPERAND (expr, 0);
3040 gimplify_stmt (&expr, pre_p);
3047 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3048 a call to __builtin_memcpy. */
3050 static enum gimplify_status
3051 gimplify_modify_expr_to_memcpy (tree *expr_p, tree size, bool want_value,
3054 tree t, to, to_ptr, from, from_ptr;
3057 to = TREE_OPERAND (*expr_p, 0);
3058 from = TREE_OPERAND (*expr_p, 1);
3060 from_ptr = build_fold_addr_expr (from);
3061 gimplify_arg (&from_ptr, seq_p, EXPR_LOCATION (*expr_p));
3063 to_ptr = build_fold_addr_expr (to);
3064 gimplify_arg (&to_ptr, seq_p, EXPR_LOCATION (*expr_p));
3066 t = implicit_built_in_decls[BUILT_IN_MEMCPY];
3068 gs = gimple_build_call (t, 3, to_ptr, from_ptr, size);
3072 /* tmp = memcpy() */
3073 t = create_tmp_var (TREE_TYPE (to_ptr), NULL);
3074 gimple_call_set_lhs (gs, t);
3075 gimplify_seq_add_stmt (seq_p, gs);
3077 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (to), t);
3081 gimplify_seq_add_stmt (seq_p, gs);
3086 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3087 a call to __builtin_memset. In this case we know that the RHS is
3088 a CONSTRUCTOR with an empty element list. */
3090 static enum gimplify_status
3091 gimplify_modify_expr_to_memset (tree *expr_p, tree size, bool want_value,
3094 tree t, from, to, to_ptr;
3097 /* Assert our assumptions, to abort instead of producing wrong code
3098 silently if they are not met. Beware that the RHS CONSTRUCTOR might
3099 not be immediately exposed. */
3100 from = TREE_OPERAND (*expr_p, 1);
3101 if (TREE_CODE (from) == WITH_SIZE_EXPR)
3102 from = TREE_OPERAND (from, 0);
3104 gcc_assert (TREE_CODE (from) == CONSTRUCTOR
3105 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (from)));
3108 to = TREE_OPERAND (*expr_p, 0);
3110 to_ptr = build_fold_addr_expr (to);
3111 gimplify_arg (&to_ptr, seq_p, EXPR_LOCATION (*expr_p));
3112 t = implicit_built_in_decls[BUILT_IN_MEMSET];
3114 gs = gimple_build_call (t, 3, to_ptr, integer_zero_node, size);
3118 /* tmp = memset() */
3119 t = create_tmp_var (TREE_TYPE (to_ptr), NULL);
3120 gimple_call_set_lhs (gs, t);
3121 gimplify_seq_add_stmt (seq_p, gs);
3123 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (to), t);
3127 gimplify_seq_add_stmt (seq_p, gs);
3132 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
3133 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
3134 assignment. Returns non-null if we detect a potential overlap. */
3136 struct gimplify_init_ctor_preeval_data
3138 /* The base decl of the lhs object. May be NULL, in which case we
3139 have to assume the lhs is indirect. */
3142 /* The alias set of the lhs object. */
3143 alias_set_type lhs_alias_set;
3147 gimplify_init_ctor_preeval_1 (tree *tp, int *walk_subtrees, void *xdata)
3149 struct gimplify_init_ctor_preeval_data *data
3150 = (struct gimplify_init_ctor_preeval_data *) xdata;
3153 /* If we find the base object, obviously we have overlap. */
3154 if (data->lhs_base_decl == t)
3157 /* If the constructor component is indirect, determine if we have a
3158 potential overlap with the lhs. The only bits of information we
3159 have to go on at this point are addressability and alias sets. */
3160 if (TREE_CODE (t) == INDIRECT_REF
3161 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
3162 && alias_sets_conflict_p (data->lhs_alias_set, get_alias_set (t)))
3165 /* If the constructor component is a call, determine if it can hide a
3166 potential overlap with the lhs through an INDIRECT_REF like above. */
3167 if (TREE_CODE (t) == CALL_EXPR)
3169 tree type, fntype = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (t)));
3171 for (type = TYPE_ARG_TYPES (fntype); type; type = TREE_CHAIN (type))
3172 if (POINTER_TYPE_P (TREE_VALUE (type))
3173 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
3174 && alias_sets_conflict_p (data->lhs_alias_set,
3176 (TREE_TYPE (TREE_VALUE (type)))))
3180 if (IS_TYPE_OR_DECL_P (t))
3185 /* A subroutine of gimplify_init_constructor. Pre-evaluate EXPR,
3186 force values that overlap with the lhs (as described by *DATA)
3187 into temporaries. */
3190 gimplify_init_ctor_preeval (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
3191 struct gimplify_init_ctor_preeval_data *data)
3193 enum gimplify_status one;
3195 /* If the value is constant, then there's nothing to pre-evaluate. */
3196 if (TREE_CONSTANT (*expr_p))
3198 /* Ensure it does not have side effects, it might contain a reference to
3199 the object we're initializing. */
3200 gcc_assert (!TREE_SIDE_EFFECTS (*expr_p));
3204 /* If the type has non-trivial constructors, we can't pre-evaluate. */
3205 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p)))
3208 /* Recurse for nested constructors. */
3209 if (TREE_CODE (*expr_p) == CONSTRUCTOR)
3211 unsigned HOST_WIDE_INT ix;
3212 constructor_elt *ce;
3213 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (*expr_p);
3215 for (ix = 0; VEC_iterate (constructor_elt, v, ix, ce); ix++)
3216 gimplify_init_ctor_preeval (&ce->value, pre_p, post_p, data);
3221 /* If this is a variable sized type, we must remember the size. */
3222 maybe_with_size_expr (expr_p);
3224 /* Gimplify the constructor element to something appropriate for the rhs
3225 of a MODIFY_EXPR. Given that we know the LHS is an aggregate, we know
3226 the gimplifier will consider this a store to memory. Doing this
3227 gimplification now means that we won't have to deal with complicated
3228 language-specific trees, nor trees like SAVE_EXPR that can induce
3229 exponential search behavior. */
3230 one = gimplify_expr (expr_p, pre_p, post_p, is_gimple_mem_rhs, fb_rvalue);
3231 if (one == GS_ERROR)
3237 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
3238 with the lhs, since "a = { .x=a }" doesn't make sense. This will
3239 always be true for all scalars, since is_gimple_mem_rhs insists on a
3240 temporary variable for them. */
3241 if (DECL_P (*expr_p))
3244 /* If this is of variable size, we have no choice but to assume it doesn't
3245 overlap since we can't make a temporary for it. */
3246 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (*expr_p))) != INTEGER_CST)
3249 /* Otherwise, we must search for overlap ... */
3250 if (!walk_tree (expr_p, gimplify_init_ctor_preeval_1, data, NULL))
3253 /* ... and if found, force the value into a temporary. */
3254 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
3257 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
3258 a RANGE_EXPR in a CONSTRUCTOR for an array.
3262 object[var] = value;
3269 We increment var _after_ the loop exit check because we might otherwise
3270 fail if upper == TYPE_MAX_VALUE (type for upper).
3272 Note that we never have to deal with SAVE_EXPRs here, because this has
3273 already been taken care of for us, in gimplify_init_ctor_preeval(). */
3275 static void gimplify_init_ctor_eval (tree, VEC(constructor_elt,gc) *,
3276 gimple_seq *, bool);
3279 gimplify_init_ctor_eval_range (tree object, tree lower, tree upper,
3280 tree value, tree array_elt_type,
3281 gimple_seq *pre_p, bool cleared)
3283 tree loop_entry_label, loop_exit_label, fall_thru_label;
3284 tree var, var_type, cref, tmp;
3286 loop_entry_label = create_artificial_label ();
3287 loop_exit_label = create_artificial_label ();
3288 fall_thru_label = create_artificial_label ();
3290 /* Create and initialize the index variable. */
3291 var_type = TREE_TYPE (upper);
3292 var = create_tmp_var (var_type, NULL);
3293 gimplify_seq_add_stmt (pre_p, gimple_build_assign (var, lower));
3295 /* Add the loop entry label. */
3296 gimplify_seq_add_stmt (pre_p, gimple_build_label (loop_entry_label));
3298 /* Build the reference. */
3299 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
3300 var, NULL_TREE, NULL_TREE);
3302 /* If we are a constructor, just call gimplify_init_ctor_eval to do
3303 the store. Otherwise just assign value to the reference. */
3305 if (TREE_CODE (value) == CONSTRUCTOR)
3306 /* NB we might have to call ourself recursively through
3307 gimplify_init_ctor_eval if the value is a constructor. */
3308 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
3311 gimplify_seq_add_stmt (pre_p, gimple_build_assign (cref, value));
3313 /* We exit the loop when the index var is equal to the upper bound. */
3314 gimplify_seq_add_stmt (pre_p,
3315 gimple_build_cond (EQ_EXPR, var, upper,
3316 loop_exit_label, fall_thru_label));
3318 gimplify_seq_add_stmt (pre_p, gimple_build_label (fall_thru_label));
3320 /* Otherwise, increment the index var... */
3321 tmp = build2 (PLUS_EXPR, var_type, var,
3322 fold_convert (var_type, integer_one_node));
3323 gimplify_seq_add_stmt (pre_p, gimple_build_assign (var, tmp));
3325 /* ...and jump back to the loop entry. */
3326 gimplify_seq_add_stmt (pre_p, gimple_build_goto (loop_entry_label));
3328 /* Add the loop exit label. */
3329 gimplify_seq_add_stmt (pre_p, gimple_build_label (loop_exit_label));
3332 /* Return true if FDECL is accessing a field that is zero sized. */
3335 zero_sized_field_decl (const_tree fdecl)
3337 if (TREE_CODE (fdecl) == FIELD_DECL && DECL_SIZE (fdecl)
3338 && integer_zerop (DECL_SIZE (fdecl)))
3343 /* Return true if TYPE is zero sized. */
3346 zero_sized_type (const_tree type)
3348 if (AGGREGATE_TYPE_P (type) && TYPE_SIZE (type)
3349 && integer_zerop (TYPE_SIZE (type)))
3354 /* A subroutine of gimplify_init_constructor. Generate individual
3355 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
3356 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
3357 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
3361 gimplify_init_ctor_eval (tree object, VEC(constructor_elt,gc) *elts,
3362 gimple_seq *pre_p, bool cleared)
3364 tree array_elt_type = NULL;
3365 unsigned HOST_WIDE_INT ix;
3366 tree purpose, value;
3368 if (TREE_CODE (TREE_TYPE (object)) == ARRAY_TYPE)
3369 array_elt_type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object)));
3371 FOR_EACH_CONSTRUCTOR_ELT (elts, ix, purpose, value)
3375 /* NULL values are created above for gimplification errors. */
3379 if (cleared && initializer_zerop (value))
3382 /* ??? Here's to hoping the front end fills in all of the indices,
3383 so we don't have to figure out what's missing ourselves. */
3384 gcc_assert (purpose);
3386 /* Skip zero-sized fields, unless value has side-effects. This can
3387 happen with calls to functions returning a zero-sized type, which
3388 we shouldn't discard. As a number of downstream passes don't
3389 expect sets of zero-sized fields, we rely on the gimplification of
3390 the MODIFY_EXPR we make below to drop the assignment statement. */
3391 if (! TREE_SIDE_EFFECTS (value) && zero_sized_field_decl (purpose))
3394 /* If we have a RANGE_EXPR, we have to build a loop to assign the
3396 if (TREE_CODE (purpose) == RANGE_EXPR)
3398 tree lower = TREE_OPERAND (purpose, 0);
3399 tree upper = TREE_OPERAND (purpose, 1);
3401 /* If the lower bound is equal to upper, just treat it as if
3402 upper was the index. */
3403 if (simple_cst_equal (lower, upper))
3407 gimplify_init_ctor_eval_range (object, lower, upper, value,
3408 array_elt_type, pre_p, cleared);
3415 /* Do not use bitsizetype for ARRAY_REF indices. */
3416 if (TYPE_DOMAIN (TREE_TYPE (object)))
3417 purpose = fold_convert (TREE_TYPE (TYPE_DOMAIN (TREE_TYPE (object))),
3419 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
3420 purpose, NULL_TREE, NULL_TREE);
3424 gcc_assert (TREE_CODE (purpose) == FIELD_DECL);
3425 cref = build3 (COMPONENT_REF, TREE_TYPE (purpose),
3426 unshare_expr (object), purpose, NULL_TREE);
3429 if (TREE_CODE (value) == CONSTRUCTOR
3430 && TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE)
3431 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
3435 tree init = build2 (INIT_EXPR, TREE_TYPE (cref), cref, value);
3436 gimplify_and_add (init, pre_p);
3443 /* Returns the appropriate RHS predicate for this LHS. */
3446 rhs_predicate_for (tree lhs)
3448 if (is_gimple_formal_tmp_var (lhs))
3449 return is_gimple_formal_tmp_or_call_rhs;
3450 else if (is_gimple_reg (lhs))
3451 return is_gimple_reg_or_call_rhs;
3453 return is_gimple_mem_or_call_rhs;
3457 /* A subroutine of gimplify_modify_expr. Break out elements of a
3458 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
3460 Note that we still need to clear any elements that don't have explicit
3461 initializers, so if not all elements are initialized we keep the
3462 original MODIFY_EXPR, we just remove all of the constructor elements.
3464 If NOTIFY_TEMP_CREATION is true, do not gimplify, just return
3465 GS_ERROR if we would have to create a temporary when gimplifying
3466 this constructor. Otherwise, return GS_OK.
3468 If NOTIFY_TEMP_CREATION is false, just do the gimplification. */
3470 static enum gimplify_status
3471 gimplify_init_constructor (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
3472 bool want_value, bool notify_temp_creation)
3475 tree ctor = TREE_OPERAND (*expr_p, 1);
3476 tree type = TREE_TYPE (ctor);
3477 enum gimplify_status ret;
3478 VEC(constructor_elt,gc) *elts;
3480 if (TREE_CODE (ctor) != CONSTRUCTOR)
3481 return GS_UNHANDLED;
3483 if (!notify_temp_creation)
3485 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3486 is_gimple_lvalue, fb_lvalue);
3487 if (ret == GS_ERROR)
3491 object = TREE_OPERAND (*expr_p, 0);
3492 elts = CONSTRUCTOR_ELTS (ctor);
3495 switch (TREE_CODE (type))
3499 case QUAL_UNION_TYPE:
3502 struct gimplify_init_ctor_preeval_data preeval_data;
3503 HOST_WIDE_INT num_type_elements, num_ctor_elements;
3504 HOST_WIDE_INT num_nonzero_elements;
3505 bool cleared, valid_const_initializer, sparse;
3507 /* Aggregate types must lower constructors to initialization of
3508 individual elements. The exception is that a CONSTRUCTOR node
3509 with no elements indicates zero-initialization of the whole. */
3510 if (VEC_empty (constructor_elt, elts))
3512 if (notify_temp_creation)
3517 /* Fetch information about the constructor to direct later processing.
3518 We might want to make static versions of it in various cases, and
3519 can only do so if it known to be a valid constant initializer. */
3520 valid_const_initializer
3521 = categorize_ctor_elements (ctor, &num_nonzero_elements,
3522 &num_ctor_elements, &cleared);
3524 /* If a const aggregate variable is being initialized, then it
3525 should never be a lose to promote the variable to be static. */
3526 if (valid_const_initializer
3527 && num_nonzero_elements > 1
3528 && TREE_READONLY (object)
3529 && TREE_CODE (object) == VAR_DECL)
3531 if (notify_temp_creation)
3533 DECL_INITIAL (object) = ctor;
3534 TREE_STATIC (object) = 1;
3535 if (!DECL_NAME (object))
3536 DECL_NAME (object) = create_tmp_var_name ("C");
3537 walk_tree (&DECL_INITIAL (object), force_labels_r, NULL, NULL);
3539 /* ??? C++ doesn't automatically append a .<number> to the
3540 assembler name, and even when it does, it looks a FE private
3541 data structures to figure out what that number should be,
3542 which are not set for this variable. I suppose this is
3543 important for local statics for inline functions, which aren't
3544 "local" in the object file sense. So in order to get a unique
3545 TU-local symbol, we must invoke the lhd version now. */
3546 lhd_set_decl_assembler_name (object);
3548 *expr_p = NULL_TREE;
3552 /* If there are "lots" of initialized elements, even discounting
3553 those that are not address constants (and thus *must* be
3554 computed at runtime), then partition the constructor into
3555 constant and non-constant parts. Block copy the constant
3556 parts in, then generate code for the non-constant parts. */
3557 /* TODO. There's code in cp/typeck.c to do this. */
3559 num_type_elements = count_type_elements (type, true);
3561 /* Are there significantly more zeros than non-zeros? */
3562 sparse = (num_nonzero_elements <= num_type_elements/4);
3564 /* If count_type_elements could not determine number of type elements
3565 for a constant-sized object, assume clearing is needed.
3566 Don't do this for variable-sized objects, as store_constructor
3567 will ignore the clearing of variable-sized objects. */
3568 if (num_type_elements < 0 && int_size_in_bytes (type) >= 0)
3570 /* If there are "lots" of zeros, then block clear the object first. */
3571 else if (num_type_elements - num_nonzero_elements
3572 > CLEAR_RATIO (optimize_function_for_speed_p (cfun))
3575 /* ??? This bit ought not be needed. For any element not present
3576 in the initializer, we should simply set them to zero. Except
3577 we'd need to *find* the elements that are not present, and that
3578 requires trickery to avoid quadratic compile-time behavior in
3579 large cases or excessive memory use in small cases. */
3580 else if (num_ctor_elements < num_type_elements)
3583 /* If there are "lots" of initialized elements, and all of them
3584 are valid address constants, then the entire initializer can
3585 be dropped to memory, and then memcpy'd out. Don't do this
3586 for sparse arrays, though, as it's more efficient to follow
3587 the standard CONSTRUCTOR behavior of memset followed by
3588 individual element initialization. Also don't try to do
3589 bitwise copies of TREE_ADDRESSABLE types. */
3590 if (valid_const_initializer && !(cleared || sparse)
3591 && !TREE_ADDRESSABLE (type))
3593 HOST_WIDE_INT size = int_size_in_bytes (type);
3596 /* ??? We can still get unbounded array types, at least
3597 from the C++ front end. This seems wrong, but attempt
3598 to work around it for now. */
3601 size = int_size_in_bytes (TREE_TYPE (object));
3603 TREE_TYPE (ctor) = type = TREE_TYPE (object);
3606 /* Find the maximum alignment we can assume for the object. */
3607 /* ??? Make use of DECL_OFFSET_ALIGN. */
3608 if (DECL_P (object))
3609 align = DECL_ALIGN (object);
3611 align = TYPE_ALIGN (type);
3613 if (size > 0 && !can_move_by_pieces (size, align))
3617 if (notify_temp_creation)
3620 new_tree = create_tmp_var_raw (type, "C");
3622 gimple_add_tmp_var (new_tree);
3623 TREE_STATIC (new_tree) = 1;
3624 TREE_READONLY (new_tree) = 1;
3625 DECL_INITIAL (new_tree) = ctor;
3626 if (align > DECL_ALIGN (new_tree))
3628 DECL_ALIGN (new_tree) = align;
3629 DECL_USER_ALIGN (new_tree) = 1;
3631 walk_tree (&DECL_INITIAL (new_tree), force_labels_r, NULL, NULL);
3633 TREE_OPERAND (*expr_p, 1) = new_tree;
3635 /* This is no longer an assignment of a CONSTRUCTOR, but
3636 we still may have processing to do on the LHS. So
3637 pretend we didn't do anything here to let that happen. */
3638 return GS_UNHANDLED;
3642 if (notify_temp_creation)
3645 /* If there are nonzero elements, pre-evaluate to capture elements
3646 overlapping with the lhs into temporaries. We must do this before
3647 clearing to fetch the values before they are zeroed-out. */
3648 if (num_nonzero_elements > 0)
3650 preeval_data.lhs_base_decl = get_base_address (object);
3651 if (!DECL_P (preeval_data.lhs_base_decl))
3652 preeval_data.lhs_base_decl = NULL;
3653 preeval_data.lhs_alias_set = get_alias_set (object);
3655 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p, 1),
3656 pre_p, post_p, &preeval_data);
3661 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3662 Note that we still have to gimplify, in order to handle the
3663 case of variable sized types. Avoid shared tree structures. */
3664 CONSTRUCTOR_ELTS (ctor) = NULL;
3665 TREE_SIDE_EFFECTS (ctor) = 0;
3666 object = unshare_expr (object);
3667 gimplify_stmt (expr_p, pre_p);
3670 /* If we have not block cleared the object, or if there are nonzero
3671 elements in the constructor, add assignments to the individual
3672 scalar fields of the object. */
3673 if (!cleared || num_nonzero_elements > 0)
3674 gimplify_init_ctor_eval (object, elts, pre_p, cleared);
3676 *expr_p = NULL_TREE;
3684 if (notify_temp_creation)
3687 /* Extract the real and imaginary parts out of the ctor. */
3688 gcc_assert (VEC_length (constructor_elt, elts) == 2);
3689 r = VEC_index (constructor_elt, elts, 0)->value;
3690 i = VEC_index (constructor_elt, elts, 1)->value;
3691 if (r == NULL || i == NULL)
3693 tree zero = fold_convert (TREE_TYPE (type), integer_zero_node);
3700 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3701 represent creation of a complex value. */
3702 if (TREE_CONSTANT (r) && TREE_CONSTANT (i))
3704 ctor = build_complex (type, r, i);
3705 TREE_OPERAND (*expr_p, 1) = ctor;
3709 ctor = build2 (COMPLEX_EXPR, type, r, i);
3710 TREE_OPERAND (*expr_p, 1) = ctor;
3711 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 1),
3714 rhs_predicate_for (TREE_OPERAND (*expr_p, 0)),
3722 unsigned HOST_WIDE_INT ix;
3723 constructor_elt *ce;
3725 if (notify_temp_creation)
3728 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3729 if (TREE_CONSTANT (ctor))
3731 bool constant_p = true;
3734 /* Even when ctor is constant, it might contain non-*_CST
3735 elements, such as addresses or trapping values like
3736 1.0/0.0 - 1.0/0.0. Such expressions don't belong
3737 in VECTOR_CST nodes. */
3738 FOR_EACH_CONSTRUCTOR_VALUE (elts, ix, value)
3739 if (!CONSTANT_CLASS_P (value))
3747 TREE_OPERAND (*expr_p, 1) = build_vector_from_ctor (type, elts);
3751 /* Don't reduce an initializer constant even if we can't
3752 make a VECTOR_CST. It won't do anything for us, and it'll
3753 prevent us from representing it as a single constant. */
3754 if (initializer_constant_valid_p (ctor, type))
3757 TREE_CONSTANT (ctor) = 0;
3760 /* Vector types use CONSTRUCTOR all the way through gimple
3761 compilation as a general initializer. */
3762 for (ix = 0; VEC_iterate (constructor_elt, elts, ix, ce); ix++)
3764 enum gimplify_status tret;
3765 tret = gimplify_expr (&ce->value, pre_p, post_p, is_gimple_val,
3767 if (tret == GS_ERROR)
3770 if (!is_gimple_reg (TREE_OPERAND (*expr_p, 0)))
3771 TREE_OPERAND (*expr_p, 1) = get_formal_tmp_var (ctor, pre_p);
3776 /* So how did we get a CONSTRUCTOR for a scalar type? */
3780 if (ret == GS_ERROR)
3782 else if (want_value)
3789 /* If we have gimplified both sides of the initializer but have
3790 not emitted an assignment, do so now. */
3793 tree lhs = TREE_OPERAND (*expr_p, 0);
3794 tree rhs = TREE_OPERAND (*expr_p, 1);
3795 gimple init = gimple_build_assign (lhs, rhs);
3796 gimplify_seq_add_stmt (pre_p, init);
3804 /* Given a pointer value OP0, return a simplified version of an
3805 indirection through OP0, or NULL_TREE if no simplification is
3806 possible. Note that the resulting type may be different from
3807 the type pointed to in the sense that it is still compatible
3808 from the langhooks point of view. */
3811 gimple_fold_indirect_ref (tree t)
3813 tree type = TREE_TYPE (TREE_TYPE (t));
3817 STRIP_USELESS_TYPE_CONVERSION (sub);
3818 subtype = TREE_TYPE (sub);
3819 if (!POINTER_TYPE_P (subtype))
3822 if (TREE_CODE (sub) == ADDR_EXPR)
3824 tree op = TREE_OPERAND (sub, 0);
3825 tree optype = TREE_TYPE (op);
3827 if (useless_type_conversion_p (type, optype))
3830 /* *(foo *)&fooarray => fooarray[0] */
3831 if (TREE_CODE (optype) == ARRAY_TYPE
3832 && useless_type_conversion_p (type, TREE_TYPE (optype)))
3834 tree type_domain = TYPE_DOMAIN (optype);
3835 tree min_val = size_zero_node;
3836 if (type_domain && TYPE_MIN_VALUE (type_domain))
3837 min_val = TYPE_MIN_VALUE (type_domain);
3838 return build4 (ARRAY_REF, type, op, min_val, NULL_TREE, NULL_TREE);
3842 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
3843 if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
3844 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (subtype))))
3847 tree min_val = size_zero_node;
3849 sub = gimple_fold_indirect_ref (sub);
3851 sub = build1 (INDIRECT_REF, TREE_TYPE (subtype), osub);
3852 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
3853 if (type_domain && TYPE_MIN_VALUE (type_domain))
3854 min_val = TYPE_MIN_VALUE (type_domain);
3855 return build4 (ARRAY_REF, type, sub, min_val, NULL_TREE, NULL_TREE);
3861 /* Given a pointer value OP0, return a simplified version of an
3862 indirection through OP0, or NULL_TREE if no simplification is
3863 possible. This may only be applied to a rhs of an expression.
3864 Note that the resulting type may be different from the type pointed
3865 to in the sense that it is still compatible from the langhooks
3869 gimple_fold_indirect_ref_rhs (tree t)
3871 return gimple_fold_indirect_ref (t);
3874 /* Subroutine of gimplify_modify_expr to do simplifications of
3875 MODIFY_EXPRs based on the code of the RHS. We loop for as long as
3876 something changes. */
3878 static enum gimplify_status
3879 gimplify_modify_expr_rhs (tree *expr_p, tree *from_p, tree *to_p,
3880 gimple_seq *pre_p, gimple_seq *post_p,
3883 enum gimplify_status ret = GS_OK;
3885 while (ret != GS_UNHANDLED)
3886 switch (TREE_CODE (*from_p))
3889 /* If we're assigning from a constant constructor, move the
3890 constructor expression to the RHS of the MODIFY_EXPR. */
3891 if (DECL_INITIAL (*from_p)
3892 && TREE_READONLY (*from_p)
3893 && !TREE_THIS_VOLATILE (*from_p)
3894 && TREE_CODE (DECL_INITIAL (*from_p)) == CONSTRUCTOR)
3896 tree old_from = *from_p;
3898 /* Move the constructor into the RHS. */
3899 *from_p = unshare_expr (DECL_INITIAL (*from_p));
3901 /* Let's see if gimplify_init_constructor will need to put
3902 it in memory. If so, revert the change. */
3903 ret = gimplify_init_constructor (expr_p, NULL, NULL, false, true);
3904 if (ret == GS_ERROR)
3919 /* If we have code like
3923 where the type of "x" is a (possibly cv-qualified variant
3924 of "A"), treat the entire expression as identical to "x".
3925 This kind of code arises in C++ when an object is bound
3926 to a const reference, and if "x" is a TARGET_EXPR we want
3927 to take advantage of the optimization below. */
3928 tree t = gimple_fold_indirect_ref_rhs (TREE_OPERAND (*from_p, 0));
3941 /* If we are initializing something from a TARGET_EXPR, strip the
3942 TARGET_EXPR and initialize it directly, if possible. This can't
3943 be done if the initializer is void, since that implies that the
3944 temporary is set in some non-trivial way.
3946 ??? What about code that pulls out the temp and uses it
3947 elsewhere? I think that such code never uses the TARGET_EXPR as
3948 an initializer. If I'm wrong, we'll die because the temp won't
3949 have any RTL. In that case, I guess we'll need to replace
3950 references somehow. */
3951 tree init = TARGET_EXPR_INITIAL (*from_p);
3954 && !VOID_TYPE_P (TREE_TYPE (init)))
3965 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
3967 gimplify_compound_expr (from_p, pre_p, true);
3972 /* If we're initializing from a CONSTRUCTOR, break this into
3973 individual MODIFY_EXPRs. */
3974 return gimplify_init_constructor (expr_p, pre_p, post_p, want_value,
3978 /* If we're assigning to a non-register type, push the assignment
3979 down into the branches. This is mandatory for ADDRESSABLE types,
3980 since we cannot generate temporaries for such, but it saves a
3981 copy in other cases as well. */
3982 if (!is_gimple_reg_type (TREE_TYPE (*from_p)))
3984 /* This code should mirror the code in gimplify_cond_expr. */
3985 enum tree_code code = TREE_CODE (*expr_p);
3986 tree cond = *from_p;
3987 tree result = *to_p;
3989 ret = gimplify_expr (&result, pre_p, post_p,
3990 is_gimple_lvalue, fb_lvalue);
3991 if (ret != GS_ERROR)
3994 if (TREE_TYPE (TREE_OPERAND (cond, 1)) != void_type_node)
3995 TREE_OPERAND (cond, 1)
3996 = build2 (code, void_type_node, result,
3997 TREE_OPERAND (cond, 1));
3998 if (TREE_TYPE (TREE_OPERAND (cond, 2)) != void_type_node)
3999 TREE_OPERAND (cond, 2)
4000 = build2 (code, void_type_node, unshare_expr (result),
4001 TREE_OPERAND (cond, 2));
4003 TREE_TYPE (cond) = void_type_node;
4004 recalculate_side_effects (cond);
4008 gimplify_and_add (cond, pre_p);
4009 *expr_p = unshare_expr (result);
4020 /* For calls that return in memory, give *to_p as the CALL_EXPR's
4021 return slot so that we don't generate a temporary. */
4022 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p)
4023 && aggregate_value_p (*from_p, *from_p))
4027 if (!(rhs_predicate_for (*to_p))(*from_p))
4028 /* If we need a temporary, *to_p isn't accurate. */
4030 else if (TREE_CODE (*to_p) == RESULT_DECL
4031 && DECL_NAME (*to_p) == NULL_TREE
4032 && needs_to_live_in_memory (*to_p))
4033 /* It's OK to use the return slot directly unless it's an NRV. */
4035 else if (is_gimple_reg_type (TREE_TYPE (*to_p))
4036 || (DECL_P (*to_p) && DECL_REGISTER (*to_p)))
4037 /* Don't force regs into memory. */
4039 else if (TREE_CODE (*to_p) == VAR_DECL
4040 && DECL_GIMPLE_FORMAL_TEMP_P (*to_p))
4041 /* Don't use the original target if it's a formal temp; we
4042 don't want to take their addresses. */
4044 else if (TREE_CODE (*expr_p) == INIT_EXPR)
4045 /* It's OK to use the target directly if it's being
4048 else if (!is_gimple_non_addressable (*to_p))
4049 /* Don't use the original target if it's already addressable;
4050 if its address escapes, and the called function uses the
4051 NRV optimization, a conforming program could see *to_p
4052 change before the called function returns; see c++/19317.
4053 When optimizing, the return_slot pass marks more functions
4054 as safe after we have escape info. */
4061 CALL_EXPR_RETURN_SLOT_OPT (*from_p) = 1;
4062 mark_addressable (*to_p);
4069 /* If we're initializing from a container, push the initialization
4071 case CLEANUP_POINT_EXPR:
4073 case STATEMENT_LIST:
4075 tree wrap = *from_p;
4078 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_min_lval,
4080 if (ret != GS_ERROR)
4083 t = voidify_wrapper_expr (wrap, *expr_p);
4084 gcc_assert (t == *expr_p);
4088 gimplify_and_add (wrap, pre_p);
4089 *expr_p = unshare_expr (*to_p);
4105 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
4106 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
4107 DECL_GIMPLE_REG_P set.
4109 IMPORTANT NOTE: This promotion is performed by introducing a load of the
4110 other, unmodified part of the complex object just before the total store.
4111 As a consequence, if the object is still uninitialized, an undefined value
4112 will be loaded into a register, which may result in a spurious exception
4113 if the register is floating-point and the value happens to be a signaling
4114 NaN for example. Then the fully-fledged complex operations lowering pass
4115 followed by a DCE pass are necessary in order to fix things up. */
4117 static enum gimplify_status
4118 gimplify_modify_expr_complex_part (tree *expr_p, gimple_seq *pre_p,
4121 enum tree_code code, ocode;
4122 tree lhs, rhs, new_rhs, other, realpart, imagpart;
4124 lhs = TREE_OPERAND (*expr_p, 0);
4125 rhs = TREE_OPERAND (*expr_p, 1);
4126 code = TREE_CODE (lhs);
4127 lhs = TREE_OPERAND (lhs, 0);
4129 ocode = code == REALPART_EXPR ? IMAGPART_EXPR : REALPART_EXPR;
4130 other = build1 (ocode, TREE_TYPE (rhs), lhs);
4131 other = get_formal_tmp_var (other, pre_p);
4133 realpart = code == REALPART_EXPR ? rhs : other;
4134 imagpart = code == REALPART_EXPR ? other : rhs;
4136 if (TREE_CONSTANT (realpart) && TREE_CONSTANT (imagpart))
4137 new_rhs = build_complex (TREE_TYPE (lhs), realpart, imagpart);
4139 new_rhs = build2 (COMPLEX_EXPR, TREE_TYPE (lhs), realpart, imagpart);
4141 gimplify_seq_add_stmt (pre_p, gimple_build_assign (lhs, new_rhs));
4142 *expr_p = (want_value) ? rhs : NULL_TREE;
4148 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
4154 PRE_P points to the list where side effects that must happen before
4155 *EXPR_P should be stored.
4157 POST_P points to the list where side effects that must happen after
4158 *EXPR_P should be stored.
4160 WANT_VALUE is nonzero iff we want to use the value of this expression
4161 in another expression. */
4163 static enum gimplify_status
4164 gimplify_modify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
4167 tree *from_p = &TREE_OPERAND (*expr_p, 1);
4168 tree *to_p = &TREE_OPERAND (*expr_p, 0);
4169 enum gimplify_status ret = GS_UNHANDLED;
4172 gcc_assert (TREE_CODE (*expr_p) == MODIFY_EXPR
4173 || TREE_CODE (*expr_p) == INIT_EXPR);
4175 /* Insert pointer conversions required by the middle-end that are not
4176 required by the frontend. This fixes middle-end type checking for
4177 for example gcc.dg/redecl-6.c. */
4178 if (POINTER_TYPE_P (TREE_TYPE (*to_p))
4179 && lang_hooks.types_compatible_p (TREE_TYPE (*to_p), TREE_TYPE (*from_p)))
4181 STRIP_USELESS_TYPE_CONVERSION (*from_p);
4182 if (!useless_type_conversion_p (TREE_TYPE (*to_p), TREE_TYPE (*from_p)))
4183 *from_p = fold_convert (TREE_TYPE (*to_p), *from_p);
4186 /* See if any simplifications can be done based on what the RHS is. */
4187 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
4189 if (ret != GS_UNHANDLED)
4192 /* For zero sized types only gimplify the left hand side and right hand
4193 side as statements and throw away the assignment. Do this after
4194 gimplify_modify_expr_rhs so we handle TARGET_EXPRs of addressable
4196 if (zero_sized_type (TREE_TYPE (*from_p)) && !want_value)
4198 gimplify_stmt (from_p, pre_p);
4199 gimplify_stmt (to_p, pre_p);
4200 *expr_p = NULL_TREE;
4204 /* If the value being copied is of variable width, compute the length
4205 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
4206 before gimplifying any of the operands so that we can resolve any
4207 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
4208 the size of the expression to be copied, not of the destination, so
4209 that is what we must do here. */
4210 maybe_with_size_expr (from_p);
4212 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
4213 if (ret == GS_ERROR)
4216 /* As a special case, we have to temporarily allow for assignments
4217 with a CALL_EXPR on the RHS. Since in GIMPLE a function call is
4218 a toplevel statement, when gimplifying the GENERIC expression
4219 MODIFY_EXPR <a, CALL_EXPR <foo>>, we cannot create the tuple
4220 GIMPLE_ASSIGN <a, GIMPLE_CALL <foo>>.
4222 Instead, we need to create the tuple GIMPLE_CALL <a, foo>. To
4223 prevent gimplify_expr from trying to create a new temporary for
4224 foo's LHS, we tell it that it should only gimplify until it
4225 reaches the CALL_EXPR. On return from gimplify_expr, the newly
4226 created GIMPLE_CALL <foo> will be the last statement in *PRE_P
4227 and all we need to do here is set 'a' to be its LHS. */
4228 ret = gimplify_expr (from_p, pre_p, post_p, rhs_predicate_for (*to_p),
4230 if (ret == GS_ERROR)
4233 /* Now see if the above changed *from_p to something we handle specially. */
4234 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
4236 if (ret != GS_UNHANDLED)
4239 /* If we've got a variable sized assignment between two lvalues (i.e. does
4240 not involve a call), then we can make things a bit more straightforward
4241 by converting the assignment to memcpy or memset. */
4242 if (TREE_CODE (*from_p) == WITH_SIZE_EXPR)
4244 tree from = TREE_OPERAND (*from_p, 0);
4245 tree size = TREE_OPERAND (*from_p, 1);
4247 if (TREE_CODE (from) == CONSTRUCTOR)
4248 return gimplify_modify_expr_to_memset (expr_p, size, want_value, pre_p);
4250 if (is_gimple_addressable (from))
4253 return gimplify_modify_expr_to_memcpy (expr_p, size, want_value,
4258 /* Transform partial stores to non-addressable complex variables into
4259 total stores. This allows us to use real instead of virtual operands
4260 for these variables, which improves optimization. */
4261 if ((TREE_CODE (*to_p) == REALPART_EXPR
4262 || TREE_CODE (*to_p) == IMAGPART_EXPR)
4263 && is_gimple_reg (TREE_OPERAND (*to_p, 0)))
4264 return gimplify_modify_expr_complex_part (expr_p, pre_p, want_value);
4266 /* Try to alleviate the effects of the gimplification creating artificial
4267 temporaries (see for example is_gimple_reg_rhs) on the debug info. */
4268 if (!gimplify_ctxp->into_ssa
4270 && DECL_IGNORED_P (*from_p)
4272 && !DECL_IGNORED_P (*to_p))
4274 if (!DECL_NAME (*from_p) && DECL_NAME (*to_p))
4276 = create_tmp_var_name (IDENTIFIER_POINTER (DECL_NAME (*to_p)));
4277 DECL_DEBUG_EXPR_IS_FROM (*from_p) = 1;
4278 SET_DECL_DEBUG_EXPR (*from_p, *to_p);
4281 if (TREE_CODE (*from_p) == CALL_EXPR)
4283 /* Since the RHS is a CALL_EXPR, we need to create a GIMPLE_CALL
4284 instead of a GIMPLE_ASSIGN. */
4285 assign = gimple_build_call_from_tree (*from_p);
4286 gimple_call_set_lhs (assign, *to_p);
4289 assign = gimple_build_assign (*to_p, *from_p);
4291 gimplify_seq_add_stmt (pre_p, assign);
4293 if (gimplify_ctxp->into_ssa && is_gimple_reg (*to_p))
4295 /* If we've somehow already got an SSA_NAME on the LHS, then
4296 we've probably modified it twice. Not good. */
4297 gcc_assert (TREE_CODE (*to_p) != SSA_NAME);
4298 *to_p = make_ssa_name (*to_p, assign);
4299 gimple_set_lhs (assign, *to_p);
4304 *expr_p = unshare_expr (*to_p);
4313 /* Gimplify a comparison between two variable-sized objects. Do this
4314 with a call to BUILT_IN_MEMCMP. */
4316 static enum gimplify_status
4317 gimplify_variable_sized_compare (tree *expr_p)
4319 tree op0 = TREE_OPERAND (*expr_p, 0);
4320 tree op1 = TREE_OPERAND (*expr_p, 1);
4321 tree t, arg, dest, src;
4323 arg = TYPE_SIZE_UNIT (TREE_TYPE (op0));
4324 arg = unshare_expr (arg);
4325 arg = SUBSTITUTE_PLACEHOLDER_IN_EXPR (arg, op0);
4326 src = build_fold_addr_expr (op1);
4327 dest = build_fold_addr_expr (op0);
4328 t = implicit_built_in_decls[BUILT_IN_MEMCMP];
4329 t = build_call_expr (t, 3, dest, src, arg);
4331 = build2 (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), t, integer_zero_node);
4336 /* Gimplify a comparison between two aggregate objects of integral scalar
4337 mode as a comparison between the bitwise equivalent scalar values. */
4339 static enum gimplify_status
4340 gimplify_scalar_mode_aggregate_compare (tree *expr_p)
4342 tree op0 = TREE_OPERAND (*expr_p, 0);
4343 tree op1 = TREE_OPERAND (*expr_p, 1);
4345 tree type = TREE_TYPE (op0);
4346 tree scalar_type = lang_hooks.types.type_for_mode (TYPE_MODE (type), 1);
4348 op0 = fold_build1 (VIEW_CONVERT_EXPR, scalar_type, op0);
4349 op1 = fold_build1 (VIEW_CONVERT_EXPR, scalar_type, op1);
4352 = fold_build2 (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), op0, op1);
4357 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
4358 points to the expression to gimplify.
4360 Expressions of the form 'a && b' are gimplified to:
4362 a && b ? true : false
4364 gimplify_cond_expr will do the rest.
4366 PRE_P points to the list where side effects that must happen before
4367 *EXPR_P should be stored. */
4369 static enum gimplify_status
4370 gimplify_boolean_expr (tree *expr_p)
4372 /* Preserve the original type of the expression. */
4373 tree type = TREE_TYPE (*expr_p);
4375 *expr_p = build3 (COND_EXPR, type, *expr_p,
4376 fold_convert (type, boolean_true_node),
4377 fold_convert (type, boolean_false_node));
4382 /* Gimplifies an expression sequence. This function gimplifies each
4383 expression and re-writes the original expression with the last
4384 expression of the sequence in GIMPLE form.
4386 PRE_P points to the list where the side effects for all the
4387 expressions in the sequence will be emitted.
4389 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
4391 static enum gimplify_status
4392 gimplify_compound_expr (tree *expr_p, gimple_seq *pre_p, bool want_value)
4398 tree *sub_p = &TREE_OPERAND (t, 0);
4400 if (TREE_CODE (*sub_p) == COMPOUND_EXPR)
4401 gimplify_compound_expr (sub_p, pre_p, false);
4403 gimplify_stmt (sub_p, pre_p);
4405 t = TREE_OPERAND (t, 1);
4407 while (TREE_CODE (t) == COMPOUND_EXPR);
4414 gimplify_stmt (expr_p, pre_p);
4420 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
4421 gimplify. After gimplification, EXPR_P will point to a new temporary
4422 that holds the original value of the SAVE_EXPR node.
4424 PRE_P points to the list where side effects that must happen before
4425 *EXPR_P should be stored. */
4427 static enum gimplify_status
4428 gimplify_save_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4430 enum gimplify_status ret = GS_ALL_DONE;
4433 gcc_assert (TREE_CODE (*expr_p) == SAVE_EXPR);
4434 val = TREE_OPERAND (*expr_p, 0);
4436 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
4437 if (!SAVE_EXPR_RESOLVED_P (*expr_p))
4439 /* The operand may be a void-valued expression such as SAVE_EXPRs
4440 generated by the Java frontend for class initialization. It is
4441 being executed only for its side-effects. */
4442 if (TREE_TYPE (val) == void_type_node)
4444 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
4445 is_gimple_stmt, fb_none);
4449 val = get_initialized_tmp_var (val, pre_p, post_p);
4451 TREE_OPERAND (*expr_p, 0) = val;
4452 SAVE_EXPR_RESOLVED_P (*expr_p) = 1;
4460 /* Re-write the ADDR_EXPR node pointed to by EXPR_P
4467 PRE_P points to the list where side effects that must happen before
4468 *EXPR_P should be stored.
4470 POST_P points to the list where side effects that must happen after
4471 *EXPR_P should be stored. */
4473 static enum gimplify_status
4474 gimplify_addr_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4476 tree expr = *expr_p;
4477 tree op0 = TREE_OPERAND (expr, 0);
4478 enum gimplify_status ret;
4480 switch (TREE_CODE (op0))
4483 case MISALIGNED_INDIRECT_REF:
4485 /* Check if we are dealing with an expression of the form '&*ptr'.
4486 While the front end folds away '&*ptr' into 'ptr', these
4487 expressions may be generated internally by the compiler (e.g.,
4488 builtins like __builtin_va_end). */
4489 /* Caution: the silent array decomposition semantics we allow for
4490 ADDR_EXPR means we can't always discard the pair. */
4491 /* Gimplification of the ADDR_EXPR operand may drop
4492 cv-qualification conversions, so make sure we add them if
4495 tree op00 = TREE_OPERAND (op0, 0);
4496 tree t_expr = TREE_TYPE (expr);
4497 tree t_op00 = TREE_TYPE (op00);
4499 if (!useless_type_conversion_p (t_expr, t_op00))
4500 op00 = fold_convert (TREE_TYPE (expr), op00);
4506 case VIEW_CONVERT_EXPR:
4507 /* Take the address of our operand and then convert it to the type of
4510 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
4511 all clear. The impact of this transformation is even less clear. */
4513 /* If the operand is a useless conversion, look through it. Doing so
4514 guarantees that the ADDR_EXPR and its operand will remain of the
4516 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0, 0)))
4517 op0 = TREE_OPERAND (op0, 0);
4519 *expr_p = fold_convert (TREE_TYPE (expr),
4520 build_fold_addr_expr (TREE_OPERAND (op0, 0)));
4525 /* We use fb_either here because the C frontend sometimes takes
4526 the address of a call that returns a struct; see
4527 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
4528 the implied temporary explicit. */
4530 /* Mark the RHS addressable. */
4531 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, post_p,
4532 is_gimple_addressable, fb_either);
4533 if (ret == GS_ERROR)
4536 /* We cannot rely on making the RHS addressable if it is
4537 a temporary created by gimplification. In this case create a
4538 new temporary that is initialized by a copy (which will
4539 become a store after we mark it addressable).
4540 This mostly happens if the frontend passed us something that
4541 it could not mark addressable yet, like a fortran
4542 pass-by-reference parameter (int) floatvar. */
4543 if (is_gimple_formal_tmp_var (TREE_OPERAND (expr, 0)))
4544 TREE_OPERAND (expr, 0)
4545 = get_initialized_tmp_var (TREE_OPERAND (expr, 0), pre_p, post_p);
4547 op0 = TREE_OPERAND (expr, 0);
4549 /* For various reasons, the gimplification of the expression
4550 may have made a new INDIRECT_REF. */
4551 if (TREE_CODE (op0) == INDIRECT_REF)
4552 goto do_indirect_ref;
4554 /* Make sure TREE_CONSTANT and TREE_SIDE_EFFECTS are set properly. */
4555 recompute_tree_invariant_for_addr_expr (expr);
4557 mark_addressable (TREE_OPERAND (expr, 0));
4564 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
4565 value; output operands should be a gimple lvalue. */
4567 static enum gimplify_status
4568 gimplify_asm_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4572 const char **oconstraints;
4575 const char *constraint;
4576 bool allows_mem, allows_reg, is_inout;
4577 enum gimplify_status ret, tret;
4579 VEC(tree, gc) *inputs;
4580 VEC(tree, gc) *outputs;
4581 VEC(tree, gc) *clobbers;
4585 noutputs = list_length (ASM_OUTPUTS (expr));
4586 oconstraints = (const char **) alloca ((noutputs) * sizeof (const char *));
4588 inputs = outputs = clobbers = NULL;
4591 link_next = NULL_TREE;
4592 for (i = 0, link = ASM_OUTPUTS (expr); link; ++i, link = link_next)
4595 size_t constraint_len;
4597 link_next = TREE_CHAIN (link);
4601 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4602 constraint_len = strlen (constraint);
4603 if (constraint_len == 0)
4606 ok = parse_output_constraint (&constraint, i, 0, 0,
4607 &allows_mem, &allows_reg, &is_inout);
4614 if (!allows_reg && allows_mem)
4615 mark_addressable (TREE_VALUE (link));
4617 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4618 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
4619 fb_lvalue | fb_mayfail);
4620 if (tret == GS_ERROR)
4622 error ("invalid lvalue in asm output %d", i);
4626 VEC_safe_push (tree, gc, outputs, link);
4627 TREE_CHAIN (link) = NULL_TREE;
4631 /* An input/output operand. To give the optimizers more
4632 flexibility, split it into separate input and output
4637 /* Turn the in/out constraint into an output constraint. */
4638 char *p = xstrdup (constraint);
4640 TREE_VALUE (TREE_PURPOSE (link)) = build_string (constraint_len, p);
4642 /* And add a matching input constraint. */
4645 sprintf (buf, "%d", i);
4647 /* If there are multiple alternatives in the constraint,
4648 handle each of them individually. Those that allow register
4649 will be replaced with operand number, the others will stay
4651 if (strchr (p, ',') != NULL)
4653 size_t len = 0, buflen = strlen (buf);
4654 char *beg, *end, *str, *dst;
4658 end = strchr (beg, ',');
4660 end = strchr (beg, '\0');
4661 if ((size_t) (end - beg) < buflen)
4664 len += end - beg + 1;
4671 str = (char *) alloca (len);
4672 for (beg = p + 1, dst = str;;)
4675 bool mem_p, reg_p, inout_p;
4677 end = strchr (beg, ',');
4682 parse_output_constraint (&tem, i, 0, 0,
4683 &mem_p, ®_p, &inout_p);
4688 memcpy (dst, buf, buflen);
4697 memcpy (dst, beg, len);
4706 input = build_string (dst - str, str);
4709 input = build_string (strlen (buf), buf);
4712 input = build_string (constraint_len - 1, constraint + 1);
4716 input = build_tree_list (build_tree_list (NULL_TREE, input),
4717 unshare_expr (TREE_VALUE (link)));
4718 ASM_INPUTS (expr) = chainon (ASM_INPUTS (expr), input);
4722 link_next = NULL_TREE;
4723 for (link = ASM_INPUTS (expr); link; ++i, link = link_next)
4725 link_next = TREE_CHAIN (link);
4726 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4727 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
4728 oconstraints, &allows_mem, &allows_reg);
4730 /* If we can't make copies, we can only accept memory. */
4731 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (link))))
4737 error ("impossible constraint in %<asm%>");
4738 error ("non-memory input %d must stay in memory", i);
4743 /* If the operand is a memory input, it should be an lvalue. */
4744 if (!allows_reg && allows_mem)
4746 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4747 is_gimple_lvalue, fb_lvalue | fb_mayfail);
4748 mark_addressable (TREE_VALUE (link));
4749 if (tret == GS_ERROR)
4751 if (EXPR_HAS_LOCATION (TREE_VALUE (link)))
4752 input_location = EXPR_LOCATION (TREE_VALUE (link));
4753 error ("memory input %d is not directly addressable", i);
4759 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4760 is_gimple_asm_val, fb_rvalue);
4761 if (tret == GS_ERROR)
4765 TREE_CHAIN (link) = NULL_TREE;
4766 VEC_safe_push (tree, gc, inputs, link);
4769 for (link = ASM_CLOBBERS (expr); link; ++i, link = TREE_CHAIN (link))
4770 VEC_safe_push (tree, gc, clobbers, link);
4772 stmt = gimple_build_asm_vec (TREE_STRING_POINTER (ASM_STRING (expr)),
4773 inputs, outputs, clobbers);
4775 gimple_asm_set_volatile (stmt, ASM_VOLATILE_P (expr));
4776 gimple_asm_set_input (stmt, ASM_INPUT_P (expr));
4778 gimplify_seq_add_stmt (pre_p, stmt);
4783 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
4784 GIMPLE_WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
4785 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
4786 return to this function.
4788 FIXME should we complexify the prequeue handling instead? Or use flags
4789 for all the cleanups and let the optimizer tighten them up? The current
4790 code seems pretty fragile; it will break on a cleanup within any
4791 non-conditional nesting. But any such nesting would be broken, anyway;
4792 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
4793 and continues out of it. We can do that at the RTL level, though, so
4794 having an optimizer to tighten up try/finally regions would be a Good
4797 static enum gimplify_status
4798 gimplify_cleanup_point_expr (tree *expr_p, gimple_seq *pre_p)
4800 gimple_stmt_iterator iter;
4801 gimple_seq body_sequence = NULL;
4803 tree temp = voidify_wrapper_expr (*expr_p, NULL);
4805 /* We only care about the number of conditions between the innermost
4806 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
4807 any cleanups collected outside the CLEANUP_POINT_EXPR. */
4808 int old_conds = gimplify_ctxp->conditions;
4809 gimple_seq old_cleanups = gimplify_ctxp->conditional_cleanups;
4810 gimplify_ctxp->conditions = 0;
4811 gimplify_ctxp->conditional_cleanups = NULL;
4813 gimplify_stmt (&TREE_OPERAND (*expr_p, 0), &body_sequence);
4815 gimplify_ctxp->conditions = old_conds;
4816 gimplify_ctxp->conditional_cleanups = old_cleanups;
4818 for (iter = gsi_start (body_sequence); !gsi_end_p (iter); )
4820 gimple wce = gsi_stmt (iter);
4822 if (gimple_code (wce) == GIMPLE_WITH_CLEANUP_EXPR)
4824 if (gsi_one_before_end_p (iter))
4826 /* Note that gsi_insert_seq_before and gsi_remove do not
4827 scan operands, unlike some other sequence mutators. */
4828 gsi_insert_seq_before_without_update (&iter,
4829 gimple_wce_cleanup (wce),
4831 gsi_remove (&iter, true);
4838 enum gimple_try_flags kind;
4840 if (gimple_wce_cleanup_eh_only (wce))
4841 kind = GIMPLE_TRY_CATCH;
4843 kind = GIMPLE_TRY_FINALLY;
4844 seq = gsi_split_seq_after (iter);
4846 gtry = gimple_build_try (seq, gimple_wce_cleanup (wce), kind);
4847 /* Do not use gsi_replace here, as it may scan operands.
4848 We want to do a simple structural modification only. */
4849 *gsi_stmt_ptr (&iter) = gtry;
4850 iter = gsi_start (seq);
4857 gimplify_seq_add_seq (pre_p, body_sequence);
4870 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
4871 is the cleanup action required. EH_ONLY is true if the cleanup should
4872 only be executed if an exception is thrown, not on normal exit. */
4875 gimple_push_cleanup (tree var, tree cleanup, bool eh_only, gimple_seq *pre_p)
4878 gimple_seq cleanup_stmts = NULL;
4880 /* Errors can result in improperly nested cleanups. Which results in
4881 confusion when trying to resolve the GIMPLE_WITH_CLEANUP_EXPR. */
4882 if (errorcount || sorrycount)
4885 if (gimple_conditional_context ())
4887 /* If we're in a conditional context, this is more complex. We only
4888 want to run the cleanup if we actually ran the initialization that
4889 necessitates it, but we want to run it after the end of the
4890 conditional context. So we wrap the try/finally around the
4891 condition and use a flag to determine whether or not to actually
4892 run the destructor. Thus
4896 becomes (approximately)
4900 if (test) { A::A(temp); flag = 1; val = f(temp); }
4903 if (flag) A::~A(temp);
4907 tree flag = create_tmp_var (boolean_type_node, "cleanup");
4908 gimple ffalse = gimple_build_assign (flag, boolean_false_node);
4909 gimple ftrue = gimple_build_assign (flag, boolean_true_node);
4911 cleanup = build3 (COND_EXPR, void_type_node, flag, cleanup, NULL);
4912 gimplify_stmt (&cleanup, &cleanup_stmts);
4913 wce = gimple_build_wce (cleanup_stmts);
4915 gimplify_seq_add_stmt (&gimplify_ctxp->conditional_cleanups, ffalse);
4916 gimplify_seq_add_stmt (&gimplify_ctxp->conditional_cleanups, wce);
4917 gimplify_seq_add_stmt (pre_p, ftrue);
4919 /* Because of this manipulation, and the EH edges that jump
4920 threading cannot redirect, the temporary (VAR) will appear
4921 to be used uninitialized. Don't warn. */
4922 TREE_NO_WARNING (var) = 1;
4926 gimplify_stmt (&cleanup, &cleanup_stmts);
4927 wce = gimple_build_wce (cleanup_stmts);
4928 gimple_wce_set_cleanup_eh_only (wce, eh_only);
4929 gimplify_seq_add_stmt (pre_p, wce);
4933 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
4935 static enum gimplify_status
4936 gimplify_target_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4938 tree targ = *expr_p;
4939 tree temp = TARGET_EXPR_SLOT (targ);
4940 tree init = TARGET_EXPR_INITIAL (targ);
4941 enum gimplify_status ret;
4945 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
4946 to the temps list. Handle also variable length TARGET_EXPRs. */
4947 if (TREE_CODE (DECL_SIZE (temp)) != INTEGER_CST)
4949 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (temp)))
4950 gimplify_type_sizes (TREE_TYPE (temp), pre_p);
4951 gimplify_vla_decl (temp, pre_p);
4954 gimple_add_tmp_var (temp);
4956 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
4957 expression is supposed to initialize the slot. */
4958 if (VOID_TYPE_P (TREE_TYPE (init)))
4959 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
4962 tree init_expr = build2 (INIT_EXPR, void_type_node, temp, init);
4964 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
4966 ggc_free (init_expr);
4968 if (ret == GS_ERROR)
4970 /* PR c++/28266 Make sure this is expanded only once. */
4971 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
4975 gimplify_and_add (init, pre_p);
4977 /* If needed, push the cleanup for the temp. */
4978 if (TARGET_EXPR_CLEANUP (targ))
4979 gimple_push_cleanup (temp, TARGET_EXPR_CLEANUP (targ),
4980 CLEANUP_EH_ONLY (targ), pre_p);
4982 /* Only expand this once. */
4983 TREE_OPERAND (targ, 3) = init;
4984 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
4987 /* We should have expanded this before. */
4988 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp));
4994 /* Gimplification of expression trees. */
4996 /* Gimplify an expression which appears at statement context. The
4997 corresponding GIMPLE statements are added to *SEQ_P. If *SEQ_P is
4998 NULL, a new sequence is allocated.
5000 Return true if we actually added a statement to the queue. */
5003 gimplify_stmt (tree *stmt_p, gimple_seq *seq_p)
5005 gimple_seq_node last;
5008 *seq_p = gimple_seq_alloc ();
5010 last = gimple_seq_last (*seq_p);
5011 gimplify_expr (stmt_p, seq_p, NULL, is_gimple_stmt, fb_none);
5012 return last != gimple_seq_last (*seq_p);
5016 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
5017 to CTX. If entries already exist, force them to be some flavor of private.
5018 If there is no enclosing parallel, do nothing. */
5021 omp_firstprivatize_variable (struct gimplify_omp_ctx *ctx, tree decl)
5025 if (decl == NULL || !DECL_P (decl))
5030 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5033 if (n->value & GOVD_SHARED)
5034 n->value = GOVD_FIRSTPRIVATE | (n->value & GOVD_SEEN);
5038 else if (ctx->region_type != ORT_WORKSHARE)
5039 omp_add_variable (ctx, decl, GOVD_FIRSTPRIVATE);
5041 ctx = ctx->outer_context;
5046 /* Similarly for each of the type sizes of TYPE. */
5049 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx *ctx, tree type)
5051 if (type == NULL || type == error_mark_node)
5053 type = TYPE_MAIN_VARIANT (type);
5055 if (pointer_set_insert (ctx->privatized_types, type))
5058 switch (TREE_CODE (type))
5064 case FIXED_POINT_TYPE:
5065 omp_firstprivatize_variable (ctx, TYPE_MIN_VALUE (type));
5066 omp_firstprivatize_variable (ctx, TYPE_MAX_VALUE (type));
5070 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
5071 omp_firstprivatize_type_sizes (ctx, TYPE_DOMAIN (type));
5076 case QUAL_UNION_TYPE:
5079 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
5080 if (TREE_CODE (field) == FIELD_DECL)
5082 omp_firstprivatize_variable (ctx, DECL_FIELD_OFFSET (field));
5083 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (field));
5089 case REFERENCE_TYPE:
5090 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
5097 omp_firstprivatize_variable (ctx, TYPE_SIZE (type));
5098 omp_firstprivatize_variable (ctx, TYPE_SIZE_UNIT (type));
5099 lang_hooks.types.omp_firstprivatize_type_sizes (ctx, type);
5102 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
5105 omp_add_variable (struct gimplify_omp_ctx *ctx, tree decl, unsigned int flags)
5108 unsigned int nflags;
5111 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5114 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
5115 there are constructors involved somewhere. */
5116 if (TREE_ADDRESSABLE (TREE_TYPE (decl))
5117 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
5120 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5123 /* We shouldn't be re-adding the decl with the same data
5125 gcc_assert ((n->value & GOVD_DATA_SHARE_CLASS & flags) == 0);
5126 /* The only combination of data sharing classes we should see is
5127 FIRSTPRIVATE and LASTPRIVATE. */
5128 nflags = n->value | flags;
5129 gcc_assert ((nflags & GOVD_DATA_SHARE_CLASS)
5130 == (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE));
5135 /* When adding a variable-sized variable, we have to handle all sorts
5136 of additional bits of data: the pointer replacement variable, and
5137 the parameters of the type. */
5138 if (DECL_SIZE (decl) && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
5140 /* Add the pointer replacement variable as PRIVATE if the variable
5141 replacement is private, else FIRSTPRIVATE since we'll need the
5142 address of the original variable either for SHARED, or for the
5143 copy into or out of the context. */
5144 if (!(flags & GOVD_LOCAL))
5146 nflags = flags & GOVD_PRIVATE ? GOVD_PRIVATE : GOVD_FIRSTPRIVATE;
5147 nflags |= flags & GOVD_SEEN;
5148 t = DECL_VALUE_EXPR (decl);
5149 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
5150 t = TREE_OPERAND (t, 0);
5151 gcc_assert (DECL_P (t));
5152 omp_add_variable (ctx, t, nflags);
5155 /* Add all of the variable and type parameters (which should have
5156 been gimplified to a formal temporary) as FIRSTPRIVATE. */
5157 omp_firstprivatize_variable (ctx, DECL_SIZE_UNIT (decl));
5158 omp_firstprivatize_variable (ctx, DECL_SIZE (decl));
5159 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
5161 /* The variable-sized variable itself is never SHARED, only some form
5162 of PRIVATE. The sharing would take place via the pointer variable
5163 which we remapped above. */
5164 if (flags & GOVD_SHARED)
5165 flags = GOVD_PRIVATE | GOVD_DEBUG_PRIVATE
5166 | (flags & (GOVD_SEEN | GOVD_EXPLICIT));
5168 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
5169 alloca statement we generate for the variable, so make sure it
5170 is available. This isn't automatically needed for the SHARED
5171 case, since we won't be allocating local storage then.
5172 For local variables TYPE_SIZE_UNIT might not be gimplified yet,
5173 in this case omp_notice_variable will be called later
5174 on when it is gimplified. */
5175 else if (! (flags & GOVD_LOCAL))
5176 omp_notice_variable (ctx, TYPE_SIZE_UNIT (TREE_TYPE (decl)), true);
5178 else if (lang_hooks.decls.omp_privatize_by_reference (decl))
5180 gcc_assert ((flags & GOVD_LOCAL) == 0);
5181 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
5183 /* Similar to the direct variable sized case above, we'll need the
5184 size of references being privatized. */
5185 if ((flags & GOVD_SHARED) == 0)
5187 t = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl)));
5188 if (TREE_CODE (t) != INTEGER_CST)
5189 omp_notice_variable (ctx, t, true);
5193 splay_tree_insert (ctx->variables, (splay_tree_key)decl, flags);
5196 /* Record the fact that DECL was used within the OpenMP context CTX.
5197 IN_CODE is true when real code uses DECL, and false when we should
5198 merely emit default(none) errors. Return true if DECL is going to
5199 be remapped and thus DECL shouldn't be gimplified into its
5200 DECL_VALUE_EXPR (if any). */
5203 omp_notice_variable (struct gimplify_omp_ctx *ctx, tree decl, bool in_code)
5206 unsigned flags = in_code ? GOVD_SEEN : 0;
5207 bool ret = false, shared;
5209 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5212 /* Threadprivate variables are predetermined. */
5213 if (is_global_var (decl))
5215 if (DECL_THREAD_LOCAL_P (decl))
5218 if (DECL_HAS_VALUE_EXPR_P (decl))
5220 tree value = get_base_address (DECL_VALUE_EXPR (decl));
5222 if (value && DECL_P (value) && DECL_THREAD_LOCAL_P (value))
5227 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5230 enum omp_clause_default_kind default_kind, kind;
5231 struct gimplify_omp_ctx *octx;
5233 if (ctx->region_type == ORT_WORKSHARE)
5236 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
5237 remapped firstprivate instead of shared. To some extent this is
5238 addressed in omp_firstprivatize_type_sizes, but not effectively. */
5239 default_kind = ctx->default_kind;
5240 kind = lang_hooks.decls.omp_predetermined_sharing (decl);
5241 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
5242 default_kind = kind;
5244 switch (default_kind)
5246 case OMP_CLAUSE_DEFAULT_NONE:
5247 error ("%qs not specified in enclosing parallel",
5248 IDENTIFIER_POINTER (DECL_NAME (decl)));
5249 error ("%Henclosing parallel", &ctx->location);
5251 case OMP_CLAUSE_DEFAULT_SHARED:
5252 flags |= GOVD_SHARED;
5254 case OMP_CLAUSE_DEFAULT_PRIVATE:
5255 flags |= GOVD_PRIVATE;
5257 case OMP_CLAUSE_DEFAULT_FIRSTPRIVATE:
5258 flags |= GOVD_FIRSTPRIVATE;
5260 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
5261 /* decl will be either GOVD_FIRSTPRIVATE or GOVD_SHARED. */
5262 gcc_assert (ctx->region_type == ORT_TASK);
5263 if (ctx->outer_context)
5264 omp_notice_variable (ctx->outer_context, decl, in_code);
5265 for (octx = ctx->outer_context; octx; octx = octx->outer_context)
5269 n2 = splay_tree_lookup (octx->variables, (splay_tree_key) decl);
5270 if (n2 && (n2->value & GOVD_DATA_SHARE_CLASS) != GOVD_SHARED)
5272 flags |= GOVD_FIRSTPRIVATE;
5275 if ((octx->region_type & ORT_PARALLEL) != 0)
5278 if (flags & GOVD_FIRSTPRIVATE)
5281 && (TREE_CODE (decl) == PARM_DECL
5282 || (!is_global_var (decl)
5283 && DECL_CONTEXT (decl) == current_function_decl)))
5285 flags |= GOVD_FIRSTPRIVATE;
5288 flags |= GOVD_SHARED;
5294 if ((flags & GOVD_PRIVATE)
5295 && lang_hooks.decls.omp_private_outer_ref (decl))
5296 flags |= GOVD_PRIVATE_OUTER_REF;
5298 omp_add_variable (ctx, decl, flags);
5300 shared = (flags & GOVD_SHARED) != 0;
5301 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
5305 shared = ((flags | n->value) & GOVD_SHARED) != 0;
5306 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
5308 /* If nothing changed, there's nothing left to do. */
5309 if ((n->value & flags) == flags)
5315 /* If the variable is private in the current context, then we don't
5316 need to propagate anything to an outer context. */
5317 if ((flags & GOVD_PRIVATE) && !(flags & GOVD_PRIVATE_OUTER_REF))
5319 if (ctx->outer_context
5320 && omp_notice_variable (ctx->outer_context, decl, in_code))
5325 /* Verify that DECL is private within CTX. If there's specific information
5326 to the contrary in the innermost scope, generate an error. */
5329 omp_is_private (struct gimplify_omp_ctx *ctx, tree decl)
5333 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5336 if (n->value & GOVD_SHARED)
5338 if (ctx == gimplify_omp_ctxp)
5340 error ("iteration variable %qs should be private",
5341 IDENTIFIER_POINTER (DECL_NAME (decl)));
5342 n->value = GOVD_PRIVATE;
5348 else if ((n->value & GOVD_EXPLICIT) != 0
5349 && (ctx == gimplify_omp_ctxp
5350 || (ctx->region_type == ORT_COMBINED_PARALLEL
5351 && gimplify_omp_ctxp->outer_context == ctx)))
5353 if ((n->value & GOVD_FIRSTPRIVATE) != 0)
5354 error ("iteration variable %qs should not be firstprivate",
5355 IDENTIFIER_POINTER (DECL_NAME (decl)));
5356 else if ((n->value & GOVD_REDUCTION) != 0)
5357 error ("iteration variable %qs should not be reduction",
5358 IDENTIFIER_POINTER (DECL_NAME (decl)));
5360 return (ctx == gimplify_omp_ctxp
5361 || (ctx->region_type == ORT_COMBINED_PARALLEL
5362 && gimplify_omp_ctxp->outer_context == ctx));
5365 if (ctx->region_type != ORT_WORKSHARE)
5367 else if (ctx->outer_context)
5368 return omp_is_private (ctx->outer_context, decl);
5372 /* Return true if DECL is private within a parallel region
5373 that binds to the current construct's context or in parallel
5374 region's REDUCTION clause. */
5377 omp_check_private (struct gimplify_omp_ctx *ctx, tree decl)
5383 ctx = ctx->outer_context;
5385 return !(is_global_var (decl)
5386 /* References might be private, but might be shared too. */
5387 || lang_hooks.decls.omp_privatize_by_reference (decl));
5389 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5391 return (n->value & GOVD_SHARED) == 0;
5393 while (ctx->region_type == ORT_WORKSHARE);
5397 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
5398 and previous omp contexts. */
5401 gimplify_scan_omp_clauses (tree *list_p, gimple_seq *pre_p,
5402 enum omp_region_type region_type)
5404 struct gimplify_omp_ctx *ctx, *outer_ctx;
5405 struct gimplify_ctx gctx;
5408 ctx = new_omp_context (region_type);
5409 outer_ctx = ctx->outer_context;
5411 while ((c = *list_p) != NULL)
5413 bool remove = false;
5414 bool notice_outer = true;
5415 const char *check_non_private = NULL;
5419 switch (OMP_CLAUSE_CODE (c))
5421 case OMP_CLAUSE_PRIVATE:
5422 flags = GOVD_PRIVATE | GOVD_EXPLICIT;
5423 if (lang_hooks.decls.omp_private_outer_ref (OMP_CLAUSE_DECL (c)))
5425 flags |= GOVD_PRIVATE_OUTER_REF;
5426 OMP_CLAUSE_PRIVATE_OUTER_REF (c) = 1;
5429 notice_outer = false;
5431 case OMP_CLAUSE_SHARED:
5432 flags = GOVD_SHARED | GOVD_EXPLICIT;
5434 case OMP_CLAUSE_FIRSTPRIVATE:
5435 flags = GOVD_FIRSTPRIVATE | GOVD_EXPLICIT;
5436 check_non_private = "firstprivate";
5438 case OMP_CLAUSE_LASTPRIVATE:
5439 flags = GOVD_LASTPRIVATE | GOVD_SEEN | GOVD_EXPLICIT;
5440 check_non_private = "lastprivate";
5442 case OMP_CLAUSE_REDUCTION:
5443 flags = GOVD_REDUCTION | GOVD_SEEN | GOVD_EXPLICIT;
5444 check_non_private = "reduction";
5448 decl = OMP_CLAUSE_DECL (c);
5449 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5454 omp_add_variable (ctx, decl, flags);
5455 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION
5456 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c))
5458 omp_add_variable (ctx, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c),
5459 GOVD_LOCAL | GOVD_SEEN);
5460 gimplify_omp_ctxp = ctx;
5461 push_gimplify_context (&gctx);
5463 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c) = gimple_seq_alloc ();
5464 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c) = gimple_seq_alloc ();
5466 gimplify_and_add (OMP_CLAUSE_REDUCTION_INIT (c),
5467 &OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c));
5468 pop_gimplify_context
5469 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c)));
5470 push_gimplify_context (&gctx);
5471 gimplify_and_add (OMP_CLAUSE_REDUCTION_MERGE (c),
5472 &OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c));
5473 pop_gimplify_context
5474 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c)));
5475 OMP_CLAUSE_REDUCTION_INIT (c) = NULL_TREE;
5476 OMP_CLAUSE_REDUCTION_MERGE (c) = NULL_TREE;
5478 gimplify_omp_ctxp = outer_ctx;
5480 else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
5481 && OMP_CLAUSE_LASTPRIVATE_STMT (c))
5483 gimplify_omp_ctxp = ctx;
5484 push_gimplify_context (&gctx);
5485 if (TREE_CODE (OMP_CLAUSE_LASTPRIVATE_STMT (c)) != BIND_EXPR)
5487 tree bind = build3 (BIND_EXPR, void_type_node, NULL,
5489 TREE_SIDE_EFFECTS (bind) = 1;
5490 BIND_EXPR_BODY (bind) = OMP_CLAUSE_LASTPRIVATE_STMT (c);
5491 OMP_CLAUSE_LASTPRIVATE_STMT (c) = bind;
5493 gimplify_and_add (OMP_CLAUSE_LASTPRIVATE_STMT (c),
5494 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c));
5495 pop_gimplify_context
5496 (gimple_seq_first_stmt (OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c)));
5497 OMP_CLAUSE_LASTPRIVATE_STMT (c) = NULL_TREE;
5499 gimplify_omp_ctxp = outer_ctx;
5505 case OMP_CLAUSE_COPYIN:
5506 case OMP_CLAUSE_COPYPRIVATE:
5507 decl = OMP_CLAUSE_DECL (c);
5508 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5515 omp_notice_variable (outer_ctx, decl, true);
5516 if (check_non_private
5517 && region_type == ORT_WORKSHARE
5518 && omp_check_private (ctx, decl))
5520 error ("%s variable %qs is private in outer context",
5521 check_non_private, IDENTIFIER_POINTER (DECL_NAME (decl)));
5527 OMP_CLAUSE_OPERAND (c, 0)
5528 = gimple_boolify (OMP_CLAUSE_OPERAND (c, 0));
5531 case OMP_CLAUSE_SCHEDULE:
5532 case OMP_CLAUSE_NUM_THREADS:
5533 if (gimplify_expr (&OMP_CLAUSE_OPERAND (c, 0), pre_p, NULL,
5534 is_gimple_val, fb_rvalue) == GS_ERROR)
5538 case OMP_CLAUSE_NOWAIT:
5539 case OMP_CLAUSE_ORDERED:
5540 case OMP_CLAUSE_UNTIED:
5541 case OMP_CLAUSE_COLLAPSE:
5544 case OMP_CLAUSE_DEFAULT:
5545 ctx->default_kind = OMP_CLAUSE_DEFAULT_KIND (c);
5553 *list_p = OMP_CLAUSE_CHAIN (c);
5555 list_p = &OMP_CLAUSE_CHAIN (c);
5558 gimplify_omp_ctxp = ctx;
5561 /* For all variables that were not actually used within the context,
5562 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
5565 gimplify_adjust_omp_clauses_1 (splay_tree_node n, void *data)
5567 tree *list_p = (tree *) data;
5568 tree decl = (tree) n->key;
5569 unsigned flags = n->value;
5570 enum omp_clause_code code;
5574 if (flags & (GOVD_EXPLICIT | GOVD_LOCAL))
5576 if ((flags & GOVD_SEEN) == 0)
5578 if (flags & GOVD_DEBUG_PRIVATE)
5580 gcc_assert ((flags & GOVD_DATA_SHARE_CLASS) == GOVD_PRIVATE);
5581 private_debug = true;
5585 = lang_hooks.decls.omp_private_debug_clause (decl,
5586 !!(flags & GOVD_SHARED));
5588 code = OMP_CLAUSE_PRIVATE;
5589 else if (flags & GOVD_SHARED)
5591 if (is_global_var (decl))
5593 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp->outer_context;
5597 = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5598 if (on && (on->value & (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE
5599 | GOVD_PRIVATE | GOVD_REDUCTION)) != 0)
5601 ctx = ctx->outer_context;
5606 code = OMP_CLAUSE_SHARED;
5608 else if (flags & GOVD_PRIVATE)
5609 code = OMP_CLAUSE_PRIVATE;
5610 else if (flags & GOVD_FIRSTPRIVATE)
5611 code = OMP_CLAUSE_FIRSTPRIVATE;
5615 clause = build_omp_clause (code);
5616 OMP_CLAUSE_DECL (clause) = decl;
5617 OMP_CLAUSE_CHAIN (clause) = *list_p;
5619 OMP_CLAUSE_PRIVATE_DEBUG (clause) = 1;
5620 else if (code == OMP_CLAUSE_PRIVATE && (flags & GOVD_PRIVATE_OUTER_REF))
5621 OMP_CLAUSE_PRIVATE_OUTER_REF (clause) = 1;
5623 lang_hooks.decls.omp_finish_clause (clause);
5629 gimplify_adjust_omp_clauses (tree *list_p)
5631 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
5634 while ((c = *list_p) != NULL)
5637 bool remove = false;
5639 switch (OMP_CLAUSE_CODE (c))
5641 case OMP_CLAUSE_PRIVATE:
5642 case OMP_CLAUSE_SHARED:
5643 case OMP_CLAUSE_FIRSTPRIVATE:
5644 decl = OMP_CLAUSE_DECL (c);
5645 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5646 remove = !(n->value & GOVD_SEEN);
5649 bool shared = OMP_CLAUSE_CODE (c) == OMP_CLAUSE_SHARED;
5650 if ((n->value & GOVD_DEBUG_PRIVATE)
5651 || lang_hooks.decls.omp_private_debug_clause (decl, shared))
5653 gcc_assert ((n->value & GOVD_DEBUG_PRIVATE) == 0
5654 || ((n->value & GOVD_DATA_SHARE_CLASS)
5656 OMP_CLAUSE_SET_CODE (c, OMP_CLAUSE_PRIVATE);
5657 OMP_CLAUSE_PRIVATE_DEBUG (c) = 1;
5662 case OMP_CLAUSE_LASTPRIVATE:
5663 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
5664 accurately reflect the presence of a FIRSTPRIVATE clause. */
5665 decl = OMP_CLAUSE_DECL (c);
5666 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5667 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)
5668 = (n->value & GOVD_FIRSTPRIVATE) != 0;
5671 case OMP_CLAUSE_REDUCTION:
5672 case OMP_CLAUSE_COPYIN:
5673 case OMP_CLAUSE_COPYPRIVATE:
5675 case OMP_CLAUSE_NUM_THREADS:
5676 case OMP_CLAUSE_SCHEDULE:
5677 case OMP_CLAUSE_NOWAIT:
5678 case OMP_CLAUSE_ORDERED:
5679 case OMP_CLAUSE_DEFAULT:
5680 case OMP_CLAUSE_UNTIED:
5681 case OMP_CLAUSE_COLLAPSE:
5689 *list_p = OMP_CLAUSE_CHAIN (c);
5691 list_p = &OMP_CLAUSE_CHAIN (c);
5694 /* Add in any implicit data sharing. */
5695 splay_tree_foreach (ctx->variables, gimplify_adjust_omp_clauses_1, list_p);
5697 gimplify_omp_ctxp = ctx->outer_context;
5698 delete_omp_context (ctx);
5701 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
5702 gimplification of the body, as well as scanning the body for used
5703 variables. We need to do this scan now, because variable-sized
5704 decls will be decomposed during gimplification. */
5707 gimplify_omp_parallel (tree *expr_p, gimple_seq *pre_p)
5709 tree expr = *expr_p;
5711 gimple_seq body = NULL;
5712 struct gimplify_ctx gctx;
5714 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr), pre_p,
5715 OMP_PARALLEL_COMBINED (expr)
5716 ? ORT_COMBINED_PARALLEL
5719 push_gimplify_context (&gctx);
5721 g = gimplify_and_return_first (OMP_PARALLEL_BODY (expr), &body);
5722 if (gimple_code (g) == GIMPLE_BIND)
5723 pop_gimplify_context (g);
5725 pop_gimplify_context (NULL);
5727 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr));
5729 g = gimple_build_omp_parallel (body,
5730 OMP_PARALLEL_CLAUSES (expr),
5731 NULL_TREE, NULL_TREE);
5732 if (OMP_PARALLEL_COMBINED (expr))
5733 gimple_omp_set_subcode (g, GF_OMP_PARALLEL_COMBINED);
5734 gimplify_seq_add_stmt (pre_p, g);
5735 *expr_p = NULL_TREE;
5738 /* Gimplify the contents of an OMP_TASK statement. This involves
5739 gimplification of the body, as well as scanning the body for used
5740 variables. We need to do this scan now, because variable-sized
5741 decls will be decomposed during gimplification. */
5744 gimplify_omp_task (tree *expr_p, gimple_seq *pre_p)
5746 tree expr = *expr_p;
5748 gimple_seq body = NULL;
5749 struct gimplify_ctx gctx;
5751 gimplify_scan_omp_clauses (&OMP_TASK_CLAUSES (expr), pre_p, ORT_TASK);
5753 push_gimplify_context (&gctx);
5755 g = gimplify_and_return_first (OMP_TASK_BODY (expr), &body);
5756 if (gimple_code (g) == GIMPLE_BIND)
5757 pop_gimplify_context (g);
5759 pop_gimplify_context (NULL);
5761 gimplify_adjust_omp_clauses (&OMP_TASK_CLAUSES (expr));
5763 g = gimple_build_omp_task (body,
5764 OMP_TASK_CLAUSES (expr),
5765 NULL_TREE, NULL_TREE,
5766 NULL_TREE, NULL_TREE, NULL_TREE);
5767 gimplify_seq_add_stmt (pre_p, g);
5768 *expr_p = NULL_TREE;
5771 /* Gimplify the gross structure of an OMP_FOR statement. */
5773 static enum gimplify_status
5774 gimplify_omp_for (tree *expr_p, gimple_seq *pre_p)
5776 tree for_stmt, decl, var, t;
5777 enum gimplify_status ret = GS_OK;
5779 gimple_seq for_body, for_pre_body;
5784 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt), pre_p,
5787 /* Handle OMP_FOR_INIT. */
5788 for_pre_body = NULL;
5789 gimplify_and_add (OMP_FOR_PRE_BODY (for_stmt), &for_pre_body);
5790 OMP_FOR_PRE_BODY (for_stmt) = NULL_TREE;
5792 for_body = gimple_seq_alloc ();
5793 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt))
5794 == TREE_VEC_LENGTH (OMP_FOR_COND (for_stmt)));
5795 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt))
5796 == TREE_VEC_LENGTH (OMP_FOR_INCR (for_stmt)));
5797 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)); i++)
5799 t = TREE_VEC_ELT (OMP_FOR_INIT (for_stmt), i);
5800 gcc_assert (TREE_CODE (t) == MODIFY_EXPR);
5801 decl = TREE_OPERAND (t, 0);
5802 gcc_assert (DECL_P (decl));
5803 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl))
5804 || POINTER_TYPE_P (TREE_TYPE (decl)));
5806 /* Make sure the iteration variable is private. */
5807 if (omp_is_private (gimplify_omp_ctxp, decl))
5808 omp_notice_variable (gimplify_omp_ctxp, decl, true);
5810 omp_add_variable (gimplify_omp_ctxp, decl, GOVD_PRIVATE | GOVD_SEEN);
5812 /* If DECL is not a gimple register, create a temporary variable to act
5813 as an iteration counter. This is valid, since DECL cannot be
5814 modified in the body of the loop. */
5815 if (!is_gimple_reg (decl))
5817 var = create_tmp_var (TREE_TYPE (decl), get_name (decl));
5818 TREE_OPERAND (t, 0) = var;
5820 gimplify_seq_add_stmt (&for_body, gimple_build_assign (decl, var));
5822 omp_add_variable (gimplify_omp_ctxp, var, GOVD_PRIVATE | GOVD_SEEN);
5827 ret |= gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
5828 is_gimple_val, fb_rvalue);
5829 if (ret == GS_ERROR)
5832 /* Handle OMP_FOR_COND. */
5833 t = TREE_VEC_ELT (OMP_FOR_COND (for_stmt), i);
5834 gcc_assert (COMPARISON_CLASS_P (t));
5835 gcc_assert (TREE_OPERAND (t, 0) == decl);
5837 ret |= gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
5838 is_gimple_val, fb_rvalue);
5840 /* Handle OMP_FOR_INCR. */
5841 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
5842 switch (TREE_CODE (t))
5844 case PREINCREMENT_EXPR:
5845 case POSTINCREMENT_EXPR:
5846 t = build_int_cst (TREE_TYPE (decl), 1);
5847 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
5848 t = build2 (MODIFY_EXPR, TREE_TYPE (var), var, t);
5849 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i) = t;
5852 case PREDECREMENT_EXPR:
5853 case POSTDECREMENT_EXPR:
5854 t = build_int_cst (TREE_TYPE (decl), -1);
5855 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
5856 t = build2 (MODIFY_EXPR, TREE_TYPE (var), var, t);
5857 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i) = t;
5861 gcc_assert (TREE_OPERAND (t, 0) == decl);
5862 TREE_OPERAND (t, 0) = var;
5864 t = TREE_OPERAND (t, 1);
5865 switch (TREE_CODE (t))
5868 if (TREE_OPERAND (t, 1) == decl)
5870 TREE_OPERAND (t, 1) = TREE_OPERAND (t, 0);
5871 TREE_OPERAND (t, 0) = var;
5877 case POINTER_PLUS_EXPR:
5878 gcc_assert (TREE_OPERAND (t, 0) == decl);
5879 TREE_OPERAND (t, 0) = var;
5885 ret |= gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
5886 is_gimple_val, fb_rvalue);
5893 if (var != decl || TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)) > 1)
5896 for (c = OMP_FOR_CLAUSES (for_stmt); c ; c = OMP_CLAUSE_CHAIN (c))
5897 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
5898 && OMP_CLAUSE_DECL (c) == decl
5899 && OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c) == NULL)
5901 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
5902 gcc_assert (TREE_CODE (t) == MODIFY_EXPR);
5903 gcc_assert (TREE_OPERAND (t, 0) == var);
5904 t = TREE_OPERAND (t, 1);
5905 gcc_assert (TREE_CODE (t) == PLUS_EXPR
5906 || TREE_CODE (t) == MINUS_EXPR
5907 || TREE_CODE (t) == POINTER_PLUS_EXPR);
5908 gcc_assert (TREE_OPERAND (t, 0) == var);
5909 t = build2 (TREE_CODE (t), TREE_TYPE (decl), decl,
5910 TREE_OPERAND (t, 1));
5911 gimplify_assign (decl, t,
5912 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c));
5917 gimplify_and_add (OMP_FOR_BODY (for_stmt), &for_body);
5919 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt));
5921 gfor = gimple_build_omp_for (for_body, OMP_FOR_CLAUSES (for_stmt),
5922 TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)),
5925 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)); i++)
5927 t = TREE_VEC_ELT (OMP_FOR_INIT (for_stmt), i);
5928 gimple_omp_for_set_index (gfor, i, TREE_OPERAND (t, 0));
5929 gimple_omp_for_set_initial (gfor, i, TREE_OPERAND (t, 1));
5930 t = TREE_VEC_ELT (OMP_FOR_COND (for_stmt), i);
5931 gimple_omp_for_set_cond (gfor, i, TREE_CODE (t));
5932 gimple_omp_for_set_final (gfor, i, TREE_OPERAND (t, 1));
5933 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
5934 gimple_omp_for_set_incr (gfor, i, TREE_OPERAND (t, 1));
5937 gimplify_seq_add_stmt (pre_p, gfor);
5938 return ret == GS_ALL_DONE ? GS_ALL_DONE : GS_ERROR;
5941 /* Gimplify the gross structure of other OpenMP worksharing constructs.
5942 In particular, OMP_SECTIONS and OMP_SINGLE. */
5945 gimplify_omp_workshare (tree *expr_p, gimple_seq *pre_p)
5947 tree expr = *expr_p;
5949 gimple_seq body = NULL;
5951 gimplify_scan_omp_clauses (&OMP_CLAUSES (expr), pre_p, ORT_WORKSHARE);
5952 gimplify_and_add (OMP_BODY (expr), &body);
5953 gimplify_adjust_omp_clauses (&OMP_CLAUSES (expr));
5955 if (TREE_CODE (expr) == OMP_SECTIONS)
5956 stmt = gimple_build_omp_sections (body, OMP_CLAUSES (expr));
5957 else if (TREE_CODE (expr) == OMP_SINGLE)
5958 stmt = gimple_build_omp_single (body, OMP_CLAUSES (expr));
5962 gimplify_seq_add_stmt (pre_p, stmt);
5965 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
5966 stabilized the lhs of the atomic operation as *ADDR. Return true if
5967 EXPR is this stabilized form. */
5970 goa_lhs_expr_p (tree expr, tree addr)
5972 /* Also include casts to other type variants. The C front end is fond
5973 of adding these for e.g. volatile variables. This is like
5974 STRIP_TYPE_NOPS but includes the main variant lookup. */
5975 while ((CONVERT_EXPR_P (expr)
5976 || TREE_CODE (expr) == NON_LVALUE_EXPR)
5977 && TREE_OPERAND (expr, 0) != error_mark_node
5978 && (TYPE_MAIN_VARIANT (TREE_TYPE (expr))
5979 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (expr, 0)))))
5980 expr = TREE_OPERAND (expr, 0);
5982 if (TREE_CODE (expr) == INDIRECT_REF)
5984 expr = TREE_OPERAND (expr, 0);
5986 && (CONVERT_EXPR_P (expr)
5987 || TREE_CODE (expr) == NON_LVALUE_EXPR)
5988 && TREE_CODE (expr) == TREE_CODE (addr)
5989 && TYPE_MAIN_VARIANT (TREE_TYPE (expr))
5990 == TYPE_MAIN_VARIANT (TREE_TYPE (addr)))
5992 expr = TREE_OPERAND (expr, 0);
5993 addr = TREE_OPERAND (addr, 0);
5997 return (TREE_CODE (addr) == ADDR_EXPR
5998 && TREE_CODE (expr) == ADDR_EXPR
5999 && TREE_OPERAND (addr, 0) == TREE_OPERAND (expr, 0));
6001 if (TREE_CODE (addr) == ADDR_EXPR && expr == TREE_OPERAND (addr, 0))
6006 /* Walk *EXPR_P and replace
6007 appearances of *LHS_ADDR with LHS_VAR. If an expression does not involve
6008 the lhs, evaluate it into a temporary. Return 1 if the lhs appeared as
6009 a subexpression, 0 if it did not, or -1 if an error was encountered. */
6012 goa_stabilize_expr (tree *expr_p, gimple_seq *pre_p, tree lhs_addr,
6015 tree expr = *expr_p;
6018 if (goa_lhs_expr_p (expr, lhs_addr))
6023 if (is_gimple_val (expr))
6027 switch (TREE_CODE_CLASS (TREE_CODE (expr)))
6030 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p, lhs_addr,
6033 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p, lhs_addr,
6042 enum gimplify_status gs;
6043 gs = gimplify_expr (expr_p, pre_p, NULL, is_gimple_val, fb_rvalue);
6044 if (gs != GS_ALL_DONE)
6052 /* Gimplify an OMP_ATOMIC statement. */
6054 static enum gimplify_status
6055 gimplify_omp_atomic (tree *expr_p, gimple_seq *pre_p)
6057 tree addr = TREE_OPERAND (*expr_p, 0);
6058 tree rhs = TREE_OPERAND (*expr_p, 1);
6059 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr)));
6062 tmp_load = create_tmp_var (type, NULL);
6063 if (goa_stabilize_expr (&rhs, pre_p, addr, tmp_load) < 0)
6066 if (gimplify_expr (&addr, pre_p, NULL, is_gimple_val, fb_rvalue)
6070 gimplify_seq_add_stmt (pre_p, gimple_build_omp_atomic_load (tmp_load, addr));
6071 if (gimplify_expr (&rhs, pre_p, NULL, is_gimple_val, fb_rvalue)
6074 gimplify_seq_add_stmt (pre_p, gimple_build_omp_atomic_store (rhs));
6081 /* Converts the GENERIC expression tree *EXPR_P to GIMPLE. If the
6082 expression produces a value to be used as an operand inside a GIMPLE
6083 statement, the value will be stored back in *EXPR_P. This value will
6084 be a tree of class tcc_declaration, tcc_constant, tcc_reference or
6085 an SSA_NAME. The corresponding sequence of GIMPLE statements is
6086 emitted in PRE_P and POST_P.
6088 Additionally, this process may overwrite parts of the input
6089 expression during gimplification. Ideally, it should be
6090 possible to do non-destructive gimplification.
6092 EXPR_P points to the GENERIC expression to convert to GIMPLE. If
6093 the expression needs to evaluate to a value to be used as
6094 an operand in a GIMPLE statement, this value will be stored in
6095 *EXPR_P on exit. This happens when the caller specifies one
6096 of fb_lvalue or fb_rvalue fallback flags.
6098 PRE_P will contain the sequence of GIMPLE statements corresponding
6099 to the evaluation of EXPR and all the side-effects that must
6100 be executed before the main expression. On exit, the last
6101 statement of PRE_P is the core statement being gimplified. For
6102 instance, when gimplifying 'if (++a)' the last statement in
6103 PRE_P will be 'if (t.1)' where t.1 is the result of
6104 pre-incrementing 'a'.
6106 POST_P will contain the sequence of GIMPLE statements corresponding
6107 to the evaluation of all the side-effects that must be executed
6108 after the main expression. If this is NULL, the post
6109 side-effects are stored at the end of PRE_P.
6111 The reason why the output is split in two is to handle post
6112 side-effects explicitly. In some cases, an expression may have
6113 inner and outer post side-effects which need to be emitted in
6114 an order different from the one given by the recursive
6115 traversal. For instance, for the expression (*p--)++ the post
6116 side-effects of '--' must actually occur *after* the post
6117 side-effects of '++'. However, gimplification will first visit
6118 the inner expression, so if a separate POST sequence was not
6119 used, the resulting sequence would be:
6126 However, the post-decrement operation in line #2 must not be
6127 evaluated until after the store to *p at line #4, so the
6128 correct sequence should be:
6135 So, by specifying a separate post queue, it is possible
6136 to emit the post side-effects in the correct order.
6137 If POST_P is NULL, an internal queue will be used. Before
6138 returning to the caller, the sequence POST_P is appended to
6139 the main output sequence PRE_P.
6141 GIMPLE_TEST_F points to a function that takes a tree T and
6142 returns nonzero if T is in the GIMPLE form requested by the
6143 caller. The GIMPLE predicates are in tree-gimple.c.
6145 FALLBACK tells the function what sort of a temporary we want if
6146 gimplification cannot produce an expression that complies with
6149 fb_none means that no temporary should be generated
6150 fb_rvalue means that an rvalue is OK to generate
6151 fb_lvalue means that an lvalue is OK to generate
6152 fb_either means that either is OK, but an lvalue is preferable.
6153 fb_mayfail means that gimplification may fail (in which case
6154 GS_ERROR will be returned)
6156 The return value is either GS_ERROR or GS_ALL_DONE, since this
6157 function iterates until EXPR is completely gimplified or an error
6160 enum gimplify_status
6161 gimplify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
6162 bool (*gimple_test_f) (tree), fallback_t fallback)
6165 gimple_seq internal_pre = NULL;
6166 gimple_seq internal_post = NULL;
6169 location_t saved_location;
6170 enum gimplify_status ret;
6171 gimple_stmt_iterator pre_last_gsi, post_last_gsi;
6173 save_expr = *expr_p;
6174 if (save_expr == NULL_TREE)
6177 /* If we are gimplifying a top-level statement, PRE_P must be valid. */
6178 is_statement = gimple_test_f == is_gimple_stmt;
6182 /* Consistency checks. */
6183 if (gimple_test_f == is_gimple_reg)
6184 gcc_assert (fallback & (fb_rvalue | fb_lvalue));
6185 else if (gimple_test_f == is_gimple_val
6186 || gimple_test_f == is_gimple_formal_tmp_rhs
6187 || gimple_test_f == is_gimple_formal_tmp_or_call_rhs
6188 || gimple_test_f == is_gimple_formal_tmp_reg
6189 || gimple_test_f == is_gimple_formal_tmp_var
6190 || gimple_test_f == is_gimple_call_addr
6191 || gimple_test_f == is_gimple_condexpr
6192 || gimple_test_f == is_gimple_mem_rhs
6193 || gimple_test_f == is_gimple_mem_or_call_rhs
6194 || gimple_test_f == is_gimple_reg_rhs
6195 || gimple_test_f == is_gimple_reg_or_call_rhs
6196 || gimple_test_f == is_gimple_asm_val)
6197 gcc_assert (fallback & fb_rvalue);
6198 else if (gimple_test_f == is_gimple_min_lval
6199 || gimple_test_f == is_gimple_lvalue)
6200 gcc_assert (fallback & fb_lvalue);
6201 else if (gimple_test_f == is_gimple_addressable)
6202 gcc_assert (fallback & fb_either);
6203 else if (gimple_test_f == is_gimple_stmt)
6204 gcc_assert (fallback == fb_none);
6207 /* We should have recognized the GIMPLE_TEST_F predicate to
6208 know what kind of fallback to use in case a temporary is
6209 needed to hold the value or address of *EXPR_P. */
6213 /* We used to check the predicate here and return immediately if it
6214 succeeds. This is wrong; the design is for gimplification to be
6215 idempotent, and for the predicates to only test for valid forms, not
6216 whether they are fully simplified. */
6218 pre_p = &internal_pre;
6221 post_p = &internal_post;
6223 /* Remember the last statements added to PRE_P and POST_P. Every
6224 new statement added by the gimplification helpers needs to be
6225 annotated with location information. To centralize the
6226 responsibility, we remember the last statement that had been
6227 added to both queues before gimplifying *EXPR_P. If
6228 gimplification produces new statements in PRE_P and POST_P, those
6229 statements will be annotated with the same location information
6231 pre_last_gsi = gsi_last (*pre_p);
6232 post_last_gsi = gsi_last (*post_p);
6234 saved_location = input_location;
6235 if (save_expr != error_mark_node
6236 && EXPR_HAS_LOCATION (*expr_p))
6237 input_location = EXPR_LOCATION (*expr_p);
6239 /* Loop over the specific gimplifiers until the toplevel node
6240 remains the same. */
6243 /* Strip away as many useless type conversions as possible
6245 STRIP_USELESS_TYPE_CONVERSION (*expr_p);
6247 /* Remember the expr. */
6248 save_expr = *expr_p;
6250 /* Die, die, die, my darling. */
6251 if (save_expr == error_mark_node
6252 || (TREE_TYPE (save_expr)
6253 && TREE_TYPE (save_expr) == error_mark_node))
6259 /* Do any language-specific gimplification. */
6260 ret = lang_hooks.gimplify_expr (expr_p, pre_p, post_p);
6263 if (*expr_p == NULL_TREE)
6265 if (*expr_p != save_expr)
6268 else if (ret != GS_UNHANDLED)
6272 switch (TREE_CODE (*expr_p))
6274 /* First deal with the special cases. */
6276 case POSTINCREMENT_EXPR:
6277 case POSTDECREMENT_EXPR:
6278 case PREINCREMENT_EXPR:
6279 case PREDECREMENT_EXPR:
6280 ret = gimplify_self_mod_expr (expr_p, pre_p, post_p,
6281 fallback != fb_none);
6285 case ARRAY_RANGE_REF:
6289 case VIEW_CONVERT_EXPR:
6290 ret = gimplify_compound_lval (expr_p, pre_p, post_p,
6291 fallback ? fallback : fb_rvalue);
6295 ret = gimplify_cond_expr (expr_p, pre_p, fallback);
6297 /* C99 code may assign to an array in a structure value of a
6298 conditional expression, and this has undefined behavior
6299 only on execution, so create a temporary if an lvalue is
6301 if (fallback == fb_lvalue)
6303 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6304 mark_addressable (*expr_p);
6309 ret = gimplify_call_expr (expr_p, pre_p, fallback != fb_none);
6311 /* C99 code may assign to an array in a structure returned
6312 from a function, and this has undefined behavior only on
6313 execution, so create a temporary if an lvalue is
6315 if (fallback == fb_lvalue)
6317 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6318 mark_addressable (*expr_p);
6326 ret = gimplify_compound_expr (expr_p, pre_p, fallback != fb_none);
6331 ret = gimplify_modify_expr (expr_p, pre_p, post_p,
6332 fallback != fb_none);
6335 case TRUTH_ANDIF_EXPR:
6336 case TRUTH_ORIF_EXPR:
6337 ret = gimplify_boolean_expr (expr_p);
6340 case TRUTH_NOT_EXPR:
6341 if (TREE_CODE (TREE_TYPE (*expr_p)) != BOOLEAN_TYPE)
6343 tree type = TREE_TYPE (*expr_p);
6344 *expr_p = fold_convert (type, gimple_boolify (*expr_p));
6349 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6350 is_gimple_val, fb_rvalue);
6351 recalculate_side_effects (*expr_p);
6355 ret = gimplify_addr_expr (expr_p, pre_p, post_p);
6359 ret = gimplify_va_arg_expr (expr_p, pre_p, post_p);
6363 if (IS_EMPTY_STMT (*expr_p))
6369 if (VOID_TYPE_P (TREE_TYPE (*expr_p))
6370 || fallback == fb_none)
6372 /* Just strip a conversion to void (or in void context) and
6374 *expr_p = TREE_OPERAND (*expr_p, 0);
6378 ret = gimplify_conversion (expr_p);
6379 if (ret == GS_ERROR)
6381 if (*expr_p != save_expr)
6385 case FIX_TRUNC_EXPR:
6386 /* unary_expr: ... | '(' cast ')' val | ... */
6387 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6388 is_gimple_val, fb_rvalue);
6389 recalculate_side_effects (*expr_p);
6393 *expr_p = fold_indirect_ref (*expr_p);
6394 if (*expr_p != save_expr)
6396 /* else fall through. */
6397 case ALIGN_INDIRECT_REF:
6398 case MISALIGNED_INDIRECT_REF:
6399 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6400 is_gimple_reg, fb_rvalue);
6401 recalculate_side_effects (*expr_p);
6404 /* Constants need not be gimplified. */
6415 /* If we require an lvalue, such as for ADDR_EXPR, retain the
6416 CONST_DECL node. Otherwise the decl is replaceable by its
6418 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
6419 if (fallback & fb_lvalue)
6422 *expr_p = DECL_INITIAL (*expr_p);
6426 ret = gimplify_decl_expr (expr_p, pre_p);
6430 /* FIXME make this a decl. */
6435 ret = gimplify_bind_expr (expr_p, pre_p);
6439 ret = gimplify_loop_expr (expr_p, pre_p);
6443 ret = gimplify_switch_expr (expr_p, pre_p);
6447 ret = gimplify_exit_expr (expr_p);
6451 /* If the target is not LABEL, then it is a computed jump
6452 and the target needs to be gimplified. */
6453 if (TREE_CODE (GOTO_DESTINATION (*expr_p)) != LABEL_DECL)
6455 ret = gimplify_expr (&GOTO_DESTINATION (*expr_p), pre_p,
6456 NULL, is_gimple_val, fb_rvalue);
6457 if (ret == GS_ERROR)
6460 gimplify_seq_add_stmt (pre_p,
6461 gimple_build_goto (GOTO_DESTINATION (*expr_p)));
6465 gimplify_seq_add_stmt (pre_p,
6466 gimple_build_predict (PREDICT_EXPR_PREDICTOR (*expr_p),
6467 PREDICT_EXPR_OUTCOME (*expr_p)));
6473 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p))
6474 == current_function_decl);
6475 gimplify_seq_add_stmt (pre_p,
6476 gimple_build_label (LABEL_EXPR_LABEL (*expr_p)));
6479 case CASE_LABEL_EXPR:
6480 ret = gimplify_case_label_expr (expr_p, pre_p);
6484 ret = gimplify_return_expr (*expr_p, pre_p);
6488 /* Don't reduce this in place; let gimplify_init_constructor work its
6489 magic. Buf if we're just elaborating this for side effects, just
6490 gimplify any element that has side-effects. */
6491 if (fallback == fb_none)
6493 unsigned HOST_WIDE_INT ix;
6494 constructor_elt *ce;
6495 tree temp = NULL_TREE;
6497 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (*expr_p),
6500 if (TREE_SIDE_EFFECTS (ce->value))
6501 append_to_statement_list (ce->value, &temp);
6506 /* C99 code may assign to an array in a constructed
6507 structure or union, and this has undefined behavior only
6508 on execution, so create a temporary if an lvalue is
6510 else if (fallback == fb_lvalue)
6512 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6513 mark_addressable (*expr_p);
6519 /* The following are special cases that are not handled by the
6520 original GIMPLE grammar. */
6522 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
6525 ret = gimplify_save_expr (expr_p, pre_p, post_p);
6530 enum gimplify_status r0, r1, r2;
6532 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6533 post_p, is_gimple_lvalue, fb_either);
6534 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
6535 post_p, is_gimple_val, fb_rvalue);
6536 r2 = gimplify_expr (&TREE_OPERAND (*expr_p, 2), pre_p,
6537 post_p, is_gimple_val, fb_rvalue);
6538 recalculate_side_effects (*expr_p);
6540 ret = MIN (r0, MIN (r1, r2));
6544 case NON_LVALUE_EXPR:
6545 /* This should have been stripped above. */
6549 ret = gimplify_asm_expr (expr_p, pre_p, post_p);
6552 case TRY_FINALLY_EXPR:
6553 case TRY_CATCH_EXPR:
6555 gimple_seq eval, cleanup;
6558 eval = cleanup = NULL;
6559 gimplify_and_add (TREE_OPERAND (*expr_p, 0), &eval);
6560 gimplify_and_add (TREE_OPERAND (*expr_p, 1), &cleanup);
6561 /* Don't create bogus GIMPLE_TRY with empty cleanup. */
6562 if (gimple_seq_empty_p (cleanup))
6564 gimple_seq_add_seq (pre_p, eval);
6568 try_ = gimple_build_try (eval, cleanup,
6569 TREE_CODE (*expr_p) == TRY_FINALLY_EXPR
6570 ? GIMPLE_TRY_FINALLY
6571 : GIMPLE_TRY_CATCH);
6572 if (TREE_CODE (*expr_p) == TRY_CATCH_EXPR)
6573 gimple_try_set_catch_is_cleanup (try_,
6574 TRY_CATCH_IS_CLEANUP (*expr_p));
6575 gimplify_seq_add_stmt (pre_p, try_);
6580 case CLEANUP_POINT_EXPR:
6581 ret = gimplify_cleanup_point_expr (expr_p, pre_p);
6585 ret = gimplify_target_expr (expr_p, pre_p, post_p);
6591 gimple_seq handler = NULL;
6592 gimplify_and_add (CATCH_BODY (*expr_p), &handler);
6593 c = gimple_build_catch (CATCH_TYPES (*expr_p), handler);
6594 gimplify_seq_add_stmt (pre_p, c);
6599 case EH_FILTER_EXPR:
6602 gimple_seq failure = NULL;
6604 gimplify_and_add (EH_FILTER_FAILURE (*expr_p), &failure);
6605 ehf = gimple_build_eh_filter (EH_FILTER_TYPES (*expr_p), failure);
6606 gimple_eh_filter_set_must_not_throw
6607 (ehf, EH_FILTER_MUST_NOT_THROW (*expr_p));
6608 gimplify_seq_add_stmt (pre_p, ehf);
6613 case CHANGE_DYNAMIC_TYPE_EXPR:
6617 ret = gimplify_expr (&CHANGE_DYNAMIC_TYPE_LOCATION (*expr_p),
6618 pre_p, post_p, is_gimple_reg, fb_lvalue);
6619 cdt = gimple_build_cdt (CHANGE_DYNAMIC_TYPE_NEW_TYPE (*expr_p),
6620 CHANGE_DYNAMIC_TYPE_LOCATION (*expr_p));
6621 gimplify_seq_add_stmt (pre_p, cdt);
6628 enum gimplify_status r0, r1;
6629 r0 = gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p), pre_p,
6630 post_p, is_gimple_val, fb_rvalue);
6631 r1 = gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p), pre_p,
6632 post_p, is_gimple_val, fb_rvalue);
6633 TREE_SIDE_EFFECTS (*expr_p) = 0;
6639 /* We get here when taking the address of a label. We mark
6640 the label as "forced"; meaning it can never be removed and
6641 it is a potential target for any computed goto. */
6642 FORCED_LABEL (*expr_p) = 1;
6646 case STATEMENT_LIST:
6647 ret = gimplify_statement_list (expr_p, pre_p);
6650 case WITH_SIZE_EXPR:
6652 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6653 post_p == &internal_post ? NULL : post_p,
6654 gimple_test_f, fallback);
6655 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
6656 is_gimple_val, fb_rvalue);
6662 ret = gimplify_var_or_parm_decl (expr_p);
6666 /* When within an OpenMP context, notice uses of variables. */
6667 if (gimplify_omp_ctxp)
6668 omp_notice_variable (gimplify_omp_ctxp, *expr_p, true);
6673 /* Allow callbacks into the gimplifier during optimization. */
6678 gimplify_omp_parallel (expr_p, pre_p);
6683 gimplify_omp_task (expr_p, pre_p);
6688 ret = gimplify_omp_for (expr_p, pre_p);
6693 gimplify_omp_workshare (expr_p, pre_p);
6702 gimple_seq body = NULL;
6705 gimplify_and_add (OMP_BODY (*expr_p), &body);
6706 switch (TREE_CODE (*expr_p))
6709 g = gimple_build_omp_section (body);
6712 g = gimple_build_omp_master (body);
6715 g = gimple_build_omp_ordered (body);
6718 g = gimple_build_omp_critical (body,
6719 OMP_CRITICAL_NAME (*expr_p));
6724 gimplify_seq_add_stmt (pre_p, g);
6730 ret = gimplify_omp_atomic (expr_p, pre_p);
6733 case POINTER_PLUS_EXPR:
6734 /* Convert ((type *)A)+offset into &A->field_of_type_and_offset.
6735 The second is gimple immediate saving a need for extra statement.
6737 if (TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
6738 && (tmp = maybe_fold_offset_to_address
6739 (TREE_OPERAND (*expr_p, 0), TREE_OPERAND (*expr_p, 1),
6740 TREE_TYPE (*expr_p))))
6745 /* Convert (void *)&a + 4 into (void *)&a[1]. */
6746 if (TREE_CODE (TREE_OPERAND (*expr_p, 0)) == NOP_EXPR
6747 && TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
6748 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p,
6750 && (tmp = maybe_fold_offset_to_address
6751 (TREE_OPERAND (TREE_OPERAND (*expr_p, 0), 0),
6752 TREE_OPERAND (*expr_p, 1),
6753 TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p, 0),
6756 *expr_p = fold_convert (TREE_TYPE (*expr_p), tmp);
6762 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p)))
6764 case tcc_comparison:
6765 /* Handle comparison of objects of non scalar mode aggregates
6766 with a call to memcmp. It would be nice to only have to do
6767 this for variable-sized objects, but then we'd have to allow
6768 the same nest of reference nodes we allow for MODIFY_EXPR and
6771 Compare scalar mode aggregates as scalar mode values. Using
6772 memcmp for them would be very inefficient at best, and is
6773 plain wrong if bitfields are involved. */
6775 tree type = TREE_TYPE (TREE_OPERAND (*expr_p, 1));
6777 if (!AGGREGATE_TYPE_P (type))
6779 else if (TYPE_MODE (type) != BLKmode)
6780 ret = gimplify_scalar_mode_aggregate_compare (expr_p);
6782 ret = gimplify_variable_sized_compare (expr_p);
6787 /* If *EXPR_P does not need to be special-cased, handle it
6788 according to its class. */
6790 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6791 post_p, is_gimple_val, fb_rvalue);
6797 enum gimplify_status r0, r1;
6799 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6800 post_p, is_gimple_val, fb_rvalue);
6801 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
6802 post_p, is_gimple_val, fb_rvalue);
6808 case tcc_declaration:
6811 goto dont_recalculate;
6814 gcc_assert (TREE_CODE (*expr_p) == TRUTH_AND_EXPR
6815 || TREE_CODE (*expr_p) == TRUTH_OR_EXPR
6816 || TREE_CODE (*expr_p) == TRUTH_XOR_EXPR);
6820 recalculate_side_effects (*expr_p);
6826 /* If we replaced *expr_p, gimplify again. */
6827 if (ret == GS_OK && (*expr_p == NULL || *expr_p == save_expr))
6830 while (ret == GS_OK);
6832 /* If we encountered an error_mark somewhere nested inside, either
6833 stub out the statement or propagate the error back out. */
6834 if (ret == GS_ERROR)
6841 /* This was only valid as a return value from the langhook, which
6842 we handled. Make sure it doesn't escape from any other context. */
6843 gcc_assert (ret != GS_UNHANDLED);
6845 if (fallback == fb_none && *expr_p && !is_gimple_stmt (*expr_p))
6847 /* We aren't looking for a value, and we don't have a valid
6848 statement. If it doesn't have side-effects, throw it away. */
6849 if (!TREE_SIDE_EFFECTS (*expr_p))
6851 else if (!TREE_THIS_VOLATILE (*expr_p))
6853 /* This is probably a _REF that contains something nested that
6854 has side effects. Recurse through the operands to find it. */
6855 enum tree_code code = TREE_CODE (*expr_p);
6862 case VIEW_CONVERT_EXPR:
6863 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6864 gimple_test_f, fallback);
6868 case ARRAY_RANGE_REF:
6869 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6870 gimple_test_f, fallback);
6871 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
6872 gimple_test_f, fallback);
6876 /* Anything else with side-effects must be converted to
6877 a valid statement before we get here. */
6883 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p))
6884 && TYPE_MODE (TREE_TYPE (*expr_p)) != BLKmode)
6886 /* Historically, the compiler has treated a bare reference
6887 to a non-BLKmode volatile lvalue as forcing a load. */
6888 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p));
6890 /* Normally, we do not want to create a temporary for a
6891 TREE_ADDRESSABLE type because such a type should not be
6892 copied by bitwise-assignment. However, we make an
6893 exception here, as all we are doing here is ensuring that
6894 we read the bytes that make up the type. We use
6895 create_tmp_var_raw because create_tmp_var will abort when
6896 given a TREE_ADDRESSABLE type. */
6897 tree tmp = create_tmp_var_raw (type, "vol");
6898 gimple_add_tmp_var (tmp);
6899 gimplify_assign (tmp, *expr_p, pre_p);
6903 /* We can't do anything useful with a volatile reference to
6904 an incomplete type, so just throw it away. Likewise for
6905 a BLKmode type, since any implicit inner load should
6906 already have been turned into an explicit one by the
6907 gimplification process. */
6911 /* If we are gimplifying at the statement level, we're done. Tack
6912 everything together and return. */
6913 if (fallback == fb_none || is_statement)
6915 /* Since *EXPR_P has been converted into a GIMPLE tuple, clear
6916 it out for GC to reclaim it. */
6917 *expr_p = NULL_TREE;
6919 if (!gimple_seq_empty_p (internal_pre)
6920 || !gimple_seq_empty_p (internal_post))
6922 gimplify_seq_add_seq (&internal_pre, internal_post);
6923 gimplify_seq_add_seq (pre_p, internal_pre);
6926 /* The result of gimplifying *EXPR_P is going to be the last few
6927 statements in *PRE_P and *POST_P. Add location information
6928 to all the statements that were added by the gimplification
6930 if (!gimple_seq_empty_p (*pre_p))
6931 annotate_all_with_location_after (*pre_p, pre_last_gsi, input_location);
6933 if (!gimple_seq_empty_p (*post_p))
6934 annotate_all_with_location_after (*post_p, post_last_gsi,
6940 #ifdef ENABLE_GIMPLE_CHECKING
6943 enum tree_code code = TREE_CODE (*expr_p);
6944 /* These expressions should already be in gimple IR form. */
6945 gcc_assert (code != MODIFY_EXPR
6947 && code != BIND_EXPR
6948 && code != CATCH_EXPR
6949 && (code != COND_EXPR || gimplify_ctxp->allow_rhs_cond_expr)
6950 && code != EH_FILTER_EXPR
6951 && code != GOTO_EXPR
6952 && code != LABEL_EXPR
6953 && code != LOOP_EXPR
6954 && code != RESX_EXPR
6955 && code != SWITCH_EXPR
6956 && code != TRY_FINALLY_EXPR
6957 && code != OMP_CRITICAL
6959 && code != OMP_MASTER
6960 && code != OMP_ORDERED
6961 && code != OMP_PARALLEL
6962 && code != OMP_SECTIONS
6963 && code != OMP_SECTION
6964 && code != OMP_SINGLE);
6968 /* Otherwise we're gimplifying a subexpression, so the resulting
6969 value is interesting. If it's a valid operand that matches
6970 GIMPLE_TEST_F, we're done. Unless we are handling some
6971 post-effects internally; if that's the case, we need to copy into
6972 a temporary before adding the post-effects to POST_P. */
6973 if (gimple_seq_empty_p (internal_post) && (*gimple_test_f) (*expr_p))
6976 /* Otherwise, we need to create a new temporary for the gimplified
6979 /* We can't return an lvalue if we have an internal postqueue. The
6980 object the lvalue refers to would (probably) be modified by the
6981 postqueue; we need to copy the value out first, which means an
6983 if ((fallback & fb_lvalue)
6984 && gimple_seq_empty_p (internal_post)
6985 && is_gimple_addressable (*expr_p))
6987 /* An lvalue will do. Take the address of the expression, store it
6988 in a temporary, and replace the expression with an INDIRECT_REF of
6990 tmp = build_fold_addr_expr (*expr_p);
6991 gimplify_expr (&tmp, pre_p, post_p, is_gimple_reg, fb_rvalue);
6992 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (tmp)), tmp);
6994 else if ((fallback & fb_rvalue) && is_gimple_formal_tmp_or_call_rhs (*expr_p))
6996 /* An rvalue will do. Assign the gimplified expression into a
6997 new temporary TMP and replace the original expression with
6998 TMP. First, make sure that the expression has a type so that
6999 it can be assigned into a temporary. */
7000 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p)));
7002 if (!gimple_seq_empty_p (internal_post) || (fallback & fb_lvalue))
7003 /* The postqueue might change the value of the expression between
7004 the initialization and use of the temporary, so we can't use a
7005 formal temp. FIXME do we care? */
7006 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
7008 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
7010 if (TREE_CODE (*expr_p) != SSA_NAME)
7011 DECL_GIMPLE_FORMAL_TEMP_P (*expr_p) = 1;
7015 #ifdef ENABLE_GIMPLE_CHECKING
7016 if (!(fallback & fb_mayfail))
7018 fprintf (stderr, "gimplification failed:\n");
7019 print_generic_expr (stderr, *expr_p, 0);
7020 debug_tree (*expr_p);
7021 internal_error ("gimplification failed");
7024 gcc_assert (fallback & fb_mayfail);
7026 /* If this is an asm statement, and the user asked for the
7027 impossible, don't die. Fail and let gimplify_asm_expr
7033 /* Make sure the temporary matches our predicate. */
7034 gcc_assert ((*gimple_test_f) (*expr_p));
7036 if (!gimple_seq_empty_p (internal_post))
7038 annotate_all_with_location (internal_post, input_location);
7039 gimplify_seq_add_seq (pre_p, internal_post);
7043 input_location = saved_location;
7047 /* Look through TYPE for variable-sized objects and gimplify each such
7048 size that we find. Add to LIST_P any statements generated. */
7051 gimplify_type_sizes (tree type, gimple_seq *list_p)
7055 if (type == NULL || type == error_mark_node)
7058 /* We first do the main variant, then copy into any other variants. */
7059 type = TYPE_MAIN_VARIANT (type);
7061 /* Avoid infinite recursion. */
7062 if (TYPE_SIZES_GIMPLIFIED (type))
7065 TYPE_SIZES_GIMPLIFIED (type) = 1;
7067 switch (TREE_CODE (type))
7073 case FIXED_POINT_TYPE:
7074 gimplify_one_sizepos (&TYPE_MIN_VALUE (type), list_p);
7075 gimplify_one_sizepos (&TYPE_MAX_VALUE (type), list_p);
7077 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
7079 TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (type);
7080 TYPE_MAX_VALUE (t) = TYPE_MAX_VALUE (type);
7085 /* These types may not have declarations, so handle them here. */
7086 gimplify_type_sizes (TREE_TYPE (type), list_p);
7087 gimplify_type_sizes (TYPE_DOMAIN (type), list_p);
7088 /* When not optimizing, ensure VLA bounds aren't removed. */
7090 && TYPE_DOMAIN (type)
7091 && INTEGRAL_TYPE_P (TYPE_DOMAIN (type)))
7093 t = TYPE_MIN_VALUE (TYPE_DOMAIN (type));
7094 if (t && TREE_CODE (t) == VAR_DECL && DECL_ARTIFICIAL (t))
7095 DECL_IGNORED_P (t) = 0;
7096 t = TYPE_MAX_VALUE (TYPE_DOMAIN (type));
7097 if (t && TREE_CODE (t) == VAR_DECL && DECL_ARTIFICIAL (t))
7098 DECL_IGNORED_P (t) = 0;
7104 case QUAL_UNION_TYPE:
7105 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
7106 if (TREE_CODE (field) == FIELD_DECL)
7108 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field), list_p);
7109 gimplify_type_sizes (TREE_TYPE (field), list_p);
7114 case REFERENCE_TYPE:
7115 /* We used to recurse on the pointed-to type here, which turned out to
7116 be incorrect because its definition might refer to variables not
7117 yet initialized at this point if a forward declaration is involved.
7119 It was actually useful for anonymous pointed-to types to ensure
7120 that the sizes evaluation dominates every possible later use of the
7121 values. Restricting to such types here would be safe since there
7122 is no possible forward declaration around, but would introduce an
7123 undesirable middle-end semantic to anonymity. We then defer to
7124 front-ends the responsibility of ensuring that the sizes are
7125 evaluated both early and late enough, e.g. by attaching artificial
7126 type declarations to the tree. */
7133 gimplify_one_sizepos (&TYPE_SIZE (type), list_p);
7134 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type), list_p);
7136 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
7138 TYPE_SIZE (t) = TYPE_SIZE (type);
7139 TYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (type);
7140 TYPE_SIZES_GIMPLIFIED (t) = 1;
7144 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
7145 a size or position, has had all of its SAVE_EXPRs evaluated.
7146 We add any required statements to *STMT_P. */
7149 gimplify_one_sizepos (tree *expr_p, gimple_seq *stmt_p)
7151 tree type, expr = *expr_p;
7153 /* We don't do anything if the value isn't there, is constant, or contains
7154 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
7155 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
7156 will want to replace it with a new variable, but that will cause problems
7157 if this type is from outside the function. It's OK to have that here. */
7158 if (expr == NULL_TREE || TREE_CONSTANT (expr)
7159 || TREE_CODE (expr) == VAR_DECL
7160 || CONTAINS_PLACEHOLDER_P (expr))
7163 type = TREE_TYPE (expr);
7164 *expr_p = unshare_expr (expr);
7166 gimplify_expr (expr_p, stmt_p, NULL, is_gimple_val, fb_rvalue);
7169 /* Verify that we've an exact type match with the original expression.
7170 In particular, we do not wish to drop a "sizetype" in favour of a
7171 type of similar dimensions. We don't want to pollute the generic
7172 type-stripping code with this knowledge because it doesn't matter
7173 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
7174 and friends retain their "sizetype-ness". */
7175 if (TREE_TYPE (expr) != type
7176 && TREE_CODE (type) == INTEGER_TYPE
7177 && TYPE_IS_SIZETYPE (type))
7182 *expr_p = create_tmp_var (type, NULL);
7183 tmp = build1 (NOP_EXPR, type, expr);
7184 stmt = gimplify_assign (*expr_p, tmp, stmt_p);
7185 if (EXPR_HAS_LOCATION (expr))
7186 gimple_set_location (stmt, *EXPR_LOCUS (expr));
7188 gimple_set_location (stmt, input_location);
7193 /* Gimplify the body of statements pointed to by BODY_P and return a
7194 GIMPLE_BIND containing the sequence of GIMPLE statements
7195 corresponding to BODY_P. FNDECL is the function decl containing
7199 gimplify_body (tree *body_p, tree fndecl, bool do_parms)
7201 location_t saved_location = input_location;
7202 gimple_seq parm_stmts, seq;
7204 struct gimplify_ctx gctx;
7206 timevar_push (TV_TREE_GIMPLIFY);
7208 /* Initialize for optimize_insn_for_s{ize,peed}_p possibly called during
7210 default_rtl_profile ();
7212 gcc_assert (gimplify_ctxp == NULL);
7213 push_gimplify_context (&gctx);
7215 /* Unshare most shared trees in the body and in that of any nested functions.
7216 It would seem we don't have to do this for nested functions because
7217 they are supposed to be output and then the outer function gimplified
7218 first, but the g++ front end doesn't always do it that way. */
7219 unshare_body (body_p, fndecl);
7220 unvisit_body (body_p, fndecl);
7222 /* Make sure input_location isn't set to something weird. */
7223 input_location = DECL_SOURCE_LOCATION (fndecl);
7225 /* Resolve callee-copies. This has to be done before processing
7226 the body so that DECL_VALUE_EXPR gets processed correctly. */
7227 parm_stmts = (do_parms) ? gimplify_parameters () : NULL;
7229 /* Gimplify the function's body. */
7231 gimplify_stmt (body_p, &seq);
7232 outer_bind = gimple_seq_first_stmt (seq);
7235 outer_bind = gimple_build_nop ();
7236 gimplify_seq_add_stmt (&seq, outer_bind);
7239 /* The body must contain exactly one statement, a GIMPLE_BIND. If this is
7240 not the case, wrap everything in a GIMPLE_BIND to make it so. */
7241 if (gimple_code (outer_bind) == GIMPLE_BIND
7242 && gimple_seq_first (seq) == gimple_seq_last (seq))
7245 outer_bind = gimple_build_bind (NULL_TREE, seq, NULL);
7247 *body_p = NULL_TREE;
7249 /* If we had callee-copies statements, insert them at the beginning
7251 if (!gimple_seq_empty_p (parm_stmts))
7253 gimplify_seq_add_seq (&parm_stmts, gimple_bind_body (outer_bind));
7254 gimple_bind_set_body (outer_bind, parm_stmts);
7257 pop_gimplify_context (outer_bind);
7258 gcc_assert (gimplify_ctxp == NULL);
7260 #ifdef ENABLE_TYPES_CHECKING
7261 if (!errorcount && !sorrycount)
7262 verify_types_in_gimple_seq (gimple_bind_body (outer_bind));
7265 timevar_pop (TV_TREE_GIMPLIFY);
7266 input_location = saved_location;
7271 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
7272 node for the function we want to gimplify.
7274 Returns the sequence of GIMPLE statements corresponding to the body
7278 gimplify_function_tree (tree fndecl)
7280 tree oldfn, parm, ret;
7284 oldfn = current_function_decl;
7285 current_function_decl = fndecl;
7286 if (DECL_STRUCT_FUNCTION (fndecl))
7287 push_cfun (DECL_STRUCT_FUNCTION (fndecl));
7289 push_struct_function (fndecl);
7291 for (parm = DECL_ARGUMENTS (fndecl); parm ; parm = TREE_CHAIN (parm))
7293 /* Preliminarily mark non-addressed complex variables as eligible
7294 for promotion to gimple registers. We'll transform their uses
7296 if ((TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
7297 || TREE_CODE (TREE_TYPE (parm)) == VECTOR_TYPE)
7298 && !TREE_THIS_VOLATILE (parm)
7299 && !needs_to_live_in_memory (parm))
7300 DECL_GIMPLE_REG_P (parm) = 1;
7303 ret = DECL_RESULT (fndecl);
7304 if ((TREE_CODE (TREE_TYPE (ret)) == COMPLEX_TYPE
7305 || TREE_CODE (TREE_TYPE (ret)) == VECTOR_TYPE)
7306 && !needs_to_live_in_memory (ret))
7307 DECL_GIMPLE_REG_P (ret) = 1;
7309 bind = gimplify_body (&DECL_SAVED_TREE (fndecl), fndecl, true);
7311 /* The tree body of the function is no longer needed, replace it
7312 with the new GIMPLE body. */
7313 seq = gimple_seq_alloc ();
7314 gimple_seq_add_stmt (&seq, bind);
7315 gimple_set_body (fndecl, seq);
7317 /* If we're instrumenting function entry/exit, then prepend the call to
7318 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
7319 catch the exit hook. */
7320 /* ??? Add some way to ignore exceptions for this TFE. */
7321 if (flag_instrument_function_entry_exit
7322 && !DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl)
7323 && !flag_instrument_functions_exclude_p (fndecl))
7328 gimple_seq cleanup = NULL, body = NULL;
7330 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_EXIT];
7331 gimplify_seq_add_stmt (&cleanup, gimple_build_call (x, 0));
7332 tf = gimple_build_try (seq, cleanup, GIMPLE_TRY_FINALLY);
7334 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_ENTER];
7335 gimplify_seq_add_stmt (&body, gimple_build_call (x, 0));
7336 gimplify_seq_add_stmt (&body, tf);
7337 new_bind = gimple_build_bind (NULL, body, gimple_bind_block (bind));
7338 /* Clear the block for BIND, since it is no longer directly inside
7339 the function, but within a try block. */
7340 gimple_bind_set_block (bind, NULL);
7342 /* Replace the current function body with the body
7343 wrapped in the try/finally TF. */
7344 seq = gimple_seq_alloc ();
7345 gimple_seq_add_stmt (&seq, new_bind);
7346 gimple_set_body (fndecl, seq);
7349 DECL_SAVED_TREE (fndecl) = NULL_TREE;
7351 current_function_decl = oldfn;
7356 /* Some transformations like inlining may invalidate the GIMPLE form
7357 for operands. This function traverses all the operands in STMT and
7358 gimplifies anything that is not a valid gimple operand. Any new
7359 GIMPLE statements are inserted before *GSI_P. */
7362 gimple_regimplify_operands (gimple stmt, gimple_stmt_iterator *gsi_p)
7365 tree orig_lhs = NULL_TREE, lhs, t;
7366 gimple_seq pre = NULL;
7367 gimple post_stmt = NULL;
7368 struct gimplify_ctx gctx;
7370 push_gimplify_context (&gctx);
7371 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
7373 switch (gimple_code (stmt))
7376 gimplify_expr (gimple_cond_lhs_ptr (stmt), &pre, NULL,
7377 is_gimple_val, fb_rvalue);
7378 gimplify_expr (gimple_cond_rhs_ptr (stmt), &pre, NULL,
7379 is_gimple_val, fb_rvalue);
7381 case GIMPLE_OMP_ATOMIC_LOAD:
7382 gimplify_expr (gimple_omp_atomic_load_rhs_ptr (stmt), &pre, NULL,
7383 is_gimple_val, fb_rvalue);
7387 size_t i, noutputs = gimple_asm_noutputs (stmt);
7388 const char *constraint, **oconstraints;
7389 bool allows_mem, allows_reg, is_inout;
7392 = (const char **) alloca ((noutputs) * sizeof (const char *));
7393 for (i = 0; i < noutputs; i++)
7395 tree op = gimple_asm_output_op (stmt, i);
7396 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
7397 oconstraints[i] = constraint;
7398 parse_output_constraint (&constraint, i, 0, 0, &allows_mem,
7399 &allows_reg, &is_inout);
7400 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
7401 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
7402 fb_lvalue | fb_mayfail);
7404 for (i = 0; i < gimple_asm_ninputs (stmt); i++)
7406 tree op = gimple_asm_input_op (stmt, i);
7407 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
7408 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
7409 oconstraints, &allows_mem, &allows_reg);
7410 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (op))) && allows_mem)
7412 if (!allows_reg && allows_mem)
7413 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
7414 is_gimple_lvalue, fb_lvalue | fb_mayfail);
7416 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
7417 is_gimple_asm_val, fb_rvalue);
7422 /* NOTE: We start gimplifying operands from last to first to
7423 make sure that side-effects on the RHS of calls, assignments
7424 and ASMs are executed before the LHS. The ordering is not
7425 important for other statements. */
7426 num_ops = gimple_num_ops (stmt);
7427 orig_lhs = gimple_get_lhs (stmt);
7428 for (i = num_ops; i > 0; i--)
7430 tree op = gimple_op (stmt, i - 1);
7431 if (op == NULL_TREE)
7433 if (i == 1 && (is_gimple_call (stmt) || is_gimple_assign (stmt)))
7434 gimplify_expr (&op, &pre, NULL, is_gimple_lvalue, fb_lvalue);
7436 && is_gimple_assign (stmt)
7438 && get_gimple_rhs_class (gimple_expr_code (stmt))
7439 == GIMPLE_SINGLE_RHS)
7440 gimplify_expr (&op, &pre, NULL,
7441 rhs_predicate_for (gimple_assign_lhs (stmt)),
7443 else if (i == 2 && is_gimple_call (stmt))
7445 if (TREE_CODE (op) == FUNCTION_DECL)
7447 gimplify_expr (&op, &pre, NULL, is_gimple_call_addr, fb_rvalue);
7450 gimplify_expr (&op, &pre, NULL, is_gimple_val, fb_rvalue);
7451 gimple_set_op (stmt, i - 1, op);
7454 lhs = gimple_get_lhs (stmt);
7455 /* If regimplification of the LHS changed it in a way that requires
7456 a simple RHS, create temporary. */
7457 if (orig_lhs != lhs && !is_gimple_formal_tmp_var (lhs))
7459 bool need_temp = false;
7461 if (is_gimple_assign (stmt)
7463 && get_gimple_rhs_class (gimple_expr_code (stmt))
7464 == GIMPLE_SINGLE_RHS)
7465 gimplify_expr (gimple_assign_rhs1_ptr (stmt), &pre, NULL,
7466 rhs_predicate_for (gimple_assign_lhs (stmt)),
7468 else if (is_gimple_reg (lhs))
7470 if (is_gimple_reg_type (TREE_TYPE (lhs)))
7472 if (is_gimple_call (stmt))
7474 i = gimple_call_flags (stmt);
7475 if ((i & ECF_LOOPING_CONST_OR_PURE)
7476 || !(i & (ECF_CONST | ECF_PURE)))
7479 if (stmt_can_throw_internal (stmt))
7485 if (is_gimple_reg_type (TREE_TYPE (lhs)))
7487 else if (TYPE_MODE (TREE_TYPE (lhs)) != BLKmode)
7489 if (is_gimple_call (stmt))
7491 tree fndecl = gimple_call_fndecl (stmt);
7493 if (!aggregate_value_p (TREE_TYPE (lhs), fndecl)
7494 && !(fndecl && DECL_RESULT (fndecl)
7495 && DECL_BY_REFERENCE (DECL_RESULT (fndecl))))
7504 tree temp = create_tmp_var (TREE_TYPE (lhs), NULL);
7506 DECL_GIMPLE_FORMAL_TEMP_P (temp) = 1;
7507 if (TREE_CODE (TREE_TYPE (lhs)) == COMPLEX_TYPE
7508 || TREE_CODE (TREE_TYPE (lhs)) == VECTOR_TYPE)
7509 DECL_GIMPLE_REG_P (temp) = 1;
7510 if (TREE_CODE (orig_lhs) == SSA_NAME)
7511 orig_lhs = SSA_NAME_VAR (orig_lhs);
7512 if (TREE_CODE (orig_lhs) == VAR_DECL
7513 && DECL_BASED_ON_RESTRICT_P (orig_lhs))
7515 DECL_BASED_ON_RESTRICT_P (temp) = 1;
7516 SET_DECL_RESTRICT_BASE (temp,
7517 DECL_GET_RESTRICT_BASE (orig_lhs));
7520 if (gimple_in_ssa_p (cfun))
7521 temp = make_ssa_name (temp, NULL);
7522 gimple_set_lhs (stmt, temp);
7523 post_stmt = gimple_build_assign (lhs, temp);
7524 if (TREE_CODE (lhs) == SSA_NAME)
7525 SSA_NAME_DEF_STMT (lhs) = post_stmt;
7531 if (gimple_referenced_vars (cfun))
7532 for (t = gimplify_ctxp->temps; t ; t = TREE_CHAIN (t))
7533 add_referenced_var (t);
7535 if (!gimple_seq_empty_p (pre))
7537 if (gimple_in_ssa_p (cfun))
7539 gimple_stmt_iterator i;
7541 for (i = gsi_start (pre); !gsi_end_p (i); gsi_next (&i))
7542 mark_symbols_for_renaming (gsi_stmt (i));
7544 gsi_insert_seq_before (gsi_p, pre, GSI_SAME_STMT);
7547 gsi_insert_after (gsi_p, post_stmt, GSI_NEW_STMT);
7549 pop_gimplify_context (NULL);
7553 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
7554 force the result to be either ssa_name or an invariant, otherwise
7555 just force it to be a rhs expression. If VAR is not NULL, make the
7556 base variable of the final destination be VAR if suitable. */
7559 force_gimple_operand (tree expr, gimple_seq *stmts, bool simple, tree var)
7562 enum gimplify_status ret;
7563 gimple_predicate gimple_test_f;
7564 struct gimplify_ctx gctx;
7568 if (is_gimple_val (expr))
7571 gimple_test_f = simple ? is_gimple_val : is_gimple_reg_rhs;
7573 push_gimplify_context (&gctx);
7574 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
7575 gimplify_ctxp->allow_rhs_cond_expr = true;
7578 expr = build2 (MODIFY_EXPR, TREE_TYPE (var), var, expr);
7580 if (TREE_CODE (expr) != MODIFY_EXPR
7581 && TREE_TYPE (expr) == void_type_node)
7583 gimplify_and_add (expr, stmts);
7588 ret = gimplify_expr (&expr, stmts, NULL, gimple_test_f, fb_rvalue);
7589 gcc_assert (ret != GS_ERROR);
7592 if (gimple_referenced_vars (cfun))
7593 for (t = gimplify_ctxp->temps; t ; t = TREE_CHAIN (t))
7594 add_referenced_var (t);
7596 pop_gimplify_context (NULL);
7601 /* Invokes force_gimple_operand for EXPR with parameters SIMPLE_P and VAR. If
7602 some statements are produced, emits them at GSI. If BEFORE is true.
7603 the statements are appended before GSI, otherwise they are appended after
7604 it. M specifies the way GSI moves after insertion (GSI_SAME_STMT or
7605 GSI_CONTINUE_LINKING are the usual values). */
7608 force_gimple_operand_gsi (gimple_stmt_iterator *gsi, tree expr,
7609 bool simple_p, tree var, bool before,
7610 enum gsi_iterator_update m)
7614 expr = force_gimple_operand (expr, &stmts, simple_p, var);
7616 if (!gimple_seq_empty_p (stmts))
7618 if (gimple_in_ssa_p (cfun))
7620 gimple_stmt_iterator i;
7622 for (i = gsi_start (stmts); !gsi_end_p (i); gsi_next (&i))
7623 mark_symbols_for_renaming (gsi_stmt (i));
7627 gsi_insert_seq_before (gsi, stmts, m);
7629 gsi_insert_seq_after (gsi, stmts, m);
7635 #include "gt-gimplify.h"