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));
416 clean_symbol_name (preftmp);
421 ASM_FORMAT_PRIVATE_NAME (tmp_name, prefix ? prefix : "T", tmp_var_id_num++);
422 return get_identifier (tmp_name);
425 /* Create a new temporary variable declaration of type TYPE.
426 Do NOT push it into the current binding. */
429 create_tmp_var_raw (tree type, const char *prefix)
433 tmp_var = build_decl (input_location,
434 VAR_DECL, prefix ? create_tmp_var_name (prefix) : NULL,
437 /* The variable was declared by the compiler. */
438 DECL_ARTIFICIAL (tmp_var) = 1;
439 /* And we don't want debug info for it. */
440 DECL_IGNORED_P (tmp_var) = 1;
442 /* Make the variable writable. */
443 TREE_READONLY (tmp_var) = 0;
445 DECL_EXTERNAL (tmp_var) = 0;
446 TREE_STATIC (tmp_var) = 0;
447 TREE_USED (tmp_var) = 1;
452 /* Create a new temporary variable declaration of type TYPE. DO push the
453 variable into the current binding. Further, assume that this is called
454 only from gimplification or optimization, at which point the creation of
455 certain types are bugs. */
458 create_tmp_var (tree type, const char *prefix)
462 /* We don't allow types that are addressable (meaning we can't make copies),
463 or incomplete. We also used to reject every variable size objects here,
464 but now support those for which a constant upper bound can be obtained.
465 The processing for variable sizes is performed in gimple_add_tmp_var,
466 point at which it really matters and possibly reached via paths not going
467 through this function, e.g. after direct calls to create_tmp_var_raw. */
468 gcc_assert (!TREE_ADDRESSABLE (type) && COMPLETE_TYPE_P (type));
470 tmp_var = create_tmp_var_raw (type, prefix);
471 gimple_add_tmp_var (tmp_var);
475 /* Create a new temporary variable declaration of type TYPE by calling
476 create_tmp_var and if TYPE is a vector or a complex number, mark the new
477 temporary as gimple register. */
480 create_tmp_reg (tree type, const char *prefix)
484 tmp = create_tmp_var (type, prefix);
485 if (TREE_CODE (type) == COMPLEX_TYPE
486 || TREE_CODE (type) == VECTOR_TYPE)
487 DECL_GIMPLE_REG_P (tmp) = 1;
492 /* Create a temporary with a name derived from VAL. Subroutine of
493 lookup_tmp_var; nobody else should call this function. */
496 create_tmp_from_val (tree val)
498 return create_tmp_var (TREE_TYPE (val), get_name (val));
501 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
502 an existing expression temporary. */
505 lookup_tmp_var (tree val, bool is_formal)
509 /* If not optimizing, never really reuse a temporary. local-alloc
510 won't allocate any variable that is used in more than one basic
511 block, which means it will go into memory, causing much extra
512 work in reload and final and poorer code generation, outweighing
513 the extra memory allocation here. */
514 if (!optimize || !is_formal || TREE_SIDE_EFFECTS (val))
515 ret = create_tmp_from_val (val);
522 if (gimplify_ctxp->temp_htab == NULL)
523 gimplify_ctxp->temp_htab
524 = htab_create (1000, gimple_tree_hash, gimple_tree_eq, free);
525 slot = htab_find_slot (gimplify_ctxp->temp_htab, (void *)&elt, INSERT);
528 elt_p = XNEW (elt_t);
530 elt_p->temp = ret = create_tmp_from_val (val);
531 *slot = (void *) elt_p;
535 elt_p = (elt_t *) *slot;
543 /* Return true if T is a CALL_EXPR or an expression that can be
544 assigned to a temporary. Note that this predicate should only be
545 used during gimplification. See the rationale for this in
546 gimplify_modify_expr. */
549 is_gimple_reg_rhs_or_call (tree t)
551 return (get_gimple_rhs_class (TREE_CODE (t)) != GIMPLE_INVALID_RHS
552 || TREE_CODE (t) == CALL_EXPR);
555 /* Return true if T is a valid memory RHS or a CALL_EXPR. Note that
556 this predicate should only be used during gimplification. See the
557 rationale for this in gimplify_modify_expr. */
560 is_gimple_mem_rhs_or_call (tree t)
562 /* If we're dealing with a renamable type, either source or dest must be
563 a renamed variable. */
564 if (is_gimple_reg_type (TREE_TYPE (t)))
565 return is_gimple_val (t);
567 return (is_gimple_val (t) || is_gimple_lvalue (t)
568 || TREE_CODE (t) == CALL_EXPR);
571 /* Helper for get_formal_tmp_var and get_initialized_tmp_var. */
574 internal_get_tmp_var (tree val, gimple_seq *pre_p, gimple_seq *post_p,
579 /* Notice that we explicitly allow VAL to be a CALL_EXPR so that we
580 can create an INIT_EXPR and convert it into a GIMPLE_CALL below. */
581 gimplify_expr (&val, pre_p, post_p, is_gimple_reg_rhs_or_call,
584 t = lookup_tmp_var (val, is_formal);
587 && (TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
588 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE))
589 DECL_GIMPLE_REG_P (t) = 1;
591 mod = build2 (INIT_EXPR, TREE_TYPE (t), t, unshare_expr (val));
593 SET_EXPR_LOCATION (mod, EXPR_LOC_OR_HERE (val));
595 /* gimplify_modify_expr might want to reduce this further. */
596 gimplify_and_add (mod, pre_p);
599 /* If we're gimplifying into ssa, gimplify_modify_expr will have
600 given our temporary an SSA name. Find and return it. */
601 if (gimplify_ctxp->into_ssa)
603 gimple last = gimple_seq_last_stmt (*pre_p);
604 t = gimple_get_lhs (last);
610 /* Return a formal temporary variable initialized with VAL. PRE_P is as
611 in gimplify_expr. Only use this function if:
613 1) The value of the unfactored expression represented by VAL will not
614 change between the initialization and use of the temporary, and
615 2) The temporary will not be otherwise modified.
617 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
618 and #2 means it is inappropriate for && temps.
620 For other cases, use get_initialized_tmp_var instead. */
623 get_formal_tmp_var (tree val, gimple_seq *pre_p)
625 return internal_get_tmp_var (val, pre_p, NULL, true);
628 /* Return a temporary variable initialized with VAL. PRE_P and POST_P
629 are as in gimplify_expr. */
632 get_initialized_tmp_var (tree val, gimple_seq *pre_p, gimple_seq *post_p)
634 return internal_get_tmp_var (val, pre_p, post_p, false);
637 /* Declare all the variables in VARS in SCOPE. If DEBUG_INFO is true,
638 generate debug info for them; otherwise don't. */
641 declare_vars (tree vars, gimple scope, bool debug_info)
648 gcc_assert (gimple_code (scope) == GIMPLE_BIND);
650 temps = nreverse (last);
652 block = gimple_bind_block (scope);
653 gcc_assert (!block || TREE_CODE (block) == BLOCK);
654 if (!block || !debug_info)
656 DECL_CHAIN (last) = gimple_bind_vars (scope);
657 gimple_bind_set_vars (scope, temps);
661 /* We need to attach the nodes both to the BIND_EXPR and to its
662 associated BLOCK for debugging purposes. The key point here
663 is that the BLOCK_VARS of the BIND_EXPR_BLOCK of a BIND_EXPR
664 is a subchain of the BIND_EXPR_VARS of the BIND_EXPR. */
665 if (BLOCK_VARS (block))
666 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), temps);
669 gimple_bind_set_vars (scope,
670 chainon (gimple_bind_vars (scope), temps));
671 BLOCK_VARS (block) = temps;
677 /* For VAR a VAR_DECL of variable size, try to find a constant upper bound
678 for the size and adjust DECL_SIZE/DECL_SIZE_UNIT accordingly. Abort if
679 no such upper bound can be obtained. */
682 force_constant_size (tree var)
684 /* The only attempt we make is by querying the maximum size of objects
685 of the variable's type. */
687 HOST_WIDE_INT max_size;
689 gcc_assert (TREE_CODE (var) == VAR_DECL);
691 max_size = max_int_size_in_bytes (TREE_TYPE (var));
693 gcc_assert (max_size >= 0);
696 = build_int_cst (TREE_TYPE (DECL_SIZE_UNIT (var)), max_size);
698 = build_int_cst (TREE_TYPE (DECL_SIZE (var)), max_size * BITS_PER_UNIT);
701 /* Push the temporary variable TMP into the current binding. */
704 gimple_add_tmp_var (tree tmp)
706 gcc_assert (!DECL_CHAIN (tmp) && !DECL_SEEN_IN_BIND_EXPR_P (tmp));
708 /* Later processing assumes that the object size is constant, which might
709 not be true at this point. Force the use of a constant upper bound in
711 if (!host_integerp (DECL_SIZE_UNIT (tmp), 1))
712 force_constant_size (tmp);
714 DECL_CONTEXT (tmp) = current_function_decl;
715 DECL_SEEN_IN_BIND_EXPR_P (tmp) = 1;
719 DECL_CHAIN (tmp) = gimplify_ctxp->temps;
720 gimplify_ctxp->temps = tmp;
722 /* Mark temporaries local within the nearest enclosing parallel. */
723 if (gimplify_omp_ctxp)
725 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
726 while (ctx && ctx->region_type == ORT_WORKSHARE)
727 ctx = ctx->outer_context;
729 omp_add_variable (ctx, tmp, GOVD_LOCAL | GOVD_SEEN);
738 /* This case is for nested functions. We need to expose the locals
740 body_seq = gimple_body (current_function_decl);
741 declare_vars (tmp, gimple_seq_first_stmt (body_seq), false);
745 /* Determine whether to assign a location to the statement GS. */
748 should_carry_location_p (gimple gs)
750 /* Don't emit a line note for a label. We particularly don't want to
751 emit one for the break label, since it doesn't actually correspond
752 to the beginning of the loop/switch. */
753 if (gimple_code (gs) == GIMPLE_LABEL)
759 /* Return true if a location should not be emitted for this statement
760 by annotate_one_with_location. */
763 gimple_do_not_emit_location_p (gimple g)
765 return gimple_plf (g, GF_PLF_1);
768 /* Mark statement G so a location will not be emitted by
769 annotate_one_with_location. */
772 gimple_set_do_not_emit_location (gimple g)
774 /* The PLF flags are initialized to 0 when a new tuple is created,
775 so no need to initialize it anywhere. */
776 gimple_set_plf (g, GF_PLF_1, true);
779 /* Set the location for gimple statement GS to LOCATION. */
782 annotate_one_with_location (gimple gs, location_t location)
784 if (!gimple_has_location (gs)
785 && !gimple_do_not_emit_location_p (gs)
786 && should_carry_location_p (gs))
787 gimple_set_location (gs, location);
790 /* Set LOCATION for all the statements after iterator GSI in sequence
791 SEQ. If GSI is pointing to the end of the sequence, start with the
792 first statement in SEQ. */
795 annotate_all_with_location_after (gimple_seq seq, gimple_stmt_iterator gsi,
799 gsi = gsi_start (seq);
803 for (; !gsi_end_p (gsi); gsi_next (&gsi))
804 annotate_one_with_location (gsi_stmt (gsi), location);
807 /* Set the location for all the statements in a sequence STMT_P to LOCATION. */
810 annotate_all_with_location (gimple_seq stmt_p, location_t location)
812 gimple_stmt_iterator i;
814 if (gimple_seq_empty_p (stmt_p))
817 for (i = gsi_start (stmt_p); !gsi_end_p (i); gsi_next (&i))
819 gimple gs = gsi_stmt (i);
820 annotate_one_with_location (gs, location);
824 /* This page contains routines to unshare tree nodes, i.e. to duplicate tree
825 nodes that are referenced more than once in GENERIC functions. This is
826 necessary because gimplification (translation into GIMPLE) is performed
827 by modifying tree nodes in-place, so gimplication of a shared node in a
828 first context could generate an invalid GIMPLE form in a second context.
830 This is achieved with a simple mark/copy/unmark algorithm that walks the
831 GENERIC representation top-down, marks nodes with TREE_VISITED the first
832 time it encounters them, duplicates them if they already have TREE_VISITED
833 set, and finally removes the TREE_VISITED marks it has set.
835 The algorithm works only at the function level, i.e. it generates a GENERIC
836 representation of a function with no nodes shared within the function when
837 passed a GENERIC function (except for nodes that are allowed to be shared).
839 At the global level, it is also necessary to unshare tree nodes that are
840 referenced in more than one function, for the same aforementioned reason.
841 This requires some cooperation from the front-end. There are 2 strategies:
843 1. Manual unsharing. The front-end needs to call unshare_expr on every
844 expression that might end up being shared across functions.
846 2. Deep unsharing. This is an extension of regular unsharing. Instead
847 of calling unshare_expr on expressions that might be shared across
848 functions, the front-end pre-marks them with TREE_VISITED. This will
849 ensure that they are unshared on the first reference within functions
850 when the regular unsharing algorithm runs. The counterpart is that
851 this algorithm must look deeper than for manual unsharing, which is
852 specified by LANG_HOOKS_DEEP_UNSHARING.
854 If there are only few specific cases of node sharing across functions, it is
855 probably easier for a front-end to unshare the expressions manually. On the
856 contrary, if the expressions generated at the global level are as widespread
857 as expressions generated within functions, deep unsharing is very likely the
860 /* Similar to copy_tree_r but do not copy SAVE_EXPR or TARGET_EXPR nodes.
861 These nodes model computations that should only be done once. If we
862 were to unshare something like SAVE_EXPR(i++), the gimplification
863 process would create wrong code. */
866 mostly_copy_tree_r (tree *tp, int *walk_subtrees, void *data)
869 enum tree_code code = TREE_CODE (t);
871 /* Do not copy SAVE_EXPR, TARGET_EXPR or BIND_EXPR nodes themselves, but
872 copy their subtrees if we can make sure to do it only once. */
873 if (code == SAVE_EXPR || code == TARGET_EXPR || code == BIND_EXPR)
875 if (data && !pointer_set_insert ((struct pointer_set_t *)data, t))
881 /* Stop at types, decls, constants like copy_tree_r. */
882 else if (TREE_CODE_CLASS (code) == tcc_type
883 || TREE_CODE_CLASS (code) == tcc_declaration
884 || TREE_CODE_CLASS (code) == tcc_constant
885 /* We can't do anything sensible with a BLOCK used as an
886 expression, but we also can't just die when we see it
887 because of non-expression uses. So we avert our eyes
888 and cross our fingers. Silly Java. */
892 /* Cope with the statement expression extension. */
893 else if (code == STATEMENT_LIST)
896 /* Leave the bulk of the work to copy_tree_r itself. */
898 copy_tree_r (tp, walk_subtrees, NULL);
903 /* Callback for walk_tree to unshare most of the shared trees rooted at
904 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
905 then *TP is deep copied by calling mostly_copy_tree_r. */
908 copy_if_shared_r (tree *tp, int *walk_subtrees, void *data)
911 enum tree_code code = TREE_CODE (t);
913 /* Skip types, decls, and constants. But we do want to look at their
914 types and the bounds of types. Mark them as visited so we properly
915 unmark their subtrees on the unmark pass. If we've already seen them,
916 don't look down further. */
917 if (TREE_CODE_CLASS (code) == tcc_type
918 || TREE_CODE_CLASS (code) == tcc_declaration
919 || TREE_CODE_CLASS (code) == tcc_constant)
921 if (TREE_VISITED (t))
924 TREE_VISITED (t) = 1;
927 /* If this node has been visited already, unshare it and don't look
929 else if (TREE_VISITED (t))
931 walk_tree (tp, mostly_copy_tree_r, data, NULL);
935 /* Otherwise, mark the node as visited and keep looking. */
937 TREE_VISITED (t) = 1;
942 /* Unshare most of the shared trees rooted at *TP. */
945 copy_if_shared (tree *tp)
947 /* If the language requires deep unsharing, we need a pointer set to make
948 sure we don't repeatedly unshare subtrees of unshareable nodes. */
949 struct pointer_set_t *visited
950 = lang_hooks.deep_unsharing ? pointer_set_create () : NULL;
951 walk_tree (tp, copy_if_shared_r, visited, NULL);
953 pointer_set_destroy (visited);
956 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
957 bodies of any nested functions if we are unsharing the entire body of
961 unshare_body (tree *body_p, tree fndecl)
963 struct cgraph_node *cgn = cgraph_get_node (fndecl);
965 copy_if_shared (body_p);
967 if (cgn && body_p == &DECL_SAVED_TREE (fndecl))
968 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
969 unshare_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
972 /* Callback for walk_tree to unmark the visited trees rooted at *TP.
973 Subtrees are walked until the first unvisited node is encountered. */
976 unmark_visited_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
980 /* If this node has been visited, unmark it and keep looking. */
981 if (TREE_VISITED (t))
982 TREE_VISITED (t) = 0;
984 /* Otherwise, don't look any deeper. */
991 /* Unmark the visited trees rooted at *TP. */
994 unmark_visited (tree *tp)
996 walk_tree (tp, unmark_visited_r, NULL, NULL);
999 /* Likewise, but mark all trees as not visited. */
1002 unvisit_body (tree *body_p, tree fndecl)
1004 struct cgraph_node *cgn = cgraph_get_node (fndecl);
1006 unmark_visited (body_p);
1008 if (cgn && body_p == &DECL_SAVED_TREE (fndecl))
1009 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
1010 unvisit_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
1013 /* Unconditionally make an unshared copy of EXPR. This is used when using
1014 stored expressions which span multiple functions, such as BINFO_VTABLE,
1015 as the normal unsharing process can't tell that they're shared. */
1018 unshare_expr (tree expr)
1020 walk_tree (&expr, mostly_copy_tree_r, NULL, NULL);
1024 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
1025 contain statements and have a value. Assign its value to a temporary
1026 and give it void_type_node. Return the temporary, or NULL_TREE if
1027 WRAPPER was already void. */
1030 voidify_wrapper_expr (tree wrapper, tree temp)
1032 tree type = TREE_TYPE (wrapper);
1033 if (type && !VOID_TYPE_P (type))
1037 /* Set p to point to the body of the wrapper. Loop until we find
1038 something that isn't a wrapper. */
1039 for (p = &wrapper; p && *p; )
1041 switch (TREE_CODE (*p))
1044 TREE_SIDE_EFFECTS (*p) = 1;
1045 TREE_TYPE (*p) = void_type_node;
1046 /* For a BIND_EXPR, the body is operand 1. */
1047 p = &BIND_EXPR_BODY (*p);
1050 case CLEANUP_POINT_EXPR:
1051 case TRY_FINALLY_EXPR:
1052 case TRY_CATCH_EXPR:
1053 TREE_SIDE_EFFECTS (*p) = 1;
1054 TREE_TYPE (*p) = void_type_node;
1055 p = &TREE_OPERAND (*p, 0);
1058 case STATEMENT_LIST:
1060 tree_stmt_iterator i = tsi_last (*p);
1061 TREE_SIDE_EFFECTS (*p) = 1;
1062 TREE_TYPE (*p) = void_type_node;
1063 p = tsi_end_p (i) ? NULL : tsi_stmt_ptr (i);
1068 /* Advance to the last statement. Set all container types to
1070 for (; TREE_CODE (*p) == COMPOUND_EXPR; p = &TREE_OPERAND (*p, 1))
1072 TREE_SIDE_EFFECTS (*p) = 1;
1073 TREE_TYPE (*p) = void_type_node;
1077 case TRANSACTION_EXPR:
1078 TREE_SIDE_EFFECTS (*p) = 1;
1079 TREE_TYPE (*p) = void_type_node;
1080 p = &TRANSACTION_EXPR_BODY (*p);
1089 if (p == NULL || IS_EMPTY_STMT (*p))
1093 /* The wrapper is on the RHS of an assignment that we're pushing
1095 gcc_assert (TREE_CODE (temp) == INIT_EXPR
1096 || TREE_CODE (temp) == MODIFY_EXPR);
1097 TREE_OPERAND (temp, 1) = *p;
1102 temp = create_tmp_var (type, "retval");
1103 *p = build2 (INIT_EXPR, type, temp, *p);
1112 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
1113 a temporary through which they communicate. */
1116 build_stack_save_restore (gimple *save, gimple *restore)
1120 *save = gimple_build_call (builtin_decl_implicit (BUILT_IN_STACK_SAVE), 0);
1121 tmp_var = create_tmp_var (ptr_type_node, "saved_stack");
1122 gimple_call_set_lhs (*save, tmp_var);
1125 = gimple_build_call (builtin_decl_implicit (BUILT_IN_STACK_RESTORE),
1129 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
1131 static enum gimplify_status
1132 gimplify_bind_expr (tree *expr_p, gimple_seq *pre_p)
1134 tree bind_expr = *expr_p;
1135 bool old_save_stack = gimplify_ctxp->save_stack;
1138 gimple_seq body, cleanup;
1141 tree temp = voidify_wrapper_expr (bind_expr, NULL);
1143 /* Mark variables seen in this bind expr. */
1144 for (t = BIND_EXPR_VARS (bind_expr); t ; t = DECL_CHAIN (t))
1146 if (TREE_CODE (t) == VAR_DECL)
1148 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
1150 /* Mark variable as local. */
1151 if (ctx && !DECL_EXTERNAL (t)
1152 && (! DECL_SEEN_IN_BIND_EXPR_P (t)
1153 || splay_tree_lookup (ctx->variables,
1154 (splay_tree_key) t) == NULL))
1155 omp_add_variable (gimplify_omp_ctxp, t, GOVD_LOCAL | GOVD_SEEN);
1157 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
1159 if (DECL_HARD_REGISTER (t) && !is_global_var (t) && cfun)
1160 cfun->has_local_explicit_reg_vars = true;
1163 /* Preliminarily mark non-addressed complex variables as eligible
1164 for promotion to gimple registers. We'll transform their uses
1166 if ((TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
1167 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
1168 && !TREE_THIS_VOLATILE (t)
1169 && (TREE_CODE (t) == VAR_DECL && !DECL_HARD_REGISTER (t))
1170 && !needs_to_live_in_memory (t))
1171 DECL_GIMPLE_REG_P (t) = 1;
1174 gimple_bind = gimple_build_bind (BIND_EXPR_VARS (bind_expr), NULL,
1175 BIND_EXPR_BLOCK (bind_expr));
1176 gimple_push_bind_expr (gimple_bind);
1178 gimplify_ctxp->save_stack = false;
1180 /* Gimplify the body into the GIMPLE_BIND tuple's body. */
1182 gimplify_stmt (&BIND_EXPR_BODY (bind_expr), &body);
1183 gimple_bind_set_body (gimple_bind, body);
1187 if (gimplify_ctxp->save_stack)
1189 gimple stack_restore;
1191 /* Save stack on entry and restore it on exit. Add a try_finally
1192 block to achieve this. Note that mudflap depends on the
1193 format of the emitted code: see mx_register_decls(). */
1194 build_stack_save_restore (&stack_save, &stack_restore);
1196 gimplify_seq_add_stmt (&cleanup, stack_restore);
1199 /* Add clobbers for all variables that go out of scope. */
1200 for (t = BIND_EXPR_VARS (bind_expr); t ; t = DECL_CHAIN (t))
1202 if (TREE_CODE (t) == VAR_DECL
1203 && !is_global_var (t)
1204 && DECL_CONTEXT (t) == current_function_decl
1205 && !DECL_HARD_REGISTER (t)
1206 && !TREE_THIS_VOLATILE (t)
1207 && !DECL_HAS_VALUE_EXPR_P (t)
1208 /* Only care for variables that have to be in memory. Others
1209 will be rewritten into SSA names, hence moved to the top-level. */
1210 && needs_to_live_in_memory (t))
1212 tree clobber = build_constructor (TREE_TYPE (t), NULL);
1213 TREE_THIS_VOLATILE (clobber) = 1;
1214 gimplify_seq_add_stmt (&cleanup, gimple_build_assign (t, clobber));
1221 gimple_seq new_body;
1224 gs = gimple_build_try (gimple_bind_body (gimple_bind), cleanup,
1225 GIMPLE_TRY_FINALLY);
1228 gimplify_seq_add_stmt (&new_body, stack_save);
1229 gimplify_seq_add_stmt (&new_body, gs);
1230 gimple_bind_set_body (gimple_bind, new_body);
1233 gimplify_ctxp->save_stack = old_save_stack;
1234 gimple_pop_bind_expr ();
1236 gimplify_seq_add_stmt (pre_p, gimple_bind);
1244 *expr_p = NULL_TREE;
1248 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1249 GIMPLE value, it is assigned to a new temporary and the statement is
1250 re-written to return the temporary.
1252 PRE_P points to the sequence where side effects that must happen before
1253 STMT should be stored. */
1255 static enum gimplify_status
1256 gimplify_return_expr (tree stmt, gimple_seq *pre_p)
1259 tree ret_expr = TREE_OPERAND (stmt, 0);
1260 tree result_decl, result;
1262 if (ret_expr == error_mark_node)
1266 || TREE_CODE (ret_expr) == RESULT_DECL
1267 || ret_expr == error_mark_node)
1269 gimple ret = gimple_build_return (ret_expr);
1270 gimple_set_no_warning (ret, TREE_NO_WARNING (stmt));
1271 gimplify_seq_add_stmt (pre_p, ret);
1275 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
1276 result_decl = NULL_TREE;
1279 result_decl = TREE_OPERAND (ret_expr, 0);
1281 /* See through a return by reference. */
1282 if (TREE_CODE (result_decl) == INDIRECT_REF)
1283 result_decl = TREE_OPERAND (result_decl, 0);
1285 gcc_assert ((TREE_CODE (ret_expr) == MODIFY_EXPR
1286 || TREE_CODE (ret_expr) == INIT_EXPR)
1287 && TREE_CODE (result_decl) == RESULT_DECL);
1290 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1291 Recall that aggregate_value_p is FALSE for any aggregate type that is
1292 returned in registers. If we're returning values in registers, then
1293 we don't want to extend the lifetime of the RESULT_DECL, particularly
1294 across another call. In addition, for those aggregates for which
1295 hard_function_value generates a PARALLEL, we'll die during normal
1296 expansion of structure assignments; there's special code in expand_return
1297 to handle this case that does not exist in expand_expr. */
1300 else if (aggregate_value_p (result_decl, TREE_TYPE (current_function_decl)))
1302 if (TREE_CODE (DECL_SIZE (result_decl)) != INTEGER_CST)
1304 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (result_decl)))
1305 gimplify_type_sizes (TREE_TYPE (result_decl), pre_p);
1306 /* Note that we don't use gimplify_vla_decl because the RESULT_DECL
1307 should be effectively allocated by the caller, i.e. all calls to
1308 this function must be subject to the Return Slot Optimization. */
1309 gimplify_one_sizepos (&DECL_SIZE (result_decl), pre_p);
1310 gimplify_one_sizepos (&DECL_SIZE_UNIT (result_decl), pre_p);
1312 result = result_decl;
1314 else if (gimplify_ctxp->return_temp)
1315 result = gimplify_ctxp->return_temp;
1318 result = create_tmp_reg (TREE_TYPE (result_decl), NULL);
1320 /* ??? With complex control flow (usually involving abnormal edges),
1321 we can wind up warning about an uninitialized value for this. Due
1322 to how this variable is constructed and initialized, this is never
1323 true. Give up and never warn. */
1324 TREE_NO_WARNING (result) = 1;
1326 gimplify_ctxp->return_temp = result;
1329 /* Smash the lhs of the MODIFY_EXPR to the temporary we plan to use.
1330 Then gimplify the whole thing. */
1331 if (result != result_decl)
1332 TREE_OPERAND (ret_expr, 0) = result;
1334 gimplify_and_add (TREE_OPERAND (stmt, 0), pre_p);
1336 ret = gimple_build_return (result);
1337 gimple_set_no_warning (ret, TREE_NO_WARNING (stmt));
1338 gimplify_seq_add_stmt (pre_p, ret);
1343 /* Gimplify a variable-length array DECL. */
1346 gimplify_vla_decl (tree decl, gimple_seq *seq_p)
1348 /* This is a variable-sized decl. Simplify its size and mark it
1349 for deferred expansion. Note that mudflap depends on the format
1350 of the emitted code: see mx_register_decls(). */
1351 tree t, addr, ptr_type;
1353 gimplify_one_sizepos (&DECL_SIZE (decl), seq_p);
1354 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl), seq_p);
1356 /* All occurrences of this decl in final gimplified code will be
1357 replaced by indirection. Setting DECL_VALUE_EXPR does two
1358 things: First, it lets the rest of the gimplifier know what
1359 replacement to use. Second, it lets the debug info know
1360 where to find the value. */
1361 ptr_type = build_pointer_type (TREE_TYPE (decl));
1362 addr = create_tmp_var (ptr_type, get_name (decl));
1363 DECL_IGNORED_P (addr) = 0;
1364 t = build_fold_indirect_ref (addr);
1365 TREE_THIS_NOTRAP (t) = 1;
1366 SET_DECL_VALUE_EXPR (decl, t);
1367 DECL_HAS_VALUE_EXPR_P (decl) = 1;
1369 t = builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN);
1370 t = build_call_expr (t, 2, DECL_SIZE_UNIT (decl),
1371 size_int (DECL_ALIGN (decl)));
1372 /* The call has been built for a variable-sized object. */
1373 CALL_ALLOCA_FOR_VAR_P (t) = 1;
1374 t = fold_convert (ptr_type, t);
1375 t = build2 (MODIFY_EXPR, TREE_TYPE (addr), addr, t);
1377 gimplify_and_add (t, seq_p);
1379 /* Indicate that we need to restore the stack level when the
1380 enclosing BIND_EXPR is exited. */
1381 gimplify_ctxp->save_stack = true;
1384 /* Gimplify a DECL_EXPR node *STMT_P by making any necessary allocation
1385 and initialization explicit. */
1387 static enum gimplify_status
1388 gimplify_decl_expr (tree *stmt_p, gimple_seq *seq_p)
1390 tree stmt = *stmt_p;
1391 tree decl = DECL_EXPR_DECL (stmt);
1393 *stmt_p = NULL_TREE;
1395 if (TREE_TYPE (decl) == error_mark_node)
1398 if ((TREE_CODE (decl) == TYPE_DECL
1399 || TREE_CODE (decl) == VAR_DECL)
1400 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl)))
1401 gimplify_type_sizes (TREE_TYPE (decl), seq_p);
1403 if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl))
1405 tree init = DECL_INITIAL (decl);
1407 if (TREE_CODE (DECL_SIZE_UNIT (decl)) != INTEGER_CST
1408 || (!TREE_STATIC (decl)
1409 && flag_stack_check == GENERIC_STACK_CHECK
1410 && compare_tree_int (DECL_SIZE_UNIT (decl),
1411 STACK_CHECK_MAX_VAR_SIZE) > 0))
1412 gimplify_vla_decl (decl, seq_p);
1414 /* Some front ends do not explicitly declare all anonymous
1415 artificial variables. We compensate here by declaring the
1416 variables, though it would be better if the front ends would
1417 explicitly declare them. */
1418 if (!DECL_SEEN_IN_BIND_EXPR_P (decl)
1419 && DECL_ARTIFICIAL (decl) && DECL_NAME (decl) == NULL_TREE)
1420 gimple_add_tmp_var (decl);
1422 if (init && init != error_mark_node)
1424 if (!TREE_STATIC (decl))
1426 DECL_INITIAL (decl) = NULL_TREE;
1427 init = build2 (INIT_EXPR, void_type_node, decl, init);
1428 gimplify_and_add (init, seq_p);
1432 /* We must still examine initializers for static variables
1433 as they may contain a label address. */
1434 walk_tree (&init, force_labels_r, NULL, NULL);
1441 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1442 and replacing the LOOP_EXPR with goto, but if the loop contains an
1443 EXIT_EXPR, we need to append a label for it to jump to. */
1445 static enum gimplify_status
1446 gimplify_loop_expr (tree *expr_p, gimple_seq *pre_p)
1448 tree saved_label = gimplify_ctxp->exit_label;
1449 tree start_label = create_artificial_label (UNKNOWN_LOCATION);
1451 gimplify_seq_add_stmt (pre_p, gimple_build_label (start_label));
1453 gimplify_ctxp->exit_label = NULL_TREE;
1455 gimplify_and_add (LOOP_EXPR_BODY (*expr_p), pre_p);
1457 gimplify_seq_add_stmt (pre_p, gimple_build_goto (start_label));
1459 if (gimplify_ctxp->exit_label)
1460 gimplify_seq_add_stmt (pre_p,
1461 gimple_build_label (gimplify_ctxp->exit_label));
1463 gimplify_ctxp->exit_label = saved_label;
1469 /* Gimplify a statement list onto a sequence. These may be created either
1470 by an enlightened front-end, or by shortcut_cond_expr. */
1472 static enum gimplify_status
1473 gimplify_statement_list (tree *expr_p, gimple_seq *pre_p)
1475 tree temp = voidify_wrapper_expr (*expr_p, NULL);
1477 tree_stmt_iterator i = tsi_start (*expr_p);
1479 while (!tsi_end_p (i))
1481 gimplify_stmt (tsi_stmt_ptr (i), pre_p);
1494 /* Compare two case labels. Because the front end should already have
1495 made sure that case ranges do not overlap, it is enough to only compare
1496 the CASE_LOW values of each case label. */
1499 compare_case_labels (const void *p1, const void *p2)
1501 const_tree const case1 = *(const_tree const*)p1;
1502 const_tree const case2 = *(const_tree const*)p2;
1504 /* The 'default' case label always goes first. */
1505 if (!CASE_LOW (case1))
1507 else if (!CASE_LOW (case2))
1510 return tree_int_cst_compare (CASE_LOW (case1), CASE_LOW (case2));
1513 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1516 sort_case_labels (VEC(tree,heap)* label_vec)
1518 VEC_qsort (tree, label_vec, compare_case_labels);
1521 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1524 static enum gimplify_status
1525 gimplify_switch_expr (tree *expr_p, gimple_seq *pre_p)
1527 tree switch_expr = *expr_p;
1528 gimple_seq switch_body_seq = NULL;
1529 enum gimplify_status ret;
1531 ret = gimplify_expr (&SWITCH_COND (switch_expr), pre_p, NULL, is_gimple_val,
1533 if (ret == GS_ERROR || ret == GS_UNHANDLED)
1536 if (SWITCH_BODY (switch_expr))
1538 VEC (tree,heap) *labels;
1539 VEC (tree,heap) *saved_labels;
1540 tree default_case = NULL_TREE;
1542 gimple gimple_switch;
1544 /* If someone can be bothered to fill in the labels, they can
1545 be bothered to null out the body too. */
1546 gcc_assert (!SWITCH_LABELS (switch_expr));
1548 /* save old labels, get new ones from body, then restore the old
1549 labels. Save all the things from the switch body to append after. */
1550 saved_labels = gimplify_ctxp->case_labels;
1551 gimplify_ctxp->case_labels = VEC_alloc (tree, heap, 8);
1553 gimplify_stmt (&SWITCH_BODY (switch_expr), &switch_body_seq);
1554 labels = gimplify_ctxp->case_labels;
1555 gimplify_ctxp->case_labels = saved_labels;
1558 while (i < VEC_length (tree, labels))
1560 tree elt = VEC_index (tree, labels, i);
1561 tree low = CASE_LOW (elt);
1562 bool remove_element = FALSE;
1566 /* Discard empty ranges. */
1567 tree high = CASE_HIGH (elt);
1568 if (high && tree_int_cst_lt (high, low))
1569 remove_element = TRUE;
1573 /* The default case must be the last label in the list. */
1574 gcc_assert (!default_case);
1576 remove_element = TRUE;
1580 VEC_ordered_remove (tree, labels, i);
1586 if (!VEC_empty (tree, labels))
1587 sort_case_labels (labels);
1591 tree type = TREE_TYPE (switch_expr);
1593 /* If the switch has no default label, add one, so that we jump
1594 around the switch body. If the labels already cover the whole
1595 range of type, add the default label pointing to one of the
1597 if (type == void_type_node)
1598 type = TREE_TYPE (SWITCH_COND (switch_expr));
1600 && INTEGRAL_TYPE_P (type)
1601 && TYPE_MIN_VALUE (type)
1602 && TYPE_MAX_VALUE (type)
1603 && tree_int_cst_equal (CASE_LOW (VEC_index (tree, labels, 0)),
1604 TYPE_MIN_VALUE (type)))
1606 tree low, high = CASE_HIGH (VEC_index (tree, labels, len - 1));
1608 high = CASE_LOW (VEC_index (tree, labels, len - 1));
1609 if (tree_int_cst_equal (high, TYPE_MAX_VALUE (type)))
1611 for (i = 1; i < len; i++)
1613 high = CASE_LOW (VEC_index (tree, labels, i));
1614 low = CASE_HIGH (VEC_index (tree, labels, i - 1));
1616 low = CASE_LOW (VEC_index (tree, labels, i - 1));
1617 if ((TREE_INT_CST_LOW (low) + 1
1618 != TREE_INT_CST_LOW (high))
1619 || (TREE_INT_CST_HIGH (low)
1620 + (TREE_INT_CST_LOW (high) == 0)
1621 != TREE_INT_CST_HIGH (high)))
1626 tree label = CASE_LABEL (VEC_index (tree, labels, 0));
1627 default_case = build_case_label (NULL_TREE, NULL_TREE,
1638 = build_case_label (NULL_TREE, NULL_TREE,
1639 create_artificial_label (UNKNOWN_LOCATION));
1640 new_default = gimple_build_label (CASE_LABEL (default_case));
1641 gimplify_seq_add_stmt (&switch_body_seq, new_default);
1645 gimple_switch = gimple_build_switch_vec (SWITCH_COND (switch_expr),
1646 default_case, labels);
1647 gimplify_seq_add_stmt (pre_p, gimple_switch);
1648 gimplify_seq_add_seq (pre_p, switch_body_seq);
1649 VEC_free(tree, heap, labels);
1652 gcc_assert (SWITCH_LABELS (switch_expr));
1657 /* Gimplify the CASE_LABEL_EXPR pointed to by EXPR_P. */
1659 static enum gimplify_status
1660 gimplify_case_label_expr (tree *expr_p, gimple_seq *pre_p)
1662 struct gimplify_ctx *ctxp;
1663 gimple gimple_label;
1665 /* Invalid OpenMP programs can play Duff's Device type games with
1666 #pragma omp parallel. At least in the C front end, we don't
1667 detect such invalid branches until after gimplification. */
1668 for (ctxp = gimplify_ctxp; ; ctxp = ctxp->prev_context)
1669 if (ctxp->case_labels)
1672 gimple_label = gimple_build_label (CASE_LABEL (*expr_p));
1673 VEC_safe_push (tree, heap, ctxp->case_labels, *expr_p);
1674 gimplify_seq_add_stmt (pre_p, gimple_label);
1679 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1683 build_and_jump (tree *label_p)
1685 if (label_p == NULL)
1686 /* If there's nowhere to jump, just fall through. */
1689 if (*label_p == NULL_TREE)
1691 tree label = create_artificial_label (UNKNOWN_LOCATION);
1695 return build1 (GOTO_EXPR, void_type_node, *label_p);
1698 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1699 This also involves building a label to jump to and communicating it to
1700 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1702 static enum gimplify_status
1703 gimplify_exit_expr (tree *expr_p)
1705 tree cond = TREE_OPERAND (*expr_p, 0);
1708 expr = build_and_jump (&gimplify_ctxp->exit_label);
1709 expr = build3 (COND_EXPR, void_type_node, cond, expr, NULL_TREE);
1715 /* A helper function to be called via walk_tree. Mark all labels under *TP
1716 as being forced. To be called for DECL_INITIAL of static variables. */
1719 force_labels_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
1723 if (TREE_CODE (*tp) == LABEL_DECL)
1724 FORCED_LABEL (*tp) = 1;
1729 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1730 different from its canonical type, wrap the whole thing inside a
1731 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1734 The canonical type of a COMPONENT_REF is the type of the field being
1735 referenced--unless the field is a bit-field which can be read directly
1736 in a smaller mode, in which case the canonical type is the
1737 sign-appropriate type corresponding to that mode. */
1740 canonicalize_component_ref (tree *expr_p)
1742 tree expr = *expr_p;
1745 gcc_assert (TREE_CODE (expr) == COMPONENT_REF);
1747 if (INTEGRAL_TYPE_P (TREE_TYPE (expr)))
1748 type = TREE_TYPE (get_unwidened (expr, NULL_TREE));
1750 type = TREE_TYPE (TREE_OPERAND (expr, 1));
1752 /* One could argue that all the stuff below is not necessary for
1753 the non-bitfield case and declare it a FE error if type
1754 adjustment would be needed. */
1755 if (TREE_TYPE (expr) != type)
1757 #ifdef ENABLE_TYPES_CHECKING
1758 tree old_type = TREE_TYPE (expr);
1762 /* We need to preserve qualifiers and propagate them from
1764 type_quals = TYPE_QUALS (type)
1765 | TYPE_QUALS (TREE_TYPE (TREE_OPERAND (expr, 0)));
1766 if (TYPE_QUALS (type) != type_quals)
1767 type = build_qualified_type (TYPE_MAIN_VARIANT (type), type_quals);
1769 /* Set the type of the COMPONENT_REF to the underlying type. */
1770 TREE_TYPE (expr) = type;
1772 #ifdef ENABLE_TYPES_CHECKING
1773 /* It is now a FE error, if the conversion from the canonical
1774 type to the original expression type is not useless. */
1775 gcc_assert (useless_type_conversion_p (old_type, type));
1780 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1781 to foo, embed that change in the ADDR_EXPR by converting
1786 where L is the lower bound. For simplicity, only do this for constant
1788 The constraint is that the type of &array[L] is trivially convertible
1792 canonicalize_addr_expr (tree *expr_p)
1794 tree expr = *expr_p;
1795 tree addr_expr = TREE_OPERAND (expr, 0);
1796 tree datype, ddatype, pddatype;
1798 /* We simplify only conversions from an ADDR_EXPR to a pointer type. */
1799 if (!POINTER_TYPE_P (TREE_TYPE (expr))
1800 || TREE_CODE (addr_expr) != ADDR_EXPR)
1803 /* The addr_expr type should be a pointer to an array. */
1804 datype = TREE_TYPE (TREE_TYPE (addr_expr));
1805 if (TREE_CODE (datype) != ARRAY_TYPE)
1808 /* The pointer to element type shall be trivially convertible to
1809 the expression pointer type. */
1810 ddatype = TREE_TYPE (datype);
1811 pddatype = build_pointer_type (ddatype);
1812 if (!useless_type_conversion_p (TYPE_MAIN_VARIANT (TREE_TYPE (expr)),
1816 /* The lower bound and element sizes must be constant. */
1817 if (!TYPE_SIZE_UNIT (ddatype)
1818 || TREE_CODE (TYPE_SIZE_UNIT (ddatype)) != INTEGER_CST
1819 || !TYPE_DOMAIN (datype) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype))
1820 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype))) != INTEGER_CST)
1823 /* All checks succeeded. Build a new node to merge the cast. */
1824 *expr_p = build4 (ARRAY_REF, ddatype, TREE_OPERAND (addr_expr, 0),
1825 TYPE_MIN_VALUE (TYPE_DOMAIN (datype)),
1826 NULL_TREE, NULL_TREE);
1827 *expr_p = build1 (ADDR_EXPR, pddatype, *expr_p);
1829 /* We can have stripped a required restrict qualifier above. */
1830 if (!useless_type_conversion_p (TREE_TYPE (expr), TREE_TYPE (*expr_p)))
1831 *expr_p = fold_convert (TREE_TYPE (expr), *expr_p);
1834 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1835 underneath as appropriate. */
1837 static enum gimplify_status
1838 gimplify_conversion (tree *expr_p)
1840 location_t loc = EXPR_LOCATION (*expr_p);
1841 gcc_assert (CONVERT_EXPR_P (*expr_p));
1843 /* Then strip away all but the outermost conversion. */
1844 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p, 0));
1846 /* And remove the outermost conversion if it's useless. */
1847 if (tree_ssa_useless_type_conversion (*expr_p))
1848 *expr_p = TREE_OPERAND (*expr_p, 0);
1850 /* If we still have a conversion at the toplevel,
1851 then canonicalize some constructs. */
1852 if (CONVERT_EXPR_P (*expr_p))
1854 tree sub = TREE_OPERAND (*expr_p, 0);
1856 /* If a NOP conversion is changing the type of a COMPONENT_REF
1857 expression, then canonicalize its type now in order to expose more
1858 redundant conversions. */
1859 if (TREE_CODE (sub) == COMPONENT_REF)
1860 canonicalize_component_ref (&TREE_OPERAND (*expr_p, 0));
1862 /* If a NOP conversion is changing a pointer to array of foo
1863 to a pointer to foo, embed that change in the ADDR_EXPR. */
1864 else if (TREE_CODE (sub) == ADDR_EXPR)
1865 canonicalize_addr_expr (expr_p);
1868 /* If we have a conversion to a non-register type force the
1869 use of a VIEW_CONVERT_EXPR instead. */
1870 if (CONVERT_EXPR_P (*expr_p) && !is_gimple_reg_type (TREE_TYPE (*expr_p)))
1871 *expr_p = fold_build1_loc (loc, VIEW_CONVERT_EXPR, TREE_TYPE (*expr_p),
1872 TREE_OPERAND (*expr_p, 0));
1877 /* Nonlocal VLAs seen in the current function. */
1878 static struct pointer_set_t *nonlocal_vlas;
1880 /* Gimplify a VAR_DECL or PARM_DECL. Return GS_OK if we expanded a
1881 DECL_VALUE_EXPR, and it's worth re-examining things. */
1883 static enum gimplify_status
1884 gimplify_var_or_parm_decl (tree *expr_p)
1886 tree decl = *expr_p;
1888 /* ??? If this is a local variable, and it has not been seen in any
1889 outer BIND_EXPR, then it's probably the result of a duplicate
1890 declaration, for which we've already issued an error. It would
1891 be really nice if the front end wouldn't leak these at all.
1892 Currently the only known culprit is C++ destructors, as seen
1893 in g++.old-deja/g++.jason/binding.C. */
1894 if (TREE_CODE (decl) == VAR_DECL
1895 && !DECL_SEEN_IN_BIND_EXPR_P (decl)
1896 && !TREE_STATIC (decl) && !DECL_EXTERNAL (decl)
1897 && decl_function_context (decl) == current_function_decl)
1899 gcc_assert (seen_error ());
1903 /* When within an OpenMP context, notice uses of variables. */
1904 if (gimplify_omp_ctxp && omp_notice_variable (gimplify_omp_ctxp, decl, true))
1907 /* If the decl is an alias for another expression, substitute it now. */
1908 if (DECL_HAS_VALUE_EXPR_P (decl))
1910 tree value_expr = DECL_VALUE_EXPR (decl);
1912 /* For referenced nonlocal VLAs add a decl for debugging purposes
1913 to the current function. */
1914 if (TREE_CODE (decl) == VAR_DECL
1915 && TREE_CODE (DECL_SIZE_UNIT (decl)) != INTEGER_CST
1916 && nonlocal_vlas != NULL
1917 && TREE_CODE (value_expr) == INDIRECT_REF
1918 && TREE_CODE (TREE_OPERAND (value_expr, 0)) == VAR_DECL
1919 && decl_function_context (decl) != current_function_decl)
1921 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
1922 while (ctx && ctx->region_type == ORT_WORKSHARE)
1923 ctx = ctx->outer_context;
1924 if (!ctx && !pointer_set_insert (nonlocal_vlas, decl))
1926 tree copy = copy_node (decl), block;
1928 lang_hooks.dup_lang_specific_decl (copy);
1929 SET_DECL_RTL (copy, 0);
1930 TREE_USED (copy) = 1;
1931 block = DECL_INITIAL (current_function_decl);
1932 DECL_CHAIN (copy) = BLOCK_VARS (block);
1933 BLOCK_VARS (block) = copy;
1934 SET_DECL_VALUE_EXPR (copy, unshare_expr (value_expr));
1935 DECL_HAS_VALUE_EXPR_P (copy) = 1;
1939 *expr_p = unshare_expr (value_expr);
1946 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1950 : min_lval '[' val ']'
1952 | compound_lval '[' val ']'
1953 | compound_lval '.' ID
1955 This is not part of the original SIMPLE definition, which separates
1956 array and member references, but it seems reasonable to handle them
1957 together. Also, this way we don't run into problems with union
1958 aliasing; gcc requires that for accesses through a union to alias, the
1959 union reference must be explicit, which was not always the case when we
1960 were splitting up array and member refs.
1962 PRE_P points to the sequence where side effects that must happen before
1963 *EXPR_P should be stored.
1965 POST_P points to the sequence where side effects that must happen after
1966 *EXPR_P should be stored. */
1968 static enum gimplify_status
1969 gimplify_compound_lval (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
1970 fallback_t fallback)
1973 VEC(tree,heap) *stack;
1974 enum gimplify_status ret = GS_ALL_DONE, tret;
1976 location_t loc = EXPR_LOCATION (*expr_p);
1977 tree expr = *expr_p;
1979 /* Create a stack of the subexpressions so later we can walk them in
1980 order from inner to outer. */
1981 stack = VEC_alloc (tree, heap, 10);
1983 /* We can handle anything that get_inner_reference can deal with. */
1984 for (p = expr_p; ; p = &TREE_OPERAND (*p, 0))
1987 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1988 if (TREE_CODE (*p) == INDIRECT_REF)
1989 *p = fold_indirect_ref_loc (loc, *p);
1991 if (handled_component_p (*p))
1993 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
1994 additional COMPONENT_REFs. */
1995 else if ((TREE_CODE (*p) == VAR_DECL || TREE_CODE (*p) == PARM_DECL)
1996 && gimplify_var_or_parm_decl (p) == GS_OK)
2001 VEC_safe_push (tree, heap, stack, *p);
2004 gcc_assert (VEC_length (tree, stack));
2006 /* Now STACK is a stack of pointers to all the refs we've walked through
2007 and P points to the innermost expression.
2009 Java requires that we elaborated nodes in source order. That
2010 means we must gimplify the inner expression followed by each of
2011 the indices, in order. But we can't gimplify the inner
2012 expression until we deal with any variable bounds, sizes, or
2013 positions in order to deal with PLACEHOLDER_EXPRs.
2015 So we do this in three steps. First we deal with the annotations
2016 for any variables in the components, then we gimplify the base,
2017 then we gimplify any indices, from left to right. */
2018 for (i = VEC_length (tree, stack) - 1; i >= 0; i--)
2020 tree t = VEC_index (tree, stack, i);
2022 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
2024 /* Gimplify the low bound and element type size and put them into
2025 the ARRAY_REF. If these values are set, they have already been
2027 if (TREE_OPERAND (t, 2) == NULL_TREE)
2029 tree low = unshare_expr (array_ref_low_bound (t));
2030 if (!is_gimple_min_invariant (low))
2032 TREE_OPERAND (t, 2) = low;
2033 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p,
2034 post_p, is_gimple_reg,
2036 ret = MIN (ret, tret);
2041 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
2042 is_gimple_reg, fb_rvalue);
2043 ret = MIN (ret, tret);
2046 if (TREE_OPERAND (t, 3) == NULL_TREE)
2048 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (t, 0)));
2049 tree elmt_size = unshare_expr (array_ref_element_size (t));
2050 tree factor = size_int (TYPE_ALIGN_UNIT (elmt_type));
2052 /* Divide the element size by the alignment of the element
2055 = size_binop_loc (loc, EXACT_DIV_EXPR, elmt_size, factor);
2057 if (!is_gimple_min_invariant (elmt_size))
2059 TREE_OPERAND (t, 3) = elmt_size;
2060 tret = gimplify_expr (&TREE_OPERAND (t, 3), pre_p,
2061 post_p, is_gimple_reg,
2063 ret = MIN (ret, tret);
2068 tret = gimplify_expr (&TREE_OPERAND (t, 3), pre_p, post_p,
2069 is_gimple_reg, fb_rvalue);
2070 ret = MIN (ret, tret);
2073 else if (TREE_CODE (t) == COMPONENT_REF)
2075 /* Set the field offset into T and gimplify it. */
2076 if (TREE_OPERAND (t, 2) == NULL_TREE)
2078 tree offset = unshare_expr (component_ref_field_offset (t));
2079 tree field = TREE_OPERAND (t, 1);
2081 = size_int (DECL_OFFSET_ALIGN (field) / BITS_PER_UNIT);
2083 /* Divide the offset by its alignment. */
2084 offset = size_binop_loc (loc, EXACT_DIV_EXPR, offset, factor);
2086 if (!is_gimple_min_invariant (offset))
2088 TREE_OPERAND (t, 2) = offset;
2089 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p,
2090 post_p, is_gimple_reg,
2092 ret = MIN (ret, tret);
2097 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
2098 is_gimple_reg, fb_rvalue);
2099 ret = MIN (ret, tret);
2104 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
2105 so as to match the min_lval predicate. Failure to do so may result
2106 in the creation of large aggregate temporaries. */
2107 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval,
2108 fallback | fb_lvalue);
2109 ret = MIN (ret, tret);
2111 /* And finally, the indices and operands to BIT_FIELD_REF. During this
2112 loop we also remove any useless conversions. */
2113 for (; VEC_length (tree, stack) > 0; )
2115 tree t = VEC_pop (tree, stack);
2117 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
2119 /* Gimplify the dimension. */
2120 if (!is_gimple_min_invariant (TREE_OPERAND (t, 1)))
2122 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
2123 is_gimple_val, fb_rvalue);
2124 ret = MIN (ret, tret);
2127 else if (TREE_CODE (t) == BIT_FIELD_REF)
2129 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
2130 is_gimple_val, fb_rvalue);
2131 ret = MIN (ret, tret);
2132 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
2133 is_gimple_val, fb_rvalue);
2134 ret = MIN (ret, tret);
2137 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t, 0));
2139 /* The innermost expression P may have originally had
2140 TREE_SIDE_EFFECTS set which would have caused all the outer
2141 expressions in *EXPR_P leading to P to also have had
2142 TREE_SIDE_EFFECTS set. */
2143 recalculate_side_effects (t);
2146 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
2147 if ((fallback & fb_rvalue) && TREE_CODE (*expr_p) == COMPONENT_REF)
2149 canonicalize_component_ref (expr_p);
2152 VEC_free (tree, heap, stack);
2154 gcc_assert (*expr_p == expr || ret != GS_ALL_DONE);
2159 /* Gimplify the self modifying expression pointed to by EXPR_P
2162 PRE_P points to the list where side effects that must happen before
2163 *EXPR_P should be stored.
2165 POST_P points to the list where side effects that must happen after
2166 *EXPR_P should be stored.
2168 WANT_VALUE is nonzero iff we want to use the value of this expression
2169 in another expression. */
2171 static enum gimplify_status
2172 gimplify_self_mod_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
2175 enum tree_code code;
2176 tree lhs, lvalue, rhs, t1;
2177 gimple_seq post = NULL, *orig_post_p = post_p;
2179 enum tree_code arith_code;
2180 enum gimplify_status ret;
2181 location_t loc = EXPR_LOCATION (*expr_p);
2183 code = TREE_CODE (*expr_p);
2185 gcc_assert (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR
2186 || code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR);
2188 /* Prefix or postfix? */
2189 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
2190 /* Faster to treat as prefix if result is not used. */
2191 postfix = want_value;
2195 /* For postfix, make sure the inner expression's post side effects
2196 are executed after side effects from this expression. */
2200 /* Add or subtract? */
2201 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2202 arith_code = PLUS_EXPR;
2204 arith_code = MINUS_EXPR;
2206 /* Gimplify the LHS into a GIMPLE lvalue. */
2207 lvalue = TREE_OPERAND (*expr_p, 0);
2208 ret = gimplify_expr (&lvalue, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
2209 if (ret == GS_ERROR)
2212 /* Extract the operands to the arithmetic operation. */
2214 rhs = TREE_OPERAND (*expr_p, 1);
2216 /* For postfix operator, we evaluate the LHS to an rvalue and then use
2217 that as the result value and in the postqueue operation. We also
2218 make sure to make lvalue a minimal lval, see
2219 gcc.c-torture/execute/20040313-1.c for an example where this matters. */
2222 if (!is_gimple_min_lval (lvalue))
2224 mark_addressable (lvalue);
2225 lvalue = build_fold_addr_expr_loc (input_location, lvalue);
2226 gimplify_expr (&lvalue, pre_p, post_p, is_gimple_val, fb_rvalue);
2227 lvalue = build_fold_indirect_ref_loc (input_location, lvalue);
2229 ret = gimplify_expr (&lhs, pre_p, post_p, is_gimple_val, fb_rvalue);
2230 if (ret == GS_ERROR)
2234 /* For POINTERs increment, use POINTER_PLUS_EXPR. */
2235 if (POINTER_TYPE_P (TREE_TYPE (lhs)))
2237 rhs = convert_to_ptrofftype_loc (loc, rhs);
2238 if (arith_code == MINUS_EXPR)
2239 rhs = fold_build1_loc (loc, NEGATE_EXPR, TREE_TYPE (rhs), rhs);
2240 arith_code = POINTER_PLUS_EXPR;
2243 t1 = build2 (arith_code, TREE_TYPE (*expr_p), lhs, rhs);
2247 gimplify_assign (lvalue, t1, orig_post_p);
2248 gimplify_seq_add_seq (orig_post_p, post);
2254 *expr_p = build2 (MODIFY_EXPR, TREE_TYPE (lvalue), lvalue, t1);
2259 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
2262 maybe_with_size_expr (tree *expr_p)
2264 tree expr = *expr_p;
2265 tree type = TREE_TYPE (expr);
2268 /* If we've already wrapped this or the type is error_mark_node, we can't do
2270 if (TREE_CODE (expr) == WITH_SIZE_EXPR
2271 || type == error_mark_node)
2274 /* If the size isn't known or is a constant, we have nothing to do. */
2275 size = TYPE_SIZE_UNIT (type);
2276 if (!size || TREE_CODE (size) == INTEGER_CST)
2279 /* Otherwise, make a WITH_SIZE_EXPR. */
2280 size = unshare_expr (size);
2281 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, expr);
2282 *expr_p = build2 (WITH_SIZE_EXPR, type, expr, size);
2285 /* Helper for gimplify_call_expr. Gimplify a single argument *ARG_P
2286 Store any side-effects in PRE_P. CALL_LOCATION is the location of
2289 static enum gimplify_status
2290 gimplify_arg (tree *arg_p, gimple_seq *pre_p, location_t call_location)
2292 bool (*test) (tree);
2295 /* In general, we allow lvalues for function arguments to avoid
2296 extra overhead of copying large aggregates out of even larger
2297 aggregates into temporaries only to copy the temporaries to
2298 the argument list. Make optimizers happy by pulling out to
2299 temporaries those types that fit in registers. */
2300 if (is_gimple_reg_type (TREE_TYPE (*arg_p)))
2301 test = is_gimple_val, fb = fb_rvalue;
2304 test = is_gimple_lvalue, fb = fb_either;
2305 /* Also strip a TARGET_EXPR that would force an extra copy. */
2306 if (TREE_CODE (*arg_p) == TARGET_EXPR)
2308 tree init = TARGET_EXPR_INITIAL (*arg_p);
2310 && !VOID_TYPE_P (TREE_TYPE (init)))
2315 /* If this is a variable sized type, we must remember the size. */
2316 maybe_with_size_expr (arg_p);
2318 /* FIXME diagnostics: This will mess up gcc.dg/Warray-bounds.c. */
2319 /* Make sure arguments have the same location as the function call
2321 protected_set_expr_location (*arg_p, call_location);
2323 /* There is a sequence point before a function call. Side effects in
2324 the argument list must occur before the actual call. So, when
2325 gimplifying arguments, force gimplify_expr to use an internal
2326 post queue which is then appended to the end of PRE_P. */
2327 return gimplify_expr (arg_p, pre_p, NULL, test, fb);
2330 /* Gimplify the CALL_EXPR node *EXPR_P into the GIMPLE sequence PRE_P.
2331 WANT_VALUE is true if the result of the call is desired. */
2333 static enum gimplify_status
2334 gimplify_call_expr (tree *expr_p, gimple_seq *pre_p, bool want_value)
2336 tree fndecl, parms, p, fnptrtype;
2337 enum gimplify_status ret;
2340 bool builtin_va_start_p = FALSE;
2341 location_t loc = EXPR_LOCATION (*expr_p);
2343 gcc_assert (TREE_CODE (*expr_p) == CALL_EXPR);
2345 /* For reliable diagnostics during inlining, it is necessary that
2346 every call_expr be annotated with file and line. */
2347 if (! EXPR_HAS_LOCATION (*expr_p))
2348 SET_EXPR_LOCATION (*expr_p, input_location);
2350 /* This may be a call to a builtin function.
2352 Builtin function calls may be transformed into different
2353 (and more efficient) builtin function calls under certain
2354 circumstances. Unfortunately, gimplification can muck things
2355 up enough that the builtin expanders are not aware that certain
2356 transformations are still valid.
2358 So we attempt transformation/gimplification of the call before
2359 we gimplify the CALL_EXPR. At this time we do not manage to
2360 transform all calls in the same manner as the expanders do, but
2361 we do transform most of them. */
2362 fndecl = get_callee_fndecl (*expr_p);
2363 if (fndecl && DECL_BUILT_IN (fndecl))
2365 tree new_tree = fold_call_expr (input_location, *expr_p, !want_value);
2367 if (new_tree && new_tree != *expr_p)
2369 /* There was a transformation of this call which computes the
2370 same value, but in a more efficient way. Return and try
2376 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
2377 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_VA_START)
2379 builtin_va_start_p = TRUE;
2380 if (call_expr_nargs (*expr_p) < 2)
2382 error ("too few arguments to function %<va_start%>");
2383 *expr_p = build_empty_stmt (EXPR_LOCATION (*expr_p));
2387 if (fold_builtin_next_arg (*expr_p, true))
2389 *expr_p = build_empty_stmt (EXPR_LOCATION (*expr_p));
2395 /* Remember the original function pointer type. */
2396 fnptrtype = TREE_TYPE (CALL_EXPR_FN (*expr_p));
2398 /* There is a sequence point before the call, so any side effects in
2399 the calling expression must occur before the actual call. Force
2400 gimplify_expr to use an internal post queue. */
2401 ret = gimplify_expr (&CALL_EXPR_FN (*expr_p), pre_p, NULL,
2402 is_gimple_call_addr, fb_rvalue);
2404 nargs = call_expr_nargs (*expr_p);
2406 /* Get argument types for verification. */
2407 fndecl = get_callee_fndecl (*expr_p);
2410 parms = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
2411 else if (POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_FN (*expr_p))))
2412 parms = TYPE_ARG_TYPES (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (*expr_p))));
2414 if (fndecl && DECL_ARGUMENTS (fndecl))
2415 p = DECL_ARGUMENTS (fndecl);
2420 for (i = 0; i < nargs && p; i++, p = TREE_CHAIN (p))
2423 /* If the last argument is __builtin_va_arg_pack () and it is not
2424 passed as a named argument, decrease the number of CALL_EXPR
2425 arguments and set instead the CALL_EXPR_VA_ARG_PACK flag. */
2428 && TREE_CODE (CALL_EXPR_ARG (*expr_p, nargs - 1)) == CALL_EXPR)
2430 tree last_arg = CALL_EXPR_ARG (*expr_p, nargs - 1);
2431 tree last_arg_fndecl = get_callee_fndecl (last_arg);
2434 && TREE_CODE (last_arg_fndecl) == FUNCTION_DECL
2435 && DECL_BUILT_IN_CLASS (last_arg_fndecl) == BUILT_IN_NORMAL
2436 && DECL_FUNCTION_CODE (last_arg_fndecl) == BUILT_IN_VA_ARG_PACK)
2438 tree call = *expr_p;
2441 *expr_p = build_call_array_loc (loc, TREE_TYPE (call),
2442 CALL_EXPR_FN (call),
2443 nargs, CALL_EXPR_ARGP (call));
2445 /* Copy all CALL_EXPR flags, location and block, except
2446 CALL_EXPR_VA_ARG_PACK flag. */
2447 CALL_EXPR_STATIC_CHAIN (*expr_p) = CALL_EXPR_STATIC_CHAIN (call);
2448 CALL_EXPR_TAILCALL (*expr_p) = CALL_EXPR_TAILCALL (call);
2449 CALL_EXPR_RETURN_SLOT_OPT (*expr_p)
2450 = CALL_EXPR_RETURN_SLOT_OPT (call);
2451 CALL_FROM_THUNK_P (*expr_p) = CALL_FROM_THUNK_P (call);
2452 CALL_CANNOT_INLINE_P (*expr_p) = CALL_CANNOT_INLINE_P (call);
2453 SET_EXPR_LOCATION (*expr_p, EXPR_LOCATION (call));
2454 TREE_BLOCK (*expr_p) = TREE_BLOCK (call);
2456 /* Set CALL_EXPR_VA_ARG_PACK. */
2457 CALL_EXPR_VA_ARG_PACK (*expr_p) = 1;
2461 /* Finally, gimplify the function arguments. */
2464 for (i = (PUSH_ARGS_REVERSED ? nargs - 1 : 0);
2465 PUSH_ARGS_REVERSED ? i >= 0 : i < nargs;
2466 PUSH_ARGS_REVERSED ? i-- : i++)
2468 enum gimplify_status t;
2470 /* Avoid gimplifying the second argument to va_start, which needs to
2471 be the plain PARM_DECL. */
2472 if ((i != 1) || !builtin_va_start_p)
2474 t = gimplify_arg (&CALL_EXPR_ARG (*expr_p, i), pre_p,
2475 EXPR_LOCATION (*expr_p));
2483 /* Verify the function result. */
2484 if (want_value && fndecl
2485 && VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fnptrtype))))
2487 error_at (loc, "using result of function returning %<void%>");
2491 /* Try this again in case gimplification exposed something. */
2492 if (ret != GS_ERROR)
2494 tree new_tree = fold_call_expr (input_location, *expr_p, !want_value);
2496 if (new_tree && new_tree != *expr_p)
2498 /* There was a transformation of this call which computes the
2499 same value, but in a more efficient way. Return and try
2507 *expr_p = error_mark_node;
2511 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2512 decl. This allows us to eliminate redundant or useless
2513 calls to "const" functions. */
2514 if (TREE_CODE (*expr_p) == CALL_EXPR)
2516 int flags = call_expr_flags (*expr_p);
2517 if (flags & (ECF_CONST | ECF_PURE)
2518 /* An infinite loop is considered a side effect. */
2519 && !(flags & (ECF_LOOPING_CONST_OR_PURE)))
2520 TREE_SIDE_EFFECTS (*expr_p) = 0;
2523 /* If the value is not needed by the caller, emit a new GIMPLE_CALL
2524 and clear *EXPR_P. Otherwise, leave *EXPR_P in its gimplified
2525 form and delegate the creation of a GIMPLE_CALL to
2526 gimplify_modify_expr. This is always possible because when
2527 WANT_VALUE is true, the caller wants the result of this call into
2528 a temporary, which means that we will emit an INIT_EXPR in
2529 internal_get_tmp_var which will then be handled by
2530 gimplify_modify_expr. */
2533 /* The CALL_EXPR in *EXPR_P is already in GIMPLE form, so all we
2534 have to do is replicate it as a GIMPLE_CALL tuple. */
2535 gimple_stmt_iterator gsi;
2536 call = gimple_build_call_from_tree (*expr_p);
2537 gimple_call_set_fntype (call, TREE_TYPE (fnptrtype));
2538 gimplify_seq_add_stmt (pre_p, call);
2539 gsi = gsi_last (*pre_p);
2541 *expr_p = NULL_TREE;
2544 /* Remember the original function type. */
2545 CALL_EXPR_FN (*expr_p) = build1 (NOP_EXPR, fnptrtype,
2546 CALL_EXPR_FN (*expr_p));
2551 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2552 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2554 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2555 condition is true or false, respectively. If null, we should generate
2556 our own to skip over the evaluation of this specific expression.
2558 LOCUS is the source location of the COND_EXPR.
2560 This function is the tree equivalent of do_jump.
2562 shortcut_cond_r should only be called by shortcut_cond_expr. */
2565 shortcut_cond_r (tree pred, tree *true_label_p, tree *false_label_p,
2568 tree local_label = NULL_TREE;
2569 tree t, expr = NULL;
2571 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2572 retain the shortcut semantics. Just insert the gotos here;
2573 shortcut_cond_expr will append the real blocks later. */
2574 if (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2576 location_t new_locus;
2578 /* Turn if (a && b) into
2580 if (a); else goto no;
2581 if (b) goto yes; else goto no;
2584 if (false_label_p == NULL)
2585 false_label_p = &local_label;
2587 /* Keep the original source location on the first 'if'. */
2588 t = shortcut_cond_r (TREE_OPERAND (pred, 0), NULL, false_label_p, locus);
2589 append_to_statement_list (t, &expr);
2591 /* Set the source location of the && on the second 'if'. */
2592 new_locus = EXPR_HAS_LOCATION (pred) ? EXPR_LOCATION (pred) : locus;
2593 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p, false_label_p,
2595 append_to_statement_list (t, &expr);
2597 else if (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2599 location_t new_locus;
2601 /* Turn if (a || b) into
2604 if (b) goto yes; else goto no;
2607 if (true_label_p == NULL)
2608 true_label_p = &local_label;
2610 /* Keep the original source location on the first 'if'. */
2611 t = shortcut_cond_r (TREE_OPERAND (pred, 0), true_label_p, NULL, locus);
2612 append_to_statement_list (t, &expr);
2614 /* Set the source location of the || on the second 'if'. */
2615 new_locus = EXPR_HAS_LOCATION (pred) ? EXPR_LOCATION (pred) : locus;
2616 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p, false_label_p,
2618 append_to_statement_list (t, &expr);
2620 else if (TREE_CODE (pred) == COND_EXPR
2621 && !VOID_TYPE_P (TREE_TYPE (TREE_OPERAND (pred, 1)))
2622 && !VOID_TYPE_P (TREE_TYPE (TREE_OPERAND (pred, 2))))
2624 location_t new_locus;
2626 /* As long as we're messing with gotos, turn if (a ? b : c) into
2628 if (b) goto yes; else goto no;
2630 if (c) goto yes; else goto no;
2632 Don't do this if one of the arms has void type, which can happen
2633 in C++ when the arm is throw. */
2635 /* Keep the original source location on the first 'if'. Set the source
2636 location of the ? on the second 'if'. */
2637 new_locus = EXPR_HAS_LOCATION (pred) ? EXPR_LOCATION (pred) : locus;
2638 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (pred, 0),
2639 shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2640 false_label_p, locus),
2641 shortcut_cond_r (TREE_OPERAND (pred, 2), true_label_p,
2642 false_label_p, new_locus));
2646 expr = build3 (COND_EXPR, void_type_node, pred,
2647 build_and_jump (true_label_p),
2648 build_and_jump (false_label_p));
2649 SET_EXPR_LOCATION (expr, locus);
2654 t = build1 (LABEL_EXPR, void_type_node, local_label);
2655 append_to_statement_list (t, &expr);
2661 /* Given a conditional expression EXPR with short-circuit boolean
2662 predicates using TRUTH_ANDIF_EXPR or TRUTH_ORIF_EXPR, break the
2663 predicate appart into the equivalent sequence of conditionals. */
2666 shortcut_cond_expr (tree expr)
2668 tree pred = TREE_OPERAND (expr, 0);
2669 tree then_ = TREE_OPERAND (expr, 1);
2670 tree else_ = TREE_OPERAND (expr, 2);
2671 tree true_label, false_label, end_label, t;
2673 tree *false_label_p;
2674 bool emit_end, emit_false, jump_over_else;
2675 bool then_se = then_ && TREE_SIDE_EFFECTS (then_);
2676 bool else_se = else_ && TREE_SIDE_EFFECTS (else_);
2678 /* First do simple transformations. */
2681 /* If there is no 'else', turn
2684 if (a) if (b) then c. */
2685 while (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2687 /* Keep the original source location on the first 'if'. */
2688 location_t locus = EXPR_LOC_OR_HERE (expr);
2689 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2690 /* Set the source location of the && on the second 'if'. */
2691 if (EXPR_HAS_LOCATION (pred))
2692 SET_EXPR_LOCATION (expr, EXPR_LOCATION (pred));
2693 then_ = shortcut_cond_expr (expr);
2694 then_se = then_ && TREE_SIDE_EFFECTS (then_);
2695 pred = TREE_OPERAND (pred, 0);
2696 expr = build3 (COND_EXPR, void_type_node, pred, then_, NULL_TREE);
2697 SET_EXPR_LOCATION (expr, locus);
2703 /* If there is no 'then', turn
2706 if (a); else if (b); else d. */
2707 while (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2709 /* Keep the original source location on the first 'if'. */
2710 location_t locus = EXPR_LOC_OR_HERE (expr);
2711 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2712 /* Set the source location of the || on the second 'if'. */
2713 if (EXPR_HAS_LOCATION (pred))
2714 SET_EXPR_LOCATION (expr, EXPR_LOCATION (pred));
2715 else_ = shortcut_cond_expr (expr);
2716 else_se = else_ && TREE_SIDE_EFFECTS (else_);
2717 pred = TREE_OPERAND (pred, 0);
2718 expr = build3 (COND_EXPR, void_type_node, pred, NULL_TREE, else_);
2719 SET_EXPR_LOCATION (expr, locus);
2723 /* If we're done, great. */
2724 if (TREE_CODE (pred) != TRUTH_ANDIF_EXPR
2725 && TREE_CODE (pred) != TRUTH_ORIF_EXPR)
2728 /* Otherwise we need to mess with gotos. Change
2731 if (a); else goto no;
2734 and recursively gimplify the condition. */
2736 true_label = false_label = end_label = NULL_TREE;
2738 /* If our arms just jump somewhere, hijack those labels so we don't
2739 generate jumps to jumps. */
2742 && TREE_CODE (then_) == GOTO_EXPR
2743 && TREE_CODE (GOTO_DESTINATION (then_)) == LABEL_DECL)
2745 true_label = GOTO_DESTINATION (then_);
2751 && TREE_CODE (else_) == GOTO_EXPR
2752 && TREE_CODE (GOTO_DESTINATION (else_)) == LABEL_DECL)
2754 false_label = GOTO_DESTINATION (else_);
2759 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2761 true_label_p = &true_label;
2763 true_label_p = NULL;
2765 /* The 'else' branch also needs a label if it contains interesting code. */
2766 if (false_label || else_se)
2767 false_label_p = &false_label;
2769 false_label_p = NULL;
2771 /* If there was nothing else in our arms, just forward the label(s). */
2772 if (!then_se && !else_se)
2773 return shortcut_cond_r (pred, true_label_p, false_label_p,
2774 EXPR_LOC_OR_HERE (expr));
2776 /* If our last subexpression already has a terminal label, reuse it. */
2778 t = expr_last (else_);
2780 t = expr_last (then_);
2783 if (t && TREE_CODE (t) == LABEL_EXPR)
2784 end_label = LABEL_EXPR_LABEL (t);
2786 /* If we don't care about jumping to the 'else' branch, jump to the end
2787 if the condition is false. */
2789 false_label_p = &end_label;
2791 /* We only want to emit these labels if we aren't hijacking them. */
2792 emit_end = (end_label == NULL_TREE);
2793 emit_false = (false_label == NULL_TREE);
2795 /* We only emit the jump over the else clause if we have to--if the
2796 then clause may fall through. Otherwise we can wind up with a
2797 useless jump and a useless label at the end of gimplified code,
2798 which will cause us to think that this conditional as a whole
2799 falls through even if it doesn't. If we then inline a function
2800 which ends with such a condition, that can cause us to issue an
2801 inappropriate warning about control reaching the end of a
2802 non-void function. */
2803 jump_over_else = block_may_fallthru (then_);
2805 pred = shortcut_cond_r (pred, true_label_p, false_label_p,
2806 EXPR_LOC_OR_HERE (expr));
2809 append_to_statement_list (pred, &expr);
2811 append_to_statement_list (then_, &expr);
2816 tree last = expr_last (expr);
2817 t = build_and_jump (&end_label);
2818 if (EXPR_HAS_LOCATION (last))
2819 SET_EXPR_LOCATION (t, EXPR_LOCATION (last));
2820 append_to_statement_list (t, &expr);
2824 t = build1 (LABEL_EXPR, void_type_node, false_label);
2825 append_to_statement_list (t, &expr);
2827 append_to_statement_list (else_, &expr);
2829 if (emit_end && end_label)
2831 t = build1 (LABEL_EXPR, void_type_node, end_label);
2832 append_to_statement_list (t, &expr);
2838 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2841 gimple_boolify (tree expr)
2843 tree type = TREE_TYPE (expr);
2844 location_t loc = EXPR_LOCATION (expr);
2846 if (TREE_CODE (expr) == NE_EXPR
2847 && TREE_CODE (TREE_OPERAND (expr, 0)) == CALL_EXPR
2848 && integer_zerop (TREE_OPERAND (expr, 1)))
2850 tree call = TREE_OPERAND (expr, 0);
2851 tree fn = get_callee_fndecl (call);
2853 /* For __builtin_expect ((long) (x), y) recurse into x as well
2854 if x is truth_value_p. */
2856 && DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2857 && DECL_FUNCTION_CODE (fn) == BUILT_IN_EXPECT
2858 && call_expr_nargs (call) == 2)
2860 tree arg = CALL_EXPR_ARG (call, 0);
2863 if (TREE_CODE (arg) == NOP_EXPR
2864 && TREE_TYPE (arg) == TREE_TYPE (call))
2865 arg = TREE_OPERAND (arg, 0);
2866 if (truth_value_p (TREE_CODE (arg)))
2868 arg = gimple_boolify (arg);
2869 CALL_EXPR_ARG (call, 0)
2870 = fold_convert_loc (loc, TREE_TYPE (call), arg);
2876 switch (TREE_CODE (expr))
2878 case TRUTH_AND_EXPR:
2880 case TRUTH_XOR_EXPR:
2881 case TRUTH_ANDIF_EXPR:
2882 case TRUTH_ORIF_EXPR:
2883 /* Also boolify the arguments of truth exprs. */
2884 TREE_OPERAND (expr, 1) = gimple_boolify (TREE_OPERAND (expr, 1));
2887 case TRUTH_NOT_EXPR:
2888 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2890 /* These expressions always produce boolean results. */
2891 if (TREE_CODE (type) != BOOLEAN_TYPE)
2892 TREE_TYPE (expr) = boolean_type_node;
2896 if (COMPARISON_CLASS_P (expr))
2898 /* There expressions always prduce boolean results. */
2899 if (TREE_CODE (type) != BOOLEAN_TYPE)
2900 TREE_TYPE (expr) = boolean_type_node;
2903 /* Other expressions that get here must have boolean values, but
2904 might need to be converted to the appropriate mode. */
2905 if (TREE_CODE (type) == BOOLEAN_TYPE)
2907 return fold_convert_loc (loc, boolean_type_node, expr);
2911 /* Given a conditional expression *EXPR_P without side effects, gimplify
2912 its operands. New statements are inserted to PRE_P. */
2914 static enum gimplify_status
2915 gimplify_pure_cond_expr (tree *expr_p, gimple_seq *pre_p)
2917 tree expr = *expr_p, cond;
2918 enum gimplify_status ret, tret;
2919 enum tree_code code;
2921 cond = gimple_boolify (COND_EXPR_COND (expr));
2923 /* We need to handle && and || specially, as their gimplification
2924 creates pure cond_expr, thus leading to an infinite cycle otherwise. */
2925 code = TREE_CODE (cond);
2926 if (code == TRUTH_ANDIF_EXPR)
2927 TREE_SET_CODE (cond, TRUTH_AND_EXPR);
2928 else if (code == TRUTH_ORIF_EXPR)
2929 TREE_SET_CODE (cond, TRUTH_OR_EXPR);
2930 ret = gimplify_expr (&cond, pre_p, NULL, is_gimple_condexpr, fb_rvalue);
2931 COND_EXPR_COND (*expr_p) = cond;
2933 tret = gimplify_expr (&COND_EXPR_THEN (expr), pre_p, NULL,
2934 is_gimple_val, fb_rvalue);
2935 ret = MIN (ret, tret);
2936 tret = gimplify_expr (&COND_EXPR_ELSE (expr), pre_p, NULL,
2937 is_gimple_val, fb_rvalue);
2939 return MIN (ret, tret);
2942 /* Return true if evaluating EXPR could trap.
2943 EXPR is GENERIC, while tree_could_trap_p can be called
2947 generic_expr_could_trap_p (tree expr)
2951 if (!expr || is_gimple_val (expr))
2954 if (!EXPR_P (expr) || tree_could_trap_p (expr))
2957 n = TREE_OPERAND_LENGTH (expr);
2958 for (i = 0; i < n; i++)
2959 if (generic_expr_could_trap_p (TREE_OPERAND (expr, i)))
2965 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2974 The second form is used when *EXPR_P is of type void.
2976 PRE_P points to the list where side effects that must happen before
2977 *EXPR_P should be stored. */
2979 static enum gimplify_status
2980 gimplify_cond_expr (tree *expr_p, gimple_seq *pre_p, fallback_t fallback)
2982 tree expr = *expr_p;
2983 tree type = TREE_TYPE (expr);
2984 location_t loc = EXPR_LOCATION (expr);
2985 tree tmp, arm1, arm2;
2986 enum gimplify_status ret;
2987 tree label_true, label_false, label_cont;
2988 bool have_then_clause_p, have_else_clause_p;
2990 enum tree_code pred_code;
2991 gimple_seq seq = NULL;
2993 /* If this COND_EXPR has a value, copy the values into a temporary within
2995 if (!VOID_TYPE_P (type))
2997 tree then_ = TREE_OPERAND (expr, 1), else_ = TREE_OPERAND (expr, 2);
3000 /* If either an rvalue is ok or we do not require an lvalue, create the
3001 temporary. But we cannot do that if the type is addressable. */
3002 if (((fallback & fb_rvalue) || !(fallback & fb_lvalue))
3003 && !TREE_ADDRESSABLE (type))
3005 if (gimplify_ctxp->allow_rhs_cond_expr
3006 /* If either branch has side effects or could trap, it can't be
3007 evaluated unconditionally. */
3008 && !TREE_SIDE_EFFECTS (then_)
3009 && !generic_expr_could_trap_p (then_)
3010 && !TREE_SIDE_EFFECTS (else_)
3011 && !generic_expr_could_trap_p (else_))
3012 return gimplify_pure_cond_expr (expr_p, pre_p);
3014 tmp = create_tmp_var (type, "iftmp");
3018 /* Otherwise, only create and copy references to the values. */
3021 type = build_pointer_type (type);
3023 if (!VOID_TYPE_P (TREE_TYPE (then_)))
3024 then_ = build_fold_addr_expr_loc (loc, then_);
3026 if (!VOID_TYPE_P (TREE_TYPE (else_)))
3027 else_ = build_fold_addr_expr_loc (loc, else_);
3030 = build3 (COND_EXPR, type, TREE_OPERAND (expr, 0), then_, else_);
3032 tmp = create_tmp_var (type, "iftmp");
3033 result = build_simple_mem_ref_loc (loc, tmp);
3036 /* Build the new then clause, `tmp = then_;'. But don't build the
3037 assignment if the value is void; in C++ it can be if it's a throw. */
3038 if (!VOID_TYPE_P (TREE_TYPE (then_)))
3039 TREE_OPERAND (expr, 1) = build2 (MODIFY_EXPR, type, tmp, then_);
3041 /* Similarly, build the new else clause, `tmp = else_;'. */
3042 if (!VOID_TYPE_P (TREE_TYPE (else_)))
3043 TREE_OPERAND (expr, 2) = build2 (MODIFY_EXPR, type, tmp, else_);
3045 TREE_TYPE (expr) = void_type_node;
3046 recalculate_side_effects (expr);
3048 /* Move the COND_EXPR to the prequeue. */
3049 gimplify_stmt (&expr, pre_p);
3055 /* Remove any COMPOUND_EXPR so the following cases will be caught. */
3056 STRIP_TYPE_NOPS (TREE_OPERAND (expr, 0));
3057 if (TREE_CODE (TREE_OPERAND (expr, 0)) == COMPOUND_EXPR)
3058 gimplify_compound_expr (&TREE_OPERAND (expr, 0), pre_p, true);
3060 /* Make sure the condition has BOOLEAN_TYPE. */
3061 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
3063 /* Break apart && and || conditions. */
3064 if (TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ANDIF_EXPR
3065 || TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ORIF_EXPR)
3067 expr = shortcut_cond_expr (expr);
3069 if (expr != *expr_p)
3073 /* We can't rely on gimplify_expr to re-gimplify the expanded
3074 form properly, as cleanups might cause the target labels to be
3075 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
3076 set up a conditional context. */
3077 gimple_push_condition ();
3078 gimplify_stmt (expr_p, &seq);
3079 gimple_pop_condition (pre_p);
3080 gimple_seq_add_seq (pre_p, seq);
3086 /* Now do the normal gimplification. */
3088 /* Gimplify condition. */
3089 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL, is_gimple_condexpr,
3091 if (ret == GS_ERROR)
3093 gcc_assert (TREE_OPERAND (expr, 0) != NULL_TREE);
3095 gimple_push_condition ();
3097 have_then_clause_p = have_else_clause_p = false;
3098 if (TREE_OPERAND (expr, 1) != NULL
3099 && TREE_CODE (TREE_OPERAND (expr, 1)) == GOTO_EXPR
3100 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr, 1))) == LABEL_DECL
3101 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr, 1)))
3102 == current_function_decl)
3103 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
3104 have different locations, otherwise we end up with incorrect
3105 location information on the branches. */
3107 || !EXPR_HAS_LOCATION (expr)
3108 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr, 1))
3109 || EXPR_LOCATION (expr) == EXPR_LOCATION (TREE_OPERAND (expr, 1))))
3111 label_true = GOTO_DESTINATION (TREE_OPERAND (expr, 1));
3112 have_then_clause_p = true;
3115 label_true = create_artificial_label (UNKNOWN_LOCATION);
3116 if (TREE_OPERAND (expr, 2) != NULL
3117 && TREE_CODE (TREE_OPERAND (expr, 2)) == GOTO_EXPR
3118 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr, 2))) == LABEL_DECL
3119 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr, 2)))
3120 == current_function_decl)
3121 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
3122 have different locations, otherwise we end up with incorrect
3123 location information on the branches. */
3125 || !EXPR_HAS_LOCATION (expr)
3126 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr, 2))
3127 || EXPR_LOCATION (expr) == EXPR_LOCATION (TREE_OPERAND (expr, 2))))
3129 label_false = GOTO_DESTINATION (TREE_OPERAND (expr, 2));
3130 have_else_clause_p = true;
3133 label_false = create_artificial_label (UNKNOWN_LOCATION);
3135 gimple_cond_get_ops_from_tree (COND_EXPR_COND (expr), &pred_code, &arm1,
3138 gimple_cond = gimple_build_cond (pred_code, arm1, arm2, label_true,
3141 gimplify_seq_add_stmt (&seq, gimple_cond);
3142 label_cont = NULL_TREE;
3143 if (!have_then_clause_p)
3145 /* For if (...) {} else { code; } put label_true after
3147 if (TREE_OPERAND (expr, 1) == NULL_TREE
3148 && !have_else_clause_p
3149 && TREE_OPERAND (expr, 2) != NULL_TREE)
3150 label_cont = label_true;
3153 gimplify_seq_add_stmt (&seq, gimple_build_label (label_true));
3154 have_then_clause_p = gimplify_stmt (&TREE_OPERAND (expr, 1), &seq);
3155 /* For if (...) { code; } else {} or
3156 if (...) { code; } else goto label; or
3157 if (...) { code; return; } else { ... }
3158 label_cont isn't needed. */
3159 if (!have_else_clause_p
3160 && TREE_OPERAND (expr, 2) != NULL_TREE
3161 && gimple_seq_may_fallthru (seq))
3164 label_cont = create_artificial_label (UNKNOWN_LOCATION);
3166 g = gimple_build_goto (label_cont);
3168 /* GIMPLE_COND's are very low level; they have embedded
3169 gotos. This particular embedded goto should not be marked
3170 with the location of the original COND_EXPR, as it would
3171 correspond to the COND_EXPR's condition, not the ELSE or the
3172 THEN arms. To avoid marking it with the wrong location, flag
3173 it as "no location". */
3174 gimple_set_do_not_emit_location (g);
3176 gimplify_seq_add_stmt (&seq, g);
3180 if (!have_else_clause_p)
3182 gimplify_seq_add_stmt (&seq, gimple_build_label (label_false));
3183 have_else_clause_p = gimplify_stmt (&TREE_OPERAND (expr, 2), &seq);
3186 gimplify_seq_add_stmt (&seq, gimple_build_label (label_cont));
3188 gimple_pop_condition (pre_p);
3189 gimple_seq_add_seq (pre_p, seq);
3191 if (ret == GS_ERROR)
3193 else if (have_then_clause_p || have_else_clause_p)
3197 /* Both arms are empty; replace the COND_EXPR with its predicate. */
3198 expr = TREE_OPERAND (expr, 0);
3199 gimplify_stmt (&expr, pre_p);
3206 /* Prepare the node pointed to by EXPR_P, an is_gimple_addressable expression,
3207 to be marked addressable.
3209 We cannot rely on such an expression being directly markable if a temporary
3210 has been created by the gimplification. In this case, we create another
3211 temporary and initialize it with a copy, which will become a store after we
3212 mark it addressable. This can happen if the front-end passed us something
3213 that it could not mark addressable yet, like a Fortran pass-by-reference
3214 parameter (int) floatvar. */
3217 prepare_gimple_addressable (tree *expr_p, gimple_seq *seq_p)
3219 while (handled_component_p (*expr_p))
3220 expr_p = &TREE_OPERAND (*expr_p, 0);
3221 if (is_gimple_reg (*expr_p))
3222 *expr_p = get_initialized_tmp_var (*expr_p, seq_p, NULL);
3225 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3226 a call to __builtin_memcpy. */
3228 static enum gimplify_status
3229 gimplify_modify_expr_to_memcpy (tree *expr_p, tree size, bool want_value,
3232 tree t, to, to_ptr, from, from_ptr;
3234 location_t loc = EXPR_LOCATION (*expr_p);
3236 to = TREE_OPERAND (*expr_p, 0);
3237 from = TREE_OPERAND (*expr_p, 1);
3239 /* Mark the RHS addressable. Beware that it may not be possible to do so
3240 directly if a temporary has been created by the gimplification. */
3241 prepare_gimple_addressable (&from, seq_p);
3243 mark_addressable (from);
3244 from_ptr = build_fold_addr_expr_loc (loc, from);
3245 gimplify_arg (&from_ptr, seq_p, loc);
3247 mark_addressable (to);
3248 to_ptr = build_fold_addr_expr_loc (loc, to);
3249 gimplify_arg (&to_ptr, seq_p, loc);
3251 t = builtin_decl_implicit (BUILT_IN_MEMCPY);
3253 gs = gimple_build_call (t, 3, to_ptr, from_ptr, size);
3257 /* tmp = memcpy() */
3258 t = create_tmp_var (TREE_TYPE (to_ptr), NULL);
3259 gimple_call_set_lhs (gs, t);
3260 gimplify_seq_add_stmt (seq_p, gs);
3262 *expr_p = build_simple_mem_ref (t);
3266 gimplify_seq_add_stmt (seq_p, gs);
3271 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3272 a call to __builtin_memset. In this case we know that the RHS is
3273 a CONSTRUCTOR with an empty element list. */
3275 static enum gimplify_status
3276 gimplify_modify_expr_to_memset (tree *expr_p, tree size, bool want_value,
3279 tree t, from, to, to_ptr;
3281 location_t loc = EXPR_LOCATION (*expr_p);
3283 /* Assert our assumptions, to abort instead of producing wrong code
3284 silently if they are not met. Beware that the RHS CONSTRUCTOR might
3285 not be immediately exposed. */
3286 from = TREE_OPERAND (*expr_p, 1);
3287 if (TREE_CODE (from) == WITH_SIZE_EXPR)
3288 from = TREE_OPERAND (from, 0);
3290 gcc_assert (TREE_CODE (from) == CONSTRUCTOR
3291 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (from)));
3294 to = TREE_OPERAND (*expr_p, 0);
3296 to_ptr = build_fold_addr_expr_loc (loc, to);
3297 gimplify_arg (&to_ptr, seq_p, loc);
3298 t = builtin_decl_implicit (BUILT_IN_MEMSET);
3300 gs = gimple_build_call (t, 3, to_ptr, integer_zero_node, size);
3304 /* tmp = memset() */
3305 t = create_tmp_var (TREE_TYPE (to_ptr), NULL);
3306 gimple_call_set_lhs (gs, t);
3307 gimplify_seq_add_stmt (seq_p, gs);
3309 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (to), t);
3313 gimplify_seq_add_stmt (seq_p, gs);
3318 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
3319 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
3320 assignment. Return non-null if we detect a potential overlap. */
3322 struct gimplify_init_ctor_preeval_data
3324 /* The base decl of the lhs object. May be NULL, in which case we
3325 have to assume the lhs is indirect. */
3328 /* The alias set of the lhs object. */
3329 alias_set_type lhs_alias_set;
3333 gimplify_init_ctor_preeval_1 (tree *tp, int *walk_subtrees, void *xdata)
3335 struct gimplify_init_ctor_preeval_data *data
3336 = (struct gimplify_init_ctor_preeval_data *) xdata;
3339 /* If we find the base object, obviously we have overlap. */
3340 if (data->lhs_base_decl == t)
3343 /* If the constructor component is indirect, determine if we have a
3344 potential overlap with the lhs. The only bits of information we
3345 have to go on at this point are addressability and alias sets. */
3346 if ((INDIRECT_REF_P (t)
3347 || TREE_CODE (t) == MEM_REF)
3348 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
3349 && alias_sets_conflict_p (data->lhs_alias_set, get_alias_set (t)))
3352 /* If the constructor component is a call, determine if it can hide a
3353 potential overlap with the lhs through an INDIRECT_REF like above.
3354 ??? Ugh - this is completely broken. In fact this whole analysis
3355 doesn't look conservative. */
3356 if (TREE_CODE (t) == CALL_EXPR)
3358 tree type, fntype = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (t)));
3360 for (type = TYPE_ARG_TYPES (fntype); type; type = TREE_CHAIN (type))
3361 if (POINTER_TYPE_P (TREE_VALUE (type))
3362 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
3363 && alias_sets_conflict_p (data->lhs_alias_set,
3365 (TREE_TYPE (TREE_VALUE (type)))))
3369 if (IS_TYPE_OR_DECL_P (t))
3374 /* A subroutine of gimplify_init_constructor. Pre-evaluate EXPR,
3375 force values that overlap with the lhs (as described by *DATA)
3376 into temporaries. */
3379 gimplify_init_ctor_preeval (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
3380 struct gimplify_init_ctor_preeval_data *data)
3382 enum gimplify_status one;
3384 /* If the value is constant, then there's nothing to pre-evaluate. */
3385 if (TREE_CONSTANT (*expr_p))
3387 /* Ensure it does not have side effects, it might contain a reference to
3388 the object we're initializing. */
3389 gcc_assert (!TREE_SIDE_EFFECTS (*expr_p));
3393 /* If the type has non-trivial constructors, we can't pre-evaluate. */
3394 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p)))
3397 /* Recurse for nested constructors. */
3398 if (TREE_CODE (*expr_p) == CONSTRUCTOR)
3400 unsigned HOST_WIDE_INT ix;
3401 constructor_elt *ce;
3402 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (*expr_p);
3404 FOR_EACH_VEC_ELT (constructor_elt, v, ix, ce)
3405 gimplify_init_ctor_preeval (&ce->value, pre_p, post_p, data);
3410 /* If this is a variable sized type, we must remember the size. */
3411 maybe_with_size_expr (expr_p);
3413 /* Gimplify the constructor element to something appropriate for the rhs
3414 of a MODIFY_EXPR. Given that we know the LHS is an aggregate, we know
3415 the gimplifier will consider this a store to memory. Doing this
3416 gimplification now means that we won't have to deal with complicated
3417 language-specific trees, nor trees like SAVE_EXPR that can induce
3418 exponential search behavior. */
3419 one = gimplify_expr (expr_p, pre_p, post_p, is_gimple_mem_rhs, fb_rvalue);
3420 if (one == GS_ERROR)
3426 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
3427 with the lhs, since "a = { .x=a }" doesn't make sense. This will
3428 always be true for all scalars, since is_gimple_mem_rhs insists on a
3429 temporary variable for them. */
3430 if (DECL_P (*expr_p))
3433 /* If this is of variable size, we have no choice but to assume it doesn't
3434 overlap since we can't make a temporary for it. */
3435 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (*expr_p))) != INTEGER_CST)
3438 /* Otherwise, we must search for overlap ... */
3439 if (!walk_tree (expr_p, gimplify_init_ctor_preeval_1, data, NULL))
3442 /* ... and if found, force the value into a temporary. */
3443 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
3446 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
3447 a RANGE_EXPR in a CONSTRUCTOR for an array.
3451 object[var] = value;
3458 We increment var _after_ the loop exit check because we might otherwise
3459 fail if upper == TYPE_MAX_VALUE (type for upper).
3461 Note that we never have to deal with SAVE_EXPRs here, because this has
3462 already been taken care of for us, in gimplify_init_ctor_preeval(). */
3464 static void gimplify_init_ctor_eval (tree, VEC(constructor_elt,gc) *,
3465 gimple_seq *, bool);
3468 gimplify_init_ctor_eval_range (tree object, tree lower, tree upper,
3469 tree value, tree array_elt_type,
3470 gimple_seq *pre_p, bool cleared)
3472 tree loop_entry_label, loop_exit_label, fall_thru_label;
3473 tree var, var_type, cref, tmp;
3475 loop_entry_label = create_artificial_label (UNKNOWN_LOCATION);
3476 loop_exit_label = create_artificial_label (UNKNOWN_LOCATION);
3477 fall_thru_label = create_artificial_label (UNKNOWN_LOCATION);
3479 /* Create and initialize the index variable. */
3480 var_type = TREE_TYPE (upper);
3481 var = create_tmp_var (var_type, NULL);
3482 gimplify_seq_add_stmt (pre_p, gimple_build_assign (var, lower));
3484 /* Add the loop entry label. */
3485 gimplify_seq_add_stmt (pre_p, gimple_build_label (loop_entry_label));
3487 /* Build the reference. */
3488 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
3489 var, NULL_TREE, NULL_TREE);
3491 /* If we are a constructor, just call gimplify_init_ctor_eval to do
3492 the store. Otherwise just assign value to the reference. */
3494 if (TREE_CODE (value) == CONSTRUCTOR)
3495 /* NB we might have to call ourself recursively through
3496 gimplify_init_ctor_eval if the value is a constructor. */
3497 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
3500 gimplify_seq_add_stmt (pre_p, gimple_build_assign (cref, value));
3502 /* We exit the loop when the index var is equal to the upper bound. */
3503 gimplify_seq_add_stmt (pre_p,
3504 gimple_build_cond (EQ_EXPR, var, upper,
3505 loop_exit_label, fall_thru_label));
3507 gimplify_seq_add_stmt (pre_p, gimple_build_label (fall_thru_label));
3509 /* Otherwise, increment the index var... */
3510 tmp = build2 (PLUS_EXPR, var_type, var,
3511 fold_convert (var_type, integer_one_node));
3512 gimplify_seq_add_stmt (pre_p, gimple_build_assign (var, tmp));
3514 /* ...and jump back to the loop entry. */
3515 gimplify_seq_add_stmt (pre_p, gimple_build_goto (loop_entry_label));
3517 /* Add the loop exit label. */
3518 gimplify_seq_add_stmt (pre_p, gimple_build_label (loop_exit_label));
3521 /* Return true if FDECL is accessing a field that is zero sized. */
3524 zero_sized_field_decl (const_tree fdecl)
3526 if (TREE_CODE (fdecl) == FIELD_DECL && DECL_SIZE (fdecl)
3527 && integer_zerop (DECL_SIZE (fdecl)))
3532 /* Return true if TYPE is zero sized. */
3535 zero_sized_type (const_tree type)
3537 if (AGGREGATE_TYPE_P (type) && TYPE_SIZE (type)
3538 && integer_zerop (TYPE_SIZE (type)))
3543 /* A subroutine of gimplify_init_constructor. Generate individual
3544 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
3545 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
3546 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
3550 gimplify_init_ctor_eval (tree object, VEC(constructor_elt,gc) *elts,
3551 gimple_seq *pre_p, bool cleared)
3553 tree array_elt_type = NULL;
3554 unsigned HOST_WIDE_INT ix;
3555 tree purpose, value;
3557 if (TREE_CODE (TREE_TYPE (object)) == ARRAY_TYPE)
3558 array_elt_type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object)));
3560 FOR_EACH_CONSTRUCTOR_ELT (elts, ix, purpose, value)
3564 /* NULL values are created above for gimplification errors. */
3568 if (cleared && initializer_zerop (value))
3571 /* ??? Here's to hoping the front end fills in all of the indices,
3572 so we don't have to figure out what's missing ourselves. */
3573 gcc_assert (purpose);
3575 /* Skip zero-sized fields, unless value has side-effects. This can
3576 happen with calls to functions returning a zero-sized type, which
3577 we shouldn't discard. As a number of downstream passes don't
3578 expect sets of zero-sized fields, we rely on the gimplification of
3579 the MODIFY_EXPR we make below to drop the assignment statement. */
3580 if (! TREE_SIDE_EFFECTS (value) && zero_sized_field_decl (purpose))
3583 /* If we have a RANGE_EXPR, we have to build a loop to assign the
3585 if (TREE_CODE (purpose) == RANGE_EXPR)
3587 tree lower = TREE_OPERAND (purpose, 0);
3588 tree upper = TREE_OPERAND (purpose, 1);
3590 /* If the lower bound is equal to upper, just treat it as if
3591 upper was the index. */
3592 if (simple_cst_equal (lower, upper))
3596 gimplify_init_ctor_eval_range (object, lower, upper, value,
3597 array_elt_type, pre_p, cleared);
3604 /* Do not use bitsizetype for ARRAY_REF indices. */
3605 if (TYPE_DOMAIN (TREE_TYPE (object)))
3607 = fold_convert (TREE_TYPE (TYPE_DOMAIN (TREE_TYPE (object))),
3609 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
3610 purpose, NULL_TREE, NULL_TREE);
3614 gcc_assert (TREE_CODE (purpose) == FIELD_DECL);
3615 cref = build3 (COMPONENT_REF, TREE_TYPE (purpose),
3616 unshare_expr (object), purpose, NULL_TREE);
3619 if (TREE_CODE (value) == CONSTRUCTOR
3620 && TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE)
3621 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
3625 tree init = build2 (INIT_EXPR, TREE_TYPE (cref), cref, value);
3626 gimplify_and_add (init, pre_p);
3632 /* Return the appropriate RHS predicate for this LHS. */
3635 rhs_predicate_for (tree lhs)
3637 if (is_gimple_reg (lhs))
3638 return is_gimple_reg_rhs_or_call;
3640 return is_gimple_mem_rhs_or_call;
3643 /* Gimplify a C99 compound literal expression. This just means adding
3644 the DECL_EXPR before the current statement and using its anonymous
3647 static enum gimplify_status
3648 gimplify_compound_literal_expr (tree *expr_p, gimple_seq *pre_p)
3650 tree decl_s = COMPOUND_LITERAL_EXPR_DECL_EXPR (*expr_p);
3651 tree decl = DECL_EXPR_DECL (decl_s);
3652 /* Mark the decl as addressable if the compound literal
3653 expression is addressable now, otherwise it is marked too late
3654 after we gimplify the initialization expression. */
3655 if (TREE_ADDRESSABLE (*expr_p))
3656 TREE_ADDRESSABLE (decl) = 1;
3658 /* Preliminarily mark non-addressed complex variables as eligible
3659 for promotion to gimple registers. We'll transform their uses
3661 if ((TREE_CODE (TREE_TYPE (decl)) == COMPLEX_TYPE
3662 || TREE_CODE (TREE_TYPE (decl)) == VECTOR_TYPE)
3663 && !TREE_THIS_VOLATILE (decl)
3664 && !needs_to_live_in_memory (decl))
3665 DECL_GIMPLE_REG_P (decl) = 1;
3667 /* This decl isn't mentioned in the enclosing block, so add it to the
3668 list of temps. FIXME it seems a bit of a kludge to say that
3669 anonymous artificial vars aren't pushed, but everything else is. */
3670 if (DECL_NAME (decl) == NULL_TREE && !DECL_SEEN_IN_BIND_EXPR_P (decl))
3671 gimple_add_tmp_var (decl);
3673 gimplify_and_add (decl_s, pre_p);
3678 /* Optimize embedded COMPOUND_LITERAL_EXPRs within a CONSTRUCTOR,
3679 return a new CONSTRUCTOR if something changed. */
3682 optimize_compound_literals_in_ctor (tree orig_ctor)
3684 tree ctor = orig_ctor;
3685 VEC(constructor_elt,gc) *elts = CONSTRUCTOR_ELTS (ctor);
3686 unsigned int idx, num = VEC_length (constructor_elt, elts);
3688 for (idx = 0; idx < num; idx++)
3690 tree value = VEC_index (constructor_elt, elts, idx)->value;
3691 tree newval = value;
3692 if (TREE_CODE (value) == CONSTRUCTOR)
3693 newval = optimize_compound_literals_in_ctor (value);
3694 else if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
3696 tree decl_s = COMPOUND_LITERAL_EXPR_DECL_EXPR (value);
3697 tree decl = DECL_EXPR_DECL (decl_s);
3698 tree init = DECL_INITIAL (decl);
3700 if (!TREE_ADDRESSABLE (value)
3701 && !TREE_ADDRESSABLE (decl)
3703 newval = optimize_compound_literals_in_ctor (init);
3705 if (newval == value)
3708 if (ctor == orig_ctor)
3710 ctor = copy_node (orig_ctor);
3711 CONSTRUCTOR_ELTS (ctor) = VEC_copy (constructor_elt, gc, elts);
3712 elts = CONSTRUCTOR_ELTS (ctor);
3714 VEC_index (constructor_elt, elts, idx)->value = newval;
3719 /* A subroutine of gimplify_modify_expr. Break out elements of a
3720 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
3722 Note that we still need to clear any elements that don't have explicit
3723 initializers, so if not all elements are initialized we keep the
3724 original MODIFY_EXPR, we just remove all of the constructor elements.
3726 If NOTIFY_TEMP_CREATION is true, do not gimplify, just return
3727 GS_ERROR if we would have to create a temporary when gimplifying
3728 this constructor. Otherwise, return GS_OK.
3730 If NOTIFY_TEMP_CREATION is false, just do the gimplification. */
3732 static enum gimplify_status
3733 gimplify_init_constructor (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
3734 bool want_value, bool notify_temp_creation)
3736 tree object, ctor, type;
3737 enum gimplify_status ret;
3738 VEC(constructor_elt,gc) *elts;
3740 gcc_assert (TREE_CODE (TREE_OPERAND (*expr_p, 1)) == CONSTRUCTOR);
3742 if (!notify_temp_creation)
3744 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3745 is_gimple_lvalue, fb_lvalue);
3746 if (ret == GS_ERROR)
3750 object = TREE_OPERAND (*expr_p, 0);
3751 ctor = TREE_OPERAND (*expr_p, 1) =
3752 optimize_compound_literals_in_ctor (TREE_OPERAND (*expr_p, 1));
3753 type = TREE_TYPE (ctor);
3754 elts = CONSTRUCTOR_ELTS (ctor);
3757 switch (TREE_CODE (type))
3761 case QUAL_UNION_TYPE:
3764 struct gimplify_init_ctor_preeval_data preeval_data;
3765 HOST_WIDE_INT num_ctor_elements, num_nonzero_elements;
3766 bool cleared, complete_p, valid_const_initializer;
3768 /* Aggregate types must lower constructors to initialization of
3769 individual elements. The exception is that a CONSTRUCTOR node
3770 with no elements indicates zero-initialization of the whole. */
3771 if (VEC_empty (constructor_elt, elts))
3773 if (notify_temp_creation)
3778 /* Fetch information about the constructor to direct later processing.
3779 We might want to make static versions of it in various cases, and
3780 can only do so if it known to be a valid constant initializer. */
3781 valid_const_initializer
3782 = categorize_ctor_elements (ctor, &num_nonzero_elements,
3783 &num_ctor_elements, &complete_p);
3785 /* If a const aggregate variable is being initialized, then it
3786 should never be a lose to promote the variable to be static. */
3787 if (valid_const_initializer
3788 && num_nonzero_elements > 1
3789 && TREE_READONLY (object)
3790 && TREE_CODE (object) == VAR_DECL
3791 && (flag_merge_constants >= 2 || !TREE_ADDRESSABLE (object)))
3793 if (notify_temp_creation)
3795 DECL_INITIAL (object) = ctor;
3796 TREE_STATIC (object) = 1;
3797 if (!DECL_NAME (object))
3798 DECL_NAME (object) = create_tmp_var_name ("C");
3799 walk_tree (&DECL_INITIAL (object), force_labels_r, NULL, NULL);
3801 /* ??? C++ doesn't automatically append a .<number> to the
3802 assembler name, and even when it does, it looks a FE private
3803 data structures to figure out what that number should be,
3804 which are not set for this variable. I suppose this is
3805 important for local statics for inline functions, which aren't
3806 "local" in the object file sense. So in order to get a unique
3807 TU-local symbol, we must invoke the lhd version now. */
3808 lhd_set_decl_assembler_name (object);
3810 *expr_p = NULL_TREE;
3814 /* If there are "lots" of initialized elements, even discounting
3815 those that are not address constants (and thus *must* be
3816 computed at runtime), then partition the constructor into
3817 constant and non-constant parts. Block copy the constant
3818 parts in, then generate code for the non-constant parts. */
3819 /* TODO. There's code in cp/typeck.c to do this. */
3821 if (int_size_in_bytes (TREE_TYPE (ctor)) < 0)
3822 /* store_constructor will ignore the clearing of variable-sized
3823 objects. Initializers for such objects must explicitly set
3824 every field that needs to be set. */
3826 else if (!complete_p)
3827 /* If the constructor isn't complete, clear the whole object
3830 ??? This ought not to be needed. For any element not present
3831 in the initializer, we should simply set them to zero. Except
3832 we'd need to *find* the elements that are not present, and that
3833 requires trickery to avoid quadratic compile-time behavior in
3834 large cases or excessive memory use in small cases. */
3836 else if (num_ctor_elements - num_nonzero_elements
3837 > CLEAR_RATIO (optimize_function_for_speed_p (cfun))
3838 && num_nonzero_elements < num_ctor_elements / 4)
3839 /* If there are "lots" of zeros, it's more efficient to clear
3840 the memory and then set the nonzero elements. */
3845 /* If there are "lots" of initialized elements, and all of them
3846 are valid address constants, then the entire initializer can
3847 be dropped to memory, and then memcpy'd out. Don't do this
3848 for sparse arrays, though, as it's more efficient to follow
3849 the standard CONSTRUCTOR behavior of memset followed by
3850 individual element initialization. Also don't do this for small
3851 all-zero initializers (which aren't big enough to merit
3852 clearing), and don't try to make bitwise copies of
3853 TREE_ADDRESSABLE types. */
3854 if (valid_const_initializer
3855 && !(cleared || num_nonzero_elements == 0)
3856 && !TREE_ADDRESSABLE (type))
3858 HOST_WIDE_INT size = int_size_in_bytes (type);
3861 /* ??? We can still get unbounded array types, at least
3862 from the C++ front end. This seems wrong, but attempt
3863 to work around it for now. */
3866 size = int_size_in_bytes (TREE_TYPE (object));
3868 TREE_TYPE (ctor) = type = TREE_TYPE (object);
3871 /* Find the maximum alignment we can assume for the object. */
3872 /* ??? Make use of DECL_OFFSET_ALIGN. */
3873 if (DECL_P (object))
3874 align = DECL_ALIGN (object);
3876 align = TYPE_ALIGN (type);
3879 && num_nonzero_elements > 1
3880 && !can_move_by_pieces (size, align))
3882 if (notify_temp_creation)
3885 walk_tree (&ctor, force_labels_r, NULL, NULL);
3886 ctor = tree_output_constant_def (ctor);
3887 if (!useless_type_conversion_p (type, TREE_TYPE (ctor)))
3888 ctor = build1 (VIEW_CONVERT_EXPR, type, ctor);
3889 TREE_OPERAND (*expr_p, 1) = ctor;
3891 /* This is no longer an assignment of a CONSTRUCTOR, but
3892 we still may have processing to do on the LHS. So
3893 pretend we didn't do anything here to let that happen. */
3894 return GS_UNHANDLED;
3898 /* If the target is volatile, we have non-zero elements and more than
3899 one field to assign, initialize the target from a temporary. */
3900 if (TREE_THIS_VOLATILE (object)
3901 && !TREE_ADDRESSABLE (type)
3902 && num_nonzero_elements > 0
3903 && VEC_length (constructor_elt, elts) > 1)
3905 tree temp = create_tmp_var (TYPE_MAIN_VARIANT (type), NULL);
3906 TREE_OPERAND (*expr_p, 0) = temp;
3907 *expr_p = build2 (COMPOUND_EXPR, TREE_TYPE (*expr_p),
3909 build2 (MODIFY_EXPR, void_type_node,
3914 if (notify_temp_creation)
3917 /* If there are nonzero elements and if needed, pre-evaluate to capture
3918 elements overlapping with the lhs into temporaries. We must do this
3919 before clearing to fetch the values before they are zeroed-out. */
3920 if (num_nonzero_elements > 0 && TREE_CODE (*expr_p) != INIT_EXPR)
3922 preeval_data.lhs_base_decl = get_base_address (object);
3923 if (!DECL_P (preeval_data.lhs_base_decl))
3924 preeval_data.lhs_base_decl = NULL;
3925 preeval_data.lhs_alias_set = get_alias_set (object);
3927 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p, 1),
3928 pre_p, post_p, &preeval_data);
3933 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3934 Note that we still have to gimplify, in order to handle the
3935 case of variable sized types. Avoid shared tree structures. */
3936 CONSTRUCTOR_ELTS (ctor) = NULL;
3937 TREE_SIDE_EFFECTS (ctor) = 0;
3938 object = unshare_expr (object);
3939 gimplify_stmt (expr_p, pre_p);
3942 /* If we have not block cleared the object, or if there are nonzero
3943 elements in the constructor, add assignments to the individual
3944 scalar fields of the object. */
3945 if (!cleared || num_nonzero_elements > 0)
3946 gimplify_init_ctor_eval (object, elts, pre_p, cleared);
3948 *expr_p = NULL_TREE;
3956 if (notify_temp_creation)
3959 /* Extract the real and imaginary parts out of the ctor. */
3960 gcc_assert (VEC_length (constructor_elt, elts) == 2);
3961 r = VEC_index (constructor_elt, elts, 0)->value;
3962 i = VEC_index (constructor_elt, elts, 1)->value;
3963 if (r == NULL || i == NULL)
3965 tree zero = build_zero_cst (TREE_TYPE (type));
3972 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3973 represent creation of a complex value. */
3974 if (TREE_CONSTANT (r) && TREE_CONSTANT (i))
3976 ctor = build_complex (type, r, i);
3977 TREE_OPERAND (*expr_p, 1) = ctor;
3981 ctor = build2 (COMPLEX_EXPR, type, r, i);
3982 TREE_OPERAND (*expr_p, 1) = ctor;
3983 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 1),
3986 rhs_predicate_for (TREE_OPERAND (*expr_p, 0)),
3994 unsigned HOST_WIDE_INT ix;
3995 constructor_elt *ce;
3997 if (notify_temp_creation)
4000 /* Go ahead and simplify constant constructors to VECTOR_CST. */
4001 if (TREE_CONSTANT (ctor))
4003 bool constant_p = true;
4006 /* Even when ctor is constant, it might contain non-*_CST
4007 elements, such as addresses or trapping values like
4008 1.0/0.0 - 1.0/0.0. Such expressions don't belong
4009 in VECTOR_CST nodes. */
4010 FOR_EACH_CONSTRUCTOR_VALUE (elts, ix, value)
4011 if (!CONSTANT_CLASS_P (value))
4019 TREE_OPERAND (*expr_p, 1) = build_vector_from_ctor (type, elts);
4023 /* Don't reduce an initializer constant even if we can't
4024 make a VECTOR_CST. It won't do anything for us, and it'll
4025 prevent us from representing it as a single constant. */
4026 if (initializer_constant_valid_p (ctor, type))
4029 TREE_CONSTANT (ctor) = 0;
4032 /* Vector types use CONSTRUCTOR all the way through gimple
4033 compilation as a general initializer. */
4034 FOR_EACH_VEC_ELT (constructor_elt, elts, ix, ce)
4036 enum gimplify_status tret;
4037 tret = gimplify_expr (&ce->value, pre_p, post_p, is_gimple_val,
4039 if (tret == GS_ERROR)
4042 if (!is_gimple_reg (TREE_OPERAND (*expr_p, 0)))
4043 TREE_OPERAND (*expr_p, 1) = get_formal_tmp_var (ctor, pre_p);
4048 /* So how did we get a CONSTRUCTOR for a scalar type? */
4052 if (ret == GS_ERROR)
4054 else if (want_value)
4061 /* If we have gimplified both sides of the initializer but have
4062 not emitted an assignment, do so now. */
4065 tree lhs = TREE_OPERAND (*expr_p, 0);
4066 tree rhs = TREE_OPERAND (*expr_p, 1);
4067 gimple init = gimple_build_assign (lhs, rhs);
4068 gimplify_seq_add_stmt (pre_p, init);
4076 /* Given a pointer value OP0, return a simplified version of an
4077 indirection through OP0, or NULL_TREE if no simplification is
4078 possible. Note that the resulting type may be different from
4079 the type pointed to in the sense that it is still compatible
4080 from the langhooks point of view. */
4083 gimple_fold_indirect_ref (tree t)
4085 tree ptype = TREE_TYPE (t), type = TREE_TYPE (ptype);
4090 subtype = TREE_TYPE (sub);
4091 if (!POINTER_TYPE_P (subtype))
4094 if (TREE_CODE (sub) == ADDR_EXPR)
4096 tree op = TREE_OPERAND (sub, 0);
4097 tree optype = TREE_TYPE (op);
4099 if (useless_type_conversion_p (type, optype))
4102 /* *(foo *)&fooarray => fooarray[0] */
4103 if (TREE_CODE (optype) == ARRAY_TYPE
4104 && TREE_CODE (TYPE_SIZE (TREE_TYPE (optype))) == INTEGER_CST
4105 && useless_type_conversion_p (type, TREE_TYPE (optype)))
4107 tree type_domain = TYPE_DOMAIN (optype);
4108 tree min_val = size_zero_node;
4109 if (type_domain && TYPE_MIN_VALUE (type_domain))
4110 min_val = TYPE_MIN_VALUE (type_domain);
4111 if (TREE_CODE (min_val) == INTEGER_CST)
4112 return build4 (ARRAY_REF, type, op, min_val, NULL_TREE, NULL_TREE);
4114 /* *(foo *)&complexfoo => __real__ complexfoo */
4115 else if (TREE_CODE (optype) == COMPLEX_TYPE
4116 && useless_type_conversion_p (type, TREE_TYPE (optype)))
4117 return fold_build1 (REALPART_EXPR, type, op);
4118 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
4119 else if (TREE_CODE (optype) == VECTOR_TYPE
4120 && useless_type_conversion_p (type, TREE_TYPE (optype)))
4122 tree part_width = TYPE_SIZE (type);
4123 tree index = bitsize_int (0);
4124 return fold_build3 (BIT_FIELD_REF, type, op, part_width, index);
4128 /* *(p + CST) -> ... */
4129 if (TREE_CODE (sub) == POINTER_PLUS_EXPR
4130 && TREE_CODE (TREE_OPERAND (sub, 1)) == INTEGER_CST)
4132 tree addr = TREE_OPERAND (sub, 0);
4133 tree off = TREE_OPERAND (sub, 1);
4137 addrtype = TREE_TYPE (addr);
4139 /* ((foo*)&vectorfoo)[1] -> BIT_FIELD_REF<vectorfoo,...> */
4140 if (TREE_CODE (addr) == ADDR_EXPR
4141 && TREE_CODE (TREE_TYPE (addrtype)) == VECTOR_TYPE
4142 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (addrtype)))
4143 && host_integerp (off, 1))
4145 unsigned HOST_WIDE_INT offset = tree_low_cst (off, 1);
4146 tree part_width = TYPE_SIZE (type);
4147 unsigned HOST_WIDE_INT part_widthi
4148 = tree_low_cst (part_width, 0) / BITS_PER_UNIT;
4149 unsigned HOST_WIDE_INT indexi = offset * BITS_PER_UNIT;
4150 tree index = bitsize_int (indexi);
4151 if (offset / part_widthi
4152 <= TYPE_VECTOR_SUBPARTS (TREE_TYPE (addrtype)))
4153 return fold_build3 (BIT_FIELD_REF, type, TREE_OPERAND (addr, 0),
4157 /* ((foo*)&complexfoo)[1] -> __imag__ complexfoo */
4158 if (TREE_CODE (addr) == ADDR_EXPR
4159 && TREE_CODE (TREE_TYPE (addrtype)) == COMPLEX_TYPE
4160 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (addrtype))))
4162 tree size = TYPE_SIZE_UNIT (type);
4163 if (tree_int_cst_equal (size, off))
4164 return fold_build1 (IMAGPART_EXPR, type, TREE_OPERAND (addr, 0));
4167 /* *(p + CST) -> MEM_REF <p, CST>. */
4168 if (TREE_CODE (addr) != ADDR_EXPR
4169 || DECL_P (TREE_OPERAND (addr, 0)))
4170 return fold_build2 (MEM_REF, type,
4172 build_int_cst_wide (ptype,
4173 TREE_INT_CST_LOW (off),
4174 TREE_INT_CST_HIGH (off)));
4177 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
4178 if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
4179 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (subtype)))) == INTEGER_CST
4180 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (subtype))))
4183 tree min_val = size_zero_node;
4185 sub = gimple_fold_indirect_ref (sub);
4187 sub = build1 (INDIRECT_REF, TREE_TYPE (subtype), osub);
4188 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
4189 if (type_domain && TYPE_MIN_VALUE (type_domain))
4190 min_val = TYPE_MIN_VALUE (type_domain);
4191 if (TREE_CODE (min_val) == INTEGER_CST)
4192 return build4 (ARRAY_REF, type, sub, min_val, NULL_TREE, NULL_TREE);
4198 /* Given a pointer value OP0, return a simplified version of an
4199 indirection through OP0, or NULL_TREE if no simplification is
4200 possible. This may only be applied to a rhs of an expression.
4201 Note that the resulting type may be different from the type pointed
4202 to in the sense that it is still compatible from the langhooks
4206 gimple_fold_indirect_ref_rhs (tree t)
4208 return gimple_fold_indirect_ref (t);
4211 /* Subroutine of gimplify_modify_expr to do simplifications of
4212 MODIFY_EXPRs based on the code of the RHS. We loop for as long as
4213 something changes. */
4215 static enum gimplify_status
4216 gimplify_modify_expr_rhs (tree *expr_p, tree *from_p, tree *to_p,
4217 gimple_seq *pre_p, gimple_seq *post_p,
4220 enum gimplify_status ret = GS_UNHANDLED;
4226 switch (TREE_CODE (*from_p))
4229 /* If we're assigning from a read-only variable initialized with
4230 a constructor, do the direct assignment from the constructor,
4231 but only if neither source nor target are volatile since this
4232 latter assignment might end up being done on a per-field basis. */
4233 if (DECL_INITIAL (*from_p)
4234 && TREE_READONLY (*from_p)
4235 && !TREE_THIS_VOLATILE (*from_p)
4236 && !TREE_THIS_VOLATILE (*to_p)
4237 && TREE_CODE (DECL_INITIAL (*from_p)) == CONSTRUCTOR)
4239 tree old_from = *from_p;
4240 enum gimplify_status subret;
4242 /* Move the constructor into the RHS. */
4243 *from_p = unshare_expr (DECL_INITIAL (*from_p));
4245 /* Let's see if gimplify_init_constructor will need to put
4247 subret = gimplify_init_constructor (expr_p, NULL, NULL,
4249 if (subret == GS_ERROR)
4251 /* If so, revert the change. */
4263 /* If we have code like
4267 where the type of "x" is a (possibly cv-qualified variant
4268 of "A"), treat the entire expression as identical to "x".
4269 This kind of code arises in C++ when an object is bound
4270 to a const reference, and if "x" is a TARGET_EXPR we want
4271 to take advantage of the optimization below. */
4272 bool volatile_p = TREE_THIS_VOLATILE (*from_p);
4273 tree t = gimple_fold_indirect_ref_rhs (TREE_OPERAND (*from_p, 0));
4276 if (TREE_THIS_VOLATILE (t) != volatile_p)
4278 if (TREE_CODE_CLASS (TREE_CODE (t)) == tcc_declaration)
4279 t = build_simple_mem_ref_loc (EXPR_LOCATION (*from_p),
4280 build_fold_addr_expr (t));
4281 if (REFERENCE_CLASS_P (t))
4282 TREE_THIS_VOLATILE (t) = volatile_p;
4293 /* If we are initializing something from a TARGET_EXPR, strip the
4294 TARGET_EXPR and initialize it directly, if possible. This can't
4295 be done if the initializer is void, since that implies that the
4296 temporary is set in some non-trivial way.
4298 ??? What about code that pulls out the temp and uses it
4299 elsewhere? I think that such code never uses the TARGET_EXPR as
4300 an initializer. If I'm wrong, we'll die because the temp won't
4301 have any RTL. In that case, I guess we'll need to replace
4302 references somehow. */
4303 tree init = TARGET_EXPR_INITIAL (*from_p);
4306 && !VOID_TYPE_P (TREE_TYPE (init)))
4316 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
4318 gimplify_compound_expr (from_p, pre_p, true);
4324 /* If we already made some changes, let the front end have a
4325 crack at this before we break it down. */
4326 if (ret != GS_UNHANDLED)
4328 /* If we're initializing from a CONSTRUCTOR, break this into
4329 individual MODIFY_EXPRs. */
4330 return gimplify_init_constructor (expr_p, pre_p, post_p, want_value,
4334 /* If we're assigning to a non-register type, push the assignment
4335 down into the branches. This is mandatory for ADDRESSABLE types,
4336 since we cannot generate temporaries for such, but it saves a
4337 copy in other cases as well. */
4338 if (!is_gimple_reg_type (TREE_TYPE (*from_p)))
4340 /* This code should mirror the code in gimplify_cond_expr. */
4341 enum tree_code code = TREE_CODE (*expr_p);
4342 tree cond = *from_p;
4343 tree result = *to_p;
4345 ret = gimplify_expr (&result, pre_p, post_p,
4346 is_gimple_lvalue, fb_lvalue);
4347 if (ret != GS_ERROR)
4350 if (TREE_TYPE (TREE_OPERAND (cond, 1)) != void_type_node)
4351 TREE_OPERAND (cond, 1)
4352 = build2 (code, void_type_node, result,
4353 TREE_OPERAND (cond, 1));
4354 if (TREE_TYPE (TREE_OPERAND (cond, 2)) != void_type_node)
4355 TREE_OPERAND (cond, 2)
4356 = build2 (code, void_type_node, unshare_expr (result),
4357 TREE_OPERAND (cond, 2));
4359 TREE_TYPE (cond) = void_type_node;
4360 recalculate_side_effects (cond);
4364 gimplify_and_add (cond, pre_p);
4365 *expr_p = unshare_expr (result);
4374 /* For calls that return in memory, give *to_p as the CALL_EXPR's
4375 return slot so that we don't generate a temporary. */
4376 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p)
4377 && aggregate_value_p (*from_p, *from_p))
4381 if (!(rhs_predicate_for (*to_p))(*from_p))
4382 /* If we need a temporary, *to_p isn't accurate. */
4384 /* It's OK to use the return slot directly unless it's an NRV. */
4385 else if (TREE_CODE (*to_p) == RESULT_DECL
4386 && DECL_NAME (*to_p) == NULL_TREE
4387 && needs_to_live_in_memory (*to_p))
4389 else if (is_gimple_reg_type (TREE_TYPE (*to_p))
4390 || (DECL_P (*to_p) && DECL_REGISTER (*to_p)))
4391 /* Don't force regs into memory. */
4393 else if (TREE_CODE (*expr_p) == INIT_EXPR)
4394 /* It's OK to use the target directly if it's being
4397 else if (!is_gimple_non_addressable (*to_p))
4398 /* Don't use the original target if it's already addressable;
4399 if its address escapes, and the called function uses the
4400 NRV optimization, a conforming program could see *to_p
4401 change before the called function returns; see c++/19317.
4402 When optimizing, the return_slot pass marks more functions
4403 as safe after we have escape info. */
4410 CALL_EXPR_RETURN_SLOT_OPT (*from_p) = 1;
4411 mark_addressable (*to_p);
4416 case WITH_SIZE_EXPR:
4417 /* Likewise for calls that return an aggregate of non-constant size,
4418 since we would not be able to generate a temporary at all. */
4419 if (TREE_CODE (TREE_OPERAND (*from_p, 0)) == CALL_EXPR)
4421 *from_p = TREE_OPERAND (*from_p, 0);
4422 /* We don't change ret in this case because the
4423 WITH_SIZE_EXPR might have been added in
4424 gimplify_modify_expr, so returning GS_OK would lead to an
4430 /* If we're initializing from a container, push the initialization
4432 case CLEANUP_POINT_EXPR:
4434 case STATEMENT_LIST:
4436 tree wrap = *from_p;
4439 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_min_lval,
4441 if (ret != GS_ERROR)
4444 t = voidify_wrapper_expr (wrap, *expr_p);
4445 gcc_assert (t == *expr_p);
4449 gimplify_and_add (wrap, pre_p);
4450 *expr_p = unshare_expr (*to_p);
4457 case COMPOUND_LITERAL_EXPR:
4459 tree complit = TREE_OPERAND (*expr_p, 1);
4460 tree decl_s = COMPOUND_LITERAL_EXPR_DECL_EXPR (complit);
4461 tree decl = DECL_EXPR_DECL (decl_s);
4462 tree init = DECL_INITIAL (decl);
4464 /* struct T x = (struct T) { 0, 1, 2 } can be optimized
4465 into struct T x = { 0, 1, 2 } if the address of the
4466 compound literal has never been taken. */
4467 if (!TREE_ADDRESSABLE (complit)
4468 && !TREE_ADDRESSABLE (decl)
4471 *expr_p = copy_node (*expr_p);
4472 TREE_OPERAND (*expr_p, 1) = init;
4486 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
4487 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
4488 DECL_GIMPLE_REG_P set.
4490 IMPORTANT NOTE: This promotion is performed by introducing a load of the
4491 other, unmodified part of the complex object just before the total store.
4492 As a consequence, if the object is still uninitialized, an undefined value
4493 will be loaded into a register, which may result in a spurious exception
4494 if the register is floating-point and the value happens to be a signaling
4495 NaN for example. Then the fully-fledged complex operations lowering pass
4496 followed by a DCE pass are necessary in order to fix things up. */
4498 static enum gimplify_status
4499 gimplify_modify_expr_complex_part (tree *expr_p, gimple_seq *pre_p,
4502 enum tree_code code, ocode;
4503 tree lhs, rhs, new_rhs, other, realpart, imagpart;
4505 lhs = TREE_OPERAND (*expr_p, 0);
4506 rhs = TREE_OPERAND (*expr_p, 1);
4507 code = TREE_CODE (lhs);
4508 lhs = TREE_OPERAND (lhs, 0);
4510 ocode = code == REALPART_EXPR ? IMAGPART_EXPR : REALPART_EXPR;
4511 other = build1 (ocode, TREE_TYPE (rhs), lhs);
4512 TREE_NO_WARNING (other) = 1;
4513 other = get_formal_tmp_var (other, pre_p);
4515 realpart = code == REALPART_EXPR ? rhs : other;
4516 imagpart = code == REALPART_EXPR ? other : rhs;
4518 if (TREE_CONSTANT (realpart) && TREE_CONSTANT (imagpart))
4519 new_rhs = build_complex (TREE_TYPE (lhs), realpart, imagpart);
4521 new_rhs = build2 (COMPLEX_EXPR, TREE_TYPE (lhs), realpart, imagpart);
4523 gimplify_seq_add_stmt (pre_p, gimple_build_assign (lhs, new_rhs));
4524 *expr_p = (want_value) ? rhs : NULL_TREE;
4529 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
4535 PRE_P points to the list where side effects that must happen before
4536 *EXPR_P should be stored.
4538 POST_P points to the list where side effects that must happen after
4539 *EXPR_P should be stored.
4541 WANT_VALUE is nonzero iff we want to use the value of this expression
4542 in another expression. */
4544 static enum gimplify_status
4545 gimplify_modify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
4548 tree *from_p = &TREE_OPERAND (*expr_p, 1);
4549 tree *to_p = &TREE_OPERAND (*expr_p, 0);
4550 enum gimplify_status ret = GS_UNHANDLED;
4552 location_t loc = EXPR_LOCATION (*expr_p);
4554 gcc_assert (TREE_CODE (*expr_p) == MODIFY_EXPR
4555 || TREE_CODE (*expr_p) == INIT_EXPR);
4557 /* Insert pointer conversions required by the middle-end that are not
4558 required by the frontend. This fixes middle-end type checking for
4559 for example gcc.dg/redecl-6.c. */
4560 if (POINTER_TYPE_P (TREE_TYPE (*to_p)))
4562 STRIP_USELESS_TYPE_CONVERSION (*from_p);
4563 if (!useless_type_conversion_p (TREE_TYPE (*to_p), TREE_TYPE (*from_p)))
4564 *from_p = fold_convert_loc (loc, TREE_TYPE (*to_p), *from_p);
4567 /* See if any simplifications can be done based on what the RHS is. */
4568 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
4570 if (ret != GS_UNHANDLED)
4573 /* For zero sized types only gimplify the left hand side and right hand
4574 side as statements and throw away the assignment. Do this after
4575 gimplify_modify_expr_rhs so we handle TARGET_EXPRs of addressable
4577 if (zero_sized_type (TREE_TYPE (*from_p)) && !want_value)
4579 gimplify_stmt (from_p, pre_p);
4580 gimplify_stmt (to_p, pre_p);
4581 *expr_p = NULL_TREE;
4585 /* If the value being copied is of variable width, compute the length
4586 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
4587 before gimplifying any of the operands so that we can resolve any
4588 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
4589 the size of the expression to be copied, not of the destination, so
4590 that is what we must do here. */
4591 maybe_with_size_expr (from_p);
4593 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
4594 if (ret == GS_ERROR)
4597 /* As a special case, we have to temporarily allow for assignments
4598 with a CALL_EXPR on the RHS. Since in GIMPLE a function call is
4599 a toplevel statement, when gimplifying the GENERIC expression
4600 MODIFY_EXPR <a, CALL_EXPR <foo>>, we cannot create the tuple
4601 GIMPLE_ASSIGN <a, GIMPLE_CALL <foo>>.
4603 Instead, we need to create the tuple GIMPLE_CALL <a, foo>. To
4604 prevent gimplify_expr from trying to create a new temporary for
4605 foo's LHS, we tell it that it should only gimplify until it
4606 reaches the CALL_EXPR. On return from gimplify_expr, the newly
4607 created GIMPLE_CALL <foo> will be the last statement in *PRE_P
4608 and all we need to do here is set 'a' to be its LHS. */
4609 ret = gimplify_expr (from_p, pre_p, post_p, rhs_predicate_for (*to_p),
4611 if (ret == GS_ERROR)
4614 /* Now see if the above changed *from_p to something we handle specially. */
4615 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
4617 if (ret != GS_UNHANDLED)
4620 /* If we've got a variable sized assignment between two lvalues (i.e. does
4621 not involve a call), then we can make things a bit more straightforward
4622 by converting the assignment to memcpy or memset. */
4623 if (TREE_CODE (*from_p) == WITH_SIZE_EXPR)
4625 tree from = TREE_OPERAND (*from_p, 0);
4626 tree size = TREE_OPERAND (*from_p, 1);
4628 if (TREE_CODE (from) == CONSTRUCTOR)
4629 return gimplify_modify_expr_to_memset (expr_p, size, want_value, pre_p);
4631 if (is_gimple_addressable (from))
4634 return gimplify_modify_expr_to_memcpy (expr_p, size, want_value,
4639 /* Transform partial stores to non-addressable complex variables into
4640 total stores. This allows us to use real instead of virtual operands
4641 for these variables, which improves optimization. */
4642 if ((TREE_CODE (*to_p) == REALPART_EXPR
4643 || TREE_CODE (*to_p) == IMAGPART_EXPR)
4644 && is_gimple_reg (TREE_OPERAND (*to_p, 0)))
4645 return gimplify_modify_expr_complex_part (expr_p, pre_p, want_value);
4647 /* Try to alleviate the effects of the gimplification creating artificial
4648 temporaries (see for example is_gimple_reg_rhs) on the debug info. */
4649 if (!gimplify_ctxp->into_ssa
4650 && TREE_CODE (*from_p) == VAR_DECL
4651 && DECL_IGNORED_P (*from_p)
4653 && !DECL_IGNORED_P (*to_p))
4655 if (!DECL_NAME (*from_p) && DECL_NAME (*to_p))
4657 = create_tmp_var_name (IDENTIFIER_POINTER (DECL_NAME (*to_p)));
4658 DECL_DEBUG_EXPR_IS_FROM (*from_p) = 1;
4659 SET_DECL_DEBUG_EXPR (*from_p, *to_p);
4662 if (want_value && TREE_THIS_VOLATILE (*to_p))
4663 *from_p = get_initialized_tmp_var (*from_p, pre_p, post_p);
4665 if (TREE_CODE (*from_p) == CALL_EXPR)
4667 /* Since the RHS is a CALL_EXPR, we need to create a GIMPLE_CALL
4668 instead of a GIMPLE_ASSIGN. */
4669 tree fnptrtype = TREE_TYPE (CALL_EXPR_FN (*from_p));
4670 CALL_EXPR_FN (*from_p) = TREE_OPERAND (CALL_EXPR_FN (*from_p), 0);
4671 STRIP_USELESS_TYPE_CONVERSION (CALL_EXPR_FN (*from_p));
4672 assign = gimple_build_call_from_tree (*from_p);
4673 gimple_call_set_fntype (assign, TREE_TYPE (fnptrtype));
4674 if (!gimple_call_noreturn_p (assign))
4675 gimple_call_set_lhs (assign, *to_p);
4679 assign = gimple_build_assign (*to_p, *from_p);
4680 gimple_set_location (assign, EXPR_LOCATION (*expr_p));
4683 gimplify_seq_add_stmt (pre_p, assign);
4685 if (gimplify_ctxp->into_ssa && is_gimple_reg (*to_p))
4687 /* If we've somehow already got an SSA_NAME on the LHS, then
4688 we've probably modified it twice. Not good. */
4689 gcc_assert (TREE_CODE (*to_p) != SSA_NAME);
4690 *to_p = make_ssa_name (*to_p, assign);
4691 gimple_set_lhs (assign, *to_p);
4696 *expr_p = TREE_THIS_VOLATILE (*to_p) ? *from_p : unshare_expr (*to_p);
4705 /* Gimplify a comparison between two variable-sized objects. Do this
4706 with a call to BUILT_IN_MEMCMP. */
4708 static enum gimplify_status
4709 gimplify_variable_sized_compare (tree *expr_p)
4711 location_t loc = EXPR_LOCATION (*expr_p);
4712 tree op0 = TREE_OPERAND (*expr_p, 0);
4713 tree op1 = TREE_OPERAND (*expr_p, 1);
4714 tree t, arg, dest, src, expr;
4716 arg = TYPE_SIZE_UNIT (TREE_TYPE (op0));
4717 arg = unshare_expr (arg);
4718 arg = SUBSTITUTE_PLACEHOLDER_IN_EXPR (arg, op0);
4719 src = build_fold_addr_expr_loc (loc, op1);
4720 dest = build_fold_addr_expr_loc (loc, op0);
4721 t = builtin_decl_implicit (BUILT_IN_MEMCMP);
4722 t = build_call_expr_loc (loc, t, 3, dest, src, arg);
4725 = build2 (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), t, integer_zero_node);
4726 SET_EXPR_LOCATION (expr, loc);
4732 /* Gimplify a comparison between two aggregate objects of integral scalar
4733 mode as a comparison between the bitwise equivalent scalar values. */
4735 static enum gimplify_status
4736 gimplify_scalar_mode_aggregate_compare (tree *expr_p)
4738 location_t loc = EXPR_LOCATION (*expr_p);
4739 tree op0 = TREE_OPERAND (*expr_p, 0);
4740 tree op1 = TREE_OPERAND (*expr_p, 1);
4742 tree type = TREE_TYPE (op0);
4743 tree scalar_type = lang_hooks.types.type_for_mode (TYPE_MODE (type), 1);
4745 op0 = fold_build1_loc (loc, VIEW_CONVERT_EXPR, scalar_type, op0);
4746 op1 = fold_build1_loc (loc, VIEW_CONVERT_EXPR, scalar_type, op1);
4749 = fold_build2_loc (loc, TREE_CODE (*expr_p), TREE_TYPE (*expr_p), op0, op1);
4754 /* Gimplify an expression sequence. This function gimplifies each
4755 expression and rewrites the original expression with the last
4756 expression of the sequence in GIMPLE form.
4758 PRE_P points to the list where the side effects for all the
4759 expressions in the sequence will be emitted.
4761 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
4763 static enum gimplify_status
4764 gimplify_compound_expr (tree *expr_p, gimple_seq *pre_p, bool want_value)
4770 tree *sub_p = &TREE_OPERAND (t, 0);
4772 if (TREE_CODE (*sub_p) == COMPOUND_EXPR)
4773 gimplify_compound_expr (sub_p, pre_p, false);
4775 gimplify_stmt (sub_p, pre_p);
4777 t = TREE_OPERAND (t, 1);
4779 while (TREE_CODE (t) == COMPOUND_EXPR);
4786 gimplify_stmt (expr_p, pre_p);
4791 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
4792 gimplify. After gimplification, EXPR_P will point to a new temporary
4793 that holds the original value of the SAVE_EXPR node.
4795 PRE_P points to the list where side effects that must happen before
4796 *EXPR_P should be stored. */
4798 static enum gimplify_status
4799 gimplify_save_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4801 enum gimplify_status ret = GS_ALL_DONE;
4804 gcc_assert (TREE_CODE (*expr_p) == SAVE_EXPR);
4805 val = TREE_OPERAND (*expr_p, 0);
4807 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
4808 if (!SAVE_EXPR_RESOLVED_P (*expr_p))
4810 /* The operand may be a void-valued expression such as SAVE_EXPRs
4811 generated by the Java frontend for class initialization. It is
4812 being executed only for its side-effects. */
4813 if (TREE_TYPE (val) == void_type_node)
4815 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
4816 is_gimple_stmt, fb_none);
4820 val = get_initialized_tmp_var (val, pre_p, post_p);
4822 TREE_OPERAND (*expr_p, 0) = val;
4823 SAVE_EXPR_RESOLVED_P (*expr_p) = 1;
4831 /* Rewrite the ADDR_EXPR node pointed to by EXPR_P
4838 PRE_P points to the list where side effects that must happen before
4839 *EXPR_P should be stored.
4841 POST_P points to the list where side effects that must happen after
4842 *EXPR_P should be stored. */
4844 static enum gimplify_status
4845 gimplify_addr_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4847 tree expr = *expr_p;
4848 tree op0 = TREE_OPERAND (expr, 0);
4849 enum gimplify_status ret;
4850 location_t loc = EXPR_LOCATION (*expr_p);
4852 switch (TREE_CODE (op0))
4856 /* Check if we are dealing with an expression of the form '&*ptr'.
4857 While the front end folds away '&*ptr' into 'ptr', these
4858 expressions may be generated internally by the compiler (e.g.,
4859 builtins like __builtin_va_end). */
4860 /* Caution: the silent array decomposition semantics we allow for
4861 ADDR_EXPR means we can't always discard the pair. */
4862 /* Gimplification of the ADDR_EXPR operand may drop
4863 cv-qualification conversions, so make sure we add them if
4866 tree op00 = TREE_OPERAND (op0, 0);
4867 tree t_expr = TREE_TYPE (expr);
4868 tree t_op00 = TREE_TYPE (op00);
4870 if (!useless_type_conversion_p (t_expr, t_op00))
4871 op00 = fold_convert_loc (loc, TREE_TYPE (expr), op00);
4877 case VIEW_CONVERT_EXPR:
4878 /* Take the address of our operand and then convert it to the type of
4881 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
4882 all clear. The impact of this transformation is even less clear. */
4884 /* If the operand is a useless conversion, look through it. Doing so
4885 guarantees that the ADDR_EXPR and its operand will remain of the
4887 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0, 0)))
4888 op0 = TREE_OPERAND (op0, 0);
4890 *expr_p = fold_convert_loc (loc, TREE_TYPE (expr),
4891 build_fold_addr_expr_loc (loc,
4892 TREE_OPERAND (op0, 0)));
4897 /* We use fb_either here because the C frontend sometimes takes
4898 the address of a call that returns a struct; see
4899 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
4900 the implied temporary explicit. */
4902 /* Make the operand addressable. */
4903 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, post_p,
4904 is_gimple_addressable, fb_either);
4905 if (ret == GS_ERROR)
4908 /* Then mark it. Beware that it may not be possible to do so directly
4909 if a temporary has been created by the gimplification. */
4910 prepare_gimple_addressable (&TREE_OPERAND (expr, 0), pre_p);
4912 op0 = TREE_OPERAND (expr, 0);
4914 /* For various reasons, the gimplification of the expression
4915 may have made a new INDIRECT_REF. */
4916 if (TREE_CODE (op0) == INDIRECT_REF)
4917 goto do_indirect_ref;
4919 mark_addressable (TREE_OPERAND (expr, 0));
4921 /* The FEs may end up building ADDR_EXPRs early on a decl with
4922 an incomplete type. Re-build ADDR_EXPRs in canonical form
4924 if (!types_compatible_p (TREE_TYPE (op0), TREE_TYPE (TREE_TYPE (expr))))
4925 *expr_p = build_fold_addr_expr (op0);
4927 /* Make sure TREE_CONSTANT and TREE_SIDE_EFFECTS are set properly. */
4928 recompute_tree_invariant_for_addr_expr (*expr_p);
4930 /* If we re-built the ADDR_EXPR add a conversion to the original type
4932 if (!useless_type_conversion_p (TREE_TYPE (expr), TREE_TYPE (*expr_p)))
4933 *expr_p = fold_convert (TREE_TYPE (expr), *expr_p);
4941 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
4942 value; output operands should be a gimple lvalue. */
4944 static enum gimplify_status
4945 gimplify_asm_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4949 const char **oconstraints;
4952 const char *constraint;
4953 bool allows_mem, allows_reg, is_inout;
4954 enum gimplify_status ret, tret;
4956 VEC(tree, gc) *inputs;
4957 VEC(tree, gc) *outputs;
4958 VEC(tree, gc) *clobbers;
4959 VEC(tree, gc) *labels;
4963 noutputs = list_length (ASM_OUTPUTS (expr));
4964 oconstraints = (const char **) alloca ((noutputs) * sizeof (const char *));
4966 inputs = outputs = clobbers = labels = NULL;
4969 link_next = NULL_TREE;
4970 for (i = 0, link = ASM_OUTPUTS (expr); link; ++i, link = link_next)
4973 size_t constraint_len;
4975 link_next = TREE_CHAIN (link);
4979 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4980 constraint_len = strlen (constraint);
4981 if (constraint_len == 0)
4984 ok = parse_output_constraint (&constraint, i, 0, 0,
4985 &allows_mem, &allows_reg, &is_inout);
4992 if (!allows_reg && allows_mem)
4993 mark_addressable (TREE_VALUE (link));
4995 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4996 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
4997 fb_lvalue | fb_mayfail);
4998 if (tret == GS_ERROR)
5000 error ("invalid lvalue in asm output %d", i);
5004 VEC_safe_push (tree, gc, outputs, link);
5005 TREE_CHAIN (link) = NULL_TREE;
5009 /* An input/output operand. To give the optimizers more
5010 flexibility, split it into separate input and output
5015 /* Turn the in/out constraint into an output constraint. */
5016 char *p = xstrdup (constraint);
5018 TREE_VALUE (TREE_PURPOSE (link)) = build_string (constraint_len, p);
5020 /* And add a matching input constraint. */
5023 sprintf (buf, "%d", i);
5025 /* If there are multiple alternatives in the constraint,
5026 handle each of them individually. Those that allow register
5027 will be replaced with operand number, the others will stay
5029 if (strchr (p, ',') != NULL)
5031 size_t len = 0, buflen = strlen (buf);
5032 char *beg, *end, *str, *dst;
5036 end = strchr (beg, ',');
5038 end = strchr (beg, '\0');
5039 if ((size_t) (end - beg) < buflen)
5042 len += end - beg + 1;
5049 str = (char *) alloca (len);
5050 for (beg = p + 1, dst = str;;)
5053 bool mem_p, reg_p, inout_p;
5055 end = strchr (beg, ',');
5060 parse_output_constraint (&tem, i, 0, 0,
5061 &mem_p, ®_p, &inout_p);
5066 memcpy (dst, buf, buflen);
5075 memcpy (dst, beg, len);
5084 input = build_string (dst - str, str);
5087 input = build_string (strlen (buf), buf);
5090 input = build_string (constraint_len - 1, constraint + 1);
5094 input = build_tree_list (build_tree_list (NULL_TREE, input),
5095 unshare_expr (TREE_VALUE (link)));
5096 ASM_INPUTS (expr) = chainon (ASM_INPUTS (expr), input);
5100 link_next = NULL_TREE;
5101 for (link = ASM_INPUTS (expr); link; ++i, link = link_next)
5103 link_next = TREE_CHAIN (link);
5104 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
5105 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
5106 oconstraints, &allows_mem, &allows_reg);
5108 /* If we can't make copies, we can only accept memory. */
5109 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (link))))
5115 error ("impossible constraint in %<asm%>");
5116 error ("non-memory input %d must stay in memory", i);
5121 /* If the operand is a memory input, it should be an lvalue. */
5122 if (!allows_reg && allows_mem)
5124 tree inputv = TREE_VALUE (link);
5125 STRIP_NOPS (inputv);
5126 if (TREE_CODE (inputv) == PREDECREMENT_EXPR
5127 || TREE_CODE (inputv) == PREINCREMENT_EXPR
5128 || TREE_CODE (inputv) == POSTDECREMENT_EXPR
5129 || TREE_CODE (inputv) == POSTINCREMENT_EXPR)
5130 TREE_VALUE (link) = error_mark_node;
5131 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
5132 is_gimple_lvalue, fb_lvalue | fb_mayfail);
5133 mark_addressable (TREE_VALUE (link));
5134 if (tret == GS_ERROR)
5136 if (EXPR_HAS_LOCATION (TREE_VALUE (link)))
5137 input_location = EXPR_LOCATION (TREE_VALUE (link));
5138 error ("memory input %d is not directly addressable", i);
5144 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
5145 is_gimple_asm_val, fb_rvalue);
5146 if (tret == GS_ERROR)
5150 TREE_CHAIN (link) = NULL_TREE;
5151 VEC_safe_push (tree, gc, inputs, link);
5154 for (link = ASM_CLOBBERS (expr); link; ++i, link = TREE_CHAIN (link))
5155 VEC_safe_push (tree, gc, clobbers, link);
5157 for (link = ASM_LABELS (expr); link; ++i, link = TREE_CHAIN (link))
5158 VEC_safe_push (tree, gc, labels, link);
5160 /* Do not add ASMs with errors to the gimple IL stream. */
5161 if (ret != GS_ERROR)
5163 stmt = gimple_build_asm_vec (TREE_STRING_POINTER (ASM_STRING (expr)),
5164 inputs, outputs, clobbers, labels);
5166 gimple_asm_set_volatile (stmt, ASM_VOLATILE_P (expr));
5167 gimple_asm_set_input (stmt, ASM_INPUT_P (expr));
5169 gimplify_seq_add_stmt (pre_p, stmt);
5175 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
5176 GIMPLE_WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
5177 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
5178 return to this function.
5180 FIXME should we complexify the prequeue handling instead? Or use flags
5181 for all the cleanups and let the optimizer tighten them up? The current
5182 code seems pretty fragile; it will break on a cleanup within any
5183 non-conditional nesting. But any such nesting would be broken, anyway;
5184 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
5185 and continues out of it. We can do that at the RTL level, though, so
5186 having an optimizer to tighten up try/finally regions would be a Good
5189 static enum gimplify_status
5190 gimplify_cleanup_point_expr (tree *expr_p, gimple_seq *pre_p)
5192 gimple_stmt_iterator iter;
5193 gimple_seq body_sequence = NULL;
5195 tree temp = voidify_wrapper_expr (*expr_p, NULL);
5197 /* We only care about the number of conditions between the innermost
5198 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
5199 any cleanups collected outside the CLEANUP_POINT_EXPR. */
5200 int old_conds = gimplify_ctxp->conditions;
5201 gimple_seq old_cleanups = gimplify_ctxp->conditional_cleanups;
5202 gimplify_ctxp->conditions = 0;
5203 gimplify_ctxp->conditional_cleanups = NULL;
5205 gimplify_stmt (&TREE_OPERAND (*expr_p, 0), &body_sequence);
5207 gimplify_ctxp->conditions = old_conds;
5208 gimplify_ctxp->conditional_cleanups = old_cleanups;
5210 for (iter = gsi_start (body_sequence); !gsi_end_p (iter); )
5212 gimple wce = gsi_stmt (iter);
5214 if (gimple_code (wce) == GIMPLE_WITH_CLEANUP_EXPR)
5216 if (gsi_one_before_end_p (iter))
5218 /* Note that gsi_insert_seq_before and gsi_remove do not
5219 scan operands, unlike some other sequence mutators. */
5220 if (!gimple_wce_cleanup_eh_only (wce))
5221 gsi_insert_seq_before_without_update (&iter,
5222 gimple_wce_cleanup (wce),
5224 gsi_remove (&iter, true);
5231 enum gimple_try_flags kind;
5233 if (gimple_wce_cleanup_eh_only (wce))
5234 kind = GIMPLE_TRY_CATCH;
5236 kind = GIMPLE_TRY_FINALLY;
5237 seq = gsi_split_seq_after (iter);
5239 gtry = gimple_build_try (seq, gimple_wce_cleanup (wce), kind);
5240 /* Do not use gsi_replace here, as it may scan operands.
5241 We want to do a simple structural modification only. */
5242 *gsi_stmt_ptr (&iter) = gtry;
5243 iter = gsi_start (seq);
5250 gimplify_seq_add_seq (pre_p, body_sequence);
5263 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
5264 is the cleanup action required. EH_ONLY is true if the cleanup should
5265 only be executed if an exception is thrown, not on normal exit. */
5268 gimple_push_cleanup (tree var, tree cleanup, bool eh_only, gimple_seq *pre_p)
5271 gimple_seq cleanup_stmts = NULL;
5273 /* Errors can result in improperly nested cleanups. Which results in
5274 confusion when trying to resolve the GIMPLE_WITH_CLEANUP_EXPR. */
5278 if (gimple_conditional_context ())
5280 /* If we're in a conditional context, this is more complex. We only
5281 want to run the cleanup if we actually ran the initialization that
5282 necessitates it, but we want to run it after the end of the
5283 conditional context. So we wrap the try/finally around the
5284 condition and use a flag to determine whether or not to actually
5285 run the destructor. Thus
5289 becomes (approximately)
5293 if (test) { A::A(temp); flag = 1; val = f(temp); }
5296 if (flag) A::~A(temp);
5300 tree flag = create_tmp_var (boolean_type_node, "cleanup");
5301 gimple ffalse = gimple_build_assign (flag, boolean_false_node);
5302 gimple ftrue = gimple_build_assign (flag, boolean_true_node);
5304 cleanup = build3 (COND_EXPR, void_type_node, flag, cleanup, NULL);
5305 gimplify_stmt (&cleanup, &cleanup_stmts);
5306 wce = gimple_build_wce (cleanup_stmts);
5308 gimplify_seq_add_stmt (&gimplify_ctxp->conditional_cleanups, ffalse);
5309 gimplify_seq_add_stmt (&gimplify_ctxp->conditional_cleanups, wce);
5310 gimplify_seq_add_stmt (pre_p, ftrue);
5312 /* Because of this manipulation, and the EH edges that jump
5313 threading cannot redirect, the temporary (VAR) will appear
5314 to be used uninitialized. Don't warn. */
5315 TREE_NO_WARNING (var) = 1;
5319 gimplify_stmt (&cleanup, &cleanup_stmts);
5320 wce = gimple_build_wce (cleanup_stmts);
5321 gimple_wce_set_cleanup_eh_only (wce, eh_only);
5322 gimplify_seq_add_stmt (pre_p, wce);
5326 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
5328 static enum gimplify_status
5329 gimplify_target_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
5331 tree targ = *expr_p;
5332 tree temp = TARGET_EXPR_SLOT (targ);
5333 tree init = TARGET_EXPR_INITIAL (targ);
5334 enum gimplify_status ret;
5338 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
5339 to the temps list. Handle also variable length TARGET_EXPRs. */
5340 if (TREE_CODE (DECL_SIZE (temp)) != INTEGER_CST)
5342 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (temp)))
5343 gimplify_type_sizes (TREE_TYPE (temp), pre_p);
5344 gimplify_vla_decl (temp, pre_p);
5347 gimple_add_tmp_var (temp);
5349 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
5350 expression is supposed to initialize the slot. */
5351 if (VOID_TYPE_P (TREE_TYPE (init)))
5352 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
5355 tree init_expr = build2 (INIT_EXPR, void_type_node, temp, init);
5357 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
5359 ggc_free (init_expr);
5361 if (ret == GS_ERROR)
5363 /* PR c++/28266 Make sure this is expanded only once. */
5364 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
5368 gimplify_and_add (init, pre_p);
5370 /* If needed, push the cleanup for the temp. */
5371 if (TARGET_EXPR_CLEANUP (targ))
5372 gimple_push_cleanup (temp, TARGET_EXPR_CLEANUP (targ),
5373 CLEANUP_EH_ONLY (targ), pre_p);
5375 /* Only expand this once. */
5376 TREE_OPERAND (targ, 3) = init;
5377 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
5380 /* We should have expanded this before. */
5381 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp));
5387 /* Gimplification of expression trees. */
5389 /* Gimplify an expression which appears at statement context. The
5390 corresponding GIMPLE statements are added to *SEQ_P. If *SEQ_P is
5391 NULL, a new sequence is allocated.
5393 Return true if we actually added a statement to the queue. */
5396 gimplify_stmt (tree *stmt_p, gimple_seq *seq_p)
5398 gimple_seq_node last;
5401 *seq_p = gimple_seq_alloc ();
5403 last = gimple_seq_last (*seq_p);
5404 gimplify_expr (stmt_p, seq_p, NULL, is_gimple_stmt, fb_none);
5405 return last != gimple_seq_last (*seq_p);
5408 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
5409 to CTX. If entries already exist, force them to be some flavor of private.
5410 If there is no enclosing parallel, do nothing. */
5413 omp_firstprivatize_variable (struct gimplify_omp_ctx *ctx, tree decl)
5417 if (decl == NULL || !DECL_P (decl))
5422 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5425 if (n->value & GOVD_SHARED)
5426 n->value = GOVD_FIRSTPRIVATE | (n->value & GOVD_SEEN);
5430 else if (ctx->region_type != ORT_WORKSHARE)
5431 omp_add_variable (ctx, decl, GOVD_FIRSTPRIVATE);
5433 ctx = ctx->outer_context;
5438 /* Similarly for each of the type sizes of TYPE. */
5441 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx *ctx, tree type)
5443 if (type == NULL || type == error_mark_node)
5445 type = TYPE_MAIN_VARIANT (type);
5447 if (pointer_set_insert (ctx->privatized_types, type))
5450 switch (TREE_CODE (type))
5456 case FIXED_POINT_TYPE:
5457 omp_firstprivatize_variable (ctx, TYPE_MIN_VALUE (type));
5458 omp_firstprivatize_variable (ctx, TYPE_MAX_VALUE (type));
5462 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
5463 omp_firstprivatize_type_sizes (ctx, TYPE_DOMAIN (type));
5468 case QUAL_UNION_TYPE:
5471 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
5472 if (TREE_CODE (field) == FIELD_DECL)
5474 omp_firstprivatize_variable (ctx, DECL_FIELD_OFFSET (field));
5475 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (field));
5481 case REFERENCE_TYPE:
5482 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
5489 omp_firstprivatize_variable (ctx, TYPE_SIZE (type));
5490 omp_firstprivatize_variable (ctx, TYPE_SIZE_UNIT (type));
5491 lang_hooks.types.omp_firstprivatize_type_sizes (ctx, type);
5494 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
5497 omp_add_variable (struct gimplify_omp_ctx *ctx, tree decl, unsigned int flags)
5500 unsigned int nflags;
5503 if (error_operand_p (decl))
5506 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
5507 there are constructors involved somewhere. */
5508 if (TREE_ADDRESSABLE (TREE_TYPE (decl))
5509 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
5512 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5515 /* We shouldn't be re-adding the decl with the same data
5517 gcc_assert ((n->value & GOVD_DATA_SHARE_CLASS & flags) == 0);
5518 /* The only combination of data sharing classes we should see is
5519 FIRSTPRIVATE and LASTPRIVATE. */
5520 nflags = n->value | flags;
5521 gcc_assert ((nflags & GOVD_DATA_SHARE_CLASS)
5522 == (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE));
5527 /* When adding a variable-sized variable, we have to handle all sorts
5528 of additional bits of data: the pointer replacement variable, and
5529 the parameters of the type. */
5530 if (DECL_SIZE (decl) && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
5532 /* Add the pointer replacement variable as PRIVATE if the variable
5533 replacement is private, else FIRSTPRIVATE since we'll need the
5534 address of the original variable either for SHARED, or for the
5535 copy into or out of the context. */
5536 if (!(flags & GOVD_LOCAL))
5538 nflags = flags & GOVD_PRIVATE ? GOVD_PRIVATE : GOVD_FIRSTPRIVATE;
5539 nflags |= flags & GOVD_SEEN;
5540 t = DECL_VALUE_EXPR (decl);
5541 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
5542 t = TREE_OPERAND (t, 0);
5543 gcc_assert (DECL_P (t));
5544 omp_add_variable (ctx, t, nflags);
5547 /* Add all of the variable and type parameters (which should have
5548 been gimplified to a formal temporary) as FIRSTPRIVATE. */
5549 omp_firstprivatize_variable (ctx, DECL_SIZE_UNIT (decl));
5550 omp_firstprivatize_variable (ctx, DECL_SIZE (decl));
5551 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
5553 /* The variable-sized variable itself is never SHARED, only some form
5554 of PRIVATE. The sharing would take place via the pointer variable
5555 which we remapped above. */
5556 if (flags & GOVD_SHARED)
5557 flags = GOVD_PRIVATE | GOVD_DEBUG_PRIVATE
5558 | (flags & (GOVD_SEEN | GOVD_EXPLICIT));
5560 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
5561 alloca statement we generate for the variable, so make sure it
5562 is available. This isn't automatically needed for the SHARED
5563 case, since we won't be allocating local storage then.
5564 For local variables TYPE_SIZE_UNIT might not be gimplified yet,
5565 in this case omp_notice_variable will be called later
5566 on when it is gimplified. */
5567 else if (! (flags & GOVD_LOCAL)
5568 && DECL_P (TYPE_SIZE_UNIT (TREE_TYPE (decl))))
5569 omp_notice_variable (ctx, TYPE_SIZE_UNIT (TREE_TYPE (decl)), true);
5571 else if (lang_hooks.decls.omp_privatize_by_reference (decl))
5573 gcc_assert ((flags & GOVD_LOCAL) == 0);
5574 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
5576 /* Similar to the direct variable sized case above, we'll need the
5577 size of references being privatized. */
5578 if ((flags & GOVD_SHARED) == 0)
5580 t = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl)));
5581 if (TREE_CODE (t) != INTEGER_CST)
5582 omp_notice_variable (ctx, t, true);
5586 splay_tree_insert (ctx->variables, (splay_tree_key)decl, flags);
5589 /* Notice a threadprivate variable DECL used in OpenMP context CTX.
5590 This just prints out diagnostics about threadprivate variable uses
5591 in untied tasks. If DECL2 is non-NULL, prevent this warning
5592 on that variable. */
5595 omp_notice_threadprivate_variable (struct gimplify_omp_ctx *ctx, tree decl,
5600 if (ctx->region_type != ORT_UNTIED_TASK)
5602 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5605 error ("threadprivate variable %qE used in untied task",
5607 error_at (ctx->location, "enclosing task");
5608 splay_tree_insert (ctx->variables, (splay_tree_key)decl, 0);
5611 splay_tree_insert (ctx->variables, (splay_tree_key)decl2, 0);
5615 /* Record the fact that DECL was used within the OpenMP context CTX.
5616 IN_CODE is true when real code uses DECL, and false when we should
5617 merely emit default(none) errors. Return true if DECL is going to
5618 be remapped and thus DECL shouldn't be gimplified into its
5619 DECL_VALUE_EXPR (if any). */
5622 omp_notice_variable (struct gimplify_omp_ctx *ctx, tree decl, bool in_code)
5625 unsigned flags = in_code ? GOVD_SEEN : 0;
5626 bool ret = false, shared;
5628 if (error_operand_p (decl))
5631 /* Threadprivate variables are predetermined. */
5632 if (is_global_var (decl))
5634 if (DECL_THREAD_LOCAL_P (decl))
5635 return omp_notice_threadprivate_variable (ctx, decl, NULL_TREE);
5637 if (DECL_HAS_VALUE_EXPR_P (decl))
5639 tree value = get_base_address (DECL_VALUE_EXPR (decl));
5641 if (value && DECL_P (value) && DECL_THREAD_LOCAL_P (value))
5642 return omp_notice_threadprivate_variable (ctx, decl, value);
5646 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5649 enum omp_clause_default_kind default_kind, kind;
5650 struct gimplify_omp_ctx *octx;
5652 if (ctx->region_type == ORT_WORKSHARE)
5655 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
5656 remapped firstprivate instead of shared. To some extent this is
5657 addressed in omp_firstprivatize_type_sizes, but not effectively. */
5658 default_kind = ctx->default_kind;
5659 kind = lang_hooks.decls.omp_predetermined_sharing (decl);
5660 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
5661 default_kind = kind;
5663 switch (default_kind)
5665 case OMP_CLAUSE_DEFAULT_NONE:
5666 error ("%qE not specified in enclosing parallel",
5667 DECL_NAME (lang_hooks.decls.omp_report_decl (decl)));
5668 if ((ctx->region_type & ORT_TASK) != 0)
5669 error_at (ctx->location, "enclosing task");
5671 error_at (ctx->location, "enclosing parallel");
5673 case OMP_CLAUSE_DEFAULT_SHARED:
5674 flags |= GOVD_SHARED;
5676 case OMP_CLAUSE_DEFAULT_PRIVATE:
5677 flags |= GOVD_PRIVATE;
5679 case OMP_CLAUSE_DEFAULT_FIRSTPRIVATE:
5680 flags |= GOVD_FIRSTPRIVATE;
5682 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
5683 /* decl will be either GOVD_FIRSTPRIVATE or GOVD_SHARED. */
5684 gcc_assert ((ctx->region_type & ORT_TASK) != 0);
5685 if (ctx->outer_context)
5686 omp_notice_variable (ctx->outer_context, decl, in_code);
5687 for (octx = ctx->outer_context; octx; octx = octx->outer_context)
5691 n2 = splay_tree_lookup (octx->variables, (splay_tree_key) decl);
5692 if (n2 && (n2->value & GOVD_DATA_SHARE_CLASS) != GOVD_SHARED)
5694 flags |= GOVD_FIRSTPRIVATE;
5697 if ((octx->region_type & ORT_PARALLEL) != 0)
5700 if (flags & GOVD_FIRSTPRIVATE)
5703 && (TREE_CODE (decl) == PARM_DECL
5704 || (!is_global_var (decl)
5705 && DECL_CONTEXT (decl) == current_function_decl)))
5707 flags |= GOVD_FIRSTPRIVATE;
5710 flags |= GOVD_SHARED;
5716 if ((flags & GOVD_PRIVATE)
5717 && lang_hooks.decls.omp_private_outer_ref (decl))
5718 flags |= GOVD_PRIVATE_OUTER_REF;
5720 omp_add_variable (ctx, decl, flags);
5722 shared = (flags & GOVD_SHARED) != 0;
5723 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
5727 if ((n->value & (GOVD_SEEN | GOVD_LOCAL)) == 0
5728 && (flags & (GOVD_SEEN | GOVD_LOCAL)) == GOVD_SEEN
5730 && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
5733 tree t = DECL_VALUE_EXPR (decl);
5734 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
5735 t = TREE_OPERAND (t, 0);
5736 gcc_assert (DECL_P (t));
5737 n2 = splay_tree_lookup (ctx->variables, (splay_tree_key) t);
5738 n2->value |= GOVD_SEEN;
5741 shared = ((flags | n->value) & GOVD_SHARED) != 0;
5742 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
5744 /* If nothing changed, there's nothing left to do. */
5745 if ((n->value & flags) == flags)
5751 /* If the variable is private in the current context, then we don't
5752 need to propagate anything to an outer context. */
5753 if ((flags & GOVD_PRIVATE) && !(flags & GOVD_PRIVATE_OUTER_REF))
5755 if (ctx->outer_context
5756 && omp_notice_variable (ctx->outer_context, decl, in_code))
5761 /* Verify that DECL is private within CTX. If there's specific information
5762 to the contrary in the innermost scope, generate an error. */
5765 omp_is_private (struct gimplify_omp_ctx *ctx, tree decl)
5769 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5772 if (n->value & GOVD_SHARED)
5774 if (ctx == gimplify_omp_ctxp)
5776 error ("iteration variable %qE should be private",
5778 n->value = GOVD_PRIVATE;
5784 else if ((n->value & GOVD_EXPLICIT) != 0
5785 && (ctx == gimplify_omp_ctxp
5786 || (ctx->region_type == ORT_COMBINED_PARALLEL
5787 && gimplify_omp_ctxp->outer_context == ctx)))
5789 if ((n->value & GOVD_FIRSTPRIVATE) != 0)
5790 error ("iteration variable %qE should not be firstprivate",
5792 else if ((n->value & GOVD_REDUCTION) != 0)
5793 error ("iteration variable %qE should not be reduction",
5796 return (ctx == gimplify_omp_ctxp
5797 || (ctx->region_type == ORT_COMBINED_PARALLEL
5798 && gimplify_omp_ctxp->outer_context == ctx));
5801 if (ctx->region_type != ORT_WORKSHARE)
5803 else if (ctx->outer_context)
5804 return omp_is_private (ctx->outer_context, decl);
5808 /* Return true if DECL is private within a parallel region
5809 that binds to the current construct's context or in parallel
5810 region's REDUCTION clause. */
5813 omp_check_private (struct gimplify_omp_ctx *ctx, tree decl)
5819 ctx = ctx->outer_context;
5821 return !(is_global_var (decl)
5822 /* References might be private, but might be shared too. */
5823 || lang_hooks.decls.omp_privatize_by_reference (decl));
5825 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5827 return (n->value & GOVD_SHARED) == 0;
5829 while (ctx->region_type == ORT_WORKSHARE);
5833 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
5834 and previous omp contexts. */
5837 gimplify_scan_omp_clauses (tree *list_p, gimple_seq *pre_p,
5838 enum omp_region_type region_type)
5840 struct gimplify_omp_ctx *ctx, *outer_ctx;
5841 struct gimplify_ctx gctx;
5844 ctx = new_omp_context (region_type);
5845 outer_ctx = ctx->outer_context;
5847 while ((c = *list_p) != NULL)
5849 bool remove = false;
5850 bool notice_outer = true;
5851 const char *check_non_private = NULL;
5855 switch (OMP_CLAUSE_CODE (c))
5857 case OMP_CLAUSE_PRIVATE:
5858 flags = GOVD_PRIVATE | GOVD_EXPLICIT;
5859 if (lang_hooks.decls.omp_private_outer_ref (OMP_CLAUSE_DECL (c)))
5861 flags |= GOVD_PRIVATE_OUTER_REF;
5862 OMP_CLAUSE_PRIVATE_OUTER_REF (c) = 1;
5865 notice_outer = false;
5867 case OMP_CLAUSE_SHARED:
5868 flags = GOVD_SHARED | GOVD_EXPLICIT;
5870 case OMP_CLAUSE_FIRSTPRIVATE:
5871 flags = GOVD_FIRSTPRIVATE | GOVD_EXPLICIT;
5872 check_non_private = "firstprivate";
5874 case OMP_CLAUSE_LASTPRIVATE:
5875 flags = GOVD_LASTPRIVATE | GOVD_SEEN | GOVD_EXPLICIT;
5876 check_non_private = "lastprivate";
5878 case OMP_CLAUSE_REDUCTION:
5879 flags = GOVD_REDUCTION | GOVD_SEEN | GOVD_EXPLICIT;
5880 check_non_private = "reduction";
5884 decl = OMP_CLAUSE_DECL (c);
5885 if (error_operand_p (decl))
5890 omp_add_variable (ctx, decl, flags);
5891 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION
5892 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c))
5894 omp_add_variable (ctx, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c),
5895 GOVD_LOCAL | GOVD_SEEN);
5896 gimplify_omp_ctxp = ctx;
5897 push_gimplify_context (&gctx);
5899 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c) = gimple_seq_alloc ();
5900 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c) = gimple_seq_alloc ();
5902 gimplify_and_add (OMP_CLAUSE_REDUCTION_INIT (c),
5903 &OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c));
5904 pop_gimplify_context
5905 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c)));
5906 push_gimplify_context (&gctx);
5907 gimplify_and_add (OMP_CLAUSE_REDUCTION_MERGE (c),
5908 &OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c));
5909 pop_gimplify_context
5910 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c)));
5911 OMP_CLAUSE_REDUCTION_INIT (c) = NULL_TREE;
5912 OMP_CLAUSE_REDUCTION_MERGE (c) = NULL_TREE;
5914 gimplify_omp_ctxp = outer_ctx;
5916 else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
5917 && OMP_CLAUSE_LASTPRIVATE_STMT (c))
5919 gimplify_omp_ctxp = ctx;
5920 push_gimplify_context (&gctx);
5921 if (TREE_CODE (OMP_CLAUSE_LASTPRIVATE_STMT (c)) != BIND_EXPR)
5923 tree bind = build3 (BIND_EXPR, void_type_node, NULL,
5925 TREE_SIDE_EFFECTS (bind) = 1;
5926 BIND_EXPR_BODY (bind) = OMP_CLAUSE_LASTPRIVATE_STMT (c);
5927 OMP_CLAUSE_LASTPRIVATE_STMT (c) = bind;
5929 gimplify_and_add (OMP_CLAUSE_LASTPRIVATE_STMT (c),
5930 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c));
5931 pop_gimplify_context
5932 (gimple_seq_first_stmt (OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c)));
5933 OMP_CLAUSE_LASTPRIVATE_STMT (c) = NULL_TREE;
5935 gimplify_omp_ctxp = outer_ctx;
5941 case OMP_CLAUSE_COPYIN:
5942 case OMP_CLAUSE_COPYPRIVATE:
5943 decl = OMP_CLAUSE_DECL (c);
5944 if (error_operand_p (decl))
5951 omp_notice_variable (outer_ctx, decl, true);
5952 if (check_non_private
5953 && region_type == ORT_WORKSHARE
5954 && omp_check_private (ctx, decl))
5956 error ("%s variable %qE is private in outer context",
5957 check_non_private, DECL_NAME (decl));
5962 case OMP_CLAUSE_FINAL:
5964 OMP_CLAUSE_OPERAND (c, 0)
5965 = gimple_boolify (OMP_CLAUSE_OPERAND (c, 0));
5968 case OMP_CLAUSE_SCHEDULE:
5969 case OMP_CLAUSE_NUM_THREADS:
5970 if (gimplify_expr (&OMP_CLAUSE_OPERAND (c, 0), pre_p, NULL,
5971 is_gimple_val, fb_rvalue) == GS_ERROR)
5975 case OMP_CLAUSE_NOWAIT:
5976 case OMP_CLAUSE_ORDERED:
5977 case OMP_CLAUSE_UNTIED:
5978 case OMP_CLAUSE_COLLAPSE:
5979 case OMP_CLAUSE_MERGEABLE:
5982 case OMP_CLAUSE_DEFAULT:
5983 ctx->default_kind = OMP_CLAUSE_DEFAULT_KIND (c);
5991 *list_p = OMP_CLAUSE_CHAIN (c);
5993 list_p = &OMP_CLAUSE_CHAIN (c);
5996 gimplify_omp_ctxp = ctx;
5999 /* For all variables that were not actually used within the context,
6000 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
6003 gimplify_adjust_omp_clauses_1 (splay_tree_node n, void *data)
6005 tree *list_p = (tree *) data;
6006 tree decl = (tree) n->key;
6007 unsigned flags = n->value;
6008 enum omp_clause_code code;
6012 if (flags & (GOVD_EXPLICIT | GOVD_LOCAL))
6014 if ((flags & GOVD_SEEN) == 0)
6016 if (flags & GOVD_DEBUG_PRIVATE)
6018 gcc_assert ((flags & GOVD_DATA_SHARE_CLASS) == GOVD_PRIVATE);
6019 private_debug = true;
6023 = lang_hooks.decls.omp_private_debug_clause (decl,
6024 !!(flags & GOVD_SHARED));
6026 code = OMP_CLAUSE_PRIVATE;
6027 else if (flags & GOVD_SHARED)
6029 if (is_global_var (decl))
6031 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp->outer_context;
6035 = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
6036 if (on && (on->value & (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE
6037 | GOVD_PRIVATE | GOVD_REDUCTION)) != 0)
6039 ctx = ctx->outer_context;
6044 code = OMP_CLAUSE_SHARED;
6046 else if (flags & GOVD_PRIVATE)
6047 code = OMP_CLAUSE_PRIVATE;
6048 else if (flags & GOVD_FIRSTPRIVATE)
6049 code = OMP_CLAUSE_FIRSTPRIVATE;
6053 clause = build_omp_clause (input_location, code);
6054 OMP_CLAUSE_DECL (clause) = decl;
6055 OMP_CLAUSE_CHAIN (clause) = *list_p;
6057 OMP_CLAUSE_PRIVATE_DEBUG (clause) = 1;
6058 else if (code == OMP_CLAUSE_PRIVATE && (flags & GOVD_PRIVATE_OUTER_REF))
6059 OMP_CLAUSE_PRIVATE_OUTER_REF (clause) = 1;
6061 lang_hooks.decls.omp_finish_clause (clause);
6067 gimplify_adjust_omp_clauses (tree *list_p)
6069 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
6072 while ((c = *list_p) != NULL)
6075 bool remove = false;
6077 switch (OMP_CLAUSE_CODE (c))
6079 case OMP_CLAUSE_PRIVATE:
6080 case OMP_CLAUSE_SHARED:
6081 case OMP_CLAUSE_FIRSTPRIVATE:
6082 decl = OMP_CLAUSE_DECL (c);
6083 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
6084 remove = !(n->value & GOVD_SEEN);
6087 bool shared = OMP_CLAUSE_CODE (c) == OMP_CLAUSE_SHARED;
6088 if ((n->value & GOVD_DEBUG_PRIVATE)
6089 || lang_hooks.decls.omp_private_debug_clause (decl, shared))
6091 gcc_assert ((n->value & GOVD_DEBUG_PRIVATE) == 0
6092 || ((n->value & GOVD_DATA_SHARE_CLASS)
6094 OMP_CLAUSE_SET_CODE (c, OMP_CLAUSE_PRIVATE);
6095 OMP_CLAUSE_PRIVATE_DEBUG (c) = 1;
6100 case OMP_CLAUSE_LASTPRIVATE:
6101 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
6102 accurately reflect the presence of a FIRSTPRIVATE clause. */
6103 decl = OMP_CLAUSE_DECL (c);
6104 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
6105 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)
6106 = (n->value & GOVD_FIRSTPRIVATE) != 0;
6109 case OMP_CLAUSE_REDUCTION:
6110 case OMP_CLAUSE_COPYIN:
6111 case OMP_CLAUSE_COPYPRIVATE:
6113 case OMP_CLAUSE_NUM_THREADS:
6114 case OMP_CLAUSE_SCHEDULE:
6115 case OMP_CLAUSE_NOWAIT:
6116 case OMP_CLAUSE_ORDERED:
6117 case OMP_CLAUSE_DEFAULT:
6118 case OMP_CLAUSE_UNTIED:
6119 case OMP_CLAUSE_COLLAPSE:
6120 case OMP_CLAUSE_FINAL:
6121 case OMP_CLAUSE_MERGEABLE:
6129 *list_p = OMP_CLAUSE_CHAIN (c);
6131 list_p = &OMP_CLAUSE_CHAIN (c);
6134 /* Add in any implicit data sharing. */
6135 splay_tree_foreach (ctx->variables, gimplify_adjust_omp_clauses_1, list_p);
6137 gimplify_omp_ctxp = ctx->outer_context;
6138 delete_omp_context (ctx);
6141 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
6142 gimplification of the body, as well as scanning the body for used
6143 variables. We need to do this scan now, because variable-sized
6144 decls will be decomposed during gimplification. */
6147 gimplify_omp_parallel (tree *expr_p, gimple_seq *pre_p)
6149 tree expr = *expr_p;
6151 gimple_seq body = NULL;
6152 struct gimplify_ctx gctx;
6154 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr), pre_p,
6155 OMP_PARALLEL_COMBINED (expr)
6156 ? ORT_COMBINED_PARALLEL
6159 push_gimplify_context (&gctx);
6161 g = gimplify_and_return_first (OMP_PARALLEL_BODY (expr), &body);
6162 if (gimple_code (g) == GIMPLE_BIND)
6163 pop_gimplify_context (g);
6165 pop_gimplify_context (NULL);
6167 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr));
6169 g = gimple_build_omp_parallel (body,
6170 OMP_PARALLEL_CLAUSES (expr),
6171 NULL_TREE, NULL_TREE);
6172 if (OMP_PARALLEL_COMBINED (expr))
6173 gimple_omp_set_subcode (g, GF_OMP_PARALLEL_COMBINED);
6174 gimplify_seq_add_stmt (pre_p, g);
6175 *expr_p = NULL_TREE;
6178 /* Gimplify the contents of an OMP_TASK statement. This involves
6179 gimplification of the body, as well as scanning the body for used
6180 variables. We need to do this scan now, because variable-sized
6181 decls will be decomposed during gimplification. */
6184 gimplify_omp_task (tree *expr_p, gimple_seq *pre_p)
6186 tree expr = *expr_p;
6188 gimple_seq body = NULL;
6189 struct gimplify_ctx gctx;
6191 gimplify_scan_omp_clauses (&OMP_TASK_CLAUSES (expr), pre_p,
6192 find_omp_clause (OMP_TASK_CLAUSES (expr),
6194 ? ORT_UNTIED_TASK : ORT_TASK);
6196 push_gimplify_context (&gctx);
6198 g = gimplify_and_return_first (OMP_TASK_BODY (expr), &body);
6199 if (gimple_code (g) == GIMPLE_BIND)
6200 pop_gimplify_context (g);
6202 pop_gimplify_context (NULL);
6204 gimplify_adjust_omp_clauses (&OMP_TASK_CLAUSES (expr));
6206 g = gimple_build_omp_task (body,
6207 OMP_TASK_CLAUSES (expr),
6208 NULL_TREE, NULL_TREE,
6209 NULL_TREE, NULL_TREE, NULL_TREE);
6210 gimplify_seq_add_stmt (pre_p, g);
6211 *expr_p = NULL_TREE;
6214 /* Gimplify the gross structure of an OMP_FOR statement. */
6216 static enum gimplify_status
6217 gimplify_omp_for (tree *expr_p, gimple_seq *pre_p)
6219 tree for_stmt, decl, var, t;
6220 enum gimplify_status ret = GS_ALL_DONE;
6221 enum gimplify_status tret;
6223 gimple_seq for_body, for_pre_body;
6228 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt), pre_p,
6231 /* Handle OMP_FOR_INIT. */
6232 for_pre_body = NULL;
6233 gimplify_and_add (OMP_FOR_PRE_BODY (for_stmt), &for_pre_body);
6234 OMP_FOR_PRE_BODY (for_stmt) = NULL_TREE;
6236 for_body = gimple_seq_alloc ();
6237 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt))
6238 == TREE_VEC_LENGTH (OMP_FOR_COND (for_stmt)));
6239 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt))
6240 == TREE_VEC_LENGTH (OMP_FOR_INCR (for_stmt)));
6241 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)); i++)
6243 t = TREE_VEC_ELT (OMP_FOR_INIT (for_stmt), i);
6244 gcc_assert (TREE_CODE (t) == MODIFY_EXPR);
6245 decl = TREE_OPERAND (t, 0);
6246 gcc_assert (DECL_P (decl));
6247 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl))
6248 || POINTER_TYPE_P (TREE_TYPE (decl)));
6250 /* Make sure the iteration variable is private. */
6251 if (omp_is_private (gimplify_omp_ctxp, decl))
6252 omp_notice_variable (gimplify_omp_ctxp, decl, true);
6254 omp_add_variable (gimplify_omp_ctxp, decl, GOVD_PRIVATE | GOVD_SEEN);
6256 /* If DECL is not a gimple register, create a temporary variable to act
6257 as an iteration counter. This is valid, since DECL cannot be
6258 modified in the body of the loop. */
6259 if (!is_gimple_reg (decl))
6261 var = create_tmp_var (TREE_TYPE (decl), get_name (decl));
6262 TREE_OPERAND (t, 0) = var;
6264 gimplify_seq_add_stmt (&for_body, gimple_build_assign (decl, var));
6266 omp_add_variable (gimplify_omp_ctxp, var, GOVD_PRIVATE | GOVD_SEEN);
6271 tret = gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
6272 is_gimple_val, fb_rvalue);
6273 ret = MIN (ret, tret);
6274 if (ret == GS_ERROR)
6277 /* Handle OMP_FOR_COND. */
6278 t = TREE_VEC_ELT (OMP_FOR_COND (for_stmt), i);
6279 gcc_assert (COMPARISON_CLASS_P (t));
6280 gcc_assert (TREE_OPERAND (t, 0) == decl);
6282 tret = gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
6283 is_gimple_val, fb_rvalue);
6284 ret = MIN (ret, tret);
6286 /* Handle OMP_FOR_INCR. */
6287 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6288 switch (TREE_CODE (t))
6290 case PREINCREMENT_EXPR:
6291 case POSTINCREMENT_EXPR:
6292 t = build_int_cst (TREE_TYPE (decl), 1);
6293 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
6294 t = build2 (MODIFY_EXPR, TREE_TYPE (var), var, t);
6295 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i) = t;
6298 case PREDECREMENT_EXPR:
6299 case POSTDECREMENT_EXPR:
6300 t = build_int_cst (TREE_TYPE (decl), -1);
6301 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
6302 t = build2 (MODIFY_EXPR, TREE_TYPE (var), var, t);
6303 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i) = t;
6307 gcc_assert (TREE_OPERAND (t, 0) == decl);
6308 TREE_OPERAND (t, 0) = var;
6310 t = TREE_OPERAND (t, 1);
6311 switch (TREE_CODE (t))
6314 if (TREE_OPERAND (t, 1) == decl)
6316 TREE_OPERAND (t, 1) = TREE_OPERAND (t, 0);
6317 TREE_OPERAND (t, 0) = var;
6323 case POINTER_PLUS_EXPR:
6324 gcc_assert (TREE_OPERAND (t, 0) == decl);
6325 TREE_OPERAND (t, 0) = var;
6331 tret = gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
6332 is_gimple_val, fb_rvalue);
6333 ret = MIN (ret, tret);
6340 if (var != decl || TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)) > 1)
6343 for (c = OMP_FOR_CLAUSES (for_stmt); c ; c = OMP_CLAUSE_CHAIN (c))
6344 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
6345 && OMP_CLAUSE_DECL (c) == decl
6346 && OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c) == NULL)
6348 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6349 gcc_assert (TREE_CODE (t) == MODIFY_EXPR);
6350 gcc_assert (TREE_OPERAND (t, 0) == var);
6351 t = TREE_OPERAND (t, 1);
6352 gcc_assert (TREE_CODE (t) == PLUS_EXPR
6353 || TREE_CODE (t) == MINUS_EXPR
6354 || TREE_CODE (t) == POINTER_PLUS_EXPR);
6355 gcc_assert (TREE_OPERAND (t, 0) == var);
6356 t = build2 (TREE_CODE (t), TREE_TYPE (decl), decl,
6357 TREE_OPERAND (t, 1));
6358 gimplify_assign (decl, t,
6359 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c));
6364 gimplify_and_add (OMP_FOR_BODY (for_stmt), &for_body);
6366 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt));
6368 gfor = gimple_build_omp_for (for_body, OMP_FOR_CLAUSES (for_stmt),
6369 TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)),
6372 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)); i++)
6374 t = TREE_VEC_ELT (OMP_FOR_INIT (for_stmt), i);
6375 gimple_omp_for_set_index (gfor, i, TREE_OPERAND (t, 0));
6376 gimple_omp_for_set_initial (gfor, i, TREE_OPERAND (t, 1));
6377 t = TREE_VEC_ELT (OMP_FOR_COND (for_stmt), i);
6378 gimple_omp_for_set_cond (gfor, i, TREE_CODE (t));
6379 gimple_omp_for_set_final (gfor, i, TREE_OPERAND (t, 1));
6380 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6381 gimple_omp_for_set_incr (gfor, i, TREE_OPERAND (t, 1));
6384 gimplify_seq_add_stmt (pre_p, gfor);
6385 return ret == GS_ALL_DONE ? GS_ALL_DONE : GS_ERROR;
6388 /* Gimplify the gross structure of other OpenMP worksharing constructs.
6389 In particular, OMP_SECTIONS and OMP_SINGLE. */
6392 gimplify_omp_workshare (tree *expr_p, gimple_seq *pre_p)
6394 tree expr = *expr_p;
6396 gimple_seq body = NULL;
6398 gimplify_scan_omp_clauses (&OMP_CLAUSES (expr), pre_p, ORT_WORKSHARE);
6399 gimplify_and_add (OMP_BODY (expr), &body);
6400 gimplify_adjust_omp_clauses (&OMP_CLAUSES (expr));
6402 if (TREE_CODE (expr) == OMP_SECTIONS)
6403 stmt = gimple_build_omp_sections (body, OMP_CLAUSES (expr));
6404 else if (TREE_CODE (expr) == OMP_SINGLE)
6405 stmt = gimple_build_omp_single (body, OMP_CLAUSES (expr));
6409 gimplify_seq_add_stmt (pre_p, stmt);
6412 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
6413 stabilized the lhs of the atomic operation as *ADDR. Return true if
6414 EXPR is this stabilized form. */
6417 goa_lhs_expr_p (tree expr, tree addr)
6419 /* Also include casts to other type variants. The C front end is fond
6420 of adding these for e.g. volatile variables. This is like
6421 STRIP_TYPE_NOPS but includes the main variant lookup. */
6422 STRIP_USELESS_TYPE_CONVERSION (expr);
6424 if (TREE_CODE (expr) == INDIRECT_REF)
6426 expr = TREE_OPERAND (expr, 0);
6428 && (CONVERT_EXPR_P (expr)
6429 || TREE_CODE (expr) == NON_LVALUE_EXPR)
6430 && TREE_CODE (expr) == TREE_CODE (addr)
6431 && types_compatible_p (TREE_TYPE (expr), TREE_TYPE (addr)))
6433 expr = TREE_OPERAND (expr, 0);
6434 addr = TREE_OPERAND (addr, 0);
6438 return (TREE_CODE (addr) == ADDR_EXPR
6439 && TREE_CODE (expr) == ADDR_EXPR
6440 && TREE_OPERAND (addr, 0) == TREE_OPERAND (expr, 0));
6442 if (TREE_CODE (addr) == ADDR_EXPR && expr == TREE_OPERAND (addr, 0))
6447 /* Walk *EXPR_P and replace appearances of *LHS_ADDR with LHS_VAR. If an
6448 expression does not involve the lhs, evaluate it into a temporary.
6449 Return 1 if the lhs appeared as a subexpression, 0 if it did not,
6450 or -1 if an error was encountered. */
6453 goa_stabilize_expr (tree *expr_p, gimple_seq *pre_p, tree lhs_addr,
6456 tree expr = *expr_p;
6459 if (goa_lhs_expr_p (expr, lhs_addr))
6464 if (is_gimple_val (expr))
6468 switch (TREE_CODE_CLASS (TREE_CODE (expr)))
6471 case tcc_comparison:
6472 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p, lhs_addr,
6475 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p, lhs_addr,
6478 case tcc_expression:
6479 switch (TREE_CODE (expr))
6481 case TRUTH_ANDIF_EXPR:
6482 case TRUTH_ORIF_EXPR:
6483 case TRUTH_AND_EXPR:
6485 case TRUTH_XOR_EXPR:
6486 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p,
6488 case TRUTH_NOT_EXPR:
6489 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p,
6493 /* Break out any preevaluations from cp_build_modify_expr. */
6494 for (; TREE_CODE (expr) == COMPOUND_EXPR;
6495 expr = TREE_OPERAND (expr, 1))
6496 gimplify_stmt (&TREE_OPERAND (expr, 0), pre_p);
6498 return goa_stabilize_expr (expr_p, pre_p, lhs_addr, lhs_var);
6509 enum gimplify_status gs;
6510 gs = gimplify_expr (expr_p, pre_p, NULL, is_gimple_val, fb_rvalue);
6511 if (gs != GS_ALL_DONE)
6518 /* Gimplify an OMP_ATOMIC statement. */
6520 static enum gimplify_status
6521 gimplify_omp_atomic (tree *expr_p, gimple_seq *pre_p)
6523 tree addr = TREE_OPERAND (*expr_p, 0);
6524 tree rhs = TREE_CODE (*expr_p) == OMP_ATOMIC_READ
6525 ? NULL : TREE_OPERAND (*expr_p, 1);
6526 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr)));
6528 gimple loadstmt, storestmt;
6530 tmp_load = create_tmp_reg (type, NULL);
6531 if (rhs && goa_stabilize_expr (&rhs, pre_p, addr, tmp_load) < 0)
6534 if (gimplify_expr (&addr, pre_p, NULL, is_gimple_val, fb_rvalue)
6538 loadstmt = gimple_build_omp_atomic_load (tmp_load, addr);
6539 gimplify_seq_add_stmt (pre_p, loadstmt);
6540 if (rhs && gimplify_expr (&rhs, pre_p, NULL, is_gimple_val, fb_rvalue)
6544 if (TREE_CODE (*expr_p) == OMP_ATOMIC_READ)
6546 storestmt = gimple_build_omp_atomic_store (rhs);
6547 gimplify_seq_add_stmt (pre_p, storestmt);
6548 switch (TREE_CODE (*expr_p))
6550 case OMP_ATOMIC_READ:
6551 case OMP_ATOMIC_CAPTURE_OLD:
6553 gimple_omp_atomic_set_need_value (loadstmt);
6555 case OMP_ATOMIC_CAPTURE_NEW:
6557 gimple_omp_atomic_set_need_value (storestmt);
6567 /* Gimplify a TRANSACTION_EXPR. This involves gimplification of the
6568 body, and adding some EH bits. */
6570 static enum gimplify_status
6571 gimplify_transaction (tree *expr_p, gimple_seq *pre_p)
6573 tree expr = *expr_p, temp, tbody = TRANSACTION_EXPR_BODY (expr);
6575 gimple_seq body = NULL;
6576 struct gimplify_ctx gctx;
6579 /* Wrap the transaction body in a BIND_EXPR so we have a context
6580 where to put decls for OpenMP. */
6581 if (TREE_CODE (tbody) != BIND_EXPR)
6583 tree bind = build3 (BIND_EXPR, void_type_node, NULL, tbody, NULL);
6584 TREE_SIDE_EFFECTS (bind) = 1;
6585 SET_EXPR_LOCATION (bind, EXPR_LOCATION (tbody));
6586 TRANSACTION_EXPR_BODY (expr) = bind;
6589 push_gimplify_context (&gctx);
6590 temp = voidify_wrapper_expr (*expr_p, NULL);
6592 g = gimplify_and_return_first (TRANSACTION_EXPR_BODY (expr), &body);
6593 pop_gimplify_context (g);
6595 g = gimple_build_transaction (body, NULL);
6596 if (TRANSACTION_EXPR_OUTER (expr))
6597 subcode = GTMA_IS_OUTER;
6598 else if (TRANSACTION_EXPR_RELAXED (expr))
6599 subcode = GTMA_IS_RELAXED;
6600 gimple_transaction_set_subcode (g, subcode);
6602 gimplify_seq_add_stmt (pre_p, g);
6610 *expr_p = NULL_TREE;
6614 /* Convert the GENERIC expression tree *EXPR_P to GIMPLE. If the
6615 expression produces a value to be used as an operand inside a GIMPLE
6616 statement, the value will be stored back in *EXPR_P. This value will
6617 be a tree of class tcc_declaration, tcc_constant, tcc_reference or
6618 an SSA_NAME. The corresponding sequence of GIMPLE statements is
6619 emitted in PRE_P and POST_P.
6621 Additionally, this process may overwrite parts of the input
6622 expression during gimplification. Ideally, it should be
6623 possible to do non-destructive gimplification.
6625 EXPR_P points to the GENERIC expression to convert to GIMPLE. If
6626 the expression needs to evaluate to a value to be used as
6627 an operand in a GIMPLE statement, this value will be stored in
6628 *EXPR_P on exit. This happens when the caller specifies one
6629 of fb_lvalue or fb_rvalue fallback flags.
6631 PRE_P will contain the sequence of GIMPLE statements corresponding
6632 to the evaluation of EXPR and all the side-effects that must
6633 be executed before the main expression. On exit, the last
6634 statement of PRE_P is the core statement being gimplified. For
6635 instance, when gimplifying 'if (++a)' the last statement in
6636 PRE_P will be 'if (t.1)' where t.1 is the result of
6637 pre-incrementing 'a'.
6639 POST_P will contain the sequence of GIMPLE statements corresponding
6640 to the evaluation of all the side-effects that must be executed
6641 after the main expression. If this is NULL, the post
6642 side-effects are stored at the end of PRE_P.
6644 The reason why the output is split in two is to handle post
6645 side-effects explicitly. In some cases, an expression may have
6646 inner and outer post side-effects which need to be emitted in
6647 an order different from the one given by the recursive
6648 traversal. For instance, for the expression (*p--)++ the post
6649 side-effects of '--' must actually occur *after* the post
6650 side-effects of '++'. However, gimplification will first visit
6651 the inner expression, so if a separate POST sequence was not
6652 used, the resulting sequence would be:
6659 However, the post-decrement operation in line #2 must not be
6660 evaluated until after the store to *p at line #4, so the
6661 correct sequence should be:
6668 So, by specifying a separate post queue, it is possible
6669 to emit the post side-effects in the correct order.
6670 If POST_P is NULL, an internal queue will be used. Before
6671 returning to the caller, the sequence POST_P is appended to
6672 the main output sequence PRE_P.
6674 GIMPLE_TEST_F points to a function that takes a tree T and
6675 returns nonzero if T is in the GIMPLE form requested by the
6676 caller. The GIMPLE predicates are in gimple.c.
6678 FALLBACK tells the function what sort of a temporary we want if
6679 gimplification cannot produce an expression that complies with
6682 fb_none means that no temporary should be generated
6683 fb_rvalue means that an rvalue is OK to generate
6684 fb_lvalue means that an lvalue is OK to generate
6685 fb_either means that either is OK, but an lvalue is preferable.
6686 fb_mayfail means that gimplification may fail (in which case
6687 GS_ERROR will be returned)
6689 The return value is either GS_ERROR or GS_ALL_DONE, since this
6690 function iterates until EXPR is completely gimplified or an error
6693 enum gimplify_status
6694 gimplify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
6695 bool (*gimple_test_f) (tree), fallback_t fallback)
6698 gimple_seq internal_pre = NULL;
6699 gimple_seq internal_post = NULL;
6702 location_t saved_location;
6703 enum gimplify_status ret;
6704 gimple_stmt_iterator pre_last_gsi, post_last_gsi;
6706 save_expr = *expr_p;
6707 if (save_expr == NULL_TREE)
6710 /* If we are gimplifying a top-level statement, PRE_P must be valid. */
6711 is_statement = gimple_test_f == is_gimple_stmt;
6715 /* Consistency checks. */
6716 if (gimple_test_f == is_gimple_reg)
6717 gcc_assert (fallback & (fb_rvalue | fb_lvalue));
6718 else if (gimple_test_f == is_gimple_val
6719 || gimple_test_f == is_gimple_call_addr
6720 || gimple_test_f == is_gimple_condexpr
6721 || gimple_test_f == is_gimple_mem_rhs
6722 || gimple_test_f == is_gimple_mem_rhs_or_call
6723 || gimple_test_f == is_gimple_reg_rhs
6724 || gimple_test_f == is_gimple_reg_rhs_or_call
6725 || gimple_test_f == is_gimple_asm_val
6726 || gimple_test_f == is_gimple_mem_ref_addr)
6727 gcc_assert (fallback & fb_rvalue);
6728 else if (gimple_test_f == is_gimple_min_lval
6729 || gimple_test_f == is_gimple_lvalue)
6730 gcc_assert (fallback & fb_lvalue);
6731 else if (gimple_test_f == is_gimple_addressable)
6732 gcc_assert (fallback & fb_either);
6733 else if (gimple_test_f == is_gimple_stmt)
6734 gcc_assert (fallback == fb_none);
6737 /* We should have recognized the GIMPLE_TEST_F predicate to
6738 know what kind of fallback to use in case a temporary is
6739 needed to hold the value or address of *EXPR_P. */
6743 /* We used to check the predicate here and return immediately if it
6744 succeeds. This is wrong; the design is for gimplification to be
6745 idempotent, and for the predicates to only test for valid forms, not
6746 whether they are fully simplified. */
6748 pre_p = &internal_pre;
6751 post_p = &internal_post;
6753 /* Remember the last statements added to PRE_P and POST_P. Every
6754 new statement added by the gimplification helpers needs to be
6755 annotated with location information. To centralize the
6756 responsibility, we remember the last statement that had been
6757 added to both queues before gimplifying *EXPR_P. If
6758 gimplification produces new statements in PRE_P and POST_P, those
6759 statements will be annotated with the same location information
6761 pre_last_gsi = gsi_last (*pre_p);
6762 post_last_gsi = gsi_last (*post_p);
6764 saved_location = input_location;
6765 if (save_expr != error_mark_node
6766 && EXPR_HAS_LOCATION (*expr_p))
6767 input_location = EXPR_LOCATION (*expr_p);
6769 /* Loop over the specific gimplifiers until the toplevel node
6770 remains the same. */
6773 /* Strip away as many useless type conversions as possible
6775 STRIP_USELESS_TYPE_CONVERSION (*expr_p);
6777 /* Remember the expr. */
6778 save_expr = *expr_p;
6780 /* Die, die, die, my darling. */
6781 if (save_expr == error_mark_node
6782 || (TREE_TYPE (save_expr)
6783 && TREE_TYPE (save_expr) == error_mark_node))
6789 /* Do any language-specific gimplification. */
6790 ret = ((enum gimplify_status)
6791 lang_hooks.gimplify_expr (expr_p, pre_p, post_p));
6794 if (*expr_p == NULL_TREE)
6796 if (*expr_p != save_expr)
6799 else if (ret != GS_UNHANDLED)
6802 /* Make sure that all the cases set 'ret' appropriately. */
6804 switch (TREE_CODE (*expr_p))
6806 /* First deal with the special cases. */
6808 case POSTINCREMENT_EXPR:
6809 case POSTDECREMENT_EXPR:
6810 case PREINCREMENT_EXPR:
6811 case PREDECREMENT_EXPR:
6812 ret = gimplify_self_mod_expr (expr_p, pre_p, post_p,
6813 fallback != fb_none);
6817 case ARRAY_RANGE_REF:
6821 case VIEW_CONVERT_EXPR:
6822 ret = gimplify_compound_lval (expr_p, pre_p, post_p,
6823 fallback ? fallback : fb_rvalue);
6827 ret = gimplify_cond_expr (expr_p, pre_p, fallback);
6829 /* C99 code may assign to an array in a structure value of a
6830 conditional expression, and this has undefined behavior
6831 only on execution, so create a temporary if an lvalue is
6833 if (fallback == fb_lvalue)
6835 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6836 mark_addressable (*expr_p);
6842 ret = gimplify_call_expr (expr_p, pre_p, fallback != fb_none);
6844 /* C99 code may assign to an array in a structure returned
6845 from a function, and this has undefined behavior only on
6846 execution, so create a temporary if an lvalue is
6848 if (fallback == fb_lvalue)
6850 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6851 mark_addressable (*expr_p);
6860 ret = gimplify_compound_expr (expr_p, pre_p, fallback != fb_none);
6863 case COMPOUND_LITERAL_EXPR:
6864 ret = gimplify_compound_literal_expr (expr_p, pre_p);
6869 ret = gimplify_modify_expr (expr_p, pre_p, post_p,
6870 fallback != fb_none);
6873 case TRUTH_ANDIF_EXPR:
6874 case TRUTH_ORIF_EXPR:
6876 /* Preserve the original type of the expression and the
6877 source location of the outer expression. */
6878 tree org_type = TREE_TYPE (*expr_p);
6879 *expr_p = gimple_boolify (*expr_p);
6880 *expr_p = build3_loc (input_location, COND_EXPR,
6884 org_type, boolean_true_node),
6887 org_type, boolean_false_node));
6892 case TRUTH_NOT_EXPR:
6894 tree type = TREE_TYPE (*expr_p);
6895 /* The parsers are careful to generate TRUTH_NOT_EXPR
6896 only with operands that are always zero or one.
6897 We do not fold here but handle the only interesting case
6898 manually, as fold may re-introduce the TRUTH_NOT_EXPR. */
6899 *expr_p = gimple_boolify (*expr_p);
6900 if (TYPE_PRECISION (TREE_TYPE (*expr_p)) == 1)
6901 *expr_p = build1_loc (input_location, BIT_NOT_EXPR,
6902 TREE_TYPE (*expr_p),
6903 TREE_OPERAND (*expr_p, 0));
6905 *expr_p = build2_loc (input_location, BIT_XOR_EXPR,
6906 TREE_TYPE (*expr_p),
6907 TREE_OPERAND (*expr_p, 0),
6908 build_int_cst (TREE_TYPE (*expr_p), 1));
6909 if (!useless_type_conversion_p (type, TREE_TYPE (*expr_p)))
6910 *expr_p = fold_convert_loc (input_location, type, *expr_p);
6916 ret = gimplify_addr_expr (expr_p, pre_p, post_p);
6920 ret = gimplify_va_arg_expr (expr_p, pre_p, post_p);
6924 if (IS_EMPTY_STMT (*expr_p))
6930 if (VOID_TYPE_P (TREE_TYPE (*expr_p))
6931 || fallback == fb_none)
6933 /* Just strip a conversion to void (or in void context) and
6935 *expr_p = TREE_OPERAND (*expr_p, 0);
6940 ret = gimplify_conversion (expr_p);
6941 if (ret == GS_ERROR)
6943 if (*expr_p != save_expr)
6947 case FIX_TRUNC_EXPR:
6948 /* unary_expr: ... | '(' cast ')' val | ... */
6949 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6950 is_gimple_val, fb_rvalue);
6951 recalculate_side_effects (*expr_p);
6956 bool volatilep = TREE_THIS_VOLATILE (*expr_p);
6957 bool notrap = TREE_THIS_NOTRAP (*expr_p);
6958 tree saved_ptr_type = TREE_TYPE (TREE_OPERAND (*expr_p, 0));
6960 *expr_p = fold_indirect_ref_loc (input_location, *expr_p);
6961 if (*expr_p != save_expr)
6967 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6968 is_gimple_reg, fb_rvalue);
6969 if (ret == GS_ERROR)
6972 recalculate_side_effects (*expr_p);
6973 *expr_p = fold_build2_loc (input_location, MEM_REF,
6974 TREE_TYPE (*expr_p),
6975 TREE_OPERAND (*expr_p, 0),
6976 build_int_cst (saved_ptr_type, 0));
6977 TREE_THIS_VOLATILE (*expr_p) = volatilep;
6978 TREE_THIS_NOTRAP (*expr_p) = notrap;
6983 /* We arrive here through the various re-gimplifcation paths. */
6985 /* First try re-folding the whole thing. */
6986 tmp = fold_binary (MEM_REF, TREE_TYPE (*expr_p),
6987 TREE_OPERAND (*expr_p, 0),
6988 TREE_OPERAND (*expr_p, 1));
6992 recalculate_side_effects (*expr_p);
6996 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6997 is_gimple_mem_ref_addr, fb_rvalue);
6998 if (ret == GS_ERROR)
7000 recalculate_side_effects (*expr_p);
7004 /* Constants need not be gimplified. */
7015 /* If we require an lvalue, such as for ADDR_EXPR, retain the
7016 CONST_DECL node. Otherwise the decl is replaceable by its
7018 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
7019 if (fallback & fb_lvalue)
7023 *expr_p = DECL_INITIAL (*expr_p);
7029 ret = gimplify_decl_expr (expr_p, pre_p);
7033 ret = gimplify_bind_expr (expr_p, pre_p);
7037 ret = gimplify_loop_expr (expr_p, pre_p);
7041 ret = gimplify_switch_expr (expr_p, pre_p);
7045 ret = gimplify_exit_expr (expr_p);
7049 /* If the target is not LABEL, then it is a computed jump
7050 and the target needs to be gimplified. */
7051 if (TREE_CODE (GOTO_DESTINATION (*expr_p)) != LABEL_DECL)
7053 ret = gimplify_expr (&GOTO_DESTINATION (*expr_p), pre_p,
7054 NULL, is_gimple_val, fb_rvalue);
7055 if (ret == GS_ERROR)
7058 gimplify_seq_add_stmt (pre_p,
7059 gimple_build_goto (GOTO_DESTINATION (*expr_p)));
7064 gimplify_seq_add_stmt (pre_p,
7065 gimple_build_predict (PREDICT_EXPR_PREDICTOR (*expr_p),
7066 PREDICT_EXPR_OUTCOME (*expr_p)));
7072 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p))
7073 == current_function_decl);
7074 gimplify_seq_add_stmt (pre_p,
7075 gimple_build_label (LABEL_EXPR_LABEL (*expr_p)));
7078 case CASE_LABEL_EXPR:
7079 ret = gimplify_case_label_expr (expr_p, pre_p);
7083 ret = gimplify_return_expr (*expr_p, pre_p);
7087 /* Don't reduce this in place; let gimplify_init_constructor work its
7088 magic. Buf if we're just elaborating this for side effects, just
7089 gimplify any element that has side-effects. */
7090 if (fallback == fb_none)
7092 unsigned HOST_WIDE_INT ix;
7094 tree temp = NULL_TREE;
7095 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (*expr_p), ix, val)
7096 if (TREE_SIDE_EFFECTS (val))
7097 append_to_statement_list (val, &temp);
7100 ret = temp ? GS_OK : GS_ALL_DONE;
7102 /* C99 code may assign to an array in a constructed
7103 structure or union, and this has undefined behavior only
7104 on execution, so create a temporary if an lvalue is
7106 else if (fallback == fb_lvalue)
7108 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
7109 mark_addressable (*expr_p);
7116 /* The following are special cases that are not handled by the
7117 original GIMPLE grammar. */
7119 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
7122 ret = gimplify_save_expr (expr_p, pre_p, post_p);
7127 enum gimplify_status r0, r1, r2;
7129 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7130 post_p, is_gimple_lvalue, fb_either);
7131 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
7132 post_p, is_gimple_val, fb_rvalue);
7133 r2 = gimplify_expr (&TREE_OPERAND (*expr_p, 2), pre_p,
7134 post_p, is_gimple_val, fb_rvalue);
7135 recalculate_side_effects (*expr_p);
7137 ret = MIN (r0, MIN (r1, r2));
7141 case TARGET_MEM_REF:
7143 enum gimplify_status r0 = GS_ALL_DONE, r1 = GS_ALL_DONE;
7145 if (TMR_BASE (*expr_p))
7146 r0 = gimplify_expr (&TMR_BASE (*expr_p), pre_p,
7147 post_p, is_gimple_mem_ref_addr, fb_either);
7148 if (TMR_INDEX (*expr_p))
7149 r1 = gimplify_expr (&TMR_INDEX (*expr_p), pre_p,
7150 post_p, is_gimple_val, fb_rvalue);
7151 if (TMR_INDEX2 (*expr_p))
7152 r1 = gimplify_expr (&TMR_INDEX2 (*expr_p), pre_p,
7153 post_p, is_gimple_val, fb_rvalue);
7154 /* TMR_STEP and TMR_OFFSET are always integer constants. */
7159 case NON_LVALUE_EXPR:
7160 /* This should have been stripped above. */
7164 ret = gimplify_asm_expr (expr_p, pre_p, post_p);
7167 case TRY_FINALLY_EXPR:
7168 case TRY_CATCH_EXPR:
7170 gimple_seq eval, cleanup;
7173 eval = cleanup = NULL;
7174 gimplify_and_add (TREE_OPERAND (*expr_p, 0), &eval);
7175 gimplify_and_add (TREE_OPERAND (*expr_p, 1), &cleanup);
7176 /* Don't create bogus GIMPLE_TRY with empty cleanup. */
7177 if (gimple_seq_empty_p (cleanup))
7179 gimple_seq_add_seq (pre_p, eval);
7183 try_ = gimple_build_try (eval, cleanup,
7184 TREE_CODE (*expr_p) == TRY_FINALLY_EXPR
7185 ? GIMPLE_TRY_FINALLY
7186 : GIMPLE_TRY_CATCH);
7187 if (TREE_CODE (*expr_p) == TRY_CATCH_EXPR)
7188 gimple_try_set_catch_is_cleanup (try_,
7189 TRY_CATCH_IS_CLEANUP (*expr_p));
7190 gimplify_seq_add_stmt (pre_p, try_);
7195 case CLEANUP_POINT_EXPR:
7196 ret = gimplify_cleanup_point_expr (expr_p, pre_p);
7200 ret = gimplify_target_expr (expr_p, pre_p, post_p);
7206 gimple_seq handler = NULL;
7207 gimplify_and_add (CATCH_BODY (*expr_p), &handler);
7208 c = gimple_build_catch (CATCH_TYPES (*expr_p), handler);
7209 gimplify_seq_add_stmt (pre_p, c);
7214 case EH_FILTER_EXPR:
7217 gimple_seq failure = NULL;
7219 gimplify_and_add (EH_FILTER_FAILURE (*expr_p), &failure);
7220 ehf = gimple_build_eh_filter (EH_FILTER_TYPES (*expr_p), failure);
7221 gimple_set_no_warning (ehf, TREE_NO_WARNING (*expr_p));
7222 gimplify_seq_add_stmt (pre_p, ehf);
7229 enum gimplify_status r0, r1;
7230 r0 = gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p), pre_p,
7231 post_p, is_gimple_val, fb_rvalue);
7232 r1 = gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p), pre_p,
7233 post_p, is_gimple_val, fb_rvalue);
7234 TREE_SIDE_EFFECTS (*expr_p) = 0;
7240 /* We get here when taking the address of a label. We mark
7241 the label as "forced"; meaning it can never be removed and
7242 it is a potential target for any computed goto. */
7243 FORCED_LABEL (*expr_p) = 1;
7247 case STATEMENT_LIST:
7248 ret = gimplify_statement_list (expr_p, pre_p);
7251 case WITH_SIZE_EXPR:
7253 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7254 post_p == &internal_post ? NULL : post_p,
7255 gimple_test_f, fallback);
7256 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
7257 is_gimple_val, fb_rvalue);
7264 ret = gimplify_var_or_parm_decl (expr_p);
7268 /* When within an OpenMP context, notice uses of variables. */
7269 if (gimplify_omp_ctxp)
7270 omp_notice_variable (gimplify_omp_ctxp, *expr_p, true);
7275 /* Allow callbacks into the gimplifier during optimization. */
7280 gimplify_omp_parallel (expr_p, pre_p);
7285 gimplify_omp_task (expr_p, pre_p);
7290 ret = gimplify_omp_for (expr_p, pre_p);
7295 gimplify_omp_workshare (expr_p, pre_p);
7304 gimple_seq body = NULL;
7307 gimplify_and_add (OMP_BODY (*expr_p), &body);
7308 switch (TREE_CODE (*expr_p))
7311 g = gimple_build_omp_section (body);
7314 g = gimple_build_omp_master (body);
7317 g = gimple_build_omp_ordered (body);
7320 g = gimple_build_omp_critical (body,
7321 OMP_CRITICAL_NAME (*expr_p));
7326 gimplify_seq_add_stmt (pre_p, g);
7332 case OMP_ATOMIC_READ:
7333 case OMP_ATOMIC_CAPTURE_OLD:
7334 case OMP_ATOMIC_CAPTURE_NEW:
7335 ret = gimplify_omp_atomic (expr_p, pre_p);
7338 case TRANSACTION_EXPR:
7339 ret = gimplify_transaction (expr_p, pre_p);
7342 case TRUTH_AND_EXPR:
7344 case TRUTH_XOR_EXPR:
7346 tree orig_type = TREE_TYPE (*expr_p);
7347 tree new_type, xop0, xop1;
7348 *expr_p = gimple_boolify (*expr_p);
7349 new_type = TREE_TYPE (*expr_p);
7350 if (!useless_type_conversion_p (orig_type, new_type))
7352 *expr_p = fold_convert_loc (input_location, orig_type, *expr_p);
7357 /* Boolified binary truth expressions are semantically equivalent
7358 to bitwise binary expressions. Canonicalize them to the
7360 switch (TREE_CODE (*expr_p))
7362 case TRUTH_AND_EXPR:
7363 TREE_SET_CODE (*expr_p, BIT_AND_EXPR);
7366 TREE_SET_CODE (*expr_p, BIT_IOR_EXPR);
7368 case TRUTH_XOR_EXPR:
7369 TREE_SET_CODE (*expr_p, BIT_XOR_EXPR);
7374 /* Now make sure that operands have compatible type to
7375 expression's new_type. */
7376 xop0 = TREE_OPERAND (*expr_p, 0);
7377 xop1 = TREE_OPERAND (*expr_p, 1);
7378 if (!useless_type_conversion_p (new_type, TREE_TYPE (xop0)))
7379 TREE_OPERAND (*expr_p, 0) = fold_convert_loc (input_location,
7382 if (!useless_type_conversion_p (new_type, TREE_TYPE (xop1)))
7383 TREE_OPERAND (*expr_p, 1) = fold_convert_loc (input_location,
7386 /* Continue classified as tcc_binary. */
7392 /* Classified as tcc_expression. */
7395 case POINTER_PLUS_EXPR:
7397 enum gimplify_status r0, r1;
7398 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7399 post_p, is_gimple_val, fb_rvalue);
7400 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
7401 post_p, is_gimple_val, fb_rvalue);
7402 recalculate_side_effects (*expr_p);
7404 /* Convert &X + CST to invariant &MEM[&X, CST]. Do this
7405 after gimplifying operands - this is similar to how
7406 it would be folding all gimplified stmts on creation
7407 to have them canonicalized, which is what we eventually
7408 should do anyway. */
7409 if (TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
7410 && is_gimple_min_invariant (TREE_OPERAND (*expr_p, 0)))
7412 *expr_p = build_fold_addr_expr_with_type_loc
7414 fold_build2 (MEM_REF, TREE_TYPE (TREE_TYPE (*expr_p)),
7415 TREE_OPERAND (*expr_p, 0),
7416 fold_convert (ptr_type_node,
7417 TREE_OPERAND (*expr_p, 1))),
7418 TREE_TYPE (*expr_p));
7419 ret = MIN (ret, GS_OK);
7425 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p)))
7427 case tcc_comparison:
7428 /* Handle comparison of objects of non scalar mode aggregates
7429 with a call to memcmp. It would be nice to only have to do
7430 this for variable-sized objects, but then we'd have to allow
7431 the same nest of reference nodes we allow for MODIFY_EXPR and
7434 Compare scalar mode aggregates as scalar mode values. Using
7435 memcmp for them would be very inefficient at best, and is
7436 plain wrong if bitfields are involved. */
7438 tree type = TREE_TYPE (TREE_OPERAND (*expr_p, 1));
7440 /* Vector comparisons need no boolification. */
7441 if (TREE_CODE (type) == VECTOR_TYPE)
7443 else if (!AGGREGATE_TYPE_P (type))
7445 tree org_type = TREE_TYPE (*expr_p);
7446 *expr_p = gimple_boolify (*expr_p);
7447 if (!useless_type_conversion_p (org_type,
7448 TREE_TYPE (*expr_p)))
7450 *expr_p = fold_convert_loc (input_location,
7457 else if (TYPE_MODE (type) != BLKmode)
7458 ret = gimplify_scalar_mode_aggregate_compare (expr_p);
7460 ret = gimplify_variable_sized_compare (expr_p);
7465 /* If *EXPR_P does not need to be special-cased, handle it
7466 according to its class. */
7468 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7469 post_p, is_gimple_val, fb_rvalue);
7475 enum gimplify_status r0, r1;
7477 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7478 post_p, is_gimple_val, fb_rvalue);
7479 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
7480 post_p, is_gimple_val, fb_rvalue);
7488 enum gimplify_status r0, r1, r2;
7490 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7491 post_p, is_gimple_val, fb_rvalue);
7492 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
7493 post_p, is_gimple_val, fb_rvalue);
7494 r2 = gimplify_expr (&TREE_OPERAND (*expr_p, 2), pre_p,
7495 post_p, is_gimple_val, fb_rvalue);
7497 ret = MIN (MIN (r0, r1), r2);
7501 case tcc_declaration:
7504 goto dont_recalculate;
7510 recalculate_side_effects (*expr_p);
7516 gcc_assert (*expr_p || ret != GS_OK);
7518 while (ret == GS_OK);
7520 /* If we encountered an error_mark somewhere nested inside, either
7521 stub out the statement or propagate the error back out. */
7522 if (ret == GS_ERROR)
7529 /* This was only valid as a return value from the langhook, which
7530 we handled. Make sure it doesn't escape from any other context. */
7531 gcc_assert (ret != GS_UNHANDLED);
7533 if (fallback == fb_none && *expr_p && !is_gimple_stmt (*expr_p))
7535 /* We aren't looking for a value, and we don't have a valid
7536 statement. If it doesn't have side-effects, throw it away. */
7537 if (!TREE_SIDE_EFFECTS (*expr_p))
7539 else if (!TREE_THIS_VOLATILE (*expr_p))
7541 /* This is probably a _REF that contains something nested that
7542 has side effects. Recurse through the operands to find it. */
7543 enum tree_code code = TREE_CODE (*expr_p);
7550 case VIEW_CONVERT_EXPR:
7551 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
7552 gimple_test_f, fallback);
7556 case ARRAY_RANGE_REF:
7557 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
7558 gimple_test_f, fallback);
7559 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
7560 gimple_test_f, fallback);
7564 /* Anything else with side-effects must be converted to
7565 a valid statement before we get here. */
7571 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p))
7572 && TYPE_MODE (TREE_TYPE (*expr_p)) != BLKmode)
7574 /* Historically, the compiler has treated a bare reference
7575 to a non-BLKmode volatile lvalue as forcing a load. */
7576 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p));
7578 /* Normally, we do not want to create a temporary for a
7579 TREE_ADDRESSABLE type because such a type should not be
7580 copied by bitwise-assignment. However, we make an
7581 exception here, as all we are doing here is ensuring that
7582 we read the bytes that make up the type. We use
7583 create_tmp_var_raw because create_tmp_var will abort when
7584 given a TREE_ADDRESSABLE type. */
7585 tree tmp = create_tmp_var_raw (type, "vol");
7586 gimple_add_tmp_var (tmp);
7587 gimplify_assign (tmp, *expr_p, pre_p);
7591 /* We can't do anything useful with a volatile reference to
7592 an incomplete type, so just throw it away. Likewise for
7593 a BLKmode type, since any implicit inner load should
7594 already have been turned into an explicit one by the
7595 gimplification process. */
7599 /* If we are gimplifying at the statement level, we're done. Tack
7600 everything together and return. */
7601 if (fallback == fb_none || is_statement)
7603 /* Since *EXPR_P has been converted into a GIMPLE tuple, clear
7604 it out for GC to reclaim it. */
7605 *expr_p = NULL_TREE;
7607 if (!gimple_seq_empty_p (internal_pre)
7608 || !gimple_seq_empty_p (internal_post))
7610 gimplify_seq_add_seq (&internal_pre, internal_post);
7611 gimplify_seq_add_seq (pre_p, internal_pre);
7614 /* The result of gimplifying *EXPR_P is going to be the last few
7615 statements in *PRE_P and *POST_P. Add location information
7616 to all the statements that were added by the gimplification
7618 if (!gimple_seq_empty_p (*pre_p))
7619 annotate_all_with_location_after (*pre_p, pre_last_gsi, input_location);
7621 if (!gimple_seq_empty_p (*post_p))
7622 annotate_all_with_location_after (*post_p, post_last_gsi,
7628 #ifdef ENABLE_GIMPLE_CHECKING
7631 enum tree_code code = TREE_CODE (*expr_p);
7632 /* These expressions should already be in gimple IR form. */
7633 gcc_assert (code != MODIFY_EXPR
7635 && code != BIND_EXPR
7636 && code != CATCH_EXPR
7637 && (code != COND_EXPR || gimplify_ctxp->allow_rhs_cond_expr)
7638 && code != EH_FILTER_EXPR
7639 && code != GOTO_EXPR
7640 && code != LABEL_EXPR
7641 && code != LOOP_EXPR
7642 && code != SWITCH_EXPR
7643 && code != TRY_FINALLY_EXPR
7644 && code != OMP_CRITICAL
7646 && code != OMP_MASTER
7647 && code != OMP_ORDERED
7648 && code != OMP_PARALLEL
7649 && code != OMP_SECTIONS
7650 && code != OMP_SECTION
7651 && code != OMP_SINGLE);
7655 /* Otherwise we're gimplifying a subexpression, so the resulting
7656 value is interesting. If it's a valid operand that matches
7657 GIMPLE_TEST_F, we're done. Unless we are handling some
7658 post-effects internally; if that's the case, we need to copy into
7659 a temporary before adding the post-effects to POST_P. */
7660 if (gimple_seq_empty_p (internal_post) && (*gimple_test_f) (*expr_p))
7663 /* Otherwise, we need to create a new temporary for the gimplified
7666 /* We can't return an lvalue if we have an internal postqueue. The
7667 object the lvalue refers to would (probably) be modified by the
7668 postqueue; we need to copy the value out first, which means an
7670 if ((fallback & fb_lvalue)
7671 && gimple_seq_empty_p (internal_post)
7672 && is_gimple_addressable (*expr_p))
7674 /* An lvalue will do. Take the address of the expression, store it
7675 in a temporary, and replace the expression with an INDIRECT_REF of
7677 tmp = build_fold_addr_expr_loc (input_location, *expr_p);
7678 gimplify_expr (&tmp, pre_p, post_p, is_gimple_reg, fb_rvalue);
7679 *expr_p = build_simple_mem_ref (tmp);
7681 else if ((fallback & fb_rvalue) && is_gimple_reg_rhs_or_call (*expr_p))
7683 /* An rvalue will do. Assign the gimplified expression into a
7684 new temporary TMP and replace the original expression with
7685 TMP. First, make sure that the expression has a type so that
7686 it can be assigned into a temporary. */
7687 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p)));
7689 if (!gimple_seq_empty_p (internal_post) || (fallback & fb_lvalue))
7690 /* The postqueue might change the value of the expression between
7691 the initialization and use of the temporary, so we can't use a
7692 formal temp. FIXME do we care? */
7694 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
7695 if (TREE_CODE (TREE_TYPE (*expr_p)) == COMPLEX_TYPE
7696 || TREE_CODE (TREE_TYPE (*expr_p)) == VECTOR_TYPE)
7697 DECL_GIMPLE_REG_P (*expr_p) = 1;
7700 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
7704 #ifdef ENABLE_GIMPLE_CHECKING
7705 if (!(fallback & fb_mayfail))
7707 fprintf (stderr, "gimplification failed:\n");
7708 print_generic_expr (stderr, *expr_p, 0);
7709 debug_tree (*expr_p);
7710 internal_error ("gimplification failed");
7713 gcc_assert (fallback & fb_mayfail);
7715 /* If this is an asm statement, and the user asked for the
7716 impossible, don't die. Fail and let gimplify_asm_expr
7722 /* Make sure the temporary matches our predicate. */
7723 gcc_assert ((*gimple_test_f) (*expr_p));
7725 if (!gimple_seq_empty_p (internal_post))
7727 annotate_all_with_location (internal_post, input_location);
7728 gimplify_seq_add_seq (pre_p, internal_post);
7732 input_location = saved_location;
7736 /* Look through TYPE for variable-sized objects and gimplify each such
7737 size that we find. Add to LIST_P any statements generated. */
7740 gimplify_type_sizes (tree type, gimple_seq *list_p)
7744 if (type == NULL || type == error_mark_node)
7747 /* We first do the main variant, then copy into any other variants. */
7748 type = TYPE_MAIN_VARIANT (type);
7750 /* Avoid infinite recursion. */
7751 if (TYPE_SIZES_GIMPLIFIED (type))
7754 TYPE_SIZES_GIMPLIFIED (type) = 1;
7756 switch (TREE_CODE (type))
7762 case FIXED_POINT_TYPE:
7763 gimplify_one_sizepos (&TYPE_MIN_VALUE (type), list_p);
7764 gimplify_one_sizepos (&TYPE_MAX_VALUE (type), list_p);
7766 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
7768 TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (type);
7769 TYPE_MAX_VALUE (t) = TYPE_MAX_VALUE (type);
7774 /* These types may not have declarations, so handle them here. */
7775 gimplify_type_sizes (TREE_TYPE (type), list_p);
7776 gimplify_type_sizes (TYPE_DOMAIN (type), list_p);
7777 /* Ensure VLA bounds aren't removed, for -O0 they should be variables
7778 with assigned stack slots, for -O1+ -g they should be tracked
7780 if (!(TYPE_NAME (type)
7781 && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
7782 && DECL_IGNORED_P (TYPE_NAME (type)))
7783 && TYPE_DOMAIN (type)
7784 && INTEGRAL_TYPE_P (TYPE_DOMAIN (type)))
7786 t = TYPE_MIN_VALUE (TYPE_DOMAIN (type));
7787 if (t && TREE_CODE (t) == VAR_DECL && DECL_ARTIFICIAL (t))
7788 DECL_IGNORED_P (t) = 0;
7789 t = TYPE_MAX_VALUE (TYPE_DOMAIN (type));
7790 if (t && TREE_CODE (t) == VAR_DECL && DECL_ARTIFICIAL (t))
7791 DECL_IGNORED_P (t) = 0;
7797 case QUAL_UNION_TYPE:
7798 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
7799 if (TREE_CODE (field) == FIELD_DECL)
7801 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field), list_p);
7802 gimplify_one_sizepos (&DECL_SIZE (field), list_p);
7803 gimplify_one_sizepos (&DECL_SIZE_UNIT (field), list_p);
7804 gimplify_type_sizes (TREE_TYPE (field), list_p);
7809 case REFERENCE_TYPE:
7810 /* We used to recurse on the pointed-to type here, which turned out to
7811 be incorrect because its definition might refer to variables not
7812 yet initialized at this point if a forward declaration is involved.
7814 It was actually useful for anonymous pointed-to types to ensure
7815 that the sizes evaluation dominates every possible later use of the
7816 values. Restricting to such types here would be safe since there
7817 is no possible forward declaration around, but would introduce an
7818 undesirable middle-end semantic to anonymity. We then defer to
7819 front-ends the responsibility of ensuring that the sizes are
7820 evaluated both early and late enough, e.g. by attaching artificial
7821 type declarations to the tree. */
7828 gimplify_one_sizepos (&TYPE_SIZE (type), list_p);
7829 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type), list_p);
7831 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
7833 TYPE_SIZE (t) = TYPE_SIZE (type);
7834 TYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (type);
7835 TYPE_SIZES_GIMPLIFIED (t) = 1;
7839 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
7840 a size or position, has had all of its SAVE_EXPRs evaluated.
7841 We add any required statements to *STMT_P. */
7844 gimplify_one_sizepos (tree *expr_p, gimple_seq *stmt_p)
7846 tree type, expr = *expr_p;
7848 /* We don't do anything if the value isn't there, is constant, or contains
7849 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
7850 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
7851 will want to replace it with a new variable, but that will cause problems
7852 if this type is from outside the function. It's OK to have that here. */
7853 if (expr == NULL_TREE || TREE_CONSTANT (expr)
7854 || TREE_CODE (expr) == VAR_DECL
7855 || CONTAINS_PLACEHOLDER_P (expr))
7858 type = TREE_TYPE (expr);
7859 *expr_p = unshare_expr (expr);
7861 gimplify_expr (expr_p, stmt_p, NULL, is_gimple_val, fb_rvalue);
7864 /* Verify that we've an exact type match with the original expression.
7865 In particular, we do not wish to drop a "sizetype" in favour of a
7866 type of similar dimensions. We don't want to pollute the generic
7867 type-stripping code with this knowledge because it doesn't matter
7868 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
7869 and friends retain their "sizetype-ness". */
7870 if (TREE_TYPE (expr) != type
7871 && TREE_CODE (type) == INTEGER_TYPE
7872 && TYPE_IS_SIZETYPE (type))
7877 *expr_p = create_tmp_var (type, NULL);
7878 tmp = build1 (NOP_EXPR, type, expr);
7879 stmt = gimplify_assign (*expr_p, tmp, stmt_p);
7880 gimple_set_location (stmt, EXPR_LOC_OR_HERE (expr));
7884 /* Gimplify the body of statements pointed to by BODY_P and return a
7885 GIMPLE_BIND containing the sequence of GIMPLE statements
7886 corresponding to BODY_P. FNDECL is the function decl containing
7890 gimplify_body (tree *body_p, tree fndecl, bool do_parms)
7892 location_t saved_location = input_location;
7893 gimple_seq parm_stmts, seq;
7895 struct gimplify_ctx gctx;
7896 struct cgraph_node *cgn;
7898 timevar_push (TV_TREE_GIMPLIFY);
7900 /* Initialize for optimize_insn_for_s{ize,peed}_p possibly called during
7902 default_rtl_profile ();
7904 gcc_assert (gimplify_ctxp == NULL);
7905 push_gimplify_context (&gctx);
7907 /* Unshare most shared trees in the body and in that of any nested functions.
7908 It would seem we don't have to do this for nested functions because
7909 they are supposed to be output and then the outer function gimplified
7910 first, but the g++ front end doesn't always do it that way. */
7911 unshare_body (body_p, fndecl);
7912 unvisit_body (body_p, fndecl);
7914 cgn = cgraph_get_node (fndecl);
7915 if (cgn && cgn->origin)
7916 nonlocal_vlas = pointer_set_create ();
7918 /* Make sure input_location isn't set to something weird. */
7919 input_location = DECL_SOURCE_LOCATION (fndecl);
7921 /* Resolve callee-copies. This has to be done before processing
7922 the body so that DECL_VALUE_EXPR gets processed correctly. */
7923 parm_stmts = (do_parms) ? gimplify_parameters () : NULL;
7925 /* Gimplify the function's body. */
7927 gimplify_stmt (body_p, &seq);
7928 outer_bind = gimple_seq_first_stmt (seq);
7931 outer_bind = gimple_build_nop ();
7932 gimplify_seq_add_stmt (&seq, outer_bind);
7935 /* The body must contain exactly one statement, a GIMPLE_BIND. If this is
7936 not the case, wrap everything in a GIMPLE_BIND to make it so. */
7937 if (gimple_code (outer_bind) == GIMPLE_BIND
7938 && gimple_seq_first (seq) == gimple_seq_last (seq))
7941 outer_bind = gimple_build_bind (NULL_TREE, seq, NULL);
7943 *body_p = NULL_TREE;
7945 /* If we had callee-copies statements, insert them at the beginning
7946 of the function and clear DECL_VALUE_EXPR_P on the parameters. */
7947 if (!gimple_seq_empty_p (parm_stmts))
7951 gimplify_seq_add_seq (&parm_stmts, gimple_bind_body (outer_bind));
7952 gimple_bind_set_body (outer_bind, parm_stmts);
7954 for (parm = DECL_ARGUMENTS (current_function_decl);
7955 parm; parm = DECL_CHAIN (parm))
7956 if (DECL_HAS_VALUE_EXPR_P (parm))
7958 DECL_HAS_VALUE_EXPR_P (parm) = 0;
7959 DECL_IGNORED_P (parm) = 0;
7965 pointer_set_destroy (nonlocal_vlas);
7966 nonlocal_vlas = NULL;
7969 pop_gimplify_context (outer_bind);
7970 gcc_assert (gimplify_ctxp == NULL);
7973 verify_gimple_in_seq (gimple_bind_body (outer_bind));
7975 timevar_pop (TV_TREE_GIMPLIFY);
7976 input_location = saved_location;
7981 typedef char *char_p; /* For DEF_VEC_P. */
7983 DEF_VEC_ALLOC_P(char_p,heap);
7985 /* Return whether we should exclude FNDECL from instrumentation. */
7988 flag_instrument_functions_exclude_p (tree fndecl)
7990 VEC(char_p,heap) *vec;
7992 vec = (VEC(char_p,heap) *) flag_instrument_functions_exclude_functions;
7993 if (VEC_length (char_p, vec) > 0)
7999 name = lang_hooks.decl_printable_name (fndecl, 0);
8000 FOR_EACH_VEC_ELT (char_p, vec, i, s)
8001 if (strstr (name, s) != NULL)
8005 vec = (VEC(char_p,heap) *) flag_instrument_functions_exclude_files;
8006 if (VEC_length (char_p, vec) > 0)
8012 name = DECL_SOURCE_FILE (fndecl);
8013 FOR_EACH_VEC_ELT (char_p, vec, i, s)
8014 if (strstr (name, s) != NULL)
8021 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
8022 node for the function we want to gimplify.
8024 Return the sequence of GIMPLE statements corresponding to the body
8028 gimplify_function_tree (tree fndecl)
8030 tree oldfn, parm, ret;
8034 gcc_assert (!gimple_body (fndecl));
8036 oldfn = current_function_decl;
8037 current_function_decl = fndecl;
8038 if (DECL_STRUCT_FUNCTION (fndecl))
8039 push_cfun (DECL_STRUCT_FUNCTION (fndecl));
8041 push_struct_function (fndecl);
8043 for (parm = DECL_ARGUMENTS (fndecl); parm ; parm = DECL_CHAIN (parm))
8045 /* Preliminarily mark non-addressed complex variables as eligible
8046 for promotion to gimple registers. We'll transform their uses
8048 if ((TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
8049 || TREE_CODE (TREE_TYPE (parm)) == VECTOR_TYPE)
8050 && !TREE_THIS_VOLATILE (parm)
8051 && !needs_to_live_in_memory (parm))
8052 DECL_GIMPLE_REG_P (parm) = 1;
8055 ret = DECL_RESULT (fndecl);
8056 if ((TREE_CODE (TREE_TYPE (ret)) == COMPLEX_TYPE
8057 || TREE_CODE (TREE_TYPE (ret)) == VECTOR_TYPE)
8058 && !needs_to_live_in_memory (ret))
8059 DECL_GIMPLE_REG_P (ret) = 1;
8061 bind = gimplify_body (&DECL_SAVED_TREE (fndecl), fndecl, true);
8063 /* The tree body of the function is no longer needed, replace it
8064 with the new GIMPLE body. */
8065 seq = gimple_seq_alloc ();
8066 gimple_seq_add_stmt (&seq, bind);
8067 gimple_set_body (fndecl, seq);
8069 /* If we're instrumenting function entry/exit, then prepend the call to
8070 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
8071 catch the exit hook. */
8072 /* ??? Add some way to ignore exceptions for this TFE. */
8073 if (flag_instrument_function_entry_exit
8074 && !DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl)
8075 && !flag_instrument_functions_exclude_p (fndecl))
8080 gimple_seq cleanup = NULL, body = NULL;
8084 x = builtin_decl_implicit (BUILT_IN_RETURN_ADDRESS);
8085 call = gimple_build_call (x, 1, integer_zero_node);
8086 tmp_var = create_tmp_var (ptr_type_node, "return_addr");
8087 gimple_call_set_lhs (call, tmp_var);
8088 gimplify_seq_add_stmt (&cleanup, call);
8089 x = builtin_decl_implicit (BUILT_IN_PROFILE_FUNC_EXIT);
8090 call = gimple_build_call (x, 2,
8091 build_fold_addr_expr (current_function_decl),
8093 gimplify_seq_add_stmt (&cleanup, call);
8094 tf = gimple_build_try (seq, cleanup, GIMPLE_TRY_FINALLY);
8096 x = builtin_decl_implicit (BUILT_IN_RETURN_ADDRESS);
8097 call = gimple_build_call (x, 1, integer_zero_node);
8098 tmp_var = create_tmp_var (ptr_type_node, "return_addr");
8099 gimple_call_set_lhs (call, tmp_var);
8100 gimplify_seq_add_stmt (&body, call);
8101 x = builtin_decl_implicit (BUILT_IN_PROFILE_FUNC_ENTER);
8102 call = gimple_build_call (x, 2,
8103 build_fold_addr_expr (current_function_decl),
8105 gimplify_seq_add_stmt (&body, call);
8106 gimplify_seq_add_stmt (&body, tf);
8107 new_bind = gimple_build_bind (NULL, body, gimple_bind_block (bind));
8108 /* Clear the block for BIND, since it is no longer directly inside
8109 the function, but within a try block. */
8110 gimple_bind_set_block (bind, NULL);
8112 /* Replace the current function body with the body
8113 wrapped in the try/finally TF. */
8114 seq = gimple_seq_alloc ();
8115 gimple_seq_add_stmt (&seq, new_bind);
8116 gimple_set_body (fndecl, seq);
8119 DECL_SAVED_TREE (fndecl) = NULL_TREE;
8120 cfun->curr_properties = PROP_gimple_any;
8122 current_function_decl = oldfn;
8126 /* Some transformations like inlining may invalidate the GIMPLE form
8127 for operands. This function traverses all the operands in STMT and
8128 gimplifies anything that is not a valid gimple operand. Any new
8129 GIMPLE statements are inserted before *GSI_P. */
8132 gimple_regimplify_operands (gimple stmt, gimple_stmt_iterator *gsi_p)
8135 tree orig_lhs = NULL_TREE, lhs, t;
8136 gimple_seq pre = NULL;
8137 gimple post_stmt = NULL;
8138 struct gimplify_ctx gctx;
8140 push_gimplify_context (&gctx);
8141 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
8143 switch (gimple_code (stmt))
8146 gimplify_expr (gimple_cond_lhs_ptr (stmt), &pre, NULL,
8147 is_gimple_val, fb_rvalue);
8148 gimplify_expr (gimple_cond_rhs_ptr (stmt), &pre, NULL,
8149 is_gimple_val, fb_rvalue);
8152 gimplify_expr (gimple_switch_index_ptr (stmt), &pre, NULL,
8153 is_gimple_val, fb_rvalue);
8155 case GIMPLE_OMP_ATOMIC_LOAD:
8156 gimplify_expr (gimple_omp_atomic_load_rhs_ptr (stmt), &pre, NULL,
8157 is_gimple_val, fb_rvalue);
8161 size_t i, noutputs = gimple_asm_noutputs (stmt);
8162 const char *constraint, **oconstraints;
8163 bool allows_mem, allows_reg, is_inout;
8166 = (const char **) alloca ((noutputs) * sizeof (const char *));
8167 for (i = 0; i < noutputs; i++)
8169 tree op = gimple_asm_output_op (stmt, i);
8170 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
8171 oconstraints[i] = constraint;
8172 parse_output_constraint (&constraint, i, 0, 0, &allows_mem,
8173 &allows_reg, &is_inout);
8174 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
8175 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
8176 fb_lvalue | fb_mayfail);
8178 for (i = 0; i < gimple_asm_ninputs (stmt); i++)
8180 tree op = gimple_asm_input_op (stmt, i);
8181 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
8182 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
8183 oconstraints, &allows_mem, &allows_reg);
8184 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (op))) && allows_mem)
8186 if (!allows_reg && allows_mem)
8187 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
8188 is_gimple_lvalue, fb_lvalue | fb_mayfail);
8190 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
8191 is_gimple_asm_val, fb_rvalue);
8196 /* NOTE: We start gimplifying operands from last to first to
8197 make sure that side-effects on the RHS of calls, assignments
8198 and ASMs are executed before the LHS. The ordering is not
8199 important for other statements. */
8200 num_ops = gimple_num_ops (stmt);
8201 orig_lhs = gimple_get_lhs (stmt);
8202 for (i = num_ops; i > 0; i--)
8204 tree op = gimple_op (stmt, i - 1);
8205 if (op == NULL_TREE)
8207 if (i == 1 && (is_gimple_call (stmt) || is_gimple_assign (stmt)))
8208 gimplify_expr (&op, &pre, NULL, is_gimple_lvalue, fb_lvalue);
8210 && is_gimple_assign (stmt)
8212 && get_gimple_rhs_class (gimple_expr_code (stmt))
8213 == GIMPLE_SINGLE_RHS)
8214 gimplify_expr (&op, &pre, NULL,
8215 rhs_predicate_for (gimple_assign_lhs (stmt)),
8217 else if (i == 2 && is_gimple_call (stmt))
8219 if (TREE_CODE (op) == FUNCTION_DECL)
8221 gimplify_expr (&op, &pre, NULL, is_gimple_call_addr, fb_rvalue);
8224 gimplify_expr (&op, &pre, NULL, is_gimple_val, fb_rvalue);
8225 gimple_set_op (stmt, i - 1, op);
8228 lhs = gimple_get_lhs (stmt);
8229 /* If the LHS changed it in a way that requires a simple RHS,
8230 create temporary. */
8231 if (lhs && !is_gimple_reg (lhs))
8233 bool need_temp = false;
8235 if (is_gimple_assign (stmt)
8237 && get_gimple_rhs_class (gimple_expr_code (stmt))
8238 == GIMPLE_SINGLE_RHS)
8239 gimplify_expr (gimple_assign_rhs1_ptr (stmt), &pre, NULL,
8240 rhs_predicate_for (gimple_assign_lhs (stmt)),
8242 else if (is_gimple_reg (lhs))
8244 if (is_gimple_reg_type (TREE_TYPE (lhs)))
8246 if (is_gimple_call (stmt))
8248 i = gimple_call_flags (stmt);
8249 if ((i & ECF_LOOPING_CONST_OR_PURE)
8250 || !(i & (ECF_CONST | ECF_PURE)))
8253 if (stmt_can_throw_internal (stmt))
8259 if (is_gimple_reg_type (TREE_TYPE (lhs)))
8261 else if (TYPE_MODE (TREE_TYPE (lhs)) != BLKmode)
8263 if (is_gimple_call (stmt))
8265 tree fndecl = gimple_call_fndecl (stmt);
8267 if (!aggregate_value_p (TREE_TYPE (lhs), fndecl)
8268 && !(fndecl && DECL_RESULT (fndecl)
8269 && DECL_BY_REFERENCE (DECL_RESULT (fndecl))))
8278 tree temp = create_tmp_reg (TREE_TYPE (lhs), NULL);
8280 if (TREE_CODE (orig_lhs) == SSA_NAME)
8281 orig_lhs = SSA_NAME_VAR (orig_lhs);
8283 if (gimple_in_ssa_p (cfun))
8284 temp = make_ssa_name (temp, NULL);
8285 gimple_set_lhs (stmt, temp);
8286 post_stmt = gimple_build_assign (lhs, temp);
8287 if (TREE_CODE (lhs) == SSA_NAME)
8288 SSA_NAME_DEF_STMT (lhs) = post_stmt;
8294 if (gimple_referenced_vars (cfun))
8295 for (t = gimplify_ctxp->temps; t ; t = TREE_CHAIN (t))
8296 add_referenced_var (t);
8298 if (!gimple_seq_empty_p (pre))
8300 if (gimple_in_ssa_p (cfun))
8302 gimple_stmt_iterator i;
8304 for (i = gsi_start (pre); !gsi_end_p (i); gsi_next (&i))
8305 mark_symbols_for_renaming (gsi_stmt (i));
8307 gsi_insert_seq_before (gsi_p, pre, GSI_SAME_STMT);
8310 gsi_insert_after (gsi_p, post_stmt, GSI_NEW_STMT);
8312 pop_gimplify_context (NULL);
8315 /* Expand EXPR to list of gimple statements STMTS. GIMPLE_TEST_F specifies
8316 the predicate that will hold for the result. If VAR is not NULL, make the
8317 base variable of the final destination be VAR if suitable. */
8320 force_gimple_operand_1 (tree expr, gimple_seq *stmts,
8321 gimple_predicate gimple_test_f, tree var)
8324 enum gimplify_status ret;
8325 struct gimplify_ctx gctx;
8329 /* gimple_test_f might be more strict than is_gimple_val, make
8330 sure we pass both. Just checking gimple_test_f doesn't work
8331 because most gimple predicates do not work recursively. */
8332 if (is_gimple_val (expr)
8333 && (*gimple_test_f) (expr))
8336 push_gimplify_context (&gctx);
8337 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
8338 gimplify_ctxp->allow_rhs_cond_expr = true;
8341 expr = build2 (MODIFY_EXPR, TREE_TYPE (var), var, expr);
8343 if (TREE_CODE (expr) != MODIFY_EXPR
8344 && TREE_TYPE (expr) == void_type_node)
8346 gimplify_and_add (expr, stmts);
8351 ret = gimplify_expr (&expr, stmts, NULL, gimple_test_f, fb_rvalue);
8352 gcc_assert (ret != GS_ERROR);
8355 if (gimple_referenced_vars (cfun))
8356 for (t = gimplify_ctxp->temps; t ; t = DECL_CHAIN (t))
8357 add_referenced_var (t);
8359 pop_gimplify_context (NULL);
8364 /* Expand EXPR to list of gimple statements STMTS. If SIMPLE is true,
8365 force the result to be either ssa_name or an invariant, otherwise
8366 just force it to be a rhs expression. If VAR is not NULL, make the
8367 base variable of the final destination be VAR if suitable. */
8370 force_gimple_operand (tree expr, gimple_seq *stmts, bool simple, tree var)
8372 return force_gimple_operand_1 (expr, stmts,
8373 simple ? is_gimple_val : is_gimple_reg_rhs,
8377 /* Invoke force_gimple_operand_1 for EXPR with parameters GIMPLE_TEST_F
8378 and VAR. If some statements are produced, emits them at GSI.
8379 If BEFORE is true. the statements are appended before GSI, otherwise
8380 they are appended after it. M specifies the way GSI moves after
8381 insertion (GSI_SAME_STMT or GSI_CONTINUE_LINKING are the usual values). */
8384 force_gimple_operand_gsi_1 (gimple_stmt_iterator *gsi, tree expr,
8385 gimple_predicate gimple_test_f,
8386 tree var, bool before,
8387 enum gsi_iterator_update m)
8391 expr = force_gimple_operand_1 (expr, &stmts, gimple_test_f, var);
8393 if (!gimple_seq_empty_p (stmts))
8395 if (gimple_in_ssa_p (cfun))
8397 gimple_stmt_iterator i;
8399 for (i = gsi_start (stmts); !gsi_end_p (i); gsi_next (&i))
8400 mark_symbols_for_renaming (gsi_stmt (i));
8404 gsi_insert_seq_before (gsi, stmts, m);
8406 gsi_insert_seq_after (gsi, stmts, m);
8412 /* Invoke force_gimple_operand_1 for EXPR with parameter VAR.
8413 If SIMPLE is true, force the result to be either ssa_name or an invariant,
8414 otherwise just force it to be a rhs expression. If some statements are
8415 produced, emits them at GSI. If BEFORE is true, the statements are
8416 appended before GSI, otherwise they are appended after it. M specifies
8417 the way GSI moves after insertion (GSI_SAME_STMT or GSI_CONTINUE_LINKING
8418 are the usual values). */
8421 force_gimple_operand_gsi (gimple_stmt_iterator *gsi, tree expr,
8422 bool simple_p, tree var, bool before,
8423 enum gsi_iterator_update m)
8425 return force_gimple_operand_gsi_1 (gsi, expr,
8427 ? is_gimple_val : is_gimple_reg_rhs,
8432 #include "gt-gimplify.h"