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_get_node (fndecl);
964 copy_if_shared (body_p);
966 if (cgn && 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_get_node (fndecl);
1005 unmark_visited (body_p);
1007 if (cgn && 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 && !is_global_var (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 TREE_THIS_NOTRAP (t) = 1;
1326 SET_DECL_VALUE_EXPR (decl, t);
1327 DECL_HAS_VALUE_EXPR_P (decl) = 1;
1329 t = built_in_decls[BUILT_IN_ALLOCA];
1330 t = build_call_expr (t, 1, DECL_SIZE_UNIT (decl));
1331 /* The call has been built for a variable-sized object. */
1332 ALLOCA_FOR_VAR_P (t) = 1;
1333 t = fold_convert (ptr_type, t);
1334 t = build2 (MODIFY_EXPR, TREE_TYPE (addr), addr, t);
1336 gimplify_and_add (t, seq_p);
1338 /* Indicate that we need to restore the stack level when the
1339 enclosing BIND_EXPR is exited. */
1340 gimplify_ctxp->save_stack = true;
1344 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
1345 and initialization explicit. */
1347 static enum gimplify_status
1348 gimplify_decl_expr (tree *stmt_p, gimple_seq *seq_p)
1350 tree stmt = *stmt_p;
1351 tree decl = DECL_EXPR_DECL (stmt);
1353 *stmt_p = NULL_TREE;
1355 if (TREE_TYPE (decl) == error_mark_node)
1358 if ((TREE_CODE (decl) == TYPE_DECL
1359 || TREE_CODE (decl) == VAR_DECL)
1360 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl)))
1361 gimplify_type_sizes (TREE_TYPE (decl), seq_p);
1363 if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl))
1365 tree init = DECL_INITIAL (decl);
1367 if (TREE_CODE (DECL_SIZE_UNIT (decl)) != INTEGER_CST
1368 || (!TREE_STATIC (decl)
1369 && flag_stack_check == GENERIC_STACK_CHECK
1370 && compare_tree_int (DECL_SIZE_UNIT (decl),
1371 STACK_CHECK_MAX_VAR_SIZE) > 0))
1372 gimplify_vla_decl (decl, seq_p);
1374 /* Some front ends do not explicitly declare all anonymous
1375 artificial variables. We compensate here by declaring the
1376 variables, though it would be better if the front ends would
1377 explicitly declare them. */
1378 if (!DECL_SEEN_IN_BIND_EXPR_P (decl)
1379 && DECL_ARTIFICIAL (decl) && DECL_NAME (decl) == NULL_TREE)
1380 gimple_add_tmp_var (decl);
1382 if (init && init != error_mark_node)
1384 if (!TREE_STATIC (decl))
1386 DECL_INITIAL (decl) = NULL_TREE;
1387 init = build2 (INIT_EXPR, void_type_node, decl, init);
1388 gimplify_and_add (init, seq_p);
1392 /* We must still examine initializers for static variables
1393 as they may contain a label address. */
1394 walk_tree (&init, force_labels_r, NULL, NULL);
1401 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1402 and replacing the LOOP_EXPR with goto, but if the loop contains an
1403 EXIT_EXPR, we need to append a label for it to jump to. */
1405 static enum gimplify_status
1406 gimplify_loop_expr (tree *expr_p, gimple_seq *pre_p)
1408 tree saved_label = gimplify_ctxp->exit_label;
1409 tree start_label = create_artificial_label (UNKNOWN_LOCATION);
1411 gimplify_seq_add_stmt (pre_p, gimple_build_label (start_label));
1413 gimplify_ctxp->exit_label = NULL_TREE;
1415 gimplify_and_add (LOOP_EXPR_BODY (*expr_p), pre_p);
1417 gimplify_seq_add_stmt (pre_p, gimple_build_goto (start_label));
1419 if (gimplify_ctxp->exit_label)
1420 gimplify_seq_add_stmt (pre_p, gimple_build_label (gimplify_ctxp->exit_label));
1422 gimplify_ctxp->exit_label = saved_label;
1428 /* Gimplifies a statement list onto a sequence. These may be created either
1429 by an enlightened front-end, or by shortcut_cond_expr. */
1431 static enum gimplify_status
1432 gimplify_statement_list (tree *expr_p, gimple_seq *pre_p)
1434 tree temp = voidify_wrapper_expr (*expr_p, NULL);
1436 tree_stmt_iterator i = tsi_start (*expr_p);
1438 while (!tsi_end_p (i))
1440 gimplify_stmt (tsi_stmt_ptr (i), pre_p);
1453 /* Compare two case labels. Because the front end should already have
1454 made sure that case ranges do not overlap, it is enough to only compare
1455 the CASE_LOW values of each case label. */
1458 compare_case_labels (const void *p1, const void *p2)
1460 const_tree const case1 = *(const_tree const*)p1;
1461 const_tree const case2 = *(const_tree const*)p2;
1463 /* The 'default' case label always goes first. */
1464 if (!CASE_LOW (case1))
1466 else if (!CASE_LOW (case2))
1469 return tree_int_cst_compare (CASE_LOW (case1), CASE_LOW (case2));
1473 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1476 sort_case_labels (VEC(tree,heap)* label_vec)
1478 VEC_qsort (tree, label_vec, compare_case_labels);
1482 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1485 static enum gimplify_status
1486 gimplify_switch_expr (tree *expr_p, gimple_seq *pre_p)
1488 tree switch_expr = *expr_p;
1489 gimple_seq switch_body_seq = NULL;
1490 enum gimplify_status ret;
1492 ret = gimplify_expr (&SWITCH_COND (switch_expr), pre_p, NULL, is_gimple_val,
1494 if (ret == GS_ERROR || ret == GS_UNHANDLED)
1497 if (SWITCH_BODY (switch_expr))
1499 VEC (tree,heap) *labels;
1500 VEC (tree,heap) *saved_labels;
1501 tree default_case = NULL_TREE;
1503 gimple gimple_switch;
1505 /* If someone can be bothered to fill in the labels, they can
1506 be bothered to null out the body too. */
1507 gcc_assert (!SWITCH_LABELS (switch_expr));
1509 /* save old labels, get new ones from body, then restore the old
1510 labels. Save all the things from the switch body to append after. */
1511 saved_labels = gimplify_ctxp->case_labels;
1512 gimplify_ctxp->case_labels = VEC_alloc (tree, heap, 8);
1514 gimplify_stmt (&SWITCH_BODY (switch_expr), &switch_body_seq);
1515 labels = gimplify_ctxp->case_labels;
1516 gimplify_ctxp->case_labels = saved_labels;
1519 while (i < VEC_length (tree, labels))
1521 tree elt = VEC_index (tree, labels, i);
1522 tree low = CASE_LOW (elt);
1523 bool remove_element = FALSE;
1527 /* Discard empty ranges. */
1528 tree high = CASE_HIGH (elt);
1529 if (high && tree_int_cst_lt (high, low))
1530 remove_element = TRUE;
1534 /* The default case must be the last label in the list. */
1535 gcc_assert (!default_case);
1537 remove_element = TRUE;
1541 VEC_ordered_remove (tree, labels, i);
1547 if (!VEC_empty (tree, labels))
1548 sort_case_labels (labels);
1552 tree type = TREE_TYPE (switch_expr);
1554 /* If the switch has no default label, add one, so that we jump
1555 around the switch body. If the labels already cover the whole
1556 range of type, add the default label pointing to one of the
1558 if (type == void_type_node)
1559 type = TREE_TYPE (SWITCH_COND (switch_expr));
1561 && INTEGRAL_TYPE_P (type)
1562 && TYPE_MIN_VALUE (type)
1563 && TYPE_MAX_VALUE (type)
1564 && tree_int_cst_equal (CASE_LOW (VEC_index (tree, labels, 0)),
1565 TYPE_MIN_VALUE (type)))
1567 tree low, high = CASE_HIGH (VEC_index (tree, labels, len - 1));
1569 high = CASE_LOW (VEC_index (tree, labels, len - 1));
1570 if (tree_int_cst_equal (high, TYPE_MAX_VALUE (type)))
1572 for (i = 1; i < len; i++)
1574 high = CASE_LOW (VEC_index (tree, labels, i));
1575 low = CASE_HIGH (VEC_index (tree, labels, i - 1));
1577 low = CASE_LOW (VEC_index (tree, labels, i - 1));
1578 if ((TREE_INT_CST_LOW (low) + 1
1579 != TREE_INT_CST_LOW (high))
1580 || (TREE_INT_CST_HIGH (low)
1581 + (TREE_INT_CST_LOW (high) == 0)
1582 != TREE_INT_CST_HIGH (high)))
1586 default_case = build3 (CASE_LABEL_EXPR, void_type_node,
1587 NULL_TREE, NULL_TREE,
1588 CASE_LABEL (VEC_index (tree,
1598 = build3 (CASE_LABEL_EXPR, void_type_node,
1599 NULL_TREE, NULL_TREE,
1600 create_artificial_label (UNKNOWN_LOCATION));
1601 new_default = gimple_build_label (CASE_LABEL (default_case));
1602 gimplify_seq_add_stmt (&switch_body_seq, new_default);
1606 gimple_switch = gimple_build_switch_vec (SWITCH_COND (switch_expr),
1607 default_case, labels);
1608 gimplify_seq_add_stmt (pre_p, gimple_switch);
1609 gimplify_seq_add_seq (pre_p, switch_body_seq);
1610 VEC_free(tree, heap, labels);
1613 gcc_assert (SWITCH_LABELS (switch_expr));
1619 static enum gimplify_status
1620 gimplify_case_label_expr (tree *expr_p, gimple_seq *pre_p)
1622 struct gimplify_ctx *ctxp;
1623 gimple gimple_label;
1625 /* Invalid OpenMP programs can play Duff's Device type games with
1626 #pragma omp parallel. At least in the C front end, we don't
1627 detect such invalid branches until after gimplification. */
1628 for (ctxp = gimplify_ctxp; ; ctxp = ctxp->prev_context)
1629 if (ctxp->case_labels)
1632 gimple_label = gimple_build_label (CASE_LABEL (*expr_p));
1633 VEC_safe_push (tree, heap, ctxp->case_labels, *expr_p);
1634 gimplify_seq_add_stmt (pre_p, gimple_label);
1639 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1643 build_and_jump (tree *label_p)
1645 if (label_p == NULL)
1646 /* If there's nowhere to jump, just fall through. */
1649 if (*label_p == NULL_TREE)
1651 tree label = create_artificial_label (UNKNOWN_LOCATION);
1655 return build1 (GOTO_EXPR, void_type_node, *label_p);
1658 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1659 This also involves building a label to jump to and communicating it to
1660 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1662 static enum gimplify_status
1663 gimplify_exit_expr (tree *expr_p)
1665 tree cond = TREE_OPERAND (*expr_p, 0);
1668 expr = build_and_jump (&gimplify_ctxp->exit_label);
1669 expr = build3 (COND_EXPR, void_type_node, cond, expr, NULL_TREE);
1675 /* A helper function to be called via walk_tree. Mark all labels under *TP
1676 as being forced. To be called for DECL_INITIAL of static variables. */
1679 force_labels_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
1683 if (TREE_CODE (*tp) == LABEL_DECL)
1684 FORCED_LABEL (*tp) = 1;
1689 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1690 different from its canonical type, wrap the whole thing inside a
1691 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1694 The canonical type of a COMPONENT_REF is the type of the field being
1695 referenced--unless the field is a bit-field which can be read directly
1696 in a smaller mode, in which case the canonical type is the
1697 sign-appropriate type corresponding to that mode. */
1700 canonicalize_component_ref (tree *expr_p)
1702 tree expr = *expr_p;
1705 gcc_assert (TREE_CODE (expr) == COMPONENT_REF);
1707 if (INTEGRAL_TYPE_P (TREE_TYPE (expr)))
1708 type = TREE_TYPE (get_unwidened (expr, NULL_TREE));
1710 type = TREE_TYPE (TREE_OPERAND (expr, 1));
1712 /* One could argue that all the stuff below is not necessary for
1713 the non-bitfield case and declare it a FE error if type
1714 adjustment would be needed. */
1715 if (TREE_TYPE (expr) != type)
1717 #ifdef ENABLE_TYPES_CHECKING
1718 tree old_type = TREE_TYPE (expr);
1722 /* We need to preserve qualifiers and propagate them from
1724 type_quals = TYPE_QUALS (type)
1725 | TYPE_QUALS (TREE_TYPE (TREE_OPERAND (expr, 0)));
1726 if (TYPE_QUALS (type) != type_quals)
1727 type = build_qualified_type (TYPE_MAIN_VARIANT (type), type_quals);
1729 /* Set the type of the COMPONENT_REF to the underlying type. */
1730 TREE_TYPE (expr) = type;
1732 #ifdef ENABLE_TYPES_CHECKING
1733 /* It is now a FE error, if the conversion from the canonical
1734 type to the original expression type is not useless. */
1735 gcc_assert (useless_type_conversion_p (old_type, type));
1740 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1741 to foo, embed that change in the ADDR_EXPR by converting
1746 where L is the lower bound. For simplicity, only do this for constant
1748 The constraint is that the type of &array[L] is trivially convertible
1752 canonicalize_addr_expr (tree *expr_p)
1754 tree expr = *expr_p;
1755 tree addr_expr = TREE_OPERAND (expr, 0);
1756 tree datype, ddatype, pddatype;
1758 /* We simplify only conversions from an ADDR_EXPR to a pointer type. */
1759 if (!POINTER_TYPE_P (TREE_TYPE (expr))
1760 || TREE_CODE (addr_expr) != ADDR_EXPR)
1763 /* The addr_expr type should be a pointer to an array. */
1764 datype = TREE_TYPE (TREE_TYPE (addr_expr));
1765 if (TREE_CODE (datype) != ARRAY_TYPE)
1768 /* The pointer to element type shall be trivially convertible to
1769 the expression pointer type. */
1770 ddatype = TREE_TYPE (datype);
1771 pddatype = build_pointer_type (ddatype);
1772 if (!useless_type_conversion_p (TYPE_MAIN_VARIANT (TREE_TYPE (expr)),
1776 /* The lower bound and element sizes must be constant. */
1777 if (!TYPE_SIZE_UNIT (ddatype)
1778 || TREE_CODE (TYPE_SIZE_UNIT (ddatype)) != INTEGER_CST
1779 || !TYPE_DOMAIN (datype) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype))
1780 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype))) != INTEGER_CST)
1783 /* All checks succeeded. Build a new node to merge the cast. */
1784 *expr_p = build4 (ARRAY_REF, ddatype, TREE_OPERAND (addr_expr, 0),
1785 TYPE_MIN_VALUE (TYPE_DOMAIN (datype)),
1786 NULL_TREE, NULL_TREE);
1787 *expr_p = build1 (ADDR_EXPR, pddatype, *expr_p);
1789 /* We can have stripped a required restrict qualifier above. */
1790 if (!useless_type_conversion_p (TREE_TYPE (expr), TREE_TYPE (*expr_p)))
1791 *expr_p = fold_convert (TREE_TYPE (expr), *expr_p);
1794 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1795 underneath as appropriate. */
1797 static enum gimplify_status
1798 gimplify_conversion (tree *expr_p)
1801 location_t loc = EXPR_LOCATION (*expr_p);
1802 gcc_assert (CONVERT_EXPR_P (*expr_p));
1804 /* Then strip away all but the outermost conversion. */
1805 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p, 0));
1807 /* And remove the outermost conversion if it's useless. */
1808 if (tree_ssa_useless_type_conversion (*expr_p))
1809 *expr_p = TREE_OPERAND (*expr_p, 0);
1811 /* Attempt to avoid NOP_EXPR by producing reference to a subtype.
1812 For example this fold (subclass *)&A into &A->subclass avoiding
1813 a need for statement. */
1814 if (CONVERT_EXPR_P (*expr_p)
1815 && POINTER_TYPE_P (TREE_TYPE (*expr_p))
1816 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p, 0)))
1817 && (tem = maybe_fold_offset_to_address
1818 (EXPR_LOCATION (*expr_p), TREE_OPERAND (*expr_p, 0),
1819 integer_zero_node, TREE_TYPE (*expr_p))) != NULL_TREE)
1822 /* If we still have a conversion at the toplevel,
1823 then canonicalize some constructs. */
1824 if (CONVERT_EXPR_P (*expr_p))
1826 tree sub = TREE_OPERAND (*expr_p, 0);
1828 /* If a NOP conversion is changing the type of a COMPONENT_REF
1829 expression, then canonicalize its type now in order to expose more
1830 redundant conversions. */
1831 if (TREE_CODE (sub) == COMPONENT_REF)
1832 canonicalize_component_ref (&TREE_OPERAND (*expr_p, 0));
1834 /* If a NOP conversion is changing a pointer to array of foo
1835 to a pointer to foo, embed that change in the ADDR_EXPR. */
1836 else if (TREE_CODE (sub) == ADDR_EXPR)
1837 canonicalize_addr_expr (expr_p);
1840 /* If we have a conversion to a non-register type force the
1841 use of a VIEW_CONVERT_EXPR instead. */
1842 if (CONVERT_EXPR_P (*expr_p) && !is_gimple_reg_type (TREE_TYPE (*expr_p)))
1843 *expr_p = fold_build1_loc (loc, VIEW_CONVERT_EXPR, TREE_TYPE (*expr_p),
1844 TREE_OPERAND (*expr_p, 0));
1849 /* Nonlocal VLAs seen in the current function. */
1850 static struct pointer_set_t *nonlocal_vlas;
1852 /* Gimplify a VAR_DECL or PARM_DECL. Returns GS_OK if we expanded a
1853 DECL_VALUE_EXPR, and it's worth re-examining things. */
1855 static enum gimplify_status
1856 gimplify_var_or_parm_decl (tree *expr_p)
1858 tree decl = *expr_p;
1860 /* ??? If this is a local variable, and it has not been seen in any
1861 outer BIND_EXPR, then it's probably the result of a duplicate
1862 declaration, for which we've already issued an error. It would
1863 be really nice if the front end wouldn't leak these at all.
1864 Currently the only known culprit is C++ destructors, as seen
1865 in g++.old-deja/g++.jason/binding.C. */
1866 if (TREE_CODE (decl) == VAR_DECL
1867 && !DECL_SEEN_IN_BIND_EXPR_P (decl)
1868 && !TREE_STATIC (decl) && !DECL_EXTERNAL (decl)
1869 && decl_function_context (decl) == current_function_decl)
1871 gcc_assert (seen_error ());
1875 /* When within an OpenMP context, notice uses of variables. */
1876 if (gimplify_omp_ctxp && omp_notice_variable (gimplify_omp_ctxp, decl, true))
1879 /* If the decl is an alias for another expression, substitute it now. */
1880 if (DECL_HAS_VALUE_EXPR_P (decl))
1882 tree value_expr = DECL_VALUE_EXPR (decl);
1884 /* For referenced nonlocal VLAs add a decl for debugging purposes
1885 to the current function. */
1886 if (TREE_CODE (decl) == VAR_DECL
1887 && TREE_CODE (DECL_SIZE_UNIT (decl)) != INTEGER_CST
1888 && nonlocal_vlas != NULL
1889 && TREE_CODE (value_expr) == INDIRECT_REF
1890 && TREE_CODE (TREE_OPERAND (value_expr, 0)) == VAR_DECL
1891 && decl_function_context (decl) != current_function_decl)
1893 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
1894 while (ctx && ctx->region_type == ORT_WORKSHARE)
1895 ctx = ctx->outer_context;
1896 if (!ctx && !pointer_set_insert (nonlocal_vlas, decl))
1898 tree copy = copy_node (decl), block;
1900 lang_hooks.dup_lang_specific_decl (copy);
1901 SET_DECL_RTL (copy, 0);
1902 TREE_USED (copy) = 1;
1903 block = DECL_INITIAL (current_function_decl);
1904 DECL_CHAIN (copy) = BLOCK_VARS (block);
1905 BLOCK_VARS (block) = copy;
1906 SET_DECL_VALUE_EXPR (copy, unshare_expr (value_expr));
1907 DECL_HAS_VALUE_EXPR_P (copy) = 1;
1911 *expr_p = unshare_expr (value_expr);
1919 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1923 : min_lval '[' val ']'
1925 | compound_lval '[' val ']'
1926 | compound_lval '.' ID
1928 This is not part of the original SIMPLE definition, which separates
1929 array and member references, but it seems reasonable to handle them
1930 together. Also, this way we don't run into problems with union
1931 aliasing; gcc requires that for accesses through a union to alias, the
1932 union reference must be explicit, which was not always the case when we
1933 were splitting up array and member refs.
1935 PRE_P points to the sequence where side effects that must happen before
1936 *EXPR_P should be stored.
1938 POST_P points to the sequence where side effects that must happen after
1939 *EXPR_P should be stored. */
1941 static enum gimplify_status
1942 gimplify_compound_lval (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
1943 fallback_t fallback)
1946 VEC(tree,heap) *stack;
1947 enum gimplify_status ret = GS_ALL_DONE, tret;
1949 location_t loc = EXPR_LOCATION (*expr_p);
1950 tree expr = *expr_p;
1952 /* Create a stack of the subexpressions so later we can walk them in
1953 order from inner to outer. */
1954 stack = VEC_alloc (tree, heap, 10);
1956 /* We can handle anything that get_inner_reference can deal with. */
1957 for (p = expr_p; ; p = &TREE_OPERAND (*p, 0))
1960 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1961 if (TREE_CODE (*p) == INDIRECT_REF)
1962 *p = fold_indirect_ref_loc (loc, *p);
1964 if (handled_component_p (*p))
1966 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
1967 additional COMPONENT_REFs. */
1968 else if ((TREE_CODE (*p) == VAR_DECL || TREE_CODE (*p) == PARM_DECL)
1969 && gimplify_var_or_parm_decl (p) == GS_OK)
1974 VEC_safe_push (tree, heap, stack, *p);
1977 gcc_assert (VEC_length (tree, stack));
1979 /* Now STACK is a stack of pointers to all the refs we've walked through
1980 and P points to the innermost expression.
1982 Java requires that we elaborated nodes in source order. That
1983 means we must gimplify the inner expression followed by each of
1984 the indices, in order. But we can't gimplify the inner
1985 expression until we deal with any variable bounds, sizes, or
1986 positions in order to deal with PLACEHOLDER_EXPRs.
1988 So we do this in three steps. First we deal with the annotations
1989 for any variables in the components, then we gimplify the base,
1990 then we gimplify any indices, from left to right. */
1991 for (i = VEC_length (tree, stack) - 1; i >= 0; i--)
1993 tree t = VEC_index (tree, stack, i);
1995 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
1997 /* Gimplify the low bound and element type size and put them into
1998 the ARRAY_REF. If these values are set, they have already been
2000 if (TREE_OPERAND (t, 2) == NULL_TREE)
2002 tree low = unshare_expr (array_ref_low_bound (t));
2003 if (!is_gimple_min_invariant (low))
2005 TREE_OPERAND (t, 2) = low;
2006 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p,
2007 post_p, is_gimple_reg,
2009 ret = MIN (ret, tret);
2013 if (!TREE_OPERAND (t, 3))
2015 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (t, 0)));
2016 tree elmt_size = unshare_expr (array_ref_element_size (t));
2017 tree factor = size_int (TYPE_ALIGN_UNIT (elmt_type));
2019 /* Divide the element size by the alignment of the element
2021 elmt_size = size_binop_loc (loc, EXACT_DIV_EXPR, elmt_size, factor);
2023 if (!is_gimple_min_invariant (elmt_size))
2025 TREE_OPERAND (t, 3) = elmt_size;
2026 tret = gimplify_expr (&TREE_OPERAND (t, 3), pre_p,
2027 post_p, is_gimple_reg,
2029 ret = MIN (ret, tret);
2033 else if (TREE_CODE (t) == COMPONENT_REF)
2035 /* Set the field offset into T and gimplify it. */
2036 if (!TREE_OPERAND (t, 2))
2038 tree offset = unshare_expr (component_ref_field_offset (t));
2039 tree field = TREE_OPERAND (t, 1);
2041 = size_int (DECL_OFFSET_ALIGN (field) / BITS_PER_UNIT);
2043 /* Divide the offset by its alignment. */
2044 offset = size_binop_loc (loc, EXACT_DIV_EXPR, offset, factor);
2046 if (!is_gimple_min_invariant (offset))
2048 TREE_OPERAND (t, 2) = offset;
2049 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p,
2050 post_p, is_gimple_reg,
2052 ret = MIN (ret, tret);
2058 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
2059 so as to match the min_lval predicate. Failure to do so may result
2060 in the creation of large aggregate temporaries. */
2061 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval,
2062 fallback | fb_lvalue);
2063 ret = MIN (ret, tret);
2065 /* And finally, the indices and operands to BIT_FIELD_REF. During this
2066 loop we also remove any useless conversions. */
2067 for (; VEC_length (tree, stack) > 0; )
2069 tree t = VEC_pop (tree, stack);
2071 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
2073 /* Gimplify the dimension. */
2074 if (!is_gimple_min_invariant (TREE_OPERAND (t, 1)))
2076 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
2077 is_gimple_val, fb_rvalue);
2078 ret = MIN (ret, tret);
2081 else if (TREE_CODE (t) == BIT_FIELD_REF)
2083 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
2084 is_gimple_val, fb_rvalue);
2085 ret = MIN (ret, tret);
2086 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
2087 is_gimple_val, fb_rvalue);
2088 ret = MIN (ret, tret);
2091 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t, 0));
2093 /* The innermost expression P may have originally had
2094 TREE_SIDE_EFFECTS set which would have caused all the outer
2095 expressions in *EXPR_P leading to P to also have had
2096 TREE_SIDE_EFFECTS set. */
2097 recalculate_side_effects (t);
2100 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
2101 if ((fallback & fb_rvalue) && TREE_CODE (*expr_p) == COMPONENT_REF)
2103 canonicalize_component_ref (expr_p);
2106 VEC_free (tree, heap, stack);
2108 gcc_assert (*expr_p == expr || ret != GS_ALL_DONE);
2113 /* Gimplify the self modifying expression pointed to by EXPR_P
2116 PRE_P points to the list where side effects that must happen before
2117 *EXPR_P should be stored.
2119 POST_P points to the list where side effects that must happen after
2120 *EXPR_P should be stored.
2122 WANT_VALUE is nonzero iff we want to use the value of this expression
2123 in another expression. */
2125 static enum gimplify_status
2126 gimplify_self_mod_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
2129 enum tree_code code;
2130 tree lhs, lvalue, rhs, t1;
2131 gimple_seq post = NULL, *orig_post_p = post_p;
2133 enum tree_code arith_code;
2134 enum gimplify_status ret;
2135 location_t loc = EXPR_LOCATION (*expr_p);
2137 code = TREE_CODE (*expr_p);
2139 gcc_assert (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR
2140 || code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR);
2142 /* Prefix or postfix? */
2143 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
2144 /* Faster to treat as prefix if result is not used. */
2145 postfix = want_value;
2149 /* For postfix, make sure the inner expression's post side effects
2150 are executed after side effects from this expression. */
2154 /* Add or subtract? */
2155 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2156 arith_code = PLUS_EXPR;
2158 arith_code = MINUS_EXPR;
2160 /* Gimplify the LHS into a GIMPLE lvalue. */
2161 lvalue = TREE_OPERAND (*expr_p, 0);
2162 ret = gimplify_expr (&lvalue, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
2163 if (ret == GS_ERROR)
2166 /* Extract the operands to the arithmetic operation. */
2168 rhs = TREE_OPERAND (*expr_p, 1);
2170 /* For postfix operator, we evaluate the LHS to an rvalue and then use
2171 that as the result value and in the postqueue operation. We also
2172 make sure to make lvalue a minimal lval, see
2173 gcc.c-torture/execute/20040313-1.c for an example where this matters. */
2176 if (!is_gimple_min_lval (lvalue))
2178 mark_addressable (lvalue);
2179 lvalue = build_fold_addr_expr_loc (input_location, lvalue);
2180 gimplify_expr (&lvalue, pre_p, post_p, is_gimple_val, fb_rvalue);
2181 lvalue = build_fold_indirect_ref_loc (input_location, lvalue);
2183 ret = gimplify_expr (&lhs, pre_p, post_p, is_gimple_val, fb_rvalue);
2184 if (ret == GS_ERROR)
2188 /* For POINTERs increment, use POINTER_PLUS_EXPR. */
2189 if (POINTER_TYPE_P (TREE_TYPE (lhs)))
2191 rhs = fold_convert_loc (loc, sizetype, rhs);
2192 if (arith_code == MINUS_EXPR)
2193 rhs = fold_build1_loc (loc, NEGATE_EXPR, TREE_TYPE (rhs), rhs);
2194 arith_code = POINTER_PLUS_EXPR;
2197 t1 = build2 (arith_code, TREE_TYPE (*expr_p), lhs, rhs);
2201 gimplify_assign (lvalue, t1, orig_post_p);
2202 gimplify_seq_add_seq (orig_post_p, post);
2208 *expr_p = build2 (MODIFY_EXPR, TREE_TYPE (lvalue), lvalue, t1);
2214 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
2217 maybe_with_size_expr (tree *expr_p)
2219 tree expr = *expr_p;
2220 tree type = TREE_TYPE (expr);
2223 /* If we've already wrapped this or the type is error_mark_node, we can't do
2225 if (TREE_CODE (expr) == WITH_SIZE_EXPR
2226 || type == error_mark_node)
2229 /* If the size isn't known or is a constant, we have nothing to do. */
2230 size = TYPE_SIZE_UNIT (type);
2231 if (!size || TREE_CODE (size) == INTEGER_CST)
2234 /* Otherwise, make a WITH_SIZE_EXPR. */
2235 size = unshare_expr (size);
2236 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, expr);
2237 *expr_p = build2 (WITH_SIZE_EXPR, type, expr, size);
2241 /* Helper for gimplify_call_expr. Gimplify a single argument *ARG_P
2242 Store any side-effects in PRE_P. CALL_LOCATION is the location of
2245 static enum gimplify_status
2246 gimplify_arg (tree *arg_p, gimple_seq *pre_p, location_t call_location)
2248 bool (*test) (tree);
2251 /* In general, we allow lvalues for function arguments to avoid
2252 extra overhead of copying large aggregates out of even larger
2253 aggregates into temporaries only to copy the temporaries to
2254 the argument list. Make optimizers happy by pulling out to
2255 temporaries those types that fit in registers. */
2256 if (is_gimple_reg_type (TREE_TYPE (*arg_p)))
2257 test = is_gimple_val, fb = fb_rvalue;
2260 test = is_gimple_lvalue, fb = fb_either;
2261 /* Also strip a TARGET_EXPR that would force an extra copy. */
2262 if (TREE_CODE (*arg_p) == TARGET_EXPR)
2264 tree init = TARGET_EXPR_INITIAL (*arg_p);
2266 && !VOID_TYPE_P (TREE_TYPE (init)))
2271 /* If this is a variable sized type, we must remember the size. */
2272 maybe_with_size_expr (arg_p);
2274 /* FIXME diagnostics: This will mess up gcc.dg/Warray-bounds.c. */
2275 /* Make sure arguments have the same location as the function call
2277 protected_set_expr_location (*arg_p, call_location);
2279 /* There is a sequence point before a function call. Side effects in
2280 the argument list must occur before the actual call. So, when
2281 gimplifying arguments, force gimplify_expr to use an internal
2282 post queue which is then appended to the end of PRE_P. */
2283 return gimplify_expr (arg_p, pre_p, NULL, test, fb);
2287 /* Gimplify the CALL_EXPR node *EXPR_P into the GIMPLE sequence PRE_P.
2288 WANT_VALUE is true if the result of the call is desired. */
2290 static enum gimplify_status
2291 gimplify_call_expr (tree *expr_p, gimple_seq *pre_p, bool want_value)
2293 tree fndecl, parms, p;
2294 enum gimplify_status ret;
2297 bool builtin_va_start_p = FALSE;
2298 location_t loc = EXPR_LOCATION (*expr_p);
2300 gcc_assert (TREE_CODE (*expr_p) == CALL_EXPR);
2302 /* For reliable diagnostics during inlining, it is necessary that
2303 every call_expr be annotated with file and line. */
2304 if (! EXPR_HAS_LOCATION (*expr_p))
2305 SET_EXPR_LOCATION (*expr_p, input_location);
2307 /* This may be a call to a builtin function.
2309 Builtin function calls may be transformed into different
2310 (and more efficient) builtin function calls under certain
2311 circumstances. Unfortunately, gimplification can muck things
2312 up enough that the builtin expanders are not aware that certain
2313 transformations are still valid.
2315 So we attempt transformation/gimplification of the call before
2316 we gimplify the CALL_EXPR. At this time we do not manage to
2317 transform all calls in the same manner as the expanders do, but
2318 we do transform most of them. */
2319 fndecl = get_callee_fndecl (*expr_p);
2320 if (fndecl && DECL_BUILT_IN (fndecl))
2322 tree new_tree = fold_call_expr (input_location, *expr_p, !want_value);
2324 if (new_tree && new_tree != *expr_p)
2326 /* There was a transformation of this call which computes the
2327 same value, but in a more efficient way. Return and try
2333 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
2334 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_VA_START)
2336 builtin_va_start_p = TRUE;
2337 if (call_expr_nargs (*expr_p) < 2)
2339 error ("too few arguments to function %<va_start%>");
2340 *expr_p = build_empty_stmt (EXPR_LOCATION (*expr_p));
2344 if (fold_builtin_next_arg (*expr_p, true))
2346 *expr_p = build_empty_stmt (EXPR_LOCATION (*expr_p));
2352 /* There is a sequence point before the call, so any side effects in
2353 the calling expression must occur before the actual call. Force
2354 gimplify_expr to use an internal post queue. */
2355 ret = gimplify_expr (&CALL_EXPR_FN (*expr_p), pre_p, NULL,
2356 is_gimple_call_addr, fb_rvalue);
2358 nargs = call_expr_nargs (*expr_p);
2360 /* Get argument types for verification. */
2361 fndecl = get_callee_fndecl (*expr_p);
2364 parms = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
2365 else if (POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_FN (*expr_p))))
2366 parms = TYPE_ARG_TYPES (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (*expr_p))));
2368 if (fndecl && DECL_ARGUMENTS (fndecl))
2369 p = DECL_ARGUMENTS (fndecl);
2374 for (i = 0; i < nargs && p; i++, p = TREE_CHAIN (p))
2377 /* If the last argument is __builtin_va_arg_pack () and it is not
2378 passed as a named argument, decrease the number of CALL_EXPR
2379 arguments and set instead the CALL_EXPR_VA_ARG_PACK flag. */
2382 && TREE_CODE (CALL_EXPR_ARG (*expr_p, nargs - 1)) == CALL_EXPR)
2384 tree last_arg = CALL_EXPR_ARG (*expr_p, nargs - 1);
2385 tree last_arg_fndecl = get_callee_fndecl (last_arg);
2388 && TREE_CODE (last_arg_fndecl) == FUNCTION_DECL
2389 && DECL_BUILT_IN_CLASS (last_arg_fndecl) == BUILT_IN_NORMAL
2390 && DECL_FUNCTION_CODE (last_arg_fndecl) == BUILT_IN_VA_ARG_PACK)
2392 tree call = *expr_p;
2395 *expr_p = build_call_array_loc (loc, TREE_TYPE (call),
2396 CALL_EXPR_FN (call),
2397 nargs, CALL_EXPR_ARGP (call));
2399 /* Copy all CALL_EXPR flags, location and block, except
2400 CALL_EXPR_VA_ARG_PACK flag. */
2401 CALL_EXPR_STATIC_CHAIN (*expr_p) = CALL_EXPR_STATIC_CHAIN (call);
2402 CALL_EXPR_TAILCALL (*expr_p) = CALL_EXPR_TAILCALL (call);
2403 CALL_EXPR_RETURN_SLOT_OPT (*expr_p)
2404 = CALL_EXPR_RETURN_SLOT_OPT (call);
2405 CALL_FROM_THUNK_P (*expr_p) = CALL_FROM_THUNK_P (call);
2406 CALL_CANNOT_INLINE_P (*expr_p) = CALL_CANNOT_INLINE_P (call);
2407 SET_EXPR_LOCATION (*expr_p, EXPR_LOCATION (call));
2408 TREE_BLOCK (*expr_p) = TREE_BLOCK (call);
2410 /* Set CALL_EXPR_VA_ARG_PACK. */
2411 CALL_EXPR_VA_ARG_PACK (*expr_p) = 1;
2415 /* Finally, gimplify the function arguments. */
2418 for (i = (PUSH_ARGS_REVERSED ? nargs - 1 : 0);
2419 PUSH_ARGS_REVERSED ? i >= 0 : i < nargs;
2420 PUSH_ARGS_REVERSED ? i-- : i++)
2422 enum gimplify_status t;
2424 /* Avoid gimplifying the second argument to va_start, which needs to
2425 be the plain PARM_DECL. */
2426 if ((i != 1) || !builtin_va_start_p)
2428 t = gimplify_arg (&CALL_EXPR_ARG (*expr_p, i), pre_p,
2429 EXPR_LOCATION (*expr_p));
2437 /* Verify the function result. */
2438 if (want_value && fndecl
2439 && VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fndecl))))
2441 error_at (loc, "using result of function returning %<void%>");
2445 /* Try this again in case gimplification exposed something. */
2446 if (ret != GS_ERROR)
2448 tree new_tree = fold_call_expr (input_location, *expr_p, !want_value);
2450 if (new_tree && new_tree != *expr_p)
2452 /* There was a transformation of this call which computes the
2453 same value, but in a more efficient way. Return and try
2461 *expr_p = error_mark_node;
2465 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2466 decl. This allows us to eliminate redundant or useless
2467 calls to "const" functions. */
2468 if (TREE_CODE (*expr_p) == CALL_EXPR)
2470 int flags = call_expr_flags (*expr_p);
2471 if (flags & (ECF_CONST | ECF_PURE)
2472 /* An infinite loop is considered a side effect. */
2473 && !(flags & (ECF_LOOPING_CONST_OR_PURE)))
2474 TREE_SIDE_EFFECTS (*expr_p) = 0;
2477 /* If the value is not needed by the caller, emit a new GIMPLE_CALL
2478 and clear *EXPR_P. Otherwise, leave *EXPR_P in its gimplified
2479 form and delegate the creation of a GIMPLE_CALL to
2480 gimplify_modify_expr. This is always possible because when
2481 WANT_VALUE is true, the caller wants the result of this call into
2482 a temporary, which means that we will emit an INIT_EXPR in
2483 internal_get_tmp_var which will then be handled by
2484 gimplify_modify_expr. */
2487 /* The CALL_EXPR in *EXPR_P is already in GIMPLE form, so all we
2488 have to do is replicate it as a GIMPLE_CALL tuple. */
2489 gimple_stmt_iterator gsi;
2490 call = gimple_build_call_from_tree (*expr_p);
2491 gimplify_seq_add_stmt (pre_p, call);
2492 gsi = gsi_last (*pre_p);
2494 *expr_p = NULL_TREE;
2500 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2501 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2503 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2504 condition is true or false, respectively. If null, we should generate
2505 our own to skip over the evaluation of this specific expression.
2507 LOCUS is the source location of the COND_EXPR.
2509 This function is the tree equivalent of do_jump.
2511 shortcut_cond_r should only be called by shortcut_cond_expr. */
2514 shortcut_cond_r (tree pred, tree *true_label_p, tree *false_label_p,
2517 tree local_label = NULL_TREE;
2518 tree t, expr = NULL;
2520 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2521 retain the shortcut semantics. Just insert the gotos here;
2522 shortcut_cond_expr will append the real blocks later. */
2523 if (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2525 location_t new_locus;
2527 /* Turn if (a && b) into
2529 if (a); else goto no;
2530 if (b) goto yes; else goto no;
2533 if (false_label_p == NULL)
2534 false_label_p = &local_label;
2536 /* Keep the original source location on the first 'if'. */
2537 t = shortcut_cond_r (TREE_OPERAND (pred, 0), NULL, false_label_p, locus);
2538 append_to_statement_list (t, &expr);
2540 /* Set the source location of the && on the second 'if'. */
2541 new_locus = EXPR_HAS_LOCATION (pred) ? EXPR_LOCATION (pred) : locus;
2542 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p, false_label_p,
2544 append_to_statement_list (t, &expr);
2546 else if (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2548 location_t new_locus;
2550 /* Turn if (a || b) into
2553 if (b) goto yes; else goto no;
2556 if (true_label_p == NULL)
2557 true_label_p = &local_label;
2559 /* Keep the original source location on the first 'if'. */
2560 t = shortcut_cond_r (TREE_OPERAND (pred, 0), true_label_p, NULL, locus);
2561 append_to_statement_list (t, &expr);
2563 /* Set the source location of the || on the second 'if'. */
2564 new_locus = EXPR_HAS_LOCATION (pred) ? EXPR_LOCATION (pred) : locus;
2565 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p, false_label_p,
2567 append_to_statement_list (t, &expr);
2569 else if (TREE_CODE (pred) == COND_EXPR)
2571 location_t new_locus;
2573 /* As long as we're messing with gotos, turn if (a ? b : c) into
2575 if (b) goto yes; else goto no;
2577 if (c) goto yes; else goto no; */
2579 /* Keep the original source location on the first 'if'. Set the source
2580 location of the ? on the second 'if'. */
2581 new_locus = EXPR_HAS_LOCATION (pred) ? EXPR_LOCATION (pred) : locus;
2582 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (pred, 0),
2583 shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2584 false_label_p, locus),
2585 shortcut_cond_r (TREE_OPERAND (pred, 2), true_label_p,
2586 false_label_p, new_locus));
2590 expr = build3 (COND_EXPR, void_type_node, pred,
2591 build_and_jump (true_label_p),
2592 build_and_jump (false_label_p));
2593 SET_EXPR_LOCATION (expr, locus);
2598 t = build1 (LABEL_EXPR, void_type_node, local_label);
2599 append_to_statement_list (t, &expr);
2605 /* Given a conditional expression EXPR with short-circuit boolean
2606 predicates using TRUTH_ANDIF_EXPR or TRUTH_ORIF_EXPR, break the
2607 predicate appart into the equivalent sequence of conditionals. */
2610 shortcut_cond_expr (tree expr)
2612 tree pred = TREE_OPERAND (expr, 0);
2613 tree then_ = TREE_OPERAND (expr, 1);
2614 tree else_ = TREE_OPERAND (expr, 2);
2615 tree true_label, false_label, end_label, t;
2617 tree *false_label_p;
2618 bool emit_end, emit_false, jump_over_else;
2619 bool then_se = then_ && TREE_SIDE_EFFECTS (then_);
2620 bool else_se = else_ && TREE_SIDE_EFFECTS (else_);
2622 /* First do simple transformations. */
2625 /* If there is no 'else', turn
2628 if (a) if (b) then c. */
2629 while (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2631 /* Keep the original source location on the first 'if'. */
2632 location_t locus = EXPR_LOC_OR_HERE (expr);
2633 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2634 /* Set the source location of the && on the second 'if'. */
2635 if (EXPR_HAS_LOCATION (pred))
2636 SET_EXPR_LOCATION (expr, EXPR_LOCATION (pred));
2637 then_ = shortcut_cond_expr (expr);
2638 then_se = then_ && TREE_SIDE_EFFECTS (then_);
2639 pred = TREE_OPERAND (pred, 0);
2640 expr = build3 (COND_EXPR, void_type_node, pred, then_, NULL_TREE);
2641 SET_EXPR_LOCATION (expr, locus);
2647 /* If there is no 'then', turn
2650 if (a); else if (b); else d. */
2651 while (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2653 /* Keep the original source location on the first 'if'. */
2654 location_t locus = EXPR_LOC_OR_HERE (expr);
2655 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2656 /* Set the source location of the || on the second 'if'. */
2657 if (EXPR_HAS_LOCATION (pred))
2658 SET_EXPR_LOCATION (expr, EXPR_LOCATION (pred));
2659 else_ = shortcut_cond_expr (expr);
2660 else_se = else_ && TREE_SIDE_EFFECTS (else_);
2661 pred = TREE_OPERAND (pred, 0);
2662 expr = build3 (COND_EXPR, void_type_node, pred, NULL_TREE, else_);
2663 SET_EXPR_LOCATION (expr, locus);
2667 /* If we're done, great. */
2668 if (TREE_CODE (pred) != TRUTH_ANDIF_EXPR
2669 && TREE_CODE (pred) != TRUTH_ORIF_EXPR)
2672 /* Otherwise we need to mess with gotos. Change
2675 if (a); else goto no;
2678 and recursively gimplify the condition. */
2680 true_label = false_label = end_label = NULL_TREE;
2682 /* If our arms just jump somewhere, hijack those labels so we don't
2683 generate jumps to jumps. */
2686 && TREE_CODE (then_) == GOTO_EXPR
2687 && TREE_CODE (GOTO_DESTINATION (then_)) == LABEL_DECL)
2689 true_label = GOTO_DESTINATION (then_);
2695 && TREE_CODE (else_) == GOTO_EXPR
2696 && TREE_CODE (GOTO_DESTINATION (else_)) == LABEL_DECL)
2698 false_label = GOTO_DESTINATION (else_);
2703 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2705 true_label_p = &true_label;
2707 true_label_p = NULL;
2709 /* The 'else' branch also needs a label if it contains interesting code. */
2710 if (false_label || else_se)
2711 false_label_p = &false_label;
2713 false_label_p = NULL;
2715 /* If there was nothing else in our arms, just forward the label(s). */
2716 if (!then_se && !else_se)
2717 return shortcut_cond_r (pred, true_label_p, false_label_p,
2718 EXPR_LOC_OR_HERE (expr));
2720 /* If our last subexpression already has a terminal label, reuse it. */
2722 t = expr_last (else_);
2724 t = expr_last (then_);
2727 if (t && TREE_CODE (t) == LABEL_EXPR)
2728 end_label = LABEL_EXPR_LABEL (t);
2730 /* If we don't care about jumping to the 'else' branch, jump to the end
2731 if the condition is false. */
2733 false_label_p = &end_label;
2735 /* We only want to emit these labels if we aren't hijacking them. */
2736 emit_end = (end_label == NULL_TREE);
2737 emit_false = (false_label == NULL_TREE);
2739 /* We only emit the jump over the else clause if we have to--if the
2740 then clause may fall through. Otherwise we can wind up with a
2741 useless jump and a useless label at the end of gimplified code,
2742 which will cause us to think that this conditional as a whole
2743 falls through even if it doesn't. If we then inline a function
2744 which ends with such a condition, that can cause us to issue an
2745 inappropriate warning about control reaching the end of a
2746 non-void function. */
2747 jump_over_else = block_may_fallthru (then_);
2749 pred = shortcut_cond_r (pred, true_label_p, false_label_p,
2750 EXPR_LOC_OR_HERE (expr));
2753 append_to_statement_list (pred, &expr);
2755 append_to_statement_list (then_, &expr);
2760 tree last = expr_last (expr);
2761 t = build_and_jump (&end_label);
2762 if (EXPR_HAS_LOCATION (last))
2763 SET_EXPR_LOCATION (t, EXPR_LOCATION (last));
2764 append_to_statement_list (t, &expr);
2768 t = build1 (LABEL_EXPR, void_type_node, false_label);
2769 append_to_statement_list (t, &expr);
2771 append_to_statement_list (else_, &expr);
2773 if (emit_end && end_label)
2775 t = build1 (LABEL_EXPR, void_type_node, end_label);
2776 append_to_statement_list (t, &expr);
2782 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2785 gimple_boolify (tree expr)
2787 tree type = TREE_TYPE (expr);
2788 location_t loc = EXPR_LOCATION (expr);
2790 if (TREE_CODE (expr) == NE_EXPR
2791 && TREE_CODE (TREE_OPERAND (expr, 0)) == CALL_EXPR
2792 && integer_zerop (TREE_OPERAND (expr, 1)))
2794 tree call = TREE_OPERAND (expr, 0);
2795 tree fn = get_callee_fndecl (call);
2797 /* For __builtin_expect ((long) (x), y) recurse into x as well
2798 if x is truth_value_p. */
2800 && DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2801 && DECL_FUNCTION_CODE (fn) == BUILT_IN_EXPECT
2802 && call_expr_nargs (call) == 2)
2804 tree arg = CALL_EXPR_ARG (call, 0);
2807 if (TREE_CODE (arg) == NOP_EXPR
2808 && TREE_TYPE (arg) == TREE_TYPE (call))
2809 arg = TREE_OPERAND (arg, 0);
2810 if (truth_value_p (TREE_CODE (arg)))
2812 arg = gimple_boolify (arg);
2813 CALL_EXPR_ARG (call, 0)
2814 = fold_convert_loc (loc, TREE_TYPE (call), arg);
2820 if (TREE_CODE (type) == BOOLEAN_TYPE)
2823 switch (TREE_CODE (expr))
2825 case TRUTH_AND_EXPR:
2827 case TRUTH_XOR_EXPR:
2828 case TRUTH_ANDIF_EXPR:
2829 case TRUTH_ORIF_EXPR:
2830 /* Also boolify the arguments of truth exprs. */
2831 TREE_OPERAND (expr, 1) = gimple_boolify (TREE_OPERAND (expr, 1));
2834 case TRUTH_NOT_EXPR:
2835 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2838 case EQ_EXPR: case NE_EXPR:
2839 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2840 /* These expressions always produce boolean results. */
2841 TREE_TYPE (expr) = boolean_type_node;
2845 /* Other expressions that get here must have boolean values, but
2846 might need to be converted to the appropriate mode. */
2847 return fold_convert_loc (loc, boolean_type_node, expr);
2851 /* Given a conditional expression *EXPR_P without side effects, gimplify
2852 its operands. New statements are inserted to PRE_P. */
2854 static enum gimplify_status
2855 gimplify_pure_cond_expr (tree *expr_p, gimple_seq *pre_p)
2857 tree expr = *expr_p, cond;
2858 enum gimplify_status ret, tret;
2859 enum tree_code code;
2861 cond = gimple_boolify (COND_EXPR_COND (expr));
2863 /* We need to handle && and || specially, as their gimplification
2864 creates pure cond_expr, thus leading to an infinite cycle otherwise. */
2865 code = TREE_CODE (cond);
2866 if (code == TRUTH_ANDIF_EXPR)
2867 TREE_SET_CODE (cond, TRUTH_AND_EXPR);
2868 else if (code == TRUTH_ORIF_EXPR)
2869 TREE_SET_CODE (cond, TRUTH_OR_EXPR);
2870 ret = gimplify_expr (&cond, pre_p, NULL, is_gimple_condexpr, fb_rvalue);
2871 COND_EXPR_COND (*expr_p) = cond;
2873 tret = gimplify_expr (&COND_EXPR_THEN (expr), pre_p, NULL,
2874 is_gimple_val, fb_rvalue);
2875 ret = MIN (ret, tret);
2876 tret = gimplify_expr (&COND_EXPR_ELSE (expr), pre_p, NULL,
2877 is_gimple_val, fb_rvalue);
2879 return MIN (ret, tret);
2882 /* Returns true if evaluating EXPR could trap.
2883 EXPR is GENERIC, while tree_could_trap_p can be called
2887 generic_expr_could_trap_p (tree expr)
2891 if (!expr || is_gimple_val (expr))
2894 if (!EXPR_P (expr) || tree_could_trap_p (expr))
2897 n = TREE_OPERAND_LENGTH (expr);
2898 for (i = 0; i < n; i++)
2899 if (generic_expr_could_trap_p (TREE_OPERAND (expr, i)))
2905 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2914 The second form is used when *EXPR_P is of type void.
2916 PRE_P points to the list where side effects that must happen before
2917 *EXPR_P should be stored. */
2919 static enum gimplify_status
2920 gimplify_cond_expr (tree *expr_p, gimple_seq *pre_p, fallback_t fallback)
2922 tree expr = *expr_p;
2923 tree type = TREE_TYPE (expr);
2924 location_t loc = EXPR_LOCATION (expr);
2925 tree tmp, arm1, arm2;
2926 enum gimplify_status ret;
2927 tree label_true, label_false, label_cont;
2928 bool have_then_clause_p, have_else_clause_p;
2930 enum tree_code pred_code;
2931 gimple_seq seq = NULL;
2933 /* If this COND_EXPR has a value, copy the values into a temporary within
2935 if (!VOID_TYPE_P (type))
2937 tree then_ = TREE_OPERAND (expr, 1), else_ = TREE_OPERAND (expr, 2);
2940 /* If either an rvalue is ok or we do not require an lvalue, create the
2941 temporary. But we cannot do that if the type is addressable. */
2942 if (((fallback & fb_rvalue) || !(fallback & fb_lvalue))
2943 && !TREE_ADDRESSABLE (type))
2945 if (gimplify_ctxp->allow_rhs_cond_expr
2946 /* If either branch has side effects or could trap, it can't be
2947 evaluated unconditionally. */
2948 && !TREE_SIDE_EFFECTS (then_)
2949 && !generic_expr_could_trap_p (then_)
2950 && !TREE_SIDE_EFFECTS (else_)
2951 && !generic_expr_could_trap_p (else_))
2952 return gimplify_pure_cond_expr (expr_p, pre_p);
2954 tmp = create_tmp_var (type, "iftmp");
2958 /* Otherwise, only create and copy references to the values. */
2961 type = build_pointer_type (type);
2963 if (!VOID_TYPE_P (TREE_TYPE (then_)))
2964 then_ = build_fold_addr_expr_loc (loc, then_);
2966 if (!VOID_TYPE_P (TREE_TYPE (else_)))
2967 else_ = build_fold_addr_expr_loc (loc, else_);
2970 = build3 (COND_EXPR, type, TREE_OPERAND (expr, 0), then_, else_);
2972 tmp = create_tmp_var (type, "iftmp");
2973 result = build_simple_mem_ref_loc (loc, tmp);
2976 /* Build the new then clause, `tmp = then_;'. But don't build the
2977 assignment if the value is void; in C++ it can be if it's a throw. */
2978 if (!VOID_TYPE_P (TREE_TYPE (then_)))
2979 TREE_OPERAND (expr, 1) = build2 (MODIFY_EXPR, type, tmp, then_);
2981 /* Similarly, build the new else clause, `tmp = else_;'. */
2982 if (!VOID_TYPE_P (TREE_TYPE (else_)))
2983 TREE_OPERAND (expr, 2) = build2 (MODIFY_EXPR, type, tmp, else_);
2985 TREE_TYPE (expr) = void_type_node;
2986 recalculate_side_effects (expr);
2988 /* Move the COND_EXPR to the prequeue. */
2989 gimplify_stmt (&expr, pre_p);
2995 /* Remove any COMPOUND_EXPR so the following cases will be caught. */
2996 STRIP_TYPE_NOPS (TREE_OPERAND (expr, 0));
2997 if (TREE_CODE (TREE_OPERAND (expr, 0)) == COMPOUND_EXPR)
2998 gimplify_compound_expr (&TREE_OPERAND (expr, 0), pre_p, true);
3000 /* Make sure the condition has BOOLEAN_TYPE. */
3001 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
3003 /* Break apart && and || conditions. */
3004 if (TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ANDIF_EXPR
3005 || TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ORIF_EXPR)
3007 expr = shortcut_cond_expr (expr);
3009 if (expr != *expr_p)
3013 /* We can't rely on gimplify_expr to re-gimplify the expanded
3014 form properly, as cleanups might cause the target labels to be
3015 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
3016 set up a conditional context. */
3017 gimple_push_condition ();
3018 gimplify_stmt (expr_p, &seq);
3019 gimple_pop_condition (pre_p);
3020 gimple_seq_add_seq (pre_p, seq);
3026 /* Now do the normal gimplification. */
3028 /* Gimplify condition. */
3029 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL, is_gimple_condexpr,
3031 if (ret == GS_ERROR)
3033 gcc_assert (TREE_OPERAND (expr, 0) != NULL_TREE);
3035 gimple_push_condition ();
3037 have_then_clause_p = have_else_clause_p = false;
3038 if (TREE_OPERAND (expr, 1) != NULL
3039 && TREE_CODE (TREE_OPERAND (expr, 1)) == GOTO_EXPR
3040 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr, 1))) == LABEL_DECL
3041 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr, 1)))
3042 == current_function_decl)
3043 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
3044 have different locations, otherwise we end up with incorrect
3045 location information on the branches. */
3047 || !EXPR_HAS_LOCATION (expr)
3048 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr, 1))
3049 || EXPR_LOCATION (expr) == EXPR_LOCATION (TREE_OPERAND (expr, 1))))
3051 label_true = GOTO_DESTINATION (TREE_OPERAND (expr, 1));
3052 have_then_clause_p = true;
3055 label_true = create_artificial_label (UNKNOWN_LOCATION);
3056 if (TREE_OPERAND (expr, 2) != NULL
3057 && TREE_CODE (TREE_OPERAND (expr, 2)) == GOTO_EXPR
3058 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr, 2))) == LABEL_DECL
3059 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr, 2)))
3060 == current_function_decl)
3061 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
3062 have different locations, otherwise we end up with incorrect
3063 location information on the branches. */
3065 || !EXPR_HAS_LOCATION (expr)
3066 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr, 2))
3067 || EXPR_LOCATION (expr) == EXPR_LOCATION (TREE_OPERAND (expr, 2))))
3069 label_false = GOTO_DESTINATION (TREE_OPERAND (expr, 2));
3070 have_else_clause_p = true;
3073 label_false = create_artificial_label (UNKNOWN_LOCATION);
3075 gimple_cond_get_ops_from_tree (COND_EXPR_COND (expr), &pred_code, &arm1,
3078 gimple_cond = gimple_build_cond (pred_code, arm1, arm2, label_true,
3081 gimplify_seq_add_stmt (&seq, gimple_cond);
3082 label_cont = NULL_TREE;
3083 if (!have_then_clause_p)
3085 /* For if (...) {} else { code; } put label_true after
3087 if (TREE_OPERAND (expr, 1) == NULL_TREE
3088 && !have_else_clause_p
3089 && TREE_OPERAND (expr, 2) != NULL_TREE)
3090 label_cont = label_true;
3093 gimplify_seq_add_stmt (&seq, gimple_build_label (label_true));
3094 have_then_clause_p = gimplify_stmt (&TREE_OPERAND (expr, 1), &seq);
3095 /* For if (...) { code; } else {} or
3096 if (...) { code; } else goto label; or
3097 if (...) { code; return; } else { ... }
3098 label_cont isn't needed. */
3099 if (!have_else_clause_p
3100 && TREE_OPERAND (expr, 2) != NULL_TREE
3101 && gimple_seq_may_fallthru (seq))
3104 label_cont = create_artificial_label (UNKNOWN_LOCATION);
3106 g = gimple_build_goto (label_cont);
3108 /* GIMPLE_COND's are very low level; they have embedded
3109 gotos. This particular embedded goto should not be marked
3110 with the location of the original COND_EXPR, as it would
3111 correspond to the COND_EXPR's condition, not the ELSE or the
3112 THEN arms. To avoid marking it with the wrong location, flag
3113 it as "no location". */
3114 gimple_set_do_not_emit_location (g);
3116 gimplify_seq_add_stmt (&seq, g);
3120 if (!have_else_clause_p)
3122 gimplify_seq_add_stmt (&seq, gimple_build_label (label_false));
3123 have_else_clause_p = gimplify_stmt (&TREE_OPERAND (expr, 2), &seq);
3126 gimplify_seq_add_stmt (&seq, gimple_build_label (label_cont));
3128 gimple_pop_condition (pre_p);
3129 gimple_seq_add_seq (pre_p, seq);
3131 if (ret == GS_ERROR)
3133 else if (have_then_clause_p || have_else_clause_p)
3137 /* Both arms are empty; replace the COND_EXPR with its predicate. */
3138 expr = TREE_OPERAND (expr, 0);
3139 gimplify_stmt (&expr, pre_p);
3146 /* Prepare the node pointed to by EXPR_P, an is_gimple_addressable expression,
3147 to be marked addressable.
3149 We cannot rely on such an expression being directly markable if a temporary
3150 has been created by the gimplification. In this case, we create another
3151 temporary and initialize it with a copy, which will become a store after we
3152 mark it addressable. This can happen if the front-end passed us something
3153 that it could not mark addressable yet, like a Fortran pass-by-reference
3154 parameter (int) floatvar. */
3157 prepare_gimple_addressable (tree *expr_p, gimple_seq *seq_p)
3159 while (handled_component_p (*expr_p))
3160 expr_p = &TREE_OPERAND (*expr_p, 0);
3161 if (is_gimple_reg (*expr_p))
3162 *expr_p = get_initialized_tmp_var (*expr_p, seq_p, NULL);
3165 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3166 a call to __builtin_memcpy. */
3168 static enum gimplify_status
3169 gimplify_modify_expr_to_memcpy (tree *expr_p, tree size, bool want_value,
3172 tree t, to, to_ptr, from, from_ptr;
3174 location_t loc = EXPR_LOCATION (*expr_p);
3176 to = TREE_OPERAND (*expr_p, 0);
3177 from = TREE_OPERAND (*expr_p, 1);
3179 /* Mark the RHS addressable. Beware that it may not be possible to do so
3180 directly if a temporary has been created by the gimplification. */
3181 prepare_gimple_addressable (&from, seq_p);
3183 mark_addressable (from);
3184 from_ptr = build_fold_addr_expr_loc (loc, from);
3185 gimplify_arg (&from_ptr, seq_p, loc);
3187 mark_addressable (to);
3188 to_ptr = build_fold_addr_expr_loc (loc, to);
3189 gimplify_arg (&to_ptr, seq_p, loc);
3191 t = implicit_built_in_decls[BUILT_IN_MEMCPY];
3193 gs = gimple_build_call (t, 3, to_ptr, from_ptr, size);
3197 /* tmp = memcpy() */
3198 t = create_tmp_var (TREE_TYPE (to_ptr), NULL);
3199 gimple_call_set_lhs (gs, t);
3200 gimplify_seq_add_stmt (seq_p, gs);
3202 *expr_p = build_simple_mem_ref (t);
3206 gimplify_seq_add_stmt (seq_p, gs);
3211 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3212 a call to __builtin_memset. In this case we know that the RHS is
3213 a CONSTRUCTOR with an empty element list. */
3215 static enum gimplify_status
3216 gimplify_modify_expr_to_memset (tree *expr_p, tree size, bool want_value,
3219 tree t, from, to, to_ptr;
3221 location_t loc = EXPR_LOCATION (*expr_p);
3223 /* Assert our assumptions, to abort instead of producing wrong code
3224 silently if they are not met. Beware that the RHS CONSTRUCTOR might
3225 not be immediately exposed. */
3226 from = TREE_OPERAND (*expr_p, 1);
3227 if (TREE_CODE (from) == WITH_SIZE_EXPR)
3228 from = TREE_OPERAND (from, 0);
3230 gcc_assert (TREE_CODE (from) == CONSTRUCTOR
3231 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (from)));
3234 to = TREE_OPERAND (*expr_p, 0);
3236 to_ptr = build_fold_addr_expr_loc (loc, to);
3237 gimplify_arg (&to_ptr, seq_p, loc);
3238 t = implicit_built_in_decls[BUILT_IN_MEMSET];
3240 gs = gimple_build_call (t, 3, to_ptr, integer_zero_node, size);
3244 /* tmp = memset() */
3245 t = create_tmp_var (TREE_TYPE (to_ptr), NULL);
3246 gimple_call_set_lhs (gs, t);
3247 gimplify_seq_add_stmt (seq_p, gs);
3249 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (to), t);
3253 gimplify_seq_add_stmt (seq_p, gs);
3258 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
3259 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
3260 assignment. Returns non-null if we detect a potential overlap. */
3262 struct gimplify_init_ctor_preeval_data
3264 /* The base decl of the lhs object. May be NULL, in which case we
3265 have to assume the lhs is indirect. */
3268 /* The alias set of the lhs object. */
3269 alias_set_type lhs_alias_set;
3273 gimplify_init_ctor_preeval_1 (tree *tp, int *walk_subtrees, void *xdata)
3275 struct gimplify_init_ctor_preeval_data *data
3276 = (struct gimplify_init_ctor_preeval_data *) xdata;
3279 /* If we find the base object, obviously we have overlap. */
3280 if (data->lhs_base_decl == t)
3283 /* If the constructor component is indirect, determine if we have a
3284 potential overlap with the lhs. The only bits of information we
3285 have to go on at this point are addressability and alias sets. */
3286 if ((INDIRECT_REF_P (t)
3287 || TREE_CODE (t) == MEM_REF)
3288 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
3289 && alias_sets_conflict_p (data->lhs_alias_set, get_alias_set (t)))
3292 /* If the constructor component is a call, determine if it can hide a
3293 potential overlap with the lhs through an INDIRECT_REF like above.
3294 ??? Ugh - this is completely broken. In fact this whole analysis
3295 doesn't look conservative. */
3296 if (TREE_CODE (t) == CALL_EXPR)
3298 tree type, fntype = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (t)));
3300 for (type = TYPE_ARG_TYPES (fntype); type; type = TREE_CHAIN (type))
3301 if (POINTER_TYPE_P (TREE_VALUE (type))
3302 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
3303 && alias_sets_conflict_p (data->lhs_alias_set,
3305 (TREE_TYPE (TREE_VALUE (type)))))
3309 if (IS_TYPE_OR_DECL_P (t))
3314 /* A subroutine of gimplify_init_constructor. Pre-evaluate EXPR,
3315 force values that overlap with the lhs (as described by *DATA)
3316 into temporaries. */
3319 gimplify_init_ctor_preeval (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
3320 struct gimplify_init_ctor_preeval_data *data)
3322 enum gimplify_status one;
3324 /* If the value is constant, then there's nothing to pre-evaluate. */
3325 if (TREE_CONSTANT (*expr_p))
3327 /* Ensure it does not have side effects, it might contain a reference to
3328 the object we're initializing. */
3329 gcc_assert (!TREE_SIDE_EFFECTS (*expr_p));
3333 /* If the type has non-trivial constructors, we can't pre-evaluate. */
3334 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p)))
3337 /* Recurse for nested constructors. */
3338 if (TREE_CODE (*expr_p) == CONSTRUCTOR)
3340 unsigned HOST_WIDE_INT ix;
3341 constructor_elt *ce;
3342 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (*expr_p);
3344 FOR_EACH_VEC_ELT (constructor_elt, v, ix, ce)
3345 gimplify_init_ctor_preeval (&ce->value, pre_p, post_p, data);
3350 /* If this is a variable sized type, we must remember the size. */
3351 maybe_with_size_expr (expr_p);
3353 /* Gimplify the constructor element to something appropriate for the rhs
3354 of a MODIFY_EXPR. Given that we know the LHS is an aggregate, we know
3355 the gimplifier will consider this a store to memory. Doing this
3356 gimplification now means that we won't have to deal with complicated
3357 language-specific trees, nor trees like SAVE_EXPR that can induce
3358 exponential search behavior. */
3359 one = gimplify_expr (expr_p, pre_p, post_p, is_gimple_mem_rhs, fb_rvalue);
3360 if (one == GS_ERROR)
3366 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
3367 with the lhs, since "a = { .x=a }" doesn't make sense. This will
3368 always be true for all scalars, since is_gimple_mem_rhs insists on a
3369 temporary variable for them. */
3370 if (DECL_P (*expr_p))
3373 /* If this is of variable size, we have no choice but to assume it doesn't
3374 overlap since we can't make a temporary for it. */
3375 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (*expr_p))) != INTEGER_CST)
3378 /* Otherwise, we must search for overlap ... */
3379 if (!walk_tree (expr_p, gimplify_init_ctor_preeval_1, data, NULL))
3382 /* ... and if found, force the value into a temporary. */
3383 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
3386 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
3387 a RANGE_EXPR in a CONSTRUCTOR for an array.
3391 object[var] = value;
3398 We increment var _after_ the loop exit check because we might otherwise
3399 fail if upper == TYPE_MAX_VALUE (type for upper).
3401 Note that we never have to deal with SAVE_EXPRs here, because this has
3402 already been taken care of for us, in gimplify_init_ctor_preeval(). */
3404 static void gimplify_init_ctor_eval (tree, VEC(constructor_elt,gc) *,
3405 gimple_seq *, bool);
3408 gimplify_init_ctor_eval_range (tree object, tree lower, tree upper,
3409 tree value, tree array_elt_type,
3410 gimple_seq *pre_p, bool cleared)
3412 tree loop_entry_label, loop_exit_label, fall_thru_label;
3413 tree var, var_type, cref, tmp;
3415 loop_entry_label = create_artificial_label (UNKNOWN_LOCATION);
3416 loop_exit_label = create_artificial_label (UNKNOWN_LOCATION);
3417 fall_thru_label = create_artificial_label (UNKNOWN_LOCATION);
3419 /* Create and initialize the index variable. */
3420 var_type = TREE_TYPE (upper);
3421 var = create_tmp_var (var_type, NULL);
3422 gimplify_seq_add_stmt (pre_p, gimple_build_assign (var, lower));
3424 /* Add the loop entry label. */
3425 gimplify_seq_add_stmt (pre_p, gimple_build_label (loop_entry_label));
3427 /* Build the reference. */
3428 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
3429 var, NULL_TREE, NULL_TREE);
3431 /* If we are a constructor, just call gimplify_init_ctor_eval to do
3432 the store. Otherwise just assign value to the reference. */
3434 if (TREE_CODE (value) == CONSTRUCTOR)
3435 /* NB we might have to call ourself recursively through
3436 gimplify_init_ctor_eval if the value is a constructor. */
3437 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
3440 gimplify_seq_add_stmt (pre_p, gimple_build_assign (cref, value));
3442 /* We exit the loop when the index var is equal to the upper bound. */
3443 gimplify_seq_add_stmt (pre_p,
3444 gimple_build_cond (EQ_EXPR, var, upper,
3445 loop_exit_label, fall_thru_label));
3447 gimplify_seq_add_stmt (pre_p, gimple_build_label (fall_thru_label));
3449 /* Otherwise, increment the index var... */
3450 tmp = build2 (PLUS_EXPR, var_type, var,
3451 fold_convert (var_type, integer_one_node));
3452 gimplify_seq_add_stmt (pre_p, gimple_build_assign (var, tmp));
3454 /* ...and jump back to the loop entry. */
3455 gimplify_seq_add_stmt (pre_p, gimple_build_goto (loop_entry_label));
3457 /* Add the loop exit label. */
3458 gimplify_seq_add_stmt (pre_p, gimple_build_label (loop_exit_label));
3461 /* Return true if FDECL is accessing a field that is zero sized. */
3464 zero_sized_field_decl (const_tree fdecl)
3466 if (TREE_CODE (fdecl) == FIELD_DECL && DECL_SIZE (fdecl)
3467 && integer_zerop (DECL_SIZE (fdecl)))
3472 /* Return true if TYPE is zero sized. */
3475 zero_sized_type (const_tree type)
3477 if (AGGREGATE_TYPE_P (type) && TYPE_SIZE (type)
3478 && integer_zerop (TYPE_SIZE (type)))
3483 /* A subroutine of gimplify_init_constructor. Generate individual
3484 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
3485 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
3486 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
3490 gimplify_init_ctor_eval (tree object, VEC(constructor_elt,gc) *elts,
3491 gimple_seq *pre_p, bool cleared)
3493 tree array_elt_type = NULL;
3494 unsigned HOST_WIDE_INT ix;
3495 tree purpose, value;
3497 if (TREE_CODE (TREE_TYPE (object)) == ARRAY_TYPE)
3498 array_elt_type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object)));
3500 FOR_EACH_CONSTRUCTOR_ELT (elts, ix, purpose, value)
3504 /* NULL values are created above for gimplification errors. */
3508 if (cleared && initializer_zerop (value))
3511 /* ??? Here's to hoping the front end fills in all of the indices,
3512 so we don't have to figure out what's missing ourselves. */
3513 gcc_assert (purpose);
3515 /* Skip zero-sized fields, unless value has side-effects. This can
3516 happen with calls to functions returning a zero-sized type, which
3517 we shouldn't discard. As a number of downstream passes don't
3518 expect sets of zero-sized fields, we rely on the gimplification of
3519 the MODIFY_EXPR we make below to drop the assignment statement. */
3520 if (! TREE_SIDE_EFFECTS (value) && zero_sized_field_decl (purpose))
3523 /* If we have a RANGE_EXPR, we have to build a loop to assign the
3525 if (TREE_CODE (purpose) == RANGE_EXPR)
3527 tree lower = TREE_OPERAND (purpose, 0);
3528 tree upper = TREE_OPERAND (purpose, 1);
3530 /* If the lower bound is equal to upper, just treat it as if
3531 upper was the index. */
3532 if (simple_cst_equal (lower, upper))
3536 gimplify_init_ctor_eval_range (object, lower, upper, value,
3537 array_elt_type, pre_p, cleared);
3544 /* Do not use bitsizetype for ARRAY_REF indices. */
3545 if (TYPE_DOMAIN (TREE_TYPE (object)))
3546 purpose = fold_convert (TREE_TYPE (TYPE_DOMAIN (TREE_TYPE (object))),
3548 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
3549 purpose, NULL_TREE, NULL_TREE);
3553 gcc_assert (TREE_CODE (purpose) == FIELD_DECL);
3554 cref = build3 (COMPONENT_REF, TREE_TYPE (purpose),
3555 unshare_expr (object), purpose, NULL_TREE);
3558 if (TREE_CODE (value) == CONSTRUCTOR
3559 && TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE)
3560 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
3564 tree init = build2 (INIT_EXPR, TREE_TYPE (cref), cref, value);
3565 gimplify_and_add (init, pre_p);
3572 /* Returns the appropriate RHS predicate for this LHS. */
3575 rhs_predicate_for (tree lhs)
3577 if (is_gimple_reg (lhs))
3578 return is_gimple_reg_rhs_or_call;
3580 return is_gimple_mem_rhs_or_call;
3583 /* Gimplify a C99 compound literal expression. This just means adding
3584 the DECL_EXPR before the current statement and using its anonymous
3587 static enum gimplify_status
3588 gimplify_compound_literal_expr (tree *expr_p, gimple_seq *pre_p)
3590 tree decl_s = COMPOUND_LITERAL_EXPR_DECL_EXPR (*expr_p);
3591 tree decl = DECL_EXPR_DECL (decl_s);
3592 /* Mark the decl as addressable if the compound literal
3593 expression is addressable now, otherwise it is marked too late
3594 after we gimplify the initialization expression. */
3595 if (TREE_ADDRESSABLE (*expr_p))
3596 TREE_ADDRESSABLE (decl) = 1;
3598 /* Preliminarily mark non-addressed complex variables as eligible
3599 for promotion to gimple registers. We'll transform their uses
3601 if ((TREE_CODE (TREE_TYPE (decl)) == COMPLEX_TYPE
3602 || TREE_CODE (TREE_TYPE (decl)) == VECTOR_TYPE)
3603 && !TREE_THIS_VOLATILE (decl)
3604 && !needs_to_live_in_memory (decl))
3605 DECL_GIMPLE_REG_P (decl) = 1;
3607 /* This decl isn't mentioned in the enclosing block, so add it to the
3608 list of temps. FIXME it seems a bit of a kludge to say that
3609 anonymous artificial vars aren't pushed, but everything else is. */
3610 if (DECL_NAME (decl) == NULL_TREE && !DECL_SEEN_IN_BIND_EXPR_P (decl))
3611 gimple_add_tmp_var (decl);
3613 gimplify_and_add (decl_s, pre_p);
3618 /* Optimize embedded COMPOUND_LITERAL_EXPRs within a CONSTRUCTOR,
3619 return a new CONSTRUCTOR if something changed. */
3622 optimize_compound_literals_in_ctor (tree orig_ctor)
3624 tree ctor = orig_ctor;
3625 VEC(constructor_elt,gc) *elts = CONSTRUCTOR_ELTS (ctor);
3626 unsigned int idx, num = VEC_length (constructor_elt, elts);
3628 for (idx = 0; idx < num; idx++)
3630 tree value = VEC_index (constructor_elt, elts, idx)->value;
3631 tree newval = value;
3632 if (TREE_CODE (value) == CONSTRUCTOR)
3633 newval = optimize_compound_literals_in_ctor (value);
3634 else if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
3636 tree decl_s = COMPOUND_LITERAL_EXPR_DECL_EXPR (value);
3637 tree decl = DECL_EXPR_DECL (decl_s);
3638 tree init = DECL_INITIAL (decl);
3640 if (!TREE_ADDRESSABLE (value)
3641 && !TREE_ADDRESSABLE (decl)
3643 newval = optimize_compound_literals_in_ctor (init);
3645 if (newval == value)
3648 if (ctor == orig_ctor)
3650 ctor = copy_node (orig_ctor);
3651 CONSTRUCTOR_ELTS (ctor) = VEC_copy (constructor_elt, gc, elts);
3652 elts = CONSTRUCTOR_ELTS (ctor);
3654 VEC_index (constructor_elt, elts, idx)->value = newval;
3661 /* A subroutine of gimplify_modify_expr. Break out elements of a
3662 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
3664 Note that we still need to clear any elements that don't have explicit
3665 initializers, so if not all elements are initialized we keep the
3666 original MODIFY_EXPR, we just remove all of the constructor elements.
3668 If NOTIFY_TEMP_CREATION is true, do not gimplify, just return
3669 GS_ERROR if we would have to create a temporary when gimplifying
3670 this constructor. Otherwise, return GS_OK.
3672 If NOTIFY_TEMP_CREATION is false, just do the gimplification. */
3674 static enum gimplify_status
3675 gimplify_init_constructor (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
3676 bool want_value, bool notify_temp_creation)
3678 tree object, ctor, type;
3679 enum gimplify_status ret;
3680 VEC(constructor_elt,gc) *elts;
3682 gcc_assert (TREE_CODE (TREE_OPERAND (*expr_p, 1)) == CONSTRUCTOR);
3684 if (!notify_temp_creation)
3686 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3687 is_gimple_lvalue, fb_lvalue);
3688 if (ret == GS_ERROR)
3692 object = TREE_OPERAND (*expr_p, 0);
3693 ctor = TREE_OPERAND (*expr_p, 1) =
3694 optimize_compound_literals_in_ctor (TREE_OPERAND (*expr_p, 1));
3695 type = TREE_TYPE (ctor);
3696 elts = CONSTRUCTOR_ELTS (ctor);
3699 switch (TREE_CODE (type))
3703 case QUAL_UNION_TYPE:
3706 struct gimplify_init_ctor_preeval_data preeval_data;
3707 HOST_WIDE_INT num_type_elements, num_ctor_elements;
3708 HOST_WIDE_INT num_nonzero_elements;
3709 bool cleared, valid_const_initializer;
3711 /* Aggregate types must lower constructors to initialization of
3712 individual elements. The exception is that a CONSTRUCTOR node
3713 with no elements indicates zero-initialization of the whole. */
3714 if (VEC_empty (constructor_elt, elts))
3716 if (notify_temp_creation)
3721 /* Fetch information about the constructor to direct later processing.
3722 We might want to make static versions of it in various cases, and
3723 can only do so if it known to be a valid constant initializer. */
3724 valid_const_initializer
3725 = categorize_ctor_elements (ctor, &num_nonzero_elements,
3726 &num_ctor_elements, &cleared);
3728 /* If a const aggregate variable is being initialized, then it
3729 should never be a lose to promote the variable to be static. */
3730 if (valid_const_initializer
3731 && num_nonzero_elements > 1
3732 && TREE_READONLY (object)
3733 && TREE_CODE (object) == VAR_DECL
3734 && (flag_merge_constants >= 2 || !TREE_ADDRESSABLE (object)))
3736 if (notify_temp_creation)
3738 DECL_INITIAL (object) = ctor;
3739 TREE_STATIC (object) = 1;
3740 if (!DECL_NAME (object))
3741 DECL_NAME (object) = create_tmp_var_name ("C");
3742 walk_tree (&DECL_INITIAL (object), force_labels_r, NULL, NULL);
3744 /* ??? C++ doesn't automatically append a .<number> to the
3745 assembler name, and even when it does, it looks a FE private
3746 data structures to figure out what that number should be,
3747 which are not set for this variable. I suppose this is
3748 important for local statics for inline functions, which aren't
3749 "local" in the object file sense. So in order to get a unique
3750 TU-local symbol, we must invoke the lhd version now. */
3751 lhd_set_decl_assembler_name (object);
3753 *expr_p = NULL_TREE;
3757 /* If there are "lots" of initialized elements, even discounting
3758 those that are not address constants (and thus *must* be
3759 computed at runtime), then partition the constructor into
3760 constant and non-constant parts. Block copy the constant
3761 parts in, then generate code for the non-constant parts. */
3762 /* TODO. There's code in cp/typeck.c to do this. */
3764 num_type_elements = count_type_elements (type, true);
3766 /* If count_type_elements could not determine number of type elements
3767 for a constant-sized object, assume clearing is needed.
3768 Don't do this for variable-sized objects, as store_constructor
3769 will ignore the clearing of variable-sized objects. */
3770 if (num_type_elements < 0 && int_size_in_bytes (type) >= 0)
3772 /* If there are "lots" of zeros, then block clear the object first. */
3773 else if (num_type_elements - num_nonzero_elements
3774 > CLEAR_RATIO (optimize_function_for_speed_p (cfun))
3775 && num_nonzero_elements < num_type_elements/4)
3777 /* ??? This bit ought not be needed. For any element not present
3778 in the initializer, we should simply set them to zero. Except
3779 we'd need to *find* the elements that are not present, and that
3780 requires trickery to avoid quadratic compile-time behavior in
3781 large cases or excessive memory use in small cases. */
3782 else if (num_ctor_elements < num_type_elements)
3785 /* If there are "lots" of initialized elements, and all of them
3786 are valid address constants, then the entire initializer can
3787 be dropped to memory, and then memcpy'd out. Don't do this
3788 for sparse arrays, though, as it's more efficient to follow
3789 the standard CONSTRUCTOR behavior of memset followed by
3790 individual element initialization. Also don't do this for small
3791 all-zero initializers (which aren't big enough to merit
3792 clearing), and don't try to make bitwise copies of
3793 TREE_ADDRESSABLE types. */
3794 if (valid_const_initializer
3795 && !(cleared || num_nonzero_elements == 0)
3796 && !TREE_ADDRESSABLE (type))
3798 HOST_WIDE_INT size = int_size_in_bytes (type);
3801 /* ??? We can still get unbounded array types, at least
3802 from the C++ front end. This seems wrong, but attempt
3803 to work around it for now. */
3806 size = int_size_in_bytes (TREE_TYPE (object));
3808 TREE_TYPE (ctor) = type = TREE_TYPE (object);
3811 /* Find the maximum alignment we can assume for the object. */
3812 /* ??? Make use of DECL_OFFSET_ALIGN. */
3813 if (DECL_P (object))
3814 align = DECL_ALIGN (object);
3816 align = TYPE_ALIGN (type);
3819 && num_nonzero_elements > 1
3820 && !can_move_by_pieces (size, align))
3822 if (notify_temp_creation)
3825 walk_tree (&ctor, force_labels_r, NULL, NULL);
3826 ctor = tree_output_constant_def (ctor);
3827 if (!useless_type_conversion_p (type, TREE_TYPE (ctor)))
3828 ctor = build1 (VIEW_CONVERT_EXPR, type, ctor);
3829 TREE_OPERAND (*expr_p, 1) = ctor;
3831 /* This is no longer an assignment of a CONSTRUCTOR, but
3832 we still may have processing to do on the LHS. So
3833 pretend we didn't do anything here to let that happen. */
3834 return GS_UNHANDLED;
3838 /* If the target is volatile, we have non-zero elements and more than
3839 one field to assign, initialize the target from a temporary. */
3840 if (TREE_THIS_VOLATILE (object)
3841 && !TREE_ADDRESSABLE (type)
3842 && num_nonzero_elements > 0
3843 && VEC_length (constructor_elt, elts) > 1)
3845 tree temp = create_tmp_var (TYPE_MAIN_VARIANT (type), NULL);
3846 TREE_OPERAND (*expr_p, 0) = temp;
3847 *expr_p = build2 (COMPOUND_EXPR, TREE_TYPE (*expr_p),
3849 build2 (MODIFY_EXPR, void_type_node,
3854 if (notify_temp_creation)
3857 /* If there are nonzero elements and if needed, pre-evaluate to capture
3858 elements overlapping with the lhs into temporaries. We must do this
3859 before clearing to fetch the values before they are zeroed-out. */
3860 if (num_nonzero_elements > 0 && TREE_CODE (*expr_p) != INIT_EXPR)
3862 preeval_data.lhs_base_decl = get_base_address (object);
3863 if (!DECL_P (preeval_data.lhs_base_decl))
3864 preeval_data.lhs_base_decl = NULL;
3865 preeval_data.lhs_alias_set = get_alias_set (object);
3867 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p, 1),
3868 pre_p, post_p, &preeval_data);
3873 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3874 Note that we still have to gimplify, in order to handle the
3875 case of variable sized types. Avoid shared tree structures. */
3876 CONSTRUCTOR_ELTS (ctor) = NULL;
3877 TREE_SIDE_EFFECTS (ctor) = 0;
3878 object = unshare_expr (object);
3879 gimplify_stmt (expr_p, pre_p);
3882 /* If we have not block cleared the object, or if there are nonzero
3883 elements in the constructor, add assignments to the individual
3884 scalar fields of the object. */
3885 if (!cleared || num_nonzero_elements > 0)
3886 gimplify_init_ctor_eval (object, elts, pre_p, cleared);
3888 *expr_p = NULL_TREE;
3896 if (notify_temp_creation)
3899 /* Extract the real and imaginary parts out of the ctor. */
3900 gcc_assert (VEC_length (constructor_elt, elts) == 2);
3901 r = VEC_index (constructor_elt, elts, 0)->value;
3902 i = VEC_index (constructor_elt, elts, 1)->value;
3903 if (r == NULL || i == NULL)
3905 tree zero = build_zero_cst (TREE_TYPE (type));
3912 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3913 represent creation of a complex value. */
3914 if (TREE_CONSTANT (r) && TREE_CONSTANT (i))
3916 ctor = build_complex (type, r, i);
3917 TREE_OPERAND (*expr_p, 1) = ctor;
3921 ctor = build2 (COMPLEX_EXPR, type, r, i);
3922 TREE_OPERAND (*expr_p, 1) = ctor;
3923 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 1),
3926 rhs_predicate_for (TREE_OPERAND (*expr_p, 0)),
3934 unsigned HOST_WIDE_INT ix;
3935 constructor_elt *ce;
3937 if (notify_temp_creation)
3940 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3941 if (TREE_CONSTANT (ctor))
3943 bool constant_p = true;
3946 /* Even when ctor is constant, it might contain non-*_CST
3947 elements, such as addresses or trapping values like
3948 1.0/0.0 - 1.0/0.0. Such expressions don't belong
3949 in VECTOR_CST nodes. */
3950 FOR_EACH_CONSTRUCTOR_VALUE (elts, ix, value)
3951 if (!CONSTANT_CLASS_P (value))
3959 TREE_OPERAND (*expr_p, 1) = build_vector_from_ctor (type, elts);
3963 /* Don't reduce an initializer constant even if we can't
3964 make a VECTOR_CST. It won't do anything for us, and it'll
3965 prevent us from representing it as a single constant. */
3966 if (initializer_constant_valid_p (ctor, type))
3969 TREE_CONSTANT (ctor) = 0;
3972 /* Vector types use CONSTRUCTOR all the way through gimple
3973 compilation as a general initializer. */
3974 FOR_EACH_VEC_ELT (constructor_elt, elts, ix, ce)
3976 enum gimplify_status tret;
3977 tret = gimplify_expr (&ce->value, pre_p, post_p, is_gimple_val,
3979 if (tret == GS_ERROR)
3982 if (!is_gimple_reg (TREE_OPERAND (*expr_p, 0)))
3983 TREE_OPERAND (*expr_p, 1) = get_formal_tmp_var (ctor, pre_p);
3988 /* So how did we get a CONSTRUCTOR for a scalar type? */
3992 if (ret == GS_ERROR)
3994 else if (want_value)
4001 /* If we have gimplified both sides of the initializer but have
4002 not emitted an assignment, do so now. */
4005 tree lhs = TREE_OPERAND (*expr_p, 0);
4006 tree rhs = TREE_OPERAND (*expr_p, 1);
4007 gimple init = gimple_build_assign (lhs, rhs);
4008 gimplify_seq_add_stmt (pre_p, init);
4016 /* Given a pointer value OP0, return a simplified version of an
4017 indirection through OP0, or NULL_TREE if no simplification is
4018 possible. Note that the resulting type may be different from
4019 the type pointed to in the sense that it is still compatible
4020 from the langhooks point of view. */
4023 gimple_fold_indirect_ref (tree t)
4025 tree ptype = TREE_TYPE (t), type = TREE_TYPE (ptype);
4030 subtype = TREE_TYPE (sub);
4031 if (!POINTER_TYPE_P (subtype))
4034 if (TREE_CODE (sub) == ADDR_EXPR)
4036 tree op = TREE_OPERAND (sub, 0);
4037 tree optype = TREE_TYPE (op);
4039 if (useless_type_conversion_p (type, optype))
4042 /* *(foo *)&fooarray => fooarray[0] */
4043 if (TREE_CODE (optype) == ARRAY_TYPE
4044 && TREE_CODE (TYPE_SIZE (TREE_TYPE (optype))) == INTEGER_CST
4045 && useless_type_conversion_p (type, TREE_TYPE (optype)))
4047 tree type_domain = TYPE_DOMAIN (optype);
4048 tree min_val = size_zero_node;
4049 if (type_domain && TYPE_MIN_VALUE (type_domain))
4050 min_val = TYPE_MIN_VALUE (type_domain);
4051 if (TREE_CODE (min_val) == INTEGER_CST)
4052 return build4 (ARRAY_REF, type, op, min_val, NULL_TREE, NULL_TREE);
4054 /* *(foo *)&complexfoo => __real__ complexfoo */
4055 else if (TREE_CODE (optype) == COMPLEX_TYPE
4056 && useless_type_conversion_p (type, TREE_TYPE (optype)))
4057 return fold_build1 (REALPART_EXPR, type, op);
4058 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
4059 else if (TREE_CODE (optype) == VECTOR_TYPE
4060 && useless_type_conversion_p (type, TREE_TYPE (optype)))
4062 tree part_width = TYPE_SIZE (type);
4063 tree index = bitsize_int (0);
4064 return fold_build3 (BIT_FIELD_REF, type, op, part_width, index);
4068 /* *(p + CST) -> ... */
4069 if (TREE_CODE (sub) == POINTER_PLUS_EXPR
4070 && TREE_CODE (TREE_OPERAND (sub, 1)) == INTEGER_CST)
4072 tree addr = TREE_OPERAND (sub, 0);
4073 tree off = TREE_OPERAND (sub, 1);
4077 addrtype = TREE_TYPE (addr);
4079 /* ((foo*)&vectorfoo)[1] -> BIT_FIELD_REF<vectorfoo,...> */
4080 if (TREE_CODE (addr) == ADDR_EXPR
4081 && TREE_CODE (TREE_TYPE (addrtype)) == VECTOR_TYPE
4082 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (addrtype)))
4083 && host_integerp (off, 1))
4085 unsigned HOST_WIDE_INT offset = tree_low_cst (off, 1);
4086 tree part_width = TYPE_SIZE (type);
4087 unsigned HOST_WIDE_INT part_widthi
4088 = tree_low_cst (part_width, 0) / BITS_PER_UNIT;
4089 unsigned HOST_WIDE_INT indexi = offset * BITS_PER_UNIT;
4090 tree index = bitsize_int (indexi);
4091 if (offset / part_widthi
4092 <= TYPE_VECTOR_SUBPARTS (TREE_TYPE (addrtype)))
4093 return fold_build3 (BIT_FIELD_REF, type, TREE_OPERAND (addr, 0),
4097 /* ((foo*)&complexfoo)[1] -> __imag__ complexfoo */
4098 if (TREE_CODE (addr) == ADDR_EXPR
4099 && TREE_CODE (TREE_TYPE (addrtype)) == COMPLEX_TYPE
4100 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (addrtype))))
4102 tree size = TYPE_SIZE_UNIT (type);
4103 if (tree_int_cst_equal (size, off))
4104 return fold_build1 (IMAGPART_EXPR, type, TREE_OPERAND (addr, 0));
4107 /* *(p + CST) -> MEM_REF <p, CST>. */
4108 if (TREE_CODE (addr) != ADDR_EXPR
4109 || DECL_P (TREE_OPERAND (addr, 0)))
4110 return fold_build2 (MEM_REF, type,
4112 build_int_cst_wide (ptype,
4113 TREE_INT_CST_LOW (off),
4114 TREE_INT_CST_HIGH (off)));
4117 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
4118 if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
4119 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (subtype)))) == INTEGER_CST
4120 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (subtype))))
4123 tree min_val = size_zero_node;
4125 sub = gimple_fold_indirect_ref (sub);
4127 sub = build1 (INDIRECT_REF, TREE_TYPE (subtype), osub);
4128 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
4129 if (type_domain && TYPE_MIN_VALUE (type_domain))
4130 min_val = TYPE_MIN_VALUE (type_domain);
4131 if (TREE_CODE (min_val) == INTEGER_CST)
4132 return build4 (ARRAY_REF, type, sub, min_val, NULL_TREE, NULL_TREE);
4138 /* Given a pointer value OP0, return a simplified version of an
4139 indirection through OP0, or NULL_TREE if no simplification is
4140 possible. This may only be applied to a rhs of an expression.
4141 Note that the resulting type may be different from the type pointed
4142 to in the sense that it is still compatible from the langhooks
4146 gimple_fold_indirect_ref_rhs (tree t)
4148 return gimple_fold_indirect_ref (t);
4151 /* Subroutine of gimplify_modify_expr to do simplifications of
4152 MODIFY_EXPRs based on the code of the RHS. We loop for as long as
4153 something changes. */
4155 static enum gimplify_status
4156 gimplify_modify_expr_rhs (tree *expr_p, tree *from_p, tree *to_p,
4157 gimple_seq *pre_p, gimple_seq *post_p,
4160 enum gimplify_status ret = GS_UNHANDLED;
4166 switch (TREE_CODE (*from_p))
4169 /* If we're assigning from a read-only variable initialized with
4170 a constructor, do the direct assignment from the constructor,
4171 but only if neither source nor target are volatile since this
4172 latter assignment might end up being done on a per-field basis. */
4173 if (DECL_INITIAL (*from_p)
4174 && TREE_READONLY (*from_p)
4175 && !TREE_THIS_VOLATILE (*from_p)
4176 && !TREE_THIS_VOLATILE (*to_p)
4177 && TREE_CODE (DECL_INITIAL (*from_p)) == CONSTRUCTOR)
4179 tree old_from = *from_p;
4180 enum gimplify_status subret;
4182 /* Move the constructor into the RHS. */
4183 *from_p = unshare_expr (DECL_INITIAL (*from_p));
4185 /* Let's see if gimplify_init_constructor will need to put
4187 subret = gimplify_init_constructor (expr_p, NULL, NULL,
4189 if (subret == GS_ERROR)
4191 /* If so, revert the change. */
4203 /* If we have code like
4207 where the type of "x" is a (possibly cv-qualified variant
4208 of "A"), treat the entire expression as identical to "x".
4209 This kind of code arises in C++ when an object is bound
4210 to a const reference, and if "x" is a TARGET_EXPR we want
4211 to take advantage of the optimization below. */
4212 bool volatile_p = TREE_THIS_VOLATILE (*from_p);
4213 tree t = gimple_fold_indirect_ref_rhs (TREE_OPERAND (*from_p, 0));
4216 if (TREE_THIS_VOLATILE (t) != volatile_p)
4218 if (TREE_CODE_CLASS (TREE_CODE (t)) == tcc_declaration)
4219 t = build_simple_mem_ref_loc (EXPR_LOCATION (*from_p),
4220 build_fold_addr_expr (t));
4221 if (REFERENCE_CLASS_P (t))
4222 TREE_THIS_VOLATILE (t) = volatile_p;
4233 /* If we are initializing something from a TARGET_EXPR, strip the
4234 TARGET_EXPR and initialize it directly, if possible. This can't
4235 be done if the initializer is void, since that implies that the
4236 temporary is set in some non-trivial way.
4238 ??? What about code that pulls out the temp and uses it
4239 elsewhere? I think that such code never uses the TARGET_EXPR as
4240 an initializer. If I'm wrong, we'll die because the temp won't
4241 have any RTL. In that case, I guess we'll need to replace
4242 references somehow. */
4243 tree init = TARGET_EXPR_INITIAL (*from_p);
4246 && !VOID_TYPE_P (TREE_TYPE (init)))
4256 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
4258 gimplify_compound_expr (from_p, pre_p, true);
4264 /* If we already made some changes, let the front end have a
4265 crack at this before we break it down. */
4266 if (ret != GS_UNHANDLED)
4268 /* If we're initializing from a CONSTRUCTOR, break this into
4269 individual MODIFY_EXPRs. */
4270 return gimplify_init_constructor (expr_p, pre_p, post_p, want_value,
4274 /* If we're assigning to a non-register type, push the assignment
4275 down into the branches. This is mandatory for ADDRESSABLE types,
4276 since we cannot generate temporaries for such, but it saves a
4277 copy in other cases as well. */
4278 if (!is_gimple_reg_type (TREE_TYPE (*from_p)))
4280 /* This code should mirror the code in gimplify_cond_expr. */
4281 enum tree_code code = TREE_CODE (*expr_p);
4282 tree cond = *from_p;
4283 tree result = *to_p;
4285 ret = gimplify_expr (&result, pre_p, post_p,
4286 is_gimple_lvalue, fb_lvalue);
4287 if (ret != GS_ERROR)
4290 if (TREE_TYPE (TREE_OPERAND (cond, 1)) != void_type_node)
4291 TREE_OPERAND (cond, 1)
4292 = build2 (code, void_type_node, result,
4293 TREE_OPERAND (cond, 1));
4294 if (TREE_TYPE (TREE_OPERAND (cond, 2)) != void_type_node)
4295 TREE_OPERAND (cond, 2)
4296 = build2 (code, void_type_node, unshare_expr (result),
4297 TREE_OPERAND (cond, 2));
4299 TREE_TYPE (cond) = void_type_node;
4300 recalculate_side_effects (cond);
4304 gimplify_and_add (cond, pre_p);
4305 *expr_p = unshare_expr (result);
4314 /* For calls that return in memory, give *to_p as the CALL_EXPR's
4315 return slot so that we don't generate a temporary. */
4316 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p)
4317 && aggregate_value_p (*from_p, *from_p))
4321 if (!(rhs_predicate_for (*to_p))(*from_p))
4322 /* If we need a temporary, *to_p isn't accurate. */
4324 else if (TREE_CODE (*to_p) == RESULT_DECL
4325 && DECL_NAME (*to_p) == NULL_TREE
4326 && needs_to_live_in_memory (*to_p))
4327 /* It's OK to use the return slot directly unless it's an NRV. */
4329 else if (is_gimple_reg_type (TREE_TYPE (*to_p))
4330 || (DECL_P (*to_p) && DECL_REGISTER (*to_p)))
4331 /* Don't force regs into memory. */
4333 else if (TREE_CODE (*expr_p) == INIT_EXPR)
4334 /* It's OK to use the target directly if it's being
4337 else if (!is_gimple_non_addressable (*to_p))
4338 /* Don't use the original target if it's already addressable;
4339 if its address escapes, and the called function uses the
4340 NRV optimization, a conforming program could see *to_p
4341 change before the called function returns; see c++/19317.
4342 When optimizing, the return_slot pass marks more functions
4343 as safe after we have escape info. */
4350 CALL_EXPR_RETURN_SLOT_OPT (*from_p) = 1;
4351 mark_addressable (*to_p);
4356 case WITH_SIZE_EXPR:
4357 /* Likewise for calls that return an aggregate of non-constant size,
4358 since we would not be able to generate a temporary at all. */
4359 if (TREE_CODE (TREE_OPERAND (*from_p, 0)) == CALL_EXPR)
4361 *from_p = TREE_OPERAND (*from_p, 0);
4362 /* We don't change ret in this case because the
4363 WITH_SIZE_EXPR might have been added in
4364 gimplify_modify_expr, so returning GS_OK would lead to an
4370 /* If we're initializing from a container, push the initialization
4372 case CLEANUP_POINT_EXPR:
4374 case STATEMENT_LIST:
4376 tree wrap = *from_p;
4379 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_min_lval,
4381 if (ret != GS_ERROR)
4384 t = voidify_wrapper_expr (wrap, *expr_p);
4385 gcc_assert (t == *expr_p);
4389 gimplify_and_add (wrap, pre_p);
4390 *expr_p = unshare_expr (*to_p);
4397 case COMPOUND_LITERAL_EXPR:
4399 tree complit = TREE_OPERAND (*expr_p, 1);
4400 tree decl_s = COMPOUND_LITERAL_EXPR_DECL_EXPR (complit);
4401 tree decl = DECL_EXPR_DECL (decl_s);
4402 tree init = DECL_INITIAL (decl);
4404 /* struct T x = (struct T) { 0, 1, 2 } can be optimized
4405 into struct T x = { 0, 1, 2 } if the address of the
4406 compound literal has never been taken. */
4407 if (!TREE_ADDRESSABLE (complit)
4408 && !TREE_ADDRESSABLE (decl)
4411 *expr_p = copy_node (*expr_p);
4412 TREE_OPERAND (*expr_p, 1) = init;
4427 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
4428 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
4429 DECL_GIMPLE_REG_P set.
4431 IMPORTANT NOTE: This promotion is performed by introducing a load of the
4432 other, unmodified part of the complex object just before the total store.
4433 As a consequence, if the object is still uninitialized, an undefined value
4434 will be loaded into a register, which may result in a spurious exception
4435 if the register is floating-point and the value happens to be a signaling
4436 NaN for example. Then the fully-fledged complex operations lowering pass
4437 followed by a DCE pass are necessary in order to fix things up. */
4439 static enum gimplify_status
4440 gimplify_modify_expr_complex_part (tree *expr_p, gimple_seq *pre_p,
4443 enum tree_code code, ocode;
4444 tree lhs, rhs, new_rhs, other, realpart, imagpart;
4446 lhs = TREE_OPERAND (*expr_p, 0);
4447 rhs = TREE_OPERAND (*expr_p, 1);
4448 code = TREE_CODE (lhs);
4449 lhs = TREE_OPERAND (lhs, 0);
4451 ocode = code == REALPART_EXPR ? IMAGPART_EXPR : REALPART_EXPR;
4452 other = build1 (ocode, TREE_TYPE (rhs), lhs);
4453 other = get_formal_tmp_var (other, pre_p);
4455 realpart = code == REALPART_EXPR ? rhs : other;
4456 imagpart = code == REALPART_EXPR ? other : rhs;
4458 if (TREE_CONSTANT (realpart) && TREE_CONSTANT (imagpart))
4459 new_rhs = build_complex (TREE_TYPE (lhs), realpart, imagpart);
4461 new_rhs = build2 (COMPLEX_EXPR, TREE_TYPE (lhs), realpart, imagpart);
4463 gimplify_seq_add_stmt (pre_p, gimple_build_assign (lhs, new_rhs));
4464 *expr_p = (want_value) ? rhs : NULL_TREE;
4470 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
4476 PRE_P points to the list where side effects that must happen before
4477 *EXPR_P should be stored.
4479 POST_P points to the list where side effects that must happen after
4480 *EXPR_P should be stored.
4482 WANT_VALUE is nonzero iff we want to use the value of this expression
4483 in another expression. */
4485 static enum gimplify_status
4486 gimplify_modify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
4489 tree *from_p = &TREE_OPERAND (*expr_p, 1);
4490 tree *to_p = &TREE_OPERAND (*expr_p, 0);
4491 enum gimplify_status ret = GS_UNHANDLED;
4493 location_t loc = EXPR_LOCATION (*expr_p);
4495 gcc_assert (TREE_CODE (*expr_p) == MODIFY_EXPR
4496 || TREE_CODE (*expr_p) == INIT_EXPR);
4498 /* Insert pointer conversions required by the middle-end that are not
4499 required by the frontend. This fixes middle-end type checking for
4500 for example gcc.dg/redecl-6.c. */
4501 if (POINTER_TYPE_P (TREE_TYPE (*to_p)))
4503 STRIP_USELESS_TYPE_CONVERSION (*from_p);
4504 if (!useless_type_conversion_p (TREE_TYPE (*to_p), TREE_TYPE (*from_p)))
4505 *from_p = fold_convert_loc (loc, TREE_TYPE (*to_p), *from_p);
4508 /* See if any simplifications can be done based on what the RHS is. */
4509 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
4511 if (ret != GS_UNHANDLED)
4514 /* For zero sized types only gimplify the left hand side and right hand
4515 side as statements and throw away the assignment. Do this after
4516 gimplify_modify_expr_rhs so we handle TARGET_EXPRs of addressable
4518 if (zero_sized_type (TREE_TYPE (*from_p)) && !want_value)
4520 gimplify_stmt (from_p, pre_p);
4521 gimplify_stmt (to_p, pre_p);
4522 *expr_p = NULL_TREE;
4526 /* If the value being copied is of variable width, compute the length
4527 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
4528 before gimplifying any of the operands so that we can resolve any
4529 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
4530 the size of the expression to be copied, not of the destination, so
4531 that is what we must do here. */
4532 maybe_with_size_expr (from_p);
4534 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
4535 if (ret == GS_ERROR)
4538 /* As a special case, we have to temporarily allow for assignments
4539 with a CALL_EXPR on the RHS. Since in GIMPLE a function call is
4540 a toplevel statement, when gimplifying the GENERIC expression
4541 MODIFY_EXPR <a, CALL_EXPR <foo>>, we cannot create the tuple
4542 GIMPLE_ASSIGN <a, GIMPLE_CALL <foo>>.
4544 Instead, we need to create the tuple GIMPLE_CALL <a, foo>. To
4545 prevent gimplify_expr from trying to create a new temporary for
4546 foo's LHS, we tell it that it should only gimplify until it
4547 reaches the CALL_EXPR. On return from gimplify_expr, the newly
4548 created GIMPLE_CALL <foo> will be the last statement in *PRE_P
4549 and all we need to do here is set 'a' to be its LHS. */
4550 ret = gimplify_expr (from_p, pre_p, post_p, rhs_predicate_for (*to_p),
4552 if (ret == GS_ERROR)
4555 /* Now see if the above changed *from_p to something we handle specially. */
4556 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
4558 if (ret != GS_UNHANDLED)
4561 /* If we've got a variable sized assignment between two lvalues (i.e. does
4562 not involve a call), then we can make things a bit more straightforward
4563 by converting the assignment to memcpy or memset. */
4564 if (TREE_CODE (*from_p) == WITH_SIZE_EXPR)
4566 tree from = TREE_OPERAND (*from_p, 0);
4567 tree size = TREE_OPERAND (*from_p, 1);
4569 if (TREE_CODE (from) == CONSTRUCTOR)
4570 return gimplify_modify_expr_to_memset (expr_p, size, want_value, pre_p);
4572 if (is_gimple_addressable (from))
4575 return gimplify_modify_expr_to_memcpy (expr_p, size, want_value,
4580 /* Transform partial stores to non-addressable complex variables into
4581 total stores. This allows us to use real instead of virtual operands
4582 for these variables, which improves optimization. */
4583 if ((TREE_CODE (*to_p) == REALPART_EXPR
4584 || TREE_CODE (*to_p) == IMAGPART_EXPR)
4585 && is_gimple_reg (TREE_OPERAND (*to_p, 0)))
4586 return gimplify_modify_expr_complex_part (expr_p, pre_p, want_value);
4588 /* Try to alleviate the effects of the gimplification creating artificial
4589 temporaries (see for example is_gimple_reg_rhs) on the debug info. */
4590 if (!gimplify_ctxp->into_ssa
4591 && TREE_CODE (*from_p) == VAR_DECL
4592 && DECL_IGNORED_P (*from_p)
4594 && !DECL_IGNORED_P (*to_p))
4596 if (!DECL_NAME (*from_p) && DECL_NAME (*to_p))
4598 = create_tmp_var_name (IDENTIFIER_POINTER (DECL_NAME (*to_p)));
4599 DECL_DEBUG_EXPR_IS_FROM (*from_p) = 1;
4600 SET_DECL_DEBUG_EXPR (*from_p, *to_p);
4603 if (want_value && TREE_THIS_VOLATILE (*to_p))
4604 *from_p = get_initialized_tmp_var (*from_p, pre_p, post_p);
4606 if (TREE_CODE (*from_p) == CALL_EXPR)
4608 /* Since the RHS is a CALL_EXPR, we need to create a GIMPLE_CALL
4609 instead of a GIMPLE_ASSIGN. */
4610 assign = gimple_build_call_from_tree (*from_p);
4611 if (!gimple_call_noreturn_p (assign))
4612 gimple_call_set_lhs (assign, *to_p);
4616 assign = gimple_build_assign (*to_p, *from_p);
4617 gimple_set_location (assign, EXPR_LOCATION (*expr_p));
4620 gimplify_seq_add_stmt (pre_p, assign);
4622 if (gimplify_ctxp->into_ssa && is_gimple_reg (*to_p))
4624 /* If we've somehow already got an SSA_NAME on the LHS, then
4625 we've probably modified it twice. Not good. */
4626 gcc_assert (TREE_CODE (*to_p) != SSA_NAME);
4627 *to_p = make_ssa_name (*to_p, assign);
4628 gimple_set_lhs (assign, *to_p);
4633 *expr_p = TREE_THIS_VOLATILE (*to_p) ? *from_p : unshare_expr (*to_p);
4642 /* Gimplify a comparison between two variable-sized objects. Do this
4643 with a call to BUILT_IN_MEMCMP. */
4645 static enum gimplify_status
4646 gimplify_variable_sized_compare (tree *expr_p)
4648 location_t loc = EXPR_LOCATION (*expr_p);
4649 tree op0 = TREE_OPERAND (*expr_p, 0);
4650 tree op1 = TREE_OPERAND (*expr_p, 1);
4651 tree t, arg, dest, src, expr;
4653 arg = TYPE_SIZE_UNIT (TREE_TYPE (op0));
4654 arg = unshare_expr (arg);
4655 arg = SUBSTITUTE_PLACEHOLDER_IN_EXPR (arg, op0);
4656 src = build_fold_addr_expr_loc (loc, op1);
4657 dest = build_fold_addr_expr_loc (loc, op0);
4658 t = implicit_built_in_decls[BUILT_IN_MEMCMP];
4659 t = build_call_expr_loc (loc, t, 3, dest, src, arg);
4662 = build2 (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), t, integer_zero_node);
4663 SET_EXPR_LOCATION (expr, loc);
4669 /* Gimplify a comparison between two aggregate objects of integral scalar
4670 mode as a comparison between the bitwise equivalent scalar values. */
4672 static enum gimplify_status
4673 gimplify_scalar_mode_aggregate_compare (tree *expr_p)
4675 location_t loc = EXPR_LOCATION (*expr_p);
4676 tree op0 = TREE_OPERAND (*expr_p, 0);
4677 tree op1 = TREE_OPERAND (*expr_p, 1);
4679 tree type = TREE_TYPE (op0);
4680 tree scalar_type = lang_hooks.types.type_for_mode (TYPE_MODE (type), 1);
4682 op0 = fold_build1_loc (loc, VIEW_CONVERT_EXPR, scalar_type, op0);
4683 op1 = fold_build1_loc (loc, VIEW_CONVERT_EXPR, scalar_type, op1);
4686 = fold_build2_loc (loc, TREE_CODE (*expr_p), TREE_TYPE (*expr_p), op0, op1);
4691 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
4692 points to the expression to gimplify.
4694 Expressions of the form 'a && b' are gimplified to:
4696 a && b ? true : false
4698 LOCUS is the source location to be put on the generated COND_EXPR.
4699 gimplify_cond_expr will do the rest. */
4701 static enum gimplify_status
4702 gimplify_boolean_expr (tree *expr_p, location_t locus)
4704 /* Preserve the original type of the expression. */
4705 tree type = TREE_TYPE (*expr_p);
4707 *expr_p = build3 (COND_EXPR, type, *expr_p,
4708 fold_convert_loc (locus, type, boolean_true_node),
4709 fold_convert_loc (locus, type, boolean_false_node));
4711 SET_EXPR_LOCATION (*expr_p, locus);
4716 /* Gimplifies an expression sequence. This function gimplifies each
4717 expression and re-writes the original expression with the last
4718 expression of the sequence in GIMPLE form.
4720 PRE_P points to the list where the side effects for all the
4721 expressions in the sequence will be emitted.
4723 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
4725 static enum gimplify_status
4726 gimplify_compound_expr (tree *expr_p, gimple_seq *pre_p, bool want_value)
4732 tree *sub_p = &TREE_OPERAND (t, 0);
4734 if (TREE_CODE (*sub_p) == COMPOUND_EXPR)
4735 gimplify_compound_expr (sub_p, pre_p, false);
4737 gimplify_stmt (sub_p, pre_p);
4739 t = TREE_OPERAND (t, 1);
4741 while (TREE_CODE (t) == COMPOUND_EXPR);
4748 gimplify_stmt (expr_p, pre_p);
4754 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
4755 gimplify. After gimplification, EXPR_P will point to a new temporary
4756 that holds the original value of the SAVE_EXPR node.
4758 PRE_P points to the list where side effects that must happen before
4759 *EXPR_P should be stored. */
4761 static enum gimplify_status
4762 gimplify_save_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4764 enum gimplify_status ret = GS_ALL_DONE;
4767 gcc_assert (TREE_CODE (*expr_p) == SAVE_EXPR);
4768 val = TREE_OPERAND (*expr_p, 0);
4770 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
4771 if (!SAVE_EXPR_RESOLVED_P (*expr_p))
4773 /* The operand may be a void-valued expression such as SAVE_EXPRs
4774 generated by the Java frontend for class initialization. It is
4775 being executed only for its side-effects. */
4776 if (TREE_TYPE (val) == void_type_node)
4778 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
4779 is_gimple_stmt, fb_none);
4783 val = get_initialized_tmp_var (val, pre_p, post_p);
4785 TREE_OPERAND (*expr_p, 0) = val;
4786 SAVE_EXPR_RESOLVED_P (*expr_p) = 1;
4794 /* Re-write the ADDR_EXPR node pointed to by EXPR_P
4801 PRE_P points to the list where side effects that must happen before
4802 *EXPR_P should be stored.
4804 POST_P points to the list where side effects that must happen after
4805 *EXPR_P should be stored. */
4807 static enum gimplify_status
4808 gimplify_addr_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4810 tree expr = *expr_p;
4811 tree op0 = TREE_OPERAND (expr, 0);
4812 enum gimplify_status ret;
4813 location_t loc = EXPR_LOCATION (*expr_p);
4815 switch (TREE_CODE (op0))
4819 /* Check if we are dealing with an expression of the form '&*ptr'.
4820 While the front end folds away '&*ptr' into 'ptr', these
4821 expressions may be generated internally by the compiler (e.g.,
4822 builtins like __builtin_va_end). */
4823 /* Caution: the silent array decomposition semantics we allow for
4824 ADDR_EXPR means we can't always discard the pair. */
4825 /* Gimplification of the ADDR_EXPR operand may drop
4826 cv-qualification conversions, so make sure we add them if
4829 tree op00 = TREE_OPERAND (op0, 0);
4830 tree t_expr = TREE_TYPE (expr);
4831 tree t_op00 = TREE_TYPE (op00);
4833 if (!useless_type_conversion_p (t_expr, t_op00))
4834 op00 = fold_convert_loc (loc, TREE_TYPE (expr), op00);
4840 case VIEW_CONVERT_EXPR:
4841 /* Take the address of our operand and then convert it to the type of
4844 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
4845 all clear. The impact of this transformation is even less clear. */
4847 /* If the operand is a useless conversion, look through it. Doing so
4848 guarantees that the ADDR_EXPR and its operand will remain of the
4850 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0, 0)))
4851 op0 = TREE_OPERAND (op0, 0);
4853 *expr_p = fold_convert_loc (loc, TREE_TYPE (expr),
4854 build_fold_addr_expr_loc (loc,
4855 TREE_OPERAND (op0, 0)));
4860 /* We use fb_either here because the C frontend sometimes takes
4861 the address of a call that returns a struct; see
4862 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
4863 the implied temporary explicit. */
4865 /* Make the operand addressable. */
4866 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, post_p,
4867 is_gimple_addressable, fb_either);
4868 if (ret == GS_ERROR)
4871 /* Then mark it. Beware that it may not be possible to do so directly
4872 if a temporary has been created by the gimplification. */
4873 prepare_gimple_addressable (&TREE_OPERAND (expr, 0), pre_p);
4875 op0 = TREE_OPERAND (expr, 0);
4877 /* For various reasons, the gimplification of the expression
4878 may have made a new INDIRECT_REF. */
4879 if (TREE_CODE (op0) == INDIRECT_REF)
4880 goto do_indirect_ref;
4882 mark_addressable (TREE_OPERAND (expr, 0));
4884 /* The FEs may end up building ADDR_EXPRs early on a decl with
4885 an incomplete type. Re-build ADDR_EXPRs in canonical form
4887 if (!types_compatible_p (TREE_TYPE (op0), TREE_TYPE (TREE_TYPE (expr))))
4888 *expr_p = build_fold_addr_expr (op0);
4890 /* Make sure TREE_CONSTANT and TREE_SIDE_EFFECTS are set properly. */
4891 recompute_tree_invariant_for_addr_expr (*expr_p);
4893 /* If we re-built the ADDR_EXPR add a conversion to the original type
4895 if (!useless_type_conversion_p (TREE_TYPE (expr), TREE_TYPE (*expr_p)))
4896 *expr_p = fold_convert (TREE_TYPE (expr), *expr_p);
4904 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
4905 value; output operands should be a gimple lvalue. */
4907 static enum gimplify_status
4908 gimplify_asm_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4912 const char **oconstraints;
4915 const char *constraint;
4916 bool allows_mem, allows_reg, is_inout;
4917 enum gimplify_status ret, tret;
4919 VEC(tree, gc) *inputs;
4920 VEC(tree, gc) *outputs;
4921 VEC(tree, gc) *clobbers;
4922 VEC(tree, gc) *labels;
4926 noutputs = list_length (ASM_OUTPUTS (expr));
4927 oconstraints = (const char **) alloca ((noutputs) * sizeof (const char *));
4929 inputs = outputs = clobbers = labels = NULL;
4932 link_next = NULL_TREE;
4933 for (i = 0, link = ASM_OUTPUTS (expr); link; ++i, link = link_next)
4936 size_t constraint_len;
4938 link_next = TREE_CHAIN (link);
4942 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4943 constraint_len = strlen (constraint);
4944 if (constraint_len == 0)
4947 ok = parse_output_constraint (&constraint, i, 0, 0,
4948 &allows_mem, &allows_reg, &is_inout);
4955 if (!allows_reg && allows_mem)
4956 mark_addressable (TREE_VALUE (link));
4958 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4959 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
4960 fb_lvalue | fb_mayfail);
4961 if (tret == GS_ERROR)
4963 error ("invalid lvalue in asm output %d", i);
4967 VEC_safe_push (tree, gc, outputs, link);
4968 TREE_CHAIN (link) = NULL_TREE;
4972 /* An input/output operand. To give the optimizers more
4973 flexibility, split it into separate input and output
4978 /* Turn the in/out constraint into an output constraint. */
4979 char *p = xstrdup (constraint);
4981 TREE_VALUE (TREE_PURPOSE (link)) = build_string (constraint_len, p);
4983 /* And add a matching input constraint. */
4986 sprintf (buf, "%d", i);
4988 /* If there are multiple alternatives in the constraint,
4989 handle each of them individually. Those that allow register
4990 will be replaced with operand number, the others will stay
4992 if (strchr (p, ',') != NULL)
4994 size_t len = 0, buflen = strlen (buf);
4995 char *beg, *end, *str, *dst;
4999 end = strchr (beg, ',');
5001 end = strchr (beg, '\0');
5002 if ((size_t) (end - beg) < buflen)
5005 len += end - beg + 1;
5012 str = (char *) alloca (len);
5013 for (beg = p + 1, dst = str;;)
5016 bool mem_p, reg_p, inout_p;
5018 end = strchr (beg, ',');
5023 parse_output_constraint (&tem, i, 0, 0,
5024 &mem_p, ®_p, &inout_p);
5029 memcpy (dst, buf, buflen);
5038 memcpy (dst, beg, len);
5047 input = build_string (dst - str, str);
5050 input = build_string (strlen (buf), buf);
5053 input = build_string (constraint_len - 1, constraint + 1);
5057 input = build_tree_list (build_tree_list (NULL_TREE, input),
5058 unshare_expr (TREE_VALUE (link)));
5059 ASM_INPUTS (expr) = chainon (ASM_INPUTS (expr), input);
5063 link_next = NULL_TREE;
5064 for (link = ASM_INPUTS (expr); link; ++i, link = link_next)
5066 link_next = TREE_CHAIN (link);
5067 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
5068 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
5069 oconstraints, &allows_mem, &allows_reg);
5071 /* If we can't make copies, we can only accept memory. */
5072 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (link))))
5078 error ("impossible constraint in %<asm%>");
5079 error ("non-memory input %d must stay in memory", i);
5084 /* If the operand is a memory input, it should be an lvalue. */
5085 if (!allows_reg && allows_mem)
5087 tree inputv = TREE_VALUE (link);
5088 STRIP_NOPS (inputv);
5089 if (TREE_CODE (inputv) == PREDECREMENT_EXPR
5090 || TREE_CODE (inputv) == PREINCREMENT_EXPR
5091 || TREE_CODE (inputv) == POSTDECREMENT_EXPR
5092 || TREE_CODE (inputv) == POSTINCREMENT_EXPR)
5093 TREE_VALUE (link) = error_mark_node;
5094 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
5095 is_gimple_lvalue, fb_lvalue | fb_mayfail);
5096 mark_addressable (TREE_VALUE (link));
5097 if (tret == GS_ERROR)
5099 if (EXPR_HAS_LOCATION (TREE_VALUE (link)))
5100 input_location = EXPR_LOCATION (TREE_VALUE (link));
5101 error ("memory input %d is not directly addressable", i);
5107 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
5108 is_gimple_asm_val, fb_rvalue);
5109 if (tret == GS_ERROR)
5113 TREE_CHAIN (link) = NULL_TREE;
5114 VEC_safe_push (tree, gc, inputs, link);
5117 for (link = ASM_CLOBBERS (expr); link; ++i, link = TREE_CHAIN (link))
5118 VEC_safe_push (tree, gc, clobbers, link);
5120 for (link = ASM_LABELS (expr); link; ++i, link = TREE_CHAIN (link))
5121 VEC_safe_push (tree, gc, labels, link);
5123 /* Do not add ASMs with errors to the gimple IL stream. */
5124 if (ret != GS_ERROR)
5126 stmt = gimple_build_asm_vec (TREE_STRING_POINTER (ASM_STRING (expr)),
5127 inputs, outputs, clobbers, labels);
5129 gimple_asm_set_volatile (stmt, ASM_VOLATILE_P (expr));
5130 gimple_asm_set_input (stmt, ASM_INPUT_P (expr));
5132 gimplify_seq_add_stmt (pre_p, stmt);
5138 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
5139 GIMPLE_WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
5140 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
5141 return to this function.
5143 FIXME should we complexify the prequeue handling instead? Or use flags
5144 for all the cleanups and let the optimizer tighten them up? The current
5145 code seems pretty fragile; it will break on a cleanup within any
5146 non-conditional nesting. But any such nesting would be broken, anyway;
5147 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
5148 and continues out of it. We can do that at the RTL level, though, so
5149 having an optimizer to tighten up try/finally regions would be a Good
5152 static enum gimplify_status
5153 gimplify_cleanup_point_expr (tree *expr_p, gimple_seq *pre_p)
5155 gimple_stmt_iterator iter;
5156 gimple_seq body_sequence = NULL;
5158 tree temp = voidify_wrapper_expr (*expr_p, NULL);
5160 /* We only care about the number of conditions between the innermost
5161 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
5162 any cleanups collected outside the CLEANUP_POINT_EXPR. */
5163 int old_conds = gimplify_ctxp->conditions;
5164 gimple_seq old_cleanups = gimplify_ctxp->conditional_cleanups;
5165 gimplify_ctxp->conditions = 0;
5166 gimplify_ctxp->conditional_cleanups = NULL;
5168 gimplify_stmt (&TREE_OPERAND (*expr_p, 0), &body_sequence);
5170 gimplify_ctxp->conditions = old_conds;
5171 gimplify_ctxp->conditional_cleanups = old_cleanups;
5173 for (iter = gsi_start (body_sequence); !gsi_end_p (iter); )
5175 gimple wce = gsi_stmt (iter);
5177 if (gimple_code (wce) == GIMPLE_WITH_CLEANUP_EXPR)
5179 if (gsi_one_before_end_p (iter))
5181 /* Note that gsi_insert_seq_before and gsi_remove do not
5182 scan operands, unlike some other sequence mutators. */
5183 if (!gimple_wce_cleanup_eh_only (wce))
5184 gsi_insert_seq_before_without_update (&iter,
5185 gimple_wce_cleanup (wce),
5187 gsi_remove (&iter, true);
5194 enum gimple_try_flags kind;
5196 if (gimple_wce_cleanup_eh_only (wce))
5197 kind = GIMPLE_TRY_CATCH;
5199 kind = GIMPLE_TRY_FINALLY;
5200 seq = gsi_split_seq_after (iter);
5202 gtry = gimple_build_try (seq, gimple_wce_cleanup (wce), kind);
5203 /* Do not use gsi_replace here, as it may scan operands.
5204 We want to do a simple structural modification only. */
5205 *gsi_stmt_ptr (&iter) = gtry;
5206 iter = gsi_start (seq);
5213 gimplify_seq_add_seq (pre_p, body_sequence);
5226 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
5227 is the cleanup action required. EH_ONLY is true if the cleanup should
5228 only be executed if an exception is thrown, not on normal exit. */
5231 gimple_push_cleanup (tree var, tree cleanup, bool eh_only, gimple_seq *pre_p)
5234 gimple_seq cleanup_stmts = NULL;
5236 /* Errors can result in improperly nested cleanups. Which results in
5237 confusion when trying to resolve the GIMPLE_WITH_CLEANUP_EXPR. */
5241 if (gimple_conditional_context ())
5243 /* If we're in a conditional context, this is more complex. We only
5244 want to run the cleanup if we actually ran the initialization that
5245 necessitates it, but we want to run it after the end of the
5246 conditional context. So we wrap the try/finally around the
5247 condition and use a flag to determine whether or not to actually
5248 run the destructor. Thus
5252 becomes (approximately)
5256 if (test) { A::A(temp); flag = 1; val = f(temp); }
5259 if (flag) A::~A(temp);
5263 tree flag = create_tmp_var (boolean_type_node, "cleanup");
5264 gimple ffalse = gimple_build_assign (flag, boolean_false_node);
5265 gimple ftrue = gimple_build_assign (flag, boolean_true_node);
5267 cleanup = build3 (COND_EXPR, void_type_node, flag, cleanup, NULL);
5268 gimplify_stmt (&cleanup, &cleanup_stmts);
5269 wce = gimple_build_wce (cleanup_stmts);
5271 gimplify_seq_add_stmt (&gimplify_ctxp->conditional_cleanups, ffalse);
5272 gimplify_seq_add_stmt (&gimplify_ctxp->conditional_cleanups, wce);
5273 gimplify_seq_add_stmt (pre_p, ftrue);
5275 /* Because of this manipulation, and the EH edges that jump
5276 threading cannot redirect, the temporary (VAR) will appear
5277 to be used uninitialized. Don't warn. */
5278 TREE_NO_WARNING (var) = 1;
5282 gimplify_stmt (&cleanup, &cleanup_stmts);
5283 wce = gimple_build_wce (cleanup_stmts);
5284 gimple_wce_set_cleanup_eh_only (wce, eh_only);
5285 gimplify_seq_add_stmt (pre_p, wce);
5289 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
5291 static enum gimplify_status
5292 gimplify_target_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
5294 tree targ = *expr_p;
5295 tree temp = TARGET_EXPR_SLOT (targ);
5296 tree init = TARGET_EXPR_INITIAL (targ);
5297 enum gimplify_status ret;
5301 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
5302 to the temps list. Handle also variable length TARGET_EXPRs. */
5303 if (TREE_CODE (DECL_SIZE (temp)) != INTEGER_CST)
5305 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (temp)))
5306 gimplify_type_sizes (TREE_TYPE (temp), pre_p);
5307 gimplify_vla_decl (temp, pre_p);
5310 gimple_add_tmp_var (temp);
5312 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
5313 expression is supposed to initialize the slot. */
5314 if (VOID_TYPE_P (TREE_TYPE (init)))
5315 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
5318 tree init_expr = build2 (INIT_EXPR, void_type_node, temp, init);
5320 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
5322 ggc_free (init_expr);
5324 if (ret == GS_ERROR)
5326 /* PR c++/28266 Make sure this is expanded only once. */
5327 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
5331 gimplify_and_add (init, pre_p);
5333 /* If needed, push the cleanup for the temp. */
5334 if (TARGET_EXPR_CLEANUP (targ))
5335 gimple_push_cleanup (temp, TARGET_EXPR_CLEANUP (targ),
5336 CLEANUP_EH_ONLY (targ), pre_p);
5338 /* Only expand this once. */
5339 TREE_OPERAND (targ, 3) = init;
5340 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
5343 /* We should have expanded this before. */
5344 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp));
5350 /* Gimplification of expression trees. */
5352 /* Gimplify an expression which appears at statement context. The
5353 corresponding GIMPLE statements are added to *SEQ_P. If *SEQ_P is
5354 NULL, a new sequence is allocated.
5356 Return true if we actually added a statement to the queue. */
5359 gimplify_stmt (tree *stmt_p, gimple_seq *seq_p)
5361 gimple_seq_node last;
5364 *seq_p = gimple_seq_alloc ();
5366 last = gimple_seq_last (*seq_p);
5367 gimplify_expr (stmt_p, seq_p, NULL, is_gimple_stmt, fb_none);
5368 return last != gimple_seq_last (*seq_p);
5372 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
5373 to CTX. If entries already exist, force them to be some flavor of private.
5374 If there is no enclosing parallel, do nothing. */
5377 omp_firstprivatize_variable (struct gimplify_omp_ctx *ctx, tree decl)
5381 if (decl == NULL || !DECL_P (decl))
5386 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5389 if (n->value & GOVD_SHARED)
5390 n->value = GOVD_FIRSTPRIVATE | (n->value & GOVD_SEEN);
5394 else if (ctx->region_type != ORT_WORKSHARE)
5395 omp_add_variable (ctx, decl, GOVD_FIRSTPRIVATE);
5397 ctx = ctx->outer_context;
5402 /* Similarly for each of the type sizes of TYPE. */
5405 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx *ctx, tree type)
5407 if (type == NULL || type == error_mark_node)
5409 type = TYPE_MAIN_VARIANT (type);
5411 if (pointer_set_insert (ctx->privatized_types, type))
5414 switch (TREE_CODE (type))
5420 case FIXED_POINT_TYPE:
5421 omp_firstprivatize_variable (ctx, TYPE_MIN_VALUE (type));
5422 omp_firstprivatize_variable (ctx, TYPE_MAX_VALUE (type));
5426 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
5427 omp_firstprivatize_type_sizes (ctx, TYPE_DOMAIN (type));
5432 case QUAL_UNION_TYPE:
5435 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
5436 if (TREE_CODE (field) == FIELD_DECL)
5438 omp_firstprivatize_variable (ctx, DECL_FIELD_OFFSET (field));
5439 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (field));
5445 case REFERENCE_TYPE:
5446 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
5453 omp_firstprivatize_variable (ctx, TYPE_SIZE (type));
5454 omp_firstprivatize_variable (ctx, TYPE_SIZE_UNIT (type));
5455 lang_hooks.types.omp_firstprivatize_type_sizes (ctx, type);
5458 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
5461 omp_add_variable (struct gimplify_omp_ctx *ctx, tree decl, unsigned int flags)
5464 unsigned int nflags;
5467 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5470 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
5471 there are constructors involved somewhere. */
5472 if (TREE_ADDRESSABLE (TREE_TYPE (decl))
5473 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
5476 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5479 /* We shouldn't be re-adding the decl with the same data
5481 gcc_assert ((n->value & GOVD_DATA_SHARE_CLASS & flags) == 0);
5482 /* The only combination of data sharing classes we should see is
5483 FIRSTPRIVATE and LASTPRIVATE. */
5484 nflags = n->value | flags;
5485 gcc_assert ((nflags & GOVD_DATA_SHARE_CLASS)
5486 == (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE));
5491 /* When adding a variable-sized variable, we have to handle all sorts
5492 of additional bits of data: the pointer replacement variable, and
5493 the parameters of the type. */
5494 if (DECL_SIZE (decl) && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
5496 /* Add the pointer replacement variable as PRIVATE if the variable
5497 replacement is private, else FIRSTPRIVATE since we'll need the
5498 address of the original variable either for SHARED, or for the
5499 copy into or out of the context. */
5500 if (!(flags & GOVD_LOCAL))
5502 nflags = flags & GOVD_PRIVATE ? GOVD_PRIVATE : GOVD_FIRSTPRIVATE;
5503 nflags |= flags & GOVD_SEEN;
5504 t = DECL_VALUE_EXPR (decl);
5505 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
5506 t = TREE_OPERAND (t, 0);
5507 gcc_assert (DECL_P (t));
5508 omp_add_variable (ctx, t, nflags);
5511 /* Add all of the variable and type parameters (which should have
5512 been gimplified to a formal temporary) as FIRSTPRIVATE. */
5513 omp_firstprivatize_variable (ctx, DECL_SIZE_UNIT (decl));
5514 omp_firstprivatize_variable (ctx, DECL_SIZE (decl));
5515 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
5517 /* The variable-sized variable itself is never SHARED, only some form
5518 of PRIVATE. The sharing would take place via the pointer variable
5519 which we remapped above. */
5520 if (flags & GOVD_SHARED)
5521 flags = GOVD_PRIVATE | GOVD_DEBUG_PRIVATE
5522 | (flags & (GOVD_SEEN | GOVD_EXPLICIT));
5524 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
5525 alloca statement we generate for the variable, so make sure it
5526 is available. This isn't automatically needed for the SHARED
5527 case, since we won't be allocating local storage then.
5528 For local variables TYPE_SIZE_UNIT might not be gimplified yet,
5529 in this case omp_notice_variable will be called later
5530 on when it is gimplified. */
5531 else if (! (flags & GOVD_LOCAL)
5532 && DECL_P (TYPE_SIZE_UNIT (TREE_TYPE (decl))))
5533 omp_notice_variable (ctx, TYPE_SIZE_UNIT (TREE_TYPE (decl)), true);
5535 else if (lang_hooks.decls.omp_privatize_by_reference (decl))
5537 gcc_assert ((flags & GOVD_LOCAL) == 0);
5538 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
5540 /* Similar to the direct variable sized case above, we'll need the
5541 size of references being privatized. */
5542 if ((flags & GOVD_SHARED) == 0)
5544 t = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl)));
5545 if (TREE_CODE (t) != INTEGER_CST)
5546 omp_notice_variable (ctx, t, true);
5550 splay_tree_insert (ctx->variables, (splay_tree_key)decl, flags);
5553 /* Notice a threadprivate variable DECL used in OpenMP context CTX.
5554 This just prints out diagnostics about threadprivate variable uses
5555 in untied tasks. If DECL2 is non-NULL, prevent this warning
5556 on that variable. */
5559 omp_notice_threadprivate_variable (struct gimplify_omp_ctx *ctx, tree decl,
5564 if (ctx->region_type != ORT_UNTIED_TASK)
5566 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5569 error ("threadprivate variable %qE used in untied task", DECL_NAME (decl));
5570 error_at (ctx->location, "enclosing task");
5571 splay_tree_insert (ctx->variables, (splay_tree_key)decl, 0);
5574 splay_tree_insert (ctx->variables, (splay_tree_key)decl2, 0);
5578 /* Record the fact that DECL was used within the OpenMP context CTX.
5579 IN_CODE is true when real code uses DECL, and false when we should
5580 merely emit default(none) errors. Return true if DECL is going to
5581 be remapped and thus DECL shouldn't be gimplified into its
5582 DECL_VALUE_EXPR (if any). */
5585 omp_notice_variable (struct gimplify_omp_ctx *ctx, tree decl, bool in_code)
5588 unsigned flags = in_code ? GOVD_SEEN : 0;
5589 bool ret = false, shared;
5591 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5594 /* Threadprivate variables are predetermined. */
5595 if (is_global_var (decl))
5597 if (DECL_THREAD_LOCAL_P (decl))
5598 return omp_notice_threadprivate_variable (ctx, decl, NULL_TREE);
5600 if (DECL_HAS_VALUE_EXPR_P (decl))
5602 tree value = get_base_address (DECL_VALUE_EXPR (decl));
5604 if (value && DECL_P (value) && DECL_THREAD_LOCAL_P (value))
5605 return omp_notice_threadprivate_variable (ctx, decl, value);
5609 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5612 enum omp_clause_default_kind default_kind, kind;
5613 struct gimplify_omp_ctx *octx;
5615 if (ctx->region_type == ORT_WORKSHARE)
5618 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
5619 remapped firstprivate instead of shared. To some extent this is
5620 addressed in omp_firstprivatize_type_sizes, but not effectively. */
5621 default_kind = ctx->default_kind;
5622 kind = lang_hooks.decls.omp_predetermined_sharing (decl);
5623 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
5624 default_kind = kind;
5626 switch (default_kind)
5628 case OMP_CLAUSE_DEFAULT_NONE:
5629 error ("%qE not specified in enclosing parallel",
5630 DECL_NAME (lang_hooks.decls.omp_report_decl (decl)));
5631 if ((ctx->region_type & ORT_TASK) != 0)
5632 error_at (ctx->location, "enclosing task");
5634 error_at (ctx->location, "enclosing parallel");
5636 case OMP_CLAUSE_DEFAULT_SHARED:
5637 flags |= GOVD_SHARED;
5639 case OMP_CLAUSE_DEFAULT_PRIVATE:
5640 flags |= GOVD_PRIVATE;
5642 case OMP_CLAUSE_DEFAULT_FIRSTPRIVATE:
5643 flags |= GOVD_FIRSTPRIVATE;
5645 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
5646 /* decl will be either GOVD_FIRSTPRIVATE or GOVD_SHARED. */
5647 gcc_assert ((ctx->region_type & ORT_TASK) != 0);
5648 if (ctx->outer_context)
5649 omp_notice_variable (ctx->outer_context, decl, in_code);
5650 for (octx = ctx->outer_context; octx; octx = octx->outer_context)
5654 n2 = splay_tree_lookup (octx->variables, (splay_tree_key) decl);
5655 if (n2 && (n2->value & GOVD_DATA_SHARE_CLASS) != GOVD_SHARED)
5657 flags |= GOVD_FIRSTPRIVATE;
5660 if ((octx->region_type & ORT_PARALLEL) != 0)
5663 if (flags & GOVD_FIRSTPRIVATE)
5666 && (TREE_CODE (decl) == PARM_DECL
5667 || (!is_global_var (decl)
5668 && DECL_CONTEXT (decl) == current_function_decl)))
5670 flags |= GOVD_FIRSTPRIVATE;
5673 flags |= GOVD_SHARED;
5679 if ((flags & GOVD_PRIVATE)
5680 && lang_hooks.decls.omp_private_outer_ref (decl))
5681 flags |= GOVD_PRIVATE_OUTER_REF;
5683 omp_add_variable (ctx, decl, flags);
5685 shared = (flags & GOVD_SHARED) != 0;
5686 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
5690 if ((n->value & (GOVD_SEEN | GOVD_LOCAL)) == 0
5691 && (flags & (GOVD_SEEN | GOVD_LOCAL)) == GOVD_SEEN
5693 && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
5696 tree t = DECL_VALUE_EXPR (decl);
5697 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
5698 t = TREE_OPERAND (t, 0);
5699 gcc_assert (DECL_P (t));
5700 n2 = splay_tree_lookup (ctx->variables, (splay_tree_key) t);
5701 n2->value |= GOVD_SEEN;
5704 shared = ((flags | n->value) & GOVD_SHARED) != 0;
5705 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
5707 /* If nothing changed, there's nothing left to do. */
5708 if ((n->value & flags) == flags)
5714 /* If the variable is private in the current context, then we don't
5715 need to propagate anything to an outer context. */
5716 if ((flags & GOVD_PRIVATE) && !(flags & GOVD_PRIVATE_OUTER_REF))
5718 if (ctx->outer_context
5719 && omp_notice_variable (ctx->outer_context, decl, in_code))
5724 /* Verify that DECL is private within CTX. If there's specific information
5725 to the contrary in the innermost scope, generate an error. */
5728 omp_is_private (struct gimplify_omp_ctx *ctx, tree decl)
5732 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5735 if (n->value & GOVD_SHARED)
5737 if (ctx == gimplify_omp_ctxp)
5739 error ("iteration variable %qE should be private",
5741 n->value = GOVD_PRIVATE;
5747 else if ((n->value & GOVD_EXPLICIT) != 0
5748 && (ctx == gimplify_omp_ctxp
5749 || (ctx->region_type == ORT_COMBINED_PARALLEL
5750 && gimplify_omp_ctxp->outer_context == ctx)))
5752 if ((n->value & GOVD_FIRSTPRIVATE) != 0)
5753 error ("iteration variable %qE should not be firstprivate",
5755 else if ((n->value & GOVD_REDUCTION) != 0)
5756 error ("iteration variable %qE should not be reduction",
5759 return (ctx == gimplify_omp_ctxp
5760 || (ctx->region_type == ORT_COMBINED_PARALLEL
5761 && gimplify_omp_ctxp->outer_context == ctx));
5764 if (ctx->region_type != ORT_WORKSHARE)
5766 else if (ctx->outer_context)
5767 return omp_is_private (ctx->outer_context, decl);
5771 /* Return true if DECL is private within a parallel region
5772 that binds to the current construct's context or in parallel
5773 region's REDUCTION clause. */
5776 omp_check_private (struct gimplify_omp_ctx *ctx, tree decl)
5782 ctx = ctx->outer_context;
5784 return !(is_global_var (decl)
5785 /* References might be private, but might be shared too. */
5786 || lang_hooks.decls.omp_privatize_by_reference (decl));
5788 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5790 return (n->value & GOVD_SHARED) == 0;
5792 while (ctx->region_type == ORT_WORKSHARE);
5796 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
5797 and previous omp contexts. */
5800 gimplify_scan_omp_clauses (tree *list_p, gimple_seq *pre_p,
5801 enum omp_region_type region_type)
5803 struct gimplify_omp_ctx *ctx, *outer_ctx;
5804 struct gimplify_ctx gctx;
5807 ctx = new_omp_context (region_type);
5808 outer_ctx = ctx->outer_context;
5810 while ((c = *list_p) != NULL)
5812 bool remove = false;
5813 bool notice_outer = true;
5814 const char *check_non_private = NULL;
5818 switch (OMP_CLAUSE_CODE (c))
5820 case OMP_CLAUSE_PRIVATE:
5821 flags = GOVD_PRIVATE | GOVD_EXPLICIT;
5822 if (lang_hooks.decls.omp_private_outer_ref (OMP_CLAUSE_DECL (c)))
5824 flags |= GOVD_PRIVATE_OUTER_REF;
5825 OMP_CLAUSE_PRIVATE_OUTER_REF (c) = 1;
5828 notice_outer = false;
5830 case OMP_CLAUSE_SHARED:
5831 flags = GOVD_SHARED | GOVD_EXPLICIT;
5833 case OMP_CLAUSE_FIRSTPRIVATE:
5834 flags = GOVD_FIRSTPRIVATE | GOVD_EXPLICIT;
5835 check_non_private = "firstprivate";
5837 case OMP_CLAUSE_LASTPRIVATE:
5838 flags = GOVD_LASTPRIVATE | GOVD_SEEN | GOVD_EXPLICIT;
5839 check_non_private = "lastprivate";
5841 case OMP_CLAUSE_REDUCTION:
5842 flags = GOVD_REDUCTION | GOVD_SEEN | GOVD_EXPLICIT;
5843 check_non_private = "reduction";
5847 decl = OMP_CLAUSE_DECL (c);
5848 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5853 omp_add_variable (ctx, decl, flags);
5854 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION
5855 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c))
5857 omp_add_variable (ctx, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c),
5858 GOVD_LOCAL | GOVD_SEEN);
5859 gimplify_omp_ctxp = ctx;
5860 push_gimplify_context (&gctx);
5862 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c) = gimple_seq_alloc ();
5863 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c) = gimple_seq_alloc ();
5865 gimplify_and_add (OMP_CLAUSE_REDUCTION_INIT (c),
5866 &OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c));
5867 pop_gimplify_context
5868 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c)));
5869 push_gimplify_context (&gctx);
5870 gimplify_and_add (OMP_CLAUSE_REDUCTION_MERGE (c),
5871 &OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c));
5872 pop_gimplify_context
5873 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c)));
5874 OMP_CLAUSE_REDUCTION_INIT (c) = NULL_TREE;
5875 OMP_CLAUSE_REDUCTION_MERGE (c) = NULL_TREE;
5877 gimplify_omp_ctxp = outer_ctx;
5879 else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
5880 && OMP_CLAUSE_LASTPRIVATE_STMT (c))
5882 gimplify_omp_ctxp = ctx;
5883 push_gimplify_context (&gctx);
5884 if (TREE_CODE (OMP_CLAUSE_LASTPRIVATE_STMT (c)) != BIND_EXPR)
5886 tree bind = build3 (BIND_EXPR, void_type_node, NULL,
5888 TREE_SIDE_EFFECTS (bind) = 1;
5889 BIND_EXPR_BODY (bind) = OMP_CLAUSE_LASTPRIVATE_STMT (c);
5890 OMP_CLAUSE_LASTPRIVATE_STMT (c) = bind;
5892 gimplify_and_add (OMP_CLAUSE_LASTPRIVATE_STMT (c),
5893 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c));
5894 pop_gimplify_context
5895 (gimple_seq_first_stmt (OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c)));
5896 OMP_CLAUSE_LASTPRIVATE_STMT (c) = NULL_TREE;
5898 gimplify_omp_ctxp = outer_ctx;
5904 case OMP_CLAUSE_COPYIN:
5905 case OMP_CLAUSE_COPYPRIVATE:
5906 decl = OMP_CLAUSE_DECL (c);
5907 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5914 omp_notice_variable (outer_ctx, decl, true);
5915 if (check_non_private
5916 && region_type == ORT_WORKSHARE
5917 && omp_check_private (ctx, decl))
5919 error ("%s variable %qE is private in outer context",
5920 check_non_private, DECL_NAME (decl));
5926 OMP_CLAUSE_OPERAND (c, 0)
5927 = gimple_boolify (OMP_CLAUSE_OPERAND (c, 0));
5930 case OMP_CLAUSE_SCHEDULE:
5931 case OMP_CLAUSE_NUM_THREADS:
5932 if (gimplify_expr (&OMP_CLAUSE_OPERAND (c, 0), pre_p, NULL,
5933 is_gimple_val, fb_rvalue) == GS_ERROR)
5937 case OMP_CLAUSE_NOWAIT:
5938 case OMP_CLAUSE_ORDERED:
5939 case OMP_CLAUSE_UNTIED:
5940 case OMP_CLAUSE_COLLAPSE:
5943 case OMP_CLAUSE_DEFAULT:
5944 ctx->default_kind = OMP_CLAUSE_DEFAULT_KIND (c);
5952 *list_p = OMP_CLAUSE_CHAIN (c);
5954 list_p = &OMP_CLAUSE_CHAIN (c);
5957 gimplify_omp_ctxp = ctx;
5960 /* For all variables that were not actually used within the context,
5961 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
5964 gimplify_adjust_omp_clauses_1 (splay_tree_node n, void *data)
5966 tree *list_p = (tree *) data;
5967 tree decl = (tree) n->key;
5968 unsigned flags = n->value;
5969 enum omp_clause_code code;
5973 if (flags & (GOVD_EXPLICIT | GOVD_LOCAL))
5975 if ((flags & GOVD_SEEN) == 0)
5977 if (flags & GOVD_DEBUG_PRIVATE)
5979 gcc_assert ((flags & GOVD_DATA_SHARE_CLASS) == GOVD_PRIVATE);
5980 private_debug = true;
5984 = lang_hooks.decls.omp_private_debug_clause (decl,
5985 !!(flags & GOVD_SHARED));
5987 code = OMP_CLAUSE_PRIVATE;
5988 else if (flags & GOVD_SHARED)
5990 if (is_global_var (decl))
5992 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp->outer_context;
5996 = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5997 if (on && (on->value & (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE
5998 | GOVD_PRIVATE | GOVD_REDUCTION)) != 0)
6000 ctx = ctx->outer_context;
6005 code = OMP_CLAUSE_SHARED;
6007 else if (flags & GOVD_PRIVATE)
6008 code = OMP_CLAUSE_PRIVATE;
6009 else if (flags & GOVD_FIRSTPRIVATE)
6010 code = OMP_CLAUSE_FIRSTPRIVATE;
6014 clause = build_omp_clause (input_location, code);
6015 OMP_CLAUSE_DECL (clause) = decl;
6016 OMP_CLAUSE_CHAIN (clause) = *list_p;
6018 OMP_CLAUSE_PRIVATE_DEBUG (clause) = 1;
6019 else if (code == OMP_CLAUSE_PRIVATE && (flags & GOVD_PRIVATE_OUTER_REF))
6020 OMP_CLAUSE_PRIVATE_OUTER_REF (clause) = 1;
6022 lang_hooks.decls.omp_finish_clause (clause);
6028 gimplify_adjust_omp_clauses (tree *list_p)
6030 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
6033 while ((c = *list_p) != NULL)
6036 bool remove = false;
6038 switch (OMP_CLAUSE_CODE (c))
6040 case OMP_CLAUSE_PRIVATE:
6041 case OMP_CLAUSE_SHARED:
6042 case OMP_CLAUSE_FIRSTPRIVATE:
6043 decl = OMP_CLAUSE_DECL (c);
6044 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
6045 remove = !(n->value & GOVD_SEEN);
6048 bool shared = OMP_CLAUSE_CODE (c) == OMP_CLAUSE_SHARED;
6049 if ((n->value & GOVD_DEBUG_PRIVATE)
6050 || lang_hooks.decls.omp_private_debug_clause (decl, shared))
6052 gcc_assert ((n->value & GOVD_DEBUG_PRIVATE) == 0
6053 || ((n->value & GOVD_DATA_SHARE_CLASS)
6055 OMP_CLAUSE_SET_CODE (c, OMP_CLAUSE_PRIVATE);
6056 OMP_CLAUSE_PRIVATE_DEBUG (c) = 1;
6061 case OMP_CLAUSE_LASTPRIVATE:
6062 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
6063 accurately reflect the presence of a FIRSTPRIVATE clause. */
6064 decl = OMP_CLAUSE_DECL (c);
6065 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
6066 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)
6067 = (n->value & GOVD_FIRSTPRIVATE) != 0;
6070 case OMP_CLAUSE_REDUCTION:
6071 case OMP_CLAUSE_COPYIN:
6072 case OMP_CLAUSE_COPYPRIVATE:
6074 case OMP_CLAUSE_NUM_THREADS:
6075 case OMP_CLAUSE_SCHEDULE:
6076 case OMP_CLAUSE_NOWAIT:
6077 case OMP_CLAUSE_ORDERED:
6078 case OMP_CLAUSE_DEFAULT:
6079 case OMP_CLAUSE_UNTIED:
6080 case OMP_CLAUSE_COLLAPSE:
6088 *list_p = OMP_CLAUSE_CHAIN (c);
6090 list_p = &OMP_CLAUSE_CHAIN (c);
6093 /* Add in any implicit data sharing. */
6094 splay_tree_foreach (ctx->variables, gimplify_adjust_omp_clauses_1, list_p);
6096 gimplify_omp_ctxp = ctx->outer_context;
6097 delete_omp_context (ctx);
6100 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
6101 gimplification of the body, as well as scanning the body for used
6102 variables. We need to do this scan now, because variable-sized
6103 decls will be decomposed during gimplification. */
6106 gimplify_omp_parallel (tree *expr_p, gimple_seq *pre_p)
6108 tree expr = *expr_p;
6110 gimple_seq body = NULL;
6111 struct gimplify_ctx gctx;
6113 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr), pre_p,
6114 OMP_PARALLEL_COMBINED (expr)
6115 ? ORT_COMBINED_PARALLEL
6118 push_gimplify_context (&gctx);
6120 g = gimplify_and_return_first (OMP_PARALLEL_BODY (expr), &body);
6121 if (gimple_code (g) == GIMPLE_BIND)
6122 pop_gimplify_context (g);
6124 pop_gimplify_context (NULL);
6126 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr));
6128 g = gimple_build_omp_parallel (body,
6129 OMP_PARALLEL_CLAUSES (expr),
6130 NULL_TREE, NULL_TREE);
6131 if (OMP_PARALLEL_COMBINED (expr))
6132 gimple_omp_set_subcode (g, GF_OMP_PARALLEL_COMBINED);
6133 gimplify_seq_add_stmt (pre_p, g);
6134 *expr_p = NULL_TREE;
6137 /* Gimplify the contents of an OMP_TASK statement. This involves
6138 gimplification of the body, as well as scanning the body for used
6139 variables. We need to do this scan now, because variable-sized
6140 decls will be decomposed during gimplification. */
6143 gimplify_omp_task (tree *expr_p, gimple_seq *pre_p)
6145 tree expr = *expr_p;
6147 gimple_seq body = NULL;
6148 struct gimplify_ctx gctx;
6150 gimplify_scan_omp_clauses (&OMP_TASK_CLAUSES (expr), pre_p,
6151 find_omp_clause (OMP_TASK_CLAUSES (expr),
6153 ? ORT_UNTIED_TASK : ORT_TASK);
6155 push_gimplify_context (&gctx);
6157 g = gimplify_and_return_first (OMP_TASK_BODY (expr), &body);
6158 if (gimple_code (g) == GIMPLE_BIND)
6159 pop_gimplify_context (g);
6161 pop_gimplify_context (NULL);
6163 gimplify_adjust_omp_clauses (&OMP_TASK_CLAUSES (expr));
6165 g = gimple_build_omp_task (body,
6166 OMP_TASK_CLAUSES (expr),
6167 NULL_TREE, NULL_TREE,
6168 NULL_TREE, NULL_TREE, NULL_TREE);
6169 gimplify_seq_add_stmt (pre_p, g);
6170 *expr_p = NULL_TREE;
6173 /* Gimplify the gross structure of an OMP_FOR statement. */
6175 static enum gimplify_status
6176 gimplify_omp_for (tree *expr_p, gimple_seq *pre_p)
6178 tree for_stmt, decl, var, t;
6179 enum gimplify_status ret = GS_ALL_DONE;
6180 enum gimplify_status tret;
6182 gimple_seq for_body, for_pre_body;
6187 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt), pre_p,
6190 /* Handle OMP_FOR_INIT. */
6191 for_pre_body = NULL;
6192 gimplify_and_add (OMP_FOR_PRE_BODY (for_stmt), &for_pre_body);
6193 OMP_FOR_PRE_BODY (for_stmt) = NULL_TREE;
6195 for_body = gimple_seq_alloc ();
6196 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt))
6197 == TREE_VEC_LENGTH (OMP_FOR_COND (for_stmt)));
6198 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt))
6199 == TREE_VEC_LENGTH (OMP_FOR_INCR (for_stmt)));
6200 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)); i++)
6202 t = TREE_VEC_ELT (OMP_FOR_INIT (for_stmt), i);
6203 gcc_assert (TREE_CODE (t) == MODIFY_EXPR);
6204 decl = TREE_OPERAND (t, 0);
6205 gcc_assert (DECL_P (decl));
6206 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl))
6207 || POINTER_TYPE_P (TREE_TYPE (decl)));
6209 /* Make sure the iteration variable is private. */
6210 if (omp_is_private (gimplify_omp_ctxp, decl))
6211 omp_notice_variable (gimplify_omp_ctxp, decl, true);
6213 omp_add_variable (gimplify_omp_ctxp, decl, GOVD_PRIVATE | GOVD_SEEN);
6215 /* If DECL is not a gimple register, create a temporary variable to act
6216 as an iteration counter. This is valid, since DECL cannot be
6217 modified in the body of the loop. */
6218 if (!is_gimple_reg (decl))
6220 var = create_tmp_var (TREE_TYPE (decl), get_name (decl));
6221 TREE_OPERAND (t, 0) = var;
6223 gimplify_seq_add_stmt (&for_body, gimple_build_assign (decl, var));
6225 omp_add_variable (gimplify_omp_ctxp, var, GOVD_PRIVATE | GOVD_SEEN);
6230 tret = gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
6231 is_gimple_val, fb_rvalue);
6232 ret = MIN (ret, tret);
6233 if (ret == GS_ERROR)
6236 /* Handle OMP_FOR_COND. */
6237 t = TREE_VEC_ELT (OMP_FOR_COND (for_stmt), i);
6238 gcc_assert (COMPARISON_CLASS_P (t));
6239 gcc_assert (TREE_OPERAND (t, 0) == decl);
6241 tret = gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
6242 is_gimple_val, fb_rvalue);
6243 ret = MIN (ret, tret);
6245 /* Handle OMP_FOR_INCR. */
6246 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6247 switch (TREE_CODE (t))
6249 case PREINCREMENT_EXPR:
6250 case POSTINCREMENT_EXPR:
6251 t = build_int_cst (TREE_TYPE (decl), 1);
6252 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
6253 t = build2 (MODIFY_EXPR, TREE_TYPE (var), var, t);
6254 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i) = t;
6257 case PREDECREMENT_EXPR:
6258 case POSTDECREMENT_EXPR:
6259 t = build_int_cst (TREE_TYPE (decl), -1);
6260 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
6261 t = build2 (MODIFY_EXPR, TREE_TYPE (var), var, t);
6262 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i) = t;
6266 gcc_assert (TREE_OPERAND (t, 0) == decl);
6267 TREE_OPERAND (t, 0) = var;
6269 t = TREE_OPERAND (t, 1);
6270 switch (TREE_CODE (t))
6273 if (TREE_OPERAND (t, 1) == decl)
6275 TREE_OPERAND (t, 1) = TREE_OPERAND (t, 0);
6276 TREE_OPERAND (t, 0) = var;
6282 case POINTER_PLUS_EXPR:
6283 gcc_assert (TREE_OPERAND (t, 0) == decl);
6284 TREE_OPERAND (t, 0) = var;
6290 tret = gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
6291 is_gimple_val, fb_rvalue);
6292 ret = MIN (ret, tret);
6299 if (var != decl || TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)) > 1)
6302 for (c = OMP_FOR_CLAUSES (for_stmt); c ; c = OMP_CLAUSE_CHAIN (c))
6303 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
6304 && OMP_CLAUSE_DECL (c) == decl
6305 && OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c) == NULL)
6307 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6308 gcc_assert (TREE_CODE (t) == MODIFY_EXPR);
6309 gcc_assert (TREE_OPERAND (t, 0) == var);
6310 t = TREE_OPERAND (t, 1);
6311 gcc_assert (TREE_CODE (t) == PLUS_EXPR
6312 || TREE_CODE (t) == MINUS_EXPR
6313 || TREE_CODE (t) == POINTER_PLUS_EXPR);
6314 gcc_assert (TREE_OPERAND (t, 0) == var);
6315 t = build2 (TREE_CODE (t), TREE_TYPE (decl), decl,
6316 TREE_OPERAND (t, 1));
6317 gimplify_assign (decl, t,
6318 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c));
6323 gimplify_and_add (OMP_FOR_BODY (for_stmt), &for_body);
6325 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt));
6327 gfor = gimple_build_omp_for (for_body, OMP_FOR_CLAUSES (for_stmt),
6328 TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)),
6331 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)); i++)
6333 t = TREE_VEC_ELT (OMP_FOR_INIT (for_stmt), i);
6334 gimple_omp_for_set_index (gfor, i, TREE_OPERAND (t, 0));
6335 gimple_omp_for_set_initial (gfor, i, TREE_OPERAND (t, 1));
6336 t = TREE_VEC_ELT (OMP_FOR_COND (for_stmt), i);
6337 gimple_omp_for_set_cond (gfor, i, TREE_CODE (t));
6338 gimple_omp_for_set_final (gfor, i, TREE_OPERAND (t, 1));
6339 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6340 gimple_omp_for_set_incr (gfor, i, TREE_OPERAND (t, 1));
6343 gimplify_seq_add_stmt (pre_p, gfor);
6344 return ret == GS_ALL_DONE ? GS_ALL_DONE : GS_ERROR;
6347 /* Gimplify the gross structure of other OpenMP worksharing constructs.
6348 In particular, OMP_SECTIONS and OMP_SINGLE. */
6351 gimplify_omp_workshare (tree *expr_p, gimple_seq *pre_p)
6353 tree expr = *expr_p;
6355 gimple_seq body = NULL;
6357 gimplify_scan_omp_clauses (&OMP_CLAUSES (expr), pre_p, ORT_WORKSHARE);
6358 gimplify_and_add (OMP_BODY (expr), &body);
6359 gimplify_adjust_omp_clauses (&OMP_CLAUSES (expr));
6361 if (TREE_CODE (expr) == OMP_SECTIONS)
6362 stmt = gimple_build_omp_sections (body, OMP_CLAUSES (expr));
6363 else if (TREE_CODE (expr) == OMP_SINGLE)
6364 stmt = gimple_build_omp_single (body, OMP_CLAUSES (expr));
6368 gimplify_seq_add_stmt (pre_p, stmt);
6371 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
6372 stabilized the lhs of the atomic operation as *ADDR. Return true if
6373 EXPR is this stabilized form. */
6376 goa_lhs_expr_p (tree expr, tree addr)
6378 /* Also include casts to other type variants. The C front end is fond
6379 of adding these for e.g. volatile variables. This is like
6380 STRIP_TYPE_NOPS but includes the main variant lookup. */
6381 STRIP_USELESS_TYPE_CONVERSION (expr);
6383 if (TREE_CODE (expr) == INDIRECT_REF)
6385 expr = TREE_OPERAND (expr, 0);
6387 && (CONVERT_EXPR_P (expr)
6388 || TREE_CODE (expr) == NON_LVALUE_EXPR)
6389 && TREE_CODE (expr) == TREE_CODE (addr)
6390 && types_compatible_p (TREE_TYPE (expr), TREE_TYPE (addr)))
6392 expr = TREE_OPERAND (expr, 0);
6393 addr = TREE_OPERAND (addr, 0);
6397 return (TREE_CODE (addr) == ADDR_EXPR
6398 && TREE_CODE (expr) == ADDR_EXPR
6399 && TREE_OPERAND (addr, 0) == TREE_OPERAND (expr, 0));
6401 if (TREE_CODE (addr) == ADDR_EXPR && expr == TREE_OPERAND (addr, 0))
6406 /* Walk *EXPR_P and replace
6407 appearances of *LHS_ADDR with LHS_VAR. If an expression does not involve
6408 the lhs, evaluate it into a temporary. Return 1 if the lhs appeared as
6409 a subexpression, 0 if it did not, or -1 if an error was encountered. */
6412 goa_stabilize_expr (tree *expr_p, gimple_seq *pre_p, tree lhs_addr,
6415 tree expr = *expr_p;
6418 if (goa_lhs_expr_p (expr, lhs_addr))
6423 if (is_gimple_val (expr))
6427 switch (TREE_CODE_CLASS (TREE_CODE (expr)))
6430 case tcc_comparison:
6431 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p, lhs_addr,
6434 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p, lhs_addr,
6437 case tcc_expression:
6438 switch (TREE_CODE (expr))
6440 case TRUTH_ANDIF_EXPR:
6441 case TRUTH_ORIF_EXPR:
6442 case TRUTH_AND_EXPR:
6444 case TRUTH_XOR_EXPR:
6445 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p,
6447 case TRUTH_NOT_EXPR:
6448 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p,
6461 enum gimplify_status gs;
6462 gs = gimplify_expr (expr_p, pre_p, NULL, is_gimple_val, fb_rvalue);
6463 if (gs != GS_ALL_DONE)
6471 /* Gimplify an OMP_ATOMIC statement. */
6473 static enum gimplify_status
6474 gimplify_omp_atomic (tree *expr_p, gimple_seq *pre_p)
6476 tree addr = TREE_OPERAND (*expr_p, 0);
6477 tree rhs = TREE_OPERAND (*expr_p, 1);
6478 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr)));
6481 tmp_load = create_tmp_reg (type, NULL);
6482 if (goa_stabilize_expr (&rhs, pre_p, addr, tmp_load) < 0)
6485 if (gimplify_expr (&addr, pre_p, NULL, is_gimple_val, fb_rvalue)
6489 gimplify_seq_add_stmt (pre_p, gimple_build_omp_atomic_load (tmp_load, addr));
6490 if (gimplify_expr (&rhs, pre_p, NULL, is_gimple_val, fb_rvalue)
6493 gimplify_seq_add_stmt (pre_p, gimple_build_omp_atomic_store (rhs));
6500 /* Converts the GENERIC expression tree *EXPR_P to GIMPLE. If the
6501 expression produces a value to be used as an operand inside a GIMPLE
6502 statement, the value will be stored back in *EXPR_P. This value will
6503 be a tree of class tcc_declaration, tcc_constant, tcc_reference or
6504 an SSA_NAME. The corresponding sequence of GIMPLE statements is
6505 emitted in PRE_P and POST_P.
6507 Additionally, this process may overwrite parts of the input
6508 expression during gimplification. Ideally, it should be
6509 possible to do non-destructive gimplification.
6511 EXPR_P points to the GENERIC expression to convert to GIMPLE. If
6512 the expression needs to evaluate to a value to be used as
6513 an operand in a GIMPLE statement, this value will be stored in
6514 *EXPR_P on exit. This happens when the caller specifies one
6515 of fb_lvalue or fb_rvalue fallback flags.
6517 PRE_P will contain the sequence of GIMPLE statements corresponding
6518 to the evaluation of EXPR and all the side-effects that must
6519 be executed before the main expression. On exit, the last
6520 statement of PRE_P is the core statement being gimplified. For
6521 instance, when gimplifying 'if (++a)' the last statement in
6522 PRE_P will be 'if (t.1)' where t.1 is the result of
6523 pre-incrementing 'a'.
6525 POST_P will contain the sequence of GIMPLE statements corresponding
6526 to the evaluation of all the side-effects that must be executed
6527 after the main expression. If this is NULL, the post
6528 side-effects are stored at the end of PRE_P.
6530 The reason why the output is split in two is to handle post
6531 side-effects explicitly. In some cases, an expression may have
6532 inner and outer post side-effects which need to be emitted in
6533 an order different from the one given by the recursive
6534 traversal. For instance, for the expression (*p--)++ the post
6535 side-effects of '--' must actually occur *after* the post
6536 side-effects of '++'. However, gimplification will first visit
6537 the inner expression, so if a separate POST sequence was not
6538 used, the resulting sequence would be:
6545 However, the post-decrement operation in line #2 must not be
6546 evaluated until after the store to *p at line #4, so the
6547 correct sequence should be:
6554 So, by specifying a separate post queue, it is possible
6555 to emit the post side-effects in the correct order.
6556 If POST_P is NULL, an internal queue will be used. Before
6557 returning to the caller, the sequence POST_P is appended to
6558 the main output sequence PRE_P.
6560 GIMPLE_TEST_F points to a function that takes a tree T and
6561 returns nonzero if T is in the GIMPLE form requested by the
6562 caller. The GIMPLE predicates are in gimple.c.
6564 FALLBACK tells the function what sort of a temporary we want if
6565 gimplification cannot produce an expression that complies with
6568 fb_none means that no temporary should be generated
6569 fb_rvalue means that an rvalue is OK to generate
6570 fb_lvalue means that an lvalue is OK to generate
6571 fb_either means that either is OK, but an lvalue is preferable.
6572 fb_mayfail means that gimplification may fail (in which case
6573 GS_ERROR will be returned)
6575 The return value is either GS_ERROR or GS_ALL_DONE, since this
6576 function iterates until EXPR is completely gimplified or an error
6579 enum gimplify_status
6580 gimplify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
6581 bool (*gimple_test_f) (tree), fallback_t fallback)
6584 gimple_seq internal_pre = NULL;
6585 gimple_seq internal_post = NULL;
6588 location_t saved_location;
6589 enum gimplify_status ret;
6590 gimple_stmt_iterator pre_last_gsi, post_last_gsi;
6592 save_expr = *expr_p;
6593 if (save_expr == NULL_TREE)
6596 /* If we are gimplifying a top-level statement, PRE_P must be valid. */
6597 is_statement = gimple_test_f == is_gimple_stmt;
6601 /* Consistency checks. */
6602 if (gimple_test_f == is_gimple_reg)
6603 gcc_assert (fallback & (fb_rvalue | fb_lvalue));
6604 else if (gimple_test_f == is_gimple_val
6605 || gimple_test_f == is_gimple_call_addr
6606 || gimple_test_f == is_gimple_condexpr
6607 || gimple_test_f == is_gimple_mem_rhs
6608 || gimple_test_f == is_gimple_mem_rhs_or_call
6609 || gimple_test_f == is_gimple_reg_rhs
6610 || gimple_test_f == is_gimple_reg_rhs_or_call
6611 || gimple_test_f == is_gimple_asm_val
6612 || gimple_test_f == is_gimple_mem_ref_addr)
6613 gcc_assert (fallback & fb_rvalue);
6614 else if (gimple_test_f == is_gimple_min_lval
6615 || gimple_test_f == is_gimple_lvalue)
6616 gcc_assert (fallback & fb_lvalue);
6617 else if (gimple_test_f == is_gimple_addressable)
6618 gcc_assert (fallback & fb_either);
6619 else if (gimple_test_f == is_gimple_stmt)
6620 gcc_assert (fallback == fb_none);
6623 /* We should have recognized the GIMPLE_TEST_F predicate to
6624 know what kind of fallback to use in case a temporary is
6625 needed to hold the value or address of *EXPR_P. */
6629 /* We used to check the predicate here and return immediately if it
6630 succeeds. This is wrong; the design is for gimplification to be
6631 idempotent, and for the predicates to only test for valid forms, not
6632 whether they are fully simplified. */
6634 pre_p = &internal_pre;
6637 post_p = &internal_post;
6639 /* Remember the last statements added to PRE_P and POST_P. Every
6640 new statement added by the gimplification helpers needs to be
6641 annotated with location information. To centralize the
6642 responsibility, we remember the last statement that had been
6643 added to both queues before gimplifying *EXPR_P. If
6644 gimplification produces new statements in PRE_P and POST_P, those
6645 statements will be annotated with the same location information
6647 pre_last_gsi = gsi_last (*pre_p);
6648 post_last_gsi = gsi_last (*post_p);
6650 saved_location = input_location;
6651 if (save_expr != error_mark_node
6652 && EXPR_HAS_LOCATION (*expr_p))
6653 input_location = EXPR_LOCATION (*expr_p);
6655 /* Loop over the specific gimplifiers until the toplevel node
6656 remains the same. */
6659 /* Strip away as many useless type conversions as possible
6661 STRIP_USELESS_TYPE_CONVERSION (*expr_p);
6663 /* Remember the expr. */
6664 save_expr = *expr_p;
6666 /* Die, die, die, my darling. */
6667 if (save_expr == error_mark_node
6668 || (TREE_TYPE (save_expr)
6669 && TREE_TYPE (save_expr) == error_mark_node))
6675 /* Do any language-specific gimplification. */
6676 ret = ((enum gimplify_status)
6677 lang_hooks.gimplify_expr (expr_p, pre_p, post_p));
6680 if (*expr_p == NULL_TREE)
6682 if (*expr_p != save_expr)
6685 else if (ret != GS_UNHANDLED)
6688 /* Make sure that all the cases set 'ret' appropriately. */
6690 switch (TREE_CODE (*expr_p))
6692 /* First deal with the special cases. */
6694 case POSTINCREMENT_EXPR:
6695 case POSTDECREMENT_EXPR:
6696 case PREINCREMENT_EXPR:
6697 case PREDECREMENT_EXPR:
6698 ret = gimplify_self_mod_expr (expr_p, pre_p, post_p,
6699 fallback != fb_none);
6703 case ARRAY_RANGE_REF:
6707 case VIEW_CONVERT_EXPR:
6708 ret = gimplify_compound_lval (expr_p, pre_p, post_p,
6709 fallback ? fallback : fb_rvalue);
6713 ret = gimplify_cond_expr (expr_p, pre_p, fallback);
6715 /* C99 code may assign to an array in a structure value of a
6716 conditional expression, and this has undefined behavior
6717 only on execution, so create a temporary if an lvalue is
6719 if (fallback == fb_lvalue)
6721 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6722 mark_addressable (*expr_p);
6728 ret = gimplify_call_expr (expr_p, pre_p, fallback != fb_none);
6730 /* C99 code may assign to an array in a structure returned
6731 from a function, and this has undefined behavior only on
6732 execution, so create a temporary if an lvalue is
6734 if (fallback == fb_lvalue)
6736 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6737 mark_addressable (*expr_p);
6746 ret = gimplify_compound_expr (expr_p, pre_p, fallback != fb_none);
6749 case COMPOUND_LITERAL_EXPR:
6750 ret = gimplify_compound_literal_expr (expr_p, pre_p);
6755 ret = gimplify_modify_expr (expr_p, pre_p, post_p,
6756 fallback != fb_none);
6759 case TRUTH_ANDIF_EXPR:
6760 case TRUTH_ORIF_EXPR:
6761 /* Pass the source location of the outer expression. */
6762 ret = gimplify_boolean_expr (expr_p, saved_location);
6765 case TRUTH_NOT_EXPR:
6766 if (TREE_CODE (TREE_TYPE (*expr_p)) != BOOLEAN_TYPE)
6768 tree type = TREE_TYPE (*expr_p);
6769 *expr_p = fold_convert (type, gimple_boolify (*expr_p));
6774 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6775 is_gimple_val, fb_rvalue);
6776 recalculate_side_effects (*expr_p);
6780 ret = gimplify_addr_expr (expr_p, pre_p, post_p);
6784 ret = gimplify_va_arg_expr (expr_p, pre_p, post_p);
6788 if (IS_EMPTY_STMT (*expr_p))
6794 if (VOID_TYPE_P (TREE_TYPE (*expr_p))
6795 || fallback == fb_none)
6797 /* Just strip a conversion to void (or in void context) and
6799 *expr_p = TREE_OPERAND (*expr_p, 0);
6804 ret = gimplify_conversion (expr_p);
6805 if (ret == GS_ERROR)
6807 if (*expr_p != save_expr)
6811 case FIX_TRUNC_EXPR:
6812 /* unary_expr: ... | '(' cast ')' val | ... */
6813 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6814 is_gimple_val, fb_rvalue);
6815 recalculate_side_effects (*expr_p);
6820 bool volatilep = TREE_THIS_VOLATILE (*expr_p);
6821 bool notrap = TREE_THIS_NOTRAP (*expr_p);
6822 tree saved_ptr_type = TREE_TYPE (TREE_OPERAND (*expr_p, 0));
6824 *expr_p = fold_indirect_ref_loc (input_location, *expr_p);
6825 if (*expr_p != save_expr)
6831 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6832 is_gimple_reg, fb_rvalue);
6833 if (ret == GS_ERROR)
6836 recalculate_side_effects (*expr_p);
6837 *expr_p = fold_build2_loc (input_location, MEM_REF,
6838 TREE_TYPE (*expr_p),
6839 TREE_OPERAND (*expr_p, 0),
6840 build_int_cst (saved_ptr_type, 0));
6841 TREE_THIS_VOLATILE (*expr_p) = volatilep;
6842 TREE_THIS_NOTRAP (*expr_p) = notrap;
6847 /* We arrive here through the various re-gimplifcation paths. */
6849 /* First try re-folding the whole thing. */
6850 tmp = fold_binary (MEM_REF, TREE_TYPE (*expr_p),
6851 TREE_OPERAND (*expr_p, 0),
6852 TREE_OPERAND (*expr_p, 1));
6856 recalculate_side_effects (*expr_p);
6860 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6861 is_gimple_mem_ref_addr, fb_rvalue);
6862 if (ret == GS_ERROR)
6864 recalculate_side_effects (*expr_p);
6868 /* Constants need not be gimplified. */
6879 /* If we require an lvalue, such as for ADDR_EXPR, retain the
6880 CONST_DECL node. Otherwise the decl is replaceable by its
6882 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
6883 if (fallback & fb_lvalue)
6887 *expr_p = DECL_INITIAL (*expr_p);
6893 ret = gimplify_decl_expr (expr_p, pre_p);
6897 ret = gimplify_bind_expr (expr_p, pre_p);
6901 ret = gimplify_loop_expr (expr_p, pre_p);
6905 ret = gimplify_switch_expr (expr_p, pre_p);
6909 ret = gimplify_exit_expr (expr_p);
6913 /* If the target is not LABEL, then it is a computed jump
6914 and the target needs to be gimplified. */
6915 if (TREE_CODE (GOTO_DESTINATION (*expr_p)) != LABEL_DECL)
6917 ret = gimplify_expr (&GOTO_DESTINATION (*expr_p), pre_p,
6918 NULL, is_gimple_val, fb_rvalue);
6919 if (ret == GS_ERROR)
6922 gimplify_seq_add_stmt (pre_p,
6923 gimple_build_goto (GOTO_DESTINATION (*expr_p)));
6928 gimplify_seq_add_stmt (pre_p,
6929 gimple_build_predict (PREDICT_EXPR_PREDICTOR (*expr_p),
6930 PREDICT_EXPR_OUTCOME (*expr_p)));
6936 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p))
6937 == current_function_decl);
6938 gimplify_seq_add_stmt (pre_p,
6939 gimple_build_label (LABEL_EXPR_LABEL (*expr_p)));
6942 case CASE_LABEL_EXPR:
6943 ret = gimplify_case_label_expr (expr_p, pre_p);
6947 ret = gimplify_return_expr (*expr_p, pre_p);
6951 /* Don't reduce this in place; let gimplify_init_constructor work its
6952 magic. Buf if we're just elaborating this for side effects, just
6953 gimplify any element that has side-effects. */
6954 if (fallback == fb_none)
6956 unsigned HOST_WIDE_INT ix;
6958 tree temp = NULL_TREE;
6959 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (*expr_p), ix, val)
6960 if (TREE_SIDE_EFFECTS (val))
6961 append_to_statement_list (val, &temp);
6964 ret = temp ? GS_OK : GS_ALL_DONE;
6966 /* C99 code may assign to an array in a constructed
6967 structure or union, and this has undefined behavior only
6968 on execution, so create a temporary if an lvalue is
6970 else if (fallback == fb_lvalue)
6972 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6973 mark_addressable (*expr_p);
6980 /* The following are special cases that are not handled by the
6981 original GIMPLE grammar. */
6983 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
6986 ret = gimplify_save_expr (expr_p, pre_p, post_p);
6991 enum gimplify_status r0, r1, r2;
6993 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6994 post_p, is_gimple_lvalue, fb_either);
6995 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
6996 post_p, is_gimple_val, fb_rvalue);
6997 r2 = gimplify_expr (&TREE_OPERAND (*expr_p, 2), pre_p,
6998 post_p, is_gimple_val, fb_rvalue);
6999 recalculate_side_effects (*expr_p);
7001 ret = MIN (r0, MIN (r1, r2));
7005 case TARGET_MEM_REF:
7007 enum gimplify_status r0 = GS_ALL_DONE, r1 = GS_ALL_DONE;
7009 if (TMR_BASE (*expr_p))
7010 r0 = gimplify_expr (&TMR_BASE (*expr_p), pre_p,
7011 post_p, is_gimple_mem_ref_addr, fb_either);
7012 if (TMR_INDEX (*expr_p))
7013 r1 = gimplify_expr (&TMR_INDEX (*expr_p), pre_p,
7014 post_p, is_gimple_val, fb_rvalue);
7015 if (TMR_INDEX2 (*expr_p))
7016 r1 = gimplify_expr (&TMR_INDEX2 (*expr_p), pre_p,
7017 post_p, is_gimple_val, fb_rvalue);
7018 /* TMR_STEP and TMR_OFFSET are always integer constants. */
7023 case NON_LVALUE_EXPR:
7024 /* This should have been stripped above. */
7028 ret = gimplify_asm_expr (expr_p, pre_p, post_p);
7031 case TRY_FINALLY_EXPR:
7032 case TRY_CATCH_EXPR:
7034 gimple_seq eval, cleanup;
7037 eval = cleanup = NULL;
7038 gimplify_and_add (TREE_OPERAND (*expr_p, 0), &eval);
7039 gimplify_and_add (TREE_OPERAND (*expr_p, 1), &cleanup);
7040 /* Don't create bogus GIMPLE_TRY with empty cleanup. */
7041 if (gimple_seq_empty_p (cleanup))
7043 gimple_seq_add_seq (pre_p, eval);
7047 try_ = gimple_build_try (eval, cleanup,
7048 TREE_CODE (*expr_p) == TRY_FINALLY_EXPR
7049 ? GIMPLE_TRY_FINALLY
7050 : GIMPLE_TRY_CATCH);
7051 if (TREE_CODE (*expr_p) == TRY_CATCH_EXPR)
7052 gimple_try_set_catch_is_cleanup (try_,
7053 TRY_CATCH_IS_CLEANUP (*expr_p));
7054 gimplify_seq_add_stmt (pre_p, try_);
7059 case CLEANUP_POINT_EXPR:
7060 ret = gimplify_cleanup_point_expr (expr_p, pre_p);
7064 ret = gimplify_target_expr (expr_p, pre_p, post_p);
7070 gimple_seq handler = NULL;
7071 gimplify_and_add (CATCH_BODY (*expr_p), &handler);
7072 c = gimple_build_catch (CATCH_TYPES (*expr_p), handler);
7073 gimplify_seq_add_stmt (pre_p, c);
7078 case EH_FILTER_EXPR:
7081 gimple_seq failure = NULL;
7083 gimplify_and_add (EH_FILTER_FAILURE (*expr_p), &failure);
7084 ehf = gimple_build_eh_filter (EH_FILTER_TYPES (*expr_p), failure);
7085 gimple_set_no_warning (ehf, TREE_NO_WARNING (*expr_p));
7086 gimplify_seq_add_stmt (pre_p, ehf);
7093 enum gimplify_status r0, r1;
7094 r0 = gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p), pre_p,
7095 post_p, is_gimple_val, fb_rvalue);
7096 r1 = gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p), pre_p,
7097 post_p, is_gimple_val, fb_rvalue);
7098 TREE_SIDE_EFFECTS (*expr_p) = 0;
7104 /* We get here when taking the address of a label. We mark
7105 the label as "forced"; meaning it can never be removed and
7106 it is a potential target for any computed goto. */
7107 FORCED_LABEL (*expr_p) = 1;
7111 case STATEMENT_LIST:
7112 ret = gimplify_statement_list (expr_p, pre_p);
7115 case WITH_SIZE_EXPR:
7117 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7118 post_p == &internal_post ? NULL : post_p,
7119 gimple_test_f, fallback);
7120 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
7121 is_gimple_val, fb_rvalue);
7128 ret = gimplify_var_or_parm_decl (expr_p);
7132 /* When within an OpenMP context, notice uses of variables. */
7133 if (gimplify_omp_ctxp)
7134 omp_notice_variable (gimplify_omp_ctxp, *expr_p, true);
7139 /* Allow callbacks into the gimplifier during optimization. */
7144 gimplify_omp_parallel (expr_p, pre_p);
7149 gimplify_omp_task (expr_p, pre_p);
7154 ret = gimplify_omp_for (expr_p, pre_p);
7159 gimplify_omp_workshare (expr_p, pre_p);
7168 gimple_seq body = NULL;
7171 gimplify_and_add (OMP_BODY (*expr_p), &body);
7172 switch (TREE_CODE (*expr_p))
7175 g = gimple_build_omp_section (body);
7178 g = gimple_build_omp_master (body);
7181 g = gimple_build_omp_ordered (body);
7184 g = gimple_build_omp_critical (body,
7185 OMP_CRITICAL_NAME (*expr_p));
7190 gimplify_seq_add_stmt (pre_p, g);
7196 ret = gimplify_omp_atomic (expr_p, pre_p);
7199 case TRUTH_AND_EXPR:
7201 case TRUTH_XOR_EXPR:
7202 /* Classified as tcc_expression. */
7206 /* Classified as tcc_expression. */
7209 case POINTER_PLUS_EXPR:
7210 /* Convert ((type *)A)+offset into &A->field_of_type_and_offset.
7211 The second is gimple immediate saving a need for extra statement.
7213 if (TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
7214 && (tmp = maybe_fold_offset_to_address
7215 (EXPR_LOCATION (*expr_p),
7216 TREE_OPERAND (*expr_p, 0), TREE_OPERAND (*expr_p, 1),
7217 TREE_TYPE (*expr_p))))
7223 /* Convert (void *)&a + 4 into (void *)&a[1]. */
7224 if (TREE_CODE (TREE_OPERAND (*expr_p, 0)) == NOP_EXPR
7225 && TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
7226 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p,
7228 && (tmp = maybe_fold_offset_to_address
7229 (EXPR_LOCATION (*expr_p),
7230 TREE_OPERAND (TREE_OPERAND (*expr_p, 0), 0),
7231 TREE_OPERAND (*expr_p, 1),
7232 TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p, 0),
7235 *expr_p = fold_convert (TREE_TYPE (*expr_p), tmp);
7242 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p)))
7244 case tcc_comparison:
7245 /* Handle comparison of objects of non scalar mode aggregates
7246 with a call to memcmp. It would be nice to only have to do
7247 this for variable-sized objects, but then we'd have to allow
7248 the same nest of reference nodes we allow for MODIFY_EXPR and
7251 Compare scalar mode aggregates as scalar mode values. Using
7252 memcmp for them would be very inefficient at best, and is
7253 plain wrong if bitfields are involved. */
7255 tree type = TREE_TYPE (TREE_OPERAND (*expr_p, 1));
7257 if (!AGGREGATE_TYPE_P (type))
7259 else if (TYPE_MODE (type) != BLKmode)
7260 ret = gimplify_scalar_mode_aggregate_compare (expr_p);
7262 ret = gimplify_variable_sized_compare (expr_p);
7267 /* If *EXPR_P does not need to be special-cased, handle it
7268 according to its class. */
7270 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7271 post_p, is_gimple_val, fb_rvalue);
7277 enum gimplify_status r0, r1;
7279 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7280 post_p, is_gimple_val, fb_rvalue);
7281 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
7282 post_p, is_gimple_val, fb_rvalue);
7290 enum gimplify_status r0, r1, r2;
7292 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7293 post_p, is_gimple_val, fb_rvalue);
7294 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
7295 post_p, is_gimple_val, fb_rvalue);
7296 r2 = gimplify_expr (&TREE_OPERAND (*expr_p, 2), pre_p,
7297 post_p, is_gimple_val, fb_rvalue);
7299 ret = MIN (MIN (r0, r1), r2);
7303 case tcc_declaration:
7306 goto dont_recalculate;
7312 recalculate_side_effects (*expr_p);
7318 gcc_assert (*expr_p || ret != GS_OK);
7320 while (ret == GS_OK);
7322 /* If we encountered an error_mark somewhere nested inside, either
7323 stub out the statement or propagate the error back out. */
7324 if (ret == GS_ERROR)
7331 /* This was only valid as a return value from the langhook, which
7332 we handled. Make sure it doesn't escape from any other context. */
7333 gcc_assert (ret != GS_UNHANDLED);
7335 if (fallback == fb_none && *expr_p && !is_gimple_stmt (*expr_p))
7337 /* We aren't looking for a value, and we don't have a valid
7338 statement. If it doesn't have side-effects, throw it away. */
7339 if (!TREE_SIDE_EFFECTS (*expr_p))
7341 else if (!TREE_THIS_VOLATILE (*expr_p))
7343 /* This is probably a _REF that contains something nested that
7344 has side effects. Recurse through the operands to find it. */
7345 enum tree_code code = TREE_CODE (*expr_p);
7352 case VIEW_CONVERT_EXPR:
7353 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
7354 gimple_test_f, fallback);
7358 case ARRAY_RANGE_REF:
7359 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
7360 gimple_test_f, fallback);
7361 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
7362 gimple_test_f, fallback);
7366 /* Anything else with side-effects must be converted to
7367 a valid statement before we get here. */
7373 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p))
7374 && TYPE_MODE (TREE_TYPE (*expr_p)) != BLKmode)
7376 /* Historically, the compiler has treated a bare reference
7377 to a non-BLKmode volatile lvalue as forcing a load. */
7378 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p));
7380 /* Normally, we do not want to create a temporary for a
7381 TREE_ADDRESSABLE type because such a type should not be
7382 copied by bitwise-assignment. However, we make an
7383 exception here, as all we are doing here is ensuring that
7384 we read the bytes that make up the type. We use
7385 create_tmp_var_raw because create_tmp_var will abort when
7386 given a TREE_ADDRESSABLE type. */
7387 tree tmp = create_tmp_var_raw (type, "vol");
7388 gimple_add_tmp_var (tmp);
7389 gimplify_assign (tmp, *expr_p, pre_p);
7393 /* We can't do anything useful with a volatile reference to
7394 an incomplete type, so just throw it away. Likewise for
7395 a BLKmode type, since any implicit inner load should
7396 already have been turned into an explicit one by the
7397 gimplification process. */
7401 /* If we are gimplifying at the statement level, we're done. Tack
7402 everything together and return. */
7403 if (fallback == fb_none || is_statement)
7405 /* Since *EXPR_P has been converted into a GIMPLE tuple, clear
7406 it out for GC to reclaim it. */
7407 *expr_p = NULL_TREE;
7409 if (!gimple_seq_empty_p (internal_pre)
7410 || !gimple_seq_empty_p (internal_post))
7412 gimplify_seq_add_seq (&internal_pre, internal_post);
7413 gimplify_seq_add_seq (pre_p, internal_pre);
7416 /* The result of gimplifying *EXPR_P is going to be the last few
7417 statements in *PRE_P and *POST_P. Add location information
7418 to all the statements that were added by the gimplification
7420 if (!gimple_seq_empty_p (*pre_p))
7421 annotate_all_with_location_after (*pre_p, pre_last_gsi, input_location);
7423 if (!gimple_seq_empty_p (*post_p))
7424 annotate_all_with_location_after (*post_p, post_last_gsi,
7430 #ifdef ENABLE_GIMPLE_CHECKING
7433 enum tree_code code = TREE_CODE (*expr_p);
7434 /* These expressions should already be in gimple IR form. */
7435 gcc_assert (code != MODIFY_EXPR
7437 && code != BIND_EXPR
7438 && code != CATCH_EXPR
7439 && (code != COND_EXPR || gimplify_ctxp->allow_rhs_cond_expr)
7440 && code != EH_FILTER_EXPR
7441 && code != GOTO_EXPR
7442 && code != LABEL_EXPR
7443 && code != LOOP_EXPR
7444 && code != SWITCH_EXPR
7445 && code != TRY_FINALLY_EXPR
7446 && code != OMP_CRITICAL
7448 && code != OMP_MASTER
7449 && code != OMP_ORDERED
7450 && code != OMP_PARALLEL
7451 && code != OMP_SECTIONS
7452 && code != OMP_SECTION
7453 && code != OMP_SINGLE);
7457 /* Otherwise we're gimplifying a subexpression, so the resulting
7458 value is interesting. If it's a valid operand that matches
7459 GIMPLE_TEST_F, we're done. Unless we are handling some
7460 post-effects internally; if that's the case, we need to copy into
7461 a temporary before adding the post-effects to POST_P. */
7462 if (gimple_seq_empty_p (internal_post) && (*gimple_test_f) (*expr_p))
7465 /* Otherwise, we need to create a new temporary for the gimplified
7468 /* We can't return an lvalue if we have an internal postqueue. The
7469 object the lvalue refers to would (probably) be modified by the
7470 postqueue; we need to copy the value out first, which means an
7472 if ((fallback & fb_lvalue)
7473 && gimple_seq_empty_p (internal_post)
7474 && is_gimple_addressable (*expr_p))
7476 /* An lvalue will do. Take the address of the expression, store it
7477 in a temporary, and replace the expression with an INDIRECT_REF of
7479 tmp = build_fold_addr_expr_loc (input_location, *expr_p);
7480 gimplify_expr (&tmp, pre_p, post_p, is_gimple_reg, fb_rvalue);
7481 *expr_p = build_simple_mem_ref (tmp);
7483 else if ((fallback & fb_rvalue) && is_gimple_reg_rhs_or_call (*expr_p))
7485 /* An rvalue will do. Assign the gimplified expression into a
7486 new temporary TMP and replace the original expression with
7487 TMP. First, make sure that the expression has a type so that
7488 it can be assigned into a temporary. */
7489 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p)));
7491 if (!gimple_seq_empty_p (internal_post) || (fallback & fb_lvalue))
7492 /* The postqueue might change the value of the expression between
7493 the initialization and use of the temporary, so we can't use a
7494 formal temp. FIXME do we care? */
7496 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
7497 if (TREE_CODE (TREE_TYPE (*expr_p)) == COMPLEX_TYPE
7498 || TREE_CODE (TREE_TYPE (*expr_p)) == VECTOR_TYPE)
7499 DECL_GIMPLE_REG_P (*expr_p) = 1;
7502 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
7506 #ifdef ENABLE_GIMPLE_CHECKING
7507 if (!(fallback & fb_mayfail))
7509 fprintf (stderr, "gimplification failed:\n");
7510 print_generic_expr (stderr, *expr_p, 0);
7511 debug_tree (*expr_p);
7512 internal_error ("gimplification failed");
7515 gcc_assert (fallback & fb_mayfail);
7517 /* If this is an asm statement, and the user asked for the
7518 impossible, don't die. Fail and let gimplify_asm_expr
7524 /* Make sure the temporary matches our predicate. */
7525 gcc_assert ((*gimple_test_f) (*expr_p));
7527 if (!gimple_seq_empty_p (internal_post))
7529 annotate_all_with_location (internal_post, input_location);
7530 gimplify_seq_add_seq (pre_p, internal_post);
7534 input_location = saved_location;
7538 /* Look through TYPE for variable-sized objects and gimplify each such
7539 size that we find. Add to LIST_P any statements generated. */
7542 gimplify_type_sizes (tree type, gimple_seq *list_p)
7546 if (type == NULL || type == error_mark_node)
7549 /* We first do the main variant, then copy into any other variants. */
7550 type = TYPE_MAIN_VARIANT (type);
7552 /* Avoid infinite recursion. */
7553 if (TYPE_SIZES_GIMPLIFIED (type))
7556 TYPE_SIZES_GIMPLIFIED (type) = 1;
7558 switch (TREE_CODE (type))
7564 case FIXED_POINT_TYPE:
7565 gimplify_one_sizepos (&TYPE_MIN_VALUE (type), list_p);
7566 gimplify_one_sizepos (&TYPE_MAX_VALUE (type), list_p);
7568 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
7570 TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (type);
7571 TYPE_MAX_VALUE (t) = TYPE_MAX_VALUE (type);
7576 /* These types may not have declarations, so handle them here. */
7577 gimplify_type_sizes (TREE_TYPE (type), list_p);
7578 gimplify_type_sizes (TYPE_DOMAIN (type), list_p);
7579 /* Ensure VLA bounds aren't removed, for -O0 they should be variables
7580 with assigned stack slots, for -O1+ -g they should be tracked
7582 if (!(TYPE_NAME (type)
7583 && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
7584 && DECL_IGNORED_P (TYPE_NAME (type)))
7585 && TYPE_DOMAIN (type)
7586 && INTEGRAL_TYPE_P (TYPE_DOMAIN (type)))
7588 t = TYPE_MIN_VALUE (TYPE_DOMAIN (type));
7589 if (t && TREE_CODE (t) == VAR_DECL && DECL_ARTIFICIAL (t))
7590 DECL_IGNORED_P (t) = 0;
7591 t = TYPE_MAX_VALUE (TYPE_DOMAIN (type));
7592 if (t && TREE_CODE (t) == VAR_DECL && DECL_ARTIFICIAL (t))
7593 DECL_IGNORED_P (t) = 0;
7599 case QUAL_UNION_TYPE:
7600 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
7601 if (TREE_CODE (field) == FIELD_DECL)
7603 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field), list_p);
7604 gimplify_one_sizepos (&DECL_SIZE (field), list_p);
7605 gimplify_one_sizepos (&DECL_SIZE_UNIT (field), list_p);
7606 gimplify_type_sizes (TREE_TYPE (field), list_p);
7611 case REFERENCE_TYPE:
7612 /* We used to recurse on the pointed-to type here, which turned out to
7613 be incorrect because its definition might refer to variables not
7614 yet initialized at this point if a forward declaration is involved.
7616 It was actually useful for anonymous pointed-to types to ensure
7617 that the sizes evaluation dominates every possible later use of the
7618 values. Restricting to such types here would be safe since there
7619 is no possible forward declaration around, but would introduce an
7620 undesirable middle-end semantic to anonymity. We then defer to
7621 front-ends the responsibility of ensuring that the sizes are
7622 evaluated both early and late enough, e.g. by attaching artificial
7623 type declarations to the tree. */
7630 gimplify_one_sizepos (&TYPE_SIZE (type), list_p);
7631 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type), list_p);
7633 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
7635 TYPE_SIZE (t) = TYPE_SIZE (type);
7636 TYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (type);
7637 TYPE_SIZES_GIMPLIFIED (t) = 1;
7641 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
7642 a size or position, has had all of its SAVE_EXPRs evaluated.
7643 We add any required statements to *STMT_P. */
7646 gimplify_one_sizepos (tree *expr_p, gimple_seq *stmt_p)
7648 tree type, expr = *expr_p;
7650 /* We don't do anything if the value isn't there, is constant, or contains
7651 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
7652 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
7653 will want to replace it with a new variable, but that will cause problems
7654 if this type is from outside the function. It's OK to have that here. */
7655 if (expr == NULL_TREE || TREE_CONSTANT (expr)
7656 || TREE_CODE (expr) == VAR_DECL
7657 || CONTAINS_PLACEHOLDER_P (expr))
7660 type = TREE_TYPE (expr);
7661 *expr_p = unshare_expr (expr);
7663 gimplify_expr (expr_p, stmt_p, NULL, is_gimple_val, fb_rvalue);
7666 /* Verify that we've an exact type match with the original expression.
7667 In particular, we do not wish to drop a "sizetype" in favour of a
7668 type of similar dimensions. We don't want to pollute the generic
7669 type-stripping code with this knowledge because it doesn't matter
7670 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
7671 and friends retain their "sizetype-ness". */
7672 if (TREE_TYPE (expr) != type
7673 && TREE_CODE (type) == INTEGER_TYPE
7674 && TYPE_IS_SIZETYPE (type))
7679 *expr_p = create_tmp_var (type, NULL);
7680 tmp = build1 (NOP_EXPR, type, expr);
7681 stmt = gimplify_assign (*expr_p, tmp, stmt_p);
7682 gimple_set_location (stmt, EXPR_LOC_OR_HERE (expr));
7687 /* Gimplify the body of statements pointed to by BODY_P and return a
7688 GIMPLE_BIND containing the sequence of GIMPLE statements
7689 corresponding to BODY_P. FNDECL is the function decl containing
7693 gimplify_body (tree *body_p, tree fndecl, bool do_parms)
7695 location_t saved_location = input_location;
7696 gimple_seq parm_stmts, seq;
7698 struct gimplify_ctx gctx;
7699 struct cgraph_node *cgn;
7701 timevar_push (TV_TREE_GIMPLIFY);
7703 /* Initialize for optimize_insn_for_s{ize,peed}_p possibly called during
7705 default_rtl_profile ();
7707 gcc_assert (gimplify_ctxp == NULL);
7708 push_gimplify_context (&gctx);
7710 /* Unshare most shared trees in the body and in that of any nested functions.
7711 It would seem we don't have to do this for nested functions because
7712 they are supposed to be output and then the outer function gimplified
7713 first, but the g++ front end doesn't always do it that way. */
7714 unshare_body (body_p, fndecl);
7715 unvisit_body (body_p, fndecl);
7717 cgn = cgraph_get_node (fndecl);
7718 if (cgn && cgn->origin)
7719 nonlocal_vlas = pointer_set_create ();
7721 /* Make sure input_location isn't set to something weird. */
7722 input_location = DECL_SOURCE_LOCATION (fndecl);
7724 /* Resolve callee-copies. This has to be done before processing
7725 the body so that DECL_VALUE_EXPR gets processed correctly. */
7726 parm_stmts = (do_parms) ? gimplify_parameters () : NULL;
7728 /* Gimplify the function's body. */
7730 gimplify_stmt (body_p, &seq);
7731 outer_bind = gimple_seq_first_stmt (seq);
7734 outer_bind = gimple_build_nop ();
7735 gimplify_seq_add_stmt (&seq, outer_bind);
7738 /* The body must contain exactly one statement, a GIMPLE_BIND. If this is
7739 not the case, wrap everything in a GIMPLE_BIND to make it so. */
7740 if (gimple_code (outer_bind) == GIMPLE_BIND
7741 && gimple_seq_first (seq) == gimple_seq_last (seq))
7744 outer_bind = gimple_build_bind (NULL_TREE, seq, NULL);
7746 *body_p = NULL_TREE;
7748 /* If we had callee-copies statements, insert them at the beginning
7749 of the function and clear DECL_VALUE_EXPR_P on the parameters. */
7750 if (!gimple_seq_empty_p (parm_stmts))
7754 gimplify_seq_add_seq (&parm_stmts, gimple_bind_body (outer_bind));
7755 gimple_bind_set_body (outer_bind, parm_stmts);
7757 for (parm = DECL_ARGUMENTS (current_function_decl);
7758 parm; parm = DECL_CHAIN (parm))
7759 if (DECL_HAS_VALUE_EXPR_P (parm))
7761 DECL_HAS_VALUE_EXPR_P (parm) = 0;
7762 DECL_IGNORED_P (parm) = 0;
7768 pointer_set_destroy (nonlocal_vlas);
7769 nonlocal_vlas = NULL;
7772 pop_gimplify_context (outer_bind);
7773 gcc_assert (gimplify_ctxp == NULL);
7776 verify_gimple_in_seq (gimple_bind_body (outer_bind));
7778 timevar_pop (TV_TREE_GIMPLIFY);
7779 input_location = saved_location;
7784 typedef char *char_p; /* For DEF_VEC_P. */
7786 DEF_VEC_ALLOC_P(char_p,heap);
7788 /* Return whether we should exclude FNDECL from instrumentation. */
7791 flag_instrument_functions_exclude_p (tree fndecl)
7793 VEC(char_p,heap) *vec;
7795 vec = (VEC(char_p,heap) *) flag_instrument_functions_exclude_functions;
7796 if (VEC_length (char_p, vec) > 0)
7802 name = lang_hooks.decl_printable_name (fndecl, 0);
7803 FOR_EACH_VEC_ELT (char_p, vec, i, s)
7804 if (strstr (name, s) != NULL)
7808 vec = (VEC(char_p,heap) *) flag_instrument_functions_exclude_files;
7809 if (VEC_length (char_p, vec) > 0)
7815 name = DECL_SOURCE_FILE (fndecl);
7816 FOR_EACH_VEC_ELT (char_p, vec, i, s)
7817 if (strstr (name, s) != NULL)
7824 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
7825 node for the function we want to gimplify.
7827 Returns the sequence of GIMPLE statements corresponding to the body
7831 gimplify_function_tree (tree fndecl)
7833 tree oldfn, parm, ret;
7837 gcc_assert (!gimple_body (fndecl));
7839 oldfn = current_function_decl;
7840 current_function_decl = fndecl;
7841 if (DECL_STRUCT_FUNCTION (fndecl))
7842 push_cfun (DECL_STRUCT_FUNCTION (fndecl));
7844 push_struct_function (fndecl);
7846 for (parm = DECL_ARGUMENTS (fndecl); parm ; parm = DECL_CHAIN (parm))
7848 /* Preliminarily mark non-addressed complex variables as eligible
7849 for promotion to gimple registers. We'll transform their uses
7851 if ((TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
7852 || TREE_CODE (TREE_TYPE (parm)) == VECTOR_TYPE)
7853 && !TREE_THIS_VOLATILE (parm)
7854 && !needs_to_live_in_memory (parm))
7855 DECL_GIMPLE_REG_P (parm) = 1;
7858 ret = DECL_RESULT (fndecl);
7859 if ((TREE_CODE (TREE_TYPE (ret)) == COMPLEX_TYPE
7860 || TREE_CODE (TREE_TYPE (ret)) == VECTOR_TYPE)
7861 && !needs_to_live_in_memory (ret))
7862 DECL_GIMPLE_REG_P (ret) = 1;
7864 bind = gimplify_body (&DECL_SAVED_TREE (fndecl), fndecl, true);
7866 /* The tree body of the function is no longer needed, replace it
7867 with the new GIMPLE body. */
7868 seq = gimple_seq_alloc ();
7869 gimple_seq_add_stmt (&seq, bind);
7870 gimple_set_body (fndecl, seq);
7872 /* If we're instrumenting function entry/exit, then prepend the call to
7873 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
7874 catch the exit hook. */
7875 /* ??? Add some way to ignore exceptions for this TFE. */
7876 if (flag_instrument_function_entry_exit
7877 && !DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl)
7878 && !flag_instrument_functions_exclude_p (fndecl))
7883 gimple_seq cleanup = NULL, body = NULL;
7887 x = implicit_built_in_decls[BUILT_IN_RETURN_ADDRESS];
7888 call = gimple_build_call (x, 1, integer_zero_node);
7889 tmp_var = create_tmp_var (ptr_type_node, "return_addr");
7890 gimple_call_set_lhs (call, tmp_var);
7891 gimplify_seq_add_stmt (&cleanup, call);
7892 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_EXIT];
7893 call = gimple_build_call (x, 2,
7894 build_fold_addr_expr (current_function_decl),
7896 gimplify_seq_add_stmt (&cleanup, call);
7897 tf = gimple_build_try (seq, cleanup, GIMPLE_TRY_FINALLY);
7899 x = implicit_built_in_decls[BUILT_IN_RETURN_ADDRESS];
7900 call = gimple_build_call (x, 1, integer_zero_node);
7901 tmp_var = create_tmp_var (ptr_type_node, "return_addr");
7902 gimple_call_set_lhs (call, tmp_var);
7903 gimplify_seq_add_stmt (&body, call);
7904 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_ENTER];
7905 call = gimple_build_call (x, 2,
7906 build_fold_addr_expr (current_function_decl),
7908 gimplify_seq_add_stmt (&body, call);
7909 gimplify_seq_add_stmt (&body, tf);
7910 new_bind = gimple_build_bind (NULL, body, gimple_bind_block (bind));
7911 /* Clear the block for BIND, since it is no longer directly inside
7912 the function, but within a try block. */
7913 gimple_bind_set_block (bind, NULL);
7915 /* Replace the current function body with the body
7916 wrapped in the try/finally TF. */
7917 seq = gimple_seq_alloc ();
7918 gimple_seq_add_stmt (&seq, new_bind);
7919 gimple_set_body (fndecl, seq);
7922 DECL_SAVED_TREE (fndecl) = NULL_TREE;
7923 cfun->curr_properties = PROP_gimple_any;
7925 current_function_decl = oldfn;
7930 /* Some transformations like inlining may invalidate the GIMPLE form
7931 for operands. This function traverses all the operands in STMT and
7932 gimplifies anything that is not a valid gimple operand. Any new
7933 GIMPLE statements are inserted before *GSI_P. */
7936 gimple_regimplify_operands (gimple stmt, gimple_stmt_iterator *gsi_p)
7939 tree orig_lhs = NULL_TREE, lhs, t;
7940 gimple_seq pre = NULL;
7941 gimple post_stmt = NULL;
7942 struct gimplify_ctx gctx;
7944 push_gimplify_context (&gctx);
7945 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
7947 switch (gimple_code (stmt))
7950 gimplify_expr (gimple_cond_lhs_ptr (stmt), &pre, NULL,
7951 is_gimple_val, fb_rvalue);
7952 gimplify_expr (gimple_cond_rhs_ptr (stmt), &pre, NULL,
7953 is_gimple_val, fb_rvalue);
7956 gimplify_expr (gimple_switch_index_ptr (stmt), &pre, NULL,
7957 is_gimple_val, fb_rvalue);
7959 case GIMPLE_OMP_ATOMIC_LOAD:
7960 gimplify_expr (gimple_omp_atomic_load_rhs_ptr (stmt), &pre, NULL,
7961 is_gimple_val, fb_rvalue);
7965 size_t i, noutputs = gimple_asm_noutputs (stmt);
7966 const char *constraint, **oconstraints;
7967 bool allows_mem, allows_reg, is_inout;
7970 = (const char **) alloca ((noutputs) * sizeof (const char *));
7971 for (i = 0; i < noutputs; i++)
7973 tree op = gimple_asm_output_op (stmt, i);
7974 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
7975 oconstraints[i] = constraint;
7976 parse_output_constraint (&constraint, i, 0, 0, &allows_mem,
7977 &allows_reg, &is_inout);
7978 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
7979 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
7980 fb_lvalue | fb_mayfail);
7982 for (i = 0; i < gimple_asm_ninputs (stmt); i++)
7984 tree op = gimple_asm_input_op (stmt, i);
7985 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
7986 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
7987 oconstraints, &allows_mem, &allows_reg);
7988 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (op))) && allows_mem)
7990 if (!allows_reg && allows_mem)
7991 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
7992 is_gimple_lvalue, fb_lvalue | fb_mayfail);
7994 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
7995 is_gimple_asm_val, fb_rvalue);
8000 /* NOTE: We start gimplifying operands from last to first to
8001 make sure that side-effects on the RHS of calls, assignments
8002 and ASMs are executed before the LHS. The ordering is not
8003 important for other statements. */
8004 num_ops = gimple_num_ops (stmt);
8005 orig_lhs = gimple_get_lhs (stmt);
8006 for (i = num_ops; i > 0; i--)
8008 tree op = gimple_op (stmt, i - 1);
8009 if (op == NULL_TREE)
8011 if (i == 1 && (is_gimple_call (stmt) || is_gimple_assign (stmt)))
8012 gimplify_expr (&op, &pre, NULL, is_gimple_lvalue, fb_lvalue);
8014 && is_gimple_assign (stmt)
8016 && get_gimple_rhs_class (gimple_expr_code (stmt))
8017 == GIMPLE_SINGLE_RHS)
8018 gimplify_expr (&op, &pre, NULL,
8019 rhs_predicate_for (gimple_assign_lhs (stmt)),
8021 else if (i == 2 && is_gimple_call (stmt))
8023 if (TREE_CODE (op) == FUNCTION_DECL)
8025 gimplify_expr (&op, &pre, NULL, is_gimple_call_addr, fb_rvalue);
8028 gimplify_expr (&op, &pre, NULL, is_gimple_val, fb_rvalue);
8029 gimple_set_op (stmt, i - 1, op);
8032 lhs = gimple_get_lhs (stmt);
8033 /* If the LHS changed it in a way that requires a simple RHS,
8034 create temporary. */
8035 if (lhs && !is_gimple_reg (lhs))
8037 bool need_temp = false;
8039 if (is_gimple_assign (stmt)
8041 && get_gimple_rhs_class (gimple_expr_code (stmt))
8042 == GIMPLE_SINGLE_RHS)
8043 gimplify_expr (gimple_assign_rhs1_ptr (stmt), &pre, NULL,
8044 rhs_predicate_for (gimple_assign_lhs (stmt)),
8046 else if (is_gimple_reg (lhs))
8048 if (is_gimple_reg_type (TREE_TYPE (lhs)))
8050 if (is_gimple_call (stmt))
8052 i = gimple_call_flags (stmt);
8053 if ((i & ECF_LOOPING_CONST_OR_PURE)
8054 || !(i & (ECF_CONST | ECF_PURE)))
8057 if (stmt_can_throw_internal (stmt))
8063 if (is_gimple_reg_type (TREE_TYPE (lhs)))
8065 else if (TYPE_MODE (TREE_TYPE (lhs)) != BLKmode)
8067 if (is_gimple_call (stmt))
8069 tree fndecl = gimple_call_fndecl (stmt);
8071 if (!aggregate_value_p (TREE_TYPE (lhs), fndecl)
8072 && !(fndecl && DECL_RESULT (fndecl)
8073 && DECL_BY_REFERENCE (DECL_RESULT (fndecl))))
8082 tree temp = create_tmp_reg (TREE_TYPE (lhs), NULL);
8084 if (TREE_CODE (orig_lhs) == SSA_NAME)
8085 orig_lhs = SSA_NAME_VAR (orig_lhs);
8087 if (gimple_in_ssa_p (cfun))
8088 temp = make_ssa_name (temp, NULL);
8089 gimple_set_lhs (stmt, temp);
8090 post_stmt = gimple_build_assign (lhs, temp);
8091 if (TREE_CODE (lhs) == SSA_NAME)
8092 SSA_NAME_DEF_STMT (lhs) = post_stmt;
8098 if (gimple_referenced_vars (cfun))
8099 for (t = gimplify_ctxp->temps; t ; t = TREE_CHAIN (t))
8100 add_referenced_var (t);
8102 if (!gimple_seq_empty_p (pre))
8104 if (gimple_in_ssa_p (cfun))
8106 gimple_stmt_iterator i;
8108 for (i = gsi_start (pre); !gsi_end_p (i); gsi_next (&i))
8109 mark_symbols_for_renaming (gsi_stmt (i));
8111 gsi_insert_seq_before (gsi_p, pre, GSI_SAME_STMT);
8114 gsi_insert_after (gsi_p, post_stmt, GSI_NEW_STMT);
8116 pop_gimplify_context (NULL);
8120 /* Expands EXPR to list of gimple statements STMTS. GIMPLE_TEST_F specifies
8121 the predicate that will hold for the result. If VAR is not NULL, make the
8122 base variable of the final destination be VAR if suitable. */
8125 force_gimple_operand_1 (tree expr, gimple_seq *stmts,
8126 gimple_predicate gimple_test_f, tree var)
8129 enum gimplify_status ret;
8130 struct gimplify_ctx gctx;
8134 /* gimple_test_f might be more strict than is_gimple_val, make
8135 sure we pass both. Just checking gimple_test_f doesn't work
8136 because most gimple predicates do not work recursively. */
8137 if (is_gimple_val (expr)
8138 && (*gimple_test_f) (expr))
8141 push_gimplify_context (&gctx);
8142 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
8143 gimplify_ctxp->allow_rhs_cond_expr = true;
8146 expr = build2 (MODIFY_EXPR, TREE_TYPE (var), var, expr);
8148 if (TREE_CODE (expr) != MODIFY_EXPR
8149 && TREE_TYPE (expr) == void_type_node)
8151 gimplify_and_add (expr, stmts);
8156 ret = gimplify_expr (&expr, stmts, NULL, gimple_test_f, fb_rvalue);
8157 gcc_assert (ret != GS_ERROR);
8160 if (gimple_referenced_vars (cfun))
8161 for (t = gimplify_ctxp->temps; t ; t = DECL_CHAIN (t))
8162 add_referenced_var (t);
8164 pop_gimplify_context (NULL);
8169 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
8170 force the result to be either ssa_name or an invariant, otherwise
8171 just force it to be a rhs expression. If VAR is not NULL, make the
8172 base variable of the final destination be VAR if suitable. */
8175 force_gimple_operand (tree expr, gimple_seq *stmts, bool simple, tree var)
8177 return force_gimple_operand_1 (expr, stmts,
8178 simple ? is_gimple_val : is_gimple_reg_rhs,
8182 /* Invokes force_gimple_operand_1 for EXPR with parameters GIMPLE_TEST_F
8183 and VAR. If some statements are produced, emits them at GSI.
8184 If BEFORE is true. the statements are appended before GSI, otherwise
8185 they are appended after it. M specifies the way GSI moves after
8186 insertion (GSI_SAME_STMT or GSI_CONTINUE_LINKING are the usual values). */
8189 force_gimple_operand_gsi_1 (gimple_stmt_iterator *gsi, tree expr,
8190 gimple_predicate gimple_test_f,
8191 tree var, bool before,
8192 enum gsi_iterator_update m)
8196 expr = force_gimple_operand_1 (expr, &stmts, gimple_test_f, var);
8198 if (!gimple_seq_empty_p (stmts))
8200 if (gimple_in_ssa_p (cfun))
8202 gimple_stmt_iterator i;
8204 for (i = gsi_start (stmts); !gsi_end_p (i); gsi_next (&i))
8205 mark_symbols_for_renaming (gsi_stmt (i));
8209 gsi_insert_seq_before (gsi, stmts, m);
8211 gsi_insert_seq_after (gsi, stmts, m);
8217 /* Invokes force_gimple_operand_1 for EXPR with parameter VAR.
8218 If SIMPLE is true, force the result to be either ssa_name or an invariant,
8219 otherwise just force it to be a rhs expression. If some statements are
8220 produced, emits them at GSI. If BEFORE is true, the statements are
8221 appended before GSI, otherwise they are appended after it. M specifies
8222 the way GSI moves after insertion (GSI_SAME_STMT or GSI_CONTINUE_LINKING
8223 are the usual values). */
8226 force_gimple_operand_gsi (gimple_stmt_iterator *gsi, tree expr,
8227 bool simple_p, tree var, bool before,
8228 enum gsi_iterator_update m)
8230 return force_gimple_operand_gsi_1 (gsi, expr,
8232 ? is_gimple_val : is_gimple_reg_rhs,
8237 #include "gt-gimplify.h"