1 /* Tree lowering pass. This pass converts the GENERIC functions-as-trees
2 tree representation into the GIMPLE form.
3 Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
5 Major work done by Sebastian Pop <s.pop@laposte.net>,
6 Diego Novillo <dnovillo@redhat.com> and Jason Merrill <jason@redhat.com>.
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify it under
11 the terms of the GNU General Public License as published by the Free
12 Software Foundation; either version 3, or (at your option) any later
15 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
16 WARRANTY; without even the implied warranty of MERCHANTABILITY or
17 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
26 #include "coretypes.h"
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)
78 ORT_COMBINED_PARALLEL = 3,
83 struct gimplify_omp_ctx
85 struct gimplify_omp_ctx *outer_context;
87 struct pointer_set_t *privatized_types;
89 enum omp_clause_default_kind default_kind;
90 enum omp_region_type region_type;
93 static struct gimplify_ctx *gimplify_ctxp;
94 static struct gimplify_omp_ctx *gimplify_omp_ctxp;
97 /* Formal (expression) temporary table handling: Multiple occurrences of
98 the same scalar expression are evaluated into the same temporary. */
100 typedef struct gimple_temp_hash_elt
103 tree temp; /* Value */
106 /* Forward declarations. */
107 static enum gimplify_status gimplify_compound_expr (tree *, gimple_seq *, bool);
109 /* Mark X addressable. Unlike the langhook we expect X to be in gimple
110 form and we don't do any syntax checking. */
112 mark_addressable (tree x)
114 while (handled_component_p (x))
115 x = TREE_OPERAND (x, 0);
116 if (TREE_CODE (x) != VAR_DECL && TREE_CODE (x) != PARM_DECL)
118 TREE_ADDRESSABLE (x) = 1;
121 /* Return a hash value for a formal temporary table entry. */
124 gimple_tree_hash (const void *p)
126 tree t = ((const elt_t *) p)->val;
127 return iterative_hash_expr (t, 0);
130 /* Compare two formal temporary table entries. */
133 gimple_tree_eq (const void *p1, const void *p2)
135 tree t1 = ((const elt_t *) p1)->val;
136 tree t2 = ((const elt_t *) p2)->val;
137 enum tree_code code = TREE_CODE (t1);
139 if (TREE_CODE (t2) != code
140 || TREE_TYPE (t1) != TREE_TYPE (t2))
143 if (!operand_equal_p (t1, t2, 0))
146 /* Only allow them to compare equal if they also hash equal; otherwise
147 results are nondeterminate, and we fail bootstrap comparison. */
148 gcc_assert (gimple_tree_hash (p1) == gimple_tree_hash (p2));
153 /* Link gimple statement GS to the end of the sequence *SEQ_P. If
154 *SEQ_P is NULL, a new sequence is allocated. This function is
155 similar to gimple_seq_add_stmt, but does not scan the operands.
156 During gimplification, we need to manipulate statement sequences
157 before the def/use vectors have been constructed. */
160 gimplify_seq_add_stmt (gimple_seq *seq_p, gimple gs)
162 gimple_stmt_iterator si;
168 *seq_p = gimple_seq_alloc ();
170 si = gsi_last (*seq_p);
172 gsi_insert_after_without_update (&si, gs, GSI_NEW_STMT);
175 /* Append sequence SRC to the end of sequence *DST_P. If *DST_P is
176 NULL, a new sequence is allocated. This function is
177 similar to gimple_seq_add_seq, but does not scan the operands.
178 During gimplification, we need to manipulate statement sequences
179 before the def/use vectors have been constructed. */
182 gimplify_seq_add_seq (gimple_seq *dst_p, gimple_seq src)
184 gimple_stmt_iterator si;
190 *dst_p = gimple_seq_alloc ();
192 si = gsi_last (*dst_p);
193 gsi_insert_seq_after_without_update (&si, src, GSI_NEW_STMT);
196 /* Set up a context for the gimplifier. */
199 push_gimplify_context (struct gimplify_ctx *c)
201 memset (c, '\0', sizeof (*c));
202 c->prev_context = gimplify_ctxp;
206 /* Tear down a context for the gimplifier. If BODY is non-null, then
207 put the temporaries into the outer BIND_EXPR. Otherwise, put them
210 BODY is not a sequence, but the first tuple in a sequence. */
213 pop_gimplify_context (gimple body)
215 struct gimplify_ctx *c = gimplify_ctxp;
218 gcc_assert (c && (c->bind_expr_stack == NULL
219 || VEC_empty (gimple, c->bind_expr_stack)));
220 VEC_free (gimple, heap, c->bind_expr_stack);
221 gimplify_ctxp = c->prev_context;
223 for (t = c->temps; t ; t = TREE_CHAIN (t))
224 DECL_GIMPLE_FORMAL_TEMP_P (t) = 0;
227 declare_vars (c->temps, body, false);
229 record_vars (c->temps);
232 htab_delete (c->temp_htab);
236 gimple_push_bind_expr (gimple gimple_bind)
238 if (gimplify_ctxp->bind_expr_stack == NULL)
239 gimplify_ctxp->bind_expr_stack = VEC_alloc (gimple, heap, 8);
240 VEC_safe_push (gimple, heap, gimplify_ctxp->bind_expr_stack, gimple_bind);
244 gimple_pop_bind_expr (void)
246 VEC_pop (gimple, gimplify_ctxp->bind_expr_stack);
250 gimple_current_bind_expr (void)
252 return VEC_last (gimple, gimplify_ctxp->bind_expr_stack);
255 /* Return the stack GIMPLE_BINDs created during gimplification. */
258 gimple_bind_expr_stack (void)
260 return gimplify_ctxp->bind_expr_stack;
263 /* Returns true iff there is a COND_EXPR between us and the innermost
264 CLEANUP_POINT_EXPR. This info is used by gimple_push_cleanup. */
267 gimple_conditional_context (void)
269 return gimplify_ctxp->conditions > 0;
272 /* Note that we've entered a COND_EXPR. */
275 gimple_push_condition (void)
277 #ifdef ENABLE_GIMPLE_CHECKING
278 if (gimplify_ctxp->conditions == 0)
279 gcc_assert (gimple_seq_empty_p (gimplify_ctxp->conditional_cleanups));
281 ++(gimplify_ctxp->conditions);
284 /* Note that we've left a COND_EXPR. If we're back at unconditional scope
285 now, add any conditional cleanups we've seen to the prequeue. */
288 gimple_pop_condition (gimple_seq *pre_p)
290 int conds = --(gimplify_ctxp->conditions);
292 gcc_assert (conds >= 0);
295 gimplify_seq_add_seq (pre_p, gimplify_ctxp->conditional_cleanups);
296 gimplify_ctxp->conditional_cleanups = NULL;
300 /* A stable comparison routine for use with splay trees and DECLs. */
303 splay_tree_compare_decl_uid (splay_tree_key xa, splay_tree_key xb)
308 return DECL_UID (a) - DECL_UID (b);
311 /* Create a new omp construct that deals with variable remapping. */
313 static struct gimplify_omp_ctx *
314 new_omp_context (enum omp_region_type region_type)
316 struct gimplify_omp_ctx *c;
318 c = XCNEW (struct gimplify_omp_ctx);
319 c->outer_context = gimplify_omp_ctxp;
320 c->variables = splay_tree_new (splay_tree_compare_decl_uid, 0, 0);
321 c->privatized_types = pointer_set_create ();
322 c->location = input_location;
323 c->region_type = region_type;
324 if ((region_type & ORT_TASK) == 0)
325 c->default_kind = OMP_CLAUSE_DEFAULT_SHARED;
327 c->default_kind = OMP_CLAUSE_DEFAULT_UNSPECIFIED;
332 /* Destroy an omp construct that deals with variable remapping. */
335 delete_omp_context (struct gimplify_omp_ctx *c)
337 splay_tree_delete (c->variables);
338 pointer_set_destroy (c->privatized_types);
342 static void omp_add_variable (struct gimplify_omp_ctx *, tree, unsigned int);
343 static bool omp_notice_variable (struct gimplify_omp_ctx *, tree, bool);
345 /* A subroutine of append_to_statement_list{,_force}. T is not NULL. */
348 append_to_statement_list_1 (tree t, tree *list_p)
351 tree_stmt_iterator i;
355 if (t && TREE_CODE (t) == STATEMENT_LIST)
360 *list_p = list = alloc_stmt_list ();
364 tsi_link_after (&i, t, TSI_CONTINUE_LINKING);
367 /* Add T to the end of the list container pointed to by LIST_P.
368 If T is an expression with no effects, it is ignored. */
371 append_to_statement_list (tree t, tree *list_p)
373 if (t && TREE_SIDE_EFFECTS (t))
374 append_to_statement_list_1 (t, list_p);
377 /* Similar, but the statement is always added, regardless of side effects. */
380 append_to_statement_list_force (tree t, tree *list_p)
383 append_to_statement_list_1 (t, list_p);
386 /* Both gimplify the statement T and append it to *SEQ_P. This function
387 behaves exactly as gimplify_stmt, but you don't have to pass T as a
391 gimplify_and_add (tree t, gimple_seq *seq_p)
393 gimplify_stmt (&t, seq_p);
396 /* Gimplify statement T into sequence *SEQ_P, and return the first
397 tuple in the sequence of generated tuples for this statement.
398 Return NULL if gimplifying T produced no tuples. */
401 gimplify_and_return_first (tree t, gimple_seq *seq_p)
403 gimple_stmt_iterator last = gsi_last (*seq_p);
405 gimplify_and_add (t, seq_p);
407 if (!gsi_end_p (last))
410 return gsi_stmt (last);
413 return gimple_seq_first_stmt (*seq_p);
416 /* Strip off a legitimate source ending from the input string NAME of
417 length LEN. Rather than having to know the names used by all of
418 our front ends, we strip off an ending of a period followed by
419 up to five characters. (Java uses ".class".) */
422 remove_suffix (char *name, int len)
426 for (i = 2; i < 8 && len > i; i++)
428 if (name[len - i] == '.')
430 name[len - i] = '\0';
436 /* Subroutine for find_single_pointer_decl. */
439 find_single_pointer_decl_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
442 tree *pdecl = (tree *) data;
444 /* We are only looking for pointers at the same level as the
445 original tree; we must not look through any indirections.
446 Returning anything other than NULL_TREE will cause the caller to
448 if (REFERENCE_CLASS_P (*tp))
451 if (DECL_P (*tp) && POINTER_TYPE_P (TREE_TYPE (*tp)))
455 /* We already found a pointer decl; return anything other
456 than NULL_TREE to unwind from walk_tree signalling that
457 we have a duplicate. */
466 /* Find the single DECL of pointer type in the tree T, used directly
467 rather than via an indirection, and return it. If there are zero
468 or more than one such DECLs, return NULL. */
471 find_single_pointer_decl (tree t)
473 tree decl = NULL_TREE;
475 if (walk_tree (&t, find_single_pointer_decl_1, &decl, NULL))
477 /* find_single_pointer_decl_1 returns a nonzero value, causing
478 walk_tree to return a nonzero value, to indicate that it
479 found more than one pointer DECL or that it found an
487 /* Create a new temporary name with PREFIX. Returns an identifier. */
489 static GTY(()) unsigned int tmp_var_id_num;
492 create_tmp_var_name (const char *prefix)
498 char *preftmp = ASTRDUP (prefix);
500 remove_suffix (preftmp, strlen (preftmp));
504 ASM_FORMAT_PRIVATE_NAME (tmp_name, prefix ? prefix : "T", tmp_var_id_num++);
505 return get_identifier (tmp_name);
509 /* Create a new temporary variable declaration of type TYPE.
510 Does NOT push it into the current binding. */
513 create_tmp_var_raw (tree type, const char *prefix)
518 /* Make the type of the variable writable. */
519 new_type = build_type_variant (type, 0, 0);
520 TYPE_ATTRIBUTES (new_type) = TYPE_ATTRIBUTES (type);
522 tmp_var = build_decl (VAR_DECL, prefix ? create_tmp_var_name (prefix) : NULL,
525 /* The variable was declared by the compiler. */
526 DECL_ARTIFICIAL (tmp_var) = 1;
527 /* And we don't want debug info for it. */
528 DECL_IGNORED_P (tmp_var) = 1;
530 /* Make the variable writable. */
531 TREE_READONLY (tmp_var) = 0;
533 DECL_EXTERNAL (tmp_var) = 0;
534 TREE_STATIC (tmp_var) = 0;
535 TREE_USED (tmp_var) = 1;
540 /* Create a new temporary variable declaration of type TYPE. DOES push the
541 variable into the current binding. Further, assume that this is called
542 only from gimplification or optimization, at which point the creation of
543 certain types are bugs. */
546 create_tmp_var (tree type, const char *prefix)
550 /* We don't allow types that are addressable (meaning we can't make copies),
551 or incomplete. We also used to reject every variable size objects here,
552 but now support those for which a constant upper bound can be obtained.
553 The processing for variable sizes is performed in gimple_add_tmp_var,
554 point at which it really matters and possibly reached via paths not going
555 through this function, e.g. after direct calls to create_tmp_var_raw. */
556 gcc_assert (!TREE_ADDRESSABLE (type) && COMPLETE_TYPE_P (type));
558 tmp_var = create_tmp_var_raw (type, prefix);
559 gimple_add_tmp_var (tmp_var);
563 /* Create a temporary with a name derived from VAL. Subroutine of
564 lookup_tmp_var; nobody else should call this function. */
567 create_tmp_from_val (tree val)
569 return create_tmp_var (TREE_TYPE (val), get_name (val));
572 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
573 an existing expression temporary. */
576 lookup_tmp_var (tree val, bool is_formal)
580 /* If not optimizing, never really reuse a temporary. local-alloc
581 won't allocate any variable that is used in more than one basic
582 block, which means it will go into memory, causing much extra
583 work in reload and final and poorer code generation, outweighing
584 the extra memory allocation here. */
585 if (!optimize || !is_formal || TREE_SIDE_EFFECTS (val))
586 ret = create_tmp_from_val (val);
593 if (gimplify_ctxp->temp_htab == NULL)
594 gimplify_ctxp->temp_htab
595 = htab_create (1000, gimple_tree_hash, gimple_tree_eq, free);
596 slot = htab_find_slot (gimplify_ctxp->temp_htab, (void *)&elt, INSERT);
599 elt_p = XNEW (elt_t);
601 elt_p->temp = ret = create_tmp_from_val (val);
602 *slot = (void *) elt_p;
606 elt_p = (elt_t *) *slot;
612 DECL_GIMPLE_FORMAL_TEMP_P (ret) = 1;
618 /* Return true if T is a CALL_EXPR or an expression that can be
619 assignmed to a temporary. Note that this predicate should only be
620 used during gimplification. See the rationale for this in
621 gimplify_modify_expr. */
624 is_gimple_formal_tmp_or_call_rhs (tree t)
626 return TREE_CODE (t) == CALL_EXPR || is_gimple_formal_tmp_rhs (t);
629 /* Returns true iff T is a valid RHS for an assignment to a renamed
630 user -- or front-end generated artificial -- variable. */
633 is_gimple_reg_or_call_rhs (tree t)
635 /* If the RHS of the MODIFY_EXPR may throw or make a nonlocal goto
636 and the LHS is a user variable, then we need to introduce a formal
637 temporary. This way the optimizers can determine that the user
638 variable is only modified if evaluation of the RHS does not throw.
640 Don't force a temp of a non-renamable type; the copy could be
641 arbitrarily expensive. Instead we will generate a VDEF for
644 if (is_gimple_reg_type (TREE_TYPE (t))
645 && ((TREE_CODE (t) == CALL_EXPR && TREE_SIDE_EFFECTS (t))
646 || tree_could_throw_p (t)))
649 return is_gimple_formal_tmp_or_call_rhs (t);
652 /* Return true if T is a valid memory RHS or a CALL_EXPR. Note that
653 this predicate should only be used during gimplification. See the
654 rationale for this in gimplify_modify_expr. */
657 is_gimple_mem_or_call_rhs (tree t)
659 /* If we're dealing with a renamable type, either source or dest must be
660 a renamed variable. */
661 if (is_gimple_reg_type (TREE_TYPE (t)))
662 return is_gimple_val (t);
664 return is_gimple_formal_tmp_or_call_rhs (t);
668 /* Returns a formal temporary variable initialized with VAL. PRE_P is as
669 in gimplify_expr. Only use this function if:
671 1) The value of the unfactored expression represented by VAL will not
672 change between the initialization and use of the temporary, and
673 2) The temporary will not be otherwise modified.
675 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
676 and #2 means it is inappropriate for && temps.
678 For other cases, use get_initialized_tmp_var instead. */
681 internal_get_tmp_var (tree val, gimple_seq *pre_p, gimple_seq *post_p,
686 /* Notice that we explicitly allow VAL to be a CALL_EXPR so that we
687 can create an INIT_EXPR and convert it into a GIMPLE_CALL below. */
688 gimplify_expr (&val, pre_p, post_p, is_gimple_formal_tmp_or_call_rhs,
691 t = lookup_tmp_var (val, is_formal);
695 tree u = find_single_pointer_decl (val);
697 if (u && TREE_CODE (u) == VAR_DECL && DECL_BASED_ON_RESTRICT_P (u))
698 u = DECL_GET_RESTRICT_BASE (u);
699 if (u && TYPE_RESTRICT (TREE_TYPE (u)))
701 if (DECL_BASED_ON_RESTRICT_P (t))
702 gcc_assert (u == DECL_GET_RESTRICT_BASE (t));
705 DECL_BASED_ON_RESTRICT_P (t) = 1;
706 SET_DECL_RESTRICT_BASE (t, u);
711 if (TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
712 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
713 DECL_GIMPLE_REG_P (t) = 1;
715 mod = build2 (INIT_EXPR, TREE_TYPE (t), t, unshare_expr (val));
717 if (EXPR_HAS_LOCATION (val))
718 SET_EXPR_LOCUS (mod, EXPR_LOCUS (val));
720 SET_EXPR_LOCATION (mod, input_location);
722 /* gimplify_modify_expr might want to reduce this further. */
723 gimplify_and_add (mod, pre_p);
726 /* If we're gimplifying into ssa, gimplify_modify_expr will have
727 given our temporary an SSA name. Find and return it. */
728 if (gimplify_ctxp->into_ssa)
730 gimple last = gimple_seq_last_stmt (*pre_p);
731 t = gimple_get_lhs (last);
737 /* Returns a formal temporary variable initialized with VAL. PRE_P
738 points to a sequence where side-effects needed to compute VAL should be
742 get_formal_tmp_var (tree val, gimple_seq *pre_p)
744 return internal_get_tmp_var (val, pre_p, NULL, true);
747 /* Returns a temporary variable initialized with VAL. PRE_P and POST_P
748 are as in gimplify_expr. */
751 get_initialized_tmp_var (tree val, gimple_seq *pre_p, gimple_seq *post_p)
753 return internal_get_tmp_var (val, pre_p, post_p, false);
756 /* Declares all the variables in VARS in SCOPE. If DEBUG_INFO is
757 true, generate debug info for them; otherwise don't. */
760 declare_vars (tree vars, gimple scope, bool debug_info)
767 gcc_assert (gimple_code (scope) == GIMPLE_BIND);
769 temps = nreverse (last);
771 block = gimple_bind_block (scope);
772 gcc_assert (!block || TREE_CODE (block) == BLOCK);
773 if (!block || !debug_info)
775 TREE_CHAIN (last) = gimple_bind_vars (scope);
776 gimple_bind_set_vars (scope, temps);
780 /* We need to attach the nodes both to the BIND_EXPR and to its
781 associated BLOCK for debugging purposes. The key point here
782 is that the BLOCK_VARS of the BIND_EXPR_BLOCK of a BIND_EXPR
783 is a subchain of the BIND_EXPR_VARS of the BIND_EXPR. */
784 if (BLOCK_VARS (block))
785 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), temps);
788 gimple_bind_set_vars (scope,
789 chainon (gimple_bind_vars (scope), temps));
790 BLOCK_VARS (block) = temps;
796 /* For VAR a VAR_DECL of variable size, try to find a constant upper bound
797 for the size and adjust DECL_SIZE/DECL_SIZE_UNIT accordingly. Abort if
798 no such upper bound can be obtained. */
801 force_constant_size (tree var)
803 /* The only attempt we make is by querying the maximum size of objects
804 of the variable's type. */
806 HOST_WIDE_INT max_size;
808 gcc_assert (TREE_CODE (var) == VAR_DECL);
810 max_size = max_int_size_in_bytes (TREE_TYPE (var));
812 gcc_assert (max_size >= 0);
815 = build_int_cst (TREE_TYPE (DECL_SIZE_UNIT (var)), max_size);
817 = build_int_cst (TREE_TYPE (DECL_SIZE (var)), max_size * BITS_PER_UNIT);
821 gimple_add_tmp_var (tree tmp)
823 gcc_assert (!TREE_CHAIN (tmp) && !DECL_SEEN_IN_BIND_EXPR_P (tmp));
825 /* Later processing assumes that the object size is constant, which might
826 not be true at this point. Force the use of a constant upper bound in
828 if (!host_integerp (DECL_SIZE_UNIT (tmp), 1))
829 force_constant_size (tmp);
831 DECL_CONTEXT (tmp) = current_function_decl;
832 DECL_SEEN_IN_BIND_EXPR_P (tmp) = 1;
836 TREE_CHAIN (tmp) = gimplify_ctxp->temps;
837 gimplify_ctxp->temps = tmp;
839 /* Mark temporaries local within the nearest enclosing parallel. */
840 if (gimplify_omp_ctxp)
842 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
843 while (ctx && ctx->region_type == ORT_WORKSHARE)
844 ctx = ctx->outer_context;
846 omp_add_variable (ctx, tmp, GOVD_LOCAL | GOVD_SEEN);
855 /* This case is for nested functions. We need to expose the locals
857 body_seq = gimple_body (current_function_decl);
858 declare_vars (tmp, gimple_seq_first_stmt (body_seq), false);
862 /* Determines whether to assign a location to the statement GS. */
865 should_carry_location_p (gimple gs)
867 /* Don't emit a line note for a label. We particularly don't want to
868 emit one for the break label, since it doesn't actually correspond
869 to the beginning of the loop/switch. */
870 if (gimple_code (gs) == GIMPLE_LABEL)
876 /* Same, but for a tree. */
879 tree_should_carry_location_p (const_tree stmt)
881 /* Don't emit a line note for a label. We particularly don't want to
882 emit one for the break label, since it doesn't actually correspond
883 to the beginning of the loop/switch. */
884 if (TREE_CODE (stmt) == LABEL_EXPR)
887 /* Do not annotate empty statements, since it confuses gcov. */
888 if (!TREE_SIDE_EFFECTS (stmt))
894 /* Return true if a location should not be emitted for this statement
895 by annotate_one_with_location. */
898 gimple_do_not_emit_location_p (gimple g)
900 return gimple_plf (g, GF_PLF_1);
903 /* Mark statement G so a location will not be emitted by
904 annotate_one_with_location. */
907 gimple_set_do_not_emit_location (gimple g)
909 /* The PLF flags are initialized to 0 when a new tuple is created,
910 so no need to initialize it anywhere. */
911 gimple_set_plf (g, GF_PLF_1, true);
914 /* Set the location for gimple statement GS to LOCUS. */
917 annotate_one_with_location (gimple gs, location_t location)
919 if (!gimple_has_location (gs)
920 && !gimple_do_not_emit_location_p (gs)
921 && should_carry_location_p (gs))
922 gimple_set_location (gs, location);
925 /* Same, but for tree T. */
928 tree_annotate_one_with_location (tree t, location_t location)
930 if (CAN_HAVE_LOCATION_P (t)
931 && ! EXPR_HAS_LOCATION (t) && tree_should_carry_location_p (t))
932 SET_EXPR_LOCATION (t, location);
936 /* Set LOCATION for all the statements after iterator GSI in sequence
937 SEQ. If GSI is pointing to the end of the sequence, start with the
938 first statement in SEQ. */
941 annotate_all_with_location_after (gimple_seq seq, gimple_stmt_iterator gsi,
945 gsi = gsi_start (seq);
949 for (; !gsi_end_p (gsi); gsi_next (&gsi))
950 annotate_one_with_location (gsi_stmt (gsi), location);
954 /* Set the location for all the statements in a sequence STMT_P to LOCUS. */
957 annotate_all_with_location (gimple_seq stmt_p, location_t location)
959 gimple_stmt_iterator i;
961 if (gimple_seq_empty_p (stmt_p))
964 for (i = gsi_start (stmt_p); !gsi_end_p (i); gsi_next (&i))
966 gimple gs = gsi_stmt (i);
967 annotate_one_with_location (gs, location);
971 /* Same, but for statement or statement list in *STMT_P. */
974 tree_annotate_all_with_location (tree *stmt_p, location_t location)
976 tree_stmt_iterator i;
981 for (i = tsi_start (*stmt_p); !tsi_end_p (i); tsi_next (&i))
983 tree t = tsi_stmt (i);
985 /* Assuming we've already been gimplified, we shouldn't
986 see nested chaining constructs anymore. */
987 gcc_assert (TREE_CODE (t) != STATEMENT_LIST
988 && TREE_CODE (t) != COMPOUND_EXPR);
990 tree_annotate_one_with_location (t, location);
995 /* Similar to copy_tree_r() but do not copy SAVE_EXPR or TARGET_EXPR nodes.
996 These nodes model computations that should only be done once. If we
997 were to unshare something like SAVE_EXPR(i++), the gimplification
998 process would create wrong code. */
1001 mostly_copy_tree_r (tree *tp, int *walk_subtrees, void *data)
1003 enum tree_code code = TREE_CODE (*tp);
1004 /* Don't unshare types, decls, constants and SAVE_EXPR nodes. */
1005 if (TREE_CODE_CLASS (code) == tcc_type
1006 || TREE_CODE_CLASS (code) == tcc_declaration
1007 || TREE_CODE_CLASS (code) == tcc_constant
1008 || code == SAVE_EXPR || code == TARGET_EXPR
1009 /* We can't do anything sensible with a BLOCK used as an expression,
1010 but we also can't just die when we see it because of non-expression
1011 uses. So just avert our eyes and cross our fingers. Silly Java. */
1016 gcc_assert (code != BIND_EXPR);
1017 copy_tree_r (tp, walk_subtrees, data);
1023 /* Callback for walk_tree to unshare most of the shared trees rooted at
1024 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
1025 then *TP is deep copied by calling copy_tree_r.
1027 This unshares the same trees as copy_tree_r with the exception of
1028 SAVE_EXPR nodes. These nodes model computations that should only be
1029 done once. If we were to unshare something like SAVE_EXPR(i++), the
1030 gimplification process would create wrong code. */
1033 copy_if_shared_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
1034 void *data ATTRIBUTE_UNUSED)
1037 enum tree_code code = TREE_CODE (t);
1039 /* Skip types, decls, and constants. But we do want to look at their
1040 types and the bounds of types. Mark them as visited so we properly
1041 unmark their subtrees on the unmark pass. If we've already seen them,
1042 don't look down further. */
1043 if (TREE_CODE_CLASS (code) == tcc_type
1044 || TREE_CODE_CLASS (code) == tcc_declaration
1045 || TREE_CODE_CLASS (code) == tcc_constant)
1047 if (TREE_VISITED (t))
1050 TREE_VISITED (t) = 1;
1053 /* If this node has been visited already, unshare it and don't look
1055 else if (TREE_VISITED (t))
1057 walk_tree (tp, mostly_copy_tree_r, NULL, NULL);
1061 /* Otherwise, mark the tree as visited and keep looking. */
1063 TREE_VISITED (t) = 1;
1069 unmark_visited_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
1070 void *data ATTRIBUTE_UNUSED)
1072 if (TREE_VISITED (*tp))
1073 TREE_VISITED (*tp) = 0;
1080 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
1081 bodies of any nested functions if we are unsharing the entire body of
1085 unshare_body (tree *body_p, tree fndecl)
1087 struct cgraph_node *cgn = cgraph_node (fndecl);
1089 walk_tree (body_p, copy_if_shared_r, NULL, NULL);
1090 if (body_p == &DECL_SAVED_TREE (fndecl))
1091 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
1092 unshare_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
1095 /* Likewise, but mark all trees as not visited. */
1098 unvisit_body (tree *body_p, tree fndecl)
1100 struct cgraph_node *cgn = cgraph_node (fndecl);
1102 walk_tree (body_p, unmark_visited_r, NULL, NULL);
1103 if (body_p == &DECL_SAVED_TREE (fndecl))
1104 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
1105 unvisit_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
1108 /* Unconditionally make an unshared copy of EXPR. This is used when using
1109 stored expressions which span multiple functions, such as BINFO_VTABLE,
1110 as the normal unsharing process can't tell that they're shared. */
1113 unshare_expr (tree expr)
1115 walk_tree (&expr, mostly_copy_tree_r, NULL, NULL);
1119 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
1120 contain statements and have a value. Assign its value to a temporary
1121 and give it void_type_node. Returns the temporary, or NULL_TREE if
1122 WRAPPER was already void. */
1125 voidify_wrapper_expr (tree wrapper, tree temp)
1127 tree type = TREE_TYPE (wrapper);
1128 if (type && !VOID_TYPE_P (type))
1132 /* Set p to point to the body of the wrapper. Loop until we find
1133 something that isn't a wrapper. */
1134 for (p = &wrapper; p && *p; )
1136 switch (TREE_CODE (*p))
1139 TREE_SIDE_EFFECTS (*p) = 1;
1140 TREE_TYPE (*p) = void_type_node;
1141 /* For a BIND_EXPR, the body is operand 1. */
1142 p = &BIND_EXPR_BODY (*p);
1145 case CLEANUP_POINT_EXPR:
1146 case TRY_FINALLY_EXPR:
1147 case TRY_CATCH_EXPR:
1148 TREE_SIDE_EFFECTS (*p) = 1;
1149 TREE_TYPE (*p) = void_type_node;
1150 p = &TREE_OPERAND (*p, 0);
1153 case STATEMENT_LIST:
1155 tree_stmt_iterator i = tsi_last (*p);
1156 TREE_SIDE_EFFECTS (*p) = 1;
1157 TREE_TYPE (*p) = void_type_node;
1158 p = tsi_end_p (i) ? NULL : tsi_stmt_ptr (i);
1163 /* Advance to the last statement. Set all container types to void. */
1164 for (; TREE_CODE (*p) == COMPOUND_EXPR; p = &TREE_OPERAND (*p, 1))
1166 TREE_SIDE_EFFECTS (*p) = 1;
1167 TREE_TYPE (*p) = void_type_node;
1177 if (p == NULL || IS_EMPTY_STMT (*p))
1181 /* The wrapper is on the RHS of an assignment that we're pushing
1183 gcc_assert (TREE_CODE (temp) == INIT_EXPR
1184 || TREE_CODE (temp) == MODIFY_EXPR);
1185 TREE_OPERAND (temp, 1) = *p;
1190 temp = create_tmp_var (type, "retval");
1191 *p = build2 (INIT_EXPR, type, temp, *p);
1200 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
1201 a temporary through which they communicate. */
1204 build_stack_save_restore (gimple *save, gimple *restore)
1208 *save = gimple_build_call (implicit_built_in_decls[BUILT_IN_STACK_SAVE], 0);
1209 tmp_var = create_tmp_var (ptr_type_node, "saved_stack");
1210 gimple_call_set_lhs (*save, tmp_var);
1212 *restore = gimple_build_call (implicit_built_in_decls[BUILT_IN_STACK_RESTORE],
1216 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
1218 static enum gimplify_status
1219 gimplify_bind_expr (tree *expr_p, gimple_seq *pre_p)
1221 tree bind_expr = *expr_p;
1222 bool old_save_stack = gimplify_ctxp->save_stack;
1227 tree temp = voidify_wrapper_expr (bind_expr, NULL);
1229 /* Mark variables seen in this bind expr. */
1230 for (t = BIND_EXPR_VARS (bind_expr); t ; t = TREE_CHAIN (t))
1232 if (TREE_CODE (t) == VAR_DECL)
1234 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
1236 /* Mark variable as local. */
1237 if (ctx && !is_global_var (t)
1238 && (! DECL_SEEN_IN_BIND_EXPR_P (t)
1239 || splay_tree_lookup (ctx->variables,
1240 (splay_tree_key) t) == NULL))
1241 omp_add_variable (gimplify_omp_ctxp, t, GOVD_LOCAL | GOVD_SEEN);
1243 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
1245 if (DECL_HARD_REGISTER (t) && !is_global_var (t) && cfun)
1246 cfun->has_local_explicit_reg_vars = true;
1249 /* Preliminarily mark non-addressed complex variables as eligible
1250 for promotion to gimple registers. We'll transform their uses
1252 if ((TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
1253 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
1254 && !TREE_THIS_VOLATILE (t)
1255 && (TREE_CODE (t) == VAR_DECL && !DECL_HARD_REGISTER (t))
1256 && !needs_to_live_in_memory (t))
1257 DECL_GIMPLE_REG_P (t) = 1;
1260 gimple_bind = gimple_build_bind (BIND_EXPR_VARS (bind_expr), NULL,
1261 BIND_EXPR_BLOCK (bind_expr));
1262 gimple_push_bind_expr (gimple_bind);
1264 gimplify_ctxp->save_stack = false;
1266 /* Gimplify the body into the GIMPLE_BIND tuple's body. */
1268 gimplify_stmt (&BIND_EXPR_BODY (bind_expr), &body);
1269 gimple_bind_set_body (gimple_bind, body);
1271 if (gimplify_ctxp->save_stack)
1273 gimple stack_save, stack_restore, gs;
1274 gimple_seq cleanup, new_body;
1276 /* Save stack on entry and restore it on exit. Add a try_finally
1277 block to achieve this. Note that mudflap depends on the
1278 format of the emitted code: see mx_register_decls(). */
1279 build_stack_save_restore (&stack_save, &stack_restore);
1281 cleanup = new_body = NULL;
1282 gimplify_seq_add_stmt (&cleanup, stack_restore);
1283 gs = gimple_build_try (gimple_bind_body (gimple_bind), cleanup,
1284 GIMPLE_TRY_FINALLY);
1286 gimplify_seq_add_stmt (&new_body, stack_save);
1287 gimplify_seq_add_stmt (&new_body, gs);
1288 gimple_bind_set_body (gimple_bind, new_body);
1291 gimplify_ctxp->save_stack = old_save_stack;
1292 gimple_pop_bind_expr ();
1294 gimplify_seq_add_stmt (pre_p, gimple_bind);
1302 *expr_p = NULL_TREE;
1306 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1307 GIMPLE value, it is assigned to a new temporary and the statement is
1308 re-written to return the temporary.
1310 PRE_P points to the sequence where side effects that must happen before
1311 STMT should be stored. */
1313 static enum gimplify_status
1314 gimplify_return_expr (tree stmt, gimple_seq *pre_p)
1317 tree ret_expr = TREE_OPERAND (stmt, 0);
1318 tree result_decl, result;
1320 if (ret_expr == error_mark_node)
1324 || TREE_CODE (ret_expr) == RESULT_DECL
1325 || ret_expr == error_mark_node)
1327 gimple ret = gimple_build_return (ret_expr);
1328 gimple_set_no_warning (ret, TREE_NO_WARNING (stmt));
1329 gimplify_seq_add_stmt (pre_p, ret);
1333 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
1334 result_decl = NULL_TREE;
1337 result_decl = TREE_OPERAND (ret_expr, 0);
1339 /* See through a return by reference. */
1340 if (TREE_CODE (result_decl) == INDIRECT_REF)
1341 result_decl = TREE_OPERAND (result_decl, 0);
1343 gcc_assert ((TREE_CODE (ret_expr) == MODIFY_EXPR
1344 || TREE_CODE (ret_expr) == INIT_EXPR)
1345 && TREE_CODE (result_decl) == RESULT_DECL);
1348 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1349 Recall that aggregate_value_p is FALSE for any aggregate type that is
1350 returned in registers. If we're returning values in registers, then
1351 we don't want to extend the lifetime of the RESULT_DECL, particularly
1352 across another call. In addition, for those aggregates for which
1353 hard_function_value generates a PARALLEL, we'll die during normal
1354 expansion of structure assignments; there's special code in expand_return
1355 to handle this case that does not exist in expand_expr. */
1357 || aggregate_value_p (result_decl, TREE_TYPE (current_function_decl)))
1358 result = result_decl;
1359 else if (gimplify_ctxp->return_temp)
1360 result = gimplify_ctxp->return_temp;
1363 result = create_tmp_var (TREE_TYPE (result_decl), NULL);
1364 if (TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
1365 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
1366 DECL_GIMPLE_REG_P (result) = 1;
1368 /* ??? With complex control flow (usually involving abnormal edges),
1369 we can wind up warning about an uninitialized value for this. Due
1370 to how this variable is constructed and initialized, this is never
1371 true. Give up and never warn. */
1372 TREE_NO_WARNING (result) = 1;
1374 gimplify_ctxp->return_temp = result;
1377 /* Smash the lhs of the MODIFY_EXPR to the temporary we plan to use.
1378 Then gimplify the whole thing. */
1379 if (result != result_decl)
1380 TREE_OPERAND (ret_expr, 0) = result;
1382 gimplify_and_add (TREE_OPERAND (stmt, 0), pre_p);
1384 ret = gimple_build_return (result);
1385 gimple_set_no_warning (ret, TREE_NO_WARNING (stmt));
1386 gimplify_seq_add_stmt (pre_p, ret);
1392 gimplify_vla_decl (tree decl, gimple_seq *seq_p)
1394 /* This is a variable-sized decl. Simplify its size and mark it
1395 for deferred expansion. Note that mudflap depends on the format
1396 of the emitted code: see mx_register_decls(). */
1397 tree t, addr, ptr_type;
1399 gimplify_one_sizepos (&DECL_SIZE (decl), seq_p);
1400 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl), seq_p);
1402 /* All occurrences of this decl in final gimplified code will be
1403 replaced by indirection. Setting DECL_VALUE_EXPR does two
1404 things: First, it lets the rest of the gimplifier know what
1405 replacement to use. Second, it lets the debug info know
1406 where to find the value. */
1407 ptr_type = build_pointer_type (TREE_TYPE (decl));
1408 addr = create_tmp_var (ptr_type, get_name (decl));
1409 DECL_IGNORED_P (addr) = 0;
1410 t = build_fold_indirect_ref (addr);
1411 SET_DECL_VALUE_EXPR (decl, t);
1412 DECL_HAS_VALUE_EXPR_P (decl) = 1;
1414 t = built_in_decls[BUILT_IN_ALLOCA];
1415 t = build_call_expr (t, 1, DECL_SIZE_UNIT (decl));
1416 t = fold_convert (ptr_type, t);
1417 t = build2 (MODIFY_EXPR, TREE_TYPE (addr), addr, t);
1419 gimplify_and_add (t, seq_p);
1421 /* Indicate that we need to restore the stack level when the
1422 enclosing BIND_EXPR is exited. */
1423 gimplify_ctxp->save_stack = true;
1427 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
1428 and initialization explicit. */
1430 static enum gimplify_status
1431 gimplify_decl_expr (tree *stmt_p, gimple_seq *seq_p)
1433 tree stmt = *stmt_p;
1434 tree decl = DECL_EXPR_DECL (stmt);
1436 *stmt_p = NULL_TREE;
1438 if (TREE_TYPE (decl) == error_mark_node)
1441 if ((TREE_CODE (decl) == TYPE_DECL
1442 || TREE_CODE (decl) == VAR_DECL)
1443 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl)))
1444 gimplify_type_sizes (TREE_TYPE (decl), seq_p);
1446 if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl))
1448 tree init = DECL_INITIAL (decl);
1450 if (TREE_CODE (DECL_SIZE_UNIT (decl)) != INTEGER_CST
1451 || (!TREE_STATIC (decl)
1452 && flag_stack_check == GENERIC_STACK_CHECK
1453 && compare_tree_int (DECL_SIZE_UNIT (decl),
1454 STACK_CHECK_MAX_VAR_SIZE) > 0))
1455 gimplify_vla_decl (decl, seq_p);
1457 if (init && init != error_mark_node)
1459 if (!TREE_STATIC (decl))
1461 DECL_INITIAL (decl) = NULL_TREE;
1462 init = build2 (INIT_EXPR, void_type_node, decl, init);
1463 gimplify_and_add (init, seq_p);
1467 /* We must still examine initializers for static variables
1468 as they may contain a label address. */
1469 walk_tree (&init, force_labels_r, NULL, NULL);
1472 /* Some front ends do not explicitly declare all anonymous
1473 artificial variables. We compensate here by declaring the
1474 variables, though it would be better if the front ends would
1475 explicitly declare them. */
1476 if (!DECL_SEEN_IN_BIND_EXPR_P (decl)
1477 && DECL_ARTIFICIAL (decl) && DECL_NAME (decl) == NULL_TREE)
1478 gimple_add_tmp_var (decl);
1484 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1485 and replacing the LOOP_EXPR with goto, but if the loop contains an
1486 EXIT_EXPR, we need to append a label for it to jump to. */
1488 static enum gimplify_status
1489 gimplify_loop_expr (tree *expr_p, gimple_seq *pre_p)
1491 tree saved_label = gimplify_ctxp->exit_label;
1492 tree start_label = create_artificial_label ();
1494 gimplify_seq_add_stmt (pre_p, gimple_build_label (start_label));
1496 gimplify_ctxp->exit_label = NULL_TREE;
1498 gimplify_and_add (LOOP_EXPR_BODY (*expr_p), pre_p);
1500 gimplify_seq_add_stmt (pre_p, gimple_build_goto (start_label));
1502 if (gimplify_ctxp->exit_label)
1503 gimplify_seq_add_stmt (pre_p, gimple_build_label (gimplify_ctxp->exit_label));
1505 gimplify_ctxp->exit_label = saved_label;
1511 /* Gimplifies a statement list onto a sequence. These may be created either
1512 by an enlightened front-end, or by shortcut_cond_expr. */
1514 static enum gimplify_status
1515 gimplify_statement_list (tree *expr_p, gimple_seq *pre_p)
1517 tree temp = voidify_wrapper_expr (*expr_p, NULL);
1519 tree_stmt_iterator i = tsi_start (*expr_p);
1521 while (!tsi_end_p (i))
1523 gimplify_stmt (tsi_stmt_ptr (i), pre_p);
1536 /* Compare two case labels. Because the front end should already have
1537 made sure that case ranges do not overlap, it is enough to only compare
1538 the CASE_LOW values of each case label. */
1541 compare_case_labels (const void *p1, const void *p2)
1543 const_tree const case1 = *(const_tree const*)p1;
1544 const_tree const case2 = *(const_tree const*)p2;
1546 /* The 'default' case label always goes first. */
1547 if (!CASE_LOW (case1))
1549 else if (!CASE_LOW (case2))
1552 return tree_int_cst_compare (CASE_LOW (case1), CASE_LOW (case2));
1556 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1559 sort_case_labels (VEC(tree,heap)* label_vec)
1561 size_t len = VEC_length (tree, label_vec);
1562 qsort (VEC_address (tree, label_vec), len, sizeof (tree),
1563 compare_case_labels);
1567 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1570 static enum gimplify_status
1571 gimplify_switch_expr (tree *expr_p, gimple_seq *pre_p)
1573 tree switch_expr = *expr_p;
1574 gimple_seq switch_body_seq = NULL;
1575 enum gimplify_status ret;
1577 ret = gimplify_expr (&SWITCH_COND (switch_expr), pre_p, NULL, is_gimple_val,
1579 if (ret == GS_ERROR || ret == GS_UNHANDLED)
1582 if (SWITCH_BODY (switch_expr))
1584 VEC (tree,heap) *labels;
1585 VEC (tree,heap) *saved_labels;
1586 tree default_case = NULL_TREE;
1588 gimple gimple_switch;
1590 /* If someone can be bothered to fill in the labels, they can
1591 be bothered to null out the body too. */
1592 gcc_assert (!SWITCH_LABELS (switch_expr));
1594 /* save old labels, get new ones from body, then restore the old
1595 labels. Save all the things from the switch body to append after. */
1596 saved_labels = gimplify_ctxp->case_labels;
1597 gimplify_ctxp->case_labels = VEC_alloc (tree, heap, 8);
1599 gimplify_stmt (&SWITCH_BODY (switch_expr), &switch_body_seq);
1600 labels = gimplify_ctxp->case_labels;
1601 gimplify_ctxp->case_labels = saved_labels;
1604 while (i < VEC_length (tree, labels))
1606 tree elt = VEC_index (tree, labels, i);
1607 tree low = CASE_LOW (elt);
1608 bool remove_element = FALSE;
1612 /* Discard empty ranges. */
1613 tree high = CASE_HIGH (elt);
1614 if (high && tree_int_cst_lt (high, low))
1615 remove_element = TRUE;
1619 /* The default case must be the last label in the list. */
1620 gcc_assert (!default_case);
1622 remove_element = TRUE;
1626 VEC_ordered_remove (tree, labels, i);
1632 if (!VEC_empty (tree, labels))
1633 sort_case_labels (labels);
1637 tree type = TREE_TYPE (switch_expr);
1639 /* If the switch has no default label, add one, so that we jump
1640 around the switch body. If the labels already cover the whole
1641 range of type, add the default label pointing to one of the
1643 if (type == void_type_node)
1644 type = TREE_TYPE (SWITCH_COND (switch_expr));
1646 && INTEGRAL_TYPE_P (type)
1647 && TYPE_MIN_VALUE (type)
1648 && TYPE_MAX_VALUE (type)
1649 && tree_int_cst_equal (CASE_LOW (VEC_index (tree, labels, 0)),
1650 TYPE_MIN_VALUE (type)))
1652 tree low, high = CASE_HIGH (VEC_index (tree, labels, len - 1));
1654 high = CASE_LOW (VEC_index (tree, labels, len - 1));
1655 if (tree_int_cst_equal (high, TYPE_MAX_VALUE (type)))
1657 for (i = 1; i < len; i++)
1659 high = CASE_LOW (VEC_index (tree, labels, i));
1660 low = CASE_HIGH (VEC_index (tree, labels, i - 1));
1662 low = CASE_LOW (VEC_index (tree, labels, i - 1));
1663 if ((TREE_INT_CST_LOW (low) + 1
1664 != TREE_INT_CST_LOW (high))
1665 || (TREE_INT_CST_HIGH (low)
1666 + (TREE_INT_CST_LOW (high) == 0)
1667 != TREE_INT_CST_HIGH (high)))
1671 default_case = build3 (CASE_LABEL_EXPR, void_type_node,
1672 NULL_TREE, NULL_TREE,
1673 CASE_LABEL (VEC_index (tree,
1682 default_case = build3 (CASE_LABEL_EXPR, void_type_node,
1683 NULL_TREE, NULL_TREE,
1684 create_artificial_label ());
1685 new_default = gimple_build_label (CASE_LABEL (default_case));
1686 gimplify_seq_add_stmt (&switch_body_seq, new_default);
1690 gimple_switch = gimple_build_switch_vec (SWITCH_COND (switch_expr),
1691 default_case, labels);
1692 gimplify_seq_add_stmt (pre_p, gimple_switch);
1693 gimplify_seq_add_seq (pre_p, switch_body_seq);
1694 VEC_free(tree, heap, labels);
1697 gcc_assert (SWITCH_LABELS (switch_expr));
1703 static enum gimplify_status
1704 gimplify_case_label_expr (tree *expr_p, gimple_seq *pre_p)
1706 struct gimplify_ctx *ctxp;
1707 gimple gimple_label;
1709 /* Invalid OpenMP programs can play Duff's Device type games with
1710 #pragma omp parallel. At least in the C front end, we don't
1711 detect such invalid branches until after gimplification. */
1712 for (ctxp = gimplify_ctxp; ; ctxp = ctxp->prev_context)
1713 if (ctxp->case_labels)
1716 gimple_label = gimple_build_label (CASE_LABEL (*expr_p));
1717 VEC_safe_push (tree, heap, ctxp->case_labels, *expr_p);
1718 gimplify_seq_add_stmt (pre_p, gimple_label);
1723 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1727 build_and_jump (tree *label_p)
1729 if (label_p == NULL)
1730 /* If there's nowhere to jump, just fall through. */
1733 if (*label_p == NULL_TREE)
1735 tree label = create_artificial_label ();
1739 return build1 (GOTO_EXPR, void_type_node, *label_p);
1742 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1743 This also involves building a label to jump to and communicating it to
1744 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1746 static enum gimplify_status
1747 gimplify_exit_expr (tree *expr_p)
1749 tree cond = TREE_OPERAND (*expr_p, 0);
1752 expr = build_and_jump (&gimplify_ctxp->exit_label);
1753 expr = build3 (COND_EXPR, void_type_node, cond, expr, NULL_TREE);
1759 /* A helper function to be called via walk_tree. Mark all labels under *TP
1760 as being forced. To be called for DECL_INITIAL of static variables. */
1763 force_labels_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
1767 if (TREE_CODE (*tp) == LABEL_DECL)
1768 FORCED_LABEL (*tp) = 1;
1773 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1774 different from its canonical type, wrap the whole thing inside a
1775 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1778 The canonical type of a COMPONENT_REF is the type of the field being
1779 referenced--unless the field is a bit-field which can be read directly
1780 in a smaller mode, in which case the canonical type is the
1781 sign-appropriate type corresponding to that mode. */
1784 canonicalize_component_ref (tree *expr_p)
1786 tree expr = *expr_p;
1789 gcc_assert (TREE_CODE (expr) == COMPONENT_REF);
1791 if (INTEGRAL_TYPE_P (TREE_TYPE (expr)))
1792 type = TREE_TYPE (get_unwidened (expr, NULL_TREE));
1794 type = TREE_TYPE (TREE_OPERAND (expr, 1));
1796 /* One could argue that all the stuff below is not necessary for
1797 the non-bitfield case and declare it a FE error if type
1798 adjustment would be needed. */
1799 if (TREE_TYPE (expr) != type)
1801 #ifdef ENABLE_TYPES_CHECKING
1802 tree old_type = TREE_TYPE (expr);
1806 /* We need to preserve qualifiers and propagate them from
1808 type_quals = TYPE_QUALS (type)
1809 | TYPE_QUALS (TREE_TYPE (TREE_OPERAND (expr, 0)));
1810 if (TYPE_QUALS (type) != type_quals)
1811 type = build_qualified_type (TYPE_MAIN_VARIANT (type), type_quals);
1813 /* Set the type of the COMPONENT_REF to the underlying type. */
1814 TREE_TYPE (expr) = type;
1816 #ifdef ENABLE_TYPES_CHECKING
1817 /* It is now a FE error, if the conversion from the canonical
1818 type to the original expression type is not useless. */
1819 gcc_assert (useless_type_conversion_p (old_type, type));
1824 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1825 to foo, embed that change in the ADDR_EXPR by converting
1830 where L is the lower bound. For simplicity, only do this for constant
1832 The constraint is that the type of &array[L] is trivially convertible
1836 canonicalize_addr_expr (tree *expr_p)
1838 tree expr = *expr_p;
1839 tree addr_expr = TREE_OPERAND (expr, 0);
1840 tree datype, ddatype, pddatype;
1842 /* We simplify only conversions from an ADDR_EXPR to a pointer type. */
1843 if (!POINTER_TYPE_P (TREE_TYPE (expr))
1844 || TREE_CODE (addr_expr) != ADDR_EXPR)
1847 /* The addr_expr type should be a pointer to an array. */
1848 datype = TREE_TYPE (TREE_TYPE (addr_expr));
1849 if (TREE_CODE (datype) != ARRAY_TYPE)
1852 /* The pointer to element type shall be trivially convertible to
1853 the expression pointer type. */
1854 ddatype = TREE_TYPE (datype);
1855 pddatype = build_pointer_type (ddatype);
1856 if (!useless_type_conversion_p (pddatype, ddatype))
1859 /* The lower bound and element sizes must be constant. */
1860 if (!TYPE_SIZE_UNIT (ddatype)
1861 || TREE_CODE (TYPE_SIZE_UNIT (ddatype)) != INTEGER_CST
1862 || !TYPE_DOMAIN (datype) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype))
1863 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype))) != INTEGER_CST)
1866 /* All checks succeeded. Build a new node to merge the cast. */
1867 *expr_p = build4 (ARRAY_REF, ddatype, TREE_OPERAND (addr_expr, 0),
1868 TYPE_MIN_VALUE (TYPE_DOMAIN (datype)),
1869 NULL_TREE, NULL_TREE);
1870 *expr_p = build1 (ADDR_EXPR, pddatype, *expr_p);
1873 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1874 underneath as appropriate. */
1876 static enum gimplify_status
1877 gimplify_conversion (tree *expr_p)
1880 gcc_assert (CONVERT_EXPR_P (*expr_p));
1882 /* Then strip away all but the outermost conversion. */
1883 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p, 0));
1885 /* And remove the outermost conversion if it's useless. */
1886 if (tree_ssa_useless_type_conversion (*expr_p))
1887 *expr_p = TREE_OPERAND (*expr_p, 0);
1889 /* Attempt to avoid NOP_EXPR by producing reference to a subtype.
1890 For example this fold (subclass *)&A into &A->subclass avoiding
1891 a need for statement. */
1892 if (CONVERT_EXPR_P (*expr_p)
1893 && POINTER_TYPE_P (TREE_TYPE (*expr_p))
1894 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p, 0)))
1895 && (tem = maybe_fold_offset_to_address
1896 (TREE_OPERAND (*expr_p, 0),
1897 integer_zero_node, TREE_TYPE (*expr_p))) != NULL_TREE)
1900 /* If we still have a conversion at the toplevel,
1901 then canonicalize some constructs. */
1902 if (CONVERT_EXPR_P (*expr_p))
1904 tree sub = TREE_OPERAND (*expr_p, 0);
1906 /* If a NOP conversion is changing the type of a COMPONENT_REF
1907 expression, then canonicalize its type now in order to expose more
1908 redundant conversions. */
1909 if (TREE_CODE (sub) == COMPONENT_REF)
1910 canonicalize_component_ref (&TREE_OPERAND (*expr_p, 0));
1912 /* If a NOP conversion is changing a pointer to array of foo
1913 to a pointer to foo, embed that change in the ADDR_EXPR. */
1914 else if (TREE_CODE (sub) == ADDR_EXPR)
1915 canonicalize_addr_expr (expr_p);
1918 /* If we have a conversion to a non-register type force the
1919 use of a VIEW_CONVERT_EXPR instead. */
1920 if (CONVERT_EXPR_P (*expr_p) && !is_gimple_reg_type (TREE_TYPE (*expr_p)))
1921 *expr_p = fold_build1 (VIEW_CONVERT_EXPR, TREE_TYPE (*expr_p),
1922 TREE_OPERAND (*expr_p, 0));
1927 /* Gimplify a VAR_DECL or PARM_DECL. Returns GS_OK if we expanded a
1928 DECL_VALUE_EXPR, and it's worth re-examining things. */
1930 static enum gimplify_status
1931 gimplify_var_or_parm_decl (tree *expr_p)
1933 tree decl = *expr_p;
1935 /* ??? If this is a local variable, and it has not been seen in any
1936 outer BIND_EXPR, then it's probably the result of a duplicate
1937 declaration, for which we've already issued an error. It would
1938 be really nice if the front end wouldn't leak these at all.
1939 Currently the only known culprit is C++ destructors, as seen
1940 in g++.old-deja/g++.jason/binding.C. */
1941 if (TREE_CODE (decl) == VAR_DECL
1942 && !DECL_SEEN_IN_BIND_EXPR_P (decl)
1943 && !TREE_STATIC (decl) && !DECL_EXTERNAL (decl)
1944 && decl_function_context (decl) == current_function_decl)
1946 gcc_assert (errorcount || sorrycount);
1950 /* When within an OpenMP context, notice uses of variables. */
1951 if (gimplify_omp_ctxp && omp_notice_variable (gimplify_omp_ctxp, decl, true))
1954 /* If the decl is an alias for another expression, substitute it now. */
1955 if (DECL_HAS_VALUE_EXPR_P (decl))
1957 *expr_p = unshare_expr (DECL_VALUE_EXPR (decl));
1965 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1969 : min_lval '[' val ']'
1971 | compound_lval '[' val ']'
1972 | compound_lval '.' ID
1974 This is not part of the original SIMPLE definition, which separates
1975 array and member references, but it seems reasonable to handle them
1976 together. Also, this way we don't run into problems with union
1977 aliasing; gcc requires that for accesses through a union to alias, the
1978 union reference must be explicit, which was not always the case when we
1979 were splitting up array and member refs.
1981 PRE_P points to the sequence where side effects that must happen before
1982 *EXPR_P should be stored.
1984 POST_P points to the sequence where side effects that must happen after
1985 *EXPR_P should be stored. */
1987 static enum gimplify_status
1988 gimplify_compound_lval (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
1989 fallback_t fallback)
1992 VEC(tree,heap) *stack;
1993 enum gimplify_status ret = GS_OK, tret;
1996 /* Create a stack of the subexpressions so later we can walk them in
1997 order from inner to outer. */
1998 stack = VEC_alloc (tree, heap, 10);
2000 /* We can handle anything that get_inner_reference can deal with. */
2001 for (p = expr_p; ; p = &TREE_OPERAND (*p, 0))
2004 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
2005 if (TREE_CODE (*p) == INDIRECT_REF)
2006 *p = fold_indirect_ref (*p);
2008 if (handled_component_p (*p))
2010 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
2011 additional COMPONENT_REFs. */
2012 else if ((TREE_CODE (*p) == VAR_DECL || TREE_CODE (*p) == PARM_DECL)
2013 && gimplify_var_or_parm_decl (p) == GS_OK)
2018 VEC_safe_push (tree, heap, stack, *p);
2021 gcc_assert (VEC_length (tree, stack));
2023 /* Now STACK is a stack of pointers to all the refs we've walked through
2024 and P points to the innermost expression.
2026 Java requires that we elaborated nodes in source order. That
2027 means we must gimplify the inner expression followed by each of
2028 the indices, in order. But we can't gimplify the inner
2029 expression until we deal with any variable bounds, sizes, or
2030 positions in order to deal with PLACEHOLDER_EXPRs.
2032 So we do this in three steps. First we deal with the annotations
2033 for any variables in the components, then we gimplify the base,
2034 then we gimplify any indices, from left to right. */
2035 for (i = VEC_length (tree, stack) - 1; i >= 0; i--)
2037 tree t = VEC_index (tree, stack, i);
2039 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
2041 /* Gimplify the low bound and element type size and put them into
2042 the ARRAY_REF. If these values are set, they have already been
2044 if (TREE_OPERAND (t, 2) == NULL_TREE)
2046 tree low = unshare_expr (array_ref_low_bound (t));
2047 if (!is_gimple_min_invariant (low))
2049 TREE_OPERAND (t, 2) = low;
2050 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p,
2051 post_p, is_gimple_formal_tmp_reg,
2053 ret = MIN (ret, tret);
2057 if (!TREE_OPERAND (t, 3))
2059 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (t, 0)));
2060 tree elmt_size = unshare_expr (array_ref_element_size (t));
2061 tree factor = size_int (TYPE_ALIGN_UNIT (elmt_type));
2063 /* Divide the element size by the alignment of the element
2065 elmt_size = size_binop (EXACT_DIV_EXPR, elmt_size, factor);
2067 if (!is_gimple_min_invariant (elmt_size))
2069 TREE_OPERAND (t, 3) = elmt_size;
2070 tret = gimplify_expr (&TREE_OPERAND (t, 3), pre_p,
2071 post_p, is_gimple_formal_tmp_reg,
2073 ret = MIN (ret, tret);
2077 else if (TREE_CODE (t) == COMPONENT_REF)
2079 /* Set the field offset into T and gimplify it. */
2080 if (!TREE_OPERAND (t, 2))
2082 tree offset = unshare_expr (component_ref_field_offset (t));
2083 tree field = TREE_OPERAND (t, 1);
2085 = size_int (DECL_OFFSET_ALIGN (field) / BITS_PER_UNIT);
2087 /* Divide the offset by its alignment. */
2088 offset = size_binop (EXACT_DIV_EXPR, offset, factor);
2090 if (!is_gimple_min_invariant (offset))
2092 TREE_OPERAND (t, 2) = offset;
2093 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p,
2094 post_p, is_gimple_formal_tmp_reg,
2096 ret = MIN (ret, tret);
2102 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
2103 so as to match the min_lval predicate. Failure to do so may result
2104 in the creation of large aggregate temporaries. */
2105 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval,
2106 fallback | fb_lvalue);
2107 ret = MIN (ret, tret);
2109 /* And finally, the indices and operands to BIT_FIELD_REF. During this
2110 loop we also remove any useless conversions. */
2111 for (; VEC_length (tree, stack) > 0; )
2113 tree t = VEC_pop (tree, stack);
2115 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
2117 /* Gimplify the dimension.
2118 Temporary fix for gcc.c-torture/execute/20040313-1.c.
2119 Gimplify non-constant array indices into a temporary
2121 FIXME - The real fix is to gimplify post-modify
2122 expressions into a minimal gimple lvalue. However, that
2123 exposes bugs in alias analysis. The alias analyzer does
2124 not handle &PTR->FIELD very well. Will fix after the
2125 branch is merged into mainline (dnovillo 2004-05-03). */
2126 if (!is_gimple_min_invariant (TREE_OPERAND (t, 1)))
2128 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
2129 is_gimple_formal_tmp_reg, fb_rvalue);
2130 ret = MIN (ret, tret);
2133 else if (TREE_CODE (t) == BIT_FIELD_REF)
2135 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
2136 is_gimple_val, fb_rvalue);
2137 ret = MIN (ret, tret);
2138 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
2139 is_gimple_val, fb_rvalue);
2140 ret = MIN (ret, tret);
2143 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t, 0));
2145 /* The innermost expression P may have originally had
2146 TREE_SIDE_EFFECTS set which would have caused all the outer
2147 expressions in *EXPR_P leading to P to also have had
2148 TREE_SIDE_EFFECTS set. */
2149 recalculate_side_effects (t);
2152 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
2153 if ((fallback & fb_rvalue) && TREE_CODE (*expr_p) == COMPONENT_REF)
2155 canonicalize_component_ref (expr_p);
2156 ret = MIN (ret, GS_OK);
2159 VEC_free (tree, heap, stack);
2164 /* Gimplify the self modifying expression pointed to by EXPR_P
2167 PRE_P points to the list where side effects that must happen before
2168 *EXPR_P should be stored.
2170 POST_P points to the list where side effects that must happen after
2171 *EXPR_P should be stored.
2173 WANT_VALUE is nonzero iff we want to use the value of this expression
2174 in another expression. */
2176 static enum gimplify_status
2177 gimplify_self_mod_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
2180 enum tree_code code;
2181 tree lhs, lvalue, rhs, t1;
2182 gimple_seq post = NULL, *orig_post_p = post_p;
2184 enum tree_code arith_code;
2185 enum gimplify_status ret;
2187 code = TREE_CODE (*expr_p);
2189 gcc_assert (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR
2190 || code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR);
2192 /* Prefix or postfix? */
2193 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
2194 /* Faster to treat as prefix if result is not used. */
2195 postfix = want_value;
2199 /* For postfix, make sure the inner expression's post side effects
2200 are executed after side effects from this expression. */
2204 /* Add or subtract? */
2205 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2206 arith_code = PLUS_EXPR;
2208 arith_code = MINUS_EXPR;
2210 /* Gimplify the LHS into a GIMPLE lvalue. */
2211 lvalue = TREE_OPERAND (*expr_p, 0);
2212 ret = gimplify_expr (&lvalue, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
2213 if (ret == GS_ERROR)
2216 /* Extract the operands to the arithmetic operation. */
2218 rhs = TREE_OPERAND (*expr_p, 1);
2220 /* For postfix operator, we evaluate the LHS to an rvalue and then use
2221 that as the result value and in the postqueue operation. */
2224 ret = gimplify_expr (&lhs, pre_p, post_p, is_gimple_val, fb_rvalue);
2225 if (ret == GS_ERROR)
2229 /* For POINTERs increment, use POINTER_PLUS_EXPR. */
2230 if (POINTER_TYPE_P (TREE_TYPE (lhs)))
2232 rhs = fold_convert (sizetype, rhs);
2233 if (arith_code == MINUS_EXPR)
2234 rhs = fold_build1 (NEGATE_EXPR, TREE_TYPE (rhs), rhs);
2235 arith_code = POINTER_PLUS_EXPR;
2238 t1 = build2 (arith_code, TREE_TYPE (*expr_p), lhs, rhs);
2242 gimplify_assign (lvalue, t1, orig_post_p);
2243 gimplify_seq_add_seq (orig_post_p, post);
2249 *expr_p = build2 (MODIFY_EXPR, TREE_TYPE (lvalue), lvalue, t1);
2255 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
2258 maybe_with_size_expr (tree *expr_p)
2260 tree expr = *expr_p;
2261 tree type = TREE_TYPE (expr);
2264 /* If we've already wrapped this or the type is error_mark_node, we can't do
2266 if (TREE_CODE (expr) == WITH_SIZE_EXPR
2267 || type == error_mark_node)
2270 /* If the size isn't known or is a constant, we have nothing to do. */
2271 size = TYPE_SIZE_UNIT (type);
2272 if (!size || TREE_CODE (size) == INTEGER_CST)
2275 /* Otherwise, make a WITH_SIZE_EXPR. */
2276 size = unshare_expr (size);
2277 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, expr);
2278 *expr_p = build2 (WITH_SIZE_EXPR, type, expr, size);
2282 /* Helper for gimplify_call_expr. Gimplify a single argument *ARG_P
2283 Store any side-effects in PRE_P. CALL_LOCATION is the location of
2286 static enum gimplify_status
2287 gimplify_arg (tree *arg_p, gimple_seq *pre_p, location_t call_location)
2289 bool (*test) (tree);
2292 /* In general, we allow lvalues for function arguments to avoid
2293 extra overhead of copying large aggregates out of even larger
2294 aggregates into temporaries only to copy the temporaries to
2295 the argument list. Make optimizers happy by pulling out to
2296 temporaries those types that fit in registers. */
2297 if (is_gimple_reg_type (TREE_TYPE (*arg_p)))
2298 test = is_gimple_val, fb = fb_rvalue;
2300 test = is_gimple_lvalue, fb = fb_either;
2302 /* If this is a variable sized type, we must remember the size. */
2303 maybe_with_size_expr (arg_p);
2305 /* Make sure arguments have the same location as the function call
2307 protected_set_expr_location (*arg_p, call_location);
2309 /* There is a sequence point before a function call. Side effects in
2310 the argument list must occur before the actual call. So, when
2311 gimplifying arguments, force gimplify_expr to use an internal
2312 post queue which is then appended to the end of PRE_P. */
2313 return gimplify_expr (arg_p, pre_p, NULL, test, fb);
2317 /* Gimplify the CALL_EXPR node *EXPR_P into the GIMPLE sequence PRE_P.
2318 WANT_VALUE is true if the result of the call is desired. */
2320 static enum gimplify_status
2321 gimplify_call_expr (tree *expr_p, gimple_seq *pre_p, bool want_value)
2323 tree fndecl, parms, p;
2324 enum gimplify_status ret;
2327 bool builtin_va_start_p = FALSE;
2329 gcc_assert (TREE_CODE (*expr_p) == CALL_EXPR);
2331 /* For reliable diagnostics during inlining, it is necessary that
2332 every call_expr be annotated with file and line. */
2333 if (! EXPR_HAS_LOCATION (*expr_p))
2334 SET_EXPR_LOCATION (*expr_p, input_location);
2336 /* This may be a call to a builtin function.
2338 Builtin function calls may be transformed into different
2339 (and more efficient) builtin function calls under certain
2340 circumstances. Unfortunately, gimplification can muck things
2341 up enough that the builtin expanders are not aware that certain
2342 transformations are still valid.
2344 So we attempt transformation/gimplification of the call before
2345 we gimplify the CALL_EXPR. At this time we do not manage to
2346 transform all calls in the same manner as the expanders do, but
2347 we do transform most of them. */
2348 fndecl = get_callee_fndecl (*expr_p);
2349 if (fndecl && DECL_BUILT_IN (fndecl))
2351 tree new_tree = fold_call_expr (*expr_p, !want_value);
2353 if (new_tree && new_tree != *expr_p)
2355 /* There was a transformation of this call which computes the
2356 same value, but in a more efficient way. Return and try
2362 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
2363 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_VA_START)
2365 builtin_va_start_p = TRUE;
2366 if (call_expr_nargs (*expr_p) < 2)
2368 error ("too few arguments to function %<va_start%>");
2369 *expr_p = build_empty_stmt ();
2373 if (fold_builtin_next_arg (*expr_p, true))
2375 *expr_p = build_empty_stmt ();
2381 /* There is a sequence point before the call, so any side effects in
2382 the calling expression must occur before the actual call. Force
2383 gimplify_expr to use an internal post queue. */
2384 ret = gimplify_expr (&CALL_EXPR_FN (*expr_p), pre_p, NULL,
2385 is_gimple_call_addr, fb_rvalue);
2387 nargs = call_expr_nargs (*expr_p);
2389 /* Get argument types for verification. */
2390 fndecl = get_callee_fndecl (*expr_p);
2393 parms = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
2394 else if (POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_FN (*expr_p))))
2395 parms = TYPE_ARG_TYPES (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (*expr_p))));
2397 if (fndecl && DECL_ARGUMENTS (fndecl))
2398 p = DECL_ARGUMENTS (fndecl);
2403 for (i = 0; i < nargs && p; i++, p = TREE_CHAIN (p))
2406 /* If the last argument is __builtin_va_arg_pack () and it is not
2407 passed as a named argument, decrease the number of CALL_EXPR
2408 arguments and set instead the CALL_EXPR_VA_ARG_PACK flag. */
2411 && TREE_CODE (CALL_EXPR_ARG (*expr_p, nargs - 1)) == CALL_EXPR)
2413 tree last_arg = CALL_EXPR_ARG (*expr_p, nargs - 1);
2414 tree last_arg_fndecl = get_callee_fndecl (last_arg);
2417 && TREE_CODE (last_arg_fndecl) == FUNCTION_DECL
2418 && DECL_BUILT_IN_CLASS (last_arg_fndecl) == BUILT_IN_NORMAL
2419 && DECL_FUNCTION_CODE (last_arg_fndecl) == BUILT_IN_VA_ARG_PACK)
2421 tree call = *expr_p;
2424 *expr_p = build_call_array (TREE_TYPE (call), CALL_EXPR_FN (call),
2425 nargs, CALL_EXPR_ARGP (call));
2427 /* Copy all CALL_EXPR flags, location and block, except
2428 CALL_EXPR_VA_ARG_PACK flag. */
2429 CALL_EXPR_STATIC_CHAIN (*expr_p) = CALL_EXPR_STATIC_CHAIN (call);
2430 CALL_EXPR_TAILCALL (*expr_p) = CALL_EXPR_TAILCALL (call);
2431 CALL_EXPR_RETURN_SLOT_OPT (*expr_p)
2432 = CALL_EXPR_RETURN_SLOT_OPT (call);
2433 CALL_FROM_THUNK_P (*expr_p) = CALL_FROM_THUNK_P (call);
2434 CALL_CANNOT_INLINE_P (*expr_p) = CALL_CANNOT_INLINE_P (call);
2435 SET_EXPR_LOCUS (*expr_p, EXPR_LOCUS (call));
2436 TREE_BLOCK (*expr_p) = TREE_BLOCK (call);
2438 /* Set CALL_EXPR_VA_ARG_PACK. */
2439 CALL_EXPR_VA_ARG_PACK (*expr_p) = 1;
2443 /* Finally, gimplify the function arguments. */
2446 for (i = (PUSH_ARGS_REVERSED ? nargs - 1 : 0);
2447 PUSH_ARGS_REVERSED ? i >= 0 : i < nargs;
2448 PUSH_ARGS_REVERSED ? i-- : i++)
2450 enum gimplify_status t;
2452 /* Avoid gimplifying the second argument to va_start, which needs to
2453 be the plain PARM_DECL. */
2454 if ((i != 1) || !builtin_va_start_p)
2456 t = gimplify_arg (&CALL_EXPR_ARG (*expr_p, i), pre_p,
2457 EXPR_LOCATION (*expr_p));
2465 /* Try this again in case gimplification exposed something. */
2466 if (ret != GS_ERROR)
2468 tree new_tree = fold_call_expr (*expr_p, !want_value);
2470 if (new_tree && new_tree != *expr_p)
2472 /* There was a transformation of this call which computes the
2473 same value, but in a more efficient way. Return and try
2481 *expr_p = error_mark_node;
2485 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2486 decl. This allows us to eliminate redundant or useless
2487 calls to "const" functions. */
2488 if (TREE_CODE (*expr_p) == CALL_EXPR)
2490 int flags = call_expr_flags (*expr_p);
2491 if (flags & (ECF_CONST | ECF_PURE)
2492 /* An infinite loop is considered a side effect. */
2493 && !(flags & (ECF_LOOPING_CONST_OR_PURE)))
2494 TREE_SIDE_EFFECTS (*expr_p) = 0;
2497 /* If the value is not needed by the caller, emit a new GIMPLE_CALL
2498 and clear *EXPR_P. Otherwise, leave *EXPR_P in its gimplified
2499 form and delegate the creation of a GIMPLE_CALL to
2500 gimplify_modify_expr. This is always possible because when
2501 WANT_VALUE is true, the caller wants the result of this call into
2502 a temporary, which means that we will emit an INIT_EXPR in
2503 internal_get_tmp_var which will then be handled by
2504 gimplify_modify_expr. */
2507 /* The CALL_EXPR in *EXPR_P is already in GIMPLE form, so all we
2508 have to do is replicate it as a GIMPLE_CALL tuple. */
2509 call = gimple_build_call_from_tree (*expr_p);
2510 gimplify_seq_add_stmt (pre_p, call);
2511 *expr_p = NULL_TREE;
2517 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2518 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2520 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2521 condition is true or false, respectively. If null, we should generate
2522 our own to skip over the evaluation of this specific expression.
2524 This function is the tree equivalent of do_jump.
2526 shortcut_cond_r should only be called by shortcut_cond_expr. */
2529 shortcut_cond_r (tree pred, tree *true_label_p, tree *false_label_p)
2531 tree local_label = NULL_TREE;
2532 tree t, expr = NULL;
2534 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2535 retain the shortcut semantics. Just insert the gotos here;
2536 shortcut_cond_expr will append the real blocks later. */
2537 if (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2539 /* Turn if (a && b) into
2541 if (a); else goto no;
2542 if (b) goto yes; else goto no;
2545 if (false_label_p == NULL)
2546 false_label_p = &local_label;
2548 t = shortcut_cond_r (TREE_OPERAND (pred, 0), NULL, false_label_p);
2549 append_to_statement_list (t, &expr);
2551 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2553 append_to_statement_list (t, &expr);
2555 else if (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2557 /* Turn if (a || b) into
2560 if (b) goto yes; else goto no;
2563 if (true_label_p == NULL)
2564 true_label_p = &local_label;
2566 t = shortcut_cond_r (TREE_OPERAND (pred, 0), true_label_p, NULL);
2567 append_to_statement_list (t, &expr);
2569 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2571 append_to_statement_list (t, &expr);
2573 else if (TREE_CODE (pred) == COND_EXPR)
2575 /* As long as we're messing with gotos, turn if (a ? b : c) into
2577 if (b) goto yes; else goto no;
2579 if (c) goto yes; else goto no; */
2580 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (pred, 0),
2581 shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2583 shortcut_cond_r (TREE_OPERAND (pred, 2), true_label_p,
2588 expr = build3 (COND_EXPR, void_type_node, pred,
2589 build_and_jump (true_label_p),
2590 build_and_jump (false_label_p));
2595 t = build1 (LABEL_EXPR, void_type_node, local_label);
2596 append_to_statement_list (t, &expr);
2602 /* Given a conditional expression EXPR with short-circuit boolean
2603 predicates using TRUTH_ANDIF_EXPR or TRUTH_ORIF_EXPR, break the
2604 predicate appart into the equivalent sequence of conditionals. */
2607 shortcut_cond_expr (tree expr)
2609 tree pred = TREE_OPERAND (expr, 0);
2610 tree then_ = TREE_OPERAND (expr, 1);
2611 tree else_ = TREE_OPERAND (expr, 2);
2612 tree true_label, false_label, end_label, t;
2614 tree *false_label_p;
2615 bool emit_end, emit_false, jump_over_else;
2616 bool then_se = then_ && TREE_SIDE_EFFECTS (then_);
2617 bool else_se = else_ && TREE_SIDE_EFFECTS (else_);
2619 /* First do simple transformations. */
2622 /* If there is no 'else', turn (a && b) into if (a) if (b). */
2623 while (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2625 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2626 then_ = shortcut_cond_expr (expr);
2627 then_se = then_ && TREE_SIDE_EFFECTS (then_);
2628 pred = TREE_OPERAND (pred, 0);
2629 expr = build3 (COND_EXPR, void_type_node, pred, then_, NULL_TREE);
2635 /* If there is no 'then', turn
2638 if (a); else if (b); else d. */
2639 while (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2641 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2642 else_ = shortcut_cond_expr (expr);
2643 else_se = else_ && TREE_SIDE_EFFECTS (else_);
2644 pred = TREE_OPERAND (pred, 0);
2645 expr = build3 (COND_EXPR, void_type_node, pred, NULL_TREE, else_);
2649 /* If we're done, great. */
2650 if (TREE_CODE (pred) != TRUTH_ANDIF_EXPR
2651 && TREE_CODE (pred) != TRUTH_ORIF_EXPR)
2654 /* Otherwise we need to mess with gotos. Change
2657 if (a); else goto no;
2660 and recursively gimplify the condition. */
2662 true_label = false_label = end_label = NULL_TREE;
2664 /* If our arms just jump somewhere, hijack those labels so we don't
2665 generate jumps to jumps. */
2668 && TREE_CODE (then_) == GOTO_EXPR
2669 && TREE_CODE (GOTO_DESTINATION (then_)) == LABEL_DECL)
2671 true_label = GOTO_DESTINATION (then_);
2677 && TREE_CODE (else_) == GOTO_EXPR
2678 && TREE_CODE (GOTO_DESTINATION (else_)) == LABEL_DECL)
2680 false_label = GOTO_DESTINATION (else_);
2685 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2687 true_label_p = &true_label;
2689 true_label_p = NULL;
2691 /* The 'else' branch also needs a label if it contains interesting code. */
2692 if (false_label || else_se)
2693 false_label_p = &false_label;
2695 false_label_p = NULL;
2697 /* If there was nothing else in our arms, just forward the label(s). */
2698 if (!then_se && !else_se)
2699 return shortcut_cond_r (pred, true_label_p, false_label_p);
2701 /* If our last subexpression already has a terminal label, reuse it. */
2703 expr = expr_last (else_);
2705 expr = expr_last (then_);
2708 if (expr && TREE_CODE (expr) == LABEL_EXPR)
2709 end_label = LABEL_EXPR_LABEL (expr);
2711 /* If we don't care about jumping to the 'else' branch, jump to the end
2712 if the condition is false. */
2714 false_label_p = &end_label;
2716 /* We only want to emit these labels if we aren't hijacking them. */
2717 emit_end = (end_label == NULL_TREE);
2718 emit_false = (false_label == NULL_TREE);
2720 /* We only emit the jump over the else clause if we have to--if the
2721 then clause may fall through. Otherwise we can wind up with a
2722 useless jump and a useless label at the end of gimplified code,
2723 which will cause us to think that this conditional as a whole
2724 falls through even if it doesn't. If we then inline a function
2725 which ends with such a condition, that can cause us to issue an
2726 inappropriate warning about control reaching the end of a
2727 non-void function. */
2728 jump_over_else = block_may_fallthru (then_);
2730 pred = shortcut_cond_r (pred, true_label_p, false_label_p);
2733 append_to_statement_list (pred, &expr);
2735 append_to_statement_list (then_, &expr);
2740 t = build_and_jump (&end_label);
2741 append_to_statement_list (t, &expr);
2745 t = build1 (LABEL_EXPR, void_type_node, false_label);
2746 append_to_statement_list (t, &expr);
2748 append_to_statement_list (else_, &expr);
2750 if (emit_end && end_label)
2752 t = build1 (LABEL_EXPR, void_type_node, end_label);
2753 append_to_statement_list (t, &expr);
2759 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2762 gimple_boolify (tree expr)
2764 tree type = TREE_TYPE (expr);
2766 if (TREE_CODE (expr) == NE_EXPR
2767 && TREE_CODE (TREE_OPERAND (expr, 0)) == CALL_EXPR
2768 && integer_zerop (TREE_OPERAND (expr, 1)))
2770 tree call = TREE_OPERAND (expr, 0);
2771 tree fn = get_callee_fndecl (call);
2773 /* For __builtin_expect ((long) (x), y) recurse into x as well
2774 if x is truth_value_p. */
2776 && DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2777 && DECL_FUNCTION_CODE (fn) == BUILT_IN_EXPECT
2778 && call_expr_nargs (call) == 2)
2780 tree arg = CALL_EXPR_ARG (call, 0);
2783 if (TREE_CODE (arg) == NOP_EXPR
2784 && TREE_TYPE (arg) == TREE_TYPE (call))
2785 arg = TREE_OPERAND (arg, 0);
2786 if (truth_value_p (TREE_CODE (arg)))
2788 arg = gimple_boolify (arg);
2789 CALL_EXPR_ARG (call, 0)
2790 = fold_convert (TREE_TYPE (call), arg);
2796 if (TREE_CODE (type) == BOOLEAN_TYPE)
2799 switch (TREE_CODE (expr))
2801 case TRUTH_AND_EXPR:
2803 case TRUTH_XOR_EXPR:
2804 case TRUTH_ANDIF_EXPR:
2805 case TRUTH_ORIF_EXPR:
2806 /* Also boolify the arguments of truth exprs. */
2807 TREE_OPERAND (expr, 1) = gimple_boolify (TREE_OPERAND (expr, 1));
2810 case TRUTH_NOT_EXPR:
2811 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2814 case EQ_EXPR: case NE_EXPR:
2815 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2816 /* These expressions always produce boolean results. */
2817 TREE_TYPE (expr) = boolean_type_node;
2821 /* Other expressions that get here must have boolean values, but
2822 might need to be converted to the appropriate mode. */
2823 return fold_convert (boolean_type_node, expr);
2827 /* Given a conditional expression *EXPR_P without side effects, gimplify
2828 its operands. New statements are inserted to PRE_P. */
2830 static enum gimplify_status
2831 gimplify_pure_cond_expr (tree *expr_p, gimple_seq *pre_p)
2833 tree expr = *expr_p, cond;
2834 enum gimplify_status ret, tret;
2835 enum tree_code code;
2837 cond = gimple_boolify (COND_EXPR_COND (expr));
2839 /* We need to handle && and || specially, as their gimplification
2840 creates pure cond_expr, thus leading to an infinite cycle otherwise. */
2841 code = TREE_CODE (cond);
2842 if (code == TRUTH_ANDIF_EXPR)
2843 TREE_SET_CODE (cond, TRUTH_AND_EXPR);
2844 else if (code == TRUTH_ORIF_EXPR)
2845 TREE_SET_CODE (cond, TRUTH_OR_EXPR);
2846 ret = gimplify_expr (&cond, pre_p, NULL, is_gimple_condexpr, fb_rvalue);
2847 COND_EXPR_COND (*expr_p) = cond;
2849 tret = gimplify_expr (&COND_EXPR_THEN (expr), pre_p, NULL,
2850 is_gimple_val, fb_rvalue);
2851 ret = MIN (ret, tret);
2852 tret = gimplify_expr (&COND_EXPR_ELSE (expr), pre_p, NULL,
2853 is_gimple_val, fb_rvalue);
2855 return MIN (ret, tret);
2858 /* Returns true if evaluating EXPR could trap.
2859 EXPR is GENERIC, while tree_could_trap_p can be called
2863 generic_expr_could_trap_p (tree expr)
2867 if (!expr || is_gimple_val (expr))
2870 if (!EXPR_P (expr) || tree_could_trap_p (expr))
2873 n = TREE_OPERAND_LENGTH (expr);
2874 for (i = 0; i < n; i++)
2875 if (generic_expr_could_trap_p (TREE_OPERAND (expr, i)))
2881 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2890 The second form is used when *EXPR_P is of type void.
2892 PRE_P points to the list where side effects that must happen before
2893 *EXPR_P should be stored. */
2895 static enum gimplify_status
2896 gimplify_cond_expr (tree *expr_p, gimple_seq *pre_p, fallback_t fallback)
2898 tree expr = *expr_p;
2899 tree tmp, type, arm1, arm2;
2900 enum gimplify_status ret;
2901 tree label_true, label_false, label_cont;
2902 bool have_then_clause_p, have_else_clause_p;
2904 enum tree_code pred_code;
2905 gimple_seq seq = NULL;
2907 type = TREE_TYPE (expr);
2909 /* If this COND_EXPR has a value, copy the values into a temporary within
2911 if (! VOID_TYPE_P (type))
2915 /* If an rvalue is ok or we do not require an lvalue, avoid creating
2916 an addressable temporary. */
2917 if (((fallback & fb_rvalue)
2918 || !(fallback & fb_lvalue))
2919 && !TREE_ADDRESSABLE (type))
2921 if (gimplify_ctxp->allow_rhs_cond_expr
2922 /* If either branch has side effects or could trap, it can't be
2923 evaluated unconditionally. */
2924 && !TREE_SIDE_EFFECTS (TREE_OPERAND (*expr_p, 1))
2925 && !generic_expr_could_trap_p (TREE_OPERAND (*expr_p, 1))
2926 && !TREE_SIDE_EFFECTS (TREE_OPERAND (*expr_p, 2))
2927 && !generic_expr_could_trap_p (TREE_OPERAND (*expr_p, 2)))
2928 return gimplify_pure_cond_expr (expr_p, pre_p);
2930 result = tmp = create_tmp_var (TREE_TYPE (expr), "iftmp");
2935 tree type = build_pointer_type (TREE_TYPE (expr));
2937 if (TREE_TYPE (TREE_OPERAND (expr, 1)) != void_type_node)
2938 TREE_OPERAND (expr, 1) =
2939 build_fold_addr_expr (TREE_OPERAND (expr, 1));
2941 if (TREE_TYPE (TREE_OPERAND (expr, 2)) != void_type_node)
2942 TREE_OPERAND (expr, 2) =
2943 build_fold_addr_expr (TREE_OPERAND (expr, 2));
2945 tmp = create_tmp_var (type, "iftmp");
2947 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (expr, 0),
2948 TREE_OPERAND (expr, 1), TREE_OPERAND (expr, 2));
2950 result = build_fold_indirect_ref (tmp);
2953 /* Build the then clause, 't1 = a;'. But don't build an assignment
2954 if this branch is void; in C++ it can be, if it's a throw. */
2955 if (TREE_TYPE (TREE_OPERAND (expr, 1)) != void_type_node)
2956 TREE_OPERAND (expr, 1)
2957 = build2 (MODIFY_EXPR, TREE_TYPE (tmp), tmp, TREE_OPERAND (expr, 1));
2959 /* Build the else clause, 't1 = b;'. */
2960 if (TREE_TYPE (TREE_OPERAND (expr, 2)) != void_type_node)
2961 TREE_OPERAND (expr, 2)
2962 = build2 (MODIFY_EXPR, TREE_TYPE (tmp), tmp, TREE_OPERAND (expr, 2));
2964 TREE_TYPE (expr) = void_type_node;
2965 recalculate_side_effects (expr);
2967 /* Move the COND_EXPR to the prequeue. */
2968 gimplify_stmt (&expr, pre_p);
2974 /* Make sure the condition has BOOLEAN_TYPE. */
2975 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2977 /* Break apart && and || conditions. */
2978 if (TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ANDIF_EXPR
2979 || TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ORIF_EXPR)
2981 expr = shortcut_cond_expr (expr);
2983 if (expr != *expr_p)
2987 /* We can't rely on gimplify_expr to re-gimplify the expanded
2988 form properly, as cleanups might cause the target labels to be
2989 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2990 set up a conditional context. */
2991 gimple_push_condition ();
2992 gimplify_stmt (expr_p, &seq);
2993 gimple_pop_condition (pre_p);
2994 gimple_seq_add_seq (pre_p, seq);
3000 /* Now do the normal gimplification. */
3002 /* Gimplify condition. */
3003 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL, is_gimple_condexpr,
3005 if (ret == GS_ERROR)
3007 gcc_assert (TREE_OPERAND (expr, 0) != NULL_TREE);
3009 gimple_push_condition ();
3011 have_then_clause_p = have_else_clause_p = false;
3012 if (TREE_OPERAND (expr, 1) != NULL
3013 && TREE_CODE (TREE_OPERAND (expr, 1)) == GOTO_EXPR
3014 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr, 1))) == LABEL_DECL
3015 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr, 1)))
3016 == current_function_decl)
3017 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
3018 have different locations, otherwise we end up with incorrect
3019 location information on the branches. */
3021 || !EXPR_HAS_LOCATION (expr)
3022 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr, 1))
3023 || EXPR_LOCATION (expr) == EXPR_LOCATION (TREE_OPERAND (expr, 1))))
3025 label_true = GOTO_DESTINATION (TREE_OPERAND (expr, 1));
3026 have_then_clause_p = true;
3029 label_true = create_artificial_label ();
3030 if (TREE_OPERAND (expr, 2) != NULL
3031 && TREE_CODE (TREE_OPERAND (expr, 2)) == GOTO_EXPR
3032 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr, 2))) == LABEL_DECL
3033 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr, 2)))
3034 == current_function_decl)
3035 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
3036 have different locations, otherwise we end up with incorrect
3037 location information on the branches. */
3039 || !EXPR_HAS_LOCATION (expr)
3040 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr, 2))
3041 || EXPR_LOCATION (expr) == EXPR_LOCATION (TREE_OPERAND (expr, 2))))
3043 label_false = GOTO_DESTINATION (TREE_OPERAND (expr, 2));
3044 have_else_clause_p = true;
3047 label_false = create_artificial_label ();
3049 gimple_cond_get_ops_from_tree (COND_EXPR_COND (expr), &pred_code, &arm1,
3052 gimple_cond = gimple_build_cond (pred_code, arm1, arm2, label_true,
3055 gimplify_seq_add_stmt (&seq, gimple_cond);
3056 label_cont = NULL_TREE;
3057 if (!have_then_clause_p)
3059 /* For if (...) {} else { code; } put label_true after
3061 if (TREE_OPERAND (expr, 1) == NULL_TREE
3062 && !have_else_clause_p
3063 && TREE_OPERAND (expr, 2) != NULL_TREE)
3064 label_cont = label_true;
3067 gimplify_seq_add_stmt (&seq, gimple_build_label (label_true));
3068 have_then_clause_p = gimplify_stmt (&TREE_OPERAND (expr, 1), &seq);
3069 /* For if (...) { code; } else {} or
3070 if (...) { code; } else goto label; or
3071 if (...) { code; return; } else { ... }
3072 label_cont isn't needed. */
3073 if (!have_else_clause_p
3074 && TREE_OPERAND (expr, 2) != NULL_TREE
3075 && gimple_seq_may_fallthru (seq))
3078 label_cont = create_artificial_label ();
3080 g = gimple_build_goto (label_cont);
3082 /* GIMPLE_COND's are very low level; they have embedded
3083 gotos. This particular embedded goto should not be marked
3084 with the location of the original COND_EXPR, as it would
3085 correspond to the COND_EXPR's condition, not the ELSE or the
3086 THEN arms. To avoid marking it with the wrong location, flag
3087 it as "no location". */
3088 gimple_set_do_not_emit_location (g);
3090 gimplify_seq_add_stmt (&seq, g);
3094 if (!have_else_clause_p)
3096 gimplify_seq_add_stmt (&seq, gimple_build_label (label_false));
3097 have_else_clause_p = gimplify_stmt (&TREE_OPERAND (expr, 2), &seq);
3100 gimplify_seq_add_stmt (&seq, gimple_build_label (label_cont));
3102 gimple_pop_condition (pre_p);
3103 gimple_seq_add_seq (pre_p, seq);
3105 if (ret == GS_ERROR)
3107 else if (have_then_clause_p || have_else_clause_p)
3111 /* Both arms are empty; replace the COND_EXPR with its predicate. */
3112 expr = TREE_OPERAND (expr, 0);
3113 gimplify_stmt (&expr, pre_p);
3120 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3121 a call to __builtin_memcpy. */
3123 static enum gimplify_status
3124 gimplify_modify_expr_to_memcpy (tree *expr_p, tree size, bool want_value,
3127 tree t, to, to_ptr, from, from_ptr;
3130 to = TREE_OPERAND (*expr_p, 0);
3131 from = TREE_OPERAND (*expr_p, 1);
3133 from_ptr = build_fold_addr_expr (from);
3134 gimplify_arg (&from_ptr, seq_p, EXPR_LOCATION (*expr_p));
3136 to_ptr = build_fold_addr_expr (to);
3137 gimplify_arg (&to_ptr, seq_p, EXPR_LOCATION (*expr_p));
3139 t = implicit_built_in_decls[BUILT_IN_MEMCPY];
3141 gs = gimple_build_call (t, 3, to_ptr, from_ptr, size);
3145 /* tmp = memcpy() */
3146 t = create_tmp_var (TREE_TYPE (to_ptr), NULL);
3147 gimple_call_set_lhs (gs, t);
3148 gimplify_seq_add_stmt (seq_p, gs);
3150 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (to), t);
3154 gimplify_seq_add_stmt (seq_p, gs);
3159 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3160 a call to __builtin_memset. In this case we know that the RHS is
3161 a CONSTRUCTOR with an empty element list. */
3163 static enum gimplify_status
3164 gimplify_modify_expr_to_memset (tree *expr_p, tree size, bool want_value,
3167 tree t, from, to, to_ptr;
3170 /* Assert our assumptions, to abort instead of producing wrong code
3171 silently if they are not met. Beware that the RHS CONSTRUCTOR might
3172 not be immediately exposed. */
3173 from = TREE_OPERAND (*expr_p, 1);
3174 if (TREE_CODE (from) == WITH_SIZE_EXPR)
3175 from = TREE_OPERAND (from, 0);
3177 gcc_assert (TREE_CODE (from) == CONSTRUCTOR
3178 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (from)));
3181 to = TREE_OPERAND (*expr_p, 0);
3183 to_ptr = build_fold_addr_expr (to);
3184 gimplify_arg (&to_ptr, seq_p, EXPR_LOCATION (*expr_p));
3185 t = implicit_built_in_decls[BUILT_IN_MEMSET];
3187 gs = gimple_build_call (t, 3, to_ptr, integer_zero_node, size);
3191 /* tmp = memset() */
3192 t = create_tmp_var (TREE_TYPE (to_ptr), NULL);
3193 gimple_call_set_lhs (gs, t);
3194 gimplify_seq_add_stmt (seq_p, gs);
3196 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (to), t);
3200 gimplify_seq_add_stmt (seq_p, gs);
3205 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
3206 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
3207 assignment. Returns non-null if we detect a potential overlap. */
3209 struct gimplify_init_ctor_preeval_data
3211 /* The base decl of the lhs object. May be NULL, in which case we
3212 have to assume the lhs is indirect. */
3215 /* The alias set of the lhs object. */
3216 alias_set_type lhs_alias_set;
3220 gimplify_init_ctor_preeval_1 (tree *tp, int *walk_subtrees, void *xdata)
3222 struct gimplify_init_ctor_preeval_data *data
3223 = (struct gimplify_init_ctor_preeval_data *) xdata;
3226 /* If we find the base object, obviously we have overlap. */
3227 if (data->lhs_base_decl == t)
3230 /* If the constructor component is indirect, determine if we have a
3231 potential overlap with the lhs. The only bits of information we
3232 have to go on at this point are addressability and alias sets. */
3233 if (TREE_CODE (t) == INDIRECT_REF
3234 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
3235 && alias_sets_conflict_p (data->lhs_alias_set, get_alias_set (t)))
3238 /* If the constructor component is a call, determine if it can hide a
3239 potential overlap with the lhs through an INDIRECT_REF like above. */
3240 if (TREE_CODE (t) == CALL_EXPR)
3242 tree type, fntype = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (t)));
3244 for (type = TYPE_ARG_TYPES (fntype); type; type = TREE_CHAIN (type))
3245 if (POINTER_TYPE_P (TREE_VALUE (type))
3246 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
3247 && alias_sets_conflict_p (data->lhs_alias_set,
3249 (TREE_TYPE (TREE_VALUE (type)))))
3253 if (IS_TYPE_OR_DECL_P (t))
3258 /* A subroutine of gimplify_init_constructor. Pre-evaluate EXPR,
3259 force values that overlap with the lhs (as described by *DATA)
3260 into temporaries. */
3263 gimplify_init_ctor_preeval (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
3264 struct gimplify_init_ctor_preeval_data *data)
3266 enum gimplify_status one;
3268 /* If the value is constant, then there's nothing to pre-evaluate. */
3269 if (TREE_CONSTANT (*expr_p))
3271 /* Ensure it does not have side effects, it might contain a reference to
3272 the object we're initializing. */
3273 gcc_assert (!TREE_SIDE_EFFECTS (*expr_p));
3277 /* If the type has non-trivial constructors, we can't pre-evaluate. */
3278 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p)))
3281 /* Recurse for nested constructors. */
3282 if (TREE_CODE (*expr_p) == CONSTRUCTOR)
3284 unsigned HOST_WIDE_INT ix;
3285 constructor_elt *ce;
3286 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (*expr_p);
3288 for (ix = 0; VEC_iterate (constructor_elt, v, ix, ce); ix++)
3289 gimplify_init_ctor_preeval (&ce->value, pre_p, post_p, data);
3294 /* If this is a variable sized type, we must remember the size. */
3295 maybe_with_size_expr (expr_p);
3297 /* Gimplify the constructor element to something appropriate for the rhs
3298 of a MODIFY_EXPR. Given that we know the LHS is an aggregate, we know
3299 the gimplifier will consider this a store to memory. Doing this
3300 gimplification now means that we won't have to deal with complicated
3301 language-specific trees, nor trees like SAVE_EXPR that can induce
3302 exponential search behavior. */
3303 one = gimplify_expr (expr_p, pre_p, post_p, is_gimple_mem_rhs, fb_rvalue);
3304 if (one == GS_ERROR)
3310 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
3311 with the lhs, since "a = { .x=a }" doesn't make sense. This will
3312 always be true for all scalars, since is_gimple_mem_rhs insists on a
3313 temporary variable for them. */
3314 if (DECL_P (*expr_p))
3317 /* If this is of variable size, we have no choice but to assume it doesn't
3318 overlap since we can't make a temporary for it. */
3319 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (*expr_p))) != INTEGER_CST)
3322 /* Otherwise, we must search for overlap ... */
3323 if (!walk_tree (expr_p, gimplify_init_ctor_preeval_1, data, NULL))
3326 /* ... and if found, force the value into a temporary. */
3327 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
3330 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
3331 a RANGE_EXPR in a CONSTRUCTOR for an array.
3335 object[var] = value;
3342 We increment var _after_ the loop exit check because we might otherwise
3343 fail if upper == TYPE_MAX_VALUE (type for upper).
3345 Note that we never have to deal with SAVE_EXPRs here, because this has
3346 already been taken care of for us, in gimplify_init_ctor_preeval(). */
3348 static void gimplify_init_ctor_eval (tree, VEC(constructor_elt,gc) *,
3349 gimple_seq *, bool);
3352 gimplify_init_ctor_eval_range (tree object, tree lower, tree upper,
3353 tree value, tree array_elt_type,
3354 gimple_seq *pre_p, bool cleared)
3356 tree loop_entry_label, loop_exit_label, fall_thru_label;
3357 tree var, var_type, cref, tmp;
3359 loop_entry_label = create_artificial_label ();
3360 loop_exit_label = create_artificial_label ();
3361 fall_thru_label = create_artificial_label ();
3363 /* Create and initialize the index variable. */
3364 var_type = TREE_TYPE (upper);
3365 var = create_tmp_var (var_type, NULL);
3366 gimplify_seq_add_stmt (pre_p, gimple_build_assign (var, lower));
3368 /* Add the loop entry label. */
3369 gimplify_seq_add_stmt (pre_p, gimple_build_label (loop_entry_label));
3371 /* Build the reference. */
3372 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
3373 var, NULL_TREE, NULL_TREE);
3375 /* If we are a constructor, just call gimplify_init_ctor_eval to do
3376 the store. Otherwise just assign value to the reference. */
3378 if (TREE_CODE (value) == CONSTRUCTOR)
3379 /* NB we might have to call ourself recursively through
3380 gimplify_init_ctor_eval if the value is a constructor. */
3381 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
3384 gimplify_seq_add_stmt (pre_p, gimple_build_assign (cref, value));
3386 /* We exit the loop when the index var is equal to the upper bound. */
3387 gimplify_seq_add_stmt (pre_p,
3388 gimple_build_cond (EQ_EXPR, var, upper,
3389 loop_exit_label, fall_thru_label));
3391 gimplify_seq_add_stmt (pre_p, gimple_build_label (fall_thru_label));
3393 /* Otherwise, increment the index var... */
3394 tmp = build2 (PLUS_EXPR, var_type, var,
3395 fold_convert (var_type, integer_one_node));
3396 gimplify_seq_add_stmt (pre_p, gimple_build_assign (var, tmp));
3398 /* ...and jump back to the loop entry. */
3399 gimplify_seq_add_stmt (pre_p, gimple_build_goto (loop_entry_label));
3401 /* Add the loop exit label. */
3402 gimplify_seq_add_stmt (pre_p, gimple_build_label (loop_exit_label));
3405 /* Return true if FDECL is accessing a field that is zero sized. */
3408 zero_sized_field_decl (const_tree fdecl)
3410 if (TREE_CODE (fdecl) == FIELD_DECL && DECL_SIZE (fdecl)
3411 && integer_zerop (DECL_SIZE (fdecl)))
3416 /* Return true if TYPE is zero sized. */
3419 zero_sized_type (const_tree type)
3421 if (AGGREGATE_TYPE_P (type) && TYPE_SIZE (type)
3422 && integer_zerop (TYPE_SIZE (type)))
3427 /* A subroutine of gimplify_init_constructor. Generate individual
3428 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
3429 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
3430 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
3434 gimplify_init_ctor_eval (tree object, VEC(constructor_elt,gc) *elts,
3435 gimple_seq *pre_p, bool cleared)
3437 tree array_elt_type = NULL;
3438 unsigned HOST_WIDE_INT ix;
3439 tree purpose, value;
3441 if (TREE_CODE (TREE_TYPE (object)) == ARRAY_TYPE)
3442 array_elt_type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object)));
3444 FOR_EACH_CONSTRUCTOR_ELT (elts, ix, purpose, value)
3448 /* NULL values are created above for gimplification errors. */
3452 if (cleared && initializer_zerop (value))
3455 /* ??? Here's to hoping the front end fills in all of the indices,
3456 so we don't have to figure out what's missing ourselves. */
3457 gcc_assert (purpose);
3459 /* Skip zero-sized fields, unless value has side-effects. This can
3460 happen with calls to functions returning a zero-sized type, which
3461 we shouldn't discard. As a number of downstream passes don't
3462 expect sets of zero-sized fields, we rely on the gimplification of
3463 the MODIFY_EXPR we make below to drop the assignment statement. */
3464 if (! TREE_SIDE_EFFECTS (value) && zero_sized_field_decl (purpose))
3467 /* If we have a RANGE_EXPR, we have to build a loop to assign the
3469 if (TREE_CODE (purpose) == RANGE_EXPR)
3471 tree lower = TREE_OPERAND (purpose, 0);
3472 tree upper = TREE_OPERAND (purpose, 1);
3474 /* If the lower bound is equal to upper, just treat it as if
3475 upper was the index. */
3476 if (simple_cst_equal (lower, upper))
3480 gimplify_init_ctor_eval_range (object, lower, upper, value,
3481 array_elt_type, pre_p, cleared);
3488 /* Do not use bitsizetype for ARRAY_REF indices. */
3489 if (TYPE_DOMAIN (TREE_TYPE (object)))
3490 purpose = fold_convert (TREE_TYPE (TYPE_DOMAIN (TREE_TYPE (object))),
3492 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
3493 purpose, NULL_TREE, NULL_TREE);
3497 gcc_assert (TREE_CODE (purpose) == FIELD_DECL);
3498 cref = build3 (COMPONENT_REF, TREE_TYPE (purpose),
3499 unshare_expr (object), purpose, NULL_TREE);
3502 if (TREE_CODE (value) == CONSTRUCTOR
3503 && TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE)
3504 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
3508 tree init = build2 (INIT_EXPR, TREE_TYPE (cref), cref, value);
3509 gimplify_and_add (init, pre_p);
3516 /* Returns the appropriate RHS predicate for this LHS. */
3519 rhs_predicate_for (tree lhs)
3521 if (is_gimple_formal_tmp_var (lhs))
3522 return is_gimple_formal_tmp_or_call_rhs;
3523 else if (is_gimple_reg (lhs))
3524 return is_gimple_reg_or_call_rhs;
3526 return is_gimple_mem_or_call_rhs;
3530 /* A subroutine of gimplify_modify_expr. Break out elements of a
3531 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
3533 Note that we still need to clear any elements that don't have explicit
3534 initializers, so if not all elements are initialized we keep the
3535 original MODIFY_EXPR, we just remove all of the constructor elements.
3537 If NOTIFY_TEMP_CREATION is true, do not gimplify, just return
3538 GS_ERROR if we would have to create a temporary when gimplifying
3539 this constructor. Otherwise, return GS_OK.
3541 If NOTIFY_TEMP_CREATION is false, just do the gimplification. */
3543 static enum gimplify_status
3544 gimplify_init_constructor (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
3545 bool want_value, bool notify_temp_creation)
3548 tree ctor = TREE_OPERAND (*expr_p, 1);
3549 tree type = TREE_TYPE (ctor);
3550 enum gimplify_status ret;
3551 VEC(constructor_elt,gc) *elts;
3553 if (TREE_CODE (ctor) != CONSTRUCTOR)
3554 return GS_UNHANDLED;
3556 if (!notify_temp_creation)
3558 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3559 is_gimple_lvalue, fb_lvalue);
3560 if (ret == GS_ERROR)
3564 object = TREE_OPERAND (*expr_p, 0);
3565 elts = CONSTRUCTOR_ELTS (ctor);
3568 switch (TREE_CODE (type))
3572 case QUAL_UNION_TYPE:
3575 struct gimplify_init_ctor_preeval_data preeval_data;
3576 HOST_WIDE_INT num_type_elements, num_ctor_elements;
3577 HOST_WIDE_INT num_nonzero_elements;
3578 bool cleared, valid_const_initializer;
3580 /* Aggregate types must lower constructors to initialization of
3581 individual elements. The exception is that a CONSTRUCTOR node
3582 with no elements indicates zero-initialization of the whole. */
3583 if (VEC_empty (constructor_elt, elts))
3585 if (notify_temp_creation)
3590 /* Fetch information about the constructor to direct later processing.
3591 We might want to make static versions of it in various cases, and
3592 can only do so if it known to be a valid constant initializer. */
3593 valid_const_initializer
3594 = categorize_ctor_elements (ctor, &num_nonzero_elements,
3595 &num_ctor_elements, &cleared);
3597 /* If a const aggregate variable is being initialized, then it
3598 should never be a lose to promote the variable to be static. */
3599 if (valid_const_initializer
3600 && num_nonzero_elements > 1
3601 && TREE_READONLY (object)
3602 && TREE_CODE (object) == VAR_DECL
3603 && (flag_merge_constants >= 2 || !TREE_ADDRESSABLE (object)))
3605 if (notify_temp_creation)
3607 DECL_INITIAL (object) = ctor;
3608 TREE_STATIC (object) = 1;
3609 if (!DECL_NAME (object))
3610 DECL_NAME (object) = create_tmp_var_name ("C");
3611 walk_tree (&DECL_INITIAL (object), force_labels_r, NULL, NULL);
3613 /* ??? C++ doesn't automatically append a .<number> to the
3614 assembler name, and even when it does, it looks a FE private
3615 data structures to figure out what that number should be,
3616 which are not set for this variable. I suppose this is
3617 important for local statics for inline functions, which aren't
3618 "local" in the object file sense. So in order to get a unique
3619 TU-local symbol, we must invoke the lhd version now. */
3620 lhd_set_decl_assembler_name (object);
3622 *expr_p = NULL_TREE;
3626 /* If there are "lots" of initialized elements, even discounting
3627 those that are not address constants (and thus *must* be
3628 computed at runtime), then partition the constructor into
3629 constant and non-constant parts. Block copy the constant
3630 parts in, then generate code for the non-constant parts. */
3631 /* TODO. There's code in cp/typeck.c to do this. */
3633 num_type_elements = count_type_elements (type, true);
3635 /* If count_type_elements could not determine number of type elements
3636 for a constant-sized object, assume clearing is needed.
3637 Don't do this for variable-sized objects, as store_constructor
3638 will ignore the clearing of variable-sized objects. */
3639 if (num_type_elements < 0 && int_size_in_bytes (type) >= 0)
3641 /* If there are "lots" of zeros, then block clear the object first. */
3642 else if (num_type_elements - num_nonzero_elements
3643 > CLEAR_RATIO (optimize_function_for_speed_p (cfun))
3644 && num_nonzero_elements < num_type_elements/4)
3646 /* ??? This bit ought not be needed. For any element not present
3647 in the initializer, we should simply set them to zero. Except
3648 we'd need to *find* the elements that are not present, and that
3649 requires trickery to avoid quadratic compile-time behavior in
3650 large cases or excessive memory use in small cases. */
3651 else if (num_ctor_elements < num_type_elements)
3654 /* If there are "lots" of initialized elements, and all of them
3655 are valid address constants, then the entire initializer can
3656 be dropped to memory, and then memcpy'd out. Don't do this
3657 for sparse arrays, though, as it's more efficient to follow
3658 the standard CONSTRUCTOR behavior of memset followed by
3659 individual element initialization. Also don't do this for small
3660 all-zero initializers (which aren't big enough to merit
3661 clearing), and don't try to make bitwise copies of
3662 TREE_ADDRESSABLE types. */
3663 if (valid_const_initializer
3664 && !(cleared || num_nonzero_elements == 0)
3665 && !TREE_ADDRESSABLE (type))
3667 HOST_WIDE_INT size = int_size_in_bytes (type);
3670 /* ??? We can still get unbounded array types, at least
3671 from the C++ front end. This seems wrong, but attempt
3672 to work around it for now. */
3675 size = int_size_in_bytes (TREE_TYPE (object));
3677 TREE_TYPE (ctor) = type = TREE_TYPE (object);
3680 /* Find the maximum alignment we can assume for the object. */
3681 /* ??? Make use of DECL_OFFSET_ALIGN. */
3682 if (DECL_P (object))
3683 align = DECL_ALIGN (object);
3685 align = TYPE_ALIGN (type);
3688 && num_nonzero_elements > 1
3689 && !can_move_by_pieces (size, align))
3693 if (notify_temp_creation)
3696 new_tree = create_tmp_var_raw (type, "C");
3698 gimple_add_tmp_var (new_tree);
3699 TREE_STATIC (new_tree) = 1;
3700 TREE_READONLY (new_tree) = 1;
3701 DECL_INITIAL (new_tree) = ctor;
3702 if (align > DECL_ALIGN (new_tree))
3704 DECL_ALIGN (new_tree) = align;
3705 DECL_USER_ALIGN (new_tree) = 1;
3707 walk_tree (&DECL_INITIAL (new_tree), force_labels_r, NULL, NULL);
3709 TREE_OPERAND (*expr_p, 1) = new_tree;
3711 /* This is no longer an assignment of a CONSTRUCTOR, but
3712 we still may have processing to do on the LHS. So
3713 pretend we didn't do anything here to let that happen. */
3714 return GS_UNHANDLED;
3718 /* If the target is volatile, we have non-zero elements and more than
3719 one field to assign, initialize the target from a temporary. */
3720 if (TREE_THIS_VOLATILE (object)
3721 && !TREE_ADDRESSABLE (type)
3722 && num_nonzero_elements > 0
3723 && VEC_length (constructor_elt, elts) > 1)
3725 tree temp = create_tmp_var (TYPE_MAIN_VARIANT (type), NULL);
3726 TREE_OPERAND (*expr_p, 0) = temp;
3727 *expr_p = build2 (COMPOUND_EXPR, TREE_TYPE (*expr_p),
3729 build2 (MODIFY_EXPR, void_type_node,
3734 if (notify_temp_creation)
3737 /* If there are nonzero elements, pre-evaluate to capture elements
3738 overlapping with the lhs into temporaries. We must do this before
3739 clearing to fetch the values before they are zeroed-out. */
3740 if (num_nonzero_elements > 0)
3742 preeval_data.lhs_base_decl = get_base_address (object);
3743 if (!DECL_P (preeval_data.lhs_base_decl))
3744 preeval_data.lhs_base_decl = NULL;
3745 preeval_data.lhs_alias_set = get_alias_set (object);
3747 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p, 1),
3748 pre_p, post_p, &preeval_data);
3753 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3754 Note that we still have to gimplify, in order to handle the
3755 case of variable sized types. Avoid shared tree structures. */
3756 CONSTRUCTOR_ELTS (ctor) = NULL;
3757 TREE_SIDE_EFFECTS (ctor) = 0;
3758 object = unshare_expr (object);
3759 gimplify_stmt (expr_p, pre_p);
3762 /* If we have not block cleared the object, or if there are nonzero
3763 elements in the constructor, add assignments to the individual
3764 scalar fields of the object. */
3765 if (!cleared || num_nonzero_elements > 0)
3766 gimplify_init_ctor_eval (object, elts, pre_p, cleared);
3768 *expr_p = NULL_TREE;
3776 if (notify_temp_creation)
3779 /* Extract the real and imaginary parts out of the ctor. */
3780 gcc_assert (VEC_length (constructor_elt, elts) == 2);
3781 r = VEC_index (constructor_elt, elts, 0)->value;
3782 i = VEC_index (constructor_elt, elts, 1)->value;
3783 if (r == NULL || i == NULL)
3785 tree zero = fold_convert (TREE_TYPE (type), integer_zero_node);
3792 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3793 represent creation of a complex value. */
3794 if (TREE_CONSTANT (r) && TREE_CONSTANT (i))
3796 ctor = build_complex (type, r, i);
3797 TREE_OPERAND (*expr_p, 1) = ctor;
3801 ctor = build2 (COMPLEX_EXPR, type, r, i);
3802 TREE_OPERAND (*expr_p, 1) = ctor;
3803 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 1),
3806 rhs_predicate_for (TREE_OPERAND (*expr_p, 0)),
3814 unsigned HOST_WIDE_INT ix;
3815 constructor_elt *ce;
3817 if (notify_temp_creation)
3820 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3821 if (TREE_CONSTANT (ctor))
3823 bool constant_p = true;
3826 /* Even when ctor is constant, it might contain non-*_CST
3827 elements, such as addresses or trapping values like
3828 1.0/0.0 - 1.0/0.0. Such expressions don't belong
3829 in VECTOR_CST nodes. */
3830 FOR_EACH_CONSTRUCTOR_VALUE (elts, ix, value)
3831 if (!CONSTANT_CLASS_P (value))
3839 TREE_OPERAND (*expr_p, 1) = build_vector_from_ctor (type, elts);
3843 /* Don't reduce an initializer constant even if we can't
3844 make a VECTOR_CST. It won't do anything for us, and it'll
3845 prevent us from representing it as a single constant. */
3846 if (initializer_constant_valid_p (ctor, type))
3849 TREE_CONSTANT (ctor) = 0;
3852 /* Vector types use CONSTRUCTOR all the way through gimple
3853 compilation as a general initializer. */
3854 for (ix = 0; VEC_iterate (constructor_elt, elts, ix, ce); ix++)
3856 enum gimplify_status tret;
3857 tret = gimplify_expr (&ce->value, pre_p, post_p, is_gimple_val,
3859 if (tret == GS_ERROR)
3862 if (!is_gimple_reg (TREE_OPERAND (*expr_p, 0)))
3863 TREE_OPERAND (*expr_p, 1) = get_formal_tmp_var (ctor, pre_p);
3868 /* So how did we get a CONSTRUCTOR for a scalar type? */
3872 if (ret == GS_ERROR)
3874 else if (want_value)
3881 /* If we have gimplified both sides of the initializer but have
3882 not emitted an assignment, do so now. */
3885 tree lhs = TREE_OPERAND (*expr_p, 0);
3886 tree rhs = TREE_OPERAND (*expr_p, 1);
3887 gimple init = gimple_build_assign (lhs, rhs);
3888 gimplify_seq_add_stmt (pre_p, init);
3896 /* Given a pointer value OP0, return a simplified version of an
3897 indirection through OP0, or NULL_TREE if no simplification is
3898 possible. Note that the resulting type may be different from
3899 the type pointed to in the sense that it is still compatible
3900 from the langhooks point of view. */
3903 gimple_fold_indirect_ref (tree t)
3905 tree type = TREE_TYPE (TREE_TYPE (t));
3909 STRIP_USELESS_TYPE_CONVERSION (sub);
3910 subtype = TREE_TYPE (sub);
3911 if (!POINTER_TYPE_P (subtype))
3914 if (TREE_CODE (sub) == ADDR_EXPR)
3916 tree op = TREE_OPERAND (sub, 0);
3917 tree optype = TREE_TYPE (op);
3919 if (useless_type_conversion_p (type, optype))
3922 /* *(foo *)&fooarray => fooarray[0] */
3923 if (TREE_CODE (optype) == ARRAY_TYPE
3924 && TREE_CODE (TYPE_SIZE (TREE_TYPE (optype))) == INTEGER_CST
3925 && useless_type_conversion_p (type, TREE_TYPE (optype)))
3927 tree type_domain = TYPE_DOMAIN (optype);
3928 tree min_val = size_zero_node;
3929 if (type_domain && TYPE_MIN_VALUE (type_domain))
3930 min_val = TYPE_MIN_VALUE (type_domain);
3931 if (TREE_CODE (min_val) == INTEGER_CST)
3932 return build4 (ARRAY_REF, type, op, min_val, NULL_TREE, NULL_TREE);
3936 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
3937 if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
3938 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (subtype)))) == INTEGER_CST
3939 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (subtype))))
3942 tree min_val = size_zero_node;
3944 sub = gimple_fold_indirect_ref (sub);
3946 sub = build1 (INDIRECT_REF, TREE_TYPE (subtype), osub);
3947 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
3948 if (type_domain && TYPE_MIN_VALUE (type_domain))
3949 min_val = TYPE_MIN_VALUE (type_domain);
3950 if (TREE_CODE (min_val) == INTEGER_CST)
3951 return build4 (ARRAY_REF, type, sub, min_val, NULL_TREE, NULL_TREE);
3957 /* Given a pointer value OP0, return a simplified version of an
3958 indirection through OP0, or NULL_TREE if no simplification is
3959 possible. This may only be applied to a rhs of an expression.
3960 Note that the resulting type may be different from the type pointed
3961 to in the sense that it is still compatible from the langhooks
3965 gimple_fold_indirect_ref_rhs (tree t)
3967 return gimple_fold_indirect_ref (t);
3970 /* Subroutine of gimplify_modify_expr to do simplifications of
3971 MODIFY_EXPRs based on the code of the RHS. We loop for as long as
3972 something changes. */
3974 static enum gimplify_status
3975 gimplify_modify_expr_rhs (tree *expr_p, tree *from_p, tree *to_p,
3976 gimple_seq *pre_p, gimple_seq *post_p,
3979 enum gimplify_status ret = GS_OK;
3981 while (ret != GS_UNHANDLED)
3982 switch (TREE_CODE (*from_p))
3985 /* If we're assigning from a read-only variable initialized with
3986 a constructor, do the direct assignment from the constructor,
3987 but only if neither source nor target are volatile since this
3988 latter assignment might end up being done on a per-field basis. */
3989 if (DECL_INITIAL (*from_p)
3990 && TREE_READONLY (*from_p)
3991 && !TREE_THIS_VOLATILE (*from_p)
3992 && !TREE_THIS_VOLATILE (*to_p)
3993 && TREE_CODE (DECL_INITIAL (*from_p)) == CONSTRUCTOR)
3995 tree old_from = *from_p;
3997 /* Move the constructor into the RHS. */
3998 *from_p = unshare_expr (DECL_INITIAL (*from_p));
4000 /* Let's see if gimplify_init_constructor will need to put
4001 it in memory. If so, revert the change. */
4002 ret = gimplify_init_constructor (expr_p, NULL, NULL, false, true);
4003 if (ret == GS_ERROR)
4018 /* If we have code like
4022 where the type of "x" is a (possibly cv-qualified variant
4023 of "A"), treat the entire expression as identical to "x".
4024 This kind of code arises in C++ when an object is bound
4025 to a const reference, and if "x" is a TARGET_EXPR we want
4026 to take advantage of the optimization below. */
4027 tree t = gimple_fold_indirect_ref_rhs (TREE_OPERAND (*from_p, 0));
4040 /* If we are initializing something from a TARGET_EXPR, strip the
4041 TARGET_EXPR and initialize it directly, if possible. This can't
4042 be done if the initializer is void, since that implies that the
4043 temporary is set in some non-trivial way.
4045 ??? What about code that pulls out the temp and uses it
4046 elsewhere? I think that such code never uses the TARGET_EXPR as
4047 an initializer. If I'm wrong, we'll die because the temp won't
4048 have any RTL. In that case, I guess we'll need to replace
4049 references somehow. */
4050 tree init = TARGET_EXPR_INITIAL (*from_p);
4053 && !VOID_TYPE_P (TREE_TYPE (init)))
4064 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
4066 gimplify_compound_expr (from_p, pre_p, true);
4071 /* If we're initializing from a CONSTRUCTOR, break this into
4072 individual MODIFY_EXPRs. */
4073 return gimplify_init_constructor (expr_p, pre_p, post_p, want_value,
4077 /* If we're assigning to a non-register type, push the assignment
4078 down into the branches. This is mandatory for ADDRESSABLE types,
4079 since we cannot generate temporaries for such, but it saves a
4080 copy in other cases as well. */
4081 if (!is_gimple_reg_type (TREE_TYPE (*from_p)))
4083 /* This code should mirror the code in gimplify_cond_expr. */
4084 enum tree_code code = TREE_CODE (*expr_p);
4085 tree cond = *from_p;
4086 tree result = *to_p;
4088 ret = gimplify_expr (&result, pre_p, post_p,
4089 is_gimple_lvalue, fb_lvalue);
4090 if (ret != GS_ERROR)
4093 if (TREE_TYPE (TREE_OPERAND (cond, 1)) != void_type_node)
4094 TREE_OPERAND (cond, 1)
4095 = build2 (code, void_type_node, result,
4096 TREE_OPERAND (cond, 1));
4097 if (TREE_TYPE (TREE_OPERAND (cond, 2)) != void_type_node)
4098 TREE_OPERAND (cond, 2)
4099 = build2 (code, void_type_node, unshare_expr (result),
4100 TREE_OPERAND (cond, 2));
4102 TREE_TYPE (cond) = void_type_node;
4103 recalculate_side_effects (cond);
4107 gimplify_and_add (cond, pre_p);
4108 *expr_p = unshare_expr (result);
4119 /* For calls that return in memory, give *to_p as the CALL_EXPR's
4120 return slot so that we don't generate a temporary. */
4121 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p)
4122 && aggregate_value_p (*from_p, *from_p))
4126 if (!(rhs_predicate_for (*to_p))(*from_p))
4127 /* If we need a temporary, *to_p isn't accurate. */
4129 else if (TREE_CODE (*to_p) == RESULT_DECL
4130 && DECL_NAME (*to_p) == NULL_TREE
4131 && needs_to_live_in_memory (*to_p))
4132 /* It's OK to use the return slot directly unless it's an NRV. */
4134 else if (is_gimple_reg_type (TREE_TYPE (*to_p))
4135 || (DECL_P (*to_p) && DECL_REGISTER (*to_p)))
4136 /* Don't force regs into memory. */
4138 else if (TREE_CODE (*to_p) == VAR_DECL
4139 && DECL_GIMPLE_FORMAL_TEMP_P (*to_p))
4140 /* Don't use the original target if it's a formal temp; we
4141 don't want to take their addresses. */
4143 else if (TREE_CODE (*expr_p) == INIT_EXPR)
4144 /* It's OK to use the target directly if it's being
4147 else if (!is_gimple_non_addressable (*to_p))
4148 /* Don't use the original target if it's already addressable;
4149 if its address escapes, and the called function uses the
4150 NRV optimization, a conforming program could see *to_p
4151 change before the called function returns; see c++/19317.
4152 When optimizing, the return_slot pass marks more functions
4153 as safe after we have escape info. */
4160 CALL_EXPR_RETURN_SLOT_OPT (*from_p) = 1;
4161 mark_addressable (*to_p);
4168 /* If we're initializing from a container, push the initialization
4170 case CLEANUP_POINT_EXPR:
4172 case STATEMENT_LIST:
4174 tree wrap = *from_p;
4177 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_min_lval,
4179 if (ret != GS_ERROR)
4182 t = voidify_wrapper_expr (wrap, *expr_p);
4183 gcc_assert (t == *expr_p);
4187 gimplify_and_add (wrap, pre_p);
4188 *expr_p = unshare_expr (*to_p);
4204 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
4205 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
4206 DECL_GIMPLE_REG_P set.
4208 IMPORTANT NOTE: This promotion is performed by introducing a load of the
4209 other, unmodified part of the complex object just before the total store.
4210 As a consequence, if the object is still uninitialized, an undefined value
4211 will be loaded into a register, which may result in a spurious exception
4212 if the register is floating-point and the value happens to be a signaling
4213 NaN for example. Then the fully-fledged complex operations lowering pass
4214 followed by a DCE pass are necessary in order to fix things up. */
4216 static enum gimplify_status
4217 gimplify_modify_expr_complex_part (tree *expr_p, gimple_seq *pre_p,
4220 enum tree_code code, ocode;
4221 tree lhs, rhs, new_rhs, other, realpart, imagpart;
4223 lhs = TREE_OPERAND (*expr_p, 0);
4224 rhs = TREE_OPERAND (*expr_p, 1);
4225 code = TREE_CODE (lhs);
4226 lhs = TREE_OPERAND (lhs, 0);
4228 ocode = code == REALPART_EXPR ? IMAGPART_EXPR : REALPART_EXPR;
4229 other = build1 (ocode, TREE_TYPE (rhs), lhs);
4230 other = get_formal_tmp_var (other, pre_p);
4232 realpart = code == REALPART_EXPR ? rhs : other;
4233 imagpart = code == REALPART_EXPR ? other : rhs;
4235 if (TREE_CONSTANT (realpart) && TREE_CONSTANT (imagpart))
4236 new_rhs = build_complex (TREE_TYPE (lhs), realpart, imagpart);
4238 new_rhs = build2 (COMPLEX_EXPR, TREE_TYPE (lhs), realpart, imagpart);
4240 gimplify_seq_add_stmt (pre_p, gimple_build_assign (lhs, new_rhs));
4241 *expr_p = (want_value) ? rhs : NULL_TREE;
4247 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
4253 PRE_P points to the list where side effects that must happen before
4254 *EXPR_P should be stored.
4256 POST_P points to the list where side effects that must happen after
4257 *EXPR_P should be stored.
4259 WANT_VALUE is nonzero iff we want to use the value of this expression
4260 in another expression. */
4262 static enum gimplify_status
4263 gimplify_modify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
4266 tree *from_p = &TREE_OPERAND (*expr_p, 1);
4267 tree *to_p = &TREE_OPERAND (*expr_p, 0);
4268 enum gimplify_status ret = GS_UNHANDLED;
4271 gcc_assert (TREE_CODE (*expr_p) == MODIFY_EXPR
4272 || TREE_CODE (*expr_p) == INIT_EXPR);
4274 /* Insert pointer conversions required by the middle-end that are not
4275 required by the frontend. This fixes middle-end type checking for
4276 for example gcc.dg/redecl-6.c. */
4277 if (POINTER_TYPE_P (TREE_TYPE (*to_p))
4278 && lang_hooks.types_compatible_p (TREE_TYPE (*to_p), TREE_TYPE (*from_p)))
4280 STRIP_USELESS_TYPE_CONVERSION (*from_p);
4281 if (!useless_type_conversion_p (TREE_TYPE (*to_p), TREE_TYPE (*from_p)))
4282 *from_p = fold_convert (TREE_TYPE (*to_p), *from_p);
4285 /* See if any simplifications can be done based on what the RHS is. */
4286 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
4288 if (ret != GS_UNHANDLED)
4291 /* For zero sized types only gimplify the left hand side and right hand
4292 side as statements and throw away the assignment. Do this after
4293 gimplify_modify_expr_rhs so we handle TARGET_EXPRs of addressable
4295 if (zero_sized_type (TREE_TYPE (*from_p)) && !want_value)
4297 gimplify_stmt (from_p, pre_p);
4298 gimplify_stmt (to_p, pre_p);
4299 *expr_p = NULL_TREE;
4303 /* If the value being copied is of variable width, compute the length
4304 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
4305 before gimplifying any of the operands so that we can resolve any
4306 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
4307 the size of the expression to be copied, not of the destination, so
4308 that is what we must do here. */
4309 maybe_with_size_expr (from_p);
4311 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
4312 if (ret == GS_ERROR)
4315 /* As a special case, we have to temporarily allow for assignments
4316 with a CALL_EXPR on the RHS. Since in GIMPLE a function call is
4317 a toplevel statement, when gimplifying the GENERIC expression
4318 MODIFY_EXPR <a, CALL_EXPR <foo>>, we cannot create the tuple
4319 GIMPLE_ASSIGN <a, GIMPLE_CALL <foo>>.
4321 Instead, we need to create the tuple GIMPLE_CALL <a, foo>. To
4322 prevent gimplify_expr from trying to create a new temporary for
4323 foo's LHS, we tell it that it should only gimplify until it
4324 reaches the CALL_EXPR. On return from gimplify_expr, the newly
4325 created GIMPLE_CALL <foo> will be the last statement in *PRE_P
4326 and all we need to do here is set 'a' to be its LHS. */
4327 ret = gimplify_expr (from_p, pre_p, post_p, rhs_predicate_for (*to_p),
4329 if (ret == GS_ERROR)
4332 /* Now see if the above changed *from_p to something we handle specially. */
4333 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
4335 if (ret != GS_UNHANDLED)
4338 /* If we've got a variable sized assignment between two lvalues (i.e. does
4339 not involve a call), then we can make things a bit more straightforward
4340 by converting the assignment to memcpy or memset. */
4341 if (TREE_CODE (*from_p) == WITH_SIZE_EXPR)
4343 tree from = TREE_OPERAND (*from_p, 0);
4344 tree size = TREE_OPERAND (*from_p, 1);
4346 if (TREE_CODE (from) == CONSTRUCTOR)
4347 return gimplify_modify_expr_to_memset (expr_p, size, want_value, pre_p);
4349 if (is_gimple_addressable (from))
4352 return gimplify_modify_expr_to_memcpy (expr_p, size, want_value,
4357 /* Transform partial stores to non-addressable complex variables into
4358 total stores. This allows us to use real instead of virtual operands
4359 for these variables, which improves optimization. */
4360 if ((TREE_CODE (*to_p) == REALPART_EXPR
4361 || TREE_CODE (*to_p) == IMAGPART_EXPR)
4362 && is_gimple_reg (TREE_OPERAND (*to_p, 0)))
4363 return gimplify_modify_expr_complex_part (expr_p, pre_p, want_value);
4365 /* Try to alleviate the effects of the gimplification creating artificial
4366 temporaries (see for example is_gimple_reg_rhs) on the debug info. */
4367 if (!gimplify_ctxp->into_ssa
4369 && DECL_IGNORED_P (*from_p)
4371 && !DECL_IGNORED_P (*to_p))
4373 if (!DECL_NAME (*from_p) && DECL_NAME (*to_p))
4375 = create_tmp_var_name (IDENTIFIER_POINTER (DECL_NAME (*to_p)));
4376 DECL_DEBUG_EXPR_IS_FROM (*from_p) = 1;
4377 SET_DECL_DEBUG_EXPR (*from_p, *to_p);
4380 if (TREE_CODE (*from_p) == CALL_EXPR)
4382 /* Since the RHS is a CALL_EXPR, we need to create a GIMPLE_CALL
4383 instead of a GIMPLE_ASSIGN. */
4384 assign = gimple_build_call_from_tree (*from_p);
4385 gimple_call_set_lhs (assign, *to_p);
4388 assign = gimple_build_assign (*to_p, *from_p);
4390 gimplify_seq_add_stmt (pre_p, assign);
4392 if (gimplify_ctxp->into_ssa && is_gimple_reg (*to_p))
4394 /* If we've somehow already got an SSA_NAME on the LHS, then
4395 we've probably modified it twice. Not good. */
4396 gcc_assert (TREE_CODE (*to_p) != SSA_NAME);
4397 *to_p = make_ssa_name (*to_p, assign);
4398 gimple_set_lhs (assign, *to_p);
4403 *expr_p = unshare_expr (*to_p);
4412 /* Gimplify a comparison between two variable-sized objects. Do this
4413 with a call to BUILT_IN_MEMCMP. */
4415 static enum gimplify_status
4416 gimplify_variable_sized_compare (tree *expr_p)
4418 tree op0 = TREE_OPERAND (*expr_p, 0);
4419 tree op1 = TREE_OPERAND (*expr_p, 1);
4420 tree t, arg, dest, src;
4422 arg = TYPE_SIZE_UNIT (TREE_TYPE (op0));
4423 arg = unshare_expr (arg);
4424 arg = SUBSTITUTE_PLACEHOLDER_IN_EXPR (arg, op0);
4425 src = build_fold_addr_expr (op1);
4426 dest = build_fold_addr_expr (op0);
4427 t = implicit_built_in_decls[BUILT_IN_MEMCMP];
4428 t = build_call_expr (t, 3, dest, src, arg);
4430 = build2 (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), t, integer_zero_node);
4435 /* Gimplify a comparison between two aggregate objects of integral scalar
4436 mode as a comparison between the bitwise equivalent scalar values. */
4438 static enum gimplify_status
4439 gimplify_scalar_mode_aggregate_compare (tree *expr_p)
4441 tree op0 = TREE_OPERAND (*expr_p, 0);
4442 tree op1 = TREE_OPERAND (*expr_p, 1);
4444 tree type = TREE_TYPE (op0);
4445 tree scalar_type = lang_hooks.types.type_for_mode (TYPE_MODE (type), 1);
4447 op0 = fold_build1 (VIEW_CONVERT_EXPR, scalar_type, op0);
4448 op1 = fold_build1 (VIEW_CONVERT_EXPR, scalar_type, op1);
4451 = fold_build2 (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), op0, op1);
4456 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
4457 points to the expression to gimplify.
4459 Expressions of the form 'a && b' are gimplified to:
4461 a && b ? true : false
4463 gimplify_cond_expr will do the rest.
4465 PRE_P points to the list where side effects that must happen before
4466 *EXPR_P should be stored. */
4468 static enum gimplify_status
4469 gimplify_boolean_expr (tree *expr_p)
4471 /* Preserve the original type of the expression. */
4472 tree type = TREE_TYPE (*expr_p);
4474 *expr_p = build3 (COND_EXPR, type, *expr_p,
4475 fold_convert (type, boolean_true_node),
4476 fold_convert (type, boolean_false_node));
4481 /* Gimplifies an expression sequence. This function gimplifies each
4482 expression and re-writes the original expression with the last
4483 expression of the sequence in GIMPLE form.
4485 PRE_P points to the list where the side effects for all the
4486 expressions in the sequence will be emitted.
4488 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
4490 static enum gimplify_status
4491 gimplify_compound_expr (tree *expr_p, gimple_seq *pre_p, bool want_value)
4497 tree *sub_p = &TREE_OPERAND (t, 0);
4499 if (TREE_CODE (*sub_p) == COMPOUND_EXPR)
4500 gimplify_compound_expr (sub_p, pre_p, false);
4502 gimplify_stmt (sub_p, pre_p);
4504 t = TREE_OPERAND (t, 1);
4506 while (TREE_CODE (t) == COMPOUND_EXPR);
4513 gimplify_stmt (expr_p, pre_p);
4519 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
4520 gimplify. After gimplification, EXPR_P will point to a new temporary
4521 that holds the original value of the SAVE_EXPR node.
4523 PRE_P points to the list where side effects that must happen before
4524 *EXPR_P should be stored. */
4526 static enum gimplify_status
4527 gimplify_save_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4529 enum gimplify_status ret = GS_ALL_DONE;
4532 gcc_assert (TREE_CODE (*expr_p) == SAVE_EXPR);
4533 val = TREE_OPERAND (*expr_p, 0);
4535 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
4536 if (!SAVE_EXPR_RESOLVED_P (*expr_p))
4538 /* The operand may be a void-valued expression such as SAVE_EXPRs
4539 generated by the Java frontend for class initialization. It is
4540 being executed only for its side-effects. */
4541 if (TREE_TYPE (val) == void_type_node)
4543 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
4544 is_gimple_stmt, fb_none);
4548 val = get_initialized_tmp_var (val, pre_p, post_p);
4550 TREE_OPERAND (*expr_p, 0) = val;
4551 SAVE_EXPR_RESOLVED_P (*expr_p) = 1;
4559 /* Re-write the ADDR_EXPR node pointed to by EXPR_P
4566 PRE_P points to the list where side effects that must happen before
4567 *EXPR_P should be stored.
4569 POST_P points to the list where side effects that must happen after
4570 *EXPR_P should be stored. */
4572 static enum gimplify_status
4573 gimplify_addr_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4575 tree expr = *expr_p;
4576 tree op0 = TREE_OPERAND (expr, 0);
4577 enum gimplify_status ret;
4579 switch (TREE_CODE (op0))
4582 case MISALIGNED_INDIRECT_REF:
4584 /* Check if we are dealing with an expression of the form '&*ptr'.
4585 While the front end folds away '&*ptr' into 'ptr', these
4586 expressions may be generated internally by the compiler (e.g.,
4587 builtins like __builtin_va_end). */
4588 /* Caution: the silent array decomposition semantics we allow for
4589 ADDR_EXPR means we can't always discard the pair. */
4590 /* Gimplification of the ADDR_EXPR operand may drop
4591 cv-qualification conversions, so make sure we add them if
4594 tree op00 = TREE_OPERAND (op0, 0);
4595 tree t_expr = TREE_TYPE (expr);
4596 tree t_op00 = TREE_TYPE (op00);
4598 if (!useless_type_conversion_p (t_expr, t_op00))
4599 op00 = fold_convert (TREE_TYPE (expr), op00);
4605 case VIEW_CONVERT_EXPR:
4606 /* Take the address of our operand and then convert it to the type of
4609 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
4610 all clear. The impact of this transformation is even less clear. */
4612 /* If the operand is a useless conversion, look through it. Doing so
4613 guarantees that the ADDR_EXPR and its operand will remain of the
4615 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0, 0)))
4616 op0 = TREE_OPERAND (op0, 0);
4618 *expr_p = fold_convert (TREE_TYPE (expr),
4619 build_fold_addr_expr (TREE_OPERAND (op0, 0)));
4624 /* We use fb_either here because the C frontend sometimes takes
4625 the address of a call that returns a struct; see
4626 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
4627 the implied temporary explicit. */
4629 /* Mark the RHS addressable. */
4630 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, post_p,
4631 is_gimple_addressable, fb_either);
4632 if (ret == GS_ERROR)
4635 /* We cannot rely on making the RHS addressable if it is
4636 a temporary created by gimplification. In this case create a
4637 new temporary that is initialized by a copy (which will
4638 become a store after we mark it addressable).
4639 This mostly happens if the frontend passed us something that
4640 it could not mark addressable yet, like a fortran
4641 pass-by-reference parameter (int) floatvar. */
4642 if (is_gimple_formal_tmp_var (TREE_OPERAND (expr, 0)))
4643 TREE_OPERAND (expr, 0)
4644 = get_initialized_tmp_var (TREE_OPERAND (expr, 0), pre_p, post_p);
4646 op0 = TREE_OPERAND (expr, 0);
4648 /* For various reasons, the gimplification of the expression
4649 may have made a new INDIRECT_REF. */
4650 if (TREE_CODE (op0) == INDIRECT_REF)
4651 goto do_indirect_ref;
4653 /* Make sure TREE_CONSTANT and TREE_SIDE_EFFECTS are set properly. */
4654 recompute_tree_invariant_for_addr_expr (expr);
4656 mark_addressable (TREE_OPERAND (expr, 0));
4663 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
4664 value; output operands should be a gimple lvalue. */
4666 static enum gimplify_status
4667 gimplify_asm_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4671 const char **oconstraints;
4674 const char *constraint;
4675 bool allows_mem, allows_reg, is_inout;
4676 enum gimplify_status ret, tret;
4678 VEC(tree, gc) *inputs;
4679 VEC(tree, gc) *outputs;
4680 VEC(tree, gc) *clobbers;
4684 noutputs = list_length (ASM_OUTPUTS (expr));
4685 oconstraints = (const char **) alloca ((noutputs) * sizeof (const char *));
4687 inputs = outputs = clobbers = NULL;
4690 link_next = NULL_TREE;
4691 for (i = 0, link = ASM_OUTPUTS (expr); link; ++i, link = link_next)
4694 size_t constraint_len;
4696 link_next = TREE_CHAIN (link);
4700 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4701 constraint_len = strlen (constraint);
4702 if (constraint_len == 0)
4705 ok = parse_output_constraint (&constraint, i, 0, 0,
4706 &allows_mem, &allows_reg, &is_inout);
4713 if (!allows_reg && allows_mem)
4714 mark_addressable (TREE_VALUE (link));
4716 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4717 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
4718 fb_lvalue | fb_mayfail);
4719 if (tret == GS_ERROR)
4721 error ("invalid lvalue in asm output %d", i);
4725 VEC_safe_push (tree, gc, outputs, link);
4726 TREE_CHAIN (link) = NULL_TREE;
4730 /* An input/output operand. To give the optimizers more
4731 flexibility, split it into separate input and output
4736 /* Turn the in/out constraint into an output constraint. */
4737 char *p = xstrdup (constraint);
4739 TREE_VALUE (TREE_PURPOSE (link)) = build_string (constraint_len, p);
4741 /* And add a matching input constraint. */
4744 sprintf (buf, "%d", i);
4746 /* If there are multiple alternatives in the constraint,
4747 handle each of them individually. Those that allow register
4748 will be replaced with operand number, the others will stay
4750 if (strchr (p, ',') != NULL)
4752 size_t len = 0, buflen = strlen (buf);
4753 char *beg, *end, *str, *dst;
4757 end = strchr (beg, ',');
4759 end = strchr (beg, '\0');
4760 if ((size_t) (end - beg) < buflen)
4763 len += end - beg + 1;
4770 str = (char *) alloca (len);
4771 for (beg = p + 1, dst = str;;)
4774 bool mem_p, reg_p, inout_p;
4776 end = strchr (beg, ',');
4781 parse_output_constraint (&tem, i, 0, 0,
4782 &mem_p, ®_p, &inout_p);
4787 memcpy (dst, buf, buflen);
4796 memcpy (dst, beg, len);
4805 input = build_string (dst - str, str);
4808 input = build_string (strlen (buf), buf);
4811 input = build_string (constraint_len - 1, constraint + 1);
4815 input = build_tree_list (build_tree_list (NULL_TREE, input),
4816 unshare_expr (TREE_VALUE (link)));
4817 ASM_INPUTS (expr) = chainon (ASM_INPUTS (expr), input);
4821 link_next = NULL_TREE;
4822 for (link = ASM_INPUTS (expr); link; ++i, link = link_next)
4824 link_next = TREE_CHAIN (link);
4825 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4826 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
4827 oconstraints, &allows_mem, &allows_reg);
4829 /* If we can't make copies, we can only accept memory. */
4830 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (link))))
4836 error ("impossible constraint in %<asm%>");
4837 error ("non-memory input %d must stay in memory", i);
4842 /* If the operand is a memory input, it should be an lvalue. */
4843 if (!allows_reg && allows_mem)
4845 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4846 is_gimple_lvalue, fb_lvalue | fb_mayfail);
4847 mark_addressable (TREE_VALUE (link));
4848 if (tret == GS_ERROR)
4850 if (EXPR_HAS_LOCATION (TREE_VALUE (link)))
4851 input_location = EXPR_LOCATION (TREE_VALUE (link));
4852 error ("memory input %d is not directly addressable", i);
4858 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4859 is_gimple_asm_val, fb_rvalue);
4860 if (tret == GS_ERROR)
4864 TREE_CHAIN (link) = NULL_TREE;
4865 VEC_safe_push (tree, gc, inputs, link);
4868 for (link = ASM_CLOBBERS (expr); link; ++i, link = TREE_CHAIN (link))
4869 VEC_safe_push (tree, gc, clobbers, link);
4871 stmt = gimple_build_asm_vec (TREE_STRING_POINTER (ASM_STRING (expr)),
4872 inputs, outputs, clobbers);
4874 gimple_asm_set_volatile (stmt, ASM_VOLATILE_P (expr));
4875 gimple_asm_set_input (stmt, ASM_INPUT_P (expr));
4877 gimplify_seq_add_stmt (pre_p, stmt);
4882 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
4883 GIMPLE_WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
4884 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
4885 return to this function.
4887 FIXME should we complexify the prequeue handling instead? Or use flags
4888 for all the cleanups and let the optimizer tighten them up? The current
4889 code seems pretty fragile; it will break on a cleanup within any
4890 non-conditional nesting. But any such nesting would be broken, anyway;
4891 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
4892 and continues out of it. We can do that at the RTL level, though, so
4893 having an optimizer to tighten up try/finally regions would be a Good
4896 static enum gimplify_status
4897 gimplify_cleanup_point_expr (tree *expr_p, gimple_seq *pre_p)
4899 gimple_stmt_iterator iter;
4900 gimple_seq body_sequence = NULL;
4902 tree temp = voidify_wrapper_expr (*expr_p, NULL);
4904 /* We only care about the number of conditions between the innermost
4905 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
4906 any cleanups collected outside the CLEANUP_POINT_EXPR. */
4907 int old_conds = gimplify_ctxp->conditions;
4908 gimple_seq old_cleanups = gimplify_ctxp->conditional_cleanups;
4909 gimplify_ctxp->conditions = 0;
4910 gimplify_ctxp->conditional_cleanups = NULL;
4912 gimplify_stmt (&TREE_OPERAND (*expr_p, 0), &body_sequence);
4914 gimplify_ctxp->conditions = old_conds;
4915 gimplify_ctxp->conditional_cleanups = old_cleanups;
4917 for (iter = gsi_start (body_sequence); !gsi_end_p (iter); )
4919 gimple wce = gsi_stmt (iter);
4921 if (gimple_code (wce) == GIMPLE_WITH_CLEANUP_EXPR)
4923 if (gsi_one_before_end_p (iter))
4925 /* Note that gsi_insert_seq_before and gsi_remove do not
4926 scan operands, unlike some other sequence mutators. */
4927 gsi_insert_seq_before_without_update (&iter,
4928 gimple_wce_cleanup (wce),
4930 gsi_remove (&iter, true);
4937 enum gimple_try_flags kind;
4939 if (gimple_wce_cleanup_eh_only (wce))
4940 kind = GIMPLE_TRY_CATCH;
4942 kind = GIMPLE_TRY_FINALLY;
4943 seq = gsi_split_seq_after (iter);
4945 gtry = gimple_build_try (seq, gimple_wce_cleanup (wce), kind);
4946 /* Do not use gsi_replace here, as it may scan operands.
4947 We want to do a simple structural modification only. */
4948 *gsi_stmt_ptr (&iter) = gtry;
4949 iter = gsi_start (seq);
4956 gimplify_seq_add_seq (pre_p, body_sequence);
4969 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
4970 is the cleanup action required. EH_ONLY is true if the cleanup should
4971 only be executed if an exception is thrown, not on normal exit. */
4974 gimple_push_cleanup (tree var, tree cleanup, bool eh_only, gimple_seq *pre_p)
4977 gimple_seq cleanup_stmts = NULL;
4979 /* Errors can result in improperly nested cleanups. Which results in
4980 confusion when trying to resolve the GIMPLE_WITH_CLEANUP_EXPR. */
4981 if (errorcount || sorrycount)
4984 if (gimple_conditional_context ())
4986 /* If we're in a conditional context, this is more complex. We only
4987 want to run the cleanup if we actually ran the initialization that
4988 necessitates it, but we want to run it after the end of the
4989 conditional context. So we wrap the try/finally around the
4990 condition and use a flag to determine whether or not to actually
4991 run the destructor. Thus
4995 becomes (approximately)
4999 if (test) { A::A(temp); flag = 1; val = f(temp); }
5002 if (flag) A::~A(temp);
5006 tree flag = create_tmp_var (boolean_type_node, "cleanup");
5007 gimple ffalse = gimple_build_assign (flag, boolean_false_node);
5008 gimple ftrue = gimple_build_assign (flag, boolean_true_node);
5010 cleanup = build3 (COND_EXPR, void_type_node, flag, cleanup, NULL);
5011 gimplify_stmt (&cleanup, &cleanup_stmts);
5012 wce = gimple_build_wce (cleanup_stmts);
5014 gimplify_seq_add_stmt (&gimplify_ctxp->conditional_cleanups, ffalse);
5015 gimplify_seq_add_stmt (&gimplify_ctxp->conditional_cleanups, wce);
5016 gimplify_seq_add_stmt (pre_p, ftrue);
5018 /* Because of this manipulation, and the EH edges that jump
5019 threading cannot redirect, the temporary (VAR) will appear
5020 to be used uninitialized. Don't warn. */
5021 TREE_NO_WARNING (var) = 1;
5025 gimplify_stmt (&cleanup, &cleanup_stmts);
5026 wce = gimple_build_wce (cleanup_stmts);
5027 gimple_wce_set_cleanup_eh_only (wce, eh_only);
5028 gimplify_seq_add_stmt (pre_p, wce);
5032 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
5034 static enum gimplify_status
5035 gimplify_target_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
5037 tree targ = *expr_p;
5038 tree temp = TARGET_EXPR_SLOT (targ);
5039 tree init = TARGET_EXPR_INITIAL (targ);
5040 enum gimplify_status ret;
5044 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
5045 to the temps list. Handle also variable length TARGET_EXPRs. */
5046 if (TREE_CODE (DECL_SIZE (temp)) != INTEGER_CST)
5048 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (temp)))
5049 gimplify_type_sizes (TREE_TYPE (temp), pre_p);
5050 gimplify_vla_decl (temp, pre_p);
5053 gimple_add_tmp_var (temp);
5055 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
5056 expression is supposed to initialize the slot. */
5057 if (VOID_TYPE_P (TREE_TYPE (init)))
5058 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
5061 tree init_expr = build2 (INIT_EXPR, void_type_node, temp, init);
5063 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
5065 ggc_free (init_expr);
5067 if (ret == GS_ERROR)
5069 /* PR c++/28266 Make sure this is expanded only once. */
5070 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
5074 gimplify_and_add (init, pre_p);
5076 /* If needed, push the cleanup for the temp. */
5077 if (TARGET_EXPR_CLEANUP (targ))
5078 gimple_push_cleanup (temp, TARGET_EXPR_CLEANUP (targ),
5079 CLEANUP_EH_ONLY (targ), pre_p);
5081 /* Only expand this once. */
5082 TREE_OPERAND (targ, 3) = init;
5083 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
5086 /* We should have expanded this before. */
5087 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp));
5093 /* Gimplification of expression trees. */
5095 /* Gimplify an expression which appears at statement context. The
5096 corresponding GIMPLE statements are added to *SEQ_P. If *SEQ_P is
5097 NULL, a new sequence is allocated.
5099 Return true if we actually added a statement to the queue. */
5102 gimplify_stmt (tree *stmt_p, gimple_seq *seq_p)
5104 gimple_seq_node last;
5107 *seq_p = gimple_seq_alloc ();
5109 last = gimple_seq_last (*seq_p);
5110 gimplify_expr (stmt_p, seq_p, NULL, is_gimple_stmt, fb_none);
5111 return last != gimple_seq_last (*seq_p);
5115 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
5116 to CTX. If entries already exist, force them to be some flavor of private.
5117 If there is no enclosing parallel, do nothing. */
5120 omp_firstprivatize_variable (struct gimplify_omp_ctx *ctx, tree decl)
5124 if (decl == NULL || !DECL_P (decl))
5129 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5132 if (n->value & GOVD_SHARED)
5133 n->value = GOVD_FIRSTPRIVATE | (n->value & GOVD_SEEN);
5137 else if (ctx->region_type != ORT_WORKSHARE)
5138 omp_add_variable (ctx, decl, GOVD_FIRSTPRIVATE);
5140 ctx = ctx->outer_context;
5145 /* Similarly for each of the type sizes of TYPE. */
5148 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx *ctx, tree type)
5150 if (type == NULL || type == error_mark_node)
5152 type = TYPE_MAIN_VARIANT (type);
5154 if (pointer_set_insert (ctx->privatized_types, type))
5157 switch (TREE_CODE (type))
5163 case FIXED_POINT_TYPE:
5164 omp_firstprivatize_variable (ctx, TYPE_MIN_VALUE (type));
5165 omp_firstprivatize_variable (ctx, TYPE_MAX_VALUE (type));
5169 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
5170 omp_firstprivatize_type_sizes (ctx, TYPE_DOMAIN (type));
5175 case QUAL_UNION_TYPE:
5178 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
5179 if (TREE_CODE (field) == FIELD_DECL)
5181 omp_firstprivatize_variable (ctx, DECL_FIELD_OFFSET (field));
5182 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (field));
5188 case REFERENCE_TYPE:
5189 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
5196 omp_firstprivatize_variable (ctx, TYPE_SIZE (type));
5197 omp_firstprivatize_variable (ctx, TYPE_SIZE_UNIT (type));
5198 lang_hooks.types.omp_firstprivatize_type_sizes (ctx, type);
5201 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
5204 omp_add_variable (struct gimplify_omp_ctx *ctx, tree decl, unsigned int flags)
5207 unsigned int nflags;
5210 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5213 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
5214 there are constructors involved somewhere. */
5215 if (TREE_ADDRESSABLE (TREE_TYPE (decl))
5216 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
5219 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5222 /* We shouldn't be re-adding the decl with the same data
5224 gcc_assert ((n->value & GOVD_DATA_SHARE_CLASS & flags) == 0);
5225 /* The only combination of data sharing classes we should see is
5226 FIRSTPRIVATE and LASTPRIVATE. */
5227 nflags = n->value | flags;
5228 gcc_assert ((nflags & GOVD_DATA_SHARE_CLASS)
5229 == (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE));
5234 /* When adding a variable-sized variable, we have to handle all sorts
5235 of additional bits of data: the pointer replacement variable, and
5236 the parameters of the type. */
5237 if (DECL_SIZE (decl) && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
5239 /* Add the pointer replacement variable as PRIVATE if the variable
5240 replacement is private, else FIRSTPRIVATE since we'll need the
5241 address of the original variable either for SHARED, or for the
5242 copy into or out of the context. */
5243 if (!(flags & GOVD_LOCAL))
5245 nflags = flags & GOVD_PRIVATE ? GOVD_PRIVATE : GOVD_FIRSTPRIVATE;
5246 nflags |= flags & GOVD_SEEN;
5247 t = DECL_VALUE_EXPR (decl);
5248 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
5249 t = TREE_OPERAND (t, 0);
5250 gcc_assert (DECL_P (t));
5251 omp_add_variable (ctx, t, nflags);
5254 /* Add all of the variable and type parameters (which should have
5255 been gimplified to a formal temporary) as FIRSTPRIVATE. */
5256 omp_firstprivatize_variable (ctx, DECL_SIZE_UNIT (decl));
5257 omp_firstprivatize_variable (ctx, DECL_SIZE (decl));
5258 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
5260 /* The variable-sized variable itself is never SHARED, only some form
5261 of PRIVATE. The sharing would take place via the pointer variable
5262 which we remapped above. */
5263 if (flags & GOVD_SHARED)
5264 flags = GOVD_PRIVATE | GOVD_DEBUG_PRIVATE
5265 | (flags & (GOVD_SEEN | GOVD_EXPLICIT));
5267 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
5268 alloca statement we generate for the variable, so make sure it
5269 is available. This isn't automatically needed for the SHARED
5270 case, since we won't be allocating local storage then.
5271 For local variables TYPE_SIZE_UNIT might not be gimplified yet,
5272 in this case omp_notice_variable will be called later
5273 on when it is gimplified. */
5274 else if (! (flags & GOVD_LOCAL))
5275 omp_notice_variable (ctx, TYPE_SIZE_UNIT (TREE_TYPE (decl)), true);
5277 else if (lang_hooks.decls.omp_privatize_by_reference (decl))
5279 gcc_assert ((flags & GOVD_LOCAL) == 0);
5280 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
5282 /* Similar to the direct variable sized case above, we'll need the
5283 size of references being privatized. */
5284 if ((flags & GOVD_SHARED) == 0)
5286 t = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl)));
5287 if (TREE_CODE (t) != INTEGER_CST)
5288 omp_notice_variable (ctx, t, true);
5292 splay_tree_insert (ctx->variables, (splay_tree_key)decl, flags);
5295 /* Notice a threadprivate variable DECL used in OpenMP context CTX.
5296 This just prints out diagnostics about threadprivate variable uses
5297 in untied tasks. If DECL2 is non-NULL, prevent this warning
5298 on that variable. */
5301 omp_notice_threadprivate_variable (struct gimplify_omp_ctx *ctx, tree decl,
5306 if (ctx->region_type != ORT_UNTIED_TASK)
5308 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5311 error ("threadprivate variable %qs used in untied task",
5312 IDENTIFIER_POINTER (DECL_NAME (decl)));
5313 error ("%Henclosing task", &ctx->location);
5314 splay_tree_insert (ctx->variables, (splay_tree_key)decl, 0);
5317 splay_tree_insert (ctx->variables, (splay_tree_key)decl2, 0);
5321 /* Record the fact that DECL was used within the OpenMP context CTX.
5322 IN_CODE is true when real code uses DECL, and false when we should
5323 merely emit default(none) errors. Return true if DECL is going to
5324 be remapped and thus DECL shouldn't be gimplified into its
5325 DECL_VALUE_EXPR (if any). */
5328 omp_notice_variable (struct gimplify_omp_ctx *ctx, tree decl, bool in_code)
5331 unsigned flags = in_code ? GOVD_SEEN : 0;
5332 bool ret = false, shared;
5334 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5337 /* Threadprivate variables are predetermined. */
5338 if (is_global_var (decl))
5340 if (DECL_THREAD_LOCAL_P (decl))
5341 return omp_notice_threadprivate_variable (ctx, decl, NULL_TREE);
5343 if (DECL_HAS_VALUE_EXPR_P (decl))
5345 tree value = get_base_address (DECL_VALUE_EXPR (decl));
5347 if (value && DECL_P (value) && DECL_THREAD_LOCAL_P (value))
5348 return omp_notice_threadprivate_variable (ctx, decl, value);
5352 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5355 enum omp_clause_default_kind default_kind, kind;
5356 struct gimplify_omp_ctx *octx;
5358 if (ctx->region_type == ORT_WORKSHARE)
5361 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
5362 remapped firstprivate instead of shared. To some extent this is
5363 addressed in omp_firstprivatize_type_sizes, but not effectively. */
5364 default_kind = ctx->default_kind;
5365 kind = lang_hooks.decls.omp_predetermined_sharing (decl);
5366 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
5367 default_kind = kind;
5369 switch (default_kind)
5371 case OMP_CLAUSE_DEFAULT_NONE:
5372 error ("%qs not specified in enclosing parallel",
5373 IDENTIFIER_POINTER (DECL_NAME
5374 (lang_hooks.decls.omp_report_decl (decl))));
5375 if ((ctx->region_type & ORT_TASK) != 0)
5376 error ("%Henclosing task", &ctx->location);
5378 error ("%Henclosing parallel", &ctx->location);
5380 case OMP_CLAUSE_DEFAULT_SHARED:
5381 flags |= GOVD_SHARED;
5383 case OMP_CLAUSE_DEFAULT_PRIVATE:
5384 flags |= GOVD_PRIVATE;
5386 case OMP_CLAUSE_DEFAULT_FIRSTPRIVATE:
5387 flags |= GOVD_FIRSTPRIVATE;
5389 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
5390 /* decl will be either GOVD_FIRSTPRIVATE or GOVD_SHARED. */
5391 gcc_assert ((ctx->region_type & ORT_TASK) != 0);
5392 if (ctx->outer_context)
5393 omp_notice_variable (ctx->outer_context, decl, in_code);
5394 for (octx = ctx->outer_context; octx; octx = octx->outer_context)
5398 n2 = splay_tree_lookup (octx->variables, (splay_tree_key) decl);
5399 if (n2 && (n2->value & GOVD_DATA_SHARE_CLASS) != GOVD_SHARED)
5401 flags |= GOVD_FIRSTPRIVATE;
5404 if ((octx->region_type & ORT_PARALLEL) != 0)
5407 if (flags & GOVD_FIRSTPRIVATE)
5410 && (TREE_CODE (decl) == PARM_DECL
5411 || (!is_global_var (decl)
5412 && DECL_CONTEXT (decl) == current_function_decl)))
5414 flags |= GOVD_FIRSTPRIVATE;
5417 flags |= GOVD_SHARED;
5423 if ((flags & GOVD_PRIVATE)
5424 && lang_hooks.decls.omp_private_outer_ref (decl))
5425 flags |= GOVD_PRIVATE_OUTER_REF;
5427 omp_add_variable (ctx, decl, flags);
5429 shared = (flags & GOVD_SHARED) != 0;
5430 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
5434 if ((n->value & (GOVD_SEEN | GOVD_LOCAL)) == 0
5435 && (flags & (GOVD_SEEN | GOVD_LOCAL)) == GOVD_SEEN
5437 && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
5440 tree t = DECL_VALUE_EXPR (decl);
5441 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
5442 t = TREE_OPERAND (t, 0);
5443 gcc_assert (DECL_P (t));
5444 n2 = splay_tree_lookup (ctx->variables, (splay_tree_key) t);
5445 n2->value |= GOVD_SEEN;
5448 shared = ((flags | n->value) & GOVD_SHARED) != 0;
5449 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
5451 /* If nothing changed, there's nothing left to do. */
5452 if ((n->value & flags) == flags)
5458 /* If the variable is private in the current context, then we don't
5459 need to propagate anything to an outer context. */
5460 if ((flags & GOVD_PRIVATE) && !(flags & GOVD_PRIVATE_OUTER_REF))
5462 if (ctx->outer_context
5463 && omp_notice_variable (ctx->outer_context, decl, in_code))
5468 /* Verify that DECL is private within CTX. If there's specific information
5469 to the contrary in the innermost scope, generate an error. */
5472 omp_is_private (struct gimplify_omp_ctx *ctx, tree decl)
5476 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5479 if (n->value & GOVD_SHARED)
5481 if (ctx == gimplify_omp_ctxp)
5483 error ("iteration variable %qs should be private",
5484 IDENTIFIER_POINTER (DECL_NAME (decl)));
5485 n->value = GOVD_PRIVATE;
5491 else if ((n->value & GOVD_EXPLICIT) != 0
5492 && (ctx == gimplify_omp_ctxp
5493 || (ctx->region_type == ORT_COMBINED_PARALLEL
5494 && gimplify_omp_ctxp->outer_context == ctx)))
5496 if ((n->value & GOVD_FIRSTPRIVATE) != 0)
5497 error ("iteration variable %qs should not be firstprivate",
5498 IDENTIFIER_POINTER (DECL_NAME (decl)));
5499 else if ((n->value & GOVD_REDUCTION) != 0)
5500 error ("iteration variable %qs should not be reduction",
5501 IDENTIFIER_POINTER (DECL_NAME (decl)));
5503 return (ctx == gimplify_omp_ctxp
5504 || (ctx->region_type == ORT_COMBINED_PARALLEL
5505 && gimplify_omp_ctxp->outer_context == ctx));
5508 if (ctx->region_type != ORT_WORKSHARE)
5510 else if (ctx->outer_context)
5511 return omp_is_private (ctx->outer_context, decl);
5515 /* Return true if DECL is private within a parallel region
5516 that binds to the current construct's context or in parallel
5517 region's REDUCTION clause. */
5520 omp_check_private (struct gimplify_omp_ctx *ctx, tree decl)
5526 ctx = ctx->outer_context;
5528 return !(is_global_var (decl)
5529 /* References might be private, but might be shared too. */
5530 || lang_hooks.decls.omp_privatize_by_reference (decl));
5532 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5534 return (n->value & GOVD_SHARED) == 0;
5536 while (ctx->region_type == ORT_WORKSHARE);
5540 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
5541 and previous omp contexts. */
5544 gimplify_scan_omp_clauses (tree *list_p, gimple_seq *pre_p,
5545 enum omp_region_type region_type)
5547 struct gimplify_omp_ctx *ctx, *outer_ctx;
5548 struct gimplify_ctx gctx;
5551 ctx = new_omp_context (region_type);
5552 outer_ctx = ctx->outer_context;
5554 while ((c = *list_p) != NULL)
5556 bool remove = false;
5557 bool notice_outer = true;
5558 const char *check_non_private = NULL;
5562 switch (OMP_CLAUSE_CODE (c))
5564 case OMP_CLAUSE_PRIVATE:
5565 flags = GOVD_PRIVATE | GOVD_EXPLICIT;
5566 if (lang_hooks.decls.omp_private_outer_ref (OMP_CLAUSE_DECL (c)))
5568 flags |= GOVD_PRIVATE_OUTER_REF;
5569 OMP_CLAUSE_PRIVATE_OUTER_REF (c) = 1;
5572 notice_outer = false;
5574 case OMP_CLAUSE_SHARED:
5575 flags = GOVD_SHARED | GOVD_EXPLICIT;
5577 case OMP_CLAUSE_FIRSTPRIVATE:
5578 flags = GOVD_FIRSTPRIVATE | GOVD_EXPLICIT;
5579 check_non_private = "firstprivate";
5581 case OMP_CLAUSE_LASTPRIVATE:
5582 flags = GOVD_LASTPRIVATE | GOVD_SEEN | GOVD_EXPLICIT;
5583 check_non_private = "lastprivate";
5585 case OMP_CLAUSE_REDUCTION:
5586 flags = GOVD_REDUCTION | GOVD_SEEN | GOVD_EXPLICIT;
5587 check_non_private = "reduction";
5591 decl = OMP_CLAUSE_DECL (c);
5592 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5597 omp_add_variable (ctx, decl, flags);
5598 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION
5599 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c))
5601 omp_add_variable (ctx, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c),
5602 GOVD_LOCAL | GOVD_SEEN);
5603 gimplify_omp_ctxp = ctx;
5604 push_gimplify_context (&gctx);
5606 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c) = gimple_seq_alloc ();
5607 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c) = gimple_seq_alloc ();
5609 gimplify_and_add (OMP_CLAUSE_REDUCTION_INIT (c),
5610 &OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c));
5611 pop_gimplify_context
5612 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c)));
5613 push_gimplify_context (&gctx);
5614 gimplify_and_add (OMP_CLAUSE_REDUCTION_MERGE (c),
5615 &OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c));
5616 pop_gimplify_context
5617 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c)));
5618 OMP_CLAUSE_REDUCTION_INIT (c) = NULL_TREE;
5619 OMP_CLAUSE_REDUCTION_MERGE (c) = NULL_TREE;
5621 gimplify_omp_ctxp = outer_ctx;
5623 else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
5624 && OMP_CLAUSE_LASTPRIVATE_STMT (c))
5626 gimplify_omp_ctxp = ctx;
5627 push_gimplify_context (&gctx);
5628 if (TREE_CODE (OMP_CLAUSE_LASTPRIVATE_STMT (c)) != BIND_EXPR)
5630 tree bind = build3 (BIND_EXPR, void_type_node, NULL,
5632 TREE_SIDE_EFFECTS (bind) = 1;
5633 BIND_EXPR_BODY (bind) = OMP_CLAUSE_LASTPRIVATE_STMT (c);
5634 OMP_CLAUSE_LASTPRIVATE_STMT (c) = bind;
5636 gimplify_and_add (OMP_CLAUSE_LASTPRIVATE_STMT (c),
5637 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c));
5638 pop_gimplify_context
5639 (gimple_seq_first_stmt (OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c)));
5640 OMP_CLAUSE_LASTPRIVATE_STMT (c) = NULL_TREE;
5642 gimplify_omp_ctxp = outer_ctx;
5648 case OMP_CLAUSE_COPYIN:
5649 case OMP_CLAUSE_COPYPRIVATE:
5650 decl = OMP_CLAUSE_DECL (c);
5651 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5658 omp_notice_variable (outer_ctx, decl, true);
5659 if (check_non_private
5660 && region_type == ORT_WORKSHARE
5661 && omp_check_private (ctx, decl))
5663 error ("%s variable %qs is private in outer context",
5664 check_non_private, IDENTIFIER_POINTER (DECL_NAME (decl)));
5670 OMP_CLAUSE_OPERAND (c, 0)
5671 = gimple_boolify (OMP_CLAUSE_OPERAND (c, 0));
5674 case OMP_CLAUSE_SCHEDULE:
5675 case OMP_CLAUSE_NUM_THREADS:
5676 if (gimplify_expr (&OMP_CLAUSE_OPERAND (c, 0), pre_p, NULL,
5677 is_gimple_val, fb_rvalue) == GS_ERROR)
5681 case OMP_CLAUSE_NOWAIT:
5682 case OMP_CLAUSE_ORDERED:
5683 case OMP_CLAUSE_UNTIED:
5684 case OMP_CLAUSE_COLLAPSE:
5687 case OMP_CLAUSE_DEFAULT:
5688 ctx->default_kind = OMP_CLAUSE_DEFAULT_KIND (c);
5696 *list_p = OMP_CLAUSE_CHAIN (c);
5698 list_p = &OMP_CLAUSE_CHAIN (c);
5701 gimplify_omp_ctxp = ctx;
5704 /* For all variables that were not actually used within the context,
5705 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
5708 gimplify_adjust_omp_clauses_1 (splay_tree_node n, void *data)
5710 tree *list_p = (tree *) data;
5711 tree decl = (tree) n->key;
5712 unsigned flags = n->value;
5713 enum omp_clause_code code;
5717 if (flags & (GOVD_EXPLICIT | GOVD_LOCAL))
5719 if ((flags & GOVD_SEEN) == 0)
5721 if (flags & GOVD_DEBUG_PRIVATE)
5723 gcc_assert ((flags & GOVD_DATA_SHARE_CLASS) == GOVD_PRIVATE);
5724 private_debug = true;
5728 = lang_hooks.decls.omp_private_debug_clause (decl,
5729 !!(flags & GOVD_SHARED));
5731 code = OMP_CLAUSE_PRIVATE;
5732 else if (flags & GOVD_SHARED)
5734 if (is_global_var (decl))
5736 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp->outer_context;
5740 = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5741 if (on && (on->value & (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE
5742 | GOVD_PRIVATE | GOVD_REDUCTION)) != 0)
5744 ctx = ctx->outer_context;
5749 code = OMP_CLAUSE_SHARED;
5751 else if (flags & GOVD_PRIVATE)
5752 code = OMP_CLAUSE_PRIVATE;
5753 else if (flags & GOVD_FIRSTPRIVATE)
5754 code = OMP_CLAUSE_FIRSTPRIVATE;
5758 clause = build_omp_clause (code);
5759 OMP_CLAUSE_DECL (clause) = decl;
5760 OMP_CLAUSE_CHAIN (clause) = *list_p;
5762 OMP_CLAUSE_PRIVATE_DEBUG (clause) = 1;
5763 else if (code == OMP_CLAUSE_PRIVATE && (flags & GOVD_PRIVATE_OUTER_REF))
5764 OMP_CLAUSE_PRIVATE_OUTER_REF (clause) = 1;
5766 lang_hooks.decls.omp_finish_clause (clause);
5772 gimplify_adjust_omp_clauses (tree *list_p)
5774 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
5777 while ((c = *list_p) != NULL)
5780 bool remove = false;
5782 switch (OMP_CLAUSE_CODE (c))
5784 case OMP_CLAUSE_PRIVATE:
5785 case OMP_CLAUSE_SHARED:
5786 case OMP_CLAUSE_FIRSTPRIVATE:
5787 decl = OMP_CLAUSE_DECL (c);
5788 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5789 remove = !(n->value & GOVD_SEEN);
5792 bool shared = OMP_CLAUSE_CODE (c) == OMP_CLAUSE_SHARED;
5793 if ((n->value & GOVD_DEBUG_PRIVATE)
5794 || lang_hooks.decls.omp_private_debug_clause (decl, shared))
5796 gcc_assert ((n->value & GOVD_DEBUG_PRIVATE) == 0
5797 || ((n->value & GOVD_DATA_SHARE_CLASS)
5799 OMP_CLAUSE_SET_CODE (c, OMP_CLAUSE_PRIVATE);
5800 OMP_CLAUSE_PRIVATE_DEBUG (c) = 1;
5805 case OMP_CLAUSE_LASTPRIVATE:
5806 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
5807 accurately reflect the presence of a FIRSTPRIVATE clause. */
5808 decl = OMP_CLAUSE_DECL (c);
5809 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5810 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)
5811 = (n->value & GOVD_FIRSTPRIVATE) != 0;
5814 case OMP_CLAUSE_REDUCTION:
5815 case OMP_CLAUSE_COPYIN:
5816 case OMP_CLAUSE_COPYPRIVATE:
5818 case OMP_CLAUSE_NUM_THREADS:
5819 case OMP_CLAUSE_SCHEDULE:
5820 case OMP_CLAUSE_NOWAIT:
5821 case OMP_CLAUSE_ORDERED:
5822 case OMP_CLAUSE_DEFAULT:
5823 case OMP_CLAUSE_UNTIED:
5824 case OMP_CLAUSE_COLLAPSE:
5832 *list_p = OMP_CLAUSE_CHAIN (c);
5834 list_p = &OMP_CLAUSE_CHAIN (c);
5837 /* Add in any implicit data sharing. */
5838 splay_tree_foreach (ctx->variables, gimplify_adjust_omp_clauses_1, list_p);
5840 gimplify_omp_ctxp = ctx->outer_context;
5841 delete_omp_context (ctx);
5844 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
5845 gimplification of the body, as well as scanning the body for used
5846 variables. We need to do this scan now, because variable-sized
5847 decls will be decomposed during gimplification. */
5850 gimplify_omp_parallel (tree *expr_p, gimple_seq *pre_p)
5852 tree expr = *expr_p;
5854 gimple_seq body = NULL;
5855 struct gimplify_ctx gctx;
5857 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr), pre_p,
5858 OMP_PARALLEL_COMBINED (expr)
5859 ? ORT_COMBINED_PARALLEL
5862 push_gimplify_context (&gctx);
5864 g = gimplify_and_return_first (OMP_PARALLEL_BODY (expr), &body);
5865 if (gimple_code (g) == GIMPLE_BIND)
5866 pop_gimplify_context (g);
5868 pop_gimplify_context (NULL);
5870 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr));
5872 g = gimple_build_omp_parallel (body,
5873 OMP_PARALLEL_CLAUSES (expr),
5874 NULL_TREE, NULL_TREE);
5875 if (OMP_PARALLEL_COMBINED (expr))
5876 gimple_omp_set_subcode (g, GF_OMP_PARALLEL_COMBINED);
5877 gimplify_seq_add_stmt (pre_p, g);
5878 *expr_p = NULL_TREE;
5881 /* Gimplify the contents of an OMP_TASK statement. This involves
5882 gimplification of the body, as well as scanning the body for used
5883 variables. We need to do this scan now, because variable-sized
5884 decls will be decomposed during gimplification. */
5887 gimplify_omp_task (tree *expr_p, gimple_seq *pre_p)
5889 tree expr = *expr_p;
5891 gimple_seq body = NULL;
5892 struct gimplify_ctx gctx;
5894 gimplify_scan_omp_clauses (&OMP_TASK_CLAUSES (expr), pre_p,
5895 find_omp_clause (OMP_TASK_CLAUSES (expr),
5897 ? ORT_UNTIED_TASK : ORT_TASK);
5899 push_gimplify_context (&gctx);
5901 g = gimplify_and_return_first (OMP_TASK_BODY (expr), &body);
5902 if (gimple_code (g) == GIMPLE_BIND)
5903 pop_gimplify_context (g);
5905 pop_gimplify_context (NULL);
5907 gimplify_adjust_omp_clauses (&OMP_TASK_CLAUSES (expr));
5909 g = gimple_build_omp_task (body,
5910 OMP_TASK_CLAUSES (expr),
5911 NULL_TREE, NULL_TREE,
5912 NULL_TREE, NULL_TREE, NULL_TREE);
5913 gimplify_seq_add_stmt (pre_p, g);
5914 *expr_p = NULL_TREE;
5917 /* Gimplify the gross structure of an OMP_FOR statement. */
5919 static enum gimplify_status
5920 gimplify_omp_for (tree *expr_p, gimple_seq *pre_p)
5922 tree for_stmt, decl, var, t;
5923 enum gimplify_status ret = GS_OK;
5925 gimple_seq for_body, for_pre_body;
5930 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt), pre_p,
5933 /* Handle OMP_FOR_INIT. */
5934 for_pre_body = NULL;
5935 gimplify_and_add (OMP_FOR_PRE_BODY (for_stmt), &for_pre_body);
5936 OMP_FOR_PRE_BODY (for_stmt) = NULL_TREE;
5938 for_body = gimple_seq_alloc ();
5939 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt))
5940 == TREE_VEC_LENGTH (OMP_FOR_COND (for_stmt)));
5941 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt))
5942 == TREE_VEC_LENGTH (OMP_FOR_INCR (for_stmt)));
5943 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)); i++)
5945 t = TREE_VEC_ELT (OMP_FOR_INIT (for_stmt), i);
5946 gcc_assert (TREE_CODE (t) == MODIFY_EXPR);
5947 decl = TREE_OPERAND (t, 0);
5948 gcc_assert (DECL_P (decl));
5949 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl))
5950 || POINTER_TYPE_P (TREE_TYPE (decl)));
5952 /* Make sure the iteration variable is private. */
5953 if (omp_is_private (gimplify_omp_ctxp, decl))
5954 omp_notice_variable (gimplify_omp_ctxp, decl, true);
5956 omp_add_variable (gimplify_omp_ctxp, decl, GOVD_PRIVATE | GOVD_SEEN);
5958 /* If DECL is not a gimple register, create a temporary variable to act
5959 as an iteration counter. This is valid, since DECL cannot be
5960 modified in the body of the loop. */
5961 if (!is_gimple_reg (decl))
5963 var = create_tmp_var (TREE_TYPE (decl), get_name (decl));
5964 TREE_OPERAND (t, 0) = var;
5966 gimplify_seq_add_stmt (&for_body, gimple_build_assign (decl, var));
5968 omp_add_variable (gimplify_omp_ctxp, var, GOVD_PRIVATE | GOVD_SEEN);
5973 ret |= gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
5974 is_gimple_val, fb_rvalue);
5975 if (ret == GS_ERROR)
5978 /* Handle OMP_FOR_COND. */
5979 t = TREE_VEC_ELT (OMP_FOR_COND (for_stmt), i);
5980 gcc_assert (COMPARISON_CLASS_P (t));
5981 gcc_assert (TREE_OPERAND (t, 0) == decl);
5983 ret |= gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
5984 is_gimple_val, fb_rvalue);
5986 /* Handle OMP_FOR_INCR. */
5987 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
5988 switch (TREE_CODE (t))
5990 case PREINCREMENT_EXPR:
5991 case POSTINCREMENT_EXPR:
5992 t = build_int_cst (TREE_TYPE (decl), 1);
5993 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
5994 t = build2 (MODIFY_EXPR, TREE_TYPE (var), var, t);
5995 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i) = t;
5998 case PREDECREMENT_EXPR:
5999 case POSTDECREMENT_EXPR:
6000 t = build_int_cst (TREE_TYPE (decl), -1);
6001 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
6002 t = build2 (MODIFY_EXPR, TREE_TYPE (var), var, t);
6003 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i) = t;
6007 gcc_assert (TREE_OPERAND (t, 0) == decl);
6008 TREE_OPERAND (t, 0) = var;
6010 t = TREE_OPERAND (t, 1);
6011 switch (TREE_CODE (t))
6014 if (TREE_OPERAND (t, 1) == decl)
6016 TREE_OPERAND (t, 1) = TREE_OPERAND (t, 0);
6017 TREE_OPERAND (t, 0) = var;
6023 case POINTER_PLUS_EXPR:
6024 gcc_assert (TREE_OPERAND (t, 0) == decl);
6025 TREE_OPERAND (t, 0) = var;
6031 ret |= gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
6032 is_gimple_val, fb_rvalue);
6039 if (var != decl || TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)) > 1)
6042 for (c = OMP_FOR_CLAUSES (for_stmt); c ; c = OMP_CLAUSE_CHAIN (c))
6043 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
6044 && OMP_CLAUSE_DECL (c) == decl
6045 && OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c) == NULL)
6047 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6048 gcc_assert (TREE_CODE (t) == MODIFY_EXPR);
6049 gcc_assert (TREE_OPERAND (t, 0) == var);
6050 t = TREE_OPERAND (t, 1);
6051 gcc_assert (TREE_CODE (t) == PLUS_EXPR
6052 || TREE_CODE (t) == MINUS_EXPR
6053 || TREE_CODE (t) == POINTER_PLUS_EXPR);
6054 gcc_assert (TREE_OPERAND (t, 0) == var);
6055 t = build2 (TREE_CODE (t), TREE_TYPE (decl), decl,
6056 TREE_OPERAND (t, 1));
6057 gimplify_assign (decl, t,
6058 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c));
6063 gimplify_and_add (OMP_FOR_BODY (for_stmt), &for_body);
6065 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt));
6067 gfor = gimple_build_omp_for (for_body, OMP_FOR_CLAUSES (for_stmt),
6068 TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)),
6071 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)); i++)
6073 t = TREE_VEC_ELT (OMP_FOR_INIT (for_stmt), i);
6074 gimple_omp_for_set_index (gfor, i, TREE_OPERAND (t, 0));
6075 gimple_omp_for_set_initial (gfor, i, TREE_OPERAND (t, 1));
6076 t = TREE_VEC_ELT (OMP_FOR_COND (for_stmt), i);
6077 gimple_omp_for_set_cond (gfor, i, TREE_CODE (t));
6078 gimple_omp_for_set_final (gfor, i, TREE_OPERAND (t, 1));
6079 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6080 gimple_omp_for_set_incr (gfor, i, TREE_OPERAND (t, 1));
6083 gimplify_seq_add_stmt (pre_p, gfor);
6084 return ret == GS_ALL_DONE ? GS_ALL_DONE : GS_ERROR;
6087 /* Gimplify the gross structure of other OpenMP worksharing constructs.
6088 In particular, OMP_SECTIONS and OMP_SINGLE. */
6091 gimplify_omp_workshare (tree *expr_p, gimple_seq *pre_p)
6093 tree expr = *expr_p;
6095 gimple_seq body = NULL;
6097 gimplify_scan_omp_clauses (&OMP_CLAUSES (expr), pre_p, ORT_WORKSHARE);
6098 gimplify_and_add (OMP_BODY (expr), &body);
6099 gimplify_adjust_omp_clauses (&OMP_CLAUSES (expr));
6101 if (TREE_CODE (expr) == OMP_SECTIONS)
6102 stmt = gimple_build_omp_sections (body, OMP_CLAUSES (expr));
6103 else if (TREE_CODE (expr) == OMP_SINGLE)
6104 stmt = gimple_build_omp_single (body, OMP_CLAUSES (expr));
6108 gimplify_seq_add_stmt (pre_p, stmt);
6111 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
6112 stabilized the lhs of the atomic operation as *ADDR. Return true if
6113 EXPR is this stabilized form. */
6116 goa_lhs_expr_p (tree expr, tree addr)
6118 /* Also include casts to other type variants. The C front end is fond
6119 of adding these for e.g. volatile variables. This is like
6120 STRIP_TYPE_NOPS but includes the main variant lookup. */
6121 while ((CONVERT_EXPR_P (expr)
6122 || TREE_CODE (expr) == NON_LVALUE_EXPR)
6123 && TREE_OPERAND (expr, 0) != error_mark_node
6124 && (TYPE_MAIN_VARIANT (TREE_TYPE (expr))
6125 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (expr, 0)))))
6126 expr = TREE_OPERAND (expr, 0);
6128 if (TREE_CODE (expr) == INDIRECT_REF)
6130 expr = TREE_OPERAND (expr, 0);
6132 && (CONVERT_EXPR_P (expr)
6133 || TREE_CODE (expr) == NON_LVALUE_EXPR)
6134 && TREE_CODE (expr) == TREE_CODE (addr)
6135 && TYPE_MAIN_VARIANT (TREE_TYPE (expr))
6136 == TYPE_MAIN_VARIANT (TREE_TYPE (addr)))
6138 expr = TREE_OPERAND (expr, 0);
6139 addr = TREE_OPERAND (addr, 0);
6143 return (TREE_CODE (addr) == ADDR_EXPR
6144 && TREE_CODE (expr) == ADDR_EXPR
6145 && TREE_OPERAND (addr, 0) == TREE_OPERAND (expr, 0));
6147 if (TREE_CODE (addr) == ADDR_EXPR && expr == TREE_OPERAND (addr, 0))
6152 /* Walk *EXPR_P and replace
6153 appearances of *LHS_ADDR with LHS_VAR. If an expression does not involve
6154 the lhs, evaluate it into a temporary. Return 1 if the lhs appeared as
6155 a subexpression, 0 if it did not, or -1 if an error was encountered. */
6158 goa_stabilize_expr (tree *expr_p, gimple_seq *pre_p, tree lhs_addr,
6161 tree expr = *expr_p;
6164 if (goa_lhs_expr_p (expr, lhs_addr))
6169 if (is_gimple_val (expr))
6173 switch (TREE_CODE_CLASS (TREE_CODE (expr)))
6176 case tcc_comparison:
6177 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p, lhs_addr,
6180 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p, lhs_addr,
6183 case tcc_expression:
6184 switch (TREE_CODE (expr))
6186 case TRUTH_ANDIF_EXPR:
6187 case TRUTH_ORIF_EXPR:
6188 case TRUTH_AND_EXPR:
6190 case TRUTH_XOR_EXPR:
6191 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p,
6193 case TRUTH_NOT_EXPR:
6194 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p,
6207 enum gimplify_status gs;
6208 gs = gimplify_expr (expr_p, pre_p, NULL, is_gimple_val, fb_rvalue);
6209 if (gs != GS_ALL_DONE)
6217 /* Gimplify an OMP_ATOMIC statement. */
6219 static enum gimplify_status
6220 gimplify_omp_atomic (tree *expr_p, gimple_seq *pre_p)
6222 tree addr = TREE_OPERAND (*expr_p, 0);
6223 tree rhs = TREE_OPERAND (*expr_p, 1);
6224 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr)));
6227 tmp_load = create_tmp_var (type, NULL);
6228 if (TREE_CODE (type) == COMPLEX_TYPE || TREE_CODE (type) == VECTOR_TYPE)
6229 DECL_GIMPLE_REG_P (tmp_load) = 1;
6230 if (goa_stabilize_expr (&rhs, pre_p, addr, tmp_load) < 0)
6233 if (gimplify_expr (&addr, pre_p, NULL, is_gimple_val, fb_rvalue)
6237 gimplify_seq_add_stmt (pre_p, gimple_build_omp_atomic_load (tmp_load, addr));
6238 if (gimplify_expr (&rhs, pre_p, NULL, is_gimple_val, fb_rvalue)
6241 gimplify_seq_add_stmt (pre_p, gimple_build_omp_atomic_store (rhs));
6248 /* Converts the GENERIC expression tree *EXPR_P to GIMPLE. If the
6249 expression produces a value to be used as an operand inside a GIMPLE
6250 statement, the value will be stored back in *EXPR_P. This value will
6251 be a tree of class tcc_declaration, tcc_constant, tcc_reference or
6252 an SSA_NAME. The corresponding sequence of GIMPLE statements is
6253 emitted in PRE_P and POST_P.
6255 Additionally, this process may overwrite parts of the input
6256 expression during gimplification. Ideally, it should be
6257 possible to do non-destructive gimplification.
6259 EXPR_P points to the GENERIC expression to convert to GIMPLE. If
6260 the expression needs to evaluate to a value to be used as
6261 an operand in a GIMPLE statement, this value will be stored in
6262 *EXPR_P on exit. This happens when the caller specifies one
6263 of fb_lvalue or fb_rvalue fallback flags.
6265 PRE_P will contain the sequence of GIMPLE statements corresponding
6266 to the evaluation of EXPR and all the side-effects that must
6267 be executed before the main expression. On exit, the last
6268 statement of PRE_P is the core statement being gimplified. For
6269 instance, when gimplifying 'if (++a)' the last statement in
6270 PRE_P will be 'if (t.1)' where t.1 is the result of
6271 pre-incrementing 'a'.
6273 POST_P will contain the sequence of GIMPLE statements corresponding
6274 to the evaluation of all the side-effects that must be executed
6275 after the main expression. If this is NULL, the post
6276 side-effects are stored at the end of PRE_P.
6278 The reason why the output is split in two is to handle post
6279 side-effects explicitly. In some cases, an expression may have
6280 inner and outer post side-effects which need to be emitted in
6281 an order different from the one given by the recursive
6282 traversal. For instance, for the expression (*p--)++ the post
6283 side-effects of '--' must actually occur *after* the post
6284 side-effects of '++'. However, gimplification will first visit
6285 the inner expression, so if a separate POST sequence was not
6286 used, the resulting sequence would be:
6293 However, the post-decrement operation in line #2 must not be
6294 evaluated until after the store to *p at line #4, so the
6295 correct sequence should be:
6302 So, by specifying a separate post queue, it is possible
6303 to emit the post side-effects in the correct order.
6304 If POST_P is NULL, an internal queue will be used. Before
6305 returning to the caller, the sequence POST_P is appended to
6306 the main output sequence PRE_P.
6308 GIMPLE_TEST_F points to a function that takes a tree T and
6309 returns nonzero if T is in the GIMPLE form requested by the
6310 caller. The GIMPLE predicates are in tree-gimple.c.
6312 FALLBACK tells the function what sort of a temporary we want if
6313 gimplification cannot produce an expression that complies with
6316 fb_none means that no temporary should be generated
6317 fb_rvalue means that an rvalue is OK to generate
6318 fb_lvalue means that an lvalue is OK to generate
6319 fb_either means that either is OK, but an lvalue is preferable.
6320 fb_mayfail means that gimplification may fail (in which case
6321 GS_ERROR will be returned)
6323 The return value is either GS_ERROR or GS_ALL_DONE, since this
6324 function iterates until EXPR is completely gimplified or an error
6327 enum gimplify_status
6328 gimplify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
6329 bool (*gimple_test_f) (tree), fallback_t fallback)
6332 gimple_seq internal_pre = NULL;
6333 gimple_seq internal_post = NULL;
6336 location_t saved_location;
6337 enum gimplify_status ret;
6338 gimple_stmt_iterator pre_last_gsi, post_last_gsi;
6340 save_expr = *expr_p;
6341 if (save_expr == NULL_TREE)
6344 /* If we are gimplifying a top-level statement, PRE_P must be valid. */
6345 is_statement = gimple_test_f == is_gimple_stmt;
6349 /* Consistency checks. */
6350 if (gimple_test_f == is_gimple_reg)
6351 gcc_assert (fallback & (fb_rvalue | fb_lvalue));
6352 else if (gimple_test_f == is_gimple_val
6353 || gimple_test_f == is_gimple_formal_tmp_rhs
6354 || gimple_test_f == is_gimple_formal_tmp_or_call_rhs
6355 || gimple_test_f == is_gimple_formal_tmp_reg
6356 || gimple_test_f == is_gimple_formal_tmp_var
6357 || gimple_test_f == is_gimple_call_addr
6358 || gimple_test_f == is_gimple_condexpr
6359 || gimple_test_f == is_gimple_mem_rhs
6360 || gimple_test_f == is_gimple_mem_or_call_rhs
6361 || gimple_test_f == is_gimple_reg_rhs
6362 || gimple_test_f == is_gimple_reg_or_call_rhs
6363 || gimple_test_f == is_gimple_asm_val)
6364 gcc_assert (fallback & fb_rvalue);
6365 else if (gimple_test_f == is_gimple_min_lval
6366 || gimple_test_f == is_gimple_lvalue)
6367 gcc_assert (fallback & fb_lvalue);
6368 else if (gimple_test_f == is_gimple_addressable)
6369 gcc_assert (fallback & fb_either);
6370 else if (gimple_test_f == is_gimple_stmt)
6371 gcc_assert (fallback == fb_none);
6374 /* We should have recognized the GIMPLE_TEST_F predicate to
6375 know what kind of fallback to use in case a temporary is
6376 needed to hold the value or address of *EXPR_P. */
6380 /* We used to check the predicate here and return immediately if it
6381 succeeds. This is wrong; the design is for gimplification to be
6382 idempotent, and for the predicates to only test for valid forms, not
6383 whether they are fully simplified. */
6385 pre_p = &internal_pre;
6388 post_p = &internal_post;
6390 /* Remember the last statements added to PRE_P and POST_P. Every
6391 new statement added by the gimplification helpers needs to be
6392 annotated with location information. To centralize the
6393 responsibility, we remember the last statement that had been
6394 added to both queues before gimplifying *EXPR_P. If
6395 gimplification produces new statements in PRE_P and POST_P, those
6396 statements will be annotated with the same location information
6398 pre_last_gsi = gsi_last (*pre_p);
6399 post_last_gsi = gsi_last (*post_p);
6401 saved_location = input_location;
6402 if (save_expr != error_mark_node
6403 && EXPR_HAS_LOCATION (*expr_p))
6404 input_location = EXPR_LOCATION (*expr_p);
6406 /* Loop over the specific gimplifiers until the toplevel node
6407 remains the same. */
6410 /* Strip away as many useless type conversions as possible
6412 STRIP_USELESS_TYPE_CONVERSION (*expr_p);
6414 /* Remember the expr. */
6415 save_expr = *expr_p;
6417 /* Die, die, die, my darling. */
6418 if (save_expr == error_mark_node
6419 || (TREE_TYPE (save_expr)
6420 && TREE_TYPE (save_expr) == error_mark_node))
6426 /* Do any language-specific gimplification. */
6427 ret = lang_hooks.gimplify_expr (expr_p, pre_p, post_p);
6430 if (*expr_p == NULL_TREE)
6432 if (*expr_p != save_expr)
6435 else if (ret != GS_UNHANDLED)
6439 switch (TREE_CODE (*expr_p))
6441 /* First deal with the special cases. */
6443 case POSTINCREMENT_EXPR:
6444 case POSTDECREMENT_EXPR:
6445 case PREINCREMENT_EXPR:
6446 case PREDECREMENT_EXPR:
6447 ret = gimplify_self_mod_expr (expr_p, pre_p, post_p,
6448 fallback != fb_none);
6452 case ARRAY_RANGE_REF:
6456 case VIEW_CONVERT_EXPR:
6457 ret = gimplify_compound_lval (expr_p, pre_p, post_p,
6458 fallback ? fallback : fb_rvalue);
6462 ret = gimplify_cond_expr (expr_p, pre_p, fallback);
6464 /* C99 code may assign to an array in a structure value of a
6465 conditional expression, and this has undefined behavior
6466 only on execution, so create a temporary if an lvalue is
6468 if (fallback == fb_lvalue)
6470 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6471 mark_addressable (*expr_p);
6476 ret = gimplify_call_expr (expr_p, pre_p, fallback != fb_none);
6478 /* C99 code may assign to an array in a structure returned
6479 from a function, and this has undefined behavior only on
6480 execution, so create a temporary if an lvalue is
6482 if (fallback == fb_lvalue)
6484 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6485 mark_addressable (*expr_p);
6493 ret = gimplify_compound_expr (expr_p, pre_p, fallback != fb_none);
6498 ret = gimplify_modify_expr (expr_p, pre_p, post_p,
6499 fallback != fb_none);
6502 case TRUTH_ANDIF_EXPR:
6503 case TRUTH_ORIF_EXPR:
6504 ret = gimplify_boolean_expr (expr_p);
6507 case TRUTH_NOT_EXPR:
6508 if (TREE_CODE (TREE_TYPE (*expr_p)) != BOOLEAN_TYPE)
6510 tree type = TREE_TYPE (*expr_p);
6511 *expr_p = fold_convert (type, gimple_boolify (*expr_p));
6516 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6517 is_gimple_val, fb_rvalue);
6518 recalculate_side_effects (*expr_p);
6522 ret = gimplify_addr_expr (expr_p, pre_p, post_p);
6526 ret = gimplify_va_arg_expr (expr_p, pre_p, post_p);
6530 if (IS_EMPTY_STMT (*expr_p))
6536 if (VOID_TYPE_P (TREE_TYPE (*expr_p))
6537 || fallback == fb_none)
6539 /* Just strip a conversion to void (or in void context) and
6541 *expr_p = TREE_OPERAND (*expr_p, 0);
6545 ret = gimplify_conversion (expr_p);
6546 if (ret == GS_ERROR)
6548 if (*expr_p != save_expr)
6552 case FIX_TRUNC_EXPR:
6553 /* unary_expr: ... | '(' cast ')' val | ... */
6554 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6555 is_gimple_val, fb_rvalue);
6556 recalculate_side_effects (*expr_p);
6560 *expr_p = fold_indirect_ref (*expr_p);
6561 if (*expr_p != save_expr)
6563 /* else fall through. */
6564 case ALIGN_INDIRECT_REF:
6565 case MISALIGNED_INDIRECT_REF:
6566 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6567 is_gimple_reg, fb_rvalue);
6568 recalculate_side_effects (*expr_p);
6571 /* Constants need not be gimplified. */
6582 /* If we require an lvalue, such as for ADDR_EXPR, retain the
6583 CONST_DECL node. Otherwise the decl is replaceable by its
6585 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
6586 if (fallback & fb_lvalue)
6589 *expr_p = DECL_INITIAL (*expr_p);
6593 ret = gimplify_decl_expr (expr_p, pre_p);
6597 /* FIXME make this a decl. */
6602 ret = gimplify_bind_expr (expr_p, pre_p);
6606 ret = gimplify_loop_expr (expr_p, pre_p);
6610 ret = gimplify_switch_expr (expr_p, pre_p);
6614 ret = gimplify_exit_expr (expr_p);
6618 /* If the target is not LABEL, then it is a computed jump
6619 and the target needs to be gimplified. */
6620 if (TREE_CODE (GOTO_DESTINATION (*expr_p)) != LABEL_DECL)
6622 ret = gimplify_expr (&GOTO_DESTINATION (*expr_p), pre_p,
6623 NULL, is_gimple_val, fb_rvalue);
6624 if (ret == GS_ERROR)
6627 gimplify_seq_add_stmt (pre_p,
6628 gimple_build_goto (GOTO_DESTINATION (*expr_p)));
6632 gimplify_seq_add_stmt (pre_p,
6633 gimple_build_predict (PREDICT_EXPR_PREDICTOR (*expr_p),
6634 PREDICT_EXPR_OUTCOME (*expr_p)));
6640 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p))
6641 == current_function_decl);
6642 gimplify_seq_add_stmt (pre_p,
6643 gimple_build_label (LABEL_EXPR_LABEL (*expr_p)));
6646 case CASE_LABEL_EXPR:
6647 ret = gimplify_case_label_expr (expr_p, pre_p);
6651 ret = gimplify_return_expr (*expr_p, pre_p);
6655 /* Don't reduce this in place; let gimplify_init_constructor work its
6656 magic. Buf if we're just elaborating this for side effects, just
6657 gimplify any element that has side-effects. */
6658 if (fallback == fb_none)
6660 unsigned HOST_WIDE_INT ix;
6661 constructor_elt *ce;
6662 tree temp = NULL_TREE;
6664 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (*expr_p),
6667 if (TREE_SIDE_EFFECTS (ce->value))
6668 append_to_statement_list (ce->value, &temp);
6673 /* C99 code may assign to an array in a constructed
6674 structure or union, and this has undefined behavior only
6675 on execution, so create a temporary if an lvalue is
6677 else if (fallback == fb_lvalue)
6679 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6680 mark_addressable (*expr_p);
6686 /* The following are special cases that are not handled by the
6687 original GIMPLE grammar. */
6689 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
6692 ret = gimplify_save_expr (expr_p, pre_p, post_p);
6697 enum gimplify_status r0, r1, r2;
6699 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6700 post_p, is_gimple_lvalue, fb_either);
6701 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
6702 post_p, is_gimple_val, fb_rvalue);
6703 r2 = gimplify_expr (&TREE_OPERAND (*expr_p, 2), pre_p,
6704 post_p, is_gimple_val, fb_rvalue);
6705 recalculate_side_effects (*expr_p);
6707 ret = MIN (r0, MIN (r1, r2));
6711 case NON_LVALUE_EXPR:
6712 /* This should have been stripped above. */
6716 ret = gimplify_asm_expr (expr_p, pre_p, post_p);
6719 case TRY_FINALLY_EXPR:
6720 case TRY_CATCH_EXPR:
6722 gimple_seq eval, cleanup;
6725 eval = cleanup = NULL;
6726 gimplify_and_add (TREE_OPERAND (*expr_p, 0), &eval);
6727 gimplify_and_add (TREE_OPERAND (*expr_p, 1), &cleanup);
6728 /* Don't create bogus GIMPLE_TRY with empty cleanup. */
6729 if (gimple_seq_empty_p (cleanup))
6731 gimple_seq_add_seq (pre_p, eval);
6735 try_ = gimple_build_try (eval, cleanup,
6736 TREE_CODE (*expr_p) == TRY_FINALLY_EXPR
6737 ? GIMPLE_TRY_FINALLY
6738 : GIMPLE_TRY_CATCH);
6739 if (TREE_CODE (*expr_p) == TRY_CATCH_EXPR)
6740 gimple_try_set_catch_is_cleanup (try_,
6741 TRY_CATCH_IS_CLEANUP (*expr_p));
6742 gimplify_seq_add_stmt (pre_p, try_);
6747 case CLEANUP_POINT_EXPR:
6748 ret = gimplify_cleanup_point_expr (expr_p, pre_p);
6752 ret = gimplify_target_expr (expr_p, pre_p, post_p);
6758 gimple_seq handler = NULL;
6759 gimplify_and_add (CATCH_BODY (*expr_p), &handler);
6760 c = gimple_build_catch (CATCH_TYPES (*expr_p), handler);
6761 gimplify_seq_add_stmt (pre_p, c);
6766 case EH_FILTER_EXPR:
6769 gimple_seq failure = NULL;
6771 gimplify_and_add (EH_FILTER_FAILURE (*expr_p), &failure);
6772 ehf = gimple_build_eh_filter (EH_FILTER_TYPES (*expr_p), failure);
6773 gimple_eh_filter_set_must_not_throw
6774 (ehf, EH_FILTER_MUST_NOT_THROW (*expr_p));
6775 gimplify_seq_add_stmt (pre_p, ehf);
6780 case CHANGE_DYNAMIC_TYPE_EXPR:
6784 ret = gimplify_expr (&CHANGE_DYNAMIC_TYPE_LOCATION (*expr_p),
6785 pre_p, post_p, is_gimple_reg, fb_lvalue);
6786 cdt = gimple_build_cdt (CHANGE_DYNAMIC_TYPE_NEW_TYPE (*expr_p),
6787 CHANGE_DYNAMIC_TYPE_LOCATION (*expr_p));
6788 gimplify_seq_add_stmt (pre_p, cdt);
6795 enum gimplify_status r0, r1;
6796 r0 = gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p), pre_p,
6797 post_p, is_gimple_val, fb_rvalue);
6798 r1 = gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p), pre_p,
6799 post_p, is_gimple_val, fb_rvalue);
6800 TREE_SIDE_EFFECTS (*expr_p) = 0;
6806 /* We get here when taking the address of a label. We mark
6807 the label as "forced"; meaning it can never be removed and
6808 it is a potential target for any computed goto. */
6809 FORCED_LABEL (*expr_p) = 1;
6813 case STATEMENT_LIST:
6814 ret = gimplify_statement_list (expr_p, pre_p);
6817 case WITH_SIZE_EXPR:
6819 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6820 post_p == &internal_post ? NULL : post_p,
6821 gimple_test_f, fallback);
6822 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
6823 is_gimple_val, fb_rvalue);
6829 ret = gimplify_var_or_parm_decl (expr_p);
6833 /* When within an OpenMP context, notice uses of variables. */
6834 if (gimplify_omp_ctxp)
6835 omp_notice_variable (gimplify_omp_ctxp, *expr_p, true);
6840 /* Allow callbacks into the gimplifier during optimization. */
6845 gimplify_omp_parallel (expr_p, pre_p);
6850 gimplify_omp_task (expr_p, pre_p);
6855 ret = gimplify_omp_for (expr_p, pre_p);
6860 gimplify_omp_workshare (expr_p, pre_p);
6869 gimple_seq body = NULL;
6872 gimplify_and_add (OMP_BODY (*expr_p), &body);
6873 switch (TREE_CODE (*expr_p))
6876 g = gimple_build_omp_section (body);
6879 g = gimple_build_omp_master (body);
6882 g = gimple_build_omp_ordered (body);
6885 g = gimple_build_omp_critical (body,
6886 OMP_CRITICAL_NAME (*expr_p));
6891 gimplify_seq_add_stmt (pre_p, g);
6897 ret = gimplify_omp_atomic (expr_p, pre_p);
6900 case POINTER_PLUS_EXPR:
6901 /* Convert ((type *)A)+offset into &A->field_of_type_and_offset.
6902 The second is gimple immediate saving a need for extra statement.
6904 if (TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
6905 && (tmp = maybe_fold_offset_to_address
6906 (TREE_OPERAND (*expr_p, 0), TREE_OPERAND (*expr_p, 1),
6907 TREE_TYPE (*expr_p))))
6912 /* Convert (void *)&a + 4 into (void *)&a[1]. */
6913 if (TREE_CODE (TREE_OPERAND (*expr_p, 0)) == NOP_EXPR
6914 && TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
6915 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p,
6917 && (tmp = maybe_fold_offset_to_address
6918 (TREE_OPERAND (TREE_OPERAND (*expr_p, 0), 0),
6919 TREE_OPERAND (*expr_p, 1),
6920 TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p, 0),
6923 *expr_p = fold_convert (TREE_TYPE (*expr_p), tmp);
6929 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p)))
6931 case tcc_comparison:
6932 /* Handle comparison of objects of non scalar mode aggregates
6933 with a call to memcmp. It would be nice to only have to do
6934 this for variable-sized objects, but then we'd have to allow
6935 the same nest of reference nodes we allow for MODIFY_EXPR and
6938 Compare scalar mode aggregates as scalar mode values. Using
6939 memcmp for them would be very inefficient at best, and is
6940 plain wrong if bitfields are involved. */
6942 tree type = TREE_TYPE (TREE_OPERAND (*expr_p, 1));
6944 if (!AGGREGATE_TYPE_P (type))
6946 else if (TYPE_MODE (type) != BLKmode)
6947 ret = gimplify_scalar_mode_aggregate_compare (expr_p);
6949 ret = gimplify_variable_sized_compare (expr_p);
6954 /* If *EXPR_P does not need to be special-cased, handle it
6955 according to its class. */
6957 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6958 post_p, is_gimple_val, fb_rvalue);
6964 enum gimplify_status r0, r1;
6966 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6967 post_p, is_gimple_val, fb_rvalue);
6968 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
6969 post_p, is_gimple_val, fb_rvalue);
6975 case tcc_declaration:
6978 goto dont_recalculate;
6981 gcc_assert (TREE_CODE (*expr_p) == TRUTH_AND_EXPR
6982 || TREE_CODE (*expr_p) == TRUTH_OR_EXPR
6983 || TREE_CODE (*expr_p) == TRUTH_XOR_EXPR);
6987 recalculate_side_effects (*expr_p);
6993 /* If we replaced *expr_p, gimplify again. */
6994 if (ret == GS_OK && (*expr_p == NULL || *expr_p == save_expr))
6997 while (ret == GS_OK);
6999 /* If we encountered an error_mark somewhere nested inside, either
7000 stub out the statement or propagate the error back out. */
7001 if (ret == GS_ERROR)
7008 /* This was only valid as a return value from the langhook, which
7009 we handled. Make sure it doesn't escape from any other context. */
7010 gcc_assert (ret != GS_UNHANDLED);
7012 if (fallback == fb_none && *expr_p && !is_gimple_stmt (*expr_p))
7014 /* We aren't looking for a value, and we don't have a valid
7015 statement. If it doesn't have side-effects, throw it away. */
7016 if (!TREE_SIDE_EFFECTS (*expr_p))
7018 else if (!TREE_THIS_VOLATILE (*expr_p))
7020 /* This is probably a _REF that contains something nested that
7021 has side effects. Recurse through the operands to find it. */
7022 enum tree_code code = TREE_CODE (*expr_p);
7029 case VIEW_CONVERT_EXPR:
7030 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
7031 gimple_test_f, fallback);
7035 case ARRAY_RANGE_REF:
7036 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
7037 gimple_test_f, fallback);
7038 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
7039 gimple_test_f, fallback);
7043 /* Anything else with side-effects must be converted to
7044 a valid statement before we get here. */
7050 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p))
7051 && TYPE_MODE (TREE_TYPE (*expr_p)) != BLKmode)
7053 /* Historically, the compiler has treated a bare reference
7054 to a non-BLKmode volatile lvalue as forcing a load. */
7055 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p));
7057 /* Normally, we do not want to create a temporary for a
7058 TREE_ADDRESSABLE type because such a type should not be
7059 copied by bitwise-assignment. However, we make an
7060 exception here, as all we are doing here is ensuring that
7061 we read the bytes that make up the type. We use
7062 create_tmp_var_raw because create_tmp_var will abort when
7063 given a TREE_ADDRESSABLE type. */
7064 tree tmp = create_tmp_var_raw (type, "vol");
7065 gimple_add_tmp_var (tmp);
7066 gimplify_assign (tmp, *expr_p, pre_p);
7070 /* We can't do anything useful with a volatile reference to
7071 an incomplete type, so just throw it away. Likewise for
7072 a BLKmode type, since any implicit inner load should
7073 already have been turned into an explicit one by the
7074 gimplification process. */
7078 /* If we are gimplifying at the statement level, we're done. Tack
7079 everything together and return. */
7080 if (fallback == fb_none || is_statement)
7082 /* Since *EXPR_P has been converted into a GIMPLE tuple, clear
7083 it out for GC to reclaim it. */
7084 *expr_p = NULL_TREE;
7086 if (!gimple_seq_empty_p (internal_pre)
7087 || !gimple_seq_empty_p (internal_post))
7089 gimplify_seq_add_seq (&internal_pre, internal_post);
7090 gimplify_seq_add_seq (pre_p, internal_pre);
7093 /* The result of gimplifying *EXPR_P is going to be the last few
7094 statements in *PRE_P and *POST_P. Add location information
7095 to all the statements that were added by the gimplification
7097 if (!gimple_seq_empty_p (*pre_p))
7098 annotate_all_with_location_after (*pre_p, pre_last_gsi, input_location);
7100 if (!gimple_seq_empty_p (*post_p))
7101 annotate_all_with_location_after (*post_p, post_last_gsi,
7107 #ifdef ENABLE_GIMPLE_CHECKING
7110 enum tree_code code = TREE_CODE (*expr_p);
7111 /* These expressions should already be in gimple IR form. */
7112 gcc_assert (code != MODIFY_EXPR
7114 && code != BIND_EXPR
7115 && code != CATCH_EXPR
7116 && (code != COND_EXPR || gimplify_ctxp->allow_rhs_cond_expr)
7117 && code != EH_FILTER_EXPR
7118 && code != GOTO_EXPR
7119 && code != LABEL_EXPR
7120 && code != LOOP_EXPR
7121 && code != RESX_EXPR
7122 && code != SWITCH_EXPR
7123 && code != TRY_FINALLY_EXPR
7124 && code != OMP_CRITICAL
7126 && code != OMP_MASTER
7127 && code != OMP_ORDERED
7128 && code != OMP_PARALLEL
7129 && code != OMP_SECTIONS
7130 && code != OMP_SECTION
7131 && code != OMP_SINGLE);
7135 /* Otherwise we're gimplifying a subexpression, so the resulting
7136 value is interesting. If it's a valid operand that matches
7137 GIMPLE_TEST_F, we're done. Unless we are handling some
7138 post-effects internally; if that's the case, we need to copy into
7139 a temporary before adding the post-effects to POST_P. */
7140 if (gimple_seq_empty_p (internal_post) && (*gimple_test_f) (*expr_p))
7143 /* Otherwise, we need to create a new temporary for the gimplified
7146 /* We can't return an lvalue if we have an internal postqueue. The
7147 object the lvalue refers to would (probably) be modified by the
7148 postqueue; we need to copy the value out first, which means an
7150 if ((fallback & fb_lvalue)
7151 && gimple_seq_empty_p (internal_post)
7152 && is_gimple_addressable (*expr_p))
7154 /* An lvalue will do. Take the address of the expression, store it
7155 in a temporary, and replace the expression with an INDIRECT_REF of
7157 tmp = build_fold_addr_expr (*expr_p);
7158 gimplify_expr (&tmp, pre_p, post_p, is_gimple_reg, fb_rvalue);
7159 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (tmp)), tmp);
7161 else if ((fallback & fb_rvalue) && is_gimple_formal_tmp_or_call_rhs (*expr_p))
7163 /* An rvalue will do. Assign the gimplified expression into a
7164 new temporary TMP and replace the original expression with
7165 TMP. First, make sure that the expression has a type so that
7166 it can be assigned into a temporary. */
7167 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p)));
7169 if (!gimple_seq_empty_p (internal_post) || (fallback & fb_lvalue))
7170 /* The postqueue might change the value of the expression between
7171 the initialization and use of the temporary, so we can't use a
7172 formal temp. FIXME do we care? */
7173 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
7175 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
7177 if (TREE_CODE (*expr_p) != SSA_NAME)
7178 DECL_GIMPLE_FORMAL_TEMP_P (*expr_p) = 1;
7182 #ifdef ENABLE_GIMPLE_CHECKING
7183 if (!(fallback & fb_mayfail))
7185 fprintf (stderr, "gimplification failed:\n");
7186 print_generic_expr (stderr, *expr_p, 0);
7187 debug_tree (*expr_p);
7188 internal_error ("gimplification failed");
7191 gcc_assert (fallback & fb_mayfail);
7193 /* If this is an asm statement, and the user asked for the
7194 impossible, don't die. Fail and let gimplify_asm_expr
7200 /* Make sure the temporary matches our predicate. */
7201 gcc_assert ((*gimple_test_f) (*expr_p));
7203 if (!gimple_seq_empty_p (internal_post))
7205 annotate_all_with_location (internal_post, input_location);
7206 gimplify_seq_add_seq (pre_p, internal_post);
7210 input_location = saved_location;
7214 /* Look through TYPE for variable-sized objects and gimplify each such
7215 size that we find. Add to LIST_P any statements generated. */
7218 gimplify_type_sizes (tree type, gimple_seq *list_p)
7222 if (type == NULL || type == error_mark_node)
7225 /* We first do the main variant, then copy into any other variants. */
7226 type = TYPE_MAIN_VARIANT (type);
7228 /* Avoid infinite recursion. */
7229 if (TYPE_SIZES_GIMPLIFIED (type))
7232 TYPE_SIZES_GIMPLIFIED (type) = 1;
7234 switch (TREE_CODE (type))
7240 case FIXED_POINT_TYPE:
7241 gimplify_one_sizepos (&TYPE_MIN_VALUE (type), list_p);
7242 gimplify_one_sizepos (&TYPE_MAX_VALUE (type), list_p);
7244 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
7246 TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (type);
7247 TYPE_MAX_VALUE (t) = TYPE_MAX_VALUE (type);
7252 /* These types may not have declarations, so handle them here. */
7253 gimplify_type_sizes (TREE_TYPE (type), list_p);
7254 gimplify_type_sizes (TYPE_DOMAIN (type), list_p);
7255 /* When not optimizing, ensure VLA bounds aren't removed. */
7257 && TYPE_DOMAIN (type)
7258 && INTEGRAL_TYPE_P (TYPE_DOMAIN (type)))
7260 t = TYPE_MIN_VALUE (TYPE_DOMAIN (type));
7261 if (t && TREE_CODE (t) == VAR_DECL && DECL_ARTIFICIAL (t))
7262 DECL_IGNORED_P (t) = 0;
7263 t = TYPE_MAX_VALUE (TYPE_DOMAIN (type));
7264 if (t && TREE_CODE (t) == VAR_DECL && DECL_ARTIFICIAL (t))
7265 DECL_IGNORED_P (t) = 0;
7271 case QUAL_UNION_TYPE:
7272 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
7273 if (TREE_CODE (field) == FIELD_DECL)
7275 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field), list_p);
7276 gimplify_one_sizepos (&DECL_SIZE (field), list_p);
7277 gimplify_one_sizepos (&DECL_SIZE_UNIT (field), list_p);
7278 gimplify_type_sizes (TREE_TYPE (field), list_p);
7283 case REFERENCE_TYPE:
7284 /* We used to recurse on the pointed-to type here, which turned out to
7285 be incorrect because its definition might refer to variables not
7286 yet initialized at this point if a forward declaration is involved.
7288 It was actually useful for anonymous pointed-to types to ensure
7289 that the sizes evaluation dominates every possible later use of the
7290 values. Restricting to such types here would be safe since there
7291 is no possible forward declaration around, but would introduce an
7292 undesirable middle-end semantic to anonymity. We then defer to
7293 front-ends the responsibility of ensuring that the sizes are
7294 evaluated both early and late enough, e.g. by attaching artificial
7295 type declarations to the tree. */
7302 gimplify_one_sizepos (&TYPE_SIZE (type), list_p);
7303 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type), list_p);
7305 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
7307 TYPE_SIZE (t) = TYPE_SIZE (type);
7308 TYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (type);
7309 TYPE_SIZES_GIMPLIFIED (t) = 1;
7313 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
7314 a size or position, has had all of its SAVE_EXPRs evaluated.
7315 We add any required statements to *STMT_P. */
7318 gimplify_one_sizepos (tree *expr_p, gimple_seq *stmt_p)
7320 tree type, expr = *expr_p;
7322 /* We don't do anything if the value isn't there, is constant, or contains
7323 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
7324 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
7325 will want to replace it with a new variable, but that will cause problems
7326 if this type is from outside the function. It's OK to have that here. */
7327 if (expr == NULL_TREE || TREE_CONSTANT (expr)
7328 || TREE_CODE (expr) == VAR_DECL
7329 || CONTAINS_PLACEHOLDER_P (expr))
7332 type = TREE_TYPE (expr);
7333 *expr_p = unshare_expr (expr);
7335 gimplify_expr (expr_p, stmt_p, NULL, is_gimple_val, fb_rvalue);
7338 /* Verify that we've an exact type match with the original expression.
7339 In particular, we do not wish to drop a "sizetype" in favour of a
7340 type of similar dimensions. We don't want to pollute the generic
7341 type-stripping code with this knowledge because it doesn't matter
7342 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
7343 and friends retain their "sizetype-ness". */
7344 if (TREE_TYPE (expr) != type
7345 && TREE_CODE (type) == INTEGER_TYPE
7346 && TYPE_IS_SIZETYPE (type))
7351 *expr_p = create_tmp_var (type, NULL);
7352 tmp = build1 (NOP_EXPR, type, expr);
7353 stmt = gimplify_assign (*expr_p, tmp, stmt_p);
7354 if (EXPR_HAS_LOCATION (expr))
7355 gimple_set_location (stmt, *EXPR_LOCUS (expr));
7357 gimple_set_location (stmt, input_location);
7362 /* Gimplify the body of statements pointed to by BODY_P and return a
7363 GIMPLE_BIND containing the sequence of GIMPLE statements
7364 corresponding to BODY_P. FNDECL is the function decl containing
7368 gimplify_body (tree *body_p, tree fndecl, bool do_parms)
7370 location_t saved_location = input_location;
7371 gimple_seq parm_stmts, seq;
7373 struct gimplify_ctx gctx;
7375 timevar_push (TV_TREE_GIMPLIFY);
7377 /* Initialize for optimize_insn_for_s{ize,peed}_p possibly called during
7379 default_rtl_profile ();
7381 gcc_assert (gimplify_ctxp == NULL);
7382 push_gimplify_context (&gctx);
7384 /* Unshare most shared trees in the body and in that of any nested functions.
7385 It would seem we don't have to do this for nested functions because
7386 they are supposed to be output and then the outer function gimplified
7387 first, but the g++ front end doesn't always do it that way. */
7388 unshare_body (body_p, fndecl);
7389 unvisit_body (body_p, fndecl);
7391 /* Make sure input_location isn't set to something weird. */
7392 input_location = DECL_SOURCE_LOCATION (fndecl);
7394 /* Resolve callee-copies. This has to be done before processing
7395 the body so that DECL_VALUE_EXPR gets processed correctly. */
7396 parm_stmts = (do_parms) ? gimplify_parameters () : NULL;
7398 /* Gimplify the function's body. */
7400 gimplify_stmt (body_p, &seq);
7401 outer_bind = gimple_seq_first_stmt (seq);
7404 outer_bind = gimple_build_nop ();
7405 gimplify_seq_add_stmt (&seq, outer_bind);
7408 /* The body must contain exactly one statement, a GIMPLE_BIND. If this is
7409 not the case, wrap everything in a GIMPLE_BIND to make it so. */
7410 if (gimple_code (outer_bind) == GIMPLE_BIND
7411 && gimple_seq_first (seq) == gimple_seq_last (seq))
7414 outer_bind = gimple_build_bind (NULL_TREE, seq, NULL);
7416 *body_p = NULL_TREE;
7418 /* If we had callee-copies statements, insert them at the beginning
7420 if (!gimple_seq_empty_p (parm_stmts))
7422 gimplify_seq_add_seq (&parm_stmts, gimple_bind_body (outer_bind));
7423 gimple_bind_set_body (outer_bind, parm_stmts);
7426 pop_gimplify_context (outer_bind);
7427 gcc_assert (gimplify_ctxp == NULL);
7429 #ifdef ENABLE_TYPES_CHECKING
7430 if (!errorcount && !sorrycount)
7431 verify_types_in_gimple_seq (gimple_bind_body (outer_bind));
7434 timevar_pop (TV_TREE_GIMPLIFY);
7435 input_location = saved_location;
7440 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
7441 node for the function we want to gimplify.
7443 Returns the sequence of GIMPLE statements corresponding to the body
7447 gimplify_function_tree (tree fndecl)
7449 tree oldfn, parm, ret;
7453 oldfn = current_function_decl;
7454 current_function_decl = fndecl;
7455 if (DECL_STRUCT_FUNCTION (fndecl))
7456 push_cfun (DECL_STRUCT_FUNCTION (fndecl));
7458 push_struct_function (fndecl);
7460 for (parm = DECL_ARGUMENTS (fndecl); parm ; parm = TREE_CHAIN (parm))
7462 /* Preliminarily mark non-addressed complex variables as eligible
7463 for promotion to gimple registers. We'll transform their uses
7465 if ((TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
7466 || TREE_CODE (TREE_TYPE (parm)) == VECTOR_TYPE)
7467 && !TREE_THIS_VOLATILE (parm)
7468 && !needs_to_live_in_memory (parm))
7469 DECL_GIMPLE_REG_P (parm) = 1;
7472 ret = DECL_RESULT (fndecl);
7473 if ((TREE_CODE (TREE_TYPE (ret)) == COMPLEX_TYPE
7474 || TREE_CODE (TREE_TYPE (ret)) == VECTOR_TYPE)
7475 && !needs_to_live_in_memory (ret))
7476 DECL_GIMPLE_REG_P (ret) = 1;
7478 bind = gimplify_body (&DECL_SAVED_TREE (fndecl), fndecl, true);
7480 /* The tree body of the function is no longer needed, replace it
7481 with the new GIMPLE body. */
7482 seq = gimple_seq_alloc ();
7483 gimple_seq_add_stmt (&seq, bind);
7484 gimple_set_body (fndecl, seq);
7486 /* If we're instrumenting function entry/exit, then prepend the call to
7487 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
7488 catch the exit hook. */
7489 /* ??? Add some way to ignore exceptions for this TFE. */
7490 if (flag_instrument_function_entry_exit
7491 && !DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl)
7492 && !flag_instrument_functions_exclude_p (fndecl))
7497 gimple_seq cleanup = NULL, body = NULL;
7499 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_EXIT];
7500 gimplify_seq_add_stmt (&cleanup, gimple_build_call (x, 0));
7501 tf = gimple_build_try (seq, cleanup, GIMPLE_TRY_FINALLY);
7503 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_ENTER];
7504 gimplify_seq_add_stmt (&body, gimple_build_call (x, 0));
7505 gimplify_seq_add_stmt (&body, tf);
7506 new_bind = gimple_build_bind (NULL, body, gimple_bind_block (bind));
7507 /* Clear the block for BIND, since it is no longer directly inside
7508 the function, but within a try block. */
7509 gimple_bind_set_block (bind, NULL);
7511 /* Replace the current function body with the body
7512 wrapped in the try/finally TF. */
7513 seq = gimple_seq_alloc ();
7514 gimple_seq_add_stmt (&seq, new_bind);
7515 gimple_set_body (fndecl, seq);
7518 DECL_SAVED_TREE (fndecl) = NULL_TREE;
7520 current_function_decl = oldfn;
7525 /* Some transformations like inlining may invalidate the GIMPLE form
7526 for operands. This function traverses all the operands in STMT and
7527 gimplifies anything that is not a valid gimple operand. Any new
7528 GIMPLE statements are inserted before *GSI_P. */
7531 gimple_regimplify_operands (gimple stmt, gimple_stmt_iterator *gsi_p)
7534 tree orig_lhs = NULL_TREE, lhs, t;
7535 gimple_seq pre = NULL;
7536 gimple post_stmt = NULL;
7537 struct gimplify_ctx gctx;
7539 push_gimplify_context (&gctx);
7540 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
7542 switch (gimple_code (stmt))
7545 gimplify_expr (gimple_cond_lhs_ptr (stmt), &pre, NULL,
7546 is_gimple_val, fb_rvalue);
7547 gimplify_expr (gimple_cond_rhs_ptr (stmt), &pre, NULL,
7548 is_gimple_val, fb_rvalue);
7551 gimplify_expr (gimple_switch_index_ptr (stmt), &pre, NULL,
7552 is_gimple_val, fb_rvalue);
7554 case GIMPLE_OMP_ATOMIC_LOAD:
7555 gimplify_expr (gimple_omp_atomic_load_rhs_ptr (stmt), &pre, NULL,
7556 is_gimple_val, fb_rvalue);
7560 size_t i, noutputs = gimple_asm_noutputs (stmt);
7561 const char *constraint, **oconstraints;
7562 bool allows_mem, allows_reg, is_inout;
7565 = (const char **) alloca ((noutputs) * sizeof (const char *));
7566 for (i = 0; i < noutputs; i++)
7568 tree op = gimple_asm_output_op (stmt, i);
7569 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
7570 oconstraints[i] = constraint;
7571 parse_output_constraint (&constraint, i, 0, 0, &allows_mem,
7572 &allows_reg, &is_inout);
7573 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
7574 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
7575 fb_lvalue | fb_mayfail);
7577 for (i = 0; i < gimple_asm_ninputs (stmt); i++)
7579 tree op = gimple_asm_input_op (stmt, i);
7580 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
7581 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
7582 oconstraints, &allows_mem, &allows_reg);
7583 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (op))) && allows_mem)
7585 if (!allows_reg && allows_mem)
7586 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
7587 is_gimple_lvalue, fb_lvalue | fb_mayfail);
7589 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
7590 is_gimple_asm_val, fb_rvalue);
7595 /* NOTE: We start gimplifying operands from last to first to
7596 make sure that side-effects on the RHS of calls, assignments
7597 and ASMs are executed before the LHS. The ordering is not
7598 important for other statements. */
7599 num_ops = gimple_num_ops (stmt);
7600 orig_lhs = gimple_get_lhs (stmt);
7601 for (i = num_ops; i > 0; i--)
7603 tree op = gimple_op (stmt, i - 1);
7604 if (op == NULL_TREE)
7606 if (i == 1 && (is_gimple_call (stmt) || is_gimple_assign (stmt)))
7607 gimplify_expr (&op, &pre, NULL, is_gimple_lvalue, fb_lvalue);
7609 && is_gimple_assign (stmt)
7611 && get_gimple_rhs_class (gimple_expr_code (stmt))
7612 == GIMPLE_SINGLE_RHS)
7613 gimplify_expr (&op, &pre, NULL,
7614 rhs_predicate_for (gimple_assign_lhs (stmt)),
7616 else if (i == 2 && is_gimple_call (stmt))
7618 if (TREE_CODE (op) == FUNCTION_DECL)
7620 gimplify_expr (&op, &pre, NULL, is_gimple_call_addr, fb_rvalue);
7623 gimplify_expr (&op, &pre, NULL, is_gimple_val, fb_rvalue);
7624 gimple_set_op (stmt, i - 1, op);
7627 lhs = gimple_get_lhs (stmt);
7628 /* If the LHS changed it in a way that requires a simple RHS,
7629 create temporary. */
7630 if (lhs && !is_gimple_formal_tmp_var (lhs))
7632 bool need_temp = false;
7634 if (is_gimple_assign (stmt)
7636 && get_gimple_rhs_class (gimple_expr_code (stmt))
7637 == GIMPLE_SINGLE_RHS)
7638 gimplify_expr (gimple_assign_rhs1_ptr (stmt), &pre, NULL,
7639 rhs_predicate_for (gimple_assign_lhs (stmt)),
7641 else if (is_gimple_reg (lhs))
7643 if (is_gimple_reg_type (TREE_TYPE (lhs)))
7645 if (is_gimple_call (stmt))
7647 i = gimple_call_flags (stmt);
7648 if ((i & ECF_LOOPING_CONST_OR_PURE)
7649 || !(i & (ECF_CONST | ECF_PURE)))
7652 if (stmt_can_throw_internal (stmt))
7658 if (is_gimple_reg_type (TREE_TYPE (lhs)))
7660 else if (TYPE_MODE (TREE_TYPE (lhs)) != BLKmode)
7662 if (is_gimple_call (stmt))
7664 tree fndecl = gimple_call_fndecl (stmt);
7666 if (!aggregate_value_p (TREE_TYPE (lhs), fndecl)
7667 && !(fndecl && DECL_RESULT (fndecl)
7668 && DECL_BY_REFERENCE (DECL_RESULT (fndecl))))
7677 tree temp = create_tmp_var (TREE_TYPE (lhs), NULL);
7679 DECL_GIMPLE_FORMAL_TEMP_P (temp) = 1;
7680 if (TREE_CODE (TREE_TYPE (lhs)) == COMPLEX_TYPE
7681 || TREE_CODE (TREE_TYPE (lhs)) == VECTOR_TYPE)
7682 DECL_GIMPLE_REG_P (temp) = 1;
7683 if (TREE_CODE (orig_lhs) == SSA_NAME)
7684 orig_lhs = SSA_NAME_VAR (orig_lhs);
7685 if (TREE_CODE (orig_lhs) == VAR_DECL
7686 && DECL_BASED_ON_RESTRICT_P (orig_lhs))
7688 DECL_BASED_ON_RESTRICT_P (temp) = 1;
7689 SET_DECL_RESTRICT_BASE (temp,
7690 DECL_GET_RESTRICT_BASE (orig_lhs));
7693 if (gimple_in_ssa_p (cfun))
7694 temp = make_ssa_name (temp, NULL);
7695 gimple_set_lhs (stmt, temp);
7696 post_stmt = gimple_build_assign (lhs, temp);
7697 if (TREE_CODE (lhs) == SSA_NAME)
7698 SSA_NAME_DEF_STMT (lhs) = post_stmt;
7704 if (gimple_referenced_vars (cfun))
7705 for (t = gimplify_ctxp->temps; t ; t = TREE_CHAIN (t))
7706 add_referenced_var (t);
7708 if (!gimple_seq_empty_p (pre))
7710 if (gimple_in_ssa_p (cfun))
7712 gimple_stmt_iterator i;
7714 for (i = gsi_start (pre); !gsi_end_p (i); gsi_next (&i))
7715 mark_symbols_for_renaming (gsi_stmt (i));
7717 gsi_insert_seq_before (gsi_p, pre, GSI_SAME_STMT);
7720 gsi_insert_after (gsi_p, post_stmt, GSI_NEW_STMT);
7722 pop_gimplify_context (NULL);
7726 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
7727 force the result to be either ssa_name or an invariant, otherwise
7728 just force it to be a rhs expression. If VAR is not NULL, make the
7729 base variable of the final destination be VAR if suitable. */
7732 force_gimple_operand (tree expr, gimple_seq *stmts, bool simple, tree var)
7735 enum gimplify_status ret;
7736 gimple_predicate gimple_test_f;
7737 struct gimplify_ctx gctx;
7741 if (is_gimple_val (expr))
7744 gimple_test_f = simple ? is_gimple_val : is_gimple_reg_rhs;
7746 push_gimplify_context (&gctx);
7747 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
7748 gimplify_ctxp->allow_rhs_cond_expr = true;
7751 expr = build2 (MODIFY_EXPR, TREE_TYPE (var), var, expr);
7753 if (TREE_CODE (expr) != MODIFY_EXPR
7754 && TREE_TYPE (expr) == void_type_node)
7756 gimplify_and_add (expr, stmts);
7761 ret = gimplify_expr (&expr, stmts, NULL, gimple_test_f, fb_rvalue);
7762 gcc_assert (ret != GS_ERROR);
7765 if (gimple_referenced_vars (cfun))
7766 for (t = gimplify_ctxp->temps; t ; t = TREE_CHAIN (t))
7767 add_referenced_var (t);
7769 pop_gimplify_context (NULL);
7774 /* Invokes force_gimple_operand for EXPR with parameters SIMPLE_P and VAR. If
7775 some statements are produced, emits them at GSI. If BEFORE is true.
7776 the statements are appended before GSI, otherwise they are appended after
7777 it. M specifies the way GSI moves after insertion (GSI_SAME_STMT or
7778 GSI_CONTINUE_LINKING are the usual values). */
7781 force_gimple_operand_gsi (gimple_stmt_iterator *gsi, tree expr,
7782 bool simple_p, tree var, bool before,
7783 enum gsi_iterator_update m)
7787 expr = force_gimple_operand (expr, &stmts, simple_p, var);
7789 if (!gimple_seq_empty_p (stmts))
7791 if (gimple_in_ssa_p (cfun))
7793 gimple_stmt_iterator i;
7795 for (i = gsi_start (stmts); !gsi_end_p (i); gsi_next (&i))
7796 mark_symbols_for_renaming (gsi_stmt (i));
7800 gsi_insert_seq_before (gsi, stmts, m);
7802 gsi_insert_seq_after (gsi, stmts, m);
7808 #include "gt-gimplify.h"