1 /* Tree lowering pass. This pass converts the GENERIC functions-as-trees
2 tree representation into the GIMPLE form.
3 Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
5 Major work done by Sebastian Pop <s.pop@laposte.net>,
6 Diego Novillo <dnovillo@redhat.com> and Jason Merrill <jason@redhat.com>.
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify it under
11 the terms of the GNU General Public License as published by the Free
12 Software Foundation; either version 3, or (at your option) any later
15 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
16 WARRANTY; without even the implied warranty of MERCHANTABILITY or
17 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
26 #include "coretypes.h"
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"
45 #include "pointer-set.h"
46 #include "splay-tree.h"
49 #include "tree-pass.h"
51 #include "langhooks-def.h" /* FIXME: for lhd_set_decl_assembler_name. */
52 #include "expr.h" /* FIXME: for can_move_by_pieces
53 and STACK_CHECK_MAX_VAR_SIZE. */
55 enum gimplify_omp_var_data
61 GOVD_FIRSTPRIVATE = 16,
62 GOVD_LASTPRIVATE = 32,
65 GOVD_DEBUG_PRIVATE = 256,
66 GOVD_PRIVATE_OUTER_REF = 512,
67 GOVD_DATA_SHARE_CLASS = (GOVD_SHARED | GOVD_PRIVATE | GOVD_FIRSTPRIVATE
68 | GOVD_LASTPRIVATE | GOVD_REDUCTION | GOVD_LOCAL)
76 ORT_COMBINED_PARALLEL = 3,
81 struct gimplify_omp_ctx
83 struct gimplify_omp_ctx *outer_context;
85 struct pointer_set_t *privatized_types;
87 enum omp_clause_default_kind default_kind;
88 enum omp_region_type region_type;
91 static struct gimplify_ctx *gimplify_ctxp;
92 static struct gimplify_omp_ctx *gimplify_omp_ctxp;
95 /* Formal (expression) temporary table handling: Multiple occurrences of
96 the same scalar expression are evaluated into the same temporary. */
98 typedef struct gimple_temp_hash_elt
101 tree temp; /* Value */
104 /* Forward declarations. */
105 static enum gimplify_status gimplify_compound_expr (tree *, gimple_seq *, bool);
107 /* Mark X addressable. Unlike the langhook we expect X to be in gimple
108 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 /* Only allow them to compare equal if they also hash equal; otherwise
150 results are nondeterminate, and we fail bootstrap comparison. */
151 gcc_assert (gimple_tree_hash (p1) == gimple_tree_hash (p2));
156 /* Link gimple statement GS to the end of the sequence *SEQ_P. If
157 *SEQ_P is NULL, a new sequence is allocated. This function is
158 similar to gimple_seq_add_stmt, but does not scan the operands.
159 During gimplification, we need to manipulate statement sequences
160 before the def/use vectors have been constructed. */
163 gimplify_seq_add_stmt (gimple_seq *seq_p, gimple gs)
165 gimple_stmt_iterator si;
171 *seq_p = gimple_seq_alloc ();
173 si = gsi_last (*seq_p);
175 gsi_insert_after_without_update (&si, gs, GSI_NEW_STMT);
178 /* Append sequence SRC to the end of sequence *DST_P. If *DST_P is
179 NULL, a new sequence is allocated. This function is
180 similar to gimple_seq_add_seq, but does not scan the operands.
181 During gimplification, we need to manipulate statement sequences
182 before the def/use vectors have been constructed. */
185 gimplify_seq_add_seq (gimple_seq *dst_p, gimple_seq src)
187 gimple_stmt_iterator si;
193 *dst_p = gimple_seq_alloc ();
195 si = gsi_last (*dst_p);
196 gsi_insert_seq_after_without_update (&si, src, GSI_NEW_STMT);
199 /* Set up a context for the gimplifier. */
202 push_gimplify_context (struct gimplify_ctx *c)
204 memset (c, '\0', sizeof (*c));
205 c->prev_context = gimplify_ctxp;
209 /* Tear down a context for the gimplifier. If BODY is non-null, then
210 put the temporaries into the outer BIND_EXPR. Otherwise, put them
213 BODY is not a sequence, but the first tuple in a sequence. */
216 pop_gimplify_context (gimple body)
218 struct gimplify_ctx *c = gimplify_ctxp;
220 gcc_assert (c && (c->bind_expr_stack == NULL
221 || VEC_empty (gimple, c->bind_expr_stack)));
222 VEC_free (gimple, heap, c->bind_expr_stack);
223 gimplify_ctxp = c->prev_context;
226 declare_vars (c->temps, body, false);
228 record_vars (c->temps);
231 htab_delete (c->temp_htab);
235 gimple_push_bind_expr (gimple gimple_bind)
237 if (gimplify_ctxp->bind_expr_stack == NULL)
238 gimplify_ctxp->bind_expr_stack = VEC_alloc (gimple, heap, 8);
239 VEC_safe_push (gimple, heap, gimplify_ctxp->bind_expr_stack, gimple_bind);
243 gimple_pop_bind_expr (void)
245 VEC_pop (gimple, gimplify_ctxp->bind_expr_stack);
249 gimple_current_bind_expr (void)
251 return VEC_last (gimple, gimplify_ctxp->bind_expr_stack);
254 /* Return the stack GIMPLE_BINDs created during gimplification. */
257 gimple_bind_expr_stack (void)
259 return gimplify_ctxp->bind_expr_stack;
262 /* Returns true iff there is a COND_EXPR between us and the innermost
263 CLEANUP_POINT_EXPR. This info is used by gimple_push_cleanup. */
266 gimple_conditional_context (void)
268 return gimplify_ctxp->conditions > 0;
271 /* Note that we've entered a COND_EXPR. */
274 gimple_push_condition (void)
276 #ifdef ENABLE_GIMPLE_CHECKING
277 if (gimplify_ctxp->conditions == 0)
278 gcc_assert (gimple_seq_empty_p (gimplify_ctxp->conditional_cleanups));
280 ++(gimplify_ctxp->conditions);
283 /* Note that we've left a COND_EXPR. If we're back at unconditional scope
284 now, add any conditional cleanups we've seen to the prequeue. */
287 gimple_pop_condition (gimple_seq *pre_p)
289 int conds = --(gimplify_ctxp->conditions);
291 gcc_assert (conds >= 0);
294 gimplify_seq_add_seq (pre_p, gimplify_ctxp->conditional_cleanups);
295 gimplify_ctxp->conditional_cleanups = NULL;
299 /* A stable comparison routine for use with splay trees and DECLs. */
302 splay_tree_compare_decl_uid (splay_tree_key xa, splay_tree_key xb)
307 return DECL_UID (a) - DECL_UID (b);
310 /* Create a new omp construct that deals with variable remapping. */
312 static struct gimplify_omp_ctx *
313 new_omp_context (enum omp_region_type region_type)
315 struct gimplify_omp_ctx *c;
317 c = XCNEW (struct gimplify_omp_ctx);
318 c->outer_context = gimplify_omp_ctxp;
319 c->variables = splay_tree_new (splay_tree_compare_decl_uid, 0, 0);
320 c->privatized_types = pointer_set_create ();
321 c->location = input_location;
322 c->region_type = region_type;
323 if ((region_type & ORT_TASK) == 0)
324 c->default_kind = OMP_CLAUSE_DEFAULT_SHARED;
326 c->default_kind = OMP_CLAUSE_DEFAULT_UNSPECIFIED;
331 /* Destroy an omp construct that deals with variable remapping. */
334 delete_omp_context (struct gimplify_omp_ctx *c)
336 splay_tree_delete (c->variables);
337 pointer_set_destroy (c->privatized_types);
341 static void omp_add_variable (struct gimplify_omp_ctx *, tree, unsigned int);
342 static bool omp_notice_variable (struct gimplify_omp_ctx *, tree, bool);
344 /* Both gimplify the statement T and append it to *SEQ_P. This function
345 behaves exactly as gimplify_stmt, but you don't have to pass T as a
349 gimplify_and_add (tree t, gimple_seq *seq_p)
351 gimplify_stmt (&t, seq_p);
354 /* Gimplify statement T into sequence *SEQ_P, and return the first
355 tuple in the sequence of generated tuples for this statement.
356 Return NULL if gimplifying T produced no tuples. */
359 gimplify_and_return_first (tree t, gimple_seq *seq_p)
361 gimple_stmt_iterator last = gsi_last (*seq_p);
363 gimplify_and_add (t, seq_p);
365 if (!gsi_end_p (last))
368 return gsi_stmt (last);
371 return gimple_seq_first_stmt (*seq_p);
374 /* Strip off a legitimate source ending from the input string NAME of
375 length LEN. Rather than having to know the names used by all of
376 our front ends, we strip off an ending of a period followed by
377 up to five characters. (Java uses ".class".) */
380 remove_suffix (char *name, int len)
384 for (i = 2; i < 8 && len > i; i++)
386 if (name[len - i] == '.')
388 name[len - i] = '\0';
394 /* Create a new temporary name with PREFIX. Returns an identifier. */
396 static GTY(()) unsigned int tmp_var_id_num;
399 create_tmp_var_name (const char *prefix)
405 char *preftmp = ASTRDUP (prefix);
407 remove_suffix (preftmp, strlen (preftmp));
411 ASM_FORMAT_PRIVATE_NAME (tmp_name, prefix ? prefix : "T", tmp_var_id_num++);
412 return get_identifier (tmp_name);
416 /* Create a new temporary variable declaration of type TYPE.
417 Does NOT push it into the current binding. */
420 create_tmp_var_raw (tree type, const char *prefix)
425 /* Make the type of the variable writable. */
426 new_type = build_type_variant (type, 0, 0);
427 TYPE_ATTRIBUTES (new_type) = TYPE_ATTRIBUTES (type);
429 tmp_var = build_decl (input_location,
430 VAR_DECL, prefix ? create_tmp_var_name (prefix) : NULL,
433 /* The variable was declared by the compiler. */
434 DECL_ARTIFICIAL (tmp_var) = 1;
435 /* And we don't want debug info for it. */
436 DECL_IGNORED_P (tmp_var) = 1;
438 /* Make the variable writable. */
439 TREE_READONLY (tmp_var) = 0;
441 DECL_EXTERNAL (tmp_var) = 0;
442 TREE_STATIC (tmp_var) = 0;
443 TREE_USED (tmp_var) = 1;
448 /* Create a new temporary variable declaration of type TYPE. DOES push the
449 variable into the current binding. Further, assume that this is called
450 only from gimplification or optimization, at which point the creation of
451 certain types are bugs. */
454 create_tmp_var (tree type, const char *prefix)
458 /* We don't allow types that are addressable (meaning we can't make copies),
459 or incomplete. We also used to reject every variable size objects here,
460 but now support those for which a constant upper bound can be obtained.
461 The processing for variable sizes is performed in gimple_add_tmp_var,
462 point at which it really matters and possibly reached via paths not going
463 through this function, e.g. after direct calls to create_tmp_var_raw. */
464 gcc_assert (!TREE_ADDRESSABLE (type) && COMPLETE_TYPE_P (type));
466 tmp_var = create_tmp_var_raw (type, prefix);
467 gimple_add_tmp_var (tmp_var);
471 /* Create a new temporary variable declaration of type TYPE by calling
472 create_tmp_var and if TYPE is a vector or a complex number, mark the new
473 temporary as gimple register. */
476 create_tmp_reg (tree type, const char *prefix)
480 tmp = create_tmp_var (type, prefix);
481 if (TREE_CODE (type) == COMPLEX_TYPE
482 || TREE_CODE (type) == VECTOR_TYPE)
483 DECL_GIMPLE_REG_P (tmp) = 1;
488 /* Create a temporary with a name derived from VAL. Subroutine of
489 lookup_tmp_var; nobody else should call this function. */
492 create_tmp_from_val (tree val)
494 return create_tmp_var (TREE_TYPE (val), get_name (val));
497 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
498 an existing expression temporary. */
501 lookup_tmp_var (tree val, bool is_formal)
505 /* If not optimizing, never really reuse a temporary. local-alloc
506 won't allocate any variable that is used in more than one basic
507 block, which means it will go into memory, causing much extra
508 work in reload and final and poorer code generation, outweighing
509 the extra memory allocation here. */
510 if (!optimize || !is_formal || TREE_SIDE_EFFECTS (val))
511 ret = create_tmp_from_val (val);
518 if (gimplify_ctxp->temp_htab == NULL)
519 gimplify_ctxp->temp_htab
520 = htab_create (1000, gimple_tree_hash, gimple_tree_eq, free);
521 slot = htab_find_slot (gimplify_ctxp->temp_htab, (void *)&elt, INSERT);
524 elt_p = XNEW (elt_t);
526 elt_p->temp = ret = create_tmp_from_val (val);
527 *slot = (void *) elt_p;
531 elt_p = (elt_t *) *slot;
540 /* Return true if T is a CALL_EXPR or an expression that can be
541 assigned to a temporary. Note that this predicate should only be
542 used during gimplification. See the rationale for this in
543 gimplify_modify_expr. */
546 is_gimple_reg_rhs_or_call (tree t)
548 return (get_gimple_rhs_class (TREE_CODE (t)) != GIMPLE_INVALID_RHS
549 || TREE_CODE (t) == CALL_EXPR);
552 /* Return true if T is a valid memory RHS or a CALL_EXPR. Note that
553 this predicate should only be used during gimplification. See the
554 rationale for this in gimplify_modify_expr. */
557 is_gimple_mem_rhs_or_call (tree t)
559 /* If we're dealing with a renamable type, either source or dest must be
560 a renamed variable. */
561 if (is_gimple_reg_type (TREE_TYPE (t)))
562 return is_gimple_val (t);
564 return (is_gimple_val (t) || is_gimple_lvalue (t)
565 || TREE_CODE (t) == CALL_EXPR);
568 /* Helper for get_formal_tmp_var and get_initialized_tmp_var. */
571 internal_get_tmp_var (tree val, gimple_seq *pre_p, gimple_seq *post_p,
576 /* Notice that we explicitly allow VAL to be a CALL_EXPR so that we
577 can create an INIT_EXPR and convert it into a GIMPLE_CALL below. */
578 gimplify_expr (&val, pre_p, post_p, is_gimple_reg_rhs_or_call,
581 t = lookup_tmp_var (val, is_formal);
584 && (TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
585 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE))
586 DECL_GIMPLE_REG_P (t) = 1;
588 mod = build2 (INIT_EXPR, TREE_TYPE (t), t, unshare_expr (val));
590 if (EXPR_HAS_LOCATION (val))
591 SET_EXPR_LOCATION (mod, EXPR_LOCATION (val));
593 SET_EXPR_LOCATION (mod, input_location);
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 /* Returns 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 /* Returns 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 /* Declares all the variables in VARS in SCOPE. If DEBUG_INFO is
638 true, 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);
702 gimple_add_tmp_var (tree tmp)
704 gcc_assert (!DECL_CHAIN (tmp) && !DECL_SEEN_IN_BIND_EXPR_P (tmp));
706 /* Later processing assumes that the object size is constant, which might
707 not be true at this point. Force the use of a constant upper bound in
709 if (!host_integerp (DECL_SIZE_UNIT (tmp), 1))
710 force_constant_size (tmp);
712 DECL_CONTEXT (tmp) = current_function_decl;
713 DECL_SEEN_IN_BIND_EXPR_P (tmp) = 1;
717 DECL_CHAIN (tmp) = gimplify_ctxp->temps;
718 gimplify_ctxp->temps = tmp;
720 /* Mark temporaries local within the nearest enclosing parallel. */
721 if (gimplify_omp_ctxp)
723 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
724 while (ctx && ctx->region_type == ORT_WORKSHARE)
725 ctx = ctx->outer_context;
727 omp_add_variable (ctx, tmp, GOVD_LOCAL | GOVD_SEEN);
736 /* This case is for nested functions. We need to expose the locals
738 body_seq = gimple_body (current_function_decl);
739 declare_vars (tmp, gimple_seq_first_stmt (body_seq), false);
743 /* Determines whether to assign a location to the statement GS. */
746 should_carry_location_p (gimple gs)
748 /* Don't emit a line note for a label. We particularly don't want to
749 emit one for the break label, since it doesn't actually correspond
750 to the beginning of the loop/switch. */
751 if (gimple_code (gs) == GIMPLE_LABEL)
758 /* Return true if a location should not be emitted for this statement
759 by annotate_one_with_location. */
762 gimple_do_not_emit_location_p (gimple g)
764 return gimple_plf (g, GF_PLF_1);
767 /* Mark statement G so a location will not be emitted by
768 annotate_one_with_location. */
771 gimple_set_do_not_emit_location (gimple g)
773 /* The PLF flags are initialized to 0 when a new tuple is created,
774 so no need to initialize it anywhere. */
775 gimple_set_plf (g, GF_PLF_1, true);
778 /* Set the location for gimple statement GS to LOCATION. */
781 annotate_one_with_location (gimple gs, location_t location)
783 if (!gimple_has_location (gs)
784 && !gimple_do_not_emit_location_p (gs)
785 && should_carry_location_p (gs))
786 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);
808 /* Set the location for all the statements in a sequence STMT_P to LOCATION. */
811 annotate_all_with_location (gimple_seq stmt_p, location_t location)
813 gimple_stmt_iterator i;
815 if (gimple_seq_empty_p (stmt_p))
818 for (i = gsi_start (stmt_p); !gsi_end_p (i); gsi_next (&i))
820 gimple gs = gsi_stmt (i);
821 annotate_one_with_location (gs, location);
825 /* This page contains routines to unshare tree nodes, i.e. to duplicate tree
826 nodes that are referenced more than once in GENERIC functions. This is
827 necessary because gimplification (translation into GIMPLE) is performed
828 by modifying tree nodes in-place, so gimplication of a shared node in a
829 first context could generate an invalid GIMPLE form in a second context.
831 This is achieved with a simple mark/copy/unmark algorithm that walks the
832 GENERIC representation top-down, marks nodes with TREE_VISITED the first
833 time it encounters them, duplicates them if they already have TREE_VISITED
834 set, and finally removes the TREE_VISITED marks it has set.
836 The algorithm works only at the function level, i.e. it generates a GENERIC
837 representation of a function with no nodes shared within the function when
838 passed a GENERIC function (except for nodes that are allowed to be shared).
840 At the global level, it is also necessary to unshare tree nodes that are
841 referenced in more than one function, for the same aforementioned reason.
842 This requires some cooperation from the front-end. There are 2 strategies:
844 1. Manual unsharing. The front-end needs to call unshare_expr on every
845 expression that might end up being shared across functions.
847 2. Deep unsharing. This is an extension of regular unsharing. Instead
848 of calling unshare_expr on expressions that might be shared across
849 functions, the front-end pre-marks them with TREE_VISITED. This will
850 ensure that they are unshared on the first reference within functions
851 when the regular unsharing algorithm runs. The counterpart is that
852 this algorithm must look deeper than for manual unsharing, which is
853 specified by LANG_HOOKS_DEEP_UNSHARING.
855 If there are only few specific cases of node sharing across functions, it is
856 probably easier for a front-end to unshare the expressions manually. On the
857 contrary, if the expressions generated at the global level are as widespread
858 as expressions generated within functions, deep unsharing is very likely the
861 /* Similar to copy_tree_r but do not copy SAVE_EXPR or TARGET_EXPR nodes.
862 These nodes model computations that should only be done once. If we
863 were to unshare something like SAVE_EXPR(i++), the gimplification
864 process would create wrong code. */
867 mostly_copy_tree_r (tree *tp, int *walk_subtrees, void *data)
870 enum tree_code code = TREE_CODE (t);
872 /* Do not copy SAVE_EXPR, TARGET_EXPR or BIND_EXPR nodes themselves, but
873 copy their subtrees if we can make sure to do it only once. */
874 if (code == SAVE_EXPR || code == TARGET_EXPR || code == BIND_EXPR)
876 if (data && !pointer_set_insert ((struct pointer_set_t *)data, t))
882 /* Stop at types, decls, constants like copy_tree_r. */
883 else if (TREE_CODE_CLASS (code) == tcc_type
884 || TREE_CODE_CLASS (code) == tcc_declaration
885 || TREE_CODE_CLASS (code) == tcc_constant
886 /* We can't do anything sensible with a BLOCK used as an
887 expression, but we also can't just die when we see it
888 because of non-expression uses. So we avert our eyes
889 and cross our fingers. Silly Java. */
893 /* Cope with the statement expression extension. */
894 else if (code == STATEMENT_LIST)
897 /* Leave the bulk of the work to copy_tree_r itself. */
899 copy_tree_r (tp, walk_subtrees, NULL);
904 /* Callback for walk_tree to unshare most of the shared trees rooted at
905 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
906 then *TP is deep copied by calling mostly_copy_tree_r. */
909 copy_if_shared_r (tree *tp, int *walk_subtrees, void *data)
912 enum tree_code code = TREE_CODE (t);
914 /* Skip types, decls, and constants. But we do want to look at their
915 types and the bounds of types. Mark them as visited so we properly
916 unmark their subtrees on the unmark pass. If we've already seen them,
917 don't look down further. */
918 if (TREE_CODE_CLASS (code) == tcc_type
919 || TREE_CODE_CLASS (code) == tcc_declaration
920 || TREE_CODE_CLASS (code) == tcc_constant)
922 if (TREE_VISITED (t))
925 TREE_VISITED (t) = 1;
928 /* If this node has been visited already, unshare it and don't look
930 else if (TREE_VISITED (t))
932 walk_tree (tp, mostly_copy_tree_r, data, NULL);
936 /* Otherwise, mark the node as visited and keep looking. */
938 TREE_VISITED (t) = 1;
943 /* Unshare most of the shared trees rooted at *TP. */
946 copy_if_shared (tree *tp)
948 /* If the language requires deep unsharing, we need a pointer set to make
949 sure we don't repeatedly unshare subtrees of unshareable nodes. */
950 struct pointer_set_t *visited
951 = lang_hooks.deep_unsharing ? pointer_set_create () : NULL;
952 walk_tree (tp, copy_if_shared_r, visited, NULL);
954 pointer_set_destroy (visited);
957 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
958 bodies of any nested functions if we are unsharing the entire body of
962 unshare_body (tree *body_p, tree fndecl)
964 struct cgraph_node *cgn = cgraph_node (fndecl);
966 copy_if_shared (body_p);
968 if (body_p == &DECL_SAVED_TREE (fndecl))
969 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
970 unshare_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
973 /* Callback for walk_tree to unmark the visited trees rooted at *TP.
974 Subtrees are walked until the first unvisited node is encountered. */
977 unmark_visited_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
981 /* If this node has been visited, unmark it and keep looking. */
982 if (TREE_VISITED (t))
983 TREE_VISITED (t) = 0;
985 /* Otherwise, don't look any deeper. */
992 /* Unmark the visited trees rooted at *TP. */
995 unmark_visited (tree *tp)
997 walk_tree (tp, unmark_visited_r, NULL, NULL);
1000 /* Likewise, but mark all trees as not visited. */
1003 unvisit_body (tree *body_p, tree fndecl)
1005 struct cgraph_node *cgn = cgraph_node (fndecl);
1007 unmark_visited (body_p);
1009 if (body_p == &DECL_SAVED_TREE (fndecl))
1010 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
1011 unvisit_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
1014 /* Unconditionally make an unshared copy of EXPR. This is used when using
1015 stored expressions which span multiple functions, such as BINFO_VTABLE,
1016 as the normal unsharing process can't tell that they're shared. */
1019 unshare_expr (tree expr)
1021 walk_tree (&expr, mostly_copy_tree_r, NULL, NULL);
1025 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
1026 contain statements and have a value. Assign its value to a temporary
1027 and give it void_type_node. Returns the temporary, or NULL_TREE if
1028 WRAPPER was already void. */
1031 voidify_wrapper_expr (tree wrapper, tree temp)
1033 tree type = TREE_TYPE (wrapper);
1034 if (type && !VOID_TYPE_P (type))
1038 /* Set p to point to the body of the wrapper. Loop until we find
1039 something that isn't a wrapper. */
1040 for (p = &wrapper; p && *p; )
1042 switch (TREE_CODE (*p))
1045 TREE_SIDE_EFFECTS (*p) = 1;
1046 TREE_TYPE (*p) = void_type_node;
1047 /* For a BIND_EXPR, the body is operand 1. */
1048 p = &BIND_EXPR_BODY (*p);
1051 case CLEANUP_POINT_EXPR:
1052 case TRY_FINALLY_EXPR:
1053 case TRY_CATCH_EXPR:
1054 TREE_SIDE_EFFECTS (*p) = 1;
1055 TREE_TYPE (*p) = void_type_node;
1056 p = &TREE_OPERAND (*p, 0);
1059 case STATEMENT_LIST:
1061 tree_stmt_iterator i = tsi_last (*p);
1062 TREE_SIDE_EFFECTS (*p) = 1;
1063 TREE_TYPE (*p) = void_type_node;
1064 p = tsi_end_p (i) ? NULL : tsi_stmt_ptr (i);
1069 /* Advance to the last statement. Set all container types to void. */
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;
1083 if (p == NULL || IS_EMPTY_STMT (*p))
1087 /* The wrapper is on the RHS of an assignment that we're pushing
1089 gcc_assert (TREE_CODE (temp) == INIT_EXPR
1090 || TREE_CODE (temp) == MODIFY_EXPR);
1091 TREE_OPERAND (temp, 1) = *p;
1096 temp = create_tmp_var (type, "retval");
1097 *p = build2 (INIT_EXPR, type, temp, *p);
1106 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
1107 a temporary through which they communicate. */
1110 build_stack_save_restore (gimple *save, gimple *restore)
1114 *save = gimple_build_call (implicit_built_in_decls[BUILT_IN_STACK_SAVE], 0);
1115 tmp_var = create_tmp_var (ptr_type_node, "saved_stack");
1116 gimple_call_set_lhs (*save, tmp_var);
1118 *restore = gimple_build_call (implicit_built_in_decls[BUILT_IN_STACK_RESTORE],
1122 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
1124 static enum gimplify_status
1125 gimplify_bind_expr (tree *expr_p, gimple_seq *pre_p)
1127 tree bind_expr = *expr_p;
1128 bool old_save_stack = gimplify_ctxp->save_stack;
1133 tree temp = voidify_wrapper_expr (bind_expr, NULL);
1135 /* Mark variables seen in this bind expr. */
1136 for (t = BIND_EXPR_VARS (bind_expr); t ; t = DECL_CHAIN (t))
1138 if (TREE_CODE (t) == VAR_DECL)
1140 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
1142 /* Mark variable as local. */
1143 if (ctx && !is_global_var (t)
1144 && (! DECL_SEEN_IN_BIND_EXPR_P (t)
1145 || splay_tree_lookup (ctx->variables,
1146 (splay_tree_key) t) == NULL))
1147 omp_add_variable (gimplify_omp_ctxp, t, GOVD_LOCAL | GOVD_SEEN);
1149 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
1151 if (DECL_HARD_REGISTER (t) && !is_global_var (t) && cfun)
1152 cfun->has_local_explicit_reg_vars = true;
1155 /* Preliminarily mark non-addressed complex variables as eligible
1156 for promotion to gimple registers. We'll transform their uses
1158 if ((TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
1159 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
1160 && !TREE_THIS_VOLATILE (t)
1161 && (TREE_CODE (t) == VAR_DECL && !DECL_HARD_REGISTER (t))
1162 && !needs_to_live_in_memory (t))
1163 DECL_GIMPLE_REG_P (t) = 1;
1166 gimple_bind = gimple_build_bind (BIND_EXPR_VARS (bind_expr), NULL,
1167 BIND_EXPR_BLOCK (bind_expr));
1168 gimple_push_bind_expr (gimple_bind);
1170 gimplify_ctxp->save_stack = false;
1172 /* Gimplify the body into the GIMPLE_BIND tuple's body. */
1174 gimplify_stmt (&BIND_EXPR_BODY (bind_expr), &body);
1175 gimple_bind_set_body (gimple_bind, body);
1177 if (gimplify_ctxp->save_stack)
1179 gimple stack_save, stack_restore, gs;
1180 gimple_seq cleanup, new_body;
1182 /* Save stack on entry and restore it on exit. Add a try_finally
1183 block to achieve this. Note that mudflap depends on the
1184 format of the emitted code: see mx_register_decls(). */
1185 build_stack_save_restore (&stack_save, &stack_restore);
1187 cleanup = new_body = NULL;
1188 gimplify_seq_add_stmt (&cleanup, stack_restore);
1189 gs = gimple_build_try (gimple_bind_body (gimple_bind), cleanup,
1190 GIMPLE_TRY_FINALLY);
1192 gimplify_seq_add_stmt (&new_body, stack_save);
1193 gimplify_seq_add_stmt (&new_body, gs);
1194 gimple_bind_set_body (gimple_bind, new_body);
1197 gimplify_ctxp->save_stack = old_save_stack;
1198 gimple_pop_bind_expr ();
1200 gimplify_seq_add_stmt (pre_p, gimple_bind);
1208 *expr_p = NULL_TREE;
1212 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1213 GIMPLE value, it is assigned to a new temporary and the statement is
1214 re-written to return the temporary.
1216 PRE_P points to the sequence where side effects that must happen before
1217 STMT should be stored. */
1219 static enum gimplify_status
1220 gimplify_return_expr (tree stmt, gimple_seq *pre_p)
1223 tree ret_expr = TREE_OPERAND (stmt, 0);
1224 tree result_decl, result;
1226 if (ret_expr == error_mark_node)
1230 || TREE_CODE (ret_expr) == RESULT_DECL
1231 || ret_expr == error_mark_node)
1233 gimple ret = gimple_build_return (ret_expr);
1234 gimple_set_no_warning (ret, TREE_NO_WARNING (stmt));
1235 gimplify_seq_add_stmt (pre_p, ret);
1239 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
1240 result_decl = NULL_TREE;
1243 result_decl = TREE_OPERAND (ret_expr, 0);
1245 /* See through a return by reference. */
1246 if (TREE_CODE (result_decl) == INDIRECT_REF)
1247 result_decl = TREE_OPERAND (result_decl, 0);
1249 gcc_assert ((TREE_CODE (ret_expr) == MODIFY_EXPR
1250 || TREE_CODE (ret_expr) == INIT_EXPR)
1251 && TREE_CODE (result_decl) == RESULT_DECL);
1254 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1255 Recall that aggregate_value_p is FALSE for any aggregate type that is
1256 returned in registers. If we're returning values in registers, then
1257 we don't want to extend the lifetime of the RESULT_DECL, particularly
1258 across another call. In addition, for those aggregates for which
1259 hard_function_value generates a PARALLEL, we'll die during normal
1260 expansion of structure assignments; there's special code in expand_return
1261 to handle this case that does not exist in expand_expr. */
1264 else if (aggregate_value_p (result_decl, TREE_TYPE (current_function_decl)))
1266 if (TREE_CODE (DECL_SIZE (result_decl)) != INTEGER_CST)
1268 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (result_decl)))
1269 gimplify_type_sizes (TREE_TYPE (result_decl), pre_p);
1270 /* Note that we don't use gimplify_vla_decl because the RESULT_DECL
1271 should be effectively allocated by the caller, i.e. all calls to
1272 this function must be subject to the Return Slot Optimization. */
1273 gimplify_one_sizepos (&DECL_SIZE (result_decl), pre_p);
1274 gimplify_one_sizepos (&DECL_SIZE_UNIT (result_decl), pre_p);
1276 result = result_decl;
1278 else if (gimplify_ctxp->return_temp)
1279 result = gimplify_ctxp->return_temp;
1282 result = create_tmp_reg (TREE_TYPE (result_decl), NULL);
1284 /* ??? With complex control flow (usually involving abnormal edges),
1285 we can wind up warning about an uninitialized value for this. Due
1286 to how this variable is constructed and initialized, this is never
1287 true. Give up and never warn. */
1288 TREE_NO_WARNING (result) = 1;
1290 gimplify_ctxp->return_temp = result;
1293 /* Smash the lhs of the MODIFY_EXPR to the temporary we plan to use.
1294 Then gimplify the whole thing. */
1295 if (result != result_decl)
1296 TREE_OPERAND (ret_expr, 0) = result;
1298 gimplify_and_add (TREE_OPERAND (stmt, 0), pre_p);
1300 ret = gimple_build_return (result);
1301 gimple_set_no_warning (ret, TREE_NO_WARNING (stmt));
1302 gimplify_seq_add_stmt (pre_p, ret);
1308 gimplify_vla_decl (tree decl, gimple_seq *seq_p)
1310 /* This is a variable-sized decl. Simplify its size and mark it
1311 for deferred expansion. Note that mudflap depends on the format
1312 of the emitted code: see mx_register_decls(). */
1313 tree t, addr, ptr_type;
1315 gimplify_one_sizepos (&DECL_SIZE (decl), seq_p);
1316 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl), seq_p);
1318 /* All occurrences of this decl in final gimplified code will be
1319 replaced by indirection. Setting DECL_VALUE_EXPR does two
1320 things: First, it lets the rest of the gimplifier know what
1321 replacement to use. Second, it lets the debug info know
1322 where to find the value. */
1323 ptr_type = build_pointer_type (TREE_TYPE (decl));
1324 addr = create_tmp_var (ptr_type, get_name (decl));
1325 DECL_IGNORED_P (addr) = 0;
1326 t = build_fold_indirect_ref (addr);
1327 SET_DECL_VALUE_EXPR (decl, t);
1328 DECL_HAS_VALUE_EXPR_P (decl) = 1;
1330 t = built_in_decls[BUILT_IN_ALLOCA];
1331 t = build_call_expr (t, 1, DECL_SIZE_UNIT (decl));
1332 /* The call has been built for a variable-sized object. */
1333 ALLOCA_FOR_VAR_P (t) = 1;
1334 t = fold_convert (ptr_type, t);
1335 t = build2 (MODIFY_EXPR, TREE_TYPE (addr), addr, t);
1337 gimplify_and_add (t, seq_p);
1339 /* Indicate that we need to restore the stack level when the
1340 enclosing BIND_EXPR is exited. */
1341 gimplify_ctxp->save_stack = true;
1345 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
1346 and initialization explicit. */
1348 static enum gimplify_status
1349 gimplify_decl_expr (tree *stmt_p, gimple_seq *seq_p)
1351 tree stmt = *stmt_p;
1352 tree decl = DECL_EXPR_DECL (stmt);
1354 *stmt_p = NULL_TREE;
1356 if (TREE_TYPE (decl) == error_mark_node)
1359 if ((TREE_CODE (decl) == TYPE_DECL
1360 || TREE_CODE (decl) == VAR_DECL)
1361 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl)))
1362 gimplify_type_sizes (TREE_TYPE (decl), seq_p);
1364 if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl))
1366 tree init = DECL_INITIAL (decl);
1368 if (TREE_CODE (DECL_SIZE_UNIT (decl)) != INTEGER_CST
1369 || (!TREE_STATIC (decl)
1370 && flag_stack_check == GENERIC_STACK_CHECK
1371 && compare_tree_int (DECL_SIZE_UNIT (decl),
1372 STACK_CHECK_MAX_VAR_SIZE) > 0))
1373 gimplify_vla_decl (decl, seq_p);
1375 if (init && init != error_mark_node)
1377 if (!TREE_STATIC (decl))
1379 DECL_INITIAL (decl) = NULL_TREE;
1380 init = build2 (INIT_EXPR, void_type_node, decl, init);
1381 gimplify_and_add (init, seq_p);
1385 /* We must still examine initializers for static variables
1386 as they may contain a label address. */
1387 walk_tree (&init, force_labels_r, NULL, NULL);
1390 /* Some front ends do not explicitly declare all anonymous
1391 artificial variables. We compensate here by declaring the
1392 variables, though it would be better if the front ends would
1393 explicitly declare them. */
1394 if (!DECL_SEEN_IN_BIND_EXPR_P (decl)
1395 && DECL_ARTIFICIAL (decl) && DECL_NAME (decl) == NULL_TREE)
1396 gimple_add_tmp_var (decl);
1402 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1403 and replacing the LOOP_EXPR with goto, but if the loop contains an
1404 EXIT_EXPR, we need to append a label for it to jump to. */
1406 static enum gimplify_status
1407 gimplify_loop_expr (tree *expr_p, gimple_seq *pre_p)
1409 tree saved_label = gimplify_ctxp->exit_label;
1410 tree start_label = create_artificial_label (UNKNOWN_LOCATION);
1412 gimplify_seq_add_stmt (pre_p, gimple_build_label (start_label));
1414 gimplify_ctxp->exit_label = NULL_TREE;
1416 gimplify_and_add (LOOP_EXPR_BODY (*expr_p), pre_p);
1418 gimplify_seq_add_stmt (pre_p, gimple_build_goto (start_label));
1420 if (gimplify_ctxp->exit_label)
1421 gimplify_seq_add_stmt (pre_p, gimple_build_label (gimplify_ctxp->exit_label));
1423 gimplify_ctxp->exit_label = saved_label;
1429 /* Gimplifies a statement list onto a sequence. These may be created either
1430 by an enlightened front-end, or by shortcut_cond_expr. */
1432 static enum gimplify_status
1433 gimplify_statement_list (tree *expr_p, gimple_seq *pre_p)
1435 tree temp = voidify_wrapper_expr (*expr_p, NULL);
1437 tree_stmt_iterator i = tsi_start (*expr_p);
1439 while (!tsi_end_p (i))
1441 gimplify_stmt (tsi_stmt_ptr (i), pre_p);
1454 /* Compare two case labels. Because the front end should already have
1455 made sure that case ranges do not overlap, it is enough to only compare
1456 the CASE_LOW values of each case label. */
1459 compare_case_labels (const void *p1, const void *p2)
1461 const_tree const case1 = *(const_tree const*)p1;
1462 const_tree const case2 = *(const_tree const*)p2;
1464 /* The 'default' case label always goes first. */
1465 if (!CASE_LOW (case1))
1467 else if (!CASE_LOW (case2))
1470 return tree_int_cst_compare (CASE_LOW (case1), CASE_LOW (case2));
1474 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1477 sort_case_labels (VEC(tree,heap)* label_vec)
1479 size_t len = VEC_length (tree, label_vec);
1480 qsort (VEC_address (tree, label_vec), len, sizeof (tree),
1481 compare_case_labels);
1485 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1488 static enum gimplify_status
1489 gimplify_switch_expr (tree *expr_p, gimple_seq *pre_p)
1491 tree switch_expr = *expr_p;
1492 gimple_seq switch_body_seq = NULL;
1493 enum gimplify_status ret;
1495 ret = gimplify_expr (&SWITCH_COND (switch_expr), pre_p, NULL, is_gimple_val,
1497 if (ret == GS_ERROR || ret == GS_UNHANDLED)
1500 if (SWITCH_BODY (switch_expr))
1502 VEC (tree,heap) *labels;
1503 VEC (tree,heap) *saved_labels;
1504 tree default_case = NULL_TREE;
1506 gimple gimple_switch;
1508 /* If someone can be bothered to fill in the labels, they can
1509 be bothered to null out the body too. */
1510 gcc_assert (!SWITCH_LABELS (switch_expr));
1512 /* save old labels, get new ones from body, then restore the old
1513 labels. Save all the things from the switch body to append after. */
1514 saved_labels = gimplify_ctxp->case_labels;
1515 gimplify_ctxp->case_labels = VEC_alloc (tree, heap, 8);
1517 gimplify_stmt (&SWITCH_BODY (switch_expr), &switch_body_seq);
1518 labels = gimplify_ctxp->case_labels;
1519 gimplify_ctxp->case_labels = saved_labels;
1522 while (i < VEC_length (tree, labels))
1524 tree elt = VEC_index (tree, labels, i);
1525 tree low = CASE_LOW (elt);
1526 bool remove_element = FALSE;
1530 /* Discard empty ranges. */
1531 tree high = CASE_HIGH (elt);
1532 if (high && tree_int_cst_lt (high, low))
1533 remove_element = TRUE;
1537 /* The default case must be the last label in the list. */
1538 gcc_assert (!default_case);
1540 remove_element = TRUE;
1544 VEC_ordered_remove (tree, labels, i);
1550 if (!VEC_empty (tree, labels))
1551 sort_case_labels (labels);
1555 tree type = TREE_TYPE (switch_expr);
1557 /* If the switch has no default label, add one, so that we jump
1558 around the switch body. If the labels already cover the whole
1559 range of type, add the default label pointing to one of the
1561 if (type == void_type_node)
1562 type = TREE_TYPE (SWITCH_COND (switch_expr));
1564 && INTEGRAL_TYPE_P (type)
1565 && TYPE_MIN_VALUE (type)
1566 && TYPE_MAX_VALUE (type)
1567 && tree_int_cst_equal (CASE_LOW (VEC_index (tree, labels, 0)),
1568 TYPE_MIN_VALUE (type)))
1570 tree low, high = CASE_HIGH (VEC_index (tree, labels, len - 1));
1572 high = CASE_LOW (VEC_index (tree, labels, len - 1));
1573 if (tree_int_cst_equal (high, TYPE_MAX_VALUE (type)))
1575 for (i = 1; i < len; i++)
1577 high = CASE_LOW (VEC_index (tree, labels, i));
1578 low = CASE_HIGH (VEC_index (tree, labels, i - 1));
1580 low = CASE_LOW (VEC_index (tree, labels, i - 1));
1581 if ((TREE_INT_CST_LOW (low) + 1
1582 != TREE_INT_CST_LOW (high))
1583 || (TREE_INT_CST_HIGH (low)
1584 + (TREE_INT_CST_LOW (high) == 0)
1585 != TREE_INT_CST_HIGH (high)))
1589 default_case = build3 (CASE_LABEL_EXPR, void_type_node,
1590 NULL_TREE, NULL_TREE,
1591 CASE_LABEL (VEC_index (tree,
1601 = build3 (CASE_LABEL_EXPR, void_type_node,
1602 NULL_TREE, NULL_TREE,
1603 create_artificial_label (UNKNOWN_LOCATION));
1604 new_default = gimple_build_label (CASE_LABEL (default_case));
1605 gimplify_seq_add_stmt (&switch_body_seq, new_default);
1609 gimple_switch = gimple_build_switch_vec (SWITCH_COND (switch_expr),
1610 default_case, labels);
1611 gimplify_seq_add_stmt (pre_p, gimple_switch);
1612 gimplify_seq_add_seq (pre_p, switch_body_seq);
1613 VEC_free(tree, heap, labels);
1616 gcc_assert (SWITCH_LABELS (switch_expr));
1622 static enum gimplify_status
1623 gimplify_case_label_expr (tree *expr_p, gimple_seq *pre_p)
1625 struct gimplify_ctx *ctxp;
1626 gimple gimple_label;
1628 /* Invalid OpenMP programs can play Duff's Device type games with
1629 #pragma omp parallel. At least in the C front end, we don't
1630 detect such invalid branches until after gimplification. */
1631 for (ctxp = gimplify_ctxp; ; ctxp = ctxp->prev_context)
1632 if (ctxp->case_labels)
1635 gimple_label = gimple_build_label (CASE_LABEL (*expr_p));
1636 VEC_safe_push (tree, heap, ctxp->case_labels, *expr_p);
1637 gimplify_seq_add_stmt (pre_p, gimple_label);
1642 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1646 build_and_jump (tree *label_p)
1648 if (label_p == NULL)
1649 /* If there's nowhere to jump, just fall through. */
1652 if (*label_p == NULL_TREE)
1654 tree label = create_artificial_label (UNKNOWN_LOCATION);
1658 return build1 (GOTO_EXPR, void_type_node, *label_p);
1661 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1662 This also involves building a label to jump to and communicating it to
1663 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1665 static enum gimplify_status
1666 gimplify_exit_expr (tree *expr_p)
1668 tree cond = TREE_OPERAND (*expr_p, 0);
1671 expr = build_and_jump (&gimplify_ctxp->exit_label);
1672 expr = build3 (COND_EXPR, void_type_node, cond, expr, NULL_TREE);
1678 /* A helper function to be called via walk_tree. Mark all labels under *TP
1679 as being forced. To be called for DECL_INITIAL of static variables. */
1682 force_labels_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
1686 if (TREE_CODE (*tp) == LABEL_DECL)
1687 FORCED_LABEL (*tp) = 1;
1692 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1693 different from its canonical type, wrap the whole thing inside a
1694 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1697 The canonical type of a COMPONENT_REF is the type of the field being
1698 referenced--unless the field is a bit-field which can be read directly
1699 in a smaller mode, in which case the canonical type is the
1700 sign-appropriate type corresponding to that mode. */
1703 canonicalize_component_ref (tree *expr_p)
1705 tree expr = *expr_p;
1708 gcc_assert (TREE_CODE (expr) == COMPONENT_REF);
1710 if (INTEGRAL_TYPE_P (TREE_TYPE (expr)))
1711 type = TREE_TYPE (get_unwidened (expr, NULL_TREE));
1713 type = TREE_TYPE (TREE_OPERAND (expr, 1));
1715 /* One could argue that all the stuff below is not necessary for
1716 the non-bitfield case and declare it a FE error if type
1717 adjustment would be needed. */
1718 if (TREE_TYPE (expr) != type)
1720 #ifdef ENABLE_TYPES_CHECKING
1721 tree old_type = TREE_TYPE (expr);
1725 /* We need to preserve qualifiers and propagate them from
1727 type_quals = TYPE_QUALS (type)
1728 | TYPE_QUALS (TREE_TYPE (TREE_OPERAND (expr, 0)));
1729 if (TYPE_QUALS (type) != type_quals)
1730 type = build_qualified_type (TYPE_MAIN_VARIANT (type), type_quals);
1732 /* Set the type of the COMPONENT_REF to the underlying type. */
1733 TREE_TYPE (expr) = type;
1735 #ifdef ENABLE_TYPES_CHECKING
1736 /* It is now a FE error, if the conversion from the canonical
1737 type to the original expression type is not useless. */
1738 gcc_assert (useless_type_conversion_p (old_type, type));
1743 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1744 to foo, embed that change in the ADDR_EXPR by converting
1749 where L is the lower bound. For simplicity, only do this for constant
1751 The constraint is that the type of &array[L] is trivially convertible
1755 canonicalize_addr_expr (tree *expr_p)
1757 tree expr = *expr_p;
1758 tree addr_expr = TREE_OPERAND (expr, 0);
1759 tree datype, ddatype, pddatype;
1761 /* We simplify only conversions from an ADDR_EXPR to a pointer type. */
1762 if (!POINTER_TYPE_P (TREE_TYPE (expr))
1763 || TREE_CODE (addr_expr) != ADDR_EXPR)
1766 /* The addr_expr type should be a pointer to an array. */
1767 datype = TREE_TYPE (TREE_TYPE (addr_expr));
1768 if (TREE_CODE (datype) != ARRAY_TYPE)
1771 /* The pointer to element type shall be trivially convertible to
1772 the expression pointer type. */
1773 ddatype = TREE_TYPE (datype);
1774 pddatype = build_pointer_type (ddatype);
1775 if (!useless_type_conversion_p (TYPE_MAIN_VARIANT (TREE_TYPE (expr)),
1779 /* The lower bound and element sizes must be constant. */
1780 if (!TYPE_SIZE_UNIT (ddatype)
1781 || TREE_CODE (TYPE_SIZE_UNIT (ddatype)) != INTEGER_CST
1782 || !TYPE_DOMAIN (datype) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype))
1783 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype))) != INTEGER_CST)
1786 /* All checks succeeded. Build a new node to merge the cast. */
1787 *expr_p = build4 (ARRAY_REF, ddatype, TREE_OPERAND (addr_expr, 0),
1788 TYPE_MIN_VALUE (TYPE_DOMAIN (datype)),
1789 NULL_TREE, NULL_TREE);
1790 *expr_p = build1 (ADDR_EXPR, pddatype, *expr_p);
1792 /* We can have stripped a required restrict qualifier above. */
1793 if (!useless_type_conversion_p (TREE_TYPE (expr), TREE_TYPE (*expr_p)))
1794 *expr_p = fold_convert (TREE_TYPE (expr), *expr_p);
1797 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1798 underneath as appropriate. */
1800 static enum gimplify_status
1801 gimplify_conversion (tree *expr_p)
1804 location_t loc = EXPR_LOCATION (*expr_p);
1805 gcc_assert (CONVERT_EXPR_P (*expr_p));
1807 /* Then strip away all but the outermost conversion. */
1808 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p, 0));
1810 /* And remove the outermost conversion if it's useless. */
1811 if (tree_ssa_useless_type_conversion (*expr_p))
1812 *expr_p = TREE_OPERAND (*expr_p, 0);
1814 /* Attempt to avoid NOP_EXPR by producing reference to a subtype.
1815 For example this fold (subclass *)&A into &A->subclass avoiding
1816 a need for statement. */
1817 if (CONVERT_EXPR_P (*expr_p)
1818 && POINTER_TYPE_P (TREE_TYPE (*expr_p))
1819 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p, 0)))
1820 && (tem = maybe_fold_offset_to_address
1821 (EXPR_LOCATION (*expr_p), TREE_OPERAND (*expr_p, 0),
1822 integer_zero_node, TREE_TYPE (*expr_p))) != NULL_TREE)
1825 /* If we still have a conversion at the toplevel,
1826 then canonicalize some constructs. */
1827 if (CONVERT_EXPR_P (*expr_p))
1829 tree sub = TREE_OPERAND (*expr_p, 0);
1831 /* If a NOP conversion is changing the type of a COMPONENT_REF
1832 expression, then canonicalize its type now in order to expose more
1833 redundant conversions. */
1834 if (TREE_CODE (sub) == COMPONENT_REF)
1835 canonicalize_component_ref (&TREE_OPERAND (*expr_p, 0));
1837 /* If a NOP conversion is changing a pointer to array of foo
1838 to a pointer to foo, embed that change in the ADDR_EXPR. */
1839 else if (TREE_CODE (sub) == ADDR_EXPR)
1840 canonicalize_addr_expr (expr_p);
1843 /* If we have a conversion to a non-register type force the
1844 use of a VIEW_CONVERT_EXPR instead. */
1845 if (CONVERT_EXPR_P (*expr_p) && !is_gimple_reg_type (TREE_TYPE (*expr_p)))
1846 *expr_p = fold_build1_loc (loc, VIEW_CONVERT_EXPR, TREE_TYPE (*expr_p),
1847 TREE_OPERAND (*expr_p, 0));
1852 /* Nonlocal VLAs seen in the current function. */
1853 static struct pointer_set_t *nonlocal_vlas;
1855 /* Gimplify a VAR_DECL or PARM_DECL. Returns GS_OK if we expanded a
1856 DECL_VALUE_EXPR, and it's worth re-examining things. */
1858 static enum gimplify_status
1859 gimplify_var_or_parm_decl (tree *expr_p)
1861 tree decl = *expr_p;
1863 /* ??? If this is a local variable, and it has not been seen in any
1864 outer BIND_EXPR, then it's probably the result of a duplicate
1865 declaration, for which we've already issued an error. It would
1866 be really nice if the front end wouldn't leak these at all.
1867 Currently the only known culprit is C++ destructors, as seen
1868 in g++.old-deja/g++.jason/binding.C. */
1869 if (TREE_CODE (decl) == VAR_DECL
1870 && !DECL_SEEN_IN_BIND_EXPR_P (decl)
1871 && !TREE_STATIC (decl) && !DECL_EXTERNAL (decl)
1872 && decl_function_context (decl) == current_function_decl)
1874 gcc_assert (seen_error ());
1878 /* When within an OpenMP context, notice uses of variables. */
1879 if (gimplify_omp_ctxp && omp_notice_variable (gimplify_omp_ctxp, decl, true))
1882 /* If the decl is an alias for another expression, substitute it now. */
1883 if (DECL_HAS_VALUE_EXPR_P (decl))
1885 tree value_expr = DECL_VALUE_EXPR (decl);
1887 /* For referenced nonlocal VLAs add a decl for debugging purposes
1888 to the current function. */
1889 if (TREE_CODE (decl) == VAR_DECL
1890 && TREE_CODE (DECL_SIZE_UNIT (decl)) != INTEGER_CST
1891 && nonlocal_vlas != NULL
1892 && TREE_CODE (value_expr) == INDIRECT_REF
1893 && TREE_CODE (TREE_OPERAND (value_expr, 0)) == VAR_DECL
1894 && decl_function_context (decl) != current_function_decl)
1896 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
1897 while (ctx && ctx->region_type == ORT_WORKSHARE)
1898 ctx = ctx->outer_context;
1899 if (!ctx && !pointer_set_insert (nonlocal_vlas, decl))
1901 tree copy = copy_node (decl), block;
1903 lang_hooks.dup_lang_specific_decl (copy);
1904 SET_DECL_RTL (copy, 0);
1905 TREE_USED (copy) = 1;
1906 block = DECL_INITIAL (current_function_decl);
1907 DECL_CHAIN (copy) = BLOCK_VARS (block);
1908 BLOCK_VARS (block) = copy;
1909 SET_DECL_VALUE_EXPR (copy, unshare_expr (value_expr));
1910 DECL_HAS_VALUE_EXPR_P (copy) = 1;
1914 *expr_p = unshare_expr (value_expr);
1922 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1926 : min_lval '[' val ']'
1928 | compound_lval '[' val ']'
1929 | compound_lval '.' ID
1931 This is not part of the original SIMPLE definition, which separates
1932 array and member references, but it seems reasonable to handle them
1933 together. Also, this way we don't run into problems with union
1934 aliasing; gcc requires that for accesses through a union to alias, the
1935 union reference must be explicit, which was not always the case when we
1936 were splitting up array and member refs.
1938 PRE_P points to the sequence where side effects that must happen before
1939 *EXPR_P should be stored.
1941 POST_P points to the sequence where side effects that must happen after
1942 *EXPR_P should be stored. */
1944 static enum gimplify_status
1945 gimplify_compound_lval (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
1946 fallback_t fallback)
1949 VEC(tree,heap) *stack;
1950 enum gimplify_status ret = GS_ALL_DONE, tret;
1952 location_t loc = EXPR_LOCATION (*expr_p);
1953 tree expr = *expr_p;
1955 /* Create a stack of the subexpressions so later we can walk them in
1956 order from inner to outer. */
1957 stack = VEC_alloc (tree, heap, 10);
1959 /* We can handle anything that get_inner_reference can deal with. */
1960 for (p = expr_p; ; p = &TREE_OPERAND (*p, 0))
1963 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1964 if (TREE_CODE (*p) == INDIRECT_REF)
1965 *p = fold_indirect_ref_loc (loc, *p);
1967 if (handled_component_p (*p))
1969 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
1970 additional COMPONENT_REFs. */
1971 else if ((TREE_CODE (*p) == VAR_DECL || TREE_CODE (*p) == PARM_DECL)
1972 && gimplify_var_or_parm_decl (p) == GS_OK)
1977 VEC_safe_push (tree, heap, stack, *p);
1980 gcc_assert (VEC_length (tree, stack));
1982 /* Now STACK is a stack of pointers to all the refs we've walked through
1983 and P points to the innermost expression.
1985 Java requires that we elaborated nodes in source order. That
1986 means we must gimplify the inner expression followed by each of
1987 the indices, in order. But we can't gimplify the inner
1988 expression until we deal with any variable bounds, sizes, or
1989 positions in order to deal with PLACEHOLDER_EXPRs.
1991 So we do this in three steps. First we deal with the annotations
1992 for any variables in the components, then we gimplify the base,
1993 then we gimplify any indices, from left to right. */
1994 for (i = VEC_length (tree, stack) - 1; i >= 0; i--)
1996 tree t = VEC_index (tree, stack, i);
1998 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
2000 /* Gimplify the low bound and element type size and put them into
2001 the ARRAY_REF. If these values are set, they have already been
2003 if (TREE_OPERAND (t, 2) == NULL_TREE)
2005 tree low = unshare_expr (array_ref_low_bound (t));
2006 if (!is_gimple_min_invariant (low))
2008 TREE_OPERAND (t, 2) = low;
2009 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p,
2010 post_p, is_gimple_reg,
2012 ret = MIN (ret, tret);
2016 if (!TREE_OPERAND (t, 3))
2018 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (t, 0)));
2019 tree elmt_size = unshare_expr (array_ref_element_size (t));
2020 tree factor = size_int (TYPE_ALIGN_UNIT (elmt_type));
2022 /* Divide the element size by the alignment of the element
2024 elmt_size = size_binop_loc (loc, EXACT_DIV_EXPR, elmt_size, factor);
2026 if (!is_gimple_min_invariant (elmt_size))
2028 TREE_OPERAND (t, 3) = elmt_size;
2029 tret = gimplify_expr (&TREE_OPERAND (t, 3), pre_p,
2030 post_p, is_gimple_reg,
2032 ret = MIN (ret, tret);
2036 else if (TREE_CODE (t) == COMPONENT_REF)
2038 /* Set the field offset into T and gimplify it. */
2039 if (!TREE_OPERAND (t, 2))
2041 tree offset = unshare_expr (component_ref_field_offset (t));
2042 tree field = TREE_OPERAND (t, 1);
2044 = size_int (DECL_OFFSET_ALIGN (field) / BITS_PER_UNIT);
2046 /* Divide the offset by its alignment. */
2047 offset = size_binop_loc (loc, EXACT_DIV_EXPR, offset, factor);
2049 if (!is_gimple_min_invariant (offset))
2051 TREE_OPERAND (t, 2) = offset;
2052 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p,
2053 post_p, is_gimple_reg,
2055 ret = MIN (ret, tret);
2061 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
2062 so as to match the min_lval predicate. Failure to do so may result
2063 in the creation of large aggregate temporaries. */
2064 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval,
2065 fallback | fb_lvalue);
2066 ret = MIN (ret, tret);
2068 /* And finally, the indices and operands to BIT_FIELD_REF. During this
2069 loop we also remove any useless conversions. */
2070 for (; VEC_length (tree, stack) > 0; )
2072 tree t = VEC_pop (tree, stack);
2074 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
2076 /* Gimplify the dimension. */
2077 if (!is_gimple_min_invariant (TREE_OPERAND (t, 1)))
2079 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
2080 is_gimple_val, fb_rvalue);
2081 ret = MIN (ret, tret);
2084 else if (TREE_CODE (t) == BIT_FIELD_REF)
2086 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
2087 is_gimple_val, fb_rvalue);
2088 ret = MIN (ret, tret);
2089 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
2090 is_gimple_val, fb_rvalue);
2091 ret = MIN (ret, tret);
2094 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t, 0));
2096 /* The innermost expression P may have originally had
2097 TREE_SIDE_EFFECTS set which would have caused all the outer
2098 expressions in *EXPR_P leading to P to also have had
2099 TREE_SIDE_EFFECTS set. */
2100 recalculate_side_effects (t);
2103 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
2104 if ((fallback & fb_rvalue) && TREE_CODE (*expr_p) == COMPONENT_REF)
2106 canonicalize_component_ref (expr_p);
2109 VEC_free (tree, heap, stack);
2111 gcc_assert (*expr_p == expr || ret != GS_ALL_DONE);
2116 /* Gimplify the self modifying expression pointed to by EXPR_P
2119 PRE_P points to the list where side effects that must happen before
2120 *EXPR_P should be stored.
2122 POST_P points to the list where side effects that must happen after
2123 *EXPR_P should be stored.
2125 WANT_VALUE is nonzero iff we want to use the value of this expression
2126 in another expression. */
2128 static enum gimplify_status
2129 gimplify_self_mod_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
2132 enum tree_code code;
2133 tree lhs, lvalue, rhs, t1;
2134 gimple_seq post = NULL, *orig_post_p = post_p;
2136 enum tree_code arith_code;
2137 enum gimplify_status ret;
2138 location_t loc = EXPR_LOCATION (*expr_p);
2140 code = TREE_CODE (*expr_p);
2142 gcc_assert (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR
2143 || code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR);
2145 /* Prefix or postfix? */
2146 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
2147 /* Faster to treat as prefix if result is not used. */
2148 postfix = want_value;
2152 /* For postfix, make sure the inner expression's post side effects
2153 are executed after side effects from this expression. */
2157 /* Add or subtract? */
2158 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2159 arith_code = PLUS_EXPR;
2161 arith_code = MINUS_EXPR;
2163 /* Gimplify the LHS into a GIMPLE lvalue. */
2164 lvalue = TREE_OPERAND (*expr_p, 0);
2165 ret = gimplify_expr (&lvalue, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
2166 if (ret == GS_ERROR)
2169 /* Extract the operands to the arithmetic operation. */
2171 rhs = TREE_OPERAND (*expr_p, 1);
2173 /* For postfix operator, we evaluate the LHS to an rvalue and then use
2174 that as the result value and in the postqueue operation. We also
2175 make sure to make lvalue a minimal lval, see
2176 gcc.c-torture/execute/20040313-1.c for an example where this matters. */
2179 if (!is_gimple_min_lval (lvalue))
2181 mark_addressable (lvalue);
2182 lvalue = build_fold_addr_expr_loc (input_location, lvalue);
2183 gimplify_expr (&lvalue, pre_p, post_p, is_gimple_val, fb_rvalue);
2184 lvalue = build_fold_indirect_ref_loc (input_location, lvalue);
2186 ret = gimplify_expr (&lhs, pre_p, post_p, is_gimple_val, fb_rvalue);
2187 if (ret == GS_ERROR)
2191 /* For POINTERs increment, use POINTER_PLUS_EXPR. */
2192 if (POINTER_TYPE_P (TREE_TYPE (lhs)))
2194 rhs = fold_convert_loc (loc, sizetype, rhs);
2195 if (arith_code == MINUS_EXPR)
2196 rhs = fold_build1_loc (loc, NEGATE_EXPR, TREE_TYPE (rhs), rhs);
2197 arith_code = POINTER_PLUS_EXPR;
2200 t1 = build2 (arith_code, TREE_TYPE (*expr_p), lhs, rhs);
2204 gimplify_assign (lvalue, t1, orig_post_p);
2205 gimplify_seq_add_seq (orig_post_p, post);
2211 *expr_p = build2 (MODIFY_EXPR, TREE_TYPE (lvalue), lvalue, t1);
2217 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
2220 maybe_with_size_expr (tree *expr_p)
2222 tree expr = *expr_p;
2223 tree type = TREE_TYPE (expr);
2226 /* If we've already wrapped this or the type is error_mark_node, we can't do
2228 if (TREE_CODE (expr) == WITH_SIZE_EXPR
2229 || type == error_mark_node)
2232 /* If the size isn't known or is a constant, we have nothing to do. */
2233 size = TYPE_SIZE_UNIT (type);
2234 if (!size || TREE_CODE (size) == INTEGER_CST)
2237 /* Otherwise, make a WITH_SIZE_EXPR. */
2238 size = unshare_expr (size);
2239 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, expr);
2240 *expr_p = build2 (WITH_SIZE_EXPR, type, expr, size);
2244 /* Helper for gimplify_call_expr. Gimplify a single argument *ARG_P
2245 Store any side-effects in PRE_P. CALL_LOCATION is the location of
2248 static enum gimplify_status
2249 gimplify_arg (tree *arg_p, gimple_seq *pre_p, location_t call_location)
2251 bool (*test) (tree);
2254 /* In general, we allow lvalues for function arguments to avoid
2255 extra overhead of copying large aggregates out of even larger
2256 aggregates into temporaries only to copy the temporaries to
2257 the argument list. Make optimizers happy by pulling out to
2258 temporaries those types that fit in registers. */
2259 if (is_gimple_reg_type (TREE_TYPE (*arg_p)))
2260 test = is_gimple_val, fb = fb_rvalue;
2262 test = is_gimple_lvalue, fb = fb_either;
2264 /* If this is a variable sized type, we must remember the size. */
2265 maybe_with_size_expr (arg_p);
2267 /* FIXME diagnostics: This will mess up gcc.dg/Warray-bounds.c. */
2268 /* Make sure arguments have the same location as the function call
2270 protected_set_expr_location (*arg_p, call_location);
2272 /* There is a sequence point before a function call. Side effects in
2273 the argument list must occur before the actual call. So, when
2274 gimplifying arguments, force gimplify_expr to use an internal
2275 post queue which is then appended to the end of PRE_P. */
2276 return gimplify_expr (arg_p, pre_p, NULL, test, fb);
2280 /* Gimplify the CALL_EXPR node *EXPR_P into the GIMPLE sequence PRE_P.
2281 WANT_VALUE is true if the result of the call is desired. */
2283 static enum gimplify_status
2284 gimplify_call_expr (tree *expr_p, gimple_seq *pre_p, bool want_value)
2286 tree fndecl, parms, p;
2287 enum gimplify_status ret;
2290 bool builtin_va_start_p = FALSE;
2291 location_t loc = EXPR_LOCATION (*expr_p);
2293 gcc_assert (TREE_CODE (*expr_p) == CALL_EXPR);
2295 /* For reliable diagnostics during inlining, it is necessary that
2296 every call_expr be annotated with file and line. */
2297 if (! EXPR_HAS_LOCATION (*expr_p))
2298 SET_EXPR_LOCATION (*expr_p, input_location);
2300 /* This may be a call to a builtin function.
2302 Builtin function calls may be transformed into different
2303 (and more efficient) builtin function calls under certain
2304 circumstances. Unfortunately, gimplification can muck things
2305 up enough that the builtin expanders are not aware that certain
2306 transformations are still valid.
2308 So we attempt transformation/gimplification of the call before
2309 we gimplify the CALL_EXPR. At this time we do not manage to
2310 transform all calls in the same manner as the expanders do, but
2311 we do transform most of them. */
2312 fndecl = get_callee_fndecl (*expr_p);
2313 if (fndecl && DECL_BUILT_IN (fndecl))
2315 tree new_tree = fold_call_expr (input_location, *expr_p, !want_value);
2317 if (new_tree && new_tree != *expr_p)
2319 /* There was a transformation of this call which computes the
2320 same value, but in a more efficient way. Return and try
2326 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
2327 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_VA_START)
2329 builtin_va_start_p = TRUE;
2330 if (call_expr_nargs (*expr_p) < 2)
2332 error ("too few arguments to function %<va_start%>");
2333 *expr_p = build_empty_stmt (EXPR_LOCATION (*expr_p));
2337 if (fold_builtin_next_arg (*expr_p, true))
2339 *expr_p = build_empty_stmt (EXPR_LOCATION (*expr_p));
2345 /* There is a sequence point before the call, so any side effects in
2346 the calling expression must occur before the actual call. Force
2347 gimplify_expr to use an internal post queue. */
2348 ret = gimplify_expr (&CALL_EXPR_FN (*expr_p), pre_p, NULL,
2349 is_gimple_call_addr, fb_rvalue);
2351 nargs = call_expr_nargs (*expr_p);
2353 /* Get argument types for verification. */
2354 fndecl = get_callee_fndecl (*expr_p);
2357 parms = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
2358 else if (POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_FN (*expr_p))))
2359 parms = TYPE_ARG_TYPES (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (*expr_p))));
2361 if (fndecl && DECL_ARGUMENTS (fndecl))
2362 p = DECL_ARGUMENTS (fndecl);
2367 for (i = 0; i < nargs && p; i++, p = TREE_CHAIN (p))
2370 /* If the last argument is __builtin_va_arg_pack () and it is not
2371 passed as a named argument, decrease the number of CALL_EXPR
2372 arguments and set instead the CALL_EXPR_VA_ARG_PACK flag. */
2375 && TREE_CODE (CALL_EXPR_ARG (*expr_p, nargs - 1)) == CALL_EXPR)
2377 tree last_arg = CALL_EXPR_ARG (*expr_p, nargs - 1);
2378 tree last_arg_fndecl = get_callee_fndecl (last_arg);
2381 && TREE_CODE (last_arg_fndecl) == FUNCTION_DECL
2382 && DECL_BUILT_IN_CLASS (last_arg_fndecl) == BUILT_IN_NORMAL
2383 && DECL_FUNCTION_CODE (last_arg_fndecl) == BUILT_IN_VA_ARG_PACK)
2385 tree call = *expr_p;
2388 *expr_p = build_call_array_loc (loc, TREE_TYPE (call),
2389 CALL_EXPR_FN (call),
2390 nargs, CALL_EXPR_ARGP (call));
2392 /* Copy all CALL_EXPR flags, location and block, except
2393 CALL_EXPR_VA_ARG_PACK flag. */
2394 CALL_EXPR_STATIC_CHAIN (*expr_p) = CALL_EXPR_STATIC_CHAIN (call);
2395 CALL_EXPR_TAILCALL (*expr_p) = CALL_EXPR_TAILCALL (call);
2396 CALL_EXPR_RETURN_SLOT_OPT (*expr_p)
2397 = CALL_EXPR_RETURN_SLOT_OPT (call);
2398 CALL_FROM_THUNK_P (*expr_p) = CALL_FROM_THUNK_P (call);
2399 CALL_CANNOT_INLINE_P (*expr_p) = CALL_CANNOT_INLINE_P (call);
2400 SET_EXPR_LOCATION (*expr_p, EXPR_LOCATION (call));
2401 TREE_BLOCK (*expr_p) = TREE_BLOCK (call);
2403 /* Set CALL_EXPR_VA_ARG_PACK. */
2404 CALL_EXPR_VA_ARG_PACK (*expr_p) = 1;
2408 /* Finally, gimplify the function arguments. */
2411 for (i = (PUSH_ARGS_REVERSED ? nargs - 1 : 0);
2412 PUSH_ARGS_REVERSED ? i >= 0 : i < nargs;
2413 PUSH_ARGS_REVERSED ? i-- : i++)
2415 enum gimplify_status t;
2417 /* Avoid gimplifying the second argument to va_start, which needs to
2418 be the plain PARM_DECL. */
2419 if ((i != 1) || !builtin_va_start_p)
2421 t = gimplify_arg (&CALL_EXPR_ARG (*expr_p, i), pre_p,
2422 EXPR_LOCATION (*expr_p));
2430 /* Verify the function result. */
2431 if (want_value && fndecl
2432 && VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fndecl))))
2434 error_at (loc, "using result of function returning %<void%>");
2438 /* Try this again in case gimplification exposed something. */
2439 if (ret != GS_ERROR)
2441 tree new_tree = fold_call_expr (input_location, *expr_p, !want_value);
2443 if (new_tree && new_tree != *expr_p)
2445 /* There was a transformation of this call which computes the
2446 same value, but in a more efficient way. Return and try
2454 *expr_p = error_mark_node;
2458 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2459 decl. This allows us to eliminate redundant or useless
2460 calls to "const" functions. */
2461 if (TREE_CODE (*expr_p) == CALL_EXPR)
2463 int flags = call_expr_flags (*expr_p);
2464 if (flags & (ECF_CONST | ECF_PURE)
2465 /* An infinite loop is considered a side effect. */
2466 && !(flags & (ECF_LOOPING_CONST_OR_PURE)))
2467 TREE_SIDE_EFFECTS (*expr_p) = 0;
2470 /* If the value is not needed by the caller, emit a new GIMPLE_CALL
2471 and clear *EXPR_P. Otherwise, leave *EXPR_P in its gimplified
2472 form and delegate the creation of a GIMPLE_CALL to
2473 gimplify_modify_expr. This is always possible because when
2474 WANT_VALUE is true, the caller wants the result of this call into
2475 a temporary, which means that we will emit an INIT_EXPR in
2476 internal_get_tmp_var which will then be handled by
2477 gimplify_modify_expr. */
2480 /* The CALL_EXPR in *EXPR_P is already in GIMPLE form, so all we
2481 have to do is replicate it as a GIMPLE_CALL tuple. */
2482 call = gimple_build_call_from_tree (*expr_p);
2483 gimplify_seq_add_stmt (pre_p, call);
2484 *expr_p = NULL_TREE;
2490 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2491 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2493 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2494 condition is true or false, respectively. If null, we should generate
2495 our own to skip over the evaluation of this specific expression.
2497 LOCUS is the source location of the COND_EXPR.
2499 This function is the tree equivalent of do_jump.
2501 shortcut_cond_r should only be called by shortcut_cond_expr. */
2504 shortcut_cond_r (tree pred, tree *true_label_p, tree *false_label_p,
2507 tree local_label = NULL_TREE;
2508 tree t, expr = NULL;
2510 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2511 retain the shortcut semantics. Just insert the gotos here;
2512 shortcut_cond_expr will append the real blocks later. */
2513 if (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2515 location_t new_locus;
2517 /* Turn if (a && b) into
2519 if (a); else goto no;
2520 if (b) goto yes; else goto no;
2523 if (false_label_p == NULL)
2524 false_label_p = &local_label;
2526 /* Keep the original source location on the first 'if'. */
2527 t = shortcut_cond_r (TREE_OPERAND (pred, 0), NULL, false_label_p, locus);
2528 append_to_statement_list (t, &expr);
2530 /* Set the source location of the && on the second 'if'. */
2531 new_locus = EXPR_HAS_LOCATION (pred) ? EXPR_LOCATION (pred) : locus;
2532 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p, false_label_p,
2534 append_to_statement_list (t, &expr);
2536 else if (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2538 location_t new_locus;
2540 /* Turn if (a || b) into
2543 if (b) goto yes; else goto no;
2546 if (true_label_p == NULL)
2547 true_label_p = &local_label;
2549 /* Keep the original source location on the first 'if'. */
2550 t = shortcut_cond_r (TREE_OPERAND (pred, 0), true_label_p, NULL, locus);
2551 append_to_statement_list (t, &expr);
2553 /* Set the source location of the || on the second 'if'. */
2554 new_locus = EXPR_HAS_LOCATION (pred) ? EXPR_LOCATION (pred) : locus;
2555 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p, false_label_p,
2557 append_to_statement_list (t, &expr);
2559 else if (TREE_CODE (pred) == COND_EXPR)
2561 location_t new_locus;
2563 /* As long as we're messing with gotos, turn if (a ? b : c) into
2565 if (b) goto yes; else goto no;
2567 if (c) goto yes; else goto no; */
2569 /* Keep the original source location on the first 'if'. Set the source
2570 location of the ? on the second 'if'. */
2571 new_locus = EXPR_HAS_LOCATION (pred) ? EXPR_LOCATION (pred) : locus;
2572 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (pred, 0),
2573 shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2574 false_label_p, locus),
2575 shortcut_cond_r (TREE_OPERAND (pred, 2), true_label_p,
2576 false_label_p, new_locus));
2580 expr = build3 (COND_EXPR, void_type_node, pred,
2581 build_and_jump (true_label_p),
2582 build_and_jump (false_label_p));
2583 SET_EXPR_LOCATION (expr, locus);
2588 t = build1 (LABEL_EXPR, void_type_node, local_label);
2589 append_to_statement_list (t, &expr);
2595 /* Given a conditional expression EXPR with short-circuit boolean
2596 predicates using TRUTH_ANDIF_EXPR or TRUTH_ORIF_EXPR, break the
2597 predicate appart into the equivalent sequence of conditionals. */
2600 shortcut_cond_expr (tree expr)
2602 tree pred = TREE_OPERAND (expr, 0);
2603 tree then_ = TREE_OPERAND (expr, 1);
2604 tree else_ = TREE_OPERAND (expr, 2);
2605 tree true_label, false_label, end_label, t;
2607 tree *false_label_p;
2608 bool emit_end, emit_false, jump_over_else;
2609 bool then_se = then_ && TREE_SIDE_EFFECTS (then_);
2610 bool else_se = else_ && TREE_SIDE_EFFECTS (else_);
2612 /* First do simple transformations. */
2615 /* If there is no 'else', turn
2618 if (a) if (b) then c. */
2619 while (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2621 /* Keep the original source location on the first 'if'. */
2622 location_t locus = EXPR_HAS_LOCATION (expr)
2623 ? EXPR_LOCATION (expr) : input_location;
2624 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2625 /* Set the source location of the && on the second 'if'. */
2626 if (EXPR_HAS_LOCATION (pred))
2627 SET_EXPR_LOCATION (expr, EXPR_LOCATION (pred));
2628 then_ = shortcut_cond_expr (expr);
2629 then_se = then_ && TREE_SIDE_EFFECTS (then_);
2630 pred = TREE_OPERAND (pred, 0);
2631 expr = build3 (COND_EXPR, void_type_node, pred, then_, NULL_TREE);
2632 SET_EXPR_LOCATION (expr, locus);
2638 /* If there is no 'then', turn
2641 if (a); else if (b); else d. */
2642 while (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2644 /* Keep the original source location on the first 'if'. */
2645 location_t locus = EXPR_HAS_LOCATION (expr)
2646 ? EXPR_LOCATION (expr) : input_location;
2647 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2648 /* Set the source location of the || on the second 'if'. */
2649 if (EXPR_HAS_LOCATION (pred))
2650 SET_EXPR_LOCATION (expr, EXPR_LOCATION (pred));
2651 else_ = shortcut_cond_expr (expr);
2652 else_se = else_ && TREE_SIDE_EFFECTS (else_);
2653 pred = TREE_OPERAND (pred, 0);
2654 expr = build3 (COND_EXPR, void_type_node, pred, NULL_TREE, else_);
2655 SET_EXPR_LOCATION (expr, locus);
2659 /* If we're done, great. */
2660 if (TREE_CODE (pred) != TRUTH_ANDIF_EXPR
2661 && TREE_CODE (pred) != TRUTH_ORIF_EXPR)
2664 /* Otherwise we need to mess with gotos. Change
2667 if (a); else goto no;
2670 and recursively gimplify the condition. */
2672 true_label = false_label = end_label = NULL_TREE;
2674 /* If our arms just jump somewhere, hijack those labels so we don't
2675 generate jumps to jumps. */
2678 && TREE_CODE (then_) == GOTO_EXPR
2679 && TREE_CODE (GOTO_DESTINATION (then_)) == LABEL_DECL)
2681 true_label = GOTO_DESTINATION (then_);
2687 && TREE_CODE (else_) == GOTO_EXPR
2688 && TREE_CODE (GOTO_DESTINATION (else_)) == LABEL_DECL)
2690 false_label = GOTO_DESTINATION (else_);
2695 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2697 true_label_p = &true_label;
2699 true_label_p = NULL;
2701 /* The 'else' branch also needs a label if it contains interesting code. */
2702 if (false_label || else_se)
2703 false_label_p = &false_label;
2705 false_label_p = NULL;
2707 /* If there was nothing else in our arms, just forward the label(s). */
2708 if (!then_se && !else_se)
2709 return shortcut_cond_r (pred, true_label_p, false_label_p,
2710 EXPR_HAS_LOCATION (expr)
2711 ? EXPR_LOCATION (expr) : input_location);
2713 /* If our last subexpression already has a terminal label, reuse it. */
2715 t = expr_last (else_);
2717 t = expr_last (then_);
2720 if (t && TREE_CODE (t) == LABEL_EXPR)
2721 end_label = LABEL_EXPR_LABEL (t);
2723 /* If we don't care about jumping to the 'else' branch, jump to the end
2724 if the condition is false. */
2726 false_label_p = &end_label;
2728 /* We only want to emit these labels if we aren't hijacking them. */
2729 emit_end = (end_label == NULL_TREE);
2730 emit_false = (false_label == NULL_TREE);
2732 /* We only emit the jump over the else clause if we have to--if the
2733 then clause may fall through. Otherwise we can wind up with a
2734 useless jump and a useless label at the end of gimplified code,
2735 which will cause us to think that this conditional as a whole
2736 falls through even if it doesn't. If we then inline a function
2737 which ends with such a condition, that can cause us to issue an
2738 inappropriate warning about control reaching the end of a
2739 non-void function. */
2740 jump_over_else = block_may_fallthru (then_);
2742 pred = shortcut_cond_r (pred, true_label_p, false_label_p,
2743 EXPR_HAS_LOCATION (expr)
2744 ? EXPR_LOCATION (expr) : input_location);
2747 append_to_statement_list (pred, &expr);
2749 append_to_statement_list (then_, &expr);
2754 tree last = expr_last (expr);
2755 t = build_and_jump (&end_label);
2756 if (EXPR_HAS_LOCATION (last))
2757 SET_EXPR_LOCATION (t, EXPR_LOCATION (last));
2758 append_to_statement_list (t, &expr);
2762 t = build1 (LABEL_EXPR, void_type_node, false_label);
2763 append_to_statement_list (t, &expr);
2765 append_to_statement_list (else_, &expr);
2767 if (emit_end && end_label)
2769 t = build1 (LABEL_EXPR, void_type_node, end_label);
2770 append_to_statement_list (t, &expr);
2776 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2779 gimple_boolify (tree expr)
2781 tree type = TREE_TYPE (expr);
2782 location_t loc = EXPR_LOCATION (expr);
2784 if (TREE_CODE (expr) == NE_EXPR
2785 && TREE_CODE (TREE_OPERAND (expr, 0)) == CALL_EXPR
2786 && integer_zerop (TREE_OPERAND (expr, 1)))
2788 tree call = TREE_OPERAND (expr, 0);
2789 tree fn = get_callee_fndecl (call);
2791 /* For __builtin_expect ((long) (x), y) recurse into x as well
2792 if x is truth_value_p. */
2794 && DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2795 && DECL_FUNCTION_CODE (fn) == BUILT_IN_EXPECT
2796 && call_expr_nargs (call) == 2)
2798 tree arg = CALL_EXPR_ARG (call, 0);
2801 if (TREE_CODE (arg) == NOP_EXPR
2802 && TREE_TYPE (arg) == TREE_TYPE (call))
2803 arg = TREE_OPERAND (arg, 0);
2804 if (truth_value_p (TREE_CODE (arg)))
2806 arg = gimple_boolify (arg);
2807 CALL_EXPR_ARG (call, 0)
2808 = fold_convert_loc (loc, TREE_TYPE (call), arg);
2814 if (TREE_CODE (type) == BOOLEAN_TYPE)
2817 switch (TREE_CODE (expr))
2819 case TRUTH_AND_EXPR:
2821 case TRUTH_XOR_EXPR:
2822 case TRUTH_ANDIF_EXPR:
2823 case TRUTH_ORIF_EXPR:
2824 /* Also boolify the arguments of truth exprs. */
2825 TREE_OPERAND (expr, 1) = gimple_boolify (TREE_OPERAND (expr, 1));
2828 case TRUTH_NOT_EXPR:
2829 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2832 case EQ_EXPR: case NE_EXPR:
2833 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2834 /* These expressions always produce boolean results. */
2835 TREE_TYPE (expr) = boolean_type_node;
2839 /* Other expressions that get here must have boolean values, but
2840 might need to be converted to the appropriate mode. */
2841 return fold_convert_loc (loc, boolean_type_node, expr);
2845 /* Given a conditional expression *EXPR_P without side effects, gimplify
2846 its operands. New statements are inserted to PRE_P. */
2848 static enum gimplify_status
2849 gimplify_pure_cond_expr (tree *expr_p, gimple_seq *pre_p)
2851 tree expr = *expr_p, cond;
2852 enum gimplify_status ret, tret;
2853 enum tree_code code;
2855 cond = gimple_boolify (COND_EXPR_COND (expr));
2857 /* We need to handle && and || specially, as their gimplification
2858 creates pure cond_expr, thus leading to an infinite cycle otherwise. */
2859 code = TREE_CODE (cond);
2860 if (code == TRUTH_ANDIF_EXPR)
2861 TREE_SET_CODE (cond, TRUTH_AND_EXPR);
2862 else if (code == TRUTH_ORIF_EXPR)
2863 TREE_SET_CODE (cond, TRUTH_OR_EXPR);
2864 ret = gimplify_expr (&cond, pre_p, NULL, is_gimple_condexpr, fb_rvalue);
2865 COND_EXPR_COND (*expr_p) = cond;
2867 tret = gimplify_expr (&COND_EXPR_THEN (expr), pre_p, NULL,
2868 is_gimple_val, fb_rvalue);
2869 ret = MIN (ret, tret);
2870 tret = gimplify_expr (&COND_EXPR_ELSE (expr), pre_p, NULL,
2871 is_gimple_val, fb_rvalue);
2873 return MIN (ret, tret);
2876 /* Returns true if evaluating EXPR could trap.
2877 EXPR is GENERIC, while tree_could_trap_p can be called
2881 generic_expr_could_trap_p (tree expr)
2885 if (!expr || is_gimple_val (expr))
2888 if (!EXPR_P (expr) || tree_could_trap_p (expr))
2891 n = TREE_OPERAND_LENGTH (expr);
2892 for (i = 0; i < n; i++)
2893 if (generic_expr_could_trap_p (TREE_OPERAND (expr, i)))
2899 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2908 The second form is used when *EXPR_P is of type void.
2910 PRE_P points to the list where side effects that must happen before
2911 *EXPR_P should be stored. */
2913 static enum gimplify_status
2914 gimplify_cond_expr (tree *expr_p, gimple_seq *pre_p, fallback_t fallback)
2916 tree expr = *expr_p;
2917 tree type = TREE_TYPE (expr);
2918 location_t loc = EXPR_LOCATION (expr);
2919 tree tmp, arm1, arm2;
2920 enum gimplify_status ret;
2921 tree label_true, label_false, label_cont;
2922 bool have_then_clause_p, have_else_clause_p;
2924 enum tree_code pred_code;
2925 gimple_seq seq = NULL;
2927 /* If this COND_EXPR has a value, copy the values into a temporary within
2929 if (!VOID_TYPE_P (type))
2931 tree then_ = TREE_OPERAND (expr, 1), else_ = TREE_OPERAND (expr, 2);
2934 /* If either an rvalue is ok or we do not require an lvalue, create the
2935 temporary. But we cannot do that if the type is addressable. */
2936 if (((fallback & fb_rvalue) || !(fallback & fb_lvalue))
2937 && !TREE_ADDRESSABLE (type))
2939 if (gimplify_ctxp->allow_rhs_cond_expr
2940 /* If either branch has side effects or could trap, it can't be
2941 evaluated unconditionally. */
2942 && !TREE_SIDE_EFFECTS (then_)
2943 && !generic_expr_could_trap_p (then_)
2944 && !TREE_SIDE_EFFECTS (else_)
2945 && !generic_expr_could_trap_p (else_))
2946 return gimplify_pure_cond_expr (expr_p, pre_p);
2948 tmp = create_tmp_var (type, "iftmp");
2952 /* Otherwise, only create and copy references to the values. */
2955 type = build_pointer_type (type);
2957 if (!VOID_TYPE_P (TREE_TYPE (then_)))
2958 then_ = build_fold_addr_expr_loc (loc, then_);
2960 if (!VOID_TYPE_P (TREE_TYPE (else_)))
2961 else_ = build_fold_addr_expr_loc (loc, else_);
2964 = build3 (COND_EXPR, type, TREE_OPERAND (expr, 0), then_, else_);
2966 tmp = create_tmp_var (type, "iftmp");
2967 result = build_simple_mem_ref_loc (loc, tmp);
2970 /* Build the new then clause, `tmp = then_;'. But don't build the
2971 assignment if the value is void; in C++ it can be if it's a throw. */
2972 if (!VOID_TYPE_P (TREE_TYPE (then_)))
2973 TREE_OPERAND (expr, 1) = build2 (MODIFY_EXPR, type, tmp, then_);
2975 /* Similarly, build the new else clause, `tmp = else_;'. */
2976 if (!VOID_TYPE_P (TREE_TYPE (else_)))
2977 TREE_OPERAND (expr, 2) = build2 (MODIFY_EXPR, type, tmp, else_);
2979 TREE_TYPE (expr) = void_type_node;
2980 recalculate_side_effects (expr);
2982 /* Move the COND_EXPR to the prequeue. */
2983 gimplify_stmt (&expr, pre_p);
2989 /* Make sure the condition has BOOLEAN_TYPE. */
2990 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2992 /* Break apart && and || conditions. */
2993 if (TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ANDIF_EXPR
2994 || TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ORIF_EXPR)
2996 expr = shortcut_cond_expr (expr);
2998 if (expr != *expr_p)
3002 /* We can't rely on gimplify_expr to re-gimplify the expanded
3003 form properly, as cleanups might cause the target labels to be
3004 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
3005 set up a conditional context. */
3006 gimple_push_condition ();
3007 gimplify_stmt (expr_p, &seq);
3008 gimple_pop_condition (pre_p);
3009 gimple_seq_add_seq (pre_p, seq);
3015 /* Now do the normal gimplification. */
3017 /* Gimplify condition. */
3018 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL, is_gimple_condexpr,
3020 if (ret == GS_ERROR)
3022 gcc_assert (TREE_OPERAND (expr, 0) != NULL_TREE);
3024 gimple_push_condition ();
3026 have_then_clause_p = have_else_clause_p = false;
3027 if (TREE_OPERAND (expr, 1) != NULL
3028 && TREE_CODE (TREE_OPERAND (expr, 1)) == GOTO_EXPR
3029 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr, 1))) == LABEL_DECL
3030 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr, 1)))
3031 == current_function_decl)
3032 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
3033 have different locations, otherwise we end up with incorrect
3034 location information on the branches. */
3036 || !EXPR_HAS_LOCATION (expr)
3037 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr, 1))
3038 || EXPR_LOCATION (expr) == EXPR_LOCATION (TREE_OPERAND (expr, 1))))
3040 label_true = GOTO_DESTINATION (TREE_OPERAND (expr, 1));
3041 have_then_clause_p = true;
3044 label_true = create_artificial_label (UNKNOWN_LOCATION);
3045 if (TREE_OPERAND (expr, 2) != NULL
3046 && TREE_CODE (TREE_OPERAND (expr, 2)) == GOTO_EXPR
3047 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr, 2))) == LABEL_DECL
3048 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr, 2)))
3049 == current_function_decl)
3050 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
3051 have different locations, otherwise we end up with incorrect
3052 location information on the branches. */
3054 || !EXPR_HAS_LOCATION (expr)
3055 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr, 2))
3056 || EXPR_LOCATION (expr) == EXPR_LOCATION (TREE_OPERAND (expr, 2))))
3058 label_false = GOTO_DESTINATION (TREE_OPERAND (expr, 2));
3059 have_else_clause_p = true;
3062 label_false = create_artificial_label (UNKNOWN_LOCATION);
3064 gimple_cond_get_ops_from_tree (COND_EXPR_COND (expr), &pred_code, &arm1,
3067 gimple_cond = gimple_build_cond (pred_code, arm1, arm2, label_true,
3070 gimplify_seq_add_stmt (&seq, gimple_cond);
3071 label_cont = NULL_TREE;
3072 if (!have_then_clause_p)
3074 /* For if (...) {} else { code; } put label_true after
3076 if (TREE_OPERAND (expr, 1) == NULL_TREE
3077 && !have_else_clause_p
3078 && TREE_OPERAND (expr, 2) != NULL_TREE)
3079 label_cont = label_true;
3082 gimplify_seq_add_stmt (&seq, gimple_build_label (label_true));
3083 have_then_clause_p = gimplify_stmt (&TREE_OPERAND (expr, 1), &seq);
3084 /* For if (...) { code; } else {} or
3085 if (...) { code; } else goto label; or
3086 if (...) { code; return; } else { ... }
3087 label_cont isn't needed. */
3088 if (!have_else_clause_p
3089 && TREE_OPERAND (expr, 2) != NULL_TREE
3090 && gimple_seq_may_fallthru (seq))
3093 label_cont = create_artificial_label (UNKNOWN_LOCATION);
3095 g = gimple_build_goto (label_cont);
3097 /* GIMPLE_COND's are very low level; they have embedded
3098 gotos. This particular embedded goto should not be marked
3099 with the location of the original COND_EXPR, as it would
3100 correspond to the COND_EXPR's condition, not the ELSE or the
3101 THEN arms. To avoid marking it with the wrong location, flag
3102 it as "no location". */
3103 gimple_set_do_not_emit_location (g);
3105 gimplify_seq_add_stmt (&seq, g);
3109 if (!have_else_clause_p)
3111 gimplify_seq_add_stmt (&seq, gimple_build_label (label_false));
3112 have_else_clause_p = gimplify_stmt (&TREE_OPERAND (expr, 2), &seq);
3115 gimplify_seq_add_stmt (&seq, gimple_build_label (label_cont));
3117 gimple_pop_condition (pre_p);
3118 gimple_seq_add_seq (pre_p, seq);
3120 if (ret == GS_ERROR)
3122 else if (have_then_clause_p || have_else_clause_p)
3126 /* Both arms are empty; replace the COND_EXPR with its predicate. */
3127 expr = TREE_OPERAND (expr, 0);
3128 gimplify_stmt (&expr, pre_p);
3135 /* Prepare the node pointed to by EXPR_P, an is_gimple_addressable expression,
3136 to be marked addressable.
3138 We cannot rely on such an expression being directly markable if a temporary
3139 has been created by the gimplification. In this case, we create another
3140 temporary and initialize it with a copy, which will become a store after we
3141 mark it addressable. This can happen if the front-end passed us something
3142 that it could not mark addressable yet, like a Fortran pass-by-reference
3143 parameter (int) floatvar. */
3146 prepare_gimple_addressable (tree *expr_p, gimple_seq *seq_p)
3148 while (handled_component_p (*expr_p))
3149 expr_p = &TREE_OPERAND (*expr_p, 0);
3150 if (is_gimple_reg (*expr_p))
3151 *expr_p = get_initialized_tmp_var (*expr_p, seq_p, NULL);
3154 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3155 a call to __builtin_memcpy. */
3157 static enum gimplify_status
3158 gimplify_modify_expr_to_memcpy (tree *expr_p, tree size, bool want_value,
3161 tree t, to, to_ptr, from, from_ptr;
3163 location_t loc = EXPR_LOCATION (*expr_p);
3165 to = TREE_OPERAND (*expr_p, 0);
3166 from = TREE_OPERAND (*expr_p, 1);
3168 /* Mark the RHS addressable. Beware that it may not be possible to do so
3169 directly if a temporary has been created by the gimplification. */
3170 prepare_gimple_addressable (&from, seq_p);
3172 mark_addressable (from);
3173 from_ptr = build_fold_addr_expr_loc (loc, from);
3174 gimplify_arg (&from_ptr, seq_p, loc);
3176 mark_addressable (to);
3177 to_ptr = build_fold_addr_expr_loc (loc, to);
3178 gimplify_arg (&to_ptr, seq_p, loc);
3180 t = implicit_built_in_decls[BUILT_IN_MEMCPY];
3182 gs = gimple_build_call (t, 3, to_ptr, from_ptr, size);
3186 /* tmp = memcpy() */
3187 t = create_tmp_var (TREE_TYPE (to_ptr), NULL);
3188 gimple_call_set_lhs (gs, t);
3189 gimplify_seq_add_stmt (seq_p, gs);
3191 *expr_p = build_simple_mem_ref (t);
3195 gimplify_seq_add_stmt (seq_p, gs);
3200 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3201 a call to __builtin_memset. In this case we know that the RHS is
3202 a CONSTRUCTOR with an empty element list. */
3204 static enum gimplify_status
3205 gimplify_modify_expr_to_memset (tree *expr_p, tree size, bool want_value,
3208 tree t, from, to, to_ptr;
3210 location_t loc = EXPR_LOCATION (*expr_p);
3212 /* Assert our assumptions, to abort instead of producing wrong code
3213 silently if they are not met. Beware that the RHS CONSTRUCTOR might
3214 not be immediately exposed. */
3215 from = TREE_OPERAND (*expr_p, 1);
3216 if (TREE_CODE (from) == WITH_SIZE_EXPR)
3217 from = TREE_OPERAND (from, 0);
3219 gcc_assert (TREE_CODE (from) == CONSTRUCTOR
3220 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (from)));
3223 to = TREE_OPERAND (*expr_p, 0);
3225 to_ptr = build_fold_addr_expr_loc (loc, to);
3226 gimplify_arg (&to_ptr, seq_p, loc);
3227 t = implicit_built_in_decls[BUILT_IN_MEMSET];
3229 gs = gimple_build_call (t, 3, to_ptr, integer_zero_node, size);
3233 /* tmp = memset() */
3234 t = create_tmp_var (TREE_TYPE (to_ptr), NULL);
3235 gimple_call_set_lhs (gs, t);
3236 gimplify_seq_add_stmt (seq_p, gs);
3238 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (to), t);
3242 gimplify_seq_add_stmt (seq_p, gs);
3247 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
3248 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
3249 assignment. Returns non-null if we detect a potential overlap. */
3251 struct gimplify_init_ctor_preeval_data
3253 /* The base decl of the lhs object. May be NULL, in which case we
3254 have to assume the lhs is indirect. */
3257 /* The alias set of the lhs object. */
3258 alias_set_type lhs_alias_set;
3262 gimplify_init_ctor_preeval_1 (tree *tp, int *walk_subtrees, void *xdata)
3264 struct gimplify_init_ctor_preeval_data *data
3265 = (struct gimplify_init_ctor_preeval_data *) xdata;
3268 /* If we find the base object, obviously we have overlap. */
3269 if (data->lhs_base_decl == t)
3272 /* If the constructor component is indirect, determine if we have a
3273 potential overlap with the lhs. The only bits of information we
3274 have to go on at this point are addressability and alias sets. */
3275 if ((INDIRECT_REF_P (t)
3276 || TREE_CODE (t) == MEM_REF)
3277 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
3278 && alias_sets_conflict_p (data->lhs_alias_set, get_alias_set (t)))
3281 /* If the constructor component is a call, determine if it can hide a
3282 potential overlap with the lhs through an INDIRECT_REF like above.
3283 ??? Ugh - this is completely broken. In fact this whole analysis
3284 doesn't look conservative. */
3285 if (TREE_CODE (t) == CALL_EXPR)
3287 tree type, fntype = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (t)));
3289 for (type = TYPE_ARG_TYPES (fntype); type; type = TREE_CHAIN (type))
3290 if (POINTER_TYPE_P (TREE_VALUE (type))
3291 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
3292 && alias_sets_conflict_p (data->lhs_alias_set,
3294 (TREE_TYPE (TREE_VALUE (type)))))
3298 if (IS_TYPE_OR_DECL_P (t))
3303 /* A subroutine of gimplify_init_constructor. Pre-evaluate EXPR,
3304 force values that overlap with the lhs (as described by *DATA)
3305 into temporaries. */
3308 gimplify_init_ctor_preeval (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
3309 struct gimplify_init_ctor_preeval_data *data)
3311 enum gimplify_status one;
3313 /* If the value is constant, then there's nothing to pre-evaluate. */
3314 if (TREE_CONSTANT (*expr_p))
3316 /* Ensure it does not have side effects, it might contain a reference to
3317 the object we're initializing. */
3318 gcc_assert (!TREE_SIDE_EFFECTS (*expr_p));
3322 /* If the type has non-trivial constructors, we can't pre-evaluate. */
3323 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p)))
3326 /* Recurse for nested constructors. */
3327 if (TREE_CODE (*expr_p) == CONSTRUCTOR)
3329 unsigned HOST_WIDE_INT ix;
3330 constructor_elt *ce;
3331 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (*expr_p);
3333 FOR_EACH_VEC_ELT (constructor_elt, v, ix, ce)
3334 gimplify_init_ctor_preeval (&ce->value, pre_p, post_p, data);
3339 /* If this is a variable sized type, we must remember the size. */
3340 maybe_with_size_expr (expr_p);
3342 /* Gimplify the constructor element to something appropriate for the rhs
3343 of a MODIFY_EXPR. Given that we know the LHS is an aggregate, we know
3344 the gimplifier will consider this a store to memory. Doing this
3345 gimplification now means that we won't have to deal with complicated
3346 language-specific trees, nor trees like SAVE_EXPR that can induce
3347 exponential search behavior. */
3348 one = gimplify_expr (expr_p, pre_p, post_p, is_gimple_mem_rhs, fb_rvalue);
3349 if (one == GS_ERROR)
3355 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
3356 with the lhs, since "a = { .x=a }" doesn't make sense. This will
3357 always be true for all scalars, since is_gimple_mem_rhs insists on a
3358 temporary variable for them. */
3359 if (DECL_P (*expr_p))
3362 /* If this is of variable size, we have no choice but to assume it doesn't
3363 overlap since we can't make a temporary for it. */
3364 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (*expr_p))) != INTEGER_CST)
3367 /* Otherwise, we must search for overlap ... */
3368 if (!walk_tree (expr_p, gimplify_init_ctor_preeval_1, data, NULL))
3371 /* ... and if found, force the value into a temporary. */
3372 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
3375 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
3376 a RANGE_EXPR in a CONSTRUCTOR for an array.
3380 object[var] = value;
3387 We increment var _after_ the loop exit check because we might otherwise
3388 fail if upper == TYPE_MAX_VALUE (type for upper).
3390 Note that we never have to deal with SAVE_EXPRs here, because this has
3391 already been taken care of for us, in gimplify_init_ctor_preeval(). */
3393 static void gimplify_init_ctor_eval (tree, VEC(constructor_elt,gc) *,
3394 gimple_seq *, bool);
3397 gimplify_init_ctor_eval_range (tree object, tree lower, tree upper,
3398 tree value, tree array_elt_type,
3399 gimple_seq *pre_p, bool cleared)
3401 tree loop_entry_label, loop_exit_label, fall_thru_label;
3402 tree var, var_type, cref, tmp;
3404 loop_entry_label = create_artificial_label (UNKNOWN_LOCATION);
3405 loop_exit_label = create_artificial_label (UNKNOWN_LOCATION);
3406 fall_thru_label = create_artificial_label (UNKNOWN_LOCATION);
3408 /* Create and initialize the index variable. */
3409 var_type = TREE_TYPE (upper);
3410 var = create_tmp_var (var_type, NULL);
3411 gimplify_seq_add_stmt (pre_p, gimple_build_assign (var, lower));
3413 /* Add the loop entry label. */
3414 gimplify_seq_add_stmt (pre_p, gimple_build_label (loop_entry_label));
3416 /* Build the reference. */
3417 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
3418 var, NULL_TREE, NULL_TREE);
3420 /* If we are a constructor, just call gimplify_init_ctor_eval to do
3421 the store. Otherwise just assign value to the reference. */
3423 if (TREE_CODE (value) == CONSTRUCTOR)
3424 /* NB we might have to call ourself recursively through
3425 gimplify_init_ctor_eval if the value is a constructor. */
3426 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
3429 gimplify_seq_add_stmt (pre_p, gimple_build_assign (cref, value));
3431 /* We exit the loop when the index var is equal to the upper bound. */
3432 gimplify_seq_add_stmt (pre_p,
3433 gimple_build_cond (EQ_EXPR, var, upper,
3434 loop_exit_label, fall_thru_label));
3436 gimplify_seq_add_stmt (pre_p, gimple_build_label (fall_thru_label));
3438 /* Otherwise, increment the index var... */
3439 tmp = build2 (PLUS_EXPR, var_type, var,
3440 fold_convert (var_type, integer_one_node));
3441 gimplify_seq_add_stmt (pre_p, gimple_build_assign (var, tmp));
3443 /* ...and jump back to the loop entry. */
3444 gimplify_seq_add_stmt (pre_p, gimple_build_goto (loop_entry_label));
3446 /* Add the loop exit label. */
3447 gimplify_seq_add_stmt (pre_p, gimple_build_label (loop_exit_label));
3450 /* Return true if FDECL is accessing a field that is zero sized. */
3453 zero_sized_field_decl (const_tree fdecl)
3455 if (TREE_CODE (fdecl) == FIELD_DECL && DECL_SIZE (fdecl)
3456 && integer_zerop (DECL_SIZE (fdecl)))
3461 /* Return true if TYPE is zero sized. */
3464 zero_sized_type (const_tree type)
3466 if (AGGREGATE_TYPE_P (type) && TYPE_SIZE (type)
3467 && integer_zerop (TYPE_SIZE (type)))
3472 /* A subroutine of gimplify_init_constructor. Generate individual
3473 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
3474 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
3475 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
3479 gimplify_init_ctor_eval (tree object, VEC(constructor_elt,gc) *elts,
3480 gimple_seq *pre_p, bool cleared)
3482 tree array_elt_type = NULL;
3483 unsigned HOST_WIDE_INT ix;
3484 tree purpose, value;
3486 if (TREE_CODE (TREE_TYPE (object)) == ARRAY_TYPE)
3487 array_elt_type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object)));
3489 FOR_EACH_CONSTRUCTOR_ELT (elts, ix, purpose, value)
3493 /* NULL values are created above for gimplification errors. */
3497 if (cleared && initializer_zerop (value))
3500 /* ??? Here's to hoping the front end fills in all of the indices,
3501 so we don't have to figure out what's missing ourselves. */
3502 gcc_assert (purpose);
3504 /* Skip zero-sized fields, unless value has side-effects. This can
3505 happen with calls to functions returning a zero-sized type, which
3506 we shouldn't discard. As a number of downstream passes don't
3507 expect sets of zero-sized fields, we rely on the gimplification of
3508 the MODIFY_EXPR we make below to drop the assignment statement. */
3509 if (! TREE_SIDE_EFFECTS (value) && zero_sized_field_decl (purpose))
3512 /* If we have a RANGE_EXPR, we have to build a loop to assign the
3514 if (TREE_CODE (purpose) == RANGE_EXPR)
3516 tree lower = TREE_OPERAND (purpose, 0);
3517 tree upper = TREE_OPERAND (purpose, 1);
3519 /* If the lower bound is equal to upper, just treat it as if
3520 upper was the index. */
3521 if (simple_cst_equal (lower, upper))
3525 gimplify_init_ctor_eval_range (object, lower, upper, value,
3526 array_elt_type, pre_p, cleared);
3533 /* Do not use bitsizetype for ARRAY_REF indices. */
3534 if (TYPE_DOMAIN (TREE_TYPE (object)))
3535 purpose = fold_convert (TREE_TYPE (TYPE_DOMAIN (TREE_TYPE (object))),
3537 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
3538 purpose, NULL_TREE, NULL_TREE);
3542 gcc_assert (TREE_CODE (purpose) == FIELD_DECL);
3543 cref = build3 (COMPONENT_REF, TREE_TYPE (purpose),
3544 unshare_expr (object), purpose, NULL_TREE);
3547 if (TREE_CODE (value) == CONSTRUCTOR
3548 && TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE)
3549 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
3553 tree init = build2 (INIT_EXPR, TREE_TYPE (cref), cref, value);
3554 gimplify_and_add (init, pre_p);
3561 /* Returns the appropriate RHS predicate for this LHS. */
3564 rhs_predicate_for (tree lhs)
3566 if (is_gimple_reg (lhs))
3567 return is_gimple_reg_rhs_or_call;
3569 return is_gimple_mem_rhs_or_call;
3572 /* Gimplify a C99 compound literal expression. This just means adding
3573 the DECL_EXPR before the current statement and using its anonymous
3576 static enum gimplify_status
3577 gimplify_compound_literal_expr (tree *expr_p, gimple_seq *pre_p)
3579 tree decl_s = COMPOUND_LITERAL_EXPR_DECL_EXPR (*expr_p);
3580 tree decl = DECL_EXPR_DECL (decl_s);
3581 /* Mark the decl as addressable if the compound literal
3582 expression is addressable now, otherwise it is marked too late
3583 after we gimplify the initialization expression. */
3584 if (TREE_ADDRESSABLE (*expr_p))
3585 TREE_ADDRESSABLE (decl) = 1;
3587 /* Preliminarily mark non-addressed complex variables as eligible
3588 for promotion to gimple registers. We'll transform their uses
3590 if ((TREE_CODE (TREE_TYPE (decl)) == COMPLEX_TYPE
3591 || TREE_CODE (TREE_TYPE (decl)) == VECTOR_TYPE)
3592 && !TREE_THIS_VOLATILE (decl)
3593 && !needs_to_live_in_memory (decl))
3594 DECL_GIMPLE_REG_P (decl) = 1;
3596 /* This decl isn't mentioned in the enclosing block, so add it to the
3597 list of temps. FIXME it seems a bit of a kludge to say that
3598 anonymous artificial vars aren't pushed, but everything else is. */
3599 if (DECL_NAME (decl) == NULL_TREE && !DECL_SEEN_IN_BIND_EXPR_P (decl))
3600 gimple_add_tmp_var (decl);
3602 gimplify_and_add (decl_s, pre_p);
3607 /* Optimize embedded COMPOUND_LITERAL_EXPRs within a CONSTRUCTOR,
3608 return a new CONSTRUCTOR if something changed. */
3611 optimize_compound_literals_in_ctor (tree orig_ctor)
3613 tree ctor = orig_ctor;
3614 VEC(constructor_elt,gc) *elts = CONSTRUCTOR_ELTS (ctor);
3615 unsigned int idx, num = VEC_length (constructor_elt, elts);
3617 for (idx = 0; idx < num; idx++)
3619 tree value = VEC_index (constructor_elt, elts, idx)->value;
3620 tree newval = value;
3621 if (TREE_CODE (value) == CONSTRUCTOR)
3622 newval = optimize_compound_literals_in_ctor (value);
3623 else if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
3625 tree decl_s = COMPOUND_LITERAL_EXPR_DECL_EXPR (value);
3626 tree decl = DECL_EXPR_DECL (decl_s);
3627 tree init = DECL_INITIAL (decl);
3629 if (!TREE_ADDRESSABLE (value)
3630 && !TREE_ADDRESSABLE (decl)
3632 newval = optimize_compound_literals_in_ctor (init);
3634 if (newval == value)
3637 if (ctor == orig_ctor)
3639 ctor = copy_node (orig_ctor);
3640 CONSTRUCTOR_ELTS (ctor) = VEC_copy (constructor_elt, gc, elts);
3641 elts = CONSTRUCTOR_ELTS (ctor);
3643 VEC_index (constructor_elt, elts, idx)->value = newval;
3650 /* A subroutine of gimplify_modify_expr. Break out elements of a
3651 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
3653 Note that we still need to clear any elements that don't have explicit
3654 initializers, so if not all elements are initialized we keep the
3655 original MODIFY_EXPR, we just remove all of the constructor elements.
3657 If NOTIFY_TEMP_CREATION is true, do not gimplify, just return
3658 GS_ERROR if we would have to create a temporary when gimplifying
3659 this constructor. Otherwise, return GS_OK.
3661 If NOTIFY_TEMP_CREATION is false, just do the gimplification. */
3663 static enum gimplify_status
3664 gimplify_init_constructor (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
3665 bool want_value, bool notify_temp_creation)
3667 tree object, ctor, type;
3668 enum gimplify_status ret;
3669 VEC(constructor_elt,gc) *elts;
3671 gcc_assert (TREE_CODE (TREE_OPERAND (*expr_p, 1)) == CONSTRUCTOR);
3673 if (!notify_temp_creation)
3675 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3676 is_gimple_lvalue, fb_lvalue);
3677 if (ret == GS_ERROR)
3681 object = TREE_OPERAND (*expr_p, 0);
3682 ctor = TREE_OPERAND (*expr_p, 1) =
3683 optimize_compound_literals_in_ctor (TREE_OPERAND (*expr_p, 1));
3684 type = TREE_TYPE (ctor);
3685 elts = CONSTRUCTOR_ELTS (ctor);
3688 switch (TREE_CODE (type))
3692 case QUAL_UNION_TYPE:
3695 struct gimplify_init_ctor_preeval_data preeval_data;
3696 HOST_WIDE_INT num_type_elements, num_ctor_elements;
3697 HOST_WIDE_INT num_nonzero_elements;
3698 bool cleared, valid_const_initializer;
3700 /* Aggregate types must lower constructors to initialization of
3701 individual elements. The exception is that a CONSTRUCTOR node
3702 with no elements indicates zero-initialization of the whole. */
3703 if (VEC_empty (constructor_elt, elts))
3705 if (notify_temp_creation)
3710 /* Fetch information about the constructor to direct later processing.
3711 We might want to make static versions of it in various cases, and
3712 can only do so if it known to be a valid constant initializer. */
3713 valid_const_initializer
3714 = categorize_ctor_elements (ctor, &num_nonzero_elements,
3715 &num_ctor_elements, &cleared);
3717 /* If a const aggregate variable is being initialized, then it
3718 should never be a lose to promote the variable to be static. */
3719 if (valid_const_initializer
3720 && num_nonzero_elements > 1
3721 && TREE_READONLY (object)
3722 && TREE_CODE (object) == VAR_DECL
3723 && (flag_merge_constants >= 2 || !TREE_ADDRESSABLE (object)))
3725 if (notify_temp_creation)
3727 DECL_INITIAL (object) = ctor;
3728 TREE_STATIC (object) = 1;
3729 if (!DECL_NAME (object))
3730 DECL_NAME (object) = create_tmp_var_name ("C");
3731 walk_tree (&DECL_INITIAL (object), force_labels_r, NULL, NULL);
3733 /* ??? C++ doesn't automatically append a .<number> to the
3734 assembler name, and even when it does, it looks a FE private
3735 data structures to figure out what that number should be,
3736 which are not set for this variable. I suppose this is
3737 important for local statics for inline functions, which aren't
3738 "local" in the object file sense. So in order to get a unique
3739 TU-local symbol, we must invoke the lhd version now. */
3740 lhd_set_decl_assembler_name (object);
3742 *expr_p = NULL_TREE;
3746 /* If there are "lots" of initialized elements, even discounting
3747 those that are not address constants (and thus *must* be
3748 computed at runtime), then partition the constructor into
3749 constant and non-constant parts. Block copy the constant
3750 parts in, then generate code for the non-constant parts. */
3751 /* TODO. There's code in cp/typeck.c to do this. */
3753 num_type_elements = count_type_elements (type, true);
3755 /* If count_type_elements could not determine number of type elements
3756 for a constant-sized object, assume clearing is needed.
3757 Don't do this for variable-sized objects, as store_constructor
3758 will ignore the clearing of variable-sized objects. */
3759 if (num_type_elements < 0 && int_size_in_bytes (type) >= 0)
3761 /* If there are "lots" of zeros, then block clear the object first. */
3762 else if (num_type_elements - num_nonzero_elements
3763 > CLEAR_RATIO (optimize_function_for_speed_p (cfun))
3764 && num_nonzero_elements < num_type_elements/4)
3766 /* ??? This bit ought not be needed. For any element not present
3767 in the initializer, we should simply set them to zero. Except
3768 we'd need to *find* the elements that are not present, and that
3769 requires trickery to avoid quadratic compile-time behavior in
3770 large cases or excessive memory use in small cases. */
3771 else if (num_ctor_elements < num_type_elements)
3774 /* If there are "lots" of initialized elements, and all of them
3775 are valid address constants, then the entire initializer can
3776 be dropped to memory, and then memcpy'd out. Don't do this
3777 for sparse arrays, though, as it's more efficient to follow
3778 the standard CONSTRUCTOR behavior of memset followed by
3779 individual element initialization. Also don't do this for small
3780 all-zero initializers (which aren't big enough to merit
3781 clearing), and don't try to make bitwise copies of
3782 TREE_ADDRESSABLE types. */
3783 if (valid_const_initializer
3784 && !(cleared || num_nonzero_elements == 0)
3785 && !TREE_ADDRESSABLE (type))
3787 HOST_WIDE_INT size = int_size_in_bytes (type);
3790 /* ??? We can still get unbounded array types, at least
3791 from the C++ front end. This seems wrong, but attempt
3792 to work around it for now. */
3795 size = int_size_in_bytes (TREE_TYPE (object));
3797 TREE_TYPE (ctor) = type = TREE_TYPE (object);
3800 /* Find the maximum alignment we can assume for the object. */
3801 /* ??? Make use of DECL_OFFSET_ALIGN. */
3802 if (DECL_P (object))
3803 align = DECL_ALIGN (object);
3805 align = TYPE_ALIGN (type);
3808 && num_nonzero_elements > 1
3809 && !can_move_by_pieces (size, align))
3811 if (notify_temp_creation)
3814 walk_tree (&ctor, force_labels_r, NULL, NULL);
3815 ctor = tree_output_constant_def (ctor);
3816 if (!useless_type_conversion_p (type, TREE_TYPE (ctor)))
3817 ctor = build1 (VIEW_CONVERT_EXPR, type, ctor);
3818 TREE_OPERAND (*expr_p, 1) = ctor;
3820 /* This is no longer an assignment of a CONSTRUCTOR, but
3821 we still may have processing to do on the LHS. So
3822 pretend we didn't do anything here to let that happen. */
3823 return GS_UNHANDLED;
3827 /* If the target is volatile and we have non-zero elements
3828 initialize the target from a temporary. */
3829 if (TREE_THIS_VOLATILE (object)
3830 && !TREE_ADDRESSABLE (type)
3831 && num_nonzero_elements > 0)
3833 tree temp = create_tmp_var (TYPE_MAIN_VARIANT (type), NULL);
3834 TREE_OPERAND (*expr_p, 0) = temp;
3835 *expr_p = build2 (COMPOUND_EXPR, TREE_TYPE (*expr_p),
3837 build2 (MODIFY_EXPR, void_type_node,
3842 if (notify_temp_creation)
3845 /* If there are nonzero elements and if needed, pre-evaluate to capture
3846 elements overlapping with the lhs into temporaries. We must do this
3847 before clearing to fetch the values before they are zeroed-out. */
3848 if (num_nonzero_elements > 0 && TREE_CODE (*expr_p) != INIT_EXPR)
3850 preeval_data.lhs_base_decl = get_base_address (object);
3851 if (!DECL_P (preeval_data.lhs_base_decl))
3852 preeval_data.lhs_base_decl = NULL;
3853 preeval_data.lhs_alias_set = get_alias_set (object);
3855 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p, 1),
3856 pre_p, post_p, &preeval_data);
3861 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3862 Note that we still have to gimplify, in order to handle the
3863 case of variable sized types. Avoid shared tree structures. */
3864 CONSTRUCTOR_ELTS (ctor) = NULL;
3865 TREE_SIDE_EFFECTS (ctor) = 0;
3866 object = unshare_expr (object);
3867 gimplify_stmt (expr_p, pre_p);
3870 /* If we have not block cleared the object, or if there are nonzero
3871 elements in the constructor, add assignments to the individual
3872 scalar fields of the object. */
3873 if (!cleared || num_nonzero_elements > 0)
3874 gimplify_init_ctor_eval (object, elts, pre_p, cleared);
3876 *expr_p = NULL_TREE;
3884 if (notify_temp_creation)
3887 /* Extract the real and imaginary parts out of the ctor. */
3888 gcc_assert (VEC_length (constructor_elt, elts) == 2);
3889 r = VEC_index (constructor_elt, elts, 0)->value;
3890 i = VEC_index (constructor_elt, elts, 1)->value;
3891 if (r == NULL || i == NULL)
3893 tree zero = fold_convert (TREE_TYPE (type), integer_zero_node);
3900 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3901 represent creation of a complex value. */
3902 if (TREE_CONSTANT (r) && TREE_CONSTANT (i))
3904 ctor = build_complex (type, r, i);
3905 TREE_OPERAND (*expr_p, 1) = ctor;
3909 ctor = build2 (COMPLEX_EXPR, type, r, i);
3910 TREE_OPERAND (*expr_p, 1) = ctor;
3911 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 1),
3914 rhs_predicate_for (TREE_OPERAND (*expr_p, 0)),
3922 unsigned HOST_WIDE_INT ix;
3923 constructor_elt *ce;
3925 if (notify_temp_creation)
3928 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3929 if (TREE_CONSTANT (ctor))
3931 bool constant_p = true;
3934 /* Even when ctor is constant, it might contain non-*_CST
3935 elements, such as addresses or trapping values like
3936 1.0/0.0 - 1.0/0.0. Such expressions don't belong
3937 in VECTOR_CST nodes. */
3938 FOR_EACH_CONSTRUCTOR_VALUE (elts, ix, value)
3939 if (!CONSTANT_CLASS_P (value))
3947 TREE_OPERAND (*expr_p, 1) = build_vector_from_ctor (type, elts);
3951 /* Don't reduce an initializer constant even if we can't
3952 make a VECTOR_CST. It won't do anything for us, and it'll
3953 prevent us from representing it as a single constant. */
3954 if (initializer_constant_valid_p (ctor, type))
3957 TREE_CONSTANT (ctor) = 0;
3960 /* Vector types use CONSTRUCTOR all the way through gimple
3961 compilation as a general initializer. */
3962 FOR_EACH_VEC_ELT (constructor_elt, elts, ix, ce)
3964 enum gimplify_status tret;
3965 tret = gimplify_expr (&ce->value, pre_p, post_p, is_gimple_val,
3967 if (tret == GS_ERROR)
3970 if (!is_gimple_reg (TREE_OPERAND (*expr_p, 0)))
3971 TREE_OPERAND (*expr_p, 1) = get_formal_tmp_var (ctor, pre_p);
3976 /* So how did we get a CONSTRUCTOR for a scalar type? */
3980 if (ret == GS_ERROR)
3982 else if (want_value)
3989 /* If we have gimplified both sides of the initializer but have
3990 not emitted an assignment, do so now. */
3993 tree lhs = TREE_OPERAND (*expr_p, 0);
3994 tree rhs = TREE_OPERAND (*expr_p, 1);
3995 gimple init = gimple_build_assign (lhs, rhs);
3996 gimplify_seq_add_stmt (pre_p, init);
4004 /* Given a pointer value OP0, return a simplified version of an
4005 indirection through OP0, or NULL_TREE if no simplification is
4006 possible. Note that the resulting type may be different from
4007 the type pointed to in the sense that it is still compatible
4008 from the langhooks point of view. */
4011 gimple_fold_indirect_ref (tree t)
4013 tree ptype = TREE_TYPE (t), type = TREE_TYPE (ptype);
4018 subtype = TREE_TYPE (sub);
4019 if (!POINTER_TYPE_P (subtype))
4022 if (TREE_CODE (sub) == ADDR_EXPR)
4024 tree op = TREE_OPERAND (sub, 0);
4025 tree optype = TREE_TYPE (op);
4027 if (useless_type_conversion_p (type, optype))
4030 /* *(foo *)&fooarray => fooarray[0] */
4031 if (TREE_CODE (optype) == ARRAY_TYPE
4032 && TREE_CODE (TYPE_SIZE (TREE_TYPE (optype))) == INTEGER_CST
4033 && useless_type_conversion_p (type, TREE_TYPE (optype)))
4035 tree type_domain = TYPE_DOMAIN (optype);
4036 tree min_val = size_zero_node;
4037 if (type_domain && TYPE_MIN_VALUE (type_domain))
4038 min_val = TYPE_MIN_VALUE (type_domain);
4039 if (TREE_CODE (min_val) == INTEGER_CST)
4040 return build4 (ARRAY_REF, type, op, min_val, NULL_TREE, NULL_TREE);
4042 /* *(foo *)&complexfoo => __real__ complexfoo */
4043 else if (TREE_CODE (optype) == COMPLEX_TYPE
4044 && useless_type_conversion_p (type, TREE_TYPE (optype)))
4045 return fold_build1 (REALPART_EXPR, type, op);
4046 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
4047 else if (TREE_CODE (optype) == VECTOR_TYPE
4048 && useless_type_conversion_p (type, TREE_TYPE (optype)))
4050 tree part_width = TYPE_SIZE (type);
4051 tree index = bitsize_int (0);
4052 return fold_build3 (BIT_FIELD_REF, type, op, part_width, index);
4056 /* *(p + CST) -> ... */
4057 if (TREE_CODE (sub) == POINTER_PLUS_EXPR
4058 && TREE_CODE (TREE_OPERAND (sub, 1)) == INTEGER_CST)
4060 tree addr = TREE_OPERAND (sub, 0);
4061 tree off = TREE_OPERAND (sub, 1);
4065 addrtype = TREE_TYPE (addr);
4067 /* ((foo*)&vectorfoo)[1] -> BIT_FIELD_REF<vectorfoo,...> */
4068 if (TREE_CODE (addr) == ADDR_EXPR
4069 && TREE_CODE (TREE_TYPE (addrtype)) == VECTOR_TYPE
4070 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (addrtype))))
4072 HOST_WIDE_INT offset = tree_low_cst (off, 0);
4073 tree part_width = TYPE_SIZE (type);
4074 unsigned HOST_WIDE_INT part_widthi
4075 = tree_low_cst (part_width, 0) / BITS_PER_UNIT;
4076 unsigned HOST_WIDE_INT indexi = offset * BITS_PER_UNIT;
4077 tree index = bitsize_int (indexi);
4078 if (offset / part_widthi
4079 <= TYPE_VECTOR_SUBPARTS (TREE_TYPE (addrtype)))
4080 return fold_build3 (BIT_FIELD_REF, type, TREE_OPERAND (addr, 0),
4084 /* ((foo*)&complexfoo)[1] -> __imag__ complexfoo */
4085 if (TREE_CODE (addr) == ADDR_EXPR
4086 && TREE_CODE (TREE_TYPE (addrtype)) == COMPLEX_TYPE
4087 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (addrtype))))
4089 tree size = TYPE_SIZE_UNIT (type);
4090 if (tree_int_cst_equal (size, off))
4091 return fold_build1 (IMAGPART_EXPR, type, TREE_OPERAND (addr, 0));
4094 /* *(p + CST) -> MEM_REF <p, CST>. */
4095 if (TREE_CODE (addr) != ADDR_EXPR
4096 || DECL_P (TREE_OPERAND (addr, 0)))
4097 return fold_build2 (MEM_REF, type,
4099 build_int_cst_wide (ptype,
4100 TREE_INT_CST_LOW (off),
4101 TREE_INT_CST_HIGH (off)));
4104 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
4105 if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
4106 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (subtype)))) == INTEGER_CST
4107 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (subtype))))
4110 tree min_val = size_zero_node;
4112 sub = gimple_fold_indirect_ref (sub);
4114 sub = build1 (INDIRECT_REF, TREE_TYPE (subtype), osub);
4115 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
4116 if (type_domain && TYPE_MIN_VALUE (type_domain))
4117 min_val = TYPE_MIN_VALUE (type_domain);
4118 if (TREE_CODE (min_val) == INTEGER_CST)
4119 return build4 (ARRAY_REF, type, sub, min_val, NULL_TREE, NULL_TREE);
4125 /* Given a pointer value OP0, return a simplified version of an
4126 indirection through OP0, or NULL_TREE if no simplification is
4127 possible. This may only be applied to a rhs of an expression.
4128 Note that the resulting type may be different from the type pointed
4129 to in the sense that it is still compatible from the langhooks
4133 gimple_fold_indirect_ref_rhs (tree t)
4135 return gimple_fold_indirect_ref (t);
4138 /* Subroutine of gimplify_modify_expr to do simplifications of
4139 MODIFY_EXPRs based on the code of the RHS. We loop for as long as
4140 something changes. */
4142 static enum gimplify_status
4143 gimplify_modify_expr_rhs (tree *expr_p, tree *from_p, tree *to_p,
4144 gimple_seq *pre_p, gimple_seq *post_p,
4147 enum gimplify_status ret = GS_UNHANDLED;
4153 switch (TREE_CODE (*from_p))
4156 /* If we're assigning from a read-only variable initialized with
4157 a constructor, do the direct assignment from the constructor,
4158 but only if neither source nor target are volatile since this
4159 latter assignment might end up being done on a per-field basis. */
4160 if (DECL_INITIAL (*from_p)
4161 && TREE_READONLY (*from_p)
4162 && !TREE_THIS_VOLATILE (*from_p)
4163 && !TREE_THIS_VOLATILE (*to_p)
4164 && TREE_CODE (DECL_INITIAL (*from_p)) == CONSTRUCTOR)
4166 tree old_from = *from_p;
4167 enum gimplify_status subret;
4169 /* Move the constructor into the RHS. */
4170 *from_p = unshare_expr (DECL_INITIAL (*from_p));
4172 /* Let's see if gimplify_init_constructor will need to put
4174 subret = gimplify_init_constructor (expr_p, NULL, NULL,
4176 if (subret == GS_ERROR)
4178 /* If so, revert the change. */
4190 /* If we have code like
4194 where the type of "x" is a (possibly cv-qualified variant
4195 of "A"), treat the entire expression as identical to "x".
4196 This kind of code arises in C++ when an object is bound
4197 to a const reference, and if "x" is a TARGET_EXPR we want
4198 to take advantage of the optimization below. */
4199 tree t = gimple_fold_indirect_ref_rhs (TREE_OPERAND (*from_p, 0));
4211 /* If we are initializing something from a TARGET_EXPR, strip the
4212 TARGET_EXPR and initialize it directly, if possible. This can't
4213 be done if the initializer is void, since that implies that the
4214 temporary is set in some non-trivial way.
4216 ??? What about code that pulls out the temp and uses it
4217 elsewhere? I think that such code never uses the TARGET_EXPR as
4218 an initializer. If I'm wrong, we'll die because the temp won't
4219 have any RTL. In that case, I guess we'll need to replace
4220 references somehow. */
4221 tree init = TARGET_EXPR_INITIAL (*from_p);
4224 && !VOID_TYPE_P (TREE_TYPE (init)))
4234 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
4236 gimplify_compound_expr (from_p, pre_p, true);
4242 /* If we already made some changes, let the front end have a
4243 crack at this before we break it down. */
4244 if (ret != GS_UNHANDLED)
4246 /* If we're initializing from a CONSTRUCTOR, break this into
4247 individual MODIFY_EXPRs. */
4248 return gimplify_init_constructor (expr_p, pre_p, post_p, want_value,
4252 /* If we're assigning to a non-register type, push the assignment
4253 down into the branches. This is mandatory for ADDRESSABLE types,
4254 since we cannot generate temporaries for such, but it saves a
4255 copy in other cases as well. */
4256 if (!is_gimple_reg_type (TREE_TYPE (*from_p)))
4258 /* This code should mirror the code in gimplify_cond_expr. */
4259 enum tree_code code = TREE_CODE (*expr_p);
4260 tree cond = *from_p;
4261 tree result = *to_p;
4263 ret = gimplify_expr (&result, pre_p, post_p,
4264 is_gimple_lvalue, fb_lvalue);
4265 if (ret != GS_ERROR)
4268 if (TREE_TYPE (TREE_OPERAND (cond, 1)) != void_type_node)
4269 TREE_OPERAND (cond, 1)
4270 = build2 (code, void_type_node, result,
4271 TREE_OPERAND (cond, 1));
4272 if (TREE_TYPE (TREE_OPERAND (cond, 2)) != void_type_node)
4273 TREE_OPERAND (cond, 2)
4274 = build2 (code, void_type_node, unshare_expr (result),
4275 TREE_OPERAND (cond, 2));
4277 TREE_TYPE (cond) = void_type_node;
4278 recalculate_side_effects (cond);
4282 gimplify_and_add (cond, pre_p);
4283 *expr_p = unshare_expr (result);
4292 /* For calls that return in memory, give *to_p as the CALL_EXPR's
4293 return slot so that we don't generate a temporary. */
4294 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p)
4295 && aggregate_value_p (*from_p, *from_p))
4299 if (!(rhs_predicate_for (*to_p))(*from_p))
4300 /* If we need a temporary, *to_p isn't accurate. */
4302 else if (TREE_CODE (*to_p) == RESULT_DECL
4303 && DECL_NAME (*to_p) == NULL_TREE
4304 && needs_to_live_in_memory (*to_p))
4305 /* It's OK to use the return slot directly unless it's an NRV. */
4307 else if (is_gimple_reg_type (TREE_TYPE (*to_p))
4308 || (DECL_P (*to_p) && DECL_REGISTER (*to_p)))
4309 /* Don't force regs into memory. */
4311 else if (TREE_CODE (*expr_p) == INIT_EXPR)
4312 /* It's OK to use the target directly if it's being
4315 else if (!is_gimple_non_addressable (*to_p))
4316 /* Don't use the original target if it's already addressable;
4317 if its address escapes, and the called function uses the
4318 NRV optimization, a conforming program could see *to_p
4319 change before the called function returns; see c++/19317.
4320 When optimizing, the return_slot pass marks more functions
4321 as safe after we have escape info. */
4328 CALL_EXPR_RETURN_SLOT_OPT (*from_p) = 1;
4329 mark_addressable (*to_p);
4334 case WITH_SIZE_EXPR:
4335 /* Likewise for calls that return an aggregate of non-constant size,
4336 since we would not be able to generate a temporary at all. */
4337 if (TREE_CODE (TREE_OPERAND (*from_p, 0)) == CALL_EXPR)
4339 *from_p = TREE_OPERAND (*from_p, 0);
4340 /* We don't change ret in this case because the
4341 WITH_SIZE_EXPR might have been added in
4342 gimplify_modify_expr, so returning GS_OK would lead to an
4348 /* If we're initializing from a container, push the initialization
4350 case CLEANUP_POINT_EXPR:
4352 case STATEMENT_LIST:
4354 tree wrap = *from_p;
4357 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_min_lval,
4359 if (ret != GS_ERROR)
4362 t = voidify_wrapper_expr (wrap, *expr_p);
4363 gcc_assert (t == *expr_p);
4367 gimplify_and_add (wrap, pre_p);
4368 *expr_p = unshare_expr (*to_p);
4375 case COMPOUND_LITERAL_EXPR:
4377 tree complit = TREE_OPERAND (*expr_p, 1);
4378 tree decl_s = COMPOUND_LITERAL_EXPR_DECL_EXPR (complit);
4379 tree decl = DECL_EXPR_DECL (decl_s);
4380 tree init = DECL_INITIAL (decl);
4382 /* struct T x = (struct T) { 0, 1, 2 } can be optimized
4383 into struct T x = { 0, 1, 2 } if the address of the
4384 compound literal has never been taken. */
4385 if (!TREE_ADDRESSABLE (complit)
4386 && !TREE_ADDRESSABLE (decl)
4389 *expr_p = copy_node (*expr_p);
4390 TREE_OPERAND (*expr_p, 1) = init;
4405 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
4406 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
4407 DECL_GIMPLE_REG_P set.
4409 IMPORTANT NOTE: This promotion is performed by introducing a load of the
4410 other, unmodified part of the complex object just before the total store.
4411 As a consequence, if the object is still uninitialized, an undefined value
4412 will be loaded into a register, which may result in a spurious exception
4413 if the register is floating-point and the value happens to be a signaling
4414 NaN for example. Then the fully-fledged complex operations lowering pass
4415 followed by a DCE pass are necessary in order to fix things up. */
4417 static enum gimplify_status
4418 gimplify_modify_expr_complex_part (tree *expr_p, gimple_seq *pre_p,
4421 enum tree_code code, ocode;
4422 tree lhs, rhs, new_rhs, other, realpart, imagpart;
4424 lhs = TREE_OPERAND (*expr_p, 0);
4425 rhs = TREE_OPERAND (*expr_p, 1);
4426 code = TREE_CODE (lhs);
4427 lhs = TREE_OPERAND (lhs, 0);
4429 ocode = code == REALPART_EXPR ? IMAGPART_EXPR : REALPART_EXPR;
4430 other = build1 (ocode, TREE_TYPE (rhs), lhs);
4431 other = get_formal_tmp_var (other, pre_p);
4433 realpart = code == REALPART_EXPR ? rhs : other;
4434 imagpart = code == REALPART_EXPR ? other : rhs;
4436 if (TREE_CONSTANT (realpart) && TREE_CONSTANT (imagpart))
4437 new_rhs = build_complex (TREE_TYPE (lhs), realpart, imagpart);
4439 new_rhs = build2 (COMPLEX_EXPR, TREE_TYPE (lhs), realpart, imagpart);
4441 gimplify_seq_add_stmt (pre_p, gimple_build_assign (lhs, new_rhs));
4442 *expr_p = (want_value) ? rhs : NULL_TREE;
4448 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
4454 PRE_P points to the list where side effects that must happen before
4455 *EXPR_P should be stored.
4457 POST_P points to the list where side effects that must happen after
4458 *EXPR_P should be stored.
4460 WANT_VALUE is nonzero iff we want to use the value of this expression
4461 in another expression. */
4463 static enum gimplify_status
4464 gimplify_modify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
4467 tree *from_p = &TREE_OPERAND (*expr_p, 1);
4468 tree *to_p = &TREE_OPERAND (*expr_p, 0);
4469 enum gimplify_status ret = GS_UNHANDLED;
4471 location_t loc = EXPR_LOCATION (*expr_p);
4473 gcc_assert (TREE_CODE (*expr_p) == MODIFY_EXPR
4474 || TREE_CODE (*expr_p) == INIT_EXPR);
4476 /* Insert pointer conversions required by the middle-end that are not
4477 required by the frontend. This fixes middle-end type checking for
4478 for example gcc.dg/redecl-6.c. */
4479 if (POINTER_TYPE_P (TREE_TYPE (*to_p)))
4481 STRIP_USELESS_TYPE_CONVERSION (*from_p);
4482 if (!useless_type_conversion_p (TREE_TYPE (*to_p), TREE_TYPE (*from_p)))
4483 *from_p = fold_convert_loc (loc, TREE_TYPE (*to_p), *from_p);
4486 /* See if any simplifications can be done based on what the RHS is. */
4487 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
4489 if (ret != GS_UNHANDLED)
4492 /* For zero sized types only gimplify the left hand side and right hand
4493 side as statements and throw away the assignment. Do this after
4494 gimplify_modify_expr_rhs so we handle TARGET_EXPRs of addressable
4496 if (zero_sized_type (TREE_TYPE (*from_p)) && !want_value)
4498 gimplify_stmt (from_p, pre_p);
4499 gimplify_stmt (to_p, pre_p);
4500 *expr_p = NULL_TREE;
4504 /* If the value being copied is of variable width, compute the length
4505 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
4506 before gimplifying any of the operands so that we can resolve any
4507 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
4508 the size of the expression to be copied, not of the destination, so
4509 that is what we must do here. */
4510 maybe_with_size_expr (from_p);
4512 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
4513 if (ret == GS_ERROR)
4516 /* As a special case, we have to temporarily allow for assignments
4517 with a CALL_EXPR on the RHS. Since in GIMPLE a function call is
4518 a toplevel statement, when gimplifying the GENERIC expression
4519 MODIFY_EXPR <a, CALL_EXPR <foo>>, we cannot create the tuple
4520 GIMPLE_ASSIGN <a, GIMPLE_CALL <foo>>.
4522 Instead, we need to create the tuple GIMPLE_CALL <a, foo>. To
4523 prevent gimplify_expr from trying to create a new temporary for
4524 foo's LHS, we tell it that it should only gimplify until it
4525 reaches the CALL_EXPR. On return from gimplify_expr, the newly
4526 created GIMPLE_CALL <foo> will be the last statement in *PRE_P
4527 and all we need to do here is set 'a' to be its LHS. */
4528 ret = gimplify_expr (from_p, pre_p, post_p, rhs_predicate_for (*to_p),
4530 if (ret == GS_ERROR)
4533 /* Now see if the above changed *from_p to something we handle specially. */
4534 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
4536 if (ret != GS_UNHANDLED)
4539 /* If we've got a variable sized assignment between two lvalues (i.e. does
4540 not involve a call), then we can make things a bit more straightforward
4541 by converting the assignment to memcpy or memset. */
4542 if (TREE_CODE (*from_p) == WITH_SIZE_EXPR)
4544 tree from = TREE_OPERAND (*from_p, 0);
4545 tree size = TREE_OPERAND (*from_p, 1);
4547 if (TREE_CODE (from) == CONSTRUCTOR)
4548 return gimplify_modify_expr_to_memset (expr_p, size, want_value, pre_p);
4550 if (is_gimple_addressable (from))
4553 return gimplify_modify_expr_to_memcpy (expr_p, size, want_value,
4558 /* Transform partial stores to non-addressable complex variables into
4559 total stores. This allows us to use real instead of virtual operands
4560 for these variables, which improves optimization. */
4561 if ((TREE_CODE (*to_p) == REALPART_EXPR
4562 || TREE_CODE (*to_p) == IMAGPART_EXPR)
4563 && is_gimple_reg (TREE_OPERAND (*to_p, 0)))
4564 return gimplify_modify_expr_complex_part (expr_p, pre_p, want_value);
4566 /* Try to alleviate the effects of the gimplification creating artificial
4567 temporaries (see for example is_gimple_reg_rhs) on the debug info. */
4568 if (!gimplify_ctxp->into_ssa
4569 && TREE_CODE (*from_p) == VAR_DECL
4570 && DECL_IGNORED_P (*from_p)
4572 && !DECL_IGNORED_P (*to_p))
4574 if (!DECL_NAME (*from_p) && DECL_NAME (*to_p))
4576 = create_tmp_var_name (IDENTIFIER_POINTER (DECL_NAME (*to_p)));
4577 DECL_DEBUG_EXPR_IS_FROM (*from_p) = 1;
4578 SET_DECL_DEBUG_EXPR (*from_p, *to_p);
4581 if (want_value && TREE_THIS_VOLATILE (*to_p))
4582 *from_p = get_initialized_tmp_var (*from_p, pre_p, post_p);
4584 if (TREE_CODE (*from_p) == CALL_EXPR)
4586 /* Since the RHS is a CALL_EXPR, we need to create a GIMPLE_CALL
4587 instead of a GIMPLE_ASSIGN. */
4588 assign = gimple_build_call_from_tree (*from_p);
4589 if (!gimple_call_noreturn_p (assign))
4590 gimple_call_set_lhs (assign, *to_p);
4594 assign = gimple_build_assign (*to_p, *from_p);
4595 gimple_set_location (assign, EXPR_LOCATION (*expr_p));
4598 gimplify_seq_add_stmt (pre_p, assign);
4600 if (gimplify_ctxp->into_ssa && is_gimple_reg (*to_p))
4602 /* If we've somehow already got an SSA_NAME on the LHS, then
4603 we've probably modified it twice. Not good. */
4604 gcc_assert (TREE_CODE (*to_p) != SSA_NAME);
4605 *to_p = make_ssa_name (*to_p, assign);
4606 gimple_set_lhs (assign, *to_p);
4611 *expr_p = TREE_THIS_VOLATILE (*to_p) ? *from_p : unshare_expr (*to_p);
4620 /* Gimplify a comparison between two variable-sized objects. Do this
4621 with a call to BUILT_IN_MEMCMP. */
4623 static enum gimplify_status
4624 gimplify_variable_sized_compare (tree *expr_p)
4626 tree op0 = TREE_OPERAND (*expr_p, 0);
4627 tree op1 = TREE_OPERAND (*expr_p, 1);
4628 tree t, arg, dest, src;
4629 location_t loc = EXPR_LOCATION (*expr_p);
4631 arg = TYPE_SIZE_UNIT (TREE_TYPE (op0));
4632 arg = unshare_expr (arg);
4633 arg = SUBSTITUTE_PLACEHOLDER_IN_EXPR (arg, op0);
4634 src = build_fold_addr_expr_loc (loc, op1);
4635 dest = build_fold_addr_expr_loc (loc, op0);
4636 t = implicit_built_in_decls[BUILT_IN_MEMCMP];
4637 t = build_call_expr_loc (loc, t, 3, dest, src, arg);
4639 = build2 (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), t, integer_zero_node);
4644 /* Gimplify a comparison between two aggregate objects of integral scalar
4645 mode as a comparison between the bitwise equivalent scalar values. */
4647 static enum gimplify_status
4648 gimplify_scalar_mode_aggregate_compare (tree *expr_p)
4650 location_t loc = EXPR_LOCATION (*expr_p);
4651 tree op0 = TREE_OPERAND (*expr_p, 0);
4652 tree op1 = TREE_OPERAND (*expr_p, 1);
4654 tree type = TREE_TYPE (op0);
4655 tree scalar_type = lang_hooks.types.type_for_mode (TYPE_MODE (type), 1);
4657 op0 = fold_build1_loc (loc, VIEW_CONVERT_EXPR, scalar_type, op0);
4658 op1 = fold_build1_loc (loc, VIEW_CONVERT_EXPR, scalar_type, op1);
4661 = fold_build2_loc (loc, TREE_CODE (*expr_p), TREE_TYPE (*expr_p), op0, op1);
4666 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
4667 points to the expression to gimplify.
4669 Expressions of the form 'a && b' are gimplified to:
4671 a && b ? true : false
4673 LOCUS is the source location to be put on the generated COND_EXPR.
4674 gimplify_cond_expr will do the rest. */
4676 static enum gimplify_status
4677 gimplify_boolean_expr (tree *expr_p, location_t locus)
4679 /* Preserve the original type of the expression. */
4680 tree type = TREE_TYPE (*expr_p);
4682 *expr_p = build3 (COND_EXPR, type, *expr_p,
4683 fold_convert_loc (locus, type, boolean_true_node),
4684 fold_convert_loc (locus, type, boolean_false_node));
4686 SET_EXPR_LOCATION (*expr_p, locus);
4691 /* Gimplifies an expression sequence. This function gimplifies each
4692 expression and re-writes the original expression with the last
4693 expression of the sequence in GIMPLE form.
4695 PRE_P points to the list where the side effects for all the
4696 expressions in the sequence will be emitted.
4698 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
4700 static enum gimplify_status
4701 gimplify_compound_expr (tree *expr_p, gimple_seq *pre_p, bool want_value)
4707 tree *sub_p = &TREE_OPERAND (t, 0);
4709 if (TREE_CODE (*sub_p) == COMPOUND_EXPR)
4710 gimplify_compound_expr (sub_p, pre_p, false);
4712 gimplify_stmt (sub_p, pre_p);
4714 t = TREE_OPERAND (t, 1);
4716 while (TREE_CODE (t) == COMPOUND_EXPR);
4723 gimplify_stmt (expr_p, pre_p);
4729 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
4730 gimplify. After gimplification, EXPR_P will point to a new temporary
4731 that holds the original value of the SAVE_EXPR node.
4733 PRE_P points to the list where side effects that must happen before
4734 *EXPR_P should be stored. */
4736 static enum gimplify_status
4737 gimplify_save_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4739 enum gimplify_status ret = GS_ALL_DONE;
4742 gcc_assert (TREE_CODE (*expr_p) == SAVE_EXPR);
4743 val = TREE_OPERAND (*expr_p, 0);
4745 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
4746 if (!SAVE_EXPR_RESOLVED_P (*expr_p))
4748 /* The operand may be a void-valued expression such as SAVE_EXPRs
4749 generated by the Java frontend for class initialization. It is
4750 being executed only for its side-effects. */
4751 if (TREE_TYPE (val) == void_type_node)
4753 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
4754 is_gimple_stmt, fb_none);
4758 val = get_initialized_tmp_var (val, pre_p, post_p);
4760 TREE_OPERAND (*expr_p, 0) = val;
4761 SAVE_EXPR_RESOLVED_P (*expr_p) = 1;
4769 /* Re-write the ADDR_EXPR node pointed to by EXPR_P
4776 PRE_P points to the list where side effects that must happen before
4777 *EXPR_P should be stored.
4779 POST_P points to the list where side effects that must happen after
4780 *EXPR_P should be stored. */
4782 static enum gimplify_status
4783 gimplify_addr_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4785 tree expr = *expr_p;
4786 tree op0 = TREE_OPERAND (expr, 0);
4787 enum gimplify_status ret;
4788 location_t loc = EXPR_LOCATION (*expr_p);
4790 switch (TREE_CODE (op0))
4793 case MISALIGNED_INDIRECT_REF:
4795 /* Check if we are dealing with an expression of the form '&*ptr'.
4796 While the front end folds away '&*ptr' into 'ptr', these
4797 expressions may be generated internally by the compiler (e.g.,
4798 builtins like __builtin_va_end). */
4799 /* Caution: the silent array decomposition semantics we allow for
4800 ADDR_EXPR means we can't always discard the pair. */
4801 /* Gimplification of the ADDR_EXPR operand may drop
4802 cv-qualification conversions, so make sure we add them if
4805 tree op00 = TREE_OPERAND (op0, 0);
4806 tree t_expr = TREE_TYPE (expr);
4807 tree t_op00 = TREE_TYPE (op00);
4809 if (!useless_type_conversion_p (t_expr, t_op00))
4810 op00 = fold_convert_loc (loc, TREE_TYPE (expr), op00);
4816 case VIEW_CONVERT_EXPR:
4817 /* Take the address of our operand and then convert it to the type of
4820 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
4821 all clear. The impact of this transformation is even less clear. */
4823 /* If the operand is a useless conversion, look through it. Doing so
4824 guarantees that the ADDR_EXPR and its operand will remain of the
4826 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0, 0)))
4827 op0 = TREE_OPERAND (op0, 0);
4829 *expr_p = fold_convert_loc (loc, TREE_TYPE (expr),
4830 build_fold_addr_expr_loc (loc,
4831 TREE_OPERAND (op0, 0)));
4836 /* We use fb_either here because the C frontend sometimes takes
4837 the address of a call that returns a struct; see
4838 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
4839 the implied temporary explicit. */
4841 /* Make the operand addressable. */
4842 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, post_p,
4843 is_gimple_addressable, fb_either);
4844 if (ret == GS_ERROR)
4847 /* Then mark it. Beware that it may not be possible to do so directly
4848 if a temporary has been created by the gimplification. */
4849 prepare_gimple_addressable (&TREE_OPERAND (expr, 0), pre_p);
4851 op0 = TREE_OPERAND (expr, 0);
4853 /* For various reasons, the gimplification of the expression
4854 may have made a new INDIRECT_REF. */
4855 if (TREE_CODE (op0) == INDIRECT_REF)
4856 goto do_indirect_ref;
4858 mark_addressable (TREE_OPERAND (expr, 0));
4860 /* The FEs may end up building ADDR_EXPRs early on a decl with
4861 an incomplete type. Re-build ADDR_EXPRs in canonical form
4863 if (!types_compatible_p (TREE_TYPE (op0), TREE_TYPE (TREE_TYPE (expr))))
4864 *expr_p = build_fold_addr_expr (op0);
4866 /* Make sure TREE_CONSTANT and TREE_SIDE_EFFECTS are set properly. */
4867 recompute_tree_invariant_for_addr_expr (*expr_p);
4869 /* If we re-built the ADDR_EXPR add a conversion to the original type
4871 if (!useless_type_conversion_p (TREE_TYPE (expr), TREE_TYPE (*expr_p)))
4872 *expr_p = fold_convert (TREE_TYPE (expr), *expr_p);
4880 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
4881 value; output operands should be a gimple lvalue. */
4883 static enum gimplify_status
4884 gimplify_asm_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4888 const char **oconstraints;
4891 const char *constraint;
4892 bool allows_mem, allows_reg, is_inout;
4893 enum gimplify_status ret, tret;
4895 VEC(tree, gc) *inputs;
4896 VEC(tree, gc) *outputs;
4897 VEC(tree, gc) *clobbers;
4898 VEC(tree, gc) *labels;
4902 noutputs = list_length (ASM_OUTPUTS (expr));
4903 oconstraints = (const char **) alloca ((noutputs) * sizeof (const char *));
4905 inputs = outputs = clobbers = labels = NULL;
4908 link_next = NULL_TREE;
4909 for (i = 0, link = ASM_OUTPUTS (expr); link; ++i, link = link_next)
4912 size_t constraint_len;
4914 link_next = TREE_CHAIN (link);
4918 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4919 constraint_len = strlen (constraint);
4920 if (constraint_len == 0)
4923 ok = parse_output_constraint (&constraint, i, 0, 0,
4924 &allows_mem, &allows_reg, &is_inout);
4931 if (!allows_reg && allows_mem)
4932 mark_addressable (TREE_VALUE (link));
4934 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4935 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
4936 fb_lvalue | fb_mayfail);
4937 if (tret == GS_ERROR)
4939 error ("invalid lvalue in asm output %d", i);
4943 VEC_safe_push (tree, gc, outputs, link);
4944 TREE_CHAIN (link) = NULL_TREE;
4948 /* An input/output operand. To give the optimizers more
4949 flexibility, split it into separate input and output
4954 /* Turn the in/out constraint into an output constraint. */
4955 char *p = xstrdup (constraint);
4957 TREE_VALUE (TREE_PURPOSE (link)) = build_string (constraint_len, p);
4959 /* And add a matching input constraint. */
4962 sprintf (buf, "%d", i);
4964 /* If there are multiple alternatives in the constraint,
4965 handle each of them individually. Those that allow register
4966 will be replaced with operand number, the others will stay
4968 if (strchr (p, ',') != NULL)
4970 size_t len = 0, buflen = strlen (buf);
4971 char *beg, *end, *str, *dst;
4975 end = strchr (beg, ',');
4977 end = strchr (beg, '\0');
4978 if ((size_t) (end - beg) < buflen)
4981 len += end - beg + 1;
4988 str = (char *) alloca (len);
4989 for (beg = p + 1, dst = str;;)
4992 bool mem_p, reg_p, inout_p;
4994 end = strchr (beg, ',');
4999 parse_output_constraint (&tem, i, 0, 0,
5000 &mem_p, ®_p, &inout_p);
5005 memcpy (dst, buf, buflen);
5014 memcpy (dst, beg, len);
5023 input = build_string (dst - str, str);
5026 input = build_string (strlen (buf), buf);
5029 input = build_string (constraint_len - 1, constraint + 1);
5033 input = build_tree_list (build_tree_list (NULL_TREE, input),
5034 unshare_expr (TREE_VALUE (link)));
5035 ASM_INPUTS (expr) = chainon (ASM_INPUTS (expr), input);
5039 link_next = NULL_TREE;
5040 for (link = ASM_INPUTS (expr); link; ++i, link = link_next)
5042 link_next = TREE_CHAIN (link);
5043 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
5044 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
5045 oconstraints, &allows_mem, &allows_reg);
5047 /* If we can't make copies, we can only accept memory. */
5048 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (link))))
5054 error ("impossible constraint in %<asm%>");
5055 error ("non-memory input %d must stay in memory", i);
5060 /* If the operand is a memory input, it should be an lvalue. */
5061 if (!allows_reg && allows_mem)
5063 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
5064 is_gimple_lvalue, fb_lvalue | fb_mayfail);
5065 mark_addressable (TREE_VALUE (link));
5066 if (tret == GS_ERROR)
5068 if (EXPR_HAS_LOCATION (TREE_VALUE (link)))
5069 input_location = EXPR_LOCATION (TREE_VALUE (link));
5070 error ("memory input %d is not directly addressable", i);
5076 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
5077 is_gimple_asm_val, fb_rvalue);
5078 if (tret == GS_ERROR)
5082 TREE_CHAIN (link) = NULL_TREE;
5083 VEC_safe_push (tree, gc, inputs, link);
5086 for (link = ASM_CLOBBERS (expr); link; ++i, link = TREE_CHAIN (link))
5087 VEC_safe_push (tree, gc, clobbers, link);
5089 for (link = ASM_LABELS (expr); link; ++i, link = TREE_CHAIN (link))
5090 VEC_safe_push (tree, gc, labels, link);
5092 /* Do not add ASMs with errors to the gimple IL stream. */
5093 if (ret != GS_ERROR)
5095 stmt = gimple_build_asm_vec (TREE_STRING_POINTER (ASM_STRING (expr)),
5096 inputs, outputs, clobbers, labels);
5098 gimple_asm_set_volatile (stmt, ASM_VOLATILE_P (expr));
5099 gimple_asm_set_input (stmt, ASM_INPUT_P (expr));
5101 gimplify_seq_add_stmt (pre_p, stmt);
5107 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
5108 GIMPLE_WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
5109 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
5110 return to this function.
5112 FIXME should we complexify the prequeue handling instead? Or use flags
5113 for all the cleanups and let the optimizer tighten them up? The current
5114 code seems pretty fragile; it will break on a cleanup within any
5115 non-conditional nesting. But any such nesting would be broken, anyway;
5116 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
5117 and continues out of it. We can do that at the RTL level, though, so
5118 having an optimizer to tighten up try/finally regions would be a Good
5121 static enum gimplify_status
5122 gimplify_cleanup_point_expr (tree *expr_p, gimple_seq *pre_p)
5124 gimple_stmt_iterator iter;
5125 gimple_seq body_sequence = NULL;
5127 tree temp = voidify_wrapper_expr (*expr_p, NULL);
5129 /* We only care about the number of conditions between the innermost
5130 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
5131 any cleanups collected outside the CLEANUP_POINT_EXPR. */
5132 int old_conds = gimplify_ctxp->conditions;
5133 gimple_seq old_cleanups = gimplify_ctxp->conditional_cleanups;
5134 gimplify_ctxp->conditions = 0;
5135 gimplify_ctxp->conditional_cleanups = NULL;
5137 gimplify_stmt (&TREE_OPERAND (*expr_p, 0), &body_sequence);
5139 gimplify_ctxp->conditions = old_conds;
5140 gimplify_ctxp->conditional_cleanups = old_cleanups;
5142 for (iter = gsi_start (body_sequence); !gsi_end_p (iter); )
5144 gimple wce = gsi_stmt (iter);
5146 if (gimple_code (wce) == GIMPLE_WITH_CLEANUP_EXPR)
5148 if (gsi_one_before_end_p (iter))
5150 /* Note that gsi_insert_seq_before and gsi_remove do not
5151 scan operands, unlike some other sequence mutators. */
5152 if (!gimple_wce_cleanup_eh_only (wce))
5153 gsi_insert_seq_before_without_update (&iter,
5154 gimple_wce_cleanup (wce),
5156 gsi_remove (&iter, true);
5163 enum gimple_try_flags kind;
5165 if (gimple_wce_cleanup_eh_only (wce))
5166 kind = GIMPLE_TRY_CATCH;
5168 kind = GIMPLE_TRY_FINALLY;
5169 seq = gsi_split_seq_after (iter);
5171 gtry = gimple_build_try (seq, gimple_wce_cleanup (wce), kind);
5172 /* Do not use gsi_replace here, as it may scan operands.
5173 We want to do a simple structural modification only. */
5174 *gsi_stmt_ptr (&iter) = gtry;
5175 iter = gsi_start (seq);
5182 gimplify_seq_add_seq (pre_p, body_sequence);
5195 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
5196 is the cleanup action required. EH_ONLY is true if the cleanup should
5197 only be executed if an exception is thrown, not on normal exit. */
5200 gimple_push_cleanup (tree var, tree cleanup, bool eh_only, gimple_seq *pre_p)
5203 gimple_seq cleanup_stmts = NULL;
5205 /* Errors can result in improperly nested cleanups. Which results in
5206 confusion when trying to resolve the GIMPLE_WITH_CLEANUP_EXPR. */
5210 if (gimple_conditional_context ())
5212 /* If we're in a conditional context, this is more complex. We only
5213 want to run the cleanup if we actually ran the initialization that
5214 necessitates it, but we want to run it after the end of the
5215 conditional context. So we wrap the try/finally around the
5216 condition and use a flag to determine whether or not to actually
5217 run the destructor. Thus
5221 becomes (approximately)
5225 if (test) { A::A(temp); flag = 1; val = f(temp); }
5228 if (flag) A::~A(temp);
5232 tree flag = create_tmp_var (boolean_type_node, "cleanup");
5233 gimple ffalse = gimple_build_assign (flag, boolean_false_node);
5234 gimple ftrue = gimple_build_assign (flag, boolean_true_node);
5236 cleanup = build3 (COND_EXPR, void_type_node, flag, cleanup, NULL);
5237 gimplify_stmt (&cleanup, &cleanup_stmts);
5238 wce = gimple_build_wce (cleanup_stmts);
5240 gimplify_seq_add_stmt (&gimplify_ctxp->conditional_cleanups, ffalse);
5241 gimplify_seq_add_stmt (&gimplify_ctxp->conditional_cleanups, wce);
5242 gimplify_seq_add_stmt (pre_p, ftrue);
5244 /* Because of this manipulation, and the EH edges that jump
5245 threading cannot redirect, the temporary (VAR) will appear
5246 to be used uninitialized. Don't warn. */
5247 TREE_NO_WARNING (var) = 1;
5251 gimplify_stmt (&cleanup, &cleanup_stmts);
5252 wce = gimple_build_wce (cleanup_stmts);
5253 gimple_wce_set_cleanup_eh_only (wce, eh_only);
5254 gimplify_seq_add_stmt (pre_p, wce);
5258 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
5260 static enum gimplify_status
5261 gimplify_target_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
5263 tree targ = *expr_p;
5264 tree temp = TARGET_EXPR_SLOT (targ);
5265 tree init = TARGET_EXPR_INITIAL (targ);
5266 enum gimplify_status ret;
5270 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
5271 to the temps list. Handle also variable length TARGET_EXPRs. */
5272 if (TREE_CODE (DECL_SIZE (temp)) != INTEGER_CST)
5274 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (temp)))
5275 gimplify_type_sizes (TREE_TYPE (temp), pre_p);
5276 gimplify_vla_decl (temp, pre_p);
5279 gimple_add_tmp_var (temp);
5281 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
5282 expression is supposed to initialize the slot. */
5283 if (VOID_TYPE_P (TREE_TYPE (init)))
5284 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
5287 tree init_expr = build2 (INIT_EXPR, void_type_node, temp, init);
5289 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
5291 ggc_free (init_expr);
5293 if (ret == GS_ERROR)
5295 /* PR c++/28266 Make sure this is expanded only once. */
5296 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
5300 gimplify_and_add (init, pre_p);
5302 /* If needed, push the cleanup for the temp. */
5303 if (TARGET_EXPR_CLEANUP (targ))
5304 gimple_push_cleanup (temp, TARGET_EXPR_CLEANUP (targ),
5305 CLEANUP_EH_ONLY (targ), pre_p);
5307 /* Only expand this once. */
5308 TREE_OPERAND (targ, 3) = init;
5309 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
5312 /* We should have expanded this before. */
5313 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp));
5319 /* Gimplification of expression trees. */
5321 /* Gimplify an expression which appears at statement context. The
5322 corresponding GIMPLE statements are added to *SEQ_P. If *SEQ_P is
5323 NULL, a new sequence is allocated.
5325 Return true if we actually added a statement to the queue. */
5328 gimplify_stmt (tree *stmt_p, gimple_seq *seq_p)
5330 gimple_seq_node last;
5333 *seq_p = gimple_seq_alloc ();
5335 last = gimple_seq_last (*seq_p);
5336 gimplify_expr (stmt_p, seq_p, NULL, is_gimple_stmt, fb_none);
5337 return last != gimple_seq_last (*seq_p);
5341 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
5342 to CTX. If entries already exist, force them to be some flavor of private.
5343 If there is no enclosing parallel, do nothing. */
5346 omp_firstprivatize_variable (struct gimplify_omp_ctx *ctx, tree decl)
5350 if (decl == NULL || !DECL_P (decl))
5355 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5358 if (n->value & GOVD_SHARED)
5359 n->value = GOVD_FIRSTPRIVATE | (n->value & GOVD_SEEN);
5363 else if (ctx->region_type != ORT_WORKSHARE)
5364 omp_add_variable (ctx, decl, GOVD_FIRSTPRIVATE);
5366 ctx = ctx->outer_context;
5371 /* Similarly for each of the type sizes of TYPE. */
5374 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx *ctx, tree type)
5376 if (type == NULL || type == error_mark_node)
5378 type = TYPE_MAIN_VARIANT (type);
5380 if (pointer_set_insert (ctx->privatized_types, type))
5383 switch (TREE_CODE (type))
5389 case FIXED_POINT_TYPE:
5390 omp_firstprivatize_variable (ctx, TYPE_MIN_VALUE (type));
5391 omp_firstprivatize_variable (ctx, TYPE_MAX_VALUE (type));
5395 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
5396 omp_firstprivatize_type_sizes (ctx, TYPE_DOMAIN (type));
5401 case QUAL_UNION_TYPE:
5404 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
5405 if (TREE_CODE (field) == FIELD_DECL)
5407 omp_firstprivatize_variable (ctx, DECL_FIELD_OFFSET (field));
5408 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (field));
5414 case REFERENCE_TYPE:
5415 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
5422 omp_firstprivatize_variable (ctx, TYPE_SIZE (type));
5423 omp_firstprivatize_variable (ctx, TYPE_SIZE_UNIT (type));
5424 lang_hooks.types.omp_firstprivatize_type_sizes (ctx, type);
5427 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
5430 omp_add_variable (struct gimplify_omp_ctx *ctx, tree decl, unsigned int flags)
5433 unsigned int nflags;
5436 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5439 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
5440 there are constructors involved somewhere. */
5441 if (TREE_ADDRESSABLE (TREE_TYPE (decl))
5442 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
5445 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5448 /* We shouldn't be re-adding the decl with the same data
5450 gcc_assert ((n->value & GOVD_DATA_SHARE_CLASS & flags) == 0);
5451 /* The only combination of data sharing classes we should see is
5452 FIRSTPRIVATE and LASTPRIVATE. */
5453 nflags = n->value | flags;
5454 gcc_assert ((nflags & GOVD_DATA_SHARE_CLASS)
5455 == (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE));
5460 /* When adding a variable-sized variable, we have to handle all sorts
5461 of additional bits of data: the pointer replacement variable, and
5462 the parameters of the type. */
5463 if (DECL_SIZE (decl) && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
5465 /* Add the pointer replacement variable as PRIVATE if the variable
5466 replacement is private, else FIRSTPRIVATE since we'll need the
5467 address of the original variable either for SHARED, or for the
5468 copy into or out of the context. */
5469 if (!(flags & GOVD_LOCAL))
5471 nflags = flags & GOVD_PRIVATE ? GOVD_PRIVATE : GOVD_FIRSTPRIVATE;
5472 nflags |= flags & GOVD_SEEN;
5473 t = DECL_VALUE_EXPR (decl);
5474 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
5475 t = TREE_OPERAND (t, 0);
5476 gcc_assert (DECL_P (t));
5477 omp_add_variable (ctx, t, nflags);
5480 /* Add all of the variable and type parameters (which should have
5481 been gimplified to a formal temporary) as FIRSTPRIVATE. */
5482 omp_firstprivatize_variable (ctx, DECL_SIZE_UNIT (decl));
5483 omp_firstprivatize_variable (ctx, DECL_SIZE (decl));
5484 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
5486 /* The variable-sized variable itself is never SHARED, only some form
5487 of PRIVATE. The sharing would take place via the pointer variable
5488 which we remapped above. */
5489 if (flags & GOVD_SHARED)
5490 flags = GOVD_PRIVATE | GOVD_DEBUG_PRIVATE
5491 | (flags & (GOVD_SEEN | GOVD_EXPLICIT));
5493 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
5494 alloca statement we generate for the variable, so make sure it
5495 is available. This isn't automatically needed for the SHARED
5496 case, since we won't be allocating local storage then.
5497 For local variables TYPE_SIZE_UNIT might not be gimplified yet,
5498 in this case omp_notice_variable will be called later
5499 on when it is gimplified. */
5500 else if (! (flags & GOVD_LOCAL))
5501 omp_notice_variable (ctx, TYPE_SIZE_UNIT (TREE_TYPE (decl)), true);
5503 else if (lang_hooks.decls.omp_privatize_by_reference (decl))
5505 gcc_assert ((flags & GOVD_LOCAL) == 0);
5506 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
5508 /* Similar to the direct variable sized case above, we'll need the
5509 size of references being privatized. */
5510 if ((flags & GOVD_SHARED) == 0)
5512 t = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl)));
5513 if (TREE_CODE (t) != INTEGER_CST)
5514 omp_notice_variable (ctx, t, true);
5518 splay_tree_insert (ctx->variables, (splay_tree_key)decl, flags);
5521 /* Notice a threadprivate variable DECL used in OpenMP context CTX.
5522 This just prints out diagnostics about threadprivate variable uses
5523 in untied tasks. If DECL2 is non-NULL, prevent this warning
5524 on that variable. */
5527 omp_notice_threadprivate_variable (struct gimplify_omp_ctx *ctx, tree decl,
5532 if (ctx->region_type != ORT_UNTIED_TASK)
5534 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5537 error ("threadprivate variable %qE used in untied task", DECL_NAME (decl));
5538 error_at (ctx->location, "enclosing task");
5539 splay_tree_insert (ctx->variables, (splay_tree_key)decl, 0);
5542 splay_tree_insert (ctx->variables, (splay_tree_key)decl2, 0);
5546 /* Record the fact that DECL was used within the OpenMP context CTX.
5547 IN_CODE is true when real code uses DECL, and false when we should
5548 merely emit default(none) errors. Return true if DECL is going to
5549 be remapped and thus DECL shouldn't be gimplified into its
5550 DECL_VALUE_EXPR (if any). */
5553 omp_notice_variable (struct gimplify_omp_ctx *ctx, tree decl, bool in_code)
5556 unsigned flags = in_code ? GOVD_SEEN : 0;
5557 bool ret = false, shared;
5559 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5562 /* Threadprivate variables are predetermined. */
5563 if (is_global_var (decl))
5565 if (DECL_THREAD_LOCAL_P (decl))
5566 return omp_notice_threadprivate_variable (ctx, decl, NULL_TREE);
5568 if (DECL_HAS_VALUE_EXPR_P (decl))
5570 tree value = get_base_address (DECL_VALUE_EXPR (decl));
5572 if (value && DECL_P (value) && DECL_THREAD_LOCAL_P (value))
5573 return omp_notice_threadprivate_variable (ctx, decl, value);
5577 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5580 enum omp_clause_default_kind default_kind, kind;
5581 struct gimplify_omp_ctx *octx;
5583 if (ctx->region_type == ORT_WORKSHARE)
5586 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
5587 remapped firstprivate instead of shared. To some extent this is
5588 addressed in omp_firstprivatize_type_sizes, but not effectively. */
5589 default_kind = ctx->default_kind;
5590 kind = lang_hooks.decls.omp_predetermined_sharing (decl);
5591 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
5592 default_kind = kind;
5594 switch (default_kind)
5596 case OMP_CLAUSE_DEFAULT_NONE:
5597 error ("%qE not specified in enclosing parallel",
5598 DECL_NAME (lang_hooks.decls.omp_report_decl (decl)));
5599 if ((ctx->region_type & ORT_TASK) != 0)
5600 error_at (ctx->location, "enclosing task");
5602 error_at (ctx->location, "enclosing parallel");
5604 case OMP_CLAUSE_DEFAULT_SHARED:
5605 flags |= GOVD_SHARED;
5607 case OMP_CLAUSE_DEFAULT_PRIVATE:
5608 flags |= GOVD_PRIVATE;
5610 case OMP_CLAUSE_DEFAULT_FIRSTPRIVATE:
5611 flags |= GOVD_FIRSTPRIVATE;
5613 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
5614 /* decl will be either GOVD_FIRSTPRIVATE or GOVD_SHARED. */
5615 gcc_assert ((ctx->region_type & ORT_TASK) != 0);
5616 if (ctx->outer_context)
5617 omp_notice_variable (ctx->outer_context, decl, in_code);
5618 for (octx = ctx->outer_context; octx; octx = octx->outer_context)
5622 n2 = splay_tree_lookup (octx->variables, (splay_tree_key) decl);
5623 if (n2 && (n2->value & GOVD_DATA_SHARE_CLASS) != GOVD_SHARED)
5625 flags |= GOVD_FIRSTPRIVATE;
5628 if ((octx->region_type & ORT_PARALLEL) != 0)
5631 if (flags & GOVD_FIRSTPRIVATE)
5634 && (TREE_CODE (decl) == PARM_DECL
5635 || (!is_global_var (decl)
5636 && DECL_CONTEXT (decl) == current_function_decl)))
5638 flags |= GOVD_FIRSTPRIVATE;
5641 flags |= GOVD_SHARED;
5647 if ((flags & GOVD_PRIVATE)
5648 && lang_hooks.decls.omp_private_outer_ref (decl))
5649 flags |= GOVD_PRIVATE_OUTER_REF;
5651 omp_add_variable (ctx, decl, flags);
5653 shared = (flags & GOVD_SHARED) != 0;
5654 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
5658 if ((n->value & (GOVD_SEEN | GOVD_LOCAL)) == 0
5659 && (flags & (GOVD_SEEN | GOVD_LOCAL)) == GOVD_SEEN
5661 && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
5664 tree t = DECL_VALUE_EXPR (decl);
5665 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
5666 t = TREE_OPERAND (t, 0);
5667 gcc_assert (DECL_P (t));
5668 n2 = splay_tree_lookup (ctx->variables, (splay_tree_key) t);
5669 n2->value |= GOVD_SEEN;
5672 shared = ((flags | n->value) & GOVD_SHARED) != 0;
5673 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
5675 /* If nothing changed, there's nothing left to do. */
5676 if ((n->value & flags) == flags)
5682 /* If the variable is private in the current context, then we don't
5683 need to propagate anything to an outer context. */
5684 if ((flags & GOVD_PRIVATE) && !(flags & GOVD_PRIVATE_OUTER_REF))
5686 if (ctx->outer_context
5687 && omp_notice_variable (ctx->outer_context, decl, in_code))
5692 /* Verify that DECL is private within CTX. If there's specific information
5693 to the contrary in the innermost scope, generate an error. */
5696 omp_is_private (struct gimplify_omp_ctx *ctx, tree decl)
5700 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5703 if (n->value & GOVD_SHARED)
5705 if (ctx == gimplify_omp_ctxp)
5707 error ("iteration variable %qE should be private",
5709 n->value = GOVD_PRIVATE;
5715 else if ((n->value & GOVD_EXPLICIT) != 0
5716 && (ctx == gimplify_omp_ctxp
5717 || (ctx->region_type == ORT_COMBINED_PARALLEL
5718 && gimplify_omp_ctxp->outer_context == ctx)))
5720 if ((n->value & GOVD_FIRSTPRIVATE) != 0)
5721 error ("iteration variable %qE should not be firstprivate",
5723 else if ((n->value & GOVD_REDUCTION) != 0)
5724 error ("iteration variable %qE should not be reduction",
5727 return (ctx == gimplify_omp_ctxp
5728 || (ctx->region_type == ORT_COMBINED_PARALLEL
5729 && gimplify_omp_ctxp->outer_context == ctx));
5732 if (ctx->region_type != ORT_WORKSHARE)
5734 else if (ctx->outer_context)
5735 return omp_is_private (ctx->outer_context, decl);
5739 /* Return true if DECL is private within a parallel region
5740 that binds to the current construct's context or in parallel
5741 region's REDUCTION clause. */
5744 omp_check_private (struct gimplify_omp_ctx *ctx, tree decl)
5750 ctx = ctx->outer_context;
5752 return !(is_global_var (decl)
5753 /* References might be private, but might be shared too. */
5754 || lang_hooks.decls.omp_privatize_by_reference (decl));
5756 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5758 return (n->value & GOVD_SHARED) == 0;
5760 while (ctx->region_type == ORT_WORKSHARE);
5764 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
5765 and previous omp contexts. */
5768 gimplify_scan_omp_clauses (tree *list_p, gimple_seq *pre_p,
5769 enum omp_region_type region_type)
5771 struct gimplify_omp_ctx *ctx, *outer_ctx;
5772 struct gimplify_ctx gctx;
5775 ctx = new_omp_context (region_type);
5776 outer_ctx = ctx->outer_context;
5778 while ((c = *list_p) != NULL)
5780 bool remove = false;
5781 bool notice_outer = true;
5782 const char *check_non_private = NULL;
5786 switch (OMP_CLAUSE_CODE (c))
5788 case OMP_CLAUSE_PRIVATE:
5789 flags = GOVD_PRIVATE | GOVD_EXPLICIT;
5790 if (lang_hooks.decls.omp_private_outer_ref (OMP_CLAUSE_DECL (c)))
5792 flags |= GOVD_PRIVATE_OUTER_REF;
5793 OMP_CLAUSE_PRIVATE_OUTER_REF (c) = 1;
5796 notice_outer = false;
5798 case OMP_CLAUSE_SHARED:
5799 flags = GOVD_SHARED | GOVD_EXPLICIT;
5801 case OMP_CLAUSE_FIRSTPRIVATE:
5802 flags = GOVD_FIRSTPRIVATE | GOVD_EXPLICIT;
5803 check_non_private = "firstprivate";
5805 case OMP_CLAUSE_LASTPRIVATE:
5806 flags = GOVD_LASTPRIVATE | GOVD_SEEN | GOVD_EXPLICIT;
5807 check_non_private = "lastprivate";
5809 case OMP_CLAUSE_REDUCTION:
5810 flags = GOVD_REDUCTION | GOVD_SEEN | GOVD_EXPLICIT;
5811 check_non_private = "reduction";
5815 decl = OMP_CLAUSE_DECL (c);
5816 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5821 omp_add_variable (ctx, decl, flags);
5822 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION
5823 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c))
5825 omp_add_variable (ctx, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c),
5826 GOVD_LOCAL | GOVD_SEEN);
5827 gimplify_omp_ctxp = ctx;
5828 push_gimplify_context (&gctx);
5830 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c) = gimple_seq_alloc ();
5831 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c) = gimple_seq_alloc ();
5833 gimplify_and_add (OMP_CLAUSE_REDUCTION_INIT (c),
5834 &OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c));
5835 pop_gimplify_context
5836 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c)));
5837 push_gimplify_context (&gctx);
5838 gimplify_and_add (OMP_CLAUSE_REDUCTION_MERGE (c),
5839 &OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c));
5840 pop_gimplify_context
5841 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c)));
5842 OMP_CLAUSE_REDUCTION_INIT (c) = NULL_TREE;
5843 OMP_CLAUSE_REDUCTION_MERGE (c) = NULL_TREE;
5845 gimplify_omp_ctxp = outer_ctx;
5847 else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
5848 && OMP_CLAUSE_LASTPRIVATE_STMT (c))
5850 gimplify_omp_ctxp = ctx;
5851 push_gimplify_context (&gctx);
5852 if (TREE_CODE (OMP_CLAUSE_LASTPRIVATE_STMT (c)) != BIND_EXPR)
5854 tree bind = build3 (BIND_EXPR, void_type_node, NULL,
5856 TREE_SIDE_EFFECTS (bind) = 1;
5857 BIND_EXPR_BODY (bind) = OMP_CLAUSE_LASTPRIVATE_STMT (c);
5858 OMP_CLAUSE_LASTPRIVATE_STMT (c) = bind;
5860 gimplify_and_add (OMP_CLAUSE_LASTPRIVATE_STMT (c),
5861 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c));
5862 pop_gimplify_context
5863 (gimple_seq_first_stmt (OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c)));
5864 OMP_CLAUSE_LASTPRIVATE_STMT (c) = NULL_TREE;
5866 gimplify_omp_ctxp = outer_ctx;
5872 case OMP_CLAUSE_COPYIN:
5873 case OMP_CLAUSE_COPYPRIVATE:
5874 decl = OMP_CLAUSE_DECL (c);
5875 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5882 omp_notice_variable (outer_ctx, decl, true);
5883 if (check_non_private
5884 && region_type == ORT_WORKSHARE
5885 && omp_check_private (ctx, decl))
5887 error ("%s variable %qE is private in outer context",
5888 check_non_private, DECL_NAME (decl));
5894 OMP_CLAUSE_OPERAND (c, 0)
5895 = gimple_boolify (OMP_CLAUSE_OPERAND (c, 0));
5898 case OMP_CLAUSE_SCHEDULE:
5899 case OMP_CLAUSE_NUM_THREADS:
5900 if (gimplify_expr (&OMP_CLAUSE_OPERAND (c, 0), pre_p, NULL,
5901 is_gimple_val, fb_rvalue) == GS_ERROR)
5905 case OMP_CLAUSE_NOWAIT:
5906 case OMP_CLAUSE_ORDERED:
5907 case OMP_CLAUSE_UNTIED:
5908 case OMP_CLAUSE_COLLAPSE:
5911 case OMP_CLAUSE_DEFAULT:
5912 ctx->default_kind = OMP_CLAUSE_DEFAULT_KIND (c);
5920 *list_p = OMP_CLAUSE_CHAIN (c);
5922 list_p = &OMP_CLAUSE_CHAIN (c);
5925 gimplify_omp_ctxp = ctx;
5928 /* For all variables that were not actually used within the context,
5929 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
5932 gimplify_adjust_omp_clauses_1 (splay_tree_node n, void *data)
5934 tree *list_p = (tree *) data;
5935 tree decl = (tree) n->key;
5936 unsigned flags = n->value;
5937 enum omp_clause_code code;
5941 if (flags & (GOVD_EXPLICIT | GOVD_LOCAL))
5943 if ((flags & GOVD_SEEN) == 0)
5945 if (flags & GOVD_DEBUG_PRIVATE)
5947 gcc_assert ((flags & GOVD_DATA_SHARE_CLASS) == GOVD_PRIVATE);
5948 private_debug = true;
5952 = lang_hooks.decls.omp_private_debug_clause (decl,
5953 !!(flags & GOVD_SHARED));
5955 code = OMP_CLAUSE_PRIVATE;
5956 else if (flags & GOVD_SHARED)
5958 if (is_global_var (decl))
5960 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp->outer_context;
5964 = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5965 if (on && (on->value & (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE
5966 | GOVD_PRIVATE | GOVD_REDUCTION)) != 0)
5968 ctx = ctx->outer_context;
5973 code = OMP_CLAUSE_SHARED;
5975 else if (flags & GOVD_PRIVATE)
5976 code = OMP_CLAUSE_PRIVATE;
5977 else if (flags & GOVD_FIRSTPRIVATE)
5978 code = OMP_CLAUSE_FIRSTPRIVATE;
5982 clause = build_omp_clause (input_location, code);
5983 OMP_CLAUSE_DECL (clause) = decl;
5984 OMP_CLAUSE_CHAIN (clause) = *list_p;
5986 OMP_CLAUSE_PRIVATE_DEBUG (clause) = 1;
5987 else if (code == OMP_CLAUSE_PRIVATE && (flags & GOVD_PRIVATE_OUTER_REF))
5988 OMP_CLAUSE_PRIVATE_OUTER_REF (clause) = 1;
5990 lang_hooks.decls.omp_finish_clause (clause);
5996 gimplify_adjust_omp_clauses (tree *list_p)
5998 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
6001 while ((c = *list_p) != NULL)
6004 bool remove = false;
6006 switch (OMP_CLAUSE_CODE (c))
6008 case OMP_CLAUSE_PRIVATE:
6009 case OMP_CLAUSE_SHARED:
6010 case OMP_CLAUSE_FIRSTPRIVATE:
6011 decl = OMP_CLAUSE_DECL (c);
6012 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
6013 remove = !(n->value & GOVD_SEEN);
6016 bool shared = OMP_CLAUSE_CODE (c) == OMP_CLAUSE_SHARED;
6017 if ((n->value & GOVD_DEBUG_PRIVATE)
6018 || lang_hooks.decls.omp_private_debug_clause (decl, shared))
6020 gcc_assert ((n->value & GOVD_DEBUG_PRIVATE) == 0
6021 || ((n->value & GOVD_DATA_SHARE_CLASS)
6023 OMP_CLAUSE_SET_CODE (c, OMP_CLAUSE_PRIVATE);
6024 OMP_CLAUSE_PRIVATE_DEBUG (c) = 1;
6029 case OMP_CLAUSE_LASTPRIVATE:
6030 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
6031 accurately reflect the presence of a FIRSTPRIVATE clause. */
6032 decl = OMP_CLAUSE_DECL (c);
6033 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
6034 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)
6035 = (n->value & GOVD_FIRSTPRIVATE) != 0;
6038 case OMP_CLAUSE_REDUCTION:
6039 case OMP_CLAUSE_COPYIN:
6040 case OMP_CLAUSE_COPYPRIVATE:
6042 case OMP_CLAUSE_NUM_THREADS:
6043 case OMP_CLAUSE_SCHEDULE:
6044 case OMP_CLAUSE_NOWAIT:
6045 case OMP_CLAUSE_ORDERED:
6046 case OMP_CLAUSE_DEFAULT:
6047 case OMP_CLAUSE_UNTIED:
6048 case OMP_CLAUSE_COLLAPSE:
6056 *list_p = OMP_CLAUSE_CHAIN (c);
6058 list_p = &OMP_CLAUSE_CHAIN (c);
6061 /* Add in any implicit data sharing. */
6062 splay_tree_foreach (ctx->variables, gimplify_adjust_omp_clauses_1, list_p);
6064 gimplify_omp_ctxp = ctx->outer_context;
6065 delete_omp_context (ctx);
6068 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
6069 gimplification of the body, as well as scanning the body for used
6070 variables. We need to do this scan now, because variable-sized
6071 decls will be decomposed during gimplification. */
6074 gimplify_omp_parallel (tree *expr_p, gimple_seq *pre_p)
6076 tree expr = *expr_p;
6078 gimple_seq body = NULL;
6079 struct gimplify_ctx gctx;
6081 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr), pre_p,
6082 OMP_PARALLEL_COMBINED (expr)
6083 ? ORT_COMBINED_PARALLEL
6086 push_gimplify_context (&gctx);
6088 g = gimplify_and_return_first (OMP_PARALLEL_BODY (expr), &body);
6089 if (gimple_code (g) == GIMPLE_BIND)
6090 pop_gimplify_context (g);
6092 pop_gimplify_context (NULL);
6094 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr));
6096 g = gimple_build_omp_parallel (body,
6097 OMP_PARALLEL_CLAUSES (expr),
6098 NULL_TREE, NULL_TREE);
6099 if (OMP_PARALLEL_COMBINED (expr))
6100 gimple_omp_set_subcode (g, GF_OMP_PARALLEL_COMBINED);
6101 gimplify_seq_add_stmt (pre_p, g);
6102 *expr_p = NULL_TREE;
6105 /* Gimplify the contents of an OMP_TASK statement. This involves
6106 gimplification of the body, as well as scanning the body for used
6107 variables. We need to do this scan now, because variable-sized
6108 decls will be decomposed during gimplification. */
6111 gimplify_omp_task (tree *expr_p, gimple_seq *pre_p)
6113 tree expr = *expr_p;
6115 gimple_seq body = NULL;
6116 struct gimplify_ctx gctx;
6118 gimplify_scan_omp_clauses (&OMP_TASK_CLAUSES (expr), pre_p,
6119 find_omp_clause (OMP_TASK_CLAUSES (expr),
6121 ? ORT_UNTIED_TASK : ORT_TASK);
6123 push_gimplify_context (&gctx);
6125 g = gimplify_and_return_first (OMP_TASK_BODY (expr), &body);
6126 if (gimple_code (g) == GIMPLE_BIND)
6127 pop_gimplify_context (g);
6129 pop_gimplify_context (NULL);
6131 gimplify_adjust_omp_clauses (&OMP_TASK_CLAUSES (expr));
6133 g = gimple_build_omp_task (body,
6134 OMP_TASK_CLAUSES (expr),
6135 NULL_TREE, NULL_TREE,
6136 NULL_TREE, NULL_TREE, NULL_TREE);
6137 gimplify_seq_add_stmt (pre_p, g);
6138 *expr_p = NULL_TREE;
6141 /* Gimplify the gross structure of an OMP_FOR statement. */
6143 static enum gimplify_status
6144 gimplify_omp_for (tree *expr_p, gimple_seq *pre_p)
6146 tree for_stmt, decl, var, t;
6147 enum gimplify_status ret = GS_ALL_DONE;
6148 enum gimplify_status tret;
6150 gimple_seq for_body, for_pre_body;
6155 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt), pre_p,
6158 /* Handle OMP_FOR_INIT. */
6159 for_pre_body = NULL;
6160 gimplify_and_add (OMP_FOR_PRE_BODY (for_stmt), &for_pre_body);
6161 OMP_FOR_PRE_BODY (for_stmt) = NULL_TREE;
6163 for_body = gimple_seq_alloc ();
6164 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt))
6165 == TREE_VEC_LENGTH (OMP_FOR_COND (for_stmt)));
6166 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt))
6167 == TREE_VEC_LENGTH (OMP_FOR_INCR (for_stmt)));
6168 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)); i++)
6170 t = TREE_VEC_ELT (OMP_FOR_INIT (for_stmt), i);
6171 gcc_assert (TREE_CODE (t) == MODIFY_EXPR);
6172 decl = TREE_OPERAND (t, 0);
6173 gcc_assert (DECL_P (decl));
6174 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl))
6175 || POINTER_TYPE_P (TREE_TYPE (decl)));
6177 /* Make sure the iteration variable is private. */
6178 if (omp_is_private (gimplify_omp_ctxp, decl))
6179 omp_notice_variable (gimplify_omp_ctxp, decl, true);
6181 omp_add_variable (gimplify_omp_ctxp, decl, GOVD_PRIVATE | GOVD_SEEN);
6183 /* If DECL is not a gimple register, create a temporary variable to act
6184 as an iteration counter. This is valid, since DECL cannot be
6185 modified in the body of the loop. */
6186 if (!is_gimple_reg (decl))
6188 var = create_tmp_var (TREE_TYPE (decl), get_name (decl));
6189 TREE_OPERAND (t, 0) = var;
6191 gimplify_seq_add_stmt (&for_body, gimple_build_assign (decl, var));
6193 omp_add_variable (gimplify_omp_ctxp, var, GOVD_PRIVATE | GOVD_SEEN);
6198 tret = gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
6199 is_gimple_val, fb_rvalue);
6200 ret = MIN (ret, tret);
6201 if (ret == GS_ERROR)
6204 /* Handle OMP_FOR_COND. */
6205 t = TREE_VEC_ELT (OMP_FOR_COND (for_stmt), i);
6206 gcc_assert (COMPARISON_CLASS_P (t));
6207 gcc_assert (TREE_OPERAND (t, 0) == decl);
6209 tret = gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
6210 is_gimple_val, fb_rvalue);
6211 ret = MIN (ret, tret);
6213 /* Handle OMP_FOR_INCR. */
6214 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6215 switch (TREE_CODE (t))
6217 case PREINCREMENT_EXPR:
6218 case POSTINCREMENT_EXPR:
6219 t = build_int_cst (TREE_TYPE (decl), 1);
6220 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
6221 t = build2 (MODIFY_EXPR, TREE_TYPE (var), var, t);
6222 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i) = t;
6225 case PREDECREMENT_EXPR:
6226 case POSTDECREMENT_EXPR:
6227 t = build_int_cst (TREE_TYPE (decl), -1);
6228 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
6229 t = build2 (MODIFY_EXPR, TREE_TYPE (var), var, t);
6230 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i) = t;
6234 gcc_assert (TREE_OPERAND (t, 0) == decl);
6235 TREE_OPERAND (t, 0) = var;
6237 t = TREE_OPERAND (t, 1);
6238 switch (TREE_CODE (t))
6241 if (TREE_OPERAND (t, 1) == decl)
6243 TREE_OPERAND (t, 1) = TREE_OPERAND (t, 0);
6244 TREE_OPERAND (t, 0) = var;
6250 case POINTER_PLUS_EXPR:
6251 gcc_assert (TREE_OPERAND (t, 0) == decl);
6252 TREE_OPERAND (t, 0) = var;
6258 tret = gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
6259 is_gimple_val, fb_rvalue);
6260 ret = MIN (ret, tret);
6267 if (var != decl || TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)) > 1)
6270 for (c = OMP_FOR_CLAUSES (for_stmt); c ; c = OMP_CLAUSE_CHAIN (c))
6271 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
6272 && OMP_CLAUSE_DECL (c) == decl
6273 && OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c) == NULL)
6275 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6276 gcc_assert (TREE_CODE (t) == MODIFY_EXPR);
6277 gcc_assert (TREE_OPERAND (t, 0) == var);
6278 t = TREE_OPERAND (t, 1);
6279 gcc_assert (TREE_CODE (t) == PLUS_EXPR
6280 || TREE_CODE (t) == MINUS_EXPR
6281 || TREE_CODE (t) == POINTER_PLUS_EXPR);
6282 gcc_assert (TREE_OPERAND (t, 0) == var);
6283 t = build2 (TREE_CODE (t), TREE_TYPE (decl), decl,
6284 TREE_OPERAND (t, 1));
6285 gimplify_assign (decl, t,
6286 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c));
6291 gimplify_and_add (OMP_FOR_BODY (for_stmt), &for_body);
6293 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt));
6295 gfor = gimple_build_omp_for (for_body, OMP_FOR_CLAUSES (for_stmt),
6296 TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)),
6299 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)); i++)
6301 t = TREE_VEC_ELT (OMP_FOR_INIT (for_stmt), i);
6302 gimple_omp_for_set_index (gfor, i, TREE_OPERAND (t, 0));
6303 gimple_omp_for_set_initial (gfor, i, TREE_OPERAND (t, 1));
6304 t = TREE_VEC_ELT (OMP_FOR_COND (for_stmt), i);
6305 gimple_omp_for_set_cond (gfor, i, TREE_CODE (t));
6306 gimple_omp_for_set_final (gfor, i, TREE_OPERAND (t, 1));
6307 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6308 gimple_omp_for_set_incr (gfor, i, TREE_OPERAND (t, 1));
6311 gimplify_seq_add_stmt (pre_p, gfor);
6312 return ret == GS_ALL_DONE ? GS_ALL_DONE : GS_ERROR;
6315 /* Gimplify the gross structure of other OpenMP worksharing constructs.
6316 In particular, OMP_SECTIONS and OMP_SINGLE. */
6319 gimplify_omp_workshare (tree *expr_p, gimple_seq *pre_p)
6321 tree expr = *expr_p;
6323 gimple_seq body = NULL;
6325 gimplify_scan_omp_clauses (&OMP_CLAUSES (expr), pre_p, ORT_WORKSHARE);
6326 gimplify_and_add (OMP_BODY (expr), &body);
6327 gimplify_adjust_omp_clauses (&OMP_CLAUSES (expr));
6329 if (TREE_CODE (expr) == OMP_SECTIONS)
6330 stmt = gimple_build_omp_sections (body, OMP_CLAUSES (expr));
6331 else if (TREE_CODE (expr) == OMP_SINGLE)
6332 stmt = gimple_build_omp_single (body, OMP_CLAUSES (expr));
6336 gimplify_seq_add_stmt (pre_p, stmt);
6339 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
6340 stabilized the lhs of the atomic operation as *ADDR. Return true if
6341 EXPR is this stabilized form. */
6344 goa_lhs_expr_p (tree expr, tree addr)
6346 /* Also include casts to other type variants. The C front end is fond
6347 of adding these for e.g. volatile variables. This is like
6348 STRIP_TYPE_NOPS but includes the main variant lookup. */
6349 STRIP_USELESS_TYPE_CONVERSION (expr);
6351 if (TREE_CODE (expr) == INDIRECT_REF)
6353 expr = TREE_OPERAND (expr, 0);
6355 && (CONVERT_EXPR_P (expr)
6356 || TREE_CODE (expr) == NON_LVALUE_EXPR)
6357 && TREE_CODE (expr) == TREE_CODE (addr)
6358 && types_compatible_p (TREE_TYPE (expr), TREE_TYPE (addr)))
6360 expr = TREE_OPERAND (expr, 0);
6361 addr = TREE_OPERAND (addr, 0);
6365 return (TREE_CODE (addr) == ADDR_EXPR
6366 && TREE_CODE (expr) == ADDR_EXPR
6367 && TREE_OPERAND (addr, 0) == TREE_OPERAND (expr, 0));
6369 if (TREE_CODE (addr) == ADDR_EXPR && expr == TREE_OPERAND (addr, 0))
6374 /* Walk *EXPR_P and replace
6375 appearances of *LHS_ADDR with LHS_VAR. If an expression does not involve
6376 the lhs, evaluate it into a temporary. Return 1 if the lhs appeared as
6377 a subexpression, 0 if it did not, or -1 if an error was encountered. */
6380 goa_stabilize_expr (tree *expr_p, gimple_seq *pre_p, tree lhs_addr,
6383 tree expr = *expr_p;
6386 if (goa_lhs_expr_p (expr, lhs_addr))
6391 if (is_gimple_val (expr))
6395 switch (TREE_CODE_CLASS (TREE_CODE (expr)))
6398 case tcc_comparison:
6399 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p, lhs_addr,
6402 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p, lhs_addr,
6405 case tcc_expression:
6406 switch (TREE_CODE (expr))
6408 case TRUTH_ANDIF_EXPR:
6409 case TRUTH_ORIF_EXPR:
6410 case TRUTH_AND_EXPR:
6412 case TRUTH_XOR_EXPR:
6413 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p,
6415 case TRUTH_NOT_EXPR:
6416 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p,
6429 enum gimplify_status gs;
6430 gs = gimplify_expr (expr_p, pre_p, NULL, is_gimple_val, fb_rvalue);
6431 if (gs != GS_ALL_DONE)
6439 /* Gimplify an OMP_ATOMIC statement. */
6441 static enum gimplify_status
6442 gimplify_omp_atomic (tree *expr_p, gimple_seq *pre_p)
6444 tree addr = TREE_OPERAND (*expr_p, 0);
6445 tree rhs = TREE_OPERAND (*expr_p, 1);
6446 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr)));
6449 tmp_load = create_tmp_reg (type, NULL);
6450 if (goa_stabilize_expr (&rhs, pre_p, addr, tmp_load) < 0)
6453 if (gimplify_expr (&addr, pre_p, NULL, is_gimple_val, fb_rvalue)
6457 gimplify_seq_add_stmt (pre_p, gimple_build_omp_atomic_load (tmp_load, addr));
6458 if (gimplify_expr (&rhs, pre_p, NULL, is_gimple_val, fb_rvalue)
6461 gimplify_seq_add_stmt (pre_p, gimple_build_omp_atomic_store (rhs));
6468 /* Converts the GENERIC expression tree *EXPR_P to GIMPLE. If the
6469 expression produces a value to be used as an operand inside a GIMPLE
6470 statement, the value will be stored back in *EXPR_P. This value will
6471 be a tree of class tcc_declaration, tcc_constant, tcc_reference or
6472 an SSA_NAME. The corresponding sequence of GIMPLE statements is
6473 emitted in PRE_P and POST_P.
6475 Additionally, this process may overwrite parts of the input
6476 expression during gimplification. Ideally, it should be
6477 possible to do non-destructive gimplification.
6479 EXPR_P points to the GENERIC expression to convert to GIMPLE. If
6480 the expression needs to evaluate to a value to be used as
6481 an operand in a GIMPLE statement, this value will be stored in
6482 *EXPR_P on exit. This happens when the caller specifies one
6483 of fb_lvalue or fb_rvalue fallback flags.
6485 PRE_P will contain the sequence of GIMPLE statements corresponding
6486 to the evaluation of EXPR and all the side-effects that must
6487 be executed before the main expression. On exit, the last
6488 statement of PRE_P is the core statement being gimplified. For
6489 instance, when gimplifying 'if (++a)' the last statement in
6490 PRE_P will be 'if (t.1)' where t.1 is the result of
6491 pre-incrementing 'a'.
6493 POST_P will contain the sequence of GIMPLE statements corresponding
6494 to the evaluation of all the side-effects that must be executed
6495 after the main expression. If this is NULL, the post
6496 side-effects are stored at the end of PRE_P.
6498 The reason why the output is split in two is to handle post
6499 side-effects explicitly. In some cases, an expression may have
6500 inner and outer post side-effects which need to be emitted in
6501 an order different from the one given by the recursive
6502 traversal. For instance, for the expression (*p--)++ the post
6503 side-effects of '--' must actually occur *after* the post
6504 side-effects of '++'. However, gimplification will first visit
6505 the inner expression, so if a separate POST sequence was not
6506 used, the resulting sequence would be:
6513 However, the post-decrement operation in line #2 must not be
6514 evaluated until after the store to *p at line #4, so the
6515 correct sequence should be:
6522 So, by specifying a separate post queue, it is possible
6523 to emit the post side-effects in the correct order.
6524 If POST_P is NULL, an internal queue will be used. Before
6525 returning to the caller, the sequence POST_P is appended to
6526 the main output sequence PRE_P.
6528 GIMPLE_TEST_F points to a function that takes a tree T and
6529 returns nonzero if T is in the GIMPLE form requested by the
6530 caller. The GIMPLE predicates are in gimple.c.
6532 FALLBACK tells the function what sort of a temporary we want if
6533 gimplification cannot produce an expression that complies with
6536 fb_none means that no temporary should be generated
6537 fb_rvalue means that an rvalue is OK to generate
6538 fb_lvalue means that an lvalue is OK to generate
6539 fb_either means that either is OK, but an lvalue is preferable.
6540 fb_mayfail means that gimplification may fail (in which case
6541 GS_ERROR will be returned)
6543 The return value is either GS_ERROR or GS_ALL_DONE, since this
6544 function iterates until EXPR is completely gimplified or an error
6547 enum gimplify_status
6548 gimplify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
6549 bool (*gimple_test_f) (tree), fallback_t fallback)
6552 gimple_seq internal_pre = NULL;
6553 gimple_seq internal_post = NULL;
6556 location_t saved_location;
6557 enum gimplify_status ret;
6558 gimple_stmt_iterator pre_last_gsi, post_last_gsi;
6560 save_expr = *expr_p;
6561 if (save_expr == NULL_TREE)
6564 /* If we are gimplifying a top-level statement, PRE_P must be valid. */
6565 is_statement = gimple_test_f == is_gimple_stmt;
6569 /* Consistency checks. */
6570 if (gimple_test_f == is_gimple_reg)
6571 gcc_assert (fallback & (fb_rvalue | fb_lvalue));
6572 else if (gimple_test_f == is_gimple_val
6573 || gimple_test_f == is_gimple_call_addr
6574 || gimple_test_f == is_gimple_condexpr
6575 || gimple_test_f == is_gimple_mem_rhs
6576 || gimple_test_f == is_gimple_mem_rhs_or_call
6577 || gimple_test_f == is_gimple_reg_rhs
6578 || gimple_test_f == is_gimple_reg_rhs_or_call
6579 || gimple_test_f == is_gimple_asm_val
6580 || gimple_test_f == is_gimple_mem_ref_addr)
6581 gcc_assert (fallback & fb_rvalue);
6582 else if (gimple_test_f == is_gimple_min_lval
6583 || gimple_test_f == is_gimple_lvalue)
6584 gcc_assert (fallback & fb_lvalue);
6585 else if (gimple_test_f == is_gimple_addressable)
6586 gcc_assert (fallback & fb_either);
6587 else if (gimple_test_f == is_gimple_stmt)
6588 gcc_assert (fallback == fb_none);
6591 /* We should have recognized the GIMPLE_TEST_F predicate to
6592 know what kind of fallback to use in case a temporary is
6593 needed to hold the value or address of *EXPR_P. */
6597 /* We used to check the predicate here and return immediately if it
6598 succeeds. This is wrong; the design is for gimplification to be
6599 idempotent, and for the predicates to only test for valid forms, not
6600 whether they are fully simplified. */
6602 pre_p = &internal_pre;
6605 post_p = &internal_post;
6607 /* Remember the last statements added to PRE_P and POST_P. Every
6608 new statement added by the gimplification helpers needs to be
6609 annotated with location information. To centralize the
6610 responsibility, we remember the last statement that had been
6611 added to both queues before gimplifying *EXPR_P. If
6612 gimplification produces new statements in PRE_P and POST_P, those
6613 statements will be annotated with the same location information
6615 pre_last_gsi = gsi_last (*pre_p);
6616 post_last_gsi = gsi_last (*post_p);
6618 saved_location = input_location;
6619 if (save_expr != error_mark_node
6620 && EXPR_HAS_LOCATION (*expr_p))
6621 input_location = EXPR_LOCATION (*expr_p);
6623 /* Loop over the specific gimplifiers until the toplevel node
6624 remains the same. */
6627 /* Strip away as many useless type conversions as possible
6629 STRIP_USELESS_TYPE_CONVERSION (*expr_p);
6631 /* Remember the expr. */
6632 save_expr = *expr_p;
6634 /* Die, die, die, my darling. */
6635 if (save_expr == error_mark_node
6636 || (TREE_TYPE (save_expr)
6637 && TREE_TYPE (save_expr) == error_mark_node))
6643 /* Do any language-specific gimplification. */
6644 ret = ((enum gimplify_status)
6645 lang_hooks.gimplify_expr (expr_p, pre_p, post_p));
6648 if (*expr_p == NULL_TREE)
6650 if (*expr_p != save_expr)
6653 else if (ret != GS_UNHANDLED)
6656 /* Make sure that all the cases set 'ret' appropriately. */
6658 switch (TREE_CODE (*expr_p))
6660 /* First deal with the special cases. */
6662 case POSTINCREMENT_EXPR:
6663 case POSTDECREMENT_EXPR:
6664 case PREINCREMENT_EXPR:
6665 case PREDECREMENT_EXPR:
6666 ret = gimplify_self_mod_expr (expr_p, pre_p, post_p,
6667 fallback != fb_none);
6671 case ARRAY_RANGE_REF:
6675 case VIEW_CONVERT_EXPR:
6676 ret = gimplify_compound_lval (expr_p, pre_p, post_p,
6677 fallback ? fallback : fb_rvalue);
6681 ret = gimplify_cond_expr (expr_p, pre_p, fallback);
6683 /* C99 code may assign to an array in a structure value of a
6684 conditional expression, and this has undefined behavior
6685 only on execution, so create a temporary if an lvalue is
6687 if (fallback == fb_lvalue)
6689 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6690 mark_addressable (*expr_p);
6696 ret = gimplify_call_expr (expr_p, pre_p, fallback != fb_none);
6698 /* C99 code may assign to an array in a structure returned
6699 from a function, and this has undefined behavior only on
6700 execution, so create a temporary if an lvalue is
6702 if (fallback == fb_lvalue)
6704 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6705 mark_addressable (*expr_p);
6714 ret = gimplify_compound_expr (expr_p, pre_p, fallback != fb_none);
6717 case COMPOUND_LITERAL_EXPR:
6718 ret = gimplify_compound_literal_expr (expr_p, pre_p);
6723 ret = gimplify_modify_expr (expr_p, pre_p, post_p,
6724 fallback != fb_none);
6727 case TRUTH_ANDIF_EXPR:
6728 case TRUTH_ORIF_EXPR:
6729 /* Pass the source location of the outer expression. */
6730 ret = gimplify_boolean_expr (expr_p, saved_location);
6733 case TRUTH_NOT_EXPR:
6734 if (TREE_CODE (TREE_TYPE (*expr_p)) != BOOLEAN_TYPE)
6736 tree type = TREE_TYPE (*expr_p);
6737 *expr_p = fold_convert (type, gimple_boolify (*expr_p));
6742 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6743 is_gimple_val, fb_rvalue);
6744 recalculate_side_effects (*expr_p);
6748 ret = gimplify_addr_expr (expr_p, pre_p, post_p);
6752 ret = gimplify_va_arg_expr (expr_p, pre_p, post_p);
6756 if (IS_EMPTY_STMT (*expr_p))
6762 if (VOID_TYPE_P (TREE_TYPE (*expr_p))
6763 || fallback == fb_none)
6765 /* Just strip a conversion to void (or in void context) and
6767 *expr_p = TREE_OPERAND (*expr_p, 0);
6772 ret = gimplify_conversion (expr_p);
6773 if (ret == GS_ERROR)
6775 if (*expr_p != save_expr)
6779 case FIX_TRUNC_EXPR:
6780 /* unary_expr: ... | '(' cast ')' val | ... */
6781 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6782 is_gimple_val, fb_rvalue);
6783 recalculate_side_effects (*expr_p);
6786 case MISALIGNED_INDIRECT_REF:
6787 /* We can only reach this through re-gimplification from
6789 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6790 is_gimple_reg, fb_rvalue);
6791 recalculate_side_effects (*expr_p);
6796 bool volatilep = TREE_THIS_VOLATILE (*expr_p);
6797 tree saved_ptr_type = TREE_TYPE (TREE_OPERAND (*expr_p, 0));
6799 *expr_p = fold_indirect_ref_loc (input_location, *expr_p);
6800 if (*expr_p != save_expr)
6806 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6807 is_gimple_reg, fb_rvalue);
6808 recalculate_side_effects (*expr_p);
6810 *expr_p = fold_build2_loc (input_location, MEM_REF,
6811 TREE_TYPE (*expr_p),
6812 TREE_OPERAND (*expr_p, 0),
6813 build_int_cst (saved_ptr_type, 0));
6814 TREE_THIS_VOLATILE (*expr_p) = volatilep;
6819 /* We arrive here through the various re-gimplifcation paths. */
6821 /* First try re-folding the whole thing. */
6822 tmp = fold_binary (MEM_REF, TREE_TYPE (*expr_p),
6823 TREE_OPERAND (*expr_p, 0),
6824 TREE_OPERAND (*expr_p, 1));
6828 recalculate_side_effects (*expr_p);
6832 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6833 is_gimple_mem_ref_addr, fb_rvalue);
6834 recalculate_side_effects (*expr_p);
6838 /* Constants need not be gimplified. */
6849 /* If we require an lvalue, such as for ADDR_EXPR, retain the
6850 CONST_DECL node. Otherwise the decl is replaceable by its
6852 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
6853 if (fallback & fb_lvalue)
6857 *expr_p = DECL_INITIAL (*expr_p);
6863 ret = gimplify_decl_expr (expr_p, pre_p);
6867 ret = gimplify_bind_expr (expr_p, pre_p);
6871 ret = gimplify_loop_expr (expr_p, pre_p);
6875 ret = gimplify_switch_expr (expr_p, pre_p);
6879 ret = gimplify_exit_expr (expr_p);
6883 /* If the target is not LABEL, then it is a computed jump
6884 and the target needs to be gimplified. */
6885 if (TREE_CODE (GOTO_DESTINATION (*expr_p)) != LABEL_DECL)
6887 ret = gimplify_expr (&GOTO_DESTINATION (*expr_p), pre_p,
6888 NULL, is_gimple_val, fb_rvalue);
6889 if (ret == GS_ERROR)
6892 gimplify_seq_add_stmt (pre_p,
6893 gimple_build_goto (GOTO_DESTINATION (*expr_p)));
6898 gimplify_seq_add_stmt (pre_p,
6899 gimple_build_predict (PREDICT_EXPR_PREDICTOR (*expr_p),
6900 PREDICT_EXPR_OUTCOME (*expr_p)));
6906 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p))
6907 == current_function_decl);
6908 gimplify_seq_add_stmt (pre_p,
6909 gimple_build_label (LABEL_EXPR_LABEL (*expr_p)));
6912 case CASE_LABEL_EXPR:
6913 ret = gimplify_case_label_expr (expr_p, pre_p);
6917 ret = gimplify_return_expr (*expr_p, pre_p);
6921 /* Don't reduce this in place; let gimplify_init_constructor work its
6922 magic. Buf if we're just elaborating this for side effects, just
6923 gimplify any element that has side-effects. */
6924 if (fallback == fb_none)
6926 unsigned HOST_WIDE_INT ix;
6928 tree temp = NULL_TREE;
6929 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (*expr_p), ix, val)
6930 if (TREE_SIDE_EFFECTS (val))
6931 append_to_statement_list (val, &temp);
6934 ret = temp ? GS_OK : GS_ALL_DONE;
6936 /* C99 code may assign to an array in a constructed
6937 structure or union, and this has undefined behavior only
6938 on execution, so create a temporary if an lvalue is
6940 else if (fallback == fb_lvalue)
6942 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6943 mark_addressable (*expr_p);
6950 /* The following are special cases that are not handled by the
6951 original GIMPLE grammar. */
6953 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
6956 ret = gimplify_save_expr (expr_p, pre_p, post_p);
6961 enum gimplify_status r0, r1, r2;
6963 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6964 post_p, is_gimple_lvalue, fb_either);
6965 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
6966 post_p, is_gimple_val, fb_rvalue);
6967 r2 = gimplify_expr (&TREE_OPERAND (*expr_p, 2), pre_p,
6968 post_p, is_gimple_val, fb_rvalue);
6969 recalculate_side_effects (*expr_p);
6971 ret = MIN (r0, MIN (r1, r2));
6975 case TARGET_MEM_REF:
6977 enum gimplify_status r0 = GS_ALL_DONE, r1 = GS_ALL_DONE;
6979 if (TMR_SYMBOL (*expr_p))
6980 r0 = gimplify_expr (&TMR_SYMBOL (*expr_p), pre_p,
6981 post_p, is_gimple_lvalue, fb_either);
6982 else if (TMR_BASE (*expr_p))
6983 r0 = gimplify_expr (&TMR_BASE (*expr_p), pre_p,
6984 post_p, is_gimple_val, fb_either);
6985 if (TMR_INDEX (*expr_p))
6986 r1 = gimplify_expr (&TMR_INDEX (*expr_p), pre_p,
6987 post_p, is_gimple_val, fb_rvalue);
6988 /* TMR_STEP and TMR_OFFSET are always integer constants. */
6993 case NON_LVALUE_EXPR:
6994 /* This should have been stripped above. */
6998 ret = gimplify_asm_expr (expr_p, pre_p, post_p);
7001 case TRY_FINALLY_EXPR:
7002 case TRY_CATCH_EXPR:
7004 gimple_seq eval, cleanup;
7007 eval = cleanup = NULL;
7008 gimplify_and_add (TREE_OPERAND (*expr_p, 0), &eval);
7009 gimplify_and_add (TREE_OPERAND (*expr_p, 1), &cleanup);
7010 /* Don't create bogus GIMPLE_TRY with empty cleanup. */
7011 if (gimple_seq_empty_p (cleanup))
7013 gimple_seq_add_seq (pre_p, eval);
7017 try_ = gimple_build_try (eval, cleanup,
7018 TREE_CODE (*expr_p) == TRY_FINALLY_EXPR
7019 ? GIMPLE_TRY_FINALLY
7020 : GIMPLE_TRY_CATCH);
7021 if (TREE_CODE (*expr_p) == TRY_CATCH_EXPR)
7022 gimple_try_set_catch_is_cleanup (try_,
7023 TRY_CATCH_IS_CLEANUP (*expr_p));
7024 gimplify_seq_add_stmt (pre_p, try_);
7029 case CLEANUP_POINT_EXPR:
7030 ret = gimplify_cleanup_point_expr (expr_p, pre_p);
7034 ret = gimplify_target_expr (expr_p, pre_p, post_p);
7040 gimple_seq handler = NULL;
7041 gimplify_and_add (CATCH_BODY (*expr_p), &handler);
7042 c = gimple_build_catch (CATCH_TYPES (*expr_p), handler);
7043 gimplify_seq_add_stmt (pre_p, c);
7048 case EH_FILTER_EXPR:
7051 gimple_seq failure = NULL;
7053 gimplify_and_add (EH_FILTER_FAILURE (*expr_p), &failure);
7054 ehf = gimple_build_eh_filter (EH_FILTER_TYPES (*expr_p), failure);
7055 gimple_set_no_warning (ehf, TREE_NO_WARNING (*expr_p));
7056 gimplify_seq_add_stmt (pre_p, ehf);
7063 enum gimplify_status r0, r1;
7064 r0 = gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p), pre_p,
7065 post_p, is_gimple_val, fb_rvalue);
7066 r1 = gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p), pre_p,
7067 post_p, is_gimple_val, fb_rvalue);
7068 TREE_SIDE_EFFECTS (*expr_p) = 0;
7074 /* We get here when taking the address of a label. We mark
7075 the label as "forced"; meaning it can never be removed and
7076 it is a potential target for any computed goto. */
7077 FORCED_LABEL (*expr_p) = 1;
7081 case STATEMENT_LIST:
7082 ret = gimplify_statement_list (expr_p, pre_p);
7085 case WITH_SIZE_EXPR:
7087 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7088 post_p == &internal_post ? NULL : post_p,
7089 gimple_test_f, fallback);
7090 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
7091 is_gimple_val, fb_rvalue);
7098 ret = gimplify_var_or_parm_decl (expr_p);
7102 /* When within an OpenMP context, notice uses of variables. */
7103 if (gimplify_omp_ctxp)
7104 omp_notice_variable (gimplify_omp_ctxp, *expr_p, true);
7109 /* Allow callbacks into the gimplifier during optimization. */
7114 gimplify_omp_parallel (expr_p, pre_p);
7119 gimplify_omp_task (expr_p, pre_p);
7124 ret = gimplify_omp_for (expr_p, pre_p);
7129 gimplify_omp_workshare (expr_p, pre_p);
7138 gimple_seq body = NULL;
7141 gimplify_and_add (OMP_BODY (*expr_p), &body);
7142 switch (TREE_CODE (*expr_p))
7145 g = gimple_build_omp_section (body);
7148 g = gimple_build_omp_master (body);
7151 g = gimple_build_omp_ordered (body);
7154 g = gimple_build_omp_critical (body,
7155 OMP_CRITICAL_NAME (*expr_p));
7160 gimplify_seq_add_stmt (pre_p, g);
7166 ret = gimplify_omp_atomic (expr_p, pre_p);
7169 case POINTER_PLUS_EXPR:
7170 /* Convert ((type *)A)+offset into &A->field_of_type_and_offset.
7171 The second is gimple immediate saving a need for extra statement.
7173 if (TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
7174 && (tmp = maybe_fold_offset_to_address
7175 (EXPR_LOCATION (*expr_p),
7176 TREE_OPERAND (*expr_p, 0), TREE_OPERAND (*expr_p, 1),
7177 TREE_TYPE (*expr_p))))
7183 /* Convert (void *)&a + 4 into (void *)&a[1]. */
7184 if (TREE_CODE (TREE_OPERAND (*expr_p, 0)) == NOP_EXPR
7185 && TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
7186 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p,
7188 && (tmp = maybe_fold_offset_to_address
7189 (EXPR_LOCATION (*expr_p),
7190 TREE_OPERAND (TREE_OPERAND (*expr_p, 0), 0),
7191 TREE_OPERAND (*expr_p, 1),
7192 TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p, 0),
7195 *expr_p = fold_convert (TREE_TYPE (*expr_p), tmp);
7202 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p)))
7204 case tcc_comparison:
7205 /* Handle comparison of objects of non scalar mode aggregates
7206 with a call to memcmp. It would be nice to only have to do
7207 this for variable-sized objects, but then we'd have to allow
7208 the same nest of reference nodes we allow for MODIFY_EXPR and
7211 Compare scalar mode aggregates as scalar mode values. Using
7212 memcmp for them would be very inefficient at best, and is
7213 plain wrong if bitfields are involved. */
7215 tree type = TREE_TYPE (TREE_OPERAND (*expr_p, 1));
7217 if (!AGGREGATE_TYPE_P (type))
7219 else if (TYPE_MODE (type) != BLKmode)
7220 ret = gimplify_scalar_mode_aggregate_compare (expr_p);
7222 ret = gimplify_variable_sized_compare (expr_p);
7227 /* If *EXPR_P does not need to be special-cased, handle it
7228 according to its class. */
7230 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7231 post_p, is_gimple_val, fb_rvalue);
7237 enum gimplify_status r0, r1;
7239 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7240 post_p, is_gimple_val, fb_rvalue);
7241 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
7242 post_p, is_gimple_val, fb_rvalue);
7248 case tcc_declaration:
7251 goto dont_recalculate;
7254 gcc_assert (TREE_CODE (*expr_p) == TRUTH_AND_EXPR
7255 || TREE_CODE (*expr_p) == TRUTH_OR_EXPR
7256 || TREE_CODE (*expr_p) == TRUTH_XOR_EXPR);
7260 recalculate_side_effects (*expr_p);
7266 gcc_assert (*expr_p || ret != GS_OK);
7268 while (ret == GS_OK);
7270 /* If we encountered an error_mark somewhere nested inside, either
7271 stub out the statement or propagate the error back out. */
7272 if (ret == GS_ERROR)
7279 /* This was only valid as a return value from the langhook, which
7280 we handled. Make sure it doesn't escape from any other context. */
7281 gcc_assert (ret != GS_UNHANDLED);
7283 if (fallback == fb_none && *expr_p && !is_gimple_stmt (*expr_p))
7285 /* We aren't looking for a value, and we don't have a valid
7286 statement. If it doesn't have side-effects, throw it away. */
7287 if (!TREE_SIDE_EFFECTS (*expr_p))
7289 else if (!TREE_THIS_VOLATILE (*expr_p))
7291 /* This is probably a _REF that contains something nested that
7292 has side effects. Recurse through the operands to find it. */
7293 enum tree_code code = TREE_CODE (*expr_p);
7300 case VIEW_CONVERT_EXPR:
7301 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
7302 gimple_test_f, fallback);
7306 case ARRAY_RANGE_REF:
7307 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
7308 gimple_test_f, fallback);
7309 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
7310 gimple_test_f, fallback);
7314 /* Anything else with side-effects must be converted to
7315 a valid statement before we get here. */
7321 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p))
7322 && TYPE_MODE (TREE_TYPE (*expr_p)) != BLKmode)
7324 /* Historically, the compiler has treated a bare reference
7325 to a non-BLKmode volatile lvalue as forcing a load. */
7326 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p));
7328 /* Normally, we do not want to create a temporary for a
7329 TREE_ADDRESSABLE type because such a type should not be
7330 copied by bitwise-assignment. However, we make an
7331 exception here, as all we are doing here is ensuring that
7332 we read the bytes that make up the type. We use
7333 create_tmp_var_raw because create_tmp_var will abort when
7334 given a TREE_ADDRESSABLE type. */
7335 tree tmp = create_tmp_var_raw (type, "vol");
7336 gimple_add_tmp_var (tmp);
7337 gimplify_assign (tmp, *expr_p, pre_p);
7341 /* We can't do anything useful with a volatile reference to
7342 an incomplete type, so just throw it away. Likewise for
7343 a BLKmode type, since any implicit inner load should
7344 already have been turned into an explicit one by the
7345 gimplification process. */
7349 /* If we are gimplifying at the statement level, we're done. Tack
7350 everything together and return. */
7351 if (fallback == fb_none || is_statement)
7353 /* Since *EXPR_P has been converted into a GIMPLE tuple, clear
7354 it out for GC to reclaim it. */
7355 *expr_p = NULL_TREE;
7357 if (!gimple_seq_empty_p (internal_pre)
7358 || !gimple_seq_empty_p (internal_post))
7360 gimplify_seq_add_seq (&internal_pre, internal_post);
7361 gimplify_seq_add_seq (pre_p, internal_pre);
7364 /* The result of gimplifying *EXPR_P is going to be the last few
7365 statements in *PRE_P and *POST_P. Add location information
7366 to all the statements that were added by the gimplification
7368 if (!gimple_seq_empty_p (*pre_p))
7369 annotate_all_with_location_after (*pre_p, pre_last_gsi, input_location);
7371 if (!gimple_seq_empty_p (*post_p))
7372 annotate_all_with_location_after (*post_p, post_last_gsi,
7378 #ifdef ENABLE_GIMPLE_CHECKING
7381 enum tree_code code = TREE_CODE (*expr_p);
7382 /* These expressions should already be in gimple IR form. */
7383 gcc_assert (code != MODIFY_EXPR
7385 && code != BIND_EXPR
7386 && code != CATCH_EXPR
7387 && (code != COND_EXPR || gimplify_ctxp->allow_rhs_cond_expr)
7388 && code != EH_FILTER_EXPR
7389 && code != GOTO_EXPR
7390 && code != LABEL_EXPR
7391 && code != LOOP_EXPR
7392 && code != SWITCH_EXPR
7393 && code != TRY_FINALLY_EXPR
7394 && code != OMP_CRITICAL
7396 && code != OMP_MASTER
7397 && code != OMP_ORDERED
7398 && code != OMP_PARALLEL
7399 && code != OMP_SECTIONS
7400 && code != OMP_SECTION
7401 && code != OMP_SINGLE);
7405 /* Otherwise we're gimplifying a subexpression, so the resulting
7406 value is interesting. If it's a valid operand that matches
7407 GIMPLE_TEST_F, we're done. Unless we are handling some
7408 post-effects internally; if that's the case, we need to copy into
7409 a temporary before adding the post-effects to POST_P. */
7410 if (gimple_seq_empty_p (internal_post) && (*gimple_test_f) (*expr_p))
7413 /* Otherwise, we need to create a new temporary for the gimplified
7416 /* We can't return an lvalue if we have an internal postqueue. The
7417 object the lvalue refers to would (probably) be modified by the
7418 postqueue; we need to copy the value out first, which means an
7420 if ((fallback & fb_lvalue)
7421 && gimple_seq_empty_p (internal_post)
7422 && is_gimple_addressable (*expr_p))
7424 /* An lvalue will do. Take the address of the expression, store it
7425 in a temporary, and replace the expression with an INDIRECT_REF of
7427 tmp = build_fold_addr_expr_loc (input_location, *expr_p);
7428 gimplify_expr (&tmp, pre_p, post_p, is_gimple_reg, fb_rvalue);
7429 *expr_p = build_simple_mem_ref (tmp);
7431 else if ((fallback & fb_rvalue) && is_gimple_reg_rhs_or_call (*expr_p))
7433 /* An rvalue will do. Assign the gimplified expression into a
7434 new temporary TMP and replace the original expression with
7435 TMP. First, make sure that the expression has a type so that
7436 it can be assigned into a temporary. */
7437 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p)));
7439 if (!gimple_seq_empty_p (internal_post) || (fallback & fb_lvalue))
7440 /* The postqueue might change the value of the expression between
7441 the initialization and use of the temporary, so we can't use a
7442 formal temp. FIXME do we care? */
7444 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
7445 if (TREE_CODE (TREE_TYPE (*expr_p)) == COMPLEX_TYPE
7446 || TREE_CODE (TREE_TYPE (*expr_p)) == VECTOR_TYPE)
7447 DECL_GIMPLE_REG_P (*expr_p) = 1;
7450 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
7454 #ifdef ENABLE_GIMPLE_CHECKING
7455 if (!(fallback & fb_mayfail))
7457 fprintf (stderr, "gimplification failed:\n");
7458 print_generic_expr (stderr, *expr_p, 0);
7459 debug_tree (*expr_p);
7460 internal_error ("gimplification failed");
7463 gcc_assert (fallback & fb_mayfail);
7465 /* If this is an asm statement, and the user asked for the
7466 impossible, don't die. Fail and let gimplify_asm_expr
7472 /* Make sure the temporary matches our predicate. */
7473 gcc_assert ((*gimple_test_f) (*expr_p));
7475 if (!gimple_seq_empty_p (internal_post))
7477 annotate_all_with_location (internal_post, input_location);
7478 gimplify_seq_add_seq (pre_p, internal_post);
7482 input_location = saved_location;
7486 /* Look through TYPE for variable-sized objects and gimplify each such
7487 size that we find. Add to LIST_P any statements generated. */
7490 gimplify_type_sizes (tree type, gimple_seq *list_p)
7494 if (type == NULL || type == error_mark_node)
7497 /* We first do the main variant, then copy into any other variants. */
7498 type = TYPE_MAIN_VARIANT (type);
7500 /* Avoid infinite recursion. */
7501 if (TYPE_SIZES_GIMPLIFIED (type))
7504 TYPE_SIZES_GIMPLIFIED (type) = 1;
7506 switch (TREE_CODE (type))
7512 case FIXED_POINT_TYPE:
7513 gimplify_one_sizepos (&TYPE_MIN_VALUE (type), list_p);
7514 gimplify_one_sizepos (&TYPE_MAX_VALUE (type), list_p);
7516 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
7518 TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (type);
7519 TYPE_MAX_VALUE (t) = TYPE_MAX_VALUE (type);
7524 /* These types may not have declarations, so handle them here. */
7525 gimplify_type_sizes (TREE_TYPE (type), list_p);
7526 gimplify_type_sizes (TYPE_DOMAIN (type), list_p);
7527 /* Ensure VLA bounds aren't removed, for -O0 they should be variables
7528 with assigned stack slots, for -O1+ -g they should be tracked
7530 if (TYPE_DOMAIN (type)
7531 && INTEGRAL_TYPE_P (TYPE_DOMAIN (type)))
7533 t = TYPE_MIN_VALUE (TYPE_DOMAIN (type));
7534 if (t && TREE_CODE (t) == VAR_DECL && DECL_ARTIFICIAL (t))
7535 DECL_IGNORED_P (t) = 0;
7536 t = TYPE_MAX_VALUE (TYPE_DOMAIN (type));
7537 if (t && TREE_CODE (t) == VAR_DECL && DECL_ARTIFICIAL (t))
7538 DECL_IGNORED_P (t) = 0;
7544 case QUAL_UNION_TYPE:
7545 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
7546 if (TREE_CODE (field) == FIELD_DECL)
7548 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field), list_p);
7549 gimplify_one_sizepos (&DECL_SIZE (field), list_p);
7550 gimplify_one_sizepos (&DECL_SIZE_UNIT (field), list_p);
7551 gimplify_type_sizes (TREE_TYPE (field), list_p);
7556 case REFERENCE_TYPE:
7557 /* We used to recurse on the pointed-to type here, which turned out to
7558 be incorrect because its definition might refer to variables not
7559 yet initialized at this point if a forward declaration is involved.
7561 It was actually useful for anonymous pointed-to types to ensure
7562 that the sizes evaluation dominates every possible later use of the
7563 values. Restricting to such types here would be safe since there
7564 is no possible forward declaration around, but would introduce an
7565 undesirable middle-end semantic to anonymity. We then defer to
7566 front-ends the responsibility of ensuring that the sizes are
7567 evaluated both early and late enough, e.g. by attaching artificial
7568 type declarations to the tree. */
7575 gimplify_one_sizepos (&TYPE_SIZE (type), list_p);
7576 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type), list_p);
7578 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
7580 TYPE_SIZE (t) = TYPE_SIZE (type);
7581 TYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (type);
7582 TYPE_SIZES_GIMPLIFIED (t) = 1;
7586 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
7587 a size or position, has had all of its SAVE_EXPRs evaluated.
7588 We add any required statements to *STMT_P. */
7591 gimplify_one_sizepos (tree *expr_p, gimple_seq *stmt_p)
7593 tree type, expr = *expr_p;
7595 /* We don't do anything if the value isn't there, is constant, or contains
7596 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
7597 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
7598 will want to replace it with a new variable, but that will cause problems
7599 if this type is from outside the function. It's OK to have that here. */
7600 if (expr == NULL_TREE || TREE_CONSTANT (expr)
7601 || TREE_CODE (expr) == VAR_DECL
7602 || CONTAINS_PLACEHOLDER_P (expr))
7605 type = TREE_TYPE (expr);
7606 *expr_p = unshare_expr (expr);
7608 gimplify_expr (expr_p, stmt_p, NULL, is_gimple_val, fb_rvalue);
7611 /* Verify that we've an exact type match with the original expression.
7612 In particular, we do not wish to drop a "sizetype" in favour of a
7613 type of similar dimensions. We don't want to pollute the generic
7614 type-stripping code with this knowledge because it doesn't matter
7615 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
7616 and friends retain their "sizetype-ness". */
7617 if (TREE_TYPE (expr) != type
7618 && TREE_CODE (type) == INTEGER_TYPE
7619 && TYPE_IS_SIZETYPE (type))
7624 *expr_p = create_tmp_var (type, NULL);
7625 tmp = build1 (NOP_EXPR, type, expr);
7626 stmt = gimplify_assign (*expr_p, tmp, stmt_p);
7627 if (EXPR_HAS_LOCATION (expr))
7628 gimple_set_location (stmt, EXPR_LOCATION (expr));
7630 gimple_set_location (stmt, input_location);
7635 /* Gimplify the body of statements pointed to by BODY_P and return a
7636 GIMPLE_BIND containing the sequence of GIMPLE statements
7637 corresponding to BODY_P. FNDECL is the function decl containing
7641 gimplify_body (tree *body_p, tree fndecl, bool do_parms)
7643 location_t saved_location = input_location;
7644 gimple_seq parm_stmts, seq;
7646 struct gimplify_ctx gctx;
7648 timevar_push (TV_TREE_GIMPLIFY);
7650 /* Initialize for optimize_insn_for_s{ize,peed}_p possibly called during
7652 default_rtl_profile ();
7654 gcc_assert (gimplify_ctxp == NULL);
7655 push_gimplify_context (&gctx);
7657 /* Unshare most shared trees in the body and in that of any nested functions.
7658 It would seem we don't have to do this for nested functions because
7659 they are supposed to be output and then the outer function gimplified
7660 first, but the g++ front end doesn't always do it that way. */
7661 unshare_body (body_p, fndecl);
7662 unvisit_body (body_p, fndecl);
7664 if (cgraph_node (fndecl)->origin)
7665 nonlocal_vlas = pointer_set_create ();
7667 /* Make sure input_location isn't set to something weird. */
7668 input_location = DECL_SOURCE_LOCATION (fndecl);
7670 /* Resolve callee-copies. This has to be done before processing
7671 the body so that DECL_VALUE_EXPR gets processed correctly. */
7672 parm_stmts = (do_parms) ? gimplify_parameters () : NULL;
7674 /* Gimplify the function's body. */
7676 gimplify_stmt (body_p, &seq);
7677 outer_bind = gimple_seq_first_stmt (seq);
7680 outer_bind = gimple_build_nop ();
7681 gimplify_seq_add_stmt (&seq, outer_bind);
7684 /* The body must contain exactly one statement, a GIMPLE_BIND. If this is
7685 not the case, wrap everything in a GIMPLE_BIND to make it so. */
7686 if (gimple_code (outer_bind) == GIMPLE_BIND
7687 && gimple_seq_first (seq) == gimple_seq_last (seq))
7690 outer_bind = gimple_build_bind (NULL_TREE, seq, NULL);
7692 *body_p = NULL_TREE;
7694 /* If we had callee-copies statements, insert them at the beginning
7695 of the function and clear DECL_VALUE_EXPR_P on the parameters. */
7696 if (!gimple_seq_empty_p (parm_stmts))
7700 gimplify_seq_add_seq (&parm_stmts, gimple_bind_body (outer_bind));
7701 gimple_bind_set_body (outer_bind, parm_stmts);
7703 for (parm = DECL_ARGUMENTS (current_function_decl);
7704 parm; parm = DECL_CHAIN (parm))
7705 if (DECL_HAS_VALUE_EXPR_P (parm))
7707 DECL_HAS_VALUE_EXPR_P (parm) = 0;
7708 DECL_IGNORED_P (parm) = 0;
7714 pointer_set_destroy (nonlocal_vlas);
7715 nonlocal_vlas = NULL;
7718 pop_gimplify_context (outer_bind);
7719 gcc_assert (gimplify_ctxp == NULL);
7721 #ifdef ENABLE_TYPES_CHECKING
7723 verify_types_in_gimple_seq (gimple_bind_body (outer_bind));
7726 timevar_pop (TV_TREE_GIMPLIFY);
7727 input_location = saved_location;
7732 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
7733 node for the function we want to gimplify.
7735 Returns the sequence of GIMPLE statements corresponding to the body
7739 gimplify_function_tree (tree fndecl)
7741 tree oldfn, parm, ret;
7745 gcc_assert (!gimple_body (fndecl));
7747 oldfn = current_function_decl;
7748 current_function_decl = fndecl;
7749 if (DECL_STRUCT_FUNCTION (fndecl))
7750 push_cfun (DECL_STRUCT_FUNCTION (fndecl));
7752 push_struct_function (fndecl);
7754 for (parm = DECL_ARGUMENTS (fndecl); parm ; parm = DECL_CHAIN (parm))
7756 /* Preliminarily mark non-addressed complex variables as eligible
7757 for promotion to gimple registers. We'll transform their uses
7759 if ((TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
7760 || TREE_CODE (TREE_TYPE (parm)) == VECTOR_TYPE)
7761 && !TREE_THIS_VOLATILE (parm)
7762 && !needs_to_live_in_memory (parm))
7763 DECL_GIMPLE_REG_P (parm) = 1;
7766 ret = DECL_RESULT (fndecl);
7767 if ((TREE_CODE (TREE_TYPE (ret)) == COMPLEX_TYPE
7768 || TREE_CODE (TREE_TYPE (ret)) == VECTOR_TYPE)
7769 && !needs_to_live_in_memory (ret))
7770 DECL_GIMPLE_REG_P (ret) = 1;
7772 bind = gimplify_body (&DECL_SAVED_TREE (fndecl), fndecl, true);
7774 /* The tree body of the function is no longer needed, replace it
7775 with the new GIMPLE body. */
7776 seq = gimple_seq_alloc ();
7777 gimple_seq_add_stmt (&seq, bind);
7778 gimple_set_body (fndecl, seq);
7780 /* If we're instrumenting function entry/exit, then prepend the call to
7781 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
7782 catch the exit hook. */
7783 /* ??? Add some way to ignore exceptions for this TFE. */
7784 if (flag_instrument_function_entry_exit
7785 && !DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl)
7786 && !flag_instrument_functions_exclude_p (fndecl))
7791 gimple_seq cleanup = NULL, body = NULL;
7793 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_EXIT];
7794 gimplify_seq_add_stmt (&cleanup, gimple_build_call (x, 0));
7795 tf = gimple_build_try (seq, cleanup, GIMPLE_TRY_FINALLY);
7797 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_ENTER];
7798 gimplify_seq_add_stmt (&body, gimple_build_call (x, 0));
7799 gimplify_seq_add_stmt (&body, tf);
7800 new_bind = gimple_build_bind (NULL, body, gimple_bind_block (bind));
7801 /* Clear the block for BIND, since it is no longer directly inside
7802 the function, but within a try block. */
7803 gimple_bind_set_block (bind, NULL);
7805 /* Replace the current function body with the body
7806 wrapped in the try/finally TF. */
7807 seq = gimple_seq_alloc ();
7808 gimple_seq_add_stmt (&seq, new_bind);
7809 gimple_set_body (fndecl, seq);
7812 DECL_SAVED_TREE (fndecl) = NULL_TREE;
7813 cfun->curr_properties = PROP_gimple_any;
7815 current_function_decl = oldfn;
7820 /* Some transformations like inlining may invalidate the GIMPLE form
7821 for operands. This function traverses all the operands in STMT and
7822 gimplifies anything that is not a valid gimple operand. Any new
7823 GIMPLE statements are inserted before *GSI_P. */
7826 gimple_regimplify_operands (gimple stmt, gimple_stmt_iterator *gsi_p)
7829 tree orig_lhs = NULL_TREE, lhs, t;
7830 gimple_seq pre = NULL;
7831 gimple post_stmt = NULL;
7832 struct gimplify_ctx gctx;
7834 push_gimplify_context (&gctx);
7835 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
7837 switch (gimple_code (stmt))
7840 gimplify_expr (gimple_cond_lhs_ptr (stmt), &pre, NULL,
7841 is_gimple_val, fb_rvalue);
7842 gimplify_expr (gimple_cond_rhs_ptr (stmt), &pre, NULL,
7843 is_gimple_val, fb_rvalue);
7846 gimplify_expr (gimple_switch_index_ptr (stmt), &pre, NULL,
7847 is_gimple_val, fb_rvalue);
7849 case GIMPLE_OMP_ATOMIC_LOAD:
7850 gimplify_expr (gimple_omp_atomic_load_rhs_ptr (stmt), &pre, NULL,
7851 is_gimple_val, fb_rvalue);
7855 size_t i, noutputs = gimple_asm_noutputs (stmt);
7856 const char *constraint, **oconstraints;
7857 bool allows_mem, allows_reg, is_inout;
7860 = (const char **) alloca ((noutputs) * sizeof (const char *));
7861 for (i = 0; i < noutputs; i++)
7863 tree op = gimple_asm_output_op (stmt, i);
7864 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
7865 oconstraints[i] = constraint;
7866 parse_output_constraint (&constraint, i, 0, 0, &allows_mem,
7867 &allows_reg, &is_inout);
7868 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
7869 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
7870 fb_lvalue | fb_mayfail);
7872 for (i = 0; i < gimple_asm_ninputs (stmt); i++)
7874 tree op = gimple_asm_input_op (stmt, i);
7875 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
7876 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
7877 oconstraints, &allows_mem, &allows_reg);
7878 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (op))) && allows_mem)
7880 if (!allows_reg && allows_mem)
7881 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
7882 is_gimple_lvalue, fb_lvalue | fb_mayfail);
7884 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
7885 is_gimple_asm_val, fb_rvalue);
7890 /* NOTE: We start gimplifying operands from last to first to
7891 make sure that side-effects on the RHS of calls, assignments
7892 and ASMs are executed before the LHS. The ordering is not
7893 important for other statements. */
7894 num_ops = gimple_num_ops (stmt);
7895 orig_lhs = gimple_get_lhs (stmt);
7896 for (i = num_ops; i > 0; i--)
7898 tree op = gimple_op (stmt, i - 1);
7899 if (op == NULL_TREE)
7901 if (i == 1 && (is_gimple_call (stmt) || is_gimple_assign (stmt)))
7902 gimplify_expr (&op, &pre, NULL, is_gimple_lvalue, fb_lvalue);
7904 && is_gimple_assign (stmt)
7906 && get_gimple_rhs_class (gimple_expr_code (stmt))
7907 == GIMPLE_SINGLE_RHS)
7908 gimplify_expr (&op, &pre, NULL,
7909 rhs_predicate_for (gimple_assign_lhs (stmt)),
7911 else if (i == 2 && is_gimple_call (stmt))
7913 if (TREE_CODE (op) == FUNCTION_DECL)
7915 gimplify_expr (&op, &pre, NULL, is_gimple_call_addr, fb_rvalue);
7918 gimplify_expr (&op, &pre, NULL, is_gimple_val, fb_rvalue);
7919 gimple_set_op (stmt, i - 1, op);
7922 lhs = gimple_get_lhs (stmt);
7923 /* If the LHS changed it in a way that requires a simple RHS,
7924 create temporary. */
7925 if (lhs && !is_gimple_reg (lhs))
7927 bool need_temp = false;
7929 if (is_gimple_assign (stmt)
7931 && get_gimple_rhs_class (gimple_expr_code (stmt))
7932 == GIMPLE_SINGLE_RHS)
7933 gimplify_expr (gimple_assign_rhs1_ptr (stmt), &pre, NULL,
7934 rhs_predicate_for (gimple_assign_lhs (stmt)),
7936 else if (is_gimple_reg (lhs))
7938 if (is_gimple_reg_type (TREE_TYPE (lhs)))
7940 if (is_gimple_call (stmt))
7942 i = gimple_call_flags (stmt);
7943 if ((i & ECF_LOOPING_CONST_OR_PURE)
7944 || !(i & (ECF_CONST | ECF_PURE)))
7947 if (stmt_can_throw_internal (stmt))
7953 if (is_gimple_reg_type (TREE_TYPE (lhs)))
7955 else if (TYPE_MODE (TREE_TYPE (lhs)) != BLKmode)
7957 if (is_gimple_call (stmt))
7959 tree fndecl = gimple_call_fndecl (stmt);
7961 if (!aggregate_value_p (TREE_TYPE (lhs), fndecl)
7962 && !(fndecl && DECL_RESULT (fndecl)
7963 && DECL_BY_REFERENCE (DECL_RESULT (fndecl))))
7972 tree temp = create_tmp_reg (TREE_TYPE (lhs), NULL);
7974 if (TREE_CODE (orig_lhs) == SSA_NAME)
7975 orig_lhs = SSA_NAME_VAR (orig_lhs);
7977 if (gimple_in_ssa_p (cfun))
7978 temp = make_ssa_name (temp, NULL);
7979 gimple_set_lhs (stmt, temp);
7980 post_stmt = gimple_build_assign (lhs, temp);
7981 if (TREE_CODE (lhs) == SSA_NAME)
7982 SSA_NAME_DEF_STMT (lhs) = post_stmt;
7988 if (gimple_referenced_vars (cfun))
7989 for (t = gimplify_ctxp->temps; t ; t = TREE_CHAIN (t))
7990 add_referenced_var (t);
7992 if (!gimple_seq_empty_p (pre))
7994 if (gimple_in_ssa_p (cfun))
7996 gimple_stmt_iterator i;
7998 for (i = gsi_start (pre); !gsi_end_p (i); gsi_next (&i))
7999 mark_symbols_for_renaming (gsi_stmt (i));
8001 gsi_insert_seq_before (gsi_p, pre, GSI_SAME_STMT);
8004 gsi_insert_after (gsi_p, post_stmt, GSI_NEW_STMT);
8006 pop_gimplify_context (NULL);
8010 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
8011 force the result to be either ssa_name or an invariant, otherwise
8012 just force it to be a rhs expression. If VAR is not NULL, make the
8013 base variable of the final destination be VAR if suitable. */
8016 force_gimple_operand (tree expr, gimple_seq *stmts, bool simple, tree var)
8019 enum gimplify_status ret;
8020 gimple_predicate gimple_test_f;
8021 struct gimplify_ctx gctx;
8025 if (is_gimple_val (expr))
8028 gimple_test_f = simple ? is_gimple_val : is_gimple_reg_rhs;
8030 push_gimplify_context (&gctx);
8031 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
8032 gimplify_ctxp->allow_rhs_cond_expr = true;
8035 expr = build2 (MODIFY_EXPR, TREE_TYPE (var), var, expr);
8037 if (TREE_CODE (expr) != MODIFY_EXPR
8038 && TREE_TYPE (expr) == void_type_node)
8040 gimplify_and_add (expr, stmts);
8045 ret = gimplify_expr (&expr, stmts, NULL, gimple_test_f, fb_rvalue);
8046 gcc_assert (ret != GS_ERROR);
8049 if (gimple_referenced_vars (cfun))
8050 for (t = gimplify_ctxp->temps; t ; t = DECL_CHAIN (t))
8051 add_referenced_var (t);
8053 pop_gimplify_context (NULL);
8058 /* Invokes force_gimple_operand for EXPR with parameters SIMPLE_P and VAR. If
8059 some statements are produced, emits them at GSI. If BEFORE is true.
8060 the statements are appended before GSI, otherwise they are appended after
8061 it. M specifies the way GSI moves after insertion (GSI_SAME_STMT or
8062 GSI_CONTINUE_LINKING are the usual values). */
8065 force_gimple_operand_gsi (gimple_stmt_iterator *gsi, tree expr,
8066 bool simple_p, tree var, bool before,
8067 enum gsi_iterator_update m)
8071 expr = force_gimple_operand (expr, &stmts, simple_p, var);
8073 if (!gimple_seq_empty_p (stmts))
8075 if (gimple_in_ssa_p (cfun))
8077 gimple_stmt_iterator i;
8079 for (i = gsi_start (stmts); !gsi_end_p (i); gsi_next (&i))
8080 mark_symbols_for_renaming (gsi_stmt (i));
8084 gsi_insert_seq_before (gsi, stmts, m);
8086 gsi_insert_seq_after (gsi, stmts, m);
8092 #include "gt-gimplify.h"