1 /* Tree lowering pass. This pass converts the GENERIC functions-as-trees
2 tree representation into the GIMPLE form.
3 Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011
4 Free Software Foundation, Inc.
5 Major work done by Sebastian Pop <s.pop@laposte.net>,
6 Diego Novillo <dnovillo@redhat.com> and Jason Merrill <jason@redhat.com>.
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify it under
11 the terms of the GNU General Public License as published by the Free
12 Software Foundation; either version 3, or (at your option) any later
15 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
16 WARRANTY; without even the implied warranty of MERCHANTABILITY or
17 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
26 #include "coretypes.h"
30 #include "tree-iterator.h"
31 #include "tree-inline.h"
32 #include "tree-pretty-print.h"
33 #include "langhooks.h"
34 #include "tree-flow.h"
42 #include "diagnostic-core.h"
44 #include "pointer-set.h"
45 #include "splay-tree.h"
48 #include "tree-pass.h"
50 #include "langhooks-def.h" /* FIXME: for lhd_set_decl_assembler_name. */
51 #include "expr.h" /* FIXME: for can_move_by_pieces
52 and STACK_CHECK_MAX_VAR_SIZE. */
54 enum gimplify_omp_var_data
60 GOVD_FIRSTPRIVATE = 16,
61 GOVD_LASTPRIVATE = 32,
64 GOVD_DEBUG_PRIVATE = 256,
65 GOVD_PRIVATE_OUTER_REF = 512,
66 GOVD_DATA_SHARE_CLASS = (GOVD_SHARED | GOVD_PRIVATE | GOVD_FIRSTPRIVATE
67 | GOVD_LASTPRIVATE | GOVD_REDUCTION | GOVD_LOCAL)
75 ORT_COMBINED_PARALLEL = 3,
80 struct gimplify_omp_ctx
82 struct gimplify_omp_ctx *outer_context;
84 struct pointer_set_t *privatized_types;
86 enum omp_clause_default_kind default_kind;
87 enum omp_region_type region_type;
90 static struct gimplify_ctx *gimplify_ctxp;
91 static struct gimplify_omp_ctx *gimplify_omp_ctxp;
94 /* Formal (expression) temporary table handling: multiple occurrences of
95 the same scalar expression are evaluated into the same temporary. */
97 typedef struct gimple_temp_hash_elt
100 tree temp; /* Value */
103 /* Forward declaration. */
104 static enum gimplify_status gimplify_compound_expr (tree *, gimple_seq *, bool);
106 /* Mark X addressable. Unlike the langhook we expect X to be in gimple
107 form and we don't do any syntax checking. */
110 mark_addressable (tree x)
112 while (handled_component_p (x))
113 x = TREE_OPERAND (x, 0);
114 if (TREE_CODE (x) == MEM_REF
115 && TREE_CODE (TREE_OPERAND (x, 0)) == ADDR_EXPR)
116 x = TREE_OPERAND (TREE_OPERAND (x, 0), 0);
117 if (TREE_CODE (x) != VAR_DECL
118 && TREE_CODE (x) != PARM_DECL
119 && TREE_CODE (x) != RESULT_DECL)
121 TREE_ADDRESSABLE (x) = 1;
124 /* Return a hash value for a formal temporary table entry. */
127 gimple_tree_hash (const void *p)
129 tree t = ((const elt_t *) p)->val;
130 return iterative_hash_expr (t, 0);
133 /* Compare two formal temporary table entries. */
136 gimple_tree_eq (const void *p1, const void *p2)
138 tree t1 = ((const elt_t *) p1)->val;
139 tree t2 = ((const elt_t *) p2)->val;
140 enum tree_code code = TREE_CODE (t1);
142 if (TREE_CODE (t2) != code
143 || TREE_TYPE (t1) != TREE_TYPE (t2))
146 if (!operand_equal_p (t1, t2, 0))
149 #ifdef ENABLE_CHECKING
150 /* Only allow them to compare equal if they also hash equal; otherwise
151 results are nondeterminate, and we fail bootstrap comparison. */
152 gcc_assert (gimple_tree_hash (p1) == gimple_tree_hash (p2));
158 /* Link gimple statement GS to the end of the sequence *SEQ_P. If
159 *SEQ_P is NULL, a new sequence is allocated. This function is
160 similar to gimple_seq_add_stmt, but does not scan the operands.
161 During gimplification, we need to manipulate statement sequences
162 before the def/use vectors have been constructed. */
165 gimplify_seq_add_stmt (gimple_seq *seq_p, gimple gs)
167 gimple_stmt_iterator si;
173 *seq_p = gimple_seq_alloc ();
175 si = gsi_last (*seq_p);
177 gsi_insert_after_without_update (&si, gs, GSI_NEW_STMT);
180 /* Append sequence SRC to the end of sequence *DST_P. If *DST_P is
181 NULL, a new sequence is allocated. This function is
182 similar to gimple_seq_add_seq, but does not scan the operands.
183 During gimplification, we need to manipulate statement sequences
184 before the def/use vectors have been constructed. */
187 gimplify_seq_add_seq (gimple_seq *dst_p, gimple_seq src)
189 gimple_stmt_iterator si;
195 *dst_p = gimple_seq_alloc ();
197 si = gsi_last (*dst_p);
198 gsi_insert_seq_after_without_update (&si, src, GSI_NEW_STMT);
201 /* Set up a context for the gimplifier. */
204 push_gimplify_context (struct gimplify_ctx *c)
206 memset (c, '\0', sizeof (*c));
207 c->prev_context = gimplify_ctxp;
211 /* Tear down a context for the gimplifier. If BODY is non-null, then
212 put the temporaries into the outer BIND_EXPR. Otherwise, put them
215 BODY is not a sequence, but the first tuple in a sequence. */
218 pop_gimplify_context (gimple body)
220 struct gimplify_ctx *c = gimplify_ctxp;
222 gcc_assert (c && (c->bind_expr_stack == NULL
223 || VEC_empty (gimple, c->bind_expr_stack)));
224 VEC_free (gimple, heap, c->bind_expr_stack);
225 gimplify_ctxp = c->prev_context;
228 declare_vars (c->temps, body, false);
230 record_vars (c->temps);
233 htab_delete (c->temp_htab);
236 /* Push a GIMPLE_BIND tuple onto the stack of bindings. */
239 gimple_push_bind_expr (gimple gimple_bind)
241 if (gimplify_ctxp->bind_expr_stack == NULL)
242 gimplify_ctxp->bind_expr_stack = VEC_alloc (gimple, heap, 8);
243 VEC_safe_push (gimple, heap, gimplify_ctxp->bind_expr_stack, gimple_bind);
246 /* Pop the first element off the stack of bindings. */
249 gimple_pop_bind_expr (void)
251 VEC_pop (gimple, gimplify_ctxp->bind_expr_stack);
254 /* Return the first element of the stack of bindings. */
257 gimple_current_bind_expr (void)
259 return VEC_last (gimple, gimplify_ctxp->bind_expr_stack);
262 /* Return the stack of bindings created during gimplification. */
265 gimple_bind_expr_stack (void)
267 return gimplify_ctxp->bind_expr_stack;
270 /* Return true iff there is a COND_EXPR between us and the innermost
271 CLEANUP_POINT_EXPR. This info is used by gimple_push_cleanup. */
274 gimple_conditional_context (void)
276 return gimplify_ctxp->conditions > 0;
279 /* Note that we've entered a COND_EXPR. */
282 gimple_push_condition (void)
284 #ifdef ENABLE_GIMPLE_CHECKING
285 if (gimplify_ctxp->conditions == 0)
286 gcc_assert (gimple_seq_empty_p (gimplify_ctxp->conditional_cleanups));
288 ++(gimplify_ctxp->conditions);
291 /* Note that we've left a COND_EXPR. If we're back at unconditional scope
292 now, add any conditional cleanups we've seen to the prequeue. */
295 gimple_pop_condition (gimple_seq *pre_p)
297 int conds = --(gimplify_ctxp->conditions);
299 gcc_assert (conds >= 0);
302 gimplify_seq_add_seq (pre_p, gimplify_ctxp->conditional_cleanups);
303 gimplify_ctxp->conditional_cleanups = NULL;
307 /* A stable comparison routine for use with splay trees and DECLs. */
310 splay_tree_compare_decl_uid (splay_tree_key xa, splay_tree_key xb)
315 return DECL_UID (a) - DECL_UID (b);
318 /* Create a new omp construct that deals with variable remapping. */
320 static struct gimplify_omp_ctx *
321 new_omp_context (enum omp_region_type region_type)
323 struct gimplify_omp_ctx *c;
325 c = XCNEW (struct gimplify_omp_ctx);
326 c->outer_context = gimplify_omp_ctxp;
327 c->variables = splay_tree_new (splay_tree_compare_decl_uid, 0, 0);
328 c->privatized_types = pointer_set_create ();
329 c->location = input_location;
330 c->region_type = region_type;
331 if ((region_type & ORT_TASK) == 0)
332 c->default_kind = OMP_CLAUSE_DEFAULT_SHARED;
334 c->default_kind = OMP_CLAUSE_DEFAULT_UNSPECIFIED;
339 /* Destroy an omp construct that deals with variable remapping. */
342 delete_omp_context (struct gimplify_omp_ctx *c)
344 splay_tree_delete (c->variables);
345 pointer_set_destroy (c->privatized_types);
349 static void omp_add_variable (struct gimplify_omp_ctx *, tree, unsigned int);
350 static bool omp_notice_variable (struct gimplify_omp_ctx *, tree, bool);
352 /* Both gimplify the statement T and append it to *SEQ_P. This function
353 behaves exactly as gimplify_stmt, but you don't have to pass T as a
357 gimplify_and_add (tree t, gimple_seq *seq_p)
359 gimplify_stmt (&t, seq_p);
362 /* Gimplify statement T into sequence *SEQ_P, and return the first
363 tuple in the sequence of generated tuples for this statement.
364 Return NULL if gimplifying T produced no tuples. */
367 gimplify_and_return_first (tree t, gimple_seq *seq_p)
369 gimple_stmt_iterator last = gsi_last (*seq_p);
371 gimplify_and_add (t, seq_p);
373 if (!gsi_end_p (last))
376 return gsi_stmt (last);
379 return gimple_seq_first_stmt (*seq_p);
382 /* Strip off a legitimate source ending from the input string NAME of
383 length LEN. Rather than having to know the names used by all of
384 our front ends, we strip off an ending of a period followed by
385 up to five characters. (Java uses ".class".) */
388 remove_suffix (char *name, int len)
392 for (i = 2; i < 8 && len > i; i++)
394 if (name[len - i] == '.')
396 name[len - i] = '\0';
402 /* Create a new temporary name with PREFIX. Return an identifier. */
404 static GTY(()) unsigned int tmp_var_id_num;
407 create_tmp_var_name (const char *prefix)
413 char *preftmp = ASTRDUP (prefix);
415 remove_suffix (preftmp, strlen (preftmp));
416 clean_symbol_name (preftmp);
421 ASM_FORMAT_PRIVATE_NAME (tmp_name, prefix ? prefix : "T", tmp_var_id_num++);
422 return get_identifier (tmp_name);
425 /* Create a new temporary variable declaration of type TYPE.
426 Do NOT push it into the current binding. */
429 create_tmp_var_raw (tree type, const char *prefix)
433 tmp_var = build_decl (input_location,
434 VAR_DECL, prefix ? create_tmp_var_name (prefix) : NULL,
437 /* The variable was declared by the compiler. */
438 DECL_ARTIFICIAL (tmp_var) = 1;
439 /* And we don't want debug info for it. */
440 DECL_IGNORED_P (tmp_var) = 1;
442 /* Make the variable writable. */
443 TREE_READONLY (tmp_var) = 0;
445 DECL_EXTERNAL (tmp_var) = 0;
446 TREE_STATIC (tmp_var) = 0;
447 TREE_USED (tmp_var) = 1;
452 /* Create a new temporary variable declaration of type TYPE. DO push the
453 variable into the current binding. Further, assume that this is called
454 only from gimplification or optimization, at which point the creation of
455 certain types are bugs. */
458 create_tmp_var (tree type, const char *prefix)
462 /* We don't allow types that are addressable (meaning we can't make copies),
463 or incomplete. We also used to reject every variable size objects here,
464 but now support those for which a constant upper bound can be obtained.
465 The processing for variable sizes is performed in gimple_add_tmp_var,
466 point at which it really matters and possibly reached via paths not going
467 through this function, e.g. after direct calls to create_tmp_var_raw. */
468 gcc_assert (!TREE_ADDRESSABLE (type) && COMPLETE_TYPE_P (type));
470 tmp_var = create_tmp_var_raw (type, prefix);
471 gimple_add_tmp_var (tmp_var);
475 /* Create a new temporary variable declaration of type TYPE by calling
476 create_tmp_var and if TYPE is a vector or a complex number, mark the new
477 temporary as gimple register. */
480 create_tmp_reg (tree type, const char *prefix)
484 tmp = create_tmp_var (type, prefix);
485 if (TREE_CODE (type) == COMPLEX_TYPE
486 || TREE_CODE (type) == VECTOR_TYPE)
487 DECL_GIMPLE_REG_P (tmp) = 1;
492 /* Create a temporary with a name derived from VAL. Subroutine of
493 lookup_tmp_var; nobody else should call this function. */
496 create_tmp_from_val (tree val)
498 return create_tmp_var (TREE_TYPE (val), get_name (val));
501 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
502 an existing expression temporary. */
505 lookup_tmp_var (tree val, bool is_formal)
509 /* If not optimizing, never really reuse a temporary. local-alloc
510 won't allocate any variable that is used in more than one basic
511 block, which means it will go into memory, causing much extra
512 work in reload and final and poorer code generation, outweighing
513 the extra memory allocation here. */
514 if (!optimize || !is_formal || TREE_SIDE_EFFECTS (val))
515 ret = create_tmp_from_val (val);
522 if (gimplify_ctxp->temp_htab == NULL)
523 gimplify_ctxp->temp_htab
524 = htab_create (1000, gimple_tree_hash, gimple_tree_eq, free);
525 slot = htab_find_slot (gimplify_ctxp->temp_htab, (void *)&elt, INSERT);
528 elt_p = XNEW (elt_t);
530 elt_p->temp = ret = create_tmp_from_val (val);
531 *slot = (void *) elt_p;
535 elt_p = (elt_t *) *slot;
543 /* Return true if T is a CALL_EXPR or an expression that can be
544 assigned to a temporary. Note that this predicate should only be
545 used during gimplification. See the rationale for this in
546 gimplify_modify_expr. */
549 is_gimple_reg_rhs_or_call (tree t)
551 return (get_gimple_rhs_class (TREE_CODE (t)) != GIMPLE_INVALID_RHS
552 || TREE_CODE (t) == CALL_EXPR);
555 /* Return true if T is a valid memory RHS or a CALL_EXPR. Note that
556 this predicate should only be used during gimplification. See the
557 rationale for this in gimplify_modify_expr. */
560 is_gimple_mem_rhs_or_call (tree t)
562 /* If we're dealing with a renamable type, either source or dest must be
563 a renamed variable. */
564 if (is_gimple_reg_type (TREE_TYPE (t)))
565 return is_gimple_val (t);
567 return (is_gimple_val (t) || is_gimple_lvalue (t)
568 || TREE_CODE (t) == CALL_EXPR);
571 /* Helper for get_formal_tmp_var and get_initialized_tmp_var. */
574 internal_get_tmp_var (tree val, gimple_seq *pre_p, gimple_seq *post_p,
579 /* Notice that we explicitly allow VAL to be a CALL_EXPR so that we
580 can create an INIT_EXPR and convert it into a GIMPLE_CALL below. */
581 gimplify_expr (&val, pre_p, post_p, is_gimple_reg_rhs_or_call,
584 t = lookup_tmp_var (val, is_formal);
587 && (TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
588 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE))
589 DECL_GIMPLE_REG_P (t) = 1;
591 mod = build2 (INIT_EXPR, TREE_TYPE (t), t, unshare_expr (val));
593 SET_EXPR_LOCATION (mod, EXPR_LOC_OR_HERE (val));
595 /* gimplify_modify_expr might want to reduce this further. */
596 gimplify_and_add (mod, pre_p);
599 /* If we're gimplifying into ssa, gimplify_modify_expr will have
600 given our temporary an SSA name. Find and return it. */
601 if (gimplify_ctxp->into_ssa)
603 gimple last = gimple_seq_last_stmt (*pre_p);
604 t = gimple_get_lhs (last);
610 /* Return a formal temporary variable initialized with VAL. PRE_P is as
611 in gimplify_expr. Only use this function if:
613 1) The value of the unfactored expression represented by VAL will not
614 change between the initialization and use of the temporary, and
615 2) The temporary will not be otherwise modified.
617 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
618 and #2 means it is inappropriate for && temps.
620 For other cases, use get_initialized_tmp_var instead. */
623 get_formal_tmp_var (tree val, gimple_seq *pre_p)
625 return internal_get_tmp_var (val, pre_p, NULL, true);
628 /* Return a temporary variable initialized with VAL. PRE_P and POST_P
629 are as in gimplify_expr. */
632 get_initialized_tmp_var (tree val, gimple_seq *pre_p, gimple_seq *post_p)
634 return internal_get_tmp_var (val, pre_p, post_p, false);
637 /* Declare all the variables in VARS in SCOPE. If DEBUG_INFO is true,
638 generate debug info for them; otherwise don't. */
641 declare_vars (tree vars, gimple scope, bool debug_info)
648 gcc_assert (gimple_code (scope) == GIMPLE_BIND);
650 temps = nreverse (last);
652 block = gimple_bind_block (scope);
653 gcc_assert (!block || TREE_CODE (block) == BLOCK);
654 if (!block || !debug_info)
656 DECL_CHAIN (last) = gimple_bind_vars (scope);
657 gimple_bind_set_vars (scope, temps);
661 /* We need to attach the nodes both to the BIND_EXPR and to its
662 associated BLOCK for debugging purposes. The key point here
663 is that the BLOCK_VARS of the BIND_EXPR_BLOCK of a BIND_EXPR
664 is a subchain of the BIND_EXPR_VARS of the BIND_EXPR. */
665 if (BLOCK_VARS (block))
666 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), temps);
669 gimple_bind_set_vars (scope,
670 chainon (gimple_bind_vars (scope), temps));
671 BLOCK_VARS (block) = temps;
677 /* For VAR a VAR_DECL of variable size, try to find a constant upper bound
678 for the size and adjust DECL_SIZE/DECL_SIZE_UNIT accordingly. Abort if
679 no such upper bound can be obtained. */
682 force_constant_size (tree var)
684 /* The only attempt we make is by querying the maximum size of objects
685 of the variable's type. */
687 HOST_WIDE_INT max_size;
689 gcc_assert (TREE_CODE (var) == VAR_DECL);
691 max_size = max_int_size_in_bytes (TREE_TYPE (var));
693 gcc_assert (max_size >= 0);
696 = build_int_cst (TREE_TYPE (DECL_SIZE_UNIT (var)), max_size);
698 = build_int_cst (TREE_TYPE (DECL_SIZE (var)), max_size * BITS_PER_UNIT);
701 /* Push the temporary variable TMP into the current binding. */
704 gimple_add_tmp_var (tree tmp)
706 gcc_assert (!DECL_CHAIN (tmp) && !DECL_SEEN_IN_BIND_EXPR_P (tmp));
708 /* Later processing assumes that the object size is constant, which might
709 not be true at this point. Force the use of a constant upper bound in
711 if (!host_integerp (DECL_SIZE_UNIT (tmp), 1))
712 force_constant_size (tmp);
714 DECL_CONTEXT (tmp) = current_function_decl;
715 DECL_SEEN_IN_BIND_EXPR_P (tmp) = 1;
719 DECL_CHAIN (tmp) = gimplify_ctxp->temps;
720 gimplify_ctxp->temps = tmp;
722 /* Mark temporaries local within the nearest enclosing parallel. */
723 if (gimplify_omp_ctxp)
725 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
726 while (ctx && ctx->region_type == ORT_WORKSHARE)
727 ctx = ctx->outer_context;
729 omp_add_variable (ctx, tmp, GOVD_LOCAL | GOVD_SEEN);
738 /* This case is for nested functions. We need to expose the locals
740 body_seq = gimple_body (current_function_decl);
741 declare_vars (tmp, gimple_seq_first_stmt (body_seq), false);
745 /* Determine whether to assign a location to the statement GS. */
748 should_carry_location_p (gimple gs)
750 /* Don't emit a line note for a label. We particularly don't want to
751 emit one for the break label, since it doesn't actually correspond
752 to the beginning of the loop/switch. */
753 if (gimple_code (gs) == GIMPLE_LABEL)
759 /* Return true if a location should not be emitted for this statement
760 by annotate_one_with_location. */
763 gimple_do_not_emit_location_p (gimple g)
765 return gimple_plf (g, GF_PLF_1);
768 /* Mark statement G so a location will not be emitted by
769 annotate_one_with_location. */
772 gimple_set_do_not_emit_location (gimple g)
774 /* The PLF flags are initialized to 0 when a new tuple is created,
775 so no need to initialize it anywhere. */
776 gimple_set_plf (g, GF_PLF_1, true);
779 /* Set the location for gimple statement GS to LOCATION. */
782 annotate_one_with_location (gimple gs, location_t location)
784 if (!gimple_has_location (gs)
785 && !gimple_do_not_emit_location_p (gs)
786 && should_carry_location_p (gs))
787 gimple_set_location (gs, location);
790 /* Set LOCATION for all the statements after iterator GSI in sequence
791 SEQ. If GSI is pointing to the end of the sequence, start with the
792 first statement in SEQ. */
795 annotate_all_with_location_after (gimple_seq seq, gimple_stmt_iterator gsi,
799 gsi = gsi_start (seq);
803 for (; !gsi_end_p (gsi); gsi_next (&gsi))
804 annotate_one_with_location (gsi_stmt (gsi), location);
807 /* Set the location for all the statements in a sequence STMT_P to LOCATION. */
810 annotate_all_with_location (gimple_seq stmt_p, location_t location)
812 gimple_stmt_iterator i;
814 if (gimple_seq_empty_p (stmt_p))
817 for (i = gsi_start (stmt_p); !gsi_end_p (i); gsi_next (&i))
819 gimple gs = gsi_stmt (i);
820 annotate_one_with_location (gs, location);
824 /* This page contains routines to unshare tree nodes, i.e. to duplicate tree
825 nodes that are referenced more than once in GENERIC functions. This is
826 necessary because gimplification (translation into GIMPLE) is performed
827 by modifying tree nodes in-place, so gimplication of a shared node in a
828 first context could generate an invalid GIMPLE form in a second context.
830 This is achieved with a simple mark/copy/unmark algorithm that walks the
831 GENERIC representation top-down, marks nodes with TREE_VISITED the first
832 time it encounters them, duplicates them if they already have TREE_VISITED
833 set, and finally removes the TREE_VISITED marks it has set.
835 The algorithm works only at the function level, i.e. it generates a GENERIC
836 representation of a function with no nodes shared within the function when
837 passed a GENERIC function (except for nodes that are allowed to be shared).
839 At the global level, it is also necessary to unshare tree nodes that are
840 referenced in more than one function, for the same aforementioned reason.
841 This requires some cooperation from the front-end. There are 2 strategies:
843 1. Manual unsharing. The front-end needs to call unshare_expr on every
844 expression that might end up being shared across functions.
846 2. Deep unsharing. This is an extension of regular unsharing. Instead
847 of calling unshare_expr on expressions that might be shared across
848 functions, the front-end pre-marks them with TREE_VISITED. This will
849 ensure that they are unshared on the first reference within functions
850 when the regular unsharing algorithm runs. The counterpart is that
851 this algorithm must look deeper than for manual unsharing, which is
852 specified by LANG_HOOKS_DEEP_UNSHARING.
854 If there are only few specific cases of node sharing across functions, it is
855 probably easier for a front-end to unshare the expressions manually. On the
856 contrary, if the expressions generated at the global level are as widespread
857 as expressions generated within functions, deep unsharing is very likely the
860 /* Similar to copy_tree_r but do not copy SAVE_EXPR or TARGET_EXPR nodes.
861 These nodes model computations that should only be done once. If we
862 were to unshare something like SAVE_EXPR(i++), the gimplification
863 process would create wrong code. */
866 mostly_copy_tree_r (tree *tp, int *walk_subtrees, void *data)
869 enum tree_code code = TREE_CODE (t);
871 /* Do not copy SAVE_EXPR, TARGET_EXPR or BIND_EXPR nodes themselves, but
872 copy their subtrees if we can make sure to do it only once. */
873 if (code == SAVE_EXPR || code == TARGET_EXPR || code == BIND_EXPR)
875 if (data && !pointer_set_insert ((struct pointer_set_t *)data, t))
881 /* Stop at types, decls, constants like copy_tree_r. */
882 else if (TREE_CODE_CLASS (code) == tcc_type
883 || TREE_CODE_CLASS (code) == tcc_declaration
884 || TREE_CODE_CLASS (code) == tcc_constant
885 /* We can't do anything sensible with a BLOCK used as an
886 expression, but we also can't just die when we see it
887 because of non-expression uses. So we avert our eyes
888 and cross our fingers. Silly Java. */
892 /* Cope with the statement expression extension. */
893 else if (code == STATEMENT_LIST)
896 /* Leave the bulk of the work to copy_tree_r itself. */
898 copy_tree_r (tp, walk_subtrees, NULL);
903 /* Callback for walk_tree to unshare most of the shared trees rooted at
904 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
905 then *TP is deep copied by calling mostly_copy_tree_r. */
908 copy_if_shared_r (tree *tp, int *walk_subtrees, void *data)
911 enum tree_code code = TREE_CODE (t);
913 /* Skip types, decls, and constants. But we do want to look at their
914 types and the bounds of types. Mark them as visited so we properly
915 unmark their subtrees on the unmark pass. If we've already seen them,
916 don't look down further. */
917 if (TREE_CODE_CLASS (code) == tcc_type
918 || TREE_CODE_CLASS (code) == tcc_declaration
919 || TREE_CODE_CLASS (code) == tcc_constant)
921 if (TREE_VISITED (t))
924 TREE_VISITED (t) = 1;
927 /* If this node has been visited already, unshare it and don't look
929 else if (TREE_VISITED (t))
931 walk_tree (tp, mostly_copy_tree_r, data, NULL);
935 /* Otherwise, mark the node as visited and keep looking. */
937 TREE_VISITED (t) = 1;
942 /* Unshare most of the shared trees rooted at *TP. */
945 copy_if_shared (tree *tp)
947 /* If the language requires deep unsharing, we need a pointer set to make
948 sure we don't repeatedly unshare subtrees of unshareable nodes. */
949 struct pointer_set_t *visited
950 = lang_hooks.deep_unsharing ? pointer_set_create () : NULL;
951 walk_tree (tp, copy_if_shared_r, visited, NULL);
953 pointer_set_destroy (visited);
956 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
957 bodies of any nested functions if we are unsharing the entire body of
961 unshare_body (tree *body_p, tree fndecl)
963 struct cgraph_node *cgn = cgraph_get_node (fndecl);
965 copy_if_shared (body_p);
967 if (cgn && body_p == &DECL_SAVED_TREE (fndecl))
968 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
969 unshare_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
972 /* Callback for walk_tree to unmark the visited trees rooted at *TP.
973 Subtrees are walked until the first unvisited node is encountered. */
976 unmark_visited_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
980 /* If this node has been visited, unmark it and keep looking. */
981 if (TREE_VISITED (t))
982 TREE_VISITED (t) = 0;
984 /* Otherwise, don't look any deeper. */
991 /* Unmark the visited trees rooted at *TP. */
994 unmark_visited (tree *tp)
996 walk_tree (tp, unmark_visited_r, NULL, NULL);
999 /* Likewise, but mark all trees as not visited. */
1002 unvisit_body (tree *body_p, tree fndecl)
1004 struct cgraph_node *cgn = cgraph_get_node (fndecl);
1006 unmark_visited (body_p);
1008 if (cgn && body_p == &DECL_SAVED_TREE (fndecl))
1009 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
1010 unvisit_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
1013 /* Unconditionally make an unshared copy of EXPR. This is used when using
1014 stored expressions which span multiple functions, such as BINFO_VTABLE,
1015 as the normal unsharing process can't tell that they're shared. */
1018 unshare_expr (tree expr)
1020 walk_tree (&expr, mostly_copy_tree_r, NULL, NULL);
1024 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
1025 contain statements and have a value. Assign its value to a temporary
1026 and give it void_type_node. Return the temporary, or NULL_TREE if
1027 WRAPPER was already void. */
1030 voidify_wrapper_expr (tree wrapper, tree temp)
1032 tree type = TREE_TYPE (wrapper);
1033 if (type && !VOID_TYPE_P (type))
1037 /* Set p to point to the body of the wrapper. Loop until we find
1038 something that isn't a wrapper. */
1039 for (p = &wrapper; p && *p; )
1041 switch (TREE_CODE (*p))
1044 TREE_SIDE_EFFECTS (*p) = 1;
1045 TREE_TYPE (*p) = void_type_node;
1046 /* For a BIND_EXPR, the body is operand 1. */
1047 p = &BIND_EXPR_BODY (*p);
1050 case CLEANUP_POINT_EXPR:
1051 case TRY_FINALLY_EXPR:
1052 case TRY_CATCH_EXPR:
1053 TREE_SIDE_EFFECTS (*p) = 1;
1054 TREE_TYPE (*p) = void_type_node;
1055 p = &TREE_OPERAND (*p, 0);
1058 case STATEMENT_LIST:
1060 tree_stmt_iterator i = tsi_last (*p);
1061 TREE_SIDE_EFFECTS (*p) = 1;
1062 TREE_TYPE (*p) = void_type_node;
1063 p = tsi_end_p (i) ? NULL : tsi_stmt_ptr (i);
1068 /* Advance to the last statement. Set all container types to
1070 for (; TREE_CODE (*p) == COMPOUND_EXPR; p = &TREE_OPERAND (*p, 1))
1072 TREE_SIDE_EFFECTS (*p) = 1;
1073 TREE_TYPE (*p) = void_type_node;
1077 case TRANSACTION_EXPR:
1078 TREE_SIDE_EFFECTS (*p) = 1;
1079 TREE_TYPE (*p) = void_type_node;
1080 p = &TRANSACTION_EXPR_BODY (*p);
1089 if (p == NULL || IS_EMPTY_STMT (*p))
1093 /* The wrapper is on the RHS of an assignment that we're pushing
1095 gcc_assert (TREE_CODE (temp) == INIT_EXPR
1096 || TREE_CODE (temp) == MODIFY_EXPR);
1097 TREE_OPERAND (temp, 1) = *p;
1102 temp = create_tmp_var (type, "retval");
1103 *p = build2 (INIT_EXPR, type, temp, *p);
1112 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
1113 a temporary through which they communicate. */
1116 build_stack_save_restore (gimple *save, gimple *restore)
1120 *save = gimple_build_call (builtin_decl_implicit (BUILT_IN_STACK_SAVE), 0);
1121 tmp_var = create_tmp_var (ptr_type_node, "saved_stack");
1122 gimple_call_set_lhs (*save, tmp_var);
1125 = gimple_build_call (builtin_decl_implicit (BUILT_IN_STACK_RESTORE),
1129 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
1131 static enum gimplify_status
1132 gimplify_bind_expr (tree *expr_p, gimple_seq *pre_p)
1134 tree bind_expr = *expr_p;
1135 bool old_save_stack = gimplify_ctxp->save_stack;
1140 tree temp = voidify_wrapper_expr (bind_expr, NULL);
1142 /* Mark variables seen in this bind expr. */
1143 for (t = BIND_EXPR_VARS (bind_expr); t ; t = DECL_CHAIN (t))
1145 if (TREE_CODE (t) == VAR_DECL)
1147 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
1149 /* Mark variable as local. */
1150 if (ctx && !DECL_EXTERNAL (t)
1151 && (! DECL_SEEN_IN_BIND_EXPR_P (t)
1152 || splay_tree_lookup (ctx->variables,
1153 (splay_tree_key) t) == NULL))
1154 omp_add_variable (gimplify_omp_ctxp, t, GOVD_LOCAL | GOVD_SEEN);
1156 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
1158 if (DECL_HARD_REGISTER (t) && !is_global_var (t) && cfun)
1159 cfun->has_local_explicit_reg_vars = true;
1162 /* Preliminarily mark non-addressed complex variables as eligible
1163 for promotion to gimple registers. We'll transform their uses
1165 if ((TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
1166 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
1167 && !TREE_THIS_VOLATILE (t)
1168 && (TREE_CODE (t) == VAR_DECL && !DECL_HARD_REGISTER (t))
1169 && !needs_to_live_in_memory (t))
1170 DECL_GIMPLE_REG_P (t) = 1;
1173 gimple_bind = gimple_build_bind (BIND_EXPR_VARS (bind_expr), NULL,
1174 BIND_EXPR_BLOCK (bind_expr));
1175 gimple_push_bind_expr (gimple_bind);
1177 gimplify_ctxp->save_stack = false;
1179 /* Gimplify the body into the GIMPLE_BIND tuple's body. */
1181 gimplify_stmt (&BIND_EXPR_BODY (bind_expr), &body);
1182 gimple_bind_set_body (gimple_bind, body);
1184 if (gimplify_ctxp->save_stack)
1186 gimple stack_save, stack_restore, gs;
1187 gimple_seq cleanup, new_body;
1189 /* Save stack on entry and restore it on exit. Add a try_finally
1190 block to achieve this. Note that mudflap depends on the
1191 format of the emitted code: see mx_register_decls(). */
1192 build_stack_save_restore (&stack_save, &stack_restore);
1194 cleanup = new_body = NULL;
1195 gimplify_seq_add_stmt (&cleanup, stack_restore);
1196 gs = gimple_build_try (gimple_bind_body (gimple_bind), cleanup,
1197 GIMPLE_TRY_FINALLY);
1199 gimplify_seq_add_stmt (&new_body, stack_save);
1200 gimplify_seq_add_stmt (&new_body, gs);
1201 gimple_bind_set_body (gimple_bind, new_body);
1204 gimplify_ctxp->save_stack = old_save_stack;
1205 gimple_pop_bind_expr ();
1207 gimplify_seq_add_stmt (pre_p, gimple_bind);
1215 *expr_p = NULL_TREE;
1219 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1220 GIMPLE value, it is assigned to a new temporary and the statement is
1221 re-written to return the temporary.
1223 PRE_P points to the sequence where side effects that must happen before
1224 STMT should be stored. */
1226 static enum gimplify_status
1227 gimplify_return_expr (tree stmt, gimple_seq *pre_p)
1230 tree ret_expr = TREE_OPERAND (stmt, 0);
1231 tree result_decl, result;
1233 if (ret_expr == error_mark_node)
1237 || TREE_CODE (ret_expr) == RESULT_DECL
1238 || ret_expr == error_mark_node)
1240 gimple ret = gimple_build_return (ret_expr);
1241 gimple_set_no_warning (ret, TREE_NO_WARNING (stmt));
1242 gimplify_seq_add_stmt (pre_p, ret);
1246 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
1247 result_decl = NULL_TREE;
1250 result_decl = TREE_OPERAND (ret_expr, 0);
1252 /* See through a return by reference. */
1253 if (TREE_CODE (result_decl) == INDIRECT_REF)
1254 result_decl = TREE_OPERAND (result_decl, 0);
1256 gcc_assert ((TREE_CODE (ret_expr) == MODIFY_EXPR
1257 || TREE_CODE (ret_expr) == INIT_EXPR)
1258 && TREE_CODE (result_decl) == RESULT_DECL);
1261 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1262 Recall that aggregate_value_p is FALSE for any aggregate type that is
1263 returned in registers. If we're returning values in registers, then
1264 we don't want to extend the lifetime of the RESULT_DECL, particularly
1265 across another call. In addition, for those aggregates for which
1266 hard_function_value generates a PARALLEL, we'll die during normal
1267 expansion of structure assignments; there's special code in expand_return
1268 to handle this case that does not exist in expand_expr. */
1271 else if (aggregate_value_p (result_decl, TREE_TYPE (current_function_decl)))
1273 if (TREE_CODE (DECL_SIZE (result_decl)) != INTEGER_CST)
1275 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (result_decl)))
1276 gimplify_type_sizes (TREE_TYPE (result_decl), pre_p);
1277 /* Note that we don't use gimplify_vla_decl because the RESULT_DECL
1278 should be effectively allocated by the caller, i.e. all calls to
1279 this function must be subject to the Return Slot Optimization. */
1280 gimplify_one_sizepos (&DECL_SIZE (result_decl), pre_p);
1281 gimplify_one_sizepos (&DECL_SIZE_UNIT (result_decl), pre_p);
1283 result = result_decl;
1285 else if (gimplify_ctxp->return_temp)
1286 result = gimplify_ctxp->return_temp;
1289 result = create_tmp_reg (TREE_TYPE (result_decl), NULL);
1291 /* ??? With complex control flow (usually involving abnormal edges),
1292 we can wind up warning about an uninitialized value for this. Due
1293 to how this variable is constructed and initialized, this is never
1294 true. Give up and never warn. */
1295 TREE_NO_WARNING (result) = 1;
1297 gimplify_ctxp->return_temp = result;
1300 /* Smash the lhs of the MODIFY_EXPR to the temporary we plan to use.
1301 Then gimplify the whole thing. */
1302 if (result != result_decl)
1303 TREE_OPERAND (ret_expr, 0) = result;
1305 gimplify_and_add (TREE_OPERAND (stmt, 0), pre_p);
1307 ret = gimple_build_return (result);
1308 gimple_set_no_warning (ret, TREE_NO_WARNING (stmt));
1309 gimplify_seq_add_stmt (pre_p, ret);
1314 /* Gimplify a variable-length array DECL. */
1317 gimplify_vla_decl (tree decl, gimple_seq *seq_p)
1319 /* This is a variable-sized decl. Simplify its size and mark it
1320 for deferred expansion. Note that mudflap depends on the format
1321 of the emitted code: see mx_register_decls(). */
1322 tree t, addr, ptr_type;
1324 gimplify_one_sizepos (&DECL_SIZE (decl), seq_p);
1325 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl), seq_p);
1327 /* All occurrences of this decl in final gimplified code will be
1328 replaced by indirection. Setting DECL_VALUE_EXPR does two
1329 things: First, it lets the rest of the gimplifier know what
1330 replacement to use. Second, it lets the debug info know
1331 where to find the value. */
1332 ptr_type = build_pointer_type (TREE_TYPE (decl));
1333 addr = create_tmp_var (ptr_type, get_name (decl));
1334 DECL_IGNORED_P (addr) = 0;
1335 t = build_fold_indirect_ref (addr);
1336 TREE_THIS_NOTRAP (t) = 1;
1337 SET_DECL_VALUE_EXPR (decl, t);
1338 DECL_HAS_VALUE_EXPR_P (decl) = 1;
1340 t = builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN);
1341 t = build_call_expr (t, 2, DECL_SIZE_UNIT (decl),
1342 size_int (DECL_ALIGN (decl)));
1343 /* The call has been built for a variable-sized object. */
1344 CALL_ALLOCA_FOR_VAR_P (t) = 1;
1345 t = fold_convert (ptr_type, t);
1346 t = build2 (MODIFY_EXPR, TREE_TYPE (addr), addr, t);
1348 gimplify_and_add (t, seq_p);
1350 /* Indicate that we need to restore the stack level when the
1351 enclosing BIND_EXPR is exited. */
1352 gimplify_ctxp->save_stack = true;
1355 /* Gimplify a DECL_EXPR node *STMT_P by making any necessary allocation
1356 and initialization explicit. */
1358 static enum gimplify_status
1359 gimplify_decl_expr (tree *stmt_p, gimple_seq *seq_p)
1361 tree stmt = *stmt_p;
1362 tree decl = DECL_EXPR_DECL (stmt);
1364 *stmt_p = NULL_TREE;
1366 if (TREE_TYPE (decl) == error_mark_node)
1369 if ((TREE_CODE (decl) == TYPE_DECL
1370 || TREE_CODE (decl) == VAR_DECL)
1371 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl)))
1372 gimplify_type_sizes (TREE_TYPE (decl), seq_p);
1374 if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl))
1376 tree init = DECL_INITIAL (decl);
1378 if (TREE_CODE (DECL_SIZE_UNIT (decl)) != INTEGER_CST
1379 || (!TREE_STATIC (decl)
1380 && flag_stack_check == GENERIC_STACK_CHECK
1381 && compare_tree_int (DECL_SIZE_UNIT (decl),
1382 STACK_CHECK_MAX_VAR_SIZE) > 0))
1383 gimplify_vla_decl (decl, seq_p);
1385 /* Some front ends do not explicitly declare all anonymous
1386 artificial variables. We compensate here by declaring the
1387 variables, though it would be better if the front ends would
1388 explicitly declare them. */
1389 if (!DECL_SEEN_IN_BIND_EXPR_P (decl)
1390 && DECL_ARTIFICIAL (decl) && DECL_NAME (decl) == NULL_TREE)
1391 gimple_add_tmp_var (decl);
1393 if (init && init != error_mark_node)
1395 if (!TREE_STATIC (decl))
1397 DECL_INITIAL (decl) = NULL_TREE;
1398 init = build2 (INIT_EXPR, void_type_node, decl, init);
1399 gimplify_and_add (init, seq_p);
1403 /* We must still examine initializers for static variables
1404 as they may contain a label address. */
1405 walk_tree (&init, force_labels_r, NULL, NULL);
1412 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1413 and replacing the LOOP_EXPR with goto, but if the loop contains an
1414 EXIT_EXPR, we need to append a label for it to jump to. */
1416 static enum gimplify_status
1417 gimplify_loop_expr (tree *expr_p, gimple_seq *pre_p)
1419 tree saved_label = gimplify_ctxp->exit_label;
1420 tree start_label = create_artificial_label (UNKNOWN_LOCATION);
1422 gimplify_seq_add_stmt (pre_p, gimple_build_label (start_label));
1424 gimplify_ctxp->exit_label = NULL_TREE;
1426 gimplify_and_add (LOOP_EXPR_BODY (*expr_p), pre_p);
1428 gimplify_seq_add_stmt (pre_p, gimple_build_goto (start_label));
1430 if (gimplify_ctxp->exit_label)
1431 gimplify_seq_add_stmt (pre_p,
1432 gimple_build_label (gimplify_ctxp->exit_label));
1434 gimplify_ctxp->exit_label = saved_label;
1440 /* Gimplify a statement list onto a sequence. These may be created either
1441 by an enlightened front-end, or by shortcut_cond_expr. */
1443 static enum gimplify_status
1444 gimplify_statement_list (tree *expr_p, gimple_seq *pre_p)
1446 tree temp = voidify_wrapper_expr (*expr_p, NULL);
1448 tree_stmt_iterator i = tsi_start (*expr_p);
1450 while (!tsi_end_p (i))
1452 gimplify_stmt (tsi_stmt_ptr (i), pre_p);
1465 /* Compare two case labels. Because the front end should already have
1466 made sure that case ranges do not overlap, it is enough to only compare
1467 the CASE_LOW values of each case label. */
1470 compare_case_labels (const void *p1, const void *p2)
1472 const_tree const case1 = *(const_tree const*)p1;
1473 const_tree const case2 = *(const_tree const*)p2;
1475 /* The 'default' case label always goes first. */
1476 if (!CASE_LOW (case1))
1478 else if (!CASE_LOW (case2))
1481 return tree_int_cst_compare (CASE_LOW (case1), CASE_LOW (case2));
1484 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1487 sort_case_labels (VEC(tree,heap)* label_vec)
1489 VEC_qsort (tree, label_vec, compare_case_labels);
1492 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1495 static enum gimplify_status
1496 gimplify_switch_expr (tree *expr_p, gimple_seq *pre_p)
1498 tree switch_expr = *expr_p;
1499 gimple_seq switch_body_seq = NULL;
1500 enum gimplify_status ret;
1502 ret = gimplify_expr (&SWITCH_COND (switch_expr), pre_p, NULL, is_gimple_val,
1504 if (ret == GS_ERROR || ret == GS_UNHANDLED)
1507 if (SWITCH_BODY (switch_expr))
1509 VEC (tree,heap) *labels;
1510 VEC (tree,heap) *saved_labels;
1511 tree default_case = NULL_TREE;
1513 gimple gimple_switch;
1515 /* If someone can be bothered to fill in the labels, they can
1516 be bothered to null out the body too. */
1517 gcc_assert (!SWITCH_LABELS (switch_expr));
1519 /* save old labels, get new ones from body, then restore the old
1520 labels. Save all the things from the switch body to append after. */
1521 saved_labels = gimplify_ctxp->case_labels;
1522 gimplify_ctxp->case_labels = VEC_alloc (tree, heap, 8);
1524 gimplify_stmt (&SWITCH_BODY (switch_expr), &switch_body_seq);
1525 labels = gimplify_ctxp->case_labels;
1526 gimplify_ctxp->case_labels = saved_labels;
1529 while (i < VEC_length (tree, labels))
1531 tree elt = VEC_index (tree, labels, i);
1532 tree low = CASE_LOW (elt);
1533 bool remove_element = FALSE;
1537 /* Discard empty ranges. */
1538 tree high = CASE_HIGH (elt);
1539 if (high && tree_int_cst_lt (high, low))
1540 remove_element = TRUE;
1544 /* The default case must be the last label in the list. */
1545 gcc_assert (!default_case);
1547 remove_element = TRUE;
1551 VEC_ordered_remove (tree, labels, i);
1557 if (!VEC_empty (tree, labels))
1558 sort_case_labels (labels);
1562 tree type = TREE_TYPE (switch_expr);
1564 /* If the switch has no default label, add one, so that we jump
1565 around the switch body. If the labels already cover the whole
1566 range of type, add the default label pointing to one of the
1568 if (type == void_type_node)
1569 type = TREE_TYPE (SWITCH_COND (switch_expr));
1571 && INTEGRAL_TYPE_P (type)
1572 && TYPE_MIN_VALUE (type)
1573 && TYPE_MAX_VALUE (type)
1574 && tree_int_cst_equal (CASE_LOW (VEC_index (tree, labels, 0)),
1575 TYPE_MIN_VALUE (type)))
1577 tree low, high = CASE_HIGH (VEC_index (tree, labels, len - 1));
1579 high = CASE_LOW (VEC_index (tree, labels, len - 1));
1580 if (tree_int_cst_equal (high, TYPE_MAX_VALUE (type)))
1582 for (i = 1; i < len; i++)
1584 high = CASE_LOW (VEC_index (tree, labels, i));
1585 low = CASE_HIGH (VEC_index (tree, labels, i - 1));
1587 low = CASE_LOW (VEC_index (tree, labels, i - 1));
1588 if ((TREE_INT_CST_LOW (low) + 1
1589 != TREE_INT_CST_LOW (high))
1590 || (TREE_INT_CST_HIGH (low)
1591 + (TREE_INT_CST_LOW (high) == 0)
1592 != TREE_INT_CST_HIGH (high)))
1597 tree label = CASE_LABEL (VEC_index (tree, labels, 0));
1598 default_case = build_case_label (NULL_TREE, NULL_TREE,
1609 = build_case_label (NULL_TREE, NULL_TREE,
1610 create_artificial_label (UNKNOWN_LOCATION));
1611 new_default = gimple_build_label (CASE_LABEL (default_case));
1612 gimplify_seq_add_stmt (&switch_body_seq, new_default);
1616 gimple_switch = gimple_build_switch_vec (SWITCH_COND (switch_expr),
1617 default_case, labels);
1618 gimplify_seq_add_stmt (pre_p, gimple_switch);
1619 gimplify_seq_add_seq (pre_p, switch_body_seq);
1620 VEC_free(tree, heap, labels);
1623 gcc_assert (SWITCH_LABELS (switch_expr));
1628 /* Gimplify the CASE_LABEL_EXPR pointed to by EXPR_P. */
1630 static enum gimplify_status
1631 gimplify_case_label_expr (tree *expr_p, gimple_seq *pre_p)
1633 struct gimplify_ctx *ctxp;
1634 gimple gimple_label;
1636 /* Invalid OpenMP programs can play Duff's Device type games with
1637 #pragma omp parallel. At least in the C front end, we don't
1638 detect such invalid branches until after gimplification. */
1639 for (ctxp = gimplify_ctxp; ; ctxp = ctxp->prev_context)
1640 if (ctxp->case_labels)
1643 gimple_label = gimple_build_label (CASE_LABEL (*expr_p));
1644 VEC_safe_push (tree, heap, ctxp->case_labels, *expr_p);
1645 gimplify_seq_add_stmt (pre_p, gimple_label);
1650 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1654 build_and_jump (tree *label_p)
1656 if (label_p == NULL)
1657 /* If there's nowhere to jump, just fall through. */
1660 if (*label_p == NULL_TREE)
1662 tree label = create_artificial_label (UNKNOWN_LOCATION);
1666 return build1 (GOTO_EXPR, void_type_node, *label_p);
1669 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1670 This also involves building a label to jump to and communicating it to
1671 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1673 static enum gimplify_status
1674 gimplify_exit_expr (tree *expr_p)
1676 tree cond = TREE_OPERAND (*expr_p, 0);
1679 expr = build_and_jump (&gimplify_ctxp->exit_label);
1680 expr = build3 (COND_EXPR, void_type_node, cond, expr, NULL_TREE);
1686 /* A helper function to be called via walk_tree. Mark all labels under *TP
1687 as being forced. To be called for DECL_INITIAL of static variables. */
1690 force_labels_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
1694 if (TREE_CODE (*tp) == LABEL_DECL)
1695 FORCED_LABEL (*tp) = 1;
1700 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1701 different from its canonical type, wrap the whole thing inside a
1702 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1705 The canonical type of a COMPONENT_REF is the type of the field being
1706 referenced--unless the field is a bit-field which can be read directly
1707 in a smaller mode, in which case the canonical type is the
1708 sign-appropriate type corresponding to that mode. */
1711 canonicalize_component_ref (tree *expr_p)
1713 tree expr = *expr_p;
1716 gcc_assert (TREE_CODE (expr) == COMPONENT_REF);
1718 if (INTEGRAL_TYPE_P (TREE_TYPE (expr)))
1719 type = TREE_TYPE (get_unwidened (expr, NULL_TREE));
1721 type = TREE_TYPE (TREE_OPERAND (expr, 1));
1723 /* One could argue that all the stuff below is not necessary for
1724 the non-bitfield case and declare it a FE error if type
1725 adjustment would be needed. */
1726 if (TREE_TYPE (expr) != type)
1728 #ifdef ENABLE_TYPES_CHECKING
1729 tree old_type = TREE_TYPE (expr);
1733 /* We need to preserve qualifiers and propagate them from
1735 type_quals = TYPE_QUALS (type)
1736 | TYPE_QUALS (TREE_TYPE (TREE_OPERAND (expr, 0)));
1737 if (TYPE_QUALS (type) != type_quals)
1738 type = build_qualified_type (TYPE_MAIN_VARIANT (type), type_quals);
1740 /* Set the type of the COMPONENT_REF to the underlying type. */
1741 TREE_TYPE (expr) = type;
1743 #ifdef ENABLE_TYPES_CHECKING
1744 /* It is now a FE error, if the conversion from the canonical
1745 type to the original expression type is not useless. */
1746 gcc_assert (useless_type_conversion_p (old_type, type));
1751 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1752 to foo, embed that change in the ADDR_EXPR by converting
1757 where L is the lower bound. For simplicity, only do this for constant
1759 The constraint is that the type of &array[L] is trivially convertible
1763 canonicalize_addr_expr (tree *expr_p)
1765 tree expr = *expr_p;
1766 tree addr_expr = TREE_OPERAND (expr, 0);
1767 tree datype, ddatype, pddatype;
1769 /* We simplify only conversions from an ADDR_EXPR to a pointer type. */
1770 if (!POINTER_TYPE_P (TREE_TYPE (expr))
1771 || TREE_CODE (addr_expr) != ADDR_EXPR)
1774 /* The addr_expr type should be a pointer to an array. */
1775 datype = TREE_TYPE (TREE_TYPE (addr_expr));
1776 if (TREE_CODE (datype) != ARRAY_TYPE)
1779 /* The pointer to element type shall be trivially convertible to
1780 the expression pointer type. */
1781 ddatype = TREE_TYPE (datype);
1782 pddatype = build_pointer_type (ddatype);
1783 if (!useless_type_conversion_p (TYPE_MAIN_VARIANT (TREE_TYPE (expr)),
1787 /* The lower bound and element sizes must be constant. */
1788 if (!TYPE_SIZE_UNIT (ddatype)
1789 || TREE_CODE (TYPE_SIZE_UNIT (ddatype)) != INTEGER_CST
1790 || !TYPE_DOMAIN (datype) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype))
1791 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype))) != INTEGER_CST)
1794 /* All checks succeeded. Build a new node to merge the cast. */
1795 *expr_p = build4 (ARRAY_REF, ddatype, TREE_OPERAND (addr_expr, 0),
1796 TYPE_MIN_VALUE (TYPE_DOMAIN (datype)),
1797 NULL_TREE, NULL_TREE);
1798 *expr_p = build1 (ADDR_EXPR, pddatype, *expr_p);
1800 /* We can have stripped a required restrict qualifier above. */
1801 if (!useless_type_conversion_p (TREE_TYPE (expr), TREE_TYPE (*expr_p)))
1802 *expr_p = fold_convert (TREE_TYPE (expr), *expr_p);
1805 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1806 underneath as appropriate. */
1808 static enum gimplify_status
1809 gimplify_conversion (tree *expr_p)
1811 location_t loc = EXPR_LOCATION (*expr_p);
1812 gcc_assert (CONVERT_EXPR_P (*expr_p));
1814 /* Then strip away all but the outermost conversion. */
1815 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p, 0));
1817 /* And remove the outermost conversion if it's useless. */
1818 if (tree_ssa_useless_type_conversion (*expr_p))
1819 *expr_p = TREE_OPERAND (*expr_p, 0);
1821 /* If we still have a conversion at the toplevel,
1822 then canonicalize some constructs. */
1823 if (CONVERT_EXPR_P (*expr_p))
1825 tree sub = TREE_OPERAND (*expr_p, 0);
1827 /* If a NOP conversion is changing the type of a COMPONENT_REF
1828 expression, then canonicalize its type now in order to expose more
1829 redundant conversions. */
1830 if (TREE_CODE (sub) == COMPONENT_REF)
1831 canonicalize_component_ref (&TREE_OPERAND (*expr_p, 0));
1833 /* If a NOP conversion is changing a pointer to array of foo
1834 to a pointer to foo, embed that change in the ADDR_EXPR. */
1835 else if (TREE_CODE (sub) == ADDR_EXPR)
1836 canonicalize_addr_expr (expr_p);
1839 /* If we have a conversion to a non-register type force the
1840 use of a VIEW_CONVERT_EXPR instead. */
1841 if (CONVERT_EXPR_P (*expr_p) && !is_gimple_reg_type (TREE_TYPE (*expr_p)))
1842 *expr_p = fold_build1_loc (loc, VIEW_CONVERT_EXPR, TREE_TYPE (*expr_p),
1843 TREE_OPERAND (*expr_p, 0));
1848 /* Nonlocal VLAs seen in the current function. */
1849 static struct pointer_set_t *nonlocal_vlas;
1851 /* Gimplify a VAR_DECL or PARM_DECL. Return GS_OK if we expanded a
1852 DECL_VALUE_EXPR, and it's worth re-examining things. */
1854 static enum gimplify_status
1855 gimplify_var_or_parm_decl (tree *expr_p)
1857 tree decl = *expr_p;
1859 /* ??? If this is a local variable, and it has not been seen in any
1860 outer BIND_EXPR, then it's probably the result of a duplicate
1861 declaration, for which we've already issued an error. It would
1862 be really nice if the front end wouldn't leak these at all.
1863 Currently the only known culprit is C++ destructors, as seen
1864 in g++.old-deja/g++.jason/binding.C. */
1865 if (TREE_CODE (decl) == VAR_DECL
1866 && !DECL_SEEN_IN_BIND_EXPR_P (decl)
1867 && !TREE_STATIC (decl) && !DECL_EXTERNAL (decl)
1868 && decl_function_context (decl) == current_function_decl)
1870 gcc_assert (seen_error ());
1874 /* When within an OpenMP context, notice uses of variables. */
1875 if (gimplify_omp_ctxp && omp_notice_variable (gimplify_omp_ctxp, decl, true))
1878 /* If the decl is an alias for another expression, substitute it now. */
1879 if (DECL_HAS_VALUE_EXPR_P (decl))
1881 tree value_expr = DECL_VALUE_EXPR (decl);
1883 /* For referenced nonlocal VLAs add a decl for debugging purposes
1884 to the current function. */
1885 if (TREE_CODE (decl) == VAR_DECL
1886 && TREE_CODE (DECL_SIZE_UNIT (decl)) != INTEGER_CST
1887 && nonlocal_vlas != NULL
1888 && TREE_CODE (value_expr) == INDIRECT_REF
1889 && TREE_CODE (TREE_OPERAND (value_expr, 0)) == VAR_DECL
1890 && decl_function_context (decl) != current_function_decl)
1892 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
1893 while (ctx && ctx->region_type == ORT_WORKSHARE)
1894 ctx = ctx->outer_context;
1895 if (!ctx && !pointer_set_insert (nonlocal_vlas, decl))
1897 tree copy = copy_node (decl), block;
1899 lang_hooks.dup_lang_specific_decl (copy);
1900 SET_DECL_RTL (copy, 0);
1901 TREE_USED (copy) = 1;
1902 block = DECL_INITIAL (current_function_decl);
1903 DECL_CHAIN (copy) = BLOCK_VARS (block);
1904 BLOCK_VARS (block) = copy;
1905 SET_DECL_VALUE_EXPR (copy, unshare_expr (value_expr));
1906 DECL_HAS_VALUE_EXPR_P (copy) = 1;
1910 *expr_p = unshare_expr (value_expr);
1917 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1921 : min_lval '[' val ']'
1923 | compound_lval '[' val ']'
1924 | compound_lval '.' ID
1926 This is not part of the original SIMPLE definition, which separates
1927 array and member references, but it seems reasonable to handle them
1928 together. Also, this way we don't run into problems with union
1929 aliasing; gcc requires that for accesses through a union to alias, the
1930 union reference must be explicit, which was not always the case when we
1931 were splitting up array and member refs.
1933 PRE_P points to the sequence where side effects that must happen before
1934 *EXPR_P should be stored.
1936 POST_P points to the sequence where side effects that must happen after
1937 *EXPR_P should be stored. */
1939 static enum gimplify_status
1940 gimplify_compound_lval (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
1941 fallback_t fallback)
1944 VEC(tree,heap) *stack;
1945 enum gimplify_status ret = GS_ALL_DONE, tret;
1947 location_t loc = EXPR_LOCATION (*expr_p);
1948 tree expr = *expr_p;
1950 /* Create a stack of the subexpressions so later we can walk them in
1951 order from inner to outer. */
1952 stack = VEC_alloc (tree, heap, 10);
1954 /* We can handle anything that get_inner_reference can deal with. */
1955 for (p = expr_p; ; p = &TREE_OPERAND (*p, 0))
1958 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1959 if (TREE_CODE (*p) == INDIRECT_REF)
1960 *p = fold_indirect_ref_loc (loc, *p);
1962 if (handled_component_p (*p))
1964 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
1965 additional COMPONENT_REFs. */
1966 else if ((TREE_CODE (*p) == VAR_DECL || TREE_CODE (*p) == PARM_DECL)
1967 && gimplify_var_or_parm_decl (p) == GS_OK)
1972 VEC_safe_push (tree, heap, stack, *p);
1975 gcc_assert (VEC_length (tree, stack));
1977 /* Now STACK is a stack of pointers to all the refs we've walked through
1978 and P points to the innermost expression.
1980 Java requires that we elaborated nodes in source order. That
1981 means we must gimplify the inner expression followed by each of
1982 the indices, in order. But we can't gimplify the inner
1983 expression until we deal with any variable bounds, sizes, or
1984 positions in order to deal with PLACEHOLDER_EXPRs.
1986 So we do this in three steps. First we deal with the annotations
1987 for any variables in the components, then we gimplify the base,
1988 then we gimplify any indices, from left to right. */
1989 for (i = VEC_length (tree, stack) - 1; i >= 0; i--)
1991 tree t = VEC_index (tree, stack, i);
1993 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
1995 /* Gimplify the low bound and element type size and put them into
1996 the ARRAY_REF. If these values are set, they have already been
1998 if (TREE_OPERAND (t, 2) == NULL_TREE)
2000 tree low = unshare_expr (array_ref_low_bound (t));
2001 if (!is_gimple_min_invariant (low))
2003 TREE_OPERAND (t, 2) = low;
2004 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p,
2005 post_p, is_gimple_reg,
2007 ret = MIN (ret, tret);
2012 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
2013 is_gimple_reg, fb_rvalue);
2014 ret = MIN (ret, tret);
2017 if (TREE_OPERAND (t, 3) == NULL_TREE)
2019 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (t, 0)));
2020 tree elmt_size = unshare_expr (array_ref_element_size (t));
2021 tree factor = size_int (TYPE_ALIGN_UNIT (elmt_type));
2023 /* Divide the element size by the alignment of the element
2026 = size_binop_loc (loc, EXACT_DIV_EXPR, elmt_size, factor);
2028 if (!is_gimple_min_invariant (elmt_size))
2030 TREE_OPERAND (t, 3) = elmt_size;
2031 tret = gimplify_expr (&TREE_OPERAND (t, 3), pre_p,
2032 post_p, is_gimple_reg,
2034 ret = MIN (ret, tret);
2039 tret = gimplify_expr (&TREE_OPERAND (t, 3), pre_p, post_p,
2040 is_gimple_reg, fb_rvalue);
2041 ret = MIN (ret, tret);
2044 else if (TREE_CODE (t) == COMPONENT_REF)
2046 /* Set the field offset into T and gimplify it. */
2047 if (TREE_OPERAND (t, 2) == NULL_TREE)
2049 tree offset = unshare_expr (component_ref_field_offset (t));
2050 tree field = TREE_OPERAND (t, 1);
2052 = size_int (DECL_OFFSET_ALIGN (field) / BITS_PER_UNIT);
2054 /* Divide the offset by its alignment. */
2055 offset = size_binop_loc (loc, EXACT_DIV_EXPR, offset, factor);
2057 if (!is_gimple_min_invariant (offset))
2059 TREE_OPERAND (t, 2) = offset;
2060 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p,
2061 post_p, is_gimple_reg,
2063 ret = MIN (ret, tret);
2068 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
2069 is_gimple_reg, fb_rvalue);
2070 ret = MIN (ret, tret);
2075 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
2076 so as to match the min_lval predicate. Failure to do so may result
2077 in the creation of large aggregate temporaries. */
2078 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval,
2079 fallback | fb_lvalue);
2080 ret = MIN (ret, tret);
2082 /* And finally, the indices and operands to BIT_FIELD_REF. During this
2083 loop we also remove any useless conversions. */
2084 for (; VEC_length (tree, stack) > 0; )
2086 tree t = VEC_pop (tree, stack);
2088 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
2090 /* Gimplify the dimension. */
2091 if (!is_gimple_min_invariant (TREE_OPERAND (t, 1)))
2093 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
2094 is_gimple_val, fb_rvalue);
2095 ret = MIN (ret, tret);
2098 else if (TREE_CODE (t) == BIT_FIELD_REF)
2100 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
2101 is_gimple_val, fb_rvalue);
2102 ret = MIN (ret, tret);
2103 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
2104 is_gimple_val, fb_rvalue);
2105 ret = MIN (ret, tret);
2108 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t, 0));
2110 /* The innermost expression P may have originally had
2111 TREE_SIDE_EFFECTS set which would have caused all the outer
2112 expressions in *EXPR_P leading to P to also have had
2113 TREE_SIDE_EFFECTS set. */
2114 recalculate_side_effects (t);
2117 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
2118 if ((fallback & fb_rvalue) && TREE_CODE (*expr_p) == COMPONENT_REF)
2120 canonicalize_component_ref (expr_p);
2123 VEC_free (tree, heap, stack);
2125 gcc_assert (*expr_p == expr || ret != GS_ALL_DONE);
2130 /* Gimplify the self modifying expression pointed to by EXPR_P
2133 PRE_P points to the list where side effects that must happen before
2134 *EXPR_P should be stored.
2136 POST_P points to the list where side effects that must happen after
2137 *EXPR_P should be stored.
2139 WANT_VALUE is nonzero iff we want to use the value of this expression
2140 in another expression. */
2142 static enum gimplify_status
2143 gimplify_self_mod_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
2146 enum tree_code code;
2147 tree lhs, lvalue, rhs, t1;
2148 gimple_seq post = NULL, *orig_post_p = post_p;
2150 enum tree_code arith_code;
2151 enum gimplify_status ret;
2152 location_t loc = EXPR_LOCATION (*expr_p);
2154 code = TREE_CODE (*expr_p);
2156 gcc_assert (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR
2157 || code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR);
2159 /* Prefix or postfix? */
2160 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
2161 /* Faster to treat as prefix if result is not used. */
2162 postfix = want_value;
2166 /* For postfix, make sure the inner expression's post side effects
2167 are executed after side effects from this expression. */
2171 /* Add or subtract? */
2172 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2173 arith_code = PLUS_EXPR;
2175 arith_code = MINUS_EXPR;
2177 /* Gimplify the LHS into a GIMPLE lvalue. */
2178 lvalue = TREE_OPERAND (*expr_p, 0);
2179 ret = gimplify_expr (&lvalue, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
2180 if (ret == GS_ERROR)
2183 /* Extract the operands to the arithmetic operation. */
2185 rhs = TREE_OPERAND (*expr_p, 1);
2187 /* For postfix operator, we evaluate the LHS to an rvalue and then use
2188 that as the result value and in the postqueue operation. We also
2189 make sure to make lvalue a minimal lval, see
2190 gcc.c-torture/execute/20040313-1.c for an example where this matters. */
2193 if (!is_gimple_min_lval (lvalue))
2195 mark_addressable (lvalue);
2196 lvalue = build_fold_addr_expr_loc (input_location, lvalue);
2197 gimplify_expr (&lvalue, pre_p, post_p, is_gimple_val, fb_rvalue);
2198 lvalue = build_fold_indirect_ref_loc (input_location, lvalue);
2200 ret = gimplify_expr (&lhs, pre_p, post_p, is_gimple_val, fb_rvalue);
2201 if (ret == GS_ERROR)
2205 /* For POINTERs increment, use POINTER_PLUS_EXPR. */
2206 if (POINTER_TYPE_P (TREE_TYPE (lhs)))
2208 rhs = convert_to_ptrofftype_loc (loc, rhs);
2209 if (arith_code == MINUS_EXPR)
2210 rhs = fold_build1_loc (loc, NEGATE_EXPR, TREE_TYPE (rhs), rhs);
2211 arith_code = POINTER_PLUS_EXPR;
2214 t1 = build2 (arith_code, TREE_TYPE (*expr_p), lhs, rhs);
2218 gimplify_assign (lvalue, t1, orig_post_p);
2219 gimplify_seq_add_seq (orig_post_p, post);
2225 *expr_p = build2 (MODIFY_EXPR, TREE_TYPE (lvalue), lvalue, t1);
2230 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
2233 maybe_with_size_expr (tree *expr_p)
2235 tree expr = *expr_p;
2236 tree type = TREE_TYPE (expr);
2239 /* If we've already wrapped this or the type is error_mark_node, we can't do
2241 if (TREE_CODE (expr) == WITH_SIZE_EXPR
2242 || type == error_mark_node)
2245 /* If the size isn't known or is a constant, we have nothing to do. */
2246 size = TYPE_SIZE_UNIT (type);
2247 if (!size || TREE_CODE (size) == INTEGER_CST)
2250 /* Otherwise, make a WITH_SIZE_EXPR. */
2251 size = unshare_expr (size);
2252 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, expr);
2253 *expr_p = build2 (WITH_SIZE_EXPR, type, expr, size);
2256 /* Helper for gimplify_call_expr. Gimplify a single argument *ARG_P
2257 Store any side-effects in PRE_P. CALL_LOCATION is the location of
2260 static enum gimplify_status
2261 gimplify_arg (tree *arg_p, gimple_seq *pre_p, location_t call_location)
2263 bool (*test) (tree);
2266 /* In general, we allow lvalues for function arguments to avoid
2267 extra overhead of copying large aggregates out of even larger
2268 aggregates into temporaries only to copy the temporaries to
2269 the argument list. Make optimizers happy by pulling out to
2270 temporaries those types that fit in registers. */
2271 if (is_gimple_reg_type (TREE_TYPE (*arg_p)))
2272 test = is_gimple_val, fb = fb_rvalue;
2275 test = is_gimple_lvalue, fb = fb_either;
2276 /* Also strip a TARGET_EXPR that would force an extra copy. */
2277 if (TREE_CODE (*arg_p) == TARGET_EXPR)
2279 tree init = TARGET_EXPR_INITIAL (*arg_p);
2281 && !VOID_TYPE_P (TREE_TYPE (init)))
2286 /* If this is a variable sized type, we must remember the size. */
2287 maybe_with_size_expr (arg_p);
2289 /* FIXME diagnostics: This will mess up gcc.dg/Warray-bounds.c. */
2290 /* Make sure arguments have the same location as the function call
2292 protected_set_expr_location (*arg_p, call_location);
2294 /* There is a sequence point before a function call. Side effects in
2295 the argument list must occur before the actual call. So, when
2296 gimplifying arguments, force gimplify_expr to use an internal
2297 post queue which is then appended to the end of PRE_P. */
2298 return gimplify_expr (arg_p, pre_p, NULL, test, fb);
2301 /* Gimplify the CALL_EXPR node *EXPR_P into the GIMPLE sequence PRE_P.
2302 WANT_VALUE is true if the result of the call is desired. */
2304 static enum gimplify_status
2305 gimplify_call_expr (tree *expr_p, gimple_seq *pre_p, bool want_value)
2307 tree fndecl, parms, p, fnptrtype;
2308 enum gimplify_status ret;
2311 bool builtin_va_start_p = FALSE;
2312 location_t loc = EXPR_LOCATION (*expr_p);
2314 gcc_assert (TREE_CODE (*expr_p) == CALL_EXPR);
2316 /* For reliable diagnostics during inlining, it is necessary that
2317 every call_expr be annotated with file and line. */
2318 if (! EXPR_HAS_LOCATION (*expr_p))
2319 SET_EXPR_LOCATION (*expr_p, input_location);
2321 /* This may be a call to a builtin function.
2323 Builtin function calls may be transformed into different
2324 (and more efficient) builtin function calls under certain
2325 circumstances. Unfortunately, gimplification can muck things
2326 up enough that the builtin expanders are not aware that certain
2327 transformations are still valid.
2329 So we attempt transformation/gimplification of the call before
2330 we gimplify the CALL_EXPR. At this time we do not manage to
2331 transform all calls in the same manner as the expanders do, but
2332 we do transform most of them. */
2333 fndecl = get_callee_fndecl (*expr_p);
2334 if (fndecl && DECL_BUILT_IN (fndecl))
2336 tree new_tree = fold_call_expr (input_location, *expr_p, !want_value);
2338 if (new_tree && new_tree != *expr_p)
2340 /* There was a transformation of this call which computes the
2341 same value, but in a more efficient way. Return and try
2347 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
2348 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_VA_START)
2350 builtin_va_start_p = TRUE;
2351 if (call_expr_nargs (*expr_p) < 2)
2353 error ("too few arguments to function %<va_start%>");
2354 *expr_p = build_empty_stmt (EXPR_LOCATION (*expr_p));
2358 if (fold_builtin_next_arg (*expr_p, true))
2360 *expr_p = build_empty_stmt (EXPR_LOCATION (*expr_p));
2366 /* Remember the original function pointer type. */
2367 fnptrtype = TREE_TYPE (CALL_EXPR_FN (*expr_p));
2369 /* There is a sequence point before the call, so any side effects in
2370 the calling expression must occur before the actual call. Force
2371 gimplify_expr to use an internal post queue. */
2372 ret = gimplify_expr (&CALL_EXPR_FN (*expr_p), pre_p, NULL,
2373 is_gimple_call_addr, fb_rvalue);
2375 nargs = call_expr_nargs (*expr_p);
2377 /* Get argument types for verification. */
2378 fndecl = get_callee_fndecl (*expr_p);
2381 parms = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
2382 else if (POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_FN (*expr_p))))
2383 parms = TYPE_ARG_TYPES (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (*expr_p))));
2385 if (fndecl && DECL_ARGUMENTS (fndecl))
2386 p = DECL_ARGUMENTS (fndecl);
2391 for (i = 0; i < nargs && p; i++, p = TREE_CHAIN (p))
2394 /* If the last argument is __builtin_va_arg_pack () and it is not
2395 passed as a named argument, decrease the number of CALL_EXPR
2396 arguments and set instead the CALL_EXPR_VA_ARG_PACK flag. */
2399 && TREE_CODE (CALL_EXPR_ARG (*expr_p, nargs - 1)) == CALL_EXPR)
2401 tree last_arg = CALL_EXPR_ARG (*expr_p, nargs - 1);
2402 tree last_arg_fndecl = get_callee_fndecl (last_arg);
2405 && TREE_CODE (last_arg_fndecl) == FUNCTION_DECL
2406 && DECL_BUILT_IN_CLASS (last_arg_fndecl) == BUILT_IN_NORMAL
2407 && DECL_FUNCTION_CODE (last_arg_fndecl) == BUILT_IN_VA_ARG_PACK)
2409 tree call = *expr_p;
2412 *expr_p = build_call_array_loc (loc, TREE_TYPE (call),
2413 CALL_EXPR_FN (call),
2414 nargs, CALL_EXPR_ARGP (call));
2416 /* Copy all CALL_EXPR flags, location and block, except
2417 CALL_EXPR_VA_ARG_PACK flag. */
2418 CALL_EXPR_STATIC_CHAIN (*expr_p) = CALL_EXPR_STATIC_CHAIN (call);
2419 CALL_EXPR_TAILCALL (*expr_p) = CALL_EXPR_TAILCALL (call);
2420 CALL_EXPR_RETURN_SLOT_OPT (*expr_p)
2421 = CALL_EXPR_RETURN_SLOT_OPT (call);
2422 CALL_FROM_THUNK_P (*expr_p) = CALL_FROM_THUNK_P (call);
2423 CALL_CANNOT_INLINE_P (*expr_p) = CALL_CANNOT_INLINE_P (call);
2424 SET_EXPR_LOCATION (*expr_p, EXPR_LOCATION (call));
2425 TREE_BLOCK (*expr_p) = TREE_BLOCK (call);
2427 /* Set CALL_EXPR_VA_ARG_PACK. */
2428 CALL_EXPR_VA_ARG_PACK (*expr_p) = 1;
2432 /* Finally, gimplify the function arguments. */
2435 for (i = (PUSH_ARGS_REVERSED ? nargs - 1 : 0);
2436 PUSH_ARGS_REVERSED ? i >= 0 : i < nargs;
2437 PUSH_ARGS_REVERSED ? i-- : i++)
2439 enum gimplify_status t;
2441 /* Avoid gimplifying the second argument to va_start, which needs to
2442 be the plain PARM_DECL. */
2443 if ((i != 1) || !builtin_va_start_p)
2445 t = gimplify_arg (&CALL_EXPR_ARG (*expr_p, i), pre_p,
2446 EXPR_LOCATION (*expr_p));
2454 /* Verify the function result. */
2455 if (want_value && fndecl
2456 && VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fnptrtype))))
2458 error_at (loc, "using result of function returning %<void%>");
2462 /* Try this again in case gimplification exposed something. */
2463 if (ret != GS_ERROR)
2465 tree new_tree = fold_call_expr (input_location, *expr_p, !want_value);
2467 if (new_tree && new_tree != *expr_p)
2469 /* There was a transformation of this call which computes the
2470 same value, but in a more efficient way. Return and try
2478 *expr_p = error_mark_node;
2482 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2483 decl. This allows us to eliminate redundant or useless
2484 calls to "const" functions. */
2485 if (TREE_CODE (*expr_p) == CALL_EXPR)
2487 int flags = call_expr_flags (*expr_p);
2488 if (flags & (ECF_CONST | ECF_PURE)
2489 /* An infinite loop is considered a side effect. */
2490 && !(flags & (ECF_LOOPING_CONST_OR_PURE)))
2491 TREE_SIDE_EFFECTS (*expr_p) = 0;
2494 /* If the value is not needed by the caller, emit a new GIMPLE_CALL
2495 and clear *EXPR_P. Otherwise, leave *EXPR_P in its gimplified
2496 form and delegate the creation of a GIMPLE_CALL to
2497 gimplify_modify_expr. This is always possible because when
2498 WANT_VALUE is true, the caller wants the result of this call into
2499 a temporary, which means that we will emit an INIT_EXPR in
2500 internal_get_tmp_var which will then be handled by
2501 gimplify_modify_expr. */
2504 /* The CALL_EXPR in *EXPR_P is already in GIMPLE form, so all we
2505 have to do is replicate it as a GIMPLE_CALL tuple. */
2506 gimple_stmt_iterator gsi;
2507 call = gimple_build_call_from_tree (*expr_p);
2508 gimple_call_set_fntype (call, TREE_TYPE (fnptrtype));
2509 gimplify_seq_add_stmt (pre_p, call);
2510 gsi = gsi_last (*pre_p);
2512 *expr_p = NULL_TREE;
2515 /* Remember the original function type. */
2516 CALL_EXPR_FN (*expr_p) = build1 (NOP_EXPR, fnptrtype,
2517 CALL_EXPR_FN (*expr_p));
2522 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2523 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2525 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2526 condition is true or false, respectively. If null, we should generate
2527 our own to skip over the evaluation of this specific expression.
2529 LOCUS is the source location of the COND_EXPR.
2531 This function is the tree equivalent of do_jump.
2533 shortcut_cond_r should only be called by shortcut_cond_expr. */
2536 shortcut_cond_r (tree pred, tree *true_label_p, tree *false_label_p,
2539 tree local_label = NULL_TREE;
2540 tree t, expr = NULL;
2542 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2543 retain the shortcut semantics. Just insert the gotos here;
2544 shortcut_cond_expr will append the real blocks later. */
2545 if (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2547 location_t new_locus;
2549 /* Turn if (a && b) into
2551 if (a); else goto no;
2552 if (b) goto yes; else goto no;
2555 if (false_label_p == NULL)
2556 false_label_p = &local_label;
2558 /* Keep the original source location on the first 'if'. */
2559 t = shortcut_cond_r (TREE_OPERAND (pred, 0), NULL, false_label_p, locus);
2560 append_to_statement_list (t, &expr);
2562 /* Set the source location of the && on the second 'if'. */
2563 new_locus = EXPR_HAS_LOCATION (pred) ? EXPR_LOCATION (pred) : locus;
2564 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p, false_label_p,
2566 append_to_statement_list (t, &expr);
2568 else if (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2570 location_t new_locus;
2572 /* Turn if (a || b) into
2575 if (b) goto yes; else goto no;
2578 if (true_label_p == NULL)
2579 true_label_p = &local_label;
2581 /* Keep the original source location on the first 'if'. */
2582 t = shortcut_cond_r (TREE_OPERAND (pred, 0), true_label_p, NULL, locus);
2583 append_to_statement_list (t, &expr);
2585 /* Set the source location of the || on the second 'if'. */
2586 new_locus = EXPR_HAS_LOCATION (pred) ? EXPR_LOCATION (pred) : locus;
2587 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p, false_label_p,
2589 append_to_statement_list (t, &expr);
2591 else if (TREE_CODE (pred) == COND_EXPR
2592 && !VOID_TYPE_P (TREE_TYPE (TREE_OPERAND (pred, 1)))
2593 && !VOID_TYPE_P (TREE_TYPE (TREE_OPERAND (pred, 2))))
2595 location_t new_locus;
2597 /* As long as we're messing with gotos, turn if (a ? b : c) into
2599 if (b) goto yes; else goto no;
2601 if (c) goto yes; else goto no;
2603 Don't do this if one of the arms has void type, which can happen
2604 in C++ when the arm is throw. */
2606 /* Keep the original source location on the first 'if'. Set the source
2607 location of the ? on the second 'if'. */
2608 new_locus = EXPR_HAS_LOCATION (pred) ? EXPR_LOCATION (pred) : locus;
2609 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (pred, 0),
2610 shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2611 false_label_p, locus),
2612 shortcut_cond_r (TREE_OPERAND (pred, 2), true_label_p,
2613 false_label_p, new_locus));
2617 expr = build3 (COND_EXPR, void_type_node, pred,
2618 build_and_jump (true_label_p),
2619 build_and_jump (false_label_p));
2620 SET_EXPR_LOCATION (expr, locus);
2625 t = build1 (LABEL_EXPR, void_type_node, local_label);
2626 append_to_statement_list (t, &expr);
2632 /* Given a conditional expression EXPR with short-circuit boolean
2633 predicates using TRUTH_ANDIF_EXPR or TRUTH_ORIF_EXPR, break the
2634 predicate appart into the equivalent sequence of conditionals. */
2637 shortcut_cond_expr (tree expr)
2639 tree pred = TREE_OPERAND (expr, 0);
2640 tree then_ = TREE_OPERAND (expr, 1);
2641 tree else_ = TREE_OPERAND (expr, 2);
2642 tree true_label, false_label, end_label, t;
2644 tree *false_label_p;
2645 bool emit_end, emit_false, jump_over_else;
2646 bool then_se = then_ && TREE_SIDE_EFFECTS (then_);
2647 bool else_se = else_ && TREE_SIDE_EFFECTS (else_);
2649 /* First do simple transformations. */
2652 /* If there is no 'else', turn
2655 if (a) if (b) then c. */
2656 while (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2658 /* Keep the original source location on the first 'if'. */
2659 location_t locus = EXPR_LOC_OR_HERE (expr);
2660 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2661 /* Set the source location of the && on the second 'if'. */
2662 if (EXPR_HAS_LOCATION (pred))
2663 SET_EXPR_LOCATION (expr, EXPR_LOCATION (pred));
2664 then_ = shortcut_cond_expr (expr);
2665 then_se = then_ && TREE_SIDE_EFFECTS (then_);
2666 pred = TREE_OPERAND (pred, 0);
2667 expr = build3 (COND_EXPR, void_type_node, pred, then_, NULL_TREE);
2668 SET_EXPR_LOCATION (expr, locus);
2674 /* If there is no 'then', turn
2677 if (a); else if (b); else d. */
2678 while (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2680 /* Keep the original source location on the first 'if'. */
2681 location_t locus = EXPR_LOC_OR_HERE (expr);
2682 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2683 /* Set the source location of the || on the second 'if'. */
2684 if (EXPR_HAS_LOCATION (pred))
2685 SET_EXPR_LOCATION (expr, EXPR_LOCATION (pred));
2686 else_ = shortcut_cond_expr (expr);
2687 else_se = else_ && TREE_SIDE_EFFECTS (else_);
2688 pred = TREE_OPERAND (pred, 0);
2689 expr = build3 (COND_EXPR, void_type_node, pred, NULL_TREE, else_);
2690 SET_EXPR_LOCATION (expr, locus);
2694 /* If we're done, great. */
2695 if (TREE_CODE (pred) != TRUTH_ANDIF_EXPR
2696 && TREE_CODE (pred) != TRUTH_ORIF_EXPR)
2699 /* Otherwise we need to mess with gotos. Change
2702 if (a); else goto no;
2705 and recursively gimplify the condition. */
2707 true_label = false_label = end_label = NULL_TREE;
2709 /* If our arms just jump somewhere, hijack those labels so we don't
2710 generate jumps to jumps. */
2713 && TREE_CODE (then_) == GOTO_EXPR
2714 && TREE_CODE (GOTO_DESTINATION (then_)) == LABEL_DECL)
2716 true_label = GOTO_DESTINATION (then_);
2722 && TREE_CODE (else_) == GOTO_EXPR
2723 && TREE_CODE (GOTO_DESTINATION (else_)) == LABEL_DECL)
2725 false_label = GOTO_DESTINATION (else_);
2730 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2732 true_label_p = &true_label;
2734 true_label_p = NULL;
2736 /* The 'else' branch also needs a label if it contains interesting code. */
2737 if (false_label || else_se)
2738 false_label_p = &false_label;
2740 false_label_p = NULL;
2742 /* If there was nothing else in our arms, just forward the label(s). */
2743 if (!then_se && !else_se)
2744 return shortcut_cond_r (pred, true_label_p, false_label_p,
2745 EXPR_LOC_OR_HERE (expr));
2747 /* If our last subexpression already has a terminal label, reuse it. */
2749 t = expr_last (else_);
2751 t = expr_last (then_);
2754 if (t && TREE_CODE (t) == LABEL_EXPR)
2755 end_label = LABEL_EXPR_LABEL (t);
2757 /* If we don't care about jumping to the 'else' branch, jump to the end
2758 if the condition is false. */
2760 false_label_p = &end_label;
2762 /* We only want to emit these labels if we aren't hijacking them. */
2763 emit_end = (end_label == NULL_TREE);
2764 emit_false = (false_label == NULL_TREE);
2766 /* We only emit the jump over the else clause if we have to--if the
2767 then clause may fall through. Otherwise we can wind up with a
2768 useless jump and a useless label at the end of gimplified code,
2769 which will cause us to think that this conditional as a whole
2770 falls through even if it doesn't. If we then inline a function
2771 which ends with such a condition, that can cause us to issue an
2772 inappropriate warning about control reaching the end of a
2773 non-void function. */
2774 jump_over_else = block_may_fallthru (then_);
2776 pred = shortcut_cond_r (pred, true_label_p, false_label_p,
2777 EXPR_LOC_OR_HERE (expr));
2780 append_to_statement_list (pred, &expr);
2782 append_to_statement_list (then_, &expr);
2787 tree last = expr_last (expr);
2788 t = build_and_jump (&end_label);
2789 if (EXPR_HAS_LOCATION (last))
2790 SET_EXPR_LOCATION (t, EXPR_LOCATION (last));
2791 append_to_statement_list (t, &expr);
2795 t = build1 (LABEL_EXPR, void_type_node, false_label);
2796 append_to_statement_list (t, &expr);
2798 append_to_statement_list (else_, &expr);
2800 if (emit_end && end_label)
2802 t = build1 (LABEL_EXPR, void_type_node, end_label);
2803 append_to_statement_list (t, &expr);
2809 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2812 gimple_boolify (tree expr)
2814 tree type = TREE_TYPE (expr);
2815 location_t loc = EXPR_LOCATION (expr);
2817 if (TREE_CODE (expr) == NE_EXPR
2818 && TREE_CODE (TREE_OPERAND (expr, 0)) == CALL_EXPR
2819 && integer_zerop (TREE_OPERAND (expr, 1)))
2821 tree call = TREE_OPERAND (expr, 0);
2822 tree fn = get_callee_fndecl (call);
2824 /* For __builtin_expect ((long) (x), y) recurse into x as well
2825 if x is truth_value_p. */
2827 && DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2828 && DECL_FUNCTION_CODE (fn) == BUILT_IN_EXPECT
2829 && call_expr_nargs (call) == 2)
2831 tree arg = CALL_EXPR_ARG (call, 0);
2834 if (TREE_CODE (arg) == NOP_EXPR
2835 && TREE_TYPE (arg) == TREE_TYPE (call))
2836 arg = TREE_OPERAND (arg, 0);
2837 if (truth_value_p (TREE_CODE (arg)))
2839 arg = gimple_boolify (arg);
2840 CALL_EXPR_ARG (call, 0)
2841 = fold_convert_loc (loc, TREE_TYPE (call), arg);
2847 switch (TREE_CODE (expr))
2849 case TRUTH_AND_EXPR:
2851 case TRUTH_XOR_EXPR:
2852 case TRUTH_ANDIF_EXPR:
2853 case TRUTH_ORIF_EXPR:
2854 /* Also boolify the arguments of truth exprs. */
2855 TREE_OPERAND (expr, 1) = gimple_boolify (TREE_OPERAND (expr, 1));
2858 case TRUTH_NOT_EXPR:
2859 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2861 /* These expressions always produce boolean results. */
2862 if (TREE_CODE (type) != BOOLEAN_TYPE)
2863 TREE_TYPE (expr) = boolean_type_node;
2867 if (COMPARISON_CLASS_P (expr))
2869 /* There expressions always prduce boolean results. */
2870 if (TREE_CODE (type) != BOOLEAN_TYPE)
2871 TREE_TYPE (expr) = boolean_type_node;
2874 /* Other expressions that get here must have boolean values, but
2875 might need to be converted to the appropriate mode. */
2876 if (TREE_CODE (type) == BOOLEAN_TYPE)
2878 return fold_convert_loc (loc, boolean_type_node, expr);
2882 /* Given a conditional expression *EXPR_P without side effects, gimplify
2883 its operands. New statements are inserted to PRE_P. */
2885 static enum gimplify_status
2886 gimplify_pure_cond_expr (tree *expr_p, gimple_seq *pre_p)
2888 tree expr = *expr_p, cond;
2889 enum gimplify_status ret, tret;
2890 enum tree_code code;
2892 cond = gimple_boolify (COND_EXPR_COND (expr));
2894 /* We need to handle && and || specially, as their gimplification
2895 creates pure cond_expr, thus leading to an infinite cycle otherwise. */
2896 code = TREE_CODE (cond);
2897 if (code == TRUTH_ANDIF_EXPR)
2898 TREE_SET_CODE (cond, TRUTH_AND_EXPR);
2899 else if (code == TRUTH_ORIF_EXPR)
2900 TREE_SET_CODE (cond, TRUTH_OR_EXPR);
2901 ret = gimplify_expr (&cond, pre_p, NULL, is_gimple_condexpr, fb_rvalue);
2902 COND_EXPR_COND (*expr_p) = cond;
2904 tret = gimplify_expr (&COND_EXPR_THEN (expr), pre_p, NULL,
2905 is_gimple_val, fb_rvalue);
2906 ret = MIN (ret, tret);
2907 tret = gimplify_expr (&COND_EXPR_ELSE (expr), pre_p, NULL,
2908 is_gimple_val, fb_rvalue);
2910 return MIN (ret, tret);
2913 /* Return true if evaluating EXPR could trap.
2914 EXPR is GENERIC, while tree_could_trap_p can be called
2918 generic_expr_could_trap_p (tree expr)
2922 if (!expr || is_gimple_val (expr))
2925 if (!EXPR_P (expr) || tree_could_trap_p (expr))
2928 n = TREE_OPERAND_LENGTH (expr);
2929 for (i = 0; i < n; i++)
2930 if (generic_expr_could_trap_p (TREE_OPERAND (expr, i)))
2936 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2945 The second form is used when *EXPR_P is of type void.
2947 PRE_P points to the list where side effects that must happen before
2948 *EXPR_P should be stored. */
2950 static enum gimplify_status
2951 gimplify_cond_expr (tree *expr_p, gimple_seq *pre_p, fallback_t fallback)
2953 tree expr = *expr_p;
2954 tree type = TREE_TYPE (expr);
2955 location_t loc = EXPR_LOCATION (expr);
2956 tree tmp, arm1, arm2;
2957 enum gimplify_status ret;
2958 tree label_true, label_false, label_cont;
2959 bool have_then_clause_p, have_else_clause_p;
2961 enum tree_code pred_code;
2962 gimple_seq seq = NULL;
2964 /* If this COND_EXPR has a value, copy the values into a temporary within
2966 if (!VOID_TYPE_P (type))
2968 tree then_ = TREE_OPERAND (expr, 1), else_ = TREE_OPERAND (expr, 2);
2971 /* If either an rvalue is ok or we do not require an lvalue, create the
2972 temporary. But we cannot do that if the type is addressable. */
2973 if (((fallback & fb_rvalue) || !(fallback & fb_lvalue))
2974 && !TREE_ADDRESSABLE (type))
2976 if (gimplify_ctxp->allow_rhs_cond_expr
2977 /* If either branch has side effects or could trap, it can't be
2978 evaluated unconditionally. */
2979 && !TREE_SIDE_EFFECTS (then_)
2980 && !generic_expr_could_trap_p (then_)
2981 && !TREE_SIDE_EFFECTS (else_)
2982 && !generic_expr_could_trap_p (else_))
2983 return gimplify_pure_cond_expr (expr_p, pre_p);
2985 tmp = create_tmp_var (type, "iftmp");
2989 /* Otherwise, only create and copy references to the values. */
2992 type = build_pointer_type (type);
2994 if (!VOID_TYPE_P (TREE_TYPE (then_)))
2995 then_ = build_fold_addr_expr_loc (loc, then_);
2997 if (!VOID_TYPE_P (TREE_TYPE (else_)))
2998 else_ = build_fold_addr_expr_loc (loc, else_);
3001 = build3 (COND_EXPR, type, TREE_OPERAND (expr, 0), then_, else_);
3003 tmp = create_tmp_var (type, "iftmp");
3004 result = build_simple_mem_ref_loc (loc, tmp);
3007 /* Build the new then clause, `tmp = then_;'. But don't build the
3008 assignment if the value is void; in C++ it can be if it's a throw. */
3009 if (!VOID_TYPE_P (TREE_TYPE (then_)))
3010 TREE_OPERAND (expr, 1) = build2 (MODIFY_EXPR, type, tmp, then_);
3012 /* Similarly, build the new else clause, `tmp = else_;'. */
3013 if (!VOID_TYPE_P (TREE_TYPE (else_)))
3014 TREE_OPERAND (expr, 2) = build2 (MODIFY_EXPR, type, tmp, else_);
3016 TREE_TYPE (expr) = void_type_node;
3017 recalculate_side_effects (expr);
3019 /* Move the COND_EXPR to the prequeue. */
3020 gimplify_stmt (&expr, pre_p);
3026 /* Remove any COMPOUND_EXPR so the following cases will be caught. */
3027 STRIP_TYPE_NOPS (TREE_OPERAND (expr, 0));
3028 if (TREE_CODE (TREE_OPERAND (expr, 0)) == COMPOUND_EXPR)
3029 gimplify_compound_expr (&TREE_OPERAND (expr, 0), pre_p, true);
3031 /* Make sure the condition has BOOLEAN_TYPE. */
3032 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
3034 /* Break apart && and || conditions. */
3035 if (TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ANDIF_EXPR
3036 || TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ORIF_EXPR)
3038 expr = shortcut_cond_expr (expr);
3040 if (expr != *expr_p)
3044 /* We can't rely on gimplify_expr to re-gimplify the expanded
3045 form properly, as cleanups might cause the target labels to be
3046 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
3047 set up a conditional context. */
3048 gimple_push_condition ();
3049 gimplify_stmt (expr_p, &seq);
3050 gimple_pop_condition (pre_p);
3051 gimple_seq_add_seq (pre_p, seq);
3057 /* Now do the normal gimplification. */
3059 /* Gimplify condition. */
3060 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL, is_gimple_condexpr,
3062 if (ret == GS_ERROR)
3064 gcc_assert (TREE_OPERAND (expr, 0) != NULL_TREE);
3066 gimple_push_condition ();
3068 have_then_clause_p = have_else_clause_p = false;
3069 if (TREE_OPERAND (expr, 1) != NULL
3070 && TREE_CODE (TREE_OPERAND (expr, 1)) == GOTO_EXPR
3071 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr, 1))) == LABEL_DECL
3072 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr, 1)))
3073 == current_function_decl)
3074 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
3075 have different locations, otherwise we end up with incorrect
3076 location information on the branches. */
3078 || !EXPR_HAS_LOCATION (expr)
3079 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr, 1))
3080 || EXPR_LOCATION (expr) == EXPR_LOCATION (TREE_OPERAND (expr, 1))))
3082 label_true = GOTO_DESTINATION (TREE_OPERAND (expr, 1));
3083 have_then_clause_p = true;
3086 label_true = create_artificial_label (UNKNOWN_LOCATION);
3087 if (TREE_OPERAND (expr, 2) != NULL
3088 && TREE_CODE (TREE_OPERAND (expr, 2)) == GOTO_EXPR
3089 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr, 2))) == LABEL_DECL
3090 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr, 2)))
3091 == current_function_decl)
3092 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
3093 have different locations, otherwise we end up with incorrect
3094 location information on the branches. */
3096 || !EXPR_HAS_LOCATION (expr)
3097 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr, 2))
3098 || EXPR_LOCATION (expr) == EXPR_LOCATION (TREE_OPERAND (expr, 2))))
3100 label_false = GOTO_DESTINATION (TREE_OPERAND (expr, 2));
3101 have_else_clause_p = true;
3104 label_false = create_artificial_label (UNKNOWN_LOCATION);
3106 gimple_cond_get_ops_from_tree (COND_EXPR_COND (expr), &pred_code, &arm1,
3109 gimple_cond = gimple_build_cond (pred_code, arm1, arm2, label_true,
3112 gimplify_seq_add_stmt (&seq, gimple_cond);
3113 label_cont = NULL_TREE;
3114 if (!have_then_clause_p)
3116 /* For if (...) {} else { code; } put label_true after
3118 if (TREE_OPERAND (expr, 1) == NULL_TREE
3119 && !have_else_clause_p
3120 && TREE_OPERAND (expr, 2) != NULL_TREE)
3121 label_cont = label_true;
3124 gimplify_seq_add_stmt (&seq, gimple_build_label (label_true));
3125 have_then_clause_p = gimplify_stmt (&TREE_OPERAND (expr, 1), &seq);
3126 /* For if (...) { code; } else {} or
3127 if (...) { code; } else goto label; or
3128 if (...) { code; return; } else { ... }
3129 label_cont isn't needed. */
3130 if (!have_else_clause_p
3131 && TREE_OPERAND (expr, 2) != NULL_TREE
3132 && gimple_seq_may_fallthru (seq))
3135 label_cont = create_artificial_label (UNKNOWN_LOCATION);
3137 g = gimple_build_goto (label_cont);
3139 /* GIMPLE_COND's are very low level; they have embedded
3140 gotos. This particular embedded goto should not be marked
3141 with the location of the original COND_EXPR, as it would
3142 correspond to the COND_EXPR's condition, not the ELSE or the
3143 THEN arms. To avoid marking it with the wrong location, flag
3144 it as "no location". */
3145 gimple_set_do_not_emit_location (g);
3147 gimplify_seq_add_stmt (&seq, g);
3151 if (!have_else_clause_p)
3153 gimplify_seq_add_stmt (&seq, gimple_build_label (label_false));
3154 have_else_clause_p = gimplify_stmt (&TREE_OPERAND (expr, 2), &seq);
3157 gimplify_seq_add_stmt (&seq, gimple_build_label (label_cont));
3159 gimple_pop_condition (pre_p);
3160 gimple_seq_add_seq (pre_p, seq);
3162 if (ret == GS_ERROR)
3164 else if (have_then_clause_p || have_else_clause_p)
3168 /* Both arms are empty; replace the COND_EXPR with its predicate. */
3169 expr = TREE_OPERAND (expr, 0);
3170 gimplify_stmt (&expr, pre_p);
3177 /* Prepare the node pointed to by EXPR_P, an is_gimple_addressable expression,
3178 to be marked addressable.
3180 We cannot rely on such an expression being directly markable if a temporary
3181 has been created by the gimplification. In this case, we create another
3182 temporary and initialize it with a copy, which will become a store after we
3183 mark it addressable. This can happen if the front-end passed us something
3184 that it could not mark addressable yet, like a Fortran pass-by-reference
3185 parameter (int) floatvar. */
3188 prepare_gimple_addressable (tree *expr_p, gimple_seq *seq_p)
3190 while (handled_component_p (*expr_p))
3191 expr_p = &TREE_OPERAND (*expr_p, 0);
3192 if (is_gimple_reg (*expr_p))
3193 *expr_p = get_initialized_tmp_var (*expr_p, seq_p, NULL);
3196 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3197 a call to __builtin_memcpy. */
3199 static enum gimplify_status
3200 gimplify_modify_expr_to_memcpy (tree *expr_p, tree size, bool want_value,
3203 tree t, to, to_ptr, from, from_ptr;
3205 location_t loc = EXPR_LOCATION (*expr_p);
3207 to = TREE_OPERAND (*expr_p, 0);
3208 from = TREE_OPERAND (*expr_p, 1);
3210 /* Mark the RHS addressable. Beware that it may not be possible to do so
3211 directly if a temporary has been created by the gimplification. */
3212 prepare_gimple_addressable (&from, seq_p);
3214 mark_addressable (from);
3215 from_ptr = build_fold_addr_expr_loc (loc, from);
3216 gimplify_arg (&from_ptr, seq_p, loc);
3218 mark_addressable (to);
3219 to_ptr = build_fold_addr_expr_loc (loc, to);
3220 gimplify_arg (&to_ptr, seq_p, loc);
3222 t = builtin_decl_implicit (BUILT_IN_MEMCPY);
3224 gs = gimple_build_call (t, 3, to_ptr, from_ptr, size);
3228 /* tmp = memcpy() */
3229 t = create_tmp_var (TREE_TYPE (to_ptr), NULL);
3230 gimple_call_set_lhs (gs, t);
3231 gimplify_seq_add_stmt (seq_p, gs);
3233 *expr_p = build_simple_mem_ref (t);
3237 gimplify_seq_add_stmt (seq_p, gs);
3242 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3243 a call to __builtin_memset. In this case we know that the RHS is
3244 a CONSTRUCTOR with an empty element list. */
3246 static enum gimplify_status
3247 gimplify_modify_expr_to_memset (tree *expr_p, tree size, bool want_value,
3250 tree t, from, to, to_ptr;
3252 location_t loc = EXPR_LOCATION (*expr_p);
3254 /* Assert our assumptions, to abort instead of producing wrong code
3255 silently if they are not met. Beware that the RHS CONSTRUCTOR might
3256 not be immediately exposed. */
3257 from = TREE_OPERAND (*expr_p, 1);
3258 if (TREE_CODE (from) == WITH_SIZE_EXPR)
3259 from = TREE_OPERAND (from, 0);
3261 gcc_assert (TREE_CODE (from) == CONSTRUCTOR
3262 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (from)));
3265 to = TREE_OPERAND (*expr_p, 0);
3267 to_ptr = build_fold_addr_expr_loc (loc, to);
3268 gimplify_arg (&to_ptr, seq_p, loc);
3269 t = builtin_decl_implicit (BUILT_IN_MEMSET);
3271 gs = gimple_build_call (t, 3, to_ptr, integer_zero_node, size);
3275 /* tmp = memset() */
3276 t = create_tmp_var (TREE_TYPE (to_ptr), NULL);
3277 gimple_call_set_lhs (gs, t);
3278 gimplify_seq_add_stmt (seq_p, gs);
3280 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (to), t);
3284 gimplify_seq_add_stmt (seq_p, gs);
3289 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
3290 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
3291 assignment. Return non-null if we detect a potential overlap. */
3293 struct gimplify_init_ctor_preeval_data
3295 /* The base decl of the lhs object. May be NULL, in which case we
3296 have to assume the lhs is indirect. */
3299 /* The alias set of the lhs object. */
3300 alias_set_type lhs_alias_set;
3304 gimplify_init_ctor_preeval_1 (tree *tp, int *walk_subtrees, void *xdata)
3306 struct gimplify_init_ctor_preeval_data *data
3307 = (struct gimplify_init_ctor_preeval_data *) xdata;
3310 /* If we find the base object, obviously we have overlap. */
3311 if (data->lhs_base_decl == t)
3314 /* If the constructor component is indirect, determine if we have a
3315 potential overlap with the lhs. The only bits of information we
3316 have to go on at this point are addressability and alias sets. */
3317 if ((INDIRECT_REF_P (t)
3318 || TREE_CODE (t) == MEM_REF)
3319 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
3320 && alias_sets_conflict_p (data->lhs_alias_set, get_alias_set (t)))
3323 /* If the constructor component is a call, determine if it can hide a
3324 potential overlap with the lhs through an INDIRECT_REF like above.
3325 ??? Ugh - this is completely broken. In fact this whole analysis
3326 doesn't look conservative. */
3327 if (TREE_CODE (t) == CALL_EXPR)
3329 tree type, fntype = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (t)));
3331 for (type = TYPE_ARG_TYPES (fntype); type; type = TREE_CHAIN (type))
3332 if (POINTER_TYPE_P (TREE_VALUE (type))
3333 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
3334 && alias_sets_conflict_p (data->lhs_alias_set,
3336 (TREE_TYPE (TREE_VALUE (type)))))
3340 if (IS_TYPE_OR_DECL_P (t))
3345 /* A subroutine of gimplify_init_constructor. Pre-evaluate EXPR,
3346 force values that overlap with the lhs (as described by *DATA)
3347 into temporaries. */
3350 gimplify_init_ctor_preeval (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
3351 struct gimplify_init_ctor_preeval_data *data)
3353 enum gimplify_status one;
3355 /* If the value is constant, then there's nothing to pre-evaluate. */
3356 if (TREE_CONSTANT (*expr_p))
3358 /* Ensure it does not have side effects, it might contain a reference to
3359 the object we're initializing. */
3360 gcc_assert (!TREE_SIDE_EFFECTS (*expr_p));
3364 /* If the type has non-trivial constructors, we can't pre-evaluate. */
3365 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p)))
3368 /* Recurse for nested constructors. */
3369 if (TREE_CODE (*expr_p) == CONSTRUCTOR)
3371 unsigned HOST_WIDE_INT ix;
3372 constructor_elt *ce;
3373 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (*expr_p);
3375 FOR_EACH_VEC_ELT (constructor_elt, v, ix, ce)
3376 gimplify_init_ctor_preeval (&ce->value, pre_p, post_p, data);
3381 /* If this is a variable sized type, we must remember the size. */
3382 maybe_with_size_expr (expr_p);
3384 /* Gimplify the constructor element to something appropriate for the rhs
3385 of a MODIFY_EXPR. Given that we know the LHS is an aggregate, we know
3386 the gimplifier will consider this a store to memory. Doing this
3387 gimplification now means that we won't have to deal with complicated
3388 language-specific trees, nor trees like SAVE_EXPR that can induce
3389 exponential search behavior. */
3390 one = gimplify_expr (expr_p, pre_p, post_p, is_gimple_mem_rhs, fb_rvalue);
3391 if (one == GS_ERROR)
3397 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
3398 with the lhs, since "a = { .x=a }" doesn't make sense. This will
3399 always be true for all scalars, since is_gimple_mem_rhs insists on a
3400 temporary variable for them. */
3401 if (DECL_P (*expr_p))
3404 /* If this is of variable size, we have no choice but to assume it doesn't
3405 overlap since we can't make a temporary for it. */
3406 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (*expr_p))) != INTEGER_CST)
3409 /* Otherwise, we must search for overlap ... */
3410 if (!walk_tree (expr_p, gimplify_init_ctor_preeval_1, data, NULL))
3413 /* ... and if found, force the value into a temporary. */
3414 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
3417 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
3418 a RANGE_EXPR in a CONSTRUCTOR for an array.
3422 object[var] = value;
3429 We increment var _after_ the loop exit check because we might otherwise
3430 fail if upper == TYPE_MAX_VALUE (type for upper).
3432 Note that we never have to deal with SAVE_EXPRs here, because this has
3433 already been taken care of for us, in gimplify_init_ctor_preeval(). */
3435 static void gimplify_init_ctor_eval (tree, VEC(constructor_elt,gc) *,
3436 gimple_seq *, bool);
3439 gimplify_init_ctor_eval_range (tree object, tree lower, tree upper,
3440 tree value, tree array_elt_type,
3441 gimple_seq *pre_p, bool cleared)
3443 tree loop_entry_label, loop_exit_label, fall_thru_label;
3444 tree var, var_type, cref, tmp;
3446 loop_entry_label = create_artificial_label (UNKNOWN_LOCATION);
3447 loop_exit_label = create_artificial_label (UNKNOWN_LOCATION);
3448 fall_thru_label = create_artificial_label (UNKNOWN_LOCATION);
3450 /* Create and initialize the index variable. */
3451 var_type = TREE_TYPE (upper);
3452 var = create_tmp_var (var_type, NULL);
3453 gimplify_seq_add_stmt (pre_p, gimple_build_assign (var, lower));
3455 /* Add the loop entry label. */
3456 gimplify_seq_add_stmt (pre_p, gimple_build_label (loop_entry_label));
3458 /* Build the reference. */
3459 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
3460 var, NULL_TREE, NULL_TREE);
3462 /* If we are a constructor, just call gimplify_init_ctor_eval to do
3463 the store. Otherwise just assign value to the reference. */
3465 if (TREE_CODE (value) == CONSTRUCTOR)
3466 /* NB we might have to call ourself recursively through
3467 gimplify_init_ctor_eval if the value is a constructor. */
3468 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
3471 gimplify_seq_add_stmt (pre_p, gimple_build_assign (cref, value));
3473 /* We exit the loop when the index var is equal to the upper bound. */
3474 gimplify_seq_add_stmt (pre_p,
3475 gimple_build_cond (EQ_EXPR, var, upper,
3476 loop_exit_label, fall_thru_label));
3478 gimplify_seq_add_stmt (pre_p, gimple_build_label (fall_thru_label));
3480 /* Otherwise, increment the index var... */
3481 tmp = build2 (PLUS_EXPR, var_type, var,
3482 fold_convert (var_type, integer_one_node));
3483 gimplify_seq_add_stmt (pre_p, gimple_build_assign (var, tmp));
3485 /* ...and jump back to the loop entry. */
3486 gimplify_seq_add_stmt (pre_p, gimple_build_goto (loop_entry_label));
3488 /* Add the loop exit label. */
3489 gimplify_seq_add_stmt (pre_p, gimple_build_label (loop_exit_label));
3492 /* Return true if FDECL is accessing a field that is zero sized. */
3495 zero_sized_field_decl (const_tree fdecl)
3497 if (TREE_CODE (fdecl) == FIELD_DECL && DECL_SIZE (fdecl)
3498 && integer_zerop (DECL_SIZE (fdecl)))
3503 /* Return true if TYPE is zero sized. */
3506 zero_sized_type (const_tree type)
3508 if (AGGREGATE_TYPE_P (type) && TYPE_SIZE (type)
3509 && integer_zerop (TYPE_SIZE (type)))
3514 /* A subroutine of gimplify_init_constructor. Generate individual
3515 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
3516 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
3517 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
3521 gimplify_init_ctor_eval (tree object, VEC(constructor_elt,gc) *elts,
3522 gimple_seq *pre_p, bool cleared)
3524 tree array_elt_type = NULL;
3525 unsigned HOST_WIDE_INT ix;
3526 tree purpose, value;
3528 if (TREE_CODE (TREE_TYPE (object)) == ARRAY_TYPE)
3529 array_elt_type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object)));
3531 FOR_EACH_CONSTRUCTOR_ELT (elts, ix, purpose, value)
3535 /* NULL values are created above for gimplification errors. */
3539 if (cleared && initializer_zerop (value))
3542 /* ??? Here's to hoping the front end fills in all of the indices,
3543 so we don't have to figure out what's missing ourselves. */
3544 gcc_assert (purpose);
3546 /* Skip zero-sized fields, unless value has side-effects. This can
3547 happen with calls to functions returning a zero-sized type, which
3548 we shouldn't discard. As a number of downstream passes don't
3549 expect sets of zero-sized fields, we rely on the gimplification of
3550 the MODIFY_EXPR we make below to drop the assignment statement. */
3551 if (! TREE_SIDE_EFFECTS (value) && zero_sized_field_decl (purpose))
3554 /* If we have a RANGE_EXPR, we have to build a loop to assign the
3556 if (TREE_CODE (purpose) == RANGE_EXPR)
3558 tree lower = TREE_OPERAND (purpose, 0);
3559 tree upper = TREE_OPERAND (purpose, 1);
3561 /* If the lower bound is equal to upper, just treat it as if
3562 upper was the index. */
3563 if (simple_cst_equal (lower, upper))
3567 gimplify_init_ctor_eval_range (object, lower, upper, value,
3568 array_elt_type, pre_p, cleared);
3575 /* Do not use bitsizetype for ARRAY_REF indices. */
3576 if (TYPE_DOMAIN (TREE_TYPE (object)))
3578 = fold_convert (TREE_TYPE (TYPE_DOMAIN (TREE_TYPE (object))),
3580 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
3581 purpose, NULL_TREE, NULL_TREE);
3585 gcc_assert (TREE_CODE (purpose) == FIELD_DECL);
3586 cref = build3 (COMPONENT_REF, TREE_TYPE (purpose),
3587 unshare_expr (object), purpose, NULL_TREE);
3590 if (TREE_CODE (value) == CONSTRUCTOR
3591 && TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE)
3592 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
3596 tree init = build2 (INIT_EXPR, TREE_TYPE (cref), cref, value);
3597 gimplify_and_add (init, pre_p);
3603 /* Return the appropriate RHS predicate for this LHS. */
3606 rhs_predicate_for (tree lhs)
3608 if (is_gimple_reg (lhs))
3609 return is_gimple_reg_rhs_or_call;
3611 return is_gimple_mem_rhs_or_call;
3614 /* Gimplify a C99 compound literal expression. This just means adding
3615 the DECL_EXPR before the current statement and using its anonymous
3618 static enum gimplify_status
3619 gimplify_compound_literal_expr (tree *expr_p, gimple_seq *pre_p)
3621 tree decl_s = COMPOUND_LITERAL_EXPR_DECL_EXPR (*expr_p);
3622 tree decl = DECL_EXPR_DECL (decl_s);
3623 /* Mark the decl as addressable if the compound literal
3624 expression is addressable now, otherwise it is marked too late
3625 after we gimplify the initialization expression. */
3626 if (TREE_ADDRESSABLE (*expr_p))
3627 TREE_ADDRESSABLE (decl) = 1;
3629 /* Preliminarily mark non-addressed complex variables as eligible
3630 for promotion to gimple registers. We'll transform their uses
3632 if ((TREE_CODE (TREE_TYPE (decl)) == COMPLEX_TYPE
3633 || TREE_CODE (TREE_TYPE (decl)) == VECTOR_TYPE)
3634 && !TREE_THIS_VOLATILE (decl)
3635 && !needs_to_live_in_memory (decl))
3636 DECL_GIMPLE_REG_P (decl) = 1;
3638 /* This decl isn't mentioned in the enclosing block, so add it to the
3639 list of temps. FIXME it seems a bit of a kludge to say that
3640 anonymous artificial vars aren't pushed, but everything else is. */
3641 if (DECL_NAME (decl) == NULL_TREE && !DECL_SEEN_IN_BIND_EXPR_P (decl))
3642 gimple_add_tmp_var (decl);
3644 gimplify_and_add (decl_s, pre_p);
3649 /* Optimize embedded COMPOUND_LITERAL_EXPRs within a CONSTRUCTOR,
3650 return a new CONSTRUCTOR if something changed. */
3653 optimize_compound_literals_in_ctor (tree orig_ctor)
3655 tree ctor = orig_ctor;
3656 VEC(constructor_elt,gc) *elts = CONSTRUCTOR_ELTS (ctor);
3657 unsigned int idx, num = VEC_length (constructor_elt, elts);
3659 for (idx = 0; idx < num; idx++)
3661 tree value = VEC_index (constructor_elt, elts, idx)->value;
3662 tree newval = value;
3663 if (TREE_CODE (value) == CONSTRUCTOR)
3664 newval = optimize_compound_literals_in_ctor (value);
3665 else if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
3667 tree decl_s = COMPOUND_LITERAL_EXPR_DECL_EXPR (value);
3668 tree decl = DECL_EXPR_DECL (decl_s);
3669 tree init = DECL_INITIAL (decl);
3671 if (!TREE_ADDRESSABLE (value)
3672 && !TREE_ADDRESSABLE (decl)
3674 newval = optimize_compound_literals_in_ctor (init);
3676 if (newval == value)
3679 if (ctor == orig_ctor)
3681 ctor = copy_node (orig_ctor);
3682 CONSTRUCTOR_ELTS (ctor) = VEC_copy (constructor_elt, gc, elts);
3683 elts = CONSTRUCTOR_ELTS (ctor);
3685 VEC_index (constructor_elt, elts, idx)->value = newval;
3690 /* A subroutine of gimplify_modify_expr. Break out elements of a
3691 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
3693 Note that we still need to clear any elements that don't have explicit
3694 initializers, so if not all elements are initialized we keep the
3695 original MODIFY_EXPR, we just remove all of the constructor elements.
3697 If NOTIFY_TEMP_CREATION is true, do not gimplify, just return
3698 GS_ERROR if we would have to create a temporary when gimplifying
3699 this constructor. Otherwise, return GS_OK.
3701 If NOTIFY_TEMP_CREATION is false, just do the gimplification. */
3703 static enum gimplify_status
3704 gimplify_init_constructor (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
3705 bool want_value, bool notify_temp_creation)
3707 tree object, ctor, type;
3708 enum gimplify_status ret;
3709 VEC(constructor_elt,gc) *elts;
3711 gcc_assert (TREE_CODE (TREE_OPERAND (*expr_p, 1)) == CONSTRUCTOR);
3713 if (!notify_temp_creation)
3715 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3716 is_gimple_lvalue, fb_lvalue);
3717 if (ret == GS_ERROR)
3721 object = TREE_OPERAND (*expr_p, 0);
3722 ctor = TREE_OPERAND (*expr_p, 1) =
3723 optimize_compound_literals_in_ctor (TREE_OPERAND (*expr_p, 1));
3724 type = TREE_TYPE (ctor);
3725 elts = CONSTRUCTOR_ELTS (ctor);
3728 switch (TREE_CODE (type))
3732 case QUAL_UNION_TYPE:
3735 struct gimplify_init_ctor_preeval_data preeval_data;
3736 HOST_WIDE_INT num_ctor_elements, num_nonzero_elements;
3737 bool cleared, complete_p, valid_const_initializer;
3739 /* Aggregate types must lower constructors to initialization of
3740 individual elements. The exception is that a CONSTRUCTOR node
3741 with no elements indicates zero-initialization of the whole. */
3742 if (VEC_empty (constructor_elt, elts))
3744 if (notify_temp_creation)
3749 /* Fetch information about the constructor to direct later processing.
3750 We might want to make static versions of it in various cases, and
3751 can only do so if it known to be a valid constant initializer. */
3752 valid_const_initializer
3753 = categorize_ctor_elements (ctor, &num_nonzero_elements,
3754 &num_ctor_elements, &complete_p);
3756 /* If a const aggregate variable is being initialized, then it
3757 should never be a lose to promote the variable to be static. */
3758 if (valid_const_initializer
3759 && num_nonzero_elements > 1
3760 && TREE_READONLY (object)
3761 && TREE_CODE (object) == VAR_DECL
3762 && (flag_merge_constants >= 2 || !TREE_ADDRESSABLE (object)))
3764 if (notify_temp_creation)
3766 DECL_INITIAL (object) = ctor;
3767 TREE_STATIC (object) = 1;
3768 if (!DECL_NAME (object))
3769 DECL_NAME (object) = create_tmp_var_name ("C");
3770 walk_tree (&DECL_INITIAL (object), force_labels_r, NULL, NULL);
3772 /* ??? C++ doesn't automatically append a .<number> to the
3773 assembler name, and even when it does, it looks a FE private
3774 data structures to figure out what that number should be,
3775 which are not set for this variable. I suppose this is
3776 important for local statics for inline functions, which aren't
3777 "local" in the object file sense. So in order to get a unique
3778 TU-local symbol, we must invoke the lhd version now. */
3779 lhd_set_decl_assembler_name (object);
3781 *expr_p = NULL_TREE;
3785 /* If there are "lots" of initialized elements, even discounting
3786 those that are not address constants (and thus *must* be
3787 computed at runtime), then partition the constructor into
3788 constant and non-constant parts. Block copy the constant
3789 parts in, then generate code for the non-constant parts. */
3790 /* TODO. There's code in cp/typeck.c to do this. */
3792 if (int_size_in_bytes (TREE_TYPE (ctor)) < 0)
3793 /* store_constructor will ignore the clearing of variable-sized
3794 objects. Initializers for such objects must explicitly set
3795 every field that needs to be set. */
3797 else if (!complete_p)
3798 /* If the constructor isn't complete, clear the whole object
3801 ??? This ought not to be needed. For any element not present
3802 in the initializer, we should simply set them to zero. Except
3803 we'd need to *find* the elements that are not present, and that
3804 requires trickery to avoid quadratic compile-time behavior in
3805 large cases or excessive memory use in small cases. */
3807 else if (num_ctor_elements - num_nonzero_elements
3808 > CLEAR_RATIO (optimize_function_for_speed_p (cfun))
3809 && num_nonzero_elements < num_ctor_elements / 4)
3810 /* If there are "lots" of zeros, it's more efficient to clear
3811 the memory and then set the nonzero elements. */
3816 /* If there are "lots" of initialized elements, and all of them
3817 are valid address constants, then the entire initializer can
3818 be dropped to memory, and then memcpy'd out. Don't do this
3819 for sparse arrays, though, as it's more efficient to follow
3820 the standard CONSTRUCTOR behavior of memset followed by
3821 individual element initialization. Also don't do this for small
3822 all-zero initializers (which aren't big enough to merit
3823 clearing), and don't try to make bitwise copies of
3824 TREE_ADDRESSABLE types. */
3825 if (valid_const_initializer
3826 && !(cleared || num_nonzero_elements == 0)
3827 && !TREE_ADDRESSABLE (type))
3829 HOST_WIDE_INT size = int_size_in_bytes (type);
3832 /* ??? We can still get unbounded array types, at least
3833 from the C++ front end. This seems wrong, but attempt
3834 to work around it for now. */
3837 size = int_size_in_bytes (TREE_TYPE (object));
3839 TREE_TYPE (ctor) = type = TREE_TYPE (object);
3842 /* Find the maximum alignment we can assume for the object. */
3843 /* ??? Make use of DECL_OFFSET_ALIGN. */
3844 if (DECL_P (object))
3845 align = DECL_ALIGN (object);
3847 align = TYPE_ALIGN (type);
3850 && num_nonzero_elements > 1
3851 && !can_move_by_pieces (size, align))
3853 if (notify_temp_creation)
3856 walk_tree (&ctor, force_labels_r, NULL, NULL);
3857 ctor = tree_output_constant_def (ctor);
3858 if (!useless_type_conversion_p (type, TREE_TYPE (ctor)))
3859 ctor = build1 (VIEW_CONVERT_EXPR, type, ctor);
3860 TREE_OPERAND (*expr_p, 1) = ctor;
3862 /* This is no longer an assignment of a CONSTRUCTOR, but
3863 we still may have processing to do on the LHS. So
3864 pretend we didn't do anything here to let that happen. */
3865 return GS_UNHANDLED;
3869 /* If the target is volatile, we have non-zero elements and more than
3870 one field to assign, initialize the target from a temporary. */
3871 if (TREE_THIS_VOLATILE (object)
3872 && !TREE_ADDRESSABLE (type)
3873 && num_nonzero_elements > 0
3874 && VEC_length (constructor_elt, elts) > 1)
3876 tree temp = create_tmp_var (TYPE_MAIN_VARIANT (type), NULL);
3877 TREE_OPERAND (*expr_p, 0) = temp;
3878 *expr_p = build2 (COMPOUND_EXPR, TREE_TYPE (*expr_p),
3880 build2 (MODIFY_EXPR, void_type_node,
3885 if (notify_temp_creation)
3888 /* If there are nonzero elements and if needed, pre-evaluate to capture
3889 elements overlapping with the lhs into temporaries. We must do this
3890 before clearing to fetch the values before they are zeroed-out. */
3891 if (num_nonzero_elements > 0 && TREE_CODE (*expr_p) != INIT_EXPR)
3893 preeval_data.lhs_base_decl = get_base_address (object);
3894 if (!DECL_P (preeval_data.lhs_base_decl))
3895 preeval_data.lhs_base_decl = NULL;
3896 preeval_data.lhs_alias_set = get_alias_set (object);
3898 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p, 1),
3899 pre_p, post_p, &preeval_data);
3904 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3905 Note that we still have to gimplify, in order to handle the
3906 case of variable sized types. Avoid shared tree structures. */
3907 CONSTRUCTOR_ELTS (ctor) = NULL;
3908 TREE_SIDE_EFFECTS (ctor) = 0;
3909 object = unshare_expr (object);
3910 gimplify_stmt (expr_p, pre_p);
3913 /* If we have not block cleared the object, or if there are nonzero
3914 elements in the constructor, add assignments to the individual
3915 scalar fields of the object. */
3916 if (!cleared || num_nonzero_elements > 0)
3917 gimplify_init_ctor_eval (object, elts, pre_p, cleared);
3919 *expr_p = NULL_TREE;
3927 if (notify_temp_creation)
3930 /* Extract the real and imaginary parts out of the ctor. */
3931 gcc_assert (VEC_length (constructor_elt, elts) == 2);
3932 r = VEC_index (constructor_elt, elts, 0)->value;
3933 i = VEC_index (constructor_elt, elts, 1)->value;
3934 if (r == NULL || i == NULL)
3936 tree zero = build_zero_cst (TREE_TYPE (type));
3943 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3944 represent creation of a complex value. */
3945 if (TREE_CONSTANT (r) && TREE_CONSTANT (i))
3947 ctor = build_complex (type, r, i);
3948 TREE_OPERAND (*expr_p, 1) = ctor;
3952 ctor = build2 (COMPLEX_EXPR, type, r, i);
3953 TREE_OPERAND (*expr_p, 1) = ctor;
3954 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 1),
3957 rhs_predicate_for (TREE_OPERAND (*expr_p, 0)),
3965 unsigned HOST_WIDE_INT ix;
3966 constructor_elt *ce;
3968 if (notify_temp_creation)
3971 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3972 if (TREE_CONSTANT (ctor))
3974 bool constant_p = true;
3977 /* Even when ctor is constant, it might contain non-*_CST
3978 elements, such as addresses or trapping values like
3979 1.0/0.0 - 1.0/0.0. Such expressions don't belong
3980 in VECTOR_CST nodes. */
3981 FOR_EACH_CONSTRUCTOR_VALUE (elts, ix, value)
3982 if (!CONSTANT_CLASS_P (value))
3990 TREE_OPERAND (*expr_p, 1) = build_vector_from_ctor (type, elts);
3994 /* Don't reduce an initializer constant even if we can't
3995 make a VECTOR_CST. It won't do anything for us, and it'll
3996 prevent us from representing it as a single constant. */
3997 if (initializer_constant_valid_p (ctor, type))
4000 TREE_CONSTANT (ctor) = 0;
4003 /* Vector types use CONSTRUCTOR all the way through gimple
4004 compilation as a general initializer. */
4005 FOR_EACH_VEC_ELT (constructor_elt, elts, ix, ce)
4007 enum gimplify_status tret;
4008 tret = gimplify_expr (&ce->value, pre_p, post_p, is_gimple_val,
4010 if (tret == GS_ERROR)
4013 if (!is_gimple_reg (TREE_OPERAND (*expr_p, 0)))
4014 TREE_OPERAND (*expr_p, 1) = get_formal_tmp_var (ctor, pre_p);
4019 /* So how did we get a CONSTRUCTOR for a scalar type? */
4023 if (ret == GS_ERROR)
4025 else if (want_value)
4032 /* If we have gimplified both sides of the initializer but have
4033 not emitted an assignment, do so now. */
4036 tree lhs = TREE_OPERAND (*expr_p, 0);
4037 tree rhs = TREE_OPERAND (*expr_p, 1);
4038 gimple init = gimple_build_assign (lhs, rhs);
4039 gimplify_seq_add_stmt (pre_p, init);
4047 /* Given a pointer value OP0, return a simplified version of an
4048 indirection through OP0, or NULL_TREE if no simplification is
4049 possible. Note that the resulting type may be different from
4050 the type pointed to in the sense that it is still compatible
4051 from the langhooks point of view. */
4054 gimple_fold_indirect_ref (tree t)
4056 tree ptype = TREE_TYPE (t), type = TREE_TYPE (ptype);
4061 subtype = TREE_TYPE (sub);
4062 if (!POINTER_TYPE_P (subtype))
4065 if (TREE_CODE (sub) == ADDR_EXPR)
4067 tree op = TREE_OPERAND (sub, 0);
4068 tree optype = TREE_TYPE (op);
4070 if (useless_type_conversion_p (type, optype))
4073 /* *(foo *)&fooarray => fooarray[0] */
4074 if (TREE_CODE (optype) == ARRAY_TYPE
4075 && TREE_CODE (TYPE_SIZE (TREE_TYPE (optype))) == INTEGER_CST
4076 && useless_type_conversion_p (type, TREE_TYPE (optype)))
4078 tree type_domain = TYPE_DOMAIN (optype);
4079 tree min_val = size_zero_node;
4080 if (type_domain && TYPE_MIN_VALUE (type_domain))
4081 min_val = TYPE_MIN_VALUE (type_domain);
4082 if (TREE_CODE (min_val) == INTEGER_CST)
4083 return build4 (ARRAY_REF, type, op, min_val, NULL_TREE, NULL_TREE);
4085 /* *(foo *)&complexfoo => __real__ complexfoo */
4086 else if (TREE_CODE (optype) == COMPLEX_TYPE
4087 && useless_type_conversion_p (type, TREE_TYPE (optype)))
4088 return fold_build1 (REALPART_EXPR, type, op);
4089 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
4090 else if (TREE_CODE (optype) == VECTOR_TYPE
4091 && useless_type_conversion_p (type, TREE_TYPE (optype)))
4093 tree part_width = TYPE_SIZE (type);
4094 tree index = bitsize_int (0);
4095 return fold_build3 (BIT_FIELD_REF, type, op, part_width, index);
4099 /* *(p + CST) -> ... */
4100 if (TREE_CODE (sub) == POINTER_PLUS_EXPR
4101 && TREE_CODE (TREE_OPERAND (sub, 1)) == INTEGER_CST)
4103 tree addr = TREE_OPERAND (sub, 0);
4104 tree off = TREE_OPERAND (sub, 1);
4108 addrtype = TREE_TYPE (addr);
4110 /* ((foo*)&vectorfoo)[1] -> BIT_FIELD_REF<vectorfoo,...> */
4111 if (TREE_CODE (addr) == ADDR_EXPR
4112 && TREE_CODE (TREE_TYPE (addrtype)) == VECTOR_TYPE
4113 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (addrtype)))
4114 && host_integerp (off, 1))
4116 unsigned HOST_WIDE_INT offset = tree_low_cst (off, 1);
4117 tree part_width = TYPE_SIZE (type);
4118 unsigned HOST_WIDE_INT part_widthi
4119 = tree_low_cst (part_width, 0) / BITS_PER_UNIT;
4120 unsigned HOST_WIDE_INT indexi = offset * BITS_PER_UNIT;
4121 tree index = bitsize_int (indexi);
4122 if (offset / part_widthi
4123 <= TYPE_VECTOR_SUBPARTS (TREE_TYPE (addrtype)))
4124 return fold_build3 (BIT_FIELD_REF, type, TREE_OPERAND (addr, 0),
4128 /* ((foo*)&complexfoo)[1] -> __imag__ complexfoo */
4129 if (TREE_CODE (addr) == ADDR_EXPR
4130 && TREE_CODE (TREE_TYPE (addrtype)) == COMPLEX_TYPE
4131 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (addrtype))))
4133 tree size = TYPE_SIZE_UNIT (type);
4134 if (tree_int_cst_equal (size, off))
4135 return fold_build1 (IMAGPART_EXPR, type, TREE_OPERAND (addr, 0));
4138 /* *(p + CST) -> MEM_REF <p, CST>. */
4139 if (TREE_CODE (addr) != ADDR_EXPR
4140 || DECL_P (TREE_OPERAND (addr, 0)))
4141 return fold_build2 (MEM_REF, type,
4143 build_int_cst_wide (ptype,
4144 TREE_INT_CST_LOW (off),
4145 TREE_INT_CST_HIGH (off)));
4148 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
4149 if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
4150 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (subtype)))) == INTEGER_CST
4151 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (subtype))))
4154 tree min_val = size_zero_node;
4156 sub = gimple_fold_indirect_ref (sub);
4158 sub = build1 (INDIRECT_REF, TREE_TYPE (subtype), osub);
4159 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
4160 if (type_domain && TYPE_MIN_VALUE (type_domain))
4161 min_val = TYPE_MIN_VALUE (type_domain);
4162 if (TREE_CODE (min_val) == INTEGER_CST)
4163 return build4 (ARRAY_REF, type, sub, min_val, NULL_TREE, NULL_TREE);
4169 /* Given a pointer value OP0, return a simplified version of an
4170 indirection through OP0, or NULL_TREE if no simplification is
4171 possible. This may only be applied to a rhs of an expression.
4172 Note that the resulting type may be different from the type pointed
4173 to in the sense that it is still compatible from the langhooks
4177 gimple_fold_indirect_ref_rhs (tree t)
4179 return gimple_fold_indirect_ref (t);
4182 /* Subroutine of gimplify_modify_expr to do simplifications of
4183 MODIFY_EXPRs based on the code of the RHS. We loop for as long as
4184 something changes. */
4186 static enum gimplify_status
4187 gimplify_modify_expr_rhs (tree *expr_p, tree *from_p, tree *to_p,
4188 gimple_seq *pre_p, gimple_seq *post_p,
4191 enum gimplify_status ret = GS_UNHANDLED;
4197 switch (TREE_CODE (*from_p))
4200 /* If we're assigning from a read-only variable initialized with
4201 a constructor, do the direct assignment from the constructor,
4202 but only if neither source nor target are volatile since this
4203 latter assignment might end up being done on a per-field basis. */
4204 if (DECL_INITIAL (*from_p)
4205 && TREE_READONLY (*from_p)
4206 && !TREE_THIS_VOLATILE (*from_p)
4207 && !TREE_THIS_VOLATILE (*to_p)
4208 && TREE_CODE (DECL_INITIAL (*from_p)) == CONSTRUCTOR)
4210 tree old_from = *from_p;
4211 enum gimplify_status subret;
4213 /* Move the constructor into the RHS. */
4214 *from_p = unshare_expr (DECL_INITIAL (*from_p));
4216 /* Let's see if gimplify_init_constructor will need to put
4218 subret = gimplify_init_constructor (expr_p, NULL, NULL,
4220 if (subret == GS_ERROR)
4222 /* If so, revert the change. */
4234 /* If we have code like
4238 where the type of "x" is a (possibly cv-qualified variant
4239 of "A"), treat the entire expression as identical to "x".
4240 This kind of code arises in C++ when an object is bound
4241 to a const reference, and if "x" is a TARGET_EXPR we want
4242 to take advantage of the optimization below. */
4243 bool volatile_p = TREE_THIS_VOLATILE (*from_p);
4244 tree t = gimple_fold_indirect_ref_rhs (TREE_OPERAND (*from_p, 0));
4247 if (TREE_THIS_VOLATILE (t) != volatile_p)
4249 if (TREE_CODE_CLASS (TREE_CODE (t)) == tcc_declaration)
4250 t = build_simple_mem_ref_loc (EXPR_LOCATION (*from_p),
4251 build_fold_addr_expr (t));
4252 if (REFERENCE_CLASS_P (t))
4253 TREE_THIS_VOLATILE (t) = volatile_p;
4264 /* If we are initializing something from a TARGET_EXPR, strip the
4265 TARGET_EXPR and initialize it directly, if possible. This can't
4266 be done if the initializer is void, since that implies that the
4267 temporary is set in some non-trivial way.
4269 ??? What about code that pulls out the temp and uses it
4270 elsewhere? I think that such code never uses the TARGET_EXPR as
4271 an initializer. If I'm wrong, we'll die because the temp won't
4272 have any RTL. In that case, I guess we'll need to replace
4273 references somehow. */
4274 tree init = TARGET_EXPR_INITIAL (*from_p);
4277 && !VOID_TYPE_P (TREE_TYPE (init)))
4287 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
4289 gimplify_compound_expr (from_p, pre_p, true);
4295 /* If we already made some changes, let the front end have a
4296 crack at this before we break it down. */
4297 if (ret != GS_UNHANDLED)
4299 /* If we're initializing from a CONSTRUCTOR, break this into
4300 individual MODIFY_EXPRs. */
4301 return gimplify_init_constructor (expr_p, pre_p, post_p, want_value,
4305 /* If we're assigning to a non-register type, push the assignment
4306 down into the branches. This is mandatory for ADDRESSABLE types,
4307 since we cannot generate temporaries for such, but it saves a
4308 copy in other cases as well. */
4309 if (!is_gimple_reg_type (TREE_TYPE (*from_p)))
4311 /* This code should mirror the code in gimplify_cond_expr. */
4312 enum tree_code code = TREE_CODE (*expr_p);
4313 tree cond = *from_p;
4314 tree result = *to_p;
4316 ret = gimplify_expr (&result, pre_p, post_p,
4317 is_gimple_lvalue, fb_lvalue);
4318 if (ret != GS_ERROR)
4321 if (TREE_TYPE (TREE_OPERAND (cond, 1)) != void_type_node)
4322 TREE_OPERAND (cond, 1)
4323 = build2 (code, void_type_node, result,
4324 TREE_OPERAND (cond, 1));
4325 if (TREE_TYPE (TREE_OPERAND (cond, 2)) != void_type_node)
4326 TREE_OPERAND (cond, 2)
4327 = build2 (code, void_type_node, unshare_expr (result),
4328 TREE_OPERAND (cond, 2));
4330 TREE_TYPE (cond) = void_type_node;
4331 recalculate_side_effects (cond);
4335 gimplify_and_add (cond, pre_p);
4336 *expr_p = unshare_expr (result);
4345 /* For calls that return in memory, give *to_p as the CALL_EXPR's
4346 return slot so that we don't generate a temporary. */
4347 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p)
4348 && aggregate_value_p (*from_p, *from_p))
4352 if (!(rhs_predicate_for (*to_p))(*from_p))
4353 /* If we need a temporary, *to_p isn't accurate. */
4355 /* It's OK to use the return slot directly unless it's an NRV. */
4356 else if (TREE_CODE (*to_p) == RESULT_DECL
4357 && DECL_NAME (*to_p) == NULL_TREE
4358 && needs_to_live_in_memory (*to_p))
4360 else if (is_gimple_reg_type (TREE_TYPE (*to_p))
4361 || (DECL_P (*to_p) && DECL_REGISTER (*to_p)))
4362 /* Don't force regs into memory. */
4364 else if (TREE_CODE (*expr_p) == INIT_EXPR)
4365 /* It's OK to use the target directly if it's being
4368 else if (!is_gimple_non_addressable (*to_p))
4369 /* Don't use the original target if it's already addressable;
4370 if its address escapes, and the called function uses the
4371 NRV optimization, a conforming program could see *to_p
4372 change before the called function returns; see c++/19317.
4373 When optimizing, the return_slot pass marks more functions
4374 as safe after we have escape info. */
4381 CALL_EXPR_RETURN_SLOT_OPT (*from_p) = 1;
4382 mark_addressable (*to_p);
4387 case WITH_SIZE_EXPR:
4388 /* Likewise for calls that return an aggregate of non-constant size,
4389 since we would not be able to generate a temporary at all. */
4390 if (TREE_CODE (TREE_OPERAND (*from_p, 0)) == CALL_EXPR)
4392 *from_p = TREE_OPERAND (*from_p, 0);
4393 /* We don't change ret in this case because the
4394 WITH_SIZE_EXPR might have been added in
4395 gimplify_modify_expr, so returning GS_OK would lead to an
4401 /* If we're initializing from a container, push the initialization
4403 case CLEANUP_POINT_EXPR:
4405 case STATEMENT_LIST:
4407 tree wrap = *from_p;
4410 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_min_lval,
4412 if (ret != GS_ERROR)
4415 t = voidify_wrapper_expr (wrap, *expr_p);
4416 gcc_assert (t == *expr_p);
4420 gimplify_and_add (wrap, pre_p);
4421 *expr_p = unshare_expr (*to_p);
4428 case COMPOUND_LITERAL_EXPR:
4430 tree complit = TREE_OPERAND (*expr_p, 1);
4431 tree decl_s = COMPOUND_LITERAL_EXPR_DECL_EXPR (complit);
4432 tree decl = DECL_EXPR_DECL (decl_s);
4433 tree init = DECL_INITIAL (decl);
4435 /* struct T x = (struct T) { 0, 1, 2 } can be optimized
4436 into struct T x = { 0, 1, 2 } if the address of the
4437 compound literal has never been taken. */
4438 if (!TREE_ADDRESSABLE (complit)
4439 && !TREE_ADDRESSABLE (decl)
4442 *expr_p = copy_node (*expr_p);
4443 TREE_OPERAND (*expr_p, 1) = init;
4457 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
4458 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
4459 DECL_GIMPLE_REG_P set.
4461 IMPORTANT NOTE: This promotion is performed by introducing a load of the
4462 other, unmodified part of the complex object just before the total store.
4463 As a consequence, if the object is still uninitialized, an undefined value
4464 will be loaded into a register, which may result in a spurious exception
4465 if the register is floating-point and the value happens to be a signaling
4466 NaN for example. Then the fully-fledged complex operations lowering pass
4467 followed by a DCE pass are necessary in order to fix things up. */
4469 static enum gimplify_status
4470 gimplify_modify_expr_complex_part (tree *expr_p, gimple_seq *pre_p,
4473 enum tree_code code, ocode;
4474 tree lhs, rhs, new_rhs, other, realpart, imagpart;
4476 lhs = TREE_OPERAND (*expr_p, 0);
4477 rhs = TREE_OPERAND (*expr_p, 1);
4478 code = TREE_CODE (lhs);
4479 lhs = TREE_OPERAND (lhs, 0);
4481 ocode = code == REALPART_EXPR ? IMAGPART_EXPR : REALPART_EXPR;
4482 other = build1 (ocode, TREE_TYPE (rhs), lhs);
4483 TREE_NO_WARNING (other) = 1;
4484 other = get_formal_tmp_var (other, pre_p);
4486 realpart = code == REALPART_EXPR ? rhs : other;
4487 imagpart = code == REALPART_EXPR ? other : rhs;
4489 if (TREE_CONSTANT (realpart) && TREE_CONSTANT (imagpart))
4490 new_rhs = build_complex (TREE_TYPE (lhs), realpart, imagpart);
4492 new_rhs = build2 (COMPLEX_EXPR, TREE_TYPE (lhs), realpart, imagpart);
4494 gimplify_seq_add_stmt (pre_p, gimple_build_assign (lhs, new_rhs));
4495 *expr_p = (want_value) ? rhs : NULL_TREE;
4500 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
4506 PRE_P points to the list where side effects that must happen before
4507 *EXPR_P should be stored.
4509 POST_P points to the list where side effects that must happen after
4510 *EXPR_P should be stored.
4512 WANT_VALUE is nonzero iff we want to use the value of this expression
4513 in another expression. */
4515 static enum gimplify_status
4516 gimplify_modify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
4519 tree *from_p = &TREE_OPERAND (*expr_p, 1);
4520 tree *to_p = &TREE_OPERAND (*expr_p, 0);
4521 enum gimplify_status ret = GS_UNHANDLED;
4523 location_t loc = EXPR_LOCATION (*expr_p);
4525 gcc_assert (TREE_CODE (*expr_p) == MODIFY_EXPR
4526 || TREE_CODE (*expr_p) == INIT_EXPR);
4528 /* Insert pointer conversions required by the middle-end that are not
4529 required by the frontend. This fixes middle-end type checking for
4530 for example gcc.dg/redecl-6.c. */
4531 if (POINTER_TYPE_P (TREE_TYPE (*to_p)))
4533 STRIP_USELESS_TYPE_CONVERSION (*from_p);
4534 if (!useless_type_conversion_p (TREE_TYPE (*to_p), TREE_TYPE (*from_p)))
4535 *from_p = fold_convert_loc (loc, TREE_TYPE (*to_p), *from_p);
4538 /* See if any simplifications can be done based on what the RHS is. */
4539 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
4541 if (ret != GS_UNHANDLED)
4544 /* For zero sized types only gimplify the left hand side and right hand
4545 side as statements and throw away the assignment. Do this after
4546 gimplify_modify_expr_rhs so we handle TARGET_EXPRs of addressable
4548 if (zero_sized_type (TREE_TYPE (*from_p)) && !want_value)
4550 gimplify_stmt (from_p, pre_p);
4551 gimplify_stmt (to_p, pre_p);
4552 *expr_p = NULL_TREE;
4556 /* If the value being copied is of variable width, compute the length
4557 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
4558 before gimplifying any of the operands so that we can resolve any
4559 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
4560 the size of the expression to be copied, not of the destination, so
4561 that is what we must do here. */
4562 maybe_with_size_expr (from_p);
4564 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
4565 if (ret == GS_ERROR)
4568 /* As a special case, we have to temporarily allow for assignments
4569 with a CALL_EXPR on the RHS. Since in GIMPLE a function call is
4570 a toplevel statement, when gimplifying the GENERIC expression
4571 MODIFY_EXPR <a, CALL_EXPR <foo>>, we cannot create the tuple
4572 GIMPLE_ASSIGN <a, GIMPLE_CALL <foo>>.
4574 Instead, we need to create the tuple GIMPLE_CALL <a, foo>. To
4575 prevent gimplify_expr from trying to create a new temporary for
4576 foo's LHS, we tell it that it should only gimplify until it
4577 reaches the CALL_EXPR. On return from gimplify_expr, the newly
4578 created GIMPLE_CALL <foo> will be the last statement in *PRE_P
4579 and all we need to do here is set 'a' to be its LHS. */
4580 ret = gimplify_expr (from_p, pre_p, post_p, rhs_predicate_for (*to_p),
4582 if (ret == GS_ERROR)
4585 /* Now see if the above changed *from_p to something we handle specially. */
4586 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
4588 if (ret != GS_UNHANDLED)
4591 /* If we've got a variable sized assignment between two lvalues (i.e. does
4592 not involve a call), then we can make things a bit more straightforward
4593 by converting the assignment to memcpy or memset. */
4594 if (TREE_CODE (*from_p) == WITH_SIZE_EXPR)
4596 tree from = TREE_OPERAND (*from_p, 0);
4597 tree size = TREE_OPERAND (*from_p, 1);
4599 if (TREE_CODE (from) == CONSTRUCTOR)
4600 return gimplify_modify_expr_to_memset (expr_p, size, want_value, pre_p);
4602 if (is_gimple_addressable (from))
4605 return gimplify_modify_expr_to_memcpy (expr_p, size, want_value,
4610 /* Transform partial stores to non-addressable complex variables into
4611 total stores. This allows us to use real instead of virtual operands
4612 for these variables, which improves optimization. */
4613 if ((TREE_CODE (*to_p) == REALPART_EXPR
4614 || TREE_CODE (*to_p) == IMAGPART_EXPR)
4615 && is_gimple_reg (TREE_OPERAND (*to_p, 0)))
4616 return gimplify_modify_expr_complex_part (expr_p, pre_p, want_value);
4618 /* Try to alleviate the effects of the gimplification creating artificial
4619 temporaries (see for example is_gimple_reg_rhs) on the debug info. */
4620 if (!gimplify_ctxp->into_ssa
4621 && TREE_CODE (*from_p) == VAR_DECL
4622 && DECL_IGNORED_P (*from_p)
4624 && !DECL_IGNORED_P (*to_p))
4626 if (!DECL_NAME (*from_p) && DECL_NAME (*to_p))
4628 = create_tmp_var_name (IDENTIFIER_POINTER (DECL_NAME (*to_p)));
4629 DECL_DEBUG_EXPR_IS_FROM (*from_p) = 1;
4630 SET_DECL_DEBUG_EXPR (*from_p, *to_p);
4633 if (want_value && TREE_THIS_VOLATILE (*to_p))
4634 *from_p = get_initialized_tmp_var (*from_p, pre_p, post_p);
4636 if (TREE_CODE (*from_p) == CALL_EXPR)
4638 /* Since the RHS is a CALL_EXPR, we need to create a GIMPLE_CALL
4639 instead of a GIMPLE_ASSIGN. */
4640 tree fnptrtype = TREE_TYPE (CALL_EXPR_FN (*from_p));
4641 CALL_EXPR_FN (*from_p) = TREE_OPERAND (CALL_EXPR_FN (*from_p), 0);
4642 STRIP_USELESS_TYPE_CONVERSION (CALL_EXPR_FN (*from_p));
4643 assign = gimple_build_call_from_tree (*from_p);
4644 gimple_call_set_fntype (assign, TREE_TYPE (fnptrtype));
4645 if (!gimple_call_noreturn_p (assign))
4646 gimple_call_set_lhs (assign, *to_p);
4650 assign = gimple_build_assign (*to_p, *from_p);
4651 gimple_set_location (assign, EXPR_LOCATION (*expr_p));
4654 gimplify_seq_add_stmt (pre_p, assign);
4656 if (gimplify_ctxp->into_ssa && is_gimple_reg (*to_p))
4658 /* If we've somehow already got an SSA_NAME on the LHS, then
4659 we've probably modified it twice. Not good. */
4660 gcc_assert (TREE_CODE (*to_p) != SSA_NAME);
4661 *to_p = make_ssa_name (*to_p, assign);
4662 gimple_set_lhs (assign, *to_p);
4667 *expr_p = TREE_THIS_VOLATILE (*to_p) ? *from_p : unshare_expr (*to_p);
4676 /* Gimplify a comparison between two variable-sized objects. Do this
4677 with a call to BUILT_IN_MEMCMP. */
4679 static enum gimplify_status
4680 gimplify_variable_sized_compare (tree *expr_p)
4682 location_t loc = EXPR_LOCATION (*expr_p);
4683 tree op0 = TREE_OPERAND (*expr_p, 0);
4684 tree op1 = TREE_OPERAND (*expr_p, 1);
4685 tree t, arg, dest, src, expr;
4687 arg = TYPE_SIZE_UNIT (TREE_TYPE (op0));
4688 arg = unshare_expr (arg);
4689 arg = SUBSTITUTE_PLACEHOLDER_IN_EXPR (arg, op0);
4690 src = build_fold_addr_expr_loc (loc, op1);
4691 dest = build_fold_addr_expr_loc (loc, op0);
4692 t = builtin_decl_implicit (BUILT_IN_MEMCMP);
4693 t = build_call_expr_loc (loc, t, 3, dest, src, arg);
4696 = build2 (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), t, integer_zero_node);
4697 SET_EXPR_LOCATION (expr, loc);
4703 /* Gimplify a comparison between two aggregate objects of integral scalar
4704 mode as a comparison between the bitwise equivalent scalar values. */
4706 static enum gimplify_status
4707 gimplify_scalar_mode_aggregate_compare (tree *expr_p)
4709 location_t loc = EXPR_LOCATION (*expr_p);
4710 tree op0 = TREE_OPERAND (*expr_p, 0);
4711 tree op1 = TREE_OPERAND (*expr_p, 1);
4713 tree type = TREE_TYPE (op0);
4714 tree scalar_type = lang_hooks.types.type_for_mode (TYPE_MODE (type), 1);
4716 op0 = fold_build1_loc (loc, VIEW_CONVERT_EXPR, scalar_type, op0);
4717 op1 = fold_build1_loc (loc, VIEW_CONVERT_EXPR, scalar_type, op1);
4720 = fold_build2_loc (loc, TREE_CODE (*expr_p), TREE_TYPE (*expr_p), op0, op1);
4725 /* Gimplify an expression sequence. This function gimplifies each
4726 expression and rewrites the original expression with the last
4727 expression of the sequence in GIMPLE form.
4729 PRE_P points to the list where the side effects for all the
4730 expressions in the sequence will be emitted.
4732 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
4734 static enum gimplify_status
4735 gimplify_compound_expr (tree *expr_p, gimple_seq *pre_p, bool want_value)
4741 tree *sub_p = &TREE_OPERAND (t, 0);
4743 if (TREE_CODE (*sub_p) == COMPOUND_EXPR)
4744 gimplify_compound_expr (sub_p, pre_p, false);
4746 gimplify_stmt (sub_p, pre_p);
4748 t = TREE_OPERAND (t, 1);
4750 while (TREE_CODE (t) == COMPOUND_EXPR);
4757 gimplify_stmt (expr_p, pre_p);
4762 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
4763 gimplify. After gimplification, EXPR_P will point to a new temporary
4764 that holds the original value of the SAVE_EXPR node.
4766 PRE_P points to the list where side effects that must happen before
4767 *EXPR_P should be stored. */
4769 static enum gimplify_status
4770 gimplify_save_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4772 enum gimplify_status ret = GS_ALL_DONE;
4775 gcc_assert (TREE_CODE (*expr_p) == SAVE_EXPR);
4776 val = TREE_OPERAND (*expr_p, 0);
4778 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
4779 if (!SAVE_EXPR_RESOLVED_P (*expr_p))
4781 /* The operand may be a void-valued expression such as SAVE_EXPRs
4782 generated by the Java frontend for class initialization. It is
4783 being executed only for its side-effects. */
4784 if (TREE_TYPE (val) == void_type_node)
4786 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
4787 is_gimple_stmt, fb_none);
4791 val = get_initialized_tmp_var (val, pre_p, post_p);
4793 TREE_OPERAND (*expr_p, 0) = val;
4794 SAVE_EXPR_RESOLVED_P (*expr_p) = 1;
4802 /* Rewrite the ADDR_EXPR node pointed to by EXPR_P
4809 PRE_P points to the list where side effects that must happen before
4810 *EXPR_P should be stored.
4812 POST_P points to the list where side effects that must happen after
4813 *EXPR_P should be stored. */
4815 static enum gimplify_status
4816 gimplify_addr_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4818 tree expr = *expr_p;
4819 tree op0 = TREE_OPERAND (expr, 0);
4820 enum gimplify_status ret;
4821 location_t loc = EXPR_LOCATION (*expr_p);
4823 switch (TREE_CODE (op0))
4827 /* Check if we are dealing with an expression of the form '&*ptr'.
4828 While the front end folds away '&*ptr' into 'ptr', these
4829 expressions may be generated internally by the compiler (e.g.,
4830 builtins like __builtin_va_end). */
4831 /* Caution: the silent array decomposition semantics we allow for
4832 ADDR_EXPR means we can't always discard the pair. */
4833 /* Gimplification of the ADDR_EXPR operand may drop
4834 cv-qualification conversions, so make sure we add them if
4837 tree op00 = TREE_OPERAND (op0, 0);
4838 tree t_expr = TREE_TYPE (expr);
4839 tree t_op00 = TREE_TYPE (op00);
4841 if (!useless_type_conversion_p (t_expr, t_op00))
4842 op00 = fold_convert_loc (loc, TREE_TYPE (expr), op00);
4848 case VIEW_CONVERT_EXPR:
4849 /* Take the address of our operand and then convert it to the type of
4852 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
4853 all clear. The impact of this transformation is even less clear. */
4855 /* If the operand is a useless conversion, look through it. Doing so
4856 guarantees that the ADDR_EXPR and its operand will remain of the
4858 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0, 0)))
4859 op0 = TREE_OPERAND (op0, 0);
4861 *expr_p = fold_convert_loc (loc, TREE_TYPE (expr),
4862 build_fold_addr_expr_loc (loc,
4863 TREE_OPERAND (op0, 0)));
4868 /* We use fb_either here because the C frontend sometimes takes
4869 the address of a call that returns a struct; see
4870 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
4871 the implied temporary explicit. */
4873 /* Make the operand addressable. */
4874 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, post_p,
4875 is_gimple_addressable, fb_either);
4876 if (ret == GS_ERROR)
4879 /* Then mark it. Beware that it may not be possible to do so directly
4880 if a temporary has been created by the gimplification. */
4881 prepare_gimple_addressable (&TREE_OPERAND (expr, 0), pre_p);
4883 op0 = TREE_OPERAND (expr, 0);
4885 /* For various reasons, the gimplification of the expression
4886 may have made a new INDIRECT_REF. */
4887 if (TREE_CODE (op0) == INDIRECT_REF)
4888 goto do_indirect_ref;
4890 mark_addressable (TREE_OPERAND (expr, 0));
4892 /* The FEs may end up building ADDR_EXPRs early on a decl with
4893 an incomplete type. Re-build ADDR_EXPRs in canonical form
4895 if (!types_compatible_p (TREE_TYPE (op0), TREE_TYPE (TREE_TYPE (expr))))
4896 *expr_p = build_fold_addr_expr (op0);
4898 /* Make sure TREE_CONSTANT and TREE_SIDE_EFFECTS are set properly. */
4899 recompute_tree_invariant_for_addr_expr (*expr_p);
4901 /* If we re-built the ADDR_EXPR add a conversion to the original type
4903 if (!useless_type_conversion_p (TREE_TYPE (expr), TREE_TYPE (*expr_p)))
4904 *expr_p = fold_convert (TREE_TYPE (expr), *expr_p);
4912 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
4913 value; output operands should be a gimple lvalue. */
4915 static enum gimplify_status
4916 gimplify_asm_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
4920 const char **oconstraints;
4923 const char *constraint;
4924 bool allows_mem, allows_reg, is_inout;
4925 enum gimplify_status ret, tret;
4927 VEC(tree, gc) *inputs;
4928 VEC(tree, gc) *outputs;
4929 VEC(tree, gc) *clobbers;
4930 VEC(tree, gc) *labels;
4934 noutputs = list_length (ASM_OUTPUTS (expr));
4935 oconstraints = (const char **) alloca ((noutputs) * sizeof (const char *));
4937 inputs = outputs = clobbers = labels = NULL;
4940 link_next = NULL_TREE;
4941 for (i = 0, link = ASM_OUTPUTS (expr); link; ++i, link = link_next)
4944 size_t constraint_len;
4946 link_next = TREE_CHAIN (link);
4950 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4951 constraint_len = strlen (constraint);
4952 if (constraint_len == 0)
4955 ok = parse_output_constraint (&constraint, i, 0, 0,
4956 &allows_mem, &allows_reg, &is_inout);
4963 if (!allows_reg && allows_mem)
4964 mark_addressable (TREE_VALUE (link));
4966 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4967 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
4968 fb_lvalue | fb_mayfail);
4969 if (tret == GS_ERROR)
4971 error ("invalid lvalue in asm output %d", i);
4975 VEC_safe_push (tree, gc, outputs, link);
4976 TREE_CHAIN (link) = NULL_TREE;
4980 /* An input/output operand. To give the optimizers more
4981 flexibility, split it into separate input and output
4986 /* Turn the in/out constraint into an output constraint. */
4987 char *p = xstrdup (constraint);
4989 TREE_VALUE (TREE_PURPOSE (link)) = build_string (constraint_len, p);
4991 /* And add a matching input constraint. */
4994 sprintf (buf, "%d", i);
4996 /* If there are multiple alternatives in the constraint,
4997 handle each of them individually. Those that allow register
4998 will be replaced with operand number, the others will stay
5000 if (strchr (p, ',') != NULL)
5002 size_t len = 0, buflen = strlen (buf);
5003 char *beg, *end, *str, *dst;
5007 end = strchr (beg, ',');
5009 end = strchr (beg, '\0');
5010 if ((size_t) (end - beg) < buflen)
5013 len += end - beg + 1;
5020 str = (char *) alloca (len);
5021 for (beg = p + 1, dst = str;;)
5024 bool mem_p, reg_p, inout_p;
5026 end = strchr (beg, ',');
5031 parse_output_constraint (&tem, i, 0, 0,
5032 &mem_p, ®_p, &inout_p);
5037 memcpy (dst, buf, buflen);
5046 memcpy (dst, beg, len);
5055 input = build_string (dst - str, str);
5058 input = build_string (strlen (buf), buf);
5061 input = build_string (constraint_len - 1, constraint + 1);
5065 input = build_tree_list (build_tree_list (NULL_TREE, input),
5066 unshare_expr (TREE_VALUE (link)));
5067 ASM_INPUTS (expr) = chainon (ASM_INPUTS (expr), input);
5071 link_next = NULL_TREE;
5072 for (link = ASM_INPUTS (expr); link; ++i, link = link_next)
5074 link_next = TREE_CHAIN (link);
5075 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
5076 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
5077 oconstraints, &allows_mem, &allows_reg);
5079 /* If we can't make copies, we can only accept memory. */
5080 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (link))))
5086 error ("impossible constraint in %<asm%>");
5087 error ("non-memory input %d must stay in memory", i);
5092 /* If the operand is a memory input, it should be an lvalue. */
5093 if (!allows_reg && allows_mem)
5095 tree inputv = TREE_VALUE (link);
5096 STRIP_NOPS (inputv);
5097 if (TREE_CODE (inputv) == PREDECREMENT_EXPR
5098 || TREE_CODE (inputv) == PREINCREMENT_EXPR
5099 || TREE_CODE (inputv) == POSTDECREMENT_EXPR
5100 || TREE_CODE (inputv) == POSTINCREMENT_EXPR)
5101 TREE_VALUE (link) = error_mark_node;
5102 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
5103 is_gimple_lvalue, fb_lvalue | fb_mayfail);
5104 mark_addressable (TREE_VALUE (link));
5105 if (tret == GS_ERROR)
5107 if (EXPR_HAS_LOCATION (TREE_VALUE (link)))
5108 input_location = EXPR_LOCATION (TREE_VALUE (link));
5109 error ("memory input %d is not directly addressable", i);
5115 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
5116 is_gimple_asm_val, fb_rvalue);
5117 if (tret == GS_ERROR)
5121 TREE_CHAIN (link) = NULL_TREE;
5122 VEC_safe_push (tree, gc, inputs, link);
5125 for (link = ASM_CLOBBERS (expr); link; ++i, link = TREE_CHAIN (link))
5126 VEC_safe_push (tree, gc, clobbers, link);
5128 for (link = ASM_LABELS (expr); link; ++i, link = TREE_CHAIN (link))
5129 VEC_safe_push (tree, gc, labels, link);
5131 /* Do not add ASMs with errors to the gimple IL stream. */
5132 if (ret != GS_ERROR)
5134 stmt = gimple_build_asm_vec (TREE_STRING_POINTER (ASM_STRING (expr)),
5135 inputs, outputs, clobbers, labels);
5137 gimple_asm_set_volatile (stmt, ASM_VOLATILE_P (expr));
5138 gimple_asm_set_input (stmt, ASM_INPUT_P (expr));
5140 gimplify_seq_add_stmt (pre_p, stmt);
5146 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
5147 GIMPLE_WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
5148 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
5149 return to this function.
5151 FIXME should we complexify the prequeue handling instead? Or use flags
5152 for all the cleanups and let the optimizer tighten them up? The current
5153 code seems pretty fragile; it will break on a cleanup within any
5154 non-conditional nesting. But any such nesting would be broken, anyway;
5155 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
5156 and continues out of it. We can do that at the RTL level, though, so
5157 having an optimizer to tighten up try/finally regions would be a Good
5160 static enum gimplify_status
5161 gimplify_cleanup_point_expr (tree *expr_p, gimple_seq *pre_p)
5163 gimple_stmt_iterator iter;
5164 gimple_seq body_sequence = NULL;
5166 tree temp = voidify_wrapper_expr (*expr_p, NULL);
5168 /* We only care about the number of conditions between the innermost
5169 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
5170 any cleanups collected outside the CLEANUP_POINT_EXPR. */
5171 int old_conds = gimplify_ctxp->conditions;
5172 gimple_seq old_cleanups = gimplify_ctxp->conditional_cleanups;
5173 gimplify_ctxp->conditions = 0;
5174 gimplify_ctxp->conditional_cleanups = NULL;
5176 gimplify_stmt (&TREE_OPERAND (*expr_p, 0), &body_sequence);
5178 gimplify_ctxp->conditions = old_conds;
5179 gimplify_ctxp->conditional_cleanups = old_cleanups;
5181 for (iter = gsi_start (body_sequence); !gsi_end_p (iter); )
5183 gimple wce = gsi_stmt (iter);
5185 if (gimple_code (wce) == GIMPLE_WITH_CLEANUP_EXPR)
5187 if (gsi_one_before_end_p (iter))
5189 /* Note that gsi_insert_seq_before and gsi_remove do not
5190 scan operands, unlike some other sequence mutators. */
5191 if (!gimple_wce_cleanup_eh_only (wce))
5192 gsi_insert_seq_before_without_update (&iter,
5193 gimple_wce_cleanup (wce),
5195 gsi_remove (&iter, true);
5202 enum gimple_try_flags kind;
5204 if (gimple_wce_cleanup_eh_only (wce))
5205 kind = GIMPLE_TRY_CATCH;
5207 kind = GIMPLE_TRY_FINALLY;
5208 seq = gsi_split_seq_after (iter);
5210 gtry = gimple_build_try (seq, gimple_wce_cleanup (wce), kind);
5211 /* Do not use gsi_replace here, as it may scan operands.
5212 We want to do a simple structural modification only. */
5213 *gsi_stmt_ptr (&iter) = gtry;
5214 iter = gsi_start (seq);
5221 gimplify_seq_add_seq (pre_p, body_sequence);
5234 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
5235 is the cleanup action required. EH_ONLY is true if the cleanup should
5236 only be executed if an exception is thrown, not on normal exit. */
5239 gimple_push_cleanup (tree var, tree cleanup, bool eh_only, gimple_seq *pre_p)
5242 gimple_seq cleanup_stmts = NULL;
5244 /* Errors can result in improperly nested cleanups. Which results in
5245 confusion when trying to resolve the GIMPLE_WITH_CLEANUP_EXPR. */
5249 if (gimple_conditional_context ())
5251 /* If we're in a conditional context, this is more complex. We only
5252 want to run the cleanup if we actually ran the initialization that
5253 necessitates it, but we want to run it after the end of the
5254 conditional context. So we wrap the try/finally around the
5255 condition and use a flag to determine whether or not to actually
5256 run the destructor. Thus
5260 becomes (approximately)
5264 if (test) { A::A(temp); flag = 1; val = f(temp); }
5267 if (flag) A::~A(temp);
5271 tree flag = create_tmp_var (boolean_type_node, "cleanup");
5272 gimple ffalse = gimple_build_assign (flag, boolean_false_node);
5273 gimple ftrue = gimple_build_assign (flag, boolean_true_node);
5275 cleanup = build3 (COND_EXPR, void_type_node, flag, cleanup, NULL);
5276 gimplify_stmt (&cleanup, &cleanup_stmts);
5277 wce = gimple_build_wce (cleanup_stmts);
5279 gimplify_seq_add_stmt (&gimplify_ctxp->conditional_cleanups, ffalse);
5280 gimplify_seq_add_stmt (&gimplify_ctxp->conditional_cleanups, wce);
5281 gimplify_seq_add_stmt (pre_p, ftrue);
5283 /* Because of this manipulation, and the EH edges that jump
5284 threading cannot redirect, the temporary (VAR) will appear
5285 to be used uninitialized. Don't warn. */
5286 TREE_NO_WARNING (var) = 1;
5290 gimplify_stmt (&cleanup, &cleanup_stmts);
5291 wce = gimple_build_wce (cleanup_stmts);
5292 gimple_wce_set_cleanup_eh_only (wce, eh_only);
5293 gimplify_seq_add_stmt (pre_p, wce);
5297 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
5299 static enum gimplify_status
5300 gimplify_target_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
5302 tree targ = *expr_p;
5303 tree temp = TARGET_EXPR_SLOT (targ);
5304 tree init = TARGET_EXPR_INITIAL (targ);
5305 enum gimplify_status ret;
5309 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
5310 to the temps list. Handle also variable length TARGET_EXPRs. */
5311 if (TREE_CODE (DECL_SIZE (temp)) != INTEGER_CST)
5313 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (temp)))
5314 gimplify_type_sizes (TREE_TYPE (temp), pre_p);
5315 gimplify_vla_decl (temp, pre_p);
5318 gimple_add_tmp_var (temp);
5320 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
5321 expression is supposed to initialize the slot. */
5322 if (VOID_TYPE_P (TREE_TYPE (init)))
5323 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
5326 tree init_expr = build2 (INIT_EXPR, void_type_node, temp, init);
5328 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
5330 ggc_free (init_expr);
5332 if (ret == GS_ERROR)
5334 /* PR c++/28266 Make sure this is expanded only once. */
5335 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
5339 gimplify_and_add (init, pre_p);
5341 /* If needed, push the cleanup for the temp. */
5342 if (TARGET_EXPR_CLEANUP (targ))
5343 gimple_push_cleanup (temp, TARGET_EXPR_CLEANUP (targ),
5344 CLEANUP_EH_ONLY (targ), pre_p);
5346 /* Only expand this once. */
5347 TREE_OPERAND (targ, 3) = init;
5348 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
5351 /* We should have expanded this before. */
5352 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp));
5358 /* Gimplification of expression trees. */
5360 /* Gimplify an expression which appears at statement context. The
5361 corresponding GIMPLE statements are added to *SEQ_P. If *SEQ_P is
5362 NULL, a new sequence is allocated.
5364 Return true if we actually added a statement to the queue. */
5367 gimplify_stmt (tree *stmt_p, gimple_seq *seq_p)
5369 gimple_seq_node last;
5372 *seq_p = gimple_seq_alloc ();
5374 last = gimple_seq_last (*seq_p);
5375 gimplify_expr (stmt_p, seq_p, NULL, is_gimple_stmt, fb_none);
5376 return last != gimple_seq_last (*seq_p);
5379 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
5380 to CTX. If entries already exist, force them to be some flavor of private.
5381 If there is no enclosing parallel, do nothing. */
5384 omp_firstprivatize_variable (struct gimplify_omp_ctx *ctx, tree decl)
5388 if (decl == NULL || !DECL_P (decl))
5393 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5396 if (n->value & GOVD_SHARED)
5397 n->value = GOVD_FIRSTPRIVATE | (n->value & GOVD_SEEN);
5401 else if (ctx->region_type != ORT_WORKSHARE)
5402 omp_add_variable (ctx, decl, GOVD_FIRSTPRIVATE);
5404 ctx = ctx->outer_context;
5409 /* Similarly for each of the type sizes of TYPE. */
5412 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx *ctx, tree type)
5414 if (type == NULL || type == error_mark_node)
5416 type = TYPE_MAIN_VARIANT (type);
5418 if (pointer_set_insert (ctx->privatized_types, type))
5421 switch (TREE_CODE (type))
5427 case FIXED_POINT_TYPE:
5428 omp_firstprivatize_variable (ctx, TYPE_MIN_VALUE (type));
5429 omp_firstprivatize_variable (ctx, TYPE_MAX_VALUE (type));
5433 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
5434 omp_firstprivatize_type_sizes (ctx, TYPE_DOMAIN (type));
5439 case QUAL_UNION_TYPE:
5442 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
5443 if (TREE_CODE (field) == FIELD_DECL)
5445 omp_firstprivatize_variable (ctx, DECL_FIELD_OFFSET (field));
5446 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (field));
5452 case REFERENCE_TYPE:
5453 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
5460 omp_firstprivatize_variable (ctx, TYPE_SIZE (type));
5461 omp_firstprivatize_variable (ctx, TYPE_SIZE_UNIT (type));
5462 lang_hooks.types.omp_firstprivatize_type_sizes (ctx, type);
5465 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
5468 omp_add_variable (struct gimplify_omp_ctx *ctx, tree decl, unsigned int flags)
5471 unsigned int nflags;
5474 if (error_operand_p (decl))
5477 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
5478 there are constructors involved somewhere. */
5479 if (TREE_ADDRESSABLE (TREE_TYPE (decl))
5480 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
5483 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5486 /* We shouldn't be re-adding the decl with the same data
5488 gcc_assert ((n->value & GOVD_DATA_SHARE_CLASS & flags) == 0);
5489 /* The only combination of data sharing classes we should see is
5490 FIRSTPRIVATE and LASTPRIVATE. */
5491 nflags = n->value | flags;
5492 gcc_assert ((nflags & GOVD_DATA_SHARE_CLASS)
5493 == (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE));
5498 /* When adding a variable-sized variable, we have to handle all sorts
5499 of additional bits of data: the pointer replacement variable, and
5500 the parameters of the type. */
5501 if (DECL_SIZE (decl) && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
5503 /* Add the pointer replacement variable as PRIVATE if the variable
5504 replacement is private, else FIRSTPRIVATE since we'll need the
5505 address of the original variable either for SHARED, or for the
5506 copy into or out of the context. */
5507 if (!(flags & GOVD_LOCAL))
5509 nflags = flags & GOVD_PRIVATE ? GOVD_PRIVATE : GOVD_FIRSTPRIVATE;
5510 nflags |= flags & GOVD_SEEN;
5511 t = DECL_VALUE_EXPR (decl);
5512 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
5513 t = TREE_OPERAND (t, 0);
5514 gcc_assert (DECL_P (t));
5515 omp_add_variable (ctx, t, nflags);
5518 /* Add all of the variable and type parameters (which should have
5519 been gimplified to a formal temporary) as FIRSTPRIVATE. */
5520 omp_firstprivatize_variable (ctx, DECL_SIZE_UNIT (decl));
5521 omp_firstprivatize_variable (ctx, DECL_SIZE (decl));
5522 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
5524 /* The variable-sized variable itself is never SHARED, only some form
5525 of PRIVATE. The sharing would take place via the pointer variable
5526 which we remapped above. */
5527 if (flags & GOVD_SHARED)
5528 flags = GOVD_PRIVATE | GOVD_DEBUG_PRIVATE
5529 | (flags & (GOVD_SEEN | GOVD_EXPLICIT));
5531 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
5532 alloca statement we generate for the variable, so make sure it
5533 is available. This isn't automatically needed for the SHARED
5534 case, since we won't be allocating local storage then.
5535 For local variables TYPE_SIZE_UNIT might not be gimplified yet,
5536 in this case omp_notice_variable will be called later
5537 on when it is gimplified. */
5538 else if (! (flags & GOVD_LOCAL)
5539 && DECL_P (TYPE_SIZE_UNIT (TREE_TYPE (decl))))
5540 omp_notice_variable (ctx, TYPE_SIZE_UNIT (TREE_TYPE (decl)), true);
5542 else if (lang_hooks.decls.omp_privatize_by_reference (decl))
5544 gcc_assert ((flags & GOVD_LOCAL) == 0);
5545 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
5547 /* Similar to the direct variable sized case above, we'll need the
5548 size of references being privatized. */
5549 if ((flags & GOVD_SHARED) == 0)
5551 t = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl)));
5552 if (TREE_CODE (t) != INTEGER_CST)
5553 omp_notice_variable (ctx, t, true);
5557 splay_tree_insert (ctx->variables, (splay_tree_key)decl, flags);
5560 /* Notice a threadprivate variable DECL used in OpenMP context CTX.
5561 This just prints out diagnostics about threadprivate variable uses
5562 in untied tasks. If DECL2 is non-NULL, prevent this warning
5563 on that variable. */
5566 omp_notice_threadprivate_variable (struct gimplify_omp_ctx *ctx, tree decl,
5571 if (ctx->region_type != ORT_UNTIED_TASK)
5573 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5576 error ("threadprivate variable %qE used in untied task",
5578 error_at (ctx->location, "enclosing task");
5579 splay_tree_insert (ctx->variables, (splay_tree_key)decl, 0);
5582 splay_tree_insert (ctx->variables, (splay_tree_key)decl2, 0);
5586 /* Record the fact that DECL was used within the OpenMP context CTX.
5587 IN_CODE is true when real code uses DECL, and false when we should
5588 merely emit default(none) errors. Return true if DECL is going to
5589 be remapped and thus DECL shouldn't be gimplified into its
5590 DECL_VALUE_EXPR (if any). */
5593 omp_notice_variable (struct gimplify_omp_ctx *ctx, tree decl, bool in_code)
5596 unsigned flags = in_code ? GOVD_SEEN : 0;
5597 bool ret = false, shared;
5599 if (error_operand_p (decl))
5602 /* Threadprivate variables are predetermined. */
5603 if (is_global_var (decl))
5605 if (DECL_THREAD_LOCAL_P (decl))
5606 return omp_notice_threadprivate_variable (ctx, decl, NULL_TREE);
5608 if (DECL_HAS_VALUE_EXPR_P (decl))
5610 tree value = get_base_address (DECL_VALUE_EXPR (decl));
5612 if (value && DECL_P (value) && DECL_THREAD_LOCAL_P (value))
5613 return omp_notice_threadprivate_variable (ctx, decl, value);
5617 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5620 enum omp_clause_default_kind default_kind, kind;
5621 struct gimplify_omp_ctx *octx;
5623 if (ctx->region_type == ORT_WORKSHARE)
5626 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
5627 remapped firstprivate instead of shared. To some extent this is
5628 addressed in omp_firstprivatize_type_sizes, but not effectively. */
5629 default_kind = ctx->default_kind;
5630 kind = lang_hooks.decls.omp_predetermined_sharing (decl);
5631 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
5632 default_kind = kind;
5634 switch (default_kind)
5636 case OMP_CLAUSE_DEFAULT_NONE:
5637 error ("%qE not specified in enclosing parallel",
5638 DECL_NAME (lang_hooks.decls.omp_report_decl (decl)));
5639 if ((ctx->region_type & ORT_TASK) != 0)
5640 error_at (ctx->location, "enclosing task");
5642 error_at (ctx->location, "enclosing parallel");
5644 case OMP_CLAUSE_DEFAULT_SHARED:
5645 flags |= GOVD_SHARED;
5647 case OMP_CLAUSE_DEFAULT_PRIVATE:
5648 flags |= GOVD_PRIVATE;
5650 case OMP_CLAUSE_DEFAULT_FIRSTPRIVATE:
5651 flags |= GOVD_FIRSTPRIVATE;
5653 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
5654 /* decl will be either GOVD_FIRSTPRIVATE or GOVD_SHARED. */
5655 gcc_assert ((ctx->region_type & ORT_TASK) != 0);
5656 if (ctx->outer_context)
5657 omp_notice_variable (ctx->outer_context, decl, in_code);
5658 for (octx = ctx->outer_context; octx; octx = octx->outer_context)
5662 n2 = splay_tree_lookup (octx->variables, (splay_tree_key) decl);
5663 if (n2 && (n2->value & GOVD_DATA_SHARE_CLASS) != GOVD_SHARED)
5665 flags |= GOVD_FIRSTPRIVATE;
5668 if ((octx->region_type & ORT_PARALLEL) != 0)
5671 if (flags & GOVD_FIRSTPRIVATE)
5674 && (TREE_CODE (decl) == PARM_DECL
5675 || (!is_global_var (decl)
5676 && DECL_CONTEXT (decl) == current_function_decl)))
5678 flags |= GOVD_FIRSTPRIVATE;
5681 flags |= GOVD_SHARED;
5687 if ((flags & GOVD_PRIVATE)
5688 && lang_hooks.decls.omp_private_outer_ref (decl))
5689 flags |= GOVD_PRIVATE_OUTER_REF;
5691 omp_add_variable (ctx, decl, flags);
5693 shared = (flags & GOVD_SHARED) != 0;
5694 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
5698 if ((n->value & (GOVD_SEEN | GOVD_LOCAL)) == 0
5699 && (flags & (GOVD_SEEN | GOVD_LOCAL)) == GOVD_SEEN
5701 && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
5704 tree t = DECL_VALUE_EXPR (decl);
5705 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
5706 t = TREE_OPERAND (t, 0);
5707 gcc_assert (DECL_P (t));
5708 n2 = splay_tree_lookup (ctx->variables, (splay_tree_key) t);
5709 n2->value |= GOVD_SEEN;
5712 shared = ((flags | n->value) & GOVD_SHARED) != 0;
5713 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
5715 /* If nothing changed, there's nothing left to do. */
5716 if ((n->value & flags) == flags)
5722 /* If the variable is private in the current context, then we don't
5723 need to propagate anything to an outer context. */
5724 if ((flags & GOVD_PRIVATE) && !(flags & GOVD_PRIVATE_OUTER_REF))
5726 if (ctx->outer_context
5727 && omp_notice_variable (ctx->outer_context, decl, in_code))
5732 /* Verify that DECL is private within CTX. If there's specific information
5733 to the contrary in the innermost scope, generate an error. */
5736 omp_is_private (struct gimplify_omp_ctx *ctx, tree decl)
5740 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5743 if (n->value & GOVD_SHARED)
5745 if (ctx == gimplify_omp_ctxp)
5747 error ("iteration variable %qE should be private",
5749 n->value = GOVD_PRIVATE;
5755 else if ((n->value & GOVD_EXPLICIT) != 0
5756 && (ctx == gimplify_omp_ctxp
5757 || (ctx->region_type == ORT_COMBINED_PARALLEL
5758 && gimplify_omp_ctxp->outer_context == ctx)))
5760 if ((n->value & GOVD_FIRSTPRIVATE) != 0)
5761 error ("iteration variable %qE should not be firstprivate",
5763 else if ((n->value & GOVD_REDUCTION) != 0)
5764 error ("iteration variable %qE should not be reduction",
5767 return (ctx == gimplify_omp_ctxp
5768 || (ctx->region_type == ORT_COMBINED_PARALLEL
5769 && gimplify_omp_ctxp->outer_context == ctx));
5772 if (ctx->region_type != ORT_WORKSHARE)
5774 else if (ctx->outer_context)
5775 return omp_is_private (ctx->outer_context, decl);
5779 /* Return true if DECL is private within a parallel region
5780 that binds to the current construct's context or in parallel
5781 region's REDUCTION clause. */
5784 omp_check_private (struct gimplify_omp_ctx *ctx, tree decl)
5790 ctx = ctx->outer_context;
5792 return !(is_global_var (decl)
5793 /* References might be private, but might be shared too. */
5794 || lang_hooks.decls.omp_privatize_by_reference (decl));
5796 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5798 return (n->value & GOVD_SHARED) == 0;
5800 while (ctx->region_type == ORT_WORKSHARE);
5804 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
5805 and previous omp contexts. */
5808 gimplify_scan_omp_clauses (tree *list_p, gimple_seq *pre_p,
5809 enum omp_region_type region_type)
5811 struct gimplify_omp_ctx *ctx, *outer_ctx;
5812 struct gimplify_ctx gctx;
5815 ctx = new_omp_context (region_type);
5816 outer_ctx = ctx->outer_context;
5818 while ((c = *list_p) != NULL)
5820 bool remove = false;
5821 bool notice_outer = true;
5822 const char *check_non_private = NULL;
5826 switch (OMP_CLAUSE_CODE (c))
5828 case OMP_CLAUSE_PRIVATE:
5829 flags = GOVD_PRIVATE | GOVD_EXPLICIT;
5830 if (lang_hooks.decls.omp_private_outer_ref (OMP_CLAUSE_DECL (c)))
5832 flags |= GOVD_PRIVATE_OUTER_REF;
5833 OMP_CLAUSE_PRIVATE_OUTER_REF (c) = 1;
5836 notice_outer = false;
5838 case OMP_CLAUSE_SHARED:
5839 flags = GOVD_SHARED | GOVD_EXPLICIT;
5841 case OMP_CLAUSE_FIRSTPRIVATE:
5842 flags = GOVD_FIRSTPRIVATE | GOVD_EXPLICIT;
5843 check_non_private = "firstprivate";
5845 case OMP_CLAUSE_LASTPRIVATE:
5846 flags = GOVD_LASTPRIVATE | GOVD_SEEN | GOVD_EXPLICIT;
5847 check_non_private = "lastprivate";
5849 case OMP_CLAUSE_REDUCTION:
5850 flags = GOVD_REDUCTION | GOVD_SEEN | GOVD_EXPLICIT;
5851 check_non_private = "reduction";
5855 decl = OMP_CLAUSE_DECL (c);
5856 if (error_operand_p (decl))
5861 omp_add_variable (ctx, decl, flags);
5862 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION
5863 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c))
5865 omp_add_variable (ctx, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c),
5866 GOVD_LOCAL | GOVD_SEEN);
5867 gimplify_omp_ctxp = ctx;
5868 push_gimplify_context (&gctx);
5870 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c) = gimple_seq_alloc ();
5871 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c) = gimple_seq_alloc ();
5873 gimplify_and_add (OMP_CLAUSE_REDUCTION_INIT (c),
5874 &OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c));
5875 pop_gimplify_context
5876 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c)));
5877 push_gimplify_context (&gctx);
5878 gimplify_and_add (OMP_CLAUSE_REDUCTION_MERGE (c),
5879 &OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c));
5880 pop_gimplify_context
5881 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c)));
5882 OMP_CLAUSE_REDUCTION_INIT (c) = NULL_TREE;
5883 OMP_CLAUSE_REDUCTION_MERGE (c) = NULL_TREE;
5885 gimplify_omp_ctxp = outer_ctx;
5887 else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
5888 && OMP_CLAUSE_LASTPRIVATE_STMT (c))
5890 gimplify_omp_ctxp = ctx;
5891 push_gimplify_context (&gctx);
5892 if (TREE_CODE (OMP_CLAUSE_LASTPRIVATE_STMT (c)) != BIND_EXPR)
5894 tree bind = build3 (BIND_EXPR, void_type_node, NULL,
5896 TREE_SIDE_EFFECTS (bind) = 1;
5897 BIND_EXPR_BODY (bind) = OMP_CLAUSE_LASTPRIVATE_STMT (c);
5898 OMP_CLAUSE_LASTPRIVATE_STMT (c) = bind;
5900 gimplify_and_add (OMP_CLAUSE_LASTPRIVATE_STMT (c),
5901 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c));
5902 pop_gimplify_context
5903 (gimple_seq_first_stmt (OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c)));
5904 OMP_CLAUSE_LASTPRIVATE_STMT (c) = NULL_TREE;
5906 gimplify_omp_ctxp = outer_ctx;
5912 case OMP_CLAUSE_COPYIN:
5913 case OMP_CLAUSE_COPYPRIVATE:
5914 decl = OMP_CLAUSE_DECL (c);
5915 if (error_operand_p (decl))
5922 omp_notice_variable (outer_ctx, decl, true);
5923 if (check_non_private
5924 && region_type == ORT_WORKSHARE
5925 && omp_check_private (ctx, decl))
5927 error ("%s variable %qE is private in outer context",
5928 check_non_private, DECL_NAME (decl));
5933 case OMP_CLAUSE_FINAL:
5935 OMP_CLAUSE_OPERAND (c, 0)
5936 = gimple_boolify (OMP_CLAUSE_OPERAND (c, 0));
5939 case OMP_CLAUSE_SCHEDULE:
5940 case OMP_CLAUSE_NUM_THREADS:
5941 if (gimplify_expr (&OMP_CLAUSE_OPERAND (c, 0), pre_p, NULL,
5942 is_gimple_val, fb_rvalue) == GS_ERROR)
5946 case OMP_CLAUSE_NOWAIT:
5947 case OMP_CLAUSE_ORDERED:
5948 case OMP_CLAUSE_UNTIED:
5949 case OMP_CLAUSE_COLLAPSE:
5950 case OMP_CLAUSE_MERGEABLE:
5953 case OMP_CLAUSE_DEFAULT:
5954 ctx->default_kind = OMP_CLAUSE_DEFAULT_KIND (c);
5962 *list_p = OMP_CLAUSE_CHAIN (c);
5964 list_p = &OMP_CLAUSE_CHAIN (c);
5967 gimplify_omp_ctxp = ctx;
5970 /* For all variables that were not actually used within the context,
5971 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
5974 gimplify_adjust_omp_clauses_1 (splay_tree_node n, void *data)
5976 tree *list_p = (tree *) data;
5977 tree decl = (tree) n->key;
5978 unsigned flags = n->value;
5979 enum omp_clause_code code;
5983 if (flags & (GOVD_EXPLICIT | GOVD_LOCAL))
5985 if ((flags & GOVD_SEEN) == 0)
5987 if (flags & GOVD_DEBUG_PRIVATE)
5989 gcc_assert ((flags & GOVD_DATA_SHARE_CLASS) == GOVD_PRIVATE);
5990 private_debug = true;
5994 = lang_hooks.decls.omp_private_debug_clause (decl,
5995 !!(flags & GOVD_SHARED));
5997 code = OMP_CLAUSE_PRIVATE;
5998 else if (flags & GOVD_SHARED)
6000 if (is_global_var (decl))
6002 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp->outer_context;
6006 = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
6007 if (on && (on->value & (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE
6008 | GOVD_PRIVATE | GOVD_REDUCTION)) != 0)
6010 ctx = ctx->outer_context;
6015 code = OMP_CLAUSE_SHARED;
6017 else if (flags & GOVD_PRIVATE)
6018 code = OMP_CLAUSE_PRIVATE;
6019 else if (flags & GOVD_FIRSTPRIVATE)
6020 code = OMP_CLAUSE_FIRSTPRIVATE;
6024 clause = build_omp_clause (input_location, code);
6025 OMP_CLAUSE_DECL (clause) = decl;
6026 OMP_CLAUSE_CHAIN (clause) = *list_p;
6028 OMP_CLAUSE_PRIVATE_DEBUG (clause) = 1;
6029 else if (code == OMP_CLAUSE_PRIVATE && (flags & GOVD_PRIVATE_OUTER_REF))
6030 OMP_CLAUSE_PRIVATE_OUTER_REF (clause) = 1;
6032 lang_hooks.decls.omp_finish_clause (clause);
6038 gimplify_adjust_omp_clauses (tree *list_p)
6040 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
6043 while ((c = *list_p) != NULL)
6046 bool remove = false;
6048 switch (OMP_CLAUSE_CODE (c))
6050 case OMP_CLAUSE_PRIVATE:
6051 case OMP_CLAUSE_SHARED:
6052 case OMP_CLAUSE_FIRSTPRIVATE:
6053 decl = OMP_CLAUSE_DECL (c);
6054 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
6055 remove = !(n->value & GOVD_SEEN);
6058 bool shared = OMP_CLAUSE_CODE (c) == OMP_CLAUSE_SHARED;
6059 if ((n->value & GOVD_DEBUG_PRIVATE)
6060 || lang_hooks.decls.omp_private_debug_clause (decl, shared))
6062 gcc_assert ((n->value & GOVD_DEBUG_PRIVATE) == 0
6063 || ((n->value & GOVD_DATA_SHARE_CLASS)
6065 OMP_CLAUSE_SET_CODE (c, OMP_CLAUSE_PRIVATE);
6066 OMP_CLAUSE_PRIVATE_DEBUG (c) = 1;
6071 case OMP_CLAUSE_LASTPRIVATE:
6072 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
6073 accurately reflect the presence of a FIRSTPRIVATE clause. */
6074 decl = OMP_CLAUSE_DECL (c);
6075 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
6076 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)
6077 = (n->value & GOVD_FIRSTPRIVATE) != 0;
6080 case OMP_CLAUSE_REDUCTION:
6081 case OMP_CLAUSE_COPYIN:
6082 case OMP_CLAUSE_COPYPRIVATE:
6084 case OMP_CLAUSE_NUM_THREADS:
6085 case OMP_CLAUSE_SCHEDULE:
6086 case OMP_CLAUSE_NOWAIT:
6087 case OMP_CLAUSE_ORDERED:
6088 case OMP_CLAUSE_DEFAULT:
6089 case OMP_CLAUSE_UNTIED:
6090 case OMP_CLAUSE_COLLAPSE:
6091 case OMP_CLAUSE_FINAL:
6092 case OMP_CLAUSE_MERGEABLE:
6100 *list_p = OMP_CLAUSE_CHAIN (c);
6102 list_p = &OMP_CLAUSE_CHAIN (c);
6105 /* Add in any implicit data sharing. */
6106 splay_tree_foreach (ctx->variables, gimplify_adjust_omp_clauses_1, list_p);
6108 gimplify_omp_ctxp = ctx->outer_context;
6109 delete_omp_context (ctx);
6112 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
6113 gimplification of the body, as well as scanning the body for used
6114 variables. We need to do this scan now, because variable-sized
6115 decls will be decomposed during gimplification. */
6118 gimplify_omp_parallel (tree *expr_p, gimple_seq *pre_p)
6120 tree expr = *expr_p;
6122 gimple_seq body = NULL;
6123 struct gimplify_ctx gctx;
6125 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr), pre_p,
6126 OMP_PARALLEL_COMBINED (expr)
6127 ? ORT_COMBINED_PARALLEL
6130 push_gimplify_context (&gctx);
6132 g = gimplify_and_return_first (OMP_PARALLEL_BODY (expr), &body);
6133 if (gimple_code (g) == GIMPLE_BIND)
6134 pop_gimplify_context (g);
6136 pop_gimplify_context (NULL);
6138 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr));
6140 g = gimple_build_omp_parallel (body,
6141 OMP_PARALLEL_CLAUSES (expr),
6142 NULL_TREE, NULL_TREE);
6143 if (OMP_PARALLEL_COMBINED (expr))
6144 gimple_omp_set_subcode (g, GF_OMP_PARALLEL_COMBINED);
6145 gimplify_seq_add_stmt (pre_p, g);
6146 *expr_p = NULL_TREE;
6149 /* Gimplify the contents of an OMP_TASK statement. This involves
6150 gimplification of the body, as well as scanning the body for used
6151 variables. We need to do this scan now, because variable-sized
6152 decls will be decomposed during gimplification. */
6155 gimplify_omp_task (tree *expr_p, gimple_seq *pre_p)
6157 tree expr = *expr_p;
6159 gimple_seq body = NULL;
6160 struct gimplify_ctx gctx;
6162 gimplify_scan_omp_clauses (&OMP_TASK_CLAUSES (expr), pre_p,
6163 find_omp_clause (OMP_TASK_CLAUSES (expr),
6165 ? ORT_UNTIED_TASK : ORT_TASK);
6167 push_gimplify_context (&gctx);
6169 g = gimplify_and_return_first (OMP_TASK_BODY (expr), &body);
6170 if (gimple_code (g) == GIMPLE_BIND)
6171 pop_gimplify_context (g);
6173 pop_gimplify_context (NULL);
6175 gimplify_adjust_omp_clauses (&OMP_TASK_CLAUSES (expr));
6177 g = gimple_build_omp_task (body,
6178 OMP_TASK_CLAUSES (expr),
6179 NULL_TREE, NULL_TREE,
6180 NULL_TREE, NULL_TREE, NULL_TREE);
6181 gimplify_seq_add_stmt (pre_p, g);
6182 *expr_p = NULL_TREE;
6185 /* Gimplify the gross structure of an OMP_FOR statement. */
6187 static enum gimplify_status
6188 gimplify_omp_for (tree *expr_p, gimple_seq *pre_p)
6190 tree for_stmt, decl, var, t;
6191 enum gimplify_status ret = GS_ALL_DONE;
6192 enum gimplify_status tret;
6194 gimple_seq for_body, for_pre_body;
6199 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt), pre_p,
6202 /* Handle OMP_FOR_INIT. */
6203 for_pre_body = NULL;
6204 gimplify_and_add (OMP_FOR_PRE_BODY (for_stmt), &for_pre_body);
6205 OMP_FOR_PRE_BODY (for_stmt) = NULL_TREE;
6207 for_body = gimple_seq_alloc ();
6208 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt))
6209 == TREE_VEC_LENGTH (OMP_FOR_COND (for_stmt)));
6210 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt))
6211 == TREE_VEC_LENGTH (OMP_FOR_INCR (for_stmt)));
6212 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)); i++)
6214 t = TREE_VEC_ELT (OMP_FOR_INIT (for_stmt), i);
6215 gcc_assert (TREE_CODE (t) == MODIFY_EXPR);
6216 decl = TREE_OPERAND (t, 0);
6217 gcc_assert (DECL_P (decl));
6218 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl))
6219 || POINTER_TYPE_P (TREE_TYPE (decl)));
6221 /* Make sure the iteration variable is private. */
6222 if (omp_is_private (gimplify_omp_ctxp, decl))
6223 omp_notice_variable (gimplify_omp_ctxp, decl, true);
6225 omp_add_variable (gimplify_omp_ctxp, decl, GOVD_PRIVATE | GOVD_SEEN);
6227 /* If DECL is not a gimple register, create a temporary variable to act
6228 as an iteration counter. This is valid, since DECL cannot be
6229 modified in the body of the loop. */
6230 if (!is_gimple_reg (decl))
6232 var = create_tmp_var (TREE_TYPE (decl), get_name (decl));
6233 TREE_OPERAND (t, 0) = var;
6235 gimplify_seq_add_stmt (&for_body, gimple_build_assign (decl, var));
6237 omp_add_variable (gimplify_omp_ctxp, var, GOVD_PRIVATE | GOVD_SEEN);
6242 tret = gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
6243 is_gimple_val, fb_rvalue);
6244 ret = MIN (ret, tret);
6245 if (ret == GS_ERROR)
6248 /* Handle OMP_FOR_COND. */
6249 t = TREE_VEC_ELT (OMP_FOR_COND (for_stmt), i);
6250 gcc_assert (COMPARISON_CLASS_P (t));
6251 gcc_assert (TREE_OPERAND (t, 0) == decl);
6253 tret = gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
6254 is_gimple_val, fb_rvalue);
6255 ret = MIN (ret, tret);
6257 /* Handle OMP_FOR_INCR. */
6258 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6259 switch (TREE_CODE (t))
6261 case PREINCREMENT_EXPR:
6262 case POSTINCREMENT_EXPR:
6263 t = build_int_cst (TREE_TYPE (decl), 1);
6264 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
6265 t = build2 (MODIFY_EXPR, TREE_TYPE (var), var, t);
6266 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i) = t;
6269 case PREDECREMENT_EXPR:
6270 case POSTDECREMENT_EXPR:
6271 t = build_int_cst (TREE_TYPE (decl), -1);
6272 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
6273 t = build2 (MODIFY_EXPR, TREE_TYPE (var), var, t);
6274 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i) = t;
6278 gcc_assert (TREE_OPERAND (t, 0) == decl);
6279 TREE_OPERAND (t, 0) = var;
6281 t = TREE_OPERAND (t, 1);
6282 switch (TREE_CODE (t))
6285 if (TREE_OPERAND (t, 1) == decl)
6287 TREE_OPERAND (t, 1) = TREE_OPERAND (t, 0);
6288 TREE_OPERAND (t, 0) = var;
6294 case POINTER_PLUS_EXPR:
6295 gcc_assert (TREE_OPERAND (t, 0) == decl);
6296 TREE_OPERAND (t, 0) = var;
6302 tret = gimplify_expr (&TREE_OPERAND (t, 1), &for_pre_body, NULL,
6303 is_gimple_val, fb_rvalue);
6304 ret = MIN (ret, tret);
6311 if (var != decl || TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)) > 1)
6314 for (c = OMP_FOR_CLAUSES (for_stmt); c ; c = OMP_CLAUSE_CHAIN (c))
6315 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
6316 && OMP_CLAUSE_DECL (c) == decl
6317 && OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c) == NULL)
6319 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6320 gcc_assert (TREE_CODE (t) == MODIFY_EXPR);
6321 gcc_assert (TREE_OPERAND (t, 0) == var);
6322 t = TREE_OPERAND (t, 1);
6323 gcc_assert (TREE_CODE (t) == PLUS_EXPR
6324 || TREE_CODE (t) == MINUS_EXPR
6325 || TREE_CODE (t) == POINTER_PLUS_EXPR);
6326 gcc_assert (TREE_OPERAND (t, 0) == var);
6327 t = build2 (TREE_CODE (t), TREE_TYPE (decl), decl,
6328 TREE_OPERAND (t, 1));
6329 gimplify_assign (decl, t,
6330 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c));
6335 gimplify_and_add (OMP_FOR_BODY (for_stmt), &for_body);
6337 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt));
6339 gfor = gimple_build_omp_for (for_body, OMP_FOR_CLAUSES (for_stmt),
6340 TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)),
6343 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)); i++)
6345 t = TREE_VEC_ELT (OMP_FOR_INIT (for_stmt), i);
6346 gimple_omp_for_set_index (gfor, i, TREE_OPERAND (t, 0));
6347 gimple_omp_for_set_initial (gfor, i, TREE_OPERAND (t, 1));
6348 t = TREE_VEC_ELT (OMP_FOR_COND (for_stmt), i);
6349 gimple_omp_for_set_cond (gfor, i, TREE_CODE (t));
6350 gimple_omp_for_set_final (gfor, i, TREE_OPERAND (t, 1));
6351 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
6352 gimple_omp_for_set_incr (gfor, i, TREE_OPERAND (t, 1));
6355 gimplify_seq_add_stmt (pre_p, gfor);
6356 return ret == GS_ALL_DONE ? GS_ALL_DONE : GS_ERROR;
6359 /* Gimplify the gross structure of other OpenMP worksharing constructs.
6360 In particular, OMP_SECTIONS and OMP_SINGLE. */
6363 gimplify_omp_workshare (tree *expr_p, gimple_seq *pre_p)
6365 tree expr = *expr_p;
6367 gimple_seq body = NULL;
6369 gimplify_scan_omp_clauses (&OMP_CLAUSES (expr), pre_p, ORT_WORKSHARE);
6370 gimplify_and_add (OMP_BODY (expr), &body);
6371 gimplify_adjust_omp_clauses (&OMP_CLAUSES (expr));
6373 if (TREE_CODE (expr) == OMP_SECTIONS)
6374 stmt = gimple_build_omp_sections (body, OMP_CLAUSES (expr));
6375 else if (TREE_CODE (expr) == OMP_SINGLE)
6376 stmt = gimple_build_omp_single (body, OMP_CLAUSES (expr));
6380 gimplify_seq_add_stmt (pre_p, stmt);
6383 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
6384 stabilized the lhs of the atomic operation as *ADDR. Return true if
6385 EXPR is this stabilized form. */
6388 goa_lhs_expr_p (tree expr, tree addr)
6390 /* Also include casts to other type variants. The C front end is fond
6391 of adding these for e.g. volatile variables. This is like
6392 STRIP_TYPE_NOPS but includes the main variant lookup. */
6393 STRIP_USELESS_TYPE_CONVERSION (expr);
6395 if (TREE_CODE (expr) == INDIRECT_REF)
6397 expr = TREE_OPERAND (expr, 0);
6399 && (CONVERT_EXPR_P (expr)
6400 || TREE_CODE (expr) == NON_LVALUE_EXPR)
6401 && TREE_CODE (expr) == TREE_CODE (addr)
6402 && types_compatible_p (TREE_TYPE (expr), TREE_TYPE (addr)))
6404 expr = TREE_OPERAND (expr, 0);
6405 addr = TREE_OPERAND (addr, 0);
6409 return (TREE_CODE (addr) == ADDR_EXPR
6410 && TREE_CODE (expr) == ADDR_EXPR
6411 && TREE_OPERAND (addr, 0) == TREE_OPERAND (expr, 0));
6413 if (TREE_CODE (addr) == ADDR_EXPR && expr == TREE_OPERAND (addr, 0))
6418 /* Walk *EXPR_P and replace appearances of *LHS_ADDR with LHS_VAR. If an
6419 expression does not involve the lhs, evaluate it into a temporary.
6420 Return 1 if the lhs appeared as a subexpression, 0 if it did not,
6421 or -1 if an error was encountered. */
6424 goa_stabilize_expr (tree *expr_p, gimple_seq *pre_p, tree lhs_addr,
6427 tree expr = *expr_p;
6430 if (goa_lhs_expr_p (expr, lhs_addr))
6435 if (is_gimple_val (expr))
6439 switch (TREE_CODE_CLASS (TREE_CODE (expr)))
6442 case tcc_comparison:
6443 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p, lhs_addr,
6446 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p, lhs_addr,
6449 case tcc_expression:
6450 switch (TREE_CODE (expr))
6452 case TRUTH_ANDIF_EXPR:
6453 case TRUTH_ORIF_EXPR:
6454 case TRUTH_AND_EXPR:
6456 case TRUTH_XOR_EXPR:
6457 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p,
6459 case TRUTH_NOT_EXPR:
6460 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p,
6464 /* Break out any preevaluations from cp_build_modify_expr. */
6465 for (; TREE_CODE (expr) == COMPOUND_EXPR;
6466 expr = TREE_OPERAND (expr, 1))
6467 gimplify_stmt (&TREE_OPERAND (expr, 0), pre_p);
6469 return goa_stabilize_expr (expr_p, pre_p, lhs_addr, lhs_var);
6480 enum gimplify_status gs;
6481 gs = gimplify_expr (expr_p, pre_p, NULL, is_gimple_val, fb_rvalue);
6482 if (gs != GS_ALL_DONE)
6489 /* Gimplify an OMP_ATOMIC statement. */
6491 static enum gimplify_status
6492 gimplify_omp_atomic (tree *expr_p, gimple_seq *pre_p)
6494 tree addr = TREE_OPERAND (*expr_p, 0);
6495 tree rhs = TREE_CODE (*expr_p) == OMP_ATOMIC_READ
6496 ? NULL : TREE_OPERAND (*expr_p, 1);
6497 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr)));
6499 gimple loadstmt, storestmt;
6501 tmp_load = create_tmp_reg (type, NULL);
6502 if (rhs && goa_stabilize_expr (&rhs, pre_p, addr, tmp_load) < 0)
6505 if (gimplify_expr (&addr, pre_p, NULL, is_gimple_val, fb_rvalue)
6509 loadstmt = gimple_build_omp_atomic_load (tmp_load, addr);
6510 gimplify_seq_add_stmt (pre_p, loadstmt);
6511 if (rhs && gimplify_expr (&rhs, pre_p, NULL, is_gimple_val, fb_rvalue)
6515 if (TREE_CODE (*expr_p) == OMP_ATOMIC_READ)
6517 storestmt = gimple_build_omp_atomic_store (rhs);
6518 gimplify_seq_add_stmt (pre_p, storestmt);
6519 switch (TREE_CODE (*expr_p))
6521 case OMP_ATOMIC_READ:
6522 case OMP_ATOMIC_CAPTURE_OLD:
6524 gimple_omp_atomic_set_need_value (loadstmt);
6526 case OMP_ATOMIC_CAPTURE_NEW:
6528 gimple_omp_atomic_set_need_value (storestmt);
6538 /* Gimplify a TRANSACTION_EXPR. This involves gimplification of the
6539 body, and adding some EH bits. */
6541 static enum gimplify_status
6542 gimplify_transaction (tree *expr_p, gimple_seq *pre_p)
6544 tree expr = *expr_p, temp, tbody = TRANSACTION_EXPR_BODY (expr);
6546 gimple_seq body = NULL;
6547 struct gimplify_ctx gctx;
6550 /* Wrap the transaction body in a BIND_EXPR so we have a context
6551 where to put decls for OpenMP. */
6552 if (TREE_CODE (tbody) != BIND_EXPR)
6554 tree bind = build3 (BIND_EXPR, void_type_node, NULL, tbody, NULL);
6555 TREE_SIDE_EFFECTS (bind) = 1;
6556 SET_EXPR_LOCATION (bind, EXPR_LOCATION (tbody));
6557 TRANSACTION_EXPR_BODY (expr) = bind;
6560 push_gimplify_context (&gctx);
6561 temp = voidify_wrapper_expr (*expr_p, NULL);
6563 g = gimplify_and_return_first (TRANSACTION_EXPR_BODY (expr), &body);
6564 pop_gimplify_context (g);
6566 g = gimple_build_transaction (body, NULL);
6567 if (TRANSACTION_EXPR_OUTER (expr))
6568 subcode = GTMA_IS_OUTER;
6569 else if (TRANSACTION_EXPR_RELAXED (expr))
6570 subcode = GTMA_IS_RELAXED;
6571 gimple_transaction_set_subcode (g, subcode);
6573 gimplify_seq_add_stmt (pre_p, g);
6581 *expr_p = NULL_TREE;
6585 /* Convert the GENERIC expression tree *EXPR_P to GIMPLE. If the
6586 expression produces a value to be used as an operand inside a GIMPLE
6587 statement, the value will be stored back in *EXPR_P. This value will
6588 be a tree of class tcc_declaration, tcc_constant, tcc_reference or
6589 an SSA_NAME. The corresponding sequence of GIMPLE statements is
6590 emitted in PRE_P and POST_P.
6592 Additionally, this process may overwrite parts of the input
6593 expression during gimplification. Ideally, it should be
6594 possible to do non-destructive gimplification.
6596 EXPR_P points to the GENERIC expression to convert to GIMPLE. If
6597 the expression needs to evaluate to a value to be used as
6598 an operand in a GIMPLE statement, this value will be stored in
6599 *EXPR_P on exit. This happens when the caller specifies one
6600 of fb_lvalue or fb_rvalue fallback flags.
6602 PRE_P will contain the sequence of GIMPLE statements corresponding
6603 to the evaluation of EXPR and all the side-effects that must
6604 be executed before the main expression. On exit, the last
6605 statement of PRE_P is the core statement being gimplified. For
6606 instance, when gimplifying 'if (++a)' the last statement in
6607 PRE_P will be 'if (t.1)' where t.1 is the result of
6608 pre-incrementing 'a'.
6610 POST_P will contain the sequence of GIMPLE statements corresponding
6611 to the evaluation of all the side-effects that must be executed
6612 after the main expression. If this is NULL, the post
6613 side-effects are stored at the end of PRE_P.
6615 The reason why the output is split in two is to handle post
6616 side-effects explicitly. In some cases, an expression may have
6617 inner and outer post side-effects which need to be emitted in
6618 an order different from the one given by the recursive
6619 traversal. For instance, for the expression (*p--)++ the post
6620 side-effects of '--' must actually occur *after* the post
6621 side-effects of '++'. However, gimplification will first visit
6622 the inner expression, so if a separate POST sequence was not
6623 used, the resulting sequence would be:
6630 However, the post-decrement operation in line #2 must not be
6631 evaluated until after the store to *p at line #4, so the
6632 correct sequence should be:
6639 So, by specifying a separate post queue, it is possible
6640 to emit the post side-effects in the correct order.
6641 If POST_P is NULL, an internal queue will be used. Before
6642 returning to the caller, the sequence POST_P is appended to
6643 the main output sequence PRE_P.
6645 GIMPLE_TEST_F points to a function that takes a tree T and
6646 returns nonzero if T is in the GIMPLE form requested by the
6647 caller. The GIMPLE predicates are in gimple.c.
6649 FALLBACK tells the function what sort of a temporary we want if
6650 gimplification cannot produce an expression that complies with
6653 fb_none means that no temporary should be generated
6654 fb_rvalue means that an rvalue is OK to generate
6655 fb_lvalue means that an lvalue is OK to generate
6656 fb_either means that either is OK, but an lvalue is preferable.
6657 fb_mayfail means that gimplification may fail (in which case
6658 GS_ERROR will be returned)
6660 The return value is either GS_ERROR or GS_ALL_DONE, since this
6661 function iterates until EXPR is completely gimplified or an error
6664 enum gimplify_status
6665 gimplify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p,
6666 bool (*gimple_test_f) (tree), fallback_t fallback)
6669 gimple_seq internal_pre = NULL;
6670 gimple_seq internal_post = NULL;
6673 location_t saved_location;
6674 enum gimplify_status ret;
6675 gimple_stmt_iterator pre_last_gsi, post_last_gsi;
6677 save_expr = *expr_p;
6678 if (save_expr == NULL_TREE)
6681 /* If we are gimplifying a top-level statement, PRE_P must be valid. */
6682 is_statement = gimple_test_f == is_gimple_stmt;
6686 /* Consistency checks. */
6687 if (gimple_test_f == is_gimple_reg)
6688 gcc_assert (fallback & (fb_rvalue | fb_lvalue));
6689 else if (gimple_test_f == is_gimple_val
6690 || gimple_test_f == is_gimple_call_addr
6691 || gimple_test_f == is_gimple_condexpr
6692 || gimple_test_f == is_gimple_mem_rhs
6693 || gimple_test_f == is_gimple_mem_rhs_or_call
6694 || gimple_test_f == is_gimple_reg_rhs
6695 || gimple_test_f == is_gimple_reg_rhs_or_call
6696 || gimple_test_f == is_gimple_asm_val
6697 || gimple_test_f == is_gimple_mem_ref_addr)
6698 gcc_assert (fallback & fb_rvalue);
6699 else if (gimple_test_f == is_gimple_min_lval
6700 || gimple_test_f == is_gimple_lvalue)
6701 gcc_assert (fallback & fb_lvalue);
6702 else if (gimple_test_f == is_gimple_addressable)
6703 gcc_assert (fallback & fb_either);
6704 else if (gimple_test_f == is_gimple_stmt)
6705 gcc_assert (fallback == fb_none);
6708 /* We should have recognized the GIMPLE_TEST_F predicate to
6709 know what kind of fallback to use in case a temporary is
6710 needed to hold the value or address of *EXPR_P. */
6714 /* We used to check the predicate here and return immediately if it
6715 succeeds. This is wrong; the design is for gimplification to be
6716 idempotent, and for the predicates to only test for valid forms, not
6717 whether they are fully simplified. */
6719 pre_p = &internal_pre;
6722 post_p = &internal_post;
6724 /* Remember the last statements added to PRE_P and POST_P. Every
6725 new statement added by the gimplification helpers needs to be
6726 annotated with location information. To centralize the
6727 responsibility, we remember the last statement that had been
6728 added to both queues before gimplifying *EXPR_P. If
6729 gimplification produces new statements in PRE_P and POST_P, those
6730 statements will be annotated with the same location information
6732 pre_last_gsi = gsi_last (*pre_p);
6733 post_last_gsi = gsi_last (*post_p);
6735 saved_location = input_location;
6736 if (save_expr != error_mark_node
6737 && EXPR_HAS_LOCATION (*expr_p))
6738 input_location = EXPR_LOCATION (*expr_p);
6740 /* Loop over the specific gimplifiers until the toplevel node
6741 remains the same. */
6744 /* Strip away as many useless type conversions as possible
6746 STRIP_USELESS_TYPE_CONVERSION (*expr_p);
6748 /* Remember the expr. */
6749 save_expr = *expr_p;
6751 /* Die, die, die, my darling. */
6752 if (save_expr == error_mark_node
6753 || (TREE_TYPE (save_expr)
6754 && TREE_TYPE (save_expr) == error_mark_node))
6760 /* Do any language-specific gimplification. */
6761 ret = ((enum gimplify_status)
6762 lang_hooks.gimplify_expr (expr_p, pre_p, post_p));
6765 if (*expr_p == NULL_TREE)
6767 if (*expr_p != save_expr)
6770 else if (ret != GS_UNHANDLED)
6773 /* Make sure that all the cases set 'ret' appropriately. */
6775 switch (TREE_CODE (*expr_p))
6777 /* First deal with the special cases. */
6779 case POSTINCREMENT_EXPR:
6780 case POSTDECREMENT_EXPR:
6781 case PREINCREMENT_EXPR:
6782 case PREDECREMENT_EXPR:
6783 ret = gimplify_self_mod_expr (expr_p, pre_p, post_p,
6784 fallback != fb_none);
6788 case ARRAY_RANGE_REF:
6792 case VIEW_CONVERT_EXPR:
6793 ret = gimplify_compound_lval (expr_p, pre_p, post_p,
6794 fallback ? fallback : fb_rvalue);
6798 ret = gimplify_cond_expr (expr_p, pre_p, fallback);
6800 /* C99 code may assign to an array in a structure value of a
6801 conditional expression, and this has undefined behavior
6802 only on execution, so create a temporary if an lvalue is
6804 if (fallback == fb_lvalue)
6806 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6807 mark_addressable (*expr_p);
6813 ret = gimplify_call_expr (expr_p, pre_p, fallback != fb_none);
6815 /* C99 code may assign to an array in a structure returned
6816 from a function, and this has undefined behavior only on
6817 execution, so create a temporary if an lvalue is
6819 if (fallback == fb_lvalue)
6821 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6822 mark_addressable (*expr_p);
6831 ret = gimplify_compound_expr (expr_p, pre_p, fallback != fb_none);
6834 case COMPOUND_LITERAL_EXPR:
6835 ret = gimplify_compound_literal_expr (expr_p, pre_p);
6840 ret = gimplify_modify_expr (expr_p, pre_p, post_p,
6841 fallback != fb_none);
6844 case TRUTH_ANDIF_EXPR:
6845 case TRUTH_ORIF_EXPR:
6847 /* Preserve the original type of the expression and the
6848 source location of the outer expression. */
6849 tree org_type = TREE_TYPE (*expr_p);
6850 *expr_p = gimple_boolify (*expr_p);
6851 *expr_p = build3_loc (input_location, COND_EXPR,
6855 org_type, boolean_true_node),
6858 org_type, boolean_false_node));
6863 case TRUTH_NOT_EXPR:
6865 tree type = TREE_TYPE (*expr_p);
6866 /* The parsers are careful to generate TRUTH_NOT_EXPR
6867 only with operands that are always zero or one.
6868 We do not fold here but handle the only interesting case
6869 manually, as fold may re-introduce the TRUTH_NOT_EXPR. */
6870 *expr_p = gimple_boolify (*expr_p);
6871 if (TYPE_PRECISION (TREE_TYPE (*expr_p)) == 1)
6872 *expr_p = build1_loc (input_location, BIT_NOT_EXPR,
6873 TREE_TYPE (*expr_p),
6874 TREE_OPERAND (*expr_p, 0));
6876 *expr_p = build2_loc (input_location, BIT_XOR_EXPR,
6877 TREE_TYPE (*expr_p),
6878 TREE_OPERAND (*expr_p, 0),
6879 build_int_cst (TREE_TYPE (*expr_p), 1));
6880 if (!useless_type_conversion_p (type, TREE_TYPE (*expr_p)))
6881 *expr_p = fold_convert_loc (input_location, type, *expr_p);
6887 ret = gimplify_addr_expr (expr_p, pre_p, post_p);
6891 ret = gimplify_va_arg_expr (expr_p, pre_p, post_p);
6895 if (IS_EMPTY_STMT (*expr_p))
6901 if (VOID_TYPE_P (TREE_TYPE (*expr_p))
6902 || fallback == fb_none)
6904 /* Just strip a conversion to void (or in void context) and
6906 *expr_p = TREE_OPERAND (*expr_p, 0);
6911 ret = gimplify_conversion (expr_p);
6912 if (ret == GS_ERROR)
6914 if (*expr_p != save_expr)
6918 case FIX_TRUNC_EXPR:
6919 /* unary_expr: ... | '(' cast ')' val | ... */
6920 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6921 is_gimple_val, fb_rvalue);
6922 recalculate_side_effects (*expr_p);
6927 bool volatilep = TREE_THIS_VOLATILE (*expr_p);
6928 bool notrap = TREE_THIS_NOTRAP (*expr_p);
6929 tree saved_ptr_type = TREE_TYPE (TREE_OPERAND (*expr_p, 0));
6931 *expr_p = fold_indirect_ref_loc (input_location, *expr_p);
6932 if (*expr_p != save_expr)
6938 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6939 is_gimple_reg, fb_rvalue);
6940 if (ret == GS_ERROR)
6943 recalculate_side_effects (*expr_p);
6944 *expr_p = fold_build2_loc (input_location, MEM_REF,
6945 TREE_TYPE (*expr_p),
6946 TREE_OPERAND (*expr_p, 0),
6947 build_int_cst (saved_ptr_type, 0));
6948 TREE_THIS_VOLATILE (*expr_p) = volatilep;
6949 TREE_THIS_NOTRAP (*expr_p) = notrap;
6954 /* We arrive here through the various re-gimplifcation paths. */
6956 /* First try re-folding the whole thing. */
6957 tmp = fold_binary (MEM_REF, TREE_TYPE (*expr_p),
6958 TREE_OPERAND (*expr_p, 0),
6959 TREE_OPERAND (*expr_p, 1));
6963 recalculate_side_effects (*expr_p);
6967 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6968 is_gimple_mem_ref_addr, fb_rvalue);
6969 if (ret == GS_ERROR)
6971 recalculate_side_effects (*expr_p);
6975 /* Constants need not be gimplified. */
6986 /* If we require an lvalue, such as for ADDR_EXPR, retain the
6987 CONST_DECL node. Otherwise the decl is replaceable by its
6989 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
6990 if (fallback & fb_lvalue)
6994 *expr_p = DECL_INITIAL (*expr_p);
7000 ret = gimplify_decl_expr (expr_p, pre_p);
7004 ret = gimplify_bind_expr (expr_p, pre_p);
7008 ret = gimplify_loop_expr (expr_p, pre_p);
7012 ret = gimplify_switch_expr (expr_p, pre_p);
7016 ret = gimplify_exit_expr (expr_p);
7020 /* If the target is not LABEL, then it is a computed jump
7021 and the target needs to be gimplified. */
7022 if (TREE_CODE (GOTO_DESTINATION (*expr_p)) != LABEL_DECL)
7024 ret = gimplify_expr (&GOTO_DESTINATION (*expr_p), pre_p,
7025 NULL, is_gimple_val, fb_rvalue);
7026 if (ret == GS_ERROR)
7029 gimplify_seq_add_stmt (pre_p,
7030 gimple_build_goto (GOTO_DESTINATION (*expr_p)));
7035 gimplify_seq_add_stmt (pre_p,
7036 gimple_build_predict (PREDICT_EXPR_PREDICTOR (*expr_p),
7037 PREDICT_EXPR_OUTCOME (*expr_p)));
7043 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p))
7044 == current_function_decl);
7045 gimplify_seq_add_stmt (pre_p,
7046 gimple_build_label (LABEL_EXPR_LABEL (*expr_p)));
7049 case CASE_LABEL_EXPR:
7050 ret = gimplify_case_label_expr (expr_p, pre_p);
7054 ret = gimplify_return_expr (*expr_p, pre_p);
7058 /* Don't reduce this in place; let gimplify_init_constructor work its
7059 magic. Buf if we're just elaborating this for side effects, just
7060 gimplify any element that has side-effects. */
7061 if (fallback == fb_none)
7063 unsigned HOST_WIDE_INT ix;
7065 tree temp = NULL_TREE;
7066 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (*expr_p), ix, val)
7067 if (TREE_SIDE_EFFECTS (val))
7068 append_to_statement_list (val, &temp);
7071 ret = temp ? GS_OK : GS_ALL_DONE;
7073 /* C99 code may assign to an array in a constructed
7074 structure or union, and this has undefined behavior only
7075 on execution, so create a temporary if an lvalue is
7077 else if (fallback == fb_lvalue)
7079 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
7080 mark_addressable (*expr_p);
7087 /* The following are special cases that are not handled by the
7088 original GIMPLE grammar. */
7090 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
7093 ret = gimplify_save_expr (expr_p, pre_p, post_p);
7098 enum gimplify_status r0, r1, r2;
7100 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7101 post_p, is_gimple_lvalue, fb_either);
7102 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
7103 post_p, is_gimple_val, fb_rvalue);
7104 r2 = gimplify_expr (&TREE_OPERAND (*expr_p, 2), pre_p,
7105 post_p, is_gimple_val, fb_rvalue);
7106 recalculate_side_effects (*expr_p);
7108 ret = MIN (r0, MIN (r1, r2));
7112 case TARGET_MEM_REF:
7114 enum gimplify_status r0 = GS_ALL_DONE, r1 = GS_ALL_DONE;
7116 if (TMR_BASE (*expr_p))
7117 r0 = gimplify_expr (&TMR_BASE (*expr_p), pre_p,
7118 post_p, is_gimple_mem_ref_addr, fb_either);
7119 if (TMR_INDEX (*expr_p))
7120 r1 = gimplify_expr (&TMR_INDEX (*expr_p), pre_p,
7121 post_p, is_gimple_val, fb_rvalue);
7122 if (TMR_INDEX2 (*expr_p))
7123 r1 = gimplify_expr (&TMR_INDEX2 (*expr_p), pre_p,
7124 post_p, is_gimple_val, fb_rvalue);
7125 /* TMR_STEP and TMR_OFFSET are always integer constants. */
7130 case NON_LVALUE_EXPR:
7131 /* This should have been stripped above. */
7135 ret = gimplify_asm_expr (expr_p, pre_p, post_p);
7138 case TRY_FINALLY_EXPR:
7139 case TRY_CATCH_EXPR:
7141 gimple_seq eval, cleanup;
7144 eval = cleanup = NULL;
7145 gimplify_and_add (TREE_OPERAND (*expr_p, 0), &eval);
7146 gimplify_and_add (TREE_OPERAND (*expr_p, 1), &cleanup);
7147 /* Don't create bogus GIMPLE_TRY with empty cleanup. */
7148 if (gimple_seq_empty_p (cleanup))
7150 gimple_seq_add_seq (pre_p, eval);
7154 try_ = gimple_build_try (eval, cleanup,
7155 TREE_CODE (*expr_p) == TRY_FINALLY_EXPR
7156 ? GIMPLE_TRY_FINALLY
7157 : GIMPLE_TRY_CATCH);
7158 if (TREE_CODE (*expr_p) == TRY_CATCH_EXPR)
7159 gimple_try_set_catch_is_cleanup (try_,
7160 TRY_CATCH_IS_CLEANUP (*expr_p));
7161 gimplify_seq_add_stmt (pre_p, try_);
7166 case CLEANUP_POINT_EXPR:
7167 ret = gimplify_cleanup_point_expr (expr_p, pre_p);
7171 ret = gimplify_target_expr (expr_p, pre_p, post_p);
7177 gimple_seq handler = NULL;
7178 gimplify_and_add (CATCH_BODY (*expr_p), &handler);
7179 c = gimple_build_catch (CATCH_TYPES (*expr_p), handler);
7180 gimplify_seq_add_stmt (pre_p, c);
7185 case EH_FILTER_EXPR:
7188 gimple_seq failure = NULL;
7190 gimplify_and_add (EH_FILTER_FAILURE (*expr_p), &failure);
7191 ehf = gimple_build_eh_filter (EH_FILTER_TYPES (*expr_p), failure);
7192 gimple_set_no_warning (ehf, TREE_NO_WARNING (*expr_p));
7193 gimplify_seq_add_stmt (pre_p, ehf);
7200 enum gimplify_status r0, r1;
7201 r0 = gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p), pre_p,
7202 post_p, is_gimple_val, fb_rvalue);
7203 r1 = gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p), pre_p,
7204 post_p, is_gimple_val, fb_rvalue);
7205 TREE_SIDE_EFFECTS (*expr_p) = 0;
7211 /* We get here when taking the address of a label. We mark
7212 the label as "forced"; meaning it can never be removed and
7213 it is a potential target for any computed goto. */
7214 FORCED_LABEL (*expr_p) = 1;
7218 case STATEMENT_LIST:
7219 ret = gimplify_statement_list (expr_p, pre_p);
7222 case WITH_SIZE_EXPR:
7224 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7225 post_p == &internal_post ? NULL : post_p,
7226 gimple_test_f, fallback);
7227 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
7228 is_gimple_val, fb_rvalue);
7235 ret = gimplify_var_or_parm_decl (expr_p);
7239 /* When within an OpenMP context, notice uses of variables. */
7240 if (gimplify_omp_ctxp)
7241 omp_notice_variable (gimplify_omp_ctxp, *expr_p, true);
7246 /* Allow callbacks into the gimplifier during optimization. */
7251 gimplify_omp_parallel (expr_p, pre_p);
7256 gimplify_omp_task (expr_p, pre_p);
7261 ret = gimplify_omp_for (expr_p, pre_p);
7266 gimplify_omp_workshare (expr_p, pre_p);
7275 gimple_seq body = NULL;
7278 gimplify_and_add (OMP_BODY (*expr_p), &body);
7279 switch (TREE_CODE (*expr_p))
7282 g = gimple_build_omp_section (body);
7285 g = gimple_build_omp_master (body);
7288 g = gimple_build_omp_ordered (body);
7291 g = gimple_build_omp_critical (body,
7292 OMP_CRITICAL_NAME (*expr_p));
7297 gimplify_seq_add_stmt (pre_p, g);
7303 case OMP_ATOMIC_READ:
7304 case OMP_ATOMIC_CAPTURE_OLD:
7305 case OMP_ATOMIC_CAPTURE_NEW:
7306 ret = gimplify_omp_atomic (expr_p, pre_p);
7309 case TRANSACTION_EXPR:
7310 ret = gimplify_transaction (expr_p, pre_p);
7313 case TRUTH_AND_EXPR:
7315 case TRUTH_XOR_EXPR:
7317 tree orig_type = TREE_TYPE (*expr_p);
7318 tree new_type, xop0, xop1;
7319 *expr_p = gimple_boolify (*expr_p);
7320 new_type = TREE_TYPE (*expr_p);
7321 if (!useless_type_conversion_p (orig_type, new_type))
7323 *expr_p = fold_convert_loc (input_location, orig_type, *expr_p);
7328 /* Boolified binary truth expressions are semantically equivalent
7329 to bitwise binary expressions. Canonicalize them to the
7331 switch (TREE_CODE (*expr_p))
7333 case TRUTH_AND_EXPR:
7334 TREE_SET_CODE (*expr_p, BIT_AND_EXPR);
7337 TREE_SET_CODE (*expr_p, BIT_IOR_EXPR);
7339 case TRUTH_XOR_EXPR:
7340 TREE_SET_CODE (*expr_p, BIT_XOR_EXPR);
7345 /* Now make sure that operands have compatible type to
7346 expression's new_type. */
7347 xop0 = TREE_OPERAND (*expr_p, 0);
7348 xop1 = TREE_OPERAND (*expr_p, 1);
7349 if (!useless_type_conversion_p (new_type, TREE_TYPE (xop0)))
7350 TREE_OPERAND (*expr_p, 0) = fold_convert_loc (input_location,
7353 if (!useless_type_conversion_p (new_type, TREE_TYPE (xop1)))
7354 TREE_OPERAND (*expr_p, 1) = fold_convert_loc (input_location,
7357 /* Continue classified as tcc_binary. */
7363 /* Classified as tcc_expression. */
7366 case POINTER_PLUS_EXPR:
7368 enum gimplify_status r0, r1;
7369 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7370 post_p, is_gimple_val, fb_rvalue);
7371 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
7372 post_p, is_gimple_val, fb_rvalue);
7373 recalculate_side_effects (*expr_p);
7375 /* Convert &X + CST to invariant &MEM[&X, CST]. Do this
7376 after gimplifying operands - this is similar to how
7377 it would be folding all gimplified stmts on creation
7378 to have them canonicalized, which is what we eventually
7379 should do anyway. */
7380 if (TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
7381 && is_gimple_min_invariant (TREE_OPERAND (*expr_p, 0)))
7383 *expr_p = build_fold_addr_expr_with_type_loc
7385 fold_build2 (MEM_REF, TREE_TYPE (TREE_TYPE (*expr_p)),
7386 TREE_OPERAND (*expr_p, 0),
7387 fold_convert (ptr_type_node,
7388 TREE_OPERAND (*expr_p, 1))),
7389 TREE_TYPE (*expr_p));
7390 ret = MIN (ret, GS_OK);
7396 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p)))
7398 case tcc_comparison:
7399 /* Handle comparison of objects of non scalar mode aggregates
7400 with a call to memcmp. It would be nice to only have to do
7401 this for variable-sized objects, but then we'd have to allow
7402 the same nest of reference nodes we allow for MODIFY_EXPR and
7405 Compare scalar mode aggregates as scalar mode values. Using
7406 memcmp for them would be very inefficient at best, and is
7407 plain wrong if bitfields are involved. */
7409 tree type = TREE_TYPE (TREE_OPERAND (*expr_p, 1));
7411 /* Vector comparisons need no boolification. */
7412 if (TREE_CODE (type) == VECTOR_TYPE)
7414 else if (!AGGREGATE_TYPE_P (type))
7416 tree org_type = TREE_TYPE (*expr_p);
7417 *expr_p = gimple_boolify (*expr_p);
7418 if (!useless_type_conversion_p (org_type,
7419 TREE_TYPE (*expr_p)))
7421 *expr_p = fold_convert_loc (input_location,
7428 else if (TYPE_MODE (type) != BLKmode)
7429 ret = gimplify_scalar_mode_aggregate_compare (expr_p);
7431 ret = gimplify_variable_sized_compare (expr_p);
7436 /* If *EXPR_P does not need to be special-cased, handle it
7437 according to its class. */
7439 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7440 post_p, is_gimple_val, fb_rvalue);
7446 enum gimplify_status r0, r1;
7448 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7449 post_p, is_gimple_val, fb_rvalue);
7450 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
7451 post_p, is_gimple_val, fb_rvalue);
7459 enum gimplify_status r0, r1, r2;
7461 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
7462 post_p, is_gimple_val, fb_rvalue);
7463 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
7464 post_p, is_gimple_val, fb_rvalue);
7465 r2 = gimplify_expr (&TREE_OPERAND (*expr_p, 2), pre_p,
7466 post_p, is_gimple_val, fb_rvalue);
7468 ret = MIN (MIN (r0, r1), r2);
7472 case tcc_declaration:
7475 goto dont_recalculate;
7481 recalculate_side_effects (*expr_p);
7487 gcc_assert (*expr_p || ret != GS_OK);
7489 while (ret == GS_OK);
7491 /* If we encountered an error_mark somewhere nested inside, either
7492 stub out the statement or propagate the error back out. */
7493 if (ret == GS_ERROR)
7500 /* This was only valid as a return value from the langhook, which
7501 we handled. Make sure it doesn't escape from any other context. */
7502 gcc_assert (ret != GS_UNHANDLED);
7504 if (fallback == fb_none && *expr_p && !is_gimple_stmt (*expr_p))
7506 /* We aren't looking for a value, and we don't have a valid
7507 statement. If it doesn't have side-effects, throw it away. */
7508 if (!TREE_SIDE_EFFECTS (*expr_p))
7510 else if (!TREE_THIS_VOLATILE (*expr_p))
7512 /* This is probably a _REF that contains something nested that
7513 has side effects. Recurse through the operands to find it. */
7514 enum tree_code code = TREE_CODE (*expr_p);
7521 case VIEW_CONVERT_EXPR:
7522 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
7523 gimple_test_f, fallback);
7527 case ARRAY_RANGE_REF:
7528 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
7529 gimple_test_f, fallback);
7530 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
7531 gimple_test_f, fallback);
7535 /* Anything else with side-effects must be converted to
7536 a valid statement before we get here. */
7542 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p))
7543 && TYPE_MODE (TREE_TYPE (*expr_p)) != BLKmode)
7545 /* Historically, the compiler has treated a bare reference
7546 to a non-BLKmode volatile lvalue as forcing a load. */
7547 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p));
7549 /* Normally, we do not want to create a temporary for a
7550 TREE_ADDRESSABLE type because such a type should not be
7551 copied by bitwise-assignment. However, we make an
7552 exception here, as all we are doing here is ensuring that
7553 we read the bytes that make up the type. We use
7554 create_tmp_var_raw because create_tmp_var will abort when
7555 given a TREE_ADDRESSABLE type. */
7556 tree tmp = create_tmp_var_raw (type, "vol");
7557 gimple_add_tmp_var (tmp);
7558 gimplify_assign (tmp, *expr_p, pre_p);
7562 /* We can't do anything useful with a volatile reference to
7563 an incomplete type, so just throw it away. Likewise for
7564 a BLKmode type, since any implicit inner load should
7565 already have been turned into an explicit one by the
7566 gimplification process. */
7570 /* If we are gimplifying at the statement level, we're done. Tack
7571 everything together and return. */
7572 if (fallback == fb_none || is_statement)
7574 /* Since *EXPR_P has been converted into a GIMPLE tuple, clear
7575 it out for GC to reclaim it. */
7576 *expr_p = NULL_TREE;
7578 if (!gimple_seq_empty_p (internal_pre)
7579 || !gimple_seq_empty_p (internal_post))
7581 gimplify_seq_add_seq (&internal_pre, internal_post);
7582 gimplify_seq_add_seq (pre_p, internal_pre);
7585 /* The result of gimplifying *EXPR_P is going to be the last few
7586 statements in *PRE_P and *POST_P. Add location information
7587 to all the statements that were added by the gimplification
7589 if (!gimple_seq_empty_p (*pre_p))
7590 annotate_all_with_location_after (*pre_p, pre_last_gsi, input_location);
7592 if (!gimple_seq_empty_p (*post_p))
7593 annotate_all_with_location_after (*post_p, post_last_gsi,
7599 #ifdef ENABLE_GIMPLE_CHECKING
7602 enum tree_code code = TREE_CODE (*expr_p);
7603 /* These expressions should already be in gimple IR form. */
7604 gcc_assert (code != MODIFY_EXPR
7606 && code != BIND_EXPR
7607 && code != CATCH_EXPR
7608 && (code != COND_EXPR || gimplify_ctxp->allow_rhs_cond_expr)
7609 && code != EH_FILTER_EXPR
7610 && code != GOTO_EXPR
7611 && code != LABEL_EXPR
7612 && code != LOOP_EXPR
7613 && code != SWITCH_EXPR
7614 && code != TRY_FINALLY_EXPR
7615 && code != OMP_CRITICAL
7617 && code != OMP_MASTER
7618 && code != OMP_ORDERED
7619 && code != OMP_PARALLEL
7620 && code != OMP_SECTIONS
7621 && code != OMP_SECTION
7622 && code != OMP_SINGLE);
7626 /* Otherwise we're gimplifying a subexpression, so the resulting
7627 value is interesting. If it's a valid operand that matches
7628 GIMPLE_TEST_F, we're done. Unless we are handling some
7629 post-effects internally; if that's the case, we need to copy into
7630 a temporary before adding the post-effects to POST_P. */
7631 if (gimple_seq_empty_p (internal_post) && (*gimple_test_f) (*expr_p))
7634 /* Otherwise, we need to create a new temporary for the gimplified
7637 /* We can't return an lvalue if we have an internal postqueue. The
7638 object the lvalue refers to would (probably) be modified by the
7639 postqueue; we need to copy the value out first, which means an
7641 if ((fallback & fb_lvalue)
7642 && gimple_seq_empty_p (internal_post)
7643 && is_gimple_addressable (*expr_p))
7645 /* An lvalue will do. Take the address of the expression, store it
7646 in a temporary, and replace the expression with an INDIRECT_REF of
7648 tmp = build_fold_addr_expr_loc (input_location, *expr_p);
7649 gimplify_expr (&tmp, pre_p, post_p, is_gimple_reg, fb_rvalue);
7650 *expr_p = build_simple_mem_ref (tmp);
7652 else if ((fallback & fb_rvalue) && is_gimple_reg_rhs_or_call (*expr_p))
7654 /* An rvalue will do. Assign the gimplified expression into a
7655 new temporary TMP and replace the original expression with
7656 TMP. First, make sure that the expression has a type so that
7657 it can be assigned into a temporary. */
7658 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p)));
7660 if (!gimple_seq_empty_p (internal_post) || (fallback & fb_lvalue))
7661 /* The postqueue might change the value of the expression between
7662 the initialization and use of the temporary, so we can't use a
7663 formal temp. FIXME do we care? */
7665 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
7666 if (TREE_CODE (TREE_TYPE (*expr_p)) == COMPLEX_TYPE
7667 || TREE_CODE (TREE_TYPE (*expr_p)) == VECTOR_TYPE)
7668 DECL_GIMPLE_REG_P (*expr_p) = 1;
7671 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
7675 #ifdef ENABLE_GIMPLE_CHECKING
7676 if (!(fallback & fb_mayfail))
7678 fprintf (stderr, "gimplification failed:\n");
7679 print_generic_expr (stderr, *expr_p, 0);
7680 debug_tree (*expr_p);
7681 internal_error ("gimplification failed");
7684 gcc_assert (fallback & fb_mayfail);
7686 /* If this is an asm statement, and the user asked for the
7687 impossible, don't die. Fail and let gimplify_asm_expr
7693 /* Make sure the temporary matches our predicate. */
7694 gcc_assert ((*gimple_test_f) (*expr_p));
7696 if (!gimple_seq_empty_p (internal_post))
7698 annotate_all_with_location (internal_post, input_location);
7699 gimplify_seq_add_seq (pre_p, internal_post);
7703 input_location = saved_location;
7707 /* Look through TYPE for variable-sized objects and gimplify each such
7708 size that we find. Add to LIST_P any statements generated. */
7711 gimplify_type_sizes (tree type, gimple_seq *list_p)
7715 if (type == NULL || type == error_mark_node)
7718 /* We first do the main variant, then copy into any other variants. */
7719 type = TYPE_MAIN_VARIANT (type);
7721 /* Avoid infinite recursion. */
7722 if (TYPE_SIZES_GIMPLIFIED (type))
7725 TYPE_SIZES_GIMPLIFIED (type) = 1;
7727 switch (TREE_CODE (type))
7733 case FIXED_POINT_TYPE:
7734 gimplify_one_sizepos (&TYPE_MIN_VALUE (type), list_p);
7735 gimplify_one_sizepos (&TYPE_MAX_VALUE (type), list_p);
7737 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
7739 TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (type);
7740 TYPE_MAX_VALUE (t) = TYPE_MAX_VALUE (type);
7745 /* These types may not have declarations, so handle them here. */
7746 gimplify_type_sizes (TREE_TYPE (type), list_p);
7747 gimplify_type_sizes (TYPE_DOMAIN (type), list_p);
7748 /* Ensure VLA bounds aren't removed, for -O0 they should be variables
7749 with assigned stack slots, for -O1+ -g they should be tracked
7751 if (!(TYPE_NAME (type)
7752 && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
7753 && DECL_IGNORED_P (TYPE_NAME (type)))
7754 && TYPE_DOMAIN (type)
7755 && INTEGRAL_TYPE_P (TYPE_DOMAIN (type)))
7757 t = TYPE_MIN_VALUE (TYPE_DOMAIN (type));
7758 if (t && TREE_CODE (t) == VAR_DECL && DECL_ARTIFICIAL (t))
7759 DECL_IGNORED_P (t) = 0;
7760 t = TYPE_MAX_VALUE (TYPE_DOMAIN (type));
7761 if (t && TREE_CODE (t) == VAR_DECL && DECL_ARTIFICIAL (t))
7762 DECL_IGNORED_P (t) = 0;
7768 case QUAL_UNION_TYPE:
7769 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
7770 if (TREE_CODE (field) == FIELD_DECL)
7772 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field), list_p);
7773 gimplify_one_sizepos (&DECL_SIZE (field), list_p);
7774 gimplify_one_sizepos (&DECL_SIZE_UNIT (field), list_p);
7775 gimplify_type_sizes (TREE_TYPE (field), list_p);
7780 case REFERENCE_TYPE:
7781 /* We used to recurse on the pointed-to type here, which turned out to
7782 be incorrect because its definition might refer to variables not
7783 yet initialized at this point if a forward declaration is involved.
7785 It was actually useful for anonymous pointed-to types to ensure
7786 that the sizes evaluation dominates every possible later use of the
7787 values. Restricting to such types here would be safe since there
7788 is no possible forward declaration around, but would introduce an
7789 undesirable middle-end semantic to anonymity. We then defer to
7790 front-ends the responsibility of ensuring that the sizes are
7791 evaluated both early and late enough, e.g. by attaching artificial
7792 type declarations to the tree. */
7799 gimplify_one_sizepos (&TYPE_SIZE (type), list_p);
7800 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type), list_p);
7802 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
7804 TYPE_SIZE (t) = TYPE_SIZE (type);
7805 TYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (type);
7806 TYPE_SIZES_GIMPLIFIED (t) = 1;
7810 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
7811 a size or position, has had all of its SAVE_EXPRs evaluated.
7812 We add any required statements to *STMT_P. */
7815 gimplify_one_sizepos (tree *expr_p, gimple_seq *stmt_p)
7817 tree type, expr = *expr_p;
7819 /* We don't do anything if the value isn't there, is constant, or contains
7820 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
7821 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
7822 will want to replace it with a new variable, but that will cause problems
7823 if this type is from outside the function. It's OK to have that here. */
7824 if (expr == NULL_TREE || TREE_CONSTANT (expr)
7825 || TREE_CODE (expr) == VAR_DECL
7826 || CONTAINS_PLACEHOLDER_P (expr))
7829 type = TREE_TYPE (expr);
7830 *expr_p = unshare_expr (expr);
7832 gimplify_expr (expr_p, stmt_p, NULL, is_gimple_val, fb_rvalue);
7835 /* Verify that we've an exact type match with the original expression.
7836 In particular, we do not wish to drop a "sizetype" in favour of a
7837 type of similar dimensions. We don't want to pollute the generic
7838 type-stripping code with this knowledge because it doesn't matter
7839 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
7840 and friends retain their "sizetype-ness". */
7841 if (TREE_TYPE (expr) != type
7842 && TREE_CODE (type) == INTEGER_TYPE
7843 && TYPE_IS_SIZETYPE (type))
7848 *expr_p = create_tmp_var (type, NULL);
7849 tmp = build1 (NOP_EXPR, type, expr);
7850 stmt = gimplify_assign (*expr_p, tmp, stmt_p);
7851 gimple_set_location (stmt, EXPR_LOC_OR_HERE (expr));
7855 /* Gimplify the body of statements pointed to by BODY_P and return a
7856 GIMPLE_BIND containing the sequence of GIMPLE statements
7857 corresponding to BODY_P. FNDECL is the function decl containing
7861 gimplify_body (tree *body_p, tree fndecl, bool do_parms)
7863 location_t saved_location = input_location;
7864 gimple_seq parm_stmts, seq;
7866 struct gimplify_ctx gctx;
7867 struct cgraph_node *cgn;
7869 timevar_push (TV_TREE_GIMPLIFY);
7871 /* Initialize for optimize_insn_for_s{ize,peed}_p possibly called during
7873 default_rtl_profile ();
7875 gcc_assert (gimplify_ctxp == NULL);
7876 push_gimplify_context (&gctx);
7878 /* Unshare most shared trees in the body and in that of any nested functions.
7879 It would seem we don't have to do this for nested functions because
7880 they are supposed to be output and then the outer function gimplified
7881 first, but the g++ front end doesn't always do it that way. */
7882 unshare_body (body_p, fndecl);
7883 unvisit_body (body_p, fndecl);
7885 cgn = cgraph_get_node (fndecl);
7886 if (cgn && cgn->origin)
7887 nonlocal_vlas = pointer_set_create ();
7889 /* Make sure input_location isn't set to something weird. */
7890 input_location = DECL_SOURCE_LOCATION (fndecl);
7892 /* Resolve callee-copies. This has to be done before processing
7893 the body so that DECL_VALUE_EXPR gets processed correctly. */
7894 parm_stmts = (do_parms) ? gimplify_parameters () : NULL;
7896 /* Gimplify the function's body. */
7898 gimplify_stmt (body_p, &seq);
7899 outer_bind = gimple_seq_first_stmt (seq);
7902 outer_bind = gimple_build_nop ();
7903 gimplify_seq_add_stmt (&seq, outer_bind);
7906 /* The body must contain exactly one statement, a GIMPLE_BIND. If this is
7907 not the case, wrap everything in a GIMPLE_BIND to make it so. */
7908 if (gimple_code (outer_bind) == GIMPLE_BIND
7909 && gimple_seq_first (seq) == gimple_seq_last (seq))
7912 outer_bind = gimple_build_bind (NULL_TREE, seq, NULL);
7914 *body_p = NULL_TREE;
7916 /* If we had callee-copies statements, insert them at the beginning
7917 of the function and clear DECL_VALUE_EXPR_P on the parameters. */
7918 if (!gimple_seq_empty_p (parm_stmts))
7922 gimplify_seq_add_seq (&parm_stmts, gimple_bind_body (outer_bind));
7923 gimple_bind_set_body (outer_bind, parm_stmts);
7925 for (parm = DECL_ARGUMENTS (current_function_decl);
7926 parm; parm = DECL_CHAIN (parm))
7927 if (DECL_HAS_VALUE_EXPR_P (parm))
7929 DECL_HAS_VALUE_EXPR_P (parm) = 0;
7930 DECL_IGNORED_P (parm) = 0;
7936 pointer_set_destroy (nonlocal_vlas);
7937 nonlocal_vlas = NULL;
7940 pop_gimplify_context (outer_bind);
7941 gcc_assert (gimplify_ctxp == NULL);
7944 verify_gimple_in_seq (gimple_bind_body (outer_bind));
7946 timevar_pop (TV_TREE_GIMPLIFY);
7947 input_location = saved_location;
7952 typedef char *char_p; /* For DEF_VEC_P. */
7954 DEF_VEC_ALLOC_P(char_p,heap);
7956 /* Return whether we should exclude FNDECL from instrumentation. */
7959 flag_instrument_functions_exclude_p (tree fndecl)
7961 VEC(char_p,heap) *vec;
7963 vec = (VEC(char_p,heap) *) flag_instrument_functions_exclude_functions;
7964 if (VEC_length (char_p, vec) > 0)
7970 name = lang_hooks.decl_printable_name (fndecl, 0);
7971 FOR_EACH_VEC_ELT (char_p, vec, i, s)
7972 if (strstr (name, s) != NULL)
7976 vec = (VEC(char_p,heap) *) flag_instrument_functions_exclude_files;
7977 if (VEC_length (char_p, vec) > 0)
7983 name = DECL_SOURCE_FILE (fndecl);
7984 FOR_EACH_VEC_ELT (char_p, vec, i, s)
7985 if (strstr (name, s) != NULL)
7992 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
7993 node for the function we want to gimplify.
7995 Return the sequence of GIMPLE statements corresponding to the body
7999 gimplify_function_tree (tree fndecl)
8001 tree oldfn, parm, ret;
8005 gcc_assert (!gimple_body (fndecl));
8007 oldfn = current_function_decl;
8008 current_function_decl = fndecl;
8009 if (DECL_STRUCT_FUNCTION (fndecl))
8010 push_cfun (DECL_STRUCT_FUNCTION (fndecl));
8012 push_struct_function (fndecl);
8014 for (parm = DECL_ARGUMENTS (fndecl); parm ; parm = DECL_CHAIN (parm))
8016 /* Preliminarily mark non-addressed complex variables as eligible
8017 for promotion to gimple registers. We'll transform their uses
8019 if ((TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
8020 || TREE_CODE (TREE_TYPE (parm)) == VECTOR_TYPE)
8021 && !TREE_THIS_VOLATILE (parm)
8022 && !needs_to_live_in_memory (parm))
8023 DECL_GIMPLE_REG_P (parm) = 1;
8026 ret = DECL_RESULT (fndecl);
8027 if ((TREE_CODE (TREE_TYPE (ret)) == COMPLEX_TYPE
8028 || TREE_CODE (TREE_TYPE (ret)) == VECTOR_TYPE)
8029 && !needs_to_live_in_memory (ret))
8030 DECL_GIMPLE_REG_P (ret) = 1;
8032 bind = gimplify_body (&DECL_SAVED_TREE (fndecl), fndecl, true);
8034 /* The tree body of the function is no longer needed, replace it
8035 with the new GIMPLE body. */
8036 seq = gimple_seq_alloc ();
8037 gimple_seq_add_stmt (&seq, bind);
8038 gimple_set_body (fndecl, seq);
8040 /* If we're instrumenting function entry/exit, then prepend the call to
8041 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
8042 catch the exit hook. */
8043 /* ??? Add some way to ignore exceptions for this TFE. */
8044 if (flag_instrument_function_entry_exit
8045 && !DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl)
8046 && !flag_instrument_functions_exclude_p (fndecl))
8051 gimple_seq cleanup = NULL, body = NULL;
8055 x = builtin_decl_implicit (BUILT_IN_RETURN_ADDRESS);
8056 call = gimple_build_call (x, 1, integer_zero_node);
8057 tmp_var = create_tmp_var (ptr_type_node, "return_addr");
8058 gimple_call_set_lhs (call, tmp_var);
8059 gimplify_seq_add_stmt (&cleanup, call);
8060 x = builtin_decl_implicit (BUILT_IN_PROFILE_FUNC_EXIT);
8061 call = gimple_build_call (x, 2,
8062 build_fold_addr_expr (current_function_decl),
8064 gimplify_seq_add_stmt (&cleanup, call);
8065 tf = gimple_build_try (seq, cleanup, GIMPLE_TRY_FINALLY);
8067 x = builtin_decl_implicit (BUILT_IN_RETURN_ADDRESS);
8068 call = gimple_build_call (x, 1, integer_zero_node);
8069 tmp_var = create_tmp_var (ptr_type_node, "return_addr");
8070 gimple_call_set_lhs (call, tmp_var);
8071 gimplify_seq_add_stmt (&body, call);
8072 x = builtin_decl_implicit (BUILT_IN_PROFILE_FUNC_ENTER);
8073 call = gimple_build_call (x, 2,
8074 build_fold_addr_expr (current_function_decl),
8076 gimplify_seq_add_stmt (&body, call);
8077 gimplify_seq_add_stmt (&body, tf);
8078 new_bind = gimple_build_bind (NULL, body, gimple_bind_block (bind));
8079 /* Clear the block for BIND, since it is no longer directly inside
8080 the function, but within a try block. */
8081 gimple_bind_set_block (bind, NULL);
8083 /* Replace the current function body with the body
8084 wrapped in the try/finally TF. */
8085 seq = gimple_seq_alloc ();
8086 gimple_seq_add_stmt (&seq, new_bind);
8087 gimple_set_body (fndecl, seq);
8090 DECL_SAVED_TREE (fndecl) = NULL_TREE;
8091 cfun->curr_properties = PROP_gimple_any;
8093 current_function_decl = oldfn;
8097 /* Some transformations like inlining may invalidate the GIMPLE form
8098 for operands. This function traverses all the operands in STMT and
8099 gimplifies anything that is not a valid gimple operand. Any new
8100 GIMPLE statements are inserted before *GSI_P. */
8103 gimple_regimplify_operands (gimple stmt, gimple_stmt_iterator *gsi_p)
8106 tree orig_lhs = NULL_TREE, lhs, t;
8107 gimple_seq pre = NULL;
8108 gimple post_stmt = NULL;
8109 struct gimplify_ctx gctx;
8111 push_gimplify_context (&gctx);
8112 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
8114 switch (gimple_code (stmt))
8117 gimplify_expr (gimple_cond_lhs_ptr (stmt), &pre, NULL,
8118 is_gimple_val, fb_rvalue);
8119 gimplify_expr (gimple_cond_rhs_ptr (stmt), &pre, NULL,
8120 is_gimple_val, fb_rvalue);
8123 gimplify_expr (gimple_switch_index_ptr (stmt), &pre, NULL,
8124 is_gimple_val, fb_rvalue);
8126 case GIMPLE_OMP_ATOMIC_LOAD:
8127 gimplify_expr (gimple_omp_atomic_load_rhs_ptr (stmt), &pre, NULL,
8128 is_gimple_val, fb_rvalue);
8132 size_t i, noutputs = gimple_asm_noutputs (stmt);
8133 const char *constraint, **oconstraints;
8134 bool allows_mem, allows_reg, is_inout;
8137 = (const char **) alloca ((noutputs) * sizeof (const char *));
8138 for (i = 0; i < noutputs; i++)
8140 tree op = gimple_asm_output_op (stmt, i);
8141 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
8142 oconstraints[i] = constraint;
8143 parse_output_constraint (&constraint, i, 0, 0, &allows_mem,
8144 &allows_reg, &is_inout);
8145 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
8146 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
8147 fb_lvalue | fb_mayfail);
8149 for (i = 0; i < gimple_asm_ninputs (stmt); i++)
8151 tree op = gimple_asm_input_op (stmt, i);
8152 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
8153 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
8154 oconstraints, &allows_mem, &allows_reg);
8155 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (op))) && allows_mem)
8157 if (!allows_reg && allows_mem)
8158 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
8159 is_gimple_lvalue, fb_lvalue | fb_mayfail);
8161 gimplify_expr (&TREE_VALUE (op), &pre, NULL,
8162 is_gimple_asm_val, fb_rvalue);
8167 /* NOTE: We start gimplifying operands from last to first to
8168 make sure that side-effects on the RHS of calls, assignments
8169 and ASMs are executed before the LHS. The ordering is not
8170 important for other statements. */
8171 num_ops = gimple_num_ops (stmt);
8172 orig_lhs = gimple_get_lhs (stmt);
8173 for (i = num_ops; i > 0; i--)
8175 tree op = gimple_op (stmt, i - 1);
8176 if (op == NULL_TREE)
8178 if (i == 1 && (is_gimple_call (stmt) || is_gimple_assign (stmt)))
8179 gimplify_expr (&op, &pre, NULL, is_gimple_lvalue, fb_lvalue);
8181 && is_gimple_assign (stmt)
8183 && get_gimple_rhs_class (gimple_expr_code (stmt))
8184 == GIMPLE_SINGLE_RHS)
8185 gimplify_expr (&op, &pre, NULL,
8186 rhs_predicate_for (gimple_assign_lhs (stmt)),
8188 else if (i == 2 && is_gimple_call (stmt))
8190 if (TREE_CODE (op) == FUNCTION_DECL)
8192 gimplify_expr (&op, &pre, NULL, is_gimple_call_addr, fb_rvalue);
8195 gimplify_expr (&op, &pre, NULL, is_gimple_val, fb_rvalue);
8196 gimple_set_op (stmt, i - 1, op);
8199 lhs = gimple_get_lhs (stmt);
8200 /* If the LHS changed it in a way that requires a simple RHS,
8201 create temporary. */
8202 if (lhs && !is_gimple_reg (lhs))
8204 bool need_temp = false;
8206 if (is_gimple_assign (stmt)
8208 && get_gimple_rhs_class (gimple_expr_code (stmt))
8209 == GIMPLE_SINGLE_RHS)
8210 gimplify_expr (gimple_assign_rhs1_ptr (stmt), &pre, NULL,
8211 rhs_predicate_for (gimple_assign_lhs (stmt)),
8213 else if (is_gimple_reg (lhs))
8215 if (is_gimple_reg_type (TREE_TYPE (lhs)))
8217 if (is_gimple_call (stmt))
8219 i = gimple_call_flags (stmt);
8220 if ((i & ECF_LOOPING_CONST_OR_PURE)
8221 || !(i & (ECF_CONST | ECF_PURE)))
8224 if (stmt_can_throw_internal (stmt))
8230 if (is_gimple_reg_type (TREE_TYPE (lhs)))
8232 else if (TYPE_MODE (TREE_TYPE (lhs)) != BLKmode)
8234 if (is_gimple_call (stmt))
8236 tree fndecl = gimple_call_fndecl (stmt);
8238 if (!aggregate_value_p (TREE_TYPE (lhs), fndecl)
8239 && !(fndecl && DECL_RESULT (fndecl)
8240 && DECL_BY_REFERENCE (DECL_RESULT (fndecl))))
8249 tree temp = create_tmp_reg (TREE_TYPE (lhs), NULL);
8251 if (TREE_CODE (orig_lhs) == SSA_NAME)
8252 orig_lhs = SSA_NAME_VAR (orig_lhs);
8254 if (gimple_in_ssa_p (cfun))
8255 temp = make_ssa_name (temp, NULL);
8256 gimple_set_lhs (stmt, temp);
8257 post_stmt = gimple_build_assign (lhs, temp);
8258 if (TREE_CODE (lhs) == SSA_NAME)
8259 SSA_NAME_DEF_STMT (lhs) = post_stmt;
8265 if (gimple_referenced_vars (cfun))
8266 for (t = gimplify_ctxp->temps; t ; t = TREE_CHAIN (t))
8267 add_referenced_var (t);
8269 if (!gimple_seq_empty_p (pre))
8271 if (gimple_in_ssa_p (cfun))
8273 gimple_stmt_iterator i;
8275 for (i = gsi_start (pre); !gsi_end_p (i); gsi_next (&i))
8276 mark_symbols_for_renaming (gsi_stmt (i));
8278 gsi_insert_seq_before (gsi_p, pre, GSI_SAME_STMT);
8281 gsi_insert_after (gsi_p, post_stmt, GSI_NEW_STMT);
8283 pop_gimplify_context (NULL);
8286 /* Expand EXPR to list of gimple statements STMTS. GIMPLE_TEST_F specifies
8287 the predicate that will hold for the result. If VAR is not NULL, make the
8288 base variable of the final destination be VAR if suitable. */
8291 force_gimple_operand_1 (tree expr, gimple_seq *stmts,
8292 gimple_predicate gimple_test_f, tree var)
8295 enum gimplify_status ret;
8296 struct gimplify_ctx gctx;
8300 /* gimple_test_f might be more strict than is_gimple_val, make
8301 sure we pass both. Just checking gimple_test_f doesn't work
8302 because most gimple predicates do not work recursively. */
8303 if (is_gimple_val (expr)
8304 && (*gimple_test_f) (expr))
8307 push_gimplify_context (&gctx);
8308 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
8309 gimplify_ctxp->allow_rhs_cond_expr = true;
8312 expr = build2 (MODIFY_EXPR, TREE_TYPE (var), var, expr);
8314 if (TREE_CODE (expr) != MODIFY_EXPR
8315 && TREE_TYPE (expr) == void_type_node)
8317 gimplify_and_add (expr, stmts);
8322 ret = gimplify_expr (&expr, stmts, NULL, gimple_test_f, fb_rvalue);
8323 gcc_assert (ret != GS_ERROR);
8326 if (gimple_referenced_vars (cfun))
8327 for (t = gimplify_ctxp->temps; t ; t = DECL_CHAIN (t))
8328 add_referenced_var (t);
8330 pop_gimplify_context (NULL);
8335 /* Expand EXPR to list of gimple statements STMTS. If SIMPLE is true,
8336 force the result to be either ssa_name or an invariant, otherwise
8337 just force it to be a rhs expression. If VAR is not NULL, make the
8338 base variable of the final destination be VAR if suitable. */
8341 force_gimple_operand (tree expr, gimple_seq *stmts, bool simple, tree var)
8343 return force_gimple_operand_1 (expr, stmts,
8344 simple ? is_gimple_val : is_gimple_reg_rhs,
8348 /* Invoke force_gimple_operand_1 for EXPR with parameters GIMPLE_TEST_F
8349 and VAR. If some statements are produced, emits them at GSI.
8350 If BEFORE is true. the statements are appended before GSI, otherwise
8351 they are appended after it. M specifies the way GSI moves after
8352 insertion (GSI_SAME_STMT or GSI_CONTINUE_LINKING are the usual values). */
8355 force_gimple_operand_gsi_1 (gimple_stmt_iterator *gsi, tree expr,
8356 gimple_predicate gimple_test_f,
8357 tree var, bool before,
8358 enum gsi_iterator_update m)
8362 expr = force_gimple_operand_1 (expr, &stmts, gimple_test_f, var);
8364 if (!gimple_seq_empty_p (stmts))
8366 if (gimple_in_ssa_p (cfun))
8368 gimple_stmt_iterator i;
8370 for (i = gsi_start (stmts); !gsi_end_p (i); gsi_next (&i))
8371 mark_symbols_for_renaming (gsi_stmt (i));
8375 gsi_insert_seq_before (gsi, stmts, m);
8377 gsi_insert_seq_after (gsi, stmts, m);
8383 /* Invoke force_gimple_operand_1 for EXPR with parameter VAR.
8384 If SIMPLE is true, force the result to be either ssa_name or an invariant,
8385 otherwise just force it to be a rhs expression. If some statements are
8386 produced, emits them at GSI. If BEFORE is true, the statements are
8387 appended before GSI, otherwise they are appended after it. M specifies
8388 the way GSI moves after insertion (GSI_SAME_STMT or GSI_CONTINUE_LINKING
8389 are the usual values). */
8392 force_gimple_operand_gsi (gimple_stmt_iterator *gsi, tree expr,
8393 bool simple_p, tree var, bool before,
8394 enum gsi_iterator_update m)
8396 return force_gimple_operand_gsi_1 (gsi, expr,
8398 ? is_gimple_val : is_gimple_reg_rhs,
8403 #include "gt-gimplify.h"