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 declaration. */
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. */
110 mark_addressable (tree x)
112 while (handled_component_p (x))
113 x = TREE_OPERAND (x, 0);
114 if (TREE_CODE (x) == MEM_REF
115 && TREE_CODE (TREE_OPERAND (x, 0)) == ADDR_EXPR)
116 x = TREE_OPERAND (TREE_OPERAND (x, 0), 0);
117 if (TREE_CODE (x) != VAR_DECL
118 && TREE_CODE (x) != PARM_DECL
119 && TREE_CODE (x) != RESULT_DECL)
121 TREE_ADDRESSABLE (x) = 1;
124 /* Return a hash value for a formal temporary table entry. */
127 gimple_tree_hash (const void *p)
129 tree t = ((const elt_t *) p)->val;
130 return iterative_hash_expr (t, 0);
133 /* Compare two formal temporary table entries. */
136 gimple_tree_eq (const void *p1, const void *p2)
138 tree t1 = ((const elt_t *) p1)->val;
139 tree t2 = ((const elt_t *) p2)->val;
140 enum tree_code code = TREE_CODE (t1);
142 if (TREE_CODE (t2) != code
143 || TREE_TYPE (t1) != TREE_TYPE (t2))
146 if (!operand_equal_p (t1, t2, 0))
149 #ifdef ENABLE_CHECKING
150 /* Only allow them to compare equal if they also hash equal; otherwise
151 results are nondeterminate, and we fail bootstrap comparison. */
152 gcc_assert (gimple_tree_hash (p1) == gimple_tree_hash (p2));
158 /* Link gimple statement GS to the end of the sequence *SEQ_P. If
159 *SEQ_P is NULL, a new sequence is allocated. This function is
160 similar to gimple_seq_add_stmt, but does not scan the operands.
161 During gimplification, we need to manipulate statement sequences
162 before the def/use vectors have been constructed. */
165 gimplify_seq_add_stmt (gimple_seq *seq_p, gimple gs)
167 gimple_stmt_iterator si;
173 *seq_p = gimple_seq_alloc ();
175 si = gsi_last (*seq_p);
177 gsi_insert_after_without_update (&si, gs, GSI_NEW_STMT);
180 /* Append sequence SRC to the end of sequence *DST_P. If *DST_P is
181 NULL, a new sequence is allocated. This function is
182 similar to gimple_seq_add_seq, but does not scan the operands.
183 During gimplification, we need to manipulate statement sequences
184 before the def/use vectors have been constructed. */
187 gimplify_seq_add_seq (gimple_seq *dst_p, gimple_seq src)
189 gimple_stmt_iterator si;
195 *dst_p = gimple_seq_alloc ();
197 si = gsi_last (*dst_p);
198 gsi_insert_seq_after_without_update (&si, src, GSI_NEW_STMT);
201 /* Set up a context for the gimplifier. */
204 push_gimplify_context (struct gimplify_ctx *c)
206 memset (c, '\0', sizeof (*c));
207 c->prev_context = gimplify_ctxp;
211 /* Tear down a context for the gimplifier. If BODY is non-null, then
212 put the temporaries into the outer BIND_EXPR. Otherwise, put them
215 BODY is not a sequence, but the first tuple in a sequence. */
218 pop_gimplify_context (gimple body)
220 struct gimplify_ctx *c = gimplify_ctxp;
222 gcc_assert (c && (c->bind_expr_stack == NULL
223 || VEC_empty (gimple, c->bind_expr_stack)));
224 VEC_free (gimple, heap, c->bind_expr_stack);
225 gimplify_ctxp = c->prev_context;
228 declare_vars (c->temps, body, false);
230 record_vars (c->temps);
233 htab_delete (c->temp_htab);
236 /* Push a GIMPLE_BIND tuple onto the stack of bindings. */
239 gimple_push_bind_expr (gimple gimple_bind)
241 if (gimplify_ctxp->bind_expr_stack == NULL)
242 gimplify_ctxp->bind_expr_stack = VEC_alloc (gimple, heap, 8);
243 VEC_safe_push (gimple, heap, gimplify_ctxp->bind_expr_stack, gimple_bind);
246 /* Pop the first element off the stack of bindings. */
249 gimple_pop_bind_expr (void)
251 VEC_pop (gimple, gimplify_ctxp->bind_expr_stack);
254 /* Return the first element of the stack of bindings. */
257 gimple_current_bind_expr (void)
259 return VEC_last (gimple, gimplify_ctxp->bind_expr_stack);
262 /* Return the stack of bindings created during gimplification. */
265 gimple_bind_expr_stack (void)
267 return gimplify_ctxp->bind_expr_stack;
270 /* Return true iff there is a COND_EXPR between us and the innermost
271 CLEANUP_POINT_EXPR. This info is used by gimple_push_cleanup. */
274 gimple_conditional_context (void)
276 return gimplify_ctxp->conditions > 0;
279 /* Note that we've entered a COND_EXPR. */
282 gimple_push_condition (void)
284 #ifdef ENABLE_GIMPLE_CHECKING
285 if (gimplify_ctxp->conditions == 0)
286 gcc_assert (gimple_seq_empty_p (gimplify_ctxp->conditional_cleanups));
288 ++(gimplify_ctxp->conditions);
291 /* Note that we've left a COND_EXPR. If we're back at unconditional scope
292 now, add any conditional cleanups we've seen to the prequeue. */
295 gimple_pop_condition (gimple_seq *pre_p)
297 int conds = --(gimplify_ctxp->conditions);
299 gcc_assert (conds >= 0);
302 gimplify_seq_add_seq (pre_p, gimplify_ctxp->conditional_cleanups);
303 gimplify_ctxp->conditional_cleanups = NULL;
307 /* A stable comparison routine for use with splay trees and DECLs. */
310 splay_tree_compare_decl_uid (splay_tree_key xa, splay_tree_key xb)
315 return DECL_UID (a) - DECL_UID (b);
318 /* Create a new omp construct that deals with variable remapping. */
320 static struct gimplify_omp_ctx *
321 new_omp_context (enum omp_region_type region_type)
323 struct gimplify_omp_ctx *c;
325 c = XCNEW (struct gimplify_omp_ctx);
326 c->outer_context = gimplify_omp_ctxp;
327 c->variables = splay_tree_new (splay_tree_compare_decl_uid, 0, 0);
328 c->privatized_types = pointer_set_create ();
329 c->location = input_location;
330 c->region_type = region_type;
331 if ((region_type & ORT_TASK) == 0)
332 c->default_kind = OMP_CLAUSE_DEFAULT_SHARED;
334 c->default_kind = OMP_CLAUSE_DEFAULT_UNSPECIFIED;
339 /* Destroy an omp construct that deals with variable remapping. */
342 delete_omp_context (struct gimplify_omp_ctx *c)
344 splay_tree_delete (c->variables);
345 pointer_set_destroy (c->privatized_types);
349 static void omp_add_variable (struct gimplify_omp_ctx *, tree, unsigned int);
350 static bool omp_notice_variable (struct gimplify_omp_ctx *, tree, bool);
352 /* Both gimplify the statement T and append it to *SEQ_P. This function
353 behaves exactly as gimplify_stmt, but you don't have to pass T as a
357 gimplify_and_add (tree t, gimple_seq *seq_p)
359 gimplify_stmt (&t, seq_p);
362 /* Gimplify statement T into sequence *SEQ_P, and return the first
363 tuple in the sequence of generated tuples for this statement.
364 Return NULL if gimplifying T produced no tuples. */
367 gimplify_and_return_first (tree t, gimple_seq *seq_p)
369 gimple_stmt_iterator last = gsi_last (*seq_p);
371 gimplify_and_add (t, seq_p);
373 if (!gsi_end_p (last))
376 return gsi_stmt (last);
379 return gimple_seq_first_stmt (*seq_p);
382 /* Strip off a legitimate source ending from the input string NAME of
383 length LEN. Rather than having to know the names used by all of
384 our front ends, we strip off an ending of a period followed by
385 up to five characters. (Java uses ".class".) */
388 remove_suffix (char *name, int len)
392 for (i = 2; i < 8 && len > i; i++)
394 if (name[len - i] == '.')
396 name[len - i] = '\0';
402 /* Create a new temporary name with PREFIX. Return an identifier. */
404 static GTY(()) unsigned int tmp_var_id_num;
407 create_tmp_var_name (const char *prefix)
413 char *preftmp = ASTRDUP (prefix);
415 remove_suffix (preftmp, strlen (preftmp));
419 ASM_FORMAT_PRIVATE_NAME (tmp_name, prefix ? prefix : "T", tmp_var_id_num++);
420 return get_identifier (tmp_name);
423 /* Create a new temporary variable declaration of type TYPE.
424 Do NOT push it into the current binding. */
427 create_tmp_var_raw (tree type, const char *prefix)
431 tmp_var = build_decl (input_location,
432 VAR_DECL, prefix ? create_tmp_var_name (prefix) : NULL,
435 /* The variable was declared by the compiler. */
436 DECL_ARTIFICIAL (tmp_var) = 1;
437 /* And we don't want debug info for it. */
438 DECL_IGNORED_P (tmp_var) = 1;
440 /* Make the variable writable. */
441 TREE_READONLY (tmp_var) = 0;
443 DECL_EXTERNAL (tmp_var) = 0;
444 TREE_STATIC (tmp_var) = 0;
445 TREE_USED (tmp_var) = 1;
450 /* Create a new temporary variable declaration of type TYPE. DO push the
451 variable into the current binding. Further, assume that this is called
452 only from gimplification or optimization, at which point the creation of
453 certain types are bugs. */
456 create_tmp_var (tree type, const char *prefix)
460 /* We don't allow types that are addressable (meaning we can't make copies),
461 or incomplete. We also used to reject every variable size objects here,
462 but now support those for which a constant upper bound can be obtained.
463 The processing for variable sizes is performed in gimple_add_tmp_var,
464 point at which it really matters and possibly reached via paths not going
465 through this function, e.g. after direct calls to create_tmp_var_raw. */
466 gcc_assert (!TREE_ADDRESSABLE (type) && COMPLETE_TYPE_P (type));
468 tmp_var = create_tmp_var_raw (type, prefix);
469 gimple_add_tmp_var (tmp_var);
473 /* Create a new temporary variable declaration of type TYPE by calling
474 create_tmp_var and if TYPE is a vector or a complex number, mark the new
475 temporary as gimple register. */
478 create_tmp_reg (tree type, const char *prefix)
482 tmp = create_tmp_var (type, prefix);
483 if (TREE_CODE (type) == COMPLEX_TYPE
484 || TREE_CODE (type) == VECTOR_TYPE)
485 DECL_GIMPLE_REG_P (tmp) = 1;
490 /* Create a temporary with a name derived from VAL. Subroutine of
491 lookup_tmp_var; nobody else should call this function. */
494 create_tmp_from_val (tree val)
496 return create_tmp_var (TREE_TYPE (val), get_name (val));
499 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
500 an existing expression temporary. */
503 lookup_tmp_var (tree val, bool is_formal)
507 /* If not optimizing, never really reuse a temporary. local-alloc
508 won't allocate any variable that is used in more than one basic
509 block, which means it will go into memory, causing much extra
510 work in reload and final and poorer code generation, outweighing
511 the extra memory allocation here. */
512 if (!optimize || !is_formal || TREE_SIDE_EFFECTS (val))
513 ret = create_tmp_from_val (val);
520 if (gimplify_ctxp->temp_htab == NULL)
521 gimplify_ctxp->temp_htab
522 = htab_create (1000, gimple_tree_hash, gimple_tree_eq, free);
523 slot = htab_find_slot (gimplify_ctxp->temp_htab, (void *)&elt, INSERT);
526 elt_p = XNEW (elt_t);
528 elt_p->temp = ret = create_tmp_from_val (val);
529 *slot = (void *) elt_p;
533 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 /* Return 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 /* Return 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 /* Declare all the variables in VARS in SCOPE. If DEBUG_INFO is true,
636 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);
699 /* Push the temporary variable TMP into the current binding. */
702 gimple_add_tmp_var (tree tmp)
704 gcc_assert (!DECL_CHAIN (tmp) && !DECL_SEEN_IN_BIND_EXPR_P (tmp));
706 /* Later processing assumes that the object size is constant, which might
707 not be true at this point. Force the use of a constant upper bound in
709 if (!host_integerp (DECL_SIZE_UNIT (tmp), 1))
710 force_constant_size (tmp);
712 DECL_CONTEXT (tmp) = current_function_decl;
713 DECL_SEEN_IN_BIND_EXPR_P (tmp) = 1;
717 DECL_CHAIN (tmp) = gimplify_ctxp->temps;
718 gimplify_ctxp->temps = tmp;
720 /* Mark temporaries local within the nearest enclosing parallel. */
721 if (gimplify_omp_ctxp)
723 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
724 while (ctx && ctx->region_type == ORT_WORKSHARE)
725 ctx = ctx->outer_context;
727 omp_add_variable (ctx, tmp, GOVD_LOCAL | GOVD_SEEN);
736 /* This case is for nested functions. We need to expose the locals
738 body_seq = gimple_body (current_function_decl);
739 declare_vars (tmp, gimple_seq_first_stmt (body_seq), false);
743 /* Determine whether to assign a location to the statement GS. */
746 should_carry_location_p (gimple gs)
748 /* Don't emit a line note for a label. We particularly don't want to
749 emit one for the break label, since it doesn't actually correspond
750 to the beginning of the loop/switch. */
751 if (gimple_code (gs) == GIMPLE_LABEL)
757 /* Return true if a location should not be emitted for this statement
758 by annotate_one_with_location. */
761 gimple_do_not_emit_location_p (gimple g)
763 return gimple_plf (g, GF_PLF_1);
766 /* Mark statement G so a location will not be emitted by
767 annotate_one_with_location. */
770 gimple_set_do_not_emit_location (gimple g)
772 /* The PLF flags are initialized to 0 when a new tuple is created,
773 so no need to initialize it anywhere. */
774 gimple_set_plf (g, GF_PLF_1, true);
777 /* Set the location for gimple statement GS to LOCATION. */
780 annotate_one_with_location (gimple gs, location_t location)
782 if (!gimple_has_location (gs)
783 && !gimple_do_not_emit_location_p (gs)
784 && should_carry_location_p (gs))
785 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);
805 /* Set the location for all the statements in a sequence STMT_P to LOCATION. */
808 annotate_all_with_location (gimple_seq stmt_p, location_t location)
810 gimple_stmt_iterator i;
812 if (gimple_seq_empty_p (stmt_p))
815 for (i = gsi_start (stmt_p); !gsi_end_p (i); gsi_next (&i))
817 gimple gs = gsi_stmt (i);
818 annotate_one_with_location (gs, location);
822 /* This page contains routines to unshare tree nodes, i.e. to duplicate tree
823 nodes that are referenced more than once in GENERIC functions. This is
824 necessary because gimplification (translation into GIMPLE) is performed
825 by modifying tree nodes in-place, so gimplication of a shared node in a
826 first context could generate an invalid GIMPLE form in a second context.
828 This is achieved with a simple mark/copy/unmark algorithm that walks the
829 GENERIC representation top-down, marks nodes with TREE_VISITED the first
830 time it encounters them, duplicates them if they already have TREE_VISITED
831 set, and finally removes the TREE_VISITED marks it has set.
833 The algorithm works only at the function level, i.e. it generates a GENERIC
834 representation of a function with no nodes shared within the function when
835 passed a GENERIC function (except for nodes that are allowed to be shared).
837 At the global level, it is also necessary to unshare tree nodes that are
838 referenced in more than one function, for the same aforementioned reason.
839 This requires some cooperation from the front-end. There are 2 strategies:
841 1. Manual unsharing. The front-end needs to call unshare_expr on every
842 expression that might end up being shared across functions.
844 2. Deep unsharing. This is an extension of regular unsharing. Instead
845 of calling unshare_expr on expressions that might be shared across
846 functions, the front-end pre-marks them with TREE_VISITED. This will
847 ensure that they are unshared on the first reference within functions
848 when the regular unsharing algorithm runs. The counterpart is that
849 this algorithm must look deeper than for manual unsharing, which is
850 specified by LANG_HOOKS_DEEP_UNSHARING.
852 If there are only few specific cases of node sharing across functions, it is
853 probably easier for a front-end to unshare the expressions manually. On the
854 contrary, if the expressions generated at the global level are as widespread
855 as expressions generated within functions, deep unsharing is very likely the
858 /* Similar to copy_tree_r but do not copy SAVE_EXPR or TARGET_EXPR nodes.
859 These nodes model computations that should only be done once. If we
860 were to unshare something like SAVE_EXPR(i++), the gimplification
861 process would create wrong code. */
864 mostly_copy_tree_r (tree *tp, int *walk_subtrees, void *data)
867 enum tree_code code = TREE_CODE (t);
869 /* Do not copy SAVE_EXPR, TARGET_EXPR or BIND_EXPR nodes themselves, but
870 copy their subtrees if we can make sure to do it only once. */
871 if (code == SAVE_EXPR || code == TARGET_EXPR || code == BIND_EXPR)
873 if (data && !pointer_set_insert ((struct pointer_set_t *)data, t))
879 /* Stop at types, decls, constants like copy_tree_r. */
880 else if (TREE_CODE_CLASS (code) == tcc_type
881 || TREE_CODE_CLASS (code) == tcc_declaration
882 || TREE_CODE_CLASS (code) == tcc_constant
883 /* We can't do anything sensible with a BLOCK used as an
884 expression, but we also can't just die when we see it
885 because of non-expression uses. So we avert our eyes
886 and cross our fingers. Silly Java. */
890 /* Cope with the statement expression extension. */
891 else if (code == STATEMENT_LIST)
894 /* Leave the bulk of the work to copy_tree_r itself. */
896 copy_tree_r (tp, walk_subtrees, NULL);
901 /* Callback for walk_tree to unshare most of the shared trees rooted at
902 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
903 then *TP is deep copied by calling mostly_copy_tree_r. */
906 copy_if_shared_r (tree *tp, int *walk_subtrees, void *data)
909 enum tree_code code = TREE_CODE (t);
911 /* Skip types, decls, and constants. But we do want to look at their
912 types and the bounds of types. Mark them as visited so we properly
913 unmark their subtrees on the unmark pass. If we've already seen them,
914 don't look down further. */
915 if (TREE_CODE_CLASS (code) == tcc_type
916 || TREE_CODE_CLASS (code) == tcc_declaration
917 || TREE_CODE_CLASS (code) == tcc_constant)
919 if (TREE_VISITED (t))
922 TREE_VISITED (t) = 1;
925 /* If this node has been visited already, unshare it and don't look
927 else if (TREE_VISITED (t))
929 walk_tree (tp, mostly_copy_tree_r, data, NULL);
933 /* Otherwise, mark the node as visited and keep looking. */
935 TREE_VISITED (t) = 1;
940 /* Unshare most of the shared trees rooted at *TP. */
943 copy_if_shared (tree *tp)
945 /* If the language requires deep unsharing, we need a pointer set to make
946 sure we don't repeatedly unshare subtrees of unshareable nodes. */
947 struct pointer_set_t *visited
948 = lang_hooks.deep_unsharing ? pointer_set_create () : NULL;
949 walk_tree (tp, copy_if_shared_r, visited, NULL);
951 pointer_set_destroy (visited);
954 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
955 bodies of any nested functions if we are unsharing the entire body of
959 unshare_body (tree *body_p, tree fndecl)
961 struct cgraph_node *cgn = cgraph_get_node (fndecl);
963 copy_if_shared (body_p);
965 if (cgn && body_p == &DECL_SAVED_TREE (fndecl))
966 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
967 unshare_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
970 /* Callback for walk_tree to unmark the visited trees rooted at *TP.
971 Subtrees are walked until the first unvisited node is encountered. */
974 unmark_visited_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
978 /* If this node has been visited, unmark it and keep looking. */
979 if (TREE_VISITED (t))
980 TREE_VISITED (t) = 0;
982 /* Otherwise, don't look any deeper. */
989 /* Unmark the visited trees rooted at *TP. */
992 unmark_visited (tree *tp)
994 walk_tree (tp, unmark_visited_r, NULL, NULL);
997 /* Likewise, but mark all trees as not visited. */
1000 unvisit_body (tree *body_p, tree fndecl)
1002 struct cgraph_node *cgn = cgraph_get_node (fndecl);
1004 unmark_visited (body_p);
1006 if (cgn && body_p == &DECL_SAVED_TREE (fndecl))
1007 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
1008 unvisit_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
1011 /* Unconditionally make an unshared copy of EXPR. This is used when using
1012 stored expressions which span multiple functions, such as BINFO_VTABLE,
1013 as the normal unsharing process can't tell that they're shared. */
1016 unshare_expr (tree expr)
1018 walk_tree (&expr, mostly_copy_tree_r, NULL, NULL);
1022 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
1023 contain statements and have a value. Assign its value to a temporary
1024 and give it void_type_node. Return the temporary, or NULL_TREE if
1025 WRAPPER was already void. */
1028 voidify_wrapper_expr (tree wrapper, tree temp)
1030 tree type = TREE_TYPE (wrapper);
1031 if (type && !VOID_TYPE_P (type))
1035 /* Set p to point to the body of the wrapper. Loop until we find
1036 something that isn't a wrapper. */
1037 for (p = &wrapper; p && *p; )
1039 switch (TREE_CODE (*p))
1042 TREE_SIDE_EFFECTS (*p) = 1;
1043 TREE_TYPE (*p) = void_type_node;
1044 /* For a BIND_EXPR, the body is operand 1. */
1045 p = &BIND_EXPR_BODY (*p);
1048 case CLEANUP_POINT_EXPR:
1049 case TRY_FINALLY_EXPR:
1050 case TRY_CATCH_EXPR:
1051 TREE_SIDE_EFFECTS (*p) = 1;
1052 TREE_TYPE (*p) = void_type_node;
1053 p = &TREE_OPERAND (*p, 0);
1056 case STATEMENT_LIST:
1058 tree_stmt_iterator i = tsi_last (*p);
1059 TREE_SIDE_EFFECTS (*p) = 1;
1060 TREE_TYPE (*p) = void_type_node;
1061 p = tsi_end_p (i) ? NULL : tsi_stmt_ptr (i);
1066 /* Advance to the last statement. Set all container types to
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);
1117 = gimple_build_call (implicit_built_in_decls[BUILT_IN_STACK_RESTORE],
1121 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
1123 static enum gimplify_status
1124 gimplify_bind_expr (tree *expr_p, gimple_seq *pre_p)
1126 tree bind_expr = *expr_p;
1127 bool old_save_stack = gimplify_ctxp->save_stack;
1132 tree temp = voidify_wrapper_expr (bind_expr, NULL);
1134 /* Mark variables seen in this bind expr. */
1135 for (t = BIND_EXPR_VARS (bind_expr); t ; t = DECL_CHAIN (t))
1137 if (TREE_CODE (t) == VAR_DECL)
1139 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
1141 /* Mark variable as local. */
1142 if (ctx && !DECL_EXTERNAL (t)
1143 && (! DECL_SEEN_IN_BIND_EXPR_P (t)
1144 || splay_tree_lookup (ctx->variables,
1145 (splay_tree_key) t) == NULL))
1146 omp_add_variable (gimplify_omp_ctxp, t, GOVD_LOCAL | GOVD_SEEN);
1148 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
1150 if (DECL_HARD_REGISTER (t) && !is_global_var (t) && cfun)
1151 cfun->has_local_explicit_reg_vars = true;
1154 /* Preliminarily mark non-addressed complex variables as eligible
1155 for promotion to gimple registers. We'll transform their uses
1157 if ((TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
1158 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
1159 && !TREE_THIS_VOLATILE (t)
1160 && (TREE_CODE (t) == VAR_DECL && !DECL_HARD_REGISTER (t))
1161 && !needs_to_live_in_memory (t))
1162 DECL_GIMPLE_REG_P (t) = 1;
1165 gimple_bind = gimple_build_bind (BIND_EXPR_VARS (bind_expr), NULL,
1166 BIND_EXPR_BLOCK (bind_expr));
1167 gimple_push_bind_expr (gimple_bind);
1169 gimplify_ctxp->save_stack = false;
1171 /* Gimplify the body into the GIMPLE_BIND tuple's body. */
1173 gimplify_stmt (&BIND_EXPR_BODY (bind_expr), &body);
1174 gimple_bind_set_body (gimple_bind, body);
1176 if (gimplify_ctxp->save_stack)
1178 gimple stack_save, stack_restore, gs;
1179 gimple_seq cleanup, new_body;
1181 /* Save stack on entry and restore it on exit. Add a try_finally
1182 block to achieve this. Note that mudflap depends on the
1183 format of the emitted code: see mx_register_decls(). */
1184 build_stack_save_restore (&stack_save, &stack_restore);
1186 cleanup = new_body = NULL;
1187 gimplify_seq_add_stmt (&cleanup, stack_restore);
1188 gs = gimple_build_try (gimple_bind_body (gimple_bind), cleanup,
1189 GIMPLE_TRY_FINALLY);
1191 gimplify_seq_add_stmt (&new_body, stack_save);
1192 gimplify_seq_add_stmt (&new_body, gs);
1193 gimple_bind_set_body (gimple_bind, new_body);
1196 gimplify_ctxp->save_stack = old_save_stack;
1197 gimple_pop_bind_expr ();
1199 gimplify_seq_add_stmt (pre_p, gimple_bind);
1207 *expr_p = NULL_TREE;
1211 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1212 GIMPLE value, it is assigned to a new temporary and the statement is
1213 re-written to return the temporary.
1215 PRE_P points to the sequence where side effects that must happen before
1216 STMT should be stored. */
1218 static enum gimplify_status
1219 gimplify_return_expr (tree stmt, gimple_seq *pre_p)
1222 tree ret_expr = TREE_OPERAND (stmt, 0);
1223 tree result_decl, result;
1225 if (ret_expr == error_mark_node)
1229 || TREE_CODE (ret_expr) == RESULT_DECL
1230 || ret_expr == error_mark_node)
1232 gimple ret = gimple_build_return (ret_expr);
1233 gimple_set_no_warning (ret, TREE_NO_WARNING (stmt));
1234 gimplify_seq_add_stmt (pre_p, ret);
1238 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
1239 result_decl = NULL_TREE;
1242 result_decl = TREE_OPERAND (ret_expr, 0);
1244 /* See through a return by reference. */
1245 if (TREE_CODE (result_decl) == INDIRECT_REF)
1246 result_decl = TREE_OPERAND (result_decl, 0);
1248 gcc_assert ((TREE_CODE (ret_expr) == MODIFY_EXPR
1249 || TREE_CODE (ret_expr) == INIT_EXPR)
1250 && TREE_CODE (result_decl) == RESULT_DECL);
1253 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1254 Recall that aggregate_value_p is FALSE for any aggregate type that is
1255 returned in registers. If we're returning values in registers, then
1256 we don't want to extend the lifetime of the RESULT_DECL, particularly
1257 across another call. In addition, for those aggregates for which
1258 hard_function_value generates a PARALLEL, we'll die during normal
1259 expansion of structure assignments; there's special code in expand_return
1260 to handle this case that does not exist in expand_expr. */
1263 else if (aggregate_value_p (result_decl, TREE_TYPE (current_function_decl)))
1265 if (TREE_CODE (DECL_SIZE (result_decl)) != INTEGER_CST)
1267 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (result_decl)))
1268 gimplify_type_sizes (TREE_TYPE (result_decl), pre_p);
1269 /* Note that we don't use gimplify_vla_decl because the RESULT_DECL
1270 should be effectively allocated by the caller, i.e. all calls to
1271 this function must be subject to the Return Slot Optimization. */
1272 gimplify_one_sizepos (&DECL_SIZE (result_decl), pre_p);
1273 gimplify_one_sizepos (&DECL_SIZE_UNIT (result_decl), pre_p);
1275 result = result_decl;
1277 else if (gimplify_ctxp->return_temp)
1278 result = gimplify_ctxp->return_temp;
1281 result = create_tmp_reg (TREE_TYPE (result_decl), NULL);
1283 /* ??? With complex control flow (usually involving abnormal edges),
1284 we can wind up warning about an uninitialized value for this. Due
1285 to how this variable is constructed and initialized, this is never
1286 true. Give up and never warn. */
1287 TREE_NO_WARNING (result) = 1;
1289 gimplify_ctxp->return_temp = result;
1292 /* Smash the lhs of the MODIFY_EXPR to the temporary we plan to use.
1293 Then gimplify the whole thing. */
1294 if (result != result_decl)
1295 TREE_OPERAND (ret_expr, 0) = result;
1297 gimplify_and_add (TREE_OPERAND (stmt, 0), pre_p);
1299 ret = gimple_build_return (result);
1300 gimple_set_no_warning (ret, TREE_NO_WARNING (stmt));
1301 gimplify_seq_add_stmt (pre_p, ret);
1306 /* Gimplify a variable-length array DECL. */
1309 gimplify_vla_decl (tree decl, gimple_seq *seq_p)
1311 /* This is a variable-sized decl. Simplify its size and mark it
1312 for deferred expansion. Note that mudflap depends on the format
1313 of the emitted code: see mx_register_decls(). */
1314 tree t, addr, ptr_type;
1316 gimplify_one_sizepos (&DECL_SIZE (decl), seq_p);
1317 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl), seq_p);
1319 /* All occurrences of this decl in final gimplified code will be
1320 replaced by indirection. Setting DECL_VALUE_EXPR does two
1321 things: First, it lets the rest of the gimplifier know what
1322 replacement to use. Second, it lets the debug info know
1323 where to find the value. */
1324 ptr_type = build_pointer_type (TREE_TYPE (decl));
1325 addr = create_tmp_var (ptr_type, get_name (decl));
1326 DECL_IGNORED_P (addr) = 0;
1327 t = build_fold_indirect_ref (addr);
1328 TREE_THIS_NOTRAP (t) = 1;
1329 SET_DECL_VALUE_EXPR (decl, t);
1330 DECL_HAS_VALUE_EXPR_P (decl) = 1;
1332 t = built_in_decls[BUILT_IN_ALLOCA];
1333 t = build_call_expr (t, 1, DECL_SIZE_UNIT (decl));
1334 /* The call has been built for a variable-sized object. */
1335 CALL_ALLOCA_FOR_VAR_P (t) = 1;
1336 t = fold_convert (ptr_type, t);
1337 t = build2 (MODIFY_EXPR, TREE_TYPE (addr), addr, t);
1339 gimplify_and_add (t, seq_p);
1341 /* Indicate that we need to restore the stack level when the
1342 enclosing BIND_EXPR is exited. */
1343 gimplify_ctxp->save_stack = true;
1346 /* Gimplify a DECL_EXPR node *STMT_P by making any necessary allocation
1347 and initialization explicit. */
1349 static enum gimplify_status
1350 gimplify_decl_expr (tree *stmt_p, gimple_seq *seq_p)
1352 tree stmt = *stmt_p;
1353 tree decl = DECL_EXPR_DECL (stmt);
1355 *stmt_p = NULL_TREE;
1357 if (TREE_TYPE (decl) == error_mark_node)
1360 if ((TREE_CODE (decl) == TYPE_DECL
1361 || TREE_CODE (decl) == VAR_DECL)
1362 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl)))
1363 gimplify_type_sizes (TREE_TYPE (decl), seq_p);
1365 if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl))
1367 tree init = DECL_INITIAL (decl);
1369 if (TREE_CODE (DECL_SIZE_UNIT (decl)) != INTEGER_CST
1370 || (!TREE_STATIC (decl)
1371 && flag_stack_check == GENERIC_STACK_CHECK
1372 && compare_tree_int (DECL_SIZE_UNIT (decl),
1373 STACK_CHECK_MAX_VAR_SIZE) > 0))
1374 gimplify_vla_decl (decl, seq_p);
1376 /* Some front ends do not explicitly declare all anonymous
1377 artificial variables. We compensate here by declaring the
1378 variables, though it would be better if the front ends would
1379 explicitly declare them. */
1380 if (!DECL_SEEN_IN_BIND_EXPR_P (decl)
1381 && DECL_ARTIFICIAL (decl) && DECL_NAME (decl) == NULL_TREE)
1382 gimple_add_tmp_var (decl);
1384 if (init && init != error_mark_node)
1386 if (!TREE_STATIC (decl))
1388 DECL_INITIAL (decl) = NULL_TREE;
1389 init = build2 (INIT_EXPR, void_type_node, decl, init);
1390 gimplify_and_add (init, seq_p);
1394 /* We must still examine initializers for static variables
1395 as they may contain a label address. */
1396 walk_tree (&init, force_labels_r, NULL, NULL);
1403 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1404 and replacing the LOOP_EXPR with goto, but if the loop contains an
1405 EXIT_EXPR, we need to append a label for it to jump to. */
1407 static enum gimplify_status
1408 gimplify_loop_expr (tree *expr_p, gimple_seq *pre_p)
1410 tree saved_label = gimplify_ctxp->exit_label;
1411 tree start_label = create_artificial_label (UNKNOWN_LOCATION);
1413 gimplify_seq_add_stmt (pre_p, gimple_build_label (start_label));
1415 gimplify_ctxp->exit_label = NULL_TREE;
1417 gimplify_and_add (LOOP_EXPR_BODY (*expr_p), pre_p);
1419 gimplify_seq_add_stmt (pre_p, gimple_build_goto (start_label));
1421 if (gimplify_ctxp->exit_label)
1422 gimplify_seq_add_stmt (pre_p,
1423 gimple_build_label (gimplify_ctxp->exit_label));
1425 gimplify_ctxp->exit_label = saved_label;
1431 /* Gimplify a statement list onto a sequence. These may be created either
1432 by an enlightened front-end, or by shortcut_cond_expr. */
1434 static enum gimplify_status
1435 gimplify_statement_list (tree *expr_p, gimple_seq *pre_p)
1437 tree temp = voidify_wrapper_expr (*expr_p, NULL);
1439 tree_stmt_iterator i = tsi_start (*expr_p);
1441 while (!tsi_end_p (i))
1443 gimplify_stmt (tsi_stmt_ptr (i), pre_p);
1456 /* Compare two case labels. Because the front end should already have
1457 made sure that case ranges do not overlap, it is enough to only compare
1458 the CASE_LOW values of each case label. */
1461 compare_case_labels (const void *p1, const void *p2)
1463 const_tree const case1 = *(const_tree const*)p1;
1464 const_tree const case2 = *(const_tree const*)p2;
1466 /* The 'default' case label always goes first. */
1467 if (!CASE_LOW (case1))
1469 else if (!CASE_LOW (case2))
1472 return tree_int_cst_compare (CASE_LOW (case1), CASE_LOW (case2));
1475 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1478 sort_case_labels (VEC(tree,heap)* label_vec)
1480 VEC_qsort (tree, label_vec, compare_case_labels);
1483 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1486 static enum gimplify_status
1487 gimplify_switch_expr (tree *expr_p, gimple_seq *pre_p)
1489 tree switch_expr = *expr_p;
1490 gimple_seq switch_body_seq = NULL;
1491 enum gimplify_status ret;
1493 ret = gimplify_expr (&SWITCH_COND (switch_expr), pre_p, NULL, is_gimple_val,
1495 if (ret == GS_ERROR || ret == GS_UNHANDLED)
1498 if (SWITCH_BODY (switch_expr))
1500 VEC (tree,heap) *labels;
1501 VEC (tree,heap) *saved_labels;
1502 tree default_case = NULL_TREE;
1504 gimple gimple_switch;
1506 /* If someone can be bothered to fill in the labels, they can
1507 be bothered to null out the body too. */
1508 gcc_assert (!SWITCH_LABELS (switch_expr));
1510 /* save old labels, get new ones from body, then restore the old
1511 labels. Save all the things from the switch body to append after. */
1512 saved_labels = gimplify_ctxp->case_labels;
1513 gimplify_ctxp->case_labels = VEC_alloc (tree, heap, 8);
1515 gimplify_stmt (&SWITCH_BODY (switch_expr), &switch_body_seq);
1516 labels = gimplify_ctxp->case_labels;
1517 gimplify_ctxp->case_labels = saved_labels;
1520 while (i < VEC_length (tree, labels))
1522 tree elt = VEC_index (tree, labels, i);
1523 tree low = CASE_LOW (elt);
1524 bool remove_element = FALSE;
1528 /* Discard empty ranges. */
1529 tree high = CASE_HIGH (elt);
1530 if (high && tree_int_cst_lt (high, low))
1531 remove_element = TRUE;
1535 /* The default case must be the last label in the list. */
1536 gcc_assert (!default_case);
1538 remove_element = TRUE;
1542 VEC_ordered_remove (tree, labels, i);
1548 if (!VEC_empty (tree, labels))
1549 sort_case_labels (labels);
1553 tree type = TREE_TYPE (switch_expr);
1555 /* If the switch has no default label, add one, so that we jump
1556 around the switch body. If the labels already cover the whole
1557 range of type, add the default label pointing to one of the
1559 if (type == void_type_node)
1560 type = TREE_TYPE (SWITCH_COND (switch_expr));
1562 && INTEGRAL_TYPE_P (type)
1563 && TYPE_MIN_VALUE (type)
1564 && TYPE_MAX_VALUE (type)
1565 && tree_int_cst_equal (CASE_LOW (VEC_index (tree, labels, 0)),
1566 TYPE_MIN_VALUE (type)))
1568 tree low, high = CASE_HIGH (VEC_index (tree, labels, len - 1));
1570 high = CASE_LOW (VEC_index (tree, labels, len - 1));
1571 if (tree_int_cst_equal (high, TYPE_MAX_VALUE (type)))
1573 for (i = 1; i < len; i++)
1575 high = CASE_LOW (VEC_index (tree, labels, i));
1576 low = CASE_HIGH (VEC_index (tree, labels, i - 1));
1578 low = CASE_LOW (VEC_index (tree, labels, i - 1));
1579 if ((TREE_INT_CST_LOW (low) + 1
1580 != TREE_INT_CST_LOW (high))
1581 || (TREE_INT_CST_HIGH (low)
1582 + (TREE_INT_CST_LOW (high) == 0)
1583 != TREE_INT_CST_HIGH (high)))
1588 tree label = CASE_LABEL (VEC_index (tree, labels, 0));
1589 default_case = build_case_label (NULL_TREE, NULL_TREE,
1600 = build_case_label (NULL_TREE, NULL_TREE,
1601 create_artificial_label (UNKNOWN_LOCATION));
1602 new_default = gimple_build_label (CASE_LABEL (default_case));
1603 gimplify_seq_add_stmt (&switch_body_seq, new_default);
1607 gimple_switch = gimple_build_switch_vec (SWITCH_COND (switch_expr),
1608 default_case, labels);
1609 gimplify_seq_add_stmt (pre_p, gimple_switch);
1610 gimplify_seq_add_seq (pre_p, switch_body_seq);
1611 VEC_free(tree, heap, labels);
1614 gcc_assert (SWITCH_LABELS (switch_expr));
1619 /* Gimplify the CASE_LABEL_EXPR pointed to by EXPR_P. */
1621 static enum gimplify_status
1622 gimplify_case_label_expr (tree *expr_p, gimple_seq *pre_p)
1624 struct gimplify_ctx *ctxp;
1625 gimple gimple_label;
1627 /* Invalid OpenMP programs can play Duff's Device type games with
1628 #pragma omp parallel. At least in the C front end, we don't
1629 detect such invalid branches until after gimplification. */
1630 for (ctxp = gimplify_ctxp; ; ctxp = ctxp->prev_context)
1631 if (ctxp->case_labels)
1634 gimple_label = gimple_build_label (CASE_LABEL (*expr_p));
1635 VEC_safe_push (tree, heap, ctxp->case_labels, *expr_p);
1636 gimplify_seq_add_stmt (pre_p, gimple_label);
1641 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1645 build_and_jump (tree *label_p)
1647 if (label_p == NULL)
1648 /* If there's nowhere to jump, just fall through. */
1651 if (*label_p == NULL_TREE)
1653 tree label = create_artificial_label (UNKNOWN_LOCATION);
1657 return build1 (GOTO_EXPR, void_type_node, *label_p);
1660 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1661 This also involves building a label to jump to and communicating it to
1662 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1664 static enum gimplify_status
1665 gimplify_exit_expr (tree *expr_p)
1667 tree cond = TREE_OPERAND (*expr_p, 0);
1670 expr = build_and_jump (&gimplify_ctxp->exit_label);
1671 expr = build3 (COND_EXPR, void_type_node, cond, expr, NULL_TREE);
1677 /* A helper function to be called via walk_tree. Mark all labels under *TP
1678 as being forced. To be called for DECL_INITIAL of static variables. */
1681 force_labels_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
1685 if (TREE_CODE (*tp) == LABEL_DECL)
1686 FORCED_LABEL (*tp) = 1;
1691 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1692 different from its canonical type, wrap the whole thing inside a
1693 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1696 The canonical type of a COMPONENT_REF is the type of the field being
1697 referenced--unless the field is a bit-field which can be read directly
1698 in a smaller mode, in which case the canonical type is the
1699 sign-appropriate type corresponding to that mode. */
1702 canonicalize_component_ref (tree *expr_p)
1704 tree expr = *expr_p;
1707 gcc_assert (TREE_CODE (expr) == COMPONENT_REF);
1709 if (INTEGRAL_TYPE_P (TREE_TYPE (expr)))
1710 type = TREE_TYPE (get_unwidened (expr, NULL_TREE));
1712 type = TREE_TYPE (TREE_OPERAND (expr, 1));
1714 /* One could argue that all the stuff below is not necessary for
1715 the non-bitfield case and declare it a FE error if type
1716 adjustment would be needed. */
1717 if (TREE_TYPE (expr) != type)
1719 #ifdef ENABLE_TYPES_CHECKING
1720 tree old_type = TREE_TYPE (expr);
1724 /* We need to preserve qualifiers and propagate them from
1726 type_quals = TYPE_QUALS (type)
1727 | TYPE_QUALS (TREE_TYPE (TREE_OPERAND (expr, 0)));
1728 if (TYPE_QUALS (type) != type_quals)
1729 type = build_qualified_type (TYPE_MAIN_VARIANT (type), type_quals);
1731 /* Set the type of the COMPONENT_REF to the underlying type. */
1732 TREE_TYPE (expr) = type;
1734 #ifdef ENABLE_TYPES_CHECKING
1735 /* It is now a FE error, if the conversion from the canonical
1736 type to the original expression type is not useless. */
1737 gcc_assert (useless_type_conversion_p (old_type, type));
1742 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1743 to foo, embed that change in the ADDR_EXPR by converting
1748 where L is the lower bound. For simplicity, only do this for constant
1750 The constraint is that the type of &array[L] is trivially convertible
1754 canonicalize_addr_expr (tree *expr_p)
1756 tree expr = *expr_p;
1757 tree addr_expr = TREE_OPERAND (expr, 0);
1758 tree datype, ddatype, pddatype;
1760 /* We simplify only conversions from an ADDR_EXPR to a pointer type. */
1761 if (!POINTER_TYPE_P (TREE_TYPE (expr))
1762 || TREE_CODE (addr_expr) != ADDR_EXPR)
1765 /* The addr_expr type should be a pointer to an array. */
1766 datype = TREE_TYPE (TREE_TYPE (addr_expr));
1767 if (TREE_CODE (datype) != ARRAY_TYPE)
1770 /* The pointer to element type shall be trivially convertible to
1771 the expression pointer type. */
1772 ddatype = TREE_TYPE (datype);
1773 pddatype = build_pointer_type (ddatype);
1774 if (!useless_type_conversion_p (TYPE_MAIN_VARIANT (TREE_TYPE (expr)),
1778 /* The lower bound and element sizes must be constant. */
1779 if (!TYPE_SIZE_UNIT (ddatype)
1780 || TREE_CODE (TYPE_SIZE_UNIT (ddatype)) != INTEGER_CST
1781 || !TYPE_DOMAIN (datype) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype))
1782 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype))) != INTEGER_CST)
1785 /* All checks succeeded. Build a new node to merge the cast. */
1786 *expr_p = build4 (ARRAY_REF, ddatype, TREE_OPERAND (addr_expr, 0),
1787 TYPE_MIN_VALUE (TYPE_DOMAIN (datype)),
1788 NULL_TREE, NULL_TREE);
1789 *expr_p = build1 (ADDR_EXPR, pddatype, *expr_p);
1791 /* We can have stripped a required restrict qualifier above. */
1792 if (!useless_type_conversion_p (TREE_TYPE (expr), TREE_TYPE (*expr_p)))
1793 *expr_p = fold_convert (TREE_TYPE (expr), *expr_p);
1796 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1797 underneath as appropriate. */
1799 static enum gimplify_status
1800 gimplify_conversion (tree *expr_p)
1803 location_t loc = EXPR_LOCATION (*expr_p);
1804 gcc_assert (CONVERT_EXPR_P (*expr_p));
1806 /* Then strip away all but the outermost conversion. */
1807 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p, 0));
1809 /* And remove the outermost conversion if it's useless. */
1810 if (tree_ssa_useless_type_conversion (*expr_p))
1811 *expr_p = TREE_OPERAND (*expr_p, 0);
1813 /* Attempt to avoid NOP_EXPR by producing reference to a subtype.
1814 For example this fold (subclass *)&A into &A->subclass avoiding
1815 a need for statement. */
1816 if (CONVERT_EXPR_P (*expr_p)
1817 && POINTER_TYPE_P (TREE_TYPE (*expr_p))
1818 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p, 0)))
1819 && (tem = maybe_fold_offset_to_address
1820 (EXPR_LOCATION (*expr_p), TREE_OPERAND (*expr_p, 0),
1821 integer_zero_node, TREE_TYPE (*expr_p))) != NULL_TREE)
1824 /* If we still have a conversion at the toplevel,
1825 then canonicalize some constructs. */
1826 if (CONVERT_EXPR_P (*expr_p))
1828 tree sub = TREE_OPERAND (*expr_p, 0);
1830 /* If a NOP conversion is changing the type of a COMPONENT_REF
1831 expression, then canonicalize its type now in order to expose more
1832 redundant conversions. */
1833 if (TREE_CODE (sub) == COMPONENT_REF)
1834 canonicalize_component_ref (&TREE_OPERAND (*expr_p, 0));
1836 /* If a NOP conversion is changing a pointer to array of foo
1837 to a pointer to foo, embed that change in the ADDR_EXPR. */
1838 else if (TREE_CODE (sub) == ADDR_EXPR)
1839 canonicalize_addr_expr (expr_p);
1842 /* If we have a conversion to a non-register type force the
1843 use of a VIEW_CONVERT_EXPR instead. */
1844 if (CONVERT_EXPR_P (*expr_p) && !is_gimple_reg_type (TREE_TYPE (*expr_p)))
1845 *expr_p = fold_build1_loc (loc, VIEW_CONVERT_EXPR, TREE_TYPE (*expr_p),
1846 TREE_OPERAND (*expr_p, 0));
1851 /* Nonlocal VLAs seen in the current function. */
1852 static struct pointer_set_t *nonlocal_vlas;
1854 /* Gimplify a VAR_DECL or PARM_DECL. Return GS_OK if we expanded a
1855 DECL_VALUE_EXPR, and it's worth re-examining things. */
1857 static enum gimplify_status
1858 gimplify_var_or_parm_decl (tree *expr_p)
1860 tree decl = *expr_p;
1862 /* ??? If this is a local variable, and it has not been seen in any
1863 outer BIND_EXPR, then it's probably the result of a duplicate
1864 declaration, for which we've already issued an error. It would
1865 be really nice if the front end wouldn't leak these at all.
1866 Currently the only known culprit is C++ destructors, as seen
1867 in g++.old-deja/g++.jason/binding.C. */
1868 if (TREE_CODE (decl) == VAR_DECL
1869 && !DECL_SEEN_IN_BIND_EXPR_P (decl)
1870 && !TREE_STATIC (decl) && !DECL_EXTERNAL (decl)
1871 && decl_function_context (decl) == current_function_decl)
1873 gcc_assert (seen_error ());
1877 /* When within an OpenMP context, notice uses of variables. */
1878 if (gimplify_omp_ctxp && omp_notice_variable (gimplify_omp_ctxp, decl, true))
1881 /* If the decl is an alias for another expression, substitute it now. */
1882 if (DECL_HAS_VALUE_EXPR_P (decl))
1884 tree value_expr = DECL_VALUE_EXPR (decl);
1886 /* For referenced nonlocal VLAs add a decl for debugging purposes
1887 to the current function. */
1888 if (TREE_CODE (decl) == VAR_DECL
1889 && TREE_CODE (DECL_SIZE_UNIT (decl)) != INTEGER_CST
1890 && nonlocal_vlas != NULL
1891 && TREE_CODE (value_expr) == INDIRECT_REF
1892 && TREE_CODE (TREE_OPERAND (value_expr, 0)) == VAR_DECL
1893 && decl_function_context (decl) != current_function_decl)
1895 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
1896 while (ctx && ctx->region_type == ORT_WORKSHARE)
1897 ctx = ctx->outer_context;
1898 if (!ctx && !pointer_set_insert (nonlocal_vlas, decl))
1900 tree copy = copy_node (decl), block;
1902 lang_hooks.dup_lang_specific_decl (copy);
1903 SET_DECL_RTL (copy, 0);
1904 TREE_USED (copy) = 1;
1905 block = DECL_INITIAL (current_function_decl);
1906 DECL_CHAIN (copy) = BLOCK_VARS (block);
1907 BLOCK_VARS (block) = copy;
1908 SET_DECL_VALUE_EXPR (copy, unshare_expr (value_expr));
1909 DECL_HAS_VALUE_EXPR_P (copy) = 1;
1913 *expr_p = unshare_expr (value_expr);
1920 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1924 : min_lval '[' val ']'
1926 | compound_lval '[' val ']'
1927 | compound_lval '.' ID
1929 This is not part of the original SIMPLE definition, which separates
1930 array and member references, but it seems reasonable to handle them
1931 together. Also, this way we don't run into problems with union
1932 aliasing; gcc requires that for accesses through a union to alias, the
1933 union reference must be explicit, which was not always the case when we
1934 were splitting up array and member refs.
1936 PRE_P points to the sequence where side effects that must happen before
1937 *EXPR_P should be stored.
1939 POST_P points to the sequence where side effects that must happen after
1940 *EXPR_P should be stored. */
1942 static enum gimplify_status
1943 gimplify_compound_lval (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
1944 fallback_t fallback)
1947 VEC(tree,heap) *stack;
1948 enum gimplify_status ret = GS_ALL_DONE, tret;
1950 location_t loc = EXPR_LOCATION (*expr_p);
1951 tree expr = *expr_p;
1953 /* Create a stack of the subexpressions so later we can walk them in
1954 order from inner to outer. */
1955 stack = VEC_alloc (tree, heap, 10);
1957 /* We can handle anything that get_inner_reference can deal with. */
1958 for (p = expr_p; ; p = &TREE_OPERAND (*p, 0))
1961 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1962 if (TREE_CODE (*p) == INDIRECT_REF)
1963 *p = fold_indirect_ref_loc (loc, *p);
1965 if (handled_component_p (*p))
1967 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
1968 additional COMPONENT_REFs. */
1969 else if ((TREE_CODE (*p) == VAR_DECL || TREE_CODE (*p) == PARM_DECL)
1970 && gimplify_var_or_parm_decl (p) == GS_OK)
1975 VEC_safe_push (tree, heap, stack, *p);
1978 gcc_assert (VEC_length (tree, stack));
1980 /* Now STACK is a stack of pointers to all the refs we've walked through
1981 and P points to the innermost expression.
1983 Java requires that we elaborated nodes in source order. That
1984 means we must gimplify the inner expression followed by each of
1985 the indices, in order. But we can't gimplify the inner
1986 expression until we deal with any variable bounds, sizes, or
1987 positions in order to deal with PLACEHOLDER_EXPRs.
1989 So we do this in three steps. First we deal with the annotations
1990 for any variables in the components, then we gimplify the base,
1991 then we gimplify any indices, from left to right. */
1992 for (i = VEC_length (tree, stack) - 1; i >= 0; i--)
1994 tree t = VEC_index (tree, stack, i);
1996 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
1998 /* Gimplify the low bound and element type size and put them into
1999 the ARRAY_REF. If these values are set, they have already been
2001 if (TREE_OPERAND (t, 2) == NULL_TREE)
2003 tree low = unshare_expr (array_ref_low_bound (t));
2004 if (!is_gimple_min_invariant (low))
2006 TREE_OPERAND (t, 2) = low;
2007 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p,
2008 post_p, is_gimple_reg,
2010 ret = MIN (ret, tret);
2015 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
2016 is_gimple_reg, fb_rvalue);
2017 ret = MIN (ret, tret);
2020 if (TREE_OPERAND (t, 3) == NULL_TREE)
2022 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (t, 0)));
2023 tree elmt_size = unshare_expr (array_ref_element_size (t));
2024 tree factor = size_int (TYPE_ALIGN_UNIT (elmt_type));
2026 /* Divide the element size by the alignment of the element
2029 = size_binop_loc (loc, EXACT_DIV_EXPR, elmt_size, factor);
2031 if (!is_gimple_min_invariant (elmt_size))
2033 TREE_OPERAND (t, 3) = elmt_size;
2034 tret = gimplify_expr (&TREE_OPERAND (t, 3), pre_p,
2035 post_p, is_gimple_reg,
2037 ret = MIN (ret, tret);
2042 tret = gimplify_expr (&TREE_OPERAND (t, 3), pre_p, post_p,
2043 is_gimple_reg, fb_rvalue);
2044 ret = MIN (ret, tret);
2047 else if (TREE_CODE (t) == COMPONENT_REF)
2049 /* Set the field offset into T and gimplify it. */
2050 if (TREE_OPERAND (t, 2) == NULL_TREE)
2052 tree offset = unshare_expr (component_ref_field_offset (t));
2053 tree field = TREE_OPERAND (t, 1);
2055 = size_int (DECL_OFFSET_ALIGN (field) / BITS_PER_UNIT);
2057 /* Divide the offset by its alignment. */
2058 offset = size_binop_loc (loc, EXACT_DIV_EXPR, offset, factor);
2060 if (!is_gimple_min_invariant (offset))
2062 TREE_OPERAND (t, 2) = offset;
2063 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p,
2064 post_p, is_gimple_reg,
2066 ret = MIN (ret, tret);
2071 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
2072 is_gimple_reg, fb_rvalue);
2073 ret = MIN (ret, tret);
2078 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
2079 so as to match the min_lval predicate. Failure to do so may result
2080 in the creation of large aggregate temporaries. */
2081 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval,
2082 fallback | fb_lvalue);
2083 ret = MIN (ret, tret);
2085 /* And finally, the indices and operands to BIT_FIELD_REF. During this
2086 loop we also remove any useless conversions. */
2087 for (; VEC_length (tree, stack) > 0; )
2089 tree t = VEC_pop (tree, stack);
2091 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
2093 /* Gimplify the dimension. */
2094 if (!is_gimple_min_invariant (TREE_OPERAND (t, 1)))
2096 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
2097 is_gimple_val, fb_rvalue);
2098 ret = MIN (ret, tret);
2101 else if (TREE_CODE (t) == BIT_FIELD_REF)
2103 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
2104 is_gimple_val, fb_rvalue);
2105 ret = MIN (ret, tret);
2106 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
2107 is_gimple_val, fb_rvalue);
2108 ret = MIN (ret, tret);
2111 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t, 0));
2113 /* The innermost expression P may have originally had
2114 TREE_SIDE_EFFECTS set which would have caused all the outer
2115 expressions in *EXPR_P leading to P to also have had
2116 TREE_SIDE_EFFECTS set. */
2117 recalculate_side_effects (t);
2120 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
2121 if ((fallback & fb_rvalue) && TREE_CODE (*expr_p) == COMPONENT_REF)
2123 canonicalize_component_ref (expr_p);
2126 VEC_free (tree, heap, stack);
2128 gcc_assert (*expr_p == expr || ret != GS_ALL_DONE);
2133 /* Gimplify the self modifying expression pointed to by EXPR_P
2136 PRE_P points to the list where side effects that must happen before
2137 *EXPR_P should be stored.
2139 POST_P points to the list where side effects that must happen after
2140 *EXPR_P should be stored.
2142 WANT_VALUE is nonzero iff we want to use the value of this expression
2143 in another expression. */
2145 static enum gimplify_status
2146 gimplify_self_mod_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
2149 enum tree_code code;
2150 tree lhs, lvalue, rhs, t1;
2151 gimple_seq post = NULL, *orig_post_p = post_p;
2153 enum tree_code arith_code;
2154 enum gimplify_status ret;
2155 location_t loc = EXPR_LOCATION (*expr_p);
2157 code = TREE_CODE (*expr_p);
2159 gcc_assert (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR
2160 || code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR);
2162 /* Prefix or postfix? */
2163 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
2164 /* Faster to treat as prefix if result is not used. */
2165 postfix = want_value;
2169 /* For postfix, make sure the inner expression's post side effects
2170 are executed after side effects from this expression. */
2174 /* Add or subtract? */
2175 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2176 arith_code = PLUS_EXPR;
2178 arith_code = MINUS_EXPR;
2180 /* Gimplify the LHS into a GIMPLE lvalue. */
2181 lvalue = TREE_OPERAND (*expr_p, 0);
2182 ret = gimplify_expr (&lvalue, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
2183 if (ret == GS_ERROR)
2186 /* Extract the operands to the arithmetic operation. */
2188 rhs = TREE_OPERAND (*expr_p, 1);
2190 /* For postfix operator, we evaluate the LHS to an rvalue and then use
2191 that as the result value and in the postqueue operation. We also
2192 make sure to make lvalue a minimal lval, see
2193 gcc.c-torture/execute/20040313-1.c for an example where this matters. */
2196 if (!is_gimple_min_lval (lvalue))
2198 mark_addressable (lvalue);
2199 lvalue = build_fold_addr_expr_loc (input_location, lvalue);
2200 gimplify_expr (&lvalue, pre_p, post_p, is_gimple_val, fb_rvalue);
2201 lvalue = build_fold_indirect_ref_loc (input_location, lvalue);
2203 ret = gimplify_expr (&lhs, pre_p, post_p, is_gimple_val, fb_rvalue);
2204 if (ret == GS_ERROR)
2208 /* For POINTERs increment, use POINTER_PLUS_EXPR. */
2209 if (POINTER_TYPE_P (TREE_TYPE (lhs)))
2211 rhs = fold_convert_loc (loc, sizetype, rhs);
2212 if (arith_code == MINUS_EXPR)
2213 rhs = fold_build1_loc (loc, NEGATE_EXPR, TREE_TYPE (rhs), rhs);
2214 arith_code = POINTER_PLUS_EXPR;
2217 t1 = build2 (arith_code, TREE_TYPE (*expr_p), lhs, rhs);
2221 gimplify_assign (lvalue, t1, orig_post_p);
2222 gimplify_seq_add_seq (orig_post_p, post);
2228 *expr_p = build2 (MODIFY_EXPR, TREE_TYPE (lvalue), lvalue, t1);
2233 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
2236 maybe_with_size_expr (tree *expr_p)
2238 tree expr = *expr_p;
2239 tree type = TREE_TYPE (expr);
2242 /* If we've already wrapped this or the type is error_mark_node, we can't do
2244 if (TREE_CODE (expr) == WITH_SIZE_EXPR
2245 || type == error_mark_node)
2248 /* If the size isn't known or is a constant, we have nothing to do. */
2249 size = TYPE_SIZE_UNIT (type);
2250 if (!size || TREE_CODE (size) == INTEGER_CST)
2253 /* Otherwise, make a WITH_SIZE_EXPR. */
2254 size = unshare_expr (size);
2255 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, expr);
2256 *expr_p = build2 (WITH_SIZE_EXPR, type, expr, size);
2259 /* Helper for gimplify_call_expr. Gimplify a single argument *ARG_P
2260 Store any side-effects in PRE_P. CALL_LOCATION is the location of
2263 static enum gimplify_status
2264 gimplify_arg (tree *arg_p, gimple_seq *pre_p, location_t call_location)
2266 bool (*test) (tree);
2269 /* In general, we allow lvalues for function arguments to avoid
2270 extra overhead of copying large aggregates out of even larger
2271 aggregates into temporaries only to copy the temporaries to
2272 the argument list. Make optimizers happy by pulling out to
2273 temporaries those types that fit in registers. */
2274 if (is_gimple_reg_type (TREE_TYPE (*arg_p)))
2275 test = is_gimple_val, fb = fb_rvalue;
2278 test = is_gimple_lvalue, fb = fb_either;
2279 /* Also strip a TARGET_EXPR that would force an extra copy. */
2280 if (TREE_CODE (*arg_p) == TARGET_EXPR)
2282 tree init = TARGET_EXPR_INITIAL (*arg_p);
2284 && !VOID_TYPE_P (TREE_TYPE (init)))
2289 /* If this is a variable sized type, we must remember the size. */
2290 maybe_with_size_expr (arg_p);
2292 /* FIXME diagnostics: This will mess up gcc.dg/Warray-bounds.c. */
2293 /* Make sure arguments have the same location as the function call
2295 protected_set_expr_location (*arg_p, call_location);
2297 /* There is a sequence point before a function call. Side effects in
2298 the argument list must occur before the actual call. So, when
2299 gimplifying arguments, force gimplify_expr to use an internal
2300 post queue which is then appended to the end of PRE_P. */
2301 return gimplify_expr (arg_p, pre_p, NULL, test, fb);
2304 /* Gimplify the CALL_EXPR node *EXPR_P into the GIMPLE sequence PRE_P.
2305 WANT_VALUE is true if the result of the call is desired. */
2307 static enum gimplify_status
2308 gimplify_call_expr (tree *expr_p, gimple_seq *pre_p, bool want_value)
2310 tree fndecl, parms, p, fnptrtype;
2311 enum gimplify_status ret;
2314 bool builtin_va_start_p = FALSE;
2315 location_t loc = EXPR_LOCATION (*expr_p);
2317 gcc_assert (TREE_CODE (*expr_p) == CALL_EXPR);
2319 /* For reliable diagnostics during inlining, it is necessary that
2320 every call_expr be annotated with file and line. */
2321 if (! EXPR_HAS_LOCATION (*expr_p))
2322 SET_EXPR_LOCATION (*expr_p, input_location);
2324 /* This may be a call to a builtin function.
2326 Builtin function calls may be transformed into different
2327 (and more efficient) builtin function calls under certain
2328 circumstances. Unfortunately, gimplification can muck things
2329 up enough that the builtin expanders are not aware that certain
2330 transformations are still valid.
2332 So we attempt transformation/gimplification of the call before
2333 we gimplify the CALL_EXPR. At this time we do not manage to
2334 transform all calls in the same manner as the expanders do, but
2335 we do transform most of them. */
2336 fndecl = get_callee_fndecl (*expr_p);
2337 if (fndecl && DECL_BUILT_IN (fndecl))
2339 tree new_tree = fold_call_expr (input_location, *expr_p, !want_value);
2341 if (new_tree && new_tree != *expr_p)
2343 /* There was a transformation of this call which computes the
2344 same value, but in a more efficient way. Return and try
2350 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
2351 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_VA_START)
2353 builtin_va_start_p = TRUE;
2354 if (call_expr_nargs (*expr_p) < 2)
2356 error ("too few arguments to function %<va_start%>");
2357 *expr_p = build_empty_stmt (EXPR_LOCATION (*expr_p));
2361 if (fold_builtin_next_arg (*expr_p, true))
2363 *expr_p = build_empty_stmt (EXPR_LOCATION (*expr_p));
2369 /* Remember the original function pointer type. */
2370 fnptrtype = TREE_TYPE (CALL_EXPR_FN (*expr_p));
2372 /* There is a sequence point before the call, so any side effects in
2373 the calling expression must occur before the actual call. Force
2374 gimplify_expr to use an internal post queue. */
2375 ret = gimplify_expr (&CALL_EXPR_FN (*expr_p), pre_p, NULL,
2376 is_gimple_call_addr, fb_rvalue);
2378 nargs = call_expr_nargs (*expr_p);
2380 /* Get argument types for verification. */
2381 fndecl = get_callee_fndecl (*expr_p);
2384 parms = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
2385 else if (POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_FN (*expr_p))))
2386 parms = TYPE_ARG_TYPES (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (*expr_p))));
2388 if (fndecl && DECL_ARGUMENTS (fndecl))
2389 p = DECL_ARGUMENTS (fndecl);
2394 for (i = 0; i < nargs && p; i++, p = TREE_CHAIN (p))
2397 /* If the last argument is __builtin_va_arg_pack () and it is not
2398 passed as a named argument, decrease the number of CALL_EXPR
2399 arguments and set instead the CALL_EXPR_VA_ARG_PACK flag. */
2402 && TREE_CODE (CALL_EXPR_ARG (*expr_p, nargs - 1)) == CALL_EXPR)
2404 tree last_arg = CALL_EXPR_ARG (*expr_p, nargs - 1);
2405 tree last_arg_fndecl = get_callee_fndecl (last_arg);
2408 && TREE_CODE (last_arg_fndecl) == FUNCTION_DECL
2409 && DECL_BUILT_IN_CLASS (last_arg_fndecl) == BUILT_IN_NORMAL
2410 && DECL_FUNCTION_CODE (last_arg_fndecl) == BUILT_IN_VA_ARG_PACK)
2412 tree call = *expr_p;
2415 *expr_p = build_call_array_loc (loc, TREE_TYPE (call),
2416 CALL_EXPR_FN (call),
2417 nargs, CALL_EXPR_ARGP (call));
2419 /* Copy all CALL_EXPR flags, location and block, except
2420 CALL_EXPR_VA_ARG_PACK flag. */
2421 CALL_EXPR_STATIC_CHAIN (*expr_p) = CALL_EXPR_STATIC_CHAIN (call);
2422 CALL_EXPR_TAILCALL (*expr_p) = CALL_EXPR_TAILCALL (call);
2423 CALL_EXPR_RETURN_SLOT_OPT (*expr_p)
2424 = CALL_EXPR_RETURN_SLOT_OPT (call);
2425 CALL_FROM_THUNK_P (*expr_p) = CALL_FROM_THUNK_P (call);
2426 CALL_CANNOT_INLINE_P (*expr_p) = CALL_CANNOT_INLINE_P (call);
2427 SET_EXPR_LOCATION (*expr_p, EXPR_LOCATION (call));
2428 TREE_BLOCK (*expr_p) = TREE_BLOCK (call);
2430 /* Set CALL_EXPR_VA_ARG_PACK. */
2431 CALL_EXPR_VA_ARG_PACK (*expr_p) = 1;
2435 /* Finally, gimplify the function arguments. */
2438 for (i = (PUSH_ARGS_REVERSED ? nargs - 1 : 0);
2439 PUSH_ARGS_REVERSED ? i >= 0 : i < nargs;
2440 PUSH_ARGS_REVERSED ? i-- : i++)
2442 enum gimplify_status t;
2444 /* Avoid gimplifying the second argument to va_start, which needs to
2445 be the plain PARM_DECL. */
2446 if ((i != 1) || !builtin_va_start_p)
2448 t = gimplify_arg (&CALL_EXPR_ARG (*expr_p, i), pre_p,
2449 EXPR_LOCATION (*expr_p));
2457 /* Verify the function result. */
2458 if (want_value && fndecl
2459 && VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fnptrtype))))
2461 error_at (loc, "using result of function returning %<void%>");
2465 /* Try this again in case gimplification exposed something. */
2466 if (ret != GS_ERROR)
2468 tree new_tree = fold_call_expr (input_location, *expr_p, !want_value);
2470 if (new_tree && new_tree != *expr_p)
2472 /* There was a transformation of this call which computes the
2473 same value, but in a more efficient way. Return and try
2481 *expr_p = error_mark_node;
2485 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2486 decl. This allows us to eliminate redundant or useless
2487 calls to "const" functions. */
2488 if (TREE_CODE (*expr_p) == CALL_EXPR)
2490 int flags = call_expr_flags (*expr_p);
2491 if (flags & (ECF_CONST | ECF_PURE)
2492 /* An infinite loop is considered a side effect. */
2493 && !(flags & (ECF_LOOPING_CONST_OR_PURE)))
2494 TREE_SIDE_EFFECTS (*expr_p) = 0;
2497 /* If the value is not needed by the caller, emit a new GIMPLE_CALL
2498 and clear *EXPR_P. Otherwise, leave *EXPR_P in its gimplified
2499 form and delegate the creation of a GIMPLE_CALL to
2500 gimplify_modify_expr. This is always possible because when
2501 WANT_VALUE is true, the caller wants the result of this call into
2502 a temporary, which means that we will emit an INIT_EXPR in
2503 internal_get_tmp_var which will then be handled by
2504 gimplify_modify_expr. */
2507 /* The CALL_EXPR in *EXPR_P is already in GIMPLE form, so all we
2508 have to do is replicate it as a GIMPLE_CALL tuple. */
2509 gimple_stmt_iterator gsi;
2510 call = gimple_build_call_from_tree (*expr_p);
2511 gimple_call_set_fntype (call, TREE_TYPE (fnptrtype));
2512 gimplify_seq_add_stmt (pre_p, call);
2513 gsi = gsi_last (*pre_p);
2515 *expr_p = NULL_TREE;
2518 /* Remember the original function type. */
2519 CALL_EXPR_FN (*expr_p) = build1 (NOP_EXPR, fnptrtype,
2520 CALL_EXPR_FN (*expr_p));
2525 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2526 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2528 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2529 condition is true or false, respectively. If null, we should generate
2530 our own to skip over the evaluation of this specific expression.
2532 LOCUS is the source location of the COND_EXPR.
2534 This function is the tree equivalent of do_jump.
2536 shortcut_cond_r should only be called by shortcut_cond_expr. */
2539 shortcut_cond_r (tree pred, tree *true_label_p, tree *false_label_p,
2542 tree local_label = NULL_TREE;
2543 tree t, expr = NULL;
2545 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2546 retain the shortcut semantics. Just insert the gotos here;
2547 shortcut_cond_expr will append the real blocks later. */
2548 if (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2550 location_t new_locus;
2552 /* Turn if (a && b) into
2554 if (a); else goto no;
2555 if (b) goto yes; else goto no;
2558 if (false_label_p == NULL)
2559 false_label_p = &local_label;
2561 /* Keep the original source location on the first 'if'. */
2562 t = shortcut_cond_r (TREE_OPERAND (pred, 0), NULL, false_label_p, locus);
2563 append_to_statement_list (t, &expr);
2565 /* Set the source location of the && on the second 'if'. */
2566 new_locus = EXPR_HAS_LOCATION (pred) ? EXPR_LOCATION (pred) : locus;
2567 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p, false_label_p,
2569 append_to_statement_list (t, &expr);
2571 else if (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2573 location_t new_locus;
2575 /* Turn if (a || b) into
2578 if (b) goto yes; else goto no;
2581 if (true_label_p == NULL)
2582 true_label_p = &local_label;
2584 /* Keep the original source location on the first 'if'. */
2585 t = shortcut_cond_r (TREE_OPERAND (pred, 0), true_label_p, NULL, locus);
2586 append_to_statement_list (t, &expr);
2588 /* Set the source location of the || on the second 'if'. */
2589 new_locus = EXPR_HAS_LOCATION (pred) ? EXPR_LOCATION (pred) : locus;
2590 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p, false_label_p,
2592 append_to_statement_list (t, &expr);
2594 else if (TREE_CODE (pred) == COND_EXPR
2595 && !VOID_TYPE_P (TREE_TYPE (TREE_OPERAND (pred, 1)))
2596 && !VOID_TYPE_P (TREE_TYPE (TREE_OPERAND (pred, 2))))
2598 location_t new_locus;
2600 /* As long as we're messing with gotos, turn if (a ? b : c) into
2602 if (b) goto yes; else goto no;
2604 if (c) goto yes; else goto no;
2606 Don't do this if one of the arms has void type, which can happen
2607 in C++ when the arm is throw. */
2609 /* Keep the original source location on the first 'if'. Set the source
2610 location of the ? on the second 'if'. */
2611 new_locus = EXPR_HAS_LOCATION (pred) ? EXPR_LOCATION (pred) : locus;
2612 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (pred, 0),
2613 shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2614 false_label_p, locus),
2615 shortcut_cond_r (TREE_OPERAND (pred, 2), true_label_p,
2616 false_label_p, new_locus));
2620 expr = build3 (COND_EXPR, void_type_node, pred,
2621 build_and_jump (true_label_p),
2622 build_and_jump (false_label_p));
2623 SET_EXPR_LOCATION (expr, locus);
2628 t = build1 (LABEL_EXPR, void_type_node, local_label);
2629 append_to_statement_list (t, &expr);
2635 /* Given a conditional expression EXPR with short-circuit boolean
2636 predicates using TRUTH_ANDIF_EXPR or TRUTH_ORIF_EXPR, break the
2637 predicate appart into the equivalent sequence of conditionals. */
2640 shortcut_cond_expr (tree expr)
2642 tree pred = TREE_OPERAND (expr, 0);
2643 tree then_ = TREE_OPERAND (expr, 1);
2644 tree else_ = TREE_OPERAND (expr, 2);
2645 tree true_label, false_label, end_label, t;
2647 tree *false_label_p;
2648 bool emit_end, emit_false, jump_over_else;
2649 bool then_se = then_ && TREE_SIDE_EFFECTS (then_);
2650 bool else_se = else_ && TREE_SIDE_EFFECTS (else_);
2652 /* First do simple transformations. */
2655 /* If there is no 'else', turn
2658 if (a) if (b) then c. */
2659 while (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2661 /* Keep the original source location on the first 'if'. */
2662 location_t locus = EXPR_LOC_OR_HERE (expr);
2663 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2664 /* Set the source location of the && on the second 'if'. */
2665 if (EXPR_HAS_LOCATION (pred))
2666 SET_EXPR_LOCATION (expr, EXPR_LOCATION (pred));
2667 then_ = shortcut_cond_expr (expr);
2668 then_se = then_ && TREE_SIDE_EFFECTS (then_);
2669 pred = TREE_OPERAND (pred, 0);
2670 expr = build3 (COND_EXPR, void_type_node, pred, then_, NULL_TREE);
2671 SET_EXPR_LOCATION (expr, locus);
2677 /* If there is no 'then', turn
2680 if (a); else if (b); else d. */
2681 while (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2683 /* Keep the original source location on the first 'if'. */
2684 location_t locus = EXPR_LOC_OR_HERE (expr);
2685 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2686 /* Set the source location of the || on the second 'if'. */
2687 if (EXPR_HAS_LOCATION (pred))
2688 SET_EXPR_LOCATION (expr, EXPR_LOCATION (pred));
2689 else_ = shortcut_cond_expr (expr);
2690 else_se = else_ && TREE_SIDE_EFFECTS (else_);
2691 pred = TREE_OPERAND (pred, 0);
2692 expr = build3 (COND_EXPR, void_type_node, pred, NULL_TREE, else_);
2693 SET_EXPR_LOCATION (expr, locus);
2697 /* If we're done, great. */
2698 if (TREE_CODE (pred) != TRUTH_ANDIF_EXPR
2699 && TREE_CODE (pred) != TRUTH_ORIF_EXPR)
2702 /* Otherwise we need to mess with gotos. Change
2705 if (a); else goto no;
2708 and recursively gimplify the condition. */
2710 true_label = false_label = end_label = NULL_TREE;
2712 /* If our arms just jump somewhere, hijack those labels so we don't
2713 generate jumps to jumps. */
2716 && TREE_CODE (then_) == GOTO_EXPR
2717 && TREE_CODE (GOTO_DESTINATION (then_)) == LABEL_DECL)
2719 true_label = GOTO_DESTINATION (then_);
2725 && TREE_CODE (else_) == GOTO_EXPR
2726 && TREE_CODE (GOTO_DESTINATION (else_)) == LABEL_DECL)
2728 false_label = GOTO_DESTINATION (else_);
2733 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2735 true_label_p = &true_label;
2737 true_label_p = NULL;
2739 /* The 'else' branch also needs a label if it contains interesting code. */
2740 if (false_label || else_se)
2741 false_label_p = &false_label;
2743 false_label_p = NULL;
2745 /* If there was nothing else in our arms, just forward the label(s). */
2746 if (!then_se && !else_se)
2747 return shortcut_cond_r (pred, true_label_p, false_label_p,
2748 EXPR_LOC_OR_HERE (expr));
2750 /* If our last subexpression already has a terminal label, reuse it. */
2752 t = expr_last (else_);
2754 t = expr_last (then_);
2757 if (t && TREE_CODE (t) == LABEL_EXPR)
2758 end_label = LABEL_EXPR_LABEL (t);
2760 /* If we don't care about jumping to the 'else' branch, jump to the end
2761 if the condition is false. */
2763 false_label_p = &end_label;
2765 /* We only want to emit these labels if we aren't hijacking them. */
2766 emit_end = (end_label == NULL_TREE);
2767 emit_false = (false_label == NULL_TREE);
2769 /* We only emit the jump over the else clause if we have to--if the
2770 then clause may fall through. Otherwise we can wind up with a
2771 useless jump and a useless label at the end of gimplified code,
2772 which will cause us to think that this conditional as a whole
2773 falls through even if it doesn't. If we then inline a function
2774 which ends with such a condition, that can cause us to issue an
2775 inappropriate warning about control reaching the end of a
2776 non-void function. */
2777 jump_over_else = block_may_fallthru (then_);
2779 pred = shortcut_cond_r (pred, true_label_p, false_label_p,
2780 EXPR_LOC_OR_HERE (expr));
2783 append_to_statement_list (pred, &expr);
2785 append_to_statement_list (then_, &expr);
2790 tree last = expr_last (expr);
2791 t = build_and_jump (&end_label);
2792 if (EXPR_HAS_LOCATION (last))
2793 SET_EXPR_LOCATION (t, EXPR_LOCATION (last));
2794 append_to_statement_list (t, &expr);
2798 t = build1 (LABEL_EXPR, void_type_node, false_label);
2799 append_to_statement_list (t, &expr);
2801 append_to_statement_list (else_, &expr);
2803 if (emit_end && end_label)
2805 t = build1 (LABEL_EXPR, void_type_node, end_label);
2806 append_to_statement_list (t, &expr);
2812 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2815 gimple_boolify (tree expr)
2817 tree type = TREE_TYPE (expr);
2818 location_t loc = EXPR_LOCATION (expr);
2820 if (TREE_CODE (expr) == NE_EXPR
2821 && TREE_CODE (TREE_OPERAND (expr, 0)) == CALL_EXPR
2822 && integer_zerop (TREE_OPERAND (expr, 1)))
2824 tree call = TREE_OPERAND (expr, 0);
2825 tree fn = get_callee_fndecl (call);
2827 /* For __builtin_expect ((long) (x), y) recurse into x as well
2828 if x is truth_value_p. */
2830 && DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2831 && DECL_FUNCTION_CODE (fn) == BUILT_IN_EXPECT
2832 && call_expr_nargs (call) == 2)
2834 tree arg = CALL_EXPR_ARG (call, 0);
2837 if (TREE_CODE (arg) == NOP_EXPR
2838 && TREE_TYPE (arg) == TREE_TYPE (call))
2839 arg = TREE_OPERAND (arg, 0);
2840 if (truth_value_p (TREE_CODE (arg)))
2842 arg = gimple_boolify (arg);
2843 CALL_EXPR_ARG (call, 0)
2844 = fold_convert_loc (loc, TREE_TYPE (call), arg);
2850 switch (TREE_CODE (expr))
2852 case TRUTH_AND_EXPR:
2854 case TRUTH_XOR_EXPR:
2855 case TRUTH_ANDIF_EXPR:
2856 case TRUTH_ORIF_EXPR:
2857 /* Also boolify the arguments of truth exprs. */
2858 TREE_OPERAND (expr, 1) = gimple_boolify (TREE_OPERAND (expr, 1));
2861 case TRUTH_NOT_EXPR:
2862 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2865 case EQ_EXPR: case NE_EXPR:
2866 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2867 /* These expressions always produce boolean results. */
2868 TREE_TYPE (expr) = boolean_type_node;
2872 /* Other expressions that get here must have boolean values, but
2873 might need to be converted to the appropriate mode. */
2874 if (type == boolean_type_node)
2876 return fold_convert_loc (loc, boolean_type_node, expr);
2880 /* Given a conditional expression *EXPR_P without side effects, gimplify
2881 its operands. New statements are inserted to PRE_P. */
2883 static enum gimplify_status
2884 gimplify_pure_cond_expr (tree *expr_p, gimple_seq *pre_p)
2886 tree expr = *expr_p, cond;
2887 enum gimplify_status ret, tret;
2888 enum tree_code code;
2890 cond = gimple_boolify (COND_EXPR_COND (expr));
2892 /* We need to handle && and || specially, as their gimplification
2893 creates pure cond_expr, thus leading to an infinite cycle otherwise. */
2894 code = TREE_CODE (cond);
2895 if (code == TRUTH_ANDIF_EXPR)
2896 TREE_SET_CODE (cond, TRUTH_AND_EXPR);
2897 else if (code == TRUTH_ORIF_EXPR)
2898 TREE_SET_CODE (cond, TRUTH_OR_EXPR);
2899 ret = gimplify_expr (&cond, pre_p, NULL, is_gimple_condexpr, fb_rvalue);
2900 COND_EXPR_COND (*expr_p) = cond;
2902 tret = gimplify_expr (&COND_EXPR_THEN (expr), pre_p, NULL,
2903 is_gimple_val, fb_rvalue);
2904 ret = MIN (ret, tret);
2905 tret = gimplify_expr (&COND_EXPR_ELSE (expr), pre_p, NULL,
2906 is_gimple_val, fb_rvalue);
2908 return MIN (ret, tret);
2911 /* Return true if evaluating EXPR could trap.
2912 EXPR is GENERIC, while tree_could_trap_p can be called
2916 generic_expr_could_trap_p (tree expr)
2920 if (!expr || is_gimple_val (expr))
2923 if (!EXPR_P (expr) || tree_could_trap_p (expr))
2926 n = TREE_OPERAND_LENGTH (expr);
2927 for (i = 0; i < n; i++)
2928 if (generic_expr_could_trap_p (TREE_OPERAND (expr, i)))
2934 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2943 The second form is used when *EXPR_P is of type void.
2945 PRE_P points to the list where side effects that must happen before
2946 *EXPR_P should be stored. */
2948 static enum gimplify_status
2949 gimplify_cond_expr (tree *expr_p, gimple_seq *pre_p, fallback_t fallback)
2951 tree expr = *expr_p;
2952 tree type = TREE_TYPE (expr);
2953 location_t loc = EXPR_LOCATION (expr);
2954 tree tmp, arm1, arm2;
2955 enum gimplify_status ret;
2956 tree label_true, label_false, label_cont;
2957 bool have_then_clause_p, have_else_clause_p;
2959 enum tree_code pred_code;
2960 gimple_seq seq = NULL;
2962 /* If this COND_EXPR has a value, copy the values into a temporary within
2964 if (!VOID_TYPE_P (type))
2966 tree then_ = TREE_OPERAND (expr, 1), else_ = TREE_OPERAND (expr, 2);
2969 /* If either an rvalue is ok or we do not require an lvalue, create the
2970 temporary. But we cannot do that if the type is addressable. */
2971 if (((fallback & fb_rvalue) || !(fallback & fb_lvalue))
2972 && !TREE_ADDRESSABLE (type))
2974 if (gimplify_ctxp->allow_rhs_cond_expr
2975 /* If either branch has side effects or could trap, it can't be
2976 evaluated unconditionally. */
2977 && !TREE_SIDE_EFFECTS (then_)
2978 && !generic_expr_could_trap_p (then_)
2979 && !TREE_SIDE_EFFECTS (else_)
2980 && !generic_expr_could_trap_p (else_))
2981 return gimplify_pure_cond_expr (expr_p, pre_p);
2983 tmp = create_tmp_var (type, "iftmp");
2987 /* Otherwise, only create and copy references to the values. */
2990 type = build_pointer_type (type);
2992 if (!VOID_TYPE_P (TREE_TYPE (then_)))
2993 then_ = build_fold_addr_expr_loc (loc, then_);
2995 if (!VOID_TYPE_P (TREE_TYPE (else_)))
2996 else_ = build_fold_addr_expr_loc (loc, else_);
2999 = build3 (COND_EXPR, type, TREE_OPERAND (expr, 0), then_, else_);
3001 tmp = create_tmp_var (type, "iftmp");
3002 result = build_simple_mem_ref_loc (loc, tmp);
3005 /* Build the new then clause, `tmp = then_;'. But don't build the
3006 assignment if the value is void; in C++ it can be if it's a throw. */
3007 if (!VOID_TYPE_P (TREE_TYPE (then_)))
3008 TREE_OPERAND (expr, 1) = build2 (MODIFY_EXPR, type, tmp, then_);
3010 /* Similarly, build the new else clause, `tmp = else_;'. */
3011 if (!VOID_TYPE_P (TREE_TYPE (else_)))
3012 TREE_OPERAND (expr, 2) = build2 (MODIFY_EXPR, type, tmp, else_);
3014 TREE_TYPE (expr) = void_type_node;
3015 recalculate_side_effects (expr);
3017 /* Move the COND_EXPR to the prequeue. */
3018 gimplify_stmt (&expr, pre_p);
3024 /* Remove any COMPOUND_EXPR so the following cases will be caught. */
3025 STRIP_TYPE_NOPS (TREE_OPERAND (expr, 0));
3026 if (TREE_CODE (TREE_OPERAND (expr, 0)) == COMPOUND_EXPR)
3027 gimplify_compound_expr (&TREE_OPERAND (expr, 0), pre_p, true);
3029 /* Make sure the condition has BOOLEAN_TYPE. */
3030 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
3032 /* Break apart && and || conditions. */
3033 if (TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ANDIF_EXPR
3034 || TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ORIF_EXPR)
3036 expr = shortcut_cond_expr (expr);
3038 if (expr != *expr_p)
3042 /* We can't rely on gimplify_expr to re-gimplify the expanded
3043 form properly, as cleanups might cause the target labels to be
3044 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
3045 set up a conditional context. */
3046 gimple_push_condition ();
3047 gimplify_stmt (expr_p, &seq);
3048 gimple_pop_condition (pre_p);
3049 gimple_seq_add_seq (pre_p, seq);
3055 /* Now do the normal gimplification. */
3057 /* Gimplify condition. */
3058 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL, is_gimple_condexpr,
3060 if (ret == GS_ERROR)
3062 gcc_assert (TREE_OPERAND (expr, 0) != NULL_TREE);
3064 gimple_push_condition ();
3066 have_then_clause_p = have_else_clause_p = false;
3067 if (TREE_OPERAND (expr, 1) != NULL
3068 && TREE_CODE (TREE_OPERAND (expr, 1)) == GOTO_EXPR
3069 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr, 1))) == LABEL_DECL
3070 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr, 1)))
3071 == current_function_decl)
3072 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
3073 have different locations, otherwise we end up with incorrect
3074 location information on the branches. */
3076 || !EXPR_HAS_LOCATION (expr)
3077 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr, 1))
3078 || EXPR_LOCATION (expr) == EXPR_LOCATION (TREE_OPERAND (expr, 1))))
3080 label_true = GOTO_DESTINATION (TREE_OPERAND (expr, 1));
3081 have_then_clause_p = true;
3084 label_true = create_artificial_label (UNKNOWN_LOCATION);
3085 if (TREE_OPERAND (expr, 2) != NULL
3086 && TREE_CODE (TREE_OPERAND (expr, 2)) == GOTO_EXPR
3087 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr, 2))) == LABEL_DECL
3088 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr, 2)))
3089 == current_function_decl)
3090 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
3091 have different locations, otherwise we end up with incorrect
3092 location information on the branches. */
3094 || !EXPR_HAS_LOCATION (expr)
3095 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr, 2))
3096 || EXPR_LOCATION (expr) == EXPR_LOCATION (TREE_OPERAND (expr, 2))))
3098 label_false = GOTO_DESTINATION (TREE_OPERAND (expr, 2));
3099 have_else_clause_p = true;
3102 label_false = create_artificial_label (UNKNOWN_LOCATION);
3104 gimple_cond_get_ops_from_tree (COND_EXPR_COND (expr), &pred_code, &arm1,
3107 gimple_cond = gimple_build_cond (pred_code, arm1, arm2, label_true,
3110 gimplify_seq_add_stmt (&seq, gimple_cond);
3111 label_cont = NULL_TREE;
3112 if (!have_then_clause_p)
3114 /* For if (...) {} else { code; } put label_true after
3116 if (TREE_OPERAND (expr, 1) == NULL_TREE
3117 && !have_else_clause_p
3118 && TREE_OPERAND (expr, 2) != NULL_TREE)
3119 label_cont = label_true;
3122 gimplify_seq_add_stmt (&seq, gimple_build_label (label_true));
3123 have_then_clause_p = gimplify_stmt (&TREE_OPERAND (expr, 1), &seq);
3124 /* For if (...) { code; } else {} or
3125 if (...) { code; } else goto label; or
3126 if (...) { code; return; } else { ... }
3127 label_cont isn't needed. */
3128 if (!have_else_clause_p
3129 && TREE_OPERAND (expr, 2) != NULL_TREE
3130 && gimple_seq_may_fallthru (seq))
3133 label_cont = create_artificial_label (UNKNOWN_LOCATION);
3135 g = gimple_build_goto (label_cont);
3137 /* GIMPLE_COND's are very low level; they have embedded
3138 gotos. This particular embedded goto should not be marked
3139 with the location of the original COND_EXPR, as it would
3140 correspond to the COND_EXPR's condition, not the ELSE or the
3141 THEN arms. To avoid marking it with the wrong location, flag
3142 it as "no location". */
3143 gimple_set_do_not_emit_location (g);
3145 gimplify_seq_add_stmt (&seq, g);
3149 if (!have_else_clause_p)
3151 gimplify_seq_add_stmt (&seq, gimple_build_label (label_false));
3152 have_else_clause_p = gimplify_stmt (&TREE_OPERAND (expr, 2), &seq);
3155 gimplify_seq_add_stmt (&seq, gimple_build_label (label_cont));
3157 gimple_pop_condition (pre_p);
3158 gimple_seq_add_seq (pre_p, seq);
3160 if (ret == GS_ERROR)
3162 else if (have_then_clause_p || have_else_clause_p)
3166 /* Both arms are empty; replace the COND_EXPR with its predicate. */
3167 expr = TREE_OPERAND (expr, 0);
3168 gimplify_stmt (&expr, pre_p);
3175 /* Prepare the node pointed to by EXPR_P, an is_gimple_addressable expression,
3176 to be marked addressable.
3178 We cannot rely on such an expression being directly markable if a temporary
3179 has been created by the gimplification. In this case, we create another
3180 temporary and initialize it with a copy, which will become a store after we
3181 mark it addressable. This can happen if the front-end passed us something
3182 that it could not mark addressable yet, like a Fortran pass-by-reference
3183 parameter (int) floatvar. */
3186 prepare_gimple_addressable (tree *expr_p, gimple_seq *seq_p)
3188 while (handled_component_p (*expr_p))
3189 expr_p = &TREE_OPERAND (*expr_p, 0);
3190 if (is_gimple_reg (*expr_p))
3191 *expr_p = get_initialized_tmp_var (*expr_p, seq_p, NULL);
3194 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3195 a call to __builtin_memcpy. */
3197 static enum gimplify_status
3198 gimplify_modify_expr_to_memcpy (tree *expr_p, tree size, bool want_value,
3201 tree t, to, to_ptr, from, from_ptr;
3203 location_t loc = EXPR_LOCATION (*expr_p);
3205 to = TREE_OPERAND (*expr_p, 0);
3206 from = TREE_OPERAND (*expr_p, 1);
3208 /* Mark the RHS addressable. Beware that it may not be possible to do so
3209 directly if a temporary has been created by the gimplification. */
3210 prepare_gimple_addressable (&from, seq_p);
3212 mark_addressable (from);
3213 from_ptr = build_fold_addr_expr_loc (loc, from);
3214 gimplify_arg (&from_ptr, seq_p, loc);
3216 mark_addressable (to);
3217 to_ptr = build_fold_addr_expr_loc (loc, to);
3218 gimplify_arg (&to_ptr, seq_p, loc);
3220 t = implicit_built_in_decls[BUILT_IN_MEMCPY];
3222 gs = gimple_build_call (t, 3, to_ptr, from_ptr, size);
3226 /* tmp = memcpy() */
3227 t = create_tmp_var (TREE_TYPE (to_ptr), NULL);
3228 gimple_call_set_lhs (gs, t);
3229 gimplify_seq_add_stmt (seq_p, gs);
3231 *expr_p = build_simple_mem_ref (t);
3235 gimplify_seq_add_stmt (seq_p, gs);
3240 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3241 a call to __builtin_memset. In this case we know that the RHS is
3242 a CONSTRUCTOR with an empty element list. */
3244 static enum gimplify_status
3245 gimplify_modify_expr_to_memset (tree *expr_p, tree size, bool want_value,
3248 tree t, from, to, to_ptr;
3250 location_t loc = EXPR_LOCATION (*expr_p);
3252 /* Assert our assumptions, to abort instead of producing wrong code
3253 silently if they are not met. Beware that the RHS CONSTRUCTOR might
3254 not be immediately exposed. */
3255 from = TREE_OPERAND (*expr_p, 1);
3256 if (TREE_CODE (from) == WITH_SIZE_EXPR)
3257 from = TREE_OPERAND (from, 0);
3259 gcc_assert (TREE_CODE (from) == CONSTRUCTOR
3260 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (from)));
3263 to = TREE_OPERAND (*expr_p, 0);
3265 to_ptr = build_fold_addr_expr_loc (loc, to);
3266 gimplify_arg (&to_ptr, seq_p, loc);
3267 t = implicit_built_in_decls[BUILT_IN_MEMSET];
3269 gs = gimple_build_call (t, 3, to_ptr, integer_zero_node, size);
3273 /* tmp = memset() */
3274 t = create_tmp_var (TREE_TYPE (to_ptr), NULL);
3275 gimple_call_set_lhs (gs, t);
3276 gimplify_seq_add_stmt (seq_p, gs);
3278 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (to), t);
3282 gimplify_seq_add_stmt (seq_p, gs);
3287 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
3288 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
3289 assignment. Return non-null if we detect a potential overlap. */
3291 struct gimplify_init_ctor_preeval_data
3293 /* The base decl of the lhs object. May be NULL, in which case we
3294 have to assume the lhs is indirect. */
3297 /* The alias set of the lhs object. */
3298 alias_set_type lhs_alias_set;
3302 gimplify_init_ctor_preeval_1 (tree *tp, int *walk_subtrees, void *xdata)
3304 struct gimplify_init_ctor_preeval_data *data
3305 = (struct gimplify_init_ctor_preeval_data *) xdata;
3308 /* If we find the base object, obviously we have overlap. */
3309 if (data->lhs_base_decl == t)
3312 /* If the constructor component is indirect, determine if we have a
3313 potential overlap with the lhs. The only bits of information we
3314 have to go on at this point are addressability and alias sets. */
3315 if ((INDIRECT_REF_P (t)
3316 || TREE_CODE (t) == MEM_REF)
3317 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
3318 && alias_sets_conflict_p (data->lhs_alias_set, get_alias_set (t)))
3321 /* If the constructor component is a call, determine if it can hide a
3322 potential overlap with the lhs through an INDIRECT_REF like above.
3323 ??? Ugh - this is completely broken. In fact this whole analysis
3324 doesn't look conservative. */
3325 if (TREE_CODE (t) == CALL_EXPR)
3327 tree type, fntype = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (t)));
3329 for (type = TYPE_ARG_TYPES (fntype); type; type = TREE_CHAIN (type))
3330 if (POINTER_TYPE_P (TREE_VALUE (type))
3331 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
3332 && alias_sets_conflict_p (data->lhs_alias_set,
3334 (TREE_TYPE (TREE_VALUE (type)))))
3338 if (IS_TYPE_OR_DECL_P (t))
3343 /* A subroutine of gimplify_init_constructor. Pre-evaluate EXPR,
3344 force values that overlap with the lhs (as described by *DATA)
3345 into temporaries. */
3348 gimplify_init_ctor_preeval (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
3349 struct gimplify_init_ctor_preeval_data *data)
3351 enum gimplify_status one;
3353 /* If the value is constant, then there's nothing to pre-evaluate. */
3354 if (TREE_CONSTANT (*expr_p))
3356 /* Ensure it does not have side effects, it might contain a reference to
3357 the object we're initializing. */
3358 gcc_assert (!TREE_SIDE_EFFECTS (*expr_p));
3362 /* If the type has non-trivial constructors, we can't pre-evaluate. */
3363 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p)))
3366 /* Recurse for nested constructors. */
3367 if (TREE_CODE (*expr_p) == CONSTRUCTOR)
3369 unsigned HOST_WIDE_INT ix;
3370 constructor_elt *ce;
3371 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (*expr_p);
3373 FOR_EACH_VEC_ELT (constructor_elt, v, ix, ce)
3374 gimplify_init_ctor_preeval (&ce->value, pre_p, post_p, data);
3379 /* If this is a variable sized type, we must remember the size. */
3380 maybe_with_size_expr (expr_p);
3382 /* Gimplify the constructor element to something appropriate for the rhs
3383 of a MODIFY_EXPR. Given that we know the LHS is an aggregate, we know
3384 the gimplifier will consider this a store to memory. Doing this
3385 gimplification now means that we won't have to deal with complicated
3386 language-specific trees, nor trees like SAVE_EXPR that can induce
3387 exponential search behavior. */
3388 one = gimplify_expr (expr_p, pre_p, post_p, is_gimple_mem_rhs, fb_rvalue);
3389 if (one == GS_ERROR)
3395 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
3396 with the lhs, since "a = { .x=a }" doesn't make sense. This will
3397 always be true for all scalars, since is_gimple_mem_rhs insists on a
3398 temporary variable for them. */
3399 if (DECL_P (*expr_p))
3402 /* If this is of variable size, we have no choice but to assume it doesn't
3403 overlap since we can't make a temporary for it. */
3404 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (*expr_p))) != INTEGER_CST)
3407 /* Otherwise, we must search for overlap ... */
3408 if (!walk_tree (expr_p, gimplify_init_ctor_preeval_1, data, NULL))
3411 /* ... and if found, force the value into a temporary. */
3412 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
3415 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
3416 a RANGE_EXPR in a CONSTRUCTOR for an array.
3420 object[var] = value;
3427 We increment var _after_ the loop exit check because we might otherwise
3428 fail if upper == TYPE_MAX_VALUE (type for upper).
3430 Note that we never have to deal with SAVE_EXPRs here, because this has
3431 already been taken care of for us, in gimplify_init_ctor_preeval(). */
3433 static void gimplify_init_ctor_eval (tree, VEC(constructor_elt,gc) *,
3434 gimple_seq *, bool);
3437 gimplify_init_ctor_eval_range (tree object, tree lower, tree upper,
3438 tree value, tree array_elt_type,
3439 gimple_seq *pre_p, bool cleared)
3441 tree loop_entry_label, loop_exit_label, fall_thru_label;
3442 tree var, var_type, cref, tmp;
3444 loop_entry_label = create_artificial_label (UNKNOWN_LOCATION);
3445 loop_exit_label = create_artificial_label (UNKNOWN_LOCATION);
3446 fall_thru_label = create_artificial_label (UNKNOWN_LOCATION);
3448 /* Create and initialize the index variable. */
3449 var_type = TREE_TYPE (upper);
3450 var = create_tmp_var (var_type, NULL);
3451 gimplify_seq_add_stmt (pre_p, gimple_build_assign (var, lower));
3453 /* Add the loop entry label. */
3454 gimplify_seq_add_stmt (pre_p, gimple_build_label (loop_entry_label));
3456 /* Build the reference. */
3457 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
3458 var, NULL_TREE, NULL_TREE);
3460 /* If we are a constructor, just call gimplify_init_ctor_eval to do
3461 the store. Otherwise just assign value to the reference. */
3463 if (TREE_CODE (value) == CONSTRUCTOR)
3464 /* NB we might have to call ourself recursively through
3465 gimplify_init_ctor_eval if the value is a constructor. */
3466 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
3469 gimplify_seq_add_stmt (pre_p, gimple_build_assign (cref, value));
3471 /* We exit the loop when the index var is equal to the upper bound. */
3472 gimplify_seq_add_stmt (pre_p,
3473 gimple_build_cond (EQ_EXPR, var, upper,
3474 loop_exit_label, fall_thru_label));
3476 gimplify_seq_add_stmt (pre_p, gimple_build_label (fall_thru_label));
3478 /* Otherwise, increment the index var... */
3479 tmp = build2 (PLUS_EXPR, var_type, var,
3480 fold_convert (var_type, integer_one_node));
3481 gimplify_seq_add_stmt (pre_p, gimple_build_assign (var, tmp));
3483 /* ...and jump back to the loop entry. */
3484 gimplify_seq_add_stmt (pre_p, gimple_build_goto (loop_entry_label));
3486 /* Add the loop exit label. */
3487 gimplify_seq_add_stmt (pre_p, gimple_build_label (loop_exit_label));
3490 /* Return true if FDECL is accessing a field that is zero sized. */
3493 zero_sized_field_decl (const_tree fdecl)
3495 if (TREE_CODE (fdecl) == FIELD_DECL && DECL_SIZE (fdecl)
3496 && integer_zerop (DECL_SIZE (fdecl)))
3501 /* Return true if TYPE is zero sized. */
3504 zero_sized_type (const_tree type)
3506 if (AGGREGATE_TYPE_P (type) && TYPE_SIZE (type)
3507 && integer_zerop (TYPE_SIZE (type)))
3512 /* A subroutine of gimplify_init_constructor. Generate individual
3513 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
3514 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
3515 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
3519 gimplify_init_ctor_eval (tree object, VEC(constructor_elt,gc) *elts,
3520 gimple_seq *pre_p, bool cleared)
3522 tree array_elt_type = NULL;
3523 unsigned HOST_WIDE_INT ix;
3524 tree purpose, value;
3526 if (TREE_CODE (TREE_TYPE (object)) == ARRAY_TYPE)
3527 array_elt_type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object)));
3529 FOR_EACH_CONSTRUCTOR_ELT (elts, ix, purpose, value)
3533 /* NULL values are created above for gimplification errors. */
3537 if (cleared && initializer_zerop (value))
3540 /* ??? Here's to hoping the front end fills in all of the indices,
3541 so we don't have to figure out what's missing ourselves. */
3542 gcc_assert (purpose);
3544 /* Skip zero-sized fields, unless value has side-effects. This can
3545 happen with calls to functions returning a zero-sized type, which
3546 we shouldn't discard. As a number of downstream passes don't
3547 expect sets of zero-sized fields, we rely on the gimplification of
3548 the MODIFY_EXPR we make below to drop the assignment statement. */
3549 if (! TREE_SIDE_EFFECTS (value) && zero_sized_field_decl (purpose))
3552 /* If we have a RANGE_EXPR, we have to build a loop to assign the
3554 if (TREE_CODE (purpose) == RANGE_EXPR)
3556 tree lower = TREE_OPERAND (purpose, 0);
3557 tree upper = TREE_OPERAND (purpose, 1);
3559 /* If the lower bound is equal to upper, just treat it as if
3560 upper was the index. */
3561 if (simple_cst_equal (lower, upper))
3565 gimplify_init_ctor_eval_range (object, lower, upper, value,
3566 array_elt_type, pre_p, cleared);
3573 /* Do not use bitsizetype for ARRAY_REF indices. */
3574 if (TYPE_DOMAIN (TREE_TYPE (object)))
3576 = fold_convert (TREE_TYPE (TYPE_DOMAIN (TREE_TYPE (object))),
3578 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
3579 purpose, NULL_TREE, NULL_TREE);
3583 gcc_assert (TREE_CODE (purpose) == FIELD_DECL);
3584 cref = build3 (COMPONENT_REF, TREE_TYPE (purpose),
3585 unshare_expr (object), purpose, NULL_TREE);
3588 if (TREE_CODE (value) == CONSTRUCTOR
3589 && TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE)
3590 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
3594 tree init = build2 (INIT_EXPR, TREE_TYPE (cref), cref, value);
3595 gimplify_and_add (init, pre_p);
3601 /* Return the appropriate RHS predicate for this LHS. */
3604 rhs_predicate_for (tree lhs)
3606 if (is_gimple_reg (lhs))
3607 return is_gimple_reg_rhs_or_call;
3609 return is_gimple_mem_rhs_or_call;
3612 /* Gimplify a C99 compound literal expression. This just means adding
3613 the DECL_EXPR before the current statement and using its anonymous
3616 static enum gimplify_status
3617 gimplify_compound_literal_expr (tree *expr_p, gimple_seq *pre_p)
3619 tree decl_s = COMPOUND_LITERAL_EXPR_DECL_EXPR (*expr_p);
3620 tree decl = DECL_EXPR_DECL (decl_s);
3621 /* Mark the decl as addressable if the compound literal
3622 expression is addressable now, otherwise it is marked too late
3623 after we gimplify the initialization expression. */
3624 if (TREE_ADDRESSABLE (*expr_p))
3625 TREE_ADDRESSABLE (decl) = 1;
3627 /* Preliminarily mark non-addressed complex variables as eligible
3628 for promotion to gimple registers. We'll transform their uses
3630 if ((TREE_CODE (TREE_TYPE (decl)) == COMPLEX_TYPE
3631 || TREE_CODE (TREE_TYPE (decl)) == VECTOR_TYPE)
3632 && !TREE_THIS_VOLATILE (decl)
3633 && !needs_to_live_in_memory (decl))
3634 DECL_GIMPLE_REG_P (decl) = 1;
3636 /* This decl isn't mentioned in the enclosing block, so add it to the
3637 list of temps. FIXME it seems a bit of a kludge to say that
3638 anonymous artificial vars aren't pushed, but everything else is. */
3639 if (DECL_NAME (decl) == NULL_TREE && !DECL_SEEN_IN_BIND_EXPR_P (decl))
3640 gimple_add_tmp_var (decl);
3642 gimplify_and_add (decl_s, pre_p);
3647 /* Optimize embedded COMPOUND_LITERAL_EXPRs within a CONSTRUCTOR,
3648 return a new CONSTRUCTOR if something changed. */
3651 optimize_compound_literals_in_ctor (tree orig_ctor)
3653 tree ctor = orig_ctor;
3654 VEC(constructor_elt,gc) *elts = CONSTRUCTOR_ELTS (ctor);
3655 unsigned int idx, num = VEC_length (constructor_elt, elts);
3657 for (idx = 0; idx < num; idx++)
3659 tree value = VEC_index (constructor_elt, elts, idx)->value;
3660 tree newval = value;
3661 if (TREE_CODE (value) == CONSTRUCTOR)
3662 newval = optimize_compound_literals_in_ctor (value);
3663 else if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
3665 tree decl_s = COMPOUND_LITERAL_EXPR_DECL_EXPR (value);
3666 tree decl = DECL_EXPR_DECL (decl_s);
3667 tree init = DECL_INITIAL (decl);
3669 if (!TREE_ADDRESSABLE (value)
3670 && !TREE_ADDRESSABLE (decl)
3672 newval = optimize_compound_literals_in_ctor (init);
3674 if (newval == value)
3677 if (ctor == orig_ctor)
3679 ctor = copy_node (orig_ctor);
3680 CONSTRUCTOR_ELTS (ctor) = VEC_copy (constructor_elt, gc, elts);
3681 elts = CONSTRUCTOR_ELTS (ctor);
3683 VEC_index (constructor_elt, elts, idx)->value = newval;
3688 /* A subroutine of gimplify_modify_expr. Break out elements of a
3689 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
3691 Note that we still need to clear any elements that don't have explicit
3692 initializers, so if not all elements are initialized we keep the
3693 original MODIFY_EXPR, we just remove all of the constructor elements.
3695 If NOTIFY_TEMP_CREATION is true, do not gimplify, just return
3696 GS_ERROR if we would have to create a temporary when gimplifying
3697 this constructor. Otherwise, return GS_OK.
3699 If NOTIFY_TEMP_CREATION is false, just do the gimplification. */
3701 static enum gimplify_status
3702 gimplify_init_constructor (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
3703 bool want_value, bool notify_temp_creation)
3705 tree object, ctor, type;
3706 enum gimplify_status ret;
3707 VEC(constructor_elt,gc) *elts;
3709 gcc_assert (TREE_CODE (TREE_OPERAND (*expr_p, 1)) == CONSTRUCTOR);
3711 if (!notify_temp_creation)
3713 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3714 is_gimple_lvalue, fb_lvalue);
3715 if (ret == GS_ERROR)
3719 object = TREE_OPERAND (*expr_p, 0);
3720 ctor = TREE_OPERAND (*expr_p, 1) =
3721 optimize_compound_literals_in_ctor (TREE_OPERAND (*expr_p, 1));
3722 type = TREE_TYPE (ctor);
3723 elts = CONSTRUCTOR_ELTS (ctor);
3726 switch (TREE_CODE (type))
3730 case QUAL_UNION_TYPE:
3733 struct gimplify_init_ctor_preeval_data preeval_data;
3734 HOST_WIDE_INT num_type_elements, num_ctor_elements;
3735 HOST_WIDE_INT num_nonzero_elements;
3736 bool cleared, valid_const_initializer;
3738 /* Aggregate types must lower constructors to initialization of
3739 individual elements. The exception is that a CONSTRUCTOR node
3740 with no elements indicates zero-initialization of the whole. */
3741 if (VEC_empty (constructor_elt, elts))
3743 if (notify_temp_creation)
3748 /* Fetch information about the constructor to direct later processing.
3749 We might want to make static versions of it in various cases, and
3750 can only do so if it known to be a valid constant initializer. */
3751 valid_const_initializer
3752 = categorize_ctor_elements (ctor, &num_nonzero_elements,
3753 &num_ctor_elements, &cleared);
3755 /* If a const aggregate variable is being initialized, then it
3756 should never be a lose to promote the variable to be static. */
3757 if (valid_const_initializer
3758 && num_nonzero_elements > 1
3759 && TREE_READONLY (object)
3760 && TREE_CODE (object) == VAR_DECL
3761 && (flag_merge_constants >= 2 || !TREE_ADDRESSABLE (object)))
3763 if (notify_temp_creation)
3765 DECL_INITIAL (object) = ctor;
3766 TREE_STATIC (object) = 1;
3767 if (!DECL_NAME (object))
3768 DECL_NAME (object) = create_tmp_var_name ("C");
3769 walk_tree (&DECL_INITIAL (object), force_labels_r, NULL, NULL);
3771 /* ??? C++ doesn't automatically append a .<number> to the
3772 assembler name, and even when it does, it looks a FE private
3773 data structures to figure out what that number should be,
3774 which are not set for this variable. I suppose this is
3775 important for local statics for inline functions, which aren't
3776 "local" in the object file sense. So in order to get a unique
3777 TU-local symbol, we must invoke the lhd version now. */
3778 lhd_set_decl_assembler_name (object);
3780 *expr_p = NULL_TREE;
3784 /* If there are "lots" of initialized elements, even discounting
3785 those that are not address constants (and thus *must* be
3786 computed at runtime), then partition the constructor into
3787 constant and non-constant parts. Block copy the constant
3788 parts in, then generate code for the non-constant parts. */
3789 /* TODO. There's code in cp/typeck.c to do this. */
3791 num_type_elements = count_type_elements (type, true);
3793 /* If count_type_elements could not determine number of type elements
3794 for a constant-sized object, assume clearing is needed.
3795 Don't do this for variable-sized objects, as store_constructor
3796 will ignore the clearing of variable-sized objects. */
3797 if (num_type_elements < 0 && int_size_in_bytes (type) >= 0)
3799 /* If there are "lots" of zeros, then block clear the object first. */
3800 else if (num_type_elements - num_nonzero_elements
3801 > CLEAR_RATIO (optimize_function_for_speed_p (cfun))
3802 && num_nonzero_elements < num_type_elements/4)
3804 /* ??? This bit ought not be needed. For any element not present
3805 in the initializer, we should simply set them to zero. Except
3806 we'd need to *find* the elements that are not present, and that
3807 requires trickery to avoid quadratic compile-time behavior in
3808 large cases or excessive memory use in small cases. */
3809 else if (num_ctor_elements < num_type_elements)
3812 /* If there are "lots" of initialized elements, and all of them
3813 are valid address constants, then the entire initializer can
3814 be dropped to memory, and then memcpy'd out. Don't do this
3815 for sparse arrays, though, as it's more efficient to follow
3816 the standard CONSTRUCTOR behavior of memset followed by
3817 individual element initialization. Also don't do this for small
3818 all-zero initializers (which aren't big enough to merit
3819 clearing), and don't try to make bitwise copies of
3820 TREE_ADDRESSABLE types. */
3821 if (valid_const_initializer
3822 && !(cleared || num_nonzero_elements == 0)
3823 && !TREE_ADDRESSABLE (type))
3825 HOST_WIDE_INT size = int_size_in_bytes (type);
3828 /* ??? We can still get unbounded array types, at least
3829 from the C++ front end. This seems wrong, but attempt
3830 to work around it for now. */
3833 size = int_size_in_bytes (TREE_TYPE (object));
3835 TREE_TYPE (ctor) = type = TREE_TYPE (object);
3838 /* Find the maximum alignment we can assume for the object. */
3839 /* ??? Make use of DECL_OFFSET_ALIGN. */
3840 if (DECL_P (object))
3841 align = DECL_ALIGN (object);
3843 align = TYPE_ALIGN (type);
3846 && num_nonzero_elements > 1
3847 && !can_move_by_pieces (size, align))
3849 if (notify_temp_creation)
3852 walk_tree (&ctor, force_labels_r, NULL, NULL);
3853 ctor = tree_output_constant_def (ctor);
3854 if (!useless_type_conversion_p (type, TREE_TYPE (ctor)))
3855 ctor = build1 (VIEW_CONVERT_EXPR, type, ctor);
3856 TREE_OPERAND (*expr_p, 1) = ctor;
3858 /* This is no longer an assignment of a CONSTRUCTOR, but
3859 we still may have processing to do on the LHS. So
3860 pretend we didn't do anything here to let that happen. */
3861 return GS_UNHANDLED;
3865 /* If the target is volatile, we have non-zero elements and more than
3866 one field to assign, initialize the target from a temporary. */
3867 if (TREE_THIS_VOLATILE (object)
3868 && !TREE_ADDRESSABLE (type)
3869 && num_nonzero_elements > 0
3870 && VEC_length (constructor_elt, elts) > 1)
3872 tree temp = create_tmp_var (TYPE_MAIN_VARIANT (type), NULL);
3873 TREE_OPERAND (*expr_p, 0) = temp;
3874 *expr_p = build2 (COMPOUND_EXPR, TREE_TYPE (*expr_p),
3876 build2 (MODIFY_EXPR, void_type_node,
3881 if (notify_temp_creation)
3884 /* If there are nonzero elements and if needed, pre-evaluate to capture
3885 elements overlapping with the lhs into temporaries. We must do this
3886 before clearing to fetch the values before they are zeroed-out. */
3887 if (num_nonzero_elements > 0 && TREE_CODE (*expr_p) != INIT_EXPR)
3889 preeval_data.lhs_base_decl = get_base_address (object);
3890 if (!DECL_P (preeval_data.lhs_base_decl))
3891 preeval_data.lhs_base_decl = NULL;
3892 preeval_data.lhs_alias_set = get_alias_set (object);
3894 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p, 1),
3895 pre_p, post_p, &preeval_data);
3900 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3901 Note that we still have to gimplify, in order to handle the
3902 case of variable sized types. Avoid shared tree structures. */
3903 CONSTRUCTOR_ELTS (ctor) = NULL;
3904 TREE_SIDE_EFFECTS (ctor) = 0;
3905 object = unshare_expr (object);
3906 gimplify_stmt (expr_p, pre_p);
3909 /* If we have not block cleared the object, or if there are nonzero
3910 elements in the constructor, add assignments to the individual
3911 scalar fields of the object. */
3912 if (!cleared || num_nonzero_elements > 0)
3913 gimplify_init_ctor_eval (object, elts, pre_p, cleared);
3915 *expr_p = NULL_TREE;
3923 if (notify_temp_creation)
3926 /* Extract the real and imaginary parts out of the ctor. */
3927 gcc_assert (VEC_length (constructor_elt, elts) == 2);
3928 r = VEC_index (constructor_elt, elts, 0)->value;
3929 i = VEC_index (constructor_elt, elts, 1)->value;
3930 if (r == NULL || i == NULL)
3932 tree zero = build_zero_cst (TREE_TYPE (type));
3939 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3940 represent creation of a complex value. */
3941 if (TREE_CONSTANT (r) && TREE_CONSTANT (i))
3943 ctor = build_complex (type, r, i);
3944 TREE_OPERAND (*expr_p, 1) = ctor;
3948 ctor = build2 (COMPLEX_EXPR, type, r, i);
3949 TREE_OPERAND (*expr_p, 1) = ctor;
3950 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 1),
3953 rhs_predicate_for (TREE_OPERAND (*expr_p, 0)),
3961 unsigned HOST_WIDE_INT ix;
3962 constructor_elt *ce;
3964 if (notify_temp_creation)
3967 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3968 if (TREE_CONSTANT (ctor))
3970 bool constant_p = true;
3973 /* Even when ctor is constant, it might contain non-*_CST
3974 elements, such as addresses or trapping values like
3975 1.0/0.0 - 1.0/0.0. Such expressions don't belong
3976 in VECTOR_CST nodes. */
3977 FOR_EACH_CONSTRUCTOR_VALUE (elts, ix, value)
3978 if (!CONSTANT_CLASS_P (value))
3986 TREE_OPERAND (*expr_p, 1) = build_vector_from_ctor (type, elts);
3990 /* Don't reduce an initializer constant even if we can't
3991 make a VECTOR_CST. It won't do anything for us, and it'll
3992 prevent us from representing it as a single constant. */
3993 if (initializer_constant_valid_p (ctor, type))
3996 TREE_CONSTANT (ctor) = 0;
3999 /* Vector types use CONSTRUCTOR all the way through gimple
4000 compilation as a general initializer. */
4001 FOR_EACH_VEC_ELT (constructor_elt, elts, ix, ce)
4003 enum gimplify_status tret;
4004 tret = gimplify_expr (&ce->value, pre_p, post_p, is_gimple_val,
4006 if (tret == GS_ERROR)
4009 if (!is_gimple_reg (TREE_OPERAND (*expr_p, 0)))
4010 TREE_OPERAND (*expr_p, 1) = get_formal_tmp_var (ctor, pre_p);
4015 /* So how did we get a CONSTRUCTOR for a scalar type? */
4019 if (ret == GS_ERROR)
4021 else if (want_value)
4028 /* If we have gimplified both sides of the initializer but have
4029 not emitted an assignment, do so now. */
4032 tree lhs = TREE_OPERAND (*expr_p, 0);
4033 tree rhs = TREE_OPERAND (*expr_p, 1);
4034 gimple init = gimple_build_assign (lhs, rhs);
4035 gimplify_seq_add_stmt (pre_p, init);
4043 /* Given a pointer value OP0, return a simplified version of an
4044 indirection through OP0, or NULL_TREE if no simplification is
4045 possible. Note that the resulting type may be different from
4046 the type pointed to in the sense that it is still compatible
4047 from the langhooks point of view. */
4050 gimple_fold_indirect_ref (tree t)
4052 tree ptype = TREE_TYPE (t), type = TREE_TYPE (ptype);
4057 subtype = TREE_TYPE (sub);
4058 if (!POINTER_TYPE_P (subtype))
4061 if (TREE_CODE (sub) == ADDR_EXPR)
4063 tree op = TREE_OPERAND (sub, 0);
4064 tree optype = TREE_TYPE (op);
4066 if (useless_type_conversion_p (type, optype))
4069 /* *(foo *)&fooarray => fooarray[0] */
4070 if (TREE_CODE (optype) == ARRAY_TYPE
4071 && TREE_CODE (TYPE_SIZE (TREE_TYPE (optype))) == INTEGER_CST
4072 && useless_type_conversion_p (type, TREE_TYPE (optype)))
4074 tree type_domain = TYPE_DOMAIN (optype);
4075 tree min_val = size_zero_node;
4076 if (type_domain && TYPE_MIN_VALUE (type_domain))
4077 min_val = TYPE_MIN_VALUE (type_domain);
4078 if (TREE_CODE (min_val) == INTEGER_CST)
4079 return build4 (ARRAY_REF, type, op, min_val, NULL_TREE, NULL_TREE);
4081 /* *(foo *)&complexfoo => __real__ complexfoo */
4082 else if (TREE_CODE (optype) == COMPLEX_TYPE
4083 && useless_type_conversion_p (type, TREE_TYPE (optype)))
4084 return fold_build1 (REALPART_EXPR, type, op);
4085 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
4086 else if (TREE_CODE (optype) == VECTOR_TYPE
4087 && useless_type_conversion_p (type, TREE_TYPE (optype)))
4089 tree part_width = TYPE_SIZE (type);
4090 tree index = bitsize_int (0);
4091 return fold_build3 (BIT_FIELD_REF, type, op, part_width, index);
4095 /* *(p + CST) -> ... */
4096 if (TREE_CODE (sub) == POINTER_PLUS_EXPR
4097 && TREE_CODE (TREE_OPERAND (sub, 1)) == INTEGER_CST)
4099 tree addr = TREE_OPERAND (sub, 0);
4100 tree off = TREE_OPERAND (sub, 1);
4104 addrtype = TREE_TYPE (addr);
4106 /* ((foo*)&vectorfoo)[1] -> BIT_FIELD_REF<vectorfoo,...> */
4107 if (TREE_CODE (addr) == ADDR_EXPR
4108 && TREE_CODE (TREE_TYPE (addrtype)) == VECTOR_TYPE
4109 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (addrtype)))
4110 && host_integerp (off, 1))
4112 unsigned HOST_WIDE_INT offset = tree_low_cst (off, 1);
4113 tree part_width = TYPE_SIZE (type);
4114 unsigned HOST_WIDE_INT part_widthi
4115 = tree_low_cst (part_width, 0) / BITS_PER_UNIT;
4116 unsigned HOST_WIDE_INT indexi = offset * BITS_PER_UNIT;
4117 tree index = bitsize_int (indexi);
4118 if (offset / part_widthi
4119 <= TYPE_VECTOR_SUBPARTS (TREE_TYPE (addrtype)))
4120 return fold_build3 (BIT_FIELD_REF, type, TREE_OPERAND (addr, 0),
4124 /* ((foo*)&complexfoo)[1] -> __imag__ complexfoo */
4125 if (TREE_CODE (addr) == ADDR_EXPR
4126 && TREE_CODE (TREE_TYPE (addrtype)) == COMPLEX_TYPE
4127 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (addrtype))))
4129 tree size = TYPE_SIZE_UNIT (type);
4130 if (tree_int_cst_equal (size, off))
4131 return fold_build1 (IMAGPART_EXPR, type, TREE_OPERAND (addr, 0));
4134 /* *(p + CST) -> MEM_REF <p, CST>. */
4135 if (TREE_CODE (addr) != ADDR_EXPR
4136 || DECL_P (TREE_OPERAND (addr, 0)))
4137 return fold_build2 (MEM_REF, type,
4139 build_int_cst_wide (ptype,
4140 TREE_INT_CST_LOW (off),
4141 TREE_INT_CST_HIGH (off)));
4144 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
4145 if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
4146 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (subtype)))) == INTEGER_CST
4147 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (subtype))))
4150 tree min_val = size_zero_node;
4152 sub = gimple_fold_indirect_ref (sub);
4154 sub = build1 (INDIRECT_REF, TREE_TYPE (subtype), osub);
4155 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
4156 if (type_domain && TYPE_MIN_VALUE (type_domain))
4157 min_val = TYPE_MIN_VALUE (type_domain);
4158 if (TREE_CODE (min_val) == INTEGER_CST)
4159 return build4 (ARRAY_REF, type, sub, min_val, NULL_TREE, NULL_TREE);
4165 /* Given a pointer value OP0, return a simplified version of an
4166 indirection through OP0, or NULL_TREE if no simplification is
4167 possible. This may only be applied to a rhs of an expression.
4168 Note that the resulting type may be different from the type pointed
4169 to in the sense that it is still compatible from the langhooks
4173 gimple_fold_indirect_ref_rhs (tree t)
4175 return gimple_fold_indirect_ref (t);
4178 /* Subroutine of gimplify_modify_expr to do simplifications of
4179 MODIFY_EXPRs based on the code of the RHS. We loop for as long as
4180 something changes. */
4182 static enum gimplify_status
4183 gimplify_modify_expr_rhs (tree *expr_p, tree *from_p, tree *to_p,
4184 gimple_seq *pre_p, gimple_seq *post_p,
4187 enum gimplify_status ret = GS_UNHANDLED;
4193 switch (TREE_CODE (*from_p))
4196 /* If we're assigning from a read-only variable initialized with
4197 a constructor, do the direct assignment from the constructor,
4198 but only if neither source nor target are volatile since this
4199 latter assignment might end up being done on a per-field basis. */
4200 if (DECL_INITIAL (*from_p)
4201 && TREE_READONLY (*from_p)
4202 && !TREE_THIS_VOLATILE (*from_p)
4203 && !TREE_THIS_VOLATILE (*to_p)
4204 && TREE_CODE (DECL_INITIAL (*from_p)) == CONSTRUCTOR)
4206 tree old_from = *from_p;
4207 enum gimplify_status subret;
4209 /* Move the constructor into the RHS. */
4210 *from_p = unshare_expr (DECL_INITIAL (*from_p));
4212 /* Let's see if gimplify_init_constructor will need to put
4214 subret = gimplify_init_constructor (expr_p, NULL, NULL,
4216 if (subret == GS_ERROR)
4218 /* If so, revert the change. */
4230 /* If we have code like
4234 where the type of "x" is a (possibly cv-qualified variant
4235 of "A"), treat the entire expression as identical to "x".
4236 This kind of code arises in C++ when an object is bound
4237 to a const reference, and if "x" is a TARGET_EXPR we want
4238 to take advantage of the optimization below. */
4239 bool volatile_p = TREE_THIS_VOLATILE (*from_p);
4240 tree t = gimple_fold_indirect_ref_rhs (TREE_OPERAND (*from_p, 0));
4243 if (TREE_THIS_VOLATILE (t) != volatile_p)
4245 if (TREE_CODE_CLASS (TREE_CODE (t)) == tcc_declaration)
4246 t = build_simple_mem_ref_loc (EXPR_LOCATION (*from_p),
4247 build_fold_addr_expr (t));
4248 if (REFERENCE_CLASS_P (t))
4249 TREE_THIS_VOLATILE (t) = volatile_p;
4260 /* If we are initializing something from a TARGET_EXPR, strip the
4261 TARGET_EXPR and initialize it directly, if possible. This can't
4262 be done if the initializer is void, since that implies that the
4263 temporary is set in some non-trivial way.
4265 ??? What about code that pulls out the temp and uses it
4266 elsewhere? I think that such code never uses the TARGET_EXPR as
4267 an initializer. If I'm wrong, we'll die because the temp won't
4268 have any RTL. In that case, I guess we'll need to replace
4269 references somehow. */
4270 tree init = TARGET_EXPR_INITIAL (*from_p);
4273 && !VOID_TYPE_P (TREE_TYPE (init)))
4283 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
4285 gimplify_compound_expr (from_p, pre_p, true);
4291 /* If we already made some changes, let the front end have a
4292 crack at this before we break it down. */
4293 if (ret != GS_UNHANDLED)
4295 /* If we're initializing from a CONSTRUCTOR, break this into
4296 individual MODIFY_EXPRs. */
4297 return gimplify_init_constructor (expr_p, pre_p, post_p, want_value,
4301 /* If we're assigning to a non-register type, push the assignment
4302 down into the branches. This is mandatory for ADDRESSABLE types,
4303 since we cannot generate temporaries for such, but it saves a
4304 copy in other cases as well. */
4305 if (!is_gimple_reg_type (TREE_TYPE (*from_p)))
4307 /* This code should mirror the code in gimplify_cond_expr. */
4308 enum tree_code code = TREE_CODE (*expr_p);
4309 tree cond = *from_p;
4310 tree result = *to_p;
4312 ret = gimplify_expr (&result, pre_p, post_p,
4313 is_gimple_lvalue, fb_lvalue);
4314 if (ret != GS_ERROR)
4317 if (TREE_TYPE (TREE_OPERAND (cond, 1)) != void_type_node)
4318 TREE_OPERAND (cond, 1)
4319 = build2 (code, void_type_node, result,
4320 TREE_OPERAND (cond, 1));
4321 if (TREE_TYPE (TREE_OPERAND (cond, 2)) != void_type_node)
4322 TREE_OPERAND (cond, 2)
4323 = build2 (code, void_type_node, unshare_expr (result),
4324 TREE_OPERAND (cond, 2));
4326 TREE_TYPE (cond) = void_type_node;
4327 recalculate_side_effects (cond);
4331 gimplify_and_add (cond, pre_p);
4332 *expr_p = unshare_expr (result);
4341 /* For calls that return in memory, give *to_p as the CALL_EXPR's
4342 return slot so that we don't generate a temporary. */
4343 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p)
4344 && aggregate_value_p (*from_p, *from_p))
4348 if (!(rhs_predicate_for (*to_p))(*from_p))
4349 /* If we need a temporary, *to_p isn't accurate. */
4351 /* It's OK to use the return slot directly unless it's an NRV. */
4352 else if (TREE_CODE (*to_p) == RESULT_DECL
4353 && DECL_NAME (*to_p) == NULL_TREE
4354 && needs_to_live_in_memory (*to_p))
4356 else if (is_gimple_reg_type (TREE_TYPE (*to_p))
4357 || (DECL_P (*to_p) && DECL_REGISTER (*to_p)))
4358 /* Don't force regs into memory. */
4360 else if (TREE_CODE (*expr_p) == INIT_EXPR)
4361 /* It's OK to use the target directly if it's being
4364 else if (!is_gimple_non_addressable (*to_p))
4365 /* Don't use the original target if it's already addressable;
4366 if its address escapes, and the called function uses the
4367 NRV optimization, a conforming program could see *to_p
4368 change before the called function returns; see c++/19317.
4369 When optimizing, the return_slot pass marks more functions
4370 as safe after we have escape info. */
4377 CALL_EXPR_RETURN_SLOT_OPT (*from_p) = 1;
4378 mark_addressable (*to_p);
4383 case WITH_SIZE_EXPR:
4384 /* Likewise for calls that return an aggregate of non-constant size,
4385 since we would not be able to generate a temporary at all. */
4386 if (TREE_CODE (TREE_OPERAND (*from_p, 0)) == CALL_EXPR)
4388 *from_p = TREE_OPERAND (*from_p, 0);
4389 /* We don't change ret in this case because the
4390 WITH_SIZE_EXPR might have been added in
4391 gimplify_modify_expr, so returning GS_OK would lead to an
4397 /* If we're initializing from a container, push the initialization
4399 case CLEANUP_POINT_EXPR:
4401 case STATEMENT_LIST:
4403 tree wrap = *from_p;
4406 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_min_lval,
4408 if (ret != GS_ERROR)
4411 t = voidify_wrapper_expr (wrap, *expr_p);
4412 gcc_assert (t == *expr_p);
4416 gimplify_and_add (wrap, pre_p);
4417 *expr_p = unshare_expr (*to_p);
4424 case COMPOUND_LITERAL_EXPR:
4426 tree complit = TREE_OPERAND (*expr_p, 1);
4427 tree decl_s = COMPOUND_LITERAL_EXPR_DECL_EXPR (complit);
4428 tree decl = DECL_EXPR_DECL (decl_s);
4429 tree init = DECL_INITIAL (decl);
4431 /* struct T x = (struct T) { 0, 1, 2 } can be optimized
4432 into struct T x = { 0, 1, 2 } if the address of the
4433 compound literal has never been taken. */
4434 if (!TREE_ADDRESSABLE (complit)
4435 && !TREE_ADDRESSABLE (decl)
4438 *expr_p = copy_node (*expr_p);
4439 TREE_OPERAND (*expr_p, 1) = init;
4453 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
4454 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
4455 DECL_GIMPLE_REG_P set.
4457 IMPORTANT NOTE: This promotion is performed by introducing a load of the
4458 other, unmodified part of the complex object just before the total store.
4459 As a consequence, if the object is still uninitialized, an undefined value
4460 will be loaded into a register, which may result in a spurious exception
4461 if the register is floating-point and the value happens to be a signaling
4462 NaN for example. Then the fully-fledged complex operations lowering pass
4463 followed by a DCE pass are necessary in order to fix things up. */
4465 static enum gimplify_status
4466 gimplify_modify_expr_complex_part (tree *expr_p, gimple_seq *pre_p,
4469 enum tree_code code, ocode;
4470 tree lhs, rhs, new_rhs, other, realpart, imagpart;
4472 lhs = TREE_OPERAND (*expr_p, 0);
4473 rhs = TREE_OPERAND (*expr_p, 1);
4474 code = TREE_CODE (lhs);
4475 lhs = TREE_OPERAND (lhs, 0);
4477 ocode = code == REALPART_EXPR ? IMAGPART_EXPR : REALPART_EXPR;
4478 other = build1 (ocode, TREE_TYPE (rhs), lhs);
4479 other = get_formal_tmp_var (other, pre_p);
4481 realpart = code == REALPART_EXPR ? rhs : other;
4482 imagpart = code == REALPART_EXPR ? other : rhs;
4484 if (TREE_CONSTANT (realpart) && TREE_CONSTANT (imagpart))
4485 new_rhs = build_complex (TREE_TYPE (lhs), realpart, imagpart);
4487 new_rhs = build2 (COMPLEX_EXPR, TREE_TYPE (lhs), realpart, imagpart);
4489 gimplify_seq_add_stmt (pre_p, gimple_build_assign (lhs, new_rhs));
4490 *expr_p = (want_value) ? rhs : NULL_TREE;
4495 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
4501 PRE_P points to the list where side effects that must happen before
4502 *EXPR_P should be stored.
4504 POST_P points to the list where side effects that must happen after
4505 *EXPR_P should be stored.
4507 WANT_VALUE is nonzero iff we want to use the value of this expression
4508 in another expression. */
4510 static enum gimplify_status
4511 gimplify_modify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
4514 tree *from_p = &TREE_OPERAND (*expr_p, 1);
4515 tree *to_p = &TREE_OPERAND (*expr_p, 0);
4516 enum gimplify_status ret = GS_UNHANDLED;
4518 location_t loc = EXPR_LOCATION (*expr_p);
4520 gcc_assert (TREE_CODE (*expr_p) == MODIFY_EXPR
4521 || TREE_CODE (*expr_p) == INIT_EXPR);
4523 /* Insert pointer conversions required by the middle-end that are not
4524 required by the frontend. This fixes middle-end type checking for
4525 for example gcc.dg/redecl-6.c. */
4526 if (POINTER_TYPE_P (TREE_TYPE (*to_p)))
4528 STRIP_USELESS_TYPE_CONVERSION (*from_p);
4529 if (!useless_type_conversion_p (TREE_TYPE (*to_p), TREE_TYPE (*from_p)))
4530 *from_p = fold_convert_loc (loc, TREE_TYPE (*to_p), *from_p);
4533 /* See if any simplifications can be done based on what the RHS is. */
4534 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
4536 if (ret != GS_UNHANDLED)
4539 /* For zero sized types only gimplify the left hand side and right hand
4540 side as statements and throw away the assignment. Do this after
4541 gimplify_modify_expr_rhs so we handle TARGET_EXPRs of addressable
4543 if (zero_sized_type (TREE_TYPE (*from_p)) && !want_value)
4545 gimplify_stmt (from_p, pre_p);
4546 gimplify_stmt (to_p, pre_p);
4547 *expr_p = NULL_TREE;
4551 /* If the value being copied is of variable width, compute the length
4552 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
4553 before gimplifying any of the operands so that we can resolve any
4554 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
4555 the size of the expression to be copied, not of the destination, so
4556 that is what we must do here. */
4557 maybe_with_size_expr (from_p);
4559 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
4560 if (ret == GS_ERROR)
4563 /* As a special case, we have to temporarily allow for assignments
4564 with a CALL_EXPR on the RHS. Since in GIMPLE a function call is
4565 a toplevel statement, when gimplifying the GENERIC expression
4566 MODIFY_EXPR <a, CALL_EXPR <foo>>, we cannot create the tuple
4567 GIMPLE_ASSIGN <a, GIMPLE_CALL <foo>>.
4569 Instead, we need to create the tuple GIMPLE_CALL <a, foo>. To
4570 prevent gimplify_expr from trying to create a new temporary for
4571 foo's LHS, we tell it that it should only gimplify until it
4572 reaches the CALL_EXPR. On return from gimplify_expr, the newly
4573 created GIMPLE_CALL <foo> will be the last statement in *PRE_P
4574 and all we need to do here is set 'a' to be its LHS. */
4575 ret = gimplify_expr (from_p, pre_p, post_p, rhs_predicate_for (*to_p),
4577 if (ret == GS_ERROR)
4580 /* Now see if the above changed *from_p to something we handle specially. */
4581 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
4583 if (ret != GS_UNHANDLED)
4586 /* If we've got a variable sized assignment between two lvalues (i.e. does
4587 not involve a call), then we can make things a bit more straightforward
4588 by converting the assignment to memcpy or memset. */
4589 if (TREE_CODE (*from_p) == WITH_SIZE_EXPR)
4591 tree from = TREE_OPERAND (*from_p, 0);
4592 tree size = TREE_OPERAND (*from_p, 1);
4594 if (TREE_CODE (from) == CONSTRUCTOR)
4595 return gimplify_modify_expr_to_memset (expr_p, size, want_value, pre_p);
4597 if (is_gimple_addressable (from))
4600 return gimplify_modify_expr_to_memcpy (expr_p, size, want_value,
4605 /* Transform partial stores to non-addressable complex variables into
4606 total stores. This allows us to use real instead of virtual operands
4607 for these variables, which improves optimization. */
4608 if ((TREE_CODE (*to_p) == REALPART_EXPR
4609 || TREE_CODE (*to_p) == IMAGPART_EXPR)
4610 && is_gimple_reg (TREE_OPERAND (*to_p, 0)))
4611 return gimplify_modify_expr_complex_part (expr_p, pre_p, want_value);
4613 /* Try to alleviate the effects of the gimplification creating artificial
4614 temporaries (see for example is_gimple_reg_rhs) on the debug info. */
4615 if (!gimplify_ctxp->into_ssa
4616 && TREE_CODE (*from_p) == VAR_DECL
4617 && DECL_IGNORED_P (*from_p)
4619 && !DECL_IGNORED_P (*to_p))
4621 if (!DECL_NAME (*from_p) && DECL_NAME (*to_p))
4623 = create_tmp_var_name (IDENTIFIER_POINTER (DECL_NAME (*to_p)));
4624 DECL_DEBUG_EXPR_IS_FROM (*from_p) = 1;
4625 SET_DECL_DEBUG_EXPR (*from_p, *to_p);
4628 if (want_value && TREE_THIS_VOLATILE (*to_p))
4629 *from_p = get_initialized_tmp_var (*from_p, pre_p, post_p);
4631 if (TREE_CODE (*from_p) == CALL_EXPR)
4633 /* Since the RHS is a CALL_EXPR, we need to create a GIMPLE_CALL
4634 instead of a GIMPLE_ASSIGN. */
4635 tree fnptrtype = TREE_TYPE (CALL_EXPR_FN (*from_p));
4636 CALL_EXPR_FN (*from_p) = TREE_OPERAND (CALL_EXPR_FN (*from_p), 0);
4637 STRIP_USELESS_TYPE_CONVERSION (CALL_EXPR_FN (*from_p));
4638 assign = gimple_build_call_from_tree (*from_p);
4639 gimple_call_set_fntype (assign, TREE_TYPE (fnptrtype));
4640 if (!gimple_call_noreturn_p (assign))
4641 gimple_call_set_lhs (assign, *to_p);
4645 assign = gimple_build_assign (*to_p, *from_p);
4646 gimple_set_location (assign, EXPR_LOCATION (*expr_p));
4649 gimplify_seq_add_stmt (pre_p, assign);
4651 if (gimplify_ctxp->into_ssa && is_gimple_reg (*to_p))
4653 /* If we've somehow already got an SSA_NAME on the LHS, then
4654 we've probably modified it twice. Not good. */
4655 gcc_assert (TREE_CODE (*to_p) != SSA_NAME);
4656 *to_p = make_ssa_name (*to_p, assign);
4657 gimple_set_lhs (assign, *to_p);
4662 *expr_p = TREE_THIS_VOLATILE (*to_p) ? *from_p : unshare_expr (*to_p);
4671 /* Gimplify a comparison between two variable-sized objects. Do this
4672 with a call to BUILT_IN_MEMCMP. */
4674 static enum gimplify_status
4675 gimplify_variable_sized_compare (tree *expr_p)
4677 location_t loc = EXPR_LOCATION (*expr_p);
4678 tree op0 = TREE_OPERAND (*expr_p, 0);
4679 tree op1 = TREE_OPERAND (*expr_p, 1);
4680 tree t, arg, dest, src, expr;
4682 arg = TYPE_SIZE_UNIT (TREE_TYPE (op0));
4683 arg = unshare_expr (arg);
4684 arg = SUBSTITUTE_PLACEHOLDER_IN_EXPR (arg, op0);
4685 src = build_fold_addr_expr_loc (loc, op1);
4686 dest = build_fold_addr_expr_loc (loc, op0);
4687 t = implicit_built_in_decls[BUILT_IN_MEMCMP];
4688 t = build_call_expr_loc (loc, t, 3, dest, src, arg);
4691 = build2 (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), t, integer_zero_node);
4692 SET_EXPR_LOCATION (expr, loc);
4698 /* Gimplify a comparison between two aggregate objects of integral scalar
4699 mode as a comparison between the bitwise equivalent scalar values. */
4701 static enum gimplify_status
4702 gimplify_scalar_mode_aggregate_compare (tree *expr_p)
4704 location_t loc = EXPR_LOCATION (*expr_p);
4705 tree op0 = TREE_OPERAND (*expr_p, 0);
4706 tree op1 = TREE_OPERAND (*expr_p, 1);
4708 tree type = TREE_TYPE (op0);
4709 tree scalar_type = lang_hooks.types.type_for_mode (TYPE_MODE (type), 1);
4711 op0 = fold_build1_loc (loc, VIEW_CONVERT_EXPR, scalar_type, op0);
4712 op1 = fold_build1_loc (loc, VIEW_CONVERT_EXPR, scalar_type, op1);
4715 = fold_build2_loc (loc, TREE_CODE (*expr_p), TREE_TYPE (*expr_p), op0, op1);
4720 /* Gimplify an expression sequence. This function gimplifies each
4721 expression and rewrites the original expression with the last
4722 expression of the sequence in GIMPLE form.
4724 PRE_P points to the list where the side effects for all the
4725 expressions in the sequence will be emitted.
4727 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
4729 static enum gimplify_status
4730 gimplify_compound_expr (tree *expr_p, gimple_seq *pre_p, bool want_value)
4736 tree *sub_p = &TREE_OPERAND (t, 0);
4738 if (TREE_CODE (*sub_p) == COMPOUND_EXPR)
4739 gimplify_compound_expr (sub_p, pre_p, false);
4741 gimplify_stmt (sub_p, pre_p);
4743 t = TREE_OPERAND (t, 1);
4745 while (TREE_CODE (t) == COMPOUND_EXPR);
4752 gimplify_stmt (expr_p, pre_p);
4757 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
4758 gimplify. After gimplification, EXPR_P will point to a new temporary
4759 that holds the original value of the SAVE_EXPR node.
4761 PRE_P points to the list where side effects that must happen before
4762 *EXPR_P should be stored. */
4764 static enum gimplify_status
4765 gimplify_save_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4767 enum gimplify_status ret = GS_ALL_DONE;
4770 gcc_assert (TREE_CODE (*expr_p) == SAVE_EXPR);
4771 val = TREE_OPERAND (*expr_p, 0);
4773 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
4774 if (!SAVE_EXPR_RESOLVED_P (*expr_p))
4776 /* The operand may be a void-valued expression such as SAVE_EXPRs
4777 generated by the Java frontend for class initialization. It is
4778 being executed only for its side-effects. */
4779 if (TREE_TYPE (val) == void_type_node)
4781 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
4782 is_gimple_stmt, fb_none);
4786 val = get_initialized_tmp_var (val, pre_p, post_p);
4788 TREE_OPERAND (*expr_p, 0) = val;
4789 SAVE_EXPR_RESOLVED_P (*expr_p) = 1;
4797 /* Rewrite the ADDR_EXPR node pointed to by EXPR_P
4804 PRE_P points to the list where side effects that must happen before
4805 *EXPR_P should be stored.
4807 POST_P points to the list where side effects that must happen after
4808 *EXPR_P should be stored. */
4810 static enum gimplify_status
4811 gimplify_addr_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4813 tree expr = *expr_p;
4814 tree op0 = TREE_OPERAND (expr, 0);
4815 enum gimplify_status ret;
4816 location_t loc = EXPR_LOCATION (*expr_p);
4818 switch (TREE_CODE (op0))
4822 /* Check if we are dealing with an expression of the form '&*ptr'.
4823 While the front end folds away '&*ptr' into 'ptr', these
4824 expressions may be generated internally by the compiler (e.g.,
4825 builtins like __builtin_va_end). */
4826 /* Caution: the silent array decomposition semantics we allow for
4827 ADDR_EXPR means we can't always discard the pair. */
4828 /* Gimplification of the ADDR_EXPR operand may drop
4829 cv-qualification conversions, so make sure we add them if
4832 tree op00 = TREE_OPERAND (op0, 0);
4833 tree t_expr = TREE_TYPE (expr);
4834 tree t_op00 = TREE_TYPE (op00);
4836 if (!useless_type_conversion_p (t_expr, t_op00))
4837 op00 = fold_convert_loc (loc, TREE_TYPE (expr), op00);
4843 case VIEW_CONVERT_EXPR:
4844 /* Take the address of our operand and then convert it to the type of
4847 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
4848 all clear. The impact of this transformation is even less clear. */
4850 /* If the operand is a useless conversion, look through it. Doing so
4851 guarantees that the ADDR_EXPR and its operand will remain of the
4853 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0, 0)))
4854 op0 = TREE_OPERAND (op0, 0);
4856 *expr_p = fold_convert_loc (loc, TREE_TYPE (expr),
4857 build_fold_addr_expr_loc (loc,
4858 TREE_OPERAND (op0, 0)));
4863 /* We use fb_either here because the C frontend sometimes takes
4864 the address of a call that returns a struct; see
4865 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
4866 the implied temporary explicit. */
4868 /* Make the operand addressable. */
4869 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, post_p,
4870 is_gimple_addressable, fb_either);
4871 if (ret == GS_ERROR)
4874 /* Then mark it. Beware that it may not be possible to do so directly
4875 if a temporary has been created by the gimplification. */
4876 prepare_gimple_addressable (&TREE_OPERAND (expr, 0), pre_p);
4878 op0 = TREE_OPERAND (expr, 0);
4880 /* For various reasons, the gimplification of the expression
4881 may have made a new INDIRECT_REF. */
4882 if (TREE_CODE (op0) == INDIRECT_REF)
4883 goto do_indirect_ref;
4885 mark_addressable (TREE_OPERAND (expr, 0));
4887 /* The FEs may end up building ADDR_EXPRs early on a decl with
4888 an incomplete type. Re-build ADDR_EXPRs in canonical form
4890 if (!types_compatible_p (TREE_TYPE (op0), TREE_TYPE (TREE_TYPE (expr))))
4891 *expr_p = build_fold_addr_expr (op0);
4893 /* Make sure TREE_CONSTANT and TREE_SIDE_EFFECTS are set properly. */
4894 recompute_tree_invariant_for_addr_expr (*expr_p);
4896 /* If we re-built the ADDR_EXPR add a conversion to the original type
4898 if (!useless_type_conversion_p (TREE_TYPE (expr), TREE_TYPE (*expr_p)))
4899 *expr_p = fold_convert (TREE_TYPE (expr), *expr_p);
4907 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
4908 value; output operands should be a gimple lvalue. */
4910 static enum gimplify_status
4911 gimplify_asm_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4915 const char **oconstraints;
4918 const char *constraint;
4919 bool allows_mem, allows_reg, is_inout;
4920 enum gimplify_status ret, tret;
4922 VEC(tree, gc) *inputs;
4923 VEC(tree, gc) *outputs;
4924 VEC(tree, gc) *clobbers;
4925 VEC(tree, gc) *labels;
4929 noutputs = list_length (ASM_OUTPUTS (expr));
4930 oconstraints = (const char **) alloca ((noutputs) * sizeof (const char *));
4932 inputs = outputs = clobbers = labels = NULL;
4935 link_next = NULL_TREE;
4936 for (i = 0, link = ASM_OUTPUTS (expr); link; ++i, link = link_next)
4939 size_t constraint_len;
4941 link_next = TREE_CHAIN (link);
4945 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4946 constraint_len = strlen (constraint);
4947 if (constraint_len == 0)
4950 ok = parse_output_constraint (&constraint, i, 0, 0,
4951 &allows_mem, &allows_reg, &is_inout);
4958 if (!allows_reg && allows_mem)
4959 mark_addressable (TREE_VALUE (link));
4961 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4962 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
4963 fb_lvalue | fb_mayfail);
4964 if (tret == GS_ERROR)
4966 error ("invalid lvalue in asm output %d", i);
4970 VEC_safe_push (tree, gc, outputs, link);
4971 TREE_CHAIN (link) = NULL_TREE;
4975 /* An input/output operand. To give the optimizers more
4976 flexibility, split it into separate input and output
4981 /* Turn the in/out constraint into an output constraint. */
4982 char *p = xstrdup (constraint);
4984 TREE_VALUE (TREE_PURPOSE (link)) = build_string (constraint_len, p);
4986 /* And add a matching input constraint. */
4989 sprintf (buf, "%d", i);
4991 /* If there are multiple alternatives in the constraint,
4992 handle each of them individually. Those that allow register
4993 will be replaced with operand number, the others will stay
4995 if (strchr (p, ',') != NULL)
4997 size_t len = 0, buflen = strlen (buf);
4998 char *beg, *end, *str, *dst;
5002 end = strchr (beg, ',');
5004 end = strchr (beg, '\0');
5005 if ((size_t) (end - beg) < buflen)
5008 len += end - beg + 1;
5015 str = (char *) alloca (len);
5016 for (beg = p + 1, dst = str;;)
5019 bool mem_p, reg_p, inout_p;
5021 end = strchr (beg, ',');
5026 parse_output_constraint (&tem, i, 0, 0,
5027 &mem_p, ®_p, &inout_p);
5032 memcpy (dst, buf, buflen);
5041 memcpy (dst, beg, len);
5050 input = build_string (dst - str, str);
5053 input = build_string (strlen (buf), buf);
5056 input = build_string (constraint_len - 1, constraint + 1);
5060 input = build_tree_list (build_tree_list (NULL_TREE, input),
5061 unshare_expr (TREE_VALUE (link)));
5062 ASM_INPUTS (expr) = chainon (ASM_INPUTS (expr), input);
5066 link_next = NULL_TREE;
5067 for (link = ASM_INPUTS (expr); link; ++i, link = link_next)
5069 link_next = TREE_CHAIN (link);
5070 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
5071 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
5072 oconstraints, &allows_mem, &allows_reg);
5074 /* If we can't make copies, we can only accept memory. */
5075 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (link))))
5081 error ("impossible constraint in %<asm%>");
5082 error ("non-memory input %d must stay in memory", i);
5087 /* If the operand is a memory input, it should be an lvalue. */
5088 if (!allows_reg && allows_mem)
5090 tree inputv = TREE_VALUE (link);
5091 STRIP_NOPS (inputv);
5092 if (TREE_CODE (inputv) == PREDECREMENT_EXPR
5093 || TREE_CODE (inputv) == PREINCREMENT_EXPR
5094 || TREE_CODE (inputv) == POSTDECREMENT_EXPR
5095 || TREE_CODE (inputv) == POSTINCREMENT_EXPR)
5096 TREE_VALUE (link) = error_mark_node;
5097 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
5098 is_gimple_lvalue, fb_lvalue | fb_mayfail);
5099 mark_addressable (TREE_VALUE (link));
5100 if (tret == GS_ERROR)
5102 if (EXPR_HAS_LOCATION (TREE_VALUE (link)))
5103 input_location = EXPR_LOCATION (TREE_VALUE (link));
5104 error ("memory input %d is not directly addressable", i);
5110 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
5111 is_gimple_asm_val, fb_rvalue);
5112 if (tret == GS_ERROR)
5116 TREE_CHAIN (link) = NULL_TREE;
5117 VEC_safe_push (tree, gc, inputs, link);
5120 for (link = ASM_CLOBBERS (expr); link; ++i, link = TREE_CHAIN (link))
5121 VEC_safe_push (tree, gc, clobbers, link);
5123 for (link = ASM_LABELS (expr); link; ++i, link = TREE_CHAIN (link))
5124 VEC_safe_push (tree, gc, labels, link);
5126 /* Do not add ASMs with errors to the gimple IL stream. */
5127 if (ret != GS_ERROR)
5129 stmt = gimple_build_asm_vec (TREE_STRING_POINTER (ASM_STRING (expr)),
5130 inputs, outputs, clobbers, labels);
5132 gimple_asm_set_volatile (stmt, ASM_VOLATILE_P (expr));
5133 gimple_asm_set_input (stmt, ASM_INPUT_P (expr));
5135 gimplify_seq_add_stmt (pre_p, stmt);
5141 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
5142 GIMPLE_WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
5143 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
5144 return to this function.
5146 FIXME should we complexify the prequeue handling instead? Or use flags
5147 for all the cleanups and let the optimizer tighten them up? The current
5148 code seems pretty fragile; it will break on a cleanup within any
5149 non-conditional nesting. But any such nesting would be broken, anyway;
5150 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
5151 and continues out of it. We can do that at the RTL level, though, so
5152 having an optimizer to tighten up try/finally regions would be a Good
5155 static enum gimplify_status
5156 gimplify_cleanup_point_expr (tree *expr_p, gimple_seq *pre_p)
5158 gimple_stmt_iterator iter;
5159 gimple_seq body_sequence = NULL;
5161 tree temp = voidify_wrapper_expr (*expr_p, NULL);
5163 /* We only care about the number of conditions between the innermost
5164 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
5165 any cleanups collected outside the CLEANUP_POINT_EXPR. */
5166 int old_conds = gimplify_ctxp->conditions;
5167 gimple_seq old_cleanups = gimplify_ctxp->conditional_cleanups;
5168 gimplify_ctxp->conditions = 0;
5169 gimplify_ctxp->conditional_cleanups = NULL;
5171 gimplify_stmt (&TREE_OPERAND (*expr_p, 0), &body_sequence);
5173 gimplify_ctxp->conditions = old_conds;
5174 gimplify_ctxp->conditional_cleanups = old_cleanups;
5176 for (iter = gsi_start (body_sequence); !gsi_end_p (iter); )
5178 gimple wce = gsi_stmt (iter);
5180 if (gimple_code (wce) == GIMPLE_WITH_CLEANUP_EXPR)
5182 if (gsi_one_before_end_p (iter))
5184 /* Note that gsi_insert_seq_before and gsi_remove do not
5185 scan operands, unlike some other sequence mutators. */
5186 if (!gimple_wce_cleanup_eh_only (wce))
5187 gsi_insert_seq_before_without_update (&iter,
5188 gimple_wce_cleanup (wce),
5190 gsi_remove (&iter, true);
5197 enum gimple_try_flags kind;
5199 if (gimple_wce_cleanup_eh_only (wce))
5200 kind = GIMPLE_TRY_CATCH;
5202 kind = GIMPLE_TRY_FINALLY;
5203 seq = gsi_split_seq_after (iter);
5205 gtry = gimple_build_try (seq, gimple_wce_cleanup (wce), kind);
5206 /* Do not use gsi_replace here, as it may scan operands.
5207 We want to do a simple structural modification only. */
5208 *gsi_stmt_ptr (&iter) = gtry;
5209 iter = gsi_start (seq);
5216 gimplify_seq_add_seq (pre_p, body_sequence);
5229 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
5230 is the cleanup action required. EH_ONLY is true if the cleanup should
5231 only be executed if an exception is thrown, not on normal exit. */
5234 gimple_push_cleanup (tree var, tree cleanup, bool eh_only, gimple_seq *pre_p)
5237 gimple_seq cleanup_stmts = NULL;
5239 /* Errors can result in improperly nested cleanups. Which results in
5240 confusion when trying to resolve the GIMPLE_WITH_CLEANUP_EXPR. */
5244 if (gimple_conditional_context ())
5246 /* If we're in a conditional context, this is more complex. We only
5247 want to run the cleanup if we actually ran the initialization that
5248 necessitates it, but we want to run it after the end of the
5249 conditional context. So we wrap the try/finally around the
5250 condition and use a flag to determine whether or not to actually
5251 run the destructor. Thus
5255 becomes (approximately)
5259 if (test) { A::A(temp); flag = 1; val = f(temp); }
5262 if (flag) A::~A(temp);
5266 tree flag = create_tmp_var (boolean_type_node, "cleanup");
5267 gimple ffalse = gimple_build_assign (flag, boolean_false_node);
5268 gimple ftrue = gimple_build_assign (flag, boolean_true_node);
5270 cleanup = build3 (COND_EXPR, void_type_node, flag, cleanup, NULL);
5271 gimplify_stmt (&cleanup, &cleanup_stmts);
5272 wce = gimple_build_wce (cleanup_stmts);
5274 gimplify_seq_add_stmt (&gimplify_ctxp->conditional_cleanups, ffalse);
5275 gimplify_seq_add_stmt (&gimplify_ctxp->conditional_cleanups, wce);
5276 gimplify_seq_add_stmt (pre_p, ftrue);
5278 /* Because of this manipulation, and the EH edges that jump
5279 threading cannot redirect, the temporary (VAR) will appear
5280 to be used uninitialized. Don't warn. */
5281 TREE_NO_WARNING (var) = 1;
5285 gimplify_stmt (&cleanup, &cleanup_stmts);
5286 wce = gimple_build_wce (cleanup_stmts);
5287 gimple_wce_set_cleanup_eh_only (wce, eh_only);
5288 gimplify_seq_add_stmt (pre_p, wce);
5292 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
5294 static enum gimplify_status
5295 gimplify_target_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
5297 tree targ = *expr_p;
5298 tree temp = TARGET_EXPR_SLOT (targ);
5299 tree init = TARGET_EXPR_INITIAL (targ);
5300 enum gimplify_status ret;
5304 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
5305 to the temps list. Handle also variable length TARGET_EXPRs. */
5306 if (TREE_CODE (DECL_SIZE (temp)) != INTEGER_CST)
5308 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (temp)))
5309 gimplify_type_sizes (TREE_TYPE (temp), pre_p);
5310 gimplify_vla_decl (temp, pre_p);
5313 gimple_add_tmp_var (temp);
5315 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
5316 expression is supposed to initialize the slot. */
5317 if (VOID_TYPE_P (TREE_TYPE (init)))
5318 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
5321 tree init_expr = build2 (INIT_EXPR, void_type_node, temp, init);
5323 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
5325 ggc_free (init_expr);
5327 if (ret == GS_ERROR)
5329 /* PR c++/28266 Make sure this is expanded only once. */
5330 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
5334 gimplify_and_add (init, pre_p);
5336 /* If needed, push the cleanup for the temp. */
5337 if (TARGET_EXPR_CLEANUP (targ))
5338 gimple_push_cleanup (temp, TARGET_EXPR_CLEANUP (targ),
5339 CLEANUP_EH_ONLY (targ), pre_p);
5341 /* Only expand this once. */
5342 TREE_OPERAND (targ, 3) = init;
5343 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
5346 /* We should have expanded this before. */
5347 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp));
5353 /* Gimplification of expression trees. */
5355 /* Gimplify an expression which appears at statement context. The
5356 corresponding GIMPLE statements are added to *SEQ_P. If *SEQ_P is
5357 NULL, a new sequence is allocated.
5359 Return true if we actually added a statement to the queue. */
5362 gimplify_stmt (tree *stmt_p, gimple_seq *seq_p)
5364 gimple_seq_node last;
5367 *seq_p = gimple_seq_alloc ();
5369 last = gimple_seq_last (*seq_p);
5370 gimplify_expr (stmt_p, seq_p, NULL, is_gimple_stmt, fb_none);
5371 return last != gimple_seq_last (*seq_p);
5374 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
5375 to CTX. If entries already exist, force them to be some flavor of private.
5376 If there is no enclosing parallel, do nothing. */
5379 omp_firstprivatize_variable (struct gimplify_omp_ctx *ctx, tree decl)
5383 if (decl == NULL || !DECL_P (decl))
5388 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5391 if (n->value & GOVD_SHARED)
5392 n->value = GOVD_FIRSTPRIVATE | (n->value & GOVD_SEEN);
5396 else if (ctx->region_type != ORT_WORKSHARE)
5397 omp_add_variable (ctx, decl, GOVD_FIRSTPRIVATE);
5399 ctx = ctx->outer_context;
5404 /* Similarly for each of the type sizes of TYPE. */
5407 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx *ctx, tree type)
5409 if (type == NULL || type == error_mark_node)
5411 type = TYPE_MAIN_VARIANT (type);
5413 if (pointer_set_insert (ctx->privatized_types, type))
5416 switch (TREE_CODE (type))
5422 case FIXED_POINT_TYPE:
5423 omp_firstprivatize_variable (ctx, TYPE_MIN_VALUE (type));
5424 omp_firstprivatize_variable (ctx, TYPE_MAX_VALUE (type));
5428 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
5429 omp_firstprivatize_type_sizes (ctx, TYPE_DOMAIN (type));
5434 case QUAL_UNION_TYPE:
5437 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
5438 if (TREE_CODE (field) == FIELD_DECL)
5440 omp_firstprivatize_variable (ctx, DECL_FIELD_OFFSET (field));
5441 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (field));
5447 case REFERENCE_TYPE:
5448 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
5455 omp_firstprivatize_variable (ctx, TYPE_SIZE (type));
5456 omp_firstprivatize_variable (ctx, TYPE_SIZE_UNIT (type));
5457 lang_hooks.types.omp_firstprivatize_type_sizes (ctx, type);
5460 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
5463 omp_add_variable (struct gimplify_omp_ctx *ctx, tree decl, unsigned int flags)
5466 unsigned int nflags;
5469 if (error_operand_p (decl))
5472 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
5473 there are constructors involved somewhere. */
5474 if (TREE_ADDRESSABLE (TREE_TYPE (decl))
5475 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
5478 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5481 /* We shouldn't be re-adding the decl with the same data
5483 gcc_assert ((n->value & GOVD_DATA_SHARE_CLASS & flags) == 0);
5484 /* The only combination of data sharing classes we should see is
5485 FIRSTPRIVATE and LASTPRIVATE. */
5486 nflags = n->value | flags;
5487 gcc_assert ((nflags & GOVD_DATA_SHARE_CLASS)
5488 == (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE));
5493 /* When adding a variable-sized variable, we have to handle all sorts
5494 of additional bits of data: the pointer replacement variable, and
5495 the parameters of the type. */
5496 if (DECL_SIZE (decl) && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
5498 /* Add the pointer replacement variable as PRIVATE if the variable
5499 replacement is private, else FIRSTPRIVATE since we'll need the
5500 address of the original variable either for SHARED, or for the
5501 copy into or out of the context. */
5502 if (!(flags & GOVD_LOCAL))
5504 nflags = flags & GOVD_PRIVATE ? GOVD_PRIVATE : GOVD_FIRSTPRIVATE;
5505 nflags |= flags & GOVD_SEEN;
5506 t = DECL_VALUE_EXPR (decl);
5507 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
5508 t = TREE_OPERAND (t, 0);
5509 gcc_assert (DECL_P (t));
5510 omp_add_variable (ctx, t, nflags);
5513 /* Add all of the variable and type parameters (which should have
5514 been gimplified to a formal temporary) as FIRSTPRIVATE. */
5515 omp_firstprivatize_variable (ctx, DECL_SIZE_UNIT (decl));
5516 omp_firstprivatize_variable (ctx, DECL_SIZE (decl));
5517 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
5519 /* The variable-sized variable itself is never SHARED, only some form
5520 of PRIVATE. The sharing would take place via the pointer variable
5521 which we remapped above. */
5522 if (flags & GOVD_SHARED)
5523 flags = GOVD_PRIVATE | GOVD_DEBUG_PRIVATE
5524 | (flags & (GOVD_SEEN | GOVD_EXPLICIT));
5526 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
5527 alloca statement we generate for the variable, so make sure it
5528 is available. This isn't automatically needed for the SHARED
5529 case, since we won't be allocating local storage then.
5530 For local variables TYPE_SIZE_UNIT might not be gimplified yet,
5531 in this case omp_notice_variable will be called later
5532 on when it is gimplified. */
5533 else if (! (flags & GOVD_LOCAL)
5534 && DECL_P (TYPE_SIZE_UNIT (TREE_TYPE (decl))))
5535 omp_notice_variable (ctx, TYPE_SIZE_UNIT (TREE_TYPE (decl)), true);
5537 else if (lang_hooks.decls.omp_privatize_by_reference (decl))
5539 gcc_assert ((flags & GOVD_LOCAL) == 0);
5540 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
5542 /* Similar to the direct variable sized case above, we'll need the
5543 size of references being privatized. */
5544 if ((flags & GOVD_SHARED) == 0)
5546 t = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl)));
5547 if (TREE_CODE (t) != INTEGER_CST)
5548 omp_notice_variable (ctx, t, true);
5552 splay_tree_insert (ctx->variables, (splay_tree_key)decl, flags);
5555 /* Notice a threadprivate variable DECL used in OpenMP context CTX.
5556 This just prints out diagnostics about threadprivate variable uses
5557 in untied tasks. If DECL2 is non-NULL, prevent this warning
5558 on that variable. */
5561 omp_notice_threadprivate_variable (struct gimplify_omp_ctx *ctx, tree decl,
5566 if (ctx->region_type != ORT_UNTIED_TASK)
5568 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5571 error ("threadprivate variable %qE used in untied task",
5573 error_at (ctx->location, "enclosing task");
5574 splay_tree_insert (ctx->variables, (splay_tree_key)decl, 0);
5577 splay_tree_insert (ctx->variables, (splay_tree_key)decl2, 0);
5581 /* Record the fact that DECL was used within the OpenMP context CTX.
5582 IN_CODE is true when real code uses DECL, and false when we should
5583 merely emit default(none) errors. Return true if DECL is going to
5584 be remapped and thus DECL shouldn't be gimplified into its
5585 DECL_VALUE_EXPR (if any). */
5588 omp_notice_variable (struct gimplify_omp_ctx *ctx, tree decl, bool in_code)
5591 unsigned flags = in_code ? GOVD_SEEN : 0;
5592 bool ret = false, shared;
5594 if (error_operand_p (decl))
5597 /* Threadprivate variables are predetermined. */
5598 if (is_global_var (decl))
5600 if (DECL_THREAD_LOCAL_P (decl))
5601 return omp_notice_threadprivate_variable (ctx, decl, NULL_TREE);
5603 if (DECL_HAS_VALUE_EXPR_P (decl))
5605 tree value = get_base_address (DECL_VALUE_EXPR (decl));
5607 if (value && DECL_P (value) && DECL_THREAD_LOCAL_P (value))
5608 return omp_notice_threadprivate_variable (ctx, decl, value);
5612 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5615 enum omp_clause_default_kind default_kind, kind;
5616 struct gimplify_omp_ctx *octx;
5618 if (ctx->region_type == ORT_WORKSHARE)
5621 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
5622 remapped firstprivate instead of shared. To some extent this is
5623 addressed in omp_firstprivatize_type_sizes, but not effectively. */
5624 default_kind = ctx->default_kind;
5625 kind = lang_hooks.decls.omp_predetermined_sharing (decl);
5626 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
5627 default_kind = kind;
5629 switch (default_kind)
5631 case OMP_CLAUSE_DEFAULT_NONE:
5632 error ("%qE not specified in enclosing parallel",
5633 DECL_NAME (lang_hooks.decls.omp_report_decl (decl)));
5634 if ((ctx->region_type & ORT_TASK) != 0)
5635 error_at (ctx->location, "enclosing task");
5637 error_at (ctx->location, "enclosing parallel");
5639 case OMP_CLAUSE_DEFAULT_SHARED:
5640 flags |= GOVD_SHARED;
5642 case OMP_CLAUSE_DEFAULT_PRIVATE:
5643 flags |= GOVD_PRIVATE;
5645 case OMP_CLAUSE_DEFAULT_FIRSTPRIVATE:
5646 flags |= GOVD_FIRSTPRIVATE;
5648 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
5649 /* decl will be either GOVD_FIRSTPRIVATE or GOVD_SHARED. */
5650 gcc_assert ((ctx->region_type & ORT_TASK) != 0);
5651 if (ctx->outer_context)
5652 omp_notice_variable (ctx->outer_context, decl, in_code);
5653 for (octx = ctx->outer_context; octx; octx = octx->outer_context)
5657 n2 = splay_tree_lookup (octx->variables, (splay_tree_key) decl);
5658 if (n2 && (n2->value & GOVD_DATA_SHARE_CLASS) != GOVD_SHARED)
5660 flags |= GOVD_FIRSTPRIVATE;
5663 if ((octx->region_type & ORT_PARALLEL) != 0)
5666 if (flags & GOVD_FIRSTPRIVATE)
5669 && (TREE_CODE (decl) == PARM_DECL
5670 || (!is_global_var (decl)
5671 && DECL_CONTEXT (decl) == current_function_decl)))
5673 flags |= GOVD_FIRSTPRIVATE;
5676 flags |= GOVD_SHARED;
5682 if ((flags & GOVD_PRIVATE)
5683 && lang_hooks.decls.omp_private_outer_ref (decl))
5684 flags |= GOVD_PRIVATE_OUTER_REF;
5686 omp_add_variable (ctx, decl, flags);
5688 shared = (flags & GOVD_SHARED) != 0;
5689 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
5693 if ((n->value & (GOVD_SEEN | GOVD_LOCAL)) == 0
5694 && (flags & (GOVD_SEEN | GOVD_LOCAL)) == GOVD_SEEN
5696 && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
5699 tree t = DECL_VALUE_EXPR (decl);
5700 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
5701 t = TREE_OPERAND (t, 0);
5702 gcc_assert (DECL_P (t));
5703 n2 = splay_tree_lookup (ctx->variables, (splay_tree_key) t);
5704 n2->value |= GOVD_SEEN;
5707 shared = ((flags | n->value) & GOVD_SHARED) != 0;
5708 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
5710 /* If nothing changed, there's nothing left to do. */
5711 if ((n->value & flags) == flags)
5717 /* If the variable is private in the current context, then we don't
5718 need to propagate anything to an outer context. */
5719 if ((flags & GOVD_PRIVATE) && !(flags & GOVD_PRIVATE_OUTER_REF))
5721 if (ctx->outer_context
5722 && omp_notice_variable (ctx->outer_context, decl, in_code))
5727 /* Verify that DECL is private within CTX. If there's specific information
5728 to the contrary in the innermost scope, generate an error. */
5731 omp_is_private (struct gimplify_omp_ctx *ctx, tree decl)
5735 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5738 if (n->value & GOVD_SHARED)
5740 if (ctx == gimplify_omp_ctxp)
5742 error ("iteration variable %qE should be private",
5744 n->value = GOVD_PRIVATE;
5750 else if ((n->value & GOVD_EXPLICIT) != 0
5751 && (ctx == gimplify_omp_ctxp
5752 || (ctx->region_type == ORT_COMBINED_PARALLEL
5753 && gimplify_omp_ctxp->outer_context == ctx)))
5755 if ((n->value & GOVD_FIRSTPRIVATE) != 0)
5756 error ("iteration variable %qE should not be firstprivate",
5758 else if ((n->value & GOVD_REDUCTION) != 0)
5759 error ("iteration variable %qE should not be reduction",
5762 return (ctx == gimplify_omp_ctxp
5763 || (ctx->region_type == ORT_COMBINED_PARALLEL
5764 && gimplify_omp_ctxp->outer_context == ctx));
5767 if (ctx->region_type != ORT_WORKSHARE)
5769 else if (ctx->outer_context)
5770 return omp_is_private (ctx->outer_context, decl);
5774 /* Return true if DECL is private within a parallel region
5775 that binds to the current construct's context or in parallel
5776 region's REDUCTION clause. */
5779 omp_check_private (struct gimplify_omp_ctx *ctx, tree decl)
5785 ctx = ctx->outer_context;
5787 return !(is_global_var (decl)
5788 /* References might be private, but might be shared too. */
5789 || lang_hooks.decls.omp_privatize_by_reference (decl));
5791 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5793 return (n->value & GOVD_SHARED) == 0;
5795 while (ctx->region_type == ORT_WORKSHARE);
5799 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
5800 and previous omp contexts. */
5803 gimplify_scan_omp_clauses (tree *list_p, gimple_seq *pre_p,
5804 enum omp_region_type region_type)
5806 struct gimplify_omp_ctx *ctx, *outer_ctx;
5807 struct gimplify_ctx gctx;
5810 ctx = new_omp_context (region_type);
5811 outer_ctx = ctx->outer_context;
5813 while ((c = *list_p) != NULL)
5815 bool remove = false;
5816 bool notice_outer = true;
5817 const char *check_non_private = NULL;
5821 switch (OMP_CLAUSE_CODE (c))
5823 case OMP_CLAUSE_PRIVATE:
5824 flags = GOVD_PRIVATE | GOVD_EXPLICIT;
5825 if (lang_hooks.decls.omp_private_outer_ref (OMP_CLAUSE_DECL (c)))
5827 flags |= GOVD_PRIVATE_OUTER_REF;
5828 OMP_CLAUSE_PRIVATE_OUTER_REF (c) = 1;
5831 notice_outer = false;
5833 case OMP_CLAUSE_SHARED:
5834 flags = GOVD_SHARED | GOVD_EXPLICIT;
5836 case OMP_CLAUSE_FIRSTPRIVATE:
5837 flags = GOVD_FIRSTPRIVATE | GOVD_EXPLICIT;
5838 check_non_private = "firstprivate";
5840 case OMP_CLAUSE_LASTPRIVATE:
5841 flags = GOVD_LASTPRIVATE | GOVD_SEEN | GOVD_EXPLICIT;
5842 check_non_private = "lastprivate";
5844 case OMP_CLAUSE_REDUCTION:
5845 flags = GOVD_REDUCTION | GOVD_SEEN | GOVD_EXPLICIT;
5846 check_non_private = "reduction";
5850 decl = OMP_CLAUSE_DECL (c);
5851 if (error_operand_p (decl))
5856 omp_add_variable (ctx, decl, flags);
5857 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION
5858 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c))
5860 omp_add_variable (ctx, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c),
5861 GOVD_LOCAL | GOVD_SEEN);
5862 gimplify_omp_ctxp = ctx;
5863 push_gimplify_context (&gctx);
5865 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c) = gimple_seq_alloc ();
5866 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c) = gimple_seq_alloc ();
5868 gimplify_and_add (OMP_CLAUSE_REDUCTION_INIT (c),
5869 &OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c));
5870 pop_gimplify_context
5871 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c)));
5872 push_gimplify_context (&gctx);
5873 gimplify_and_add (OMP_CLAUSE_REDUCTION_MERGE (c),
5874 &OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c));
5875 pop_gimplify_context
5876 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c)));
5877 OMP_CLAUSE_REDUCTION_INIT (c) = NULL_TREE;
5878 OMP_CLAUSE_REDUCTION_MERGE (c) = NULL_TREE;
5880 gimplify_omp_ctxp = outer_ctx;
5882 else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
5883 && OMP_CLAUSE_LASTPRIVATE_STMT (c))
5885 gimplify_omp_ctxp = ctx;
5886 push_gimplify_context (&gctx);
5887 if (TREE_CODE (OMP_CLAUSE_LASTPRIVATE_STMT (c)) != BIND_EXPR)
5889 tree bind = build3 (BIND_EXPR, void_type_node, NULL,
5891 TREE_SIDE_EFFECTS (bind) = 1;
5892 BIND_EXPR_BODY (bind) = OMP_CLAUSE_LASTPRIVATE_STMT (c);
5893 OMP_CLAUSE_LASTPRIVATE_STMT (c) = bind;
5895 gimplify_and_add (OMP_CLAUSE_LASTPRIVATE_STMT (c),
5896 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c));
5897 pop_gimplify_context
5898 (gimple_seq_first_stmt (OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c)));
5899 OMP_CLAUSE_LASTPRIVATE_STMT (c) = NULL_TREE;
5901 gimplify_omp_ctxp = outer_ctx;
5907 case OMP_CLAUSE_COPYIN:
5908 case OMP_CLAUSE_COPYPRIVATE:
5909 decl = OMP_CLAUSE_DECL (c);
5910 if (error_operand_p (decl))
5917 omp_notice_variable (outer_ctx, decl, true);
5918 if (check_non_private
5919 && region_type == ORT_WORKSHARE
5920 && omp_check_private (ctx, decl))
5922 error ("%s variable %qE is private in outer context",
5923 check_non_private, DECL_NAME (decl));
5929 OMP_CLAUSE_OPERAND (c, 0)
5930 = gimple_boolify (OMP_CLAUSE_OPERAND (c, 0));
5933 case OMP_CLAUSE_SCHEDULE:
5934 case OMP_CLAUSE_NUM_THREADS:
5935 if (gimplify_expr (&OMP_CLAUSE_OPERAND (c, 0), pre_p, NULL,
5936 is_gimple_val, fb_rvalue) == GS_ERROR)
5940 case OMP_CLAUSE_NOWAIT:
5941 case OMP_CLAUSE_ORDERED:
5942 case OMP_CLAUSE_UNTIED:
5943 case OMP_CLAUSE_COLLAPSE:
5946 case OMP_CLAUSE_DEFAULT:
5947 ctx->default_kind = OMP_CLAUSE_DEFAULT_KIND (c);
5955 *list_p = OMP_CLAUSE_CHAIN (c);
5957 list_p = &OMP_CLAUSE_CHAIN (c);
5960 gimplify_omp_ctxp = ctx;
5963 /* For all variables that were not actually used within the context,
5964 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
5967 gimplify_adjust_omp_clauses_1 (splay_tree_node n, void *data)
5969 tree *list_p = (tree *) data;
5970 tree decl = (tree) n->key;
5971 unsigned flags = n->value;
5972 enum omp_clause_code code;
5976 if (flags & (GOVD_EXPLICIT | GOVD_LOCAL))
5978 if ((flags & GOVD_SEEN) == 0)
5980 if (flags & GOVD_DEBUG_PRIVATE)
5982 gcc_assert ((flags & GOVD_DATA_SHARE_CLASS) == GOVD_PRIVATE);
5983 private_debug = true;
5987 = lang_hooks.decls.omp_private_debug_clause (decl,
5988 !!(flags & GOVD_SHARED));
5990 code = OMP_CLAUSE_PRIVATE;
5991 else if (flags & GOVD_SHARED)
5993 if (is_global_var (decl))
5995 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp->outer_context;
5999 = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
6000 if (on && (on->value & (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE
6001 | GOVD_PRIVATE | GOVD_REDUCTION)) != 0)
6003 ctx = ctx->outer_context;
6008 code = OMP_CLAUSE_SHARED;
6010 else if (flags & GOVD_PRIVATE)
6011 code = OMP_CLAUSE_PRIVATE;
6012 else if (flags & GOVD_FIRSTPRIVATE)
6013 code = OMP_CLAUSE_FIRSTPRIVATE;
6017 clause = build_omp_clause (input_location, code);
6018 OMP_CLAUSE_DECL (clause) = decl;
6019 OMP_CLAUSE_CHAIN (clause) = *list_p;
6021 OMP_CLAUSE_PRIVATE_DEBUG (clause) = 1;
6022 else if (code == OMP_CLAUSE_PRIVATE && (flags & GOVD_PRIVATE_OUTER_REF))
6023 OMP_CLAUSE_PRIVATE_OUTER_REF (clause) = 1;
6025 lang_hooks.decls.omp_finish_clause (clause);
6031 gimplify_adjust_omp_clauses (tree *list_p)
6033 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
6036 while ((c = *list_p) != NULL)
6039 bool remove = false;
6041 switch (OMP_CLAUSE_CODE (c))
6043 case OMP_CLAUSE_PRIVATE:
6044 case OMP_CLAUSE_SHARED:
6045 case OMP_CLAUSE_FIRSTPRIVATE:
6046 decl = OMP_CLAUSE_DECL (c);
6047 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
6048 remove = !(n->value & GOVD_SEEN);
6051 bool shared = OMP_CLAUSE_CODE (c) == OMP_CLAUSE_SHARED;
6052 if ((n->value & GOVD_DEBUG_PRIVATE)
6053 || lang_hooks.decls.omp_private_debug_clause (decl, shared))
6055 gcc_assert ((n->value & GOVD_DEBUG_PRIVATE) == 0
6056 || ((n->value & GOVD_DATA_SHARE_CLASS)
6058 OMP_CLAUSE_SET_CODE (c, OMP_CLAUSE_PRIVATE);
6059 OMP_CLAUSE_PRIVATE_DEBUG (c) = 1;
6064 case OMP_CLAUSE_LASTPRIVATE:
6065 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
6066 accurately reflect the presence of a FIRSTPRIVATE clause. */
6067 decl = OMP_CLAUSE_DECL (c);
6068 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
6069 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)
6070 = (n->value & GOVD_FIRSTPRIVATE) != 0;
6073 case OMP_CLAUSE_REDUCTION:
6074 case OMP_CLAUSE_COPYIN:
6075 case OMP_CLAUSE_COPYPRIVATE:
6077 case OMP_CLAUSE_NUM_THREADS:
6078 case OMP_CLAUSE_SCHEDULE:
6079 case OMP_CLAUSE_NOWAIT:
6080 case OMP_CLAUSE_ORDERED:
6081 case OMP_CLAUSE_DEFAULT:
6082 case OMP_CLAUSE_UNTIED:
6083 case OMP_CLAUSE_COLLAPSE:
6091 *list_p = OMP_CLAUSE_CHAIN (c);
6093 list_p = &OMP_CLAUSE_CHAIN (c);
6096 /* Add in any implicit data sharing. */
6097 splay_tree_foreach (ctx->variables, gimplify_adjust_omp_clauses_1, list_p);
6099 gimplify_omp_ctxp = ctx->outer_context;
6100 delete_omp_context (ctx);
6103 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
6104 gimplification of the body, as well as scanning the body for used
6105 variables. We need to do this scan now, because variable-sized
6106 decls will be decomposed during gimplification. */
6109 gimplify_omp_parallel (tree *expr_p, gimple_seq *pre_p)
6111 tree expr = *expr_p;
6113 gimple_seq body = NULL;
6114 struct gimplify_ctx gctx;
6116 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr), pre_p,
6117 OMP_PARALLEL_COMBINED (expr)
6118 ? ORT_COMBINED_PARALLEL
6121 push_gimplify_context (&gctx);
6123 g = gimplify_and_return_first (OMP_PARALLEL_BODY (expr), &body);
6124 if (gimple_code (g) == GIMPLE_BIND)
6125 pop_gimplify_context (g);
6127 pop_gimplify_context (NULL);
6129 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr));
6131 g = gimple_build_omp_parallel (body,
6132 OMP_PARALLEL_CLAUSES (expr),
6133 NULL_TREE, NULL_TREE);
6134 if (OMP_PARALLEL_COMBINED (expr))
6135 gimple_omp_set_subcode (g, GF_OMP_PARALLEL_COMBINED);
6136 gimplify_seq_add_stmt (pre_p, g);
6137 *expr_p = NULL_TREE;
6140 /* Gimplify the contents of an OMP_TASK statement. This involves
6141 gimplification of the body, as well as scanning the body for used
6142 variables. We need to do this scan now, because variable-sized
6143 decls will be decomposed during gimplification. */
6146 gimplify_omp_task (tree *expr_p, gimple_seq *pre_p)
6148 tree expr = *expr_p;
6150 gimple_seq body = NULL;
6151 struct gimplify_ctx gctx;
6153 gimplify_scan_omp_clauses (&OMP_TASK_CLAUSES (expr), pre_p,
6154 find_omp_clause (OMP_TASK_CLAUSES (expr),
6156 ? ORT_UNTIED_TASK : ORT_TASK);
6158 push_gimplify_context (&gctx);
6160 g = gimplify_and_return_first (OMP_TASK_BODY (expr), &body);
6161 if (gimple_code (g) == GIMPLE_BIND)
6162 pop_gimplify_context (g);
6164 pop_gimplify_context (NULL);
6166 gimplify_adjust_omp_clauses (&OMP_TASK_CLAUSES (expr));
6168 g = gimple_build_omp_task (body,
6169 OMP_TASK_CLAUSES (expr),
6170 NULL_TREE, NULL_TREE,
6171 NULL_TREE, NULL_TREE, NULL_TREE);
6172 gimplify_seq_add_stmt (pre_p, g);
6173 *expr_p = NULL_TREE;
6176 /* Gimplify the gross structure of an OMP_FOR statement. */
6178 static enum gimplify_status
6179 gimplify_omp_for (tree *expr_p, gimple_seq *pre_p)
6181 tree for_stmt, decl, var, t;
6182 enum gimplify_status ret = GS_ALL_DONE;
6183 enum gimplify_status tret;
6185 gimple_seq for_body, for_pre_body;
6190 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt), pre_p,
6193 /* Handle OMP_FOR_INIT. */
6194 for_pre_body = NULL;
6195 gimplify_and_add (OMP_FOR_PRE_BODY (for_stmt), &for_pre_body);
6196 OMP_FOR_PRE_BODY (for_stmt) = NULL_TREE;
6198 for_body = gimple_seq_alloc ();
6199 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt))
6200 == TREE_VEC_LENGTH (OMP_FOR_COND (for_stmt)));
6201 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt))
6202 == TREE_VEC_LENGTH (OMP_FOR_INCR (for_stmt)));
6203 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)); i++)
6205 t = TREE_VEC_ELT (OMP_FOR_INIT (for_stmt), i);
6206 gcc_assert (TREE_CODE (t) == MODIFY_EXPR);
6207 decl = TREE_OPERAND (t, 0);
6208 gcc_assert (DECL_P (decl));
6209 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl))
6210 || POINTER_TYPE_P (TREE_TYPE (decl)));
6212 /* Make sure the iteration variable is private. */
6213 if (omp_is_private (gimplify_omp_ctxp, decl))
6214 omp_notice_variable (gimplify_omp_ctxp, decl, true);
6216 omp_add_variable (gimplify_omp_ctxp, decl, GOVD_PRIVATE | GOVD_SEEN);
6218 /* If DECL is not a gimple register, create a temporary variable to act
6219 as an iteration counter. This is valid, since DECL cannot be
6220 modified in the body of the loop. */
6221 if (!is_gimple_reg (decl))
6223 var = create_tmp_var (TREE_TYPE (decl), get_name (decl));
6224 TREE_OPERAND (t, 0) = var;
6226 gimplify_seq_add_stmt (&for_body, gimple_build_assign (decl, var));
6228 omp_add_variable (gimplify_omp_ctxp, var, GOVD_PRIVATE | GOVD_SEEN);
6233 tret = gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
6234 is_gimple_val, fb_rvalue);
6235 ret = MIN (ret, tret);
6236 if (ret == GS_ERROR)
6239 /* Handle OMP_FOR_COND. */
6240 t = TREE_VEC_ELT (OMP_FOR_COND (for_stmt), i);
6241 gcc_assert (COMPARISON_CLASS_P (t));
6242 gcc_assert (TREE_OPERAND (t, 0) == decl);
6244 tret = gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
6245 is_gimple_val, fb_rvalue);
6246 ret = MIN (ret, tret);
6248 /* Handle OMP_FOR_INCR. */
6249 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6250 switch (TREE_CODE (t))
6252 case PREINCREMENT_EXPR:
6253 case POSTINCREMENT_EXPR:
6254 t = build_int_cst (TREE_TYPE (decl), 1);
6255 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
6256 t = build2 (MODIFY_EXPR, TREE_TYPE (var), var, t);
6257 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i) = t;
6260 case PREDECREMENT_EXPR:
6261 case POSTDECREMENT_EXPR:
6262 t = build_int_cst (TREE_TYPE (decl), -1);
6263 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
6264 t = build2 (MODIFY_EXPR, TREE_TYPE (var), var, t);
6265 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i) = t;
6269 gcc_assert (TREE_OPERAND (t, 0) == decl);
6270 TREE_OPERAND (t, 0) = var;
6272 t = TREE_OPERAND (t, 1);
6273 switch (TREE_CODE (t))
6276 if (TREE_OPERAND (t, 1) == decl)
6278 TREE_OPERAND (t, 1) = TREE_OPERAND (t, 0);
6279 TREE_OPERAND (t, 0) = var;
6285 case POINTER_PLUS_EXPR:
6286 gcc_assert (TREE_OPERAND (t, 0) == decl);
6287 TREE_OPERAND (t, 0) = var;
6293 tret = gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
6294 is_gimple_val, fb_rvalue);
6295 ret = MIN (ret, tret);
6302 if (var != decl || TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)) > 1)
6305 for (c = OMP_FOR_CLAUSES (for_stmt); c ; c = OMP_CLAUSE_CHAIN (c))
6306 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
6307 && OMP_CLAUSE_DECL (c) == decl
6308 && OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c) == NULL)
6310 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6311 gcc_assert (TREE_CODE (t) == MODIFY_EXPR);
6312 gcc_assert (TREE_OPERAND (t, 0) == var);
6313 t = TREE_OPERAND (t, 1);
6314 gcc_assert (TREE_CODE (t) == PLUS_EXPR
6315 || TREE_CODE (t) == MINUS_EXPR
6316 || TREE_CODE (t) == POINTER_PLUS_EXPR);
6317 gcc_assert (TREE_OPERAND (t, 0) == var);
6318 t = build2 (TREE_CODE (t), TREE_TYPE (decl), decl,
6319 TREE_OPERAND (t, 1));
6320 gimplify_assign (decl, t,
6321 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c));
6326 gimplify_and_add (OMP_FOR_BODY (for_stmt), &for_body);
6328 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt));
6330 gfor = gimple_build_omp_for (for_body, OMP_FOR_CLAUSES (for_stmt),
6331 TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)),
6334 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)); i++)
6336 t = TREE_VEC_ELT (OMP_FOR_INIT (for_stmt), i);
6337 gimple_omp_for_set_index (gfor, i, TREE_OPERAND (t, 0));
6338 gimple_omp_for_set_initial (gfor, i, TREE_OPERAND (t, 1));
6339 t = TREE_VEC_ELT (OMP_FOR_COND (for_stmt), i);
6340 gimple_omp_for_set_cond (gfor, i, TREE_CODE (t));
6341 gimple_omp_for_set_final (gfor, i, TREE_OPERAND (t, 1));
6342 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6343 gimple_omp_for_set_incr (gfor, i, TREE_OPERAND (t, 1));
6346 gimplify_seq_add_stmt (pre_p, gfor);
6347 return ret == GS_ALL_DONE ? GS_ALL_DONE : GS_ERROR;
6350 /* Gimplify the gross structure of other OpenMP worksharing constructs.
6351 In particular, OMP_SECTIONS and OMP_SINGLE. */
6354 gimplify_omp_workshare (tree *expr_p, gimple_seq *pre_p)
6356 tree expr = *expr_p;
6358 gimple_seq body = NULL;
6360 gimplify_scan_omp_clauses (&OMP_CLAUSES (expr), pre_p, ORT_WORKSHARE);
6361 gimplify_and_add (OMP_BODY (expr), &body);
6362 gimplify_adjust_omp_clauses (&OMP_CLAUSES (expr));
6364 if (TREE_CODE (expr) == OMP_SECTIONS)
6365 stmt = gimple_build_omp_sections (body, OMP_CLAUSES (expr));
6366 else if (TREE_CODE (expr) == OMP_SINGLE)
6367 stmt = gimple_build_omp_single (body, OMP_CLAUSES (expr));
6371 gimplify_seq_add_stmt (pre_p, stmt);
6374 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
6375 stabilized the lhs of the atomic operation as *ADDR. Return true if
6376 EXPR is this stabilized form. */
6379 goa_lhs_expr_p (tree expr, tree addr)
6381 /* Also include casts to other type variants. The C front end is fond
6382 of adding these for e.g. volatile variables. This is like
6383 STRIP_TYPE_NOPS but includes the main variant lookup. */
6384 STRIP_USELESS_TYPE_CONVERSION (expr);
6386 if (TREE_CODE (expr) == INDIRECT_REF)
6388 expr = TREE_OPERAND (expr, 0);
6390 && (CONVERT_EXPR_P (expr)
6391 || TREE_CODE (expr) == NON_LVALUE_EXPR)
6392 && TREE_CODE (expr) == TREE_CODE (addr)
6393 && types_compatible_p (TREE_TYPE (expr), TREE_TYPE (addr)))
6395 expr = TREE_OPERAND (expr, 0);
6396 addr = TREE_OPERAND (addr, 0);
6400 return (TREE_CODE (addr) == ADDR_EXPR
6401 && TREE_CODE (expr) == ADDR_EXPR
6402 && TREE_OPERAND (addr, 0) == TREE_OPERAND (expr, 0));
6404 if (TREE_CODE (addr) == ADDR_EXPR && expr == TREE_OPERAND (addr, 0))
6409 /* Walk *EXPR_P and replace appearances of *LHS_ADDR with LHS_VAR. If an
6410 expression does not involve the lhs, evaluate it into a temporary.
6411 Return 1 if the lhs appeared as a subexpression, 0 if it did not,
6412 or -1 if an error was encountered. */
6415 goa_stabilize_expr (tree *expr_p, gimple_seq *pre_p, tree lhs_addr,
6418 tree expr = *expr_p;
6421 if (goa_lhs_expr_p (expr, lhs_addr))
6426 if (is_gimple_val (expr))
6430 switch (TREE_CODE_CLASS (TREE_CODE (expr)))
6433 case tcc_comparison:
6434 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p, lhs_addr,
6437 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p, lhs_addr,
6440 case tcc_expression:
6441 switch (TREE_CODE (expr))
6443 case TRUTH_ANDIF_EXPR:
6444 case TRUTH_ORIF_EXPR:
6445 case TRUTH_AND_EXPR:
6447 case TRUTH_XOR_EXPR:
6448 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p,
6450 case TRUTH_NOT_EXPR:
6451 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p,
6464 enum gimplify_status gs;
6465 gs = gimplify_expr (expr_p, pre_p, NULL, is_gimple_val, fb_rvalue);
6466 if (gs != GS_ALL_DONE)
6473 /* Gimplify an OMP_ATOMIC statement. */
6475 static enum gimplify_status
6476 gimplify_omp_atomic (tree *expr_p, gimple_seq *pre_p)
6478 tree addr = TREE_OPERAND (*expr_p, 0);
6479 tree rhs = TREE_OPERAND (*expr_p, 1);
6480 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr)));
6483 tmp_load = create_tmp_reg (type, NULL);
6484 if (goa_stabilize_expr (&rhs, pre_p, addr, tmp_load) < 0)
6487 if (gimplify_expr (&addr, pre_p, NULL, is_gimple_val, fb_rvalue)
6491 gimplify_seq_add_stmt (pre_p, gimple_build_omp_atomic_load (tmp_load, addr));
6492 if (gimplify_expr (&rhs, pre_p, NULL, is_gimple_val, fb_rvalue)
6495 gimplify_seq_add_stmt (pre_p, gimple_build_omp_atomic_store (rhs));
6501 /* Convert the GENERIC expression tree *EXPR_P to GIMPLE. If the
6502 expression produces a value to be used as an operand inside a GIMPLE
6503 statement, the value will be stored back in *EXPR_P. This value will
6504 be a tree of class tcc_declaration, tcc_constant, tcc_reference or
6505 an SSA_NAME. The corresponding sequence of GIMPLE statements is
6506 emitted in PRE_P and POST_P.
6508 Additionally, this process may overwrite parts of the input
6509 expression during gimplification. Ideally, it should be
6510 possible to do non-destructive gimplification.
6512 EXPR_P points to the GENERIC expression to convert to GIMPLE. If
6513 the expression needs to evaluate to a value to be used as
6514 an operand in a GIMPLE statement, this value will be stored in
6515 *EXPR_P on exit. This happens when the caller specifies one
6516 of fb_lvalue or fb_rvalue fallback flags.
6518 PRE_P will contain the sequence of GIMPLE statements corresponding
6519 to the evaluation of EXPR and all the side-effects that must
6520 be executed before the main expression. On exit, the last
6521 statement of PRE_P is the core statement being gimplified. For
6522 instance, when gimplifying 'if (++a)' the last statement in
6523 PRE_P will be 'if (t.1)' where t.1 is the result of
6524 pre-incrementing 'a'.
6526 POST_P will contain the sequence of GIMPLE statements corresponding
6527 to the evaluation of all the side-effects that must be executed
6528 after the main expression. If this is NULL, the post
6529 side-effects are stored at the end of PRE_P.
6531 The reason why the output is split in two is to handle post
6532 side-effects explicitly. In some cases, an expression may have
6533 inner and outer post side-effects which need to be emitted in
6534 an order different from the one given by the recursive
6535 traversal. For instance, for the expression (*p--)++ the post
6536 side-effects of '--' must actually occur *after* the post
6537 side-effects of '++'. However, gimplification will first visit
6538 the inner expression, so if a separate POST sequence was not
6539 used, the resulting sequence would be:
6546 However, the post-decrement operation in line #2 must not be
6547 evaluated until after the store to *p at line #4, so the
6548 correct sequence should be:
6555 So, by specifying a separate post queue, it is possible
6556 to emit the post side-effects in the correct order.
6557 If POST_P is NULL, an internal queue will be used. Before
6558 returning to the caller, the sequence POST_P is appended to
6559 the main output sequence PRE_P.
6561 GIMPLE_TEST_F points to a function that takes a tree T and
6562 returns nonzero if T is in the GIMPLE form requested by the
6563 caller. The GIMPLE predicates are in gimple.c.
6565 FALLBACK tells the function what sort of a temporary we want if
6566 gimplification cannot produce an expression that complies with
6569 fb_none means that no temporary should be generated
6570 fb_rvalue means that an rvalue is OK to generate
6571 fb_lvalue means that an lvalue is OK to generate
6572 fb_either means that either is OK, but an lvalue is preferable.
6573 fb_mayfail means that gimplification may fail (in which case
6574 GS_ERROR will be returned)
6576 The return value is either GS_ERROR or GS_ALL_DONE, since this
6577 function iterates until EXPR is completely gimplified or an error
6580 enum gimplify_status
6581 gimplify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
6582 bool (*gimple_test_f) (tree), fallback_t fallback)
6585 gimple_seq internal_pre = NULL;
6586 gimple_seq internal_post = NULL;
6589 location_t saved_location;
6590 enum gimplify_status ret;
6591 gimple_stmt_iterator pre_last_gsi, post_last_gsi;
6593 save_expr = *expr_p;
6594 if (save_expr == NULL_TREE)
6597 /* If we are gimplifying a top-level statement, PRE_P must be valid. */
6598 is_statement = gimple_test_f == is_gimple_stmt;
6602 /* Consistency checks. */
6603 if (gimple_test_f == is_gimple_reg)
6604 gcc_assert (fallback & (fb_rvalue | fb_lvalue));
6605 else if (gimple_test_f == is_gimple_val
6606 || gimple_test_f == is_gimple_call_addr
6607 || gimple_test_f == is_gimple_condexpr
6608 || gimple_test_f == is_gimple_mem_rhs
6609 || gimple_test_f == is_gimple_mem_rhs_or_call
6610 || gimple_test_f == is_gimple_reg_rhs
6611 || gimple_test_f == is_gimple_reg_rhs_or_call
6612 || gimple_test_f == is_gimple_asm_val
6613 || gimple_test_f == is_gimple_mem_ref_addr)
6614 gcc_assert (fallback & fb_rvalue);
6615 else if (gimple_test_f == is_gimple_min_lval
6616 || gimple_test_f == is_gimple_lvalue)
6617 gcc_assert (fallback & fb_lvalue);
6618 else if (gimple_test_f == is_gimple_addressable)
6619 gcc_assert (fallback & fb_either);
6620 else if (gimple_test_f == is_gimple_stmt)
6621 gcc_assert (fallback == fb_none);
6624 /* We should have recognized the GIMPLE_TEST_F predicate to
6625 know what kind of fallback to use in case a temporary is
6626 needed to hold the value or address of *EXPR_P. */
6630 /* We used to check the predicate here and return immediately if it
6631 succeeds. This is wrong; the design is for gimplification to be
6632 idempotent, and for the predicates to only test for valid forms, not
6633 whether they are fully simplified. */
6635 pre_p = &internal_pre;
6638 post_p = &internal_post;
6640 /* Remember the last statements added to PRE_P and POST_P. Every
6641 new statement added by the gimplification helpers needs to be
6642 annotated with location information. To centralize the
6643 responsibility, we remember the last statement that had been
6644 added to both queues before gimplifying *EXPR_P. If
6645 gimplification produces new statements in PRE_P and POST_P, those
6646 statements will be annotated with the same location information
6648 pre_last_gsi = gsi_last (*pre_p);
6649 post_last_gsi = gsi_last (*post_p);
6651 saved_location = input_location;
6652 if (save_expr != error_mark_node
6653 && EXPR_HAS_LOCATION (*expr_p))
6654 input_location = EXPR_LOCATION (*expr_p);
6656 /* Loop over the specific gimplifiers until the toplevel node
6657 remains the same. */
6660 /* Strip away as many useless type conversions as possible
6662 STRIP_USELESS_TYPE_CONVERSION (*expr_p);
6664 /* Remember the expr. */
6665 save_expr = *expr_p;
6667 /* Die, die, die, my darling. */
6668 if (save_expr == error_mark_node
6669 || (TREE_TYPE (save_expr)
6670 && TREE_TYPE (save_expr) == error_mark_node))
6676 /* Do any language-specific gimplification. */
6677 ret = ((enum gimplify_status)
6678 lang_hooks.gimplify_expr (expr_p, pre_p, post_p));
6681 if (*expr_p == NULL_TREE)
6683 if (*expr_p != save_expr)
6686 else if (ret != GS_UNHANDLED)
6689 /* Make sure that all the cases set 'ret' appropriately. */
6691 switch (TREE_CODE (*expr_p))
6693 /* First deal with the special cases. */
6695 case POSTINCREMENT_EXPR:
6696 case POSTDECREMENT_EXPR:
6697 case PREINCREMENT_EXPR:
6698 case PREDECREMENT_EXPR:
6699 ret = gimplify_self_mod_expr (expr_p, pre_p, post_p,
6700 fallback != fb_none);
6704 case ARRAY_RANGE_REF:
6708 case VIEW_CONVERT_EXPR:
6709 ret = gimplify_compound_lval (expr_p, pre_p, post_p,
6710 fallback ? fallback : fb_rvalue);
6714 ret = gimplify_cond_expr (expr_p, pre_p, fallback);
6716 /* C99 code may assign to an array in a structure value of a
6717 conditional expression, and this has undefined behavior
6718 only on execution, so create a temporary if an lvalue is
6720 if (fallback == fb_lvalue)
6722 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6723 mark_addressable (*expr_p);
6729 ret = gimplify_call_expr (expr_p, pre_p, fallback != fb_none);
6731 /* C99 code may assign to an array in a structure returned
6732 from a function, and this has undefined behavior only on
6733 execution, so create a temporary if an lvalue is
6735 if (fallback == fb_lvalue)
6737 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6738 mark_addressable (*expr_p);
6747 ret = gimplify_compound_expr (expr_p, pre_p, fallback != fb_none);
6750 case COMPOUND_LITERAL_EXPR:
6751 ret = gimplify_compound_literal_expr (expr_p, pre_p);
6756 ret = gimplify_modify_expr (expr_p, pre_p, post_p,
6757 fallback != fb_none);
6760 case TRUTH_ANDIF_EXPR:
6761 case TRUTH_ORIF_EXPR:
6763 /* Preserve the original type of the expression and the
6764 source location of the outer expression. */
6765 tree org_type = TREE_TYPE (*expr_p);
6766 *expr_p = gimple_boolify (*expr_p);
6767 *expr_p = build3_loc (saved_location, COND_EXPR,
6771 org_type, boolean_true_node),
6774 org_type, boolean_false_node));
6779 case TRUTH_NOT_EXPR:
6781 tree org_type = TREE_TYPE (*expr_p);
6783 *expr_p = gimple_boolify (*expr_p);
6784 if (org_type != boolean_type_node)
6786 *expr_p = fold_convert (org_type, *expr_p);
6792 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6793 is_gimple_val, fb_rvalue);
6794 recalculate_side_effects (*expr_p);
6798 ret = gimplify_addr_expr (expr_p, pre_p, post_p);
6802 ret = gimplify_va_arg_expr (expr_p, pre_p, post_p);
6806 if (IS_EMPTY_STMT (*expr_p))
6812 if (VOID_TYPE_P (TREE_TYPE (*expr_p))
6813 || fallback == fb_none)
6815 /* Just strip a conversion to void (or in void context) and
6817 *expr_p = TREE_OPERAND (*expr_p, 0);
6822 ret = gimplify_conversion (expr_p);
6823 if (ret == GS_ERROR)
6825 if (*expr_p != save_expr)
6829 case FIX_TRUNC_EXPR:
6830 /* unary_expr: ... | '(' cast ')' val | ... */
6831 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6832 is_gimple_val, fb_rvalue);
6833 recalculate_side_effects (*expr_p);
6838 bool volatilep = TREE_THIS_VOLATILE (*expr_p);
6839 bool notrap = TREE_THIS_NOTRAP (*expr_p);
6840 tree saved_ptr_type = TREE_TYPE (TREE_OPERAND (*expr_p, 0));
6842 *expr_p = fold_indirect_ref_loc (input_location, *expr_p);
6843 if (*expr_p != save_expr)
6849 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6850 is_gimple_reg, fb_rvalue);
6851 if (ret == GS_ERROR)
6854 recalculate_side_effects (*expr_p);
6855 *expr_p = fold_build2_loc (input_location, MEM_REF,
6856 TREE_TYPE (*expr_p),
6857 TREE_OPERAND (*expr_p, 0),
6858 build_int_cst (saved_ptr_type, 0));
6859 TREE_THIS_VOLATILE (*expr_p) = volatilep;
6860 TREE_THIS_NOTRAP (*expr_p) = notrap;
6865 /* We arrive here through the various re-gimplifcation paths. */
6867 /* First try re-folding the whole thing. */
6868 tmp = fold_binary (MEM_REF, TREE_TYPE (*expr_p),
6869 TREE_OPERAND (*expr_p, 0),
6870 TREE_OPERAND (*expr_p, 1));
6874 recalculate_side_effects (*expr_p);
6878 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6879 is_gimple_mem_ref_addr, fb_rvalue);
6880 if (ret == GS_ERROR)
6882 recalculate_side_effects (*expr_p);
6886 /* Constants need not be gimplified. */
6897 /* If we require an lvalue, such as for ADDR_EXPR, retain the
6898 CONST_DECL node. Otherwise the decl is replaceable by its
6900 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
6901 if (fallback & fb_lvalue)
6905 *expr_p = DECL_INITIAL (*expr_p);
6911 ret = gimplify_decl_expr (expr_p, pre_p);
6915 ret = gimplify_bind_expr (expr_p, pre_p);
6919 ret = gimplify_loop_expr (expr_p, pre_p);
6923 ret = gimplify_switch_expr (expr_p, pre_p);
6927 ret = gimplify_exit_expr (expr_p);
6931 /* If the target is not LABEL, then it is a computed jump
6932 and the target needs to be gimplified. */
6933 if (TREE_CODE (GOTO_DESTINATION (*expr_p)) != LABEL_DECL)
6935 ret = gimplify_expr (&GOTO_DESTINATION (*expr_p), pre_p,
6936 NULL, is_gimple_val, fb_rvalue);
6937 if (ret == GS_ERROR)
6940 gimplify_seq_add_stmt (pre_p,
6941 gimple_build_goto (GOTO_DESTINATION (*expr_p)));
6946 gimplify_seq_add_stmt (pre_p,
6947 gimple_build_predict (PREDICT_EXPR_PREDICTOR (*expr_p),
6948 PREDICT_EXPR_OUTCOME (*expr_p)));
6954 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p))
6955 == current_function_decl);
6956 gimplify_seq_add_stmt (pre_p,
6957 gimple_build_label (LABEL_EXPR_LABEL (*expr_p)));
6960 case CASE_LABEL_EXPR:
6961 ret = gimplify_case_label_expr (expr_p, pre_p);
6965 ret = gimplify_return_expr (*expr_p, pre_p);
6969 /* Don't reduce this in place; let gimplify_init_constructor work its
6970 magic. Buf if we're just elaborating this for side effects, just
6971 gimplify any element that has side-effects. */
6972 if (fallback == fb_none)
6974 unsigned HOST_WIDE_INT ix;
6976 tree temp = NULL_TREE;
6977 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (*expr_p), ix, val)
6978 if (TREE_SIDE_EFFECTS (val))
6979 append_to_statement_list (val, &temp);
6982 ret = temp ? GS_OK : GS_ALL_DONE;
6984 /* C99 code may assign to an array in a constructed
6985 structure or union, and this has undefined behavior only
6986 on execution, so create a temporary if an lvalue is
6988 else if (fallback == fb_lvalue)
6990 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6991 mark_addressable (*expr_p);
6998 /* The following are special cases that are not handled by the
6999 original GIMPLE grammar. */
7001 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
7004 ret = gimplify_save_expr (expr_p, pre_p, post_p);
7009 enum gimplify_status r0, r1, r2;
7011 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7012 post_p, is_gimple_lvalue, fb_either);
7013 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
7014 post_p, is_gimple_val, fb_rvalue);
7015 r2 = gimplify_expr (&TREE_OPERAND (*expr_p, 2), pre_p,
7016 post_p, is_gimple_val, fb_rvalue);
7017 recalculate_side_effects (*expr_p);
7019 ret = MIN (r0, MIN (r1, r2));
7023 case TARGET_MEM_REF:
7025 enum gimplify_status r0 = GS_ALL_DONE, r1 = GS_ALL_DONE;
7027 if (TMR_BASE (*expr_p))
7028 r0 = gimplify_expr (&TMR_BASE (*expr_p), pre_p,
7029 post_p, is_gimple_mem_ref_addr, fb_either);
7030 if (TMR_INDEX (*expr_p))
7031 r1 = gimplify_expr (&TMR_INDEX (*expr_p), pre_p,
7032 post_p, is_gimple_val, fb_rvalue);
7033 if (TMR_INDEX2 (*expr_p))
7034 r1 = gimplify_expr (&TMR_INDEX2 (*expr_p), pre_p,
7035 post_p, is_gimple_val, fb_rvalue);
7036 /* TMR_STEP and TMR_OFFSET are always integer constants. */
7041 case NON_LVALUE_EXPR:
7042 /* This should have been stripped above. */
7046 ret = gimplify_asm_expr (expr_p, pre_p, post_p);
7049 case TRY_FINALLY_EXPR:
7050 case TRY_CATCH_EXPR:
7052 gimple_seq eval, cleanup;
7055 eval = cleanup = NULL;
7056 gimplify_and_add (TREE_OPERAND (*expr_p, 0), &eval);
7057 gimplify_and_add (TREE_OPERAND (*expr_p, 1), &cleanup);
7058 /* Don't create bogus GIMPLE_TRY with empty cleanup. */
7059 if (gimple_seq_empty_p (cleanup))
7061 gimple_seq_add_seq (pre_p, eval);
7065 try_ = gimple_build_try (eval, cleanup,
7066 TREE_CODE (*expr_p) == TRY_FINALLY_EXPR
7067 ? GIMPLE_TRY_FINALLY
7068 : GIMPLE_TRY_CATCH);
7069 if (TREE_CODE (*expr_p) == TRY_CATCH_EXPR)
7070 gimple_try_set_catch_is_cleanup (try_,
7071 TRY_CATCH_IS_CLEANUP (*expr_p));
7072 gimplify_seq_add_stmt (pre_p, try_);
7077 case CLEANUP_POINT_EXPR:
7078 ret = gimplify_cleanup_point_expr (expr_p, pre_p);
7082 ret = gimplify_target_expr (expr_p, pre_p, post_p);
7088 gimple_seq handler = NULL;
7089 gimplify_and_add (CATCH_BODY (*expr_p), &handler);
7090 c = gimple_build_catch (CATCH_TYPES (*expr_p), handler);
7091 gimplify_seq_add_stmt (pre_p, c);
7096 case EH_FILTER_EXPR:
7099 gimple_seq failure = NULL;
7101 gimplify_and_add (EH_FILTER_FAILURE (*expr_p), &failure);
7102 ehf = gimple_build_eh_filter (EH_FILTER_TYPES (*expr_p), failure);
7103 gimple_set_no_warning (ehf, TREE_NO_WARNING (*expr_p));
7104 gimplify_seq_add_stmt (pre_p, ehf);
7111 enum gimplify_status r0, r1;
7112 r0 = gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p), pre_p,
7113 post_p, is_gimple_val, fb_rvalue);
7114 r1 = gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p), pre_p,
7115 post_p, is_gimple_val, fb_rvalue);
7116 TREE_SIDE_EFFECTS (*expr_p) = 0;
7122 /* We get here when taking the address of a label. We mark
7123 the label as "forced"; meaning it can never be removed and
7124 it is a potential target for any computed goto. */
7125 FORCED_LABEL (*expr_p) = 1;
7129 case STATEMENT_LIST:
7130 ret = gimplify_statement_list (expr_p, pre_p);
7133 case WITH_SIZE_EXPR:
7135 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7136 post_p == &internal_post ? NULL : post_p,
7137 gimple_test_f, fallback);
7138 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
7139 is_gimple_val, fb_rvalue);
7146 ret = gimplify_var_or_parm_decl (expr_p);
7150 /* When within an OpenMP context, notice uses of variables. */
7151 if (gimplify_omp_ctxp)
7152 omp_notice_variable (gimplify_omp_ctxp, *expr_p, true);
7157 /* Allow callbacks into the gimplifier during optimization. */
7162 gimplify_omp_parallel (expr_p, pre_p);
7167 gimplify_omp_task (expr_p, pre_p);
7172 ret = gimplify_omp_for (expr_p, pre_p);
7177 gimplify_omp_workshare (expr_p, pre_p);
7186 gimple_seq body = NULL;
7189 gimplify_and_add (OMP_BODY (*expr_p), &body);
7190 switch (TREE_CODE (*expr_p))
7193 g = gimple_build_omp_section (body);
7196 g = gimple_build_omp_master (body);
7199 g = gimple_build_omp_ordered (body);
7202 g = gimple_build_omp_critical (body,
7203 OMP_CRITICAL_NAME (*expr_p));
7208 gimplify_seq_add_stmt (pre_p, g);
7214 ret = gimplify_omp_atomic (expr_p, pre_p);
7217 case TRUTH_AND_EXPR:
7219 case TRUTH_XOR_EXPR:
7221 tree org_type = TREE_TYPE (*expr_p);
7223 *expr_p = gimple_boolify (*expr_p);
7225 /* This shouldn't happen, but due fold-const (and here especially
7226 fold_truth_not_expr) happily uses operand type and doesn't
7227 automatically uses boolean_type as result, we need to keep
7229 if (org_type != boolean_type_node)
7231 *expr_p = fold_convert (org_type, *expr_p);
7237 /* With two-valued operand types binary truth expressions are
7238 semantically equivalent to bitwise binary expressions. Canonicalize
7239 them to the bitwise variant. */ switch (TREE_CODE (*expr_p))
7241 case TRUTH_AND_EXPR:
7242 TREE_SET_CODE (*expr_p, BIT_AND_EXPR);
7245 TREE_SET_CODE (*expr_p, BIT_IOR_EXPR);
7247 case TRUTH_XOR_EXPR:
7248 TREE_SET_CODE (*expr_p, BIT_XOR_EXPR);
7253 /* Classified as tcc_expression. */
7257 /* Classified as tcc_expression. */
7260 case POINTER_PLUS_EXPR:
7261 /* Convert ((type *)A)+offset into &A->field_of_type_and_offset.
7262 The second is gimple immediate saving a need for extra statement.
7264 if (TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
7265 && (tmp = maybe_fold_offset_to_address
7266 (EXPR_LOCATION (*expr_p),
7267 TREE_OPERAND (*expr_p, 0), TREE_OPERAND (*expr_p, 1),
7268 TREE_TYPE (*expr_p))))
7274 /* Convert (void *)&a + 4 into (void *)&a[1]. */
7275 if (TREE_CODE (TREE_OPERAND (*expr_p, 0)) == NOP_EXPR
7276 && TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
7277 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p,
7279 && (tmp = maybe_fold_offset_to_address
7280 (EXPR_LOCATION (*expr_p),
7281 TREE_OPERAND (TREE_OPERAND (*expr_p, 0), 0),
7282 TREE_OPERAND (*expr_p, 1),
7283 TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p, 0),
7286 *expr_p = fold_convert (TREE_TYPE (*expr_p), tmp);
7293 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p)))
7295 case tcc_comparison:
7296 /* Handle comparison of objects of non scalar mode aggregates
7297 with a call to memcmp. It would be nice to only have to do
7298 this for variable-sized objects, but then we'd have to allow
7299 the same nest of reference nodes we allow for MODIFY_EXPR and
7302 Compare scalar mode aggregates as scalar mode values. Using
7303 memcmp for them would be very inefficient at best, and is
7304 plain wrong if bitfields are involved. */
7306 tree type = TREE_TYPE (TREE_OPERAND (*expr_p, 1));
7308 if (!AGGREGATE_TYPE_P (type))
7310 else if (TYPE_MODE (type) != BLKmode)
7311 ret = gimplify_scalar_mode_aggregate_compare (expr_p);
7313 ret = gimplify_variable_sized_compare (expr_p);
7318 /* If *EXPR_P does not need to be special-cased, handle it
7319 according to its class. */
7321 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7322 post_p, is_gimple_val, fb_rvalue);
7328 enum gimplify_status r0, r1;
7330 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7331 post_p, is_gimple_val, fb_rvalue);
7332 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
7333 post_p, is_gimple_val, fb_rvalue);
7341 enum gimplify_status r0, r1, r2;
7343 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7344 post_p, is_gimple_val, fb_rvalue);
7345 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
7346 post_p, is_gimple_val, fb_rvalue);
7347 r2 = gimplify_expr (&TREE_OPERAND (*expr_p, 2), pre_p,
7348 post_p, is_gimple_val, fb_rvalue);
7350 ret = MIN (MIN (r0, r1), r2);
7354 case tcc_declaration:
7357 goto dont_recalculate;
7363 recalculate_side_effects (*expr_p);
7369 gcc_assert (*expr_p || ret != GS_OK);
7371 while (ret == GS_OK);
7373 /* If we encountered an error_mark somewhere nested inside, either
7374 stub out the statement or propagate the error back out. */
7375 if (ret == GS_ERROR)
7382 /* This was only valid as a return value from the langhook, which
7383 we handled. Make sure it doesn't escape from any other context. */
7384 gcc_assert (ret != GS_UNHANDLED);
7386 if (fallback == fb_none && *expr_p && !is_gimple_stmt (*expr_p))
7388 /* We aren't looking for a value, and we don't have a valid
7389 statement. If it doesn't have side-effects, throw it away. */
7390 if (!TREE_SIDE_EFFECTS (*expr_p))
7392 else if (!TREE_THIS_VOLATILE (*expr_p))
7394 /* This is probably a _REF that contains something nested that
7395 has side effects. Recurse through the operands to find it. */
7396 enum tree_code code = TREE_CODE (*expr_p);
7403 case VIEW_CONVERT_EXPR:
7404 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
7405 gimple_test_f, fallback);
7409 case ARRAY_RANGE_REF:
7410 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
7411 gimple_test_f, fallback);
7412 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
7413 gimple_test_f, fallback);
7417 /* Anything else with side-effects must be converted to
7418 a valid statement before we get here. */
7424 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p))
7425 && TYPE_MODE (TREE_TYPE (*expr_p)) != BLKmode)
7427 /* Historically, the compiler has treated a bare reference
7428 to a non-BLKmode volatile lvalue as forcing a load. */
7429 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p));
7431 /* Normally, we do not want to create a temporary for a
7432 TREE_ADDRESSABLE type because such a type should not be
7433 copied by bitwise-assignment. However, we make an
7434 exception here, as all we are doing here is ensuring that
7435 we read the bytes that make up the type. We use
7436 create_tmp_var_raw because create_tmp_var will abort when
7437 given a TREE_ADDRESSABLE type. */
7438 tree tmp = create_tmp_var_raw (type, "vol");
7439 gimple_add_tmp_var (tmp);
7440 gimplify_assign (tmp, *expr_p, pre_p);
7444 /* We can't do anything useful with a volatile reference to
7445 an incomplete type, so just throw it away. Likewise for
7446 a BLKmode type, since any implicit inner load should
7447 already have been turned into an explicit one by the
7448 gimplification process. */
7452 /* If we are gimplifying at the statement level, we're done. Tack
7453 everything together and return. */
7454 if (fallback == fb_none || is_statement)
7456 /* Since *EXPR_P has been converted into a GIMPLE tuple, clear
7457 it out for GC to reclaim it. */
7458 *expr_p = NULL_TREE;
7460 if (!gimple_seq_empty_p (internal_pre)
7461 || !gimple_seq_empty_p (internal_post))
7463 gimplify_seq_add_seq (&internal_pre, internal_post);
7464 gimplify_seq_add_seq (pre_p, internal_pre);
7467 /* The result of gimplifying *EXPR_P is going to be the last few
7468 statements in *PRE_P and *POST_P. Add location information
7469 to all the statements that were added by the gimplification
7471 if (!gimple_seq_empty_p (*pre_p))
7472 annotate_all_with_location_after (*pre_p, pre_last_gsi, input_location);
7474 if (!gimple_seq_empty_p (*post_p))
7475 annotate_all_with_location_after (*post_p, post_last_gsi,
7481 #ifdef ENABLE_GIMPLE_CHECKING
7484 enum tree_code code = TREE_CODE (*expr_p);
7485 /* These expressions should already be in gimple IR form. */
7486 gcc_assert (code != MODIFY_EXPR
7488 && code != BIND_EXPR
7489 && code != CATCH_EXPR
7490 && (code != COND_EXPR || gimplify_ctxp->allow_rhs_cond_expr)
7491 && code != EH_FILTER_EXPR
7492 && code != GOTO_EXPR
7493 && code != LABEL_EXPR
7494 && code != LOOP_EXPR
7495 && code != SWITCH_EXPR
7496 && code != TRY_FINALLY_EXPR
7497 && code != OMP_CRITICAL
7499 && code != OMP_MASTER
7500 && code != OMP_ORDERED
7501 && code != OMP_PARALLEL
7502 && code != OMP_SECTIONS
7503 && code != OMP_SECTION
7504 && code != OMP_SINGLE);
7508 /* Otherwise we're gimplifying a subexpression, so the resulting
7509 value is interesting. If it's a valid operand that matches
7510 GIMPLE_TEST_F, we're done. Unless we are handling some
7511 post-effects internally; if that's the case, we need to copy into
7512 a temporary before adding the post-effects to POST_P. */
7513 if (gimple_seq_empty_p (internal_post) && (*gimple_test_f) (*expr_p))
7516 /* Otherwise, we need to create a new temporary for the gimplified
7519 /* We can't return an lvalue if we have an internal postqueue. The
7520 object the lvalue refers to would (probably) be modified by the
7521 postqueue; we need to copy the value out first, which means an
7523 if ((fallback & fb_lvalue)
7524 && gimple_seq_empty_p (internal_post)
7525 && is_gimple_addressable (*expr_p))
7527 /* An lvalue will do. Take the address of the expression, store it
7528 in a temporary, and replace the expression with an INDIRECT_REF of
7530 tmp = build_fold_addr_expr_loc (input_location, *expr_p);
7531 gimplify_expr (&tmp, pre_p, post_p, is_gimple_reg, fb_rvalue);
7532 *expr_p = build_simple_mem_ref (tmp);
7534 else if ((fallback & fb_rvalue) && is_gimple_reg_rhs_or_call (*expr_p))
7536 /* An rvalue will do. Assign the gimplified expression into a
7537 new temporary TMP and replace the original expression with
7538 TMP. First, make sure that the expression has a type so that
7539 it can be assigned into a temporary. */
7540 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p)));
7542 if (!gimple_seq_empty_p (internal_post) || (fallback & fb_lvalue))
7543 /* The postqueue might change the value of the expression between
7544 the initialization and use of the temporary, so we can't use a
7545 formal temp. FIXME do we care? */
7547 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
7548 if (TREE_CODE (TREE_TYPE (*expr_p)) == COMPLEX_TYPE
7549 || TREE_CODE (TREE_TYPE (*expr_p)) == VECTOR_TYPE)
7550 DECL_GIMPLE_REG_P (*expr_p) = 1;
7553 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
7557 #ifdef ENABLE_GIMPLE_CHECKING
7558 if (!(fallback & fb_mayfail))
7560 fprintf (stderr, "gimplification failed:\n");
7561 print_generic_expr (stderr, *expr_p, 0);
7562 debug_tree (*expr_p);
7563 internal_error ("gimplification failed");
7566 gcc_assert (fallback & fb_mayfail);
7568 /* If this is an asm statement, and the user asked for the
7569 impossible, don't die. Fail and let gimplify_asm_expr
7575 /* Make sure the temporary matches our predicate. */
7576 gcc_assert ((*gimple_test_f) (*expr_p));
7578 if (!gimple_seq_empty_p (internal_post))
7580 annotate_all_with_location (internal_post, input_location);
7581 gimplify_seq_add_seq (pre_p, internal_post);
7585 input_location = saved_location;
7589 /* Look through TYPE for variable-sized objects and gimplify each such
7590 size that we find. Add to LIST_P any statements generated. */
7593 gimplify_type_sizes (tree type, gimple_seq *list_p)
7597 if (type == NULL || type == error_mark_node)
7600 /* We first do the main variant, then copy into any other variants. */
7601 type = TYPE_MAIN_VARIANT (type);
7603 /* Avoid infinite recursion. */
7604 if (TYPE_SIZES_GIMPLIFIED (type))
7607 TYPE_SIZES_GIMPLIFIED (type) = 1;
7609 switch (TREE_CODE (type))
7615 case FIXED_POINT_TYPE:
7616 gimplify_one_sizepos (&TYPE_MIN_VALUE (type), list_p);
7617 gimplify_one_sizepos (&TYPE_MAX_VALUE (type), list_p);
7619 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
7621 TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (type);
7622 TYPE_MAX_VALUE (t) = TYPE_MAX_VALUE (type);
7627 /* These types may not have declarations, so handle them here. */
7628 gimplify_type_sizes (TREE_TYPE (type), list_p);
7629 gimplify_type_sizes (TYPE_DOMAIN (type), list_p);
7630 /* Ensure VLA bounds aren't removed, for -O0 they should be variables
7631 with assigned stack slots, for -O1+ -g they should be tracked
7633 if (!(TYPE_NAME (type)
7634 && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
7635 && DECL_IGNORED_P (TYPE_NAME (type)))
7636 && TYPE_DOMAIN (type)
7637 && INTEGRAL_TYPE_P (TYPE_DOMAIN (type)))
7639 t = TYPE_MIN_VALUE (TYPE_DOMAIN (type));
7640 if (t && TREE_CODE (t) == VAR_DECL && DECL_ARTIFICIAL (t))
7641 DECL_IGNORED_P (t) = 0;
7642 t = TYPE_MAX_VALUE (TYPE_DOMAIN (type));
7643 if (t && TREE_CODE (t) == VAR_DECL && DECL_ARTIFICIAL (t))
7644 DECL_IGNORED_P (t) = 0;
7650 case QUAL_UNION_TYPE:
7651 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
7652 if (TREE_CODE (field) == FIELD_DECL)
7654 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field), list_p);
7655 gimplify_one_sizepos (&DECL_SIZE (field), list_p);
7656 gimplify_one_sizepos (&DECL_SIZE_UNIT (field), list_p);
7657 gimplify_type_sizes (TREE_TYPE (field), list_p);
7662 case REFERENCE_TYPE:
7663 /* We used to recurse on the pointed-to type here, which turned out to
7664 be incorrect because its definition might refer to variables not
7665 yet initialized at this point if a forward declaration is involved.
7667 It was actually useful for anonymous pointed-to types to ensure
7668 that the sizes evaluation dominates every possible later use of the
7669 values. Restricting to such types here would be safe since there
7670 is no possible forward declaration around, but would introduce an
7671 undesirable middle-end semantic to anonymity. We then defer to
7672 front-ends the responsibility of ensuring that the sizes are
7673 evaluated both early and late enough, e.g. by attaching artificial
7674 type declarations to the tree. */
7681 gimplify_one_sizepos (&TYPE_SIZE (type), list_p);
7682 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type), list_p);
7684 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
7686 TYPE_SIZE (t) = TYPE_SIZE (type);
7687 TYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (type);
7688 TYPE_SIZES_GIMPLIFIED (t) = 1;
7692 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
7693 a size or position, has had all of its SAVE_EXPRs evaluated.
7694 We add any required statements to *STMT_P. */
7697 gimplify_one_sizepos (tree *expr_p, gimple_seq *stmt_p)
7699 tree type, expr = *expr_p;
7701 /* We don't do anything if the value isn't there, is constant, or contains
7702 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
7703 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
7704 will want to replace it with a new variable, but that will cause problems
7705 if this type is from outside the function. It's OK to have that here. */
7706 if (expr == NULL_TREE || TREE_CONSTANT (expr)
7707 || TREE_CODE (expr) == VAR_DECL
7708 || CONTAINS_PLACEHOLDER_P (expr))
7711 type = TREE_TYPE (expr);
7712 *expr_p = unshare_expr (expr);
7714 gimplify_expr (expr_p, stmt_p, NULL, is_gimple_val, fb_rvalue);
7717 /* Verify that we've an exact type match with the original expression.
7718 In particular, we do not wish to drop a "sizetype" in favour of a
7719 type of similar dimensions. We don't want to pollute the generic
7720 type-stripping code with this knowledge because it doesn't matter
7721 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
7722 and friends retain their "sizetype-ness". */
7723 if (TREE_TYPE (expr) != type
7724 && TREE_CODE (type) == INTEGER_TYPE
7725 && TYPE_IS_SIZETYPE (type))
7730 *expr_p = create_tmp_var (type, NULL);
7731 tmp = build1 (NOP_EXPR, type, expr);
7732 stmt = gimplify_assign (*expr_p, tmp, stmt_p);
7733 gimple_set_location (stmt, EXPR_LOC_OR_HERE (expr));
7737 /* Gimplify the body of statements pointed to by BODY_P and return a
7738 GIMPLE_BIND containing the sequence of GIMPLE statements
7739 corresponding to BODY_P. FNDECL is the function decl containing
7743 gimplify_body (tree *body_p, tree fndecl, bool do_parms)
7745 location_t saved_location = input_location;
7746 gimple_seq parm_stmts, seq;
7748 struct gimplify_ctx gctx;
7749 struct cgraph_node *cgn;
7751 timevar_push (TV_TREE_GIMPLIFY);
7753 /* Initialize for optimize_insn_for_s{ize,peed}_p possibly called during
7755 default_rtl_profile ();
7757 gcc_assert (gimplify_ctxp == NULL);
7758 push_gimplify_context (&gctx);
7760 /* Unshare most shared trees in the body and in that of any nested functions.
7761 It would seem we don't have to do this for nested functions because
7762 they are supposed to be output and then the outer function gimplified
7763 first, but the g++ front end doesn't always do it that way. */
7764 unshare_body (body_p, fndecl);
7765 unvisit_body (body_p, fndecl);
7767 cgn = cgraph_get_node (fndecl);
7768 if (cgn && cgn->origin)
7769 nonlocal_vlas = pointer_set_create ();
7771 /* Make sure input_location isn't set to something weird. */
7772 input_location = DECL_SOURCE_LOCATION (fndecl);
7774 /* Resolve callee-copies. This has to be done before processing
7775 the body so that DECL_VALUE_EXPR gets processed correctly. */
7776 parm_stmts = (do_parms) ? gimplify_parameters () : NULL;
7778 /* Gimplify the function's body. */
7780 gimplify_stmt (body_p, &seq);
7781 outer_bind = gimple_seq_first_stmt (seq);
7784 outer_bind = gimple_build_nop ();
7785 gimplify_seq_add_stmt (&seq, outer_bind);
7788 /* The body must contain exactly one statement, a GIMPLE_BIND. If this is
7789 not the case, wrap everything in a GIMPLE_BIND to make it so. */
7790 if (gimple_code (outer_bind) == GIMPLE_BIND
7791 && gimple_seq_first (seq) == gimple_seq_last (seq))
7794 outer_bind = gimple_build_bind (NULL_TREE, seq, NULL);
7796 *body_p = NULL_TREE;
7798 /* If we had callee-copies statements, insert them at the beginning
7799 of the function and clear DECL_VALUE_EXPR_P on the parameters. */
7800 if (!gimple_seq_empty_p (parm_stmts))
7804 gimplify_seq_add_seq (&parm_stmts, gimple_bind_body (outer_bind));
7805 gimple_bind_set_body (outer_bind, parm_stmts);
7807 for (parm = DECL_ARGUMENTS (current_function_decl);
7808 parm; parm = DECL_CHAIN (parm))
7809 if (DECL_HAS_VALUE_EXPR_P (parm))
7811 DECL_HAS_VALUE_EXPR_P (parm) = 0;
7812 DECL_IGNORED_P (parm) = 0;
7818 pointer_set_destroy (nonlocal_vlas);
7819 nonlocal_vlas = NULL;
7822 pop_gimplify_context (outer_bind);
7823 gcc_assert (gimplify_ctxp == NULL);
7826 verify_gimple_in_seq (gimple_bind_body (outer_bind));
7828 timevar_pop (TV_TREE_GIMPLIFY);
7829 input_location = saved_location;
7834 typedef char *char_p; /* For DEF_VEC_P. */
7836 DEF_VEC_ALLOC_P(char_p,heap);
7838 /* Return whether we should exclude FNDECL from instrumentation. */
7841 flag_instrument_functions_exclude_p (tree fndecl)
7843 VEC(char_p,heap) *vec;
7845 vec = (VEC(char_p,heap) *) flag_instrument_functions_exclude_functions;
7846 if (VEC_length (char_p, vec) > 0)
7852 name = lang_hooks.decl_printable_name (fndecl, 0);
7853 FOR_EACH_VEC_ELT (char_p, vec, i, s)
7854 if (strstr (name, s) != NULL)
7858 vec = (VEC(char_p,heap) *) flag_instrument_functions_exclude_files;
7859 if (VEC_length (char_p, vec) > 0)
7865 name = DECL_SOURCE_FILE (fndecl);
7866 FOR_EACH_VEC_ELT (char_p, vec, i, s)
7867 if (strstr (name, s) != NULL)
7874 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
7875 node for the function we want to gimplify.
7877 Return the sequence of GIMPLE statements corresponding to the body
7881 gimplify_function_tree (tree fndecl)
7883 tree oldfn, parm, ret;
7887 gcc_assert (!gimple_body (fndecl));
7889 oldfn = current_function_decl;
7890 current_function_decl = fndecl;
7891 if (DECL_STRUCT_FUNCTION (fndecl))
7892 push_cfun (DECL_STRUCT_FUNCTION (fndecl));
7894 push_struct_function (fndecl);
7896 for (parm = DECL_ARGUMENTS (fndecl); parm ; parm = DECL_CHAIN (parm))
7898 /* Preliminarily mark non-addressed complex variables as eligible
7899 for promotion to gimple registers. We'll transform their uses
7901 if ((TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
7902 || TREE_CODE (TREE_TYPE (parm)) == VECTOR_TYPE)
7903 && !TREE_THIS_VOLATILE (parm)
7904 && !needs_to_live_in_memory (parm))
7905 DECL_GIMPLE_REG_P (parm) = 1;
7908 ret = DECL_RESULT (fndecl);
7909 if ((TREE_CODE (TREE_TYPE (ret)) == COMPLEX_TYPE
7910 || TREE_CODE (TREE_TYPE (ret)) == VECTOR_TYPE)
7911 && !needs_to_live_in_memory (ret))
7912 DECL_GIMPLE_REG_P (ret) = 1;
7914 bind = gimplify_body (&DECL_SAVED_TREE (fndecl), fndecl, true);
7916 /* The tree body of the function is no longer needed, replace it
7917 with the new GIMPLE body. */
7918 seq = gimple_seq_alloc ();
7919 gimple_seq_add_stmt (&seq, bind);
7920 gimple_set_body (fndecl, seq);
7922 /* If we're instrumenting function entry/exit, then prepend the call to
7923 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
7924 catch the exit hook. */
7925 /* ??? Add some way to ignore exceptions for this TFE. */
7926 if (flag_instrument_function_entry_exit
7927 && !DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl)
7928 && !flag_instrument_functions_exclude_p (fndecl))
7933 gimple_seq cleanup = NULL, body = NULL;
7937 x = implicit_built_in_decls[BUILT_IN_RETURN_ADDRESS];
7938 call = gimple_build_call (x, 1, integer_zero_node);
7939 tmp_var = create_tmp_var (ptr_type_node, "return_addr");
7940 gimple_call_set_lhs (call, tmp_var);
7941 gimplify_seq_add_stmt (&cleanup, call);
7942 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_EXIT];
7943 call = gimple_build_call (x, 2,
7944 build_fold_addr_expr (current_function_decl),
7946 gimplify_seq_add_stmt (&cleanup, call);
7947 tf = gimple_build_try (seq, cleanup, GIMPLE_TRY_FINALLY);
7949 x = implicit_built_in_decls[BUILT_IN_RETURN_ADDRESS];
7950 call = gimple_build_call (x, 1, integer_zero_node);
7951 tmp_var = create_tmp_var (ptr_type_node, "return_addr");
7952 gimple_call_set_lhs (call, tmp_var);
7953 gimplify_seq_add_stmt (&body, call);
7954 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_ENTER];
7955 call = gimple_build_call (x, 2,
7956 build_fold_addr_expr (current_function_decl),
7958 gimplify_seq_add_stmt (&body, call);
7959 gimplify_seq_add_stmt (&body, tf);
7960 new_bind = gimple_build_bind (NULL, body, gimple_bind_block (bind));
7961 /* Clear the block for BIND, since it is no longer directly inside
7962 the function, but within a try block. */
7963 gimple_bind_set_block (bind, NULL);
7965 /* Replace the current function body with the body
7966 wrapped in the try/finally TF. */
7967 seq = gimple_seq_alloc ();
7968 gimple_seq_add_stmt (&seq, new_bind);
7969 gimple_set_body (fndecl, seq);
7972 DECL_SAVED_TREE (fndecl) = NULL_TREE;
7973 cfun->curr_properties = PROP_gimple_any;
7975 current_function_decl = oldfn;
7979 /* Some transformations like inlining may invalidate the GIMPLE form
7980 for operands. This function traverses all the operands in STMT and
7981 gimplifies anything that is not a valid gimple operand. Any new
7982 GIMPLE statements are inserted before *GSI_P. */
7985 gimple_regimplify_operands (gimple stmt, gimple_stmt_iterator *gsi_p)
7988 tree orig_lhs = NULL_TREE, lhs, t;
7989 gimple_seq pre = NULL;
7990 gimple post_stmt = NULL;
7991 struct gimplify_ctx gctx;
7993 push_gimplify_context (&gctx);
7994 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
7996 switch (gimple_code (stmt))
7999 gimplify_expr (gimple_cond_lhs_ptr (stmt), &pre, NULL,
8000 is_gimple_val, fb_rvalue);
8001 gimplify_expr (gimple_cond_rhs_ptr (stmt), &pre, NULL,
8002 is_gimple_val, fb_rvalue);
8005 gimplify_expr (gimple_switch_index_ptr (stmt), &pre, NULL,
8006 is_gimple_val, fb_rvalue);
8008 case GIMPLE_OMP_ATOMIC_LOAD:
8009 gimplify_expr (gimple_omp_atomic_load_rhs_ptr (stmt), &pre, NULL,
8010 is_gimple_val, fb_rvalue);
8014 size_t i, noutputs = gimple_asm_noutputs (stmt);
8015 const char *constraint, **oconstraints;
8016 bool allows_mem, allows_reg, is_inout;
8019 = (const char **) alloca ((noutputs) * sizeof (const char *));
8020 for (i = 0; i < noutputs; i++)
8022 tree op = gimple_asm_output_op (stmt, i);
8023 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
8024 oconstraints[i] = constraint;
8025 parse_output_constraint (&constraint, i, 0, 0, &allows_mem,
8026 &allows_reg, &is_inout);
8027 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
8028 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
8029 fb_lvalue | fb_mayfail);
8031 for (i = 0; i < gimple_asm_ninputs (stmt); i++)
8033 tree op = gimple_asm_input_op (stmt, i);
8034 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
8035 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
8036 oconstraints, &allows_mem, &allows_reg);
8037 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (op))) && allows_mem)
8039 if (!allows_reg && allows_mem)
8040 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
8041 is_gimple_lvalue, fb_lvalue | fb_mayfail);
8043 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
8044 is_gimple_asm_val, fb_rvalue);
8049 /* NOTE: We start gimplifying operands from last to first to
8050 make sure that side-effects on the RHS of calls, assignments
8051 and ASMs are executed before the LHS. The ordering is not
8052 important for other statements. */
8053 num_ops = gimple_num_ops (stmt);
8054 orig_lhs = gimple_get_lhs (stmt);
8055 for (i = num_ops; i > 0; i--)
8057 tree op = gimple_op (stmt, i - 1);
8058 if (op == NULL_TREE)
8060 if (i == 1 && (is_gimple_call (stmt) || is_gimple_assign (stmt)))
8061 gimplify_expr (&op, &pre, NULL, is_gimple_lvalue, fb_lvalue);
8063 && is_gimple_assign (stmt)
8065 && get_gimple_rhs_class (gimple_expr_code (stmt))
8066 == GIMPLE_SINGLE_RHS)
8067 gimplify_expr (&op, &pre, NULL,
8068 rhs_predicate_for (gimple_assign_lhs (stmt)),
8070 else if (i == 2 && is_gimple_call (stmt))
8072 if (TREE_CODE (op) == FUNCTION_DECL)
8074 gimplify_expr (&op, &pre, NULL, is_gimple_call_addr, fb_rvalue);
8077 gimplify_expr (&op, &pre, NULL, is_gimple_val, fb_rvalue);
8078 gimple_set_op (stmt, i - 1, op);
8081 lhs = gimple_get_lhs (stmt);
8082 /* If the LHS changed it in a way that requires a simple RHS,
8083 create temporary. */
8084 if (lhs && !is_gimple_reg (lhs))
8086 bool need_temp = false;
8088 if (is_gimple_assign (stmt)
8090 && get_gimple_rhs_class (gimple_expr_code (stmt))
8091 == GIMPLE_SINGLE_RHS)
8092 gimplify_expr (gimple_assign_rhs1_ptr (stmt), &pre, NULL,
8093 rhs_predicate_for (gimple_assign_lhs (stmt)),
8095 else if (is_gimple_reg (lhs))
8097 if (is_gimple_reg_type (TREE_TYPE (lhs)))
8099 if (is_gimple_call (stmt))
8101 i = gimple_call_flags (stmt);
8102 if ((i & ECF_LOOPING_CONST_OR_PURE)
8103 || !(i & (ECF_CONST | ECF_PURE)))
8106 if (stmt_can_throw_internal (stmt))
8112 if (is_gimple_reg_type (TREE_TYPE (lhs)))
8114 else if (TYPE_MODE (TREE_TYPE (lhs)) != BLKmode)
8116 if (is_gimple_call (stmt))
8118 tree fndecl = gimple_call_fndecl (stmt);
8120 if (!aggregate_value_p (TREE_TYPE (lhs), fndecl)
8121 && !(fndecl && DECL_RESULT (fndecl)
8122 && DECL_BY_REFERENCE (DECL_RESULT (fndecl))))
8131 tree temp = create_tmp_reg (TREE_TYPE (lhs), NULL);
8133 if (TREE_CODE (orig_lhs) == SSA_NAME)
8134 orig_lhs = SSA_NAME_VAR (orig_lhs);
8136 if (gimple_in_ssa_p (cfun))
8137 temp = make_ssa_name (temp, NULL);
8138 gimple_set_lhs (stmt, temp);
8139 post_stmt = gimple_build_assign (lhs, temp);
8140 if (TREE_CODE (lhs) == SSA_NAME)
8141 SSA_NAME_DEF_STMT (lhs) = post_stmt;
8147 if (gimple_referenced_vars (cfun))
8148 for (t = gimplify_ctxp->temps; t ; t = TREE_CHAIN (t))
8149 add_referenced_var (t);
8151 if (!gimple_seq_empty_p (pre))
8153 if (gimple_in_ssa_p (cfun))
8155 gimple_stmt_iterator i;
8157 for (i = gsi_start (pre); !gsi_end_p (i); gsi_next (&i))
8158 mark_symbols_for_renaming (gsi_stmt (i));
8160 gsi_insert_seq_before (gsi_p, pre, GSI_SAME_STMT);
8163 gsi_insert_after (gsi_p, post_stmt, GSI_NEW_STMT);
8165 pop_gimplify_context (NULL);
8168 /* Expand EXPR to list of gimple statements STMTS. GIMPLE_TEST_F specifies
8169 the predicate that will hold for the result. If VAR is not NULL, make the
8170 base variable of the final destination be VAR if suitable. */
8173 force_gimple_operand_1 (tree expr, gimple_seq *stmts,
8174 gimple_predicate gimple_test_f, tree var)
8177 enum gimplify_status ret;
8178 struct gimplify_ctx gctx;
8182 /* gimple_test_f might be more strict than is_gimple_val, make
8183 sure we pass both. Just checking gimple_test_f doesn't work
8184 because most gimple predicates do not work recursively. */
8185 if (is_gimple_val (expr)
8186 && (*gimple_test_f) (expr))
8189 push_gimplify_context (&gctx);
8190 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
8191 gimplify_ctxp->allow_rhs_cond_expr = true;
8194 expr = build2 (MODIFY_EXPR, TREE_TYPE (var), var, expr);
8196 if (TREE_CODE (expr) != MODIFY_EXPR
8197 && TREE_TYPE (expr) == void_type_node)
8199 gimplify_and_add (expr, stmts);
8204 ret = gimplify_expr (&expr, stmts, NULL, gimple_test_f, fb_rvalue);
8205 gcc_assert (ret != GS_ERROR);
8208 if (gimple_referenced_vars (cfun))
8209 for (t = gimplify_ctxp->temps; t ; t = DECL_CHAIN (t))
8210 add_referenced_var (t);
8212 pop_gimplify_context (NULL);
8217 /* Expand EXPR to list of gimple statements STMTS. If SIMPLE is true,
8218 force the result to be either ssa_name or an invariant, otherwise
8219 just force it to be a rhs expression. If VAR is not NULL, make the
8220 base variable of the final destination be VAR if suitable. */
8223 force_gimple_operand (tree expr, gimple_seq *stmts, bool simple, tree var)
8225 return force_gimple_operand_1 (expr, stmts,
8226 simple ? is_gimple_val : is_gimple_reg_rhs,
8230 /* Invoke force_gimple_operand_1 for EXPR with parameters GIMPLE_TEST_F
8231 and VAR. If some statements are produced, emits them at GSI.
8232 If BEFORE is true. the statements are appended before GSI, otherwise
8233 they are appended after it. M specifies the way GSI moves after
8234 insertion (GSI_SAME_STMT or GSI_CONTINUE_LINKING are the usual values). */
8237 force_gimple_operand_gsi_1 (gimple_stmt_iterator *gsi, tree expr,
8238 gimple_predicate gimple_test_f,
8239 tree var, bool before,
8240 enum gsi_iterator_update m)
8244 expr = force_gimple_operand_1 (expr, &stmts, gimple_test_f, var);
8246 if (!gimple_seq_empty_p (stmts))
8248 if (gimple_in_ssa_p (cfun))
8250 gimple_stmt_iterator i;
8252 for (i = gsi_start (stmts); !gsi_end_p (i); gsi_next (&i))
8253 mark_symbols_for_renaming (gsi_stmt (i));
8257 gsi_insert_seq_before (gsi, stmts, m);
8259 gsi_insert_seq_after (gsi, stmts, m);
8265 /* Invoke force_gimple_operand_1 for EXPR with parameter VAR.
8266 If SIMPLE is true, force the result to be either ssa_name or an invariant,
8267 otherwise just force it to be a rhs expression. If some statements are
8268 produced, emits them at GSI. If BEFORE is true, the statements are
8269 appended before GSI, otherwise they are appended after it. M specifies
8270 the way GSI moves after insertion (GSI_SAME_STMT or GSI_CONTINUE_LINKING
8271 are the usual values). */
8274 force_gimple_operand_gsi (gimple_stmt_iterator *gsi, tree expr,
8275 bool simple_p, tree var, bool before,
8276 enum gsi_iterator_update m)
8278 return force_gimple_operand_gsi_1 (gsi, expr,
8280 ? is_gimple_val : is_gimple_reg_rhs,
8285 #include "gt-gimplify.h"