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, 2011
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"
30 #include "tree-iterator.h"
31 #include "tree-inline.h"
32 #include "tree-pretty-print.h"
33 #include "langhooks.h"
34 #include "tree-flow.h"
42 #include "diagnostic-core.h"
44 #include "pointer-set.h"
45 #include "splay-tree.h"
48 #include "tree-pass.h"
50 #include "langhooks-def.h" /* FIXME: for lhd_set_decl_assembler_name. */
51 #include "expr.h" /* FIXME: for can_move_by_pieces
52 and STACK_CHECK_MAX_VAR_SIZE. */
54 enum gimplify_omp_var_data
60 GOVD_FIRSTPRIVATE = 16,
61 GOVD_LASTPRIVATE = 32,
64 GOVD_DEBUG_PRIVATE = 256,
65 GOVD_PRIVATE_OUTER_REF = 512,
66 GOVD_DATA_SHARE_CLASS = (GOVD_SHARED | GOVD_PRIVATE | GOVD_FIRSTPRIVATE
67 | GOVD_LASTPRIVATE | GOVD_REDUCTION | GOVD_LOCAL)
75 ORT_COMBINED_PARALLEL = 3,
80 struct gimplify_omp_ctx
82 struct gimplify_omp_ctx *outer_context;
84 struct pointer_set_t *privatized_types;
86 enum omp_clause_default_kind default_kind;
87 enum omp_region_type region_type;
90 static struct gimplify_ctx *gimplify_ctxp;
91 static struct gimplify_omp_ctx *gimplify_omp_ctxp;
94 /* Formal (expression) temporary table handling: Multiple occurrences of
95 the same scalar expression are evaluated into the same temporary. */
97 typedef struct gimple_temp_hash_elt
100 tree temp; /* Value */
103 /* Forward declarations. */
104 static enum gimplify_status gimplify_compound_expr (tree *, gimple_seq *, bool);
106 /* Mark X addressable. Unlike the langhook we expect X to be in gimple
107 form and we don't do any syntax checking. */
109 mark_addressable (tree x)
111 while (handled_component_p (x))
112 x = TREE_OPERAND (x, 0);
113 if (TREE_CODE (x) == MEM_REF
114 && TREE_CODE (TREE_OPERAND (x, 0)) == ADDR_EXPR)
115 x = TREE_OPERAND (TREE_OPERAND (x, 0), 0);
116 if (TREE_CODE (x) != VAR_DECL
117 && TREE_CODE (x) != PARM_DECL
118 && TREE_CODE (x) != RESULT_DECL)
120 TREE_ADDRESSABLE (x) = 1;
123 /* Return a hash value for a formal temporary table entry. */
126 gimple_tree_hash (const void *p)
128 tree t = ((const elt_t *) p)->val;
129 return iterative_hash_expr (t, 0);
132 /* Compare two formal temporary table entries. */
135 gimple_tree_eq (const void *p1, const void *p2)
137 tree t1 = ((const elt_t *) p1)->val;
138 tree t2 = ((const elt_t *) p2)->val;
139 enum tree_code code = TREE_CODE (t1);
141 if (TREE_CODE (t2) != code
142 || TREE_TYPE (t1) != TREE_TYPE (t2))
145 if (!operand_equal_p (t1, t2, 0))
148 #ifdef ENABLE_CHECKING
149 /* Only allow them to compare equal if they also hash equal; otherwise
150 results are nondeterminate, and we fail bootstrap comparison. */
151 gcc_assert (gimple_tree_hash (p1) == gimple_tree_hash (p2));
157 /* Link gimple statement GS to the end of the sequence *SEQ_P. If
158 *SEQ_P is NULL, a new sequence is allocated. This function is
159 similar to gimple_seq_add_stmt, but does not scan the operands.
160 During gimplification, we need to manipulate statement sequences
161 before the def/use vectors have been constructed. */
164 gimplify_seq_add_stmt (gimple_seq *seq_p, gimple gs)
166 gimple_stmt_iterator si;
172 *seq_p = gimple_seq_alloc ();
174 si = gsi_last (*seq_p);
176 gsi_insert_after_without_update (&si, gs, GSI_NEW_STMT);
179 /* Append sequence SRC to the end of sequence *DST_P. If *DST_P is
180 NULL, a new sequence is allocated. This function is
181 similar to gimple_seq_add_seq, but does not scan the operands.
182 During gimplification, we need to manipulate statement sequences
183 before the def/use vectors have been constructed. */
186 gimplify_seq_add_seq (gimple_seq *dst_p, gimple_seq src)
188 gimple_stmt_iterator si;
194 *dst_p = gimple_seq_alloc ();
196 si = gsi_last (*dst_p);
197 gsi_insert_seq_after_without_update (&si, src, GSI_NEW_STMT);
200 /* Set up a context for the gimplifier. */
203 push_gimplify_context (struct gimplify_ctx *c)
205 memset (c, '\0', sizeof (*c));
206 c->prev_context = gimplify_ctxp;
210 /* Tear down a context for the gimplifier. If BODY is non-null, then
211 put the temporaries into the outer BIND_EXPR. Otherwise, put them
214 BODY is not a sequence, but the first tuple in a sequence. */
217 pop_gimplify_context (gimple body)
219 struct gimplify_ctx *c = gimplify_ctxp;
221 gcc_assert (c && (c->bind_expr_stack == NULL
222 || VEC_empty (gimple, c->bind_expr_stack)));
223 VEC_free (gimple, heap, c->bind_expr_stack);
224 gimplify_ctxp = c->prev_context;
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 /* Both gimplify the statement T and append it to *SEQ_P. This function
346 behaves exactly as gimplify_stmt, but you don't have to pass T as a
350 gimplify_and_add (tree t, gimple_seq *seq_p)
352 gimplify_stmt (&t, seq_p);
355 /* Gimplify statement T into sequence *SEQ_P, and return the first
356 tuple in the sequence of generated tuples for this statement.
357 Return NULL if gimplifying T produced no tuples. */
360 gimplify_and_return_first (tree t, gimple_seq *seq_p)
362 gimple_stmt_iterator last = gsi_last (*seq_p);
364 gimplify_and_add (t, seq_p);
366 if (!gsi_end_p (last))
369 return gsi_stmt (last);
372 return gimple_seq_first_stmt (*seq_p);
375 /* Strip off a legitimate source ending from the input string NAME of
376 length LEN. Rather than having to know the names used by all of
377 our front ends, we strip off an ending of a period followed by
378 up to five characters. (Java uses ".class".) */
381 remove_suffix (char *name, int len)
385 for (i = 2; i < 8 && len > i; i++)
387 if (name[len - i] == '.')
389 name[len - i] = '\0';
395 /* Create a new temporary name with PREFIX. Returns an identifier. */
397 static GTY(()) unsigned int tmp_var_id_num;
400 create_tmp_var_name (const char *prefix)
406 char *preftmp = ASTRDUP (prefix);
408 remove_suffix (preftmp, strlen (preftmp));
412 ASM_FORMAT_PRIVATE_NAME (tmp_name, prefix ? prefix : "T", tmp_var_id_num++);
413 return get_identifier (tmp_name);
417 /* Create a new temporary variable declaration of type TYPE.
418 Does NOT push it into the current binding. */
421 create_tmp_var_raw (tree type, const char *prefix)
426 /* Make the type of the variable writable. */
427 new_type = build_type_variant (type, 0, 0);
428 TYPE_ATTRIBUTES (new_type) = TYPE_ATTRIBUTES (type);
430 tmp_var = build_decl (input_location,
431 VAR_DECL, prefix ? create_tmp_var_name (prefix) : NULL,
434 /* The variable was declared by the compiler. */
435 DECL_ARTIFICIAL (tmp_var) = 1;
436 /* And we don't want debug info for it. */
437 DECL_IGNORED_P (tmp_var) = 1;
439 /* Make the variable writable. */
440 TREE_READONLY (tmp_var) = 0;
442 DECL_EXTERNAL (tmp_var) = 0;
443 TREE_STATIC (tmp_var) = 0;
444 TREE_USED (tmp_var) = 1;
449 /* Create a new temporary variable declaration of type TYPE. DOES push the
450 variable into the current binding. Further, assume that this is called
451 only from gimplification or optimization, at which point the creation of
452 certain types are bugs. */
455 create_tmp_var (tree type, const char *prefix)
459 /* We don't allow types that are addressable (meaning we can't make copies),
460 or incomplete. We also used to reject every variable size objects here,
461 but now support those for which a constant upper bound can be obtained.
462 The processing for variable sizes is performed in gimple_add_tmp_var,
463 point at which it really matters and possibly reached via paths not going
464 through this function, e.g. after direct calls to create_tmp_var_raw. */
465 gcc_assert (!TREE_ADDRESSABLE (type) && COMPLETE_TYPE_P (type));
467 tmp_var = create_tmp_var_raw (type, prefix);
468 gimple_add_tmp_var (tmp_var);
472 /* Create a new temporary variable declaration of type TYPE by calling
473 create_tmp_var and if TYPE is a vector or a complex number, mark the new
474 temporary as gimple register. */
477 create_tmp_reg (tree type, const char *prefix)
481 tmp = create_tmp_var (type, prefix);
482 if (TREE_CODE (type) == COMPLEX_TYPE
483 || TREE_CODE (type) == VECTOR_TYPE)
484 DECL_GIMPLE_REG_P (tmp) = 1;
489 /* Create a temporary with a name derived from VAL. Subroutine of
490 lookup_tmp_var; nobody else should call this function. */
493 create_tmp_from_val (tree val)
495 return create_tmp_var (TREE_TYPE (val), get_name (val));
498 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
499 an existing expression temporary. */
502 lookup_tmp_var (tree val, bool is_formal)
506 /* If not optimizing, never really reuse a temporary. local-alloc
507 won't allocate any variable that is used in more than one basic
508 block, which means it will go into memory, causing much extra
509 work in reload and final and poorer code generation, outweighing
510 the extra memory allocation here. */
511 if (!optimize || !is_formal || TREE_SIDE_EFFECTS (val))
512 ret = create_tmp_from_val (val);
519 if (gimplify_ctxp->temp_htab == NULL)
520 gimplify_ctxp->temp_htab
521 = htab_create (1000, gimple_tree_hash, gimple_tree_eq, free);
522 slot = htab_find_slot (gimplify_ctxp->temp_htab, (void *)&elt, INSERT);
525 elt_p = XNEW (elt_t);
527 elt_p->temp = ret = create_tmp_from_val (val);
528 *slot = (void *) elt_p;
532 elt_p = (elt_t *) *slot;
541 /* Return true if T is a CALL_EXPR or an expression that can be
542 assigned to a temporary. Note that this predicate should only be
543 used during gimplification. See the rationale for this in
544 gimplify_modify_expr. */
547 is_gimple_reg_rhs_or_call (tree t)
549 return (get_gimple_rhs_class (TREE_CODE (t)) != GIMPLE_INVALID_RHS
550 || TREE_CODE (t) == CALL_EXPR);
553 /* Return true if T is a valid memory RHS or a CALL_EXPR. Note that
554 this predicate should only be used during gimplification. See the
555 rationale for this in gimplify_modify_expr. */
558 is_gimple_mem_rhs_or_call (tree t)
560 /* If we're dealing with a renamable type, either source or dest must be
561 a renamed variable. */
562 if (is_gimple_reg_type (TREE_TYPE (t)))
563 return is_gimple_val (t);
565 return (is_gimple_val (t) || is_gimple_lvalue (t)
566 || TREE_CODE (t) == CALL_EXPR);
569 /* Helper for get_formal_tmp_var and get_initialized_tmp_var. */
572 internal_get_tmp_var (tree val, gimple_seq *pre_p, gimple_seq *post_p,
577 /* Notice that we explicitly allow VAL to be a CALL_EXPR so that we
578 can create an INIT_EXPR and convert it into a GIMPLE_CALL below. */
579 gimplify_expr (&val, pre_p, post_p, is_gimple_reg_rhs_or_call,
582 t = lookup_tmp_var (val, is_formal);
585 && (TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
586 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE))
587 DECL_GIMPLE_REG_P (t) = 1;
589 mod = build2 (INIT_EXPR, TREE_TYPE (t), t, unshare_expr (val));
591 SET_EXPR_LOCATION (mod, EXPR_LOC_OR_HERE (val));
593 /* gimplify_modify_expr might want to reduce this further. */
594 gimplify_and_add (mod, pre_p);
597 /* If we're gimplifying into ssa, gimplify_modify_expr will have
598 given our temporary an SSA name. Find and return it. */
599 if (gimplify_ctxp->into_ssa)
601 gimple last = gimple_seq_last_stmt (*pre_p);
602 t = gimple_get_lhs (last);
608 /* Returns a formal temporary variable initialized with VAL. PRE_P is as
609 in gimplify_expr. Only use this function if:
611 1) The value of the unfactored expression represented by VAL will not
612 change between the initialization and use of the temporary, and
613 2) The temporary will not be otherwise modified.
615 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
616 and #2 means it is inappropriate for && temps.
618 For other cases, use get_initialized_tmp_var instead. */
621 get_formal_tmp_var (tree val, gimple_seq *pre_p)
623 return internal_get_tmp_var (val, pre_p, NULL, true);
626 /* Returns a temporary variable initialized with VAL. PRE_P and POST_P
627 are as in gimplify_expr. */
630 get_initialized_tmp_var (tree val, gimple_seq *pre_p, gimple_seq *post_p)
632 return internal_get_tmp_var (val, pre_p, post_p, false);
635 /* Declares all the variables in VARS in SCOPE. If DEBUG_INFO is
636 true, generate debug info for them; otherwise don't. */
639 declare_vars (tree vars, gimple scope, bool debug_info)
646 gcc_assert (gimple_code (scope) == GIMPLE_BIND);
648 temps = nreverse (last);
650 block = gimple_bind_block (scope);
651 gcc_assert (!block || TREE_CODE (block) == BLOCK);
652 if (!block || !debug_info)
654 DECL_CHAIN (last) = gimple_bind_vars (scope);
655 gimple_bind_set_vars (scope, temps);
659 /* We need to attach the nodes both to the BIND_EXPR and to its
660 associated BLOCK for debugging purposes. The key point here
661 is that the BLOCK_VARS of the BIND_EXPR_BLOCK of a BIND_EXPR
662 is a subchain of the BIND_EXPR_VARS of the BIND_EXPR. */
663 if (BLOCK_VARS (block))
664 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), temps);
667 gimple_bind_set_vars (scope,
668 chainon (gimple_bind_vars (scope), temps));
669 BLOCK_VARS (block) = temps;
675 /* For VAR a VAR_DECL of variable size, try to find a constant upper bound
676 for the size and adjust DECL_SIZE/DECL_SIZE_UNIT accordingly. Abort if
677 no such upper bound can be obtained. */
680 force_constant_size (tree var)
682 /* The only attempt we make is by querying the maximum size of objects
683 of the variable's type. */
685 HOST_WIDE_INT max_size;
687 gcc_assert (TREE_CODE (var) == VAR_DECL);
689 max_size = max_int_size_in_bytes (TREE_TYPE (var));
691 gcc_assert (max_size >= 0);
694 = build_int_cst (TREE_TYPE (DECL_SIZE_UNIT (var)), max_size);
696 = build_int_cst (TREE_TYPE (DECL_SIZE (var)), max_size * BITS_PER_UNIT);
700 gimple_add_tmp_var (tree tmp)
702 gcc_assert (!DECL_CHAIN (tmp) && !DECL_SEEN_IN_BIND_EXPR_P (tmp));
704 /* Later processing assumes that the object size is constant, which might
705 not be true at this point. Force the use of a constant upper bound in
707 if (!host_integerp (DECL_SIZE_UNIT (tmp), 1))
708 force_constant_size (tmp);
710 DECL_CONTEXT (tmp) = current_function_decl;
711 DECL_SEEN_IN_BIND_EXPR_P (tmp) = 1;
715 DECL_CHAIN (tmp) = gimplify_ctxp->temps;
716 gimplify_ctxp->temps = tmp;
718 /* Mark temporaries local within the nearest enclosing parallel. */
719 if (gimplify_omp_ctxp)
721 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
722 while (ctx && ctx->region_type == ORT_WORKSHARE)
723 ctx = ctx->outer_context;
725 omp_add_variable (ctx, tmp, GOVD_LOCAL | GOVD_SEEN);
734 /* This case is for nested functions. We need to expose the locals
736 body_seq = gimple_body (current_function_decl);
737 declare_vars (tmp, gimple_seq_first_stmt (body_seq), false);
741 /* Determines whether to assign a location to the statement GS. */
744 should_carry_location_p (gimple gs)
746 /* Don't emit a line note for a label. We particularly don't want to
747 emit one for the break label, since it doesn't actually correspond
748 to the beginning of the loop/switch. */
749 if (gimple_code (gs) == GIMPLE_LABEL)
756 /* Return true if a location should not be emitted for this statement
757 by annotate_one_with_location. */
760 gimple_do_not_emit_location_p (gimple g)
762 return gimple_plf (g, GF_PLF_1);
765 /* Mark statement G so a location will not be emitted by
766 annotate_one_with_location. */
769 gimple_set_do_not_emit_location (gimple g)
771 /* The PLF flags are initialized to 0 when a new tuple is created,
772 so no need to initialize it anywhere. */
773 gimple_set_plf (g, GF_PLF_1, true);
776 /* Set the location for gimple statement GS to LOCATION. */
779 annotate_one_with_location (gimple gs, location_t location)
781 if (!gimple_has_location (gs)
782 && !gimple_do_not_emit_location_p (gs)
783 && should_carry_location_p (gs))
784 gimple_set_location (gs, location);
788 /* Set LOCATION for all the statements after iterator GSI in sequence
789 SEQ. If GSI is pointing to the end of the sequence, start with the
790 first statement in SEQ. */
793 annotate_all_with_location_after (gimple_seq seq, gimple_stmt_iterator gsi,
797 gsi = gsi_start (seq);
801 for (; !gsi_end_p (gsi); gsi_next (&gsi))
802 annotate_one_with_location (gsi_stmt (gsi), location);
806 /* Set the location for all the statements in a sequence STMT_P to LOCATION. */
809 annotate_all_with_location (gimple_seq stmt_p, location_t location)
811 gimple_stmt_iterator i;
813 if (gimple_seq_empty_p (stmt_p))
816 for (i = gsi_start (stmt_p); !gsi_end_p (i); gsi_next (&i))
818 gimple gs = gsi_stmt (i);
819 annotate_one_with_location (gs, location);
823 /* This page contains routines to unshare tree nodes, i.e. to duplicate tree
824 nodes that are referenced more than once in GENERIC functions. This is
825 necessary because gimplification (translation into GIMPLE) is performed
826 by modifying tree nodes in-place, so gimplication of a shared node in a
827 first context could generate an invalid GIMPLE form in a second context.
829 This is achieved with a simple mark/copy/unmark algorithm that walks the
830 GENERIC representation top-down, marks nodes with TREE_VISITED the first
831 time it encounters them, duplicates them if they already have TREE_VISITED
832 set, and finally removes the TREE_VISITED marks it has set.
834 The algorithm works only at the function level, i.e. it generates a GENERIC
835 representation of a function with no nodes shared within the function when
836 passed a GENERIC function (except for nodes that are allowed to be shared).
838 At the global level, it is also necessary to unshare tree nodes that are
839 referenced in more than one function, for the same aforementioned reason.
840 This requires some cooperation from the front-end. There are 2 strategies:
842 1. Manual unsharing. The front-end needs to call unshare_expr on every
843 expression that might end up being shared across functions.
845 2. Deep unsharing. This is an extension of regular unsharing. Instead
846 of calling unshare_expr on expressions that might be shared across
847 functions, the front-end pre-marks them with TREE_VISITED. This will
848 ensure that they are unshared on the first reference within functions
849 when the regular unsharing algorithm runs. The counterpart is that
850 this algorithm must look deeper than for manual unsharing, which is
851 specified by LANG_HOOKS_DEEP_UNSHARING.
853 If there are only few specific cases of node sharing across functions, it is
854 probably easier for a front-end to unshare the expressions manually. On the
855 contrary, if the expressions generated at the global level are as widespread
856 as expressions generated within functions, deep unsharing is very likely the
859 /* Similar to copy_tree_r but do not copy SAVE_EXPR or TARGET_EXPR nodes.
860 These nodes model computations that should only be done once. If we
861 were to unshare something like SAVE_EXPR(i++), the gimplification
862 process would create wrong code. */
865 mostly_copy_tree_r (tree *tp, int *walk_subtrees, void *data)
868 enum tree_code code = TREE_CODE (t);
870 /* Do not copy SAVE_EXPR, TARGET_EXPR or BIND_EXPR nodes themselves, but
871 copy their subtrees if we can make sure to do it only once. */
872 if (code == SAVE_EXPR || code == TARGET_EXPR || code == BIND_EXPR)
874 if (data && !pointer_set_insert ((struct pointer_set_t *)data, t))
880 /* Stop at types, decls, constants like copy_tree_r. */
881 else if (TREE_CODE_CLASS (code) == tcc_type
882 || TREE_CODE_CLASS (code) == tcc_declaration
883 || TREE_CODE_CLASS (code) == tcc_constant
884 /* We can't do anything sensible with a BLOCK used as an
885 expression, but we also can't just die when we see it
886 because of non-expression uses. So we avert our eyes
887 and cross our fingers. Silly Java. */
891 /* Cope with the statement expression extension. */
892 else if (code == STATEMENT_LIST)
895 /* Leave the bulk of the work to copy_tree_r itself. */
897 copy_tree_r (tp, walk_subtrees, NULL);
902 /* Callback for walk_tree to unshare most of the shared trees rooted at
903 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
904 then *TP is deep copied by calling mostly_copy_tree_r. */
907 copy_if_shared_r (tree *tp, int *walk_subtrees, void *data)
910 enum tree_code code = TREE_CODE (t);
912 /* Skip types, decls, and constants. But we do want to look at their
913 types and the bounds of types. Mark them as visited so we properly
914 unmark their subtrees on the unmark pass. If we've already seen them,
915 don't look down further. */
916 if (TREE_CODE_CLASS (code) == tcc_type
917 || TREE_CODE_CLASS (code) == tcc_declaration
918 || TREE_CODE_CLASS (code) == tcc_constant)
920 if (TREE_VISITED (t))
923 TREE_VISITED (t) = 1;
926 /* If this node has been visited already, unshare it and don't look
928 else if (TREE_VISITED (t))
930 walk_tree (tp, mostly_copy_tree_r, data, NULL);
934 /* Otherwise, mark the node as visited and keep looking. */
936 TREE_VISITED (t) = 1;
941 /* Unshare most of the shared trees rooted at *TP. */
944 copy_if_shared (tree *tp)
946 /* If the language requires deep unsharing, we need a pointer set to make
947 sure we don't repeatedly unshare subtrees of unshareable nodes. */
948 struct pointer_set_t *visited
949 = lang_hooks.deep_unsharing ? pointer_set_create () : NULL;
950 walk_tree (tp, copy_if_shared_r, visited, NULL);
952 pointer_set_destroy (visited);
955 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
956 bodies of any nested functions if we are unsharing the entire body of
960 unshare_body (tree *body_p, tree fndecl)
962 struct cgraph_node *cgn = cgraph_node (fndecl);
964 copy_if_shared (body_p);
966 if (body_p == &DECL_SAVED_TREE (fndecl))
967 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
968 unshare_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
971 /* Callback for walk_tree to unmark the visited trees rooted at *TP.
972 Subtrees are walked until the first unvisited node is encountered. */
975 unmark_visited_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
979 /* If this node has been visited, unmark it and keep looking. */
980 if (TREE_VISITED (t))
981 TREE_VISITED (t) = 0;
983 /* Otherwise, don't look any deeper. */
990 /* Unmark the visited trees rooted at *TP. */
993 unmark_visited (tree *tp)
995 walk_tree (tp, unmark_visited_r, NULL, NULL);
998 /* Likewise, but mark all trees as not visited. */
1001 unvisit_body (tree *body_p, tree fndecl)
1003 struct cgraph_node *cgn = cgraph_node (fndecl);
1005 unmark_visited (body_p);
1007 if (body_p == &DECL_SAVED_TREE (fndecl))
1008 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
1009 unvisit_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
1012 /* Unconditionally make an unshared copy of EXPR. This is used when using
1013 stored expressions which span multiple functions, such as BINFO_VTABLE,
1014 as the normal unsharing process can't tell that they're shared. */
1017 unshare_expr (tree expr)
1019 walk_tree (&expr, mostly_copy_tree_r, NULL, NULL);
1023 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
1024 contain statements and have a value. Assign its value to a temporary
1025 and give it void_type_node. Returns the temporary, or NULL_TREE if
1026 WRAPPER was already void. */
1029 voidify_wrapper_expr (tree wrapper, tree temp)
1031 tree type = TREE_TYPE (wrapper);
1032 if (type && !VOID_TYPE_P (type))
1036 /* Set p to point to the body of the wrapper. Loop until we find
1037 something that isn't a wrapper. */
1038 for (p = &wrapper; p && *p; )
1040 switch (TREE_CODE (*p))
1043 TREE_SIDE_EFFECTS (*p) = 1;
1044 TREE_TYPE (*p) = void_type_node;
1045 /* For a BIND_EXPR, the body is operand 1. */
1046 p = &BIND_EXPR_BODY (*p);
1049 case CLEANUP_POINT_EXPR:
1050 case TRY_FINALLY_EXPR:
1051 case TRY_CATCH_EXPR:
1052 TREE_SIDE_EFFECTS (*p) = 1;
1053 TREE_TYPE (*p) = void_type_node;
1054 p = &TREE_OPERAND (*p, 0);
1057 case STATEMENT_LIST:
1059 tree_stmt_iterator i = tsi_last (*p);
1060 TREE_SIDE_EFFECTS (*p) = 1;
1061 TREE_TYPE (*p) = void_type_node;
1062 p = tsi_end_p (i) ? NULL : tsi_stmt_ptr (i);
1067 /* Advance to the last statement. Set all container types to void. */
1068 for (; TREE_CODE (*p) == COMPOUND_EXPR; p = &TREE_OPERAND (*p, 1))
1070 TREE_SIDE_EFFECTS (*p) = 1;
1071 TREE_TYPE (*p) = void_type_node;
1081 if (p == NULL || IS_EMPTY_STMT (*p))
1085 /* The wrapper is on the RHS of an assignment that we're pushing
1087 gcc_assert (TREE_CODE (temp) == INIT_EXPR
1088 || TREE_CODE (temp) == MODIFY_EXPR);
1089 TREE_OPERAND (temp, 1) = *p;
1094 temp = create_tmp_var (type, "retval");
1095 *p = build2 (INIT_EXPR, type, temp, *p);
1104 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
1105 a temporary through which they communicate. */
1108 build_stack_save_restore (gimple *save, gimple *restore)
1112 *save = gimple_build_call (implicit_built_in_decls[BUILT_IN_STACK_SAVE], 0);
1113 tmp_var = create_tmp_var (ptr_type_node, "saved_stack");
1114 gimple_call_set_lhs (*save, tmp_var);
1116 *restore = gimple_build_call (implicit_built_in_decls[BUILT_IN_STACK_RESTORE],
1120 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
1122 static enum gimplify_status
1123 gimplify_bind_expr (tree *expr_p, gimple_seq *pre_p)
1125 tree bind_expr = *expr_p;
1126 bool old_save_stack = gimplify_ctxp->save_stack;
1131 tree temp = voidify_wrapper_expr (bind_expr, NULL);
1133 /* Mark variables seen in this bind expr. */
1134 for (t = BIND_EXPR_VARS (bind_expr); t ; t = DECL_CHAIN (t))
1136 if (TREE_CODE (t) == VAR_DECL)
1138 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
1140 /* Mark variable as local. */
1141 if (ctx && !DECL_EXTERNAL (t)
1142 && (! DECL_SEEN_IN_BIND_EXPR_P (t)
1143 || splay_tree_lookup (ctx->variables,
1144 (splay_tree_key) t) == NULL))
1145 omp_add_variable (gimplify_omp_ctxp, t, GOVD_LOCAL | GOVD_SEEN);
1147 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
1149 if (DECL_HARD_REGISTER (t) && !is_global_var (t) && cfun)
1150 cfun->has_local_explicit_reg_vars = true;
1153 /* Preliminarily mark non-addressed complex variables as eligible
1154 for promotion to gimple registers. We'll transform their uses
1156 if ((TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
1157 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
1158 && !TREE_THIS_VOLATILE (t)
1159 && (TREE_CODE (t) == VAR_DECL && !DECL_HARD_REGISTER (t))
1160 && !needs_to_live_in_memory (t))
1161 DECL_GIMPLE_REG_P (t) = 1;
1164 gimple_bind = gimple_build_bind (BIND_EXPR_VARS (bind_expr), NULL,
1165 BIND_EXPR_BLOCK (bind_expr));
1166 gimple_push_bind_expr (gimple_bind);
1168 gimplify_ctxp->save_stack = false;
1170 /* Gimplify the body into the GIMPLE_BIND tuple's body. */
1172 gimplify_stmt (&BIND_EXPR_BODY (bind_expr), &body);
1173 gimple_bind_set_body (gimple_bind, body);
1175 if (gimplify_ctxp->save_stack)
1177 gimple stack_save, stack_restore, gs;
1178 gimple_seq cleanup, new_body;
1180 /* Save stack on entry and restore it on exit. Add a try_finally
1181 block to achieve this. Note that mudflap depends on the
1182 format of the emitted code: see mx_register_decls(). */
1183 build_stack_save_restore (&stack_save, &stack_restore);
1185 cleanup = new_body = NULL;
1186 gimplify_seq_add_stmt (&cleanup, stack_restore);
1187 gs = gimple_build_try (gimple_bind_body (gimple_bind), cleanup,
1188 GIMPLE_TRY_FINALLY);
1190 gimplify_seq_add_stmt (&new_body, stack_save);
1191 gimplify_seq_add_stmt (&new_body, gs);
1192 gimple_bind_set_body (gimple_bind, new_body);
1195 gimplify_ctxp->save_stack = old_save_stack;
1196 gimple_pop_bind_expr ();
1198 gimplify_seq_add_stmt (pre_p, gimple_bind);
1206 *expr_p = NULL_TREE;
1210 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1211 GIMPLE value, it is assigned to a new temporary and the statement is
1212 re-written to return the temporary.
1214 PRE_P points to the sequence where side effects that must happen before
1215 STMT should be stored. */
1217 static enum gimplify_status
1218 gimplify_return_expr (tree stmt, gimple_seq *pre_p)
1221 tree ret_expr = TREE_OPERAND (stmt, 0);
1222 tree result_decl, result;
1224 if (ret_expr == error_mark_node)
1228 || TREE_CODE (ret_expr) == RESULT_DECL
1229 || ret_expr == error_mark_node)
1231 gimple ret = gimple_build_return (ret_expr);
1232 gimple_set_no_warning (ret, TREE_NO_WARNING (stmt));
1233 gimplify_seq_add_stmt (pre_p, ret);
1237 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
1238 result_decl = NULL_TREE;
1241 result_decl = TREE_OPERAND (ret_expr, 0);
1243 /* See through a return by reference. */
1244 if (TREE_CODE (result_decl) == INDIRECT_REF)
1245 result_decl = TREE_OPERAND (result_decl, 0);
1247 gcc_assert ((TREE_CODE (ret_expr) == MODIFY_EXPR
1248 || TREE_CODE (ret_expr) == INIT_EXPR)
1249 && TREE_CODE (result_decl) == RESULT_DECL);
1252 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1253 Recall that aggregate_value_p is FALSE for any aggregate type that is
1254 returned in registers. If we're returning values in registers, then
1255 we don't want to extend the lifetime of the RESULT_DECL, particularly
1256 across another call. In addition, for those aggregates for which
1257 hard_function_value generates a PARALLEL, we'll die during normal
1258 expansion of structure assignments; there's special code in expand_return
1259 to handle this case that does not exist in expand_expr. */
1262 else if (aggregate_value_p (result_decl, TREE_TYPE (current_function_decl)))
1264 if (TREE_CODE (DECL_SIZE (result_decl)) != INTEGER_CST)
1266 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (result_decl)))
1267 gimplify_type_sizes (TREE_TYPE (result_decl), pre_p);
1268 /* Note that we don't use gimplify_vla_decl because the RESULT_DECL
1269 should be effectively allocated by the caller, i.e. all calls to
1270 this function must be subject to the Return Slot Optimization. */
1271 gimplify_one_sizepos (&DECL_SIZE (result_decl), pre_p);
1272 gimplify_one_sizepos (&DECL_SIZE_UNIT (result_decl), pre_p);
1274 result = result_decl;
1276 else if (gimplify_ctxp->return_temp)
1277 result = gimplify_ctxp->return_temp;
1280 result = create_tmp_reg (TREE_TYPE (result_decl), NULL);
1282 /* ??? With complex control flow (usually involving abnormal edges),
1283 we can wind up warning about an uninitialized value for this. Due
1284 to how this variable is constructed and initialized, this is never
1285 true. Give up and never warn. */
1286 TREE_NO_WARNING (result) = 1;
1288 gimplify_ctxp->return_temp = result;
1291 /* Smash the lhs of the MODIFY_EXPR to the temporary we plan to use.
1292 Then gimplify the whole thing. */
1293 if (result != result_decl)
1294 TREE_OPERAND (ret_expr, 0) = result;
1296 gimplify_and_add (TREE_OPERAND (stmt, 0), pre_p);
1298 ret = gimple_build_return (result);
1299 gimple_set_no_warning (ret, TREE_NO_WARNING (stmt));
1300 gimplify_seq_add_stmt (pre_p, ret);
1306 gimplify_vla_decl (tree decl, gimple_seq *seq_p)
1308 /* This is a variable-sized decl. Simplify its size and mark it
1309 for deferred expansion. Note that mudflap depends on the format
1310 of the emitted code: see mx_register_decls(). */
1311 tree t, addr, ptr_type;
1313 gimplify_one_sizepos (&DECL_SIZE (decl), seq_p);
1314 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl), seq_p);
1316 /* All occurrences of this decl in final gimplified code will be
1317 replaced by indirection. Setting DECL_VALUE_EXPR does two
1318 things: First, it lets the rest of the gimplifier know what
1319 replacement to use. Second, it lets the debug info know
1320 where to find the value. */
1321 ptr_type = build_pointer_type (TREE_TYPE (decl));
1322 addr = create_tmp_var (ptr_type, get_name (decl));
1323 DECL_IGNORED_P (addr) = 0;
1324 t = build_fold_indirect_ref (addr);
1325 SET_DECL_VALUE_EXPR (decl, t);
1326 DECL_HAS_VALUE_EXPR_P (decl) = 1;
1328 t = built_in_decls[BUILT_IN_ALLOCA];
1329 t = build_call_expr (t, 1, DECL_SIZE_UNIT (decl));
1330 /* The call has been built for a variable-sized object. */
1331 ALLOCA_FOR_VAR_P (t) = 1;
1332 t = fold_convert (ptr_type, t);
1333 t = build2 (MODIFY_EXPR, TREE_TYPE (addr), addr, t);
1335 gimplify_and_add (t, seq_p);
1337 /* Indicate that we need to restore the stack level when the
1338 enclosing BIND_EXPR is exited. */
1339 gimplify_ctxp->save_stack = true;
1343 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
1344 and initialization explicit. */
1346 static enum gimplify_status
1347 gimplify_decl_expr (tree *stmt_p, gimple_seq *seq_p)
1349 tree stmt = *stmt_p;
1350 tree decl = DECL_EXPR_DECL (stmt);
1352 *stmt_p = NULL_TREE;
1354 if (TREE_TYPE (decl) == error_mark_node)
1357 if ((TREE_CODE (decl) == TYPE_DECL
1358 || TREE_CODE (decl) == VAR_DECL)
1359 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl)))
1360 gimplify_type_sizes (TREE_TYPE (decl), seq_p);
1362 if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl))
1364 tree init = DECL_INITIAL (decl);
1366 if (TREE_CODE (DECL_SIZE_UNIT (decl)) != INTEGER_CST
1367 || (!TREE_STATIC (decl)
1368 && flag_stack_check == GENERIC_STACK_CHECK
1369 && compare_tree_int (DECL_SIZE_UNIT (decl),
1370 STACK_CHECK_MAX_VAR_SIZE) > 0))
1371 gimplify_vla_decl (decl, seq_p);
1373 /* Some front ends do not explicitly declare all anonymous
1374 artificial variables. We compensate here by declaring the
1375 variables, though it would be better if the front ends would
1376 explicitly declare them. */
1377 if (!DECL_SEEN_IN_BIND_EXPR_P (decl)
1378 && DECL_ARTIFICIAL (decl) && DECL_NAME (decl) == NULL_TREE)
1379 gimple_add_tmp_var (decl);
1381 if (init && init != error_mark_node)
1383 if (!TREE_STATIC (decl))
1385 DECL_INITIAL (decl) = NULL_TREE;
1386 init = build2 (INIT_EXPR, void_type_node, decl, init);
1387 gimplify_and_add (init, seq_p);
1391 /* We must still examine initializers for static variables
1392 as they may contain a label address. */
1393 walk_tree (&init, force_labels_r, NULL, NULL);
1400 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1401 and replacing the LOOP_EXPR with goto, but if the loop contains an
1402 EXIT_EXPR, we need to append a label for it to jump to. */
1404 static enum gimplify_status
1405 gimplify_loop_expr (tree *expr_p, gimple_seq *pre_p)
1407 tree saved_label = gimplify_ctxp->exit_label;
1408 tree start_label = create_artificial_label (UNKNOWN_LOCATION);
1410 gimplify_seq_add_stmt (pre_p, gimple_build_label (start_label));
1412 gimplify_ctxp->exit_label = NULL_TREE;
1414 gimplify_and_add (LOOP_EXPR_BODY (*expr_p), pre_p);
1416 gimplify_seq_add_stmt (pre_p, gimple_build_goto (start_label));
1418 if (gimplify_ctxp->exit_label)
1419 gimplify_seq_add_stmt (pre_p, gimple_build_label (gimplify_ctxp->exit_label));
1421 gimplify_ctxp->exit_label = saved_label;
1427 /* Gimplifies a statement list onto a sequence. These may be created either
1428 by an enlightened front-end, or by shortcut_cond_expr. */
1430 static enum gimplify_status
1431 gimplify_statement_list (tree *expr_p, gimple_seq *pre_p)
1433 tree temp = voidify_wrapper_expr (*expr_p, NULL);
1435 tree_stmt_iterator i = tsi_start (*expr_p);
1437 while (!tsi_end_p (i))
1439 gimplify_stmt (tsi_stmt_ptr (i), pre_p);
1452 /* Compare two case labels. Because the front end should already have
1453 made sure that case ranges do not overlap, it is enough to only compare
1454 the CASE_LOW values of each case label. */
1457 compare_case_labels (const void *p1, const void *p2)
1459 const_tree const case1 = *(const_tree const*)p1;
1460 const_tree const case2 = *(const_tree const*)p2;
1462 /* The 'default' case label always goes first. */
1463 if (!CASE_LOW (case1))
1465 else if (!CASE_LOW (case2))
1468 return tree_int_cst_compare (CASE_LOW (case1), CASE_LOW (case2));
1472 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1475 sort_case_labels (VEC(tree,heap)* label_vec)
1477 VEC_qsort (tree, label_vec, compare_case_labels);
1481 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1484 static enum gimplify_status
1485 gimplify_switch_expr (tree *expr_p, gimple_seq *pre_p)
1487 tree switch_expr = *expr_p;
1488 gimple_seq switch_body_seq = NULL;
1489 enum gimplify_status ret;
1491 ret = gimplify_expr (&SWITCH_COND (switch_expr), pre_p, NULL, is_gimple_val,
1493 if (ret == GS_ERROR || ret == GS_UNHANDLED)
1496 if (SWITCH_BODY (switch_expr))
1498 VEC (tree,heap) *labels;
1499 VEC (tree,heap) *saved_labels;
1500 tree default_case = NULL_TREE;
1502 gimple gimple_switch;
1504 /* If someone can be bothered to fill in the labels, they can
1505 be bothered to null out the body too. */
1506 gcc_assert (!SWITCH_LABELS (switch_expr));
1508 /* save old labels, get new ones from body, then restore the old
1509 labels. Save all the things from the switch body to append after. */
1510 saved_labels = gimplify_ctxp->case_labels;
1511 gimplify_ctxp->case_labels = VEC_alloc (tree, heap, 8);
1513 gimplify_stmt (&SWITCH_BODY (switch_expr), &switch_body_seq);
1514 labels = gimplify_ctxp->case_labels;
1515 gimplify_ctxp->case_labels = saved_labels;
1518 while (i < VEC_length (tree, labels))
1520 tree elt = VEC_index (tree, labels, i);
1521 tree low = CASE_LOW (elt);
1522 bool remove_element = FALSE;
1526 /* Discard empty ranges. */
1527 tree high = CASE_HIGH (elt);
1528 if (high && tree_int_cst_lt (high, low))
1529 remove_element = TRUE;
1533 /* The default case must be the last label in the list. */
1534 gcc_assert (!default_case);
1536 remove_element = TRUE;
1540 VEC_ordered_remove (tree, labels, i);
1546 if (!VEC_empty (tree, labels))
1547 sort_case_labels (labels);
1551 tree type = TREE_TYPE (switch_expr);
1553 /* If the switch has no default label, add one, so that we jump
1554 around the switch body. If the labels already cover the whole
1555 range of type, add the default label pointing to one of the
1557 if (type == void_type_node)
1558 type = TREE_TYPE (SWITCH_COND (switch_expr));
1560 && INTEGRAL_TYPE_P (type)
1561 && TYPE_MIN_VALUE (type)
1562 && TYPE_MAX_VALUE (type)
1563 && tree_int_cst_equal (CASE_LOW (VEC_index (tree, labels, 0)),
1564 TYPE_MIN_VALUE (type)))
1566 tree low, high = CASE_HIGH (VEC_index (tree, labels, len - 1));
1568 high = CASE_LOW (VEC_index (tree, labels, len - 1));
1569 if (tree_int_cst_equal (high, TYPE_MAX_VALUE (type)))
1571 for (i = 1; i < len; i++)
1573 high = CASE_LOW (VEC_index (tree, labels, i));
1574 low = CASE_HIGH (VEC_index (tree, labels, i - 1));
1576 low = CASE_LOW (VEC_index (tree, labels, i - 1));
1577 if ((TREE_INT_CST_LOW (low) + 1
1578 != TREE_INT_CST_LOW (high))
1579 || (TREE_INT_CST_HIGH (low)
1580 + (TREE_INT_CST_LOW (high) == 0)
1581 != TREE_INT_CST_HIGH (high)))
1585 default_case = build3 (CASE_LABEL_EXPR, void_type_node,
1586 NULL_TREE, NULL_TREE,
1587 CASE_LABEL (VEC_index (tree,
1597 = build3 (CASE_LABEL_EXPR, void_type_node,
1598 NULL_TREE, NULL_TREE,
1599 create_artificial_label (UNKNOWN_LOCATION));
1600 new_default = gimple_build_label (CASE_LABEL (default_case));
1601 gimplify_seq_add_stmt (&switch_body_seq, new_default);
1605 gimple_switch = gimple_build_switch_vec (SWITCH_COND (switch_expr),
1606 default_case, labels);
1607 gimplify_seq_add_stmt (pre_p, gimple_switch);
1608 gimplify_seq_add_seq (pre_p, switch_body_seq);
1609 VEC_free(tree, heap, labels);
1612 gcc_assert (SWITCH_LABELS (switch_expr));
1618 static enum gimplify_status
1619 gimplify_case_label_expr (tree *expr_p, gimple_seq *pre_p)
1621 struct gimplify_ctx *ctxp;
1622 gimple gimple_label;
1624 /* Invalid OpenMP programs can play Duff's Device type games with
1625 #pragma omp parallel. At least in the C front end, we don't
1626 detect such invalid branches until after gimplification. */
1627 for (ctxp = gimplify_ctxp; ; ctxp = ctxp->prev_context)
1628 if (ctxp->case_labels)
1631 gimple_label = gimple_build_label (CASE_LABEL (*expr_p));
1632 VEC_safe_push (tree, heap, ctxp->case_labels, *expr_p);
1633 gimplify_seq_add_stmt (pre_p, gimple_label);
1638 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1642 build_and_jump (tree *label_p)
1644 if (label_p == NULL)
1645 /* If there's nowhere to jump, just fall through. */
1648 if (*label_p == NULL_TREE)
1650 tree label = create_artificial_label (UNKNOWN_LOCATION);
1654 return build1 (GOTO_EXPR, void_type_node, *label_p);
1657 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1658 This also involves building a label to jump to and communicating it to
1659 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1661 static enum gimplify_status
1662 gimplify_exit_expr (tree *expr_p)
1664 tree cond = TREE_OPERAND (*expr_p, 0);
1667 expr = build_and_jump (&gimplify_ctxp->exit_label);
1668 expr = build3 (COND_EXPR, void_type_node, cond, expr, NULL_TREE);
1674 /* A helper function to be called via walk_tree. Mark all labels under *TP
1675 as being forced. To be called for DECL_INITIAL of static variables. */
1678 force_labels_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
1682 if (TREE_CODE (*tp) == LABEL_DECL)
1683 FORCED_LABEL (*tp) = 1;
1688 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1689 different from its canonical type, wrap the whole thing inside a
1690 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1693 The canonical type of a COMPONENT_REF is the type of the field being
1694 referenced--unless the field is a bit-field which can be read directly
1695 in a smaller mode, in which case the canonical type is the
1696 sign-appropriate type corresponding to that mode. */
1699 canonicalize_component_ref (tree *expr_p)
1701 tree expr = *expr_p;
1704 gcc_assert (TREE_CODE (expr) == COMPONENT_REF);
1706 if (INTEGRAL_TYPE_P (TREE_TYPE (expr)))
1707 type = TREE_TYPE (get_unwidened (expr, NULL_TREE));
1709 type = TREE_TYPE (TREE_OPERAND (expr, 1));
1711 /* One could argue that all the stuff below is not necessary for
1712 the non-bitfield case and declare it a FE error if type
1713 adjustment would be needed. */
1714 if (TREE_TYPE (expr) != type)
1716 #ifdef ENABLE_TYPES_CHECKING
1717 tree old_type = TREE_TYPE (expr);
1721 /* We need to preserve qualifiers and propagate them from
1723 type_quals = TYPE_QUALS (type)
1724 | TYPE_QUALS (TREE_TYPE (TREE_OPERAND (expr, 0)));
1725 if (TYPE_QUALS (type) != type_quals)
1726 type = build_qualified_type (TYPE_MAIN_VARIANT (type), type_quals);
1728 /* Set the type of the COMPONENT_REF to the underlying type. */
1729 TREE_TYPE (expr) = type;
1731 #ifdef ENABLE_TYPES_CHECKING
1732 /* It is now a FE error, if the conversion from the canonical
1733 type to the original expression type is not useless. */
1734 gcc_assert (useless_type_conversion_p (old_type, type));
1739 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1740 to foo, embed that change in the ADDR_EXPR by converting
1745 where L is the lower bound. For simplicity, only do this for constant
1747 The constraint is that the type of &array[L] is trivially convertible
1751 canonicalize_addr_expr (tree *expr_p)
1753 tree expr = *expr_p;
1754 tree addr_expr = TREE_OPERAND (expr, 0);
1755 tree datype, ddatype, pddatype;
1757 /* We simplify only conversions from an ADDR_EXPR to a pointer type. */
1758 if (!POINTER_TYPE_P (TREE_TYPE (expr))
1759 || TREE_CODE (addr_expr) != ADDR_EXPR)
1762 /* The addr_expr type should be a pointer to an array. */
1763 datype = TREE_TYPE (TREE_TYPE (addr_expr));
1764 if (TREE_CODE (datype) != ARRAY_TYPE)
1767 /* The pointer to element type shall be trivially convertible to
1768 the expression pointer type. */
1769 ddatype = TREE_TYPE (datype);
1770 pddatype = build_pointer_type (ddatype);
1771 if (!useless_type_conversion_p (TYPE_MAIN_VARIANT (TREE_TYPE (expr)),
1775 /* The lower bound and element sizes must be constant. */
1776 if (!TYPE_SIZE_UNIT (ddatype)
1777 || TREE_CODE (TYPE_SIZE_UNIT (ddatype)) != INTEGER_CST
1778 || !TYPE_DOMAIN (datype) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype))
1779 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype))) != INTEGER_CST)
1782 /* All checks succeeded. Build a new node to merge the cast. */
1783 *expr_p = build4 (ARRAY_REF, ddatype, TREE_OPERAND (addr_expr, 0),
1784 TYPE_MIN_VALUE (TYPE_DOMAIN (datype)),
1785 NULL_TREE, NULL_TREE);
1786 *expr_p = build1 (ADDR_EXPR, pddatype, *expr_p);
1788 /* We can have stripped a required restrict qualifier above. */
1789 if (!useless_type_conversion_p (TREE_TYPE (expr), TREE_TYPE (*expr_p)))
1790 *expr_p = fold_convert (TREE_TYPE (expr), *expr_p);
1793 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1794 underneath as appropriate. */
1796 static enum gimplify_status
1797 gimplify_conversion (tree *expr_p)
1800 location_t loc = EXPR_LOCATION (*expr_p);
1801 gcc_assert (CONVERT_EXPR_P (*expr_p));
1803 /* Then strip away all but the outermost conversion. */
1804 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p, 0));
1806 /* And remove the outermost conversion if it's useless. */
1807 if (tree_ssa_useless_type_conversion (*expr_p))
1808 *expr_p = TREE_OPERAND (*expr_p, 0);
1810 /* Attempt to avoid NOP_EXPR by producing reference to a subtype.
1811 For example this fold (subclass *)&A into &A->subclass avoiding
1812 a need for statement. */
1813 if (CONVERT_EXPR_P (*expr_p)
1814 && POINTER_TYPE_P (TREE_TYPE (*expr_p))
1815 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p, 0)))
1816 && (tem = maybe_fold_offset_to_address
1817 (EXPR_LOCATION (*expr_p), TREE_OPERAND (*expr_p, 0),
1818 integer_zero_node, TREE_TYPE (*expr_p))) != NULL_TREE)
1821 /* If we still have a conversion at the toplevel,
1822 then canonicalize some constructs. */
1823 if (CONVERT_EXPR_P (*expr_p))
1825 tree sub = TREE_OPERAND (*expr_p, 0);
1827 /* If a NOP conversion is changing the type of a COMPONENT_REF
1828 expression, then canonicalize its type now in order to expose more
1829 redundant conversions. */
1830 if (TREE_CODE (sub) == COMPONENT_REF)
1831 canonicalize_component_ref (&TREE_OPERAND (*expr_p, 0));
1833 /* If a NOP conversion is changing a pointer to array of foo
1834 to a pointer to foo, embed that change in the ADDR_EXPR. */
1835 else if (TREE_CODE (sub) == ADDR_EXPR)
1836 canonicalize_addr_expr (expr_p);
1839 /* If we have a conversion to a non-register type force the
1840 use of a VIEW_CONVERT_EXPR instead. */
1841 if (CONVERT_EXPR_P (*expr_p) && !is_gimple_reg_type (TREE_TYPE (*expr_p)))
1842 *expr_p = fold_build1_loc (loc, VIEW_CONVERT_EXPR, TREE_TYPE (*expr_p),
1843 TREE_OPERAND (*expr_p, 0));
1848 /* Nonlocal VLAs seen in the current function. */
1849 static struct pointer_set_t *nonlocal_vlas;
1851 /* Gimplify a VAR_DECL or PARM_DECL. Returns GS_OK if we expanded a
1852 DECL_VALUE_EXPR, and it's worth re-examining things. */
1854 static enum gimplify_status
1855 gimplify_var_or_parm_decl (tree *expr_p)
1857 tree decl = *expr_p;
1859 /* ??? If this is a local variable, and it has not been seen in any
1860 outer BIND_EXPR, then it's probably the result of a duplicate
1861 declaration, for which we've already issued an error. It would
1862 be really nice if the front end wouldn't leak these at all.
1863 Currently the only known culprit is C++ destructors, as seen
1864 in g++.old-deja/g++.jason/binding.C. */
1865 if (TREE_CODE (decl) == VAR_DECL
1866 && !DECL_SEEN_IN_BIND_EXPR_P (decl)
1867 && !TREE_STATIC (decl) && !DECL_EXTERNAL (decl)
1868 && decl_function_context (decl) == current_function_decl)
1870 gcc_assert (seen_error ());
1874 /* When within an OpenMP context, notice uses of variables. */
1875 if (gimplify_omp_ctxp && omp_notice_variable (gimplify_omp_ctxp, decl, true))
1878 /* If the decl is an alias for another expression, substitute it now. */
1879 if (DECL_HAS_VALUE_EXPR_P (decl))
1881 tree value_expr = DECL_VALUE_EXPR (decl);
1883 /* For referenced nonlocal VLAs add a decl for debugging purposes
1884 to the current function. */
1885 if (TREE_CODE (decl) == VAR_DECL
1886 && TREE_CODE (DECL_SIZE_UNIT (decl)) != INTEGER_CST
1887 && nonlocal_vlas != NULL
1888 && TREE_CODE (value_expr) == INDIRECT_REF
1889 && TREE_CODE (TREE_OPERAND (value_expr, 0)) == VAR_DECL
1890 && decl_function_context (decl) != current_function_decl)
1892 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
1893 while (ctx && ctx->region_type == ORT_WORKSHARE)
1894 ctx = ctx->outer_context;
1895 if (!ctx && !pointer_set_insert (nonlocal_vlas, decl))
1897 tree copy = copy_node (decl), block;
1899 lang_hooks.dup_lang_specific_decl (copy);
1900 SET_DECL_RTL (copy, 0);
1901 TREE_USED (copy) = 1;
1902 block = DECL_INITIAL (current_function_decl);
1903 DECL_CHAIN (copy) = BLOCK_VARS (block);
1904 BLOCK_VARS (block) = copy;
1905 SET_DECL_VALUE_EXPR (copy, unshare_expr (value_expr));
1906 DECL_HAS_VALUE_EXPR_P (copy) = 1;
1910 *expr_p = unshare_expr (value_expr);
1918 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1922 : min_lval '[' val ']'
1924 | compound_lval '[' val ']'
1925 | compound_lval '.' ID
1927 This is not part of the original SIMPLE definition, which separates
1928 array and member references, but it seems reasonable to handle them
1929 together. Also, this way we don't run into problems with union
1930 aliasing; gcc requires that for accesses through a union to alias, the
1931 union reference must be explicit, which was not always the case when we
1932 were splitting up array and member refs.
1934 PRE_P points to the sequence where side effects that must happen before
1935 *EXPR_P should be stored.
1937 POST_P points to the sequence where side effects that must happen after
1938 *EXPR_P should be stored. */
1940 static enum gimplify_status
1941 gimplify_compound_lval (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
1942 fallback_t fallback)
1945 VEC(tree,heap) *stack;
1946 enum gimplify_status ret = GS_ALL_DONE, tret;
1948 location_t loc = EXPR_LOCATION (*expr_p);
1949 tree expr = *expr_p;
1951 /* Create a stack of the subexpressions so later we can walk them in
1952 order from inner to outer. */
1953 stack = VEC_alloc (tree, heap, 10);
1955 /* We can handle anything that get_inner_reference can deal with. */
1956 for (p = expr_p; ; p = &TREE_OPERAND (*p, 0))
1959 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1960 if (TREE_CODE (*p) == INDIRECT_REF)
1961 *p = fold_indirect_ref_loc (loc, *p);
1963 if (handled_component_p (*p))
1965 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
1966 additional COMPONENT_REFs. */
1967 else if ((TREE_CODE (*p) == VAR_DECL || TREE_CODE (*p) == PARM_DECL)
1968 && gimplify_var_or_parm_decl (p) == GS_OK)
1973 VEC_safe_push (tree, heap, stack, *p);
1976 gcc_assert (VEC_length (tree, stack));
1978 /* Now STACK is a stack of pointers to all the refs we've walked through
1979 and P points to the innermost expression.
1981 Java requires that we elaborated nodes in source order. That
1982 means we must gimplify the inner expression followed by each of
1983 the indices, in order. But we can't gimplify the inner
1984 expression until we deal with any variable bounds, sizes, or
1985 positions in order to deal with PLACEHOLDER_EXPRs.
1987 So we do this in three steps. First we deal with the annotations
1988 for any variables in the components, then we gimplify the base,
1989 then we gimplify any indices, from left to right. */
1990 for (i = VEC_length (tree, stack) - 1; i >= 0; i--)
1992 tree t = VEC_index (tree, stack, i);
1994 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
1996 /* Gimplify the low bound and element type size and put them into
1997 the ARRAY_REF. If these values are set, they have already been
1999 if (TREE_OPERAND (t, 2) == NULL_TREE)
2001 tree low = unshare_expr (array_ref_low_bound (t));
2002 if (!is_gimple_min_invariant (low))
2004 TREE_OPERAND (t, 2) = low;
2005 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p,
2006 post_p, is_gimple_reg,
2008 ret = MIN (ret, tret);
2013 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
2014 is_gimple_reg, fb_rvalue);
2015 ret = MIN (ret, tret);
2018 if (TREE_OPERAND (t, 3) == NULL_TREE)
2020 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (t, 0)));
2021 tree elmt_size = unshare_expr (array_ref_element_size (t));
2022 tree factor = size_int (TYPE_ALIGN_UNIT (elmt_type));
2024 /* Divide the element size by the alignment of the element
2026 elmt_size = size_binop_loc (loc, EXACT_DIV_EXPR, elmt_size, factor);
2028 if (!is_gimple_min_invariant (elmt_size))
2030 TREE_OPERAND (t, 3) = elmt_size;
2031 tret = gimplify_expr (&TREE_OPERAND (t, 3), pre_p,
2032 post_p, is_gimple_reg,
2034 ret = MIN (ret, tret);
2039 tret = gimplify_expr (&TREE_OPERAND (t, 3), pre_p, post_p,
2040 is_gimple_reg, fb_rvalue);
2041 ret = MIN (ret, tret);
2044 else if (TREE_CODE (t) == COMPONENT_REF)
2046 /* Set the field offset into T and gimplify it. */
2047 if (TREE_OPERAND (t, 2) == NULL_TREE)
2049 tree offset = unshare_expr (component_ref_field_offset (t));
2050 tree field = TREE_OPERAND (t, 1);
2052 = size_int (DECL_OFFSET_ALIGN (field) / BITS_PER_UNIT);
2054 /* Divide the offset by its alignment. */
2055 offset = size_binop_loc (loc, EXACT_DIV_EXPR, offset, factor);
2057 if (!is_gimple_min_invariant (offset))
2059 TREE_OPERAND (t, 2) = offset;
2060 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p,
2061 post_p, is_gimple_reg,
2063 ret = MIN (ret, tret);
2068 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
2069 is_gimple_reg, fb_rvalue);
2070 ret = MIN (ret, tret);
2075 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
2076 so as to match the min_lval predicate. Failure to do so may result
2077 in the creation of large aggregate temporaries. */
2078 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval,
2079 fallback | fb_lvalue);
2080 ret = MIN (ret, tret);
2082 /* And finally, the indices and operands to BIT_FIELD_REF. During this
2083 loop we also remove any useless conversions. */
2084 for (; VEC_length (tree, stack) > 0; )
2086 tree t = VEC_pop (tree, stack);
2088 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
2090 /* Gimplify the dimension. */
2091 if (!is_gimple_min_invariant (TREE_OPERAND (t, 1)))
2093 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
2094 is_gimple_val, fb_rvalue);
2095 ret = MIN (ret, tret);
2098 else if (TREE_CODE (t) == BIT_FIELD_REF)
2100 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
2101 is_gimple_val, fb_rvalue);
2102 ret = MIN (ret, tret);
2103 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
2104 is_gimple_val, fb_rvalue);
2105 ret = MIN (ret, tret);
2108 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t, 0));
2110 /* The innermost expression P may have originally had
2111 TREE_SIDE_EFFECTS set which would have caused all the outer
2112 expressions in *EXPR_P leading to P to also have had
2113 TREE_SIDE_EFFECTS set. */
2114 recalculate_side_effects (t);
2117 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
2118 if ((fallback & fb_rvalue) && TREE_CODE (*expr_p) == COMPONENT_REF)
2120 canonicalize_component_ref (expr_p);
2123 VEC_free (tree, heap, stack);
2125 gcc_assert (*expr_p == expr || ret != GS_ALL_DONE);
2130 /* Gimplify the self modifying expression pointed to by EXPR_P
2133 PRE_P points to the list where side effects that must happen before
2134 *EXPR_P should be stored.
2136 POST_P points to the list where side effects that must happen after
2137 *EXPR_P should be stored.
2139 WANT_VALUE is nonzero iff we want to use the value of this expression
2140 in another expression. */
2142 static enum gimplify_status
2143 gimplify_self_mod_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
2146 enum tree_code code;
2147 tree lhs, lvalue, rhs, t1;
2148 gimple_seq post = NULL, *orig_post_p = post_p;
2150 enum tree_code arith_code;
2151 enum gimplify_status ret;
2152 location_t loc = EXPR_LOCATION (*expr_p);
2154 code = TREE_CODE (*expr_p);
2156 gcc_assert (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR
2157 || code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR);
2159 /* Prefix or postfix? */
2160 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
2161 /* Faster to treat as prefix if result is not used. */
2162 postfix = want_value;
2166 /* For postfix, make sure the inner expression's post side effects
2167 are executed after side effects from this expression. */
2171 /* Add or subtract? */
2172 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2173 arith_code = PLUS_EXPR;
2175 arith_code = MINUS_EXPR;
2177 /* Gimplify the LHS into a GIMPLE lvalue. */
2178 lvalue = TREE_OPERAND (*expr_p, 0);
2179 ret = gimplify_expr (&lvalue, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
2180 if (ret == GS_ERROR)
2183 /* Extract the operands to the arithmetic operation. */
2185 rhs = TREE_OPERAND (*expr_p, 1);
2187 /* For postfix operator, we evaluate the LHS to an rvalue and then use
2188 that as the result value and in the postqueue operation. We also
2189 make sure to make lvalue a minimal lval, see
2190 gcc.c-torture/execute/20040313-1.c for an example where this matters. */
2193 if (!is_gimple_min_lval (lvalue))
2195 mark_addressable (lvalue);
2196 lvalue = build_fold_addr_expr_loc (input_location, lvalue);
2197 gimplify_expr (&lvalue, pre_p, post_p, is_gimple_val, fb_rvalue);
2198 lvalue = build_fold_indirect_ref_loc (input_location, lvalue);
2200 ret = gimplify_expr (&lhs, pre_p, post_p, is_gimple_val, fb_rvalue);
2201 if (ret == GS_ERROR)
2205 /* For POINTERs increment, use POINTER_PLUS_EXPR. */
2206 if (POINTER_TYPE_P (TREE_TYPE (lhs)))
2208 rhs = fold_convert_loc (loc, sizetype, rhs);
2209 if (arith_code == MINUS_EXPR)
2210 rhs = fold_build1_loc (loc, NEGATE_EXPR, TREE_TYPE (rhs), rhs);
2211 arith_code = POINTER_PLUS_EXPR;
2214 t1 = build2 (arith_code, TREE_TYPE (*expr_p), lhs, rhs);
2218 gimplify_assign (lvalue, t1, orig_post_p);
2219 gimplify_seq_add_seq (orig_post_p, post);
2225 *expr_p = build2 (MODIFY_EXPR, TREE_TYPE (lvalue), lvalue, t1);
2231 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
2234 maybe_with_size_expr (tree *expr_p)
2236 tree expr = *expr_p;
2237 tree type = TREE_TYPE (expr);
2240 /* If we've already wrapped this or the type is error_mark_node, we can't do
2242 if (TREE_CODE (expr) == WITH_SIZE_EXPR
2243 || type == error_mark_node)
2246 /* If the size isn't known or is a constant, we have nothing to do. */
2247 size = TYPE_SIZE_UNIT (type);
2248 if (!size || TREE_CODE (size) == INTEGER_CST)
2251 /* Otherwise, make a WITH_SIZE_EXPR. */
2252 size = unshare_expr (size);
2253 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, expr);
2254 *expr_p = build2 (WITH_SIZE_EXPR, type, expr, size);
2258 /* Helper for gimplify_call_expr. Gimplify a single argument *ARG_P
2259 Store any side-effects in PRE_P. CALL_LOCATION is the location of
2262 static enum gimplify_status
2263 gimplify_arg (tree *arg_p, gimple_seq *pre_p, location_t call_location)
2265 bool (*test) (tree);
2268 /* In general, we allow lvalues for function arguments to avoid
2269 extra overhead of copying large aggregates out of even larger
2270 aggregates into temporaries only to copy the temporaries to
2271 the argument list. Make optimizers happy by pulling out to
2272 temporaries those types that fit in registers. */
2273 if (is_gimple_reg_type (TREE_TYPE (*arg_p)))
2274 test = is_gimple_val, fb = fb_rvalue;
2276 test = is_gimple_lvalue, fb = fb_either;
2278 /* If this is a variable sized type, we must remember the size. */
2279 maybe_with_size_expr (arg_p);
2281 /* FIXME diagnostics: This will mess up gcc.dg/Warray-bounds.c. */
2282 /* Make sure arguments have the same location as the function call
2284 protected_set_expr_location (*arg_p, call_location);
2286 /* There is a sequence point before a function call. Side effects in
2287 the argument list must occur before the actual call. So, when
2288 gimplifying arguments, force gimplify_expr to use an internal
2289 post queue which is then appended to the end of PRE_P. */
2290 return gimplify_expr (arg_p, pre_p, NULL, test, fb);
2294 /* Gimplify the CALL_EXPR node *EXPR_P into the GIMPLE sequence PRE_P.
2295 WANT_VALUE is true if the result of the call is desired. */
2297 static enum gimplify_status
2298 gimplify_call_expr (tree *expr_p, gimple_seq *pre_p, bool want_value)
2300 tree fndecl, parms, p;
2301 enum gimplify_status ret;
2304 bool builtin_va_start_p = FALSE;
2305 location_t loc = EXPR_LOCATION (*expr_p);
2307 gcc_assert (TREE_CODE (*expr_p) == CALL_EXPR);
2309 /* For reliable diagnostics during inlining, it is necessary that
2310 every call_expr be annotated with file and line. */
2311 if (! EXPR_HAS_LOCATION (*expr_p))
2312 SET_EXPR_LOCATION (*expr_p, input_location);
2314 /* This may be a call to a builtin function.
2316 Builtin function calls may be transformed into different
2317 (and more efficient) builtin function calls under certain
2318 circumstances. Unfortunately, gimplification can muck things
2319 up enough that the builtin expanders are not aware that certain
2320 transformations are still valid.
2322 So we attempt transformation/gimplification of the call before
2323 we gimplify the CALL_EXPR. At this time we do not manage to
2324 transform all calls in the same manner as the expanders do, but
2325 we do transform most of them. */
2326 fndecl = get_callee_fndecl (*expr_p);
2327 if (fndecl && DECL_BUILT_IN (fndecl))
2329 tree new_tree = fold_call_expr (input_location, *expr_p, !want_value);
2331 if (new_tree && new_tree != *expr_p)
2333 /* There was a transformation of this call which computes the
2334 same value, but in a more efficient way. Return and try
2340 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
2341 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_VA_START)
2343 builtin_va_start_p = TRUE;
2344 if (call_expr_nargs (*expr_p) < 2)
2346 error ("too few arguments to function %<va_start%>");
2347 *expr_p = build_empty_stmt (EXPR_LOCATION (*expr_p));
2351 if (fold_builtin_next_arg (*expr_p, true))
2353 *expr_p = build_empty_stmt (EXPR_LOCATION (*expr_p));
2359 /* There is a sequence point before the call, so any side effects in
2360 the calling expression must occur before the actual call. Force
2361 gimplify_expr to use an internal post queue. */
2362 ret = gimplify_expr (&CALL_EXPR_FN (*expr_p), pre_p, NULL,
2363 is_gimple_call_addr, fb_rvalue);
2365 nargs = call_expr_nargs (*expr_p);
2367 /* Get argument types for verification. */
2368 fndecl = get_callee_fndecl (*expr_p);
2371 parms = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
2372 else if (POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_FN (*expr_p))))
2373 parms = TYPE_ARG_TYPES (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (*expr_p))));
2375 if (fndecl && DECL_ARGUMENTS (fndecl))
2376 p = DECL_ARGUMENTS (fndecl);
2381 for (i = 0; i < nargs && p; i++, p = TREE_CHAIN (p))
2384 /* If the last argument is __builtin_va_arg_pack () and it is not
2385 passed as a named argument, decrease the number of CALL_EXPR
2386 arguments and set instead the CALL_EXPR_VA_ARG_PACK flag. */
2389 && TREE_CODE (CALL_EXPR_ARG (*expr_p, nargs - 1)) == CALL_EXPR)
2391 tree last_arg = CALL_EXPR_ARG (*expr_p, nargs - 1);
2392 tree last_arg_fndecl = get_callee_fndecl (last_arg);
2395 && TREE_CODE (last_arg_fndecl) == FUNCTION_DECL
2396 && DECL_BUILT_IN_CLASS (last_arg_fndecl) == BUILT_IN_NORMAL
2397 && DECL_FUNCTION_CODE (last_arg_fndecl) == BUILT_IN_VA_ARG_PACK)
2399 tree call = *expr_p;
2402 *expr_p = build_call_array_loc (loc, TREE_TYPE (call),
2403 CALL_EXPR_FN (call),
2404 nargs, CALL_EXPR_ARGP (call));
2406 /* Copy all CALL_EXPR flags, location and block, except
2407 CALL_EXPR_VA_ARG_PACK flag. */
2408 CALL_EXPR_STATIC_CHAIN (*expr_p) = CALL_EXPR_STATIC_CHAIN (call);
2409 CALL_EXPR_TAILCALL (*expr_p) = CALL_EXPR_TAILCALL (call);
2410 CALL_EXPR_RETURN_SLOT_OPT (*expr_p)
2411 = CALL_EXPR_RETURN_SLOT_OPT (call);
2412 CALL_FROM_THUNK_P (*expr_p) = CALL_FROM_THUNK_P (call);
2413 CALL_CANNOT_INLINE_P (*expr_p) = CALL_CANNOT_INLINE_P (call);
2414 SET_EXPR_LOCATION (*expr_p, EXPR_LOCATION (call));
2415 TREE_BLOCK (*expr_p) = TREE_BLOCK (call);
2417 /* Set CALL_EXPR_VA_ARG_PACK. */
2418 CALL_EXPR_VA_ARG_PACK (*expr_p) = 1;
2422 /* Finally, gimplify the function arguments. */
2425 for (i = (PUSH_ARGS_REVERSED ? nargs - 1 : 0);
2426 PUSH_ARGS_REVERSED ? i >= 0 : i < nargs;
2427 PUSH_ARGS_REVERSED ? i-- : i++)
2429 enum gimplify_status t;
2431 /* Avoid gimplifying the second argument to va_start, which needs to
2432 be the plain PARM_DECL. */
2433 if ((i != 1) || !builtin_va_start_p)
2435 t = gimplify_arg (&CALL_EXPR_ARG (*expr_p, i), pre_p,
2436 EXPR_LOCATION (*expr_p));
2444 /* Verify the function result. */
2445 if (want_value && fndecl
2446 && VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fndecl))))
2448 error_at (loc, "using result of function returning %<void%>");
2452 /* Try this again in case gimplification exposed something. */
2453 if (ret != GS_ERROR)
2455 tree new_tree = fold_call_expr (input_location, *expr_p, !want_value);
2457 if (new_tree && new_tree != *expr_p)
2459 /* There was a transformation of this call which computes the
2460 same value, but in a more efficient way. Return and try
2468 *expr_p = error_mark_node;
2472 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2473 decl. This allows us to eliminate redundant or useless
2474 calls to "const" functions. */
2475 if (TREE_CODE (*expr_p) == CALL_EXPR)
2477 int flags = call_expr_flags (*expr_p);
2478 if (flags & (ECF_CONST | ECF_PURE)
2479 /* An infinite loop is considered a side effect. */
2480 && !(flags & (ECF_LOOPING_CONST_OR_PURE)))
2481 TREE_SIDE_EFFECTS (*expr_p) = 0;
2484 /* If the value is not needed by the caller, emit a new GIMPLE_CALL
2485 and clear *EXPR_P. Otherwise, leave *EXPR_P in its gimplified
2486 form and delegate the creation of a GIMPLE_CALL to
2487 gimplify_modify_expr. This is always possible because when
2488 WANT_VALUE is true, the caller wants the result of this call into
2489 a temporary, which means that we will emit an INIT_EXPR in
2490 internal_get_tmp_var which will then be handled by
2491 gimplify_modify_expr. */
2494 /* The CALL_EXPR in *EXPR_P is already in GIMPLE form, so all we
2495 have to do is replicate it as a GIMPLE_CALL tuple. */
2496 gimple_stmt_iterator gsi;
2497 call = gimple_build_call_from_tree (*expr_p);
2498 gimplify_seq_add_stmt (pre_p, call);
2499 gsi = gsi_last (*pre_p);
2501 *expr_p = NULL_TREE;
2507 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2508 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2510 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2511 condition is true or false, respectively. If null, we should generate
2512 our own to skip over the evaluation of this specific expression.
2514 LOCUS is the source location of the COND_EXPR.
2516 This function is the tree equivalent of do_jump.
2518 shortcut_cond_r should only be called by shortcut_cond_expr. */
2521 shortcut_cond_r (tree pred, tree *true_label_p, tree *false_label_p,
2524 tree local_label = NULL_TREE;
2525 tree t, expr = NULL;
2527 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2528 retain the shortcut semantics. Just insert the gotos here;
2529 shortcut_cond_expr will append the real blocks later. */
2530 if (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2532 location_t new_locus;
2534 /* Turn if (a && b) into
2536 if (a); else goto no;
2537 if (b) goto yes; else goto no;
2540 if (false_label_p == NULL)
2541 false_label_p = &local_label;
2543 /* Keep the original source location on the first 'if'. */
2544 t = shortcut_cond_r (TREE_OPERAND (pred, 0), NULL, false_label_p, locus);
2545 append_to_statement_list (t, &expr);
2547 /* Set the source location of the && on the second 'if'. */
2548 new_locus = EXPR_HAS_LOCATION (pred) ? EXPR_LOCATION (pred) : locus;
2549 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p, false_label_p,
2551 append_to_statement_list (t, &expr);
2553 else if (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2555 location_t new_locus;
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 /* Keep the original source location on the first 'if'. */
2567 t = shortcut_cond_r (TREE_OPERAND (pred, 0), true_label_p, NULL, locus);
2568 append_to_statement_list (t, &expr);
2570 /* Set the source location of the || on the second 'if'. */
2571 new_locus = EXPR_HAS_LOCATION (pred) ? EXPR_LOCATION (pred) : locus;
2572 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p, false_label_p,
2574 append_to_statement_list (t, &expr);
2576 else if (TREE_CODE (pred) == COND_EXPR
2577 && !VOID_TYPE_P (TREE_TYPE (TREE_OPERAND (pred, 1)))
2578 && !VOID_TYPE_P (TREE_TYPE (TREE_OPERAND (pred, 2))))
2580 location_t new_locus;
2582 /* As long as we're messing with gotos, turn if (a ? b : c) into
2584 if (b) goto yes; else goto no;
2586 if (c) goto yes; else goto no;
2588 Don't do this if one of the arms has void type, which can happen
2589 in C++ when the arm is throw. */
2591 /* Keep the original source location on the first 'if'. Set the source
2592 location of the ? on the second 'if'. */
2593 new_locus = EXPR_HAS_LOCATION (pred) ? EXPR_LOCATION (pred) : locus;
2594 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (pred, 0),
2595 shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2596 false_label_p, locus),
2597 shortcut_cond_r (TREE_OPERAND (pred, 2), true_label_p,
2598 false_label_p, new_locus));
2602 expr = build3 (COND_EXPR, void_type_node, pred,
2603 build_and_jump (true_label_p),
2604 build_and_jump (false_label_p));
2605 SET_EXPR_LOCATION (expr, locus);
2610 t = build1 (LABEL_EXPR, void_type_node, local_label);
2611 append_to_statement_list (t, &expr);
2617 /* Given a conditional expression EXPR with short-circuit boolean
2618 predicates using TRUTH_ANDIF_EXPR or TRUTH_ORIF_EXPR, break the
2619 predicate appart into the equivalent sequence of conditionals. */
2622 shortcut_cond_expr (tree expr)
2624 tree pred = TREE_OPERAND (expr, 0);
2625 tree then_ = TREE_OPERAND (expr, 1);
2626 tree else_ = TREE_OPERAND (expr, 2);
2627 tree true_label, false_label, end_label, t;
2629 tree *false_label_p;
2630 bool emit_end, emit_false, jump_over_else;
2631 bool then_se = then_ && TREE_SIDE_EFFECTS (then_);
2632 bool else_se = else_ && TREE_SIDE_EFFECTS (else_);
2634 /* First do simple transformations. */
2637 /* If there is no 'else', turn
2640 if (a) if (b) then c. */
2641 while (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2643 /* Keep the original source location on the first 'if'. */
2644 location_t locus = EXPR_LOC_OR_HERE (expr);
2645 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2646 /* Set the source location of the && on the second 'if'. */
2647 if (EXPR_HAS_LOCATION (pred))
2648 SET_EXPR_LOCATION (expr, EXPR_LOCATION (pred));
2649 then_ = shortcut_cond_expr (expr);
2650 then_se = then_ && TREE_SIDE_EFFECTS (then_);
2651 pred = TREE_OPERAND (pred, 0);
2652 expr = build3 (COND_EXPR, void_type_node, pred, then_, NULL_TREE);
2653 SET_EXPR_LOCATION (expr, locus);
2659 /* If there is no 'then', turn
2662 if (a); else if (b); else d. */
2663 while (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2665 /* Keep the original source location on the first 'if'. */
2666 location_t locus = EXPR_LOC_OR_HERE (expr);
2667 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2668 /* Set the source location of the || on the second 'if'. */
2669 if (EXPR_HAS_LOCATION (pred))
2670 SET_EXPR_LOCATION (expr, EXPR_LOCATION (pred));
2671 else_ = shortcut_cond_expr (expr);
2672 else_se = else_ && TREE_SIDE_EFFECTS (else_);
2673 pred = TREE_OPERAND (pred, 0);
2674 expr = build3 (COND_EXPR, void_type_node, pred, NULL_TREE, else_);
2675 SET_EXPR_LOCATION (expr, locus);
2679 /* If we're done, great. */
2680 if (TREE_CODE (pred) != TRUTH_ANDIF_EXPR
2681 && TREE_CODE (pred) != TRUTH_ORIF_EXPR)
2684 /* Otherwise we need to mess with gotos. Change
2687 if (a); else goto no;
2690 and recursively gimplify the condition. */
2692 true_label = false_label = end_label = NULL_TREE;
2694 /* If our arms just jump somewhere, hijack those labels so we don't
2695 generate jumps to jumps. */
2698 && TREE_CODE (then_) == GOTO_EXPR
2699 && TREE_CODE (GOTO_DESTINATION (then_)) == LABEL_DECL)
2701 true_label = GOTO_DESTINATION (then_);
2707 && TREE_CODE (else_) == GOTO_EXPR
2708 && TREE_CODE (GOTO_DESTINATION (else_)) == LABEL_DECL)
2710 false_label = GOTO_DESTINATION (else_);
2715 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2717 true_label_p = &true_label;
2719 true_label_p = NULL;
2721 /* The 'else' branch also needs a label if it contains interesting code. */
2722 if (false_label || else_se)
2723 false_label_p = &false_label;
2725 false_label_p = NULL;
2727 /* If there was nothing else in our arms, just forward the label(s). */
2728 if (!then_se && !else_se)
2729 return shortcut_cond_r (pred, true_label_p, false_label_p,
2730 EXPR_LOC_OR_HERE (expr));
2732 /* If our last subexpression already has a terminal label, reuse it. */
2734 t = expr_last (else_);
2736 t = expr_last (then_);
2739 if (t && TREE_CODE (t) == LABEL_EXPR)
2740 end_label = LABEL_EXPR_LABEL (t);
2742 /* If we don't care about jumping to the 'else' branch, jump to the end
2743 if the condition is false. */
2745 false_label_p = &end_label;
2747 /* We only want to emit these labels if we aren't hijacking them. */
2748 emit_end = (end_label == NULL_TREE);
2749 emit_false = (false_label == NULL_TREE);
2751 /* We only emit the jump over the else clause if we have to--if the
2752 then clause may fall through. Otherwise we can wind up with a
2753 useless jump and a useless label at the end of gimplified code,
2754 which will cause us to think that this conditional as a whole
2755 falls through even if it doesn't. If we then inline a function
2756 which ends with such a condition, that can cause us to issue an
2757 inappropriate warning about control reaching the end of a
2758 non-void function. */
2759 jump_over_else = block_may_fallthru (then_);
2761 pred = shortcut_cond_r (pred, true_label_p, false_label_p,
2762 EXPR_LOC_OR_HERE (expr));
2765 append_to_statement_list (pred, &expr);
2767 append_to_statement_list (then_, &expr);
2772 tree last = expr_last (expr);
2773 t = build_and_jump (&end_label);
2774 if (EXPR_HAS_LOCATION (last))
2775 SET_EXPR_LOCATION (t, EXPR_LOCATION (last));
2776 append_to_statement_list (t, &expr);
2780 t = build1 (LABEL_EXPR, void_type_node, false_label);
2781 append_to_statement_list (t, &expr);
2783 append_to_statement_list (else_, &expr);
2785 if (emit_end && end_label)
2787 t = build1 (LABEL_EXPR, void_type_node, end_label);
2788 append_to_statement_list (t, &expr);
2794 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2797 gimple_boolify (tree expr)
2799 tree type = TREE_TYPE (expr);
2800 location_t loc = EXPR_LOCATION (expr);
2802 if (TREE_CODE (expr) == NE_EXPR
2803 && TREE_CODE (TREE_OPERAND (expr, 0)) == CALL_EXPR
2804 && integer_zerop (TREE_OPERAND (expr, 1)))
2806 tree call = TREE_OPERAND (expr, 0);
2807 tree fn = get_callee_fndecl (call);
2809 /* For __builtin_expect ((long) (x), y) recurse into x as well
2810 if x is truth_value_p. */
2812 && DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2813 && DECL_FUNCTION_CODE (fn) == BUILT_IN_EXPECT
2814 && call_expr_nargs (call) == 2)
2816 tree arg = CALL_EXPR_ARG (call, 0);
2819 if (TREE_CODE (arg) == NOP_EXPR
2820 && TREE_TYPE (arg) == TREE_TYPE (call))
2821 arg = TREE_OPERAND (arg, 0);
2822 if (truth_value_p (TREE_CODE (arg)))
2824 arg = gimple_boolify (arg);
2825 CALL_EXPR_ARG (call, 0)
2826 = fold_convert_loc (loc, TREE_TYPE (call), arg);
2832 if (TREE_CODE (type) == BOOLEAN_TYPE)
2835 switch (TREE_CODE (expr))
2837 case TRUTH_AND_EXPR:
2839 case TRUTH_XOR_EXPR:
2840 case TRUTH_ANDIF_EXPR:
2841 case TRUTH_ORIF_EXPR:
2842 /* Also boolify the arguments of truth exprs. */
2843 TREE_OPERAND (expr, 1) = gimple_boolify (TREE_OPERAND (expr, 1));
2846 case TRUTH_NOT_EXPR:
2847 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2850 case EQ_EXPR: case NE_EXPR:
2851 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2852 /* These expressions always produce boolean results. */
2853 TREE_TYPE (expr) = boolean_type_node;
2857 /* Other expressions that get here must have boolean values, but
2858 might need to be converted to the appropriate mode. */
2859 return fold_convert_loc (loc, boolean_type_node, expr);
2863 /* Given a conditional expression *EXPR_P without side effects, gimplify
2864 its operands. New statements are inserted to PRE_P. */
2866 static enum gimplify_status
2867 gimplify_pure_cond_expr (tree *expr_p, gimple_seq *pre_p)
2869 tree expr = *expr_p, cond;
2870 enum gimplify_status ret, tret;
2871 enum tree_code code;
2873 cond = gimple_boolify (COND_EXPR_COND (expr));
2875 /* We need to handle && and || specially, as their gimplification
2876 creates pure cond_expr, thus leading to an infinite cycle otherwise. */
2877 code = TREE_CODE (cond);
2878 if (code == TRUTH_ANDIF_EXPR)
2879 TREE_SET_CODE (cond, TRUTH_AND_EXPR);
2880 else if (code == TRUTH_ORIF_EXPR)
2881 TREE_SET_CODE (cond, TRUTH_OR_EXPR);
2882 ret = gimplify_expr (&cond, pre_p, NULL, is_gimple_condexpr, fb_rvalue);
2883 COND_EXPR_COND (*expr_p) = cond;
2885 tret = gimplify_expr (&COND_EXPR_THEN (expr), pre_p, NULL,
2886 is_gimple_val, fb_rvalue);
2887 ret = MIN (ret, tret);
2888 tret = gimplify_expr (&COND_EXPR_ELSE (expr), pre_p, NULL,
2889 is_gimple_val, fb_rvalue);
2891 return MIN (ret, tret);
2894 /* Returns true if evaluating EXPR could trap.
2895 EXPR is GENERIC, while tree_could_trap_p can be called
2899 generic_expr_could_trap_p (tree expr)
2903 if (!expr || is_gimple_val (expr))
2906 if (!EXPR_P (expr) || tree_could_trap_p (expr))
2909 n = TREE_OPERAND_LENGTH (expr);
2910 for (i = 0; i < n; i++)
2911 if (generic_expr_could_trap_p (TREE_OPERAND (expr, i)))
2917 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2926 The second form is used when *EXPR_P is of type void.
2928 PRE_P points to the list where side effects that must happen before
2929 *EXPR_P should be stored. */
2931 static enum gimplify_status
2932 gimplify_cond_expr (tree *expr_p, gimple_seq *pre_p, fallback_t fallback)
2934 tree expr = *expr_p;
2935 tree type = TREE_TYPE (expr);
2936 location_t loc = EXPR_LOCATION (expr);
2937 tree tmp, arm1, arm2;
2938 enum gimplify_status ret;
2939 tree label_true, label_false, label_cont;
2940 bool have_then_clause_p, have_else_clause_p;
2942 enum tree_code pred_code;
2943 gimple_seq seq = NULL;
2945 /* If this COND_EXPR has a value, copy the values into a temporary within
2947 if (!VOID_TYPE_P (type))
2949 tree then_ = TREE_OPERAND (expr, 1), else_ = TREE_OPERAND (expr, 2);
2952 /* If either an rvalue is ok or we do not require an lvalue, create the
2953 temporary. But we cannot do that if the type is addressable. */
2954 if (((fallback & fb_rvalue) || !(fallback & fb_lvalue))
2955 && !TREE_ADDRESSABLE (type))
2957 if (gimplify_ctxp->allow_rhs_cond_expr
2958 /* If either branch has side effects or could trap, it can't be
2959 evaluated unconditionally. */
2960 && !TREE_SIDE_EFFECTS (then_)
2961 && !generic_expr_could_trap_p (then_)
2962 && !TREE_SIDE_EFFECTS (else_)
2963 && !generic_expr_could_trap_p (else_))
2964 return gimplify_pure_cond_expr (expr_p, pre_p);
2966 tmp = create_tmp_var (type, "iftmp");
2970 /* Otherwise, only create and copy references to the values. */
2973 type = build_pointer_type (type);
2975 if (!VOID_TYPE_P (TREE_TYPE (then_)))
2976 then_ = build_fold_addr_expr_loc (loc, then_);
2978 if (!VOID_TYPE_P (TREE_TYPE (else_)))
2979 else_ = build_fold_addr_expr_loc (loc, else_);
2982 = build3 (COND_EXPR, type, TREE_OPERAND (expr, 0), then_, else_);
2984 tmp = create_tmp_var (type, "iftmp");
2985 result = build_simple_mem_ref_loc (loc, tmp);
2988 /* Build the new then clause, `tmp = then_;'. But don't build the
2989 assignment if the value is void; in C++ it can be if it's a throw. */
2990 if (!VOID_TYPE_P (TREE_TYPE (then_)))
2991 TREE_OPERAND (expr, 1) = build2 (MODIFY_EXPR, type, tmp, then_);
2993 /* Similarly, build the new else clause, `tmp = else_;'. */
2994 if (!VOID_TYPE_P (TREE_TYPE (else_)))
2995 TREE_OPERAND (expr, 2) = build2 (MODIFY_EXPR, type, tmp, else_);
2997 TREE_TYPE (expr) = void_type_node;
2998 recalculate_side_effects (expr);
3000 /* Move the COND_EXPR to the prequeue. */
3001 gimplify_stmt (&expr, pre_p);
3007 /* Make sure the condition has BOOLEAN_TYPE. */
3008 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
3010 /* Break apart && and || conditions. */
3011 if (TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ANDIF_EXPR
3012 || TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ORIF_EXPR)
3014 expr = shortcut_cond_expr (expr);
3016 if (expr != *expr_p)
3020 /* We can't rely on gimplify_expr to re-gimplify the expanded
3021 form properly, as cleanups might cause the target labels to be
3022 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
3023 set up a conditional context. */
3024 gimple_push_condition ();
3025 gimplify_stmt (expr_p, &seq);
3026 gimple_pop_condition (pre_p);
3027 gimple_seq_add_seq (pre_p, seq);
3033 /* Now do the normal gimplification. */
3035 /* Gimplify condition. */
3036 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL, is_gimple_condexpr,
3038 if (ret == GS_ERROR)
3040 gcc_assert (TREE_OPERAND (expr, 0) != NULL_TREE);
3042 gimple_push_condition ();
3044 have_then_clause_p = have_else_clause_p = false;
3045 if (TREE_OPERAND (expr, 1) != NULL
3046 && TREE_CODE (TREE_OPERAND (expr, 1)) == GOTO_EXPR
3047 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr, 1))) == LABEL_DECL
3048 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr, 1)))
3049 == current_function_decl)
3050 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
3051 have different locations, otherwise we end up with incorrect
3052 location information on the branches. */
3054 || !EXPR_HAS_LOCATION (expr)
3055 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr, 1))
3056 || EXPR_LOCATION (expr) == EXPR_LOCATION (TREE_OPERAND (expr, 1))))
3058 label_true = GOTO_DESTINATION (TREE_OPERAND (expr, 1));
3059 have_then_clause_p = true;
3062 label_true = create_artificial_label (UNKNOWN_LOCATION);
3063 if (TREE_OPERAND (expr, 2) != NULL
3064 && TREE_CODE (TREE_OPERAND (expr, 2)) == GOTO_EXPR
3065 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr, 2))) == LABEL_DECL
3066 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr, 2)))
3067 == current_function_decl)
3068 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
3069 have different locations, otherwise we end up with incorrect
3070 location information on the branches. */
3072 || !EXPR_HAS_LOCATION (expr)
3073 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr, 2))
3074 || EXPR_LOCATION (expr) == EXPR_LOCATION (TREE_OPERAND (expr, 2))))
3076 label_false = GOTO_DESTINATION (TREE_OPERAND (expr, 2));
3077 have_else_clause_p = true;
3080 label_false = create_artificial_label (UNKNOWN_LOCATION);
3082 gimple_cond_get_ops_from_tree (COND_EXPR_COND (expr), &pred_code, &arm1,
3085 gimple_cond = gimple_build_cond (pred_code, arm1, arm2, label_true,
3088 gimplify_seq_add_stmt (&seq, gimple_cond);
3089 label_cont = NULL_TREE;
3090 if (!have_then_clause_p)
3092 /* For if (...) {} else { code; } put label_true after
3094 if (TREE_OPERAND (expr, 1) == NULL_TREE
3095 && !have_else_clause_p
3096 && TREE_OPERAND (expr, 2) != NULL_TREE)
3097 label_cont = label_true;
3100 gimplify_seq_add_stmt (&seq, gimple_build_label (label_true));
3101 have_then_clause_p = gimplify_stmt (&TREE_OPERAND (expr, 1), &seq);
3102 /* For if (...) { code; } else {} or
3103 if (...) { code; } else goto label; or
3104 if (...) { code; return; } else { ... }
3105 label_cont isn't needed. */
3106 if (!have_else_clause_p
3107 && TREE_OPERAND (expr, 2) != NULL_TREE
3108 && gimple_seq_may_fallthru (seq))
3111 label_cont = create_artificial_label (UNKNOWN_LOCATION);
3113 g = gimple_build_goto (label_cont);
3115 /* GIMPLE_COND's are very low level; they have embedded
3116 gotos. This particular embedded goto should not be marked
3117 with the location of the original COND_EXPR, as it would
3118 correspond to the COND_EXPR's condition, not the ELSE or the
3119 THEN arms. To avoid marking it with the wrong location, flag
3120 it as "no location". */
3121 gimple_set_do_not_emit_location (g);
3123 gimplify_seq_add_stmt (&seq, g);
3127 if (!have_else_clause_p)
3129 gimplify_seq_add_stmt (&seq, gimple_build_label (label_false));
3130 have_else_clause_p = gimplify_stmt (&TREE_OPERAND (expr, 2), &seq);
3133 gimplify_seq_add_stmt (&seq, gimple_build_label (label_cont));
3135 gimple_pop_condition (pre_p);
3136 gimple_seq_add_seq (pre_p, seq);
3138 if (ret == GS_ERROR)
3140 else if (have_then_clause_p || have_else_clause_p)
3144 /* Both arms are empty; replace the COND_EXPR with its predicate. */
3145 expr = TREE_OPERAND (expr, 0);
3146 gimplify_stmt (&expr, pre_p);
3153 /* Prepare the node pointed to by EXPR_P, an is_gimple_addressable expression,
3154 to be marked addressable.
3156 We cannot rely on such an expression being directly markable if a temporary
3157 has been created by the gimplification. In this case, we create another
3158 temporary and initialize it with a copy, which will become a store after we
3159 mark it addressable. This can happen if the front-end passed us something
3160 that it could not mark addressable yet, like a Fortran pass-by-reference
3161 parameter (int) floatvar. */
3164 prepare_gimple_addressable (tree *expr_p, gimple_seq *seq_p)
3166 while (handled_component_p (*expr_p))
3167 expr_p = &TREE_OPERAND (*expr_p, 0);
3168 if (is_gimple_reg (*expr_p))
3169 *expr_p = get_initialized_tmp_var (*expr_p, seq_p, NULL);
3172 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3173 a call to __builtin_memcpy. */
3175 static enum gimplify_status
3176 gimplify_modify_expr_to_memcpy (tree *expr_p, tree size, bool want_value,
3179 tree t, to, to_ptr, from, from_ptr;
3181 location_t loc = EXPR_LOCATION (*expr_p);
3183 to = TREE_OPERAND (*expr_p, 0);
3184 from = TREE_OPERAND (*expr_p, 1);
3186 /* Mark the RHS addressable. Beware that it may not be possible to do so
3187 directly if a temporary has been created by the gimplification. */
3188 prepare_gimple_addressable (&from, seq_p);
3190 mark_addressable (from);
3191 from_ptr = build_fold_addr_expr_loc (loc, from);
3192 gimplify_arg (&from_ptr, seq_p, loc);
3194 mark_addressable (to);
3195 to_ptr = build_fold_addr_expr_loc (loc, to);
3196 gimplify_arg (&to_ptr, seq_p, loc);
3198 t = implicit_built_in_decls[BUILT_IN_MEMCPY];
3200 gs = gimple_build_call (t, 3, to_ptr, from_ptr, size);
3204 /* tmp = memcpy() */
3205 t = create_tmp_var (TREE_TYPE (to_ptr), NULL);
3206 gimple_call_set_lhs (gs, t);
3207 gimplify_seq_add_stmt (seq_p, gs);
3209 *expr_p = build_simple_mem_ref (t);
3213 gimplify_seq_add_stmt (seq_p, gs);
3218 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3219 a call to __builtin_memset. In this case we know that the RHS is
3220 a CONSTRUCTOR with an empty element list. */
3222 static enum gimplify_status
3223 gimplify_modify_expr_to_memset (tree *expr_p, tree size, bool want_value,
3226 tree t, from, to, to_ptr;
3228 location_t loc = EXPR_LOCATION (*expr_p);
3230 /* Assert our assumptions, to abort instead of producing wrong code
3231 silently if they are not met. Beware that the RHS CONSTRUCTOR might
3232 not be immediately exposed. */
3233 from = TREE_OPERAND (*expr_p, 1);
3234 if (TREE_CODE (from) == WITH_SIZE_EXPR)
3235 from = TREE_OPERAND (from, 0);
3237 gcc_assert (TREE_CODE (from) == CONSTRUCTOR
3238 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (from)));
3241 to = TREE_OPERAND (*expr_p, 0);
3243 to_ptr = build_fold_addr_expr_loc (loc, to);
3244 gimplify_arg (&to_ptr, seq_p, loc);
3245 t = implicit_built_in_decls[BUILT_IN_MEMSET];
3247 gs = gimple_build_call (t, 3, to_ptr, integer_zero_node, size);
3251 /* tmp = memset() */
3252 t = create_tmp_var (TREE_TYPE (to_ptr), NULL);
3253 gimple_call_set_lhs (gs, t);
3254 gimplify_seq_add_stmt (seq_p, gs);
3256 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (to), t);
3260 gimplify_seq_add_stmt (seq_p, gs);
3265 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
3266 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
3267 assignment. Returns non-null if we detect a potential overlap. */
3269 struct gimplify_init_ctor_preeval_data
3271 /* The base decl of the lhs object. May be NULL, in which case we
3272 have to assume the lhs is indirect. */
3275 /* The alias set of the lhs object. */
3276 alias_set_type lhs_alias_set;
3280 gimplify_init_ctor_preeval_1 (tree *tp, int *walk_subtrees, void *xdata)
3282 struct gimplify_init_ctor_preeval_data *data
3283 = (struct gimplify_init_ctor_preeval_data *) xdata;
3286 /* If we find the base object, obviously we have overlap. */
3287 if (data->lhs_base_decl == t)
3290 /* If the constructor component is indirect, determine if we have a
3291 potential overlap with the lhs. The only bits of information we
3292 have to go on at this point are addressability and alias sets. */
3293 if ((INDIRECT_REF_P (t)
3294 || TREE_CODE (t) == MEM_REF)
3295 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
3296 && alias_sets_conflict_p (data->lhs_alias_set, get_alias_set (t)))
3299 /* If the constructor component is a call, determine if it can hide a
3300 potential overlap with the lhs through an INDIRECT_REF like above.
3301 ??? Ugh - this is completely broken. In fact this whole analysis
3302 doesn't look conservative. */
3303 if (TREE_CODE (t) == CALL_EXPR)
3305 tree type, fntype = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (t)));
3307 for (type = TYPE_ARG_TYPES (fntype); type; type = TREE_CHAIN (type))
3308 if (POINTER_TYPE_P (TREE_VALUE (type))
3309 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
3310 && alias_sets_conflict_p (data->lhs_alias_set,
3312 (TREE_TYPE (TREE_VALUE (type)))))
3316 if (IS_TYPE_OR_DECL_P (t))
3321 /* A subroutine of gimplify_init_constructor. Pre-evaluate EXPR,
3322 force values that overlap with the lhs (as described by *DATA)
3323 into temporaries. */
3326 gimplify_init_ctor_preeval (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
3327 struct gimplify_init_ctor_preeval_data *data)
3329 enum gimplify_status one;
3331 /* If the value is constant, then there's nothing to pre-evaluate. */
3332 if (TREE_CONSTANT (*expr_p))
3334 /* Ensure it does not have side effects, it might contain a reference to
3335 the object we're initializing. */
3336 gcc_assert (!TREE_SIDE_EFFECTS (*expr_p));
3340 /* If the type has non-trivial constructors, we can't pre-evaluate. */
3341 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p)))
3344 /* Recurse for nested constructors. */
3345 if (TREE_CODE (*expr_p) == CONSTRUCTOR)
3347 unsigned HOST_WIDE_INT ix;
3348 constructor_elt *ce;
3349 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (*expr_p);
3351 FOR_EACH_VEC_ELT (constructor_elt, v, ix, ce)
3352 gimplify_init_ctor_preeval (&ce->value, pre_p, post_p, data);
3357 /* If this is a variable sized type, we must remember the size. */
3358 maybe_with_size_expr (expr_p);
3360 /* Gimplify the constructor element to something appropriate for the rhs
3361 of a MODIFY_EXPR. Given that we know the LHS is an aggregate, we know
3362 the gimplifier will consider this a store to memory. Doing this
3363 gimplification now means that we won't have to deal with complicated
3364 language-specific trees, nor trees like SAVE_EXPR that can induce
3365 exponential search behavior. */
3366 one = gimplify_expr (expr_p, pre_p, post_p, is_gimple_mem_rhs, fb_rvalue);
3367 if (one == GS_ERROR)
3373 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
3374 with the lhs, since "a = { .x=a }" doesn't make sense. This will
3375 always be true for all scalars, since is_gimple_mem_rhs insists on a
3376 temporary variable for them. */
3377 if (DECL_P (*expr_p))
3380 /* If this is of variable size, we have no choice but to assume it doesn't
3381 overlap since we can't make a temporary for it. */
3382 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (*expr_p))) != INTEGER_CST)
3385 /* Otherwise, we must search for overlap ... */
3386 if (!walk_tree (expr_p, gimplify_init_ctor_preeval_1, data, NULL))
3389 /* ... and if found, force the value into a temporary. */
3390 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
3393 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
3394 a RANGE_EXPR in a CONSTRUCTOR for an array.
3398 object[var] = value;
3405 We increment var _after_ the loop exit check because we might otherwise
3406 fail if upper == TYPE_MAX_VALUE (type for upper).
3408 Note that we never have to deal with SAVE_EXPRs here, because this has
3409 already been taken care of for us, in gimplify_init_ctor_preeval(). */
3411 static void gimplify_init_ctor_eval (tree, VEC(constructor_elt,gc) *,
3412 gimple_seq *, bool);
3415 gimplify_init_ctor_eval_range (tree object, tree lower, tree upper,
3416 tree value, tree array_elt_type,
3417 gimple_seq *pre_p, bool cleared)
3419 tree loop_entry_label, loop_exit_label, fall_thru_label;
3420 tree var, var_type, cref, tmp;
3422 loop_entry_label = create_artificial_label (UNKNOWN_LOCATION);
3423 loop_exit_label = create_artificial_label (UNKNOWN_LOCATION);
3424 fall_thru_label = create_artificial_label (UNKNOWN_LOCATION);
3426 /* Create and initialize the index variable. */
3427 var_type = TREE_TYPE (upper);
3428 var = create_tmp_var (var_type, NULL);
3429 gimplify_seq_add_stmt (pre_p, gimple_build_assign (var, lower));
3431 /* Add the loop entry label. */
3432 gimplify_seq_add_stmt (pre_p, gimple_build_label (loop_entry_label));
3434 /* Build the reference. */
3435 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
3436 var, NULL_TREE, NULL_TREE);
3438 /* If we are a constructor, just call gimplify_init_ctor_eval to do
3439 the store. Otherwise just assign value to the reference. */
3441 if (TREE_CODE (value) == CONSTRUCTOR)
3442 /* NB we might have to call ourself recursively through
3443 gimplify_init_ctor_eval if the value is a constructor. */
3444 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
3447 gimplify_seq_add_stmt (pre_p, gimple_build_assign (cref, value));
3449 /* We exit the loop when the index var is equal to the upper bound. */
3450 gimplify_seq_add_stmt (pre_p,
3451 gimple_build_cond (EQ_EXPR, var, upper,
3452 loop_exit_label, fall_thru_label));
3454 gimplify_seq_add_stmt (pre_p, gimple_build_label (fall_thru_label));
3456 /* Otherwise, increment the index var... */
3457 tmp = build2 (PLUS_EXPR, var_type, var,
3458 fold_convert (var_type, integer_one_node));
3459 gimplify_seq_add_stmt (pre_p, gimple_build_assign (var, tmp));
3461 /* ...and jump back to the loop entry. */
3462 gimplify_seq_add_stmt (pre_p, gimple_build_goto (loop_entry_label));
3464 /* Add the loop exit label. */
3465 gimplify_seq_add_stmt (pre_p, gimple_build_label (loop_exit_label));
3468 /* Return true if FDECL is accessing a field that is zero sized. */
3471 zero_sized_field_decl (const_tree fdecl)
3473 if (TREE_CODE (fdecl) == FIELD_DECL && DECL_SIZE (fdecl)
3474 && integer_zerop (DECL_SIZE (fdecl)))
3479 /* Return true if TYPE is zero sized. */
3482 zero_sized_type (const_tree type)
3484 if (AGGREGATE_TYPE_P (type) && TYPE_SIZE (type)
3485 && integer_zerop (TYPE_SIZE (type)))
3490 /* A subroutine of gimplify_init_constructor. Generate individual
3491 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
3492 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
3493 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
3497 gimplify_init_ctor_eval (tree object, VEC(constructor_elt,gc) *elts,
3498 gimple_seq *pre_p, bool cleared)
3500 tree array_elt_type = NULL;
3501 unsigned HOST_WIDE_INT ix;
3502 tree purpose, value;
3504 if (TREE_CODE (TREE_TYPE (object)) == ARRAY_TYPE)
3505 array_elt_type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object)));
3507 FOR_EACH_CONSTRUCTOR_ELT (elts, ix, purpose, value)
3511 /* NULL values are created above for gimplification errors. */
3515 if (cleared && initializer_zerop (value))
3518 /* ??? Here's to hoping the front end fills in all of the indices,
3519 so we don't have to figure out what's missing ourselves. */
3520 gcc_assert (purpose);
3522 /* Skip zero-sized fields, unless value has side-effects. This can
3523 happen with calls to functions returning a zero-sized type, which
3524 we shouldn't discard. As a number of downstream passes don't
3525 expect sets of zero-sized fields, we rely on the gimplification of
3526 the MODIFY_EXPR we make below to drop the assignment statement. */
3527 if (! TREE_SIDE_EFFECTS (value) && zero_sized_field_decl (purpose))
3530 /* If we have a RANGE_EXPR, we have to build a loop to assign the
3532 if (TREE_CODE (purpose) == RANGE_EXPR)
3534 tree lower = TREE_OPERAND (purpose, 0);
3535 tree upper = TREE_OPERAND (purpose, 1);
3537 /* If the lower bound is equal to upper, just treat it as if
3538 upper was the index. */
3539 if (simple_cst_equal (lower, upper))
3543 gimplify_init_ctor_eval_range (object, lower, upper, value,
3544 array_elt_type, pre_p, cleared);
3551 /* Do not use bitsizetype for ARRAY_REF indices. */
3552 if (TYPE_DOMAIN (TREE_TYPE (object)))
3553 purpose = fold_convert (TREE_TYPE (TYPE_DOMAIN (TREE_TYPE (object))),
3555 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
3556 purpose, NULL_TREE, NULL_TREE);
3560 gcc_assert (TREE_CODE (purpose) == FIELD_DECL);
3561 cref = build3 (COMPONENT_REF, TREE_TYPE (purpose),
3562 unshare_expr (object), purpose, NULL_TREE);
3565 if (TREE_CODE (value) == CONSTRUCTOR
3566 && TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE)
3567 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
3571 tree init = build2 (INIT_EXPR, TREE_TYPE (cref), cref, value);
3572 gimplify_and_add (init, pre_p);
3579 /* Returns the appropriate RHS predicate for this LHS. */
3582 rhs_predicate_for (tree lhs)
3584 if (is_gimple_reg (lhs))
3585 return is_gimple_reg_rhs_or_call;
3587 return is_gimple_mem_rhs_or_call;
3590 /* Gimplify a C99 compound literal expression. This just means adding
3591 the DECL_EXPR before the current statement and using its anonymous
3594 static enum gimplify_status
3595 gimplify_compound_literal_expr (tree *expr_p, gimple_seq *pre_p)
3597 tree decl_s = COMPOUND_LITERAL_EXPR_DECL_EXPR (*expr_p);
3598 tree decl = DECL_EXPR_DECL (decl_s);
3599 /* Mark the decl as addressable if the compound literal
3600 expression is addressable now, otherwise it is marked too late
3601 after we gimplify the initialization expression. */
3602 if (TREE_ADDRESSABLE (*expr_p))
3603 TREE_ADDRESSABLE (decl) = 1;
3605 /* Preliminarily mark non-addressed complex variables as eligible
3606 for promotion to gimple registers. We'll transform their uses
3608 if ((TREE_CODE (TREE_TYPE (decl)) == COMPLEX_TYPE
3609 || TREE_CODE (TREE_TYPE (decl)) == VECTOR_TYPE)
3610 && !TREE_THIS_VOLATILE (decl)
3611 && !needs_to_live_in_memory (decl))
3612 DECL_GIMPLE_REG_P (decl) = 1;
3614 /* This decl isn't mentioned in the enclosing block, so add it to the
3615 list of temps. FIXME it seems a bit of a kludge to say that
3616 anonymous artificial vars aren't pushed, but everything else is. */
3617 if (DECL_NAME (decl) == NULL_TREE && !DECL_SEEN_IN_BIND_EXPR_P (decl))
3618 gimple_add_tmp_var (decl);
3620 gimplify_and_add (decl_s, pre_p);
3625 /* Optimize embedded COMPOUND_LITERAL_EXPRs within a CONSTRUCTOR,
3626 return a new CONSTRUCTOR if something changed. */
3629 optimize_compound_literals_in_ctor (tree orig_ctor)
3631 tree ctor = orig_ctor;
3632 VEC(constructor_elt,gc) *elts = CONSTRUCTOR_ELTS (ctor);
3633 unsigned int idx, num = VEC_length (constructor_elt, elts);
3635 for (idx = 0; idx < num; idx++)
3637 tree value = VEC_index (constructor_elt, elts, idx)->value;
3638 tree newval = value;
3639 if (TREE_CODE (value) == CONSTRUCTOR)
3640 newval = optimize_compound_literals_in_ctor (value);
3641 else if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
3643 tree decl_s = COMPOUND_LITERAL_EXPR_DECL_EXPR (value);
3644 tree decl = DECL_EXPR_DECL (decl_s);
3645 tree init = DECL_INITIAL (decl);
3647 if (!TREE_ADDRESSABLE (value)
3648 && !TREE_ADDRESSABLE (decl)
3650 && TREE_CODE (init) == CONSTRUCTOR)
3651 newval = optimize_compound_literals_in_ctor (init);
3653 if (newval == value)
3656 if (ctor == orig_ctor)
3658 ctor = copy_node (orig_ctor);
3659 CONSTRUCTOR_ELTS (ctor) = VEC_copy (constructor_elt, gc, elts);
3660 elts = CONSTRUCTOR_ELTS (ctor);
3662 VEC_index (constructor_elt, elts, idx)->value = newval;
3669 /* A subroutine of gimplify_modify_expr. Break out elements of a
3670 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
3672 Note that we still need to clear any elements that don't have explicit
3673 initializers, so if not all elements are initialized we keep the
3674 original MODIFY_EXPR, we just remove all of the constructor elements.
3676 If NOTIFY_TEMP_CREATION is true, do not gimplify, just return
3677 GS_ERROR if we would have to create a temporary when gimplifying
3678 this constructor. Otherwise, return GS_OK.
3680 If NOTIFY_TEMP_CREATION is false, just do the gimplification. */
3682 static enum gimplify_status
3683 gimplify_init_constructor (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
3684 bool want_value, bool notify_temp_creation)
3686 tree object, ctor, type;
3687 enum gimplify_status ret;
3688 VEC(constructor_elt,gc) *elts;
3690 gcc_assert (TREE_CODE (TREE_OPERAND (*expr_p, 1)) == CONSTRUCTOR);
3692 if (!notify_temp_creation)
3694 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3695 is_gimple_lvalue, fb_lvalue);
3696 if (ret == GS_ERROR)
3700 object = TREE_OPERAND (*expr_p, 0);
3701 ctor = TREE_OPERAND (*expr_p, 1) =
3702 optimize_compound_literals_in_ctor (TREE_OPERAND (*expr_p, 1));
3703 type = TREE_TYPE (ctor);
3704 elts = CONSTRUCTOR_ELTS (ctor);
3707 switch (TREE_CODE (type))
3711 case QUAL_UNION_TYPE:
3714 struct gimplify_init_ctor_preeval_data preeval_data;
3715 HOST_WIDE_INT num_type_elements, num_ctor_elements;
3716 HOST_WIDE_INT num_nonzero_elements;
3717 bool cleared, valid_const_initializer;
3719 /* Aggregate types must lower constructors to initialization of
3720 individual elements. The exception is that a CONSTRUCTOR node
3721 with no elements indicates zero-initialization of the whole. */
3722 if (VEC_empty (constructor_elt, elts))
3724 if (notify_temp_creation)
3729 /* Fetch information about the constructor to direct later processing.
3730 We might want to make static versions of it in various cases, and
3731 can only do so if it known to be a valid constant initializer. */
3732 valid_const_initializer
3733 = categorize_ctor_elements (ctor, &num_nonzero_elements,
3734 &num_ctor_elements, &cleared);
3736 /* If a const aggregate variable is being initialized, then it
3737 should never be a lose to promote the variable to be static. */
3738 if (valid_const_initializer
3739 && num_nonzero_elements > 1
3740 && TREE_READONLY (object)
3741 && TREE_CODE (object) == VAR_DECL
3742 && (flag_merge_constants >= 2 || !TREE_ADDRESSABLE (object)))
3744 if (notify_temp_creation)
3746 DECL_INITIAL (object) = ctor;
3747 TREE_STATIC (object) = 1;
3748 if (!DECL_NAME (object))
3749 DECL_NAME (object) = create_tmp_var_name ("C");
3750 walk_tree (&DECL_INITIAL (object), force_labels_r, NULL, NULL);
3752 /* ??? C++ doesn't automatically append a .<number> to the
3753 assembler name, and even when it does, it looks a FE private
3754 data structures to figure out what that number should be,
3755 which are not set for this variable. I suppose this is
3756 important for local statics for inline functions, which aren't
3757 "local" in the object file sense. So in order to get a unique
3758 TU-local symbol, we must invoke the lhd version now. */
3759 lhd_set_decl_assembler_name (object);
3761 *expr_p = NULL_TREE;
3765 /* If there are "lots" of initialized elements, even discounting
3766 those that are not address constants (and thus *must* be
3767 computed at runtime), then partition the constructor into
3768 constant and non-constant parts. Block copy the constant
3769 parts in, then generate code for the non-constant parts. */
3770 /* TODO. There's code in cp/typeck.c to do this. */
3772 num_type_elements = count_type_elements (type, true);
3774 /* If count_type_elements could not determine number of type elements
3775 for a constant-sized object, assume clearing is needed.
3776 Don't do this for variable-sized objects, as store_constructor
3777 will ignore the clearing of variable-sized objects. */
3778 if (num_type_elements < 0 && int_size_in_bytes (type) >= 0)
3780 /* If there are "lots" of zeros, then block clear the object first. */
3781 else if (num_type_elements - num_nonzero_elements
3782 > CLEAR_RATIO (optimize_function_for_speed_p (cfun))
3783 && num_nonzero_elements < num_type_elements/4)
3785 /* ??? This bit ought not be needed. For any element not present
3786 in the initializer, we should simply set them to zero. Except
3787 we'd need to *find* the elements that are not present, and that
3788 requires trickery to avoid quadratic compile-time behavior in
3789 large cases or excessive memory use in small cases. */
3790 else if (num_ctor_elements < num_type_elements)
3793 /* If there are "lots" of initialized elements, and all of them
3794 are valid address constants, then the entire initializer can
3795 be dropped to memory, and then memcpy'd out. Don't do this
3796 for sparse arrays, though, as it's more efficient to follow
3797 the standard CONSTRUCTOR behavior of memset followed by
3798 individual element initialization. Also don't do this for small
3799 all-zero initializers (which aren't big enough to merit
3800 clearing), and don't try to make bitwise copies of
3801 TREE_ADDRESSABLE types. */
3802 if (valid_const_initializer
3803 && !(cleared || num_nonzero_elements == 0)
3804 && !TREE_ADDRESSABLE (type))
3806 HOST_WIDE_INT size = int_size_in_bytes (type);
3809 /* ??? We can still get unbounded array types, at least
3810 from the C++ front end. This seems wrong, but attempt
3811 to work around it for now. */
3814 size = int_size_in_bytes (TREE_TYPE (object));
3816 TREE_TYPE (ctor) = type = TREE_TYPE (object);
3819 /* Find the maximum alignment we can assume for the object. */
3820 /* ??? Make use of DECL_OFFSET_ALIGN. */
3821 if (DECL_P (object))
3822 align = DECL_ALIGN (object);
3824 align = TYPE_ALIGN (type);
3827 && num_nonzero_elements > 1
3828 && !can_move_by_pieces (size, align))
3830 if (notify_temp_creation)
3833 walk_tree (&ctor, force_labels_r, NULL, NULL);
3834 ctor = tree_output_constant_def (ctor);
3835 if (!useless_type_conversion_p (type, TREE_TYPE (ctor)))
3836 ctor = build1 (VIEW_CONVERT_EXPR, type, ctor);
3837 TREE_OPERAND (*expr_p, 1) = ctor;
3839 /* This is no longer an assignment of a CONSTRUCTOR, but
3840 we still may have processing to do on the LHS. So
3841 pretend we didn't do anything here to let that happen. */
3842 return GS_UNHANDLED;
3846 /* If the target is volatile, we have non-zero elements and more than
3847 one field to assign, initialize the target from a temporary. */
3848 if (TREE_THIS_VOLATILE (object)
3849 && !TREE_ADDRESSABLE (type)
3850 && num_nonzero_elements > 0
3851 && VEC_length (constructor_elt, elts) > 1)
3853 tree temp = create_tmp_var (TYPE_MAIN_VARIANT (type), NULL);
3854 TREE_OPERAND (*expr_p, 0) = temp;
3855 *expr_p = build2 (COMPOUND_EXPR, TREE_TYPE (*expr_p),
3857 build2 (MODIFY_EXPR, void_type_node,
3862 if (notify_temp_creation)
3865 /* If there are nonzero elements and if needed, pre-evaluate to capture
3866 elements overlapping with the lhs into temporaries. We must do this
3867 before clearing to fetch the values before they are zeroed-out. */
3868 if (num_nonzero_elements > 0 && TREE_CODE (*expr_p) != INIT_EXPR)
3870 preeval_data.lhs_base_decl = get_base_address (object);
3871 if (!DECL_P (preeval_data.lhs_base_decl))
3872 preeval_data.lhs_base_decl = NULL;
3873 preeval_data.lhs_alias_set = get_alias_set (object);
3875 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p, 1),
3876 pre_p, post_p, &preeval_data);
3881 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3882 Note that we still have to gimplify, in order to handle the
3883 case of variable sized types. Avoid shared tree structures. */
3884 CONSTRUCTOR_ELTS (ctor) = NULL;
3885 TREE_SIDE_EFFECTS (ctor) = 0;
3886 object = unshare_expr (object);
3887 gimplify_stmt (expr_p, pre_p);
3890 /* If we have not block cleared the object, or if there are nonzero
3891 elements in the constructor, add assignments to the individual
3892 scalar fields of the object. */
3893 if (!cleared || num_nonzero_elements > 0)
3894 gimplify_init_ctor_eval (object, elts, pre_p, cleared);
3896 *expr_p = NULL_TREE;
3904 if (notify_temp_creation)
3907 /* Extract the real and imaginary parts out of the ctor. */
3908 gcc_assert (VEC_length (constructor_elt, elts) == 2);
3909 r = VEC_index (constructor_elt, elts, 0)->value;
3910 i = VEC_index (constructor_elt, elts, 1)->value;
3911 if (r == NULL || i == NULL)
3913 tree zero = build_zero_cst (TREE_TYPE (type));
3920 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3921 represent creation of a complex value. */
3922 if (TREE_CONSTANT (r) && TREE_CONSTANT (i))
3924 ctor = build_complex (type, r, i);
3925 TREE_OPERAND (*expr_p, 1) = ctor;
3929 ctor = build2 (COMPLEX_EXPR, type, r, i);
3930 TREE_OPERAND (*expr_p, 1) = ctor;
3931 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 1),
3934 rhs_predicate_for (TREE_OPERAND (*expr_p, 0)),
3942 unsigned HOST_WIDE_INT ix;
3943 constructor_elt *ce;
3945 if (notify_temp_creation)
3948 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3949 if (TREE_CONSTANT (ctor))
3951 bool constant_p = true;
3954 /* Even when ctor is constant, it might contain non-*_CST
3955 elements, such as addresses or trapping values like
3956 1.0/0.0 - 1.0/0.0. Such expressions don't belong
3957 in VECTOR_CST nodes. */
3958 FOR_EACH_CONSTRUCTOR_VALUE (elts, ix, value)
3959 if (!CONSTANT_CLASS_P (value))
3967 TREE_OPERAND (*expr_p, 1) = build_vector_from_ctor (type, elts);
3971 /* Don't reduce an initializer constant even if we can't
3972 make a VECTOR_CST. It won't do anything for us, and it'll
3973 prevent us from representing it as a single constant. */
3974 if (initializer_constant_valid_p (ctor, type))
3977 TREE_CONSTANT (ctor) = 0;
3980 /* Vector types use CONSTRUCTOR all the way through gimple
3981 compilation as a general initializer. */
3982 FOR_EACH_VEC_ELT (constructor_elt, elts, ix, ce)
3984 enum gimplify_status tret;
3985 tret = gimplify_expr (&ce->value, pre_p, post_p, is_gimple_val,
3987 if (tret == GS_ERROR)
3990 if (!is_gimple_reg (TREE_OPERAND (*expr_p, 0)))
3991 TREE_OPERAND (*expr_p, 1) = get_formal_tmp_var (ctor, pre_p);
3996 /* So how did we get a CONSTRUCTOR for a scalar type? */
4000 if (ret == GS_ERROR)
4002 else if (want_value)
4009 /* If we have gimplified both sides of the initializer but have
4010 not emitted an assignment, do so now. */
4013 tree lhs = TREE_OPERAND (*expr_p, 0);
4014 tree rhs = TREE_OPERAND (*expr_p, 1);
4015 gimple init = gimple_build_assign (lhs, rhs);
4016 gimplify_seq_add_stmt (pre_p, init);
4024 /* Given a pointer value OP0, return a simplified version of an
4025 indirection through OP0, or NULL_TREE if no simplification is
4026 possible. Note that the resulting type may be different from
4027 the type pointed to in the sense that it is still compatible
4028 from the langhooks point of view. */
4031 gimple_fold_indirect_ref (tree t)
4033 tree ptype = TREE_TYPE (t), type = TREE_TYPE (ptype);
4038 subtype = TREE_TYPE (sub);
4039 if (!POINTER_TYPE_P (subtype))
4042 if (TREE_CODE (sub) == ADDR_EXPR)
4044 tree op = TREE_OPERAND (sub, 0);
4045 tree optype = TREE_TYPE (op);
4047 if (useless_type_conversion_p (type, optype))
4050 /* *(foo *)&fooarray => fooarray[0] */
4051 if (TREE_CODE (optype) == ARRAY_TYPE
4052 && TREE_CODE (TYPE_SIZE (TREE_TYPE (optype))) == INTEGER_CST
4053 && useless_type_conversion_p (type, TREE_TYPE (optype)))
4055 tree type_domain = TYPE_DOMAIN (optype);
4056 tree min_val = size_zero_node;
4057 if (type_domain && TYPE_MIN_VALUE (type_domain))
4058 min_val = TYPE_MIN_VALUE (type_domain);
4059 if (TREE_CODE (min_val) == INTEGER_CST)
4060 return build4 (ARRAY_REF, type, op, min_val, NULL_TREE, NULL_TREE);
4062 /* *(foo *)&complexfoo => __real__ complexfoo */
4063 else if (TREE_CODE (optype) == COMPLEX_TYPE
4064 && useless_type_conversion_p (type, TREE_TYPE (optype)))
4065 return fold_build1 (REALPART_EXPR, type, op);
4066 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
4067 else if (TREE_CODE (optype) == VECTOR_TYPE
4068 && useless_type_conversion_p (type, TREE_TYPE (optype)))
4070 tree part_width = TYPE_SIZE (type);
4071 tree index = bitsize_int (0);
4072 return fold_build3 (BIT_FIELD_REF, type, op, part_width, index);
4076 /* *(p + CST) -> ... */
4077 if (TREE_CODE (sub) == POINTER_PLUS_EXPR
4078 && TREE_CODE (TREE_OPERAND (sub, 1)) == INTEGER_CST)
4080 tree addr = TREE_OPERAND (sub, 0);
4081 tree off = TREE_OPERAND (sub, 1);
4085 addrtype = TREE_TYPE (addr);
4087 /* ((foo*)&vectorfoo)[1] -> BIT_FIELD_REF<vectorfoo,...> */
4088 if (TREE_CODE (addr) == ADDR_EXPR
4089 && TREE_CODE (TREE_TYPE (addrtype)) == VECTOR_TYPE
4090 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (addrtype))))
4092 HOST_WIDE_INT offset = tree_low_cst (off, 0);
4093 tree part_width = TYPE_SIZE (type);
4094 unsigned HOST_WIDE_INT part_widthi
4095 = tree_low_cst (part_width, 0) / BITS_PER_UNIT;
4096 unsigned HOST_WIDE_INT indexi = offset * BITS_PER_UNIT;
4097 tree index = bitsize_int (indexi);
4098 if (offset / part_widthi
4099 <= TYPE_VECTOR_SUBPARTS (TREE_TYPE (addrtype)))
4100 return fold_build3 (BIT_FIELD_REF, type, TREE_OPERAND (addr, 0),
4104 /* ((foo*)&complexfoo)[1] -> __imag__ complexfoo */
4105 if (TREE_CODE (addr) == ADDR_EXPR
4106 && TREE_CODE (TREE_TYPE (addrtype)) == COMPLEX_TYPE
4107 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (addrtype))))
4109 tree size = TYPE_SIZE_UNIT (type);
4110 if (tree_int_cst_equal (size, off))
4111 return fold_build1 (IMAGPART_EXPR, type, TREE_OPERAND (addr, 0));
4114 /* *(p + CST) -> MEM_REF <p, CST>. */
4115 if (TREE_CODE (addr) != ADDR_EXPR
4116 || DECL_P (TREE_OPERAND (addr, 0)))
4117 return fold_build2 (MEM_REF, type,
4119 build_int_cst_wide (ptype,
4120 TREE_INT_CST_LOW (off),
4121 TREE_INT_CST_HIGH (off)));
4124 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
4125 if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
4126 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (subtype)))) == INTEGER_CST
4127 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (subtype))))
4130 tree min_val = size_zero_node;
4132 sub = gimple_fold_indirect_ref (sub);
4134 sub = build1 (INDIRECT_REF, TREE_TYPE (subtype), osub);
4135 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
4136 if (type_domain && TYPE_MIN_VALUE (type_domain))
4137 min_val = TYPE_MIN_VALUE (type_domain);
4138 if (TREE_CODE (min_val) == INTEGER_CST)
4139 return build4 (ARRAY_REF, type, sub, min_val, NULL_TREE, NULL_TREE);
4145 /* Given a pointer value OP0, return a simplified version of an
4146 indirection through OP0, or NULL_TREE if no simplification is
4147 possible. This may only be applied to a rhs of an expression.
4148 Note that the resulting type may be different from the type pointed
4149 to in the sense that it is still compatible from the langhooks
4153 gimple_fold_indirect_ref_rhs (tree t)
4155 return gimple_fold_indirect_ref (t);
4158 /* Subroutine of gimplify_modify_expr to do simplifications of
4159 MODIFY_EXPRs based on the code of the RHS. We loop for as long as
4160 something changes. */
4162 static enum gimplify_status
4163 gimplify_modify_expr_rhs (tree *expr_p, tree *from_p, tree *to_p,
4164 gimple_seq *pre_p, gimple_seq *post_p,
4167 enum gimplify_status ret = GS_UNHANDLED;
4173 switch (TREE_CODE (*from_p))
4176 /* If we're assigning from a read-only variable initialized with
4177 a constructor, do the direct assignment from the constructor,
4178 but only if neither source nor target are volatile since this
4179 latter assignment might end up being done on a per-field basis. */
4180 if (DECL_INITIAL (*from_p)
4181 && TREE_READONLY (*from_p)
4182 && !TREE_THIS_VOLATILE (*from_p)
4183 && !TREE_THIS_VOLATILE (*to_p)
4184 && TREE_CODE (DECL_INITIAL (*from_p)) == CONSTRUCTOR)
4186 tree old_from = *from_p;
4187 enum gimplify_status subret;
4189 /* Move the constructor into the RHS. */
4190 *from_p = unshare_expr (DECL_INITIAL (*from_p));
4192 /* Let's see if gimplify_init_constructor will need to put
4194 subret = gimplify_init_constructor (expr_p, NULL, NULL,
4196 if (subret == GS_ERROR)
4198 /* If so, revert the change. */
4210 /* If we have code like
4214 where the type of "x" is a (possibly cv-qualified variant
4215 of "A"), treat the entire expression as identical to "x".
4216 This kind of code arises in C++ when an object is bound
4217 to a const reference, and if "x" is a TARGET_EXPR we want
4218 to take advantage of the optimization below. */
4219 bool volatile_p = TREE_THIS_VOLATILE (*from_p);
4220 tree t = gimple_fold_indirect_ref_rhs (TREE_OPERAND (*from_p, 0));
4223 if (TREE_THIS_VOLATILE (t) != volatile_p)
4225 if (TREE_CODE_CLASS (TREE_CODE (t)) == tcc_declaration)
4226 t = build_simple_mem_ref_loc (EXPR_LOCATION (*from_p),
4227 build_fold_addr_expr (t));
4228 if (REFERENCE_CLASS_P (t))
4229 TREE_THIS_VOLATILE (t) = volatile_p;
4240 /* If we are initializing something from a TARGET_EXPR, strip the
4241 TARGET_EXPR and initialize it directly, if possible. This can't
4242 be done if the initializer is void, since that implies that the
4243 temporary is set in some non-trivial way.
4245 ??? What about code that pulls out the temp and uses it
4246 elsewhere? I think that such code never uses the TARGET_EXPR as
4247 an initializer. If I'm wrong, we'll die because the temp won't
4248 have any RTL. In that case, I guess we'll need to replace
4249 references somehow. */
4250 tree init = TARGET_EXPR_INITIAL (*from_p);
4253 && !VOID_TYPE_P (TREE_TYPE (init)))
4263 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
4265 gimplify_compound_expr (from_p, pre_p, true);
4271 /* If we already made some changes, let the front end have a
4272 crack at this before we break it down. */
4273 if (ret != GS_UNHANDLED)
4275 /* If we're initializing from a CONSTRUCTOR, break this into
4276 individual MODIFY_EXPRs. */
4277 return gimplify_init_constructor (expr_p, pre_p, post_p, want_value,
4281 /* If we're assigning to a non-register type, push the assignment
4282 down into the branches. This is mandatory for ADDRESSABLE types,
4283 since we cannot generate temporaries for such, but it saves a
4284 copy in other cases as well. */
4285 if (!is_gimple_reg_type (TREE_TYPE (*from_p)))
4287 /* This code should mirror the code in gimplify_cond_expr. */
4288 enum tree_code code = TREE_CODE (*expr_p);
4289 tree cond = *from_p;
4290 tree result = *to_p;
4292 ret = gimplify_expr (&result, pre_p, post_p,
4293 is_gimple_lvalue, fb_lvalue);
4294 if (ret != GS_ERROR)
4297 if (TREE_TYPE (TREE_OPERAND (cond, 1)) != void_type_node)
4298 TREE_OPERAND (cond, 1)
4299 = build2 (code, void_type_node, result,
4300 TREE_OPERAND (cond, 1));
4301 if (TREE_TYPE (TREE_OPERAND (cond, 2)) != void_type_node)
4302 TREE_OPERAND (cond, 2)
4303 = build2 (code, void_type_node, unshare_expr (result),
4304 TREE_OPERAND (cond, 2));
4306 TREE_TYPE (cond) = void_type_node;
4307 recalculate_side_effects (cond);
4311 gimplify_and_add (cond, pre_p);
4312 *expr_p = unshare_expr (result);
4321 /* For calls that return in memory, give *to_p as the CALL_EXPR's
4322 return slot so that we don't generate a temporary. */
4323 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p)
4324 && aggregate_value_p (*from_p, *from_p))
4328 if (!(rhs_predicate_for (*to_p))(*from_p))
4329 /* If we need a temporary, *to_p isn't accurate. */
4331 else if (TREE_CODE (*to_p) == RESULT_DECL
4332 && DECL_NAME (*to_p) == NULL_TREE
4333 && needs_to_live_in_memory (*to_p))
4334 /* It's OK to use the return slot directly unless it's an NRV. */
4336 else if (is_gimple_reg_type (TREE_TYPE (*to_p))
4337 || (DECL_P (*to_p) && DECL_REGISTER (*to_p)))
4338 /* Don't force regs into memory. */
4340 else if (TREE_CODE (*expr_p) == INIT_EXPR)
4341 /* It's OK to use the target directly if it's being
4344 else if (!is_gimple_non_addressable (*to_p))
4345 /* Don't use the original target if it's already addressable;
4346 if its address escapes, and the called function uses the
4347 NRV optimization, a conforming program could see *to_p
4348 change before the called function returns; see c++/19317.
4349 When optimizing, the return_slot pass marks more functions
4350 as safe after we have escape info. */
4357 CALL_EXPR_RETURN_SLOT_OPT (*from_p) = 1;
4358 mark_addressable (*to_p);
4363 case WITH_SIZE_EXPR:
4364 /* Likewise for calls that return an aggregate of non-constant size,
4365 since we would not be able to generate a temporary at all. */
4366 if (TREE_CODE (TREE_OPERAND (*from_p, 0)) == CALL_EXPR)
4368 *from_p = TREE_OPERAND (*from_p, 0);
4369 /* We don't change ret in this case because the
4370 WITH_SIZE_EXPR might have been added in
4371 gimplify_modify_expr, so returning GS_OK would lead to an
4377 /* If we're initializing from a container, push the initialization
4379 case CLEANUP_POINT_EXPR:
4381 case STATEMENT_LIST:
4383 tree wrap = *from_p;
4386 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_min_lval,
4388 if (ret != GS_ERROR)
4391 t = voidify_wrapper_expr (wrap, *expr_p);
4392 gcc_assert (t == *expr_p);
4396 gimplify_and_add (wrap, pre_p);
4397 *expr_p = unshare_expr (*to_p);
4404 case COMPOUND_LITERAL_EXPR:
4406 tree complit = TREE_OPERAND (*expr_p, 1);
4407 tree decl_s = COMPOUND_LITERAL_EXPR_DECL_EXPR (complit);
4408 tree decl = DECL_EXPR_DECL (decl_s);
4409 tree init = DECL_INITIAL (decl);
4411 /* struct T x = (struct T) { 0, 1, 2 } can be optimized
4412 into struct T x = { 0, 1, 2 } if the address of the
4413 compound literal has never been taken. */
4414 if (!TREE_ADDRESSABLE (complit)
4415 && !TREE_ADDRESSABLE (decl)
4418 *expr_p = copy_node (*expr_p);
4419 TREE_OPERAND (*expr_p, 1) = init;
4434 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
4435 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
4436 DECL_GIMPLE_REG_P set.
4438 IMPORTANT NOTE: This promotion is performed by introducing a load of the
4439 other, unmodified part of the complex object just before the total store.
4440 As a consequence, if the object is still uninitialized, an undefined value
4441 will be loaded into a register, which may result in a spurious exception
4442 if the register is floating-point and the value happens to be a signaling
4443 NaN for example. Then the fully-fledged complex operations lowering pass
4444 followed by a DCE pass are necessary in order to fix things up. */
4446 static enum gimplify_status
4447 gimplify_modify_expr_complex_part (tree *expr_p, gimple_seq *pre_p,
4450 enum tree_code code, ocode;
4451 tree lhs, rhs, new_rhs, other, realpart, imagpart;
4453 lhs = TREE_OPERAND (*expr_p, 0);
4454 rhs = TREE_OPERAND (*expr_p, 1);
4455 code = TREE_CODE (lhs);
4456 lhs = TREE_OPERAND (lhs, 0);
4458 ocode = code == REALPART_EXPR ? IMAGPART_EXPR : REALPART_EXPR;
4459 other = build1 (ocode, TREE_TYPE (rhs), lhs);
4460 other = get_formal_tmp_var (other, pre_p);
4462 realpart = code == REALPART_EXPR ? rhs : other;
4463 imagpart = code == REALPART_EXPR ? other : rhs;
4465 if (TREE_CONSTANT (realpart) && TREE_CONSTANT (imagpart))
4466 new_rhs = build_complex (TREE_TYPE (lhs), realpart, imagpart);
4468 new_rhs = build2 (COMPLEX_EXPR, TREE_TYPE (lhs), realpart, imagpart);
4470 gimplify_seq_add_stmt (pre_p, gimple_build_assign (lhs, new_rhs));
4471 *expr_p = (want_value) ? rhs : NULL_TREE;
4477 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
4483 PRE_P points to the list where side effects that must happen before
4484 *EXPR_P should be stored.
4486 POST_P points to the list where side effects that must happen after
4487 *EXPR_P should be stored.
4489 WANT_VALUE is nonzero iff we want to use the value of this expression
4490 in another expression. */
4492 static enum gimplify_status
4493 gimplify_modify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
4496 tree *from_p = &TREE_OPERAND (*expr_p, 1);
4497 tree *to_p = &TREE_OPERAND (*expr_p, 0);
4498 enum gimplify_status ret = GS_UNHANDLED;
4500 location_t loc = EXPR_LOCATION (*expr_p);
4502 gcc_assert (TREE_CODE (*expr_p) == MODIFY_EXPR
4503 || TREE_CODE (*expr_p) == INIT_EXPR);
4505 /* Insert pointer conversions required by the middle-end that are not
4506 required by the frontend. This fixes middle-end type checking for
4507 for example gcc.dg/redecl-6.c. */
4508 if (POINTER_TYPE_P (TREE_TYPE (*to_p)))
4510 STRIP_USELESS_TYPE_CONVERSION (*from_p);
4511 if (!useless_type_conversion_p (TREE_TYPE (*to_p), TREE_TYPE (*from_p)))
4512 *from_p = fold_convert_loc (loc, TREE_TYPE (*to_p), *from_p);
4515 /* See if any simplifications can be done based on what the RHS is. */
4516 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
4518 if (ret != GS_UNHANDLED)
4521 /* For zero sized types only gimplify the left hand side and right hand
4522 side as statements and throw away the assignment. Do this after
4523 gimplify_modify_expr_rhs so we handle TARGET_EXPRs of addressable
4525 if (zero_sized_type (TREE_TYPE (*from_p)) && !want_value)
4527 gimplify_stmt (from_p, pre_p);
4528 gimplify_stmt (to_p, pre_p);
4529 *expr_p = NULL_TREE;
4533 /* If the value being copied is of variable width, compute the length
4534 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
4535 before gimplifying any of the operands so that we can resolve any
4536 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
4537 the size of the expression to be copied, not of the destination, so
4538 that is what we must do here. */
4539 maybe_with_size_expr (from_p);
4541 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
4542 if (ret == GS_ERROR)
4545 /* As a special case, we have to temporarily allow for assignments
4546 with a CALL_EXPR on the RHS. Since in GIMPLE a function call is
4547 a toplevel statement, when gimplifying the GENERIC expression
4548 MODIFY_EXPR <a, CALL_EXPR <foo>>, we cannot create the tuple
4549 GIMPLE_ASSIGN <a, GIMPLE_CALL <foo>>.
4551 Instead, we need to create the tuple GIMPLE_CALL <a, foo>. To
4552 prevent gimplify_expr from trying to create a new temporary for
4553 foo's LHS, we tell it that it should only gimplify until it
4554 reaches the CALL_EXPR. On return from gimplify_expr, the newly
4555 created GIMPLE_CALL <foo> will be the last statement in *PRE_P
4556 and all we need to do here is set 'a' to be its LHS. */
4557 ret = gimplify_expr (from_p, pre_p, post_p, rhs_predicate_for (*to_p),
4559 if (ret == GS_ERROR)
4562 /* Now see if the above changed *from_p to something we handle specially. */
4563 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
4565 if (ret != GS_UNHANDLED)
4568 /* If we've got a variable sized assignment between two lvalues (i.e. does
4569 not involve a call), then we can make things a bit more straightforward
4570 by converting the assignment to memcpy or memset. */
4571 if (TREE_CODE (*from_p) == WITH_SIZE_EXPR)
4573 tree from = TREE_OPERAND (*from_p, 0);
4574 tree size = TREE_OPERAND (*from_p, 1);
4576 if (TREE_CODE (from) == CONSTRUCTOR)
4577 return gimplify_modify_expr_to_memset (expr_p, size, want_value, pre_p);
4579 if (is_gimple_addressable (from))
4582 return gimplify_modify_expr_to_memcpy (expr_p, size, want_value,
4587 /* Transform partial stores to non-addressable complex variables into
4588 total stores. This allows us to use real instead of virtual operands
4589 for these variables, which improves optimization. */
4590 if ((TREE_CODE (*to_p) == REALPART_EXPR
4591 || TREE_CODE (*to_p) == IMAGPART_EXPR)
4592 && is_gimple_reg (TREE_OPERAND (*to_p, 0)))
4593 return gimplify_modify_expr_complex_part (expr_p, pre_p, want_value);
4595 /* Try to alleviate the effects of the gimplification creating artificial
4596 temporaries (see for example is_gimple_reg_rhs) on the debug info. */
4597 if (!gimplify_ctxp->into_ssa
4598 && TREE_CODE (*from_p) == VAR_DECL
4599 && DECL_IGNORED_P (*from_p)
4601 && !DECL_IGNORED_P (*to_p))
4603 if (!DECL_NAME (*from_p) && DECL_NAME (*to_p))
4605 = create_tmp_var_name (IDENTIFIER_POINTER (DECL_NAME (*to_p)));
4606 DECL_DEBUG_EXPR_IS_FROM (*from_p) = 1;
4607 SET_DECL_DEBUG_EXPR (*from_p, *to_p);
4610 if (want_value && TREE_THIS_VOLATILE (*to_p))
4611 *from_p = get_initialized_tmp_var (*from_p, pre_p, post_p);
4613 if (TREE_CODE (*from_p) == CALL_EXPR)
4615 /* Since the RHS is a CALL_EXPR, we need to create a GIMPLE_CALL
4616 instead of a GIMPLE_ASSIGN. */
4617 assign = gimple_build_call_from_tree (*from_p);
4618 if (!gimple_call_noreturn_p (assign))
4619 gimple_call_set_lhs (assign, *to_p);
4623 assign = gimple_build_assign (*to_p, *from_p);
4624 gimple_set_location (assign, EXPR_LOCATION (*expr_p));
4627 gimplify_seq_add_stmt (pre_p, assign);
4629 if (gimplify_ctxp->into_ssa && is_gimple_reg (*to_p))
4631 /* If we've somehow already got an SSA_NAME on the LHS, then
4632 we've probably modified it twice. Not good. */
4633 gcc_assert (TREE_CODE (*to_p) != SSA_NAME);
4634 *to_p = make_ssa_name (*to_p, assign);
4635 gimple_set_lhs (assign, *to_p);
4640 *expr_p = TREE_THIS_VOLATILE (*to_p) ? *from_p : unshare_expr (*to_p);
4649 /* Gimplify a comparison between two variable-sized objects. Do this
4650 with a call to BUILT_IN_MEMCMP. */
4652 static enum gimplify_status
4653 gimplify_variable_sized_compare (tree *expr_p)
4655 location_t loc = EXPR_LOCATION (*expr_p);
4656 tree op0 = TREE_OPERAND (*expr_p, 0);
4657 tree op1 = TREE_OPERAND (*expr_p, 1);
4658 tree t, arg, dest, src, expr;
4660 arg = TYPE_SIZE_UNIT (TREE_TYPE (op0));
4661 arg = unshare_expr (arg);
4662 arg = SUBSTITUTE_PLACEHOLDER_IN_EXPR (arg, op0);
4663 src = build_fold_addr_expr_loc (loc, op1);
4664 dest = build_fold_addr_expr_loc (loc, op0);
4665 t = implicit_built_in_decls[BUILT_IN_MEMCMP];
4666 t = build_call_expr_loc (loc, t, 3, dest, src, arg);
4669 = build2 (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), t, integer_zero_node);
4670 SET_EXPR_LOCATION (expr, loc);
4676 /* Gimplify a comparison between two aggregate objects of integral scalar
4677 mode as a comparison between the bitwise equivalent scalar values. */
4679 static enum gimplify_status
4680 gimplify_scalar_mode_aggregate_compare (tree *expr_p)
4682 location_t loc = EXPR_LOCATION (*expr_p);
4683 tree op0 = TREE_OPERAND (*expr_p, 0);
4684 tree op1 = TREE_OPERAND (*expr_p, 1);
4686 tree type = TREE_TYPE (op0);
4687 tree scalar_type = lang_hooks.types.type_for_mode (TYPE_MODE (type), 1);
4689 op0 = fold_build1_loc (loc, VIEW_CONVERT_EXPR, scalar_type, op0);
4690 op1 = fold_build1_loc (loc, VIEW_CONVERT_EXPR, scalar_type, op1);
4693 = fold_build2_loc (loc, TREE_CODE (*expr_p), TREE_TYPE (*expr_p), op0, op1);
4698 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
4699 points to the expression to gimplify.
4701 Expressions of the form 'a && b' are gimplified to:
4703 a && b ? true : false
4705 LOCUS is the source location to be put on the generated COND_EXPR.
4706 gimplify_cond_expr will do the rest. */
4708 static enum gimplify_status
4709 gimplify_boolean_expr (tree *expr_p, location_t locus)
4711 /* Preserve the original type of the expression. */
4712 tree type = TREE_TYPE (*expr_p);
4714 *expr_p = build3 (COND_EXPR, type, *expr_p,
4715 fold_convert_loc (locus, type, boolean_true_node),
4716 fold_convert_loc (locus, type, boolean_false_node));
4718 SET_EXPR_LOCATION (*expr_p, locus);
4723 /* Gimplifies an expression sequence. This function gimplifies each
4724 expression and re-writes the original expression with the last
4725 expression of the sequence in GIMPLE form.
4727 PRE_P points to the list where the side effects for all the
4728 expressions in the sequence will be emitted.
4730 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
4732 static enum gimplify_status
4733 gimplify_compound_expr (tree *expr_p, gimple_seq *pre_p, bool want_value)
4739 tree *sub_p = &TREE_OPERAND (t, 0);
4741 if (TREE_CODE (*sub_p) == COMPOUND_EXPR)
4742 gimplify_compound_expr (sub_p, pre_p, false);
4744 gimplify_stmt (sub_p, pre_p);
4746 t = TREE_OPERAND (t, 1);
4748 while (TREE_CODE (t) == COMPOUND_EXPR);
4755 gimplify_stmt (expr_p, pre_p);
4761 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
4762 gimplify. After gimplification, EXPR_P will point to a new temporary
4763 that holds the original value of the SAVE_EXPR node.
4765 PRE_P points to the list where side effects that must happen before
4766 *EXPR_P should be stored. */
4768 static enum gimplify_status
4769 gimplify_save_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4771 enum gimplify_status ret = GS_ALL_DONE;
4774 gcc_assert (TREE_CODE (*expr_p) == SAVE_EXPR);
4775 val = TREE_OPERAND (*expr_p, 0);
4777 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
4778 if (!SAVE_EXPR_RESOLVED_P (*expr_p))
4780 /* The operand may be a void-valued expression such as SAVE_EXPRs
4781 generated by the Java frontend for class initialization. It is
4782 being executed only for its side-effects. */
4783 if (TREE_TYPE (val) == void_type_node)
4785 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
4786 is_gimple_stmt, fb_none);
4790 val = get_initialized_tmp_var (val, pre_p, post_p);
4792 TREE_OPERAND (*expr_p, 0) = val;
4793 SAVE_EXPR_RESOLVED_P (*expr_p) = 1;
4801 /* Re-write the ADDR_EXPR node pointed to by EXPR_P
4808 PRE_P points to the list where side effects that must happen before
4809 *EXPR_P should be stored.
4811 POST_P points to the list where side effects that must happen after
4812 *EXPR_P should be stored. */
4814 static enum gimplify_status
4815 gimplify_addr_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4817 tree expr = *expr_p;
4818 tree op0 = TREE_OPERAND (expr, 0);
4819 enum gimplify_status ret;
4820 location_t loc = EXPR_LOCATION (*expr_p);
4822 switch (TREE_CODE (op0))
4826 /* Check if we are dealing with an expression of the form '&*ptr'.
4827 While the front end folds away '&*ptr' into 'ptr', these
4828 expressions may be generated internally by the compiler (e.g.,
4829 builtins like __builtin_va_end). */
4830 /* Caution: the silent array decomposition semantics we allow for
4831 ADDR_EXPR means we can't always discard the pair. */
4832 /* Gimplification of the ADDR_EXPR operand may drop
4833 cv-qualification conversions, so make sure we add them if
4836 tree op00 = TREE_OPERAND (op0, 0);
4837 tree t_expr = TREE_TYPE (expr);
4838 tree t_op00 = TREE_TYPE (op00);
4840 if (!useless_type_conversion_p (t_expr, t_op00))
4841 op00 = fold_convert_loc (loc, TREE_TYPE (expr), op00);
4847 case VIEW_CONVERT_EXPR:
4848 /* Take the address of our operand and then convert it to the type of
4851 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
4852 all clear. The impact of this transformation is even less clear. */
4854 /* If the operand is a useless conversion, look through it. Doing so
4855 guarantees that the ADDR_EXPR and its operand will remain of the
4857 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0, 0)))
4858 op0 = TREE_OPERAND (op0, 0);
4860 *expr_p = fold_convert_loc (loc, TREE_TYPE (expr),
4861 build_fold_addr_expr_loc (loc,
4862 TREE_OPERAND (op0, 0)));
4867 /* We use fb_either here because the C frontend sometimes takes
4868 the address of a call that returns a struct; see
4869 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
4870 the implied temporary explicit. */
4872 /* Make the operand addressable. */
4873 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, post_p,
4874 is_gimple_addressable, fb_either);
4875 if (ret == GS_ERROR)
4878 /* Then mark it. Beware that it may not be possible to do so directly
4879 if a temporary has been created by the gimplification. */
4880 prepare_gimple_addressable (&TREE_OPERAND (expr, 0), pre_p);
4882 op0 = TREE_OPERAND (expr, 0);
4884 /* For various reasons, the gimplification of the expression
4885 may have made a new INDIRECT_REF. */
4886 if (TREE_CODE (op0) == INDIRECT_REF)
4887 goto do_indirect_ref;
4889 mark_addressable (TREE_OPERAND (expr, 0));
4891 /* The FEs may end up building ADDR_EXPRs early on a decl with
4892 an incomplete type. Re-build ADDR_EXPRs in canonical form
4894 if (!types_compatible_p (TREE_TYPE (op0), TREE_TYPE (TREE_TYPE (expr))))
4895 *expr_p = build_fold_addr_expr (op0);
4897 /* Make sure TREE_CONSTANT and TREE_SIDE_EFFECTS are set properly. */
4898 recompute_tree_invariant_for_addr_expr (*expr_p);
4900 /* If we re-built the ADDR_EXPR add a conversion to the original type
4902 if (!useless_type_conversion_p (TREE_TYPE (expr), TREE_TYPE (*expr_p)))
4903 *expr_p = fold_convert (TREE_TYPE (expr), *expr_p);
4911 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
4912 value; output operands should be a gimple lvalue. */
4914 static enum gimplify_status
4915 gimplify_asm_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4919 const char **oconstraints;
4922 const char *constraint;
4923 bool allows_mem, allows_reg, is_inout;
4924 enum gimplify_status ret, tret;
4926 VEC(tree, gc) *inputs;
4927 VEC(tree, gc) *outputs;
4928 VEC(tree, gc) *clobbers;
4929 VEC(tree, gc) *labels;
4933 noutputs = list_length (ASM_OUTPUTS (expr));
4934 oconstraints = (const char **) alloca ((noutputs) * sizeof (const char *));
4936 inputs = outputs = clobbers = labels = NULL;
4939 link_next = NULL_TREE;
4940 for (i = 0, link = ASM_OUTPUTS (expr); link; ++i, link = link_next)
4943 size_t constraint_len;
4945 link_next = TREE_CHAIN (link);
4949 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4950 constraint_len = strlen (constraint);
4951 if (constraint_len == 0)
4954 ok = parse_output_constraint (&constraint, i, 0, 0,
4955 &allows_mem, &allows_reg, &is_inout);
4962 if (!allows_reg && allows_mem)
4963 mark_addressable (TREE_VALUE (link));
4965 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4966 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
4967 fb_lvalue | fb_mayfail);
4968 if (tret == GS_ERROR)
4970 error ("invalid lvalue in asm output %d", i);
4974 VEC_safe_push (tree, gc, outputs, link);
4975 TREE_CHAIN (link) = NULL_TREE;
4979 /* An input/output operand. To give the optimizers more
4980 flexibility, split it into separate input and output
4985 /* Turn the in/out constraint into an output constraint. */
4986 char *p = xstrdup (constraint);
4988 TREE_VALUE (TREE_PURPOSE (link)) = build_string (constraint_len, p);
4990 /* And add a matching input constraint. */
4993 sprintf (buf, "%d", i);
4995 /* If there are multiple alternatives in the constraint,
4996 handle each of them individually. Those that allow register
4997 will be replaced with operand number, the others will stay
4999 if (strchr (p, ',') != NULL)
5001 size_t len = 0, buflen = strlen (buf);
5002 char *beg, *end, *str, *dst;
5006 end = strchr (beg, ',');
5008 end = strchr (beg, '\0');
5009 if ((size_t) (end - beg) < buflen)
5012 len += end - beg + 1;
5019 str = (char *) alloca (len);
5020 for (beg = p + 1, dst = str;;)
5023 bool mem_p, reg_p, inout_p;
5025 end = strchr (beg, ',');
5030 parse_output_constraint (&tem, i, 0, 0,
5031 &mem_p, ®_p, &inout_p);
5036 memcpy (dst, buf, buflen);
5045 memcpy (dst, beg, len);
5054 input = build_string (dst - str, str);
5057 input = build_string (strlen (buf), buf);
5060 input = build_string (constraint_len - 1, constraint + 1);
5064 input = build_tree_list (build_tree_list (NULL_TREE, input),
5065 unshare_expr (TREE_VALUE (link)));
5066 ASM_INPUTS (expr) = chainon (ASM_INPUTS (expr), input);
5070 link_next = NULL_TREE;
5071 for (link = ASM_INPUTS (expr); link; ++i, link = link_next)
5073 link_next = TREE_CHAIN (link);
5074 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
5075 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
5076 oconstraints, &allows_mem, &allows_reg);
5078 /* If we can't make copies, we can only accept memory. */
5079 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (link))))
5085 error ("impossible constraint in %<asm%>");
5086 error ("non-memory input %d must stay in memory", i);
5091 /* If the operand is a memory input, it should be an lvalue. */
5092 if (!allows_reg && allows_mem)
5094 tree inputv = TREE_VALUE (link);
5095 STRIP_NOPS (inputv);
5096 if (TREE_CODE (inputv) == PREDECREMENT_EXPR
5097 || TREE_CODE (inputv) == PREINCREMENT_EXPR
5098 || TREE_CODE (inputv) == POSTDECREMENT_EXPR
5099 || TREE_CODE (inputv) == POSTINCREMENT_EXPR)
5100 TREE_VALUE (link) = error_mark_node;
5101 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
5102 is_gimple_lvalue, fb_lvalue | fb_mayfail);
5103 mark_addressable (TREE_VALUE (link));
5104 if (tret == GS_ERROR)
5106 if (EXPR_HAS_LOCATION (TREE_VALUE (link)))
5107 input_location = EXPR_LOCATION (TREE_VALUE (link));
5108 error ("memory input %d is not directly addressable", i);
5114 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
5115 is_gimple_asm_val, fb_rvalue);
5116 if (tret == GS_ERROR)
5120 TREE_CHAIN (link) = NULL_TREE;
5121 VEC_safe_push (tree, gc, inputs, link);
5124 for (link = ASM_CLOBBERS (expr); link; ++i, link = TREE_CHAIN (link))
5125 VEC_safe_push (tree, gc, clobbers, link);
5127 for (link = ASM_LABELS (expr); link; ++i, link = TREE_CHAIN (link))
5128 VEC_safe_push (tree, gc, labels, link);
5130 /* Do not add ASMs with errors to the gimple IL stream. */
5131 if (ret != GS_ERROR)
5133 stmt = gimple_build_asm_vec (TREE_STRING_POINTER (ASM_STRING (expr)),
5134 inputs, outputs, clobbers, labels);
5136 gimple_asm_set_volatile (stmt, ASM_VOLATILE_P (expr));
5137 gimple_asm_set_input (stmt, ASM_INPUT_P (expr));
5139 gimplify_seq_add_stmt (pre_p, stmt);
5145 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
5146 GIMPLE_WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
5147 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
5148 return to this function.
5150 FIXME should we complexify the prequeue handling instead? Or use flags
5151 for all the cleanups and let the optimizer tighten them up? The current
5152 code seems pretty fragile; it will break on a cleanup within any
5153 non-conditional nesting. But any such nesting would be broken, anyway;
5154 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
5155 and continues out of it. We can do that at the RTL level, though, so
5156 having an optimizer to tighten up try/finally regions would be a Good
5159 static enum gimplify_status
5160 gimplify_cleanup_point_expr (tree *expr_p, gimple_seq *pre_p)
5162 gimple_stmt_iterator iter;
5163 gimple_seq body_sequence = NULL;
5165 tree temp = voidify_wrapper_expr (*expr_p, NULL);
5167 /* We only care about the number of conditions between the innermost
5168 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
5169 any cleanups collected outside the CLEANUP_POINT_EXPR. */
5170 int old_conds = gimplify_ctxp->conditions;
5171 gimple_seq old_cleanups = gimplify_ctxp->conditional_cleanups;
5172 gimplify_ctxp->conditions = 0;
5173 gimplify_ctxp->conditional_cleanups = NULL;
5175 gimplify_stmt (&TREE_OPERAND (*expr_p, 0), &body_sequence);
5177 gimplify_ctxp->conditions = old_conds;
5178 gimplify_ctxp->conditional_cleanups = old_cleanups;
5180 for (iter = gsi_start (body_sequence); !gsi_end_p (iter); )
5182 gimple wce = gsi_stmt (iter);
5184 if (gimple_code (wce) == GIMPLE_WITH_CLEANUP_EXPR)
5186 if (gsi_one_before_end_p (iter))
5188 /* Note that gsi_insert_seq_before and gsi_remove do not
5189 scan operands, unlike some other sequence mutators. */
5190 if (!gimple_wce_cleanup_eh_only (wce))
5191 gsi_insert_seq_before_without_update (&iter,
5192 gimple_wce_cleanup (wce),
5194 gsi_remove (&iter, true);
5201 enum gimple_try_flags kind;
5203 if (gimple_wce_cleanup_eh_only (wce))
5204 kind = GIMPLE_TRY_CATCH;
5206 kind = GIMPLE_TRY_FINALLY;
5207 seq = gsi_split_seq_after (iter);
5209 gtry = gimple_build_try (seq, gimple_wce_cleanup (wce), kind);
5210 /* Do not use gsi_replace here, as it may scan operands.
5211 We want to do a simple structural modification only. */
5212 *gsi_stmt_ptr (&iter) = gtry;
5213 iter = gsi_start (seq);
5220 gimplify_seq_add_seq (pre_p, body_sequence);
5233 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
5234 is the cleanup action required. EH_ONLY is true if the cleanup should
5235 only be executed if an exception is thrown, not on normal exit. */
5238 gimple_push_cleanup (tree var, tree cleanup, bool eh_only, gimple_seq *pre_p)
5241 gimple_seq cleanup_stmts = NULL;
5243 /* Errors can result in improperly nested cleanups. Which results in
5244 confusion when trying to resolve the GIMPLE_WITH_CLEANUP_EXPR. */
5248 if (gimple_conditional_context ())
5250 /* If we're in a conditional context, this is more complex. We only
5251 want to run the cleanup if we actually ran the initialization that
5252 necessitates it, but we want to run it after the end of the
5253 conditional context. So we wrap the try/finally around the
5254 condition and use a flag to determine whether or not to actually
5255 run the destructor. Thus
5259 becomes (approximately)
5263 if (test) { A::A(temp); flag = 1; val = f(temp); }
5266 if (flag) A::~A(temp);
5270 tree flag = create_tmp_var (boolean_type_node, "cleanup");
5271 gimple ffalse = gimple_build_assign (flag, boolean_false_node);
5272 gimple ftrue = gimple_build_assign (flag, boolean_true_node);
5274 cleanup = build3 (COND_EXPR, void_type_node, flag, cleanup, NULL);
5275 gimplify_stmt (&cleanup, &cleanup_stmts);
5276 wce = gimple_build_wce (cleanup_stmts);
5278 gimplify_seq_add_stmt (&gimplify_ctxp->conditional_cleanups, ffalse);
5279 gimplify_seq_add_stmt (&gimplify_ctxp->conditional_cleanups, wce);
5280 gimplify_seq_add_stmt (pre_p, ftrue);
5282 /* Because of this manipulation, and the EH edges that jump
5283 threading cannot redirect, the temporary (VAR) will appear
5284 to be used uninitialized. Don't warn. */
5285 TREE_NO_WARNING (var) = 1;
5289 gimplify_stmt (&cleanup, &cleanup_stmts);
5290 wce = gimple_build_wce (cleanup_stmts);
5291 gimple_wce_set_cleanup_eh_only (wce, eh_only);
5292 gimplify_seq_add_stmt (pre_p, wce);
5296 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
5298 static enum gimplify_status
5299 gimplify_target_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
5301 tree targ = *expr_p;
5302 tree temp = TARGET_EXPR_SLOT (targ);
5303 tree init = TARGET_EXPR_INITIAL (targ);
5304 enum gimplify_status ret;
5308 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
5309 to the temps list. Handle also variable length TARGET_EXPRs. */
5310 if (TREE_CODE (DECL_SIZE (temp)) != INTEGER_CST)
5312 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (temp)))
5313 gimplify_type_sizes (TREE_TYPE (temp), pre_p);
5314 gimplify_vla_decl (temp, pre_p);
5317 gimple_add_tmp_var (temp);
5319 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
5320 expression is supposed to initialize the slot. */
5321 if (VOID_TYPE_P (TREE_TYPE (init)))
5322 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
5325 tree init_expr = build2 (INIT_EXPR, void_type_node, temp, init);
5327 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
5329 ggc_free (init_expr);
5331 if (ret == GS_ERROR)
5333 /* PR c++/28266 Make sure this is expanded only once. */
5334 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
5338 gimplify_and_add (init, pre_p);
5340 /* If needed, push the cleanup for the temp. */
5341 if (TARGET_EXPR_CLEANUP (targ))
5342 gimple_push_cleanup (temp, TARGET_EXPR_CLEANUP (targ),
5343 CLEANUP_EH_ONLY (targ), pre_p);
5345 /* Only expand this once. */
5346 TREE_OPERAND (targ, 3) = init;
5347 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
5350 /* We should have expanded this before. */
5351 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp));
5357 /* Gimplification of expression trees. */
5359 /* Gimplify an expression which appears at statement context. The
5360 corresponding GIMPLE statements are added to *SEQ_P. If *SEQ_P is
5361 NULL, a new sequence is allocated.
5363 Return true if we actually added a statement to the queue. */
5366 gimplify_stmt (tree *stmt_p, gimple_seq *seq_p)
5368 gimple_seq_node last;
5371 *seq_p = gimple_seq_alloc ();
5373 last = gimple_seq_last (*seq_p);
5374 gimplify_expr (stmt_p, seq_p, NULL, is_gimple_stmt, fb_none);
5375 return last != gimple_seq_last (*seq_p);
5379 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
5380 to CTX. If entries already exist, force them to be some flavor of private.
5381 If there is no enclosing parallel, do nothing. */
5384 omp_firstprivatize_variable (struct gimplify_omp_ctx *ctx, tree decl)
5388 if (decl == NULL || !DECL_P (decl))
5393 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5396 if (n->value & GOVD_SHARED)
5397 n->value = GOVD_FIRSTPRIVATE | (n->value & GOVD_SEEN);
5401 else if (ctx->region_type != ORT_WORKSHARE)
5402 omp_add_variable (ctx, decl, GOVD_FIRSTPRIVATE);
5404 ctx = ctx->outer_context;
5409 /* Similarly for each of the type sizes of TYPE. */
5412 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx *ctx, tree type)
5414 if (type == NULL || type == error_mark_node)
5416 type = TYPE_MAIN_VARIANT (type);
5418 if (pointer_set_insert (ctx->privatized_types, type))
5421 switch (TREE_CODE (type))
5427 case FIXED_POINT_TYPE:
5428 omp_firstprivatize_variable (ctx, TYPE_MIN_VALUE (type));
5429 omp_firstprivatize_variable (ctx, TYPE_MAX_VALUE (type));
5433 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
5434 omp_firstprivatize_type_sizes (ctx, TYPE_DOMAIN (type));
5439 case QUAL_UNION_TYPE:
5442 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
5443 if (TREE_CODE (field) == FIELD_DECL)
5445 omp_firstprivatize_variable (ctx, DECL_FIELD_OFFSET (field));
5446 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (field));
5452 case REFERENCE_TYPE:
5453 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
5460 omp_firstprivatize_variable (ctx, TYPE_SIZE (type));
5461 omp_firstprivatize_variable (ctx, TYPE_SIZE_UNIT (type));
5462 lang_hooks.types.omp_firstprivatize_type_sizes (ctx, type);
5465 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
5468 omp_add_variable (struct gimplify_omp_ctx *ctx, tree decl, unsigned int flags)
5471 unsigned int nflags;
5474 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5477 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
5478 there are constructors involved somewhere. */
5479 if (TREE_ADDRESSABLE (TREE_TYPE (decl))
5480 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
5483 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5486 /* We shouldn't be re-adding the decl with the same data
5488 gcc_assert ((n->value & GOVD_DATA_SHARE_CLASS & flags) == 0);
5489 /* The only combination of data sharing classes we should see is
5490 FIRSTPRIVATE and LASTPRIVATE. */
5491 nflags = n->value | flags;
5492 gcc_assert ((nflags & GOVD_DATA_SHARE_CLASS)
5493 == (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE));
5498 /* When adding a variable-sized variable, we have to handle all sorts
5499 of additional bits of data: the pointer replacement variable, and
5500 the parameters of the type. */
5501 if (DECL_SIZE (decl) && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
5503 /* Add the pointer replacement variable as PRIVATE if the variable
5504 replacement is private, else FIRSTPRIVATE since we'll need the
5505 address of the original variable either for SHARED, or for the
5506 copy into or out of the context. */
5507 if (!(flags & GOVD_LOCAL))
5509 nflags = flags & GOVD_PRIVATE ? GOVD_PRIVATE : GOVD_FIRSTPRIVATE;
5510 nflags |= flags & GOVD_SEEN;
5511 t = DECL_VALUE_EXPR (decl);
5512 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
5513 t = TREE_OPERAND (t, 0);
5514 gcc_assert (DECL_P (t));
5515 omp_add_variable (ctx, t, nflags);
5518 /* Add all of the variable and type parameters (which should have
5519 been gimplified to a formal temporary) as FIRSTPRIVATE. */
5520 omp_firstprivatize_variable (ctx, DECL_SIZE_UNIT (decl));
5521 omp_firstprivatize_variable (ctx, DECL_SIZE (decl));
5522 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
5524 /* The variable-sized variable itself is never SHARED, only some form
5525 of PRIVATE. The sharing would take place via the pointer variable
5526 which we remapped above. */
5527 if (flags & GOVD_SHARED)
5528 flags = GOVD_PRIVATE | GOVD_DEBUG_PRIVATE
5529 | (flags & (GOVD_SEEN | GOVD_EXPLICIT));
5531 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
5532 alloca statement we generate for the variable, so make sure it
5533 is available. This isn't automatically needed for the SHARED
5534 case, since we won't be allocating local storage then.
5535 For local variables TYPE_SIZE_UNIT might not be gimplified yet,
5536 in this case omp_notice_variable will be called later
5537 on when it is gimplified. */
5538 else if (! (flags & GOVD_LOCAL)
5539 && DECL_P (TYPE_SIZE_UNIT (TREE_TYPE (decl))))
5540 omp_notice_variable (ctx, TYPE_SIZE_UNIT (TREE_TYPE (decl)), true);
5542 else if (lang_hooks.decls.omp_privatize_by_reference (decl))
5544 gcc_assert ((flags & GOVD_LOCAL) == 0);
5545 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
5547 /* Similar to the direct variable sized case above, we'll need the
5548 size of references being privatized. */
5549 if ((flags & GOVD_SHARED) == 0)
5551 t = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl)));
5552 if (TREE_CODE (t) != INTEGER_CST)
5553 omp_notice_variable (ctx, t, true);
5557 splay_tree_insert (ctx->variables, (splay_tree_key)decl, flags);
5560 /* Notice a threadprivate variable DECL used in OpenMP context CTX.
5561 This just prints out diagnostics about threadprivate variable uses
5562 in untied tasks. If DECL2 is non-NULL, prevent this warning
5563 on that variable. */
5566 omp_notice_threadprivate_variable (struct gimplify_omp_ctx *ctx, tree decl,
5571 if (ctx->region_type != ORT_UNTIED_TASK)
5573 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5576 error ("threadprivate variable %qE used in untied task", DECL_NAME (decl));
5577 error_at (ctx->location, "enclosing task");
5578 splay_tree_insert (ctx->variables, (splay_tree_key)decl, 0);
5581 splay_tree_insert (ctx->variables, (splay_tree_key)decl2, 0);
5585 /* Record the fact that DECL was used within the OpenMP context CTX.
5586 IN_CODE is true when real code uses DECL, and false when we should
5587 merely emit default(none) errors. Return true if DECL is going to
5588 be remapped and thus DECL shouldn't be gimplified into its
5589 DECL_VALUE_EXPR (if any). */
5592 omp_notice_variable (struct gimplify_omp_ctx *ctx, tree decl, bool in_code)
5595 unsigned flags = in_code ? GOVD_SEEN : 0;
5596 bool ret = false, shared;
5598 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5601 /* Threadprivate variables are predetermined. */
5602 if (is_global_var (decl))
5604 if (DECL_THREAD_LOCAL_P (decl))
5605 return omp_notice_threadprivate_variable (ctx, decl, NULL_TREE);
5607 if (DECL_HAS_VALUE_EXPR_P (decl))
5609 tree value = get_base_address (DECL_VALUE_EXPR (decl));
5611 if (value && DECL_P (value) && DECL_THREAD_LOCAL_P (value))
5612 return omp_notice_threadprivate_variable (ctx, decl, value);
5616 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5619 enum omp_clause_default_kind default_kind, kind;
5620 struct gimplify_omp_ctx *octx;
5622 if (ctx->region_type == ORT_WORKSHARE)
5625 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
5626 remapped firstprivate instead of shared. To some extent this is
5627 addressed in omp_firstprivatize_type_sizes, but not effectively. */
5628 default_kind = ctx->default_kind;
5629 kind = lang_hooks.decls.omp_predetermined_sharing (decl);
5630 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
5631 default_kind = kind;
5633 switch (default_kind)
5635 case OMP_CLAUSE_DEFAULT_NONE:
5636 error ("%qE not specified in enclosing parallel",
5637 DECL_NAME (lang_hooks.decls.omp_report_decl (decl)));
5638 if ((ctx->region_type & ORT_TASK) != 0)
5639 error_at (ctx->location, "enclosing task");
5641 error_at (ctx->location, "enclosing parallel");
5643 case OMP_CLAUSE_DEFAULT_SHARED:
5644 flags |= GOVD_SHARED;
5646 case OMP_CLAUSE_DEFAULT_PRIVATE:
5647 flags |= GOVD_PRIVATE;
5649 case OMP_CLAUSE_DEFAULT_FIRSTPRIVATE:
5650 flags |= GOVD_FIRSTPRIVATE;
5652 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
5653 /* decl will be either GOVD_FIRSTPRIVATE or GOVD_SHARED. */
5654 gcc_assert ((ctx->region_type & ORT_TASK) != 0);
5655 if (ctx->outer_context)
5656 omp_notice_variable (ctx->outer_context, decl, in_code);
5657 for (octx = ctx->outer_context; octx; octx = octx->outer_context)
5661 n2 = splay_tree_lookup (octx->variables, (splay_tree_key) decl);
5662 if (n2 && (n2->value & GOVD_DATA_SHARE_CLASS) != GOVD_SHARED)
5664 flags |= GOVD_FIRSTPRIVATE;
5667 if ((octx->region_type & ORT_PARALLEL) != 0)
5670 if (flags & GOVD_FIRSTPRIVATE)
5673 && (TREE_CODE (decl) == PARM_DECL
5674 || (!is_global_var (decl)
5675 && DECL_CONTEXT (decl) == current_function_decl)))
5677 flags |= GOVD_FIRSTPRIVATE;
5680 flags |= GOVD_SHARED;
5686 if ((flags & GOVD_PRIVATE)
5687 && lang_hooks.decls.omp_private_outer_ref (decl))
5688 flags |= GOVD_PRIVATE_OUTER_REF;
5690 omp_add_variable (ctx, decl, flags);
5692 shared = (flags & GOVD_SHARED) != 0;
5693 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
5697 if ((n->value & (GOVD_SEEN | GOVD_LOCAL)) == 0
5698 && (flags & (GOVD_SEEN | GOVD_LOCAL)) == GOVD_SEEN
5700 && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
5703 tree t = DECL_VALUE_EXPR (decl);
5704 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
5705 t = TREE_OPERAND (t, 0);
5706 gcc_assert (DECL_P (t));
5707 n2 = splay_tree_lookup (ctx->variables, (splay_tree_key) t);
5708 n2->value |= GOVD_SEEN;
5711 shared = ((flags | n->value) & GOVD_SHARED) != 0;
5712 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
5714 /* If nothing changed, there's nothing left to do. */
5715 if ((n->value & flags) == flags)
5721 /* If the variable is private in the current context, then we don't
5722 need to propagate anything to an outer context. */
5723 if ((flags & GOVD_PRIVATE) && !(flags & GOVD_PRIVATE_OUTER_REF))
5725 if (ctx->outer_context
5726 && omp_notice_variable (ctx->outer_context, decl, in_code))
5731 /* Verify that DECL is private within CTX. If there's specific information
5732 to the contrary in the innermost scope, generate an error. */
5735 omp_is_private (struct gimplify_omp_ctx *ctx, tree decl)
5739 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5742 if (n->value & GOVD_SHARED)
5744 if (ctx == gimplify_omp_ctxp)
5746 error ("iteration variable %qE should be private",
5748 n->value = GOVD_PRIVATE;
5754 else if ((n->value & GOVD_EXPLICIT) != 0
5755 && (ctx == gimplify_omp_ctxp
5756 || (ctx->region_type == ORT_COMBINED_PARALLEL
5757 && gimplify_omp_ctxp->outer_context == ctx)))
5759 if ((n->value & GOVD_FIRSTPRIVATE) != 0)
5760 error ("iteration variable %qE should not be firstprivate",
5762 else if ((n->value & GOVD_REDUCTION) != 0)
5763 error ("iteration variable %qE should not be reduction",
5766 return (ctx == gimplify_omp_ctxp
5767 || (ctx->region_type == ORT_COMBINED_PARALLEL
5768 && gimplify_omp_ctxp->outer_context == ctx));
5771 if (ctx->region_type != ORT_WORKSHARE)
5773 else if (ctx->outer_context)
5774 return omp_is_private (ctx->outer_context, decl);
5778 /* Return true if DECL is private within a parallel region
5779 that binds to the current construct's context or in parallel
5780 region's REDUCTION clause. */
5783 omp_check_private (struct gimplify_omp_ctx *ctx, tree decl)
5789 ctx = ctx->outer_context;
5791 return !(is_global_var (decl)
5792 /* References might be private, but might be shared too. */
5793 || lang_hooks.decls.omp_privatize_by_reference (decl));
5795 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5797 return (n->value & GOVD_SHARED) == 0;
5799 while (ctx->region_type == ORT_WORKSHARE);
5803 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
5804 and previous omp contexts. */
5807 gimplify_scan_omp_clauses (tree *list_p, gimple_seq *pre_p,
5808 enum omp_region_type region_type)
5810 struct gimplify_omp_ctx *ctx, *outer_ctx;
5811 struct gimplify_ctx gctx;
5814 ctx = new_omp_context (region_type);
5815 outer_ctx = ctx->outer_context;
5817 while ((c = *list_p) != NULL)
5819 bool remove = false;
5820 bool notice_outer = true;
5821 const char *check_non_private = NULL;
5825 switch (OMP_CLAUSE_CODE (c))
5827 case OMP_CLAUSE_PRIVATE:
5828 flags = GOVD_PRIVATE | GOVD_EXPLICIT;
5829 if (lang_hooks.decls.omp_private_outer_ref (OMP_CLAUSE_DECL (c)))
5831 flags |= GOVD_PRIVATE_OUTER_REF;
5832 OMP_CLAUSE_PRIVATE_OUTER_REF (c) = 1;
5835 notice_outer = false;
5837 case OMP_CLAUSE_SHARED:
5838 flags = GOVD_SHARED | GOVD_EXPLICIT;
5840 case OMP_CLAUSE_FIRSTPRIVATE:
5841 flags = GOVD_FIRSTPRIVATE | GOVD_EXPLICIT;
5842 check_non_private = "firstprivate";
5844 case OMP_CLAUSE_LASTPRIVATE:
5845 flags = GOVD_LASTPRIVATE | GOVD_SEEN | GOVD_EXPLICIT;
5846 check_non_private = "lastprivate";
5848 case OMP_CLAUSE_REDUCTION:
5849 flags = GOVD_REDUCTION | GOVD_SEEN | GOVD_EXPLICIT;
5850 check_non_private = "reduction";
5854 decl = OMP_CLAUSE_DECL (c);
5855 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5860 omp_add_variable (ctx, decl, flags);
5861 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION
5862 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c))
5864 omp_add_variable (ctx, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c),
5865 GOVD_LOCAL | GOVD_SEEN);
5866 gimplify_omp_ctxp = ctx;
5867 push_gimplify_context (&gctx);
5869 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c) = gimple_seq_alloc ();
5870 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c) = gimple_seq_alloc ();
5872 gimplify_and_add (OMP_CLAUSE_REDUCTION_INIT (c),
5873 &OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c));
5874 pop_gimplify_context
5875 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c)));
5876 push_gimplify_context (&gctx);
5877 gimplify_and_add (OMP_CLAUSE_REDUCTION_MERGE (c),
5878 &OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c));
5879 pop_gimplify_context
5880 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c)));
5881 OMP_CLAUSE_REDUCTION_INIT (c) = NULL_TREE;
5882 OMP_CLAUSE_REDUCTION_MERGE (c) = NULL_TREE;
5884 gimplify_omp_ctxp = outer_ctx;
5886 else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
5887 && OMP_CLAUSE_LASTPRIVATE_STMT (c))
5889 gimplify_omp_ctxp = ctx;
5890 push_gimplify_context (&gctx);
5891 if (TREE_CODE (OMP_CLAUSE_LASTPRIVATE_STMT (c)) != BIND_EXPR)
5893 tree bind = build3 (BIND_EXPR, void_type_node, NULL,
5895 TREE_SIDE_EFFECTS (bind) = 1;
5896 BIND_EXPR_BODY (bind) = OMP_CLAUSE_LASTPRIVATE_STMT (c);
5897 OMP_CLAUSE_LASTPRIVATE_STMT (c) = bind;
5899 gimplify_and_add (OMP_CLAUSE_LASTPRIVATE_STMT (c),
5900 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c));
5901 pop_gimplify_context
5902 (gimple_seq_first_stmt (OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c)));
5903 OMP_CLAUSE_LASTPRIVATE_STMT (c) = NULL_TREE;
5905 gimplify_omp_ctxp = outer_ctx;
5911 case OMP_CLAUSE_COPYIN:
5912 case OMP_CLAUSE_COPYPRIVATE:
5913 decl = OMP_CLAUSE_DECL (c);
5914 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5921 omp_notice_variable (outer_ctx, decl, true);
5922 if (check_non_private
5923 && region_type == ORT_WORKSHARE
5924 && omp_check_private (ctx, decl))
5926 error ("%s variable %qE is private in outer context",
5927 check_non_private, DECL_NAME (decl));
5933 OMP_CLAUSE_OPERAND (c, 0)
5934 = gimple_boolify (OMP_CLAUSE_OPERAND (c, 0));
5937 case OMP_CLAUSE_SCHEDULE:
5938 case OMP_CLAUSE_NUM_THREADS:
5939 if (gimplify_expr (&OMP_CLAUSE_OPERAND (c, 0), pre_p, NULL,
5940 is_gimple_val, fb_rvalue) == GS_ERROR)
5944 case OMP_CLAUSE_NOWAIT:
5945 case OMP_CLAUSE_ORDERED:
5946 case OMP_CLAUSE_UNTIED:
5947 case OMP_CLAUSE_COLLAPSE:
5950 case OMP_CLAUSE_DEFAULT:
5951 ctx->default_kind = OMP_CLAUSE_DEFAULT_KIND (c);
5959 *list_p = OMP_CLAUSE_CHAIN (c);
5961 list_p = &OMP_CLAUSE_CHAIN (c);
5964 gimplify_omp_ctxp = ctx;
5967 /* For all variables that were not actually used within the context,
5968 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
5971 gimplify_adjust_omp_clauses_1 (splay_tree_node n, void *data)
5973 tree *list_p = (tree *) data;
5974 tree decl = (tree) n->key;
5975 unsigned flags = n->value;
5976 enum omp_clause_code code;
5980 if (flags & (GOVD_EXPLICIT | GOVD_LOCAL))
5982 if ((flags & GOVD_SEEN) == 0)
5984 if (flags & GOVD_DEBUG_PRIVATE)
5986 gcc_assert ((flags & GOVD_DATA_SHARE_CLASS) == GOVD_PRIVATE);
5987 private_debug = true;
5991 = lang_hooks.decls.omp_private_debug_clause (decl,
5992 !!(flags & GOVD_SHARED));
5994 code = OMP_CLAUSE_PRIVATE;
5995 else if (flags & GOVD_SHARED)
5997 if (is_global_var (decl))
5999 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp->outer_context;
6003 = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
6004 if (on && (on->value & (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE
6005 | GOVD_PRIVATE | GOVD_REDUCTION)) != 0)
6007 ctx = ctx->outer_context;
6012 code = OMP_CLAUSE_SHARED;
6014 else if (flags & GOVD_PRIVATE)
6015 code = OMP_CLAUSE_PRIVATE;
6016 else if (flags & GOVD_FIRSTPRIVATE)
6017 code = OMP_CLAUSE_FIRSTPRIVATE;
6021 clause = build_omp_clause (input_location, code);
6022 OMP_CLAUSE_DECL (clause) = decl;
6023 OMP_CLAUSE_CHAIN (clause) = *list_p;
6025 OMP_CLAUSE_PRIVATE_DEBUG (clause) = 1;
6026 else if (code == OMP_CLAUSE_PRIVATE && (flags & GOVD_PRIVATE_OUTER_REF))
6027 OMP_CLAUSE_PRIVATE_OUTER_REF (clause) = 1;
6029 lang_hooks.decls.omp_finish_clause (clause);
6035 gimplify_adjust_omp_clauses (tree *list_p)
6037 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
6040 while ((c = *list_p) != NULL)
6043 bool remove = false;
6045 switch (OMP_CLAUSE_CODE (c))
6047 case OMP_CLAUSE_PRIVATE:
6048 case OMP_CLAUSE_SHARED:
6049 case OMP_CLAUSE_FIRSTPRIVATE:
6050 decl = OMP_CLAUSE_DECL (c);
6051 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
6052 remove = !(n->value & GOVD_SEEN);
6055 bool shared = OMP_CLAUSE_CODE (c) == OMP_CLAUSE_SHARED;
6056 if ((n->value & GOVD_DEBUG_PRIVATE)
6057 || lang_hooks.decls.omp_private_debug_clause (decl, shared))
6059 gcc_assert ((n->value & GOVD_DEBUG_PRIVATE) == 0
6060 || ((n->value & GOVD_DATA_SHARE_CLASS)
6062 OMP_CLAUSE_SET_CODE (c, OMP_CLAUSE_PRIVATE);
6063 OMP_CLAUSE_PRIVATE_DEBUG (c) = 1;
6068 case OMP_CLAUSE_LASTPRIVATE:
6069 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
6070 accurately reflect the presence of a FIRSTPRIVATE clause. */
6071 decl = OMP_CLAUSE_DECL (c);
6072 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
6073 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)
6074 = (n->value & GOVD_FIRSTPRIVATE) != 0;
6077 case OMP_CLAUSE_REDUCTION:
6078 case OMP_CLAUSE_COPYIN:
6079 case OMP_CLAUSE_COPYPRIVATE:
6081 case OMP_CLAUSE_NUM_THREADS:
6082 case OMP_CLAUSE_SCHEDULE:
6083 case OMP_CLAUSE_NOWAIT:
6084 case OMP_CLAUSE_ORDERED:
6085 case OMP_CLAUSE_DEFAULT:
6086 case OMP_CLAUSE_UNTIED:
6087 case OMP_CLAUSE_COLLAPSE:
6095 *list_p = OMP_CLAUSE_CHAIN (c);
6097 list_p = &OMP_CLAUSE_CHAIN (c);
6100 /* Add in any implicit data sharing. */
6101 splay_tree_foreach (ctx->variables, gimplify_adjust_omp_clauses_1, list_p);
6103 gimplify_omp_ctxp = ctx->outer_context;
6104 delete_omp_context (ctx);
6107 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
6108 gimplification of the body, as well as scanning the body for used
6109 variables. We need to do this scan now, because variable-sized
6110 decls will be decomposed during gimplification. */
6113 gimplify_omp_parallel (tree *expr_p, gimple_seq *pre_p)
6115 tree expr = *expr_p;
6117 gimple_seq body = NULL;
6118 struct gimplify_ctx gctx;
6120 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr), pre_p,
6121 OMP_PARALLEL_COMBINED (expr)
6122 ? ORT_COMBINED_PARALLEL
6125 push_gimplify_context (&gctx);
6127 g = gimplify_and_return_first (OMP_PARALLEL_BODY (expr), &body);
6128 if (gimple_code (g) == GIMPLE_BIND)
6129 pop_gimplify_context (g);
6131 pop_gimplify_context (NULL);
6133 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr));
6135 g = gimple_build_omp_parallel (body,
6136 OMP_PARALLEL_CLAUSES (expr),
6137 NULL_TREE, NULL_TREE);
6138 if (OMP_PARALLEL_COMBINED (expr))
6139 gimple_omp_set_subcode (g, GF_OMP_PARALLEL_COMBINED);
6140 gimplify_seq_add_stmt (pre_p, g);
6141 *expr_p = NULL_TREE;
6144 /* Gimplify the contents of an OMP_TASK statement. This involves
6145 gimplification of the body, as well as scanning the body for used
6146 variables. We need to do this scan now, because variable-sized
6147 decls will be decomposed during gimplification. */
6150 gimplify_omp_task (tree *expr_p, gimple_seq *pre_p)
6152 tree expr = *expr_p;
6154 gimple_seq body = NULL;
6155 struct gimplify_ctx gctx;
6157 gimplify_scan_omp_clauses (&OMP_TASK_CLAUSES (expr), pre_p,
6158 find_omp_clause (OMP_TASK_CLAUSES (expr),
6160 ? ORT_UNTIED_TASK : ORT_TASK);
6162 push_gimplify_context (&gctx);
6164 g = gimplify_and_return_first (OMP_TASK_BODY (expr), &body);
6165 if (gimple_code (g) == GIMPLE_BIND)
6166 pop_gimplify_context (g);
6168 pop_gimplify_context (NULL);
6170 gimplify_adjust_omp_clauses (&OMP_TASK_CLAUSES (expr));
6172 g = gimple_build_omp_task (body,
6173 OMP_TASK_CLAUSES (expr),
6174 NULL_TREE, NULL_TREE,
6175 NULL_TREE, NULL_TREE, NULL_TREE);
6176 gimplify_seq_add_stmt (pre_p, g);
6177 *expr_p = NULL_TREE;
6180 /* Gimplify the gross structure of an OMP_FOR statement. */
6182 static enum gimplify_status
6183 gimplify_omp_for (tree *expr_p, gimple_seq *pre_p)
6185 tree for_stmt, decl, var, t;
6186 enum gimplify_status ret = GS_ALL_DONE;
6187 enum gimplify_status tret;
6189 gimple_seq for_body, for_pre_body;
6194 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt), pre_p,
6197 /* Handle OMP_FOR_INIT. */
6198 for_pre_body = NULL;
6199 gimplify_and_add (OMP_FOR_PRE_BODY (for_stmt), &for_pre_body);
6200 OMP_FOR_PRE_BODY (for_stmt) = NULL_TREE;
6202 for_body = gimple_seq_alloc ();
6203 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt))
6204 == TREE_VEC_LENGTH (OMP_FOR_COND (for_stmt)));
6205 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt))
6206 == TREE_VEC_LENGTH (OMP_FOR_INCR (for_stmt)));
6207 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)); i++)
6209 t = TREE_VEC_ELT (OMP_FOR_INIT (for_stmt), i);
6210 gcc_assert (TREE_CODE (t) == MODIFY_EXPR);
6211 decl = TREE_OPERAND (t, 0);
6212 gcc_assert (DECL_P (decl));
6213 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl))
6214 || POINTER_TYPE_P (TREE_TYPE (decl)));
6216 /* Make sure the iteration variable is private. */
6217 if (omp_is_private (gimplify_omp_ctxp, decl))
6218 omp_notice_variable (gimplify_omp_ctxp, decl, true);
6220 omp_add_variable (gimplify_omp_ctxp, decl, GOVD_PRIVATE | GOVD_SEEN);
6222 /* If DECL is not a gimple register, create a temporary variable to act
6223 as an iteration counter. This is valid, since DECL cannot be
6224 modified in the body of the loop. */
6225 if (!is_gimple_reg (decl))
6227 var = create_tmp_var (TREE_TYPE (decl), get_name (decl));
6228 TREE_OPERAND (t, 0) = var;
6230 gimplify_seq_add_stmt (&for_body, gimple_build_assign (decl, var));
6232 omp_add_variable (gimplify_omp_ctxp, var, GOVD_PRIVATE | GOVD_SEEN);
6237 tret = gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
6238 is_gimple_val, fb_rvalue);
6239 ret = MIN (ret, tret);
6240 if (ret == GS_ERROR)
6243 /* Handle OMP_FOR_COND. */
6244 t = TREE_VEC_ELT (OMP_FOR_COND (for_stmt), i);
6245 gcc_assert (COMPARISON_CLASS_P (t));
6246 gcc_assert (TREE_OPERAND (t, 0) == decl);
6248 tret = gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
6249 is_gimple_val, fb_rvalue);
6250 ret = MIN (ret, tret);
6252 /* Handle OMP_FOR_INCR. */
6253 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6254 switch (TREE_CODE (t))
6256 case PREINCREMENT_EXPR:
6257 case POSTINCREMENT_EXPR:
6258 t = build_int_cst (TREE_TYPE (decl), 1);
6259 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
6260 t = build2 (MODIFY_EXPR, TREE_TYPE (var), var, t);
6261 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i) = t;
6264 case PREDECREMENT_EXPR:
6265 case POSTDECREMENT_EXPR:
6266 t = build_int_cst (TREE_TYPE (decl), -1);
6267 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
6268 t = build2 (MODIFY_EXPR, TREE_TYPE (var), var, t);
6269 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i) = t;
6273 gcc_assert (TREE_OPERAND (t, 0) == decl);
6274 TREE_OPERAND (t, 0) = var;
6276 t = TREE_OPERAND (t, 1);
6277 switch (TREE_CODE (t))
6280 if (TREE_OPERAND (t, 1) == decl)
6282 TREE_OPERAND (t, 1) = TREE_OPERAND (t, 0);
6283 TREE_OPERAND (t, 0) = var;
6289 case POINTER_PLUS_EXPR:
6290 gcc_assert (TREE_OPERAND (t, 0) == decl);
6291 TREE_OPERAND (t, 0) = var;
6297 tret = gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
6298 is_gimple_val, fb_rvalue);
6299 ret = MIN (ret, tret);
6306 if (var != decl || TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)) > 1)
6309 for (c = OMP_FOR_CLAUSES (for_stmt); c ; c = OMP_CLAUSE_CHAIN (c))
6310 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
6311 && OMP_CLAUSE_DECL (c) == decl
6312 && OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c) == NULL)
6314 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6315 gcc_assert (TREE_CODE (t) == MODIFY_EXPR);
6316 gcc_assert (TREE_OPERAND (t, 0) == var);
6317 t = TREE_OPERAND (t, 1);
6318 gcc_assert (TREE_CODE (t) == PLUS_EXPR
6319 || TREE_CODE (t) == MINUS_EXPR
6320 || TREE_CODE (t) == POINTER_PLUS_EXPR);
6321 gcc_assert (TREE_OPERAND (t, 0) == var);
6322 t = build2 (TREE_CODE (t), TREE_TYPE (decl), decl,
6323 TREE_OPERAND (t, 1));
6324 gimplify_assign (decl, t,
6325 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c));
6330 gimplify_and_add (OMP_FOR_BODY (for_stmt), &for_body);
6332 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt));
6334 gfor = gimple_build_omp_for (for_body, OMP_FOR_CLAUSES (for_stmt),
6335 TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)),
6338 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)); i++)
6340 t = TREE_VEC_ELT (OMP_FOR_INIT (for_stmt), i);
6341 gimple_omp_for_set_index (gfor, i, TREE_OPERAND (t, 0));
6342 gimple_omp_for_set_initial (gfor, i, TREE_OPERAND (t, 1));
6343 t = TREE_VEC_ELT (OMP_FOR_COND (for_stmt), i);
6344 gimple_omp_for_set_cond (gfor, i, TREE_CODE (t));
6345 gimple_omp_for_set_final (gfor, i, TREE_OPERAND (t, 1));
6346 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6347 gimple_omp_for_set_incr (gfor, i, TREE_OPERAND (t, 1));
6350 gimplify_seq_add_stmt (pre_p, gfor);
6351 return ret == GS_ALL_DONE ? GS_ALL_DONE : GS_ERROR;
6354 /* Gimplify the gross structure of other OpenMP worksharing constructs.
6355 In particular, OMP_SECTIONS and OMP_SINGLE. */
6358 gimplify_omp_workshare (tree *expr_p, gimple_seq *pre_p)
6360 tree expr = *expr_p;
6362 gimple_seq body = NULL;
6364 gimplify_scan_omp_clauses (&OMP_CLAUSES (expr), pre_p, ORT_WORKSHARE);
6365 gimplify_and_add (OMP_BODY (expr), &body);
6366 gimplify_adjust_omp_clauses (&OMP_CLAUSES (expr));
6368 if (TREE_CODE (expr) == OMP_SECTIONS)
6369 stmt = gimple_build_omp_sections (body, OMP_CLAUSES (expr));
6370 else if (TREE_CODE (expr) == OMP_SINGLE)
6371 stmt = gimple_build_omp_single (body, OMP_CLAUSES (expr));
6375 gimplify_seq_add_stmt (pre_p, stmt);
6378 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
6379 stabilized the lhs of the atomic operation as *ADDR. Return true if
6380 EXPR is this stabilized form. */
6383 goa_lhs_expr_p (tree expr, tree addr)
6385 /* Also include casts to other type variants. The C front end is fond
6386 of adding these for e.g. volatile variables. This is like
6387 STRIP_TYPE_NOPS but includes the main variant lookup. */
6388 STRIP_USELESS_TYPE_CONVERSION (expr);
6390 if (TREE_CODE (expr) == INDIRECT_REF)
6392 expr = TREE_OPERAND (expr, 0);
6394 && (CONVERT_EXPR_P (expr)
6395 || TREE_CODE (expr) == NON_LVALUE_EXPR)
6396 && TREE_CODE (expr) == TREE_CODE (addr)
6397 && types_compatible_p (TREE_TYPE (expr), TREE_TYPE (addr)))
6399 expr = TREE_OPERAND (expr, 0);
6400 addr = TREE_OPERAND (addr, 0);
6404 return (TREE_CODE (addr) == ADDR_EXPR
6405 && TREE_CODE (expr) == ADDR_EXPR
6406 && TREE_OPERAND (addr, 0) == TREE_OPERAND (expr, 0));
6408 if (TREE_CODE (addr) == ADDR_EXPR && expr == TREE_OPERAND (addr, 0))
6413 /* Walk *EXPR_P and replace
6414 appearances of *LHS_ADDR with LHS_VAR. If an expression does not involve
6415 the lhs, evaluate it into a temporary. Return 1 if the lhs appeared as
6416 a subexpression, 0 if it did not, or -1 if an error was encountered. */
6419 goa_stabilize_expr (tree *expr_p, gimple_seq *pre_p, tree lhs_addr,
6422 tree expr = *expr_p;
6425 if (goa_lhs_expr_p (expr, lhs_addr))
6430 if (is_gimple_val (expr))
6434 switch (TREE_CODE_CLASS (TREE_CODE (expr)))
6437 case tcc_comparison:
6438 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p, lhs_addr,
6441 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p, lhs_addr,
6444 case tcc_expression:
6445 switch (TREE_CODE (expr))
6447 case TRUTH_ANDIF_EXPR:
6448 case TRUTH_ORIF_EXPR:
6449 case TRUTH_AND_EXPR:
6451 case TRUTH_XOR_EXPR:
6452 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p,
6454 case TRUTH_NOT_EXPR:
6455 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p,
6468 enum gimplify_status gs;
6469 gs = gimplify_expr (expr_p, pre_p, NULL, is_gimple_val, fb_rvalue);
6470 if (gs != GS_ALL_DONE)
6478 /* Gimplify an OMP_ATOMIC statement. */
6480 static enum gimplify_status
6481 gimplify_omp_atomic (tree *expr_p, gimple_seq *pre_p)
6483 tree addr = TREE_OPERAND (*expr_p, 0);
6484 tree rhs = TREE_OPERAND (*expr_p, 1);
6485 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr)));
6488 tmp_load = create_tmp_reg (type, NULL);
6489 if (goa_stabilize_expr (&rhs, pre_p, addr, tmp_load) < 0)
6492 if (gimplify_expr (&addr, pre_p, NULL, is_gimple_val, fb_rvalue)
6496 gimplify_seq_add_stmt (pre_p, gimple_build_omp_atomic_load (tmp_load, addr));
6497 if (gimplify_expr (&rhs, pre_p, NULL, is_gimple_val, fb_rvalue)
6500 gimplify_seq_add_stmt (pre_p, gimple_build_omp_atomic_store (rhs));
6507 /* Converts the GENERIC expression tree *EXPR_P to GIMPLE. If the
6508 expression produces a value to be used as an operand inside a GIMPLE
6509 statement, the value will be stored back in *EXPR_P. This value will
6510 be a tree of class tcc_declaration, tcc_constant, tcc_reference or
6511 an SSA_NAME. The corresponding sequence of GIMPLE statements is
6512 emitted in PRE_P and POST_P.
6514 Additionally, this process may overwrite parts of the input
6515 expression during gimplification. Ideally, it should be
6516 possible to do non-destructive gimplification.
6518 EXPR_P points to the GENERIC expression to convert to GIMPLE. If
6519 the expression needs to evaluate to a value to be used as
6520 an operand in a GIMPLE statement, this value will be stored in
6521 *EXPR_P on exit. This happens when the caller specifies one
6522 of fb_lvalue or fb_rvalue fallback flags.
6524 PRE_P will contain the sequence of GIMPLE statements corresponding
6525 to the evaluation of EXPR and all the side-effects that must
6526 be executed before the main expression. On exit, the last
6527 statement of PRE_P is the core statement being gimplified. For
6528 instance, when gimplifying 'if (++a)' the last statement in
6529 PRE_P will be 'if (t.1)' where t.1 is the result of
6530 pre-incrementing 'a'.
6532 POST_P will contain the sequence of GIMPLE statements corresponding
6533 to the evaluation of all the side-effects that must be executed
6534 after the main expression. If this is NULL, the post
6535 side-effects are stored at the end of PRE_P.
6537 The reason why the output is split in two is to handle post
6538 side-effects explicitly. In some cases, an expression may have
6539 inner and outer post side-effects which need to be emitted in
6540 an order different from the one given by the recursive
6541 traversal. For instance, for the expression (*p--)++ the post
6542 side-effects of '--' must actually occur *after* the post
6543 side-effects of '++'. However, gimplification will first visit
6544 the inner expression, so if a separate POST sequence was not
6545 used, the resulting sequence would be:
6552 However, the post-decrement operation in line #2 must not be
6553 evaluated until after the store to *p at line #4, so the
6554 correct sequence should be:
6561 So, by specifying a separate post queue, it is possible
6562 to emit the post side-effects in the correct order.
6563 If POST_P is NULL, an internal queue will be used. Before
6564 returning to the caller, the sequence POST_P is appended to
6565 the main output sequence PRE_P.
6567 GIMPLE_TEST_F points to a function that takes a tree T and
6568 returns nonzero if T is in the GIMPLE form requested by the
6569 caller. The GIMPLE predicates are in gimple.c.
6571 FALLBACK tells the function what sort of a temporary we want if
6572 gimplification cannot produce an expression that complies with
6575 fb_none means that no temporary should be generated
6576 fb_rvalue means that an rvalue is OK to generate
6577 fb_lvalue means that an lvalue is OK to generate
6578 fb_either means that either is OK, but an lvalue is preferable.
6579 fb_mayfail means that gimplification may fail (in which case
6580 GS_ERROR will be returned)
6582 The return value is either GS_ERROR or GS_ALL_DONE, since this
6583 function iterates until EXPR is completely gimplified or an error
6586 enum gimplify_status
6587 gimplify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
6588 bool (*gimple_test_f) (tree), fallback_t fallback)
6591 gimple_seq internal_pre = NULL;
6592 gimple_seq internal_post = NULL;
6595 location_t saved_location;
6596 enum gimplify_status ret;
6597 gimple_stmt_iterator pre_last_gsi, post_last_gsi;
6599 save_expr = *expr_p;
6600 if (save_expr == NULL_TREE)
6603 /* If we are gimplifying a top-level statement, PRE_P must be valid. */
6604 is_statement = gimple_test_f == is_gimple_stmt;
6608 /* Consistency checks. */
6609 if (gimple_test_f == is_gimple_reg)
6610 gcc_assert (fallback & (fb_rvalue | fb_lvalue));
6611 else if (gimple_test_f == is_gimple_val
6612 || gimple_test_f == is_gimple_call_addr
6613 || gimple_test_f == is_gimple_condexpr
6614 || gimple_test_f == is_gimple_mem_rhs
6615 || gimple_test_f == is_gimple_mem_rhs_or_call
6616 || gimple_test_f == is_gimple_reg_rhs
6617 || gimple_test_f == is_gimple_reg_rhs_or_call
6618 || gimple_test_f == is_gimple_asm_val
6619 || gimple_test_f == is_gimple_mem_ref_addr)
6620 gcc_assert (fallback & fb_rvalue);
6621 else if (gimple_test_f == is_gimple_min_lval
6622 || gimple_test_f == is_gimple_lvalue)
6623 gcc_assert (fallback & fb_lvalue);
6624 else if (gimple_test_f == is_gimple_addressable)
6625 gcc_assert (fallback & fb_either);
6626 else if (gimple_test_f == is_gimple_stmt)
6627 gcc_assert (fallback == fb_none);
6630 /* We should have recognized the GIMPLE_TEST_F predicate to
6631 know what kind of fallback to use in case a temporary is
6632 needed to hold the value or address of *EXPR_P. */
6636 /* We used to check the predicate here and return immediately if it
6637 succeeds. This is wrong; the design is for gimplification to be
6638 idempotent, and for the predicates to only test for valid forms, not
6639 whether they are fully simplified. */
6641 pre_p = &internal_pre;
6644 post_p = &internal_post;
6646 /* Remember the last statements added to PRE_P and POST_P. Every
6647 new statement added by the gimplification helpers needs to be
6648 annotated with location information. To centralize the
6649 responsibility, we remember the last statement that had been
6650 added to both queues before gimplifying *EXPR_P. If
6651 gimplification produces new statements in PRE_P and POST_P, those
6652 statements will be annotated with the same location information
6654 pre_last_gsi = gsi_last (*pre_p);
6655 post_last_gsi = gsi_last (*post_p);
6657 saved_location = input_location;
6658 if (save_expr != error_mark_node
6659 && EXPR_HAS_LOCATION (*expr_p))
6660 input_location = EXPR_LOCATION (*expr_p);
6662 /* Loop over the specific gimplifiers until the toplevel node
6663 remains the same. */
6666 /* Strip away as many useless type conversions as possible
6668 STRIP_USELESS_TYPE_CONVERSION (*expr_p);
6670 /* Remember the expr. */
6671 save_expr = *expr_p;
6673 /* Die, die, die, my darling. */
6674 if (save_expr == error_mark_node
6675 || (TREE_TYPE (save_expr)
6676 && TREE_TYPE (save_expr) == error_mark_node))
6682 /* Do any language-specific gimplification. */
6683 ret = ((enum gimplify_status)
6684 lang_hooks.gimplify_expr (expr_p, pre_p, post_p));
6687 if (*expr_p == NULL_TREE)
6689 if (*expr_p != save_expr)
6692 else if (ret != GS_UNHANDLED)
6695 /* Make sure that all the cases set 'ret' appropriately. */
6697 switch (TREE_CODE (*expr_p))
6699 /* First deal with the special cases. */
6701 case POSTINCREMENT_EXPR:
6702 case POSTDECREMENT_EXPR:
6703 case PREINCREMENT_EXPR:
6704 case PREDECREMENT_EXPR:
6705 ret = gimplify_self_mod_expr (expr_p, pre_p, post_p,
6706 fallback != fb_none);
6710 case ARRAY_RANGE_REF:
6714 case VIEW_CONVERT_EXPR:
6715 ret = gimplify_compound_lval (expr_p, pre_p, post_p,
6716 fallback ? fallback : fb_rvalue);
6720 ret = gimplify_cond_expr (expr_p, pre_p, fallback);
6722 /* C99 code may assign to an array in a structure value of a
6723 conditional expression, and this has undefined behavior
6724 only on execution, so create a temporary if an lvalue is
6726 if (fallback == fb_lvalue)
6728 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6729 mark_addressable (*expr_p);
6735 ret = gimplify_call_expr (expr_p, pre_p, fallback != fb_none);
6737 /* C99 code may assign to an array in a structure returned
6738 from a function, and this has undefined behavior only on
6739 execution, so create a temporary if an lvalue is
6741 if (fallback == fb_lvalue)
6743 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6744 mark_addressable (*expr_p);
6753 ret = gimplify_compound_expr (expr_p, pre_p, fallback != fb_none);
6756 case COMPOUND_LITERAL_EXPR:
6757 ret = gimplify_compound_literal_expr (expr_p, pre_p);
6762 ret = gimplify_modify_expr (expr_p, pre_p, post_p,
6763 fallback != fb_none);
6766 case TRUTH_ANDIF_EXPR:
6767 case TRUTH_ORIF_EXPR:
6768 /* Pass the source location of the outer expression. */
6769 ret = gimplify_boolean_expr (expr_p, saved_location);
6772 case TRUTH_NOT_EXPR:
6773 if (TREE_CODE (TREE_TYPE (*expr_p)) != BOOLEAN_TYPE)
6775 tree type = TREE_TYPE (*expr_p);
6776 *expr_p = fold_convert (type, gimple_boolify (*expr_p));
6781 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6782 is_gimple_val, fb_rvalue);
6783 recalculate_side_effects (*expr_p);
6787 ret = gimplify_addr_expr (expr_p, pre_p, post_p);
6791 ret = gimplify_va_arg_expr (expr_p, pre_p, post_p);
6795 if (IS_EMPTY_STMT (*expr_p))
6801 if (VOID_TYPE_P (TREE_TYPE (*expr_p))
6802 || fallback == fb_none)
6804 /* Just strip a conversion to void (or in void context) and
6806 *expr_p = TREE_OPERAND (*expr_p, 0);
6811 ret = gimplify_conversion (expr_p);
6812 if (ret == GS_ERROR)
6814 if (*expr_p != save_expr)
6818 case FIX_TRUNC_EXPR:
6819 /* unary_expr: ... | '(' cast ')' val | ... */
6820 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6821 is_gimple_val, fb_rvalue);
6822 recalculate_side_effects (*expr_p);
6827 bool volatilep = TREE_THIS_VOLATILE (*expr_p);
6828 bool notrap = TREE_THIS_NOTRAP (*expr_p);
6829 tree saved_ptr_type = TREE_TYPE (TREE_OPERAND (*expr_p, 0));
6831 *expr_p = fold_indirect_ref_loc (input_location, *expr_p);
6832 if (*expr_p != save_expr)
6838 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6839 is_gimple_reg, fb_rvalue);
6840 if (ret == GS_ERROR)
6843 recalculate_side_effects (*expr_p);
6844 *expr_p = fold_build2_loc (input_location, MEM_REF,
6845 TREE_TYPE (*expr_p),
6846 TREE_OPERAND (*expr_p, 0),
6847 build_int_cst (saved_ptr_type, 0));
6848 TREE_THIS_VOLATILE (*expr_p) = volatilep;
6849 TREE_THIS_NOTRAP (*expr_p) = notrap;
6854 /* We arrive here through the various re-gimplifcation paths. */
6856 /* First try re-folding the whole thing. */
6857 tmp = fold_binary (MEM_REF, TREE_TYPE (*expr_p),
6858 TREE_OPERAND (*expr_p, 0),
6859 TREE_OPERAND (*expr_p, 1));
6863 recalculate_side_effects (*expr_p);
6867 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6868 is_gimple_mem_ref_addr, fb_rvalue);
6869 if (ret == GS_ERROR)
6871 recalculate_side_effects (*expr_p);
6875 /* Constants need not be gimplified. */
6886 /* If we require an lvalue, such as for ADDR_EXPR, retain the
6887 CONST_DECL node. Otherwise the decl is replaceable by its
6889 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
6890 if (fallback & fb_lvalue)
6894 *expr_p = DECL_INITIAL (*expr_p);
6900 ret = gimplify_decl_expr (expr_p, pre_p);
6904 ret = gimplify_bind_expr (expr_p, pre_p);
6908 ret = gimplify_loop_expr (expr_p, pre_p);
6912 ret = gimplify_switch_expr (expr_p, pre_p);
6916 ret = gimplify_exit_expr (expr_p);
6920 /* If the target is not LABEL, then it is a computed jump
6921 and the target needs to be gimplified. */
6922 if (TREE_CODE (GOTO_DESTINATION (*expr_p)) != LABEL_DECL)
6924 ret = gimplify_expr (&GOTO_DESTINATION (*expr_p), pre_p,
6925 NULL, is_gimple_val, fb_rvalue);
6926 if (ret == GS_ERROR)
6929 gimplify_seq_add_stmt (pre_p,
6930 gimple_build_goto (GOTO_DESTINATION (*expr_p)));
6935 gimplify_seq_add_stmt (pre_p,
6936 gimple_build_predict (PREDICT_EXPR_PREDICTOR (*expr_p),
6937 PREDICT_EXPR_OUTCOME (*expr_p)));
6943 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p))
6944 == current_function_decl);
6945 gimplify_seq_add_stmt (pre_p,
6946 gimple_build_label (LABEL_EXPR_LABEL (*expr_p)));
6949 case CASE_LABEL_EXPR:
6950 ret = gimplify_case_label_expr (expr_p, pre_p);
6954 ret = gimplify_return_expr (*expr_p, pre_p);
6958 /* Don't reduce this in place; let gimplify_init_constructor work its
6959 magic. Buf if we're just elaborating this for side effects, just
6960 gimplify any element that has side-effects. */
6961 if (fallback == fb_none)
6963 unsigned HOST_WIDE_INT ix;
6965 tree temp = NULL_TREE;
6966 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (*expr_p), ix, val)
6967 if (TREE_SIDE_EFFECTS (val))
6968 append_to_statement_list (val, &temp);
6971 ret = temp ? GS_OK : GS_ALL_DONE;
6973 /* C99 code may assign to an array in a constructed
6974 structure or union, and this has undefined behavior only
6975 on execution, so create a temporary if an lvalue is
6977 else if (fallback == fb_lvalue)
6979 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6980 mark_addressable (*expr_p);
6987 /* The following are special cases that are not handled by the
6988 original GIMPLE grammar. */
6990 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
6993 ret = gimplify_save_expr (expr_p, pre_p, post_p);
6998 enum gimplify_status r0, r1, r2;
7000 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7001 post_p, is_gimple_lvalue, fb_either);
7002 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
7003 post_p, is_gimple_val, fb_rvalue);
7004 r2 = gimplify_expr (&TREE_OPERAND (*expr_p, 2), pre_p,
7005 post_p, is_gimple_val, fb_rvalue);
7006 recalculate_side_effects (*expr_p);
7008 ret = MIN (r0, MIN (r1, r2));
7012 case TARGET_MEM_REF:
7014 enum gimplify_status r0 = GS_ALL_DONE, r1 = GS_ALL_DONE;
7016 if (TMR_BASE (*expr_p))
7017 r0 = gimplify_expr (&TMR_BASE (*expr_p), pre_p,
7018 post_p, is_gimple_mem_ref_addr, fb_either);
7019 if (TMR_INDEX (*expr_p))
7020 r1 = gimplify_expr (&TMR_INDEX (*expr_p), pre_p,
7021 post_p, is_gimple_val, fb_rvalue);
7022 if (TMR_INDEX2 (*expr_p))
7023 r1 = gimplify_expr (&TMR_INDEX2 (*expr_p), pre_p,
7024 post_p, is_gimple_val, fb_rvalue);
7025 /* TMR_STEP and TMR_OFFSET are always integer constants. */
7030 case NON_LVALUE_EXPR:
7031 /* This should have been stripped above. */
7035 ret = gimplify_asm_expr (expr_p, pre_p, post_p);
7038 case TRY_FINALLY_EXPR:
7039 case TRY_CATCH_EXPR:
7041 gimple_seq eval, cleanup;
7044 eval = cleanup = NULL;
7045 gimplify_and_add (TREE_OPERAND (*expr_p, 0), &eval);
7046 gimplify_and_add (TREE_OPERAND (*expr_p, 1), &cleanup);
7047 /* Don't create bogus GIMPLE_TRY with empty cleanup. */
7048 if (gimple_seq_empty_p (cleanup))
7050 gimple_seq_add_seq (pre_p, eval);
7054 try_ = gimple_build_try (eval, cleanup,
7055 TREE_CODE (*expr_p) == TRY_FINALLY_EXPR
7056 ? GIMPLE_TRY_FINALLY
7057 : GIMPLE_TRY_CATCH);
7058 if (TREE_CODE (*expr_p) == TRY_CATCH_EXPR)
7059 gimple_try_set_catch_is_cleanup (try_,
7060 TRY_CATCH_IS_CLEANUP (*expr_p));
7061 gimplify_seq_add_stmt (pre_p, try_);
7066 case CLEANUP_POINT_EXPR:
7067 ret = gimplify_cleanup_point_expr (expr_p, pre_p);
7071 ret = gimplify_target_expr (expr_p, pre_p, post_p);
7077 gimple_seq handler = NULL;
7078 gimplify_and_add (CATCH_BODY (*expr_p), &handler);
7079 c = gimple_build_catch (CATCH_TYPES (*expr_p), handler);
7080 gimplify_seq_add_stmt (pre_p, c);
7085 case EH_FILTER_EXPR:
7088 gimple_seq failure = NULL;
7090 gimplify_and_add (EH_FILTER_FAILURE (*expr_p), &failure);
7091 ehf = gimple_build_eh_filter (EH_FILTER_TYPES (*expr_p), failure);
7092 gimple_set_no_warning (ehf, TREE_NO_WARNING (*expr_p));
7093 gimplify_seq_add_stmt (pre_p, ehf);
7100 enum gimplify_status r0, r1;
7101 r0 = gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p), pre_p,
7102 post_p, is_gimple_val, fb_rvalue);
7103 r1 = gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p), pre_p,
7104 post_p, is_gimple_val, fb_rvalue);
7105 TREE_SIDE_EFFECTS (*expr_p) = 0;
7111 /* We get here when taking the address of a label. We mark
7112 the label as "forced"; meaning it can never be removed and
7113 it is a potential target for any computed goto. */
7114 FORCED_LABEL (*expr_p) = 1;
7118 case STATEMENT_LIST:
7119 ret = gimplify_statement_list (expr_p, pre_p);
7122 case WITH_SIZE_EXPR:
7124 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7125 post_p == &internal_post ? NULL : post_p,
7126 gimple_test_f, fallback);
7127 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
7128 is_gimple_val, fb_rvalue);
7135 ret = gimplify_var_or_parm_decl (expr_p);
7139 /* When within an OpenMP context, notice uses of variables. */
7140 if (gimplify_omp_ctxp)
7141 omp_notice_variable (gimplify_omp_ctxp, *expr_p, true);
7146 /* Allow callbacks into the gimplifier during optimization. */
7151 gimplify_omp_parallel (expr_p, pre_p);
7156 gimplify_omp_task (expr_p, pre_p);
7161 ret = gimplify_omp_for (expr_p, pre_p);
7166 gimplify_omp_workshare (expr_p, pre_p);
7175 gimple_seq body = NULL;
7178 gimplify_and_add (OMP_BODY (*expr_p), &body);
7179 switch (TREE_CODE (*expr_p))
7182 g = gimple_build_omp_section (body);
7185 g = gimple_build_omp_master (body);
7188 g = gimple_build_omp_ordered (body);
7191 g = gimple_build_omp_critical (body,
7192 OMP_CRITICAL_NAME (*expr_p));
7197 gimplify_seq_add_stmt (pre_p, g);
7203 ret = gimplify_omp_atomic (expr_p, pre_p);
7206 case TRUTH_AND_EXPR:
7208 case TRUTH_XOR_EXPR:
7209 /* Classified as tcc_expression. */
7213 /* Classified as tcc_expression. */
7216 case POINTER_PLUS_EXPR:
7217 /* Convert ((type *)A)+offset into &A->field_of_type_and_offset.
7218 The second is gimple immediate saving a need for extra statement.
7220 if (TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
7221 && (tmp = maybe_fold_offset_to_address
7222 (EXPR_LOCATION (*expr_p),
7223 TREE_OPERAND (*expr_p, 0), TREE_OPERAND (*expr_p, 1),
7224 TREE_TYPE (*expr_p))))
7230 /* Convert (void *)&a + 4 into (void *)&a[1]. */
7231 if (TREE_CODE (TREE_OPERAND (*expr_p, 0)) == NOP_EXPR
7232 && TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
7233 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p,
7235 && (tmp = maybe_fold_offset_to_address
7236 (EXPR_LOCATION (*expr_p),
7237 TREE_OPERAND (TREE_OPERAND (*expr_p, 0), 0),
7238 TREE_OPERAND (*expr_p, 1),
7239 TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p, 0),
7242 *expr_p = fold_convert (TREE_TYPE (*expr_p), tmp);
7249 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p)))
7251 case tcc_comparison:
7252 /* Handle comparison of objects of non scalar mode aggregates
7253 with a call to memcmp. It would be nice to only have to do
7254 this for variable-sized objects, but then we'd have to allow
7255 the same nest of reference nodes we allow for MODIFY_EXPR and
7258 Compare scalar mode aggregates as scalar mode values. Using
7259 memcmp for them would be very inefficient at best, and is
7260 plain wrong if bitfields are involved. */
7262 tree type = TREE_TYPE (TREE_OPERAND (*expr_p, 1));
7264 if (!AGGREGATE_TYPE_P (type))
7266 else if (TYPE_MODE (type) != BLKmode)
7267 ret = gimplify_scalar_mode_aggregate_compare (expr_p);
7269 ret = gimplify_variable_sized_compare (expr_p);
7274 /* If *EXPR_P does not need to be special-cased, handle it
7275 according to its class. */
7277 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7278 post_p, is_gimple_val, fb_rvalue);
7284 enum gimplify_status r0, r1;
7286 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7287 post_p, is_gimple_val, fb_rvalue);
7288 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
7289 post_p, is_gimple_val, fb_rvalue);
7297 enum gimplify_status r0, r1, r2;
7299 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7300 post_p, is_gimple_val, fb_rvalue);
7301 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
7302 post_p, is_gimple_val, fb_rvalue);
7303 r2 = gimplify_expr (&TREE_OPERAND (*expr_p, 2), pre_p,
7304 post_p, is_gimple_val, fb_rvalue);
7306 ret = MIN (MIN (r0, r1), r2);
7310 case tcc_declaration:
7313 goto dont_recalculate;
7319 recalculate_side_effects (*expr_p);
7325 gcc_assert (*expr_p || ret != GS_OK);
7327 while (ret == GS_OK);
7329 /* If we encountered an error_mark somewhere nested inside, either
7330 stub out the statement or propagate the error back out. */
7331 if (ret == GS_ERROR)
7338 /* This was only valid as a return value from the langhook, which
7339 we handled. Make sure it doesn't escape from any other context. */
7340 gcc_assert (ret != GS_UNHANDLED);
7342 if (fallback == fb_none && *expr_p && !is_gimple_stmt (*expr_p))
7344 /* We aren't looking for a value, and we don't have a valid
7345 statement. If it doesn't have side-effects, throw it away. */
7346 if (!TREE_SIDE_EFFECTS (*expr_p))
7348 else if (!TREE_THIS_VOLATILE (*expr_p))
7350 /* This is probably a _REF that contains something nested that
7351 has side effects. Recurse through the operands to find it. */
7352 enum tree_code code = TREE_CODE (*expr_p);
7359 case VIEW_CONVERT_EXPR:
7360 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
7361 gimple_test_f, fallback);
7365 case ARRAY_RANGE_REF:
7366 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
7367 gimple_test_f, fallback);
7368 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
7369 gimple_test_f, fallback);
7373 /* Anything else with side-effects must be converted to
7374 a valid statement before we get here. */
7380 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p))
7381 && TYPE_MODE (TREE_TYPE (*expr_p)) != BLKmode)
7383 /* Historically, the compiler has treated a bare reference
7384 to a non-BLKmode volatile lvalue as forcing a load. */
7385 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p));
7387 /* Normally, we do not want to create a temporary for a
7388 TREE_ADDRESSABLE type because such a type should not be
7389 copied by bitwise-assignment. However, we make an
7390 exception here, as all we are doing here is ensuring that
7391 we read the bytes that make up the type. We use
7392 create_tmp_var_raw because create_tmp_var will abort when
7393 given a TREE_ADDRESSABLE type. */
7394 tree tmp = create_tmp_var_raw (type, "vol");
7395 gimple_add_tmp_var (tmp);
7396 gimplify_assign (tmp, *expr_p, pre_p);
7400 /* We can't do anything useful with a volatile reference to
7401 an incomplete type, so just throw it away. Likewise for
7402 a BLKmode type, since any implicit inner load should
7403 already have been turned into an explicit one by the
7404 gimplification process. */
7408 /* If we are gimplifying at the statement level, we're done. Tack
7409 everything together and return. */
7410 if (fallback == fb_none || is_statement)
7412 /* Since *EXPR_P has been converted into a GIMPLE tuple, clear
7413 it out for GC to reclaim it. */
7414 *expr_p = NULL_TREE;
7416 if (!gimple_seq_empty_p (internal_pre)
7417 || !gimple_seq_empty_p (internal_post))
7419 gimplify_seq_add_seq (&internal_pre, internal_post);
7420 gimplify_seq_add_seq (pre_p, internal_pre);
7423 /* The result of gimplifying *EXPR_P is going to be the last few
7424 statements in *PRE_P and *POST_P. Add location information
7425 to all the statements that were added by the gimplification
7427 if (!gimple_seq_empty_p (*pre_p))
7428 annotate_all_with_location_after (*pre_p, pre_last_gsi, input_location);
7430 if (!gimple_seq_empty_p (*post_p))
7431 annotate_all_with_location_after (*post_p, post_last_gsi,
7437 #ifdef ENABLE_GIMPLE_CHECKING
7440 enum tree_code code = TREE_CODE (*expr_p);
7441 /* These expressions should already be in gimple IR form. */
7442 gcc_assert (code != MODIFY_EXPR
7444 && code != BIND_EXPR
7445 && code != CATCH_EXPR
7446 && (code != COND_EXPR || gimplify_ctxp->allow_rhs_cond_expr)
7447 && code != EH_FILTER_EXPR
7448 && code != GOTO_EXPR
7449 && code != LABEL_EXPR
7450 && code != LOOP_EXPR
7451 && code != SWITCH_EXPR
7452 && code != TRY_FINALLY_EXPR
7453 && code != OMP_CRITICAL
7455 && code != OMP_MASTER
7456 && code != OMP_ORDERED
7457 && code != OMP_PARALLEL
7458 && code != OMP_SECTIONS
7459 && code != OMP_SECTION
7460 && code != OMP_SINGLE);
7464 /* Otherwise we're gimplifying a subexpression, so the resulting
7465 value is interesting. If it's a valid operand that matches
7466 GIMPLE_TEST_F, we're done. Unless we are handling some
7467 post-effects internally; if that's the case, we need to copy into
7468 a temporary before adding the post-effects to POST_P. */
7469 if (gimple_seq_empty_p (internal_post) && (*gimple_test_f) (*expr_p))
7472 /* Otherwise, we need to create a new temporary for the gimplified
7475 /* We can't return an lvalue if we have an internal postqueue. The
7476 object the lvalue refers to would (probably) be modified by the
7477 postqueue; we need to copy the value out first, which means an
7479 if ((fallback & fb_lvalue)
7480 && gimple_seq_empty_p (internal_post)
7481 && is_gimple_addressable (*expr_p))
7483 /* An lvalue will do. Take the address of the expression, store it
7484 in a temporary, and replace the expression with an INDIRECT_REF of
7486 tmp = build_fold_addr_expr_loc (input_location, *expr_p);
7487 gimplify_expr (&tmp, pre_p, post_p, is_gimple_reg, fb_rvalue);
7488 *expr_p = build_simple_mem_ref (tmp);
7490 else if ((fallback & fb_rvalue) && is_gimple_reg_rhs_or_call (*expr_p))
7492 /* An rvalue will do. Assign the gimplified expression into a
7493 new temporary TMP and replace the original expression with
7494 TMP. First, make sure that the expression has a type so that
7495 it can be assigned into a temporary. */
7496 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p)));
7498 if (!gimple_seq_empty_p (internal_post) || (fallback & fb_lvalue))
7499 /* The postqueue might change the value of the expression between
7500 the initialization and use of the temporary, so we can't use a
7501 formal temp. FIXME do we care? */
7503 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
7504 if (TREE_CODE (TREE_TYPE (*expr_p)) == COMPLEX_TYPE
7505 || TREE_CODE (TREE_TYPE (*expr_p)) == VECTOR_TYPE)
7506 DECL_GIMPLE_REG_P (*expr_p) = 1;
7509 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
7513 #ifdef ENABLE_GIMPLE_CHECKING
7514 if (!(fallback & fb_mayfail))
7516 fprintf (stderr, "gimplification failed:\n");
7517 print_generic_expr (stderr, *expr_p, 0);
7518 debug_tree (*expr_p);
7519 internal_error ("gimplification failed");
7522 gcc_assert (fallback & fb_mayfail);
7524 /* If this is an asm statement, and the user asked for the
7525 impossible, don't die. Fail and let gimplify_asm_expr
7531 /* Make sure the temporary matches our predicate. */
7532 gcc_assert ((*gimple_test_f) (*expr_p));
7534 if (!gimple_seq_empty_p (internal_post))
7536 annotate_all_with_location (internal_post, input_location);
7537 gimplify_seq_add_seq (pre_p, internal_post);
7541 input_location = saved_location;
7545 /* Look through TYPE for variable-sized objects and gimplify each such
7546 size that we find. Add to LIST_P any statements generated. */
7549 gimplify_type_sizes (tree type, gimple_seq *list_p)
7553 if (type == NULL || type == error_mark_node)
7556 /* We first do the main variant, then copy into any other variants. */
7557 type = TYPE_MAIN_VARIANT (type);
7559 /* Avoid infinite recursion. */
7560 if (TYPE_SIZES_GIMPLIFIED (type))
7563 TYPE_SIZES_GIMPLIFIED (type) = 1;
7565 switch (TREE_CODE (type))
7571 case FIXED_POINT_TYPE:
7572 gimplify_one_sizepos (&TYPE_MIN_VALUE (type), list_p);
7573 gimplify_one_sizepos (&TYPE_MAX_VALUE (type), list_p);
7575 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
7577 TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (type);
7578 TYPE_MAX_VALUE (t) = TYPE_MAX_VALUE (type);
7583 /* These types may not have declarations, so handle them here. */
7584 gimplify_type_sizes (TREE_TYPE (type), list_p);
7585 gimplify_type_sizes (TYPE_DOMAIN (type), list_p);
7586 /* Ensure VLA bounds aren't removed, for -O0 they should be variables
7587 with assigned stack slots, for -O1+ -g they should be tracked
7589 if (!(TYPE_NAME (type)
7590 && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
7591 && DECL_IGNORED_P (TYPE_NAME (type)))
7592 && TYPE_DOMAIN (type)
7593 && INTEGRAL_TYPE_P (TYPE_DOMAIN (type)))
7595 t = TYPE_MIN_VALUE (TYPE_DOMAIN (type));
7596 if (t && TREE_CODE (t) == VAR_DECL && DECL_ARTIFICIAL (t))
7597 DECL_IGNORED_P (t) = 0;
7598 t = TYPE_MAX_VALUE (TYPE_DOMAIN (type));
7599 if (t && TREE_CODE (t) == VAR_DECL && DECL_ARTIFICIAL (t))
7600 DECL_IGNORED_P (t) = 0;
7606 case QUAL_UNION_TYPE:
7607 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
7608 if (TREE_CODE (field) == FIELD_DECL)
7610 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field), list_p);
7611 gimplify_one_sizepos (&DECL_SIZE (field), list_p);
7612 gimplify_one_sizepos (&DECL_SIZE_UNIT (field), list_p);
7613 gimplify_type_sizes (TREE_TYPE (field), list_p);
7618 case REFERENCE_TYPE:
7619 /* We used to recurse on the pointed-to type here, which turned out to
7620 be incorrect because its definition might refer to variables not
7621 yet initialized at this point if a forward declaration is involved.
7623 It was actually useful for anonymous pointed-to types to ensure
7624 that the sizes evaluation dominates every possible later use of the
7625 values. Restricting to such types here would be safe since there
7626 is no possible forward declaration around, but would introduce an
7627 undesirable middle-end semantic to anonymity. We then defer to
7628 front-ends the responsibility of ensuring that the sizes are
7629 evaluated both early and late enough, e.g. by attaching artificial
7630 type declarations to the tree. */
7637 gimplify_one_sizepos (&TYPE_SIZE (type), list_p);
7638 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type), list_p);
7640 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
7642 TYPE_SIZE (t) = TYPE_SIZE (type);
7643 TYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (type);
7644 TYPE_SIZES_GIMPLIFIED (t) = 1;
7648 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
7649 a size or position, has had all of its SAVE_EXPRs evaluated.
7650 We add any required statements to *STMT_P. */
7653 gimplify_one_sizepos (tree *expr_p, gimple_seq *stmt_p)
7655 tree type, expr = *expr_p;
7657 /* We don't do anything if the value isn't there, is constant, or contains
7658 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
7659 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
7660 will want to replace it with a new variable, but that will cause problems
7661 if this type is from outside the function. It's OK to have that here. */
7662 if (expr == NULL_TREE || TREE_CONSTANT (expr)
7663 || TREE_CODE (expr) == VAR_DECL
7664 || CONTAINS_PLACEHOLDER_P (expr))
7667 type = TREE_TYPE (expr);
7668 *expr_p = unshare_expr (expr);
7670 gimplify_expr (expr_p, stmt_p, NULL, is_gimple_val, fb_rvalue);
7673 /* Verify that we've an exact type match with the original expression.
7674 In particular, we do not wish to drop a "sizetype" in favour of a
7675 type of similar dimensions. We don't want to pollute the generic
7676 type-stripping code with this knowledge because it doesn't matter
7677 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
7678 and friends retain their "sizetype-ness". */
7679 if (TREE_TYPE (expr) != type
7680 && TREE_CODE (type) == INTEGER_TYPE
7681 && TYPE_IS_SIZETYPE (type))
7686 *expr_p = create_tmp_var (type, NULL);
7687 tmp = build1 (NOP_EXPR, type, expr);
7688 stmt = gimplify_assign (*expr_p, tmp, stmt_p);
7689 gimple_set_location (stmt, EXPR_LOC_OR_HERE (expr));
7694 /* Gimplify the body of statements pointed to by BODY_P and return a
7695 GIMPLE_BIND containing the sequence of GIMPLE statements
7696 corresponding to BODY_P. FNDECL is the function decl containing
7700 gimplify_body (tree *body_p, tree fndecl, bool do_parms)
7702 location_t saved_location = input_location;
7703 gimple_seq parm_stmts, seq;
7705 struct gimplify_ctx gctx;
7707 timevar_push (TV_TREE_GIMPLIFY);
7709 /* Initialize for optimize_insn_for_s{ize,peed}_p possibly called during
7711 default_rtl_profile ();
7713 gcc_assert (gimplify_ctxp == NULL);
7714 push_gimplify_context (&gctx);
7716 /* Unshare most shared trees in the body and in that of any nested functions.
7717 It would seem we don't have to do this for nested functions because
7718 they are supposed to be output and then the outer function gimplified
7719 first, but the g++ front end doesn't always do it that way. */
7720 unshare_body (body_p, fndecl);
7721 unvisit_body (body_p, fndecl);
7723 if (cgraph_node (fndecl)->origin)
7724 nonlocal_vlas = pointer_set_create ();
7726 /* Make sure input_location isn't set to something weird. */
7727 input_location = DECL_SOURCE_LOCATION (fndecl);
7729 /* Resolve callee-copies. This has to be done before processing
7730 the body so that DECL_VALUE_EXPR gets processed correctly. */
7731 parm_stmts = (do_parms) ? gimplify_parameters () : NULL;
7733 /* Gimplify the function's body. */
7735 gimplify_stmt (body_p, &seq);
7736 outer_bind = gimple_seq_first_stmt (seq);
7739 outer_bind = gimple_build_nop ();
7740 gimplify_seq_add_stmt (&seq, outer_bind);
7743 /* The body must contain exactly one statement, a GIMPLE_BIND. If this is
7744 not the case, wrap everything in a GIMPLE_BIND to make it so. */
7745 if (gimple_code (outer_bind) == GIMPLE_BIND
7746 && gimple_seq_first (seq) == gimple_seq_last (seq))
7749 outer_bind = gimple_build_bind (NULL_TREE, seq, NULL);
7751 *body_p = NULL_TREE;
7753 /* If we had callee-copies statements, insert them at the beginning
7754 of the function and clear DECL_VALUE_EXPR_P on the parameters. */
7755 if (!gimple_seq_empty_p (parm_stmts))
7759 gimplify_seq_add_seq (&parm_stmts, gimple_bind_body (outer_bind));
7760 gimple_bind_set_body (outer_bind, parm_stmts);
7762 for (parm = DECL_ARGUMENTS (current_function_decl);
7763 parm; parm = DECL_CHAIN (parm))
7764 if (DECL_HAS_VALUE_EXPR_P (parm))
7766 DECL_HAS_VALUE_EXPR_P (parm) = 0;
7767 DECL_IGNORED_P (parm) = 0;
7773 pointer_set_destroy (nonlocal_vlas);
7774 nonlocal_vlas = NULL;
7777 pop_gimplify_context (outer_bind);
7778 gcc_assert (gimplify_ctxp == NULL);
7780 #ifdef ENABLE_TYPES_CHECKING
7782 verify_types_in_gimple_seq (gimple_bind_body (outer_bind));
7785 timevar_pop (TV_TREE_GIMPLIFY);
7786 input_location = saved_location;
7791 typedef char *char_p; /* For DEF_VEC_P. */
7793 DEF_VEC_ALLOC_P(char_p,heap);
7795 /* Return whether we should exclude FNDECL from instrumentation. */
7798 flag_instrument_functions_exclude_p (tree fndecl)
7800 VEC(char_p,heap) *vec;
7802 vec = (VEC(char_p,heap) *) flag_instrument_functions_exclude_functions;
7803 if (VEC_length (char_p, vec) > 0)
7809 name = lang_hooks.decl_printable_name (fndecl, 0);
7810 FOR_EACH_VEC_ELT (char_p, vec, i, s)
7811 if (strstr (name, s) != NULL)
7815 vec = (VEC(char_p,heap) *) flag_instrument_functions_exclude_files;
7816 if (VEC_length (char_p, vec) > 0)
7822 name = DECL_SOURCE_FILE (fndecl);
7823 FOR_EACH_VEC_ELT (char_p, vec, i, s)
7824 if (strstr (name, s) != NULL)
7831 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
7832 node for the function we want to gimplify.
7834 Returns the sequence of GIMPLE statements corresponding to the body
7838 gimplify_function_tree (tree fndecl)
7840 tree oldfn, parm, ret;
7844 gcc_assert (!gimple_body (fndecl));
7846 oldfn = current_function_decl;
7847 current_function_decl = fndecl;
7848 if (DECL_STRUCT_FUNCTION (fndecl))
7849 push_cfun (DECL_STRUCT_FUNCTION (fndecl));
7851 push_struct_function (fndecl);
7853 for (parm = DECL_ARGUMENTS (fndecl); parm ; parm = DECL_CHAIN (parm))
7855 /* Preliminarily mark non-addressed complex variables as eligible
7856 for promotion to gimple registers. We'll transform their uses
7858 if ((TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
7859 || TREE_CODE (TREE_TYPE (parm)) == VECTOR_TYPE)
7860 && !TREE_THIS_VOLATILE (parm)
7861 && !needs_to_live_in_memory (parm))
7862 DECL_GIMPLE_REG_P (parm) = 1;
7865 ret = DECL_RESULT (fndecl);
7866 if ((TREE_CODE (TREE_TYPE (ret)) == COMPLEX_TYPE
7867 || TREE_CODE (TREE_TYPE (ret)) == VECTOR_TYPE)
7868 && !needs_to_live_in_memory (ret))
7869 DECL_GIMPLE_REG_P (ret) = 1;
7871 bind = gimplify_body (&DECL_SAVED_TREE (fndecl), fndecl, true);
7873 /* The tree body of the function is no longer needed, replace it
7874 with the new GIMPLE body. */
7875 seq = gimple_seq_alloc ();
7876 gimple_seq_add_stmt (&seq, bind);
7877 gimple_set_body (fndecl, seq);
7879 /* If we're instrumenting function entry/exit, then prepend the call to
7880 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
7881 catch the exit hook. */
7882 /* ??? Add some way to ignore exceptions for this TFE. */
7883 if (flag_instrument_function_entry_exit
7884 && !DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl)
7885 && !flag_instrument_functions_exclude_p (fndecl))
7890 gimple_seq cleanup = NULL, body = NULL;
7894 x = implicit_built_in_decls[BUILT_IN_RETURN_ADDRESS];
7895 call = gimple_build_call (x, 1, integer_zero_node);
7896 tmp_var = create_tmp_var (ptr_type_node, "return_addr");
7897 gimple_call_set_lhs (call, tmp_var);
7898 gimplify_seq_add_stmt (&cleanup, call);
7899 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_EXIT];
7900 call = gimple_build_call (x, 2,
7901 build_fold_addr_expr (current_function_decl),
7903 gimplify_seq_add_stmt (&cleanup, call);
7904 tf = gimple_build_try (seq, cleanup, GIMPLE_TRY_FINALLY);
7906 x = implicit_built_in_decls[BUILT_IN_RETURN_ADDRESS];
7907 call = gimple_build_call (x, 1, integer_zero_node);
7908 tmp_var = create_tmp_var (ptr_type_node, "return_addr");
7909 gimple_call_set_lhs (call, tmp_var);
7910 gimplify_seq_add_stmt (&body, call);
7911 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_ENTER];
7912 call = gimple_build_call (x, 2,
7913 build_fold_addr_expr (current_function_decl),
7915 gimplify_seq_add_stmt (&body, call);
7916 gimplify_seq_add_stmt (&body, tf);
7917 new_bind = gimple_build_bind (NULL, body, gimple_bind_block (bind));
7918 /* Clear the block for BIND, since it is no longer directly inside
7919 the function, but within a try block. */
7920 gimple_bind_set_block (bind, NULL);
7922 /* Replace the current function body with the body
7923 wrapped in the try/finally TF. */
7924 seq = gimple_seq_alloc ();
7925 gimple_seq_add_stmt (&seq, new_bind);
7926 gimple_set_body (fndecl, seq);
7929 DECL_SAVED_TREE (fndecl) = NULL_TREE;
7930 cfun->curr_properties = PROP_gimple_any;
7932 current_function_decl = oldfn;
7937 /* Some transformations like inlining may invalidate the GIMPLE form
7938 for operands. This function traverses all the operands in STMT and
7939 gimplifies anything that is not a valid gimple operand. Any new
7940 GIMPLE statements are inserted before *GSI_P. */
7943 gimple_regimplify_operands (gimple stmt, gimple_stmt_iterator *gsi_p)
7946 tree orig_lhs = NULL_TREE, lhs, t;
7947 gimple_seq pre = NULL;
7948 gimple post_stmt = NULL;
7949 struct gimplify_ctx gctx;
7951 push_gimplify_context (&gctx);
7952 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
7954 switch (gimple_code (stmt))
7957 gimplify_expr (gimple_cond_lhs_ptr (stmt), &pre, NULL,
7958 is_gimple_val, fb_rvalue);
7959 gimplify_expr (gimple_cond_rhs_ptr (stmt), &pre, NULL,
7960 is_gimple_val, fb_rvalue);
7963 gimplify_expr (gimple_switch_index_ptr (stmt), &pre, NULL,
7964 is_gimple_val, fb_rvalue);
7966 case GIMPLE_OMP_ATOMIC_LOAD:
7967 gimplify_expr (gimple_omp_atomic_load_rhs_ptr (stmt), &pre, NULL,
7968 is_gimple_val, fb_rvalue);
7972 size_t i, noutputs = gimple_asm_noutputs (stmt);
7973 const char *constraint, **oconstraints;
7974 bool allows_mem, allows_reg, is_inout;
7977 = (const char **) alloca ((noutputs) * sizeof (const char *));
7978 for (i = 0; i < noutputs; i++)
7980 tree op = gimple_asm_output_op (stmt, i);
7981 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
7982 oconstraints[i] = constraint;
7983 parse_output_constraint (&constraint, i, 0, 0, &allows_mem,
7984 &allows_reg, &is_inout);
7985 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
7986 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
7987 fb_lvalue | fb_mayfail);
7989 for (i = 0; i < gimple_asm_ninputs (stmt); i++)
7991 tree op = gimple_asm_input_op (stmt, i);
7992 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
7993 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
7994 oconstraints, &allows_mem, &allows_reg);
7995 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (op))) && allows_mem)
7997 if (!allows_reg && allows_mem)
7998 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
7999 is_gimple_lvalue, fb_lvalue | fb_mayfail);
8001 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
8002 is_gimple_asm_val, fb_rvalue);
8007 /* NOTE: We start gimplifying operands from last to first to
8008 make sure that side-effects on the RHS of calls, assignments
8009 and ASMs are executed before the LHS. The ordering is not
8010 important for other statements. */
8011 num_ops = gimple_num_ops (stmt);
8012 orig_lhs = gimple_get_lhs (stmt);
8013 for (i = num_ops; i > 0; i--)
8015 tree op = gimple_op (stmt, i - 1);
8016 if (op == NULL_TREE)
8018 if (i == 1 && (is_gimple_call (stmt) || is_gimple_assign (stmt)))
8019 gimplify_expr (&op, &pre, NULL, is_gimple_lvalue, fb_lvalue);
8021 && is_gimple_assign (stmt)
8023 && get_gimple_rhs_class (gimple_expr_code (stmt))
8024 == GIMPLE_SINGLE_RHS)
8025 gimplify_expr (&op, &pre, NULL,
8026 rhs_predicate_for (gimple_assign_lhs (stmt)),
8028 else if (i == 2 && is_gimple_call (stmt))
8030 if (TREE_CODE (op) == FUNCTION_DECL)
8032 gimplify_expr (&op, &pre, NULL, is_gimple_call_addr, fb_rvalue);
8035 gimplify_expr (&op, &pre, NULL, is_gimple_val, fb_rvalue);
8036 gimple_set_op (stmt, i - 1, op);
8039 lhs = gimple_get_lhs (stmt);
8040 /* If the LHS changed it in a way that requires a simple RHS,
8041 create temporary. */
8042 if (lhs && !is_gimple_reg (lhs))
8044 bool need_temp = false;
8046 if (is_gimple_assign (stmt)
8048 && get_gimple_rhs_class (gimple_expr_code (stmt))
8049 == GIMPLE_SINGLE_RHS)
8050 gimplify_expr (gimple_assign_rhs1_ptr (stmt), &pre, NULL,
8051 rhs_predicate_for (gimple_assign_lhs (stmt)),
8053 else if (is_gimple_reg (lhs))
8055 if (is_gimple_reg_type (TREE_TYPE (lhs)))
8057 if (is_gimple_call (stmt))
8059 i = gimple_call_flags (stmt);
8060 if ((i & ECF_LOOPING_CONST_OR_PURE)
8061 || !(i & (ECF_CONST | ECF_PURE)))
8064 if (stmt_can_throw_internal (stmt))
8070 if (is_gimple_reg_type (TREE_TYPE (lhs)))
8072 else if (TYPE_MODE (TREE_TYPE (lhs)) != BLKmode)
8074 if (is_gimple_call (stmt))
8076 tree fndecl = gimple_call_fndecl (stmt);
8078 if (!aggregate_value_p (TREE_TYPE (lhs), fndecl)
8079 && !(fndecl && DECL_RESULT (fndecl)
8080 && DECL_BY_REFERENCE (DECL_RESULT (fndecl))))
8089 tree temp = create_tmp_reg (TREE_TYPE (lhs), NULL);
8091 if (TREE_CODE (orig_lhs) == SSA_NAME)
8092 orig_lhs = SSA_NAME_VAR (orig_lhs);
8094 if (gimple_in_ssa_p (cfun))
8095 temp = make_ssa_name (temp, NULL);
8096 gimple_set_lhs (stmt, temp);
8097 post_stmt = gimple_build_assign (lhs, temp);
8098 if (TREE_CODE (lhs) == SSA_NAME)
8099 SSA_NAME_DEF_STMT (lhs) = post_stmt;
8105 if (gimple_referenced_vars (cfun))
8106 for (t = gimplify_ctxp->temps; t ; t = TREE_CHAIN (t))
8107 add_referenced_var (t);
8109 if (!gimple_seq_empty_p (pre))
8111 if (gimple_in_ssa_p (cfun))
8113 gimple_stmt_iterator i;
8115 for (i = gsi_start (pre); !gsi_end_p (i); gsi_next (&i))
8116 mark_symbols_for_renaming (gsi_stmt (i));
8118 gsi_insert_seq_before (gsi_p, pre, GSI_SAME_STMT);
8121 gsi_insert_after (gsi_p, post_stmt, GSI_NEW_STMT);
8123 pop_gimplify_context (NULL);
8127 /* Expands EXPR to list of gimple statements STMTS. GIMPLE_TEST_F specifies
8128 the predicate that will hold for the result. If VAR is not NULL, make the
8129 base variable of the final destination be VAR if suitable. */
8132 force_gimple_operand_1 (tree expr, gimple_seq *stmts,
8133 gimple_predicate gimple_test_f, tree var)
8136 enum gimplify_status ret;
8137 struct gimplify_ctx gctx;
8141 /* gimple_test_f might be more strict than is_gimple_val, make
8142 sure we pass both. Just checking gimple_test_f doesn't work
8143 because most gimple predicates do not work recursively. */
8144 if (is_gimple_val (expr)
8145 && (*gimple_test_f) (expr))
8148 push_gimplify_context (&gctx);
8149 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
8150 gimplify_ctxp->allow_rhs_cond_expr = true;
8153 expr = build2 (MODIFY_EXPR, TREE_TYPE (var), var, expr);
8155 if (TREE_CODE (expr) != MODIFY_EXPR
8156 && TREE_TYPE (expr) == void_type_node)
8158 gimplify_and_add (expr, stmts);
8163 ret = gimplify_expr (&expr, stmts, NULL, gimple_test_f, fb_rvalue);
8164 gcc_assert (ret != GS_ERROR);
8167 if (gimple_referenced_vars (cfun))
8168 for (t = gimplify_ctxp->temps; t ; t = DECL_CHAIN (t))
8169 add_referenced_var (t);
8171 pop_gimplify_context (NULL);
8176 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
8177 force the result to be either ssa_name or an invariant, otherwise
8178 just force it to be a rhs expression. If VAR is not NULL, make the
8179 base variable of the final destination be VAR if suitable. */
8182 force_gimple_operand (tree expr, gimple_seq *stmts, bool simple, tree var)
8184 return force_gimple_operand_1 (expr, stmts,
8185 simple ? is_gimple_val : is_gimple_reg_rhs,
8189 /* Invokes force_gimple_operand_1 for EXPR with parameters GIMPLE_TEST_F
8190 and VAR. If some statements are produced, emits them at GSI.
8191 If BEFORE is true. the statements are appended before GSI, otherwise
8192 they are appended after it. M specifies the way GSI moves after
8193 insertion (GSI_SAME_STMT or GSI_CONTINUE_LINKING are the usual values). */
8196 force_gimple_operand_gsi_1 (gimple_stmt_iterator *gsi, tree expr,
8197 gimple_predicate gimple_test_f,
8198 tree var, bool before,
8199 enum gsi_iterator_update m)
8203 expr = force_gimple_operand_1 (expr, &stmts, gimple_test_f, var);
8205 if (!gimple_seq_empty_p (stmts))
8207 if (gimple_in_ssa_p (cfun))
8209 gimple_stmt_iterator i;
8211 for (i = gsi_start (stmts); !gsi_end_p (i); gsi_next (&i))
8212 mark_symbols_for_renaming (gsi_stmt (i));
8216 gsi_insert_seq_before (gsi, stmts, m);
8218 gsi_insert_seq_after (gsi, stmts, m);
8224 /* Invokes force_gimple_operand_1 for EXPR with parameter VAR.
8225 If SIMPLE is true, force the result to be either ssa_name or an invariant,
8226 otherwise just force it to be a rhs expression. If some statements are
8227 produced, emits them at GSI. If BEFORE is true, the statements are
8228 appended before GSI, otherwise they are appended after it. M specifies
8229 the way GSI moves after insertion (GSI_SAME_STMT or GSI_CONTINUE_LINKING
8230 are the usual values). */
8233 force_gimple_operand_gsi (gimple_stmt_iterator *gsi, tree expr,
8234 bool simple_p, tree var, bool before,
8235 enum gsi_iterator_update m)
8237 return force_gimple_operand_gsi_1 (gsi, expr,
8239 ? is_gimple_val : is_gimple_reg_rhs,
8244 #include "gt-gimplify.h"