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
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"
31 #include "tree-gimple.h"
32 #include "tree-inline.h"
33 #include "diagnostic.h"
34 #include "langhooks.h"
35 #include "langhooks-def.h"
36 #include "tree-flow.h"
50 #include "pointer-set.h"
51 #include "splay-tree.h"
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
78 struct gimplify_omp_ctx
80 struct gimplify_omp_ctx *outer_context;
82 struct pointer_set_t *privatized_types;
84 enum omp_clause_default_kind default_kind;
85 enum omp_region_type region_type;
90 struct gimplify_ctx *prev_context;
92 tree current_bind_expr;
94 tree conditional_cleanups;
98 VEC(tree,heap) *case_labels;
99 /* The formal temporary table. Should this be persistent? */
105 bool allow_rhs_cond_expr;
108 static struct gimplify_ctx *gimplify_ctxp;
109 static struct gimplify_omp_ctx *gimplify_omp_ctxp;
113 /* Formal (expression) temporary table handling: Multiple occurrences of
114 the same scalar expression are evaluated into the same temporary. */
116 typedef struct gimple_temp_hash_elt
119 tree temp; /* Value */
122 /* Forward declarations. */
123 static enum gimplify_status gimplify_compound_expr (tree *, tree *, bool);
125 /* Mark X addressable. Unlike the langhook we expect X to be in gimple
126 form and we don't do any syntax checking. */
128 mark_addressable (tree x)
130 while (handled_component_p (x))
131 x = TREE_OPERAND (x, 0);
132 if (TREE_CODE (x) != VAR_DECL && TREE_CODE (x) != PARM_DECL)
134 TREE_ADDRESSABLE (x) = 1;
137 /* Return a hash value for a formal temporary table entry. */
140 gimple_tree_hash (const void *p)
142 tree t = ((const elt_t *) p)->val;
143 return iterative_hash_expr (t, 0);
146 /* Compare two formal temporary table entries. */
149 gimple_tree_eq (const void *p1, const void *p2)
151 tree t1 = ((const elt_t *) p1)->val;
152 tree t2 = ((const elt_t *) p2)->val;
153 enum tree_code code = TREE_CODE (t1);
155 if (TREE_CODE (t2) != code
156 || TREE_TYPE (t1) != TREE_TYPE (t2))
159 if (!operand_equal_p (t1, t2, 0))
162 /* Only allow them to compare equal if they also hash equal; otherwise
163 results are nondeterminate, and we fail bootstrap comparison. */
164 gcc_assert (gimple_tree_hash (p1) == gimple_tree_hash (p2));
169 /* Set up a context for the gimplifier. */
172 push_gimplify_context (void)
174 struct gimplify_ctx *c;
176 c = (struct gimplify_ctx *) xcalloc (1, sizeof (struct gimplify_ctx));
177 c->prev_context = gimplify_ctxp;
179 c->temp_htab = htab_create (1000, gimple_tree_hash, gimple_tree_eq, free);
184 /* Tear down a context for the gimplifier. If BODY is non-null, then
185 put the temporaries into the outer BIND_EXPR. Otherwise, put them
186 in the local_decls. */
189 pop_gimplify_context (tree body)
191 struct gimplify_ctx *c = gimplify_ctxp;
194 gcc_assert (c && !c->current_bind_expr);
195 gimplify_ctxp = c->prev_context;
197 for (t = c->temps; t ; t = TREE_CHAIN (t))
198 DECL_GIMPLE_FORMAL_TEMP_P (t) = 0;
201 declare_vars (c->temps, body, false);
203 record_vars (c->temps);
206 htab_delete (c->temp_htab);
211 gimple_push_bind_expr (tree bind)
213 TREE_CHAIN (bind) = gimplify_ctxp->current_bind_expr;
214 gimplify_ctxp->current_bind_expr = bind;
218 gimple_pop_bind_expr (void)
220 gimplify_ctxp->current_bind_expr
221 = TREE_CHAIN (gimplify_ctxp->current_bind_expr);
225 gimple_current_bind_expr (void)
227 return gimplify_ctxp->current_bind_expr;
230 /* Returns true iff there is a COND_EXPR between us and the innermost
231 CLEANUP_POINT_EXPR. This info is used by gimple_push_cleanup. */
234 gimple_conditional_context (void)
236 return gimplify_ctxp->conditions > 0;
239 /* Note that we've entered a COND_EXPR. */
242 gimple_push_condition (void)
244 #ifdef ENABLE_CHECKING
245 if (gimplify_ctxp->conditions == 0)
246 gcc_assert (!gimplify_ctxp->conditional_cleanups);
248 ++(gimplify_ctxp->conditions);
251 /* Note that we've left a COND_EXPR. If we're back at unconditional scope
252 now, add any conditional cleanups we've seen to the prequeue. */
255 gimple_pop_condition (tree *pre_p)
257 int conds = --(gimplify_ctxp->conditions);
259 gcc_assert (conds >= 0);
262 append_to_statement_list (gimplify_ctxp->conditional_cleanups, pre_p);
263 gimplify_ctxp->conditional_cleanups = NULL_TREE;
267 /* A stable comparison routine for use with splay trees and DECLs. */
270 splay_tree_compare_decl_uid (splay_tree_key xa, splay_tree_key xb)
275 return DECL_UID (a) - DECL_UID (b);
278 /* Create a new omp construct that deals with variable remapping. */
280 static struct gimplify_omp_ctx *
281 new_omp_context (enum omp_region_type region_type)
283 struct gimplify_omp_ctx *c;
285 c = XCNEW (struct gimplify_omp_ctx);
286 c->outer_context = gimplify_omp_ctxp;
287 c->variables = splay_tree_new (splay_tree_compare_decl_uid, 0, 0);
288 c->privatized_types = pointer_set_create ();
289 c->location = input_location;
290 c->region_type = region_type;
291 if (region_type != ORT_TASK)
292 c->default_kind = OMP_CLAUSE_DEFAULT_SHARED;
294 c->default_kind = OMP_CLAUSE_DEFAULT_UNSPECIFIED;
299 /* Destroy an omp construct that deals with variable remapping. */
302 delete_omp_context (struct gimplify_omp_ctx *c)
304 splay_tree_delete (c->variables);
305 pointer_set_destroy (c->privatized_types);
309 static void omp_add_variable (struct gimplify_omp_ctx *, tree, unsigned int);
310 static bool omp_notice_variable (struct gimplify_omp_ctx *, tree, bool);
312 /* A subroutine of append_to_statement_list{,_force}. T is not NULL. */
315 append_to_statement_list_1 (tree t, tree *list_p)
318 tree_stmt_iterator i;
322 if (t && TREE_CODE (t) == STATEMENT_LIST)
327 *list_p = list = alloc_stmt_list ();
331 tsi_link_after (&i, t, TSI_CONTINUE_LINKING);
334 /* Add T to the end of the list container pointed to by LIST_P.
335 If T is an expression with no effects, it is ignored. */
338 append_to_statement_list (tree t, tree *list_p)
340 if (t && TREE_SIDE_EFFECTS (t))
341 append_to_statement_list_1 (t, list_p);
344 /* Similar, but the statement is always added, regardless of side effects. */
347 append_to_statement_list_force (tree t, tree *list_p)
350 append_to_statement_list_1 (t, list_p);
353 /* Both gimplify the statement T and append it to LIST_P. */
356 gimplify_and_add (tree t, tree *list_p)
359 append_to_statement_list (t, list_p);
362 /* Strip off a legitimate source ending from the input string NAME of
363 length LEN. Rather than having to know the names used by all of
364 our front ends, we strip off an ending of a period followed by
365 up to five characters. (Java uses ".class".) */
368 remove_suffix (char *name, int len)
372 for (i = 2; i < 8 && len > i; i++)
374 if (name[len - i] == '.')
376 name[len - i] = '\0';
382 /* Create a nameless artificial label and put it in the current function
383 context. Returns the newly created label. */
386 create_artificial_label (void)
388 tree lab = build_decl (LABEL_DECL, NULL_TREE, void_type_node);
390 DECL_ARTIFICIAL (lab) = 1;
391 DECL_IGNORED_P (lab) = 1;
392 DECL_CONTEXT (lab) = current_function_decl;
396 /* Subroutine for find_single_pointer_decl. */
399 find_single_pointer_decl_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
402 tree *pdecl = (tree *) data;
404 /* We are only looking for pointers at the same level as the
405 original tree; we must not look through any indirections.
406 Returning anything other than NULL_TREE will cause the caller to
408 if (REFERENCE_CLASS_P (*tp))
411 if (DECL_P (*tp) && POINTER_TYPE_P (TREE_TYPE (*tp)))
415 /* We already found a pointer decl; return anything other
416 than NULL_TREE to unwind from walk_tree signalling that
417 we have a duplicate. */
426 /* Find the single DECL of pointer type in the tree T, used directly
427 rather than via an indirection, and return it. If there are zero
428 or more than one such DECLs, return NULL. */
431 find_single_pointer_decl (tree t)
433 tree decl = NULL_TREE;
435 if (walk_tree (&t, find_single_pointer_decl_1, &decl, NULL))
437 /* find_single_pointer_decl_1 returns a nonzero value, causing
438 walk_tree to return a nonzero value, to indicate that it
439 found more than one pointer DECL or that it found an
447 /* Create a new temporary name with PREFIX. Returns an identifier. */
449 static GTY(()) unsigned int tmp_var_id_num;
452 create_tmp_var_name (const char *prefix)
458 char *preftmp = ASTRDUP (prefix);
460 remove_suffix (preftmp, strlen (preftmp));
464 ASM_FORMAT_PRIVATE_NAME (tmp_name, prefix ? prefix : "T", tmp_var_id_num++);
465 return get_identifier (tmp_name);
469 /* Create a new temporary variable declaration of type TYPE.
470 Does NOT push it into the current binding. */
473 create_tmp_var_raw (tree type, const char *prefix)
478 /* Make the type of the variable writable. */
479 new_type = build_type_variant (type, 0, 0);
480 TYPE_ATTRIBUTES (new_type) = TYPE_ATTRIBUTES (type);
482 tmp_var = build_decl (VAR_DECL, prefix ? create_tmp_var_name (prefix) : NULL,
485 /* The variable was declared by the compiler. */
486 DECL_ARTIFICIAL (tmp_var) = 1;
487 /* And we don't want debug info for it. */
488 DECL_IGNORED_P (tmp_var) = 1;
490 /* Make the variable writable. */
491 TREE_READONLY (tmp_var) = 0;
493 DECL_EXTERNAL (tmp_var) = 0;
494 TREE_STATIC (tmp_var) = 0;
495 TREE_USED (tmp_var) = 1;
500 /* Create a new temporary variable declaration of type TYPE. DOES push the
501 variable into the current binding. Further, assume that this is called
502 only from gimplification or optimization, at which point the creation of
503 certain types are bugs. */
506 create_tmp_var (tree type, const char *prefix)
510 /* We don't allow types that are addressable (meaning we can't make copies),
511 or incomplete. We also used to reject every variable size objects here,
512 but now support those for which a constant upper bound can be obtained.
513 The processing for variable sizes is performed in gimple_add_tmp_var,
514 point at which it really matters and possibly reached via paths not going
515 through this function, e.g. after direct calls to create_tmp_var_raw. */
516 gcc_assert (!TREE_ADDRESSABLE (type) && COMPLETE_TYPE_P (type));
518 tmp_var = create_tmp_var_raw (type, prefix);
519 gimple_add_tmp_var (tmp_var);
523 /* Given a tree, try to return a useful variable name that we can use
524 to prefix a temporary that is being assigned the value of the tree.
525 I.E. given <temp> = &A, return A. */
528 get_name (const_tree t)
530 const_tree stripped_decl;
533 STRIP_NOPS (stripped_decl);
534 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
535 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
538 switch (TREE_CODE (stripped_decl))
541 return get_name (TREE_OPERAND (stripped_decl, 0));
548 /* Create a temporary with a name derived from VAL. Subroutine of
549 lookup_tmp_var; nobody else should call this function. */
552 create_tmp_from_val (tree val)
554 return create_tmp_var (TYPE_MAIN_VARIANT (TREE_TYPE (val)), get_name (val));
557 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
558 an existing expression temporary. */
561 lookup_tmp_var (tree val, bool is_formal)
565 /* If not optimizing, never really reuse a temporary. local-alloc
566 won't allocate any variable that is used in more than one basic
567 block, which means it will go into memory, causing much extra
568 work in reload and final and poorer code generation, outweighing
569 the extra memory allocation here. */
570 if (!optimize || !is_formal || TREE_SIDE_EFFECTS (val))
571 ret = create_tmp_from_val (val);
578 slot = htab_find_slot (gimplify_ctxp->temp_htab, (void *)&elt, INSERT);
581 elt_p = XNEW (elt_t);
583 elt_p->temp = ret = create_tmp_from_val (val);
584 *slot = (void *) elt_p;
588 elt_p = (elt_t *) *slot;
594 DECL_GIMPLE_FORMAL_TEMP_P (ret) = 1;
599 /* Returns a formal temporary variable initialized with VAL. PRE_P is as
600 in gimplify_expr. Only use this function if:
602 1) The value of the unfactored expression represented by VAL will not
603 change between the initialization and use of the temporary, and
604 2) The temporary will not be otherwise modified.
606 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
607 and #2 means it is inappropriate for && temps.
609 For other cases, use get_initialized_tmp_var instead. */
612 internal_get_tmp_var (tree val, tree *pre_p, tree *post_p, bool is_formal)
616 gimplify_expr (&val, pre_p, post_p, is_gimple_formal_tmp_rhs, fb_rvalue);
618 t = lookup_tmp_var (val, is_formal);
622 tree u = find_single_pointer_decl (val);
624 if (u && TREE_CODE (u) == VAR_DECL && DECL_BASED_ON_RESTRICT_P (u))
625 u = DECL_GET_RESTRICT_BASE (u);
626 if (u && TYPE_RESTRICT (TREE_TYPE (u)))
628 if (DECL_BASED_ON_RESTRICT_P (t))
629 gcc_assert (u == DECL_GET_RESTRICT_BASE (t));
632 DECL_BASED_ON_RESTRICT_P (t) = 1;
633 SET_DECL_RESTRICT_BASE (t, u);
638 if (TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
639 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
640 DECL_GIMPLE_REG_P (t) = 1;
642 mod = build2 (INIT_EXPR, TREE_TYPE (t), t, unshare_expr (val));
644 if (EXPR_HAS_LOCATION (val))
645 SET_EXPR_LOCUS (mod, EXPR_LOCUS (val));
647 SET_EXPR_LOCATION (mod, input_location);
649 /* gimplify_modify_expr might want to reduce this further. */
650 gimplify_and_add (mod, pre_p);
652 /* If we're gimplifying into ssa, gimplify_modify_expr will have
653 given our temporary an ssa name. Find and return it. */
654 if (gimplify_ctxp->into_ssa)
655 t = TREE_OPERAND (mod, 0);
660 /* Returns a formal temporary variable initialized with VAL. PRE_P
661 points to a statement list where side-effects needed to compute VAL
665 get_formal_tmp_var (tree val, tree *pre_p)
667 return internal_get_tmp_var (val, pre_p, NULL, true);
670 /* Returns a temporary variable initialized with VAL. PRE_P and POST_P
671 are as in gimplify_expr. */
674 get_initialized_tmp_var (tree val, tree *pre_p, tree *post_p)
676 return internal_get_tmp_var (val, pre_p, post_p, false);
679 /* Declares all the variables in VARS in SCOPE. If DEBUG_INFO is
680 true, generate debug info for them; otherwise don't. */
683 declare_vars (tree vars, tree scope, bool debug_info)
690 /* C99 mode puts the default 'return 0;' for main outside the outer
691 braces. So drill down until we find an actual scope. */
692 while (TREE_CODE (scope) == COMPOUND_EXPR)
693 scope = TREE_OPERAND (scope, 0);
695 gcc_assert (TREE_CODE (scope) == BIND_EXPR);
697 temps = nreverse (last);
699 block = BIND_EXPR_BLOCK (scope);
700 if (!block || !debug_info)
702 TREE_CHAIN (last) = BIND_EXPR_VARS (scope);
703 BIND_EXPR_VARS (scope) = temps;
707 /* We need to attach the nodes both to the BIND_EXPR and to its
708 associated BLOCK for debugging purposes. The key point here
709 is that the BLOCK_VARS of the BIND_EXPR_BLOCK of a BIND_EXPR
710 is a subchain of the BIND_EXPR_VARS of the BIND_EXPR. */
711 if (BLOCK_VARS (block))
712 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), temps);
715 BIND_EXPR_VARS (scope) = chainon (BIND_EXPR_VARS (scope), temps);
716 BLOCK_VARS (block) = temps;
722 /* For VAR a VAR_DECL of variable size, try to find a constant upper bound
723 for the size and adjust DECL_SIZE/DECL_SIZE_UNIT accordingly. Abort if
724 no such upper bound can be obtained. */
727 force_constant_size (tree var)
729 /* The only attempt we make is by querying the maximum size of objects
730 of the variable's type. */
732 HOST_WIDE_INT max_size;
734 gcc_assert (TREE_CODE (var) == VAR_DECL);
736 max_size = max_int_size_in_bytes (TREE_TYPE (var));
738 gcc_assert (max_size >= 0);
741 = build_int_cst (TREE_TYPE (DECL_SIZE_UNIT (var)), max_size);
743 = build_int_cst (TREE_TYPE (DECL_SIZE (var)), max_size * BITS_PER_UNIT);
747 gimple_add_tmp_var (tree tmp)
749 gcc_assert (!TREE_CHAIN (tmp) && !DECL_SEEN_IN_BIND_EXPR_P (tmp));
751 /* Later processing assumes that the object size is constant, which might
752 not be true at this point. Force the use of a constant upper bound in
754 if (!host_integerp (DECL_SIZE_UNIT (tmp), 1))
755 force_constant_size (tmp);
757 DECL_CONTEXT (tmp) = current_function_decl;
758 DECL_SEEN_IN_BIND_EXPR_P (tmp) = 1;
762 TREE_CHAIN (tmp) = gimplify_ctxp->temps;
763 gimplify_ctxp->temps = tmp;
765 /* Mark temporaries local within the nearest enclosing parallel. */
766 if (gimplify_omp_ctxp)
768 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
769 while (ctx && ctx->region_type == ORT_WORKSHARE)
770 ctx = ctx->outer_context;
772 omp_add_variable (ctx, tmp, GOVD_LOCAL | GOVD_SEEN);
778 declare_vars (tmp, DECL_SAVED_TREE (current_function_decl), false);
781 /* Determines whether to assign a locus to the statement STMT. */
784 should_carry_locus_p (const_tree stmt)
786 /* Don't emit a line note for a label. We particularly don't want to
787 emit one for the break label, since it doesn't actually correspond
788 to the beginning of the loop/switch. */
789 if (TREE_CODE (stmt) == LABEL_EXPR)
792 /* Do not annotate empty statements, since it confuses gcov. */
793 if (!TREE_SIDE_EFFECTS (stmt))
800 annotate_one_with_locus (tree t, location_t locus)
802 if (CAN_HAVE_LOCATION_P (t)
803 && ! EXPR_HAS_LOCATION (t) && should_carry_locus_p (t))
804 SET_EXPR_LOCATION (t, locus);
808 annotate_all_with_locus (tree *stmt_p, location_t locus)
810 tree_stmt_iterator i;
815 for (i = tsi_start (*stmt_p); !tsi_end_p (i); tsi_next (&i))
817 tree t = tsi_stmt (i);
819 /* Assuming we've already been gimplified, we shouldn't
820 see nested chaining constructs anymore. */
821 gcc_assert (TREE_CODE (t) != STATEMENT_LIST
822 && TREE_CODE (t) != COMPOUND_EXPR);
824 annotate_one_with_locus (t, locus);
828 /* Similar to copy_tree_r() but do not copy SAVE_EXPR or TARGET_EXPR nodes.
829 These nodes model computations that should only be done once. If we
830 were to unshare something like SAVE_EXPR(i++), the gimplification
831 process would create wrong code. */
834 mostly_copy_tree_r (tree *tp, int *walk_subtrees, void *data)
836 enum tree_code code = TREE_CODE (*tp);
837 /* Don't unshare types, decls, constants and SAVE_EXPR nodes. */
838 if (TREE_CODE_CLASS (code) == tcc_type
839 || TREE_CODE_CLASS (code) == tcc_declaration
840 || TREE_CODE_CLASS (code) == tcc_constant
841 || code == SAVE_EXPR || code == TARGET_EXPR
842 /* We can't do anything sensible with a BLOCK used as an expression,
843 but we also can't just die when we see it because of non-expression
844 uses. So just avert our eyes and cross our fingers. Silly Java. */
849 gcc_assert (code != BIND_EXPR);
850 copy_tree_r (tp, walk_subtrees, data);
856 /* Callback for walk_tree to unshare most of the shared trees rooted at
857 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
858 then *TP is deep copied by calling copy_tree_r.
860 This unshares the same trees as copy_tree_r with the exception of
861 SAVE_EXPR nodes. These nodes model computations that should only be
862 done once. If we were to unshare something like SAVE_EXPR(i++), the
863 gimplification process would create wrong code. */
866 copy_if_shared_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
867 void *data ATTRIBUTE_UNUSED)
870 enum tree_code code = TREE_CODE (t);
872 /* Skip types, decls, and constants. But we do want to look at their
873 types and the bounds of types. Mark them as visited so we properly
874 unmark their subtrees on the unmark pass. If we've already seen them,
875 don't look down further. */
876 if (TREE_CODE_CLASS (code) == tcc_type
877 || TREE_CODE_CLASS (code) == tcc_declaration
878 || TREE_CODE_CLASS (code) == tcc_constant)
880 if (TREE_VISITED (t))
883 TREE_VISITED (t) = 1;
886 /* If this node has been visited already, unshare it and don't look
888 else if (TREE_VISITED (t))
890 walk_tree (tp, mostly_copy_tree_r, NULL, NULL);
894 /* Otherwise, mark the tree as visited and keep looking. */
896 TREE_VISITED (t) = 1;
902 unmark_visited_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
903 void *data ATTRIBUTE_UNUSED)
905 if (TREE_VISITED (*tp))
906 TREE_VISITED (*tp) = 0;
913 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
914 bodies of any nested functions if we are unsharing the entire body of
918 unshare_body (tree *body_p, tree fndecl)
920 struct cgraph_node *cgn = cgraph_node (fndecl);
922 walk_tree (body_p, copy_if_shared_r, NULL, NULL);
923 if (body_p == &DECL_SAVED_TREE (fndecl))
924 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
925 unshare_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
928 /* Likewise, but mark all trees as not visited. */
931 unvisit_body (tree *body_p, tree fndecl)
933 struct cgraph_node *cgn = cgraph_node (fndecl);
935 walk_tree (body_p, unmark_visited_r, NULL, NULL);
936 if (body_p == &DECL_SAVED_TREE (fndecl))
937 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
938 unvisit_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
941 /* Unshare T and all the trees reached from T via TREE_CHAIN. */
944 unshare_all_trees (tree t)
946 walk_tree (&t, copy_if_shared_r, NULL, NULL);
947 walk_tree (&t, unmark_visited_r, NULL, NULL);
950 /* Unconditionally make an unshared copy of EXPR. This is used when using
951 stored expressions which span multiple functions, such as BINFO_VTABLE,
952 as the normal unsharing process can't tell that they're shared. */
955 unshare_expr (tree expr)
957 walk_tree (&expr, mostly_copy_tree_r, NULL, NULL);
961 /* A terser interface for building a representation of an exception
965 gimple_build_eh_filter (tree body, tree allowed, tree failure)
969 /* FIXME should the allowed types go in TREE_TYPE? */
970 t = build2 (EH_FILTER_EXPR, void_type_node, allowed, NULL_TREE);
971 append_to_statement_list (failure, &EH_FILTER_FAILURE (t));
973 t = build2 (TRY_CATCH_EXPR, void_type_node, NULL_TREE, t);
974 append_to_statement_list (body, &TREE_OPERAND (t, 0));
980 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
981 contain statements and have a value. Assign its value to a temporary
982 and give it void_type_node. Returns the temporary, or NULL_TREE if
983 WRAPPER was already void. */
986 voidify_wrapper_expr (tree wrapper, tree temp)
988 tree type = TREE_TYPE (wrapper);
989 if (type && !VOID_TYPE_P (type))
993 /* Set p to point to the body of the wrapper. Loop until we find
994 something that isn't a wrapper. */
995 for (p = &wrapper; p && *p; )
997 switch (TREE_CODE (*p))
1000 TREE_SIDE_EFFECTS (*p) = 1;
1001 TREE_TYPE (*p) = void_type_node;
1002 /* For a BIND_EXPR, the body is operand 1. */
1003 p = &BIND_EXPR_BODY (*p);
1006 case CLEANUP_POINT_EXPR:
1007 case TRY_FINALLY_EXPR:
1008 case TRY_CATCH_EXPR:
1009 TREE_SIDE_EFFECTS (*p) = 1;
1010 TREE_TYPE (*p) = void_type_node;
1011 p = &TREE_OPERAND (*p, 0);
1014 case STATEMENT_LIST:
1016 tree_stmt_iterator i = tsi_last (*p);
1017 TREE_SIDE_EFFECTS (*p) = 1;
1018 TREE_TYPE (*p) = void_type_node;
1019 p = tsi_end_p (i) ? NULL : tsi_stmt_ptr (i);
1024 /* Advance to the last statement. Set all container types to void. */
1025 for (; TREE_CODE (*p) == COMPOUND_EXPR; p = &TREE_OPERAND (*p, 1))
1027 TREE_SIDE_EFFECTS (*p) = 1;
1028 TREE_TYPE (*p) = void_type_node;
1038 if (p == NULL || IS_EMPTY_STMT (*p))
1042 /* The wrapper is on the RHS of an assignment that we're pushing
1044 gcc_assert (TREE_CODE (temp) == INIT_EXPR
1045 || TREE_CODE (temp) == GIMPLE_MODIFY_STMT
1046 || TREE_CODE (temp) == MODIFY_EXPR);
1047 GENERIC_TREE_OPERAND (temp, 1) = *p;
1052 temp = create_tmp_var (type, "retval");
1053 *p = build2 (INIT_EXPR, type, temp, *p);
1062 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
1063 a temporary through which they communicate. */
1066 build_stack_save_restore (tree *save, tree *restore)
1068 tree save_call, tmp_var;
1071 build_call_expr (implicit_built_in_decls[BUILT_IN_STACK_SAVE], 0);
1072 tmp_var = create_tmp_var (ptr_type_node, "saved_stack");
1074 *save = build_gimple_modify_stmt (tmp_var, save_call);
1076 build_call_expr (implicit_built_in_decls[BUILT_IN_STACK_RESTORE],
1080 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
1082 static enum gimplify_status
1083 gimplify_bind_expr (tree *expr_p, tree *pre_p)
1085 tree bind_expr = *expr_p;
1086 bool old_save_stack = gimplify_ctxp->save_stack;
1089 tree temp = voidify_wrapper_expr (bind_expr, NULL);
1091 /* Mark variables seen in this bind expr. */
1092 for (t = BIND_EXPR_VARS (bind_expr); t ; t = TREE_CHAIN (t))
1094 if (TREE_CODE (t) == VAR_DECL)
1096 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
1098 /* Mark variable as local. */
1099 if (ctx && !is_global_var (t)
1100 && (! DECL_SEEN_IN_BIND_EXPR_P (t)
1101 || splay_tree_lookup (ctx->variables,
1102 (splay_tree_key) t) == NULL))
1103 omp_add_variable (gimplify_omp_ctxp, t, GOVD_LOCAL | GOVD_SEEN);
1105 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
1108 /* Preliminarily mark non-addressed complex variables as eligible
1109 for promotion to gimple registers. We'll transform their uses
1111 if ((TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
1112 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
1113 && !TREE_THIS_VOLATILE (t)
1114 && (TREE_CODE (t) == VAR_DECL && !DECL_HARD_REGISTER (t))
1115 && !needs_to_live_in_memory (t))
1116 DECL_GIMPLE_REG_P (t) = 1;
1119 gimple_push_bind_expr (bind_expr);
1120 gimplify_ctxp->save_stack = false;
1122 gimplify_to_stmt_list (&BIND_EXPR_BODY (bind_expr));
1124 if (gimplify_ctxp->save_stack)
1126 tree stack_save, stack_restore;
1128 /* Save stack on entry and restore it on exit. Add a try_finally
1129 block to achieve this. Note that mudflap depends on the
1130 format of the emitted code: see mx_register_decls(). */
1131 build_stack_save_restore (&stack_save, &stack_restore);
1133 t = build2 (TRY_FINALLY_EXPR, void_type_node,
1134 BIND_EXPR_BODY (bind_expr), NULL_TREE);
1135 append_to_statement_list (stack_restore, &TREE_OPERAND (t, 1));
1137 BIND_EXPR_BODY (bind_expr) = NULL_TREE;
1138 append_to_statement_list (stack_save, &BIND_EXPR_BODY (bind_expr));
1139 append_to_statement_list (t, &BIND_EXPR_BODY (bind_expr));
1142 gimplify_ctxp->save_stack = old_save_stack;
1143 gimple_pop_bind_expr ();
1148 append_to_statement_list (bind_expr, pre_p);
1155 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1156 GIMPLE value, it is assigned to a new temporary and the statement is
1157 re-written to return the temporary.
1159 PRE_P points to the list where side effects that must happen before
1160 STMT should be stored. */
1162 static enum gimplify_status
1163 gimplify_return_expr (tree stmt, tree *pre_p)
1165 tree ret_expr = TREE_OPERAND (stmt, 0);
1166 tree result_decl, result;
1168 if (!ret_expr || TREE_CODE (ret_expr) == RESULT_DECL
1169 || ret_expr == error_mark_node)
1172 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
1173 result_decl = NULL_TREE;
1176 result_decl = GENERIC_TREE_OPERAND (ret_expr, 0);
1177 if (TREE_CODE (result_decl) == INDIRECT_REF)
1178 /* See through a return by reference. */
1179 result_decl = TREE_OPERAND (result_decl, 0);
1181 gcc_assert ((TREE_CODE (ret_expr) == MODIFY_EXPR
1182 || TREE_CODE (ret_expr) == GIMPLE_MODIFY_STMT
1183 || TREE_CODE (ret_expr) == INIT_EXPR)
1184 && TREE_CODE (result_decl) == RESULT_DECL);
1187 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1188 Recall that aggregate_value_p is FALSE for any aggregate type that is
1189 returned in registers. If we're returning values in registers, then
1190 we don't want to extend the lifetime of the RESULT_DECL, particularly
1191 across another call. In addition, for those aggregates for which
1192 hard_function_value generates a PARALLEL, we'll die during normal
1193 expansion of structure assignments; there's special code in expand_return
1194 to handle this case that does not exist in expand_expr. */
1196 || aggregate_value_p (result_decl, TREE_TYPE (current_function_decl)))
1197 result = result_decl;
1198 else if (gimplify_ctxp->return_temp)
1199 result = gimplify_ctxp->return_temp;
1202 result = create_tmp_var (TREE_TYPE (result_decl), NULL);
1203 if (TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
1204 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
1205 DECL_GIMPLE_REG_P (result) = 1;
1207 /* ??? With complex control flow (usually involving abnormal edges),
1208 we can wind up warning about an uninitialized value for this. Due
1209 to how this variable is constructed and initialized, this is never
1210 true. Give up and never warn. */
1211 TREE_NO_WARNING (result) = 1;
1213 gimplify_ctxp->return_temp = result;
1216 /* Smash the lhs of the GIMPLE_MODIFY_STMT to the temporary we plan to use.
1217 Then gimplify the whole thing. */
1218 if (result != result_decl)
1219 GENERIC_TREE_OPERAND (ret_expr, 0) = result;
1221 gimplify_and_add (TREE_OPERAND (stmt, 0), pre_p);
1223 /* If we didn't use a temporary, then the result is just the result_decl.
1224 Otherwise we need a simple copy. This should already be gimple. */
1225 if (result == result_decl)
1228 ret_expr = build_gimple_modify_stmt (result_decl, result);
1229 TREE_OPERAND (stmt, 0) = ret_expr;
1235 gimplify_vla_decl (tree decl, tree *stmt_p)
1237 /* This is a variable-sized decl. Simplify its size and mark it
1238 for deferred expansion. Note that mudflap depends on the format
1239 of the emitted code: see mx_register_decls(). */
1240 tree t, addr, ptr_type;
1242 gimplify_one_sizepos (&DECL_SIZE (decl), stmt_p);
1243 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl), stmt_p);
1245 /* All occurrences of this decl in final gimplified code will be
1246 replaced by indirection. Setting DECL_VALUE_EXPR does two
1247 things: First, it lets the rest of the gimplifier know what
1248 replacement to use. Second, it lets the debug info know
1249 where to find the value. */
1250 ptr_type = build_pointer_type (TREE_TYPE (decl));
1251 addr = create_tmp_var (ptr_type, get_name (decl));
1252 DECL_IGNORED_P (addr) = 0;
1253 t = build_fold_indirect_ref (addr);
1254 SET_DECL_VALUE_EXPR (decl, t);
1255 DECL_HAS_VALUE_EXPR_P (decl) = 1;
1257 t = built_in_decls[BUILT_IN_ALLOCA];
1258 t = build_call_expr (t, 1, DECL_SIZE_UNIT (decl));
1259 t = fold_convert (ptr_type, t);
1260 t = build_gimple_modify_stmt (addr, t);
1262 gimplify_and_add (t, stmt_p);
1264 /* Indicate that we need to restore the stack level when the
1265 enclosing BIND_EXPR is exited. */
1266 gimplify_ctxp->save_stack = true;
1269 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
1270 and initialization explicit. */
1272 static enum gimplify_status
1273 gimplify_decl_expr (tree *stmt_p)
1275 tree stmt = *stmt_p;
1276 tree decl = DECL_EXPR_DECL (stmt);
1278 *stmt_p = NULL_TREE;
1280 if (TREE_TYPE (decl) == error_mark_node)
1283 if ((TREE_CODE (decl) == TYPE_DECL
1284 || TREE_CODE (decl) == VAR_DECL)
1285 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl)))
1286 gimplify_type_sizes (TREE_TYPE (decl), stmt_p);
1288 if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl))
1290 tree init = DECL_INITIAL (decl);
1292 if (TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
1293 gimplify_vla_decl (decl, stmt_p);
1295 if (init && init != error_mark_node)
1297 if (!TREE_STATIC (decl))
1299 DECL_INITIAL (decl) = NULL_TREE;
1300 init = build2 (INIT_EXPR, void_type_node, decl, init);
1301 gimplify_and_add (init, stmt_p);
1304 /* We must still examine initializers for static variables
1305 as they may contain a label address. */
1306 walk_tree (&init, force_labels_r, NULL, NULL);
1309 /* Some front ends do not explicitly declare all anonymous
1310 artificial variables. We compensate here by declaring the
1311 variables, though it would be better if the front ends would
1312 explicitly declare them. */
1313 if (!DECL_SEEN_IN_BIND_EXPR_P (decl)
1314 && DECL_ARTIFICIAL (decl) && DECL_NAME (decl) == NULL_TREE)
1315 gimple_add_tmp_var (decl);
1321 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1322 and replacing the LOOP_EXPR with goto, but if the loop contains an
1323 EXIT_EXPR, we need to append a label for it to jump to. */
1325 static enum gimplify_status
1326 gimplify_loop_expr (tree *expr_p, tree *pre_p)
1328 tree saved_label = gimplify_ctxp->exit_label;
1329 tree start_label = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
1330 tree jump_stmt = build_and_jump (&LABEL_EXPR_LABEL (start_label));
1332 append_to_statement_list (start_label, pre_p);
1334 gimplify_ctxp->exit_label = NULL_TREE;
1336 gimplify_and_add (LOOP_EXPR_BODY (*expr_p), pre_p);
1338 if (gimplify_ctxp->exit_label)
1340 append_to_statement_list (jump_stmt, pre_p);
1341 *expr_p = build1 (LABEL_EXPR, void_type_node, gimplify_ctxp->exit_label);
1344 *expr_p = jump_stmt;
1346 gimplify_ctxp->exit_label = saved_label;
1351 /* Compare two case labels. Because the front end should already have
1352 made sure that case ranges do not overlap, it is enough to only compare
1353 the CASE_LOW values of each case label. */
1356 compare_case_labels (const void *p1, const void *p2)
1358 const_tree const case1 = *(const_tree const*)p1;
1359 const_tree const case2 = *(const_tree const*)p2;
1361 return tree_int_cst_compare (CASE_LOW (case1), CASE_LOW (case2));
1364 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1367 sort_case_labels (tree label_vec)
1369 size_t len = TREE_VEC_LENGTH (label_vec);
1370 tree default_case = TREE_VEC_ELT (label_vec, len - 1);
1372 if (CASE_LOW (default_case))
1376 /* The last label in the vector should be the default case
1378 for (i = 0; i < len; ++i)
1380 tree t = TREE_VEC_ELT (label_vec, i);
1384 TREE_VEC_ELT (label_vec, i) = TREE_VEC_ELT (label_vec, len - 1);
1385 TREE_VEC_ELT (label_vec, len - 1) = default_case;
1391 qsort (&TREE_VEC_ELT (label_vec, 0), len - 1, sizeof (tree),
1392 compare_case_labels);
1395 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1398 static enum gimplify_status
1399 gimplify_switch_expr (tree *expr_p, tree *pre_p)
1401 tree switch_expr = *expr_p;
1402 enum gimplify_status ret;
1404 ret = gimplify_expr (&SWITCH_COND (switch_expr), pre_p, NULL,
1405 is_gimple_val, fb_rvalue);
1407 if (SWITCH_BODY (switch_expr))
1409 VEC(tree,heap) *labels, *saved_labels;
1410 tree label_vec, default_case = NULL_TREE;
1413 /* If someone can be bothered to fill in the labels, they can
1414 be bothered to null out the body too. */
1415 gcc_assert (!SWITCH_LABELS (switch_expr));
1417 saved_labels = gimplify_ctxp->case_labels;
1418 gimplify_ctxp->case_labels = VEC_alloc (tree, heap, 8);
1420 gimplify_to_stmt_list (&SWITCH_BODY (switch_expr));
1422 labels = gimplify_ctxp->case_labels;
1423 gimplify_ctxp->case_labels = saved_labels;
1426 while (i < VEC_length (tree, labels))
1428 tree elt = VEC_index (tree, labels, i);
1429 tree low = CASE_LOW (elt);
1430 bool remove_element = FALSE;
1434 /* Discard empty ranges. */
1435 tree high = CASE_HIGH (elt);
1436 if (high && tree_int_cst_lt (high, low))
1437 remove_element = TRUE;
1441 /* The default case must be the last label in the list. */
1442 gcc_assert (!default_case);
1444 remove_element = TRUE;
1448 VEC_ordered_remove (tree, labels, i);
1454 label_vec = make_tree_vec (len + 1);
1455 SWITCH_LABELS (*expr_p) = label_vec;
1456 append_to_statement_list (switch_expr, pre_p);
1460 /* If the switch has no default label, add one, so that we jump
1461 around the switch body. */
1462 default_case = build3 (CASE_LABEL_EXPR, void_type_node, NULL_TREE,
1463 NULL_TREE, create_artificial_label ());
1464 append_to_statement_list (SWITCH_BODY (switch_expr), pre_p);
1465 *expr_p = build1 (LABEL_EXPR, void_type_node,
1466 CASE_LABEL (default_case));
1469 *expr_p = SWITCH_BODY (switch_expr);
1471 for (i = 0; i < len; ++i)
1472 TREE_VEC_ELT (label_vec, i) = VEC_index (tree, labels, i);
1473 TREE_VEC_ELT (label_vec, len) = default_case;
1475 VEC_free (tree, heap, labels);
1477 sort_case_labels (label_vec);
1479 SWITCH_BODY (switch_expr) = NULL;
1482 gcc_assert (SWITCH_LABELS (switch_expr));
1487 static enum gimplify_status
1488 gimplify_case_label_expr (tree *expr_p)
1490 tree expr = *expr_p;
1491 struct gimplify_ctx *ctxp;
1493 /* Invalid OpenMP programs can play Duff's Device type games with
1494 #pragma omp parallel. At least in the C front end, we don't
1495 detect such invalid branches until after gimplification. */
1496 for (ctxp = gimplify_ctxp; ; ctxp = ctxp->prev_context)
1497 if (ctxp->case_labels)
1500 VEC_safe_push (tree, heap, ctxp->case_labels, expr);
1501 *expr_p = build1 (LABEL_EXPR, void_type_node, CASE_LABEL (expr));
1505 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1509 build_and_jump (tree *label_p)
1511 if (label_p == NULL)
1512 /* If there's nowhere to jump, just fall through. */
1515 if (*label_p == NULL_TREE)
1517 tree label = create_artificial_label ();
1521 return build1 (GOTO_EXPR, void_type_node, *label_p);
1524 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1525 This also involves building a label to jump to and communicating it to
1526 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1528 static enum gimplify_status
1529 gimplify_exit_expr (tree *expr_p)
1531 tree cond = TREE_OPERAND (*expr_p, 0);
1534 expr = build_and_jump (&gimplify_ctxp->exit_label);
1535 expr = build3 (COND_EXPR, void_type_node, cond, expr, NULL_TREE);
1541 /* A helper function to be called via walk_tree. Mark all labels under *TP
1542 as being forced. To be called for DECL_INITIAL of static variables. */
1545 force_labels_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
1549 if (TREE_CODE (*tp) == LABEL_DECL)
1550 FORCED_LABEL (*tp) = 1;
1555 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1556 different from its canonical type, wrap the whole thing inside a
1557 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1560 The canonical type of a COMPONENT_REF is the type of the field being
1561 referenced--unless the field is a bit-field which can be read directly
1562 in a smaller mode, in which case the canonical type is the
1563 sign-appropriate type corresponding to that mode. */
1566 canonicalize_component_ref (tree *expr_p)
1568 tree expr = *expr_p;
1571 gcc_assert (TREE_CODE (expr) == COMPONENT_REF);
1573 if (INTEGRAL_TYPE_P (TREE_TYPE (expr)))
1574 type = TREE_TYPE (get_unwidened (expr, NULL_TREE));
1576 type = TREE_TYPE (TREE_OPERAND (expr, 1));
1578 /* One could argue that all the stuff below is not necessary for
1579 the non-bitfield case and declare it a FE error if type
1580 adjustment would be needed. */
1581 if (TREE_TYPE (expr) != type)
1583 #ifdef ENABLE_TYPES_CHECKING
1584 tree old_type = TREE_TYPE (expr);
1588 /* We need to preserve qualifiers and propagate them from
1590 type_quals = TYPE_QUALS (type)
1591 | TYPE_QUALS (TREE_TYPE (TREE_OPERAND (expr, 0)));
1592 if (TYPE_QUALS (type) != type_quals)
1593 type = build_qualified_type (TYPE_MAIN_VARIANT (type), type_quals);
1595 /* Set the type of the COMPONENT_REF to the underlying type. */
1596 TREE_TYPE (expr) = type;
1598 #ifdef ENABLE_TYPES_CHECKING
1599 /* It is now a FE error, if the conversion from the canonical
1600 type to the original expression type is not useless. */
1601 gcc_assert (useless_type_conversion_p (old_type, type));
1606 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1607 to foo, embed that change in the ADDR_EXPR by converting
1612 where L is the lower bound. For simplicity, only do this for constant
1614 The constraint is that the type of &array[L] is trivially convertible
1618 canonicalize_addr_expr (tree *expr_p)
1620 tree expr = *expr_p;
1621 tree addr_expr = TREE_OPERAND (expr, 0);
1622 tree datype, ddatype, pddatype;
1624 /* We simplify only conversions from an ADDR_EXPR to a pointer type. */
1625 if (!POINTER_TYPE_P (TREE_TYPE (expr))
1626 || TREE_CODE (addr_expr) != ADDR_EXPR)
1629 /* The addr_expr type should be a pointer to an array. */
1630 datype = TREE_TYPE (TREE_TYPE (addr_expr));
1631 if (TREE_CODE (datype) != ARRAY_TYPE)
1634 /* The pointer to element type shall be trivially convertible to
1635 the expression pointer type. */
1636 ddatype = TREE_TYPE (datype);
1637 pddatype = build_pointer_type (ddatype);
1638 if (!useless_type_conversion_p (pddatype, ddatype))
1641 /* The lower bound and element sizes must be constant. */
1642 if (!TYPE_SIZE_UNIT (ddatype)
1643 || TREE_CODE (TYPE_SIZE_UNIT (ddatype)) != INTEGER_CST
1644 || !TYPE_DOMAIN (datype) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype))
1645 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype))) != INTEGER_CST)
1648 /* All checks succeeded. Build a new node to merge the cast. */
1649 *expr_p = build4 (ARRAY_REF, ddatype, TREE_OPERAND (addr_expr, 0),
1650 TYPE_MIN_VALUE (TYPE_DOMAIN (datype)),
1651 NULL_TREE, NULL_TREE);
1652 *expr_p = build1 (ADDR_EXPR, pddatype, *expr_p);
1655 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1656 underneath as appropriate. */
1658 static enum gimplify_status
1659 gimplify_conversion (tree *expr_p)
1662 gcc_assert (CONVERT_EXPR_P (*expr_p));
1664 /* Then strip away all but the outermost conversion. */
1665 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p, 0));
1667 /* And remove the outermost conversion if it's useless. */
1668 if (tree_ssa_useless_type_conversion (*expr_p))
1669 *expr_p = TREE_OPERAND (*expr_p, 0);
1671 /* Attempt to avoid NOP_EXPR by producing reference to a subtype.
1672 For example this fold (subclass *)&A into &A->subclass avoiding
1673 a need for statement. */
1674 if (TREE_CODE (*expr_p) == NOP_EXPR
1675 && POINTER_TYPE_P (TREE_TYPE (*expr_p))
1676 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p, 0)))
1677 && (tem = maybe_fold_offset_to_reference
1678 (TREE_OPERAND (*expr_p, 0),
1679 integer_zero_node, TREE_TYPE (TREE_TYPE (*expr_p)))))
1681 tree ptr_type = build_pointer_type (TREE_TYPE (tem));
1682 if (useless_type_conversion_p (TREE_TYPE (*expr_p), ptr_type))
1683 *expr_p = build_fold_addr_expr_with_type (tem, ptr_type);
1686 /* If we still have a conversion at the toplevel,
1687 then canonicalize some constructs. */
1688 if (CONVERT_EXPR_P (*expr_p))
1690 tree sub = TREE_OPERAND (*expr_p, 0);
1692 /* If a NOP conversion is changing the type of a COMPONENT_REF
1693 expression, then canonicalize its type now in order to expose more
1694 redundant conversions. */
1695 if (TREE_CODE (sub) == COMPONENT_REF)
1696 canonicalize_component_ref (&TREE_OPERAND (*expr_p, 0));
1698 /* If a NOP conversion is changing a pointer to array of foo
1699 to a pointer to foo, embed that change in the ADDR_EXPR. */
1700 else if (TREE_CODE (sub) == ADDR_EXPR)
1701 canonicalize_addr_expr (expr_p);
1707 /* Gimplify a VAR_DECL or PARM_DECL. Returns GS_OK if we expanded a
1708 DECL_VALUE_EXPR, and it's worth re-examining things. */
1710 static enum gimplify_status
1711 gimplify_var_or_parm_decl (tree *expr_p)
1713 tree decl = *expr_p;
1715 /* ??? If this is a local variable, and it has not been seen in any
1716 outer BIND_EXPR, then it's probably the result of a duplicate
1717 declaration, for which we've already issued an error. It would
1718 be really nice if the front end wouldn't leak these at all.
1719 Currently the only known culprit is C++ destructors, as seen
1720 in g++.old-deja/g++.jason/binding.C. */
1721 if (TREE_CODE (decl) == VAR_DECL
1722 && !DECL_SEEN_IN_BIND_EXPR_P (decl)
1723 && !TREE_STATIC (decl) && !DECL_EXTERNAL (decl)
1724 && decl_function_context (decl) == current_function_decl)
1726 gcc_assert (errorcount || sorrycount);
1730 /* When within an OpenMP context, notice uses of variables. */
1731 if (gimplify_omp_ctxp && omp_notice_variable (gimplify_omp_ctxp, decl, true))
1734 /* If the decl is an alias for another expression, substitute it now. */
1735 if (DECL_HAS_VALUE_EXPR_P (decl))
1737 *expr_p = unshare_expr (DECL_VALUE_EXPR (decl));
1745 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1746 node pointed to by EXPR_P.
1749 : min_lval '[' val ']'
1751 | compound_lval '[' val ']'
1752 | compound_lval '.' ID
1754 This is not part of the original SIMPLE definition, which separates
1755 array and member references, but it seems reasonable to handle them
1756 together. Also, this way we don't run into problems with union
1757 aliasing; gcc requires that for accesses through a union to alias, the
1758 union reference must be explicit, which was not always the case when we
1759 were splitting up array and member refs.
1761 PRE_P points to the list where side effects that must happen before
1762 *EXPR_P should be stored.
1764 POST_P points to the list where side effects that must happen after
1765 *EXPR_P should be stored. */
1767 static enum gimplify_status
1768 gimplify_compound_lval (tree *expr_p, tree *pre_p,
1769 tree *post_p, fallback_t fallback)
1772 VEC(tree,heap) *stack;
1773 enum gimplify_status ret = GS_OK, tret;
1776 /* Create a stack of the subexpressions so later we can walk them in
1777 order from inner to outer. */
1778 stack = VEC_alloc (tree, heap, 10);
1780 /* We can handle anything that get_inner_reference can deal with. */
1781 for (p = expr_p; ; p = &TREE_OPERAND (*p, 0))
1784 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1785 if (TREE_CODE (*p) == INDIRECT_REF)
1786 *p = fold_indirect_ref (*p);
1788 if (handled_component_p (*p))
1790 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
1791 additional COMPONENT_REFs. */
1792 else if ((TREE_CODE (*p) == VAR_DECL || TREE_CODE (*p) == PARM_DECL)
1793 && gimplify_var_or_parm_decl (p) == GS_OK)
1798 VEC_safe_push (tree, heap, stack, *p);
1801 gcc_assert (VEC_length (tree, stack));
1803 /* Now STACK is a stack of pointers to all the refs we've walked through
1804 and P points to the innermost expression.
1806 Java requires that we elaborated nodes in source order. That
1807 means we must gimplify the inner expression followed by each of
1808 the indices, in order. But we can't gimplify the inner
1809 expression until we deal with any variable bounds, sizes, or
1810 positions in order to deal with PLACEHOLDER_EXPRs.
1812 So we do this in three steps. First we deal with the annotations
1813 for any variables in the components, then we gimplify the base,
1814 then we gimplify any indices, from left to right. */
1815 for (i = VEC_length (tree, stack) - 1; i >= 0; i--)
1817 tree t = VEC_index (tree, stack, i);
1819 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
1821 /* Gimplify the low bound and element type size and put them into
1822 the ARRAY_REF. If these values are set, they have already been
1824 if (!TREE_OPERAND (t, 2))
1826 tree low = unshare_expr (array_ref_low_bound (t));
1827 if (!is_gimple_min_invariant (low))
1829 TREE_OPERAND (t, 2) = low;
1830 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1831 is_gimple_formal_tmp_reg, fb_rvalue);
1832 ret = MIN (ret, tret);
1836 if (!TREE_OPERAND (t, 3))
1838 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (t, 0)));
1839 tree elmt_size = unshare_expr (array_ref_element_size (t));
1840 tree factor = size_int (TYPE_ALIGN_UNIT (elmt_type));
1842 /* Divide the element size by the alignment of the element
1844 elmt_size = size_binop (EXACT_DIV_EXPR, elmt_size, factor);
1846 if (!is_gimple_min_invariant (elmt_size))
1848 TREE_OPERAND (t, 3) = elmt_size;
1849 tret = gimplify_expr (&TREE_OPERAND (t, 3), pre_p, post_p,
1850 is_gimple_formal_tmp_reg, fb_rvalue);
1851 ret = MIN (ret, tret);
1855 else if (TREE_CODE (t) == COMPONENT_REF)
1857 /* Set the field offset into T and gimplify it. */
1858 if (!TREE_OPERAND (t, 2))
1860 tree offset = unshare_expr (component_ref_field_offset (t));
1861 tree field = TREE_OPERAND (t, 1);
1863 = size_int (DECL_OFFSET_ALIGN (field) / BITS_PER_UNIT);
1865 /* Divide the offset by its alignment. */
1866 offset = size_binop (EXACT_DIV_EXPR, offset, factor);
1868 if (!is_gimple_min_invariant (offset))
1870 TREE_OPERAND (t, 2) = offset;
1871 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1872 is_gimple_formal_tmp_reg, fb_rvalue);
1873 ret = MIN (ret, tret);
1879 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
1880 so as to match the min_lval predicate. Failure to do so may result
1881 in the creation of large aggregate temporaries. */
1882 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval,
1883 fallback | fb_lvalue);
1884 ret = MIN (ret, tret);
1886 /* And finally, the indices and operands to BIT_FIELD_REF. During this
1887 loop we also remove any useless conversions. */
1888 for (; VEC_length (tree, stack) > 0; )
1890 tree t = VEC_pop (tree, stack);
1892 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
1894 /* Gimplify the dimension.
1895 Temporary fix for gcc.c-torture/execute/20040313-1.c.
1896 Gimplify non-constant array indices into a temporary
1898 FIXME - The real fix is to gimplify post-modify
1899 expressions into a minimal gimple lvalue. However, that
1900 exposes bugs in alias analysis. The alias analyzer does
1901 not handle &PTR->FIELD very well. Will fix after the
1902 branch is merged into mainline (dnovillo 2004-05-03). */
1903 if (!is_gimple_min_invariant (TREE_OPERAND (t, 1)))
1905 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
1906 is_gimple_formal_tmp_reg, fb_rvalue);
1907 ret = MIN (ret, tret);
1910 else if (TREE_CODE (t) == BIT_FIELD_REF)
1912 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
1913 is_gimple_val, fb_rvalue);
1914 ret = MIN (ret, tret);
1915 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1916 is_gimple_val, fb_rvalue);
1917 ret = MIN (ret, tret);
1920 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t, 0));
1922 /* The innermost expression P may have originally had TREE_SIDE_EFFECTS
1923 set which would have caused all the outer expressions in EXPR_P
1924 leading to P to also have had TREE_SIDE_EFFECTS set. */
1925 recalculate_side_effects (t);
1928 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval, fallback);
1929 ret = MIN (ret, tret);
1931 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
1932 if ((fallback & fb_rvalue) && TREE_CODE (*expr_p) == COMPONENT_REF)
1934 canonicalize_component_ref (expr_p);
1935 ret = MIN (ret, GS_OK);
1938 VEC_free (tree, heap, stack);
1943 /* Gimplify the self modifying expression pointed to by EXPR_P
1946 PRE_P points to the list where side effects that must happen before
1947 *EXPR_P should be stored.
1949 POST_P points to the list where side effects that must happen after
1950 *EXPR_P should be stored.
1952 WANT_VALUE is nonzero iff we want to use the value of this expression
1953 in another expression. */
1955 static enum gimplify_status
1956 gimplify_self_mod_expr (tree *expr_p, tree *pre_p, tree *post_p,
1959 enum tree_code code;
1960 tree lhs, lvalue, rhs, t1, post = NULL, *orig_post_p = post_p;
1962 enum tree_code arith_code;
1963 enum gimplify_status ret;
1965 code = TREE_CODE (*expr_p);
1967 gcc_assert (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR
1968 || code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR);
1970 /* Prefix or postfix? */
1971 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
1972 /* Faster to treat as prefix if result is not used. */
1973 postfix = want_value;
1977 /* For postfix, make sure the inner expression's post side effects
1978 are executed after side effects from this expression. */
1982 /* Add or subtract? */
1983 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
1984 arith_code = PLUS_EXPR;
1986 arith_code = MINUS_EXPR;
1988 /* Gimplify the LHS into a GIMPLE lvalue. */
1989 lvalue = TREE_OPERAND (*expr_p, 0);
1990 ret = gimplify_expr (&lvalue, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
1991 if (ret == GS_ERROR)
1994 /* Extract the operands to the arithmetic operation. */
1996 rhs = TREE_OPERAND (*expr_p, 1);
1998 /* For postfix operator, we evaluate the LHS to an rvalue and then use
1999 that as the result value and in the postqueue operation. */
2002 ret = gimplify_expr (&lhs, pre_p, post_p, is_gimple_val, fb_rvalue);
2003 if (ret == GS_ERROR)
2007 /* For POINTERs increment, use POINTER_PLUS_EXPR. */
2008 if (POINTER_TYPE_P (TREE_TYPE (lhs)))
2010 rhs = fold_convert (sizetype, rhs);
2011 if (arith_code == MINUS_EXPR)
2012 rhs = fold_build1 (NEGATE_EXPR, TREE_TYPE (rhs), rhs);
2013 arith_code = POINTER_PLUS_EXPR;
2016 t1 = build2 (arith_code, TREE_TYPE (*expr_p), lhs, rhs);
2017 t1 = build_gimple_modify_stmt (lvalue, t1);
2021 gimplify_and_add (t1, orig_post_p);
2022 append_to_statement_list (post, orig_post_p);
2033 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
2036 maybe_with_size_expr (tree *expr_p)
2038 tree expr = *expr_p;
2039 tree type = TREE_TYPE (expr);
2042 /* If we've already wrapped this or the type is error_mark_node, we can't do
2044 if (TREE_CODE (expr) == WITH_SIZE_EXPR
2045 || type == error_mark_node)
2048 /* If the size isn't known or is a constant, we have nothing to do. */
2049 size = TYPE_SIZE_UNIT (type);
2050 if (!size || TREE_CODE (size) == INTEGER_CST)
2053 /* Otherwise, make a WITH_SIZE_EXPR. */
2054 size = unshare_expr (size);
2055 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, expr);
2056 *expr_p = build2 (WITH_SIZE_EXPR, type, expr, size);
2059 /* Subroutine of gimplify_call_expr: Gimplify a single argument. */
2061 static enum gimplify_status
2062 gimplify_arg (tree *expr_p, tree *pre_p)
2064 bool (*test) (tree);
2067 /* In general, we allow lvalues for function arguments to avoid
2068 extra overhead of copying large aggregates out of even larger
2069 aggregates into temporaries only to copy the temporaries to
2070 the argument list. Make optimizers happy by pulling out to
2071 temporaries those types that fit in registers. */
2072 if (is_gimple_reg_type (TREE_TYPE (*expr_p)))
2073 test = is_gimple_val, fb = fb_rvalue;
2075 test = is_gimple_lvalue, fb = fb_either;
2077 /* If this is a variable sized type, we must remember the size. */
2078 maybe_with_size_expr (expr_p);
2080 /* There is a sequence point before a function call. Side effects in
2081 the argument list must occur before the actual call. So, when
2082 gimplifying arguments, force gimplify_expr to use an internal
2083 post queue which is then appended to the end of PRE_P. */
2084 return gimplify_expr (expr_p, pre_p, NULL, test, fb);
2087 /* Gimplify the CALL_EXPR node pointed to by EXPR_P. PRE_P points to the
2088 list where side effects that must happen before *EXPR_P should be stored.
2089 WANT_VALUE is true if the result of the call is desired. */
2091 static enum gimplify_status
2092 gimplify_call_expr (tree *expr_p, tree *pre_p, bool want_value)
2094 tree decl, parms, p;
2095 enum gimplify_status ret;
2098 gcc_assert (TREE_CODE (*expr_p) == CALL_EXPR);
2100 /* For reliable diagnostics during inlining, it is necessary that
2101 every call_expr be annotated with file and line. */
2102 if (! EXPR_HAS_LOCATION (*expr_p))
2103 SET_EXPR_LOCATION (*expr_p, input_location);
2105 /* This may be a call to a builtin function.
2107 Builtin function calls may be transformed into different
2108 (and more efficient) builtin function calls under certain
2109 circumstances. Unfortunately, gimplification can muck things
2110 up enough that the builtin expanders are not aware that certain
2111 transformations are still valid.
2113 So we attempt transformation/gimplification of the call before
2114 we gimplify the CALL_EXPR. At this time we do not manage to
2115 transform all calls in the same manner as the expanders do, but
2116 we do transform most of them. */
2117 decl = get_callee_fndecl (*expr_p);
2118 if (decl && DECL_BUILT_IN (decl))
2120 tree new = fold_call_expr (*expr_p, !want_value);
2122 if (new && new != *expr_p)
2124 /* There was a transformation of this call which computes the
2125 same value, but in a more efficient way. Return and try
2131 if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
2132 && DECL_FUNCTION_CODE (decl) == BUILT_IN_VA_START)
2134 if (call_expr_nargs (*expr_p) < 2)
2136 error ("too few arguments to function %<va_start%>");
2137 *expr_p = build_empty_stmt ();
2141 if (fold_builtin_next_arg (*expr_p, true))
2143 *expr_p = build_empty_stmt ();
2146 /* Avoid gimplifying the second argument to va_start, which needs
2147 to be the plain PARM_DECL. */
2148 return gimplify_arg (&CALL_EXPR_ARG (*expr_p, 0), pre_p);
2152 /* There is a sequence point before the call, so any side effects in
2153 the calling expression must occur before the actual call. Force
2154 gimplify_expr to use an internal post queue. */
2155 ret = gimplify_expr (&CALL_EXPR_FN (*expr_p), pre_p, NULL,
2156 is_gimple_call_addr, fb_rvalue);
2158 nargs = call_expr_nargs (*expr_p);
2160 /* Get argument types for verification. */
2161 decl = get_callee_fndecl (*expr_p);
2164 parms = TYPE_ARG_TYPES (TREE_TYPE (decl));
2165 else if (POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_FN (*expr_p))))
2166 parms = TYPE_ARG_TYPES (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (*expr_p))));
2168 /* Verify if the type of the argument matches that of the function
2169 declaration. If we cannot verify this or there is a mismatch,
2170 mark the call expression so it doesn't get inlined later. */
2171 if (decl && DECL_ARGUMENTS (decl))
2173 for (i = 0, p = DECL_ARGUMENTS (decl); i < nargs;
2174 i++, p = TREE_CHAIN (p))
2176 /* We cannot distinguish a varargs function from the case
2177 of excess parameters, still deferring the inlining decision
2178 to the callee is possible. */
2181 if (p == error_mark_node
2182 || CALL_EXPR_ARG (*expr_p, i) == error_mark_node
2183 || !fold_convertible_p (DECL_ARG_TYPE (p),
2184 CALL_EXPR_ARG (*expr_p, i)))
2186 CALL_CANNOT_INLINE_P (*expr_p) = 1;
2193 for (i = 0, p = parms; i < nargs; i++, p = TREE_CHAIN (p))
2195 /* If this is a varargs function defer inlining decision
2199 if (TREE_VALUE (p) == error_mark_node
2200 || CALL_EXPR_ARG (*expr_p, i) == error_mark_node
2201 || TREE_CODE (TREE_VALUE (p)) == VOID_TYPE
2202 || !fold_convertible_p (TREE_VALUE (p),
2203 CALL_EXPR_ARG (*expr_p, i)))
2205 CALL_CANNOT_INLINE_P (*expr_p) = 1;
2213 CALL_CANNOT_INLINE_P (*expr_p) = 1;
2218 /* If the last argument is __builtin_va_arg_pack () and it is not
2219 passed as a named argument, decrease the number of CALL_EXPR
2220 arguments and set instead the CALL_EXPR_VA_ARG_PACK flag. */
2223 && TREE_CODE (CALL_EXPR_ARG (*expr_p, nargs - 1)) == CALL_EXPR)
2225 tree last_arg = CALL_EXPR_ARG (*expr_p, nargs - 1);
2226 tree last_arg_fndecl = get_callee_fndecl (last_arg);
2229 && TREE_CODE (last_arg_fndecl) == FUNCTION_DECL
2230 && DECL_BUILT_IN_CLASS (last_arg_fndecl) == BUILT_IN_NORMAL
2231 && DECL_FUNCTION_CODE (last_arg_fndecl) == BUILT_IN_VA_ARG_PACK)
2233 tree call = *expr_p;
2236 *expr_p = build_call_array (TREE_TYPE (call), CALL_EXPR_FN (call),
2237 nargs, CALL_EXPR_ARGP (call));
2238 /* Copy all CALL_EXPR flags, locus and block, except
2239 CALL_EXPR_VA_ARG_PACK flag. */
2240 CALL_EXPR_STATIC_CHAIN (*expr_p) = CALL_EXPR_STATIC_CHAIN (call);
2241 CALL_EXPR_TAILCALL (*expr_p) = CALL_EXPR_TAILCALL (call);
2242 CALL_EXPR_RETURN_SLOT_OPT (*expr_p)
2243 = CALL_EXPR_RETURN_SLOT_OPT (call);
2244 CALL_FROM_THUNK_P (*expr_p) = CALL_FROM_THUNK_P (call);
2245 CALL_CANNOT_INLINE_P (*expr_p)
2246 = CALL_CANNOT_INLINE_P (call);
2247 TREE_NOTHROW (*expr_p) = TREE_NOTHROW (call);
2248 SET_EXPR_LOCUS (*expr_p, EXPR_LOCUS (call));
2249 TREE_BLOCK (*expr_p) = TREE_BLOCK (call);
2250 /* Set CALL_EXPR_VA_ARG_PACK. */
2251 CALL_EXPR_VA_ARG_PACK (*expr_p) = 1;
2255 /* Finally, gimplify the function arguments. */
2256 for (i = (PUSH_ARGS_REVERSED ? nargs - 1 : 0);
2257 PUSH_ARGS_REVERSED ? i >= 0 : i < nargs;
2258 PUSH_ARGS_REVERSED ? i-- : i++)
2260 enum gimplify_status t;
2262 t = gimplify_arg (&CALL_EXPR_ARG (*expr_p, i), pre_p);
2268 /* Try this again in case gimplification exposed something. */
2269 if (ret != GS_ERROR)
2271 tree new = fold_call_expr (*expr_p, !want_value);
2273 if (new && new != *expr_p)
2275 /* There was a transformation of this call which computes the
2276 same value, but in a more efficient way. Return and try
2283 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2284 decl. This allows us to eliminate redundant or useless
2285 calls to "const" functions. */
2286 if (TREE_CODE (*expr_p) == CALL_EXPR)
2288 int flags = call_expr_flags (*expr_p);
2289 if (flags & (ECF_CONST | ECF_PURE)
2290 /* An infinite loop is considered a side effect. */
2291 && !(flags & (ECF_LOOPING_CONST_OR_PURE)))
2292 TREE_SIDE_EFFECTS (*expr_p) = 0;
2297 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2298 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2300 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2301 condition is true or false, respectively. If null, we should generate
2302 our own to skip over the evaluation of this specific expression.
2304 This function is the tree equivalent of do_jump.
2306 shortcut_cond_r should only be called by shortcut_cond_expr. */
2309 shortcut_cond_r (tree pred, tree *true_label_p, tree *false_label_p)
2311 tree local_label = NULL_TREE;
2312 tree t, expr = NULL;
2314 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2315 retain the shortcut semantics. Just insert the gotos here;
2316 shortcut_cond_expr will append the real blocks later. */
2317 if (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2319 /* Turn if (a && b) into
2321 if (a); else goto no;
2322 if (b) goto yes; else goto no;
2325 if (false_label_p == NULL)
2326 false_label_p = &local_label;
2328 t = shortcut_cond_r (TREE_OPERAND (pred, 0), NULL, false_label_p);
2329 append_to_statement_list (t, &expr);
2331 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2333 append_to_statement_list (t, &expr);
2335 else if (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2337 /* Turn if (a || b) into
2340 if (b) goto yes; else goto no;
2343 if (true_label_p == NULL)
2344 true_label_p = &local_label;
2346 t = shortcut_cond_r (TREE_OPERAND (pred, 0), true_label_p, NULL);
2347 append_to_statement_list (t, &expr);
2349 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2351 append_to_statement_list (t, &expr);
2353 else if (TREE_CODE (pred) == COND_EXPR)
2355 /* As long as we're messing with gotos, turn if (a ? b : c) into
2357 if (b) goto yes; else goto no;
2359 if (c) goto yes; else goto no; */
2360 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (pred, 0),
2361 shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2363 shortcut_cond_r (TREE_OPERAND (pred, 2), true_label_p,
2368 expr = build3 (COND_EXPR, void_type_node, pred,
2369 build_and_jump (true_label_p),
2370 build_and_jump (false_label_p));
2375 t = build1 (LABEL_EXPR, void_type_node, local_label);
2376 append_to_statement_list (t, &expr);
2383 shortcut_cond_expr (tree expr)
2385 tree pred = TREE_OPERAND (expr, 0);
2386 tree then_ = TREE_OPERAND (expr, 1);
2387 tree else_ = TREE_OPERAND (expr, 2);
2388 tree true_label, false_label, end_label, t;
2390 tree *false_label_p;
2391 bool emit_end, emit_false, jump_over_else;
2392 bool then_se = then_ && TREE_SIDE_EFFECTS (then_);
2393 bool else_se = else_ && TREE_SIDE_EFFECTS (else_);
2395 /* First do simple transformations. */
2398 /* If there is no 'else', turn (a && b) into if (a) if (b). */
2399 while (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2401 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2402 then_ = shortcut_cond_expr (expr);
2403 then_se = then_ && TREE_SIDE_EFFECTS (then_);
2404 pred = TREE_OPERAND (pred, 0);
2405 expr = build3 (COND_EXPR, void_type_node, pred, then_, NULL_TREE);
2410 /* If there is no 'then', turn
2413 if (a); else if (b); else d. */
2414 while (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2416 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2417 else_ = shortcut_cond_expr (expr);
2418 else_se = else_ && TREE_SIDE_EFFECTS (else_);
2419 pred = TREE_OPERAND (pred, 0);
2420 expr = build3 (COND_EXPR, void_type_node, pred, NULL_TREE, else_);
2424 /* If we're done, great. */
2425 if (TREE_CODE (pred) != TRUTH_ANDIF_EXPR
2426 && TREE_CODE (pred) != TRUTH_ORIF_EXPR)
2429 /* Otherwise we need to mess with gotos. Change
2432 if (a); else goto no;
2435 and recursively gimplify the condition. */
2437 true_label = false_label = end_label = NULL_TREE;
2439 /* If our arms just jump somewhere, hijack those labels so we don't
2440 generate jumps to jumps. */
2443 && TREE_CODE (then_) == GOTO_EXPR
2444 && TREE_CODE (GOTO_DESTINATION (then_)) == LABEL_DECL)
2446 true_label = GOTO_DESTINATION (then_);
2452 && TREE_CODE (else_) == GOTO_EXPR
2453 && TREE_CODE (GOTO_DESTINATION (else_)) == LABEL_DECL)
2455 false_label = GOTO_DESTINATION (else_);
2460 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2462 true_label_p = &true_label;
2464 true_label_p = NULL;
2466 /* The 'else' branch also needs a label if it contains interesting code. */
2467 if (false_label || else_se)
2468 false_label_p = &false_label;
2470 false_label_p = NULL;
2472 /* If there was nothing else in our arms, just forward the label(s). */
2473 if (!then_se && !else_se)
2474 return shortcut_cond_r (pred, true_label_p, false_label_p);
2476 /* If our last subexpression already has a terminal label, reuse it. */
2478 expr = expr_last (else_);
2480 expr = expr_last (then_);
2483 if (expr && TREE_CODE (expr) == LABEL_EXPR)
2484 end_label = LABEL_EXPR_LABEL (expr);
2486 /* If we don't care about jumping to the 'else' branch, jump to the end
2487 if the condition is false. */
2489 false_label_p = &end_label;
2491 /* We only want to emit these labels if we aren't hijacking them. */
2492 emit_end = (end_label == NULL_TREE);
2493 emit_false = (false_label == NULL_TREE);
2495 /* We only emit the jump over the else clause if we have to--if the
2496 then clause may fall through. Otherwise we can wind up with a
2497 useless jump and a useless label at the end of gimplified code,
2498 which will cause us to think that this conditional as a whole
2499 falls through even if it doesn't. If we then inline a function
2500 which ends with such a condition, that can cause us to issue an
2501 inappropriate warning about control reaching the end of a
2502 non-void function. */
2503 jump_over_else = block_may_fallthru (then_);
2505 pred = shortcut_cond_r (pred, true_label_p, false_label_p);
2508 append_to_statement_list (pred, &expr);
2510 append_to_statement_list (then_, &expr);
2515 t = build_and_jump (&end_label);
2516 append_to_statement_list (t, &expr);
2520 t = build1 (LABEL_EXPR, void_type_node, false_label);
2521 append_to_statement_list (t, &expr);
2523 append_to_statement_list (else_, &expr);
2525 if (emit_end && end_label)
2527 t = build1 (LABEL_EXPR, void_type_node, end_label);
2528 append_to_statement_list (t, &expr);
2534 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2537 gimple_boolify (tree expr)
2539 tree type = TREE_TYPE (expr);
2541 if (TREE_CODE (type) == BOOLEAN_TYPE)
2544 switch (TREE_CODE (expr))
2546 case TRUTH_AND_EXPR:
2548 case TRUTH_XOR_EXPR:
2549 case TRUTH_ANDIF_EXPR:
2550 case TRUTH_ORIF_EXPR:
2551 /* Also boolify the arguments of truth exprs. */
2552 TREE_OPERAND (expr, 1) = gimple_boolify (TREE_OPERAND (expr, 1));
2555 case TRUTH_NOT_EXPR:
2556 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2559 case EQ_EXPR: case NE_EXPR:
2560 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2561 /* These expressions always produce boolean results. */
2562 TREE_TYPE (expr) = boolean_type_node;
2566 /* Other expressions that get here must have boolean values, but
2567 might need to be converted to the appropriate mode. */
2568 return fold_convert (boolean_type_node, expr);
2572 /* Given a conditional expression *EXPR_P without side effects, gimplify
2573 its operands. New statements are inserted to PRE_P. */
2575 static enum gimplify_status
2576 gimplify_pure_cond_expr (tree *expr_p, tree *pre_p)
2578 tree expr = *expr_p, cond;
2579 enum gimplify_status ret, tret;
2580 enum tree_code code;
2582 cond = gimple_boolify (COND_EXPR_COND (expr));
2584 /* We need to handle && and || specially, as their gimplification
2585 creates pure cond_expr, thus leading to an infinite cycle otherwise. */
2586 code = TREE_CODE (cond);
2587 if (code == TRUTH_ANDIF_EXPR)
2588 TREE_SET_CODE (cond, TRUTH_AND_EXPR);
2589 else if (code == TRUTH_ORIF_EXPR)
2590 TREE_SET_CODE (cond, TRUTH_OR_EXPR);
2591 ret = gimplify_expr (&cond, pre_p, NULL,
2592 is_gimple_condexpr, fb_rvalue);
2593 COND_EXPR_COND (*expr_p) = cond;
2595 tret = gimplify_expr (&COND_EXPR_THEN (expr), pre_p, NULL,
2596 is_gimple_val, fb_rvalue);
2597 ret = MIN (ret, tret);
2598 tret = gimplify_expr (&COND_EXPR_ELSE (expr), pre_p, NULL,
2599 is_gimple_val, fb_rvalue);
2601 return MIN (ret, tret);
2604 /* Returns true if evaluating EXPR could trap.
2605 EXPR is GENERIC, while tree_could_trap_p can be called
2609 generic_expr_could_trap_p (tree expr)
2613 if (!expr || is_gimple_val (expr))
2616 if (!EXPR_P (expr) || tree_could_trap_p (expr))
2619 n = TREE_OPERAND_LENGTH (expr);
2620 for (i = 0; i < n; i++)
2621 if (generic_expr_could_trap_p (TREE_OPERAND (expr, i)))
2627 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2636 The second form is used when *EXPR_P is of type void.
2638 TARGET is the tree for T1 above.
2640 PRE_P points to the list where side effects that must happen before
2641 *EXPR_P should be stored. */
2643 static enum gimplify_status
2644 gimplify_cond_expr (tree *expr_p, tree *pre_p, fallback_t fallback)
2646 tree expr = *expr_p;
2647 tree tmp, tmp2, type;
2648 enum gimplify_status ret;
2650 type = TREE_TYPE (expr);
2652 /* If this COND_EXPR has a value, copy the values into a temporary within
2654 if (! VOID_TYPE_P (type))
2658 /* If an rvalue is ok or we do not require an lvalue, avoid creating
2659 an addressable temporary. */
2660 if (((fallback & fb_rvalue)
2661 || !(fallback & fb_lvalue))
2662 && !TREE_ADDRESSABLE (type))
2664 if (gimplify_ctxp->allow_rhs_cond_expr
2665 /* If either branch has side effects or could trap, it can't be
2666 evaluated unconditionally. */
2667 && !TREE_SIDE_EFFECTS (TREE_OPERAND (*expr_p, 1))
2668 && !generic_expr_could_trap_p (TREE_OPERAND (*expr_p, 1))
2669 && !TREE_SIDE_EFFECTS (TREE_OPERAND (*expr_p, 2))
2670 && !generic_expr_could_trap_p (TREE_OPERAND (*expr_p, 2)))
2671 return gimplify_pure_cond_expr (expr_p, pre_p);
2673 result = tmp2 = tmp = create_tmp_var (TREE_TYPE (expr), "iftmp");
2678 tree type = build_pointer_type (TREE_TYPE (expr));
2680 if (TREE_TYPE (TREE_OPERAND (expr, 1)) != void_type_node)
2681 TREE_OPERAND (expr, 1) =
2682 build_fold_addr_expr (TREE_OPERAND (expr, 1));
2684 if (TREE_TYPE (TREE_OPERAND (expr, 2)) != void_type_node)
2685 TREE_OPERAND (expr, 2) =
2686 build_fold_addr_expr (TREE_OPERAND (expr, 2));
2688 tmp2 = tmp = create_tmp_var (type, "iftmp");
2690 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (expr, 0),
2691 TREE_OPERAND (expr, 1), TREE_OPERAND (expr, 2));
2693 result = build_fold_indirect_ref (tmp);
2697 /* Build the then clause, 't1 = a;'. But don't build an assignment
2698 if this branch is void; in C++ it can be, if it's a throw. */
2699 if (TREE_TYPE (TREE_OPERAND (expr, 1)) != void_type_node)
2700 TREE_OPERAND (expr, 1)
2701 = build_gimple_modify_stmt (tmp, TREE_OPERAND (expr, 1));
2703 /* Build the else clause, 't1 = b;'. */
2704 if (TREE_TYPE (TREE_OPERAND (expr, 2)) != void_type_node)
2705 TREE_OPERAND (expr, 2)
2706 = build_gimple_modify_stmt (tmp2, TREE_OPERAND (expr, 2));
2708 TREE_TYPE (expr) = void_type_node;
2709 recalculate_side_effects (expr);
2711 /* Move the COND_EXPR to the prequeue. */
2712 gimplify_and_add (expr, pre_p);
2718 /* Make sure the condition has BOOLEAN_TYPE. */
2719 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2721 /* Break apart && and || conditions. */
2722 if (TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ANDIF_EXPR
2723 || TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ORIF_EXPR)
2725 expr = shortcut_cond_expr (expr);
2727 if (expr != *expr_p)
2731 /* We can't rely on gimplify_expr to re-gimplify the expanded
2732 form properly, as cleanups might cause the target labels to be
2733 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2734 set up a conditional context. */
2735 gimple_push_condition ();
2736 gimplify_stmt (expr_p);
2737 gimple_pop_condition (pre_p);
2743 /* Now do the normal gimplification. */
2744 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL,
2745 is_gimple_condexpr, fb_rvalue);
2747 gimple_push_condition ();
2749 gimplify_to_stmt_list (&TREE_OPERAND (expr, 1));
2750 gimplify_to_stmt_list (&TREE_OPERAND (expr, 2));
2751 recalculate_side_effects (expr);
2753 gimple_pop_condition (pre_p);
2755 if (ret == GS_ERROR)
2757 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2759 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 2)))
2760 /* Rewrite "if (a); else b" to "if (!a) b" */
2762 TREE_OPERAND (expr, 0) = invert_truthvalue (TREE_OPERAND (expr, 0));
2763 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL,
2764 is_gimple_condexpr, fb_rvalue);
2766 tmp = TREE_OPERAND (expr, 1);
2767 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 2);
2768 TREE_OPERAND (expr, 2) = tmp;
2771 /* Both arms are empty; replace the COND_EXPR with its predicate. */
2772 expr = TREE_OPERAND (expr, 0);
2778 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2779 a call to __builtin_memcpy. */
2781 static enum gimplify_status
2782 gimplify_modify_expr_to_memcpy (tree *expr_p, tree size, bool want_value)
2784 tree t, to, to_ptr, from, from_ptr;
2786 to = GENERIC_TREE_OPERAND (*expr_p, 0);
2787 from = GENERIC_TREE_OPERAND (*expr_p, 1);
2789 from_ptr = build_fold_addr_expr (from);
2791 to_ptr = build_fold_addr_expr (to);
2792 t = implicit_built_in_decls[BUILT_IN_MEMCPY];
2793 t = build_call_expr (t, 3, to_ptr, from_ptr, size);
2797 t = build1 (NOP_EXPR, TREE_TYPE (to_ptr), t);
2798 t = build1 (INDIRECT_REF, TREE_TYPE (to), t);
2805 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2806 a call to __builtin_memset. In this case we know that the RHS is
2807 a CONSTRUCTOR with an empty element list. */
2809 static enum gimplify_status
2810 gimplify_modify_expr_to_memset (tree *expr_p, tree size, bool want_value)
2812 tree t, from, to, to_ptr;
2814 /* Assert our assumptions, to abort instead of producing wrong code
2815 silently if they are not met. Beware that the RHS CONSTRUCTOR might
2816 not be immediately exposed. */
2817 from = GENERIC_TREE_OPERAND (*expr_p, 1);
2818 if (TREE_CODE (from) == WITH_SIZE_EXPR)
2819 from = TREE_OPERAND (from, 0);
2821 gcc_assert (TREE_CODE (from) == CONSTRUCTOR
2822 && VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (from)));
2825 to = GENERIC_TREE_OPERAND (*expr_p, 0);
2827 to_ptr = build_fold_addr_expr (to);
2828 t = implicit_built_in_decls[BUILT_IN_MEMSET];
2829 t = build_call_expr (t, 3, to_ptr, integer_zero_node, size);
2833 t = build1 (NOP_EXPR, TREE_TYPE (to_ptr), t);
2834 t = build1 (INDIRECT_REF, TREE_TYPE (to), t);
2841 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
2842 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
2843 assignment. Returns non-null if we detect a potential overlap. */
2845 struct gimplify_init_ctor_preeval_data
2847 /* The base decl of the lhs object. May be NULL, in which case we
2848 have to assume the lhs is indirect. */
2851 /* The alias set of the lhs object. */
2852 alias_set_type lhs_alias_set;
2856 gimplify_init_ctor_preeval_1 (tree *tp, int *walk_subtrees, void *xdata)
2858 struct gimplify_init_ctor_preeval_data *data
2859 = (struct gimplify_init_ctor_preeval_data *) xdata;
2862 /* If we find the base object, obviously we have overlap. */
2863 if (data->lhs_base_decl == t)
2866 /* If the constructor component is indirect, determine if we have a
2867 potential overlap with the lhs. The only bits of information we
2868 have to go on at this point are addressability and alias sets. */
2869 if (TREE_CODE (t) == INDIRECT_REF
2870 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
2871 && alias_sets_conflict_p (data->lhs_alias_set, get_alias_set (t)))
2874 /* If the constructor component is a call, determine if it can hide a
2875 potential overlap with the lhs through an INDIRECT_REF like above. */
2876 if (TREE_CODE (t) == CALL_EXPR)
2878 tree type, fntype = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (t)));
2880 for (type = TYPE_ARG_TYPES (fntype); type; type = TREE_CHAIN (type))
2881 if (POINTER_TYPE_P (TREE_VALUE (type))
2882 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
2883 && alias_sets_conflict_p (data->lhs_alias_set,
2885 (TREE_TYPE (TREE_VALUE (type)))))
2889 if (IS_TYPE_OR_DECL_P (t))
2894 /* A subroutine of gimplify_init_constructor. Pre-evaluate *EXPR_P,
2895 force values that overlap with the lhs (as described by *DATA)
2896 into temporaries. */
2899 gimplify_init_ctor_preeval (tree *expr_p, tree *pre_p, tree *post_p,
2900 struct gimplify_init_ctor_preeval_data *data)
2902 enum gimplify_status one;
2904 /* If the value is constant, then there's nothing to pre-evaluate. */
2905 if (TREE_CONSTANT (*expr_p))
2907 /* Ensure it does not have side effects, it might contain a reference to
2908 the object we're initializing. */
2909 gcc_assert (!TREE_SIDE_EFFECTS (*expr_p));
2913 /* If the type has non-trivial constructors, we can't pre-evaluate. */
2914 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p)))
2917 /* Recurse for nested constructors. */
2918 if (TREE_CODE (*expr_p) == CONSTRUCTOR)
2920 unsigned HOST_WIDE_INT ix;
2921 constructor_elt *ce;
2922 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (*expr_p);
2924 for (ix = 0; VEC_iterate (constructor_elt, v, ix, ce); ix++)
2925 gimplify_init_ctor_preeval (&ce->value, pre_p, post_p, data);
2929 /* If this is a variable sized type, we must remember the size. */
2930 maybe_with_size_expr (expr_p);
2932 /* Gimplify the constructor element to something appropriate for the rhs
2933 of a MODIFY_EXPR. Given that we know the lhs is an aggregate, we know
2934 the gimplifier will consider this a store to memory. Doing this
2935 gimplification now means that we won't have to deal with complicated
2936 language-specific trees, nor trees like SAVE_EXPR that can induce
2937 exponential search behavior. */
2938 one = gimplify_expr (expr_p, pre_p, post_p, is_gimple_mem_rhs, fb_rvalue);
2939 if (one == GS_ERROR)
2945 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
2946 with the lhs, since "a = { .x=a }" doesn't make sense. This will
2947 always be true for all scalars, since is_gimple_mem_rhs insists on a
2948 temporary variable for them. */
2949 if (DECL_P (*expr_p))
2952 /* If this is of variable size, we have no choice but to assume it doesn't
2953 overlap since we can't make a temporary for it. */
2954 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (*expr_p))) != INTEGER_CST)
2957 /* Otherwise, we must search for overlap ... */
2958 if (!walk_tree (expr_p, gimplify_init_ctor_preeval_1, data, NULL))
2961 /* ... and if found, force the value into a temporary. */
2962 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
2965 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
2966 a RANGE_EXPR in a CONSTRUCTOR for an array.
2970 object[var] = value;
2977 We increment var _after_ the loop exit check because we might otherwise
2978 fail if upper == TYPE_MAX_VALUE (type for upper).
2980 Note that we never have to deal with SAVE_EXPRs here, because this has
2981 already been taken care of for us, in gimplify_init_ctor_preeval(). */
2983 static void gimplify_init_ctor_eval (tree, VEC(constructor_elt,gc) *,
2987 gimplify_init_ctor_eval_range (tree object, tree lower, tree upper,
2988 tree value, tree array_elt_type,
2989 tree *pre_p, bool cleared)
2991 tree loop_entry_label, loop_exit_label;
2992 tree var, var_type, cref, tmp;
2994 loop_entry_label = create_artificial_label ();
2995 loop_exit_label = create_artificial_label ();
2997 /* Create and initialize the index variable. */
2998 var_type = TREE_TYPE (upper);
2999 var = create_tmp_var (var_type, NULL);
3000 append_to_statement_list (build_gimple_modify_stmt (var, lower), pre_p);
3002 /* Add the loop entry label. */
3003 append_to_statement_list (build1 (LABEL_EXPR,
3008 /* Build the reference. */
3009 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
3010 var, NULL_TREE, NULL_TREE);
3012 /* If we are a constructor, just call gimplify_init_ctor_eval to do
3013 the store. Otherwise just assign value to the reference. */
3015 if (TREE_CODE (value) == CONSTRUCTOR)
3016 /* NB we might have to call ourself recursively through
3017 gimplify_init_ctor_eval if the value is a constructor. */
3018 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
3021 append_to_statement_list (build_gimple_modify_stmt (cref, value), pre_p);
3023 /* We exit the loop when the index var is equal to the upper bound. */
3024 gimplify_and_add (build3 (COND_EXPR, void_type_node,
3025 build2 (EQ_EXPR, boolean_type_node,
3033 /* Otherwise, increment the index var... */
3034 tmp = build2 (PLUS_EXPR, var_type, var,
3035 fold_convert (var_type, integer_one_node));
3036 append_to_statement_list (build_gimple_modify_stmt (var, tmp), pre_p);
3038 /* ...and jump back to the loop entry. */
3039 append_to_statement_list (build1 (GOTO_EXPR,
3044 /* Add the loop exit label. */
3045 append_to_statement_list (build1 (LABEL_EXPR,
3051 /* Return true if FDECL is accessing a field that is zero sized. */
3054 zero_sized_field_decl (const_tree fdecl)
3056 if (TREE_CODE (fdecl) == FIELD_DECL && DECL_SIZE (fdecl)
3057 && integer_zerop (DECL_SIZE (fdecl)))
3062 /* Return true if TYPE is zero sized. */
3065 zero_sized_type (const_tree type)
3067 if (AGGREGATE_TYPE_P (type) && TYPE_SIZE (type)
3068 && integer_zerop (TYPE_SIZE (type)))
3073 /* A subroutine of gimplify_init_constructor. Generate individual
3074 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
3075 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
3076 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
3080 gimplify_init_ctor_eval (tree object, VEC(constructor_elt,gc) *elts,
3081 tree *pre_p, bool cleared)
3083 tree array_elt_type = NULL;
3084 unsigned HOST_WIDE_INT ix;
3085 tree purpose, value;
3087 if (TREE_CODE (TREE_TYPE (object)) == ARRAY_TYPE)
3088 array_elt_type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object)));
3090 FOR_EACH_CONSTRUCTOR_ELT (elts, ix, purpose, value)
3094 /* NULL values are created above for gimplification errors. */
3098 if (cleared && initializer_zerop (value))
3101 /* ??? Here's to hoping the front end fills in all of the indices,
3102 so we don't have to figure out what's missing ourselves. */
3103 gcc_assert (purpose);
3105 /* Skip zero-sized fields, unless value has side-effects. This can
3106 happen with calls to functions returning a zero-sized type, which
3107 we shouldn't discard. As a number of downstream passes don't
3108 expect sets of zero-sized fields, we rely on the gimplification of
3109 the MODIFY_EXPR we make below to drop the assignment statement. */
3110 if (! TREE_SIDE_EFFECTS (value) && zero_sized_field_decl (purpose))
3113 /* If we have a RANGE_EXPR, we have to build a loop to assign the
3115 if (TREE_CODE (purpose) == RANGE_EXPR)
3117 tree lower = TREE_OPERAND (purpose, 0);
3118 tree upper = TREE_OPERAND (purpose, 1);
3120 /* If the lower bound is equal to upper, just treat it as if
3121 upper was the index. */
3122 if (simple_cst_equal (lower, upper))
3126 gimplify_init_ctor_eval_range (object, lower, upper, value,
3127 array_elt_type, pre_p, cleared);
3134 /* Do not use bitsizetype for ARRAY_REF indices. */
3135 if (TYPE_DOMAIN (TREE_TYPE (object)))
3136 purpose = fold_convert (TREE_TYPE (TYPE_DOMAIN (TREE_TYPE (object))),
3138 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
3139 purpose, NULL_TREE, NULL_TREE);
3143 gcc_assert (TREE_CODE (purpose) == FIELD_DECL);
3144 cref = build3 (COMPONENT_REF, TREE_TYPE (purpose),
3145 unshare_expr (object), purpose, NULL_TREE);
3148 if (TREE_CODE (value) == CONSTRUCTOR
3149 && TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE)
3150 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
3154 init = build2 (INIT_EXPR, TREE_TYPE (cref), cref, value);
3155 gimplify_and_add (init, pre_p);
3160 /* A subroutine of gimplify_modify_expr. Break out elements of a
3161 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
3163 Note that we still need to clear any elements that don't have explicit
3164 initializers, so if not all elements are initialized we keep the
3165 original MODIFY_EXPR, we just remove all of the constructor elements.
3167 If NOTIFY_TEMP_CREATION is true, do not gimplify, just return
3168 GS_ERROR if we would have to create a temporary when gimplifying
3169 this constructor. Otherwise, return GS_OK.
3171 If NOTIFY_TEMP_CREATION is false, just do the gimplification. */
3173 static enum gimplify_status
3174 gimplify_init_constructor (tree *expr_p, tree *pre_p,
3175 tree *post_p, bool want_value,
3176 bool notify_temp_creation)
3179 tree ctor = GENERIC_TREE_OPERAND (*expr_p, 1);
3180 tree type = TREE_TYPE (ctor);
3181 enum gimplify_status ret;
3182 VEC(constructor_elt,gc) *elts;
3184 if (TREE_CODE (ctor) != CONSTRUCTOR)
3185 return GS_UNHANDLED;
3187 if (!notify_temp_creation)
3189 ret = gimplify_expr (&GENERIC_TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3190 is_gimple_lvalue, fb_lvalue);
3191 if (ret == GS_ERROR)
3194 object = GENERIC_TREE_OPERAND (*expr_p, 0);
3196 elts = CONSTRUCTOR_ELTS (ctor);
3199 switch (TREE_CODE (type))
3203 case QUAL_UNION_TYPE:
3206 struct gimplify_init_ctor_preeval_data preeval_data;
3207 HOST_WIDE_INT num_type_elements, num_ctor_elements;
3208 HOST_WIDE_INT num_nonzero_elements;
3209 bool cleared, valid_const_initializer;
3211 /* Aggregate types must lower constructors to initialization of
3212 individual elements. The exception is that a CONSTRUCTOR node
3213 with no elements indicates zero-initialization of the whole. */
3214 if (VEC_empty (constructor_elt, elts))
3216 if (notify_temp_creation)
3221 /* Fetch information about the constructor to direct later processing.
3222 We might want to make static versions of it in various cases, and
3223 can only do so if it known to be a valid constant initializer. */
3224 valid_const_initializer
3225 = categorize_ctor_elements (ctor, &num_nonzero_elements,
3226 &num_ctor_elements, &cleared);
3228 /* If a const aggregate variable is being initialized, then it
3229 should never be a lose to promote the variable to be static. */
3230 if (valid_const_initializer
3231 && num_nonzero_elements > 1
3232 && TREE_READONLY (object)
3233 && TREE_CODE (object) == VAR_DECL)
3235 if (notify_temp_creation)
3237 DECL_INITIAL (object) = ctor;
3238 TREE_STATIC (object) = 1;
3239 if (!DECL_NAME (object))
3240 DECL_NAME (object) = create_tmp_var_name ("C");
3241 walk_tree (&DECL_INITIAL (object), force_labels_r, NULL, NULL);
3243 /* ??? C++ doesn't automatically append a .<number> to the
3244 assembler name, and even when it does, it looks a FE private
3245 data structures to figure out what that number should be,
3246 which are not set for this variable. I suppose this is
3247 important for local statics for inline functions, which aren't
3248 "local" in the object file sense. So in order to get a unique
3249 TU-local symbol, we must invoke the lhd version now. */
3250 lhd_set_decl_assembler_name (object);
3252 *expr_p = NULL_TREE;
3256 /* If there are "lots" of initialized elements, even discounting
3257 those that are not address constants (and thus *must* be
3258 computed at runtime), then partition the constructor into
3259 constant and non-constant parts. Block copy the constant
3260 parts in, then generate code for the non-constant parts. */
3261 /* TODO. There's code in cp/typeck.c to do this. */
3263 num_type_elements = count_type_elements (type, true);
3265 /* If count_type_elements could not determine number of type elements
3266 for a constant-sized object, assume clearing is needed.
3267 Don't do this for variable-sized objects, as store_constructor
3268 will ignore the clearing of variable-sized objects. */
3269 if (num_type_elements < 0 && int_size_in_bytes (type) >= 0)
3271 /* If there are "lots" of zeros, then block clear the object first. */
3272 else if (num_type_elements - num_nonzero_elements > CLEAR_RATIO
3273 && num_nonzero_elements < num_type_elements/4)
3275 /* ??? This bit ought not be needed. For any element not present
3276 in the initializer, we should simply set them to zero. Except
3277 we'd need to *find* the elements that are not present, and that
3278 requires trickery to avoid quadratic compile-time behavior in
3279 large cases or excessive memory use in small cases. */
3280 else if (num_ctor_elements < num_type_elements)
3283 /* If there are "lots" of initialized elements, and all of them
3284 are valid address constants, then the entire initializer can
3285 be dropped to memory, and then memcpy'd out. Don't do this
3286 for sparse arrays, though, as it's more efficient to follow
3287 the standard CONSTRUCTOR behavior of memset followed by
3288 individual element initialization. */
3289 if (valid_const_initializer && !cleared)
3291 HOST_WIDE_INT size = int_size_in_bytes (type);
3294 /* ??? We can still get unbounded array types, at least
3295 from the C++ front end. This seems wrong, but attempt
3296 to work around it for now. */
3299 size = int_size_in_bytes (TREE_TYPE (object));
3301 TREE_TYPE (ctor) = type = TREE_TYPE (object);
3304 /* Find the maximum alignment we can assume for the object. */
3305 /* ??? Make use of DECL_OFFSET_ALIGN. */
3306 if (DECL_P (object))
3307 align = DECL_ALIGN (object);
3309 align = TYPE_ALIGN (type);
3311 if (size > 0 && !can_move_by_pieces (size, align))
3315 if (notify_temp_creation)
3318 new = create_tmp_var_raw (type, "C");
3320 gimple_add_tmp_var (new);
3321 TREE_STATIC (new) = 1;
3322 TREE_READONLY (new) = 1;
3323 DECL_INITIAL (new) = ctor;
3324 if (align > DECL_ALIGN (new))
3326 DECL_ALIGN (new) = align;
3327 DECL_USER_ALIGN (new) = 1;
3329 walk_tree (&DECL_INITIAL (new), force_labels_r, NULL, NULL);
3331 GENERIC_TREE_OPERAND (*expr_p, 1) = new;
3333 /* This is no longer an assignment of a CONSTRUCTOR, but
3334 we still may have processing to do on the LHS. So
3335 pretend we didn't do anything here to let that happen. */
3336 return GS_UNHANDLED;
3340 if (notify_temp_creation)
3343 /* If there are nonzero elements, pre-evaluate to capture elements
3344 overlapping with the lhs into temporaries. We must do this before
3345 clearing to fetch the values before they are zeroed-out. */
3346 if (num_nonzero_elements > 0)
3348 preeval_data.lhs_base_decl = get_base_address (object);
3349 if (!DECL_P (preeval_data.lhs_base_decl))
3350 preeval_data.lhs_base_decl = NULL;
3351 preeval_data.lhs_alias_set = get_alias_set (object);
3353 gimplify_init_ctor_preeval (&GENERIC_TREE_OPERAND (*expr_p, 1),
3354 pre_p, post_p, &preeval_data);
3359 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3360 Note that we still have to gimplify, in order to handle the
3361 case of variable sized types. Avoid shared tree structures. */
3362 CONSTRUCTOR_ELTS (ctor) = NULL;
3363 object = unshare_expr (object);
3364 gimplify_stmt (expr_p);
3365 append_to_statement_list (*expr_p, pre_p);
3368 /* If we have not block cleared the object, or if there are nonzero
3369 elements in the constructor, add assignments to the individual
3370 scalar fields of the object. */
3371 if (!cleared || num_nonzero_elements > 0)
3372 gimplify_init_ctor_eval (object, elts, pre_p, cleared);
3374 *expr_p = NULL_TREE;
3382 if (notify_temp_creation)
3385 /* Extract the real and imaginary parts out of the ctor. */
3386 gcc_assert (VEC_length (constructor_elt, elts) == 2);
3387 r = VEC_index (constructor_elt, elts, 0)->value;
3388 i = VEC_index (constructor_elt, elts, 1)->value;
3389 if (r == NULL || i == NULL)
3391 tree zero = fold_convert (TREE_TYPE (type), integer_zero_node);
3398 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3399 represent creation of a complex value. */
3400 if (TREE_CONSTANT (r) && TREE_CONSTANT (i))
3402 ctor = build_complex (type, r, i);
3403 TREE_OPERAND (*expr_p, 1) = ctor;
3407 ctor = build2 (COMPLEX_EXPR, type, r, i);
3408 TREE_OPERAND (*expr_p, 1) = ctor;
3409 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
3410 rhs_predicate_for (TREE_OPERAND (*expr_p, 0)),
3418 unsigned HOST_WIDE_INT ix;
3419 constructor_elt *ce;
3421 if (notify_temp_creation)
3424 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3425 if (TREE_CONSTANT (ctor))
3427 bool constant_p = true;
3430 /* Even when ctor is constant, it might contain non-*_CST
3431 elements, such as addresses or trapping values like
3432 1.0/0.0 - 1.0/0.0. Such expressions don't belong
3433 in VECTOR_CST nodes. */
3434 FOR_EACH_CONSTRUCTOR_VALUE (elts, ix, value)
3435 if (!CONSTANT_CLASS_P (value))
3443 TREE_OPERAND (*expr_p, 1) = build_vector_from_ctor (type, elts);
3447 /* Don't reduce an initializer constant even if we can't
3448 make a VECTOR_CST. It won't do anything for us, and it'll
3449 prevent us from representing it as a single constant. */
3450 if (initializer_constant_valid_p (ctor, type))
3453 TREE_CONSTANT (ctor) = 0;
3456 /* Vector types use CONSTRUCTOR all the way through gimple
3457 compilation as a general initializer. */
3458 for (ix = 0; VEC_iterate (constructor_elt, elts, ix, ce); ix++)
3460 enum gimplify_status tret;
3461 tret = gimplify_expr (&ce->value, pre_p, post_p,
3462 is_gimple_val, fb_rvalue);
3463 if (tret == GS_ERROR)
3466 if (!is_gimple_reg (GENERIC_TREE_OPERAND (*expr_p, 0)))
3467 GENERIC_TREE_OPERAND (*expr_p, 1) = get_formal_tmp_var (ctor, pre_p);
3472 /* So how did we get a CONSTRUCTOR for a scalar type? */
3476 if (ret == GS_ERROR)
3478 else if (want_value)
3480 append_to_statement_list (*expr_p, pre_p);
3488 /* Given a pointer value OP0, return a simplified version of an
3489 indirection through OP0, or NULL_TREE if no simplification is
3490 possible. Note that the resulting type may be different from
3491 the type pointed to in the sense that it is still compatible
3492 from the langhooks point of view. */
3495 gimple_fold_indirect_ref (tree t)
3497 tree type = TREE_TYPE (TREE_TYPE (t));
3501 STRIP_USELESS_TYPE_CONVERSION (sub);
3502 subtype = TREE_TYPE (sub);
3503 if (!POINTER_TYPE_P (subtype))
3506 if (TREE_CODE (sub) == ADDR_EXPR)
3508 tree op = TREE_OPERAND (sub, 0);
3509 tree optype = TREE_TYPE (op);
3511 if (useless_type_conversion_p (type, optype))
3514 /* *(foo *)&fooarray => fooarray[0] */
3515 if (TREE_CODE (optype) == ARRAY_TYPE
3516 && useless_type_conversion_p (type, TREE_TYPE (optype)))
3518 tree type_domain = TYPE_DOMAIN (optype);
3519 tree min_val = size_zero_node;
3520 if (type_domain && TYPE_MIN_VALUE (type_domain))
3521 min_val = TYPE_MIN_VALUE (type_domain);
3522 return build4 (ARRAY_REF, type, op, min_val, NULL_TREE, NULL_TREE);
3526 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
3527 if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
3528 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (subtype))))
3531 tree min_val = size_zero_node;
3533 sub = gimple_fold_indirect_ref (sub);
3535 sub = build1 (INDIRECT_REF, TREE_TYPE (subtype), osub);
3536 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
3537 if (type_domain && TYPE_MIN_VALUE (type_domain))
3538 min_val = TYPE_MIN_VALUE (type_domain);
3539 return build4 (ARRAY_REF, type, sub, min_val, NULL_TREE, NULL_TREE);
3545 /* Given a pointer value OP0, return a simplified version of an
3546 indirection through OP0, or NULL_TREE if no simplification is
3547 possible. This may only be applied to a rhs of an expression.
3548 Note that the resulting type may be different from the type pointed
3549 to in the sense that it is still compatible from the langhooks
3553 gimple_fold_indirect_ref_rhs (tree t)
3555 return gimple_fold_indirect_ref (t);
3558 /* Subroutine of gimplify_modify_expr to do simplifications of
3559 MODIFY_EXPRs based on the code of the RHS. We loop for as long as
3560 something changes. */
3562 static enum gimplify_status
3563 gimplify_modify_expr_rhs (tree *expr_p, tree *from_p, tree *to_p, tree *pre_p,
3564 tree *post_p, bool want_value)
3566 enum gimplify_status ret = GS_OK;
3568 while (ret != GS_UNHANDLED)
3569 switch (TREE_CODE (*from_p))
3572 /* If we're assigning from a constant constructor, move the
3573 constructor expression to the RHS of the MODIFY_EXPR. */
3574 if (DECL_INITIAL (*from_p)
3575 && TYPE_READONLY (TREE_TYPE (*from_p))
3576 && !TREE_THIS_VOLATILE (*from_p)
3577 && TREE_CODE (DECL_INITIAL (*from_p)) == CONSTRUCTOR)
3579 tree old_from = *from_p;
3581 /* Move the constructor into the RHS. */
3582 *from_p = unshare_expr (DECL_INITIAL (*from_p));
3584 /* Let's see if gimplify_init_constructor will need to put
3585 it in memory. If so, revert the change. */
3586 ret = gimplify_init_constructor (expr_p, NULL, NULL, false, true);
3587 if (ret == GS_ERROR)
3602 /* If we have code like
3606 where the type of "x" is a (possibly cv-qualified variant
3607 of "A"), treat the entire expression as identical to "x".
3608 This kind of code arises in C++ when an object is bound
3609 to a const reference, and if "x" is a TARGET_EXPR we want
3610 to take advantage of the optimization below. */
3611 tree t = gimple_fold_indirect_ref_rhs (TREE_OPERAND (*from_p, 0));
3624 /* If we are initializing something from a TARGET_EXPR, strip the
3625 TARGET_EXPR and initialize it directly, if possible. This can't
3626 be done if the initializer is void, since that implies that the
3627 temporary is set in some non-trivial way.
3629 ??? What about code that pulls out the temp and uses it
3630 elsewhere? I think that such code never uses the TARGET_EXPR as
3631 an initializer. If I'm wrong, we'll die because the temp won't
3632 have any RTL. In that case, I guess we'll need to replace
3633 references somehow. */
3634 tree init = TARGET_EXPR_INITIAL (*from_p);
3637 && !VOID_TYPE_P (TREE_TYPE (init)))
3648 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
3650 gimplify_compound_expr (from_p, pre_p, true);
3655 /* If we're initializing from a CONSTRUCTOR, break this into
3656 individual MODIFY_EXPRs. */
3657 return gimplify_init_constructor (expr_p, pre_p, post_p, want_value,
3661 /* If we're assigning to a non-register type, push the assignment
3662 down into the branches. This is mandatory for ADDRESSABLE types,
3663 since we cannot generate temporaries for such, but it saves a
3664 copy in other cases as well. */
3665 if (!is_gimple_reg_type (TREE_TYPE (*from_p)))
3667 /* This code should mirror the code in gimplify_cond_expr. */
3668 enum tree_code code = TREE_CODE (*expr_p);
3669 tree cond = *from_p;
3670 tree result = *to_p;
3672 ret = gimplify_expr (&result, pre_p, post_p,
3673 is_gimple_lvalue, fb_lvalue);
3674 if (ret != GS_ERROR)
3677 if (TREE_TYPE (TREE_OPERAND (cond, 1)) != void_type_node)
3678 TREE_OPERAND (cond, 1)
3679 = build2 (code, void_type_node, result,
3680 TREE_OPERAND (cond, 1));
3681 if (TREE_TYPE (TREE_OPERAND (cond, 2)) != void_type_node)
3682 TREE_OPERAND (cond, 2)
3683 = build2 (code, void_type_node, unshare_expr (result),
3684 TREE_OPERAND (cond, 2));
3686 TREE_TYPE (cond) = void_type_node;
3687 recalculate_side_effects (cond);
3691 gimplify_and_add (cond, pre_p);
3692 *expr_p = unshare_expr (result);
3703 /* For calls that return in memory, give *to_p as the CALL_EXPR's
3704 return slot so that we don't generate a temporary. */
3705 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p)
3706 && aggregate_value_p (*from_p, *from_p))
3710 if (!(rhs_predicate_for (*to_p))(*from_p))
3711 /* If we need a temporary, *to_p isn't accurate. */
3713 else if (TREE_CODE (*to_p) == RESULT_DECL
3714 && DECL_NAME (*to_p) == NULL_TREE
3715 && needs_to_live_in_memory (*to_p))
3716 /* It's OK to use the return slot directly unless it's an NRV. */
3718 else if (is_gimple_reg_type (TREE_TYPE (*to_p))
3719 || (DECL_P (*to_p) && DECL_REGISTER (*to_p)))
3720 /* Don't force regs into memory. */
3722 else if (TREE_CODE (*to_p) == VAR_DECL
3723 && DECL_GIMPLE_FORMAL_TEMP_P (*to_p))
3724 /* Don't use the original target if it's a formal temp; we
3725 don't want to take their addresses. */
3727 else if (TREE_CODE (*expr_p) == INIT_EXPR)
3728 /* It's OK to use the target directly if it's being
3731 else if (!is_gimple_non_addressable (*to_p))
3732 /* Don't use the original target if it's already addressable;
3733 if its address escapes, and the called function uses the
3734 NRV optimization, a conforming program could see *to_p
3735 change before the called function returns; see c++/19317.
3736 When optimizing, the return_slot pass marks more functions
3737 as safe after we have escape info. */
3744 CALL_EXPR_RETURN_SLOT_OPT (*from_p) = 1;
3745 mark_addressable (*to_p);
3752 /* If we're initializing from a container, push the initialization
3754 case CLEANUP_POINT_EXPR:
3756 case STATEMENT_LIST:
3758 tree wrap = *from_p;
3761 ret = gimplify_expr (to_p, pre_p, post_p,
3762 is_gimple_min_lval, fb_lvalue);
3763 if (ret != GS_ERROR)
3766 t = voidify_wrapper_expr (wrap, *expr_p);
3767 gcc_assert (t == *expr_p);
3771 gimplify_and_add (wrap, pre_p);
3772 *expr_p = unshare_expr (*to_p);
3787 /* Destructively convert the TREE pointer in TP into a gimple tuple if
3791 tree_to_gimple_tuple (tree *tp)
3794 switch (TREE_CODE (*tp))
3796 case GIMPLE_MODIFY_STMT:
3800 struct gimple_stmt *gs;
3801 tree lhs = TREE_OPERAND (*tp, 0);
3802 bool def_stmt_self_p = false;
3804 if (TREE_CODE (lhs) == SSA_NAME)
3806 if (SSA_NAME_DEF_STMT (lhs) == *tp)
3807 def_stmt_self_p = true;
3810 gs = &make_node (GIMPLE_MODIFY_STMT)->gstmt;
3811 gs->base = (*tp)->base;
3812 /* The set to base above overwrites the CODE. */
3813 TREE_SET_CODE ((tree) gs, GIMPLE_MODIFY_STMT);
3815 SET_EXPR_LOCUS ((tree) gs, EXPR_LOCUS (*tp));
3816 gs->operands[0] = TREE_OPERAND (*tp, 0);
3817 gs->operands[1] = TREE_OPERAND (*tp, 1);
3818 gs->block = TREE_BLOCK (*tp);
3821 /* If we re-gimplify a set to an SSA_NAME, we must change the
3822 SSA name's DEF_STMT link. */
3823 if (def_stmt_self_p)
3824 SSA_NAME_DEF_STMT (GIMPLE_STMT_OPERAND (*tp, 0)) = *tp;
3833 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
3834 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
3835 DECL_GIMPLE_REG_P set.
3837 IMPORTANT NOTE: This promotion is performed by introducing a load of the
3838 other, unmodified part of the complex object just before the total store.
3839 As a consequence, if the object is still uninitialized, an undefined value
3840 will be loaded into a register, which may result in a spurious exception
3841 if the register is floating-point and the value happens to be a signaling
3842 NaN for example. Then the fully-fledged complex operations lowering pass
3843 followed by a DCE pass are necessary in order to fix things up. */
3845 static enum gimplify_status
3846 gimplify_modify_expr_complex_part (tree *expr_p, tree *pre_p, bool want_value)
3848 enum tree_code code, ocode;
3849 tree lhs, rhs, new_rhs, other, realpart, imagpart;
3851 lhs = GENERIC_TREE_OPERAND (*expr_p, 0);
3852 rhs = GENERIC_TREE_OPERAND (*expr_p, 1);
3853 code = TREE_CODE (lhs);
3854 lhs = TREE_OPERAND (lhs, 0);
3856 ocode = code == REALPART_EXPR ? IMAGPART_EXPR : REALPART_EXPR;
3857 other = build1 (ocode, TREE_TYPE (rhs), lhs);
3858 other = get_formal_tmp_var (other, pre_p);
3860 realpart = code == REALPART_EXPR ? rhs : other;
3861 imagpart = code == REALPART_EXPR ? other : rhs;
3863 if (TREE_CONSTANT (realpart) && TREE_CONSTANT (imagpart))
3864 new_rhs = build_complex (TREE_TYPE (lhs), realpart, imagpart);
3866 new_rhs = build2 (COMPLEX_EXPR, TREE_TYPE (lhs), realpart, imagpart);
3868 GENERIC_TREE_OPERAND (*expr_p, 0) = lhs;
3869 GENERIC_TREE_OPERAND (*expr_p, 1) = new_rhs;
3873 tree_to_gimple_tuple (expr_p);
3875 append_to_statement_list (*expr_p, pre_p);
3882 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
3888 PRE_P points to the list where side effects that must happen before
3889 *EXPR_P should be stored.
3891 POST_P points to the list where side effects that must happen after
3892 *EXPR_P should be stored.
3894 WANT_VALUE is nonzero iff we want to use the value of this expression
3895 in another expression. */
3897 static enum gimplify_status
3898 gimplify_modify_expr (tree *expr_p, tree *pre_p, tree *post_p, bool want_value)
3900 tree *from_p = &GENERIC_TREE_OPERAND (*expr_p, 1);
3901 tree *to_p = &GENERIC_TREE_OPERAND (*expr_p, 0);
3902 enum gimplify_status ret = GS_UNHANDLED;
3904 gcc_assert (TREE_CODE (*expr_p) == MODIFY_EXPR
3905 || TREE_CODE (*expr_p) == GIMPLE_MODIFY_STMT
3906 || TREE_CODE (*expr_p) == INIT_EXPR);
3908 /* Insert pointer conversions required by the middle-end that are not
3909 required by the frontend. This fixes middle-end type checking for
3910 for example gcc.dg/redecl-6.c. */
3911 if (POINTER_TYPE_P (TREE_TYPE (*to_p))
3912 && lang_hooks.types_compatible_p (TREE_TYPE (*to_p), TREE_TYPE (*from_p)))
3914 STRIP_USELESS_TYPE_CONVERSION (*from_p);
3915 if (!useless_type_conversion_p (TREE_TYPE (*to_p), TREE_TYPE (*from_p)))
3916 *from_p = fold_convert (TREE_TYPE (*to_p), *from_p);
3919 /* See if any simplifications can be done based on what the RHS is. */
3920 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
3922 if (ret != GS_UNHANDLED)
3925 /* For zero sized types only gimplify the left hand side and right hand
3926 side as statements and throw away the assignment. Do this after
3927 gimplify_modify_expr_rhs so we handle TARGET_EXPRs of addressable
3929 if (zero_sized_type (TREE_TYPE (*from_p)))
3931 gimplify_stmt (from_p);
3932 gimplify_stmt (to_p);
3933 append_to_statement_list (*from_p, pre_p);
3934 append_to_statement_list (*to_p, pre_p);
3935 *expr_p = NULL_TREE;
3939 /* If the value being copied is of variable width, compute the length
3940 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
3941 before gimplifying any of the operands so that we can resolve any
3942 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
3943 the size of the expression to be copied, not of the destination, so
3944 that is what we must here. */
3945 maybe_with_size_expr (from_p);
3947 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
3948 if (ret == GS_ERROR)
3951 ret = gimplify_expr (from_p, pre_p, post_p,
3952 rhs_predicate_for (*to_p), fb_rvalue);
3953 if (ret == GS_ERROR)
3956 /* Now see if the above changed *from_p to something we handle specially. */
3957 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
3959 if (ret != GS_UNHANDLED)
3962 /* If we've got a variable sized assignment between two lvalues (i.e. does
3963 not involve a call), then we can make things a bit more straightforward
3964 by converting the assignment to memcpy or memset. */
3965 if (TREE_CODE (*from_p) == WITH_SIZE_EXPR)
3967 tree from = TREE_OPERAND (*from_p, 0);
3968 tree size = TREE_OPERAND (*from_p, 1);
3970 if (TREE_CODE (from) == CONSTRUCTOR)
3971 return gimplify_modify_expr_to_memset (expr_p, size, want_value);
3972 if (is_gimple_addressable (from))
3975 return gimplify_modify_expr_to_memcpy (expr_p, size, want_value);
3979 /* Transform partial stores to non-addressable complex variables into
3980 total stores. This allows us to use real instead of virtual operands
3981 for these variables, which improves optimization. */
3982 if ((TREE_CODE (*to_p) == REALPART_EXPR
3983 || TREE_CODE (*to_p) == IMAGPART_EXPR)
3984 && is_gimple_reg (TREE_OPERAND (*to_p, 0)))
3985 return gimplify_modify_expr_complex_part (expr_p, pre_p, want_value);
3987 if (gimplify_ctxp->into_ssa && is_gimple_reg (*to_p))
3989 /* If we've somehow already got an SSA_NAME on the LHS, then
3990 we're probably modified it twice. Not good. */
3991 gcc_assert (TREE_CODE (*to_p) != SSA_NAME);
3992 *to_p = make_ssa_name (*to_p, *expr_p);
3995 /* Try to alleviate the effects of the gimplification creating artificial
3996 temporaries (see for example is_gimple_reg_rhs) on the debug info. */
3997 if (!gimplify_ctxp->into_ssa
3998 && DECL_P (*from_p) && DECL_IGNORED_P (*from_p)
3999 && DECL_P (*to_p) && !DECL_IGNORED_P (*to_p))
4001 if (!DECL_NAME (*from_p) && DECL_NAME (*to_p))
4003 = create_tmp_var_name (IDENTIFIER_POINTER (DECL_NAME (*to_p)));
4004 DECL_DEBUG_EXPR_IS_FROM (*from_p) = 1;
4005 SET_DECL_DEBUG_EXPR (*from_p, *to_p);
4010 tree_to_gimple_tuple (expr_p);
4012 append_to_statement_list (*expr_p, pre_p);
4020 /* Gimplify a comparison between two variable-sized objects. Do this
4021 with a call to BUILT_IN_MEMCMP. */
4023 static enum gimplify_status
4024 gimplify_variable_sized_compare (tree *expr_p)
4026 tree op0 = TREE_OPERAND (*expr_p, 0);
4027 tree op1 = TREE_OPERAND (*expr_p, 1);
4028 tree t, arg, dest, src;
4030 arg = TYPE_SIZE_UNIT (TREE_TYPE (op0));
4031 arg = unshare_expr (arg);
4032 arg = SUBSTITUTE_PLACEHOLDER_IN_EXPR (arg, op0);
4033 src = build_fold_addr_expr (op1);
4034 dest = build_fold_addr_expr (op0);
4035 t = implicit_built_in_decls[BUILT_IN_MEMCMP];
4036 t = build_call_expr (t, 3, dest, src, arg);
4038 = build2 (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), t, integer_zero_node);
4043 /* Gimplify a comparison between two aggregate objects of integral scalar
4044 mode as a comparison between the bitwise equivalent scalar values. */
4046 static enum gimplify_status
4047 gimplify_scalar_mode_aggregate_compare (tree *expr_p)
4049 tree op0 = TREE_OPERAND (*expr_p, 0);
4050 tree op1 = TREE_OPERAND (*expr_p, 1);
4052 tree type = TREE_TYPE (op0);
4053 tree scalar_type = lang_hooks.types.type_for_mode (TYPE_MODE (type), 1);
4055 op0 = fold_build1 (VIEW_CONVERT_EXPR, scalar_type, op0);
4056 op1 = fold_build1 (VIEW_CONVERT_EXPR, scalar_type, op1);
4059 = fold_build2 (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), op0, op1);
4064 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
4065 points to the expression to gimplify.
4067 Expressions of the form 'a && b' are gimplified to:
4069 a && b ? true : false
4071 gimplify_cond_expr will do the rest.
4073 PRE_P points to the list where side effects that must happen before
4074 *EXPR_P should be stored. */
4076 static enum gimplify_status
4077 gimplify_boolean_expr (tree *expr_p)
4079 /* Preserve the original type of the expression. */
4080 tree type = TREE_TYPE (*expr_p);
4082 *expr_p = build3 (COND_EXPR, type, *expr_p,
4083 fold_convert (type, boolean_true_node),
4084 fold_convert (type, boolean_false_node));
4089 /* Gimplifies an expression sequence. This function gimplifies each
4090 expression and re-writes the original expression with the last
4091 expression of the sequence in GIMPLE form.
4093 PRE_P points to the list where the side effects for all the
4094 expressions in the sequence will be emitted.
4096 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
4097 /* ??? Should rearrange to share the pre-queue with all the indirect
4098 invocations of gimplify_expr. Would probably save on creations
4099 of statement_list nodes. */
4101 static enum gimplify_status
4102 gimplify_compound_expr (tree *expr_p, tree *pre_p, bool want_value)
4108 tree *sub_p = &TREE_OPERAND (t, 0);
4110 if (TREE_CODE (*sub_p) == COMPOUND_EXPR)
4111 gimplify_compound_expr (sub_p, pre_p, false);
4113 gimplify_stmt (sub_p);
4114 append_to_statement_list (*sub_p, pre_p);
4116 t = TREE_OPERAND (t, 1);
4118 while (TREE_CODE (t) == COMPOUND_EXPR);
4125 gimplify_stmt (expr_p);
4130 /* Gimplifies a statement list. These may be created either by an
4131 enlightened front-end, or by shortcut_cond_expr. */
4133 static enum gimplify_status
4134 gimplify_statement_list (tree *expr_p, tree *pre_p)
4136 tree temp = voidify_wrapper_expr (*expr_p, NULL);
4138 tree_stmt_iterator i = tsi_start (*expr_p);
4140 while (!tsi_end_p (i))
4144 gimplify_stmt (tsi_stmt_ptr (i));
4149 else if (TREE_CODE (t) == STATEMENT_LIST)
4151 tsi_link_before (&i, t, TSI_SAME_STMT);
4160 append_to_statement_list (*expr_p, pre_p);
4168 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
4169 gimplify. After gimplification, EXPR_P will point to a new temporary
4170 that holds the original value of the SAVE_EXPR node.
4172 PRE_P points to the list where side effects that must happen before
4173 *EXPR_P should be stored. */
4175 static enum gimplify_status
4176 gimplify_save_expr (tree *expr_p, tree *pre_p, tree *post_p)
4178 enum gimplify_status ret = GS_ALL_DONE;
4181 gcc_assert (TREE_CODE (*expr_p) == SAVE_EXPR);
4182 val = TREE_OPERAND (*expr_p, 0);
4184 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
4185 if (!SAVE_EXPR_RESOLVED_P (*expr_p))
4187 /* The operand may be a void-valued expression such as SAVE_EXPRs
4188 generated by the Java frontend for class initialization. It is
4189 being executed only for its side-effects. */
4190 if (TREE_TYPE (val) == void_type_node)
4192 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
4193 is_gimple_stmt, fb_none);
4194 append_to_statement_list (TREE_OPERAND (*expr_p, 0), pre_p);
4198 val = get_initialized_tmp_var (val, pre_p, post_p);
4200 TREE_OPERAND (*expr_p, 0) = val;
4201 SAVE_EXPR_RESOLVED_P (*expr_p) = 1;
4209 /* Re-write the ADDR_EXPR node pointed to by EXPR_P
4216 PRE_P points to the list where side effects that must happen before
4217 *EXPR_P should be stored.
4219 POST_P points to the list where side effects that must happen after
4220 *EXPR_P should be stored. */
4222 static enum gimplify_status
4223 gimplify_addr_expr (tree *expr_p, tree *pre_p, tree *post_p)
4225 tree expr = *expr_p;
4226 tree op0 = TREE_OPERAND (expr, 0);
4227 enum gimplify_status ret;
4229 switch (TREE_CODE (op0))
4232 case MISALIGNED_INDIRECT_REF:
4234 /* Check if we are dealing with an expression of the form '&*ptr'.
4235 While the front end folds away '&*ptr' into 'ptr', these
4236 expressions may be generated internally by the compiler (e.g.,
4237 builtins like __builtin_va_end). */
4238 /* Caution: the silent array decomposition semantics we allow for
4239 ADDR_EXPR means we can't always discard the pair. */
4240 /* Gimplification of the ADDR_EXPR operand may drop
4241 cv-qualification conversions, so make sure we add them if
4244 tree op00 = TREE_OPERAND (op0, 0);
4245 tree t_expr = TREE_TYPE (expr);
4246 tree t_op00 = TREE_TYPE (op00);
4248 if (!useless_type_conversion_p (t_expr, t_op00))
4249 op00 = fold_convert (TREE_TYPE (expr), op00);
4255 case VIEW_CONVERT_EXPR:
4256 /* Take the address of our operand and then convert it to the type of
4259 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
4260 all clear. The impact of this transformation is even less clear. */
4262 /* If the operand is a useless conversion, look through it. Doing so
4263 guarantees that the ADDR_EXPR and its operand will remain of the
4265 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0, 0)))
4266 op0 = TREE_OPERAND (op0, 0);
4268 *expr_p = fold_convert (TREE_TYPE (expr),
4269 build_fold_addr_expr (TREE_OPERAND (op0, 0)));
4274 /* We use fb_either here because the C frontend sometimes takes
4275 the address of a call that returns a struct; see
4276 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
4277 the implied temporary explicit. */
4279 /* Mark the RHS addressable. */
4280 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, post_p,
4281 is_gimple_addressable, fb_either);
4282 if (ret != GS_ERROR)
4284 op0 = TREE_OPERAND (expr, 0);
4286 /* For various reasons, the gimplification of the expression
4287 may have made a new INDIRECT_REF. */
4288 if (TREE_CODE (op0) == INDIRECT_REF)
4289 goto do_indirect_ref;
4291 /* Make sure TREE_CONSTANT and TREE_SIDE_EFFECTS are set properly. */
4292 recompute_tree_invariant_for_addr_expr (expr);
4294 mark_addressable (TREE_OPERAND (expr, 0));
4302 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
4303 value; output operands should be a gimple lvalue. */
4305 static enum gimplify_status
4306 gimplify_asm_expr (tree *expr_p, tree *pre_p, tree *post_p)
4308 tree expr = *expr_p;
4309 int noutputs = list_length (ASM_OUTPUTS (expr));
4310 const char **oconstraints
4311 = (const char **) alloca ((noutputs) * sizeof (const char *));
4314 const char *constraint;
4315 bool allows_mem, allows_reg, is_inout;
4316 enum gimplify_status ret, tret;
4319 for (i = 0, link = ASM_OUTPUTS (expr); link; ++i, link = TREE_CHAIN (link))
4321 size_t constraint_len;
4323 oconstraints[i] = constraint
4324 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4325 constraint_len = strlen (constraint);
4326 if (constraint_len == 0)
4329 ok = parse_output_constraint (&constraint, i, 0, 0,
4330 &allows_mem, &allows_reg, &is_inout);
4337 if (!allows_reg && allows_mem)
4338 mark_addressable (TREE_VALUE (link));
4340 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4341 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
4342 fb_lvalue | fb_mayfail);
4343 if (tret == GS_ERROR)
4345 error ("invalid lvalue in asm output %d", i);
4351 /* An input/output operand. To give the optimizers more
4352 flexibility, split it into separate input and output
4357 /* Turn the in/out constraint into an output constraint. */
4358 char *p = xstrdup (constraint);
4360 TREE_VALUE (TREE_PURPOSE (link)) = build_string (constraint_len, p);
4362 /* And add a matching input constraint. */
4365 sprintf (buf, "%d", i);
4367 /* If there are multiple alternatives in the constraint,
4368 handle each of them individually. Those that allow register
4369 will be replaced with operand number, the others will stay
4371 if (strchr (p, ',') != NULL)
4373 size_t len = 0, buflen = strlen (buf);
4374 char *beg, *end, *str, *dst;
4378 end = strchr (beg, ',');
4380 end = strchr (beg, '\0');
4381 if ((size_t) (end - beg) < buflen)
4384 len += end - beg + 1;
4391 str = (char *) alloca (len);
4392 for (beg = p + 1, dst = str;;)
4395 bool mem_p, reg_p, inout_p;
4397 end = strchr (beg, ',');
4402 parse_output_constraint (&tem, i, 0, 0,
4403 &mem_p, ®_p, &inout_p);
4408 memcpy (dst, buf, buflen);
4417 memcpy (dst, beg, len);
4426 input = build_string (dst - str, str);
4429 input = build_string (strlen (buf), buf);
4432 input = build_string (constraint_len - 1, constraint + 1);
4436 input = build_tree_list (build_tree_list (NULL_TREE, input),
4437 unshare_expr (TREE_VALUE (link)));
4438 ASM_INPUTS (expr) = chainon (ASM_INPUTS (expr), input);
4442 for (link = ASM_INPUTS (expr); link; ++i, link = TREE_CHAIN (link))
4445 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4446 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
4447 oconstraints, &allows_mem, &allows_reg);
4449 /* If we can't make copies, we can only accept memory. */
4450 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (link))))
4456 error ("impossible constraint in %<asm%>");
4457 error ("non-memory input %d must stay in memory", i);
4462 /* If the operand is a memory input, it should be an lvalue. */
4463 if (!allows_reg && allows_mem)
4465 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4466 is_gimple_lvalue, fb_lvalue | fb_mayfail);
4467 mark_addressable (TREE_VALUE (link));
4468 if (tret == GS_ERROR)
4470 error ("memory input %d is not directly addressable", i);
4476 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4477 is_gimple_asm_val, fb_rvalue);
4478 if (tret == GS_ERROR)
4486 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
4487 WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
4488 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
4489 return to this function.
4491 FIXME should we complexify the prequeue handling instead? Or use flags
4492 for all the cleanups and let the optimizer tighten them up? The current
4493 code seems pretty fragile; it will break on a cleanup within any
4494 non-conditional nesting. But any such nesting would be broken, anyway;
4495 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
4496 and continues out of it. We can do that at the RTL level, though, so
4497 having an optimizer to tighten up try/finally regions would be a Good
4500 static enum gimplify_status
4501 gimplify_cleanup_point_expr (tree *expr_p, tree *pre_p)
4503 tree_stmt_iterator iter;
4506 tree temp = voidify_wrapper_expr (*expr_p, NULL);
4508 /* We only care about the number of conditions between the innermost
4509 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
4510 any cleanups collected outside the CLEANUP_POINT_EXPR. */
4511 int old_conds = gimplify_ctxp->conditions;
4512 tree old_cleanups = gimplify_ctxp->conditional_cleanups;
4513 gimplify_ctxp->conditions = 0;
4514 gimplify_ctxp->conditional_cleanups = NULL_TREE;
4516 body = TREE_OPERAND (*expr_p, 0);
4517 gimplify_to_stmt_list (&body);
4519 gimplify_ctxp->conditions = old_conds;
4520 gimplify_ctxp->conditional_cleanups = old_cleanups;
4522 for (iter = tsi_start (body); !tsi_end_p (iter); )
4524 tree *wce_p = tsi_stmt_ptr (iter);
4527 if (TREE_CODE (wce) == WITH_CLEANUP_EXPR)
4529 if (tsi_one_before_end_p (iter))
4531 tsi_link_before (&iter, TREE_OPERAND (wce, 0), TSI_SAME_STMT);
4538 enum tree_code code;
4540 if (CLEANUP_EH_ONLY (wce))
4541 code = TRY_CATCH_EXPR;
4543 code = TRY_FINALLY_EXPR;
4545 sl = tsi_split_statement_list_after (&iter);
4546 tfe = build2 (code, void_type_node, sl, NULL_TREE);
4547 append_to_statement_list (TREE_OPERAND (wce, 0),
4548 &TREE_OPERAND (tfe, 1));
4550 iter = tsi_start (sl);
4560 append_to_statement_list (body, pre_p);
4570 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
4571 is the cleanup action required. */
4574 gimple_push_cleanup (tree var, tree cleanup, bool eh_only, tree *pre_p)
4578 /* Errors can result in improperly nested cleanups. Which results in
4579 confusion when trying to resolve the WITH_CLEANUP_EXPR. */
4580 if (errorcount || sorrycount)
4583 if (gimple_conditional_context ())
4585 /* If we're in a conditional context, this is more complex. We only
4586 want to run the cleanup if we actually ran the initialization that
4587 necessitates it, but we want to run it after the end of the
4588 conditional context. So we wrap the try/finally around the
4589 condition and use a flag to determine whether or not to actually
4590 run the destructor. Thus
4594 becomes (approximately)
4598 if (test) { A::A(temp); flag = 1; val = f(temp); }
4601 if (flag) A::~A(temp);
4606 tree flag = create_tmp_var (boolean_type_node, "cleanup");
4607 tree ffalse = build_gimple_modify_stmt (flag, boolean_false_node);
4608 tree ftrue = build_gimple_modify_stmt (flag, boolean_true_node);
4609 cleanup = build3 (COND_EXPR, void_type_node, flag, cleanup, NULL);
4610 wce = build1 (WITH_CLEANUP_EXPR, void_type_node, cleanup);
4611 append_to_statement_list (ffalse, &gimplify_ctxp->conditional_cleanups);
4612 append_to_statement_list (wce, &gimplify_ctxp->conditional_cleanups);
4613 append_to_statement_list (ftrue, pre_p);
4615 /* Because of this manipulation, and the EH edges that jump
4616 threading cannot redirect, the temporary (VAR) will appear
4617 to be used uninitialized. Don't warn. */
4618 TREE_NO_WARNING (var) = 1;
4622 wce = build1 (WITH_CLEANUP_EXPR, void_type_node, cleanup);
4623 CLEANUP_EH_ONLY (wce) = eh_only;
4624 append_to_statement_list (wce, pre_p);
4627 gimplify_stmt (&TREE_OPERAND (wce, 0));
4630 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
4632 static enum gimplify_status
4633 gimplify_target_expr (tree *expr_p, tree *pre_p, tree *post_p)
4635 tree targ = *expr_p;
4636 tree temp = TARGET_EXPR_SLOT (targ);
4637 tree init = TARGET_EXPR_INITIAL (targ);
4638 enum gimplify_status ret;
4642 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
4643 to the temps list. Handle also variable length TARGET_EXPRs. */
4644 if (TREE_CODE (DECL_SIZE (temp)) != INTEGER_CST)
4646 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (temp)))
4647 gimplify_type_sizes (TREE_TYPE (temp), pre_p);
4648 gimplify_vla_decl (temp, pre_p);
4651 gimple_add_tmp_var (temp);
4653 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
4654 expression is supposed to initialize the slot. */
4655 if (VOID_TYPE_P (TREE_TYPE (init)))
4656 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
4659 init = build2 (INIT_EXPR, void_type_node, temp, init);
4660 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt,
4663 if (ret == GS_ERROR)
4665 /* PR c++/28266 Make sure this is expanded only once. */
4666 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
4669 append_to_statement_list (init, pre_p);
4671 /* If needed, push the cleanup for the temp. */
4672 if (TARGET_EXPR_CLEANUP (targ))
4674 gimplify_stmt (&TARGET_EXPR_CLEANUP (targ));
4675 gimple_push_cleanup (temp, TARGET_EXPR_CLEANUP (targ),
4676 CLEANUP_EH_ONLY (targ), pre_p);
4679 /* Only expand this once. */
4680 TREE_OPERAND (targ, 3) = init;
4681 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
4684 /* We should have expanded this before. */
4685 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp));
4691 /* Gimplification of expression trees. */
4693 /* Gimplify an expression which appears at statement context; usually, this
4694 means replacing it with a suitably gimple STATEMENT_LIST. */
4697 gimplify_stmt (tree *stmt_p)
4699 gimplify_expr (stmt_p, NULL, NULL, is_gimple_stmt, fb_none);
4702 /* Similarly, but force the result to be a STATEMENT_LIST. */
4705 gimplify_to_stmt_list (tree *stmt_p)
4707 gimplify_stmt (stmt_p);
4709 *stmt_p = alloc_stmt_list ();
4710 else if (TREE_CODE (*stmt_p) != STATEMENT_LIST)
4713 *stmt_p = alloc_stmt_list ();
4714 append_to_statement_list (t, stmt_p);
4719 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
4720 to CTX. If entries already exist, force them to be some flavor of private.
4721 If there is no enclosing parallel, do nothing. */
4724 omp_firstprivatize_variable (struct gimplify_omp_ctx *ctx, tree decl)
4728 if (decl == NULL || !DECL_P (decl))
4733 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4736 if (n->value & GOVD_SHARED)
4737 n->value = GOVD_FIRSTPRIVATE | (n->value & GOVD_SEEN);
4741 else if (ctx->region_type != ORT_WORKSHARE)
4742 omp_add_variable (ctx, decl, GOVD_FIRSTPRIVATE);
4744 ctx = ctx->outer_context;
4749 /* Similarly for each of the type sizes of TYPE. */
4752 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx *ctx, tree type)
4754 if (type == NULL || type == error_mark_node)
4756 type = TYPE_MAIN_VARIANT (type);
4758 if (pointer_set_insert (ctx->privatized_types, type))
4761 switch (TREE_CODE (type))
4767 case FIXED_POINT_TYPE:
4768 omp_firstprivatize_variable (ctx, TYPE_MIN_VALUE (type));
4769 omp_firstprivatize_variable (ctx, TYPE_MAX_VALUE (type));
4773 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
4774 omp_firstprivatize_type_sizes (ctx, TYPE_DOMAIN (type));
4779 case QUAL_UNION_TYPE:
4782 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
4783 if (TREE_CODE (field) == FIELD_DECL)
4785 omp_firstprivatize_variable (ctx, DECL_FIELD_OFFSET (field));
4786 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (field));
4792 case REFERENCE_TYPE:
4793 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
4800 omp_firstprivatize_variable (ctx, TYPE_SIZE (type));
4801 omp_firstprivatize_variable (ctx, TYPE_SIZE_UNIT (type));
4802 lang_hooks.types.omp_firstprivatize_type_sizes (ctx, type);
4805 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
4808 omp_add_variable (struct gimplify_omp_ctx *ctx, tree decl, unsigned int flags)
4811 unsigned int nflags;
4814 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
4817 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
4818 there are constructors involved somewhere. */
4819 if (TREE_ADDRESSABLE (TREE_TYPE (decl))
4820 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
4823 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4826 /* We shouldn't be re-adding the decl with the same data
4828 gcc_assert ((n->value & GOVD_DATA_SHARE_CLASS & flags) == 0);
4829 /* The only combination of data sharing classes we should see is
4830 FIRSTPRIVATE and LASTPRIVATE. */
4831 nflags = n->value | flags;
4832 gcc_assert ((nflags & GOVD_DATA_SHARE_CLASS)
4833 == (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE));
4838 /* When adding a variable-sized variable, we have to handle all sorts
4839 of additional bits of data: the pointer replacement variable, and
4840 the parameters of the type. */
4841 if (DECL_SIZE (decl) && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
4843 /* Add the pointer replacement variable as PRIVATE if the variable
4844 replacement is private, else FIRSTPRIVATE since we'll need the
4845 address of the original variable either for SHARED, or for the
4846 copy into or out of the context. */
4847 if (!(flags & GOVD_LOCAL))
4849 nflags = flags & GOVD_PRIVATE ? GOVD_PRIVATE : GOVD_FIRSTPRIVATE;
4850 nflags |= flags & GOVD_SEEN;
4851 t = DECL_VALUE_EXPR (decl);
4852 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
4853 t = TREE_OPERAND (t, 0);
4854 gcc_assert (DECL_P (t));
4855 omp_add_variable (ctx, t, nflags);
4858 /* Add all of the variable and type parameters (which should have
4859 been gimplified to a formal temporary) as FIRSTPRIVATE. */
4860 omp_firstprivatize_variable (ctx, DECL_SIZE_UNIT (decl));
4861 omp_firstprivatize_variable (ctx, DECL_SIZE (decl));
4862 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
4864 /* The variable-sized variable itself is never SHARED, only some form
4865 of PRIVATE. The sharing would take place via the pointer variable
4866 which we remapped above. */
4867 if (flags & GOVD_SHARED)
4868 flags = GOVD_PRIVATE | GOVD_DEBUG_PRIVATE
4869 | (flags & (GOVD_SEEN | GOVD_EXPLICIT));
4871 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
4872 alloca statement we generate for the variable, so make sure it
4873 is available. This isn't automatically needed for the SHARED
4874 case, since we won't be allocating local storage then.
4875 For local variables TYPE_SIZE_UNIT might not be gimplified yet,
4876 in this case omp_notice_variable will be called later
4877 on when it is gimplified. */
4878 else if (! (flags & GOVD_LOCAL))
4879 omp_notice_variable (ctx, TYPE_SIZE_UNIT (TREE_TYPE (decl)), true);
4881 else if (lang_hooks.decls.omp_privatize_by_reference (decl))
4883 gcc_assert ((flags & GOVD_LOCAL) == 0);
4884 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
4886 /* Similar to the direct variable sized case above, we'll need the
4887 size of references being privatized. */
4888 if ((flags & GOVD_SHARED) == 0)
4890 t = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl)));
4891 if (TREE_CODE (t) != INTEGER_CST)
4892 omp_notice_variable (ctx, t, true);
4896 splay_tree_insert (ctx->variables, (splay_tree_key)decl, flags);
4899 /* Record the fact that DECL was used within the OpenMP context CTX.
4900 IN_CODE is true when real code uses DECL, and false when we should
4901 merely emit default(none) errors. Return true if DECL is going to
4902 be remapped and thus DECL shouldn't be gimplified into its
4903 DECL_VALUE_EXPR (if any). */
4906 omp_notice_variable (struct gimplify_omp_ctx *ctx, tree decl, bool in_code)
4909 unsigned flags = in_code ? GOVD_SEEN : 0;
4910 bool ret = false, shared;
4912 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
4915 /* Threadprivate variables are predetermined. */
4916 if (is_global_var (decl))
4918 if (DECL_THREAD_LOCAL_P (decl))
4921 if (DECL_HAS_VALUE_EXPR_P (decl))
4923 tree value = get_base_address (DECL_VALUE_EXPR (decl));
4925 if (value && DECL_P (value) && DECL_THREAD_LOCAL_P (value))
4930 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4933 enum omp_clause_default_kind default_kind, kind;
4934 struct gimplify_omp_ctx *octx;
4936 if (ctx->region_type == ORT_WORKSHARE)
4939 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
4940 remapped firstprivate instead of shared. To some extent this is
4941 addressed in omp_firstprivatize_type_sizes, but not effectively. */
4942 default_kind = ctx->default_kind;
4943 kind = lang_hooks.decls.omp_predetermined_sharing (decl);
4944 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
4945 default_kind = kind;
4947 switch (default_kind)
4949 case OMP_CLAUSE_DEFAULT_NONE:
4950 error ("%qs not specified in enclosing parallel",
4951 IDENTIFIER_POINTER (DECL_NAME (decl)));
4952 error ("%Henclosing parallel", &ctx->location);
4954 case OMP_CLAUSE_DEFAULT_SHARED:
4955 flags |= GOVD_SHARED;
4957 case OMP_CLAUSE_DEFAULT_PRIVATE:
4958 flags |= GOVD_PRIVATE;
4960 case OMP_CLAUSE_DEFAULT_FIRSTPRIVATE:
4961 flags |= GOVD_FIRSTPRIVATE;
4963 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
4964 /* decl will be either GOVD_FIRSTPRIVATE or GOVD_SHARED. */
4965 gcc_assert (ctx->region_type == ORT_TASK);
4966 if (ctx->outer_context)
4967 omp_notice_variable (ctx->outer_context, decl, in_code);
4968 for (octx = ctx->outer_context; octx; octx = octx->outer_context)
4972 n2 = splay_tree_lookup (octx->variables, (splay_tree_key) decl);
4973 if (n2 && (n2->value & GOVD_DATA_SHARE_CLASS) != GOVD_SHARED)
4975 flags |= GOVD_FIRSTPRIVATE;
4978 if ((octx->region_type & ORT_PARALLEL) != 0)
4981 if (flags & GOVD_FIRSTPRIVATE)
4984 && (TREE_CODE (decl) == PARM_DECL
4985 || (!is_global_var (decl)
4986 && DECL_CONTEXT (decl) == current_function_decl)))
4988 flags |= GOVD_FIRSTPRIVATE;
4991 flags |= GOVD_SHARED;
4997 if ((flags & GOVD_PRIVATE)
4998 && lang_hooks.decls.omp_private_outer_ref (decl))
4999 flags |= GOVD_PRIVATE_OUTER_REF;
5001 omp_add_variable (ctx, decl, flags);
5003 shared = (flags & GOVD_SHARED) != 0;
5004 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
5008 shared = ((flags | n->value) & GOVD_SHARED) != 0;
5009 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
5011 /* If nothing changed, there's nothing left to do. */
5012 if ((n->value & flags) == flags)
5018 /* If the variable is private in the current context, then we don't
5019 need to propagate anything to an outer context. */
5020 if ((flags & GOVD_PRIVATE) && !(flags & GOVD_PRIVATE_OUTER_REF))
5022 if (ctx->outer_context
5023 && omp_notice_variable (ctx->outer_context, decl, in_code))
5028 /* Verify that DECL is private within CTX. If there's specific information
5029 to the contrary in the innermost scope, generate an error. */
5032 omp_is_private (struct gimplify_omp_ctx *ctx, tree decl)
5036 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
5039 if (n->value & GOVD_SHARED)
5041 if (ctx == gimplify_omp_ctxp)
5043 error ("iteration variable %qs should be private",
5044 IDENTIFIER_POINTER (DECL_NAME (decl)));
5045 n->value = GOVD_PRIVATE;
5051 else if ((n->value & GOVD_EXPLICIT) != 0
5052 && (ctx == gimplify_omp_ctxp
5053 || (ctx->region_type == ORT_COMBINED_PARALLEL
5054 && gimplify_omp_ctxp->outer_context == ctx)))
5056 if ((n->value & GOVD_FIRSTPRIVATE) != 0)
5057 error ("iteration variable %qs should not be firstprivate",
5058 IDENTIFIER_POINTER (DECL_NAME (decl)));
5059 else if ((n->value & GOVD_REDUCTION) != 0)
5060 error ("iteration variable %qs should not be reduction",
5061 IDENTIFIER_POINTER (DECL_NAME (decl)));
5063 return (ctx == gimplify_omp_ctxp
5064 || (ctx->region_type == ORT_COMBINED_PARALLEL
5065 && gimplify_omp_ctxp->outer_context == ctx));
5068 if (ctx->region_type != ORT_WORKSHARE)
5070 else if (ctx->outer_context)
5071 return omp_is_private (ctx->outer_context, decl);
5075 /* Return true if DECL is private within a parallel region
5076 that binds to the current construct's context or in parallel
5077 region's REDUCTION clause. */
5080 omp_check_private (struct gimplify_omp_ctx *ctx, tree decl)
5086 ctx = ctx->outer_context;
5088 return !(is_global_var (decl)
5089 /* References might be private, but might be shared too. */
5090 || lang_hooks.decls.omp_privatize_by_reference (decl));
5092 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5094 return (n->value & GOVD_SHARED) == 0;
5096 while (ctx->region_type == ORT_WORKSHARE);
5100 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
5101 and previous omp contexts. */
5104 gimplify_scan_omp_clauses (tree *list_p, tree *pre_p,
5105 enum omp_region_type region_type)
5107 struct gimplify_omp_ctx *ctx, *outer_ctx;
5110 ctx = new_omp_context (region_type);
5111 outer_ctx = ctx->outer_context;
5113 while ((c = *list_p) != NULL)
5115 enum gimplify_status gs;
5116 bool remove = false;
5117 bool notice_outer = true;
5118 const char *check_non_private = NULL;
5122 switch (OMP_CLAUSE_CODE (c))
5124 case OMP_CLAUSE_PRIVATE:
5125 flags = GOVD_PRIVATE | GOVD_EXPLICIT;
5126 if (lang_hooks.decls.omp_private_outer_ref (OMP_CLAUSE_DECL (c)))
5128 flags |= GOVD_PRIVATE_OUTER_REF;
5129 OMP_CLAUSE_PRIVATE_OUTER_REF (c) = 1;
5132 notice_outer = false;
5134 case OMP_CLAUSE_SHARED:
5135 flags = GOVD_SHARED | GOVD_EXPLICIT;
5137 case OMP_CLAUSE_FIRSTPRIVATE:
5138 flags = GOVD_FIRSTPRIVATE | GOVD_EXPLICIT;
5139 check_non_private = "firstprivate";
5141 case OMP_CLAUSE_LASTPRIVATE:
5142 flags = GOVD_LASTPRIVATE | GOVD_SEEN | GOVD_EXPLICIT;
5143 check_non_private = "lastprivate";
5145 case OMP_CLAUSE_REDUCTION:
5146 flags = GOVD_REDUCTION | GOVD_SEEN | GOVD_EXPLICIT;
5147 check_non_private = "reduction";
5151 decl = OMP_CLAUSE_DECL (c);
5152 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5157 omp_add_variable (ctx, decl, flags);
5158 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION
5159 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c))
5161 omp_add_variable (ctx, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c),
5162 GOVD_LOCAL | GOVD_SEEN);
5163 gimplify_omp_ctxp = ctx;
5164 push_gimplify_context ();
5165 gimplify_stmt (&OMP_CLAUSE_REDUCTION_INIT (c));
5166 pop_gimplify_context (OMP_CLAUSE_REDUCTION_INIT (c));
5167 push_gimplify_context ();
5168 gimplify_stmt (&OMP_CLAUSE_REDUCTION_MERGE (c));
5169 pop_gimplify_context (OMP_CLAUSE_REDUCTION_MERGE (c));
5170 gimplify_omp_ctxp = outer_ctx;
5172 else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
5173 && OMP_CLAUSE_LASTPRIVATE_STMT (c))
5175 gimplify_omp_ctxp = ctx;
5176 push_gimplify_context ();
5177 if (TREE_CODE (OMP_CLAUSE_LASTPRIVATE_STMT (c)) != BIND_EXPR)
5179 tree bind = build3 (BIND_EXPR, void_type_node, NULL,
5181 TREE_SIDE_EFFECTS (bind) = 1;
5182 BIND_EXPR_BODY (bind) = OMP_CLAUSE_LASTPRIVATE_STMT (c);
5183 OMP_CLAUSE_LASTPRIVATE_STMT (c) = bind;
5185 gimplify_stmt (&OMP_CLAUSE_LASTPRIVATE_STMT (c));
5186 pop_gimplify_context (OMP_CLAUSE_LASTPRIVATE_STMT (c));
5187 gimplify_omp_ctxp = outer_ctx;
5193 case OMP_CLAUSE_COPYIN:
5194 case OMP_CLAUSE_COPYPRIVATE:
5195 decl = OMP_CLAUSE_DECL (c);
5196 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5203 omp_notice_variable (outer_ctx, decl, true);
5204 if (check_non_private
5205 && region_type == ORT_WORKSHARE
5206 && omp_check_private (ctx, decl))
5208 error ("%s variable %qs is private in outer context",
5209 check_non_private, IDENTIFIER_POINTER (DECL_NAME (decl)));
5215 OMP_CLAUSE_OPERAND (c, 0)
5216 = gimple_boolify (OMP_CLAUSE_OPERAND (c, 0));
5219 case OMP_CLAUSE_SCHEDULE:
5220 case OMP_CLAUSE_NUM_THREADS:
5221 gs = gimplify_expr (&OMP_CLAUSE_OPERAND (c, 0), pre_p, NULL,
5222 is_gimple_val, fb_rvalue);
5227 case OMP_CLAUSE_NOWAIT:
5228 case OMP_CLAUSE_ORDERED:
5229 case OMP_CLAUSE_UNTIED:
5230 case OMP_CLAUSE_COLLAPSE:
5233 case OMP_CLAUSE_DEFAULT:
5234 ctx->default_kind = OMP_CLAUSE_DEFAULT_KIND (c);
5242 *list_p = OMP_CLAUSE_CHAIN (c);
5244 list_p = &OMP_CLAUSE_CHAIN (c);
5247 gimplify_omp_ctxp = ctx;
5250 /* For all variables that were not actually used within the context,
5251 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
5254 gimplify_adjust_omp_clauses_1 (splay_tree_node n, void *data)
5256 tree *list_p = (tree *) data;
5257 tree decl = (tree) n->key;
5258 unsigned flags = n->value;
5259 enum omp_clause_code code;
5263 if (flags & (GOVD_EXPLICIT | GOVD_LOCAL))
5265 if ((flags & GOVD_SEEN) == 0)
5267 if (flags & GOVD_DEBUG_PRIVATE)
5269 gcc_assert ((flags & GOVD_DATA_SHARE_CLASS) == GOVD_PRIVATE);
5270 private_debug = true;
5274 = lang_hooks.decls.omp_private_debug_clause (decl,
5275 !!(flags & GOVD_SHARED));
5277 code = OMP_CLAUSE_PRIVATE;
5278 else if (flags & GOVD_SHARED)
5280 if (is_global_var (decl))
5282 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp->outer_context;
5286 = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5287 if (on && (on->value & (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE
5288 | GOVD_PRIVATE | GOVD_REDUCTION)) != 0)
5290 ctx = ctx->outer_context;
5295 code = OMP_CLAUSE_SHARED;
5297 else if (flags & GOVD_PRIVATE)
5298 code = OMP_CLAUSE_PRIVATE;
5299 else if (flags & GOVD_FIRSTPRIVATE)
5300 code = OMP_CLAUSE_FIRSTPRIVATE;
5304 clause = build_omp_clause (code);
5305 OMP_CLAUSE_DECL (clause) = decl;
5306 OMP_CLAUSE_CHAIN (clause) = *list_p;
5308 OMP_CLAUSE_PRIVATE_DEBUG (clause) = 1;
5309 else if (code == OMP_CLAUSE_PRIVATE && (flags & GOVD_PRIVATE_OUTER_REF))
5310 OMP_CLAUSE_PRIVATE_OUTER_REF (clause) = 1;
5312 lang_hooks.decls.omp_finish_clause (clause);
5318 gimplify_adjust_omp_clauses (tree *list_p)
5320 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
5323 while ((c = *list_p) != NULL)
5326 bool remove = false;
5328 switch (OMP_CLAUSE_CODE (c))
5330 case OMP_CLAUSE_PRIVATE:
5331 case OMP_CLAUSE_SHARED:
5332 case OMP_CLAUSE_FIRSTPRIVATE:
5333 decl = OMP_CLAUSE_DECL (c);
5334 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5335 remove = !(n->value & GOVD_SEEN);
5338 bool shared = OMP_CLAUSE_CODE (c) == OMP_CLAUSE_SHARED;
5339 if ((n->value & GOVD_DEBUG_PRIVATE)
5340 || lang_hooks.decls.omp_private_debug_clause (decl, shared))
5342 gcc_assert ((n->value & GOVD_DEBUG_PRIVATE) == 0
5343 || ((n->value & GOVD_DATA_SHARE_CLASS)
5345 OMP_CLAUSE_SET_CODE (c, OMP_CLAUSE_PRIVATE);
5346 OMP_CLAUSE_PRIVATE_DEBUG (c) = 1;
5351 case OMP_CLAUSE_LASTPRIVATE:
5352 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
5353 accurately reflect the presence of a FIRSTPRIVATE clause. */
5354 decl = OMP_CLAUSE_DECL (c);
5355 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5356 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)
5357 = (n->value & GOVD_FIRSTPRIVATE) != 0;
5360 case OMP_CLAUSE_REDUCTION:
5361 case OMP_CLAUSE_COPYIN:
5362 case OMP_CLAUSE_COPYPRIVATE:
5364 case OMP_CLAUSE_NUM_THREADS:
5365 case OMP_CLAUSE_SCHEDULE:
5366 case OMP_CLAUSE_NOWAIT:
5367 case OMP_CLAUSE_ORDERED:
5368 case OMP_CLAUSE_DEFAULT:
5369 case OMP_CLAUSE_UNTIED:
5370 case OMP_CLAUSE_COLLAPSE:
5378 *list_p = OMP_CLAUSE_CHAIN (c);
5380 list_p = &OMP_CLAUSE_CHAIN (c);
5383 /* Add in any implicit data sharing. */
5384 splay_tree_foreach (ctx->variables, gimplify_adjust_omp_clauses_1, list_p);
5386 gimplify_omp_ctxp = ctx->outer_context;
5387 delete_omp_context (ctx);
5390 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
5391 gimplification of the body, as well as scanning the body for used
5392 variables. We need to do this scan now, because variable-sized
5393 decls will be decomposed during gimplification. */
5395 static enum gimplify_status
5396 gimplify_omp_parallel (tree *expr_p, tree *pre_p)
5398 tree expr = *expr_p;
5400 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr), pre_p,
5401 OMP_PARALLEL_COMBINED (expr)
5402 ? ORT_COMBINED_PARALLEL
5405 push_gimplify_context ();
5407 gimplify_stmt (&OMP_PARALLEL_BODY (expr));
5409 if (TREE_CODE (OMP_PARALLEL_BODY (expr)) == BIND_EXPR)
5410 pop_gimplify_context (OMP_PARALLEL_BODY (expr));
5412 pop_gimplify_context (NULL_TREE);
5414 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr));
5419 /* Gimplify the contents of an OMP_TASK statement. This involves
5420 gimplification of the body, as well as scanning the body for used
5421 variables. We need to do this scan now, because variable-sized
5422 decls will be decomposed during gimplification. */
5424 static enum gimplify_status
5425 gimplify_omp_task (tree *expr_p, tree *pre_p)
5427 tree expr = *expr_p;
5429 gimplify_scan_omp_clauses (&OMP_TASK_CLAUSES (expr), pre_p, ORT_TASK);
5431 push_gimplify_context ();
5433 gimplify_stmt (&OMP_TASK_BODY (expr));
5435 if (TREE_CODE (OMP_TASK_BODY (expr)) == BIND_EXPR)
5436 pop_gimplify_context (OMP_TASK_BODY (expr));
5438 pop_gimplify_context (NULL_TREE);
5440 gimplify_adjust_omp_clauses (&OMP_TASK_CLAUSES (expr));
5445 /* Gimplify the gross structure of an OMP_FOR statement. */
5447 static enum gimplify_status
5448 gimplify_omp_for (tree *expr_p, tree *pre_p)
5450 tree for_stmt, decl, var, t, bodylist;
5451 enum gimplify_status ret = GS_OK;
5452 tree body, init_decl = NULL_TREE;
5457 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt), pre_p,
5460 /* If OMP_FOR is re-gimplified, ensure all variables in pre-body
5462 gimplify_stmt (&OMP_FOR_PRE_BODY (for_stmt));
5464 bodylist = alloc_stmt_list ();
5466 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt))
5467 == TREE_VEC_LENGTH (OMP_FOR_COND (for_stmt)));
5468 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt))
5469 == TREE_VEC_LENGTH (OMP_FOR_INCR (for_stmt)));
5470 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)); i++)
5472 t = TREE_VEC_ELT (OMP_FOR_INIT (for_stmt), i);
5473 gcc_assert (TREE_CODE (t) == MODIFY_EXPR
5474 || TREE_CODE (t) == GIMPLE_MODIFY_STMT);
5475 decl = GENERIC_TREE_OPERAND (t, 0);
5476 gcc_assert (DECL_P (decl));
5477 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl))
5478 || POINTER_TYPE_P (TREE_TYPE (decl)));
5480 /* Make sure the iteration variable is private. */
5481 if (omp_is_private (gimplify_omp_ctxp, decl))
5482 omp_notice_variable (gimplify_omp_ctxp, decl, true);
5484 omp_add_variable (gimplify_omp_ctxp, decl, GOVD_PRIVATE | GOVD_SEEN);
5486 /* If DECL is not a gimple register, create a temporary variable to act
5487 as an iteration counter. This is valid, since DECL cannot be
5488 modified in the body of the loop. */
5489 if (!is_gimple_reg (decl))
5491 var = create_tmp_var (TREE_TYPE (decl), get_name (decl));
5492 GENERIC_TREE_OPERAND (t, 0) = var;
5494 init_decl = build_gimple_modify_stmt (decl, var);
5495 omp_add_variable (gimplify_omp_ctxp, var, GOVD_PRIVATE | GOVD_SEEN);
5500 ret |= gimplify_expr (&GENERIC_TREE_OPERAND (t, 1),
5501 &OMP_FOR_PRE_BODY (for_stmt),
5502 NULL, is_gimple_val, fb_rvalue);
5504 tree_to_gimple_tuple (&TREE_VEC_ELT (OMP_FOR_INIT (for_stmt), i));
5506 t = TREE_VEC_ELT (OMP_FOR_COND (for_stmt), i);
5507 gcc_assert (COMPARISON_CLASS_P (t));
5508 gcc_assert (GENERIC_TREE_OPERAND (t, 0) == decl);
5509 TREE_OPERAND (t, 0) = var;
5511 ret |= gimplify_expr (&GENERIC_TREE_OPERAND (t, 1),
5512 &OMP_FOR_PRE_BODY (for_stmt),
5513 NULL, is_gimple_val, fb_rvalue);
5515 tree_to_gimple_tuple (&TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i));
5516 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
5517 switch (TREE_CODE (t))
5519 case PREINCREMENT_EXPR:
5520 case POSTINCREMENT_EXPR:
5521 t = build_int_cst (TREE_TYPE (decl), 1);
5522 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
5523 t = build_gimple_modify_stmt (var, t);
5524 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i) = t;
5527 case PREDECREMENT_EXPR:
5528 case POSTDECREMENT_EXPR:
5529 t = build_int_cst (TREE_TYPE (decl), -1);
5530 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
5531 t = build_gimple_modify_stmt (var, t);
5532 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i) = t;
5535 case GIMPLE_MODIFY_STMT:
5536 gcc_assert (GIMPLE_STMT_OPERAND (t, 0) == decl);
5537 GIMPLE_STMT_OPERAND (t, 0) = var;
5539 t = GIMPLE_STMT_OPERAND (t, 1);
5540 switch (TREE_CODE (t))
5543 if (TREE_OPERAND (t, 1) == decl)
5545 TREE_OPERAND (t, 1) = TREE_OPERAND (t, 0);
5546 TREE_OPERAND (t, 0) = var;
5552 case POINTER_PLUS_EXPR:
5553 gcc_assert (TREE_OPERAND (t, 0) == decl);
5554 TREE_OPERAND (t, 0) = var;
5560 ret |= gimplify_expr (&TREE_OPERAND (t, 1),
5561 &OMP_FOR_PRE_BODY (for_stmt),
5562 NULL, is_gimple_val, fb_rvalue);
5570 append_to_statement_list (init_decl, &bodylist);
5572 if (var != decl || TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)) > 1)
5575 for (c = OMP_FOR_CLAUSES (for_stmt); c ; c = OMP_CLAUSE_CHAIN (c))
5576 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
5577 && OMP_CLAUSE_DECL (c) == decl
5578 && OMP_CLAUSE_LASTPRIVATE_STMT (c) == NULL)
5580 t = TREE_VEC_ELT (OMP_FOR_INCR (for_stmt), i);
5581 gcc_assert (TREE_CODE (t) == GIMPLE_MODIFY_STMT);
5582 gcc_assert (GIMPLE_STMT_OPERAND (t, 0) == var);
5583 t = GIMPLE_STMT_OPERAND (t, 1);
5584 gcc_assert (TREE_CODE (t) == PLUS_EXPR
5585 || TREE_CODE (t) == MINUS_EXPR
5586 || TREE_CODE (t) == POINTER_PLUS_EXPR);
5587 gcc_assert (TREE_OPERAND (t, 0) == var);
5588 t = build2 (TREE_CODE (t), TREE_TYPE (decl), decl,
5589 TREE_OPERAND (t, 1));
5590 OMP_CLAUSE_LASTPRIVATE_STMT (c)
5591 = build_gimple_modify_stmt (decl, t);
5596 body = OMP_FOR_BODY (for_stmt);
5597 gimplify_to_stmt_list (&body);
5598 append_to_statement_list (body, &bodylist);
5599 OMP_FOR_BODY (for_stmt) = bodylist;
5600 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt));
5602 return ret == GS_ALL_DONE ? GS_ALL_DONE : GS_ERROR;
5605 /* Gimplify the gross structure of other OpenMP worksharing constructs.
5606 In particular, OMP_SECTIONS and OMP_SINGLE. */
5608 static enum gimplify_status
5609 gimplify_omp_workshare (tree *expr_p, tree *pre_p)
5611 tree stmt = *expr_p;
5613 gimplify_scan_omp_clauses (&OMP_CLAUSES (stmt), pre_p, ORT_WORKSHARE);
5614 gimplify_to_stmt_list (&OMP_BODY (stmt));
5615 gimplify_adjust_omp_clauses (&OMP_CLAUSES (stmt));
5620 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
5621 stabilized the lhs of the atomic operation as *ADDR. Return true if
5622 EXPR is this stabilized form. */
5625 goa_lhs_expr_p (tree expr, tree addr)
5627 /* Also include casts to other type variants. The C front end is fond
5628 of adding these for e.g. volatile variables. This is like
5629 STRIP_TYPE_NOPS but includes the main variant lookup. */
5630 while ((CONVERT_EXPR_P (expr)
5631 || TREE_CODE (expr) == NON_LVALUE_EXPR)
5632 && TREE_OPERAND (expr, 0) != error_mark_node
5633 && (TYPE_MAIN_VARIANT (TREE_TYPE (expr))
5634 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (expr, 0)))))
5635 expr = TREE_OPERAND (expr, 0);
5637 if (TREE_CODE (expr) == INDIRECT_REF)
5639 expr = TREE_OPERAND (expr, 0);
5641 && (CONVERT_EXPR_P (expr)
5642 || TREE_CODE (expr) == NON_LVALUE_EXPR)
5643 && TREE_CODE (expr) == TREE_CODE (addr)
5644 && TYPE_MAIN_VARIANT (TREE_TYPE (expr))
5645 == TYPE_MAIN_VARIANT (TREE_TYPE (addr)))
5647 expr = TREE_OPERAND (expr, 0);
5648 addr = TREE_OPERAND (addr, 0);
5652 return (TREE_CODE (addr) == ADDR_EXPR
5653 && TREE_CODE (expr) == ADDR_EXPR
5654 && TREE_OPERAND (addr, 0) == TREE_OPERAND (expr, 0));
5656 if (TREE_CODE (addr) == ADDR_EXPR && expr == TREE_OPERAND (addr, 0))
5661 /* Walk *EXPR_P and replace
5662 appearances of *LHS_ADDR with LHS_VAR. If an expression does not involve
5663 the lhs, evaluate it into a temporary. Return 1 if the lhs appeared as
5664 a subexpression, 0 if it did not, or -1 if an error was encountered. */
5667 goa_stabilize_expr (tree *expr_p, tree *pre_p, tree lhs_addr, tree lhs_var)
5669 tree expr = *expr_p;
5672 if (goa_lhs_expr_p (expr, lhs_addr))
5677 if (is_gimple_val (expr))
5681 switch (TREE_CODE_CLASS (TREE_CODE (expr)))
5684 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p,
5687 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p,
5696 enum gimplify_status gs;
5697 gs = gimplify_expr (expr_p, pre_p, NULL, is_gimple_val, fb_rvalue);
5698 if (gs != GS_ALL_DONE)
5705 /* Gimplify an OMP_ATOMIC statement. */
5707 static enum gimplify_status
5708 gimplify_omp_atomic (tree *expr_p, tree *pre_p)
5710 tree addr = TREE_OPERAND (*expr_p, 0);
5711 tree rhs = TREE_OPERAND (*expr_p, 1);
5712 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr)));
5713 tree tmp_load, load, store;
5715 tmp_load = create_tmp_var (type, NULL);
5716 if (goa_stabilize_expr (&rhs, pre_p, addr, tmp_load) < 0)
5719 if (gimplify_expr (&addr, pre_p, NULL, is_gimple_val, fb_rvalue)
5723 load = build2 (OMP_ATOMIC_LOAD, void_type_node, tmp_load, addr);
5724 append_to_statement_list (load, pre_p);
5725 if (gimplify_expr (&rhs, pre_p, NULL, is_gimple_val, fb_rvalue)
5728 store = build1 (OMP_ATOMIC_STORE, void_type_node, rhs);
5735 /* Gimplifies the expression tree pointed to by EXPR_P. Return 0 if
5736 gimplification failed.
5738 PRE_P points to the list where side effects that must happen before
5739 EXPR should be stored.
5741 POST_P points to the list where side effects that must happen after
5742 EXPR should be stored, or NULL if there is no suitable list. In
5743 that case, we copy the result to a temporary, emit the
5744 post-effects, and then return the temporary.
5746 GIMPLE_TEST_F points to a function that takes a tree T and
5747 returns nonzero if T is in the GIMPLE form requested by the
5748 caller. The GIMPLE predicates are in tree-gimple.c.
5750 This test is used twice. Before gimplification, the test is
5751 invoked to determine whether *EXPR_P is already gimple enough. If
5752 that fails, *EXPR_P is gimplified according to its code and
5753 GIMPLE_TEST_F is called again. If the test still fails, then a new
5754 temporary variable is created and assigned the value of the
5755 gimplified expression.
5757 FALLBACK tells the function what sort of a temporary we want. If the 1
5758 bit is set, an rvalue is OK. If the 2 bit is set, an lvalue is OK.
5759 If both are set, either is OK, but an lvalue is preferable.
5761 The return value is either GS_ERROR or GS_ALL_DONE, since this function
5762 iterates until solution. */
5764 enum gimplify_status
5765 gimplify_expr (tree *expr_p, tree *pre_p, tree *post_p,
5766 bool (* gimple_test_f) (tree), fallback_t fallback)
5769 tree internal_pre = NULL_TREE;
5770 tree internal_post = NULL_TREE;
5772 int is_statement = (pre_p == NULL);
5773 location_t saved_location;
5774 enum gimplify_status ret;
5776 save_expr = *expr_p;
5777 if (save_expr == NULL_TREE)
5780 /* We used to check the predicate here and return immediately if it
5781 succeeds. This is wrong; the design is for gimplification to be
5782 idempotent, and for the predicates to only test for valid forms, not
5783 whether they are fully simplified. */
5785 /* Set up our internal queues if needed. */
5787 pre_p = &internal_pre;
5789 post_p = &internal_post;
5791 saved_location = input_location;
5792 if (save_expr != error_mark_node
5793 && EXPR_HAS_LOCATION (*expr_p))
5794 input_location = EXPR_LOCATION (*expr_p);
5796 /* Loop over the specific gimplifiers until the toplevel node
5797 remains the same. */
5800 /* Strip away as many useless type conversions as possible
5802 STRIP_USELESS_TYPE_CONVERSION (*expr_p);
5804 /* Remember the expr. */
5805 save_expr = *expr_p;
5807 /* Die, die, die, my darling. */
5808 if (save_expr == error_mark_node
5809 || (!GIMPLE_STMT_P (save_expr)
5810 && TREE_TYPE (save_expr)
5811 && TREE_TYPE (save_expr) == error_mark_node))
5817 /* Do any language-specific gimplification. */
5818 ret = lang_hooks.gimplify_expr (expr_p, pre_p, post_p);
5821 if (*expr_p == NULL_TREE)
5823 if (*expr_p != save_expr)
5826 else if (ret != GS_UNHANDLED)
5830 switch (TREE_CODE (*expr_p))
5832 /* First deal with the special cases. */
5834 case POSTINCREMENT_EXPR:
5835 case POSTDECREMENT_EXPR:
5836 case PREINCREMENT_EXPR:
5837 case PREDECREMENT_EXPR:
5838 ret = gimplify_self_mod_expr (expr_p, pre_p, post_p,
5839 fallback != fb_none);
5843 case ARRAY_RANGE_REF:
5847 case VIEW_CONVERT_EXPR:
5848 ret = gimplify_compound_lval (expr_p, pre_p, post_p,
5849 fallback ? fallback : fb_rvalue);
5853 ret = gimplify_cond_expr (expr_p, pre_p, fallback);
5854 /* C99 code may assign to an array in a structure value of a
5855 conditional expression, and this has undefined behavior
5856 only on execution, so create a temporary if an lvalue is
5858 if (fallback == fb_lvalue)
5860 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
5861 mark_addressable (*expr_p);
5866 ret = gimplify_call_expr (expr_p, pre_p, fallback != fb_none);
5867 /* C99 code may assign to an array in a structure returned
5868 from a function, and this has undefined behavior only on
5869 execution, so create a temporary if an lvalue is
5871 if (fallback == fb_lvalue)
5873 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
5874 mark_addressable (*expr_p);
5882 ret = gimplify_compound_expr (expr_p, pre_p, fallback != fb_none);
5886 case GIMPLE_MODIFY_STMT:
5888 ret = gimplify_modify_expr (expr_p, pre_p, post_p,
5889 fallback != fb_none);
5893 /* The distinction between MODIFY_EXPR and INIT_EXPR is no longer
5895 if (TREE_CODE (*expr_p) == INIT_EXPR)
5896 TREE_SET_CODE (*expr_p, MODIFY_EXPR);
5898 /* Convert MODIFY_EXPR to GIMPLE_MODIFY_STMT. */
5899 if (TREE_CODE (*expr_p) == MODIFY_EXPR)
5900 tree_to_gimple_tuple (expr_p);
5905 case TRUTH_ANDIF_EXPR:
5906 case TRUTH_ORIF_EXPR:
5907 ret = gimplify_boolean_expr (expr_p);
5910 case TRUTH_NOT_EXPR:
5911 if (TREE_CODE (TREE_TYPE (*expr_p)) != BOOLEAN_TYPE)
5913 tree type = TREE_TYPE (*expr_p);
5914 *expr_p = fold_convert (type, gimple_boolify (*expr_p));
5919 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5920 is_gimple_val, fb_rvalue);
5921 recalculate_side_effects (*expr_p);
5925 ret = gimplify_addr_expr (expr_p, pre_p, post_p);
5929 ret = gimplify_va_arg_expr (expr_p, pre_p, post_p);
5933 if (IS_EMPTY_STMT (*expr_p))
5939 if (VOID_TYPE_P (TREE_TYPE (*expr_p))
5940 || fallback == fb_none)
5942 /* Just strip a conversion to void (or in void context) and
5944 *expr_p = TREE_OPERAND (*expr_p, 0);
5948 ret = gimplify_conversion (expr_p);
5949 if (ret == GS_ERROR)
5951 if (*expr_p != save_expr)
5955 case FIX_TRUNC_EXPR:
5956 /* unary_expr: ... | '(' cast ')' val | ... */
5957 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5958 is_gimple_val, fb_rvalue);
5959 recalculate_side_effects (*expr_p);
5963 *expr_p = fold_indirect_ref (*expr_p);
5964 if (*expr_p != save_expr)
5966 /* else fall through. */
5967 case ALIGN_INDIRECT_REF:
5968 case MISALIGNED_INDIRECT_REF:
5969 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5970 is_gimple_reg, fb_rvalue);
5971 recalculate_side_effects (*expr_p);
5974 /* Constants need not be gimplified. */
5985 /* If we require an lvalue, such as for ADDR_EXPR, retain the
5986 CONST_DECL node. Otherwise the decl is replaceable by its
5988 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
5989 if (fallback & fb_lvalue)
5992 *expr_p = DECL_INITIAL (*expr_p);
5996 ret = gimplify_decl_expr (expr_p);
6000 /* FIXME make this a decl. */
6005 ret = gimplify_bind_expr (expr_p, pre_p);
6009 ret = gimplify_loop_expr (expr_p, pre_p);
6013 ret = gimplify_switch_expr (expr_p, pre_p);
6017 ret = gimplify_exit_expr (expr_p);
6021 /* If the target is not LABEL, then it is a computed jump
6022 and the target needs to be gimplified. */
6023 if (TREE_CODE (GOTO_DESTINATION (*expr_p)) != LABEL_DECL)
6024 ret = gimplify_expr (&GOTO_DESTINATION (*expr_p), pre_p,
6025 NULL, is_gimple_val, fb_rvalue);
6028 /* Predictions are always gimplified. */
6034 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p))
6035 == current_function_decl);
6038 case CASE_LABEL_EXPR:
6039 ret = gimplify_case_label_expr (expr_p);
6043 ret = gimplify_return_expr (*expr_p, pre_p);
6047 /* Don't reduce this in place; let gimplify_init_constructor work its
6048 magic. Buf if we're just elaborating this for side effects, just
6049 gimplify any element that has side-effects. */
6050 if (fallback == fb_none)
6052 unsigned HOST_WIDE_INT ix;
6053 constructor_elt *ce;
6054 tree temp = NULL_TREE;
6056 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (*expr_p),
6059 if (TREE_SIDE_EFFECTS (ce->value))
6060 append_to_statement_list (ce->value, &temp);
6065 /* C99 code may assign to an array in a constructed
6066 structure or union, and this has undefined behavior only
6067 on execution, so create a temporary if an lvalue is
6069 else if (fallback == fb_lvalue)
6071 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6072 mark_addressable (*expr_p);
6078 /* The following are special cases that are not handled by the
6079 original GIMPLE grammar. */
6081 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
6084 ret = gimplify_save_expr (expr_p, pre_p, post_p);
6089 enum gimplify_status r0, r1, r2;
6091 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6092 is_gimple_lvalue, fb_either);
6093 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
6094 is_gimple_val, fb_rvalue);
6095 r2 = gimplify_expr (&TREE_OPERAND (*expr_p, 2), pre_p, post_p,
6096 is_gimple_val, fb_rvalue);
6097 recalculate_side_effects (*expr_p);
6099 ret = MIN (r0, MIN (r1, r2));
6103 case NON_LVALUE_EXPR:
6104 /* This should have been stripped above. */
6108 ret = gimplify_asm_expr (expr_p, pre_p, post_p);
6111 case TRY_FINALLY_EXPR:
6112 case TRY_CATCH_EXPR:
6113 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p, 0));
6114 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p, 1));
6118 case CLEANUP_POINT_EXPR:
6119 ret = gimplify_cleanup_point_expr (expr_p, pre_p);
6123 ret = gimplify_target_expr (expr_p, pre_p, post_p);
6127 gimplify_to_stmt_list (&CATCH_BODY (*expr_p));
6131 case EH_FILTER_EXPR:
6132 gimplify_to_stmt_list (&EH_FILTER_FAILURE (*expr_p));
6136 case CHANGE_DYNAMIC_TYPE_EXPR:
6137 ret = gimplify_expr (&CHANGE_DYNAMIC_TYPE_LOCATION (*expr_p),
6138 pre_p, post_p, is_gimple_reg, fb_lvalue);
6143 enum gimplify_status r0, r1;
6144 r0 = gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p), pre_p, post_p,
6145 is_gimple_val, fb_rvalue);
6146 r1 = gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p), pre_p, post_p,
6147 is_gimple_val, fb_rvalue);
6153 /* We get here when taking the address of a label. We mark
6154 the label as "forced"; meaning it can never be removed and
6155 it is a potential target for any computed goto. */
6156 FORCED_LABEL (*expr_p) = 1;
6160 case STATEMENT_LIST:
6161 ret = gimplify_statement_list (expr_p, pre_p);
6164 case WITH_SIZE_EXPR:
6166 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6167 post_p == &internal_post ? NULL : post_p,
6168 gimple_test_f, fallback);
6169 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
6170 is_gimple_val, fb_rvalue);
6176 ret = gimplify_var_or_parm_decl (expr_p);
6180 /* When within an OpenMP context, notice uses of variables. */
6181 if (gimplify_omp_ctxp)
6182 omp_notice_variable (gimplify_omp_ctxp, *expr_p, true);
6187 /* Allow callbacks into the gimplifier during optimization. */
6192 ret = gimplify_omp_parallel (expr_p, pre_p);
6196 ret = gimplify_omp_task (expr_p, pre_p);
6200 ret = gimplify_omp_for (expr_p, pre_p);
6205 ret = gimplify_omp_workshare (expr_p, pre_p);
6212 gimplify_to_stmt_list (&OMP_BODY (*expr_p));
6216 ret = gimplify_omp_atomic (expr_p, pre_p);
6221 case OMP_ATOMIC_STORE:
6222 case OMP_SECTIONS_SWITCH:
6226 case OMP_ATOMIC_LOAD:
6227 if (gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, NULL,
6228 is_gimple_val, fb_rvalue) != GS_ALL_DONE)
6234 case POINTER_PLUS_EXPR:
6235 /* Convert ((type *)A)+offset into &A->field_of_type_and_offset.
6236 The second is gimple immediate saving a need for extra statement.
6238 if (TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
6239 && (tmp = maybe_fold_offset_to_reference
6240 (TREE_OPERAND (*expr_p, 0), TREE_OPERAND (*expr_p, 1),
6241 TREE_TYPE (TREE_TYPE (*expr_p)))))
6243 tree ptr_type = build_pointer_type (TREE_TYPE (tmp));
6244 if (useless_type_conversion_p (TREE_TYPE (*expr_p), ptr_type))
6246 *expr_p = build_fold_addr_expr_with_type (tmp, ptr_type);
6250 /* Convert (void *)&a + 4 into (void *)&a[1]. */
6251 if (TREE_CODE (TREE_OPERAND (*expr_p, 0)) == NOP_EXPR
6252 && TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
6253 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p,
6255 && (tmp = maybe_fold_offset_to_reference
6256 (TREE_OPERAND (TREE_OPERAND (*expr_p, 0), 0),
6257 TREE_OPERAND (*expr_p, 1),
6258 TREE_TYPE (TREE_TYPE
6259 (TREE_OPERAND (TREE_OPERAND (*expr_p, 0),
6262 tmp = build_fold_addr_expr (tmp);
6263 *expr_p = fold_convert (TREE_TYPE (*expr_p), tmp);
6268 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p)))
6270 case tcc_comparison:
6271 /* Handle comparison of objects of non scalar mode aggregates
6272 with a call to memcmp. It would be nice to only have to do
6273 this for variable-sized objects, but then we'd have to allow
6274 the same nest of reference nodes we allow for MODIFY_EXPR and
6277 Compare scalar mode aggregates as scalar mode values. Using
6278 memcmp for them would be very inefficient at best, and is
6279 plain wrong if bitfields are involved. */
6282 tree type = TREE_TYPE (TREE_OPERAND (*expr_p, 1));
6284 if (!AGGREGATE_TYPE_P (type))
6286 else if (TYPE_MODE (type) != BLKmode)
6287 ret = gimplify_scalar_mode_aggregate_compare (expr_p);
6289 ret = gimplify_variable_sized_compare (expr_p);
6294 /* If *EXPR_P does not need to be special-cased, handle it
6295 according to its class. */
6297 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6298 post_p, is_gimple_val, fb_rvalue);
6304 enum gimplify_status r0, r1;
6306 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6307 post_p, is_gimple_val, fb_rvalue);
6308 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
6309 post_p, is_gimple_val, fb_rvalue);
6315 case tcc_declaration:
6318 goto dont_recalculate;
6321 gcc_assert (TREE_CODE (*expr_p) == TRUTH_AND_EXPR
6322 || TREE_CODE (*expr_p) == TRUTH_OR_EXPR
6323 || TREE_CODE (*expr_p) == TRUTH_XOR_EXPR);
6327 recalculate_side_effects (*expr_p);
6332 /* If we replaced *expr_p, gimplify again. */
6333 if (ret == GS_OK && (*expr_p == NULL || *expr_p == save_expr))
6336 while (ret == GS_OK);
6338 /* If we encountered an error_mark somewhere nested inside, either
6339 stub out the statement or propagate the error back out. */
6340 if (ret == GS_ERROR)
6347 /* This was only valid as a return value from the langhook, which
6348 we handled. Make sure it doesn't escape from any other context. */
6349 gcc_assert (ret != GS_UNHANDLED);
6351 if (fallback == fb_none && *expr_p && !is_gimple_stmt (*expr_p))
6353 /* We aren't looking for a value, and we don't have a valid
6354 statement. If it doesn't have side-effects, throw it away. */
6355 if (!TREE_SIDE_EFFECTS (*expr_p))
6357 else if (!TREE_THIS_VOLATILE (*expr_p))
6359 /* This is probably a _REF that contains something nested that
6360 has side effects. Recurse through the operands to find it. */
6361 enum tree_code code = TREE_CODE (*expr_p);
6368 case VIEW_CONVERT_EXPR:
6369 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6370 gimple_test_f, fallback);
6374 case ARRAY_RANGE_REF:
6375 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6376 gimple_test_f, fallback);
6377 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
6378 gimple_test_f, fallback);
6382 /* Anything else with side-effects must be converted to
6383 a valid statement before we get here. */
6389 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p))
6390 && TYPE_MODE (TREE_TYPE (*expr_p)) != BLKmode)
6392 /* Historically, the compiler has treated a bare reference
6393 to a non-BLKmode volatile lvalue as forcing a load. */
6394 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p));
6395 /* Normally, we do not want to create a temporary for a
6396 TREE_ADDRESSABLE type because such a type should not be
6397 copied by bitwise-assignment. However, we make an
6398 exception here, as all we are doing here is ensuring that
6399 we read the bytes that make up the type. We use
6400 create_tmp_var_raw because create_tmp_var will abort when
6401 given a TREE_ADDRESSABLE type. */
6402 tree tmp = create_tmp_var_raw (type, "vol");
6403 gimple_add_tmp_var (tmp);
6404 *expr_p = build_gimple_modify_stmt (tmp, *expr_p);
6407 /* We can't do anything useful with a volatile reference to
6408 an incomplete type, so just throw it away. Likewise for
6409 a BLKmode type, since any implicit inner load should
6410 already have been turned into an explicit one by the
6411 gimplification process. */
6415 /* If we are gimplifying at the statement level, we're done. Tack
6416 everything together and replace the original statement with the
6418 if (fallback == fb_none || is_statement)
6420 if (internal_pre || internal_post)
6422 append_to_statement_list (*expr_p, &internal_pre);
6423 append_to_statement_list (internal_post, &internal_pre);
6424 annotate_all_with_locus (&internal_pre, input_location);
6425 *expr_p = internal_pre;
6429 else if (TREE_CODE (*expr_p) == STATEMENT_LIST)
6430 annotate_all_with_locus (expr_p, input_location);
6432 annotate_one_with_locus (*expr_p, input_location);
6436 /* Otherwise we're gimplifying a subexpression, so the resulting value is
6439 /* If it's sufficiently simple already, we're done. Unless we are
6440 handling some post-effects internally; if that's the case, we need to
6441 copy into a temp before adding the post-effects to the tree. */
6442 if (!internal_post && (*gimple_test_f) (*expr_p))
6445 /* Otherwise, we need to create a new temporary for the gimplified
6448 /* We can't return an lvalue if we have an internal postqueue. The
6449 object the lvalue refers to would (probably) be modified by the
6450 postqueue; we need to copy the value out first, which means an
6452 if ((fallback & fb_lvalue) && !internal_post
6453 && is_gimple_addressable (*expr_p))
6455 /* An lvalue will do. Take the address of the expression, store it
6456 in a temporary, and replace the expression with an INDIRECT_REF of
6458 tmp = build_fold_addr_expr (*expr_p);
6459 gimplify_expr (&tmp, pre_p, post_p, is_gimple_reg, fb_rvalue);
6460 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (tmp)), tmp);
6462 else if ((fallback & fb_rvalue) && is_gimple_formal_tmp_rhs (*expr_p))
6464 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p)));
6466 /* An rvalue will do. Assign the gimplified expression into a new
6467 temporary TMP and replace the original expression with TMP. */
6469 if (internal_post || (fallback & fb_lvalue))
6470 /* The postqueue might change the value of the expression between
6471 the initialization and use of the temporary, so we can't use a
6472 formal temp. FIXME do we care? */
6473 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6475 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
6477 if (TREE_CODE (*expr_p) != SSA_NAME)
6478 DECL_GIMPLE_FORMAL_TEMP_P (*expr_p) = 1;
6482 #ifdef ENABLE_CHECKING
6483 if (!(fallback & fb_mayfail))
6485 fprintf (stderr, "gimplification failed:\n");
6486 print_generic_expr (stderr, *expr_p, 0);
6487 debug_tree (*expr_p);
6488 internal_error ("gimplification failed");
6491 gcc_assert (fallback & fb_mayfail);
6492 /* If this is an asm statement, and the user asked for the
6493 impossible, don't die. Fail and let gimplify_asm_expr
6499 /* Make sure the temporary matches our predicate. */
6500 gcc_assert ((*gimple_test_f) (*expr_p));
6504 annotate_all_with_locus (&internal_post, input_location);
6505 append_to_statement_list (internal_post, pre_p);
6509 input_location = saved_location;
6513 /* Look through TYPE for variable-sized objects and gimplify each such
6514 size that we find. Add to LIST_P any statements generated. */
6517 gimplify_type_sizes (tree type, tree *list_p)
6521 if (type == NULL || type == error_mark_node)
6524 /* We first do the main variant, then copy into any other variants. */
6525 type = TYPE_MAIN_VARIANT (type);
6527 /* Avoid infinite recursion. */
6528 if (TYPE_SIZES_GIMPLIFIED (type))
6531 TYPE_SIZES_GIMPLIFIED (type) = 1;
6533 switch (TREE_CODE (type))
6539 case FIXED_POINT_TYPE:
6540 gimplify_one_sizepos (&TYPE_MIN_VALUE (type), list_p);
6541 gimplify_one_sizepos (&TYPE_MAX_VALUE (type), list_p);
6543 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
6545 TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (type);
6546 TYPE_MAX_VALUE (t) = TYPE_MAX_VALUE (type);
6551 /* These types may not have declarations, so handle them here. */
6552 gimplify_type_sizes (TREE_TYPE (type), list_p);
6553 gimplify_type_sizes (TYPE_DOMAIN (type), list_p);
6558 case QUAL_UNION_TYPE:
6559 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
6560 if (TREE_CODE (field) == FIELD_DECL)
6562 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field), list_p);
6563 gimplify_type_sizes (TREE_TYPE (field), list_p);
6568 case REFERENCE_TYPE:
6569 /* We used to recurse on the pointed-to type here, which turned out to
6570 be incorrect because its definition might refer to variables not
6571 yet initialized at this point if a forward declaration is involved.
6573 It was actually useful for anonymous pointed-to types to ensure
6574 that the sizes evaluation dominates every possible later use of the
6575 values. Restricting to such types here would be safe since there
6576 is no possible forward declaration around, but would introduce an
6577 undesirable middle-end semantic to anonymity. We then defer to
6578 front-ends the responsibility of ensuring that the sizes are
6579 evaluated both early and late enough, e.g. by attaching artificial
6580 type declarations to the tree. */
6587 gimplify_one_sizepos (&TYPE_SIZE (type), list_p);
6588 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type), list_p);
6590 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
6592 TYPE_SIZE (t) = TYPE_SIZE (type);
6593 TYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (type);
6594 TYPE_SIZES_GIMPLIFIED (t) = 1;
6598 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
6599 a size or position, has had all of its SAVE_EXPRs evaluated.
6600 We add any required statements to STMT_P. */
6603 gimplify_one_sizepos (tree *expr_p, tree *stmt_p)
6605 tree type, expr = *expr_p;
6607 /* We don't do anything if the value isn't there, is constant, or contains
6608 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
6609 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
6610 will want to replace it with a new variable, but that will cause problems
6611 if this type is from outside the function. It's OK to have that here. */
6612 if (expr == NULL_TREE || TREE_CONSTANT (expr)
6613 || TREE_CODE (expr) == VAR_DECL
6614 || CONTAINS_PLACEHOLDER_P (expr))
6617 type = TREE_TYPE (expr);
6618 *expr_p = unshare_expr (expr);
6620 gimplify_expr (expr_p, stmt_p, NULL, is_gimple_val, fb_rvalue);
6623 /* Verify that we've an exact type match with the original expression.
6624 In particular, we do not wish to drop a "sizetype" in favour of a
6625 type of similar dimensions. We don't want to pollute the generic
6626 type-stripping code with this knowledge because it doesn't matter
6627 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
6628 and friends retain their "sizetype-ness". */
6629 if (TREE_TYPE (expr) != type
6630 && TREE_CODE (type) == INTEGER_TYPE
6631 && TYPE_IS_SIZETYPE (type))
6635 *expr_p = create_tmp_var (type, NULL);
6636 tmp = build1 (NOP_EXPR, type, expr);
6637 tmp = build_gimple_modify_stmt (*expr_p, tmp);
6638 if (EXPR_HAS_LOCATION (expr))
6639 SET_EXPR_LOCUS (tmp, EXPR_LOCUS (expr));
6641 SET_EXPR_LOCATION (tmp, input_location);
6643 gimplify_and_add (tmp, stmt_p);
6648 /* Gimplify the body of statements pointed to by BODY_P. FNDECL is the
6649 function decl containing BODY. */
6652 gimplify_body (tree *body_p, tree fndecl, bool do_parms)
6654 location_t saved_location = input_location;
6655 tree body, parm_stmts;
6657 timevar_push (TV_TREE_GIMPLIFY);
6659 gcc_assert (gimplify_ctxp == NULL);
6660 push_gimplify_context ();
6662 /* Unshare most shared trees in the body and in that of any nested functions.
6663 It would seem we don't have to do this for nested functions because
6664 they are supposed to be output and then the outer function gimplified
6665 first, but the g++ front end doesn't always do it that way. */
6666 unshare_body (body_p, fndecl);
6667 unvisit_body (body_p, fndecl);
6669 /* Make sure input_location isn't set to something weird. */
6670 input_location = DECL_SOURCE_LOCATION (fndecl);
6672 /* Resolve callee-copies. This has to be done before processing
6673 the body so that DECL_VALUE_EXPR gets processed correctly. */
6674 parm_stmts = do_parms ? gimplify_parameters () : NULL;
6676 /* Gimplify the function's body. */
6677 gimplify_stmt (body_p);
6681 body = alloc_stmt_list ();
6682 else if (TREE_CODE (body) == STATEMENT_LIST)
6684 tree t = expr_only (*body_p);
6689 /* If there isn't an outer BIND_EXPR, add one. */
6690 if (TREE_CODE (body) != BIND_EXPR)
6692 tree b = build3 (BIND_EXPR, void_type_node, NULL_TREE,
6693 NULL_TREE, NULL_TREE);
6694 TREE_SIDE_EFFECTS (b) = 1;
6695 append_to_statement_list_force (body, &BIND_EXPR_BODY (b));
6699 /* If we had callee-copies statements, insert them at the beginning
6703 append_to_statement_list_force (BIND_EXPR_BODY (body), &parm_stmts);
6704 BIND_EXPR_BODY (body) = parm_stmts;
6707 /* Unshare again, in case gimplification was sloppy. */
6708 unshare_all_trees (body);
6712 pop_gimplify_context (body);
6713 gcc_assert (gimplify_ctxp == NULL);
6715 #ifdef ENABLE_TYPES_CHECKING
6716 if (!errorcount && !sorrycount)
6717 verify_gimple_1 (BIND_EXPR_BODY (*body_p));
6720 timevar_pop (TV_TREE_GIMPLIFY);
6721 input_location = saved_location;
6724 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
6725 node for the function we want to gimplify. */
6728 gimplify_function_tree (tree fndecl)
6730 tree oldfn, parm, ret;
6732 oldfn = current_function_decl;
6733 current_function_decl = fndecl;
6734 if (DECL_STRUCT_FUNCTION (fndecl))
6735 push_cfun (DECL_STRUCT_FUNCTION (fndecl));
6737 push_struct_function (fndecl);
6739 for (parm = DECL_ARGUMENTS (fndecl); parm ; parm = TREE_CHAIN (parm))
6741 /* Preliminarily mark non-addressed complex variables as eligible
6742 for promotion to gimple registers. We'll transform their uses
6744 if ((TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
6745 || TREE_CODE (TREE_TYPE (parm)) == VECTOR_TYPE)
6746 && !TREE_THIS_VOLATILE (parm)
6747 && !needs_to_live_in_memory (parm))
6748 DECL_GIMPLE_REG_P (parm) = 1;
6751 ret = DECL_RESULT (fndecl);
6752 if ((TREE_CODE (TREE_TYPE (ret)) == COMPLEX_TYPE
6753 || TREE_CODE (TREE_TYPE (ret)) == VECTOR_TYPE)
6754 && !needs_to_live_in_memory (ret))
6755 DECL_GIMPLE_REG_P (ret) = 1;
6757 gimplify_body (&DECL_SAVED_TREE (fndecl), fndecl, true);
6759 /* If we're instrumenting function entry/exit, then prepend the call to
6760 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
6761 catch the exit hook. */
6762 /* ??? Add some way to ignore exceptions for this TFE. */
6763 if (flag_instrument_function_entry_exit
6764 && !DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl)
6765 && !flag_instrument_functions_exclude_p (fndecl))
6769 tf = build2 (TRY_FINALLY_EXPR, void_type_node, NULL, NULL);
6770 TREE_SIDE_EFFECTS (tf) = 1;
6771 x = DECL_SAVED_TREE (fndecl);
6772 append_to_statement_list (x, &TREE_OPERAND (tf, 0));
6773 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_EXIT];
6774 x = build_call_expr (x, 0);
6775 append_to_statement_list (x, &TREE_OPERAND (tf, 1));
6777 bind = build3 (BIND_EXPR, void_type_node, NULL, NULL, NULL);
6778 TREE_SIDE_EFFECTS (bind) = 1;
6779 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_ENTER];
6780 x = build_call_expr (x, 0);
6781 append_to_statement_list (x, &BIND_EXPR_BODY (bind));
6782 append_to_statement_list (tf, &BIND_EXPR_BODY (bind));
6784 DECL_SAVED_TREE (fndecl) = bind;
6787 current_function_decl = oldfn;
6791 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
6792 force the result to be either ssa_name or an invariant, otherwise
6793 just force it to be a rhs expression. If VAR is not NULL, make the
6794 base variable of the final destination be VAR if suitable. */
6797 force_gimple_operand (tree expr, tree *stmts, bool simple, tree var)
6800 enum gimplify_status ret;
6801 gimple_predicate gimple_test_f;
6805 if (is_gimple_val (expr))
6808 gimple_test_f = simple ? is_gimple_val : is_gimple_reg_rhs;
6810 push_gimplify_context ();
6811 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
6812 gimplify_ctxp->allow_rhs_cond_expr = true;
6815 expr = build_gimple_modify_stmt (var, expr);
6817 if (TREE_CODE (expr) != GIMPLE_MODIFY_STMT
6818 && TREE_TYPE (expr) == void_type_node)
6820 gimplify_and_add (expr, stmts);
6825 ret = gimplify_expr (&expr, stmts, NULL,
6826 gimple_test_f, fb_rvalue);
6827 gcc_assert (ret != GS_ERROR);
6830 if (gimple_referenced_vars (cfun))
6832 for (t = gimplify_ctxp->temps; t ; t = TREE_CHAIN (t))
6833 add_referenced_var (t);
6836 pop_gimplify_context (NULL);
6841 /* Invokes force_gimple_operand for EXPR with parameters SIMPLE_P and VAR. If
6842 some statements are produced, emits them at BSI. If BEFORE is true.
6843 the statements are appended before BSI, otherwise they are appended after
6844 it. M specifies the way BSI moves after insertion (BSI_SAME_STMT or
6845 BSI_CONTINUE_LINKING are the usual values). */
6848 force_gimple_operand_bsi (block_stmt_iterator *bsi, tree expr,
6849 bool simple_p, tree var, bool before,
6850 enum bsi_iterator_update m)
6854 expr = force_gimple_operand (expr, &stmts, simple_p, var);
6857 if (gimple_in_ssa_p (cfun))
6859 tree_stmt_iterator tsi;
6861 for (tsi = tsi_start (stmts); !tsi_end_p (tsi); tsi_next (&tsi))
6862 mark_symbols_for_renaming (tsi_stmt (tsi));
6866 bsi_insert_before (bsi, stmts, m);
6868 bsi_insert_after (bsi, stmts, m);
6874 #include "gt-gimplify.h"