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
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 2, 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 COPYING. If not, write to the Free
22 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
27 #include "coretypes.h"
32 #include "tree-gimple.h"
33 #include "tree-inline.h"
34 #include "diagnostic.h"
35 #include "langhooks.h"
36 #include "langhooks-def.h"
37 #include "tree-flow.h"
51 #include "pointer-set.h"
52 #include "splay-tree.h"
55 enum gimplify_omp_var_data
61 GOVD_FIRSTPRIVATE = 16,
62 GOVD_LASTPRIVATE = 32,
65 GOVD_DEBUG_PRIVATE = 256,
66 GOVD_DATA_SHARE_CLASS = (GOVD_SHARED | GOVD_PRIVATE | GOVD_FIRSTPRIVATE
67 | GOVD_LASTPRIVATE | GOVD_REDUCTION | GOVD_LOCAL)
70 struct gimplify_omp_ctx
72 struct gimplify_omp_ctx *outer_context;
74 struct pointer_set_t *privatized_types;
76 enum omp_clause_default_kind default_kind;
78 bool is_combined_parallel;
83 struct gimplify_ctx *prev_context;
85 tree current_bind_expr;
87 tree conditional_cleanups;
91 VEC(tree,heap) *case_labels;
92 /* The formal temporary table. Should this be persistent? */
100 static struct gimplify_ctx *gimplify_ctxp;
101 static struct gimplify_omp_ctx *gimplify_omp_ctxp;
105 /* Formal (expression) temporary table handling: Multiple occurrences of
106 the same scalar expression are evaluated into the same temporary. */
108 typedef struct gimple_temp_hash_elt
111 tree temp; /* Value */
114 /* Forward declarations. */
115 static enum gimplify_status gimplify_compound_expr (tree *, tree *, bool);
116 #ifdef ENABLE_CHECKING
117 static bool cpt_same_type (tree a, tree b);
121 /* Return a hash value for a formal temporary table entry. */
124 gimple_tree_hash (const void *p)
126 tree t = ((const elt_t *) p)->val;
127 return iterative_hash_expr (t, 0);
130 /* Compare two formal temporary table entries. */
133 gimple_tree_eq (const void *p1, const void *p2)
135 tree t1 = ((const elt_t *) p1)->val;
136 tree t2 = ((const elt_t *) p2)->val;
137 enum tree_code code = TREE_CODE (t1);
139 if (TREE_CODE (t2) != code
140 || TREE_TYPE (t1) != TREE_TYPE (t2))
143 if (!operand_equal_p (t1, t2, 0))
146 /* Only allow them to compare equal if they also hash equal; otherwise
147 results are nondeterminate, and we fail bootstrap comparison. */
148 gcc_assert (gimple_tree_hash (p1) == gimple_tree_hash (p2));
153 /* Set up a context for the gimplifier. */
156 push_gimplify_context (void)
158 struct gimplify_ctx *c;
160 c = (struct gimplify_ctx *) xcalloc (1, sizeof (struct gimplify_ctx));
161 c->prev_context = gimplify_ctxp;
163 c->temp_htab = htab_create (1000, gimple_tree_hash, gimple_tree_eq, free);
168 /* Tear down a context for the gimplifier. If BODY is non-null, then
169 put the temporaries into the outer BIND_EXPR. Otherwise, put them
170 in the unexpanded_var_list. */
173 pop_gimplify_context (tree body)
175 struct gimplify_ctx *c = gimplify_ctxp;
178 gcc_assert (c && !c->current_bind_expr);
179 gimplify_ctxp = c->prev_context;
181 for (t = c->temps; t ; t = TREE_CHAIN (t))
182 DECL_GIMPLE_FORMAL_TEMP_P (t) = 0;
185 declare_vars (c->temps, body, false);
187 record_vars (c->temps);
190 htab_delete (c->temp_htab);
195 gimple_push_bind_expr (tree bind)
197 TREE_CHAIN (bind) = gimplify_ctxp->current_bind_expr;
198 gimplify_ctxp->current_bind_expr = bind;
202 gimple_pop_bind_expr (void)
204 gimplify_ctxp->current_bind_expr
205 = TREE_CHAIN (gimplify_ctxp->current_bind_expr);
209 gimple_current_bind_expr (void)
211 return gimplify_ctxp->current_bind_expr;
214 /* Returns true iff there is a COND_EXPR between us and the innermost
215 CLEANUP_POINT_EXPR. This info is used by gimple_push_cleanup. */
218 gimple_conditional_context (void)
220 return gimplify_ctxp->conditions > 0;
223 /* Note that we've entered a COND_EXPR. */
226 gimple_push_condition (void)
228 #ifdef ENABLE_CHECKING
229 if (gimplify_ctxp->conditions == 0)
230 gcc_assert (!gimplify_ctxp->conditional_cleanups);
232 ++(gimplify_ctxp->conditions);
235 /* Note that we've left a COND_EXPR. If we're back at unconditional scope
236 now, add any conditional cleanups we've seen to the prequeue. */
239 gimple_pop_condition (tree *pre_p)
241 int conds = --(gimplify_ctxp->conditions);
243 gcc_assert (conds >= 0);
246 append_to_statement_list (gimplify_ctxp->conditional_cleanups, pre_p);
247 gimplify_ctxp->conditional_cleanups = NULL_TREE;
251 /* A stable comparison routine for use with splay trees and DECLs. */
254 splay_tree_compare_decl_uid (splay_tree_key xa, splay_tree_key xb)
259 return DECL_UID (a) - DECL_UID (b);
262 /* Create a new omp construct that deals with variable remapping. */
264 static struct gimplify_omp_ctx *
265 new_omp_context (bool is_parallel, bool is_combined_parallel)
267 struct gimplify_omp_ctx *c;
269 c = XCNEW (struct gimplify_omp_ctx);
270 c->outer_context = gimplify_omp_ctxp;
271 c->variables = splay_tree_new (splay_tree_compare_decl_uid, 0, 0);
272 c->privatized_types = pointer_set_create ();
273 c->location = input_location;
274 c->is_parallel = is_parallel;
275 c->is_combined_parallel = is_combined_parallel;
276 c->default_kind = OMP_CLAUSE_DEFAULT_SHARED;
281 /* Destroy an omp construct that deals with variable remapping. */
284 delete_omp_context (struct gimplify_omp_ctx *c)
286 splay_tree_delete (c->variables);
287 pointer_set_destroy (c->privatized_types);
291 static void omp_add_variable (struct gimplify_omp_ctx *, tree, unsigned int);
292 static bool omp_notice_variable (struct gimplify_omp_ctx *, tree, bool);
294 /* A subroutine of append_to_statement_list{,_force}. T is not NULL. */
297 append_to_statement_list_1 (tree t, tree *list_p)
300 tree_stmt_iterator i;
304 if (t && TREE_CODE (t) == STATEMENT_LIST)
309 *list_p = list = alloc_stmt_list ();
313 tsi_link_after (&i, t, TSI_CONTINUE_LINKING);
316 /* Add T to the end of the list container pointed to by LIST_P.
317 If T is an expression with no effects, it is ignored. */
320 append_to_statement_list (tree t, tree *list_p)
322 if (t && TREE_SIDE_EFFECTS (t))
323 append_to_statement_list_1 (t, list_p);
326 /* Similar, but the statement is always added, regardless of side effects. */
329 append_to_statement_list_force (tree t, tree *list_p)
332 append_to_statement_list_1 (t, list_p);
335 /* Both gimplify the statement T and append it to LIST_P. */
338 gimplify_and_add (tree t, tree *list_p)
341 append_to_statement_list (t, list_p);
344 /* Strip off a legitimate source ending from the input string NAME of
345 length LEN. Rather than having to know the names used by all of
346 our front ends, we strip off an ending of a period followed by
347 up to five characters. (Java uses ".class".) */
350 remove_suffix (char *name, int len)
354 for (i = 2; i < 8 && len > i; i++)
356 if (name[len - i] == '.')
358 name[len - i] = '\0';
364 /* Create a nameless artificial label and put it in the current function
365 context. Returns the newly created label. */
368 create_artificial_label (void)
370 tree lab = build_decl (LABEL_DECL, NULL_TREE, void_type_node);
372 DECL_ARTIFICIAL (lab) = 1;
373 DECL_IGNORED_P (lab) = 1;
374 DECL_CONTEXT (lab) = current_function_decl;
378 /* Subroutine for find_single_pointer_decl. */
381 find_single_pointer_decl_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
384 tree *pdecl = (tree *) data;
386 if (DECL_P (*tp) && POINTER_TYPE_P (TREE_TYPE (*tp)))
390 /* We already found a pointer decl; return anything other
391 than NULL_TREE to unwind from walk_tree signalling that
392 we have a duplicate. */
401 /* Find the single DECL of pointer type in the tree T and return it.
402 If there are zero or more than one such DECLs, return NULL. */
405 find_single_pointer_decl (tree t)
407 tree decl = NULL_TREE;
409 if (walk_tree (&t, find_single_pointer_decl_1, &decl, NULL))
411 /* find_single_pointer_decl_1 returns a nonzero value, causing
412 walk_tree to return a nonzero value, to indicate that it
413 found more than one pointer DECL. */
420 /* Create a new temporary name with PREFIX. Returns an identifier. */
422 static GTY(()) unsigned int tmp_var_id_num;
425 create_tmp_var_name (const char *prefix)
431 char *preftmp = ASTRDUP (prefix);
433 remove_suffix (preftmp, strlen (preftmp));
437 ASM_FORMAT_PRIVATE_NAME (tmp_name, prefix ? prefix : "T", tmp_var_id_num++);
438 return get_identifier (tmp_name);
442 /* Create a new temporary variable declaration of type TYPE.
443 Does NOT push it into the current binding. */
446 create_tmp_var_raw (tree type, const char *prefix)
451 /* Make the type of the variable writable. */
452 new_type = build_type_variant (type, 0, 0);
453 TYPE_ATTRIBUTES (new_type) = TYPE_ATTRIBUTES (type);
455 tmp_var = build_decl (VAR_DECL, prefix ? create_tmp_var_name (prefix) : NULL,
458 /* The variable was declared by the compiler. */
459 DECL_ARTIFICIAL (tmp_var) = 1;
460 /* And we don't want debug info for it. */
461 DECL_IGNORED_P (tmp_var) = 1;
463 /* Make the variable writable. */
464 TREE_READONLY (tmp_var) = 0;
466 DECL_EXTERNAL (tmp_var) = 0;
467 TREE_STATIC (tmp_var) = 0;
468 TREE_USED (tmp_var) = 1;
473 /* Create a new temporary variable declaration of type TYPE. DOES push the
474 variable into the current binding. Further, assume that this is called
475 only from gimplification or optimization, at which point the creation of
476 certain types are bugs. */
479 create_tmp_var (tree type, const char *prefix)
483 /* We don't allow types that are addressable (meaning we can't make copies),
484 or incomplete. We also used to reject every variable size objects here,
485 but now support those for which a constant upper bound can be obtained.
486 The processing for variable sizes is performed in gimple_add_tmp_var,
487 point at which it really matters and possibly reached via paths not going
488 through this function, e.g. after direct calls to create_tmp_var_raw. */
489 gcc_assert (!TREE_ADDRESSABLE (type) && COMPLETE_TYPE_P (type));
491 tmp_var = create_tmp_var_raw (type, prefix);
492 gimple_add_tmp_var (tmp_var);
496 /* Given a tree, try to return a useful variable name that we can use
497 to prefix a temporary that is being assigned the value of the tree.
498 I.E. given <temp> = &A, return A. */
506 STRIP_NOPS (stripped_decl);
507 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
508 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
511 switch (TREE_CODE (stripped_decl))
514 return get_name (TREE_OPERAND (stripped_decl, 0));
521 /* Create a temporary with a name derived from VAL. Subroutine of
522 lookup_tmp_var; nobody else should call this function. */
525 create_tmp_from_val (tree val)
527 return create_tmp_var (TYPE_MAIN_VARIANT (TREE_TYPE (val)), get_name (val));
530 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
531 an existing expression temporary. */
534 lookup_tmp_var (tree val, bool is_formal)
538 /* If not optimizing, never really reuse a temporary. local-alloc
539 won't allocate any variable that is used in more than one basic
540 block, which means it will go into memory, causing much extra
541 work in reload and final and poorer code generation, outweighing
542 the extra memory allocation here. */
543 if (!optimize || !is_formal || TREE_SIDE_EFFECTS (val))
544 ret = create_tmp_from_val (val);
551 slot = htab_find_slot (gimplify_ctxp->temp_htab, (void *)&elt, INSERT);
554 elt_p = XNEW (elt_t);
556 elt_p->temp = ret = create_tmp_from_val (val);
557 *slot = (void *) elt_p;
561 elt_p = (elt_t *) *slot;
567 DECL_GIMPLE_FORMAL_TEMP_P (ret) = 1;
572 /* Returns a formal temporary variable initialized with VAL. PRE_P is as
573 in gimplify_expr. Only use this function if:
575 1) The value of the unfactored expression represented by VAL will not
576 change between the initialization and use of the temporary, and
577 2) The temporary will not be otherwise modified.
579 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
580 and #2 means it is inappropriate for && temps.
582 For other cases, use get_initialized_tmp_var instead. */
585 internal_get_tmp_var (tree val, tree *pre_p, tree *post_p, bool is_formal)
589 gimplify_expr (&val, pre_p, post_p, is_gimple_formal_tmp_rhs, fb_rvalue);
591 t = lookup_tmp_var (val, is_formal);
595 tree u = find_single_pointer_decl (val);
597 if (u && TREE_CODE (u) == VAR_DECL && DECL_BASED_ON_RESTRICT_P (u))
598 u = DECL_GET_RESTRICT_BASE (u);
599 if (u && TYPE_RESTRICT (TREE_TYPE (u)))
601 if (DECL_BASED_ON_RESTRICT_P (t))
602 gcc_assert (u == DECL_GET_RESTRICT_BASE (t));
605 DECL_BASED_ON_RESTRICT_P (t) = 1;
606 SET_DECL_RESTRICT_BASE (t, u);
611 if (TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
612 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
613 DECL_GIMPLE_REG_P (t) = 1;
615 mod = build2 (INIT_EXPR, TREE_TYPE (t), t, unshare_expr (val));
617 if (EXPR_HAS_LOCATION (val))
618 SET_EXPR_LOCUS (mod, EXPR_LOCUS (val));
620 SET_EXPR_LOCATION (mod, input_location);
622 /* gimplify_modify_expr might want to reduce this further. */
623 gimplify_and_add (mod, pre_p);
625 /* If we're gimplifying into ssa, gimplify_modify_expr will have
626 given our temporary an ssa name. Find and return it. */
627 if (gimplify_ctxp->into_ssa)
628 t = TREE_OPERAND (mod, 0);
633 /* Returns a formal temporary variable initialized with VAL. PRE_P
634 points to a statement list where side-effects needed to compute VAL
638 get_formal_tmp_var (tree val, tree *pre_p)
640 return internal_get_tmp_var (val, pre_p, NULL, true);
643 /* Returns a temporary variable initialized with VAL. PRE_P and POST_P
644 are as in gimplify_expr. */
647 get_initialized_tmp_var (tree val, tree *pre_p, tree *post_p)
649 return internal_get_tmp_var (val, pre_p, post_p, false);
652 /* Declares all the variables in VARS in SCOPE. If DEBUG_INFO is
653 true, generate debug info for them; otherwise don't. */
656 declare_vars (tree vars, tree scope, bool debug_info)
663 /* C99 mode puts the default 'return 0;' for main outside the outer
664 braces. So drill down until we find an actual scope. */
665 while (TREE_CODE (scope) == COMPOUND_EXPR)
666 scope = TREE_OPERAND (scope, 0);
668 gcc_assert (TREE_CODE (scope) == BIND_EXPR);
670 temps = nreverse (last);
672 block = BIND_EXPR_BLOCK (scope);
673 if (!block || !debug_info)
675 TREE_CHAIN (last) = BIND_EXPR_VARS (scope);
676 BIND_EXPR_VARS (scope) = temps;
680 /* We need to attach the nodes both to the BIND_EXPR and to its
681 associated BLOCK for debugging purposes. The key point here
682 is that the BLOCK_VARS of the BIND_EXPR_BLOCK of a BIND_EXPR
683 is a subchain of the BIND_EXPR_VARS of the BIND_EXPR. */
684 if (BLOCK_VARS (block))
685 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), temps);
688 BIND_EXPR_VARS (scope) = chainon (BIND_EXPR_VARS (scope), temps);
689 BLOCK_VARS (block) = temps;
695 /* For VAR a VAR_DECL of variable size, try to find a constant upper bound
696 for the size and adjust DECL_SIZE/DECL_SIZE_UNIT accordingly. Abort if
697 no such upper bound can be obtained. */
700 force_constant_size (tree var)
702 /* The only attempt we make is by querying the maximum size of objects
703 of the variable's type. */
705 HOST_WIDE_INT max_size;
707 gcc_assert (TREE_CODE (var) == VAR_DECL);
709 max_size = max_int_size_in_bytes (TREE_TYPE (var));
711 gcc_assert (max_size >= 0);
714 = build_int_cst (TREE_TYPE (DECL_SIZE_UNIT (var)), max_size);
716 = build_int_cst (TREE_TYPE (DECL_SIZE (var)), max_size * BITS_PER_UNIT);
720 gimple_add_tmp_var (tree tmp)
722 gcc_assert (!TREE_CHAIN (tmp) && !DECL_SEEN_IN_BIND_EXPR_P (tmp));
724 /* Later processing assumes that the object size is constant, which might
725 not be true at this point. Force the use of a constant upper bound in
727 if (!host_integerp (DECL_SIZE_UNIT (tmp), 1))
728 force_constant_size (tmp);
730 DECL_CONTEXT (tmp) = current_function_decl;
731 DECL_SEEN_IN_BIND_EXPR_P (tmp) = 1;
735 TREE_CHAIN (tmp) = gimplify_ctxp->temps;
736 gimplify_ctxp->temps = tmp;
738 /* Mark temporaries local within the nearest enclosing parallel. */
739 if (gimplify_omp_ctxp)
741 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
742 while (ctx && !ctx->is_parallel)
743 ctx = ctx->outer_context;
745 omp_add_variable (ctx, tmp, GOVD_LOCAL | GOVD_SEEN);
751 declare_vars (tmp, DECL_SAVED_TREE (current_function_decl), false);
754 /* Determines whether to assign a locus to the statement STMT. */
757 should_carry_locus_p (tree stmt)
759 /* Don't emit a line note for a label. We particularly don't want to
760 emit one for the break label, since it doesn't actually correspond
761 to the beginning of the loop/switch. */
762 if (TREE_CODE (stmt) == LABEL_EXPR)
765 /* Do not annotate empty statements, since it confuses gcov. */
766 if (!TREE_SIDE_EFFECTS (stmt))
773 annotate_one_with_locus (tree t, location_t locus)
775 if (CAN_HAVE_LOCATION_P (t)
776 && ! EXPR_HAS_LOCATION (t) && should_carry_locus_p (t))
777 SET_EXPR_LOCATION (t, locus);
781 annotate_all_with_locus (tree *stmt_p, location_t locus)
783 tree_stmt_iterator i;
788 for (i = tsi_start (*stmt_p); !tsi_end_p (i); tsi_next (&i))
790 tree t = tsi_stmt (i);
792 /* Assuming we've already been gimplified, we shouldn't
793 see nested chaining constructs anymore. */
794 gcc_assert (TREE_CODE (t) != STATEMENT_LIST
795 && TREE_CODE (t) != COMPOUND_EXPR);
797 annotate_one_with_locus (t, locus);
801 /* Similar to copy_tree_r() but do not copy SAVE_EXPR or TARGET_EXPR nodes.
802 These nodes model computations that should only be done once. If we
803 were to unshare something like SAVE_EXPR(i++), the gimplification
804 process would create wrong code. */
807 mostly_copy_tree_r (tree *tp, int *walk_subtrees, void *data)
809 enum tree_code code = TREE_CODE (*tp);
810 /* Don't unshare types, decls, constants and SAVE_EXPR nodes. */
811 if (TREE_CODE_CLASS (code) == tcc_type
812 || TREE_CODE_CLASS (code) == tcc_declaration
813 || TREE_CODE_CLASS (code) == tcc_constant
814 || code == SAVE_EXPR || code == TARGET_EXPR
815 /* We can't do anything sensible with a BLOCK used as an expression,
816 but we also can't just die when we see it because of non-expression
817 uses. So just avert our eyes and cross our fingers. Silly Java. */
822 gcc_assert (code != BIND_EXPR);
823 copy_tree_r (tp, walk_subtrees, data);
829 /* Callback for walk_tree to unshare most of the shared trees rooted at
830 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
831 then *TP is deep copied by calling copy_tree_r.
833 This unshares the same trees as copy_tree_r with the exception of
834 SAVE_EXPR nodes. These nodes model computations that should only be
835 done once. If we were to unshare something like SAVE_EXPR(i++), the
836 gimplification process would create wrong code. */
839 copy_if_shared_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
840 void *data ATTRIBUTE_UNUSED)
843 enum tree_code code = TREE_CODE (t);
845 /* Skip types, decls, and constants. But we do want to look at their
846 types and the bounds of types. Mark them as visited so we properly
847 unmark their subtrees on the unmark pass. If we've already seen them,
848 don't look down further. */
849 if (TREE_CODE_CLASS (code) == tcc_type
850 || TREE_CODE_CLASS (code) == tcc_declaration
851 || TREE_CODE_CLASS (code) == tcc_constant)
853 if (TREE_VISITED (t))
856 TREE_VISITED (t) = 1;
859 /* If this node has been visited already, unshare it and don't look
861 else if (TREE_VISITED (t))
863 walk_tree (tp, mostly_copy_tree_r, NULL, NULL);
867 /* Otherwise, mark the tree as visited and keep looking. */
869 TREE_VISITED (t) = 1;
875 unmark_visited_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
876 void *data ATTRIBUTE_UNUSED)
878 if (TREE_VISITED (*tp))
879 TREE_VISITED (*tp) = 0;
886 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
887 bodies of any nested functions if we are unsharing the entire body of
891 unshare_body (tree *body_p, tree fndecl)
893 struct cgraph_node *cgn = cgraph_node (fndecl);
895 walk_tree (body_p, copy_if_shared_r, NULL, NULL);
896 if (body_p == &DECL_SAVED_TREE (fndecl))
897 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
898 unshare_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
901 /* Likewise, but mark all trees as not visited. */
904 unvisit_body (tree *body_p, tree fndecl)
906 struct cgraph_node *cgn = cgraph_node (fndecl);
908 walk_tree (body_p, unmark_visited_r, NULL, NULL);
909 if (body_p == &DECL_SAVED_TREE (fndecl))
910 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
911 unvisit_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
914 /* Unshare T and all the trees reached from T via TREE_CHAIN. */
917 unshare_all_trees (tree t)
919 walk_tree (&t, copy_if_shared_r, NULL, NULL);
920 walk_tree (&t, unmark_visited_r, NULL, NULL);
923 /* Unconditionally make an unshared copy of EXPR. This is used when using
924 stored expressions which span multiple functions, such as BINFO_VTABLE,
925 as the normal unsharing process can't tell that they're shared. */
928 unshare_expr (tree expr)
930 walk_tree (&expr, mostly_copy_tree_r, NULL, NULL);
934 /* A terser interface for building a representation of an exception
938 gimple_build_eh_filter (tree body, tree allowed, tree failure)
942 /* FIXME should the allowed types go in TREE_TYPE? */
943 t = build2 (EH_FILTER_EXPR, void_type_node, allowed, NULL_TREE);
944 append_to_statement_list (failure, &EH_FILTER_FAILURE (t));
946 t = build2 (TRY_CATCH_EXPR, void_type_node, NULL_TREE, t);
947 append_to_statement_list (body, &TREE_OPERAND (t, 0));
953 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
954 contain statements and have a value. Assign its value to a temporary
955 and give it void_type_node. Returns the temporary, or NULL_TREE if
956 WRAPPER was already void. */
959 voidify_wrapper_expr (tree wrapper, tree temp)
961 tree type = TREE_TYPE (wrapper);
962 if (type && !VOID_TYPE_P (type))
966 /* Set p to point to the body of the wrapper. Loop until we find
967 something that isn't a wrapper. */
968 for (p = &wrapper; p && *p; )
970 switch (TREE_CODE (*p))
973 TREE_SIDE_EFFECTS (*p) = 1;
974 TREE_TYPE (*p) = void_type_node;
975 /* For a BIND_EXPR, the body is operand 1. */
976 p = &BIND_EXPR_BODY (*p);
979 case CLEANUP_POINT_EXPR:
980 case TRY_FINALLY_EXPR:
982 TREE_SIDE_EFFECTS (*p) = 1;
983 TREE_TYPE (*p) = void_type_node;
984 p = &TREE_OPERAND (*p, 0);
989 tree_stmt_iterator i = tsi_last (*p);
990 TREE_SIDE_EFFECTS (*p) = 1;
991 TREE_TYPE (*p) = void_type_node;
992 p = tsi_end_p (i) ? NULL : tsi_stmt_ptr (i);
997 /* Advance to the last statement. Set all container types to void. */
998 for (; TREE_CODE (*p) == COMPOUND_EXPR; p = &TREE_OPERAND (*p, 1))
1000 TREE_SIDE_EFFECTS (*p) = 1;
1001 TREE_TYPE (*p) = void_type_node;
1011 if (p == NULL || IS_EMPTY_STMT (*p))
1015 /* The wrapper is on the RHS of an assignment that we're pushing
1017 gcc_assert (TREE_CODE (temp) == INIT_EXPR
1018 || TREE_CODE (temp) == GIMPLE_MODIFY_STMT
1019 || TREE_CODE (temp) == MODIFY_EXPR);
1020 GENERIC_TREE_OPERAND (temp, 1) = *p;
1025 temp = create_tmp_var (type, "retval");
1026 *p = build2 (INIT_EXPR, type, temp, *p);
1035 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
1036 a temporary through which they communicate. */
1039 build_stack_save_restore (tree *save, tree *restore)
1041 tree save_call, tmp_var;
1044 build_call_expr (implicit_built_in_decls[BUILT_IN_STACK_SAVE], 0);
1045 tmp_var = create_tmp_var (ptr_type_node, "saved_stack");
1047 *save = build_gimple_modify_stmt (tmp_var, save_call);
1049 build_call_expr (implicit_built_in_decls[BUILT_IN_STACK_RESTORE],
1053 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
1055 static enum gimplify_status
1056 gimplify_bind_expr (tree *expr_p, tree *pre_p)
1058 tree bind_expr = *expr_p;
1059 bool old_save_stack = gimplify_ctxp->save_stack;
1062 tree temp = voidify_wrapper_expr (bind_expr, NULL);
1064 /* Mark variables seen in this bind expr. */
1065 for (t = BIND_EXPR_VARS (bind_expr); t ; t = TREE_CHAIN (t))
1067 if (TREE_CODE (t) == VAR_DECL)
1069 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
1071 /* Mark variable as local. */
1072 if (ctx && !is_global_var (t)
1073 && (! DECL_SEEN_IN_BIND_EXPR_P (t)
1074 || splay_tree_lookup (ctx->variables,
1075 (splay_tree_key) t) == NULL))
1076 omp_add_variable (gimplify_omp_ctxp, t, GOVD_LOCAL | GOVD_SEEN);
1078 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
1081 /* Preliminarily mark non-addressed complex variables as eligible
1082 for promotion to gimple registers. We'll transform their uses
1084 if ((TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
1085 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
1086 && !TREE_THIS_VOLATILE (t)
1087 && (TREE_CODE (t) == VAR_DECL && !DECL_HARD_REGISTER (t))
1088 && !needs_to_live_in_memory (t))
1089 DECL_GIMPLE_REG_P (t) = 1;
1092 gimple_push_bind_expr (bind_expr);
1093 gimplify_ctxp->save_stack = false;
1095 gimplify_to_stmt_list (&BIND_EXPR_BODY (bind_expr));
1097 if (gimplify_ctxp->save_stack)
1099 tree stack_save, stack_restore;
1101 /* Save stack on entry and restore it on exit. Add a try_finally
1102 block to achieve this. Note that mudflap depends on the
1103 format of the emitted code: see mx_register_decls(). */
1104 build_stack_save_restore (&stack_save, &stack_restore);
1106 t = build2 (TRY_FINALLY_EXPR, void_type_node,
1107 BIND_EXPR_BODY (bind_expr), NULL_TREE);
1108 append_to_statement_list (stack_restore, &TREE_OPERAND (t, 1));
1110 BIND_EXPR_BODY (bind_expr) = NULL_TREE;
1111 append_to_statement_list (stack_save, &BIND_EXPR_BODY (bind_expr));
1112 append_to_statement_list (t, &BIND_EXPR_BODY (bind_expr));
1115 gimplify_ctxp->save_stack = old_save_stack;
1116 gimple_pop_bind_expr ();
1121 append_to_statement_list (bind_expr, pre_p);
1128 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1129 GIMPLE value, it is assigned to a new temporary and the statement is
1130 re-written to return the temporary.
1132 PRE_P points to the list where side effects that must happen before
1133 STMT should be stored. */
1135 static enum gimplify_status
1136 gimplify_return_expr (tree stmt, tree *pre_p)
1138 tree ret_expr = TREE_OPERAND (stmt, 0);
1139 tree result_decl, result;
1141 if (!ret_expr || TREE_CODE (ret_expr) == RESULT_DECL
1142 || ret_expr == error_mark_node)
1145 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
1146 result_decl = NULL_TREE;
1149 result_decl = GENERIC_TREE_OPERAND (ret_expr, 0);
1150 if (TREE_CODE (result_decl) == INDIRECT_REF)
1151 /* See through a return by reference. */
1152 result_decl = TREE_OPERAND (result_decl, 0);
1154 gcc_assert ((TREE_CODE (ret_expr) == MODIFY_EXPR
1155 || TREE_CODE (ret_expr) == GIMPLE_MODIFY_STMT
1156 || TREE_CODE (ret_expr) == INIT_EXPR)
1157 && TREE_CODE (result_decl) == RESULT_DECL);
1160 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1161 Recall that aggregate_value_p is FALSE for any aggregate type that is
1162 returned in registers. If we're returning values in registers, then
1163 we don't want to extend the lifetime of the RESULT_DECL, particularly
1164 across another call. In addition, for those aggregates for which
1165 hard_function_value generates a PARALLEL, we'll die during normal
1166 expansion of structure assignments; there's special code in expand_return
1167 to handle this case that does not exist in expand_expr. */
1169 || aggregate_value_p (result_decl, TREE_TYPE (current_function_decl)))
1170 result = result_decl;
1171 else if (gimplify_ctxp->return_temp)
1172 result = gimplify_ctxp->return_temp;
1175 result = create_tmp_var (TREE_TYPE (result_decl), NULL);
1176 if (TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
1177 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
1178 DECL_GIMPLE_REG_P (result) = 1;
1180 /* ??? With complex control flow (usually involving abnormal edges),
1181 we can wind up warning about an uninitialized value for this. Due
1182 to how this variable is constructed and initialized, this is never
1183 true. Give up and never warn. */
1184 TREE_NO_WARNING (result) = 1;
1186 gimplify_ctxp->return_temp = result;
1189 /* Smash the lhs of the GIMPLE_MODIFY_STMT to the temporary we plan to use.
1190 Then gimplify the whole thing. */
1191 if (result != result_decl)
1192 GENERIC_TREE_OPERAND (ret_expr, 0) = result;
1194 gimplify_and_add (TREE_OPERAND (stmt, 0), pre_p);
1196 /* If we didn't use a temporary, then the result is just the result_decl.
1197 Otherwise we need a simple copy. This should already be gimple. */
1198 if (result == result_decl)
1201 ret_expr = build_gimple_modify_stmt (result_decl, result);
1202 TREE_OPERAND (stmt, 0) = ret_expr;
1207 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
1208 and initialization explicit. */
1210 static enum gimplify_status
1211 gimplify_decl_expr (tree *stmt_p)
1213 tree stmt = *stmt_p;
1214 tree decl = DECL_EXPR_DECL (stmt);
1216 *stmt_p = NULL_TREE;
1218 if (TREE_TYPE (decl) == error_mark_node)
1221 if ((TREE_CODE (decl) == TYPE_DECL
1222 || TREE_CODE (decl) == VAR_DECL)
1223 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl)))
1224 gimplify_type_sizes (TREE_TYPE (decl), stmt_p);
1226 if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl))
1228 tree init = DECL_INITIAL (decl);
1230 if (TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
1232 /* This is a variable-sized decl. Simplify its size and mark it
1233 for deferred expansion. Note that mudflap depends on the format
1234 of the emitted code: see mx_register_decls(). */
1235 tree t, addr, ptr_type;
1237 gimplify_one_sizepos (&DECL_SIZE (decl), stmt_p);
1238 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl), stmt_p);
1240 /* All occurrences of this decl in final gimplified code will be
1241 replaced by indirection. Setting DECL_VALUE_EXPR does two
1242 things: First, it lets the rest of the gimplifier know what
1243 replacement to use. Second, it lets the debug info know
1244 where to find the value. */
1245 ptr_type = build_pointer_type (TREE_TYPE (decl));
1246 addr = create_tmp_var (ptr_type, get_name (decl));
1247 DECL_IGNORED_P (addr) = 0;
1248 t = build_fold_indirect_ref (addr);
1249 SET_DECL_VALUE_EXPR (decl, t);
1250 DECL_HAS_VALUE_EXPR_P (decl) = 1;
1252 t = built_in_decls[BUILT_IN_ALLOCA];
1253 t = build_call_expr (t, 1, DECL_SIZE_UNIT (decl));
1254 t = fold_convert (ptr_type, t);
1255 t = build_gimple_modify_stmt (addr, t);
1257 gimplify_and_add (t, stmt_p);
1259 /* Indicate that we need to restore the stack level when the
1260 enclosing BIND_EXPR is exited. */
1261 gimplify_ctxp->save_stack = true;
1264 if (init && init != error_mark_node)
1266 if (!TREE_STATIC (decl))
1268 DECL_INITIAL (decl) = NULL_TREE;
1269 init = build2 (INIT_EXPR, void_type_node, decl, init);
1270 gimplify_and_add (init, stmt_p);
1273 /* We must still examine initializers for static variables
1274 as they may contain a label address. */
1275 walk_tree (&init, force_labels_r, NULL, NULL);
1278 /* Some front ends do not explicitly declare all anonymous
1279 artificial variables. We compensate here by declaring the
1280 variables, though it would be better if the front ends would
1281 explicitly declare them. */
1282 if (!DECL_SEEN_IN_BIND_EXPR_P (decl)
1283 && DECL_ARTIFICIAL (decl) && DECL_NAME (decl) == NULL_TREE)
1284 gimple_add_tmp_var (decl);
1290 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1291 and replacing the LOOP_EXPR with goto, but if the loop contains an
1292 EXIT_EXPR, we need to append a label for it to jump to. */
1294 static enum gimplify_status
1295 gimplify_loop_expr (tree *expr_p, tree *pre_p)
1297 tree saved_label = gimplify_ctxp->exit_label;
1298 tree start_label = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
1299 tree jump_stmt = build_and_jump (&LABEL_EXPR_LABEL (start_label));
1301 append_to_statement_list (start_label, pre_p);
1303 gimplify_ctxp->exit_label = NULL_TREE;
1305 gimplify_and_add (LOOP_EXPR_BODY (*expr_p), pre_p);
1307 if (gimplify_ctxp->exit_label)
1309 append_to_statement_list (jump_stmt, pre_p);
1310 *expr_p = build1 (LABEL_EXPR, void_type_node, gimplify_ctxp->exit_label);
1313 *expr_p = jump_stmt;
1315 gimplify_ctxp->exit_label = saved_label;
1320 /* Compare two case labels. Because the front end should already have
1321 made sure that case ranges do not overlap, it is enough to only compare
1322 the CASE_LOW values of each case label. */
1325 compare_case_labels (const void *p1, const void *p2)
1327 tree case1 = *(tree *)p1;
1328 tree case2 = *(tree *)p2;
1330 return tree_int_cst_compare (CASE_LOW (case1), CASE_LOW (case2));
1333 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1336 sort_case_labels (tree label_vec)
1338 size_t len = TREE_VEC_LENGTH (label_vec);
1339 tree default_case = TREE_VEC_ELT (label_vec, len - 1);
1341 if (CASE_LOW (default_case))
1345 /* The last label in the vector should be the default case
1347 for (i = 0; i < len; ++i)
1349 tree t = TREE_VEC_ELT (label_vec, i);
1353 TREE_VEC_ELT (label_vec, i) = TREE_VEC_ELT (label_vec, len - 1);
1354 TREE_VEC_ELT (label_vec, len - 1) = default_case;
1360 qsort (&TREE_VEC_ELT (label_vec, 0), len - 1, sizeof (tree),
1361 compare_case_labels);
1364 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1367 static enum gimplify_status
1368 gimplify_switch_expr (tree *expr_p, tree *pre_p)
1370 tree switch_expr = *expr_p;
1371 enum gimplify_status ret;
1373 ret = gimplify_expr (&SWITCH_COND (switch_expr), pre_p, NULL,
1374 is_gimple_val, fb_rvalue);
1376 if (SWITCH_BODY (switch_expr))
1378 VEC(tree,heap) *labels, *saved_labels;
1379 tree label_vec, default_case = NULL_TREE;
1382 /* If someone can be bothered to fill in the labels, they can
1383 be bothered to null out the body too. */
1384 gcc_assert (!SWITCH_LABELS (switch_expr));
1386 saved_labels = gimplify_ctxp->case_labels;
1387 gimplify_ctxp->case_labels = VEC_alloc (tree, heap, 8);
1389 gimplify_to_stmt_list (&SWITCH_BODY (switch_expr));
1391 labels = gimplify_ctxp->case_labels;
1392 gimplify_ctxp->case_labels = saved_labels;
1395 while (i < VEC_length (tree, labels))
1397 tree elt = VEC_index (tree, labels, i);
1398 tree low = CASE_LOW (elt);
1399 bool remove_element = FALSE;
1403 /* Discard empty ranges. */
1404 tree high = CASE_HIGH (elt);
1405 if (high && INT_CST_LT (high, low))
1406 remove_element = TRUE;
1410 /* The default case must be the last label in the list. */
1411 gcc_assert (!default_case);
1413 remove_element = TRUE;
1417 VEC_ordered_remove (tree, labels, i);
1423 label_vec = make_tree_vec (len + 1);
1424 SWITCH_LABELS (*expr_p) = label_vec;
1425 append_to_statement_list (switch_expr, pre_p);
1429 /* If the switch has no default label, add one, so that we jump
1430 around the switch body. */
1431 default_case = build3 (CASE_LABEL_EXPR, void_type_node, NULL_TREE,
1432 NULL_TREE, create_artificial_label ());
1433 append_to_statement_list (SWITCH_BODY (switch_expr), pre_p);
1434 *expr_p = build1 (LABEL_EXPR, void_type_node,
1435 CASE_LABEL (default_case));
1438 *expr_p = SWITCH_BODY (switch_expr);
1440 for (i = 0; i < len; ++i)
1441 TREE_VEC_ELT (label_vec, i) = VEC_index (tree, labels, i);
1442 TREE_VEC_ELT (label_vec, len) = default_case;
1444 VEC_free (tree, heap, labels);
1446 sort_case_labels (label_vec);
1448 SWITCH_BODY (switch_expr) = NULL;
1451 gcc_assert (SWITCH_LABELS (switch_expr));
1456 static enum gimplify_status
1457 gimplify_case_label_expr (tree *expr_p)
1459 tree expr = *expr_p;
1460 struct gimplify_ctx *ctxp;
1462 /* Invalid OpenMP programs can play Duff's Device type games with
1463 #pragma omp parallel. At least in the C front end, we don't
1464 detect such invalid branches until after gimplification. */
1465 for (ctxp = gimplify_ctxp; ; ctxp = ctxp->prev_context)
1466 if (ctxp->case_labels)
1469 VEC_safe_push (tree, heap, ctxp->case_labels, expr);
1470 *expr_p = build1 (LABEL_EXPR, void_type_node, CASE_LABEL (expr));
1474 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1478 build_and_jump (tree *label_p)
1480 if (label_p == NULL)
1481 /* If there's nowhere to jump, just fall through. */
1484 if (*label_p == NULL_TREE)
1486 tree label = create_artificial_label ();
1490 return build1 (GOTO_EXPR, void_type_node, *label_p);
1493 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1494 This also involves building a label to jump to and communicating it to
1495 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1497 static enum gimplify_status
1498 gimplify_exit_expr (tree *expr_p)
1500 tree cond = TREE_OPERAND (*expr_p, 0);
1503 expr = build_and_jump (&gimplify_ctxp->exit_label);
1504 expr = build3 (COND_EXPR, void_type_node, cond, expr, NULL_TREE);
1510 /* A helper function to be called via walk_tree. Mark all labels under *TP
1511 as being forced. To be called for DECL_INITIAL of static variables. */
1514 force_labels_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
1518 if (TREE_CODE (*tp) == LABEL_DECL)
1519 FORCED_LABEL (*tp) = 1;
1524 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1525 different from its canonical type, wrap the whole thing inside a
1526 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1529 The canonical type of a COMPONENT_REF is the type of the field being
1530 referenced--unless the field is a bit-field which can be read directly
1531 in a smaller mode, in which case the canonical type is the
1532 sign-appropriate type corresponding to that mode. */
1535 canonicalize_component_ref (tree *expr_p)
1537 tree expr = *expr_p;
1540 gcc_assert (TREE_CODE (expr) == COMPONENT_REF);
1542 if (INTEGRAL_TYPE_P (TREE_TYPE (expr)))
1543 type = TREE_TYPE (get_unwidened (expr, NULL_TREE));
1545 type = TREE_TYPE (TREE_OPERAND (expr, 1));
1547 if (TREE_TYPE (expr) != type)
1549 tree old_type = TREE_TYPE (expr);
1551 /* Set the type of the COMPONENT_REF to the underlying type. */
1552 TREE_TYPE (expr) = type;
1554 /* And wrap the whole thing inside a NOP_EXPR. */
1555 expr = build1 (NOP_EXPR, old_type, expr);
1561 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1562 to foo, embed that change in the ADDR_EXPR by converting
1567 where L is the lower bound. For simplicity, only do this for constant
1571 canonicalize_addr_expr (tree *expr_p)
1573 tree expr = *expr_p;
1574 tree ctype = TREE_TYPE (expr);
1575 tree addr_expr = TREE_OPERAND (expr, 0);
1576 tree atype = TREE_TYPE (addr_expr);
1577 tree dctype, datype, ddatype, otype, obj_expr;
1579 /* Both cast and addr_expr types should be pointers. */
1580 if (!POINTER_TYPE_P (ctype) || !POINTER_TYPE_P (atype))
1583 /* The addr_expr type should be a pointer to an array. */
1584 datype = TREE_TYPE (atype);
1585 if (TREE_CODE (datype) != ARRAY_TYPE)
1588 /* Both cast and addr_expr types should address the same object type. */
1589 dctype = TREE_TYPE (ctype);
1590 ddatype = TREE_TYPE (datype);
1591 if (!lang_hooks.types_compatible_p (ddatype, dctype))
1594 /* The addr_expr and the object type should match. */
1595 obj_expr = TREE_OPERAND (addr_expr, 0);
1596 otype = TREE_TYPE (obj_expr);
1597 if (!lang_hooks.types_compatible_p (otype, datype))
1600 /* The lower bound and element sizes must be constant. */
1601 if (!TYPE_SIZE_UNIT (dctype)
1602 || TREE_CODE (TYPE_SIZE_UNIT (dctype)) != INTEGER_CST
1603 || !TYPE_DOMAIN (datype) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype))
1604 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype))) != INTEGER_CST)
1607 /* All checks succeeded. Build a new node to merge the cast. */
1608 *expr_p = build4 (ARRAY_REF, dctype, obj_expr,
1609 TYPE_MIN_VALUE (TYPE_DOMAIN (datype)),
1610 NULL_TREE, NULL_TREE);
1611 *expr_p = build1 (ADDR_EXPR, ctype, *expr_p);
1614 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1615 underneath as appropriate. */
1617 static enum gimplify_status
1618 gimplify_conversion (tree *expr_p)
1620 gcc_assert (TREE_CODE (*expr_p) == NOP_EXPR
1621 || TREE_CODE (*expr_p) == CONVERT_EXPR);
1623 /* Then strip away all but the outermost conversion. */
1624 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p, 0));
1626 /* And remove the outermost conversion if it's useless. */
1627 if (tree_ssa_useless_type_conversion (*expr_p))
1628 *expr_p = TREE_OPERAND (*expr_p, 0);
1630 /* If we still have a conversion at the toplevel,
1631 then canonicalize some constructs. */
1632 if (TREE_CODE (*expr_p) == NOP_EXPR || TREE_CODE (*expr_p) == CONVERT_EXPR)
1634 tree sub = TREE_OPERAND (*expr_p, 0);
1636 /* If a NOP conversion is changing the type of a COMPONENT_REF
1637 expression, then canonicalize its type now in order to expose more
1638 redundant conversions. */
1639 if (TREE_CODE (sub) == COMPONENT_REF)
1640 canonicalize_component_ref (&TREE_OPERAND (*expr_p, 0));
1642 /* If a NOP conversion is changing a pointer to array of foo
1643 to a pointer to foo, embed that change in the ADDR_EXPR. */
1644 else if (TREE_CODE (sub) == ADDR_EXPR)
1645 canonicalize_addr_expr (expr_p);
1651 /* Gimplify a VAR_DECL or PARM_DECL. Returns GS_OK if we expanded a
1652 DECL_VALUE_EXPR, and it's worth re-examining things. */
1654 static enum gimplify_status
1655 gimplify_var_or_parm_decl (tree *expr_p)
1657 tree decl = *expr_p;
1659 /* ??? If this is a local variable, and it has not been seen in any
1660 outer BIND_EXPR, then it's probably the result of a duplicate
1661 declaration, for which we've already issued an error. It would
1662 be really nice if the front end wouldn't leak these at all.
1663 Currently the only known culprit is C++ destructors, as seen
1664 in g++.old-deja/g++.jason/binding.C. */
1665 if (TREE_CODE (decl) == VAR_DECL
1666 && !DECL_SEEN_IN_BIND_EXPR_P (decl)
1667 && !TREE_STATIC (decl) && !DECL_EXTERNAL (decl)
1668 && decl_function_context (decl) == current_function_decl)
1670 gcc_assert (errorcount || sorrycount);
1674 /* When within an OpenMP context, notice uses of variables. */
1675 if (gimplify_omp_ctxp && omp_notice_variable (gimplify_omp_ctxp, decl, true))
1678 /* If the decl is an alias for another expression, substitute it now. */
1679 if (DECL_HAS_VALUE_EXPR_P (decl))
1681 *expr_p = unshare_expr (DECL_VALUE_EXPR (decl));
1689 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1690 node pointed to by EXPR_P.
1693 : min_lval '[' val ']'
1695 | compound_lval '[' val ']'
1696 | compound_lval '.' ID
1698 This is not part of the original SIMPLE definition, which separates
1699 array and member references, but it seems reasonable to handle them
1700 together. Also, this way we don't run into problems with union
1701 aliasing; gcc requires that for accesses through a union to alias, the
1702 union reference must be explicit, which was not always the case when we
1703 were splitting up array and member refs.
1705 PRE_P points to the list where side effects that must happen before
1706 *EXPR_P should be stored.
1708 POST_P points to the list where side effects that must happen after
1709 *EXPR_P should be stored. */
1711 static enum gimplify_status
1712 gimplify_compound_lval (tree *expr_p, tree *pre_p,
1713 tree *post_p, fallback_t fallback)
1716 VEC(tree,heap) *stack;
1717 enum gimplify_status ret = GS_OK, tret;
1720 /* Create a stack of the subexpressions so later we can walk them in
1721 order from inner to outer. */
1722 stack = VEC_alloc (tree, heap, 10);
1724 /* We can handle anything that get_inner_reference can deal with. */
1725 for (p = expr_p; ; p = &TREE_OPERAND (*p, 0))
1728 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1729 if (TREE_CODE (*p) == INDIRECT_REF)
1730 *p = fold_indirect_ref (*p);
1732 if (handled_component_p (*p))
1734 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
1735 additional COMPONENT_REFs. */
1736 else if ((TREE_CODE (*p) == VAR_DECL || TREE_CODE (*p) == PARM_DECL)
1737 && gimplify_var_or_parm_decl (p) == GS_OK)
1742 VEC_safe_push (tree, heap, stack, *p);
1745 gcc_assert (VEC_length (tree, stack));
1747 /* Now STACK is a stack of pointers to all the refs we've walked through
1748 and P points to the innermost expression.
1750 Java requires that we elaborated nodes in source order. That
1751 means we must gimplify the inner expression followed by each of
1752 the indices, in order. But we can't gimplify the inner
1753 expression until we deal with any variable bounds, sizes, or
1754 positions in order to deal with PLACEHOLDER_EXPRs.
1756 So we do this in three steps. First we deal with the annotations
1757 for any variables in the components, then we gimplify the base,
1758 then we gimplify any indices, from left to right. */
1759 for (i = VEC_length (tree, stack) - 1; i >= 0; i--)
1761 tree t = VEC_index (tree, stack, i);
1763 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
1765 /* Gimplify the low bound and element type size and put them into
1766 the ARRAY_REF. If these values are set, they have already been
1768 if (!TREE_OPERAND (t, 2))
1770 tree low = unshare_expr (array_ref_low_bound (t));
1771 if (!is_gimple_min_invariant (low))
1773 TREE_OPERAND (t, 2) = low;
1774 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1775 is_gimple_formal_tmp_reg, fb_rvalue);
1776 ret = MIN (ret, tret);
1780 if (!TREE_OPERAND (t, 3))
1782 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (t, 0)));
1783 tree elmt_size = unshare_expr (array_ref_element_size (t));
1784 tree factor = size_int (TYPE_ALIGN_UNIT (elmt_type));
1786 /* Divide the element size by the alignment of the element
1788 elmt_size = size_binop (EXACT_DIV_EXPR, elmt_size, factor);
1790 if (!is_gimple_min_invariant (elmt_size))
1792 TREE_OPERAND (t, 3) = elmt_size;
1793 tret = gimplify_expr (&TREE_OPERAND (t, 3), pre_p, post_p,
1794 is_gimple_formal_tmp_reg, fb_rvalue);
1795 ret = MIN (ret, tret);
1799 else if (TREE_CODE (t) == COMPONENT_REF)
1801 /* Set the field offset into T and gimplify it. */
1802 if (!TREE_OPERAND (t, 2))
1804 tree offset = unshare_expr (component_ref_field_offset (t));
1805 tree field = TREE_OPERAND (t, 1);
1807 = size_int (DECL_OFFSET_ALIGN (field) / BITS_PER_UNIT);
1809 /* Divide the offset by its alignment. */
1810 offset = size_binop (EXACT_DIV_EXPR, offset, factor);
1812 if (!is_gimple_min_invariant (offset))
1814 TREE_OPERAND (t, 2) = offset;
1815 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1816 is_gimple_formal_tmp_reg, fb_rvalue);
1817 ret = MIN (ret, tret);
1823 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
1824 so as to match the min_lval predicate. Failure to do so may result
1825 in the creation of large aggregate temporaries. */
1826 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval,
1827 fallback | fb_lvalue);
1828 ret = MIN (ret, tret);
1830 /* And finally, the indices and operands to BIT_FIELD_REF. During this
1831 loop we also remove any useless conversions. */
1832 for (; VEC_length (tree, stack) > 0; )
1834 tree t = VEC_pop (tree, stack);
1836 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
1838 /* Gimplify the dimension.
1839 Temporary fix for gcc.c-torture/execute/20040313-1.c.
1840 Gimplify non-constant array indices into a temporary
1842 FIXME - The real fix is to gimplify post-modify
1843 expressions into a minimal gimple lvalue. However, that
1844 exposes bugs in alias analysis. The alias analyzer does
1845 not handle &PTR->FIELD very well. Will fix after the
1846 branch is merged into mainline (dnovillo 2004-05-03). */
1847 if (!is_gimple_min_invariant (TREE_OPERAND (t, 1)))
1849 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
1850 is_gimple_formal_tmp_reg, fb_rvalue);
1851 ret = MIN (ret, tret);
1854 else if (TREE_CODE (t) == BIT_FIELD_REF)
1856 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
1857 is_gimple_val, fb_rvalue);
1858 ret = MIN (ret, tret);
1859 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1860 is_gimple_val, fb_rvalue);
1861 ret = MIN (ret, tret);
1864 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t, 0));
1866 /* The innermost expression P may have originally had TREE_SIDE_EFFECTS
1867 set which would have caused all the outer expressions in EXPR_P
1868 leading to P to also have had TREE_SIDE_EFFECTS set. */
1869 recalculate_side_effects (t);
1872 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval, fallback);
1873 ret = MIN (ret, tret);
1875 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
1876 if ((fallback & fb_rvalue) && TREE_CODE (*expr_p) == COMPONENT_REF)
1878 canonicalize_component_ref (expr_p);
1879 ret = MIN (ret, GS_OK);
1882 VEC_free (tree, heap, stack);
1887 /* Gimplify the self modifying expression pointed to by EXPR_P
1890 PRE_P points to the list where side effects that must happen before
1891 *EXPR_P should be stored.
1893 POST_P points to the list where side effects that must happen after
1894 *EXPR_P should be stored.
1896 WANT_VALUE is nonzero iff we want to use the value of this expression
1897 in another expression. */
1899 static enum gimplify_status
1900 gimplify_self_mod_expr (tree *expr_p, tree *pre_p, tree *post_p,
1903 enum tree_code code;
1904 tree lhs, lvalue, rhs, t1, post = NULL, *orig_post_p = post_p;
1906 enum tree_code arith_code;
1907 enum gimplify_status ret;
1909 code = TREE_CODE (*expr_p);
1911 gcc_assert (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR
1912 || code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR);
1914 /* Prefix or postfix? */
1915 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
1916 /* Faster to treat as prefix if result is not used. */
1917 postfix = want_value;
1921 /* For postfix, make sure the inner expression's post side effects
1922 are executed after side effects from this expression. */
1926 /* Add or subtract? */
1927 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
1928 arith_code = PLUS_EXPR;
1930 arith_code = MINUS_EXPR;
1932 /* Gimplify the LHS into a GIMPLE lvalue. */
1933 lvalue = TREE_OPERAND (*expr_p, 0);
1934 ret = gimplify_expr (&lvalue, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
1935 if (ret == GS_ERROR)
1938 /* Extract the operands to the arithmetic operation. */
1940 rhs = TREE_OPERAND (*expr_p, 1);
1942 /* For postfix operator, we evaluate the LHS to an rvalue and then use
1943 that as the result value and in the postqueue operation. */
1946 ret = gimplify_expr (&lhs, pre_p, post_p, is_gimple_val, fb_rvalue);
1947 if (ret == GS_ERROR)
1951 t1 = build2 (arith_code, TREE_TYPE (*expr_p), lhs, rhs);
1952 t1 = build_gimple_modify_stmt (lvalue, t1);
1956 gimplify_and_add (t1, orig_post_p);
1957 append_to_statement_list (post, orig_post_p);
1968 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
1971 maybe_with_size_expr (tree *expr_p)
1973 tree expr = *expr_p;
1974 tree type = TREE_TYPE (expr);
1977 /* If we've already wrapped this or the type is error_mark_node, we can't do
1979 if (TREE_CODE (expr) == WITH_SIZE_EXPR
1980 || type == error_mark_node)
1983 /* If the size isn't known or is a constant, we have nothing to do. */
1984 size = TYPE_SIZE_UNIT (type);
1985 if (!size || TREE_CODE (size) == INTEGER_CST)
1988 /* Otherwise, make a WITH_SIZE_EXPR. */
1989 size = unshare_expr (size);
1990 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, expr);
1991 *expr_p = build2 (WITH_SIZE_EXPR, type, expr, size);
1994 /* Subroutine of gimplify_call_expr: Gimplify a single argument. */
1996 static enum gimplify_status
1997 gimplify_arg (tree *expr_p, tree *pre_p)
1999 bool (*test) (tree);
2002 /* In general, we allow lvalues for function arguments to avoid
2003 extra overhead of copying large aggregates out of even larger
2004 aggregates into temporaries only to copy the temporaries to
2005 the argument list. Make optimizers happy by pulling out to
2006 temporaries those types that fit in registers. */
2007 if (is_gimple_reg_type (TREE_TYPE (*expr_p)))
2008 test = is_gimple_val, fb = fb_rvalue;
2010 test = is_gimple_lvalue, fb = fb_either;
2012 /* If this is a variable sized type, we must remember the size. */
2013 maybe_with_size_expr (expr_p);
2015 /* There is a sequence point before a function call. Side effects in
2016 the argument list must occur before the actual call. So, when
2017 gimplifying arguments, force gimplify_expr to use an internal
2018 post queue which is then appended to the end of PRE_P. */
2019 return gimplify_expr (expr_p, pre_p, NULL, test, fb);
2022 /* Gimplify the CALL_EXPR node pointed to by EXPR_P. PRE_P points to the
2023 list where side effects that must happen before *EXPR_P should be stored.
2024 WANT_VALUE is true if the result of the call is desired. */
2026 static enum gimplify_status
2027 gimplify_call_expr (tree *expr_p, tree *pre_p, bool want_value)
2030 enum gimplify_status ret;
2033 gcc_assert (TREE_CODE (*expr_p) == CALL_EXPR);
2035 /* For reliable diagnostics during inlining, it is necessary that
2036 every call_expr be annotated with file and line. */
2037 if (! EXPR_HAS_LOCATION (*expr_p))
2038 SET_EXPR_LOCATION (*expr_p, input_location);
2040 /* This may be a call to a builtin function.
2042 Builtin function calls may be transformed into different
2043 (and more efficient) builtin function calls under certain
2044 circumstances. Unfortunately, gimplification can muck things
2045 up enough that the builtin expanders are not aware that certain
2046 transformations are still valid.
2048 So we attempt transformation/gimplification of the call before
2049 we gimplify the CALL_EXPR. At this time we do not manage to
2050 transform all calls in the same manner as the expanders do, but
2051 we do transform most of them. */
2052 decl = get_callee_fndecl (*expr_p);
2053 if (decl && DECL_BUILT_IN (decl))
2055 tree new = fold_call_expr (*expr_p, !want_value);
2057 if (new && new != *expr_p)
2059 /* There was a transformation of this call which computes the
2060 same value, but in a more efficient way. Return and try
2066 if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
2067 && DECL_FUNCTION_CODE (decl) == BUILT_IN_VA_START)
2069 if (call_expr_nargs (*expr_p) < 2)
2071 error ("too few arguments to function %<va_start%>");
2072 *expr_p = build_empty_stmt ();
2076 if (fold_builtin_next_arg (*expr_p, true))
2078 *expr_p = build_empty_stmt ();
2081 /* Avoid gimplifying the second argument to va_start, which needs
2082 to be the plain PARM_DECL. */
2083 return gimplify_arg (&CALL_EXPR_ARG (*expr_p, 0), pre_p);
2087 /* There is a sequence point before the call, so any side effects in
2088 the calling expression must occur before the actual call. Force
2089 gimplify_expr to use an internal post queue. */
2090 ret = gimplify_expr (&CALL_EXPR_FN (*expr_p), pre_p, NULL,
2091 is_gimple_call_addr, fb_rvalue);
2093 nargs = call_expr_nargs (*expr_p);
2095 for (i = (PUSH_ARGS_REVERSED ? nargs - 1 : 0);
2096 PUSH_ARGS_REVERSED ? i >= 0 : i < nargs;
2097 PUSH_ARGS_REVERSED ? i-- : i++)
2099 enum gimplify_status t;
2101 t = gimplify_arg (&CALL_EXPR_ARG (*expr_p, i), pre_p);
2107 /* Try this again in case gimplification exposed something. */
2108 if (ret != GS_ERROR)
2110 tree new = fold_call_expr (*expr_p, !want_value);
2112 if (new && new != *expr_p)
2114 /* There was a transformation of this call which computes the
2115 same value, but in a more efficient way. Return and try
2122 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2123 decl. This allows us to eliminate redundant or useless
2124 calls to "const" functions. */
2125 if (TREE_CODE (*expr_p) == CALL_EXPR
2126 && (call_expr_flags (*expr_p) & (ECF_CONST | ECF_PURE)))
2127 TREE_SIDE_EFFECTS (*expr_p) = 0;
2132 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2133 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2135 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2136 condition is true or false, respectively. If null, we should generate
2137 our own to skip over the evaluation of this specific expression.
2139 This function is the tree equivalent of do_jump.
2141 shortcut_cond_r should only be called by shortcut_cond_expr. */
2144 shortcut_cond_r (tree pred, tree *true_label_p, tree *false_label_p)
2146 tree local_label = NULL_TREE;
2147 tree t, expr = NULL;
2149 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2150 retain the shortcut semantics. Just insert the gotos here;
2151 shortcut_cond_expr will append the real blocks later. */
2152 if (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2154 /* Turn if (a && b) into
2156 if (a); else goto no;
2157 if (b) goto yes; else goto no;
2160 if (false_label_p == NULL)
2161 false_label_p = &local_label;
2163 t = shortcut_cond_r (TREE_OPERAND (pred, 0), NULL, false_label_p);
2164 append_to_statement_list (t, &expr);
2166 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2168 append_to_statement_list (t, &expr);
2170 else if (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2172 /* Turn if (a || b) into
2175 if (b) goto yes; else goto no;
2178 if (true_label_p == NULL)
2179 true_label_p = &local_label;
2181 t = shortcut_cond_r (TREE_OPERAND (pred, 0), true_label_p, NULL);
2182 append_to_statement_list (t, &expr);
2184 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2186 append_to_statement_list (t, &expr);
2188 else if (TREE_CODE (pred) == COND_EXPR)
2190 /* As long as we're messing with gotos, turn if (a ? b : c) into
2192 if (b) goto yes; else goto no;
2194 if (c) goto yes; else goto no; */
2195 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (pred, 0),
2196 shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2198 shortcut_cond_r (TREE_OPERAND (pred, 2), true_label_p,
2203 expr = build3 (COND_EXPR, void_type_node, pred,
2204 build_and_jump (true_label_p),
2205 build_and_jump (false_label_p));
2210 t = build1 (LABEL_EXPR, void_type_node, local_label);
2211 append_to_statement_list (t, &expr);
2218 shortcut_cond_expr (tree expr)
2220 tree pred = TREE_OPERAND (expr, 0);
2221 tree then_ = TREE_OPERAND (expr, 1);
2222 tree else_ = TREE_OPERAND (expr, 2);
2223 tree true_label, false_label, end_label, t;
2225 tree *false_label_p;
2226 bool emit_end, emit_false, jump_over_else;
2227 bool then_se = then_ && TREE_SIDE_EFFECTS (then_);
2228 bool else_se = else_ && TREE_SIDE_EFFECTS (else_);
2230 /* First do simple transformations. */
2233 /* If there is no 'else', turn (a && b) into if (a) if (b). */
2234 while (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2236 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2237 then_ = shortcut_cond_expr (expr);
2238 then_se = then_ && TREE_SIDE_EFFECTS (then_);
2239 pred = TREE_OPERAND (pred, 0);
2240 expr = build3 (COND_EXPR, void_type_node, pred, then_, NULL_TREE);
2245 /* If there is no 'then', turn
2248 if (a); else if (b); else d. */
2249 while (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2251 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2252 else_ = shortcut_cond_expr (expr);
2253 else_se = else_ && TREE_SIDE_EFFECTS (else_);
2254 pred = TREE_OPERAND (pred, 0);
2255 expr = build3 (COND_EXPR, void_type_node, pred, NULL_TREE, else_);
2259 /* If we're done, great. */
2260 if (TREE_CODE (pred) != TRUTH_ANDIF_EXPR
2261 && TREE_CODE (pred) != TRUTH_ORIF_EXPR)
2264 /* Otherwise we need to mess with gotos. Change
2267 if (a); else goto no;
2270 and recursively gimplify the condition. */
2272 true_label = false_label = end_label = NULL_TREE;
2274 /* If our arms just jump somewhere, hijack those labels so we don't
2275 generate jumps to jumps. */
2278 && TREE_CODE (then_) == GOTO_EXPR
2279 && TREE_CODE (GOTO_DESTINATION (then_)) == LABEL_DECL)
2281 true_label = GOTO_DESTINATION (then_);
2287 && TREE_CODE (else_) == GOTO_EXPR
2288 && TREE_CODE (GOTO_DESTINATION (else_)) == LABEL_DECL)
2290 false_label = GOTO_DESTINATION (else_);
2295 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2297 true_label_p = &true_label;
2299 true_label_p = NULL;
2301 /* The 'else' branch also needs a label if it contains interesting code. */
2302 if (false_label || else_se)
2303 false_label_p = &false_label;
2305 false_label_p = NULL;
2307 /* If there was nothing else in our arms, just forward the label(s). */
2308 if (!then_se && !else_se)
2309 return shortcut_cond_r (pred, true_label_p, false_label_p);
2311 /* If our last subexpression already has a terminal label, reuse it. */
2313 expr = expr_last (else_);
2315 expr = expr_last (then_);
2318 if (expr && TREE_CODE (expr) == LABEL_EXPR)
2319 end_label = LABEL_EXPR_LABEL (expr);
2321 /* If we don't care about jumping to the 'else' branch, jump to the end
2322 if the condition is false. */
2324 false_label_p = &end_label;
2326 /* We only want to emit these labels if we aren't hijacking them. */
2327 emit_end = (end_label == NULL_TREE);
2328 emit_false = (false_label == NULL_TREE);
2330 /* We only emit the jump over the else clause if we have to--if the
2331 then clause may fall through. Otherwise we can wind up with a
2332 useless jump and a useless label at the end of gimplified code,
2333 which will cause us to think that this conditional as a whole
2334 falls through even if it doesn't. If we then inline a function
2335 which ends with such a condition, that can cause us to issue an
2336 inappropriate warning about control reaching the end of a
2337 non-void function. */
2338 jump_over_else = block_may_fallthru (then_);
2340 pred = shortcut_cond_r (pred, true_label_p, false_label_p);
2343 append_to_statement_list (pred, &expr);
2345 append_to_statement_list (then_, &expr);
2350 t = build_and_jump (&end_label);
2351 append_to_statement_list (t, &expr);
2355 t = build1 (LABEL_EXPR, void_type_node, false_label);
2356 append_to_statement_list (t, &expr);
2358 append_to_statement_list (else_, &expr);
2360 if (emit_end && end_label)
2362 t = build1 (LABEL_EXPR, void_type_node, end_label);
2363 append_to_statement_list (t, &expr);
2369 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2372 gimple_boolify (tree expr)
2374 tree type = TREE_TYPE (expr);
2376 if (TREE_CODE (type) == BOOLEAN_TYPE)
2379 switch (TREE_CODE (expr))
2381 case TRUTH_AND_EXPR:
2383 case TRUTH_XOR_EXPR:
2384 case TRUTH_ANDIF_EXPR:
2385 case TRUTH_ORIF_EXPR:
2386 /* Also boolify the arguments of truth exprs. */
2387 TREE_OPERAND (expr, 1) = gimple_boolify (TREE_OPERAND (expr, 1));
2390 case TRUTH_NOT_EXPR:
2391 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2394 case EQ_EXPR: case NE_EXPR:
2395 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2396 /* These expressions always produce boolean results. */
2397 TREE_TYPE (expr) = boolean_type_node;
2401 /* Other expressions that get here must have boolean values, but
2402 might need to be converted to the appropriate mode. */
2403 return fold_convert (boolean_type_node, expr);
2407 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2416 The second form is used when *EXPR_P is of type void.
2418 TARGET is the tree for T1 above.
2420 PRE_P points to the list where side effects that must happen before
2421 *EXPR_P should be stored. */
2423 static enum gimplify_status
2424 gimplify_cond_expr (tree *expr_p, tree *pre_p, fallback_t fallback)
2426 tree expr = *expr_p;
2427 tree tmp, tmp2, type;
2428 enum gimplify_status ret;
2430 type = TREE_TYPE (expr);
2432 /* If this COND_EXPR has a value, copy the values into a temporary within
2434 if (! VOID_TYPE_P (type))
2438 if ((fallback & fb_lvalue) == 0)
2440 result = tmp2 = tmp = create_tmp_var (TREE_TYPE (expr), "iftmp");
2445 tree type = build_pointer_type (TREE_TYPE (expr));
2447 if (TREE_TYPE (TREE_OPERAND (expr, 1)) != void_type_node)
2448 TREE_OPERAND (expr, 1) =
2449 build_fold_addr_expr (TREE_OPERAND (expr, 1));
2451 if (TREE_TYPE (TREE_OPERAND (expr, 2)) != void_type_node)
2452 TREE_OPERAND (expr, 2) =
2453 build_fold_addr_expr (TREE_OPERAND (expr, 2));
2455 tmp2 = tmp = create_tmp_var (type, "iftmp");
2457 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (expr, 0),
2458 TREE_OPERAND (expr, 1), TREE_OPERAND (expr, 2));
2460 result = build_fold_indirect_ref (tmp);
2464 /* Build the then clause, 't1 = a;'. But don't build an assignment
2465 if this branch is void; in C++ it can be, if it's a throw. */
2466 if (TREE_TYPE (TREE_OPERAND (expr, 1)) != void_type_node)
2467 TREE_OPERAND (expr, 1)
2468 = build_gimple_modify_stmt (tmp, TREE_OPERAND (expr, 1));
2470 /* Build the else clause, 't1 = b;'. */
2471 if (TREE_TYPE (TREE_OPERAND (expr, 2)) != void_type_node)
2472 TREE_OPERAND (expr, 2)
2473 = build_gimple_modify_stmt (tmp2, TREE_OPERAND (expr, 2));
2475 TREE_TYPE (expr) = void_type_node;
2476 recalculate_side_effects (expr);
2478 /* Move the COND_EXPR to the prequeue. */
2479 gimplify_and_add (expr, pre_p);
2485 /* Make sure the condition has BOOLEAN_TYPE. */
2486 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2488 /* Break apart && and || conditions. */
2489 if (TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ANDIF_EXPR
2490 || TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ORIF_EXPR)
2492 expr = shortcut_cond_expr (expr);
2494 if (expr != *expr_p)
2498 /* We can't rely on gimplify_expr to re-gimplify the expanded
2499 form properly, as cleanups might cause the target labels to be
2500 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2501 set up a conditional context. */
2502 gimple_push_condition ();
2503 gimplify_stmt (expr_p);
2504 gimple_pop_condition (pre_p);
2510 /* Now do the normal gimplification. */
2511 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL,
2512 is_gimple_condexpr, fb_rvalue);
2514 gimple_push_condition ();
2516 gimplify_to_stmt_list (&TREE_OPERAND (expr, 1));
2517 gimplify_to_stmt_list (&TREE_OPERAND (expr, 2));
2518 recalculate_side_effects (expr);
2520 gimple_pop_condition (pre_p);
2522 if (ret == GS_ERROR)
2524 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2526 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 2)))
2527 /* Rewrite "if (a); else b" to "if (!a) b" */
2529 TREE_OPERAND (expr, 0) = invert_truthvalue (TREE_OPERAND (expr, 0));
2530 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL,
2531 is_gimple_condexpr, fb_rvalue);
2533 tmp = TREE_OPERAND (expr, 1);
2534 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 2);
2535 TREE_OPERAND (expr, 2) = tmp;
2538 /* Both arms are empty; replace the COND_EXPR with its predicate. */
2539 expr = TREE_OPERAND (expr, 0);
2545 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2546 a call to __builtin_memcpy. */
2548 static enum gimplify_status
2549 gimplify_modify_expr_to_memcpy (tree *expr_p, tree size, bool want_value)
2551 tree t, to, to_ptr, from, from_ptr;
2553 to = GENERIC_TREE_OPERAND (*expr_p, 0);
2554 from = GENERIC_TREE_OPERAND (*expr_p, 1);
2556 from_ptr = build_fold_addr_expr (from);
2558 to_ptr = build_fold_addr_expr (to);
2559 t = implicit_built_in_decls[BUILT_IN_MEMCPY];
2560 t = build_call_expr (t, 3, to_ptr, from_ptr, size);
2564 t = build1 (NOP_EXPR, TREE_TYPE (to_ptr), t);
2565 t = build1 (INDIRECT_REF, TREE_TYPE (to), t);
2572 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2573 a call to __builtin_memset. In this case we know that the RHS is
2574 a CONSTRUCTOR with an empty element list. */
2576 static enum gimplify_status
2577 gimplify_modify_expr_to_memset (tree *expr_p, tree size, bool want_value)
2581 to = GENERIC_TREE_OPERAND (*expr_p, 0);
2583 to_ptr = build_fold_addr_expr (to);
2584 t = implicit_built_in_decls[BUILT_IN_MEMSET];
2585 t = build_call_expr (t, 3, to_ptr, integer_zero_node, size);
2589 t = build1 (NOP_EXPR, TREE_TYPE (to_ptr), t);
2590 t = build1 (INDIRECT_REF, TREE_TYPE (to), t);
2597 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
2598 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
2599 assignment. Returns non-null if we detect a potential overlap. */
2601 struct gimplify_init_ctor_preeval_data
2603 /* The base decl of the lhs object. May be NULL, in which case we
2604 have to assume the lhs is indirect. */
2607 /* The alias set of the lhs object. */
2612 gimplify_init_ctor_preeval_1 (tree *tp, int *walk_subtrees, void *xdata)
2614 struct gimplify_init_ctor_preeval_data *data
2615 = (struct gimplify_init_ctor_preeval_data *) xdata;
2618 /* If we find the base object, obviously we have overlap. */
2619 if (data->lhs_base_decl == t)
2622 /* If the constructor component is indirect, determine if we have a
2623 potential overlap with the lhs. The only bits of information we
2624 have to go on at this point are addressability and alias sets. */
2625 if (TREE_CODE (t) == INDIRECT_REF
2626 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
2627 && alias_sets_conflict_p (data->lhs_alias_set, get_alias_set (t)))
2630 /* If the constructor component is a call, determine if it can hide a
2631 potential overlap with the lhs through an INDIRECT_REF like above. */
2632 if (TREE_CODE (t) == CALL_EXPR)
2634 tree type, fntype = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (t)));
2636 for (type = TYPE_ARG_TYPES (fntype); type; type = TREE_CHAIN (type))
2637 if (POINTER_TYPE_P (TREE_VALUE (type))
2638 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
2639 && alias_sets_conflict_p (data->lhs_alias_set,
2641 (TREE_TYPE (TREE_VALUE (type)))))
2645 if (IS_TYPE_OR_DECL_P (t))
2650 /* A subroutine of gimplify_init_constructor. Pre-evaluate *EXPR_P,
2651 force values that overlap with the lhs (as described by *DATA)
2652 into temporaries. */
2655 gimplify_init_ctor_preeval (tree *expr_p, tree *pre_p, tree *post_p,
2656 struct gimplify_init_ctor_preeval_data *data)
2658 enum gimplify_status one;
2660 /* If the value is invariant, then there's nothing to pre-evaluate.
2661 But ensure it doesn't have any side-effects since a SAVE_EXPR is
2662 invariant but has side effects and might contain a reference to
2663 the object we're initializing. */
2664 if (TREE_INVARIANT (*expr_p) && !TREE_SIDE_EFFECTS (*expr_p))
2667 /* If the type has non-trivial constructors, we can't pre-evaluate. */
2668 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p)))
2671 /* Recurse for nested constructors. */
2672 if (TREE_CODE (*expr_p) == CONSTRUCTOR)
2674 unsigned HOST_WIDE_INT ix;
2675 constructor_elt *ce;
2676 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (*expr_p);
2678 for (ix = 0; VEC_iterate (constructor_elt, v, ix, ce); ix++)
2679 gimplify_init_ctor_preeval (&ce->value, pre_p, post_p, data);
2683 /* If this is a variable sized type, we must remember the size. */
2684 maybe_with_size_expr (expr_p);
2686 /* Gimplify the constructor element to something appropriate for the rhs
2687 of a MODIFY_EXPR. Given that we know the lhs is an aggregate, we know
2688 the gimplifier will consider this a store to memory. Doing this
2689 gimplification now means that we won't have to deal with complicated
2690 language-specific trees, nor trees like SAVE_EXPR that can induce
2691 exponential search behavior. */
2692 one = gimplify_expr (expr_p, pre_p, post_p, is_gimple_mem_rhs, fb_rvalue);
2693 if (one == GS_ERROR)
2699 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
2700 with the lhs, since "a = { .x=a }" doesn't make sense. This will
2701 always be true for all scalars, since is_gimple_mem_rhs insists on a
2702 temporary variable for them. */
2703 if (DECL_P (*expr_p))
2706 /* If this is of variable size, we have no choice but to assume it doesn't
2707 overlap since we can't make a temporary for it. */
2708 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (*expr_p))) != INTEGER_CST)
2711 /* Otherwise, we must search for overlap ... */
2712 if (!walk_tree (expr_p, gimplify_init_ctor_preeval_1, data, NULL))
2715 /* ... and if found, force the value into a temporary. */
2716 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
2719 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
2720 a RANGE_EXPR in a CONSTRUCTOR for an array.
2724 object[var] = value;
2731 We increment var _after_ the loop exit check because we might otherwise
2732 fail if upper == TYPE_MAX_VALUE (type for upper).
2734 Note that we never have to deal with SAVE_EXPRs here, because this has
2735 already been taken care of for us, in gimplify_init_ctor_preeval(). */
2737 static void gimplify_init_ctor_eval (tree, VEC(constructor_elt,gc) *,
2741 gimplify_init_ctor_eval_range (tree object, tree lower, tree upper,
2742 tree value, tree array_elt_type,
2743 tree *pre_p, bool cleared)
2745 tree loop_entry_label, loop_exit_label;
2746 tree var, var_type, cref, tmp;
2748 loop_entry_label = create_artificial_label ();
2749 loop_exit_label = create_artificial_label ();
2751 /* Create and initialize the index variable. */
2752 var_type = TREE_TYPE (upper);
2753 var = create_tmp_var (var_type, NULL);
2754 append_to_statement_list (build_gimple_modify_stmt (var, lower), pre_p);
2756 /* Add the loop entry label. */
2757 append_to_statement_list (build1 (LABEL_EXPR,
2762 /* Build the reference. */
2763 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
2764 var, NULL_TREE, NULL_TREE);
2766 /* If we are a constructor, just call gimplify_init_ctor_eval to do
2767 the store. Otherwise just assign value to the reference. */
2769 if (TREE_CODE (value) == CONSTRUCTOR)
2770 /* NB we might have to call ourself recursively through
2771 gimplify_init_ctor_eval if the value is a constructor. */
2772 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
2775 append_to_statement_list (build_gimple_modify_stmt (cref, value), pre_p);
2777 /* We exit the loop when the index var is equal to the upper bound. */
2778 gimplify_and_add (build3 (COND_EXPR, void_type_node,
2779 build2 (EQ_EXPR, boolean_type_node,
2787 /* Otherwise, increment the index var... */
2788 tmp = build2 (PLUS_EXPR, var_type, var,
2789 fold_convert (var_type, integer_one_node));
2790 append_to_statement_list (build_gimple_modify_stmt (var, tmp), pre_p);
2792 /* ...and jump back to the loop entry. */
2793 append_to_statement_list (build1 (GOTO_EXPR,
2798 /* Add the loop exit label. */
2799 append_to_statement_list (build1 (LABEL_EXPR,
2805 /* Return true if FDECL is accessing a field that is zero sized. */
2808 zero_sized_field_decl (tree fdecl)
2810 if (TREE_CODE (fdecl) == FIELD_DECL && DECL_SIZE (fdecl)
2811 && integer_zerop (DECL_SIZE (fdecl)))
2816 /* Return true if TYPE is zero sized. */
2819 zero_sized_type (tree type)
2821 if (AGGREGATE_TYPE_P (type) && TYPE_SIZE (type)
2822 && integer_zerop (TYPE_SIZE (type)))
2827 /* A subroutine of gimplify_init_constructor. Generate individual
2828 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
2829 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
2830 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
2834 gimplify_init_ctor_eval (tree object, VEC(constructor_elt,gc) *elts,
2835 tree *pre_p, bool cleared)
2837 tree array_elt_type = NULL;
2838 unsigned HOST_WIDE_INT ix;
2839 tree purpose, value;
2841 if (TREE_CODE (TREE_TYPE (object)) == ARRAY_TYPE)
2842 array_elt_type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object)));
2844 FOR_EACH_CONSTRUCTOR_ELT (elts, ix, purpose, value)
2848 /* NULL values are created above for gimplification errors. */
2852 if (cleared && initializer_zerop (value))
2855 /* ??? Here's to hoping the front end fills in all of the indices,
2856 so we don't have to figure out what's missing ourselves. */
2857 gcc_assert (purpose);
2859 /* Skip zero-sized fields, unless value has side-effects. This can
2860 happen with calls to functions returning a zero-sized type, which
2861 we shouldn't discard. As a number of downstream passes don't
2862 expect sets of zero-sized fields, we rely on the gimplification of
2863 the MODIFY_EXPR we make below to drop the assignment statement. */
2864 if (! TREE_SIDE_EFFECTS (value) && zero_sized_field_decl (purpose))
2867 /* If we have a RANGE_EXPR, we have to build a loop to assign the
2869 if (TREE_CODE (purpose) == RANGE_EXPR)
2871 tree lower = TREE_OPERAND (purpose, 0);
2872 tree upper = TREE_OPERAND (purpose, 1);
2874 /* If the lower bound is equal to upper, just treat it as if
2875 upper was the index. */
2876 if (simple_cst_equal (lower, upper))
2880 gimplify_init_ctor_eval_range (object, lower, upper, value,
2881 array_elt_type, pre_p, cleared);
2888 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
2889 purpose, NULL_TREE, NULL_TREE);
2893 gcc_assert (TREE_CODE (purpose) == FIELD_DECL);
2894 cref = build3 (COMPONENT_REF, TREE_TYPE (purpose),
2895 unshare_expr (object), purpose, NULL_TREE);
2898 if (TREE_CODE (value) == CONSTRUCTOR
2899 && TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE)
2900 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
2904 init = build2 (INIT_EXPR, TREE_TYPE (cref), cref, value);
2905 gimplify_and_add (init, pre_p);
2910 /* A subroutine of gimplify_modify_expr. Break out elements of a
2911 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
2913 Note that we still need to clear any elements that don't have explicit
2914 initializers, so if not all elements are initialized we keep the
2915 original MODIFY_EXPR, we just remove all of the constructor elements. */
2917 static enum gimplify_status
2918 gimplify_init_constructor (tree *expr_p, tree *pre_p,
2919 tree *post_p, bool want_value)
2922 tree ctor = GENERIC_TREE_OPERAND (*expr_p, 1);
2923 tree type = TREE_TYPE (ctor);
2924 enum gimplify_status ret;
2925 VEC(constructor_elt,gc) *elts;
2927 if (TREE_CODE (ctor) != CONSTRUCTOR)
2928 return GS_UNHANDLED;
2930 ret = gimplify_expr (&GENERIC_TREE_OPERAND (*expr_p, 0), pre_p, post_p,
2931 is_gimple_lvalue, fb_lvalue);
2932 if (ret == GS_ERROR)
2934 object = GENERIC_TREE_OPERAND (*expr_p, 0);
2936 elts = CONSTRUCTOR_ELTS (ctor);
2939 switch (TREE_CODE (type))
2943 case QUAL_UNION_TYPE:
2946 struct gimplify_init_ctor_preeval_data preeval_data;
2947 HOST_WIDE_INT num_type_elements, num_ctor_elements;
2948 HOST_WIDE_INT num_nonzero_elements;
2949 bool cleared, valid_const_initializer;
2951 /* Aggregate types must lower constructors to initialization of
2952 individual elements. The exception is that a CONSTRUCTOR node
2953 with no elements indicates zero-initialization of the whole. */
2954 if (VEC_empty (constructor_elt, elts))
2957 /* Fetch information about the constructor to direct later processing.
2958 We might want to make static versions of it in various cases, and
2959 can only do so if it known to be a valid constant initializer. */
2960 valid_const_initializer
2961 = categorize_ctor_elements (ctor, &num_nonzero_elements,
2962 &num_ctor_elements, &cleared);
2964 /* If a const aggregate variable is being initialized, then it
2965 should never be a lose to promote the variable to be static. */
2966 if (valid_const_initializer
2967 && num_nonzero_elements > 1
2968 && TREE_READONLY (object)
2969 && TREE_CODE (object) == VAR_DECL)
2971 DECL_INITIAL (object) = ctor;
2972 TREE_STATIC (object) = 1;
2973 if (!DECL_NAME (object))
2974 DECL_NAME (object) = create_tmp_var_name ("C");
2975 walk_tree (&DECL_INITIAL (object), force_labels_r, NULL, NULL);
2977 /* ??? C++ doesn't automatically append a .<number> to the
2978 assembler name, and even when it does, it looks a FE private
2979 data structures to figure out what that number should be,
2980 which are not set for this variable. I suppose this is
2981 important for local statics for inline functions, which aren't
2982 "local" in the object file sense. So in order to get a unique
2983 TU-local symbol, we must invoke the lhd version now. */
2984 lhd_set_decl_assembler_name (object);
2986 *expr_p = NULL_TREE;
2990 /* If there are "lots" of initialized elements, even discounting
2991 those that are not address constants (and thus *must* be
2992 computed at runtime), then partition the constructor into
2993 constant and non-constant parts. Block copy the constant
2994 parts in, then generate code for the non-constant parts. */
2995 /* TODO. There's code in cp/typeck.c to do this. */
2997 num_type_elements = count_type_elements (type, true);
2999 /* If count_type_elements could not determine number of type elements
3000 for a constant-sized object, assume clearing is needed.
3001 Don't do this for variable-sized objects, as store_constructor
3002 will ignore the clearing of variable-sized objects. */
3003 if (num_type_elements < 0 && int_size_in_bytes (type) >= 0)
3005 /* If there are "lots" of zeros, then block clear the object first. */
3006 else if (num_type_elements - num_nonzero_elements > CLEAR_RATIO
3007 && num_nonzero_elements < num_type_elements/4)
3009 /* ??? This bit ought not be needed. For any element not present
3010 in the initializer, we should simply set them to zero. Except
3011 we'd need to *find* the elements that are not present, and that
3012 requires trickery to avoid quadratic compile-time behavior in
3013 large cases or excessive memory use in small cases. */
3014 else if (num_ctor_elements < num_type_elements)
3017 /* If there are "lots" of initialized elements, and all of them
3018 are valid address constants, then the entire initializer can
3019 be dropped to memory, and then memcpy'd out. Don't do this
3020 for sparse arrays, though, as it's more efficient to follow
3021 the standard CONSTRUCTOR behavior of memset followed by
3022 individual element initialization. */
3023 if (valid_const_initializer && !cleared)
3025 HOST_WIDE_INT size = int_size_in_bytes (type);
3028 /* ??? We can still get unbounded array types, at least
3029 from the C++ front end. This seems wrong, but attempt
3030 to work around it for now. */
3033 size = int_size_in_bytes (TREE_TYPE (object));
3035 TREE_TYPE (ctor) = type = TREE_TYPE (object);
3038 /* Find the maximum alignment we can assume for the object. */
3039 /* ??? Make use of DECL_OFFSET_ALIGN. */
3040 if (DECL_P (object))
3041 align = DECL_ALIGN (object);
3043 align = TYPE_ALIGN (type);
3045 if (size > 0 && !can_move_by_pieces (size, align))
3047 tree new = create_tmp_var_raw (type, "C");
3049 gimple_add_tmp_var (new);
3050 TREE_STATIC (new) = 1;
3051 TREE_READONLY (new) = 1;
3052 DECL_INITIAL (new) = ctor;
3053 if (align > DECL_ALIGN (new))
3055 DECL_ALIGN (new) = align;
3056 DECL_USER_ALIGN (new) = 1;
3058 walk_tree (&DECL_INITIAL (new), force_labels_r, NULL, NULL);
3060 GENERIC_TREE_OPERAND (*expr_p, 1) = new;
3062 /* This is no longer an assignment of a CONSTRUCTOR, but
3063 we still may have processing to do on the LHS. So
3064 pretend we didn't do anything here to let that happen. */
3065 return GS_UNHANDLED;
3069 /* If there are nonzero elements, pre-evaluate to capture elements
3070 overlapping with the lhs into temporaries. We must do this before
3071 clearing to fetch the values before they are zeroed-out. */
3072 if (num_nonzero_elements > 0)
3074 preeval_data.lhs_base_decl = get_base_address (object);
3075 if (!DECL_P (preeval_data.lhs_base_decl))
3076 preeval_data.lhs_base_decl = NULL;
3077 preeval_data.lhs_alias_set = get_alias_set (object);
3079 gimplify_init_ctor_preeval (&GENERIC_TREE_OPERAND (*expr_p, 1),
3080 pre_p, post_p, &preeval_data);
3085 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3086 Note that we still have to gimplify, in order to handle the
3087 case of variable sized types. Avoid shared tree structures. */
3088 CONSTRUCTOR_ELTS (ctor) = NULL;
3089 object = unshare_expr (object);
3090 gimplify_stmt (expr_p);
3091 append_to_statement_list (*expr_p, pre_p);
3094 /* If we have not block cleared the object, or if there are nonzero
3095 elements in the constructor, add assignments to the individual
3096 scalar fields of the object. */
3097 if (!cleared || num_nonzero_elements > 0)
3098 gimplify_init_ctor_eval (object, elts, pre_p, cleared);
3100 *expr_p = NULL_TREE;
3108 /* Extract the real and imaginary parts out of the ctor. */
3109 gcc_assert (VEC_length (constructor_elt, elts) == 2);
3110 r = VEC_index (constructor_elt, elts, 0)->value;
3111 i = VEC_index (constructor_elt, elts, 1)->value;
3112 if (r == NULL || i == NULL)
3114 tree zero = fold_convert (TREE_TYPE (type), integer_zero_node);
3121 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3122 represent creation of a complex value. */
3123 if (TREE_CONSTANT (r) && TREE_CONSTANT (i))
3125 ctor = build_complex (type, r, i);
3126 TREE_OPERAND (*expr_p, 1) = ctor;
3130 ctor = build2 (COMPLEX_EXPR, type, r, i);
3131 TREE_OPERAND (*expr_p, 1) = ctor;
3132 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
3133 rhs_predicate_for (TREE_OPERAND (*expr_p, 0)),
3141 unsigned HOST_WIDE_INT ix;
3142 constructor_elt *ce;
3144 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3145 if (TREE_CONSTANT (ctor))
3147 bool constant_p = true;
3150 /* Even when ctor is constant, it might contain non-*_CST
3151 elements (e.g. { 1.0/0.0 - 1.0/0.0, 0.0 }) and those don't
3152 belong into VECTOR_CST nodes. */
3153 FOR_EACH_CONSTRUCTOR_VALUE (elts, ix, value)
3154 if (!CONSTANT_CLASS_P (value))
3162 TREE_OPERAND (*expr_p, 1) = build_vector_from_ctor (type, elts);
3166 /* Don't reduce a TREE_CONSTANT vector ctor even if we can't
3167 make a VECTOR_CST. It won't do anything for us, and it'll
3168 prevent us from representing it as a single constant. */
3172 /* Vector types use CONSTRUCTOR all the way through gimple
3173 compilation as a general initializer. */
3174 for (ix = 0; VEC_iterate (constructor_elt, elts, ix, ce); ix++)
3176 enum gimplify_status tret;
3177 tret = gimplify_expr (&ce->value, pre_p, post_p,
3178 is_gimple_val, fb_rvalue);
3179 if (tret == GS_ERROR)
3182 if (!is_gimple_reg (GENERIC_TREE_OPERAND (*expr_p, 0)))
3183 GENERIC_TREE_OPERAND (*expr_p, 1) = get_formal_tmp_var (ctor, pre_p);
3188 /* So how did we get a CONSTRUCTOR for a scalar type? */
3192 if (ret == GS_ERROR)
3194 else if (want_value)
3196 append_to_statement_list (*expr_p, pre_p);
3204 /* Given a pointer value OP0, return a simplified version of an
3205 indirection through OP0, or NULL_TREE if no simplification is
3206 possible. This may only be applied to a rhs of an expression.
3207 Note that the resulting type may be different from the type pointed
3208 to in the sense that it is still compatible from the langhooks
3212 fold_indirect_ref_rhs (tree t)
3214 tree type = TREE_TYPE (TREE_TYPE (t));
3218 STRIP_USELESS_TYPE_CONVERSION (sub);
3219 subtype = TREE_TYPE (sub);
3220 if (!POINTER_TYPE_P (subtype))
3223 if (TREE_CODE (sub) == ADDR_EXPR)
3225 tree op = TREE_OPERAND (sub, 0);
3226 tree optype = TREE_TYPE (op);
3228 if (lang_hooks.types_compatible_p (type, optype))
3230 /* *(foo *)&fooarray => fooarray[0] */
3231 else if (TREE_CODE (optype) == ARRAY_TYPE
3232 && lang_hooks.types_compatible_p (type, TREE_TYPE (optype)))
3234 tree type_domain = TYPE_DOMAIN (optype);
3235 tree min_val = size_zero_node;
3236 if (type_domain && TYPE_MIN_VALUE (type_domain))
3237 min_val = TYPE_MIN_VALUE (type_domain);
3238 return build4 (ARRAY_REF, type, op, min_val, NULL_TREE, NULL_TREE);
3242 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
3243 if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
3244 && lang_hooks.types_compatible_p (type, TREE_TYPE (TREE_TYPE (subtype))))
3247 tree min_val = size_zero_node;
3249 sub = fold_indirect_ref_rhs (sub);
3251 sub = build1 (INDIRECT_REF, TREE_TYPE (subtype), osub);
3252 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
3253 if (type_domain && TYPE_MIN_VALUE (type_domain))
3254 min_val = TYPE_MIN_VALUE (type_domain);
3255 return build4 (ARRAY_REF, type, sub, min_val, NULL_TREE, NULL_TREE);
3261 /* Subroutine of gimplify_modify_expr to do simplifications of MODIFY_EXPRs
3262 based on the code of the RHS. We loop for as long as something changes. */
3264 static enum gimplify_status
3265 gimplify_modify_expr_rhs (tree *expr_p, tree *from_p, tree *to_p, tree *pre_p,
3266 tree *post_p, bool want_value)
3268 enum gimplify_status ret = GS_OK;
3270 while (ret != GS_UNHANDLED)
3271 switch (TREE_CODE (*from_p))
3275 /* If we have code like
3279 where the type of "x" is a (possibly cv-qualified variant
3280 of "A"), treat the entire expression as identical to "x".
3281 This kind of code arises in C++ when an object is bound
3282 to a const reference, and if "x" is a TARGET_EXPR we want
3283 to take advantage of the optimization below. */
3284 tree t = fold_indirect_ref_rhs (TREE_OPERAND (*from_p, 0));
3297 /* If we are initializing something from a TARGET_EXPR, strip the
3298 TARGET_EXPR and initialize it directly, if possible. This can't
3299 be done if the initializer is void, since that implies that the
3300 temporary is set in some non-trivial way.
3302 ??? What about code that pulls out the temp and uses it
3303 elsewhere? I think that such code never uses the TARGET_EXPR as
3304 an initializer. If I'm wrong, we'll die because the temp won't
3305 have any RTL. In that case, I guess we'll need to replace
3306 references somehow. */
3307 tree init = TARGET_EXPR_INITIAL (*from_p);
3309 if (!VOID_TYPE_P (TREE_TYPE (init)))
3320 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
3322 gimplify_compound_expr (from_p, pre_p, true);
3327 /* If we're initializing from a CONSTRUCTOR, break this into
3328 individual MODIFY_EXPRs. */
3329 return gimplify_init_constructor (expr_p, pre_p, post_p, want_value);
3332 /* If we're assigning to a non-register type, push the assignment
3333 down into the branches. This is mandatory for ADDRESSABLE types,
3334 since we cannot generate temporaries for such, but it saves a
3335 copy in other cases as well. */
3336 if (!is_gimple_reg_type (TREE_TYPE (*from_p)))
3338 /* This code should mirror the code in gimplify_cond_expr. */
3339 enum tree_code code = TREE_CODE (*expr_p);
3340 tree cond = *from_p;
3341 tree result = *to_p;
3343 ret = gimplify_expr (&result, pre_p, post_p,
3344 is_gimple_min_lval, fb_lvalue);
3345 if (ret != GS_ERROR)
3348 if (TREE_TYPE (TREE_OPERAND (cond, 1)) != void_type_node)
3349 TREE_OPERAND (cond, 1)
3350 = build2 (code, void_type_node, result,
3351 TREE_OPERAND (cond, 1));
3352 if (TREE_TYPE (TREE_OPERAND (cond, 2)) != void_type_node)
3353 TREE_OPERAND (cond, 2)
3354 = build2 (code, void_type_node, unshare_expr (result),
3355 TREE_OPERAND (cond, 2));
3357 TREE_TYPE (cond) = void_type_node;
3358 recalculate_side_effects (cond);
3362 gimplify_and_add (cond, pre_p);
3363 *expr_p = unshare_expr (result);
3374 /* For calls that return in memory, give *to_p as the CALL_EXPR's
3375 return slot so that we don't generate a temporary. */
3376 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p)
3377 && aggregate_value_p (*from_p, *from_p))
3381 if (!(rhs_predicate_for (*to_p))(*from_p))
3382 /* If we need a temporary, *to_p isn't accurate. */
3384 else if (TREE_CODE (*to_p) == RESULT_DECL
3385 && DECL_NAME (*to_p) == NULL_TREE
3386 && needs_to_live_in_memory (*to_p))
3387 /* It's OK to use the return slot directly unless it's an NRV. */
3389 else if (is_gimple_reg_type (TREE_TYPE (*to_p))
3390 || (DECL_P (*to_p) && DECL_REGISTER (*to_p)))
3391 /* Don't force regs into memory. */
3393 else if (TREE_CODE (*to_p) == VAR_DECL
3394 && DECL_GIMPLE_FORMAL_TEMP_P (*to_p))
3395 /* Don't use the original target if it's a formal temp; we
3396 don't want to take their addresses. */
3398 else if (TREE_CODE (*expr_p) == INIT_EXPR)
3399 /* It's OK to use the target directly if it's being
3402 else if (!is_gimple_non_addressable (*to_p))
3403 /* Don't use the original target if it's already addressable;
3404 if its address escapes, and the called function uses the
3405 NRV optimization, a conforming program could see *to_p
3406 change before the called function returns; see c++/19317.
3407 When optimizing, the return_slot pass marks more functions
3408 as safe after we have escape info. */
3415 CALL_EXPR_RETURN_SLOT_OPT (*from_p) = 1;
3416 lang_hooks.mark_addressable (*to_p);
3423 /* If we're initializing from a container, push the initialization
3425 case CLEANUP_POINT_EXPR:
3427 case STATEMENT_LIST:
3429 tree wrap = *from_p;
3432 ret = gimplify_expr (to_p, pre_p, post_p,
3433 is_gimple_min_lval, fb_lvalue);
3434 if (ret != GS_ERROR)
3437 t = voidify_wrapper_expr (wrap, *expr_p);
3438 gcc_assert (t == *expr_p);
3442 gimplify_and_add (wrap, pre_p);
3443 *expr_p = unshare_expr (*to_p);
3458 /* Destructively convert the TREE pointer in TP into a gimple tuple if
3462 tree_to_gimple_tuple (tree *tp)
3465 switch (TREE_CODE (*tp))
3467 case GIMPLE_MODIFY_STMT:
3471 struct gimple_stmt *gs;
3472 tree lhs = TREE_OPERAND (*tp, 0);
3473 bool def_stmt_self_p = false;
3475 if (TREE_CODE (lhs) == SSA_NAME)
3477 if (SSA_NAME_DEF_STMT (lhs) == *tp)
3478 def_stmt_self_p = true;
3481 gs = &make_node (GIMPLE_MODIFY_STMT)->gstmt;
3482 gs->base = (*tp)->base;
3483 /* The set to base above overwrites the CODE. */
3484 TREE_SET_CODE ((tree) gs, GIMPLE_MODIFY_STMT);
3486 gs->locus = EXPR_LOCUS (*tp);
3487 gs->operands[0] = TREE_OPERAND (*tp, 0);
3488 gs->operands[1] = TREE_OPERAND (*tp, 1);
3489 gs->block = TREE_BLOCK (*tp);
3492 /* If we re-gimplify a set to an SSA_NAME, we must change the
3493 SSA name's DEF_STMT link. */
3494 if (def_stmt_self_p)
3495 SSA_NAME_DEF_STMT (GIMPLE_STMT_OPERAND (*tp, 0)) = *tp;
3504 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
3505 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
3506 DECL_GIMPLE_REG_P set. */
3508 static enum gimplify_status
3509 gimplify_modify_expr_complex_part (tree *expr_p, tree *pre_p, bool want_value)
3511 enum tree_code code, ocode;
3512 tree lhs, rhs, new_rhs, other, realpart, imagpart;
3514 lhs = GENERIC_TREE_OPERAND (*expr_p, 0);
3515 rhs = GENERIC_TREE_OPERAND (*expr_p, 1);
3516 code = TREE_CODE (lhs);
3517 lhs = TREE_OPERAND (lhs, 0);
3519 ocode = code == REALPART_EXPR ? IMAGPART_EXPR : REALPART_EXPR;
3520 other = build1 (ocode, TREE_TYPE (rhs), lhs);
3521 other = get_formal_tmp_var (other, pre_p);
3523 realpart = code == REALPART_EXPR ? rhs : other;
3524 imagpart = code == REALPART_EXPR ? other : rhs;
3526 if (TREE_CONSTANT (realpart) && TREE_CONSTANT (imagpart))
3527 new_rhs = build_complex (TREE_TYPE (lhs), realpart, imagpart);
3529 new_rhs = build2 (COMPLEX_EXPR, TREE_TYPE (lhs), realpart, imagpart);
3531 GENERIC_TREE_OPERAND (*expr_p, 0) = lhs;
3532 GENERIC_TREE_OPERAND (*expr_p, 1) = new_rhs;
3536 tree_to_gimple_tuple (expr_p);
3538 append_to_statement_list (*expr_p, pre_p);
3545 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
3551 PRE_P points to the list where side effects that must happen before
3552 *EXPR_P should be stored.
3554 POST_P points to the list where side effects that must happen after
3555 *EXPR_P should be stored.
3557 WANT_VALUE is nonzero iff we want to use the value of this expression
3558 in another expression. */
3560 static enum gimplify_status
3561 gimplify_modify_expr (tree *expr_p, tree *pre_p, tree *post_p, bool want_value)
3563 tree *from_p = &GENERIC_TREE_OPERAND (*expr_p, 1);
3564 tree *to_p = &GENERIC_TREE_OPERAND (*expr_p, 0);
3565 enum gimplify_status ret = GS_UNHANDLED;
3567 gcc_assert (TREE_CODE (*expr_p) == MODIFY_EXPR
3568 || TREE_CODE (*expr_p) == GIMPLE_MODIFY_STMT
3569 || TREE_CODE (*expr_p) == INIT_EXPR);
3571 /* For zero sized types only gimplify the left hand side and right hand side
3572 as statements and throw away the assignment. */
3573 if (zero_sized_type (TREE_TYPE (*from_p)))
3575 gimplify_stmt (from_p);
3576 gimplify_stmt (to_p);
3577 append_to_statement_list (*from_p, pre_p);
3578 append_to_statement_list (*to_p, pre_p);
3579 *expr_p = NULL_TREE;
3583 /* See if any simplifications can be done based on what the RHS is. */
3584 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
3586 if (ret != GS_UNHANDLED)
3589 /* If the value being copied is of variable width, compute the length
3590 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
3591 before gimplifying any of the operands so that we can resolve any
3592 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
3593 the size of the expression to be copied, not of the destination, so
3594 that is what we must here. */
3595 maybe_with_size_expr (from_p);
3597 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
3598 if (ret == GS_ERROR)
3601 ret = gimplify_expr (from_p, pre_p, post_p,
3602 rhs_predicate_for (*to_p), fb_rvalue);
3603 if (ret == GS_ERROR)
3606 /* Now see if the above changed *from_p to something we handle specially. */
3607 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
3609 if (ret != GS_UNHANDLED)
3612 /* If we've got a variable sized assignment between two lvalues (i.e. does
3613 not involve a call), then we can make things a bit more straightforward
3614 by converting the assignment to memcpy or memset. */
3615 if (TREE_CODE (*from_p) == WITH_SIZE_EXPR)
3617 tree from = TREE_OPERAND (*from_p, 0);
3618 tree size = TREE_OPERAND (*from_p, 1);
3620 if (TREE_CODE (from) == CONSTRUCTOR)
3621 return gimplify_modify_expr_to_memset (expr_p, size, want_value);
3622 if (is_gimple_addressable (from))
3625 return gimplify_modify_expr_to_memcpy (expr_p, size, want_value);
3629 /* Transform partial stores to non-addressable complex variables into
3630 total stores. This allows us to use real instead of virtual operands
3631 for these variables, which improves optimization. */
3632 if ((TREE_CODE (*to_p) == REALPART_EXPR
3633 || TREE_CODE (*to_p) == IMAGPART_EXPR)
3634 && is_gimple_reg (TREE_OPERAND (*to_p, 0)))
3635 return gimplify_modify_expr_complex_part (expr_p, pre_p, want_value);
3637 if (gimplify_ctxp->into_ssa && is_gimple_reg (*to_p))
3639 /* If we've somehow already got an SSA_NAME on the LHS, then
3640 we're probably modified it twice. Not good. */
3641 gcc_assert (TREE_CODE (*to_p) != SSA_NAME);
3642 *to_p = make_ssa_name (*to_p, *expr_p);
3645 /* Try to alleviate the effects of the gimplification creating artificial
3646 temporaries (see for example is_gimple_reg_rhs) on the debug info. */
3647 if (!gimplify_ctxp->into_ssa
3648 && DECL_P (*from_p) && DECL_IGNORED_P (*from_p)
3649 && DECL_P (*to_p) && !DECL_IGNORED_P (*to_p))
3651 if (!DECL_NAME (*from_p) && DECL_NAME (*to_p))
3653 = create_tmp_var_name (IDENTIFIER_POINTER (DECL_NAME (*to_p)));
3654 DECL_DEBUG_EXPR_IS_FROM (*from_p) = 1;
3655 SET_DECL_DEBUG_EXPR (*from_p, *to_p);
3660 tree_to_gimple_tuple (expr_p);
3662 append_to_statement_list (*expr_p, pre_p);
3670 /* Gimplify a comparison between two variable-sized objects. Do this
3671 with a call to BUILT_IN_MEMCMP. */
3673 static enum gimplify_status
3674 gimplify_variable_sized_compare (tree *expr_p)
3676 tree op0 = TREE_OPERAND (*expr_p, 0);
3677 tree op1 = TREE_OPERAND (*expr_p, 1);
3678 tree t, arg, dest, src;
3680 arg = TYPE_SIZE_UNIT (TREE_TYPE (op0));
3681 arg = unshare_expr (arg);
3682 arg = SUBSTITUTE_PLACEHOLDER_IN_EXPR (arg, op0);
3683 src = build_fold_addr_expr (op1);
3684 dest = build_fold_addr_expr (op0);
3685 t = implicit_built_in_decls[BUILT_IN_MEMCMP];
3686 t = build_call_expr (t, 3, dest, src, arg);
3688 = build2 (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), t, integer_zero_node);
3693 /* Gimplify a comparison between two aggregate objects of integral scalar
3694 mode as a comparison between the bitwise equivalent scalar values. */
3696 static enum gimplify_status
3697 gimplify_scalar_mode_aggregate_compare (tree *expr_p)
3699 tree op0 = TREE_OPERAND (*expr_p, 0);
3700 tree op1 = TREE_OPERAND (*expr_p, 1);
3702 tree type = TREE_TYPE (op0);
3703 tree scalar_type = lang_hooks.types.type_for_mode (TYPE_MODE (type), 1);
3705 op0 = fold_build1 (VIEW_CONVERT_EXPR, scalar_type, op0);
3706 op1 = fold_build1 (VIEW_CONVERT_EXPR, scalar_type, op1);
3709 = fold_build2 (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), op0, op1);
3714 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
3715 points to the expression to gimplify.
3717 Expressions of the form 'a && b' are gimplified to:
3719 a && b ? true : false
3721 gimplify_cond_expr will do the rest.
3723 PRE_P points to the list where side effects that must happen before
3724 *EXPR_P should be stored. */
3726 static enum gimplify_status
3727 gimplify_boolean_expr (tree *expr_p)
3729 /* Preserve the original type of the expression. */
3730 tree type = TREE_TYPE (*expr_p);
3732 *expr_p = build3 (COND_EXPR, type, *expr_p,
3733 fold_convert (type, boolean_true_node),
3734 fold_convert (type, boolean_false_node));
3739 /* Gimplifies an expression sequence. This function gimplifies each
3740 expression and re-writes the original expression with the last
3741 expression of the sequence in GIMPLE form.
3743 PRE_P points to the list where the side effects for all the
3744 expressions in the sequence will be emitted.
3746 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
3747 /* ??? Should rearrange to share the pre-queue with all the indirect
3748 invocations of gimplify_expr. Would probably save on creations
3749 of statement_list nodes. */
3751 static enum gimplify_status
3752 gimplify_compound_expr (tree *expr_p, tree *pre_p, bool want_value)
3758 tree *sub_p = &TREE_OPERAND (t, 0);
3760 if (TREE_CODE (*sub_p) == COMPOUND_EXPR)
3761 gimplify_compound_expr (sub_p, pre_p, false);
3763 gimplify_stmt (sub_p);
3764 append_to_statement_list (*sub_p, pre_p);
3766 t = TREE_OPERAND (t, 1);
3768 while (TREE_CODE (t) == COMPOUND_EXPR);
3775 gimplify_stmt (expr_p);
3780 /* Gimplifies a statement list. These may be created either by an
3781 enlightened front-end, or by shortcut_cond_expr. */
3783 static enum gimplify_status
3784 gimplify_statement_list (tree *expr_p, tree *pre_p)
3786 tree temp = voidify_wrapper_expr (*expr_p, NULL);
3788 tree_stmt_iterator i = tsi_start (*expr_p);
3790 while (!tsi_end_p (i))
3794 gimplify_stmt (tsi_stmt_ptr (i));
3799 else if (TREE_CODE (t) == STATEMENT_LIST)
3801 tsi_link_before (&i, t, TSI_SAME_STMT);
3810 append_to_statement_list (*expr_p, pre_p);
3818 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
3819 gimplify. After gimplification, EXPR_P will point to a new temporary
3820 that holds the original value of the SAVE_EXPR node.
3822 PRE_P points to the list where side effects that must happen before
3823 *EXPR_P should be stored. */
3825 static enum gimplify_status
3826 gimplify_save_expr (tree *expr_p, tree *pre_p, tree *post_p)
3828 enum gimplify_status ret = GS_ALL_DONE;
3831 gcc_assert (TREE_CODE (*expr_p) == SAVE_EXPR);
3832 val = TREE_OPERAND (*expr_p, 0);
3834 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
3835 if (!SAVE_EXPR_RESOLVED_P (*expr_p))
3837 /* The operand may be a void-valued expression such as SAVE_EXPRs
3838 generated by the Java frontend for class initialization. It is
3839 being executed only for its side-effects. */
3840 if (TREE_TYPE (val) == void_type_node)
3842 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3843 is_gimple_stmt, fb_none);
3844 append_to_statement_list (TREE_OPERAND (*expr_p, 0), pre_p);
3848 val = get_initialized_tmp_var (val, pre_p, post_p);
3850 TREE_OPERAND (*expr_p, 0) = val;
3851 SAVE_EXPR_RESOLVED_P (*expr_p) = 1;
3859 /* Re-write the ADDR_EXPR node pointed to by EXPR_P
3866 PRE_P points to the list where side effects that must happen before
3867 *EXPR_P should be stored.
3869 POST_P points to the list where side effects that must happen after
3870 *EXPR_P should be stored. */
3872 static enum gimplify_status
3873 gimplify_addr_expr (tree *expr_p, tree *pre_p, tree *post_p)
3875 tree expr = *expr_p;
3876 tree op0 = TREE_OPERAND (expr, 0);
3877 enum gimplify_status ret;
3879 switch (TREE_CODE (op0))
3882 case MISALIGNED_INDIRECT_REF:
3884 /* Check if we are dealing with an expression of the form '&*ptr'.
3885 While the front end folds away '&*ptr' into 'ptr', these
3886 expressions may be generated internally by the compiler (e.g.,
3887 builtins like __builtin_va_end). */
3888 /* Caution: the silent array decomposition semantics we allow for
3889 ADDR_EXPR means we can't always discard the pair. */
3890 /* Gimplification of the ADDR_EXPR operand may drop
3891 cv-qualification conversions, so make sure we add them if
3894 tree op00 = TREE_OPERAND (op0, 0);
3895 tree t_expr = TREE_TYPE (expr);
3896 tree t_op00 = TREE_TYPE (op00);
3898 if (!lang_hooks.types_compatible_p (t_expr, t_op00))
3900 #ifdef ENABLE_CHECKING
3901 tree t_op0 = TREE_TYPE (op0);
3902 gcc_assert (POINTER_TYPE_P (t_expr)
3903 && cpt_same_type (TREE_CODE (t_op0) == ARRAY_TYPE
3904 ? TREE_TYPE (t_op0) : t_op0,
3906 && POINTER_TYPE_P (t_op00)
3907 && cpt_same_type (t_op0, TREE_TYPE (t_op00)));
3909 op00 = fold_convert (TREE_TYPE (expr), op00);
3916 case VIEW_CONVERT_EXPR:
3917 /* Take the address of our operand and then convert it to the type of
3920 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
3921 all clear. The impact of this transformation is even less clear. */
3923 /* If the operand is a useless conversion, look through it. Doing so
3924 guarantees that the ADDR_EXPR and its operand will remain of the
3926 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0, 0)))
3927 op0 = TREE_OPERAND (op0, 0);
3929 *expr_p = fold_convert (TREE_TYPE (expr),
3930 build_fold_addr_expr (TREE_OPERAND (op0, 0)));
3935 /* We use fb_either here because the C frontend sometimes takes
3936 the address of a call that returns a struct; see
3937 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
3938 the implied temporary explicit. */
3939 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, post_p,
3940 is_gimple_addressable, fb_either);
3941 if (ret != GS_ERROR)
3943 op0 = TREE_OPERAND (expr, 0);
3945 /* For various reasons, the gimplification of the expression
3946 may have made a new INDIRECT_REF. */
3947 if (TREE_CODE (op0) == INDIRECT_REF)
3948 goto do_indirect_ref;
3950 /* Make sure TREE_INVARIANT, TREE_CONSTANT, and TREE_SIDE_EFFECTS
3952 recompute_tree_invariant_for_addr_expr (expr);
3954 /* Mark the RHS addressable. */
3955 lang_hooks.mark_addressable (TREE_OPERAND (expr, 0));
3963 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
3964 value; output operands should be a gimple lvalue. */
3966 static enum gimplify_status
3967 gimplify_asm_expr (tree *expr_p, tree *pre_p, tree *post_p)
3969 tree expr = *expr_p;
3970 int noutputs = list_length (ASM_OUTPUTS (expr));
3971 const char **oconstraints
3972 = (const char **) alloca ((noutputs) * sizeof (const char *));
3975 const char *constraint;
3976 bool allows_mem, allows_reg, is_inout;
3977 enum gimplify_status ret, tret;
3980 for (i = 0, link = ASM_OUTPUTS (expr); link; ++i, link = TREE_CHAIN (link))
3982 size_t constraint_len;
3983 oconstraints[i] = constraint
3984 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
3985 constraint_len = strlen (constraint);
3986 if (constraint_len == 0)
3989 parse_output_constraint (&constraint, i, 0, 0,
3990 &allows_mem, &allows_reg, &is_inout);
3992 if (!allows_reg && allows_mem)
3993 lang_hooks.mark_addressable (TREE_VALUE (link));
3995 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
3996 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
3997 fb_lvalue | fb_mayfail);
3998 if (tret == GS_ERROR)
4000 error ("invalid lvalue in asm output %d", i);
4006 /* An input/output operand. To give the optimizers more
4007 flexibility, split it into separate input and output
4012 /* Turn the in/out constraint into an output constraint. */
4013 char *p = xstrdup (constraint);
4015 TREE_VALUE (TREE_PURPOSE (link)) = build_string (constraint_len, p);
4017 /* And add a matching input constraint. */
4020 sprintf (buf, "%d", i);
4022 /* If there are multiple alternatives in the constraint,
4023 handle each of them individually. Those that allow register
4024 will be replaced with operand number, the others will stay
4026 if (strchr (p, ',') != NULL)
4028 size_t len = 0, buflen = strlen (buf);
4029 char *beg, *end, *str, *dst;
4033 end = strchr (beg, ',');
4035 end = strchr (beg, '\0');
4036 if ((size_t) (end - beg) < buflen)
4039 len += end - beg + 1;
4046 str = (char *) alloca (len);
4047 for (beg = p + 1, dst = str;;)
4050 bool mem_p, reg_p, inout_p;
4052 end = strchr (beg, ',');
4057 parse_output_constraint (&tem, i, 0, 0,
4058 &mem_p, ®_p, &inout_p);
4063 memcpy (dst, buf, buflen);
4072 memcpy (dst, beg, len);
4081 input = build_string (dst - str, str);
4084 input = build_string (strlen (buf), buf);
4087 input = build_string (constraint_len - 1, constraint + 1);
4091 input = build_tree_list (build_tree_list (NULL_TREE, input),
4092 unshare_expr (TREE_VALUE (link)));
4093 ASM_INPUTS (expr) = chainon (ASM_INPUTS (expr), input);
4097 for (link = ASM_INPUTS (expr); link; ++i, link = TREE_CHAIN (link))
4100 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4101 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
4102 oconstraints, &allows_mem, &allows_reg);
4104 /* If the operand is a memory input, it should be an lvalue. */
4105 if (!allows_reg && allows_mem)
4107 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4108 is_gimple_lvalue, fb_lvalue | fb_mayfail);
4109 lang_hooks.mark_addressable (TREE_VALUE (link));
4110 if (tret == GS_ERROR)
4112 error ("memory input %d is not directly addressable", i);
4118 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4119 is_gimple_asm_val, fb_rvalue);
4120 if (tret == GS_ERROR)
4128 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
4129 WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
4130 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
4131 return to this function.
4133 FIXME should we complexify the prequeue handling instead? Or use flags
4134 for all the cleanups and let the optimizer tighten them up? The current
4135 code seems pretty fragile; it will break on a cleanup within any
4136 non-conditional nesting. But any such nesting would be broken, anyway;
4137 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
4138 and continues out of it. We can do that at the RTL level, though, so
4139 having an optimizer to tighten up try/finally regions would be a Good
4142 static enum gimplify_status
4143 gimplify_cleanup_point_expr (tree *expr_p, tree *pre_p)
4145 tree_stmt_iterator iter;
4148 tree temp = voidify_wrapper_expr (*expr_p, NULL);
4150 /* We only care about the number of conditions between the innermost
4151 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
4152 any cleanups collected outside the CLEANUP_POINT_EXPR. */
4153 int old_conds = gimplify_ctxp->conditions;
4154 tree old_cleanups = gimplify_ctxp->conditional_cleanups;
4155 gimplify_ctxp->conditions = 0;
4156 gimplify_ctxp->conditional_cleanups = NULL_TREE;
4158 body = TREE_OPERAND (*expr_p, 0);
4159 gimplify_to_stmt_list (&body);
4161 gimplify_ctxp->conditions = old_conds;
4162 gimplify_ctxp->conditional_cleanups = old_cleanups;
4164 for (iter = tsi_start (body); !tsi_end_p (iter); )
4166 tree *wce_p = tsi_stmt_ptr (iter);
4169 if (TREE_CODE (wce) == WITH_CLEANUP_EXPR)
4171 if (tsi_one_before_end_p (iter))
4173 tsi_link_before (&iter, TREE_OPERAND (wce, 0), TSI_SAME_STMT);
4180 enum tree_code code;
4182 if (CLEANUP_EH_ONLY (wce))
4183 code = TRY_CATCH_EXPR;
4185 code = TRY_FINALLY_EXPR;
4187 sl = tsi_split_statement_list_after (&iter);
4188 tfe = build2 (code, void_type_node, sl, NULL_TREE);
4189 append_to_statement_list (TREE_OPERAND (wce, 0),
4190 &TREE_OPERAND (tfe, 1));
4192 iter = tsi_start (sl);
4202 append_to_statement_list (body, pre_p);
4212 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
4213 is the cleanup action required. */
4216 gimple_push_cleanup (tree var, tree cleanup, bool eh_only, tree *pre_p)
4220 /* Errors can result in improperly nested cleanups. Which results in
4221 confusion when trying to resolve the WITH_CLEANUP_EXPR. */
4222 if (errorcount || sorrycount)
4225 if (gimple_conditional_context ())
4227 /* If we're in a conditional context, this is more complex. We only
4228 want to run the cleanup if we actually ran the initialization that
4229 necessitates it, but we want to run it after the end of the
4230 conditional context. So we wrap the try/finally around the
4231 condition and use a flag to determine whether or not to actually
4232 run the destructor. Thus
4236 becomes (approximately)
4240 if (test) { A::A(temp); flag = 1; val = f(temp); }
4243 if (flag) A::~A(temp);
4248 tree flag = create_tmp_var (boolean_type_node, "cleanup");
4249 tree ffalse = build_gimple_modify_stmt (flag, boolean_false_node);
4250 tree ftrue = build_gimple_modify_stmt (flag, boolean_true_node);
4251 cleanup = build3 (COND_EXPR, void_type_node, flag, cleanup, NULL);
4252 wce = build1 (WITH_CLEANUP_EXPR, void_type_node, cleanup);
4253 append_to_statement_list (ffalse, &gimplify_ctxp->conditional_cleanups);
4254 append_to_statement_list (wce, &gimplify_ctxp->conditional_cleanups);
4255 append_to_statement_list (ftrue, pre_p);
4257 /* Because of this manipulation, and the EH edges that jump
4258 threading cannot redirect, the temporary (VAR) will appear
4259 to be used uninitialized. Don't warn. */
4260 TREE_NO_WARNING (var) = 1;
4264 wce = build1 (WITH_CLEANUP_EXPR, void_type_node, cleanup);
4265 CLEANUP_EH_ONLY (wce) = eh_only;
4266 append_to_statement_list (wce, pre_p);
4269 gimplify_stmt (&TREE_OPERAND (wce, 0));
4272 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
4274 static enum gimplify_status
4275 gimplify_target_expr (tree *expr_p, tree *pre_p, tree *post_p)
4277 tree targ = *expr_p;
4278 tree temp = TARGET_EXPR_SLOT (targ);
4279 tree init = TARGET_EXPR_INITIAL (targ);
4280 enum gimplify_status ret;
4284 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
4285 to the temps list. */
4286 gimple_add_tmp_var (temp);
4288 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
4289 expression is supposed to initialize the slot. */
4290 if (VOID_TYPE_P (TREE_TYPE (init)))
4291 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
4294 init = build2 (INIT_EXPR, void_type_node, temp, init);
4295 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt,
4298 if (ret == GS_ERROR)
4300 /* PR c++/28266 Make sure this is expanded only once. */
4301 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
4304 append_to_statement_list (init, pre_p);
4306 /* If needed, push the cleanup for the temp. */
4307 if (TARGET_EXPR_CLEANUP (targ))
4309 gimplify_stmt (&TARGET_EXPR_CLEANUP (targ));
4310 gimple_push_cleanup (temp, TARGET_EXPR_CLEANUP (targ),
4311 CLEANUP_EH_ONLY (targ), pre_p);
4314 /* Only expand this once. */
4315 TREE_OPERAND (targ, 3) = init;
4316 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
4319 /* We should have expanded this before. */
4320 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp));
4326 /* Gimplification of expression trees. */
4328 /* Gimplify an expression which appears at statement context; usually, this
4329 means replacing it with a suitably gimple STATEMENT_LIST. */
4332 gimplify_stmt (tree *stmt_p)
4334 gimplify_expr (stmt_p, NULL, NULL, is_gimple_stmt, fb_none);
4337 /* Similarly, but force the result to be a STATEMENT_LIST. */
4340 gimplify_to_stmt_list (tree *stmt_p)
4342 gimplify_stmt (stmt_p);
4344 *stmt_p = alloc_stmt_list ();
4345 else if (TREE_CODE (*stmt_p) != STATEMENT_LIST)
4348 *stmt_p = alloc_stmt_list ();
4349 append_to_statement_list (t, stmt_p);
4354 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
4355 to CTX. If entries already exist, force them to be some flavor of private.
4356 If there is no enclosing parallel, do nothing. */
4359 omp_firstprivatize_variable (struct gimplify_omp_ctx *ctx, tree decl)
4363 if (decl == NULL || !DECL_P (decl))
4368 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4371 if (n->value & GOVD_SHARED)
4372 n->value = GOVD_FIRSTPRIVATE | (n->value & GOVD_SEEN);
4376 else if (ctx->is_parallel)
4377 omp_add_variable (ctx, decl, GOVD_FIRSTPRIVATE);
4379 ctx = ctx->outer_context;
4384 /* Similarly for each of the type sizes of TYPE. */
4387 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx *ctx, tree type)
4389 if (type == NULL || type == error_mark_node)
4391 type = TYPE_MAIN_VARIANT (type);
4393 if (pointer_set_insert (ctx->privatized_types, type))
4396 switch (TREE_CODE (type))
4402 omp_firstprivatize_variable (ctx, TYPE_MIN_VALUE (type));
4403 omp_firstprivatize_variable (ctx, TYPE_MAX_VALUE (type));
4407 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
4408 omp_firstprivatize_type_sizes (ctx, TYPE_DOMAIN (type));
4413 case QUAL_UNION_TYPE:
4416 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
4417 if (TREE_CODE (field) == FIELD_DECL)
4419 omp_firstprivatize_variable (ctx, DECL_FIELD_OFFSET (field));
4420 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (field));
4426 case REFERENCE_TYPE:
4427 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
4434 omp_firstprivatize_variable (ctx, TYPE_SIZE (type));
4435 omp_firstprivatize_variable (ctx, TYPE_SIZE_UNIT (type));
4436 lang_hooks.types.omp_firstprivatize_type_sizes (ctx, type);
4439 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
4442 omp_add_variable (struct gimplify_omp_ctx *ctx, tree decl, unsigned int flags)
4445 unsigned int nflags;
4448 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
4451 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
4452 there are constructors involved somewhere. */
4453 if (TREE_ADDRESSABLE (TREE_TYPE (decl))
4454 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
4457 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4460 /* We shouldn't be re-adding the decl with the same data
4462 gcc_assert ((n->value & GOVD_DATA_SHARE_CLASS & flags) == 0);
4463 /* The only combination of data sharing classes we should see is
4464 FIRSTPRIVATE and LASTPRIVATE. */
4465 nflags = n->value | flags;
4466 gcc_assert ((nflags & GOVD_DATA_SHARE_CLASS)
4467 == (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE));
4472 /* When adding a variable-sized variable, we have to handle all sorts
4473 of additional bits of data: the pointer replacement variable, and
4474 the parameters of the type. */
4475 if (DECL_SIZE (decl) && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
4477 /* Add the pointer replacement variable as PRIVATE if the variable
4478 replacement is private, else FIRSTPRIVATE since we'll need the
4479 address of the original variable either for SHARED, or for the
4480 copy into or out of the context. */
4481 if (!(flags & GOVD_LOCAL))
4483 nflags = flags & GOVD_PRIVATE ? GOVD_PRIVATE : GOVD_FIRSTPRIVATE;
4484 nflags |= flags & GOVD_SEEN;
4485 t = DECL_VALUE_EXPR (decl);
4486 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
4487 t = TREE_OPERAND (t, 0);
4488 gcc_assert (DECL_P (t));
4489 omp_add_variable (ctx, t, nflags);
4492 /* Add all of the variable and type parameters (which should have
4493 been gimplified to a formal temporary) as FIRSTPRIVATE. */
4494 omp_firstprivatize_variable (ctx, DECL_SIZE_UNIT (decl));
4495 omp_firstprivatize_variable (ctx, DECL_SIZE (decl));
4496 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
4498 /* The variable-sized variable itself is never SHARED, only some form
4499 of PRIVATE. The sharing would take place via the pointer variable
4500 which we remapped above. */
4501 if (flags & GOVD_SHARED)
4502 flags = GOVD_PRIVATE | GOVD_DEBUG_PRIVATE
4503 | (flags & (GOVD_SEEN | GOVD_EXPLICIT));
4505 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
4506 alloca statement we generate for the variable, so make sure it
4507 is available. This isn't automatically needed for the SHARED
4508 case, since we won't be allocating local storage then.
4509 For local variables TYPE_SIZE_UNIT might not be gimplified yet,
4510 in this case omp_notice_variable will be called later
4511 on when it is gimplified. */
4512 else if (! (flags & GOVD_LOCAL))
4513 omp_notice_variable (ctx, TYPE_SIZE_UNIT (TREE_TYPE (decl)), true);
4515 else if (lang_hooks.decls.omp_privatize_by_reference (decl))
4517 gcc_assert ((flags & GOVD_LOCAL) == 0);
4518 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
4520 /* Similar to the direct variable sized case above, we'll need the
4521 size of references being privatized. */
4522 if ((flags & GOVD_SHARED) == 0)
4524 t = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl)));
4525 if (TREE_CODE (t) != INTEGER_CST)
4526 omp_notice_variable (ctx, t, true);
4530 splay_tree_insert (ctx->variables, (splay_tree_key)decl, flags);
4533 /* Record the fact that DECL was used within the OpenMP context CTX.
4534 IN_CODE is true when real code uses DECL, and false when we should
4535 merely emit default(none) errors. Return true if DECL is going to
4536 be remapped and thus DECL shouldn't be gimplified into its
4537 DECL_VALUE_EXPR (if any). */
4540 omp_notice_variable (struct gimplify_omp_ctx *ctx, tree decl, bool in_code)
4543 unsigned flags = in_code ? GOVD_SEEN : 0;
4544 bool ret = false, shared;
4546 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
4549 /* Threadprivate variables are predetermined. */
4550 if (is_global_var (decl))
4552 if (DECL_THREAD_LOCAL_P (decl))
4555 if (DECL_HAS_VALUE_EXPR_P (decl))
4557 tree value = get_base_address (DECL_VALUE_EXPR (decl));
4559 if (value && DECL_P (value) && DECL_THREAD_LOCAL_P (value))
4564 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4567 enum omp_clause_default_kind default_kind, kind;
4569 if (!ctx->is_parallel)
4572 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
4573 remapped firstprivate instead of shared. To some extent this is
4574 addressed in omp_firstprivatize_type_sizes, but not effectively. */
4575 default_kind = ctx->default_kind;
4576 kind = lang_hooks.decls.omp_predetermined_sharing (decl);
4577 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
4578 default_kind = kind;
4580 switch (default_kind)
4582 case OMP_CLAUSE_DEFAULT_NONE:
4583 error ("%qs not specified in enclosing parallel",
4584 IDENTIFIER_POINTER (DECL_NAME (decl)));
4585 error ("%Henclosing parallel", &ctx->location);
4587 case OMP_CLAUSE_DEFAULT_SHARED:
4588 flags |= GOVD_SHARED;
4590 case OMP_CLAUSE_DEFAULT_PRIVATE:
4591 flags |= GOVD_PRIVATE;
4597 omp_add_variable (ctx, decl, flags);
4599 shared = (flags & GOVD_SHARED) != 0;
4600 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
4604 shared = ((flags | n->value) & GOVD_SHARED) != 0;
4605 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
4607 /* If nothing changed, there's nothing left to do. */
4608 if ((n->value & flags) == flags)
4614 /* If the variable is private in the current context, then we don't
4615 need to propagate anything to an outer context. */
4616 if (flags & GOVD_PRIVATE)
4618 if (ctx->outer_context
4619 && omp_notice_variable (ctx->outer_context, decl, in_code))
4624 /* Verify that DECL is private within CTX. If there's specific information
4625 to the contrary in the innermost scope, generate an error. */
4628 omp_is_private (struct gimplify_omp_ctx *ctx, tree decl)
4632 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4635 if (n->value & GOVD_SHARED)
4637 if (ctx == gimplify_omp_ctxp)
4639 error ("iteration variable %qs should be private",
4640 IDENTIFIER_POINTER (DECL_NAME (decl)));
4641 n->value = GOVD_PRIVATE;
4647 else if ((n->value & GOVD_EXPLICIT) != 0
4648 && (ctx == gimplify_omp_ctxp
4649 || (ctx->is_combined_parallel
4650 && gimplify_omp_ctxp->outer_context == ctx)))
4652 if ((n->value & GOVD_FIRSTPRIVATE) != 0)
4653 error ("iteration variable %qs should not be firstprivate",
4654 IDENTIFIER_POINTER (DECL_NAME (decl)));
4655 else if ((n->value & GOVD_REDUCTION) != 0)
4656 error ("iteration variable %qs should not be reduction",
4657 IDENTIFIER_POINTER (DECL_NAME (decl)));
4662 if (ctx->is_parallel)
4664 else if (ctx->outer_context)
4665 return omp_is_private (ctx->outer_context, decl);
4667 return !is_global_var (decl);
4670 /* Return true if DECL is private within a parallel region
4671 that binds to the current construct's context or in parallel
4672 region's REDUCTION clause. */
4675 omp_check_private (struct gimplify_omp_ctx *ctx, tree decl)
4681 ctx = ctx->outer_context;
4683 return !(is_global_var (decl)
4684 /* References might be private, but might be shared too. */
4685 || lang_hooks.decls.omp_privatize_by_reference (decl));
4687 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
4689 return (n->value & GOVD_SHARED) == 0;
4691 while (!ctx->is_parallel);
4695 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
4696 and previous omp contexts. */
4699 gimplify_scan_omp_clauses (tree *list_p, tree *pre_p, bool in_parallel,
4700 bool in_combined_parallel)
4702 struct gimplify_omp_ctx *ctx, *outer_ctx;
4705 ctx = new_omp_context (in_parallel, in_combined_parallel);
4706 outer_ctx = ctx->outer_context;
4708 while ((c = *list_p) != NULL)
4710 enum gimplify_status gs;
4711 bool remove = false;
4712 bool notice_outer = true;
4713 const char *check_non_private = NULL;
4717 switch (OMP_CLAUSE_CODE (c))
4719 case OMP_CLAUSE_PRIVATE:
4720 flags = GOVD_PRIVATE | GOVD_EXPLICIT;
4721 notice_outer = false;
4723 case OMP_CLAUSE_SHARED:
4724 flags = GOVD_SHARED | GOVD_EXPLICIT;
4726 case OMP_CLAUSE_FIRSTPRIVATE:
4727 flags = GOVD_FIRSTPRIVATE | GOVD_EXPLICIT;
4728 check_non_private = "firstprivate";
4730 case OMP_CLAUSE_LASTPRIVATE:
4731 flags = GOVD_LASTPRIVATE | GOVD_SEEN | GOVD_EXPLICIT;
4732 check_non_private = "lastprivate";
4734 case OMP_CLAUSE_REDUCTION:
4735 flags = GOVD_REDUCTION | GOVD_SEEN | GOVD_EXPLICIT;
4736 check_non_private = "reduction";
4740 decl = OMP_CLAUSE_DECL (c);
4741 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
4746 omp_add_variable (ctx, decl, flags);
4747 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION
4748 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c))
4750 omp_add_variable (ctx, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c),
4751 GOVD_LOCAL | GOVD_SEEN);
4752 gimplify_omp_ctxp = ctx;
4753 push_gimplify_context ();
4754 gimplify_stmt (&OMP_CLAUSE_REDUCTION_INIT (c));
4755 pop_gimplify_context (OMP_CLAUSE_REDUCTION_INIT (c));
4756 push_gimplify_context ();
4757 gimplify_stmt (&OMP_CLAUSE_REDUCTION_MERGE (c));
4758 pop_gimplify_context (OMP_CLAUSE_REDUCTION_MERGE (c));
4759 gimplify_omp_ctxp = outer_ctx;
4765 case OMP_CLAUSE_COPYIN:
4766 case OMP_CLAUSE_COPYPRIVATE:
4767 decl = OMP_CLAUSE_DECL (c);
4768 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
4775 omp_notice_variable (outer_ctx, decl, true);
4776 if (check_non_private
4778 && omp_check_private (ctx, decl))
4780 error ("%s variable %qs is private in outer context",
4781 check_non_private, IDENTIFIER_POINTER (DECL_NAME (decl)));
4787 OMP_CLAUSE_OPERAND (c, 0)
4788 = gimple_boolify (OMP_CLAUSE_OPERAND (c, 0));
4791 case OMP_CLAUSE_SCHEDULE:
4792 case OMP_CLAUSE_NUM_THREADS:
4793 gs = gimplify_expr (&OMP_CLAUSE_OPERAND (c, 0), pre_p, NULL,
4794 is_gimple_val, fb_rvalue);
4799 case OMP_CLAUSE_NOWAIT:
4800 case OMP_CLAUSE_ORDERED:
4803 case OMP_CLAUSE_DEFAULT:
4804 ctx->default_kind = OMP_CLAUSE_DEFAULT_KIND (c);
4812 *list_p = OMP_CLAUSE_CHAIN (c);
4814 list_p = &OMP_CLAUSE_CHAIN (c);
4817 gimplify_omp_ctxp = ctx;
4820 /* For all variables that were not actually used within the context,
4821 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
4824 gimplify_adjust_omp_clauses_1 (splay_tree_node n, void *data)
4826 tree *list_p = (tree *) data;
4827 tree decl = (tree) n->key;
4828 unsigned flags = n->value;
4829 enum omp_clause_code code;
4833 if (flags & (GOVD_EXPLICIT | GOVD_LOCAL))
4835 if ((flags & GOVD_SEEN) == 0)
4837 if (flags & GOVD_DEBUG_PRIVATE)
4839 gcc_assert ((flags & GOVD_DATA_SHARE_CLASS) == GOVD_PRIVATE);
4840 private_debug = true;
4844 = lang_hooks.decls.omp_private_debug_clause (decl,
4845 !!(flags & GOVD_SHARED));
4847 code = OMP_CLAUSE_PRIVATE;
4848 else if (flags & GOVD_SHARED)
4850 if (is_global_var (decl))
4852 code = OMP_CLAUSE_SHARED;
4854 else if (flags & GOVD_PRIVATE)
4855 code = OMP_CLAUSE_PRIVATE;
4856 else if (flags & GOVD_FIRSTPRIVATE)
4857 code = OMP_CLAUSE_FIRSTPRIVATE;
4861 clause = build_omp_clause (code);
4862 OMP_CLAUSE_DECL (clause) = decl;
4863 OMP_CLAUSE_CHAIN (clause) = *list_p;
4865 OMP_CLAUSE_PRIVATE_DEBUG (clause) = 1;
4872 gimplify_adjust_omp_clauses (tree *list_p)
4874 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
4877 while ((c = *list_p) != NULL)
4880 bool remove = false;
4882 switch (OMP_CLAUSE_CODE (c))
4884 case OMP_CLAUSE_PRIVATE:
4885 case OMP_CLAUSE_SHARED:
4886 case OMP_CLAUSE_FIRSTPRIVATE:
4887 decl = OMP_CLAUSE_DECL (c);
4888 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
4889 remove = !(n->value & GOVD_SEEN);
4892 bool shared = OMP_CLAUSE_CODE (c) == OMP_CLAUSE_SHARED;
4893 if ((n->value & GOVD_DEBUG_PRIVATE)
4894 || lang_hooks.decls.omp_private_debug_clause (decl, shared))
4896 gcc_assert ((n->value & GOVD_DEBUG_PRIVATE) == 0
4897 || ((n->value & GOVD_DATA_SHARE_CLASS)
4899 OMP_CLAUSE_SET_CODE (c, OMP_CLAUSE_PRIVATE);
4900 OMP_CLAUSE_PRIVATE_DEBUG (c) = 1;
4905 case OMP_CLAUSE_LASTPRIVATE:
4906 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
4907 accurately reflect the presence of a FIRSTPRIVATE clause. */
4908 decl = OMP_CLAUSE_DECL (c);
4909 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
4910 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)
4911 = (n->value & GOVD_FIRSTPRIVATE) != 0;
4914 case OMP_CLAUSE_REDUCTION:
4915 case OMP_CLAUSE_COPYIN:
4916 case OMP_CLAUSE_COPYPRIVATE:
4918 case OMP_CLAUSE_NUM_THREADS:
4919 case OMP_CLAUSE_SCHEDULE:
4920 case OMP_CLAUSE_NOWAIT:
4921 case OMP_CLAUSE_ORDERED:
4922 case OMP_CLAUSE_DEFAULT:
4930 *list_p = OMP_CLAUSE_CHAIN (c);
4932 list_p = &OMP_CLAUSE_CHAIN (c);
4935 /* Add in any implicit data sharing. */
4936 splay_tree_foreach (ctx->variables, gimplify_adjust_omp_clauses_1, list_p);
4938 gimplify_omp_ctxp = ctx->outer_context;
4939 delete_omp_context (ctx);
4942 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
4943 gimplification of the body, as well as scanning the body for used
4944 variables. We need to do this scan now, because variable-sized
4945 decls will be decomposed during gimplification. */
4947 static enum gimplify_status
4948 gimplify_omp_parallel (tree *expr_p, tree *pre_p)
4950 tree expr = *expr_p;
4952 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr), pre_p, true,
4953 OMP_PARALLEL_COMBINED (expr));
4955 push_gimplify_context ();
4957 gimplify_stmt (&OMP_PARALLEL_BODY (expr));
4959 if (TREE_CODE (OMP_PARALLEL_BODY (expr)) == BIND_EXPR)
4960 pop_gimplify_context (OMP_PARALLEL_BODY (expr));
4962 pop_gimplify_context (NULL_TREE);
4964 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr));
4969 /* Gimplify the gross structure of an OMP_FOR statement. */
4971 static enum gimplify_status
4972 gimplify_omp_for (tree *expr_p, tree *pre_p)
4974 tree for_stmt, decl, t;
4975 enum gimplify_status ret = GS_OK;
4979 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt), pre_p, false, false);
4981 t = OMP_FOR_INIT (for_stmt);
4982 gcc_assert (TREE_CODE (t) == MODIFY_EXPR
4983 || TREE_CODE (t) == GIMPLE_MODIFY_STMT);
4984 decl = GENERIC_TREE_OPERAND (t, 0);
4985 gcc_assert (DECL_P (decl));
4986 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl)));
4988 /* Make sure the iteration variable is private. */
4989 if (omp_is_private (gimplify_omp_ctxp, decl))
4990 omp_notice_variable (gimplify_omp_ctxp, decl, true);
4992 omp_add_variable (gimplify_omp_ctxp, decl, GOVD_PRIVATE | GOVD_SEEN);
4994 ret |= gimplify_expr (&GENERIC_TREE_OPERAND (t, 1),
4995 &OMP_FOR_PRE_BODY (for_stmt),
4996 NULL, is_gimple_val, fb_rvalue);
4998 tree_to_gimple_tuple (&OMP_FOR_INIT (for_stmt));
5000 t = OMP_FOR_COND (for_stmt);
5001 gcc_assert (COMPARISON_CLASS_P (t));
5002 gcc_assert (GENERIC_TREE_OPERAND (t, 0) == decl);
5004 ret |= gimplify_expr (&GENERIC_TREE_OPERAND (t, 1),
5005 &OMP_FOR_PRE_BODY (for_stmt),
5006 NULL, is_gimple_val, fb_rvalue);
5008 tree_to_gimple_tuple (&OMP_FOR_INCR (for_stmt));
5009 t = OMP_FOR_INCR (for_stmt);
5010 switch (TREE_CODE (t))
5012 case PREINCREMENT_EXPR:
5013 case POSTINCREMENT_EXPR:
5014 t = build_int_cst (TREE_TYPE (decl), 1);
5015 t = build2 (PLUS_EXPR, TREE_TYPE (decl), decl, t);
5016 t = build_gimple_modify_stmt (decl, t);
5017 OMP_FOR_INCR (for_stmt) = t;
5020 case PREDECREMENT_EXPR:
5021 case POSTDECREMENT_EXPR:
5022 t = build_int_cst (TREE_TYPE (decl), -1);
5023 t = build2 (PLUS_EXPR, TREE_TYPE (decl), decl, t);
5024 t = build_gimple_modify_stmt (decl, t);
5025 OMP_FOR_INCR (for_stmt) = t;
5028 case GIMPLE_MODIFY_STMT:
5029 gcc_assert (GIMPLE_STMT_OPERAND (t, 0) == decl);
5030 t = GIMPLE_STMT_OPERAND (t, 1);
5031 switch (TREE_CODE (t))
5034 if (TREE_OPERAND (t, 1) == decl)
5036 TREE_OPERAND (t, 1) = TREE_OPERAND (t, 0);
5037 TREE_OPERAND (t, 0) = decl;
5041 gcc_assert (TREE_OPERAND (t, 0) == decl);
5047 ret |= gimplify_expr (&TREE_OPERAND (t, 1), &OMP_FOR_PRE_BODY (for_stmt),
5048 NULL, is_gimple_val, fb_rvalue);
5055 gimplify_to_stmt_list (&OMP_FOR_BODY (for_stmt));
5056 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt));
5058 return ret == GS_ALL_DONE ? GS_ALL_DONE : GS_ERROR;
5061 /* Gimplify the gross structure of other OpenMP worksharing constructs.
5062 In particular, OMP_SECTIONS and OMP_SINGLE. */
5064 static enum gimplify_status
5065 gimplify_omp_workshare (tree *expr_p, tree *pre_p)
5067 tree stmt = *expr_p;
5069 gimplify_scan_omp_clauses (&OMP_CLAUSES (stmt), pre_p, false, false);
5070 gimplify_to_stmt_list (&OMP_BODY (stmt));
5071 gimplify_adjust_omp_clauses (&OMP_CLAUSES (stmt));
5076 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
5077 stabilized the lhs of the atomic operation as *ADDR. Return true if
5078 EXPR is this stabilized form. */
5081 goa_lhs_expr_p (tree expr, tree addr)
5083 /* Also include casts to other type variants. The C front end is fond
5084 of adding these for e.g. volatile variables. This is like
5085 STRIP_TYPE_NOPS but includes the main variant lookup. */
5086 while ((TREE_CODE (expr) == NOP_EXPR
5087 || TREE_CODE (expr) == CONVERT_EXPR
5088 || TREE_CODE (expr) == NON_LVALUE_EXPR)
5089 && TREE_OPERAND (expr, 0) != error_mark_node
5090 && (TYPE_MAIN_VARIANT (TREE_TYPE (expr))
5091 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (expr, 0)))))
5092 expr = TREE_OPERAND (expr, 0);
5094 if (TREE_CODE (expr) == INDIRECT_REF && TREE_OPERAND (expr, 0) == addr)
5096 if (TREE_CODE (addr) == ADDR_EXPR && expr == TREE_OPERAND (addr, 0))
5101 /* A subroutine of gimplify_omp_atomic. Attempt to implement the atomic
5102 operation as a __sync_fetch_and_op builtin. INDEX is log2 of the
5103 size of the data type, and thus usable to find the index of the builtin
5104 decl. Returns GS_UNHANDLED if the expression is not of the proper form. */
5106 static enum gimplify_status
5107 gimplify_omp_atomic_fetch_op (tree *expr_p, tree addr, tree rhs, int index)
5109 enum built_in_function base;
5111 enum insn_code *optab;
5113 /* Check for one of the supported fetch-op operations. */
5114 switch (TREE_CODE (rhs))
5117 base = BUILT_IN_FETCH_AND_ADD_N;
5118 optab = sync_add_optab;
5121 base = BUILT_IN_FETCH_AND_SUB_N;
5122 optab = sync_add_optab;
5125 base = BUILT_IN_FETCH_AND_AND_N;
5126 optab = sync_and_optab;
5129 base = BUILT_IN_FETCH_AND_OR_N;
5130 optab = sync_ior_optab;
5133 base = BUILT_IN_FETCH_AND_XOR_N;
5134 optab = sync_xor_optab;
5137 return GS_UNHANDLED;
5140 /* Make sure the expression is of the proper form. */
5141 if (goa_lhs_expr_p (TREE_OPERAND (rhs, 0), addr))
5142 rhs = TREE_OPERAND (rhs, 1);
5143 else if (commutative_tree_code (TREE_CODE (rhs))
5144 && goa_lhs_expr_p (TREE_OPERAND (rhs, 1), addr))
5145 rhs = TREE_OPERAND (rhs, 0);
5147 return GS_UNHANDLED;
5149 decl = built_in_decls[base + index + 1];
5150 itype = TREE_TYPE (TREE_TYPE (decl));
5152 if (optab[TYPE_MODE (itype)] == CODE_FOR_nothing)
5153 return GS_UNHANDLED;
5155 *expr_p = build_call_expr (decl, 2, addr, fold_convert (itype, rhs));
5159 /* A subroutine of gimplify_omp_atomic_pipeline. Walk *EXPR_P and replace
5160 appearances of *LHS_ADDR with LHS_VAR. If an expression does not involve
5161 the lhs, evaluate it into a temporary. Return 1 if the lhs appeared as
5162 a subexpression, 0 if it did not, or -1 if an error was encountered. */
5165 goa_stabilize_expr (tree *expr_p, tree *pre_p, tree lhs_addr, tree lhs_var)
5167 tree expr = *expr_p;
5170 if (goa_lhs_expr_p (expr, lhs_addr))
5175 if (is_gimple_val (expr))
5179 switch (TREE_CODE_CLASS (TREE_CODE (expr)))
5182 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p,
5185 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p,
5194 enum gimplify_status gs;
5195 gs = gimplify_expr (expr_p, pre_p, NULL, is_gimple_val, fb_rvalue);
5196 if (gs != GS_ALL_DONE)
5203 /* A subroutine of gimplify_omp_atomic. Implement the atomic operation as:
5207 newval = rhs; // with oldval replacing *addr in rhs
5208 oldval = __sync_val_compare_and_swap (addr, oldval, newval);
5209 if (oldval != newval)
5212 INDEX is log2 of the size of the data type, and thus usable to find the
5213 index of the builtin decl. */
5215 static enum gimplify_status
5216 gimplify_omp_atomic_pipeline (tree *expr_p, tree *pre_p, tree addr,
5217 tree rhs, int index)
5219 tree oldval, oldival, oldival2, newval, newival, label;
5220 tree type, itype, cmpxchg, x, iaddr;
5222 cmpxchg = built_in_decls[BUILT_IN_VAL_COMPARE_AND_SWAP_N + index + 1];
5223 type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr)));
5224 itype = TREE_TYPE (TREE_TYPE (cmpxchg));
5226 if (sync_compare_and_swap[TYPE_MODE (itype)] == CODE_FOR_nothing)
5227 return GS_UNHANDLED;
5229 oldval = create_tmp_var (type, NULL);
5230 newval = create_tmp_var (type, NULL);
5232 /* Precompute as much of RHS as possible. In the same walk, replace
5233 occurrences of the lhs value with our temporary. */
5234 if (goa_stabilize_expr (&rhs, pre_p, addr, oldval) < 0)
5237 x = build_fold_indirect_ref (addr);
5238 x = build_gimple_modify_stmt (oldval, x);
5239 gimplify_and_add (x, pre_p);
5241 /* For floating-point values, we'll need to view-convert them to integers
5242 so that we can perform the atomic compare and swap. Simplify the
5243 following code by always setting up the "i"ntegral variables. */
5244 if (INTEGRAL_TYPE_P (type) || POINTER_TYPE_P (type))
5252 oldival = create_tmp_var (itype, NULL);
5253 newival = create_tmp_var (itype, NULL);
5255 x = build1 (VIEW_CONVERT_EXPR, itype, oldval);
5256 x = build_gimple_modify_stmt (oldival, x);
5257 gimplify_and_add (x, pre_p);
5258 iaddr = fold_convert (build_pointer_type (itype), addr);
5261 oldival2 = create_tmp_var (itype, NULL);
5263 label = create_artificial_label ();
5264 x = build1 (LABEL_EXPR, void_type_node, label);
5265 gimplify_and_add (x, pre_p);
5267 x = build_gimple_modify_stmt (newval, rhs);
5268 gimplify_and_add (x, pre_p);
5270 if (newval != newival)
5272 x = build1 (VIEW_CONVERT_EXPR, itype, newval);
5273 x = build_gimple_modify_stmt (newival, x);
5274 gimplify_and_add (x, pre_p);
5277 x = build_gimple_modify_stmt (oldival2, fold_convert (itype, oldival));
5278 gimplify_and_add (x, pre_p);
5280 x = build_call_expr (cmpxchg, 3, iaddr, fold_convert (itype, oldival),
5281 fold_convert (itype, newival));
5282 if (oldval == oldival)
5283 x = fold_convert (type, x);
5284 x = build_gimple_modify_stmt (oldival, x);
5285 gimplify_and_add (x, pre_p);
5287 /* For floating point, be prepared for the loop backedge. */
5288 if (oldval != oldival)
5290 x = build1 (VIEW_CONVERT_EXPR, type, oldival);
5291 x = build_gimple_modify_stmt (oldval, x);
5292 gimplify_and_add (x, pre_p);
5295 /* Note that we always perform the comparison as an integer, even for
5296 floating point. This allows the atomic operation to properly
5297 succeed even with NaNs and -0.0. */
5298 x = build3 (COND_EXPR, void_type_node,
5299 build2 (NE_EXPR, boolean_type_node, oldival, oldival2),
5300 build1 (GOTO_EXPR, void_type_node, label), NULL);
5301 gimplify_and_add (x, pre_p);
5307 /* A subroutine of gimplify_omp_atomic. Implement the atomic operation as:
5309 GOMP_atomic_start ();
5313 The result is not globally atomic, but works so long as all parallel
5314 references are within #pragma omp atomic directives. According to
5315 responses received from omp@openmp.org, appears to be within spec.
5316 Which makes sense, since that's how several other compilers handle
5317 this situation as well. */
5319 static enum gimplify_status
5320 gimplify_omp_atomic_mutex (tree *expr_p, tree *pre_p, tree addr, tree rhs)
5324 t = built_in_decls[BUILT_IN_GOMP_ATOMIC_START];
5325 t = build_call_expr (t, 0);
5326 gimplify_and_add (t, pre_p);
5328 t = build_fold_indirect_ref (addr);
5329 t = build_gimple_modify_stmt (t, rhs);
5330 gimplify_and_add (t, pre_p);
5332 t = built_in_decls[BUILT_IN_GOMP_ATOMIC_END];
5333 t = build_call_expr (t, 0);
5334 gimplify_and_add (t, pre_p);
5340 /* Gimplify an OMP_ATOMIC statement. */
5342 static enum gimplify_status
5343 gimplify_omp_atomic (tree *expr_p, tree *pre_p)
5345 tree addr = TREE_OPERAND (*expr_p, 0);
5346 tree rhs = TREE_OPERAND (*expr_p, 1);
5347 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr)));
5348 HOST_WIDE_INT index;
5350 /* Make sure the type is one of the supported sizes. */
5351 index = tree_low_cst (TYPE_SIZE_UNIT (type), 1);
5352 index = exact_log2 (index);
5353 if (index >= 0 && index <= 4)
5355 enum gimplify_status gs;
5358 if (DECL_P (TREE_OPERAND (addr, 0)))
5359 align = DECL_ALIGN_UNIT (TREE_OPERAND (addr, 0));
5360 else if (TREE_CODE (TREE_OPERAND (addr, 0)) == COMPONENT_REF
5361 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (addr, 0), 1))
5363 align = DECL_ALIGN_UNIT (TREE_OPERAND (TREE_OPERAND (addr, 0), 1));
5365 align = TYPE_ALIGN_UNIT (type);
5367 /* __sync builtins require strict data alignment. */
5368 if (exact_log2 (align) >= index)
5370 /* When possible, use specialized atomic update functions. */
5371 if (INTEGRAL_TYPE_P (type) || POINTER_TYPE_P (type))
5373 gs = gimplify_omp_atomic_fetch_op (expr_p, addr, rhs, index);
5374 if (gs != GS_UNHANDLED)
5378 /* If we don't have specialized __sync builtins, try and implement
5379 as a compare and swap loop. */
5380 gs = gimplify_omp_atomic_pipeline (expr_p, pre_p, addr, rhs, index);
5381 if (gs != GS_UNHANDLED)
5386 /* The ultimate fallback is wrapping the operation in a mutex. */
5387 return gimplify_omp_atomic_mutex (expr_p, pre_p, addr, rhs);
5390 /* Gimplifies the expression tree pointed to by EXPR_P. Return 0 if
5391 gimplification failed.
5393 PRE_P points to the list where side effects that must happen before
5394 EXPR should be stored.
5396 POST_P points to the list where side effects that must happen after
5397 EXPR should be stored, or NULL if there is no suitable list. In
5398 that case, we copy the result to a temporary, emit the
5399 post-effects, and then return the temporary.
5401 GIMPLE_TEST_F points to a function that takes a tree T and
5402 returns nonzero if T is in the GIMPLE form requested by the
5403 caller. The GIMPLE predicates are in tree-gimple.c.
5405 This test is used twice. Before gimplification, the test is
5406 invoked to determine whether *EXPR_P is already gimple enough. If
5407 that fails, *EXPR_P is gimplified according to its code and
5408 GIMPLE_TEST_F is called again. If the test still fails, then a new
5409 temporary variable is created and assigned the value of the
5410 gimplified expression.
5412 FALLBACK tells the function what sort of a temporary we want. If the 1
5413 bit is set, an rvalue is OK. If the 2 bit is set, an lvalue is OK.
5414 If both are set, either is OK, but an lvalue is preferable.
5416 The return value is either GS_ERROR or GS_ALL_DONE, since this function
5417 iterates until solution. */
5419 enum gimplify_status
5420 gimplify_expr (tree *expr_p, tree *pre_p, tree *post_p,
5421 bool (* gimple_test_f) (tree), fallback_t fallback)
5424 tree internal_pre = NULL_TREE;
5425 tree internal_post = NULL_TREE;
5427 int is_statement = (pre_p == NULL);
5428 location_t saved_location;
5429 enum gimplify_status ret;
5431 save_expr = *expr_p;
5432 if (save_expr == NULL_TREE)
5435 /* We used to check the predicate here and return immediately if it
5436 succeeds. This is wrong; the design is for gimplification to be
5437 idempotent, and for the predicates to only test for valid forms, not
5438 whether they are fully simplified. */
5440 /* Set up our internal queues if needed. */
5442 pre_p = &internal_pre;
5444 post_p = &internal_post;
5446 saved_location = input_location;
5447 if (save_expr != error_mark_node
5448 && EXPR_HAS_LOCATION (*expr_p))
5449 input_location = EXPR_LOCATION (*expr_p);
5451 /* Loop over the specific gimplifiers until the toplevel node
5452 remains the same. */
5455 /* Strip away as many useless type conversions as possible
5457 STRIP_USELESS_TYPE_CONVERSION (*expr_p);
5459 /* Remember the expr. */
5460 save_expr = *expr_p;
5462 /* Die, die, die, my darling. */
5463 if (save_expr == error_mark_node
5464 || (!GIMPLE_STMT_P (save_expr)
5465 && TREE_TYPE (save_expr)
5466 && TREE_TYPE (save_expr) == error_mark_node))
5472 /* Do any language-specific gimplification. */
5473 ret = lang_hooks.gimplify_expr (expr_p, pre_p, post_p);
5476 if (*expr_p == NULL_TREE)
5478 if (*expr_p != save_expr)
5481 else if (ret != GS_UNHANDLED)
5485 switch (TREE_CODE (*expr_p))
5487 /* First deal with the special cases. */
5489 case POSTINCREMENT_EXPR:
5490 case POSTDECREMENT_EXPR:
5491 case PREINCREMENT_EXPR:
5492 case PREDECREMENT_EXPR:
5493 ret = gimplify_self_mod_expr (expr_p, pre_p, post_p,
5494 fallback != fb_none);
5498 case ARRAY_RANGE_REF:
5502 case VIEW_CONVERT_EXPR:
5503 ret = gimplify_compound_lval (expr_p, pre_p, post_p,
5504 fallback ? fallback : fb_rvalue);
5508 ret = gimplify_cond_expr (expr_p, pre_p, fallback);
5509 /* C99 code may assign to an array in a structure value of a
5510 conditional expression, and this has undefined behavior
5511 only on execution, so create a temporary if an lvalue is
5513 if (fallback == fb_lvalue)
5515 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
5516 lang_hooks.mark_addressable (*expr_p);
5521 ret = gimplify_call_expr (expr_p, pre_p, fallback != fb_none);
5522 /* C99 code may assign to an array in a structure returned
5523 from a function, and this has undefined behavior only on
5524 execution, so create a temporary if an lvalue is
5526 if (fallback == fb_lvalue)
5528 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
5529 lang_hooks.mark_addressable (*expr_p);
5537 ret = gimplify_compound_expr (expr_p, pre_p, fallback != fb_none);
5541 case GIMPLE_MODIFY_STMT:
5543 ret = gimplify_modify_expr (expr_p, pre_p, post_p,
5544 fallback != fb_none);
5548 /* The distinction between MODIFY_EXPR and INIT_EXPR is no longer
5550 if (TREE_CODE (*expr_p) == INIT_EXPR)
5551 TREE_SET_CODE (*expr_p, MODIFY_EXPR);
5553 /* Convert MODIFY_EXPR to GIMPLE_MODIFY_STMT. */
5554 if (TREE_CODE (*expr_p) == MODIFY_EXPR)
5555 tree_to_gimple_tuple (expr_p);
5560 case TRUTH_ANDIF_EXPR:
5561 case TRUTH_ORIF_EXPR:
5562 ret = gimplify_boolean_expr (expr_p);
5565 case TRUTH_NOT_EXPR:
5566 TREE_OPERAND (*expr_p, 0)
5567 = gimple_boolify (TREE_OPERAND (*expr_p, 0));
5568 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5569 is_gimple_val, fb_rvalue);
5570 recalculate_side_effects (*expr_p);
5574 ret = gimplify_addr_expr (expr_p, pre_p, post_p);
5578 ret = gimplify_va_arg_expr (expr_p, pre_p, post_p);
5583 if (IS_EMPTY_STMT (*expr_p))
5589 if (VOID_TYPE_P (TREE_TYPE (*expr_p))
5590 || fallback == fb_none)
5592 /* Just strip a conversion to void (or in void context) and
5594 *expr_p = TREE_OPERAND (*expr_p, 0);
5598 ret = gimplify_conversion (expr_p);
5599 if (ret == GS_ERROR)
5601 if (*expr_p != save_expr)
5605 case FIX_TRUNC_EXPR:
5606 /* unary_expr: ... | '(' cast ')' val | ... */
5607 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5608 is_gimple_val, fb_rvalue);
5609 recalculate_side_effects (*expr_p);
5613 *expr_p = fold_indirect_ref (*expr_p);
5614 if (*expr_p != save_expr)
5616 /* else fall through. */
5617 case ALIGN_INDIRECT_REF:
5618 case MISALIGNED_INDIRECT_REF:
5619 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5620 is_gimple_reg, fb_rvalue);
5621 recalculate_side_effects (*expr_p);
5624 /* Constants need not be gimplified. */
5634 /* If we require an lvalue, such as for ADDR_EXPR, retain the
5635 CONST_DECL node. Otherwise the decl is replaceable by its
5637 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
5638 if (fallback & fb_lvalue)
5641 *expr_p = DECL_INITIAL (*expr_p);
5645 ret = gimplify_decl_expr (expr_p);
5649 /* FIXME make this a decl. */
5654 ret = gimplify_bind_expr (expr_p, pre_p);
5658 ret = gimplify_loop_expr (expr_p, pre_p);
5662 ret = gimplify_switch_expr (expr_p, pre_p);
5666 ret = gimplify_exit_expr (expr_p);
5670 /* If the target is not LABEL, then it is a computed jump
5671 and the target needs to be gimplified. */
5672 if (TREE_CODE (GOTO_DESTINATION (*expr_p)) != LABEL_DECL)
5673 ret = gimplify_expr (&GOTO_DESTINATION (*expr_p), pre_p,
5674 NULL, is_gimple_val, fb_rvalue);
5679 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p))
5680 == current_function_decl);
5683 case CASE_LABEL_EXPR:
5684 ret = gimplify_case_label_expr (expr_p);
5688 ret = gimplify_return_expr (*expr_p, pre_p);
5692 /* Don't reduce this in place; let gimplify_init_constructor work its
5693 magic. Buf if we're just elaborating this for side effects, just
5694 gimplify any element that has side-effects. */
5695 if (fallback == fb_none)
5697 unsigned HOST_WIDE_INT ix;
5698 constructor_elt *ce;
5699 tree temp = NULL_TREE;
5701 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (*expr_p),
5704 if (TREE_SIDE_EFFECTS (ce->value))
5705 append_to_statement_list (ce->value, &temp);
5710 /* C99 code may assign to an array in a constructed
5711 structure or union, and this has undefined behavior only
5712 on execution, so create a temporary if an lvalue is
5714 else if (fallback == fb_lvalue)
5716 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
5717 lang_hooks.mark_addressable (*expr_p);
5723 /* The following are special cases that are not handled by the
5724 original GIMPLE grammar. */
5726 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
5729 ret = gimplify_save_expr (expr_p, pre_p, post_p);
5734 enum gimplify_status r0, r1, r2;
5736 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5737 is_gimple_lvalue, fb_either);
5738 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
5739 is_gimple_val, fb_rvalue);
5740 r2 = gimplify_expr (&TREE_OPERAND (*expr_p, 2), pre_p, post_p,
5741 is_gimple_val, fb_rvalue);
5742 recalculate_side_effects (*expr_p);
5744 ret = MIN (r0, MIN (r1, r2));
5748 case NON_LVALUE_EXPR:
5749 /* This should have been stripped above. */
5753 ret = gimplify_asm_expr (expr_p, pre_p, post_p);
5756 case TRY_FINALLY_EXPR:
5757 case TRY_CATCH_EXPR:
5758 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p, 0));
5759 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p, 1));
5763 case CLEANUP_POINT_EXPR:
5764 ret = gimplify_cleanup_point_expr (expr_p, pre_p);
5768 ret = gimplify_target_expr (expr_p, pre_p, post_p);
5772 gimplify_to_stmt_list (&CATCH_BODY (*expr_p));
5776 case EH_FILTER_EXPR:
5777 gimplify_to_stmt_list (&EH_FILTER_FAILURE (*expr_p));
5783 enum gimplify_status r0, r1;
5784 r0 = gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p), pre_p, post_p,
5785 is_gimple_val, fb_rvalue);
5786 r1 = gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p), pre_p, post_p,
5787 is_gimple_val, fb_rvalue);
5793 /* We get here when taking the address of a label. We mark
5794 the label as "forced"; meaning it can never be removed and
5795 it is a potential target for any computed goto. */
5796 FORCED_LABEL (*expr_p) = 1;
5800 case STATEMENT_LIST:
5801 ret = gimplify_statement_list (expr_p, pre_p);
5804 case WITH_SIZE_EXPR:
5806 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
5807 post_p == &internal_post ? NULL : post_p,
5808 gimple_test_f, fallback);
5809 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
5810 is_gimple_val, fb_rvalue);
5816 ret = gimplify_var_or_parm_decl (expr_p);
5820 /* When within an OpenMP context, notice uses of variables. */
5821 if (gimplify_omp_ctxp)
5822 omp_notice_variable (gimplify_omp_ctxp, *expr_p, true);
5827 /* Allow callbacks into the gimplifier during optimization. */
5832 ret = gimplify_omp_parallel (expr_p, pre_p);
5836 ret = gimplify_omp_for (expr_p, pre_p);
5841 ret = gimplify_omp_workshare (expr_p, pre_p);
5848 gimplify_to_stmt_list (&OMP_BODY (*expr_p));
5852 ret = gimplify_omp_atomic (expr_p, pre_p);
5861 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p)))
5863 case tcc_comparison:
5864 /* Handle comparison of objects of non scalar mode aggregates
5865 with a call to memcmp. It would be nice to only have to do
5866 this for variable-sized objects, but then we'd have to allow
5867 the same nest of reference nodes we allow for MODIFY_EXPR and
5870 Compare scalar mode aggregates as scalar mode values. Using
5871 memcmp for them would be very inefficient at best, and is
5872 plain wrong if bitfields are involved. */
5875 tree type = TREE_TYPE (TREE_OPERAND (*expr_p, 1));
5877 if (!AGGREGATE_TYPE_P (type))
5879 else if (TYPE_MODE (type) != BLKmode)
5880 ret = gimplify_scalar_mode_aggregate_compare (expr_p);
5882 ret = gimplify_variable_sized_compare (expr_p);
5887 /* If *EXPR_P does not need to be special-cased, handle it
5888 according to its class. */
5890 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
5891 post_p, is_gimple_val, fb_rvalue);
5897 enum gimplify_status r0, r1;
5899 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
5900 post_p, is_gimple_val, fb_rvalue);
5901 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
5902 post_p, is_gimple_val, fb_rvalue);
5908 case tcc_declaration:
5911 goto dont_recalculate;
5914 gcc_assert (TREE_CODE (*expr_p) == TRUTH_AND_EXPR
5915 || TREE_CODE (*expr_p) == TRUTH_OR_EXPR
5916 || TREE_CODE (*expr_p) == TRUTH_XOR_EXPR);
5920 recalculate_side_effects (*expr_p);
5925 /* If we replaced *expr_p, gimplify again. */
5926 if (ret == GS_OK && (*expr_p == NULL || *expr_p == save_expr))
5929 while (ret == GS_OK);
5931 /* If we encountered an error_mark somewhere nested inside, either
5932 stub out the statement or propagate the error back out. */
5933 if (ret == GS_ERROR)
5940 /* This was only valid as a return value from the langhook, which
5941 we handled. Make sure it doesn't escape from any other context. */
5942 gcc_assert (ret != GS_UNHANDLED);
5944 if (fallback == fb_none && *expr_p && !is_gimple_stmt (*expr_p))
5946 /* We aren't looking for a value, and we don't have a valid
5947 statement. If it doesn't have side-effects, throw it away. */
5948 if (!TREE_SIDE_EFFECTS (*expr_p))
5950 else if (!TREE_THIS_VOLATILE (*expr_p))
5952 /* This is probably a _REF that contains something nested that
5953 has side effects. Recurse through the operands to find it. */
5954 enum tree_code code = TREE_CODE (*expr_p);
5961 case VIEW_CONVERT_EXPR:
5962 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5963 gimple_test_f, fallback);
5967 case ARRAY_RANGE_REF:
5968 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5969 gimple_test_f, fallback);
5970 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
5971 gimple_test_f, fallback);
5975 /* Anything else with side-effects must be converted to
5976 a valid statement before we get here. */
5982 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p))
5983 && TYPE_MODE (TREE_TYPE (*expr_p)) != BLKmode)
5985 /* Historically, the compiler has treated a bare reference
5986 to a non-BLKmode volatile lvalue as forcing a load. */
5987 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p));
5988 /* Normally, we do not want to create a temporary for a
5989 TREE_ADDRESSABLE type because such a type should not be
5990 copied by bitwise-assignment. However, we make an
5991 exception here, as all we are doing here is ensuring that
5992 we read the bytes that make up the type. We use
5993 create_tmp_var_raw because create_tmp_var will abort when
5994 given a TREE_ADDRESSABLE type. */
5995 tree tmp = create_tmp_var_raw (type, "vol");
5996 gimple_add_tmp_var (tmp);
5997 *expr_p = build_gimple_modify_stmt (tmp, *expr_p);
6000 /* We can't do anything useful with a volatile reference to
6001 an incomplete type, so just throw it away. Likewise for
6002 a BLKmode type, since any implicit inner load should
6003 already have been turned into an explicit one by the
6004 gimplification process. */
6008 /* If we are gimplifying at the statement level, we're done. Tack
6009 everything together and replace the original statement with the
6011 if (fallback == fb_none || is_statement)
6013 if (internal_pre || internal_post)
6015 append_to_statement_list (*expr_p, &internal_pre);
6016 append_to_statement_list (internal_post, &internal_pre);
6017 annotate_all_with_locus (&internal_pre, input_location);
6018 *expr_p = internal_pre;
6022 else if (TREE_CODE (*expr_p) == STATEMENT_LIST)
6023 annotate_all_with_locus (expr_p, input_location);
6025 annotate_one_with_locus (*expr_p, input_location);
6029 /* Otherwise we're gimplifying a subexpression, so the resulting value is
6032 /* If it's sufficiently simple already, we're done. Unless we are
6033 handling some post-effects internally; if that's the case, we need to
6034 copy into a temp before adding the post-effects to the tree. */
6035 if (!internal_post && (*gimple_test_f) (*expr_p))
6038 /* Otherwise, we need to create a new temporary for the gimplified
6041 /* We can't return an lvalue if we have an internal postqueue. The
6042 object the lvalue refers to would (probably) be modified by the
6043 postqueue; we need to copy the value out first, which means an
6045 if ((fallback & fb_lvalue) && !internal_post
6046 && is_gimple_addressable (*expr_p))
6048 /* An lvalue will do. Take the address of the expression, store it
6049 in a temporary, and replace the expression with an INDIRECT_REF of
6051 tmp = build_fold_addr_expr (*expr_p);
6052 gimplify_expr (&tmp, pre_p, post_p, is_gimple_reg, fb_rvalue);
6053 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (tmp)), tmp);
6055 else if ((fallback & fb_rvalue) && is_gimple_formal_tmp_rhs (*expr_p))
6057 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p)));
6059 /* An rvalue will do. Assign the gimplified expression into a new
6060 temporary TMP and replace the original expression with TMP. */
6062 if (internal_post || (fallback & fb_lvalue))
6063 /* The postqueue might change the value of the expression between
6064 the initialization and use of the temporary, so we can't use a
6065 formal temp. FIXME do we care? */
6066 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6068 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
6070 if (TREE_CODE (*expr_p) != SSA_NAME)
6071 DECL_GIMPLE_FORMAL_TEMP_P (*expr_p) = 1;
6075 #ifdef ENABLE_CHECKING
6076 if (!(fallback & fb_mayfail))
6078 fprintf (stderr, "gimplification failed:\n");
6079 print_generic_expr (stderr, *expr_p, 0);
6080 debug_tree (*expr_p);
6081 internal_error ("gimplification failed");
6084 gcc_assert (fallback & fb_mayfail);
6085 /* If this is an asm statement, and the user asked for the
6086 impossible, don't die. Fail and let gimplify_asm_expr
6092 /* Make sure the temporary matches our predicate. */
6093 gcc_assert ((*gimple_test_f) (*expr_p));
6097 annotate_all_with_locus (&internal_post, input_location);
6098 append_to_statement_list (internal_post, pre_p);
6102 input_location = saved_location;
6106 /* Look through TYPE for variable-sized objects and gimplify each such
6107 size that we find. Add to LIST_P any statements generated. */
6110 gimplify_type_sizes (tree type, tree *list_p)
6114 if (type == NULL || type == error_mark_node)
6117 /* We first do the main variant, then copy into any other variants. */
6118 type = TYPE_MAIN_VARIANT (type);
6120 /* Avoid infinite recursion. */
6121 if (TYPE_SIZES_GIMPLIFIED (type))
6124 TYPE_SIZES_GIMPLIFIED (type) = 1;
6126 switch (TREE_CODE (type))
6132 gimplify_one_sizepos (&TYPE_MIN_VALUE (type), list_p);
6133 gimplify_one_sizepos (&TYPE_MAX_VALUE (type), list_p);
6135 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
6137 TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (type);
6138 TYPE_MAX_VALUE (t) = TYPE_MAX_VALUE (type);
6143 /* These types may not have declarations, so handle them here. */
6144 gimplify_type_sizes (TREE_TYPE (type), list_p);
6145 gimplify_type_sizes (TYPE_DOMAIN (type), list_p);
6150 case QUAL_UNION_TYPE:
6151 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
6152 if (TREE_CODE (field) == FIELD_DECL)
6154 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field), list_p);
6155 gimplify_type_sizes (TREE_TYPE (field), list_p);
6160 case REFERENCE_TYPE:
6161 /* We used to recurse on the pointed-to type here, which turned out to
6162 be incorrect because its definition might refer to variables not
6163 yet initialized at this point if a forward declaration is involved.
6165 It was actually useful for anonymous pointed-to types to ensure
6166 that the sizes evaluation dominates every possible later use of the
6167 values. Restricting to such types here would be safe since there
6168 is no possible forward declaration around, but would introduce an
6169 undesirable middle-end semantic to anonymity. We then defer to
6170 front-ends the responsibility of ensuring that the sizes are
6171 evaluated both early and late enough, e.g. by attaching artificial
6172 type declarations to the tree. */
6179 gimplify_one_sizepos (&TYPE_SIZE (type), list_p);
6180 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type), list_p);
6182 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
6184 TYPE_SIZE (t) = TYPE_SIZE (type);
6185 TYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (type);
6186 TYPE_SIZES_GIMPLIFIED (t) = 1;
6190 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
6191 a size or position, has had all of its SAVE_EXPRs evaluated.
6192 We add any required statements to STMT_P. */
6195 gimplify_one_sizepos (tree *expr_p, tree *stmt_p)
6197 tree type, expr = *expr_p;
6199 /* We don't do anything if the value isn't there, is constant, or contains
6200 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
6201 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
6202 will want to replace it with a new variable, but that will cause problems
6203 if this type is from outside the function. It's OK to have that here. */
6204 if (expr == NULL_TREE || TREE_CONSTANT (expr)
6205 || TREE_CODE (expr) == VAR_DECL
6206 || CONTAINS_PLACEHOLDER_P (expr))
6209 type = TREE_TYPE (expr);
6210 *expr_p = unshare_expr (expr);
6212 gimplify_expr (expr_p, stmt_p, NULL, is_gimple_val, fb_rvalue);
6215 /* Verify that we've an exact type match with the original expression.
6216 In particular, we do not wish to drop a "sizetype" in favour of a
6217 type of similar dimensions. We don't want to pollute the generic
6218 type-stripping code with this knowledge because it doesn't matter
6219 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
6220 and friends retain their "sizetype-ness". */
6221 if (TREE_TYPE (expr) != type
6222 && TREE_CODE (type) == INTEGER_TYPE
6223 && TYPE_IS_SIZETYPE (type))
6227 *expr_p = create_tmp_var (type, NULL);
6228 tmp = build1 (NOP_EXPR, type, expr);
6229 tmp = build_gimple_modify_stmt (*expr_p, tmp);
6230 if (EXPR_HAS_LOCATION (expr))
6231 SET_EXPR_LOCUS (tmp, EXPR_LOCUS (expr));
6233 SET_EXPR_LOCATION (tmp, input_location);
6235 gimplify_and_add (tmp, stmt_p);
6239 #ifdef ENABLE_CHECKING
6240 /* Compare types A and B for a "close enough" match. */
6243 cpt_same_type (tree a, tree b)
6245 if (lang_hooks.types_compatible_p (a, b))
6248 /* ??? The C++ FE decomposes METHOD_TYPES to FUNCTION_TYPES and doesn't
6249 link them together. This routine is intended to catch type errors
6250 that will affect the optimizers, and the optimizers don't add new
6251 dereferences of function pointers, so ignore it. */
6252 if ((TREE_CODE (a) == FUNCTION_TYPE || TREE_CODE (a) == METHOD_TYPE)
6253 && (TREE_CODE (b) == FUNCTION_TYPE || TREE_CODE (b) == METHOD_TYPE))
6256 /* ??? The C FE pushes type qualifiers after the fact into the type of
6257 the element from the type of the array. See build_unary_op's handling
6258 of ADDR_EXPR. This seems wrong -- if we were going to do this, we
6259 should have done it when creating the variable in the first place.
6260 Alternately, why aren't the two array types made variants? */
6261 if (TREE_CODE (a) == ARRAY_TYPE && TREE_CODE (b) == ARRAY_TYPE)
6262 return cpt_same_type (TREE_TYPE (a), TREE_TYPE (b));
6264 /* And because of those, we have to recurse down through pointers. */
6265 if (POINTER_TYPE_P (a) && POINTER_TYPE_P (b))
6266 return cpt_same_type (TREE_TYPE (a), TREE_TYPE (b));
6271 /* Check for some cases of the front end missing cast expressions.
6272 The type of a dereference should correspond to the pointer type;
6273 similarly the type of an address should match its object. */
6276 check_pointer_types_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
6277 void *data ATTRIBUTE_UNUSED)
6280 tree ptype, otype, dtype;
6282 switch (TREE_CODE (t))
6286 otype = TREE_TYPE (t);
6287 ptype = TREE_TYPE (TREE_OPERAND (t, 0));
6288 dtype = TREE_TYPE (ptype);
6289 gcc_assert (cpt_same_type (otype, dtype));
6293 ptype = TREE_TYPE (t);
6294 otype = TREE_TYPE (TREE_OPERAND (t, 0));
6295 dtype = TREE_TYPE (ptype);
6296 if (!cpt_same_type (otype, dtype))
6298 /* &array is allowed to produce a pointer to the element, rather than
6299 a pointer to the array type. We must allow this in order to
6300 properly represent assigning the address of an array in C into
6301 pointer to the element type. */
6302 gcc_assert (TREE_CODE (otype) == ARRAY_TYPE
6303 && POINTER_TYPE_P (ptype)
6304 && cpt_same_type (TREE_TYPE (otype), dtype));
6318 /* Gimplify the body of statements pointed to by BODY_P. FNDECL is the
6319 function decl containing BODY. */
6322 gimplify_body (tree *body_p, tree fndecl, bool do_parms)
6324 location_t saved_location = input_location;
6325 tree body, parm_stmts;
6327 timevar_push (TV_TREE_GIMPLIFY);
6329 gcc_assert (gimplify_ctxp == NULL);
6330 push_gimplify_context ();
6332 /* Unshare most shared trees in the body and in that of any nested functions.
6333 It would seem we don't have to do this for nested functions because
6334 they are supposed to be output and then the outer function gimplified
6335 first, but the g++ front end doesn't always do it that way. */
6336 unshare_body (body_p, fndecl);
6337 unvisit_body (body_p, fndecl);
6339 /* Make sure input_location isn't set to something wierd. */
6340 input_location = DECL_SOURCE_LOCATION (fndecl);
6342 /* Resolve callee-copies. This has to be done before processing
6343 the body so that DECL_VALUE_EXPR gets processed correctly. */
6344 parm_stmts = do_parms ? gimplify_parameters () : NULL;
6346 /* Gimplify the function's body. */
6347 gimplify_stmt (body_p);
6351 body = alloc_stmt_list ();
6352 else if (TREE_CODE (body) == STATEMENT_LIST)
6354 tree t = expr_only (*body_p);
6359 /* If there isn't an outer BIND_EXPR, add one. */
6360 if (TREE_CODE (body) != BIND_EXPR)
6362 tree b = build3 (BIND_EXPR, void_type_node, NULL_TREE,
6363 NULL_TREE, NULL_TREE);
6364 TREE_SIDE_EFFECTS (b) = 1;
6365 append_to_statement_list_force (body, &BIND_EXPR_BODY (b));
6369 /* If we had callee-copies statements, insert them at the beginning
6373 append_to_statement_list_force (BIND_EXPR_BODY (body), &parm_stmts);
6374 BIND_EXPR_BODY (body) = parm_stmts;
6377 /* Unshare again, in case gimplification was sloppy. */
6378 unshare_all_trees (body);
6382 pop_gimplify_context (body);
6383 gcc_assert (gimplify_ctxp == NULL);
6385 #ifdef ENABLE_CHECKING
6386 walk_tree (body_p, check_pointer_types_r, NULL, NULL);
6389 timevar_pop (TV_TREE_GIMPLIFY);
6390 input_location = saved_location;
6393 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
6394 node for the function we want to gimplify. */
6397 gimplify_function_tree (tree fndecl)
6399 tree oldfn, parm, ret;
6401 oldfn = current_function_decl;
6402 current_function_decl = fndecl;
6403 cfun = DECL_STRUCT_FUNCTION (fndecl);
6405 allocate_struct_function (fndecl);
6407 for (parm = DECL_ARGUMENTS (fndecl); parm ; parm = TREE_CHAIN (parm))
6409 /* Preliminarily mark non-addressed complex variables as eligible
6410 for promotion to gimple registers. We'll transform their uses
6412 if ((TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
6413 || TREE_CODE (TREE_TYPE (parm)) == VECTOR_TYPE)
6414 && !TREE_THIS_VOLATILE (parm)
6415 && !needs_to_live_in_memory (parm))
6416 DECL_GIMPLE_REG_P (parm) = 1;
6419 ret = DECL_RESULT (fndecl);
6420 if ((TREE_CODE (TREE_TYPE (ret)) == COMPLEX_TYPE
6421 || TREE_CODE (TREE_TYPE (ret)) == VECTOR_TYPE)
6422 && !needs_to_live_in_memory (ret))
6423 DECL_GIMPLE_REG_P (ret) = 1;
6425 gimplify_body (&DECL_SAVED_TREE (fndecl), fndecl, true);
6427 /* If we're instrumenting function entry/exit, then prepend the call to
6428 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
6429 catch the exit hook. */
6430 /* ??? Add some way to ignore exceptions for this TFE. */
6431 if (flag_instrument_function_entry_exit
6432 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl))
6436 tf = build2 (TRY_FINALLY_EXPR, void_type_node, NULL, NULL);
6437 TREE_SIDE_EFFECTS (tf) = 1;
6438 x = DECL_SAVED_TREE (fndecl);
6439 append_to_statement_list (x, &TREE_OPERAND (tf, 0));
6440 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_EXIT];
6441 x = build_call_expr (x, 0);
6442 append_to_statement_list (x, &TREE_OPERAND (tf, 1));
6444 bind = build3 (BIND_EXPR, void_type_node, NULL, NULL, NULL);
6445 TREE_SIDE_EFFECTS (bind) = 1;
6446 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_ENTER];
6447 x = build_call_expr (x, 0);
6448 append_to_statement_list (x, &BIND_EXPR_BODY (bind));
6449 append_to_statement_list (tf, &BIND_EXPR_BODY (bind));
6451 DECL_SAVED_TREE (fndecl) = bind;
6454 cfun->gimplified = true;
6455 current_function_decl = oldfn;
6456 cfun = oldfn ? DECL_STRUCT_FUNCTION (oldfn) : NULL;
6459 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
6460 force the result to be either ssa_name or an invariant, otherwise
6461 just force it to be a rhs expression. If VAR is not NULL, make the
6462 base variable of the final destination be VAR if suitable. */
6465 force_gimple_operand (tree expr, tree *stmts, bool simple, tree var)
6468 enum gimplify_status ret;
6469 gimple_predicate gimple_test_f;
6473 if (is_gimple_val (expr))
6476 gimple_test_f = simple ? is_gimple_val : is_gimple_reg_rhs;
6478 push_gimplify_context ();
6479 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
6482 expr = build_gimple_modify_stmt (var, expr);
6484 ret = gimplify_expr (&expr, stmts, NULL,
6485 gimple_test_f, fb_rvalue);
6486 gcc_assert (ret != GS_ERROR);
6488 if (gimple_referenced_vars (cfun))
6490 for (t = gimplify_ctxp->temps; t ; t = TREE_CHAIN (t))
6491 add_referenced_var (t);
6494 pop_gimplify_context (NULL);
6499 /* Invokes force_gimple_operand for EXPR with parameters SIMPLE_P and VAR. If
6500 some statements are produced, emits them before BSI. */
6503 force_gimple_operand_bsi (block_stmt_iterator *bsi, tree expr,
6504 bool simple_p, tree var)
6508 expr = force_gimple_operand (expr, &stmts, simple_p, var);
6510 bsi_insert_before (bsi, stmts, BSI_SAME_STMT);
6515 #include "gt-gimplify.h"