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);
120 /* Mark X addressable. Unlike the langhook we expect X to be in gimple
121 form and we don't do any syntax checking. */
123 mark_addressable (tree x)
125 while (handled_component_p (x))
126 x = TREE_OPERAND (x, 0);
127 if (TREE_CODE (x) != VAR_DECL && TREE_CODE (x) != PARM_DECL)
129 TREE_ADDRESSABLE (x) = 1;
132 /* Return a hash value for a formal temporary table entry. */
135 gimple_tree_hash (const void *p)
137 tree t = ((const elt_t *) p)->val;
138 return iterative_hash_expr (t, 0);
141 /* Compare two formal temporary table entries. */
144 gimple_tree_eq (const void *p1, const void *p2)
146 tree t1 = ((const elt_t *) p1)->val;
147 tree t2 = ((const elt_t *) p2)->val;
148 enum tree_code code = TREE_CODE (t1);
150 if (TREE_CODE (t2) != code
151 || TREE_TYPE (t1) != TREE_TYPE (t2))
154 if (!operand_equal_p (t1, t2, 0))
157 /* Only allow them to compare equal if they also hash equal; otherwise
158 results are nondeterminate, and we fail bootstrap comparison. */
159 gcc_assert (gimple_tree_hash (p1) == gimple_tree_hash (p2));
164 /* Set up a context for the gimplifier. */
167 push_gimplify_context (void)
169 struct gimplify_ctx *c;
171 c = (struct gimplify_ctx *) xcalloc (1, sizeof (struct gimplify_ctx));
172 c->prev_context = gimplify_ctxp;
174 c->temp_htab = htab_create (1000, gimple_tree_hash, gimple_tree_eq, free);
179 /* Tear down a context for the gimplifier. If BODY is non-null, then
180 put the temporaries into the outer BIND_EXPR. Otherwise, put them
181 in the unexpanded_var_list. */
184 pop_gimplify_context (tree body)
186 struct gimplify_ctx *c = gimplify_ctxp;
189 gcc_assert (c && !c->current_bind_expr);
190 gimplify_ctxp = c->prev_context;
192 for (t = c->temps; t ; t = TREE_CHAIN (t))
193 DECL_GIMPLE_FORMAL_TEMP_P (t) = 0;
196 declare_vars (c->temps, body, false);
198 record_vars (c->temps);
201 htab_delete (c->temp_htab);
206 gimple_push_bind_expr (tree bind)
208 TREE_CHAIN (bind) = gimplify_ctxp->current_bind_expr;
209 gimplify_ctxp->current_bind_expr = bind;
213 gimple_pop_bind_expr (void)
215 gimplify_ctxp->current_bind_expr
216 = TREE_CHAIN (gimplify_ctxp->current_bind_expr);
220 gimple_current_bind_expr (void)
222 return gimplify_ctxp->current_bind_expr;
225 /* Returns true iff there is a COND_EXPR between us and the innermost
226 CLEANUP_POINT_EXPR. This info is used by gimple_push_cleanup. */
229 gimple_conditional_context (void)
231 return gimplify_ctxp->conditions > 0;
234 /* Note that we've entered a COND_EXPR. */
237 gimple_push_condition (void)
239 #ifdef ENABLE_CHECKING
240 if (gimplify_ctxp->conditions == 0)
241 gcc_assert (!gimplify_ctxp->conditional_cleanups);
243 ++(gimplify_ctxp->conditions);
246 /* Note that we've left a COND_EXPR. If we're back at unconditional scope
247 now, add any conditional cleanups we've seen to the prequeue. */
250 gimple_pop_condition (tree *pre_p)
252 int conds = --(gimplify_ctxp->conditions);
254 gcc_assert (conds >= 0);
257 append_to_statement_list (gimplify_ctxp->conditional_cleanups, pre_p);
258 gimplify_ctxp->conditional_cleanups = NULL_TREE;
262 /* A stable comparison routine for use with splay trees and DECLs. */
265 splay_tree_compare_decl_uid (splay_tree_key xa, splay_tree_key xb)
270 return DECL_UID (a) - DECL_UID (b);
273 /* Create a new omp construct that deals with variable remapping. */
275 static struct gimplify_omp_ctx *
276 new_omp_context (bool is_parallel, bool is_combined_parallel)
278 struct gimplify_omp_ctx *c;
280 c = XCNEW (struct gimplify_omp_ctx);
281 c->outer_context = gimplify_omp_ctxp;
282 c->variables = splay_tree_new (splay_tree_compare_decl_uid, 0, 0);
283 c->privatized_types = pointer_set_create ();
284 c->location = input_location;
285 c->is_parallel = is_parallel;
286 c->is_combined_parallel = is_combined_parallel;
287 c->default_kind = OMP_CLAUSE_DEFAULT_SHARED;
292 /* Destroy an omp construct that deals with variable remapping. */
295 delete_omp_context (struct gimplify_omp_ctx *c)
297 splay_tree_delete (c->variables);
298 pointer_set_destroy (c->privatized_types);
302 static void omp_add_variable (struct gimplify_omp_ctx *, tree, unsigned int);
303 static bool omp_notice_variable (struct gimplify_omp_ctx *, tree, bool);
305 /* A subroutine of append_to_statement_list{,_force}. T is not NULL. */
308 append_to_statement_list_1 (tree t, tree *list_p)
311 tree_stmt_iterator i;
315 if (t && TREE_CODE (t) == STATEMENT_LIST)
320 *list_p = list = alloc_stmt_list ();
324 tsi_link_after (&i, t, TSI_CONTINUE_LINKING);
327 /* Add T to the end of the list container pointed to by LIST_P.
328 If T is an expression with no effects, it is ignored. */
331 append_to_statement_list (tree t, tree *list_p)
333 if (t && TREE_SIDE_EFFECTS (t))
334 append_to_statement_list_1 (t, list_p);
337 /* Similar, but the statement is always added, regardless of side effects. */
340 append_to_statement_list_force (tree t, tree *list_p)
343 append_to_statement_list_1 (t, list_p);
346 /* Both gimplify the statement T and append it to LIST_P. */
349 gimplify_and_add (tree t, tree *list_p)
352 append_to_statement_list (t, list_p);
355 /* Strip off a legitimate source ending from the input string NAME of
356 length LEN. Rather than having to know the names used by all of
357 our front ends, we strip off an ending of a period followed by
358 up to five characters. (Java uses ".class".) */
361 remove_suffix (char *name, int len)
365 for (i = 2; i < 8 && len > i; i++)
367 if (name[len - i] == '.')
369 name[len - i] = '\0';
375 /* Create a nameless artificial label and put it in the current function
376 context. Returns the newly created label. */
379 create_artificial_label (void)
381 tree lab = build_decl (LABEL_DECL, NULL_TREE, void_type_node);
383 DECL_ARTIFICIAL (lab) = 1;
384 DECL_IGNORED_P (lab) = 1;
385 DECL_CONTEXT (lab) = current_function_decl;
389 /* Subroutine for find_single_pointer_decl. */
392 find_single_pointer_decl_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
395 tree *pdecl = (tree *) data;
397 if (DECL_P (*tp) && POINTER_TYPE_P (TREE_TYPE (*tp)))
401 /* We already found a pointer decl; return anything other
402 than NULL_TREE to unwind from walk_tree signalling that
403 we have a duplicate. */
412 /* Find the single DECL of pointer type in the tree T and return it.
413 If there are zero or more than one such DECLs, return NULL. */
416 find_single_pointer_decl (tree t)
418 tree decl = NULL_TREE;
420 if (walk_tree (&t, find_single_pointer_decl_1, &decl, NULL))
422 /* find_single_pointer_decl_1 returns a nonzero value, causing
423 walk_tree to return a nonzero value, to indicate that it
424 found more than one pointer DECL. */
431 /* Create a new temporary name with PREFIX. Returns an identifier. */
433 static GTY(()) unsigned int tmp_var_id_num;
436 create_tmp_var_name (const char *prefix)
442 char *preftmp = ASTRDUP (prefix);
444 remove_suffix (preftmp, strlen (preftmp));
448 ASM_FORMAT_PRIVATE_NAME (tmp_name, prefix ? prefix : "T", tmp_var_id_num++);
449 return get_identifier (tmp_name);
453 /* Create a new temporary variable declaration of type TYPE.
454 Does NOT push it into the current binding. */
457 create_tmp_var_raw (tree type, const char *prefix)
462 /* Make the type of the variable writable. */
463 new_type = build_type_variant (type, 0, 0);
464 TYPE_ATTRIBUTES (new_type) = TYPE_ATTRIBUTES (type);
466 tmp_var = build_decl (VAR_DECL, prefix ? create_tmp_var_name (prefix) : NULL,
469 /* The variable was declared by the compiler. */
470 DECL_ARTIFICIAL (tmp_var) = 1;
471 /* And we don't want debug info for it. */
472 DECL_IGNORED_P (tmp_var) = 1;
474 /* Make the variable writable. */
475 TREE_READONLY (tmp_var) = 0;
477 DECL_EXTERNAL (tmp_var) = 0;
478 TREE_STATIC (tmp_var) = 0;
479 TREE_USED (tmp_var) = 1;
484 /* Create a new temporary variable declaration of type TYPE. DOES push the
485 variable into the current binding. Further, assume that this is called
486 only from gimplification or optimization, at which point the creation of
487 certain types are bugs. */
490 create_tmp_var (tree type, const char *prefix)
494 /* We don't allow types that are addressable (meaning we can't make copies),
495 or incomplete. We also used to reject every variable size objects here,
496 but now support those for which a constant upper bound can be obtained.
497 The processing for variable sizes is performed in gimple_add_tmp_var,
498 point at which it really matters and possibly reached via paths not going
499 through this function, e.g. after direct calls to create_tmp_var_raw. */
500 gcc_assert (!TREE_ADDRESSABLE (type) && COMPLETE_TYPE_P (type));
502 tmp_var = create_tmp_var_raw (type, prefix);
503 gimple_add_tmp_var (tmp_var);
507 /* Given a tree, try to return a useful variable name that we can use
508 to prefix a temporary that is being assigned the value of the tree.
509 I.E. given <temp> = &A, return A. */
517 STRIP_NOPS (stripped_decl);
518 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
519 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
522 switch (TREE_CODE (stripped_decl))
525 return get_name (TREE_OPERAND (stripped_decl, 0));
532 /* Create a temporary with a name derived from VAL. Subroutine of
533 lookup_tmp_var; nobody else should call this function. */
536 create_tmp_from_val (tree val)
538 return create_tmp_var (TYPE_MAIN_VARIANT (TREE_TYPE (val)), get_name (val));
541 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
542 an existing expression temporary. */
545 lookup_tmp_var (tree val, bool is_formal)
549 /* If not optimizing, never really reuse a temporary. local-alloc
550 won't allocate any variable that is used in more than one basic
551 block, which means it will go into memory, causing much extra
552 work in reload and final and poorer code generation, outweighing
553 the extra memory allocation here. */
554 if (!optimize || !is_formal || TREE_SIDE_EFFECTS (val))
555 ret = create_tmp_from_val (val);
562 slot = htab_find_slot (gimplify_ctxp->temp_htab, (void *)&elt, INSERT);
565 elt_p = XNEW (elt_t);
567 elt_p->temp = ret = create_tmp_from_val (val);
568 *slot = (void *) elt_p;
572 elt_p = (elt_t *) *slot;
578 DECL_GIMPLE_FORMAL_TEMP_P (ret) = 1;
583 /* Returns a formal temporary variable initialized with VAL. PRE_P is as
584 in gimplify_expr. Only use this function if:
586 1) The value of the unfactored expression represented by VAL will not
587 change between the initialization and use of the temporary, and
588 2) The temporary will not be otherwise modified.
590 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
591 and #2 means it is inappropriate for && temps.
593 For other cases, use get_initialized_tmp_var instead. */
596 internal_get_tmp_var (tree val, tree *pre_p, tree *post_p, bool is_formal)
600 gimplify_expr (&val, pre_p, post_p, is_gimple_formal_tmp_rhs, fb_rvalue);
602 t = lookup_tmp_var (val, is_formal);
606 tree u = find_single_pointer_decl (val);
608 if (u && TREE_CODE (u) == VAR_DECL && DECL_BASED_ON_RESTRICT_P (u))
609 u = DECL_GET_RESTRICT_BASE (u);
610 if (u && TYPE_RESTRICT (TREE_TYPE (u)))
612 if (DECL_BASED_ON_RESTRICT_P (t))
613 gcc_assert (u == DECL_GET_RESTRICT_BASE (t));
616 DECL_BASED_ON_RESTRICT_P (t) = 1;
617 SET_DECL_RESTRICT_BASE (t, u);
622 if (TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
623 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
624 DECL_GIMPLE_REG_P (t) = 1;
626 mod = build2 (INIT_EXPR, TREE_TYPE (t), t, unshare_expr (val));
628 if (EXPR_HAS_LOCATION (val))
629 SET_EXPR_LOCUS (mod, EXPR_LOCUS (val));
631 SET_EXPR_LOCATION (mod, input_location);
633 /* gimplify_modify_expr might want to reduce this further. */
634 gimplify_and_add (mod, pre_p);
636 /* If we're gimplifying into ssa, gimplify_modify_expr will have
637 given our temporary an ssa name. Find and return it. */
638 if (gimplify_ctxp->into_ssa)
639 t = TREE_OPERAND (mod, 0);
644 /* Returns a formal temporary variable initialized with VAL. PRE_P
645 points to a statement list where side-effects needed to compute VAL
649 get_formal_tmp_var (tree val, tree *pre_p)
651 return internal_get_tmp_var (val, pre_p, NULL, true);
654 /* Returns a temporary variable initialized with VAL. PRE_P and POST_P
655 are as in gimplify_expr. */
658 get_initialized_tmp_var (tree val, tree *pre_p, tree *post_p)
660 return internal_get_tmp_var (val, pre_p, post_p, false);
663 /* Declares all the variables in VARS in SCOPE. If DEBUG_INFO is
664 true, generate debug info for them; otherwise don't. */
667 declare_vars (tree vars, tree scope, bool debug_info)
674 /* C99 mode puts the default 'return 0;' for main outside the outer
675 braces. So drill down until we find an actual scope. */
676 while (TREE_CODE (scope) == COMPOUND_EXPR)
677 scope = TREE_OPERAND (scope, 0);
679 gcc_assert (TREE_CODE (scope) == BIND_EXPR);
681 temps = nreverse (last);
683 block = BIND_EXPR_BLOCK (scope);
684 if (!block || !debug_info)
686 TREE_CHAIN (last) = BIND_EXPR_VARS (scope);
687 BIND_EXPR_VARS (scope) = temps;
691 /* We need to attach the nodes both to the BIND_EXPR and to its
692 associated BLOCK for debugging purposes. The key point here
693 is that the BLOCK_VARS of the BIND_EXPR_BLOCK of a BIND_EXPR
694 is a subchain of the BIND_EXPR_VARS of the BIND_EXPR. */
695 if (BLOCK_VARS (block))
696 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), temps);
699 BIND_EXPR_VARS (scope) = chainon (BIND_EXPR_VARS (scope), temps);
700 BLOCK_VARS (block) = temps;
706 /* For VAR a VAR_DECL of variable size, try to find a constant upper bound
707 for the size and adjust DECL_SIZE/DECL_SIZE_UNIT accordingly. Abort if
708 no such upper bound can be obtained. */
711 force_constant_size (tree var)
713 /* The only attempt we make is by querying the maximum size of objects
714 of the variable's type. */
716 HOST_WIDE_INT max_size;
718 gcc_assert (TREE_CODE (var) == VAR_DECL);
720 max_size = max_int_size_in_bytes (TREE_TYPE (var));
722 gcc_assert (max_size >= 0);
725 = build_int_cst (TREE_TYPE (DECL_SIZE_UNIT (var)), max_size);
727 = build_int_cst (TREE_TYPE (DECL_SIZE (var)), max_size * BITS_PER_UNIT);
731 gimple_add_tmp_var (tree tmp)
733 gcc_assert (!TREE_CHAIN (tmp) && !DECL_SEEN_IN_BIND_EXPR_P (tmp));
735 /* Later processing assumes that the object size is constant, which might
736 not be true at this point. Force the use of a constant upper bound in
738 if (!host_integerp (DECL_SIZE_UNIT (tmp), 1))
739 force_constant_size (tmp);
741 DECL_CONTEXT (tmp) = current_function_decl;
742 DECL_SEEN_IN_BIND_EXPR_P (tmp) = 1;
746 TREE_CHAIN (tmp) = gimplify_ctxp->temps;
747 gimplify_ctxp->temps = tmp;
749 /* Mark temporaries local within the nearest enclosing parallel. */
750 if (gimplify_omp_ctxp)
752 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
753 while (ctx && !ctx->is_parallel)
754 ctx = ctx->outer_context;
756 omp_add_variable (ctx, tmp, GOVD_LOCAL | GOVD_SEEN);
762 declare_vars (tmp, DECL_SAVED_TREE (current_function_decl), false);
765 /* Determines whether to assign a locus to the statement STMT. */
768 should_carry_locus_p (tree stmt)
770 /* Don't emit a line note for a label. We particularly don't want to
771 emit one for the break label, since it doesn't actually correspond
772 to the beginning of the loop/switch. */
773 if (TREE_CODE (stmt) == LABEL_EXPR)
776 /* Do not annotate empty statements, since it confuses gcov. */
777 if (!TREE_SIDE_EFFECTS (stmt))
784 annotate_one_with_locus (tree t, location_t locus)
786 if (CAN_HAVE_LOCATION_P (t)
787 && ! EXPR_HAS_LOCATION (t) && should_carry_locus_p (t))
788 SET_EXPR_LOCATION (t, locus);
792 annotate_all_with_locus (tree *stmt_p, location_t locus)
794 tree_stmt_iterator i;
799 for (i = tsi_start (*stmt_p); !tsi_end_p (i); tsi_next (&i))
801 tree t = tsi_stmt (i);
803 /* Assuming we've already been gimplified, we shouldn't
804 see nested chaining constructs anymore. */
805 gcc_assert (TREE_CODE (t) != STATEMENT_LIST
806 && TREE_CODE (t) != COMPOUND_EXPR);
808 annotate_one_with_locus (t, locus);
812 /* Similar to copy_tree_r() but do not copy SAVE_EXPR or TARGET_EXPR nodes.
813 These nodes model computations that should only be done once. If we
814 were to unshare something like SAVE_EXPR(i++), the gimplification
815 process would create wrong code. */
818 mostly_copy_tree_r (tree *tp, int *walk_subtrees, void *data)
820 enum tree_code code = TREE_CODE (*tp);
821 /* Don't unshare types, decls, constants and SAVE_EXPR nodes. */
822 if (TREE_CODE_CLASS (code) == tcc_type
823 || TREE_CODE_CLASS (code) == tcc_declaration
824 || TREE_CODE_CLASS (code) == tcc_constant
825 || code == SAVE_EXPR || code == TARGET_EXPR
826 /* We can't do anything sensible with a BLOCK used as an expression,
827 but we also can't just die when we see it because of non-expression
828 uses. So just avert our eyes and cross our fingers. Silly Java. */
833 gcc_assert (code != BIND_EXPR);
834 copy_tree_r (tp, walk_subtrees, data);
840 /* Callback for walk_tree to unshare most of the shared trees rooted at
841 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
842 then *TP is deep copied by calling copy_tree_r.
844 This unshares the same trees as copy_tree_r with the exception of
845 SAVE_EXPR nodes. These nodes model computations that should only be
846 done once. If we were to unshare something like SAVE_EXPR(i++), the
847 gimplification process would create wrong code. */
850 copy_if_shared_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
851 void *data ATTRIBUTE_UNUSED)
854 enum tree_code code = TREE_CODE (t);
856 /* Skip types, decls, and constants. But we do want to look at their
857 types and the bounds of types. Mark them as visited so we properly
858 unmark their subtrees on the unmark pass. If we've already seen them,
859 don't look down further. */
860 if (TREE_CODE_CLASS (code) == tcc_type
861 || TREE_CODE_CLASS (code) == tcc_declaration
862 || TREE_CODE_CLASS (code) == tcc_constant)
864 if (TREE_VISITED (t))
867 TREE_VISITED (t) = 1;
870 /* If this node has been visited already, unshare it and don't look
872 else if (TREE_VISITED (t))
874 walk_tree (tp, mostly_copy_tree_r, NULL, NULL);
878 /* Otherwise, mark the tree as visited and keep looking. */
880 TREE_VISITED (t) = 1;
886 unmark_visited_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
887 void *data ATTRIBUTE_UNUSED)
889 if (TREE_VISITED (*tp))
890 TREE_VISITED (*tp) = 0;
897 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
898 bodies of any nested functions if we are unsharing the entire body of
902 unshare_body (tree *body_p, tree fndecl)
904 struct cgraph_node *cgn = cgraph_node (fndecl);
906 walk_tree (body_p, copy_if_shared_r, NULL, NULL);
907 if (body_p == &DECL_SAVED_TREE (fndecl))
908 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
909 unshare_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
912 /* Likewise, but mark all trees as not visited. */
915 unvisit_body (tree *body_p, tree fndecl)
917 struct cgraph_node *cgn = cgraph_node (fndecl);
919 walk_tree (body_p, unmark_visited_r, NULL, NULL);
920 if (body_p == &DECL_SAVED_TREE (fndecl))
921 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
922 unvisit_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
925 /* Unshare T and all the trees reached from T via TREE_CHAIN. */
928 unshare_all_trees (tree t)
930 walk_tree (&t, copy_if_shared_r, NULL, NULL);
931 walk_tree (&t, unmark_visited_r, NULL, NULL);
934 /* Unconditionally make an unshared copy of EXPR. This is used when using
935 stored expressions which span multiple functions, such as BINFO_VTABLE,
936 as the normal unsharing process can't tell that they're shared. */
939 unshare_expr (tree expr)
941 walk_tree (&expr, mostly_copy_tree_r, NULL, NULL);
945 /* A terser interface for building a representation of an exception
949 gimple_build_eh_filter (tree body, tree allowed, tree failure)
953 /* FIXME should the allowed types go in TREE_TYPE? */
954 t = build2 (EH_FILTER_EXPR, void_type_node, allowed, NULL_TREE);
955 append_to_statement_list (failure, &EH_FILTER_FAILURE (t));
957 t = build2 (TRY_CATCH_EXPR, void_type_node, NULL_TREE, t);
958 append_to_statement_list (body, &TREE_OPERAND (t, 0));
964 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
965 contain statements and have a value. Assign its value to a temporary
966 and give it void_type_node. Returns the temporary, or NULL_TREE if
967 WRAPPER was already void. */
970 voidify_wrapper_expr (tree wrapper, tree temp)
972 tree type = TREE_TYPE (wrapper);
973 if (type && !VOID_TYPE_P (type))
977 /* Set p to point to the body of the wrapper. Loop until we find
978 something that isn't a wrapper. */
979 for (p = &wrapper; p && *p; )
981 switch (TREE_CODE (*p))
984 TREE_SIDE_EFFECTS (*p) = 1;
985 TREE_TYPE (*p) = void_type_node;
986 /* For a BIND_EXPR, the body is operand 1. */
987 p = &BIND_EXPR_BODY (*p);
990 case CLEANUP_POINT_EXPR:
991 case TRY_FINALLY_EXPR:
993 TREE_SIDE_EFFECTS (*p) = 1;
994 TREE_TYPE (*p) = void_type_node;
995 p = &TREE_OPERAND (*p, 0);
1000 tree_stmt_iterator i = tsi_last (*p);
1001 TREE_SIDE_EFFECTS (*p) = 1;
1002 TREE_TYPE (*p) = void_type_node;
1003 p = tsi_end_p (i) ? NULL : tsi_stmt_ptr (i);
1008 /* Advance to the last statement. Set all container types to void. */
1009 for (; TREE_CODE (*p) == COMPOUND_EXPR; p = &TREE_OPERAND (*p, 1))
1011 TREE_SIDE_EFFECTS (*p) = 1;
1012 TREE_TYPE (*p) = void_type_node;
1022 if (p == NULL || IS_EMPTY_STMT (*p))
1026 /* The wrapper is on the RHS of an assignment that we're pushing
1028 gcc_assert (TREE_CODE (temp) == INIT_EXPR
1029 || TREE_CODE (temp) == GIMPLE_MODIFY_STMT
1030 || TREE_CODE (temp) == MODIFY_EXPR);
1031 GENERIC_TREE_OPERAND (temp, 1) = *p;
1036 temp = create_tmp_var (type, "retval");
1037 *p = build2 (INIT_EXPR, type, temp, *p);
1046 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
1047 a temporary through which they communicate. */
1050 build_stack_save_restore (tree *save, tree *restore)
1052 tree save_call, tmp_var;
1055 build_call_expr (implicit_built_in_decls[BUILT_IN_STACK_SAVE], 0);
1056 tmp_var = create_tmp_var (ptr_type_node, "saved_stack");
1058 *save = build_gimple_modify_stmt (tmp_var, save_call);
1060 build_call_expr (implicit_built_in_decls[BUILT_IN_STACK_RESTORE],
1064 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
1066 static enum gimplify_status
1067 gimplify_bind_expr (tree *expr_p, tree *pre_p)
1069 tree bind_expr = *expr_p;
1070 bool old_save_stack = gimplify_ctxp->save_stack;
1073 tree temp = voidify_wrapper_expr (bind_expr, NULL);
1075 /* Mark variables seen in this bind expr. */
1076 for (t = BIND_EXPR_VARS (bind_expr); t ; t = TREE_CHAIN (t))
1078 if (TREE_CODE (t) == VAR_DECL)
1080 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
1082 /* Mark variable as local. */
1083 if (ctx && !is_global_var (t)
1084 && (! DECL_SEEN_IN_BIND_EXPR_P (t)
1085 || splay_tree_lookup (ctx->variables,
1086 (splay_tree_key) t) == NULL))
1087 omp_add_variable (gimplify_omp_ctxp, t, GOVD_LOCAL | GOVD_SEEN);
1089 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
1092 /* Preliminarily mark non-addressed complex variables as eligible
1093 for promotion to gimple registers. We'll transform their uses
1095 if ((TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
1096 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
1097 && !TREE_THIS_VOLATILE (t)
1098 && (TREE_CODE (t) == VAR_DECL && !DECL_HARD_REGISTER (t))
1099 && !needs_to_live_in_memory (t))
1100 DECL_GIMPLE_REG_P (t) = 1;
1103 gimple_push_bind_expr (bind_expr);
1104 gimplify_ctxp->save_stack = false;
1106 gimplify_to_stmt_list (&BIND_EXPR_BODY (bind_expr));
1108 if (gimplify_ctxp->save_stack)
1110 tree stack_save, stack_restore;
1112 /* Save stack on entry and restore it on exit. Add a try_finally
1113 block to achieve this. Note that mudflap depends on the
1114 format of the emitted code: see mx_register_decls(). */
1115 build_stack_save_restore (&stack_save, &stack_restore);
1117 t = build2 (TRY_FINALLY_EXPR, void_type_node,
1118 BIND_EXPR_BODY (bind_expr), NULL_TREE);
1119 append_to_statement_list (stack_restore, &TREE_OPERAND (t, 1));
1121 BIND_EXPR_BODY (bind_expr) = NULL_TREE;
1122 append_to_statement_list (stack_save, &BIND_EXPR_BODY (bind_expr));
1123 append_to_statement_list (t, &BIND_EXPR_BODY (bind_expr));
1126 gimplify_ctxp->save_stack = old_save_stack;
1127 gimple_pop_bind_expr ();
1132 append_to_statement_list (bind_expr, pre_p);
1139 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1140 GIMPLE value, it is assigned to a new temporary and the statement is
1141 re-written to return the temporary.
1143 PRE_P points to the list where side effects that must happen before
1144 STMT should be stored. */
1146 static enum gimplify_status
1147 gimplify_return_expr (tree stmt, tree *pre_p)
1149 tree ret_expr = TREE_OPERAND (stmt, 0);
1150 tree result_decl, result;
1152 if (!ret_expr || TREE_CODE (ret_expr) == RESULT_DECL
1153 || ret_expr == error_mark_node)
1156 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
1157 result_decl = NULL_TREE;
1160 result_decl = GENERIC_TREE_OPERAND (ret_expr, 0);
1161 if (TREE_CODE (result_decl) == INDIRECT_REF)
1162 /* See through a return by reference. */
1163 result_decl = TREE_OPERAND (result_decl, 0);
1165 gcc_assert ((TREE_CODE (ret_expr) == MODIFY_EXPR
1166 || TREE_CODE (ret_expr) == GIMPLE_MODIFY_STMT
1167 || TREE_CODE (ret_expr) == INIT_EXPR)
1168 && TREE_CODE (result_decl) == RESULT_DECL);
1171 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1172 Recall that aggregate_value_p is FALSE for any aggregate type that is
1173 returned in registers. If we're returning values in registers, then
1174 we don't want to extend the lifetime of the RESULT_DECL, particularly
1175 across another call. In addition, for those aggregates for which
1176 hard_function_value generates a PARALLEL, we'll die during normal
1177 expansion of structure assignments; there's special code in expand_return
1178 to handle this case that does not exist in expand_expr. */
1180 || aggregate_value_p (result_decl, TREE_TYPE (current_function_decl)))
1181 result = result_decl;
1182 else if (gimplify_ctxp->return_temp)
1183 result = gimplify_ctxp->return_temp;
1186 result = create_tmp_var (TREE_TYPE (result_decl), NULL);
1187 if (TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
1188 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
1189 DECL_GIMPLE_REG_P (result) = 1;
1191 /* ??? With complex control flow (usually involving abnormal edges),
1192 we can wind up warning about an uninitialized value for this. Due
1193 to how this variable is constructed and initialized, this is never
1194 true. Give up and never warn. */
1195 TREE_NO_WARNING (result) = 1;
1197 gimplify_ctxp->return_temp = result;
1200 /* Smash the lhs of the GIMPLE_MODIFY_STMT to the temporary we plan to use.
1201 Then gimplify the whole thing. */
1202 if (result != result_decl)
1203 GENERIC_TREE_OPERAND (ret_expr, 0) = result;
1205 gimplify_and_add (TREE_OPERAND (stmt, 0), pre_p);
1207 /* If we didn't use a temporary, then the result is just the result_decl.
1208 Otherwise we need a simple copy. This should already be gimple. */
1209 if (result == result_decl)
1212 ret_expr = build_gimple_modify_stmt (result_decl, result);
1213 TREE_OPERAND (stmt, 0) = ret_expr;
1218 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
1219 and initialization explicit. */
1221 static enum gimplify_status
1222 gimplify_decl_expr (tree *stmt_p)
1224 tree stmt = *stmt_p;
1225 tree decl = DECL_EXPR_DECL (stmt);
1227 *stmt_p = NULL_TREE;
1229 if (TREE_TYPE (decl) == error_mark_node)
1232 if ((TREE_CODE (decl) == TYPE_DECL
1233 || TREE_CODE (decl) == VAR_DECL)
1234 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl)))
1235 gimplify_type_sizes (TREE_TYPE (decl), stmt_p);
1237 if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl))
1239 tree init = DECL_INITIAL (decl);
1241 if (TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
1243 /* This is a variable-sized decl. Simplify its size and mark it
1244 for deferred expansion. Note that mudflap depends on the format
1245 of the emitted code: see mx_register_decls(). */
1246 tree t, addr, ptr_type;
1248 gimplify_one_sizepos (&DECL_SIZE (decl), stmt_p);
1249 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl), stmt_p);
1251 /* All occurrences of this decl in final gimplified code will be
1252 replaced by indirection. Setting DECL_VALUE_EXPR does two
1253 things: First, it lets the rest of the gimplifier know what
1254 replacement to use. Second, it lets the debug info know
1255 where to find the value. */
1256 ptr_type = build_pointer_type (TREE_TYPE (decl));
1257 addr = create_tmp_var (ptr_type, get_name (decl));
1258 DECL_IGNORED_P (addr) = 0;
1259 t = build_fold_indirect_ref (addr);
1260 SET_DECL_VALUE_EXPR (decl, t);
1261 DECL_HAS_VALUE_EXPR_P (decl) = 1;
1263 t = built_in_decls[BUILT_IN_ALLOCA];
1264 t = build_call_expr (t, 1, DECL_SIZE_UNIT (decl));
1265 t = fold_convert (ptr_type, t);
1266 t = build_gimple_modify_stmt (addr, t);
1268 gimplify_and_add (t, stmt_p);
1270 /* Indicate that we need to restore the stack level when the
1271 enclosing BIND_EXPR is exited. */
1272 gimplify_ctxp->save_stack = true;
1275 if (init && init != error_mark_node)
1277 if (!TREE_STATIC (decl))
1279 DECL_INITIAL (decl) = NULL_TREE;
1280 init = build2 (INIT_EXPR, void_type_node, decl, init);
1281 gimplify_and_add (init, stmt_p);
1284 /* We must still examine initializers for static variables
1285 as they may contain a label address. */
1286 walk_tree (&init, force_labels_r, NULL, NULL);
1289 /* Some front ends do not explicitly declare all anonymous
1290 artificial variables. We compensate here by declaring the
1291 variables, though it would be better if the front ends would
1292 explicitly declare them. */
1293 if (!DECL_SEEN_IN_BIND_EXPR_P (decl)
1294 && DECL_ARTIFICIAL (decl) && DECL_NAME (decl) == NULL_TREE)
1295 gimple_add_tmp_var (decl);
1301 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1302 and replacing the LOOP_EXPR with goto, but if the loop contains an
1303 EXIT_EXPR, we need to append a label for it to jump to. */
1305 static enum gimplify_status
1306 gimplify_loop_expr (tree *expr_p, tree *pre_p)
1308 tree saved_label = gimplify_ctxp->exit_label;
1309 tree start_label = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
1310 tree jump_stmt = build_and_jump (&LABEL_EXPR_LABEL (start_label));
1312 append_to_statement_list (start_label, pre_p);
1314 gimplify_ctxp->exit_label = NULL_TREE;
1316 gimplify_and_add (LOOP_EXPR_BODY (*expr_p), pre_p);
1318 if (gimplify_ctxp->exit_label)
1320 append_to_statement_list (jump_stmt, pre_p);
1321 *expr_p = build1 (LABEL_EXPR, void_type_node, gimplify_ctxp->exit_label);
1324 *expr_p = jump_stmt;
1326 gimplify_ctxp->exit_label = saved_label;
1331 /* Compare two case labels. Because the front end should already have
1332 made sure that case ranges do not overlap, it is enough to only compare
1333 the CASE_LOW values of each case label. */
1336 compare_case_labels (const void *p1, const void *p2)
1338 tree case1 = *(tree *)p1;
1339 tree case2 = *(tree *)p2;
1341 return tree_int_cst_compare (CASE_LOW (case1), CASE_LOW (case2));
1344 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1347 sort_case_labels (tree label_vec)
1349 size_t len = TREE_VEC_LENGTH (label_vec);
1350 tree default_case = TREE_VEC_ELT (label_vec, len - 1);
1352 if (CASE_LOW (default_case))
1356 /* The last label in the vector should be the default case
1358 for (i = 0; i < len; ++i)
1360 tree t = TREE_VEC_ELT (label_vec, i);
1364 TREE_VEC_ELT (label_vec, i) = TREE_VEC_ELT (label_vec, len - 1);
1365 TREE_VEC_ELT (label_vec, len - 1) = default_case;
1371 qsort (&TREE_VEC_ELT (label_vec, 0), len - 1, sizeof (tree),
1372 compare_case_labels);
1375 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1378 static enum gimplify_status
1379 gimplify_switch_expr (tree *expr_p, tree *pre_p)
1381 tree switch_expr = *expr_p;
1382 enum gimplify_status ret;
1384 ret = gimplify_expr (&SWITCH_COND (switch_expr), pre_p, NULL,
1385 is_gimple_val, fb_rvalue);
1387 if (SWITCH_BODY (switch_expr))
1389 VEC(tree,heap) *labels, *saved_labels;
1390 tree label_vec, default_case = NULL_TREE;
1393 /* If someone can be bothered to fill in the labels, they can
1394 be bothered to null out the body too. */
1395 gcc_assert (!SWITCH_LABELS (switch_expr));
1397 saved_labels = gimplify_ctxp->case_labels;
1398 gimplify_ctxp->case_labels = VEC_alloc (tree, heap, 8);
1400 gimplify_to_stmt_list (&SWITCH_BODY (switch_expr));
1402 labels = gimplify_ctxp->case_labels;
1403 gimplify_ctxp->case_labels = saved_labels;
1406 while (i < VEC_length (tree, labels))
1408 tree elt = VEC_index (tree, labels, i);
1409 tree low = CASE_LOW (elt);
1410 bool remove_element = FALSE;
1414 /* Discard empty ranges. */
1415 tree high = CASE_HIGH (elt);
1416 if (high && INT_CST_LT (high, low))
1417 remove_element = TRUE;
1421 /* The default case must be the last label in the list. */
1422 gcc_assert (!default_case);
1424 remove_element = TRUE;
1428 VEC_ordered_remove (tree, labels, i);
1434 label_vec = make_tree_vec (len + 1);
1435 SWITCH_LABELS (*expr_p) = label_vec;
1436 append_to_statement_list (switch_expr, pre_p);
1440 /* If the switch has no default label, add one, so that we jump
1441 around the switch body. */
1442 default_case = build3 (CASE_LABEL_EXPR, void_type_node, NULL_TREE,
1443 NULL_TREE, create_artificial_label ());
1444 append_to_statement_list (SWITCH_BODY (switch_expr), pre_p);
1445 *expr_p = build1 (LABEL_EXPR, void_type_node,
1446 CASE_LABEL (default_case));
1449 *expr_p = SWITCH_BODY (switch_expr);
1451 for (i = 0; i < len; ++i)
1452 TREE_VEC_ELT (label_vec, i) = VEC_index (tree, labels, i);
1453 TREE_VEC_ELT (label_vec, len) = default_case;
1455 VEC_free (tree, heap, labels);
1457 sort_case_labels (label_vec);
1459 SWITCH_BODY (switch_expr) = NULL;
1462 gcc_assert (SWITCH_LABELS (switch_expr));
1467 static enum gimplify_status
1468 gimplify_case_label_expr (tree *expr_p)
1470 tree expr = *expr_p;
1471 struct gimplify_ctx *ctxp;
1473 /* Invalid OpenMP programs can play Duff's Device type games with
1474 #pragma omp parallel. At least in the C front end, we don't
1475 detect such invalid branches until after gimplification. */
1476 for (ctxp = gimplify_ctxp; ; ctxp = ctxp->prev_context)
1477 if (ctxp->case_labels)
1480 VEC_safe_push (tree, heap, ctxp->case_labels, expr);
1481 *expr_p = build1 (LABEL_EXPR, void_type_node, CASE_LABEL (expr));
1485 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1489 build_and_jump (tree *label_p)
1491 if (label_p == NULL)
1492 /* If there's nowhere to jump, just fall through. */
1495 if (*label_p == NULL_TREE)
1497 tree label = create_artificial_label ();
1501 return build1 (GOTO_EXPR, void_type_node, *label_p);
1504 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1505 This also involves building a label to jump to and communicating it to
1506 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1508 static enum gimplify_status
1509 gimplify_exit_expr (tree *expr_p)
1511 tree cond = TREE_OPERAND (*expr_p, 0);
1514 expr = build_and_jump (&gimplify_ctxp->exit_label);
1515 expr = build3 (COND_EXPR, void_type_node, cond, expr, NULL_TREE);
1521 /* A helper function to be called via walk_tree. Mark all labels under *TP
1522 as being forced. To be called for DECL_INITIAL of static variables. */
1525 force_labels_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
1529 if (TREE_CODE (*tp) == LABEL_DECL)
1530 FORCED_LABEL (*tp) = 1;
1535 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1536 different from its canonical type, wrap the whole thing inside a
1537 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1540 The canonical type of a COMPONENT_REF is the type of the field being
1541 referenced--unless the field is a bit-field which can be read directly
1542 in a smaller mode, in which case the canonical type is the
1543 sign-appropriate type corresponding to that mode. */
1546 canonicalize_component_ref (tree *expr_p)
1548 tree expr = *expr_p;
1551 gcc_assert (TREE_CODE (expr) == COMPONENT_REF);
1553 if (INTEGRAL_TYPE_P (TREE_TYPE (expr)))
1554 type = TREE_TYPE (get_unwidened (expr, NULL_TREE));
1556 type = TREE_TYPE (TREE_OPERAND (expr, 1));
1558 if (TREE_TYPE (expr) != type)
1560 tree old_type = TREE_TYPE (expr);
1562 /* Set the type of the COMPONENT_REF to the underlying type. */
1563 TREE_TYPE (expr) = type;
1565 /* And wrap the whole thing inside a NOP_EXPR. */
1566 expr = build1 (NOP_EXPR, old_type, expr);
1572 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1573 to foo, embed that change in the ADDR_EXPR by converting
1578 where L is the lower bound. For simplicity, only do this for constant
1582 canonicalize_addr_expr (tree *expr_p)
1584 tree expr = *expr_p;
1585 tree ctype = TREE_TYPE (expr);
1586 tree addr_expr = TREE_OPERAND (expr, 0);
1587 tree atype = TREE_TYPE (addr_expr);
1588 tree dctype, datype, ddatype, otype, obj_expr;
1590 /* Both cast and addr_expr types should be pointers. */
1591 if (!POINTER_TYPE_P (ctype) || !POINTER_TYPE_P (atype))
1594 /* The addr_expr type should be a pointer to an array. */
1595 datype = TREE_TYPE (atype);
1596 if (TREE_CODE (datype) != ARRAY_TYPE)
1599 /* Both cast and addr_expr types should address the same object type. */
1600 dctype = TREE_TYPE (ctype);
1601 ddatype = TREE_TYPE (datype);
1602 if (!useless_type_conversion_p (dctype, ddatype))
1605 /* The addr_expr and the object type should match. */
1606 obj_expr = TREE_OPERAND (addr_expr, 0);
1607 otype = TREE_TYPE (obj_expr);
1608 if (!useless_type_conversion_p (datype, otype))
1611 /* The lower bound and element sizes must be constant. */
1612 if (!TYPE_SIZE_UNIT (dctype)
1613 || TREE_CODE (TYPE_SIZE_UNIT (dctype)) != INTEGER_CST
1614 || !TYPE_DOMAIN (datype) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype))
1615 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype))) != INTEGER_CST)
1618 /* All checks succeeded. Build a new node to merge the cast. */
1619 *expr_p = build4 (ARRAY_REF, dctype, obj_expr,
1620 TYPE_MIN_VALUE (TYPE_DOMAIN (datype)),
1621 NULL_TREE, NULL_TREE);
1622 *expr_p = build1 (ADDR_EXPR, ctype, *expr_p);
1625 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1626 underneath as appropriate. */
1628 static enum gimplify_status
1629 gimplify_conversion (tree *expr_p)
1632 gcc_assert (TREE_CODE (*expr_p) == NOP_EXPR
1633 || TREE_CODE (*expr_p) == CONVERT_EXPR);
1635 /* Then strip away all but the outermost conversion. */
1636 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p, 0));
1638 /* And remove the outermost conversion if it's useless. */
1639 if (tree_ssa_useless_type_conversion (*expr_p))
1640 *expr_p = TREE_OPERAND (*expr_p, 0);
1642 /* Attempt to avoid NOP_EXPR by producing reference to a subtype.
1643 For example this fold (subclass *)&A into &A->subclass avoiding
1644 a need for statement. */
1645 if (TREE_CODE (*expr_p) == NOP_EXPR
1646 && POINTER_TYPE_P (TREE_TYPE (*expr_p))
1647 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p, 0)))
1648 && (tem = maybe_fold_offset_to_reference
1649 (TREE_OPERAND (*expr_p, 0),
1650 integer_zero_node, TREE_TYPE (TREE_TYPE (*expr_p)))))
1651 *expr_p = build_fold_addr_expr_with_type (tem, TREE_TYPE (*expr_p));
1653 /* If we still have a conversion at the toplevel,
1654 then canonicalize some constructs. */
1655 if (TREE_CODE (*expr_p) == NOP_EXPR || TREE_CODE (*expr_p) == CONVERT_EXPR)
1657 tree sub = TREE_OPERAND (*expr_p, 0);
1659 /* If a NOP conversion is changing the type of a COMPONENT_REF
1660 expression, then canonicalize its type now in order to expose more
1661 redundant conversions. */
1662 if (TREE_CODE (sub) == COMPONENT_REF)
1663 canonicalize_component_ref (&TREE_OPERAND (*expr_p, 0));
1665 /* If a NOP conversion is changing a pointer to array of foo
1666 to a pointer to foo, embed that change in the ADDR_EXPR. */
1667 else if (TREE_CODE (sub) == ADDR_EXPR)
1668 canonicalize_addr_expr (expr_p);
1674 /* Gimplify a VAR_DECL or PARM_DECL. Returns GS_OK if we expanded a
1675 DECL_VALUE_EXPR, and it's worth re-examining things. */
1677 static enum gimplify_status
1678 gimplify_var_or_parm_decl (tree *expr_p)
1680 tree decl = *expr_p;
1682 /* ??? If this is a local variable, and it has not been seen in any
1683 outer BIND_EXPR, then it's probably the result of a duplicate
1684 declaration, for which we've already issued an error. It would
1685 be really nice if the front end wouldn't leak these at all.
1686 Currently the only known culprit is C++ destructors, as seen
1687 in g++.old-deja/g++.jason/binding.C. */
1688 if (TREE_CODE (decl) == VAR_DECL
1689 && !DECL_SEEN_IN_BIND_EXPR_P (decl)
1690 && !TREE_STATIC (decl) && !DECL_EXTERNAL (decl)
1691 && decl_function_context (decl) == current_function_decl)
1693 gcc_assert (errorcount || sorrycount);
1697 /* When within an OpenMP context, notice uses of variables. */
1698 if (gimplify_omp_ctxp && omp_notice_variable (gimplify_omp_ctxp, decl, true))
1701 /* If the decl is an alias for another expression, substitute it now. */
1702 if (DECL_HAS_VALUE_EXPR_P (decl))
1704 *expr_p = unshare_expr (DECL_VALUE_EXPR (decl));
1712 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1713 node pointed to by EXPR_P.
1716 : min_lval '[' val ']'
1718 | compound_lval '[' val ']'
1719 | compound_lval '.' ID
1721 This is not part of the original SIMPLE definition, which separates
1722 array and member references, but it seems reasonable to handle them
1723 together. Also, this way we don't run into problems with union
1724 aliasing; gcc requires that for accesses through a union to alias, the
1725 union reference must be explicit, which was not always the case when we
1726 were splitting up array and member refs.
1728 PRE_P points to the list where side effects that must happen before
1729 *EXPR_P should be stored.
1731 POST_P points to the list where side effects that must happen after
1732 *EXPR_P should be stored. */
1734 static enum gimplify_status
1735 gimplify_compound_lval (tree *expr_p, tree *pre_p,
1736 tree *post_p, fallback_t fallback)
1739 VEC(tree,heap) *stack;
1740 enum gimplify_status ret = GS_OK, tret;
1743 /* Create a stack of the subexpressions so later we can walk them in
1744 order from inner to outer. */
1745 stack = VEC_alloc (tree, heap, 10);
1747 /* We can handle anything that get_inner_reference can deal with. */
1748 for (p = expr_p; ; p = &TREE_OPERAND (*p, 0))
1751 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1752 if (TREE_CODE (*p) == INDIRECT_REF)
1753 *p = fold_indirect_ref (*p);
1755 if (handled_component_p (*p))
1757 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
1758 additional COMPONENT_REFs. */
1759 else if ((TREE_CODE (*p) == VAR_DECL || TREE_CODE (*p) == PARM_DECL)
1760 && gimplify_var_or_parm_decl (p) == GS_OK)
1765 VEC_safe_push (tree, heap, stack, *p);
1768 gcc_assert (VEC_length (tree, stack));
1770 /* Now STACK is a stack of pointers to all the refs we've walked through
1771 and P points to the innermost expression.
1773 Java requires that we elaborated nodes in source order. That
1774 means we must gimplify the inner expression followed by each of
1775 the indices, in order. But we can't gimplify the inner
1776 expression until we deal with any variable bounds, sizes, or
1777 positions in order to deal with PLACEHOLDER_EXPRs.
1779 So we do this in three steps. First we deal with the annotations
1780 for any variables in the components, then we gimplify the base,
1781 then we gimplify any indices, from left to right. */
1782 for (i = VEC_length (tree, stack) - 1; i >= 0; i--)
1784 tree t = VEC_index (tree, stack, i);
1786 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
1788 /* Gimplify the low bound and element type size and put them into
1789 the ARRAY_REF. If these values are set, they have already been
1791 if (!TREE_OPERAND (t, 2))
1793 tree low = unshare_expr (array_ref_low_bound (t));
1794 if (!is_gimple_min_invariant (low))
1796 TREE_OPERAND (t, 2) = low;
1797 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1798 is_gimple_formal_tmp_reg, fb_rvalue);
1799 ret = MIN (ret, tret);
1803 if (!TREE_OPERAND (t, 3))
1805 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (t, 0)));
1806 tree elmt_size = unshare_expr (array_ref_element_size (t));
1807 tree factor = size_int (TYPE_ALIGN_UNIT (elmt_type));
1809 /* Divide the element size by the alignment of the element
1811 elmt_size = size_binop (EXACT_DIV_EXPR, elmt_size, factor);
1813 if (!is_gimple_min_invariant (elmt_size))
1815 TREE_OPERAND (t, 3) = elmt_size;
1816 tret = gimplify_expr (&TREE_OPERAND (t, 3), pre_p, post_p,
1817 is_gimple_formal_tmp_reg, fb_rvalue);
1818 ret = MIN (ret, tret);
1822 else if (TREE_CODE (t) == COMPONENT_REF)
1824 /* Set the field offset into T and gimplify it. */
1825 if (!TREE_OPERAND (t, 2))
1827 tree offset = unshare_expr (component_ref_field_offset (t));
1828 tree field = TREE_OPERAND (t, 1);
1830 = size_int (DECL_OFFSET_ALIGN (field) / BITS_PER_UNIT);
1832 /* Divide the offset by its alignment. */
1833 offset = size_binop (EXACT_DIV_EXPR, offset, factor);
1835 if (!is_gimple_min_invariant (offset))
1837 TREE_OPERAND (t, 2) = offset;
1838 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1839 is_gimple_formal_tmp_reg, fb_rvalue);
1840 ret = MIN (ret, tret);
1846 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
1847 so as to match the min_lval predicate. Failure to do so may result
1848 in the creation of large aggregate temporaries. */
1849 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval,
1850 fallback | fb_lvalue);
1851 ret = MIN (ret, tret);
1853 /* And finally, the indices and operands to BIT_FIELD_REF. During this
1854 loop we also remove any useless conversions. */
1855 for (; VEC_length (tree, stack) > 0; )
1857 tree t = VEC_pop (tree, stack);
1859 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
1861 /* Gimplify the dimension.
1862 Temporary fix for gcc.c-torture/execute/20040313-1.c.
1863 Gimplify non-constant array indices into a temporary
1865 FIXME - The real fix is to gimplify post-modify
1866 expressions into a minimal gimple lvalue. However, that
1867 exposes bugs in alias analysis. The alias analyzer does
1868 not handle &PTR->FIELD very well. Will fix after the
1869 branch is merged into mainline (dnovillo 2004-05-03). */
1870 if (!is_gimple_min_invariant (TREE_OPERAND (t, 1)))
1872 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
1873 is_gimple_formal_tmp_reg, fb_rvalue);
1874 ret = MIN (ret, tret);
1877 else if (TREE_CODE (t) == BIT_FIELD_REF)
1879 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
1880 is_gimple_val, fb_rvalue);
1881 ret = MIN (ret, tret);
1882 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1883 is_gimple_val, fb_rvalue);
1884 ret = MIN (ret, tret);
1887 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t, 0));
1889 /* The innermost expression P may have originally had TREE_SIDE_EFFECTS
1890 set which would have caused all the outer expressions in EXPR_P
1891 leading to P to also have had TREE_SIDE_EFFECTS set. */
1892 recalculate_side_effects (t);
1895 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval, fallback);
1896 ret = MIN (ret, tret);
1898 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
1899 if ((fallback & fb_rvalue) && TREE_CODE (*expr_p) == COMPONENT_REF)
1901 canonicalize_component_ref (expr_p);
1902 ret = MIN (ret, GS_OK);
1905 VEC_free (tree, heap, stack);
1910 /* Gimplify the self modifying expression pointed to by EXPR_P
1913 PRE_P points to the list where side effects that must happen before
1914 *EXPR_P should be stored.
1916 POST_P points to the list where side effects that must happen after
1917 *EXPR_P should be stored.
1919 WANT_VALUE is nonzero iff we want to use the value of this expression
1920 in another expression. */
1922 static enum gimplify_status
1923 gimplify_self_mod_expr (tree *expr_p, tree *pre_p, tree *post_p,
1926 enum tree_code code;
1927 tree lhs, lvalue, rhs, t1, post = NULL, *orig_post_p = post_p;
1929 enum tree_code arith_code;
1930 enum gimplify_status ret;
1932 code = TREE_CODE (*expr_p);
1934 gcc_assert (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR
1935 || code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR);
1937 /* Prefix or postfix? */
1938 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
1939 /* Faster to treat as prefix if result is not used. */
1940 postfix = want_value;
1944 /* For postfix, make sure the inner expression's post side effects
1945 are executed after side effects from this expression. */
1949 /* Add or subtract? */
1950 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
1951 arith_code = PLUS_EXPR;
1953 arith_code = MINUS_EXPR;
1955 /* Gimplify the LHS into a GIMPLE lvalue. */
1956 lvalue = TREE_OPERAND (*expr_p, 0);
1957 ret = gimplify_expr (&lvalue, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
1958 if (ret == GS_ERROR)
1961 /* Extract the operands to the arithmetic operation. */
1963 rhs = TREE_OPERAND (*expr_p, 1);
1965 /* For postfix operator, we evaluate the LHS to an rvalue and then use
1966 that as the result value and in the postqueue operation. */
1969 ret = gimplify_expr (&lhs, pre_p, post_p, is_gimple_val, fb_rvalue);
1970 if (ret == GS_ERROR)
1974 /* For POINTERs increment, use POINTER_PLUS_EXPR. */
1975 if (POINTER_TYPE_P (TREE_TYPE (lhs)))
1977 rhs = fold_convert (sizetype, rhs);
1978 if (arith_code == MINUS_EXPR)
1979 rhs = fold_build1 (NEGATE_EXPR, TREE_TYPE (rhs), rhs);
1980 arith_code = POINTER_PLUS_EXPR;
1983 t1 = build2 (arith_code, TREE_TYPE (*expr_p), lhs, rhs);
1984 t1 = build_gimple_modify_stmt (lvalue, t1);
1988 gimplify_and_add (t1, orig_post_p);
1989 append_to_statement_list (post, orig_post_p);
2000 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
2003 maybe_with_size_expr (tree *expr_p)
2005 tree expr = *expr_p;
2006 tree type = TREE_TYPE (expr);
2009 /* If we've already wrapped this or the type is error_mark_node, we can't do
2011 if (TREE_CODE (expr) == WITH_SIZE_EXPR
2012 || type == error_mark_node)
2015 /* If the size isn't known or is a constant, we have nothing to do. */
2016 size = TYPE_SIZE_UNIT (type);
2017 if (!size || TREE_CODE (size) == INTEGER_CST)
2020 /* Otherwise, make a WITH_SIZE_EXPR. */
2021 size = unshare_expr (size);
2022 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, expr);
2023 *expr_p = build2 (WITH_SIZE_EXPR, type, expr, size);
2026 /* Subroutine of gimplify_call_expr: Gimplify a single argument. */
2028 static enum gimplify_status
2029 gimplify_arg (tree *expr_p, tree *pre_p)
2031 bool (*test) (tree);
2034 /* In general, we allow lvalues for function arguments to avoid
2035 extra overhead of copying large aggregates out of even larger
2036 aggregates into temporaries only to copy the temporaries to
2037 the argument list. Make optimizers happy by pulling out to
2038 temporaries those types that fit in registers. */
2039 if (is_gimple_reg_type (TREE_TYPE (*expr_p)))
2040 test = is_gimple_val, fb = fb_rvalue;
2042 test = is_gimple_lvalue, fb = fb_either;
2044 /* If this is a variable sized type, we must remember the size. */
2045 maybe_with_size_expr (expr_p);
2047 /* There is a sequence point before a function call. Side effects in
2048 the argument list must occur before the actual call. So, when
2049 gimplifying arguments, force gimplify_expr to use an internal
2050 post queue which is then appended to the end of PRE_P. */
2051 return gimplify_expr (expr_p, pre_p, NULL, test, fb);
2054 /* Gimplify the CALL_EXPR node pointed to by EXPR_P. PRE_P points to the
2055 list where side effects that must happen before *EXPR_P should be stored.
2056 WANT_VALUE is true if the result of the call is desired. */
2058 static enum gimplify_status
2059 gimplify_call_expr (tree *expr_p, tree *pre_p, bool want_value)
2061 tree decl, parms, p;
2062 enum gimplify_status ret;
2065 gcc_assert (TREE_CODE (*expr_p) == CALL_EXPR);
2067 /* For reliable diagnostics during inlining, it is necessary that
2068 every call_expr be annotated with file and line. */
2069 if (! EXPR_HAS_LOCATION (*expr_p))
2070 SET_EXPR_LOCATION (*expr_p, input_location);
2072 /* This may be a call to a builtin function.
2074 Builtin function calls may be transformed into different
2075 (and more efficient) builtin function calls under certain
2076 circumstances. Unfortunately, gimplification can muck things
2077 up enough that the builtin expanders are not aware that certain
2078 transformations are still valid.
2080 So we attempt transformation/gimplification of the call before
2081 we gimplify the CALL_EXPR. At this time we do not manage to
2082 transform all calls in the same manner as the expanders do, but
2083 we do transform most of them. */
2084 decl = get_callee_fndecl (*expr_p);
2085 if (decl && DECL_BUILT_IN (decl))
2087 tree new = fold_call_expr (*expr_p, !want_value);
2089 if (new && new != *expr_p)
2091 /* There was a transformation of this call which computes the
2092 same value, but in a more efficient way. Return and try
2098 if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
2099 && DECL_FUNCTION_CODE (decl) == BUILT_IN_VA_START)
2101 if (call_expr_nargs (*expr_p) < 2)
2103 error ("too few arguments to function %<va_start%>");
2104 *expr_p = build_empty_stmt ();
2108 if (fold_builtin_next_arg (*expr_p, true))
2110 *expr_p = build_empty_stmt ();
2113 /* Avoid gimplifying the second argument to va_start, which needs
2114 to be the plain PARM_DECL. */
2115 return gimplify_arg (&CALL_EXPR_ARG (*expr_p, 0), pre_p);
2119 /* There is a sequence point before the call, so any side effects in
2120 the calling expression must occur before the actual call. Force
2121 gimplify_expr to use an internal post queue. */
2122 ret = gimplify_expr (&CALL_EXPR_FN (*expr_p), pre_p, NULL,
2123 is_gimple_call_addr, fb_rvalue);
2125 nargs = call_expr_nargs (*expr_p);
2127 /* Get argument types for verification. */
2128 decl = get_callee_fndecl (*expr_p);
2131 parms = TYPE_ARG_TYPES (TREE_TYPE (decl));
2132 else if (POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_FN (*expr_p))))
2133 parms = TYPE_ARG_TYPES (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (*expr_p))));
2135 /* Verify if the type of the argument matches that of the function
2136 declaration. If we cannot verify this or there is a mismatch,
2137 mark the call expression so it doesn't get inlined later. */
2138 if (decl && DECL_ARGUMENTS (decl))
2140 for (i = 0, p = DECL_ARGUMENTS (decl); i < nargs;
2141 i++, p = TREE_CHAIN (p))
2143 /* We cannot distinguish a varargs function from the case
2144 of excess parameters, still defering the inlining decision
2145 to the callee is possible. */
2148 if (p == error_mark_node
2149 || CALL_EXPR_ARG (*expr_p, i) == error_mark_node
2150 || !fold_convertible_p (DECL_ARG_TYPE (p),
2151 CALL_EXPR_ARG (*expr_p, i)))
2153 CALL_CANNOT_INLINE_P (*expr_p) = 1;
2160 for (i = 0, p = parms; i < nargs; i++, p = TREE_CHAIN (p))
2162 /* If this is a varargs function defer inlining decision
2166 if (TREE_VALUE (p) == error_mark_node
2167 || CALL_EXPR_ARG (*expr_p, i) == error_mark_node
2168 || TREE_CODE (TREE_VALUE (p)) == VOID_TYPE
2169 || !fold_convertible_p (TREE_VALUE (p),
2170 CALL_EXPR_ARG (*expr_p, i)))
2172 CALL_CANNOT_INLINE_P (*expr_p) = 1;
2177 else if (nargs != 0)
2178 CALL_CANNOT_INLINE_P (*expr_p) = 1;
2180 /* Finally, gimplify the function arguments. */
2181 for (i = (PUSH_ARGS_REVERSED ? nargs - 1 : 0);
2182 PUSH_ARGS_REVERSED ? i >= 0 : i < nargs;
2183 PUSH_ARGS_REVERSED ? i-- : i++)
2185 enum gimplify_status t;
2187 t = gimplify_arg (&CALL_EXPR_ARG (*expr_p, i), pre_p);
2193 /* Try this again in case gimplification exposed something. */
2194 if (ret != GS_ERROR)
2196 tree new = fold_call_expr (*expr_p, !want_value);
2198 if (new && new != *expr_p)
2200 /* There was a transformation of this call which computes the
2201 same value, but in a more efficient way. Return and try
2208 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2209 decl. This allows us to eliminate redundant or useless
2210 calls to "const" functions. */
2211 if (TREE_CODE (*expr_p) == CALL_EXPR
2212 && (call_expr_flags (*expr_p) & (ECF_CONST | ECF_PURE)))
2213 TREE_SIDE_EFFECTS (*expr_p) = 0;
2218 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2219 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2221 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2222 condition is true or false, respectively. If null, we should generate
2223 our own to skip over the evaluation of this specific expression.
2225 This function is the tree equivalent of do_jump.
2227 shortcut_cond_r should only be called by shortcut_cond_expr. */
2230 shortcut_cond_r (tree pred, tree *true_label_p, tree *false_label_p)
2232 tree local_label = NULL_TREE;
2233 tree t, expr = NULL;
2235 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2236 retain the shortcut semantics. Just insert the gotos here;
2237 shortcut_cond_expr will append the real blocks later. */
2238 if (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2240 /* Turn if (a && b) into
2242 if (a); else goto no;
2243 if (b) goto yes; else goto no;
2246 if (false_label_p == NULL)
2247 false_label_p = &local_label;
2249 t = shortcut_cond_r (TREE_OPERAND (pred, 0), NULL, false_label_p);
2250 append_to_statement_list (t, &expr);
2252 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2254 append_to_statement_list (t, &expr);
2256 else if (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2258 /* Turn if (a || b) into
2261 if (b) goto yes; else goto no;
2264 if (true_label_p == NULL)
2265 true_label_p = &local_label;
2267 t = shortcut_cond_r (TREE_OPERAND (pred, 0), true_label_p, NULL);
2268 append_to_statement_list (t, &expr);
2270 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2272 append_to_statement_list (t, &expr);
2274 else if (TREE_CODE (pred) == COND_EXPR)
2276 /* As long as we're messing with gotos, turn if (a ? b : c) into
2278 if (b) goto yes; else goto no;
2280 if (c) goto yes; else goto no; */
2281 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (pred, 0),
2282 shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2284 shortcut_cond_r (TREE_OPERAND (pred, 2), true_label_p,
2289 expr = build3 (COND_EXPR, void_type_node, pred,
2290 build_and_jump (true_label_p),
2291 build_and_jump (false_label_p));
2296 t = build1 (LABEL_EXPR, void_type_node, local_label);
2297 append_to_statement_list (t, &expr);
2304 shortcut_cond_expr (tree expr)
2306 tree pred = TREE_OPERAND (expr, 0);
2307 tree then_ = TREE_OPERAND (expr, 1);
2308 tree else_ = TREE_OPERAND (expr, 2);
2309 tree true_label, false_label, end_label, t;
2311 tree *false_label_p;
2312 bool emit_end, emit_false, jump_over_else;
2313 bool then_se = then_ && TREE_SIDE_EFFECTS (then_);
2314 bool else_se = else_ && TREE_SIDE_EFFECTS (else_);
2316 /* First do simple transformations. */
2319 /* If there is no 'else', turn (a && b) into if (a) if (b). */
2320 while (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2322 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2323 then_ = shortcut_cond_expr (expr);
2324 then_se = then_ && TREE_SIDE_EFFECTS (then_);
2325 pred = TREE_OPERAND (pred, 0);
2326 expr = build3 (COND_EXPR, void_type_node, pred, then_, NULL_TREE);
2331 /* If there is no 'then', turn
2334 if (a); else if (b); else d. */
2335 while (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2337 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2338 else_ = shortcut_cond_expr (expr);
2339 else_se = else_ && TREE_SIDE_EFFECTS (else_);
2340 pred = TREE_OPERAND (pred, 0);
2341 expr = build3 (COND_EXPR, void_type_node, pred, NULL_TREE, else_);
2345 /* If we're done, great. */
2346 if (TREE_CODE (pred) != TRUTH_ANDIF_EXPR
2347 && TREE_CODE (pred) != TRUTH_ORIF_EXPR)
2350 /* Otherwise we need to mess with gotos. Change
2353 if (a); else goto no;
2356 and recursively gimplify the condition. */
2358 true_label = false_label = end_label = NULL_TREE;
2360 /* If our arms just jump somewhere, hijack those labels so we don't
2361 generate jumps to jumps. */
2364 && TREE_CODE (then_) == GOTO_EXPR
2365 && TREE_CODE (GOTO_DESTINATION (then_)) == LABEL_DECL)
2367 true_label = GOTO_DESTINATION (then_);
2373 && TREE_CODE (else_) == GOTO_EXPR
2374 && TREE_CODE (GOTO_DESTINATION (else_)) == LABEL_DECL)
2376 false_label = GOTO_DESTINATION (else_);
2381 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2383 true_label_p = &true_label;
2385 true_label_p = NULL;
2387 /* The 'else' branch also needs a label if it contains interesting code. */
2388 if (false_label || else_se)
2389 false_label_p = &false_label;
2391 false_label_p = NULL;
2393 /* If there was nothing else in our arms, just forward the label(s). */
2394 if (!then_se && !else_se)
2395 return shortcut_cond_r (pred, true_label_p, false_label_p);
2397 /* If our last subexpression already has a terminal label, reuse it. */
2399 expr = expr_last (else_);
2401 expr = expr_last (then_);
2404 if (expr && TREE_CODE (expr) == LABEL_EXPR)
2405 end_label = LABEL_EXPR_LABEL (expr);
2407 /* If we don't care about jumping to the 'else' branch, jump to the end
2408 if the condition is false. */
2410 false_label_p = &end_label;
2412 /* We only want to emit these labels if we aren't hijacking them. */
2413 emit_end = (end_label == NULL_TREE);
2414 emit_false = (false_label == NULL_TREE);
2416 /* We only emit the jump over the else clause if we have to--if the
2417 then clause may fall through. Otherwise we can wind up with a
2418 useless jump and a useless label at the end of gimplified code,
2419 which will cause us to think that this conditional as a whole
2420 falls through even if it doesn't. If we then inline a function
2421 which ends with such a condition, that can cause us to issue an
2422 inappropriate warning about control reaching the end of a
2423 non-void function. */
2424 jump_over_else = block_may_fallthru (then_);
2426 pred = shortcut_cond_r (pred, true_label_p, false_label_p);
2429 append_to_statement_list (pred, &expr);
2431 append_to_statement_list (then_, &expr);
2436 t = build_and_jump (&end_label);
2437 append_to_statement_list (t, &expr);
2441 t = build1 (LABEL_EXPR, void_type_node, false_label);
2442 append_to_statement_list (t, &expr);
2444 append_to_statement_list (else_, &expr);
2446 if (emit_end && end_label)
2448 t = build1 (LABEL_EXPR, void_type_node, end_label);
2449 append_to_statement_list (t, &expr);
2455 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2458 gimple_boolify (tree expr)
2460 tree type = TREE_TYPE (expr);
2462 if (TREE_CODE (type) == BOOLEAN_TYPE)
2465 switch (TREE_CODE (expr))
2467 case TRUTH_AND_EXPR:
2469 case TRUTH_XOR_EXPR:
2470 case TRUTH_ANDIF_EXPR:
2471 case TRUTH_ORIF_EXPR:
2472 /* Also boolify the arguments of truth exprs. */
2473 TREE_OPERAND (expr, 1) = gimple_boolify (TREE_OPERAND (expr, 1));
2476 case TRUTH_NOT_EXPR:
2477 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2480 case EQ_EXPR: case NE_EXPR:
2481 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2482 /* These expressions always produce boolean results. */
2483 TREE_TYPE (expr) = boolean_type_node;
2487 /* Other expressions that get here must have boolean values, but
2488 might need to be converted to the appropriate mode. */
2489 return fold_convert (boolean_type_node, expr);
2493 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2502 The second form is used when *EXPR_P is of type void.
2504 TARGET is the tree for T1 above.
2506 PRE_P points to the list where side effects that must happen before
2507 *EXPR_P should be stored. */
2509 static enum gimplify_status
2510 gimplify_cond_expr (tree *expr_p, tree *pre_p, fallback_t fallback)
2512 tree expr = *expr_p;
2513 tree tmp, tmp2, type;
2514 enum gimplify_status ret;
2516 type = TREE_TYPE (expr);
2518 /* If this COND_EXPR has a value, copy the values into a temporary within
2520 if (! VOID_TYPE_P (type))
2524 if ((fallback & fb_lvalue) == 0)
2526 result = tmp2 = tmp = create_tmp_var (TREE_TYPE (expr), "iftmp");
2531 tree type = build_pointer_type (TREE_TYPE (expr));
2533 if (TREE_TYPE (TREE_OPERAND (expr, 1)) != void_type_node)
2534 TREE_OPERAND (expr, 1) =
2535 build_fold_addr_expr (TREE_OPERAND (expr, 1));
2537 if (TREE_TYPE (TREE_OPERAND (expr, 2)) != void_type_node)
2538 TREE_OPERAND (expr, 2) =
2539 build_fold_addr_expr (TREE_OPERAND (expr, 2));
2541 tmp2 = tmp = create_tmp_var (type, "iftmp");
2543 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (expr, 0),
2544 TREE_OPERAND (expr, 1), TREE_OPERAND (expr, 2));
2546 result = build_fold_indirect_ref (tmp);
2550 /* Build the then clause, 't1 = a;'. But don't build an assignment
2551 if this branch is void; in C++ it can be, if it's a throw. */
2552 if (TREE_TYPE (TREE_OPERAND (expr, 1)) != void_type_node)
2553 TREE_OPERAND (expr, 1)
2554 = build_gimple_modify_stmt (tmp, TREE_OPERAND (expr, 1));
2556 /* Build the else clause, 't1 = b;'. */
2557 if (TREE_TYPE (TREE_OPERAND (expr, 2)) != void_type_node)
2558 TREE_OPERAND (expr, 2)
2559 = build_gimple_modify_stmt (tmp2, TREE_OPERAND (expr, 2));
2561 TREE_TYPE (expr) = void_type_node;
2562 recalculate_side_effects (expr);
2564 /* Move the COND_EXPR to the prequeue. */
2565 gimplify_and_add (expr, pre_p);
2571 /* Make sure the condition has BOOLEAN_TYPE. */
2572 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2574 /* Break apart && and || conditions. */
2575 if (TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ANDIF_EXPR
2576 || TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ORIF_EXPR)
2578 expr = shortcut_cond_expr (expr);
2580 if (expr != *expr_p)
2584 /* We can't rely on gimplify_expr to re-gimplify the expanded
2585 form properly, as cleanups might cause the target labels to be
2586 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2587 set up a conditional context. */
2588 gimple_push_condition ();
2589 gimplify_stmt (expr_p);
2590 gimple_pop_condition (pre_p);
2596 /* Now do the normal gimplification. */
2597 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL,
2598 is_gimple_condexpr, fb_rvalue);
2600 gimple_push_condition ();
2602 gimplify_to_stmt_list (&TREE_OPERAND (expr, 1));
2603 gimplify_to_stmt_list (&TREE_OPERAND (expr, 2));
2604 recalculate_side_effects (expr);
2606 gimple_pop_condition (pre_p);
2608 if (ret == GS_ERROR)
2610 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2612 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 2)))
2613 /* Rewrite "if (a); else b" to "if (!a) b" */
2615 TREE_OPERAND (expr, 0) = invert_truthvalue (TREE_OPERAND (expr, 0));
2616 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL,
2617 is_gimple_condexpr, fb_rvalue);
2619 tmp = TREE_OPERAND (expr, 1);
2620 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 2);
2621 TREE_OPERAND (expr, 2) = tmp;
2624 /* Both arms are empty; replace the COND_EXPR with its predicate. */
2625 expr = TREE_OPERAND (expr, 0);
2631 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2632 a call to __builtin_memcpy. */
2634 static enum gimplify_status
2635 gimplify_modify_expr_to_memcpy (tree *expr_p, tree size, bool want_value)
2637 tree t, to, to_ptr, from, from_ptr;
2639 to = GENERIC_TREE_OPERAND (*expr_p, 0);
2640 from = GENERIC_TREE_OPERAND (*expr_p, 1);
2642 from_ptr = build_fold_addr_expr (from);
2644 to_ptr = build_fold_addr_expr (to);
2645 t = implicit_built_in_decls[BUILT_IN_MEMCPY];
2646 t = build_call_expr (t, 3, to_ptr, from_ptr, size);
2650 t = build1 (NOP_EXPR, TREE_TYPE (to_ptr), t);
2651 t = build1 (INDIRECT_REF, TREE_TYPE (to), t);
2658 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2659 a call to __builtin_memset. In this case we know that the RHS is
2660 a CONSTRUCTOR with an empty element list. */
2662 static enum gimplify_status
2663 gimplify_modify_expr_to_memset (tree *expr_p, tree size, bool want_value)
2667 to = GENERIC_TREE_OPERAND (*expr_p, 0);
2669 to_ptr = build_fold_addr_expr (to);
2670 t = implicit_built_in_decls[BUILT_IN_MEMSET];
2671 t = build_call_expr (t, 3, to_ptr, integer_zero_node, size);
2675 t = build1 (NOP_EXPR, TREE_TYPE (to_ptr), t);
2676 t = build1 (INDIRECT_REF, TREE_TYPE (to), t);
2683 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
2684 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
2685 assignment. Returns non-null if we detect a potential overlap. */
2687 struct gimplify_init_ctor_preeval_data
2689 /* The base decl of the lhs object. May be NULL, in which case we
2690 have to assume the lhs is indirect. */
2693 /* The alias set of the lhs object. */
2698 gimplify_init_ctor_preeval_1 (tree *tp, int *walk_subtrees, void *xdata)
2700 struct gimplify_init_ctor_preeval_data *data
2701 = (struct gimplify_init_ctor_preeval_data *) xdata;
2704 /* If we find the base object, obviously we have overlap. */
2705 if (data->lhs_base_decl == t)
2708 /* If the constructor component is indirect, determine if we have a
2709 potential overlap with the lhs. The only bits of information we
2710 have to go on at this point are addressability and alias sets. */
2711 if (TREE_CODE (t) == INDIRECT_REF
2712 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
2713 && alias_sets_conflict_p (data->lhs_alias_set, get_alias_set (t)))
2716 /* If the constructor component is a call, determine if it can hide a
2717 potential overlap with the lhs through an INDIRECT_REF like above. */
2718 if (TREE_CODE (t) == CALL_EXPR)
2720 tree type, fntype = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (t)));
2722 for (type = TYPE_ARG_TYPES (fntype); type; type = TREE_CHAIN (type))
2723 if (POINTER_TYPE_P (TREE_VALUE (type))
2724 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
2725 && alias_sets_conflict_p (data->lhs_alias_set,
2727 (TREE_TYPE (TREE_VALUE (type)))))
2731 if (IS_TYPE_OR_DECL_P (t))
2736 /* A subroutine of gimplify_init_constructor. Pre-evaluate *EXPR_P,
2737 force values that overlap with the lhs (as described by *DATA)
2738 into temporaries. */
2741 gimplify_init_ctor_preeval (tree *expr_p, tree *pre_p, tree *post_p,
2742 struct gimplify_init_ctor_preeval_data *data)
2744 enum gimplify_status one;
2746 /* If the value is invariant, then there's nothing to pre-evaluate.
2747 But ensure it doesn't have any side-effects since a SAVE_EXPR is
2748 invariant but has side effects and might contain a reference to
2749 the object we're initializing. */
2750 if (TREE_INVARIANT (*expr_p) && !TREE_SIDE_EFFECTS (*expr_p))
2753 /* If the type has non-trivial constructors, we can't pre-evaluate. */
2754 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p)))
2757 /* Recurse for nested constructors. */
2758 if (TREE_CODE (*expr_p) == CONSTRUCTOR)
2760 unsigned HOST_WIDE_INT ix;
2761 constructor_elt *ce;
2762 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (*expr_p);
2764 for (ix = 0; VEC_iterate (constructor_elt, v, ix, ce); ix++)
2765 gimplify_init_ctor_preeval (&ce->value, pre_p, post_p, data);
2769 /* If this is a variable sized type, we must remember the size. */
2770 maybe_with_size_expr (expr_p);
2772 /* Gimplify the constructor element to something appropriate for the rhs
2773 of a MODIFY_EXPR. Given that we know the lhs is an aggregate, we know
2774 the gimplifier will consider this a store to memory. Doing this
2775 gimplification now means that we won't have to deal with complicated
2776 language-specific trees, nor trees like SAVE_EXPR that can induce
2777 exponential search behavior. */
2778 one = gimplify_expr (expr_p, pre_p, post_p, is_gimple_mem_rhs, fb_rvalue);
2779 if (one == GS_ERROR)
2785 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
2786 with the lhs, since "a = { .x=a }" doesn't make sense. This will
2787 always be true for all scalars, since is_gimple_mem_rhs insists on a
2788 temporary variable for them. */
2789 if (DECL_P (*expr_p))
2792 /* If this is of variable size, we have no choice but to assume it doesn't
2793 overlap since we can't make a temporary for it. */
2794 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (*expr_p))) != INTEGER_CST)
2797 /* Otherwise, we must search for overlap ... */
2798 if (!walk_tree (expr_p, gimplify_init_ctor_preeval_1, data, NULL))
2801 /* ... and if found, force the value into a temporary. */
2802 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
2805 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
2806 a RANGE_EXPR in a CONSTRUCTOR for an array.
2810 object[var] = value;
2817 We increment var _after_ the loop exit check because we might otherwise
2818 fail if upper == TYPE_MAX_VALUE (type for upper).
2820 Note that we never have to deal with SAVE_EXPRs here, because this has
2821 already been taken care of for us, in gimplify_init_ctor_preeval(). */
2823 static void gimplify_init_ctor_eval (tree, VEC(constructor_elt,gc) *,
2827 gimplify_init_ctor_eval_range (tree object, tree lower, tree upper,
2828 tree value, tree array_elt_type,
2829 tree *pre_p, bool cleared)
2831 tree loop_entry_label, loop_exit_label;
2832 tree var, var_type, cref, tmp;
2834 loop_entry_label = create_artificial_label ();
2835 loop_exit_label = create_artificial_label ();
2837 /* Create and initialize the index variable. */
2838 var_type = TREE_TYPE (upper);
2839 var = create_tmp_var (var_type, NULL);
2840 append_to_statement_list (build_gimple_modify_stmt (var, lower), pre_p);
2842 /* Add the loop entry label. */
2843 append_to_statement_list (build1 (LABEL_EXPR,
2848 /* Build the reference. */
2849 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
2850 var, NULL_TREE, NULL_TREE);
2852 /* If we are a constructor, just call gimplify_init_ctor_eval to do
2853 the store. Otherwise just assign value to the reference. */
2855 if (TREE_CODE (value) == CONSTRUCTOR)
2856 /* NB we might have to call ourself recursively through
2857 gimplify_init_ctor_eval if the value is a constructor. */
2858 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
2861 append_to_statement_list (build_gimple_modify_stmt (cref, value), pre_p);
2863 /* We exit the loop when the index var is equal to the upper bound. */
2864 gimplify_and_add (build3 (COND_EXPR, void_type_node,
2865 build2 (EQ_EXPR, boolean_type_node,
2873 /* Otherwise, increment the index var... */
2874 tmp = build2 (PLUS_EXPR, var_type, var,
2875 fold_convert (var_type, integer_one_node));
2876 append_to_statement_list (build_gimple_modify_stmt (var, tmp), pre_p);
2878 /* ...and jump back to the loop entry. */
2879 append_to_statement_list (build1 (GOTO_EXPR,
2884 /* Add the loop exit label. */
2885 append_to_statement_list (build1 (LABEL_EXPR,
2891 /* Return true if FDECL is accessing a field that is zero sized. */
2894 zero_sized_field_decl (tree fdecl)
2896 if (TREE_CODE (fdecl) == FIELD_DECL && DECL_SIZE (fdecl)
2897 && integer_zerop (DECL_SIZE (fdecl)))
2902 /* Return true if TYPE is zero sized. */
2905 zero_sized_type (tree type)
2907 if (AGGREGATE_TYPE_P (type) && TYPE_SIZE (type)
2908 && integer_zerop (TYPE_SIZE (type)))
2913 /* A subroutine of gimplify_init_constructor. Generate individual
2914 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
2915 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
2916 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
2920 gimplify_init_ctor_eval (tree object, VEC(constructor_elt,gc) *elts,
2921 tree *pre_p, bool cleared)
2923 tree array_elt_type = NULL;
2924 unsigned HOST_WIDE_INT ix;
2925 tree purpose, value;
2927 if (TREE_CODE (TREE_TYPE (object)) == ARRAY_TYPE)
2928 array_elt_type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object)));
2930 FOR_EACH_CONSTRUCTOR_ELT (elts, ix, purpose, value)
2934 /* NULL values are created above for gimplification errors. */
2938 if (cleared && initializer_zerop (value))
2941 /* ??? Here's to hoping the front end fills in all of the indices,
2942 so we don't have to figure out what's missing ourselves. */
2943 gcc_assert (purpose);
2945 /* Skip zero-sized fields, unless value has side-effects. This can
2946 happen with calls to functions returning a zero-sized type, which
2947 we shouldn't discard. As a number of downstream passes don't
2948 expect sets of zero-sized fields, we rely on the gimplification of
2949 the MODIFY_EXPR we make below to drop the assignment statement. */
2950 if (! TREE_SIDE_EFFECTS (value) && zero_sized_field_decl (purpose))
2953 /* If we have a RANGE_EXPR, we have to build a loop to assign the
2955 if (TREE_CODE (purpose) == RANGE_EXPR)
2957 tree lower = TREE_OPERAND (purpose, 0);
2958 tree upper = TREE_OPERAND (purpose, 1);
2960 /* If the lower bound is equal to upper, just treat it as if
2961 upper was the index. */
2962 if (simple_cst_equal (lower, upper))
2966 gimplify_init_ctor_eval_range (object, lower, upper, value,
2967 array_elt_type, pre_p, cleared);
2974 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
2975 purpose, NULL_TREE, NULL_TREE);
2979 gcc_assert (TREE_CODE (purpose) == FIELD_DECL);
2980 cref = build3 (COMPONENT_REF, TREE_TYPE (purpose),
2981 unshare_expr (object), purpose, NULL_TREE);
2984 if (TREE_CODE (value) == CONSTRUCTOR
2985 && TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE)
2986 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
2990 init = build2 (INIT_EXPR, TREE_TYPE (cref), cref, value);
2991 gimplify_and_add (init, pre_p);
2996 /* A subroutine of gimplify_modify_expr. Break out elements of a
2997 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
2999 Note that we still need to clear any elements that don't have explicit
3000 initializers, so if not all elements are initialized we keep the
3001 original MODIFY_EXPR, we just remove all of the constructor elements. */
3003 static enum gimplify_status
3004 gimplify_init_constructor (tree *expr_p, tree *pre_p,
3005 tree *post_p, bool want_value)
3008 tree ctor = GENERIC_TREE_OPERAND (*expr_p, 1);
3009 tree type = TREE_TYPE (ctor);
3010 enum gimplify_status ret;
3011 VEC(constructor_elt,gc) *elts;
3013 if (TREE_CODE (ctor) != CONSTRUCTOR)
3014 return GS_UNHANDLED;
3016 ret = gimplify_expr (&GENERIC_TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3017 is_gimple_lvalue, fb_lvalue);
3018 if (ret == GS_ERROR)
3020 object = GENERIC_TREE_OPERAND (*expr_p, 0);
3022 elts = CONSTRUCTOR_ELTS (ctor);
3025 switch (TREE_CODE (type))
3029 case QUAL_UNION_TYPE:
3032 struct gimplify_init_ctor_preeval_data preeval_data;
3033 HOST_WIDE_INT num_type_elements, num_ctor_elements;
3034 HOST_WIDE_INT num_nonzero_elements;
3035 bool cleared, valid_const_initializer;
3037 /* Aggregate types must lower constructors to initialization of
3038 individual elements. The exception is that a CONSTRUCTOR node
3039 with no elements indicates zero-initialization of the whole. */
3040 if (VEC_empty (constructor_elt, elts))
3043 /* Fetch information about the constructor to direct later processing.
3044 We might want to make static versions of it in various cases, and
3045 can only do so if it known to be a valid constant initializer. */
3046 valid_const_initializer
3047 = categorize_ctor_elements (ctor, &num_nonzero_elements,
3048 &num_ctor_elements, &cleared);
3050 /* If a const aggregate variable is being initialized, then it
3051 should never be a lose to promote the variable to be static. */
3052 if (valid_const_initializer
3053 && num_nonzero_elements > 1
3054 && TREE_READONLY (object)
3055 && TREE_CODE (object) == VAR_DECL)
3057 DECL_INITIAL (object) = ctor;
3058 TREE_STATIC (object) = 1;
3059 if (!DECL_NAME (object))
3060 DECL_NAME (object) = create_tmp_var_name ("C");
3061 walk_tree (&DECL_INITIAL (object), force_labels_r, NULL, NULL);
3063 /* ??? C++ doesn't automatically append a .<number> to the
3064 assembler name, and even when it does, it looks a FE private
3065 data structures to figure out what that number should be,
3066 which are not set for this variable. I suppose this is
3067 important for local statics for inline functions, which aren't
3068 "local" in the object file sense. So in order to get a unique
3069 TU-local symbol, we must invoke the lhd version now. */
3070 lhd_set_decl_assembler_name (object);
3072 *expr_p = NULL_TREE;
3076 /* If there are "lots" of initialized elements, even discounting
3077 those that are not address constants (and thus *must* be
3078 computed at runtime), then partition the constructor into
3079 constant and non-constant parts. Block copy the constant
3080 parts in, then generate code for the non-constant parts. */
3081 /* TODO. There's code in cp/typeck.c to do this. */
3083 num_type_elements = count_type_elements (type, true);
3085 /* If count_type_elements could not determine number of type elements
3086 for a constant-sized object, assume clearing is needed.
3087 Don't do this for variable-sized objects, as store_constructor
3088 will ignore the clearing of variable-sized objects. */
3089 if (num_type_elements < 0 && int_size_in_bytes (type) >= 0)
3091 /* If there are "lots" of zeros, then block clear the object first. */
3092 else if (num_type_elements - num_nonzero_elements > CLEAR_RATIO
3093 && num_nonzero_elements < num_type_elements/4)
3095 /* ??? This bit ought not be needed. For any element not present
3096 in the initializer, we should simply set them to zero. Except
3097 we'd need to *find* the elements that are not present, and that
3098 requires trickery to avoid quadratic compile-time behavior in
3099 large cases or excessive memory use in small cases. */
3100 else if (num_ctor_elements < num_type_elements)
3103 /* If there are "lots" of initialized elements, and all of them
3104 are valid address constants, then the entire initializer can
3105 be dropped to memory, and then memcpy'd out. Don't do this
3106 for sparse arrays, though, as it's more efficient to follow
3107 the standard CONSTRUCTOR behavior of memset followed by
3108 individual element initialization. */
3109 if (valid_const_initializer && !cleared)
3111 HOST_WIDE_INT size = int_size_in_bytes (type);
3114 /* ??? We can still get unbounded array types, at least
3115 from the C++ front end. This seems wrong, but attempt
3116 to work around it for now. */
3119 size = int_size_in_bytes (TREE_TYPE (object));
3121 TREE_TYPE (ctor) = type = TREE_TYPE (object);
3124 /* Find the maximum alignment we can assume for the object. */
3125 /* ??? Make use of DECL_OFFSET_ALIGN. */
3126 if (DECL_P (object))
3127 align = DECL_ALIGN (object);
3129 align = TYPE_ALIGN (type);
3131 if (size > 0 && !can_move_by_pieces (size, align))
3133 tree new = create_tmp_var_raw (type, "C");
3135 gimple_add_tmp_var (new);
3136 TREE_STATIC (new) = 1;
3137 TREE_READONLY (new) = 1;
3138 DECL_INITIAL (new) = ctor;
3139 if (align > DECL_ALIGN (new))
3141 DECL_ALIGN (new) = align;
3142 DECL_USER_ALIGN (new) = 1;
3144 walk_tree (&DECL_INITIAL (new), force_labels_r, NULL, NULL);
3146 GENERIC_TREE_OPERAND (*expr_p, 1) = new;
3148 /* This is no longer an assignment of a CONSTRUCTOR, but
3149 we still may have processing to do on the LHS. So
3150 pretend we didn't do anything here to let that happen. */
3151 return GS_UNHANDLED;
3155 /* If there are nonzero elements, pre-evaluate to capture elements
3156 overlapping with the lhs into temporaries. We must do this before
3157 clearing to fetch the values before they are zeroed-out. */
3158 if (num_nonzero_elements > 0)
3160 preeval_data.lhs_base_decl = get_base_address (object);
3161 if (!DECL_P (preeval_data.lhs_base_decl))
3162 preeval_data.lhs_base_decl = NULL;
3163 preeval_data.lhs_alias_set = get_alias_set (object);
3165 gimplify_init_ctor_preeval (&GENERIC_TREE_OPERAND (*expr_p, 1),
3166 pre_p, post_p, &preeval_data);
3171 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3172 Note that we still have to gimplify, in order to handle the
3173 case of variable sized types. Avoid shared tree structures. */
3174 CONSTRUCTOR_ELTS (ctor) = NULL;
3175 object = unshare_expr (object);
3176 gimplify_stmt (expr_p);
3177 append_to_statement_list (*expr_p, pre_p);
3180 /* If we have not block cleared the object, or if there are nonzero
3181 elements in the constructor, add assignments to the individual
3182 scalar fields of the object. */
3183 if (!cleared || num_nonzero_elements > 0)
3184 gimplify_init_ctor_eval (object, elts, pre_p, cleared);
3186 *expr_p = NULL_TREE;
3194 /* Extract the real and imaginary parts out of the ctor. */
3195 gcc_assert (VEC_length (constructor_elt, elts) == 2);
3196 r = VEC_index (constructor_elt, elts, 0)->value;
3197 i = VEC_index (constructor_elt, elts, 1)->value;
3198 if (r == NULL || i == NULL)
3200 tree zero = fold_convert (TREE_TYPE (type), integer_zero_node);
3207 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3208 represent creation of a complex value. */
3209 if (TREE_CONSTANT (r) && TREE_CONSTANT (i))
3211 ctor = build_complex (type, r, i);
3212 TREE_OPERAND (*expr_p, 1) = ctor;
3216 ctor = build2 (COMPLEX_EXPR, type, r, i);
3217 TREE_OPERAND (*expr_p, 1) = ctor;
3218 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
3219 rhs_predicate_for (TREE_OPERAND (*expr_p, 0)),
3227 unsigned HOST_WIDE_INT ix;
3228 constructor_elt *ce;
3230 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3231 if (TREE_CONSTANT (ctor))
3233 bool constant_p = true;
3236 /* Even when ctor is constant, it might contain non-*_CST
3237 elements (e.g. { 1.0/0.0 - 1.0/0.0, 0.0 }) and those don't
3238 belong into VECTOR_CST nodes. */
3239 FOR_EACH_CONSTRUCTOR_VALUE (elts, ix, value)
3240 if (!CONSTANT_CLASS_P (value))
3248 TREE_OPERAND (*expr_p, 1) = build_vector_from_ctor (type, elts);
3252 /* Don't reduce a TREE_CONSTANT vector ctor even if we can't
3253 make a VECTOR_CST. It won't do anything for us, and it'll
3254 prevent us from representing it as a single constant. */
3258 /* Vector types use CONSTRUCTOR all the way through gimple
3259 compilation as a general initializer. */
3260 for (ix = 0; VEC_iterate (constructor_elt, elts, ix, ce); ix++)
3262 enum gimplify_status tret;
3263 tret = gimplify_expr (&ce->value, pre_p, post_p,
3264 is_gimple_val, fb_rvalue);
3265 if (tret == GS_ERROR)
3268 if (!is_gimple_reg (GENERIC_TREE_OPERAND (*expr_p, 0)))
3269 GENERIC_TREE_OPERAND (*expr_p, 1) = get_formal_tmp_var (ctor, pre_p);
3274 /* So how did we get a CONSTRUCTOR for a scalar type? */
3278 if (ret == GS_ERROR)
3280 else if (want_value)
3282 append_to_statement_list (*expr_p, pre_p);
3290 /* Given a pointer value OP0, return a simplified version of an
3291 indirection through OP0, or NULL_TREE if no simplification is
3292 possible. This may only be applied to a rhs of an expression.
3293 Note that the resulting type may be different from the type pointed
3294 to in the sense that it is still compatible from the langhooks
3298 fold_indirect_ref_rhs (tree t)
3300 tree type = TREE_TYPE (TREE_TYPE (t));
3304 STRIP_USELESS_TYPE_CONVERSION (sub);
3305 subtype = TREE_TYPE (sub);
3306 if (!POINTER_TYPE_P (subtype))
3309 if (TREE_CODE (sub) == ADDR_EXPR)
3311 tree op = TREE_OPERAND (sub, 0);
3312 tree optype = TREE_TYPE (op);
3314 if (useless_type_conversion_p (type, optype))
3316 /* *(foo *)&fooarray => fooarray[0] */
3317 else if (TREE_CODE (optype) == ARRAY_TYPE
3318 && useless_type_conversion_p (type, TREE_TYPE (optype)))
3320 tree type_domain = TYPE_DOMAIN (optype);
3321 tree min_val = size_zero_node;
3322 if (type_domain && TYPE_MIN_VALUE (type_domain))
3323 min_val = TYPE_MIN_VALUE (type_domain);
3324 return build4 (ARRAY_REF, type, op, min_val, NULL_TREE, NULL_TREE);
3328 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
3329 if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
3330 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (subtype))))
3333 tree min_val = size_zero_node;
3335 sub = fold_indirect_ref_rhs (sub);
3337 sub = build1 (INDIRECT_REF, TREE_TYPE (subtype), osub);
3338 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
3339 if (type_domain && TYPE_MIN_VALUE (type_domain))
3340 min_val = TYPE_MIN_VALUE (type_domain);
3341 return build4 (ARRAY_REF, type, sub, min_val, NULL_TREE, NULL_TREE);
3347 /* Subroutine of gimplify_modify_expr to do simplifications of MODIFY_EXPRs
3348 based on the code of the RHS. We loop for as long as something changes. */
3350 static enum gimplify_status
3351 gimplify_modify_expr_rhs (tree *expr_p, tree *from_p, tree *to_p, tree *pre_p,
3352 tree *post_p, bool want_value)
3354 enum gimplify_status ret = GS_OK;
3356 while (ret != GS_UNHANDLED)
3357 switch (TREE_CODE (*from_p))
3361 /* If we have code like
3365 where the type of "x" is a (possibly cv-qualified variant
3366 of "A"), treat the entire expression as identical to "x".
3367 This kind of code arises in C++ when an object is bound
3368 to a const reference, and if "x" is a TARGET_EXPR we want
3369 to take advantage of the optimization below. */
3370 tree t = fold_indirect_ref_rhs (TREE_OPERAND (*from_p, 0));
3383 /* If we are initializing something from a TARGET_EXPR, strip the
3384 TARGET_EXPR and initialize it directly, if possible. This can't
3385 be done if the initializer is void, since that implies that the
3386 temporary is set in some non-trivial way.
3388 ??? What about code that pulls out the temp and uses it
3389 elsewhere? I think that such code never uses the TARGET_EXPR as
3390 an initializer. If I'm wrong, we'll die because the temp won't
3391 have any RTL. In that case, I guess we'll need to replace
3392 references somehow. */
3393 tree init = TARGET_EXPR_INITIAL (*from_p);
3395 if (!VOID_TYPE_P (TREE_TYPE (init)))
3406 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
3408 gimplify_compound_expr (from_p, pre_p, true);
3413 /* If we're initializing from a CONSTRUCTOR, break this into
3414 individual MODIFY_EXPRs. */
3415 return gimplify_init_constructor (expr_p, pre_p, post_p, want_value);
3418 /* If we're assigning to a non-register type, push the assignment
3419 down into the branches. This is mandatory for ADDRESSABLE types,
3420 since we cannot generate temporaries for such, but it saves a
3421 copy in other cases as well. */
3422 if (!is_gimple_reg_type (TREE_TYPE (*from_p)))
3424 /* This code should mirror the code in gimplify_cond_expr. */
3425 enum tree_code code = TREE_CODE (*expr_p);
3426 tree cond = *from_p;
3427 tree result = *to_p;
3429 ret = gimplify_expr (&result, pre_p, post_p,
3430 is_gimple_min_lval, fb_lvalue);
3431 if (ret != GS_ERROR)
3434 if (TREE_TYPE (TREE_OPERAND (cond, 1)) != void_type_node)
3435 TREE_OPERAND (cond, 1)
3436 = build2 (code, void_type_node, result,
3437 TREE_OPERAND (cond, 1));
3438 if (TREE_TYPE (TREE_OPERAND (cond, 2)) != void_type_node)
3439 TREE_OPERAND (cond, 2)
3440 = build2 (code, void_type_node, unshare_expr (result),
3441 TREE_OPERAND (cond, 2));
3443 TREE_TYPE (cond) = void_type_node;
3444 recalculate_side_effects (cond);
3448 gimplify_and_add (cond, pre_p);
3449 *expr_p = unshare_expr (result);
3460 /* For calls that return in memory, give *to_p as the CALL_EXPR's
3461 return slot so that we don't generate a temporary. */
3462 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p)
3463 && aggregate_value_p (*from_p, *from_p))
3467 if (!(rhs_predicate_for (*to_p))(*from_p))
3468 /* If we need a temporary, *to_p isn't accurate. */
3470 else if (TREE_CODE (*to_p) == RESULT_DECL
3471 && DECL_NAME (*to_p) == NULL_TREE
3472 && needs_to_live_in_memory (*to_p))
3473 /* It's OK to use the return slot directly unless it's an NRV. */
3475 else if (is_gimple_reg_type (TREE_TYPE (*to_p))
3476 || (DECL_P (*to_p) && DECL_REGISTER (*to_p)))
3477 /* Don't force regs into memory. */
3479 else if (TREE_CODE (*to_p) == VAR_DECL
3480 && DECL_GIMPLE_FORMAL_TEMP_P (*to_p))
3481 /* Don't use the original target if it's a formal temp; we
3482 don't want to take their addresses. */
3484 else if (TREE_CODE (*expr_p) == INIT_EXPR)
3485 /* It's OK to use the target directly if it's being
3488 else if (!is_gimple_non_addressable (*to_p))
3489 /* Don't use the original target if it's already addressable;
3490 if its address escapes, and the called function uses the
3491 NRV optimization, a conforming program could see *to_p
3492 change before the called function returns; see c++/19317.
3493 When optimizing, the return_slot pass marks more functions
3494 as safe after we have escape info. */
3501 CALL_EXPR_RETURN_SLOT_OPT (*from_p) = 1;
3502 mark_addressable (*to_p);
3509 /* If we're initializing from a container, push the initialization
3511 case CLEANUP_POINT_EXPR:
3513 case STATEMENT_LIST:
3515 tree wrap = *from_p;
3518 ret = gimplify_expr (to_p, pre_p, post_p,
3519 is_gimple_min_lval, fb_lvalue);
3520 if (ret != GS_ERROR)
3523 t = voidify_wrapper_expr (wrap, *expr_p);
3524 gcc_assert (t == *expr_p);
3528 gimplify_and_add (wrap, pre_p);
3529 *expr_p = unshare_expr (*to_p);
3544 /* Destructively convert the TREE pointer in TP into a gimple tuple if
3548 tree_to_gimple_tuple (tree *tp)
3551 switch (TREE_CODE (*tp))
3553 case GIMPLE_MODIFY_STMT:
3557 struct gimple_stmt *gs;
3558 tree lhs = TREE_OPERAND (*tp, 0);
3559 bool def_stmt_self_p = false;
3561 if (TREE_CODE (lhs) == SSA_NAME)
3563 if (SSA_NAME_DEF_STMT (lhs) == *tp)
3564 def_stmt_self_p = true;
3567 gs = &make_node (GIMPLE_MODIFY_STMT)->gstmt;
3568 gs->base = (*tp)->base;
3569 /* The set to base above overwrites the CODE. */
3570 TREE_SET_CODE ((tree) gs, GIMPLE_MODIFY_STMT);
3572 gs->locus = EXPR_LOCUS (*tp);
3573 gs->operands[0] = TREE_OPERAND (*tp, 0);
3574 gs->operands[1] = TREE_OPERAND (*tp, 1);
3575 gs->block = TREE_BLOCK (*tp);
3578 /* If we re-gimplify a set to an SSA_NAME, we must change the
3579 SSA name's DEF_STMT link. */
3580 if (def_stmt_self_p)
3581 SSA_NAME_DEF_STMT (GIMPLE_STMT_OPERAND (*tp, 0)) = *tp;
3590 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
3591 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
3592 DECL_GIMPLE_REG_P set. */
3594 static enum gimplify_status
3595 gimplify_modify_expr_complex_part (tree *expr_p, tree *pre_p, bool want_value)
3597 enum tree_code code, ocode;
3598 tree lhs, rhs, new_rhs, other, realpart, imagpart;
3600 lhs = GENERIC_TREE_OPERAND (*expr_p, 0);
3601 rhs = GENERIC_TREE_OPERAND (*expr_p, 1);
3602 code = TREE_CODE (lhs);
3603 lhs = TREE_OPERAND (lhs, 0);
3605 ocode = code == REALPART_EXPR ? IMAGPART_EXPR : REALPART_EXPR;
3606 other = build1 (ocode, TREE_TYPE (rhs), lhs);
3607 other = get_formal_tmp_var (other, pre_p);
3609 realpart = code == REALPART_EXPR ? rhs : other;
3610 imagpart = code == REALPART_EXPR ? other : rhs;
3612 if (TREE_CONSTANT (realpart) && TREE_CONSTANT (imagpart))
3613 new_rhs = build_complex (TREE_TYPE (lhs), realpart, imagpart);
3615 new_rhs = build2 (COMPLEX_EXPR, TREE_TYPE (lhs), realpart, imagpart);
3617 GENERIC_TREE_OPERAND (*expr_p, 0) = lhs;
3618 GENERIC_TREE_OPERAND (*expr_p, 1) = new_rhs;
3622 tree_to_gimple_tuple (expr_p);
3624 append_to_statement_list (*expr_p, pre_p);
3631 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
3637 PRE_P points to the list where side effects that must happen before
3638 *EXPR_P should be stored.
3640 POST_P points to the list where side effects that must happen after
3641 *EXPR_P should be stored.
3643 WANT_VALUE is nonzero iff we want to use the value of this expression
3644 in another expression. */
3646 static enum gimplify_status
3647 gimplify_modify_expr (tree *expr_p, tree *pre_p, tree *post_p, bool want_value)
3649 tree *from_p = &GENERIC_TREE_OPERAND (*expr_p, 1);
3650 tree *to_p = &GENERIC_TREE_OPERAND (*expr_p, 0);
3651 enum gimplify_status ret = GS_UNHANDLED;
3653 gcc_assert (TREE_CODE (*expr_p) == MODIFY_EXPR
3654 || TREE_CODE (*expr_p) == GIMPLE_MODIFY_STMT
3655 || TREE_CODE (*expr_p) == INIT_EXPR);
3657 /* For zero sized types only gimplify the left hand side and right hand side
3658 as statements and throw away the assignment. */
3659 if (zero_sized_type (TREE_TYPE (*from_p)))
3661 gimplify_stmt (from_p);
3662 gimplify_stmt (to_p);
3663 append_to_statement_list (*from_p, pre_p);
3664 append_to_statement_list (*to_p, pre_p);
3665 *expr_p = NULL_TREE;
3669 /* See if any simplifications can be done based on what the RHS is. */
3670 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
3672 if (ret != GS_UNHANDLED)
3675 /* If the value being copied is of variable width, compute the length
3676 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
3677 before gimplifying any of the operands so that we can resolve any
3678 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
3679 the size of the expression to be copied, not of the destination, so
3680 that is what we must here. */
3681 maybe_with_size_expr (from_p);
3683 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
3684 if (ret == GS_ERROR)
3687 ret = gimplify_expr (from_p, pre_p, post_p,
3688 rhs_predicate_for (*to_p), fb_rvalue);
3689 if (ret == GS_ERROR)
3692 /* Now see if the above changed *from_p to something we handle specially. */
3693 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
3695 if (ret != GS_UNHANDLED)
3698 /* If we've got a variable sized assignment between two lvalues (i.e. does
3699 not involve a call), then we can make things a bit more straightforward
3700 by converting the assignment to memcpy or memset. */
3701 if (TREE_CODE (*from_p) == WITH_SIZE_EXPR)
3703 tree from = TREE_OPERAND (*from_p, 0);
3704 tree size = TREE_OPERAND (*from_p, 1);
3706 if (TREE_CODE (from) == CONSTRUCTOR)
3707 return gimplify_modify_expr_to_memset (expr_p, size, want_value);
3708 if (is_gimple_addressable (from))
3711 return gimplify_modify_expr_to_memcpy (expr_p, size, want_value);
3715 /* Transform partial stores to non-addressable complex variables into
3716 total stores. This allows us to use real instead of virtual operands
3717 for these variables, which improves optimization. */
3718 if ((TREE_CODE (*to_p) == REALPART_EXPR
3719 || TREE_CODE (*to_p) == IMAGPART_EXPR)
3720 && is_gimple_reg (TREE_OPERAND (*to_p, 0)))
3721 return gimplify_modify_expr_complex_part (expr_p, pre_p, want_value);
3723 if (gimplify_ctxp->into_ssa && is_gimple_reg (*to_p))
3725 /* If we've somehow already got an SSA_NAME on the LHS, then
3726 we're probably modified it twice. Not good. */
3727 gcc_assert (TREE_CODE (*to_p) != SSA_NAME);
3728 *to_p = make_ssa_name (*to_p, *expr_p);
3731 /* Try to alleviate the effects of the gimplification creating artificial
3732 temporaries (see for example is_gimple_reg_rhs) on the debug info. */
3733 if (!gimplify_ctxp->into_ssa
3734 && DECL_P (*from_p) && DECL_IGNORED_P (*from_p)
3735 && DECL_P (*to_p) && !DECL_IGNORED_P (*to_p))
3737 if (!DECL_NAME (*from_p) && DECL_NAME (*to_p))
3739 = create_tmp_var_name (IDENTIFIER_POINTER (DECL_NAME (*to_p)));
3740 DECL_DEBUG_EXPR_IS_FROM (*from_p) = 1;
3741 SET_DECL_DEBUG_EXPR (*from_p, *to_p);
3746 tree_to_gimple_tuple (expr_p);
3748 append_to_statement_list (*expr_p, pre_p);
3756 /* Gimplify a comparison between two variable-sized objects. Do this
3757 with a call to BUILT_IN_MEMCMP. */
3759 static enum gimplify_status
3760 gimplify_variable_sized_compare (tree *expr_p)
3762 tree op0 = TREE_OPERAND (*expr_p, 0);
3763 tree op1 = TREE_OPERAND (*expr_p, 1);
3764 tree t, arg, dest, src;
3766 arg = TYPE_SIZE_UNIT (TREE_TYPE (op0));
3767 arg = unshare_expr (arg);
3768 arg = SUBSTITUTE_PLACEHOLDER_IN_EXPR (arg, op0);
3769 src = build_fold_addr_expr (op1);
3770 dest = build_fold_addr_expr (op0);
3771 t = implicit_built_in_decls[BUILT_IN_MEMCMP];
3772 t = build_call_expr (t, 3, dest, src, arg);
3774 = build2 (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), t, integer_zero_node);
3779 /* Gimplify a comparison between two aggregate objects of integral scalar
3780 mode as a comparison between the bitwise equivalent scalar values. */
3782 static enum gimplify_status
3783 gimplify_scalar_mode_aggregate_compare (tree *expr_p)
3785 tree op0 = TREE_OPERAND (*expr_p, 0);
3786 tree op1 = TREE_OPERAND (*expr_p, 1);
3788 tree type = TREE_TYPE (op0);
3789 tree scalar_type = lang_hooks.types.type_for_mode (TYPE_MODE (type), 1);
3791 op0 = fold_build1 (VIEW_CONVERT_EXPR, scalar_type, op0);
3792 op1 = fold_build1 (VIEW_CONVERT_EXPR, scalar_type, op1);
3795 = fold_build2 (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), op0, op1);
3800 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
3801 points to the expression to gimplify.
3803 Expressions of the form 'a && b' are gimplified to:
3805 a && b ? true : false
3807 gimplify_cond_expr will do the rest.
3809 PRE_P points to the list where side effects that must happen before
3810 *EXPR_P should be stored. */
3812 static enum gimplify_status
3813 gimplify_boolean_expr (tree *expr_p)
3815 /* Preserve the original type of the expression. */
3816 tree type = TREE_TYPE (*expr_p);
3818 *expr_p = build3 (COND_EXPR, type, *expr_p,
3819 fold_convert (type, boolean_true_node),
3820 fold_convert (type, boolean_false_node));
3825 /* Gimplifies an expression sequence. This function gimplifies each
3826 expression and re-writes the original expression with the last
3827 expression of the sequence in GIMPLE form.
3829 PRE_P points to the list where the side effects for all the
3830 expressions in the sequence will be emitted.
3832 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
3833 /* ??? Should rearrange to share the pre-queue with all the indirect
3834 invocations of gimplify_expr. Would probably save on creations
3835 of statement_list nodes. */
3837 static enum gimplify_status
3838 gimplify_compound_expr (tree *expr_p, tree *pre_p, bool want_value)
3844 tree *sub_p = &TREE_OPERAND (t, 0);
3846 if (TREE_CODE (*sub_p) == COMPOUND_EXPR)
3847 gimplify_compound_expr (sub_p, pre_p, false);
3849 gimplify_stmt (sub_p);
3850 append_to_statement_list (*sub_p, pre_p);
3852 t = TREE_OPERAND (t, 1);
3854 while (TREE_CODE (t) == COMPOUND_EXPR);
3861 gimplify_stmt (expr_p);
3866 /* Gimplifies a statement list. These may be created either by an
3867 enlightened front-end, or by shortcut_cond_expr. */
3869 static enum gimplify_status
3870 gimplify_statement_list (tree *expr_p, tree *pre_p)
3872 tree temp = voidify_wrapper_expr (*expr_p, NULL);
3874 tree_stmt_iterator i = tsi_start (*expr_p);
3876 while (!tsi_end_p (i))
3880 gimplify_stmt (tsi_stmt_ptr (i));
3885 else if (TREE_CODE (t) == STATEMENT_LIST)
3887 tsi_link_before (&i, t, TSI_SAME_STMT);
3896 append_to_statement_list (*expr_p, pre_p);
3904 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
3905 gimplify. After gimplification, EXPR_P will point to a new temporary
3906 that holds the original value of the SAVE_EXPR node.
3908 PRE_P points to the list where side effects that must happen before
3909 *EXPR_P should be stored. */
3911 static enum gimplify_status
3912 gimplify_save_expr (tree *expr_p, tree *pre_p, tree *post_p)
3914 enum gimplify_status ret = GS_ALL_DONE;
3917 gcc_assert (TREE_CODE (*expr_p) == SAVE_EXPR);
3918 val = TREE_OPERAND (*expr_p, 0);
3920 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
3921 if (!SAVE_EXPR_RESOLVED_P (*expr_p))
3923 /* The operand may be a void-valued expression such as SAVE_EXPRs
3924 generated by the Java frontend for class initialization. It is
3925 being executed only for its side-effects. */
3926 if (TREE_TYPE (val) == void_type_node)
3928 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3929 is_gimple_stmt, fb_none);
3930 append_to_statement_list (TREE_OPERAND (*expr_p, 0), pre_p);
3934 val = get_initialized_tmp_var (val, pre_p, post_p);
3936 TREE_OPERAND (*expr_p, 0) = val;
3937 SAVE_EXPR_RESOLVED_P (*expr_p) = 1;
3945 /* Re-write the ADDR_EXPR node pointed to by EXPR_P
3952 PRE_P points to the list where side effects that must happen before
3953 *EXPR_P should be stored.
3955 POST_P points to the list where side effects that must happen after
3956 *EXPR_P should be stored. */
3958 static enum gimplify_status
3959 gimplify_addr_expr (tree *expr_p, tree *pre_p, tree *post_p)
3961 tree expr = *expr_p;
3962 tree op0 = TREE_OPERAND (expr, 0);
3963 enum gimplify_status ret;
3965 switch (TREE_CODE (op0))
3968 case MISALIGNED_INDIRECT_REF:
3970 /* Check if we are dealing with an expression of the form '&*ptr'.
3971 While the front end folds away '&*ptr' into 'ptr', these
3972 expressions may be generated internally by the compiler (e.g.,
3973 builtins like __builtin_va_end). */
3974 /* Caution: the silent array decomposition semantics we allow for
3975 ADDR_EXPR means we can't always discard the pair. */
3976 /* Gimplification of the ADDR_EXPR operand may drop
3977 cv-qualification conversions, so make sure we add them if
3980 tree op00 = TREE_OPERAND (op0, 0);
3981 tree t_expr = TREE_TYPE (expr);
3982 tree t_op00 = TREE_TYPE (op00);
3984 if (!useless_type_conversion_p (t_expr, t_op00))
3986 #ifdef ENABLE_CHECKING
3987 tree t_op0 = TREE_TYPE (op0);
3988 gcc_assert (POINTER_TYPE_P (t_expr)
3989 && (cpt_same_type (TREE_TYPE (t_expr), t_op0)
3990 || (TREE_CODE (t_op0) == ARRAY_TYPE
3991 && cpt_same_type (TREE_TYPE (t_expr),
3992 TREE_TYPE (t_op0))))
3993 && POINTER_TYPE_P (t_op00)
3994 && cpt_same_type (t_op0, TREE_TYPE (t_op00)));
3996 op00 = fold_convert (TREE_TYPE (expr), op00);
4003 case VIEW_CONVERT_EXPR:
4004 /* Take the address of our operand and then convert it to the type of
4007 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
4008 all clear. The impact of this transformation is even less clear. */
4010 /* If the operand is a useless conversion, look through it. Doing so
4011 guarantees that the ADDR_EXPR and its operand will remain of the
4013 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0, 0)))
4014 op0 = TREE_OPERAND (op0, 0);
4016 *expr_p = fold_convert (TREE_TYPE (expr),
4017 build_fold_addr_expr (TREE_OPERAND (op0, 0)));
4022 /* We use fb_either here because the C frontend sometimes takes
4023 the address of a call that returns a struct; see
4024 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
4025 the implied temporary explicit. */
4027 /* Mark the RHS addressable. */
4028 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, post_p,
4029 is_gimple_addressable, fb_either);
4030 if (ret != GS_ERROR)
4032 op0 = TREE_OPERAND (expr, 0);
4034 /* For various reasons, the gimplification of the expression
4035 may have made a new INDIRECT_REF. */
4036 if (TREE_CODE (op0) == INDIRECT_REF)
4037 goto do_indirect_ref;
4039 /* Make sure TREE_INVARIANT, TREE_CONSTANT, and TREE_SIDE_EFFECTS
4041 recompute_tree_invariant_for_addr_expr (expr);
4043 mark_addressable (TREE_OPERAND (expr, 0));
4051 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
4052 value; output operands should be a gimple lvalue. */
4054 static enum gimplify_status
4055 gimplify_asm_expr (tree *expr_p, tree *pre_p, tree *post_p)
4057 tree expr = *expr_p;
4058 int noutputs = list_length (ASM_OUTPUTS (expr));
4059 const char **oconstraints
4060 = (const char **) alloca ((noutputs) * sizeof (const char *));
4063 const char *constraint;
4064 bool allows_mem, allows_reg, is_inout;
4065 enum gimplify_status ret, tret;
4068 for (i = 0, link = ASM_OUTPUTS (expr); link; ++i, link = TREE_CHAIN (link))
4070 size_t constraint_len;
4071 oconstraints[i] = constraint
4072 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4073 constraint_len = strlen (constraint);
4074 if (constraint_len == 0)
4077 parse_output_constraint (&constraint, i, 0, 0,
4078 &allows_mem, &allows_reg, &is_inout);
4080 if (!allows_reg && allows_mem)
4081 mark_addressable (TREE_VALUE (link));
4083 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4084 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
4085 fb_lvalue | fb_mayfail);
4086 if (tret == GS_ERROR)
4088 error ("invalid lvalue in asm output %d", i);
4094 /* An input/output operand. To give the optimizers more
4095 flexibility, split it into separate input and output
4100 /* Turn the in/out constraint into an output constraint. */
4101 char *p = xstrdup (constraint);
4103 TREE_VALUE (TREE_PURPOSE (link)) = build_string (constraint_len, p);
4105 /* And add a matching input constraint. */
4108 sprintf (buf, "%d", i);
4110 /* If there are multiple alternatives in the constraint,
4111 handle each of them individually. Those that allow register
4112 will be replaced with operand number, the others will stay
4114 if (strchr (p, ',') != NULL)
4116 size_t len = 0, buflen = strlen (buf);
4117 char *beg, *end, *str, *dst;
4121 end = strchr (beg, ',');
4123 end = strchr (beg, '\0');
4124 if ((size_t) (end - beg) < buflen)
4127 len += end - beg + 1;
4134 str = (char *) alloca (len);
4135 for (beg = p + 1, dst = str;;)
4138 bool mem_p, reg_p, inout_p;
4140 end = strchr (beg, ',');
4145 parse_output_constraint (&tem, i, 0, 0,
4146 &mem_p, ®_p, &inout_p);
4151 memcpy (dst, buf, buflen);
4160 memcpy (dst, beg, len);
4169 input = build_string (dst - str, str);
4172 input = build_string (strlen (buf), buf);
4175 input = build_string (constraint_len - 1, constraint + 1);
4179 input = build_tree_list (build_tree_list (NULL_TREE, input),
4180 unshare_expr (TREE_VALUE (link)));
4181 ASM_INPUTS (expr) = chainon (ASM_INPUTS (expr), input);
4185 for (link = ASM_INPUTS (expr); link; ++i, link = TREE_CHAIN (link))
4188 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4189 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
4190 oconstraints, &allows_mem, &allows_reg);
4192 /* If we can't make copies, we can only accept memory. */
4193 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (link))))
4199 error ("impossible constraint in %<asm%>");
4200 error ("non-memory input %d must stay in memory", i);
4205 /* If the operand is a memory input, it should be an lvalue. */
4206 if (!allows_reg && allows_mem)
4208 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4209 is_gimple_lvalue, fb_lvalue | fb_mayfail);
4210 mark_addressable (TREE_VALUE (link));
4211 if (tret == GS_ERROR)
4213 error ("memory input %d is not directly addressable", i);
4219 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4220 is_gimple_asm_val, fb_rvalue);
4221 if (tret == GS_ERROR)
4229 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
4230 WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
4231 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
4232 return to this function.
4234 FIXME should we complexify the prequeue handling instead? Or use flags
4235 for all the cleanups and let the optimizer tighten them up? The current
4236 code seems pretty fragile; it will break on a cleanup within any
4237 non-conditional nesting. But any such nesting would be broken, anyway;
4238 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
4239 and continues out of it. We can do that at the RTL level, though, so
4240 having an optimizer to tighten up try/finally regions would be a Good
4243 static enum gimplify_status
4244 gimplify_cleanup_point_expr (tree *expr_p, tree *pre_p)
4246 tree_stmt_iterator iter;
4249 tree temp = voidify_wrapper_expr (*expr_p, NULL);
4251 /* We only care about the number of conditions between the innermost
4252 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
4253 any cleanups collected outside the CLEANUP_POINT_EXPR. */
4254 int old_conds = gimplify_ctxp->conditions;
4255 tree old_cleanups = gimplify_ctxp->conditional_cleanups;
4256 gimplify_ctxp->conditions = 0;
4257 gimplify_ctxp->conditional_cleanups = NULL_TREE;
4259 body = TREE_OPERAND (*expr_p, 0);
4260 gimplify_to_stmt_list (&body);
4262 gimplify_ctxp->conditions = old_conds;
4263 gimplify_ctxp->conditional_cleanups = old_cleanups;
4265 for (iter = tsi_start (body); !tsi_end_p (iter); )
4267 tree *wce_p = tsi_stmt_ptr (iter);
4270 if (TREE_CODE (wce) == WITH_CLEANUP_EXPR)
4272 if (tsi_one_before_end_p (iter))
4274 tsi_link_before (&iter, TREE_OPERAND (wce, 0), TSI_SAME_STMT);
4281 enum tree_code code;
4283 if (CLEANUP_EH_ONLY (wce))
4284 code = TRY_CATCH_EXPR;
4286 code = TRY_FINALLY_EXPR;
4288 sl = tsi_split_statement_list_after (&iter);
4289 tfe = build2 (code, void_type_node, sl, NULL_TREE);
4290 append_to_statement_list (TREE_OPERAND (wce, 0),
4291 &TREE_OPERAND (tfe, 1));
4293 iter = tsi_start (sl);
4303 append_to_statement_list (body, pre_p);
4313 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
4314 is the cleanup action required. */
4317 gimple_push_cleanup (tree var, tree cleanup, bool eh_only, tree *pre_p)
4321 /* Errors can result in improperly nested cleanups. Which results in
4322 confusion when trying to resolve the WITH_CLEANUP_EXPR. */
4323 if (errorcount || sorrycount)
4326 if (gimple_conditional_context ())
4328 /* If we're in a conditional context, this is more complex. We only
4329 want to run the cleanup if we actually ran the initialization that
4330 necessitates it, but we want to run it after the end of the
4331 conditional context. So we wrap the try/finally around the
4332 condition and use a flag to determine whether or not to actually
4333 run the destructor. Thus
4337 becomes (approximately)
4341 if (test) { A::A(temp); flag = 1; val = f(temp); }
4344 if (flag) A::~A(temp);
4349 tree flag = create_tmp_var (boolean_type_node, "cleanup");
4350 tree ffalse = build_gimple_modify_stmt (flag, boolean_false_node);
4351 tree ftrue = build_gimple_modify_stmt (flag, boolean_true_node);
4352 cleanup = build3 (COND_EXPR, void_type_node, flag, cleanup, NULL);
4353 wce = build1 (WITH_CLEANUP_EXPR, void_type_node, cleanup);
4354 append_to_statement_list (ffalse, &gimplify_ctxp->conditional_cleanups);
4355 append_to_statement_list (wce, &gimplify_ctxp->conditional_cleanups);
4356 append_to_statement_list (ftrue, pre_p);
4358 /* Because of this manipulation, and the EH edges that jump
4359 threading cannot redirect, the temporary (VAR) will appear
4360 to be used uninitialized. Don't warn. */
4361 TREE_NO_WARNING (var) = 1;
4365 wce = build1 (WITH_CLEANUP_EXPR, void_type_node, cleanup);
4366 CLEANUP_EH_ONLY (wce) = eh_only;
4367 append_to_statement_list (wce, pre_p);
4370 gimplify_stmt (&TREE_OPERAND (wce, 0));
4373 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
4375 static enum gimplify_status
4376 gimplify_target_expr (tree *expr_p, tree *pre_p, tree *post_p)
4378 tree targ = *expr_p;
4379 tree temp = TARGET_EXPR_SLOT (targ);
4380 tree init = TARGET_EXPR_INITIAL (targ);
4381 enum gimplify_status ret;
4385 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
4386 to the temps list. */
4387 gimple_add_tmp_var (temp);
4389 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
4390 expression is supposed to initialize the slot. */
4391 if (VOID_TYPE_P (TREE_TYPE (init)))
4392 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
4395 init = build2 (INIT_EXPR, void_type_node, temp, init);
4396 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt,
4399 if (ret == GS_ERROR)
4401 /* PR c++/28266 Make sure this is expanded only once. */
4402 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
4405 append_to_statement_list (init, pre_p);
4407 /* If needed, push the cleanup for the temp. */
4408 if (TARGET_EXPR_CLEANUP (targ))
4410 gimplify_stmt (&TARGET_EXPR_CLEANUP (targ));
4411 gimple_push_cleanup (temp, TARGET_EXPR_CLEANUP (targ),
4412 CLEANUP_EH_ONLY (targ), pre_p);
4415 /* Only expand this once. */
4416 TREE_OPERAND (targ, 3) = init;
4417 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
4420 /* We should have expanded this before. */
4421 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp));
4427 /* Gimplification of expression trees. */
4429 /* Gimplify an expression which appears at statement context; usually, this
4430 means replacing it with a suitably gimple STATEMENT_LIST. */
4433 gimplify_stmt (tree *stmt_p)
4435 gimplify_expr (stmt_p, NULL, NULL, is_gimple_stmt, fb_none);
4438 /* Similarly, but force the result to be a STATEMENT_LIST. */
4441 gimplify_to_stmt_list (tree *stmt_p)
4443 gimplify_stmt (stmt_p);
4445 *stmt_p = alloc_stmt_list ();
4446 else if (TREE_CODE (*stmt_p) != STATEMENT_LIST)
4449 *stmt_p = alloc_stmt_list ();
4450 append_to_statement_list (t, stmt_p);
4455 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
4456 to CTX. If entries already exist, force them to be some flavor of private.
4457 If there is no enclosing parallel, do nothing. */
4460 omp_firstprivatize_variable (struct gimplify_omp_ctx *ctx, tree decl)
4464 if (decl == NULL || !DECL_P (decl))
4469 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4472 if (n->value & GOVD_SHARED)
4473 n->value = GOVD_FIRSTPRIVATE | (n->value & GOVD_SEEN);
4477 else if (ctx->is_parallel)
4478 omp_add_variable (ctx, decl, GOVD_FIRSTPRIVATE);
4480 ctx = ctx->outer_context;
4485 /* Similarly for each of the type sizes of TYPE. */
4488 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx *ctx, tree type)
4490 if (type == NULL || type == error_mark_node)
4492 type = TYPE_MAIN_VARIANT (type);
4494 if (pointer_set_insert (ctx->privatized_types, type))
4497 switch (TREE_CODE (type))
4503 omp_firstprivatize_variable (ctx, TYPE_MIN_VALUE (type));
4504 omp_firstprivatize_variable (ctx, TYPE_MAX_VALUE (type));
4508 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
4509 omp_firstprivatize_type_sizes (ctx, TYPE_DOMAIN (type));
4514 case QUAL_UNION_TYPE:
4517 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
4518 if (TREE_CODE (field) == FIELD_DECL)
4520 omp_firstprivatize_variable (ctx, DECL_FIELD_OFFSET (field));
4521 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (field));
4527 case REFERENCE_TYPE:
4528 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
4535 omp_firstprivatize_variable (ctx, TYPE_SIZE (type));
4536 omp_firstprivatize_variable (ctx, TYPE_SIZE_UNIT (type));
4537 lang_hooks.types.omp_firstprivatize_type_sizes (ctx, type);
4540 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
4543 omp_add_variable (struct gimplify_omp_ctx *ctx, tree decl, unsigned int flags)
4546 unsigned int nflags;
4549 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
4552 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
4553 there are constructors involved somewhere. */
4554 if (TREE_ADDRESSABLE (TREE_TYPE (decl))
4555 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
4558 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4561 /* We shouldn't be re-adding the decl with the same data
4563 gcc_assert ((n->value & GOVD_DATA_SHARE_CLASS & flags) == 0);
4564 /* The only combination of data sharing classes we should see is
4565 FIRSTPRIVATE and LASTPRIVATE. */
4566 nflags = n->value | flags;
4567 gcc_assert ((nflags & GOVD_DATA_SHARE_CLASS)
4568 == (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE));
4573 /* When adding a variable-sized variable, we have to handle all sorts
4574 of additional bits of data: the pointer replacement variable, and
4575 the parameters of the type. */
4576 if (DECL_SIZE (decl) && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
4578 /* Add the pointer replacement variable as PRIVATE if the variable
4579 replacement is private, else FIRSTPRIVATE since we'll need the
4580 address of the original variable either for SHARED, or for the
4581 copy into or out of the context. */
4582 if (!(flags & GOVD_LOCAL))
4584 nflags = flags & GOVD_PRIVATE ? GOVD_PRIVATE : GOVD_FIRSTPRIVATE;
4585 nflags |= flags & GOVD_SEEN;
4586 t = DECL_VALUE_EXPR (decl);
4587 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
4588 t = TREE_OPERAND (t, 0);
4589 gcc_assert (DECL_P (t));
4590 omp_add_variable (ctx, t, nflags);
4593 /* Add all of the variable and type parameters (which should have
4594 been gimplified to a formal temporary) as FIRSTPRIVATE. */
4595 omp_firstprivatize_variable (ctx, DECL_SIZE_UNIT (decl));
4596 omp_firstprivatize_variable (ctx, DECL_SIZE (decl));
4597 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
4599 /* The variable-sized variable itself is never SHARED, only some form
4600 of PRIVATE. The sharing would take place via the pointer variable
4601 which we remapped above. */
4602 if (flags & GOVD_SHARED)
4603 flags = GOVD_PRIVATE | GOVD_DEBUG_PRIVATE
4604 | (flags & (GOVD_SEEN | GOVD_EXPLICIT));
4606 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
4607 alloca statement we generate for the variable, so make sure it
4608 is available. This isn't automatically needed for the SHARED
4609 case, since we won't be allocating local storage then.
4610 For local variables TYPE_SIZE_UNIT might not be gimplified yet,
4611 in this case omp_notice_variable will be called later
4612 on when it is gimplified. */
4613 else if (! (flags & GOVD_LOCAL))
4614 omp_notice_variable (ctx, TYPE_SIZE_UNIT (TREE_TYPE (decl)), true);
4616 else if (lang_hooks.decls.omp_privatize_by_reference (decl))
4618 gcc_assert ((flags & GOVD_LOCAL) == 0);
4619 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
4621 /* Similar to the direct variable sized case above, we'll need the
4622 size of references being privatized. */
4623 if ((flags & GOVD_SHARED) == 0)
4625 t = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl)));
4626 if (TREE_CODE (t) != INTEGER_CST)
4627 omp_notice_variable (ctx, t, true);
4631 splay_tree_insert (ctx->variables, (splay_tree_key)decl, flags);
4634 /* Record the fact that DECL was used within the OpenMP context CTX.
4635 IN_CODE is true when real code uses DECL, and false when we should
4636 merely emit default(none) errors. Return true if DECL is going to
4637 be remapped and thus DECL shouldn't be gimplified into its
4638 DECL_VALUE_EXPR (if any). */
4641 omp_notice_variable (struct gimplify_omp_ctx *ctx, tree decl, bool in_code)
4644 unsigned flags = in_code ? GOVD_SEEN : 0;
4645 bool ret = false, shared;
4647 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
4650 /* Threadprivate variables are predetermined. */
4651 if (is_global_var (decl))
4653 if (DECL_THREAD_LOCAL_P (decl))
4656 if (DECL_HAS_VALUE_EXPR_P (decl))
4658 tree value = get_base_address (DECL_VALUE_EXPR (decl));
4660 if (value && DECL_P (value) && DECL_THREAD_LOCAL_P (value))
4665 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4668 enum omp_clause_default_kind default_kind, kind;
4670 if (!ctx->is_parallel)
4673 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
4674 remapped firstprivate instead of shared. To some extent this is
4675 addressed in omp_firstprivatize_type_sizes, but not effectively. */
4676 default_kind = ctx->default_kind;
4677 kind = lang_hooks.decls.omp_predetermined_sharing (decl);
4678 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
4679 default_kind = kind;
4681 switch (default_kind)
4683 case OMP_CLAUSE_DEFAULT_NONE:
4684 error ("%qs not specified in enclosing parallel",
4685 IDENTIFIER_POINTER (DECL_NAME (decl)));
4686 error ("%Henclosing parallel", &ctx->location);
4688 case OMP_CLAUSE_DEFAULT_SHARED:
4689 flags |= GOVD_SHARED;
4691 case OMP_CLAUSE_DEFAULT_PRIVATE:
4692 flags |= GOVD_PRIVATE;
4698 omp_add_variable (ctx, decl, flags);
4700 shared = (flags & GOVD_SHARED) != 0;
4701 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
4705 shared = ((flags | n->value) & GOVD_SHARED) != 0;
4706 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
4708 /* If nothing changed, there's nothing left to do. */
4709 if ((n->value & flags) == flags)
4715 /* If the variable is private in the current context, then we don't
4716 need to propagate anything to an outer context. */
4717 if (flags & GOVD_PRIVATE)
4719 if (ctx->outer_context
4720 && omp_notice_variable (ctx->outer_context, decl, in_code))
4725 /* Verify that DECL is private within CTX. If there's specific information
4726 to the contrary in the innermost scope, generate an error. */
4729 omp_is_private (struct gimplify_omp_ctx *ctx, tree decl)
4733 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4736 if (n->value & GOVD_SHARED)
4738 if (ctx == gimplify_omp_ctxp)
4740 error ("iteration variable %qs should be private",
4741 IDENTIFIER_POINTER (DECL_NAME (decl)));
4742 n->value = GOVD_PRIVATE;
4748 else if ((n->value & GOVD_EXPLICIT) != 0
4749 && (ctx == gimplify_omp_ctxp
4750 || (ctx->is_combined_parallel
4751 && gimplify_omp_ctxp->outer_context == ctx)))
4753 if ((n->value & GOVD_FIRSTPRIVATE) != 0)
4754 error ("iteration variable %qs should not be firstprivate",
4755 IDENTIFIER_POINTER (DECL_NAME (decl)));
4756 else if ((n->value & GOVD_REDUCTION) != 0)
4757 error ("iteration variable %qs should not be reduction",
4758 IDENTIFIER_POINTER (DECL_NAME (decl)));
4763 if (ctx->is_parallel)
4765 else if (ctx->outer_context)
4766 return omp_is_private (ctx->outer_context, decl);
4768 return !is_global_var (decl);
4771 /* Return true if DECL is private within a parallel region
4772 that binds to the current construct's context or in parallel
4773 region's REDUCTION clause. */
4776 omp_check_private (struct gimplify_omp_ctx *ctx, tree decl)
4782 ctx = ctx->outer_context;
4784 return !(is_global_var (decl)
4785 /* References might be private, but might be shared too. */
4786 || lang_hooks.decls.omp_privatize_by_reference (decl));
4788 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
4790 return (n->value & GOVD_SHARED) == 0;
4792 while (!ctx->is_parallel);
4796 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
4797 and previous omp contexts. */
4800 gimplify_scan_omp_clauses (tree *list_p, tree *pre_p, bool in_parallel,
4801 bool in_combined_parallel)
4803 struct gimplify_omp_ctx *ctx, *outer_ctx;
4806 ctx = new_omp_context (in_parallel, in_combined_parallel);
4807 outer_ctx = ctx->outer_context;
4809 while ((c = *list_p) != NULL)
4811 enum gimplify_status gs;
4812 bool remove = false;
4813 bool notice_outer = true;
4814 const char *check_non_private = NULL;
4818 switch (OMP_CLAUSE_CODE (c))
4820 case OMP_CLAUSE_PRIVATE:
4821 flags = GOVD_PRIVATE | GOVD_EXPLICIT;
4822 notice_outer = false;
4824 case OMP_CLAUSE_SHARED:
4825 flags = GOVD_SHARED | GOVD_EXPLICIT;
4827 case OMP_CLAUSE_FIRSTPRIVATE:
4828 flags = GOVD_FIRSTPRIVATE | GOVD_EXPLICIT;
4829 check_non_private = "firstprivate";
4831 case OMP_CLAUSE_LASTPRIVATE:
4832 flags = GOVD_LASTPRIVATE | GOVD_SEEN | GOVD_EXPLICIT;
4833 check_non_private = "lastprivate";
4835 case OMP_CLAUSE_REDUCTION:
4836 flags = GOVD_REDUCTION | GOVD_SEEN | GOVD_EXPLICIT;
4837 check_non_private = "reduction";
4841 decl = OMP_CLAUSE_DECL (c);
4842 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
4847 omp_add_variable (ctx, decl, flags);
4848 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION
4849 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c))
4851 omp_add_variable (ctx, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c),
4852 GOVD_LOCAL | GOVD_SEEN);
4853 gimplify_omp_ctxp = ctx;
4854 push_gimplify_context ();
4855 gimplify_stmt (&OMP_CLAUSE_REDUCTION_INIT (c));
4856 pop_gimplify_context (OMP_CLAUSE_REDUCTION_INIT (c));
4857 push_gimplify_context ();
4858 gimplify_stmt (&OMP_CLAUSE_REDUCTION_MERGE (c));
4859 pop_gimplify_context (OMP_CLAUSE_REDUCTION_MERGE (c));
4860 gimplify_omp_ctxp = outer_ctx;
4866 case OMP_CLAUSE_COPYIN:
4867 case OMP_CLAUSE_COPYPRIVATE:
4868 decl = OMP_CLAUSE_DECL (c);
4869 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
4876 omp_notice_variable (outer_ctx, decl, true);
4877 if (check_non_private
4879 && omp_check_private (ctx, decl))
4881 error ("%s variable %qs is private in outer context",
4882 check_non_private, IDENTIFIER_POINTER (DECL_NAME (decl)));
4888 OMP_CLAUSE_OPERAND (c, 0)
4889 = gimple_boolify (OMP_CLAUSE_OPERAND (c, 0));
4892 case OMP_CLAUSE_SCHEDULE:
4893 case OMP_CLAUSE_NUM_THREADS:
4894 gs = gimplify_expr (&OMP_CLAUSE_OPERAND (c, 0), pre_p, NULL,
4895 is_gimple_val, fb_rvalue);
4900 case OMP_CLAUSE_NOWAIT:
4901 case OMP_CLAUSE_ORDERED:
4904 case OMP_CLAUSE_DEFAULT:
4905 ctx->default_kind = OMP_CLAUSE_DEFAULT_KIND (c);
4913 *list_p = OMP_CLAUSE_CHAIN (c);
4915 list_p = &OMP_CLAUSE_CHAIN (c);
4918 gimplify_omp_ctxp = ctx;
4921 /* For all variables that were not actually used within the context,
4922 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
4925 gimplify_adjust_omp_clauses_1 (splay_tree_node n, void *data)
4927 tree *list_p = (tree *) data;
4928 tree decl = (tree) n->key;
4929 unsigned flags = n->value;
4930 enum omp_clause_code code;
4934 if (flags & (GOVD_EXPLICIT | GOVD_LOCAL))
4936 if ((flags & GOVD_SEEN) == 0)
4938 if (flags & GOVD_DEBUG_PRIVATE)
4940 gcc_assert ((flags & GOVD_DATA_SHARE_CLASS) == GOVD_PRIVATE);
4941 private_debug = true;
4945 = lang_hooks.decls.omp_private_debug_clause (decl,
4946 !!(flags & GOVD_SHARED));
4948 code = OMP_CLAUSE_PRIVATE;
4949 else if (flags & GOVD_SHARED)
4951 if (is_global_var (decl))
4953 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp->outer_context;
4957 = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
4958 if (on && (on->value & (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE
4959 | GOVD_PRIVATE | GOVD_REDUCTION)) != 0)
4961 ctx = ctx->outer_context;
4966 code = OMP_CLAUSE_SHARED;
4968 else if (flags & GOVD_PRIVATE)
4969 code = OMP_CLAUSE_PRIVATE;
4970 else if (flags & GOVD_FIRSTPRIVATE)
4971 code = OMP_CLAUSE_FIRSTPRIVATE;
4975 clause = build_omp_clause (code);
4976 OMP_CLAUSE_DECL (clause) = decl;
4977 OMP_CLAUSE_CHAIN (clause) = *list_p;
4979 OMP_CLAUSE_PRIVATE_DEBUG (clause) = 1;
4986 gimplify_adjust_omp_clauses (tree *list_p)
4988 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
4991 while ((c = *list_p) != NULL)
4994 bool remove = false;
4996 switch (OMP_CLAUSE_CODE (c))
4998 case OMP_CLAUSE_PRIVATE:
4999 case OMP_CLAUSE_SHARED:
5000 case OMP_CLAUSE_FIRSTPRIVATE:
5001 decl = OMP_CLAUSE_DECL (c);
5002 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5003 remove = !(n->value & GOVD_SEEN);
5006 bool shared = OMP_CLAUSE_CODE (c) == OMP_CLAUSE_SHARED;
5007 if ((n->value & GOVD_DEBUG_PRIVATE)
5008 || lang_hooks.decls.omp_private_debug_clause (decl, shared))
5010 gcc_assert ((n->value & GOVD_DEBUG_PRIVATE) == 0
5011 || ((n->value & GOVD_DATA_SHARE_CLASS)
5013 OMP_CLAUSE_SET_CODE (c, OMP_CLAUSE_PRIVATE);
5014 OMP_CLAUSE_PRIVATE_DEBUG (c) = 1;
5019 case OMP_CLAUSE_LASTPRIVATE:
5020 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
5021 accurately reflect the presence of a FIRSTPRIVATE clause. */
5022 decl = OMP_CLAUSE_DECL (c);
5023 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5024 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)
5025 = (n->value & GOVD_FIRSTPRIVATE) != 0;
5028 case OMP_CLAUSE_REDUCTION:
5029 case OMP_CLAUSE_COPYIN:
5030 case OMP_CLAUSE_COPYPRIVATE:
5032 case OMP_CLAUSE_NUM_THREADS:
5033 case OMP_CLAUSE_SCHEDULE:
5034 case OMP_CLAUSE_NOWAIT:
5035 case OMP_CLAUSE_ORDERED:
5036 case OMP_CLAUSE_DEFAULT:
5044 *list_p = OMP_CLAUSE_CHAIN (c);
5046 list_p = &OMP_CLAUSE_CHAIN (c);
5049 /* Add in any implicit data sharing. */
5050 splay_tree_foreach (ctx->variables, gimplify_adjust_omp_clauses_1, list_p);
5052 gimplify_omp_ctxp = ctx->outer_context;
5053 delete_omp_context (ctx);
5056 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
5057 gimplification of the body, as well as scanning the body for used
5058 variables. We need to do this scan now, because variable-sized
5059 decls will be decomposed during gimplification. */
5061 static enum gimplify_status
5062 gimplify_omp_parallel (tree *expr_p, tree *pre_p)
5064 tree expr = *expr_p;
5066 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr), pre_p, true,
5067 OMP_PARALLEL_COMBINED (expr));
5069 push_gimplify_context ();
5071 gimplify_stmt (&OMP_PARALLEL_BODY (expr));
5073 if (TREE_CODE (OMP_PARALLEL_BODY (expr)) == BIND_EXPR)
5074 pop_gimplify_context (OMP_PARALLEL_BODY (expr));
5076 pop_gimplify_context (NULL_TREE);
5078 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr));
5083 /* Gimplify the gross structure of an OMP_FOR statement. */
5085 static enum gimplify_status
5086 gimplify_omp_for (tree *expr_p, tree *pre_p)
5088 tree for_stmt, decl, t;
5089 enum gimplify_status ret = GS_OK;
5093 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt), pre_p, false, false);
5095 t = OMP_FOR_INIT (for_stmt);
5096 gcc_assert (TREE_CODE (t) == MODIFY_EXPR
5097 || TREE_CODE (t) == GIMPLE_MODIFY_STMT);
5098 decl = GENERIC_TREE_OPERAND (t, 0);
5099 gcc_assert (DECL_P (decl));
5100 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl)));
5102 /* Make sure the iteration variable is private. */
5103 if (omp_is_private (gimplify_omp_ctxp, decl))
5104 omp_notice_variable (gimplify_omp_ctxp, decl, true);
5106 omp_add_variable (gimplify_omp_ctxp, decl, GOVD_PRIVATE | GOVD_SEEN);
5108 ret |= gimplify_expr (&GENERIC_TREE_OPERAND (t, 1),
5109 &OMP_FOR_PRE_BODY (for_stmt),
5110 NULL, is_gimple_val, fb_rvalue);
5112 tree_to_gimple_tuple (&OMP_FOR_INIT (for_stmt));
5114 t = OMP_FOR_COND (for_stmt);
5115 gcc_assert (COMPARISON_CLASS_P (t));
5116 gcc_assert (GENERIC_TREE_OPERAND (t, 0) == decl);
5118 ret |= gimplify_expr (&GENERIC_TREE_OPERAND (t, 1),
5119 &OMP_FOR_PRE_BODY (for_stmt),
5120 NULL, is_gimple_val, fb_rvalue);
5122 tree_to_gimple_tuple (&OMP_FOR_INCR (for_stmt));
5123 t = OMP_FOR_INCR (for_stmt);
5124 switch (TREE_CODE (t))
5126 case PREINCREMENT_EXPR:
5127 case POSTINCREMENT_EXPR:
5128 t = build_int_cst (TREE_TYPE (decl), 1);
5129 t = build2 (PLUS_EXPR, TREE_TYPE (decl), decl, t);
5130 t = build_gimple_modify_stmt (decl, t);
5131 OMP_FOR_INCR (for_stmt) = t;
5134 case PREDECREMENT_EXPR:
5135 case POSTDECREMENT_EXPR:
5136 t = build_int_cst (TREE_TYPE (decl), -1);
5137 t = build2 (PLUS_EXPR, TREE_TYPE (decl), decl, t);
5138 t = build_gimple_modify_stmt (decl, t);
5139 OMP_FOR_INCR (for_stmt) = t;
5142 case GIMPLE_MODIFY_STMT:
5143 gcc_assert (GIMPLE_STMT_OPERAND (t, 0) == decl);
5144 t = GIMPLE_STMT_OPERAND (t, 1);
5145 switch (TREE_CODE (t))
5148 if (TREE_OPERAND (t, 1) == decl)
5150 TREE_OPERAND (t, 1) = TREE_OPERAND (t, 0);
5151 TREE_OPERAND (t, 0) = decl;
5155 gcc_assert (TREE_OPERAND (t, 0) == decl);
5161 ret |= gimplify_expr (&TREE_OPERAND (t, 1), &OMP_FOR_PRE_BODY (for_stmt),
5162 NULL, is_gimple_val, fb_rvalue);
5169 gimplify_to_stmt_list (&OMP_FOR_BODY (for_stmt));
5170 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt));
5172 return ret == GS_ALL_DONE ? GS_ALL_DONE : GS_ERROR;
5175 /* Gimplify the gross structure of other OpenMP worksharing constructs.
5176 In particular, OMP_SECTIONS and OMP_SINGLE. */
5178 static enum gimplify_status
5179 gimplify_omp_workshare (tree *expr_p, tree *pre_p)
5181 tree stmt = *expr_p;
5183 gimplify_scan_omp_clauses (&OMP_CLAUSES (stmt), pre_p, false, false);
5184 gimplify_to_stmt_list (&OMP_BODY (stmt));
5185 gimplify_adjust_omp_clauses (&OMP_CLAUSES (stmt));
5190 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
5191 stabilized the lhs of the atomic operation as *ADDR. Return true if
5192 EXPR is this stabilized form. */
5195 goa_lhs_expr_p (tree expr, tree addr)
5197 /* Also include casts to other type variants. The C front end is fond
5198 of adding these for e.g. volatile variables. This is like
5199 STRIP_TYPE_NOPS but includes the main variant lookup. */
5200 while ((TREE_CODE (expr) == NOP_EXPR
5201 || TREE_CODE (expr) == CONVERT_EXPR
5202 || TREE_CODE (expr) == NON_LVALUE_EXPR)
5203 && TREE_OPERAND (expr, 0) != error_mark_node
5204 && (TYPE_MAIN_VARIANT (TREE_TYPE (expr))
5205 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (expr, 0)))))
5206 expr = TREE_OPERAND (expr, 0);
5208 if (TREE_CODE (expr) == INDIRECT_REF && TREE_OPERAND (expr, 0) == addr)
5210 if (TREE_CODE (addr) == ADDR_EXPR && expr == TREE_OPERAND (addr, 0))
5215 /* A subroutine of gimplify_omp_atomic. Attempt to implement the atomic
5216 operation as a __sync_fetch_and_op builtin. INDEX is log2 of the
5217 size of the data type, and thus usable to find the index of the builtin
5218 decl. Returns GS_UNHANDLED if the expression is not of the proper form. */
5220 static enum gimplify_status
5221 gimplify_omp_atomic_fetch_op (tree *expr_p, tree addr, tree rhs, int index)
5223 enum built_in_function base;
5225 enum insn_code *optab;
5227 /* Check for one of the supported fetch-op operations. */
5228 switch (TREE_CODE (rhs))
5230 case POINTER_PLUS_EXPR:
5232 base = BUILT_IN_FETCH_AND_ADD_N;
5233 optab = sync_add_optab;
5236 base = BUILT_IN_FETCH_AND_SUB_N;
5237 optab = sync_add_optab;
5240 base = BUILT_IN_FETCH_AND_AND_N;
5241 optab = sync_and_optab;
5244 base = BUILT_IN_FETCH_AND_OR_N;
5245 optab = sync_ior_optab;
5248 base = BUILT_IN_FETCH_AND_XOR_N;
5249 optab = sync_xor_optab;
5252 return GS_UNHANDLED;
5255 /* Make sure the expression is of the proper form. */
5256 if (goa_lhs_expr_p (TREE_OPERAND (rhs, 0), addr))
5257 rhs = TREE_OPERAND (rhs, 1);
5258 else if (commutative_tree_code (TREE_CODE (rhs))
5259 && goa_lhs_expr_p (TREE_OPERAND (rhs, 1), addr))
5260 rhs = TREE_OPERAND (rhs, 0);
5262 return GS_UNHANDLED;
5264 decl = built_in_decls[base + index + 1];
5265 itype = TREE_TYPE (TREE_TYPE (decl));
5267 if (optab[TYPE_MODE (itype)] == CODE_FOR_nothing)
5268 return GS_UNHANDLED;
5270 *expr_p = build_call_expr (decl, 2, addr, fold_convert (itype, rhs));
5274 /* A subroutine of gimplify_omp_atomic_pipeline. Walk *EXPR_P and replace
5275 appearances of *LHS_ADDR with LHS_VAR. If an expression does not involve
5276 the lhs, evaluate it into a temporary. Return 1 if the lhs appeared as
5277 a subexpression, 0 if it did not, or -1 if an error was encountered. */
5280 goa_stabilize_expr (tree *expr_p, tree *pre_p, tree lhs_addr, tree lhs_var)
5282 tree expr = *expr_p;
5285 if (goa_lhs_expr_p (expr, lhs_addr))
5290 if (is_gimple_val (expr))
5294 switch (TREE_CODE_CLASS (TREE_CODE (expr)))
5297 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p,
5300 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p,
5309 enum gimplify_status gs;
5310 gs = gimplify_expr (expr_p, pre_p, NULL, is_gimple_val, fb_rvalue);
5311 if (gs != GS_ALL_DONE)
5318 /* A subroutine of gimplify_omp_atomic. Implement the atomic operation as:
5322 newval = rhs; // with oldval replacing *addr in rhs
5323 oldval = __sync_val_compare_and_swap (addr, oldval, newval);
5324 if (oldval != newval)
5327 INDEX is log2 of the size of the data type, and thus usable to find the
5328 index of the builtin decl. */
5330 static enum gimplify_status
5331 gimplify_omp_atomic_pipeline (tree *expr_p, tree *pre_p, tree addr,
5332 tree rhs, int index)
5334 tree oldval, oldival, oldival2, newval, newival, label;
5335 tree type, itype, cmpxchg, x, iaddr;
5337 cmpxchg = built_in_decls[BUILT_IN_VAL_COMPARE_AND_SWAP_N + index + 1];
5338 type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr)));
5339 itype = TREE_TYPE (TREE_TYPE (cmpxchg));
5341 if (sync_compare_and_swap[TYPE_MODE (itype)] == CODE_FOR_nothing)
5342 return GS_UNHANDLED;
5344 oldval = create_tmp_var (type, NULL);
5345 newval = create_tmp_var (type, NULL);
5347 /* Precompute as much of RHS as possible. In the same walk, replace
5348 occurrences of the lhs value with our temporary. */
5349 if (goa_stabilize_expr (&rhs, pre_p, addr, oldval) < 0)
5352 x = build_fold_indirect_ref (addr);
5353 x = build_gimple_modify_stmt (oldval, x);
5354 gimplify_and_add (x, pre_p);
5356 /* For floating-point values, we'll need to view-convert them to integers
5357 so that we can perform the atomic compare and swap. Simplify the
5358 following code by always setting up the "i"ntegral variables. */
5359 if (INTEGRAL_TYPE_P (type) || POINTER_TYPE_P (type))
5367 oldival = create_tmp_var (itype, NULL);
5368 newival = create_tmp_var (itype, NULL);
5370 x = build1 (VIEW_CONVERT_EXPR, itype, oldval);
5371 x = build_gimple_modify_stmt (oldival, x);
5372 gimplify_and_add (x, pre_p);
5373 iaddr = fold_convert (build_pointer_type (itype), addr);
5376 oldival2 = create_tmp_var (itype, NULL);
5378 label = create_artificial_label ();
5379 x = build1 (LABEL_EXPR, void_type_node, label);
5380 gimplify_and_add (x, pre_p);
5382 x = build_gimple_modify_stmt (newval, rhs);
5383 gimplify_and_add (x, pre_p);
5385 if (newval != newival)
5387 x = build1 (VIEW_CONVERT_EXPR, itype, newval);
5388 x = build_gimple_modify_stmt (newival, x);
5389 gimplify_and_add (x, pre_p);
5392 x = build_gimple_modify_stmt (oldival2, fold_convert (itype, oldival));
5393 gimplify_and_add (x, pre_p);
5395 x = build_call_expr (cmpxchg, 3, iaddr, fold_convert (itype, oldival),
5396 fold_convert (itype, newival));
5397 if (oldval == oldival)
5398 x = fold_convert (type, x);
5399 x = build_gimple_modify_stmt (oldival, x);
5400 gimplify_and_add (x, pre_p);
5402 /* For floating point, be prepared for the loop backedge. */
5403 if (oldval != oldival)
5405 x = build1 (VIEW_CONVERT_EXPR, type, oldival);
5406 x = build_gimple_modify_stmt (oldval, x);
5407 gimplify_and_add (x, pre_p);
5410 /* Note that we always perform the comparison as an integer, even for
5411 floating point. This allows the atomic operation to properly
5412 succeed even with NaNs and -0.0. */
5413 x = build3 (COND_EXPR, void_type_node,
5414 build2 (NE_EXPR, boolean_type_node,
5415 fold_convert (itype, oldival), oldival2),
5416 build1 (GOTO_EXPR, void_type_node, label), NULL);
5417 gimplify_and_add (x, pre_p);
5423 /* A subroutine of gimplify_omp_atomic. Implement the atomic operation as:
5425 GOMP_atomic_start ();
5429 The result is not globally atomic, but works so long as all parallel
5430 references are within #pragma omp atomic directives. According to
5431 responses received from omp@openmp.org, appears to be within spec.
5432 Which makes sense, since that's how several other compilers handle
5433 this situation as well. */
5435 static enum gimplify_status
5436 gimplify_omp_atomic_mutex (tree *expr_p, tree *pre_p, tree addr, tree rhs)
5440 t = built_in_decls[BUILT_IN_GOMP_ATOMIC_START];
5441 t = build_call_expr (t, 0);
5442 gimplify_and_add (t, pre_p);
5444 t = build_fold_indirect_ref (addr);
5445 t = build_gimple_modify_stmt (t, rhs);
5446 gimplify_and_add (t, pre_p);
5448 t = built_in_decls[BUILT_IN_GOMP_ATOMIC_END];
5449 t = build_call_expr (t, 0);
5450 gimplify_and_add (t, pre_p);
5456 /* Gimplify an OMP_ATOMIC statement. */
5458 static enum gimplify_status
5459 gimplify_omp_atomic (tree *expr_p, tree *pre_p)
5461 tree addr = TREE_OPERAND (*expr_p, 0);
5462 tree rhs = TREE_OPERAND (*expr_p, 1);
5463 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr)));
5464 HOST_WIDE_INT index;
5466 /* Make sure the type is one of the supported sizes. */
5467 index = tree_low_cst (TYPE_SIZE_UNIT (type), 1);
5468 index = exact_log2 (index);
5469 if (index >= 0 && index <= 4)
5471 enum gimplify_status gs;
5474 if (DECL_P (TREE_OPERAND (addr, 0)))
5475 align = DECL_ALIGN_UNIT (TREE_OPERAND (addr, 0));
5476 else if (TREE_CODE (TREE_OPERAND (addr, 0)) == COMPONENT_REF
5477 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (addr, 0), 1))
5479 align = DECL_ALIGN_UNIT (TREE_OPERAND (TREE_OPERAND (addr, 0), 1));
5481 align = TYPE_ALIGN_UNIT (type);
5483 /* __sync builtins require strict data alignment. */
5484 if (exact_log2 (align) >= index)
5486 /* When possible, use specialized atomic update functions. */
5487 if (INTEGRAL_TYPE_P (type) || POINTER_TYPE_P (type))
5489 gs = gimplify_omp_atomic_fetch_op (expr_p, addr, rhs, index);
5490 if (gs != GS_UNHANDLED)
5494 /* If we don't have specialized __sync builtins, try and implement
5495 as a compare and swap loop. */
5496 gs = gimplify_omp_atomic_pipeline (expr_p, pre_p, addr, rhs, index);
5497 if (gs != GS_UNHANDLED)
5502 /* The ultimate fallback is wrapping the operation in a mutex. */
5503 return gimplify_omp_atomic_mutex (expr_p, pre_p, addr, rhs);
5506 /* Gimplifies the expression tree pointed to by EXPR_P. Return 0 if
5507 gimplification failed.
5509 PRE_P points to the list where side effects that must happen before
5510 EXPR should be stored.
5512 POST_P points to the list where side effects that must happen after
5513 EXPR should be stored, or NULL if there is no suitable list. In
5514 that case, we copy the result to a temporary, emit the
5515 post-effects, and then return the temporary.
5517 GIMPLE_TEST_F points to a function that takes a tree T and
5518 returns nonzero if T is in the GIMPLE form requested by the
5519 caller. The GIMPLE predicates are in tree-gimple.c.
5521 This test is used twice. Before gimplification, the test is
5522 invoked to determine whether *EXPR_P is already gimple enough. If
5523 that fails, *EXPR_P is gimplified according to its code and
5524 GIMPLE_TEST_F is called again. If the test still fails, then a new
5525 temporary variable is created and assigned the value of the
5526 gimplified expression.
5528 FALLBACK tells the function what sort of a temporary we want. If the 1
5529 bit is set, an rvalue is OK. If the 2 bit is set, an lvalue is OK.
5530 If both are set, either is OK, but an lvalue is preferable.
5532 The return value is either GS_ERROR or GS_ALL_DONE, since this function
5533 iterates until solution. */
5535 enum gimplify_status
5536 gimplify_expr (tree *expr_p, tree *pre_p, tree *post_p,
5537 bool (* gimple_test_f) (tree), fallback_t fallback)
5540 tree internal_pre = NULL_TREE;
5541 tree internal_post = NULL_TREE;
5543 int is_statement = (pre_p == NULL);
5544 location_t saved_location;
5545 enum gimplify_status ret;
5547 save_expr = *expr_p;
5548 if (save_expr == NULL_TREE)
5551 /* We used to check the predicate here and return immediately if it
5552 succeeds. This is wrong; the design is for gimplification to be
5553 idempotent, and for the predicates to only test for valid forms, not
5554 whether they are fully simplified. */
5556 /* Set up our internal queues if needed. */
5558 pre_p = &internal_pre;
5560 post_p = &internal_post;
5562 saved_location = input_location;
5563 if (save_expr != error_mark_node
5564 && EXPR_HAS_LOCATION (*expr_p))
5565 input_location = EXPR_LOCATION (*expr_p);
5567 /* Loop over the specific gimplifiers until the toplevel node
5568 remains the same. */
5571 /* Strip away as many useless type conversions as possible
5573 STRIP_USELESS_TYPE_CONVERSION (*expr_p);
5575 /* Remember the expr. */
5576 save_expr = *expr_p;
5578 /* Die, die, die, my darling. */
5579 if (save_expr == error_mark_node
5580 || (!GIMPLE_STMT_P (save_expr)
5581 && TREE_TYPE (save_expr)
5582 && TREE_TYPE (save_expr) == error_mark_node))
5588 /* Do any language-specific gimplification. */
5589 ret = lang_hooks.gimplify_expr (expr_p, pre_p, post_p);
5592 if (*expr_p == NULL_TREE)
5594 if (*expr_p != save_expr)
5597 else if (ret != GS_UNHANDLED)
5601 switch (TREE_CODE (*expr_p))
5603 /* First deal with the special cases. */
5605 case POSTINCREMENT_EXPR:
5606 case POSTDECREMENT_EXPR:
5607 case PREINCREMENT_EXPR:
5608 case PREDECREMENT_EXPR:
5609 ret = gimplify_self_mod_expr (expr_p, pre_p, post_p,
5610 fallback != fb_none);
5614 case ARRAY_RANGE_REF:
5618 case VIEW_CONVERT_EXPR:
5619 ret = gimplify_compound_lval (expr_p, pre_p, post_p,
5620 fallback ? fallback : fb_rvalue);
5624 ret = gimplify_cond_expr (expr_p, pre_p, fallback);
5625 /* C99 code may assign to an array in a structure value of a
5626 conditional expression, and this has undefined behavior
5627 only on execution, so create a temporary if an lvalue is
5629 if (fallback == fb_lvalue)
5631 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
5632 mark_addressable (*expr_p);
5637 ret = gimplify_call_expr (expr_p, pre_p, fallback != fb_none);
5638 /* C99 code may assign to an array in a structure returned
5639 from a function, and this has undefined behavior only on
5640 execution, so create a temporary if an lvalue is
5642 if (fallback == fb_lvalue)
5644 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
5645 mark_addressable (*expr_p);
5653 ret = gimplify_compound_expr (expr_p, pre_p, fallback != fb_none);
5657 case GIMPLE_MODIFY_STMT:
5659 ret = gimplify_modify_expr (expr_p, pre_p, post_p,
5660 fallback != fb_none);
5664 /* The distinction between MODIFY_EXPR and INIT_EXPR is no longer
5666 if (TREE_CODE (*expr_p) == INIT_EXPR)
5667 TREE_SET_CODE (*expr_p, MODIFY_EXPR);
5669 /* Convert MODIFY_EXPR to GIMPLE_MODIFY_STMT. */
5670 if (TREE_CODE (*expr_p) == MODIFY_EXPR)
5671 tree_to_gimple_tuple (expr_p);
5676 case TRUTH_ANDIF_EXPR:
5677 case TRUTH_ORIF_EXPR:
5678 ret = gimplify_boolean_expr (expr_p);
5681 case TRUTH_NOT_EXPR:
5682 TREE_OPERAND (*expr_p, 0)
5683 = gimple_boolify (TREE_OPERAND (*expr_p, 0));
5684 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5685 is_gimple_val, fb_rvalue);
5686 recalculate_side_effects (*expr_p);
5690 ret = gimplify_addr_expr (expr_p, pre_p, post_p);
5694 ret = gimplify_va_arg_expr (expr_p, pre_p, post_p);
5699 if (IS_EMPTY_STMT (*expr_p))
5705 if (VOID_TYPE_P (TREE_TYPE (*expr_p))
5706 || fallback == fb_none)
5708 /* Just strip a conversion to void (or in void context) and
5710 *expr_p = TREE_OPERAND (*expr_p, 0);
5714 ret = gimplify_conversion (expr_p);
5715 if (ret == GS_ERROR)
5717 if (*expr_p != save_expr)
5721 case FIX_TRUNC_EXPR:
5722 /* unary_expr: ... | '(' cast ')' val | ... */
5723 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5724 is_gimple_val, fb_rvalue);
5725 recalculate_side_effects (*expr_p);
5729 *expr_p = fold_indirect_ref (*expr_p);
5730 if (*expr_p != save_expr)
5732 /* else fall through. */
5733 case ALIGN_INDIRECT_REF:
5734 case MISALIGNED_INDIRECT_REF:
5735 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5736 is_gimple_reg, fb_rvalue);
5737 recalculate_side_effects (*expr_p);
5740 /* Constants need not be gimplified. */
5750 /* If we require an lvalue, such as for ADDR_EXPR, retain the
5751 CONST_DECL node. Otherwise the decl is replaceable by its
5753 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
5754 if (fallback & fb_lvalue)
5757 *expr_p = DECL_INITIAL (*expr_p);
5761 ret = gimplify_decl_expr (expr_p);
5765 /* FIXME make this a decl. */
5770 ret = gimplify_bind_expr (expr_p, pre_p);
5774 ret = gimplify_loop_expr (expr_p, pre_p);
5778 ret = gimplify_switch_expr (expr_p, pre_p);
5782 ret = gimplify_exit_expr (expr_p);
5786 /* If the target is not LABEL, then it is a computed jump
5787 and the target needs to be gimplified. */
5788 if (TREE_CODE (GOTO_DESTINATION (*expr_p)) != LABEL_DECL)
5789 ret = gimplify_expr (&GOTO_DESTINATION (*expr_p), pre_p,
5790 NULL, is_gimple_val, fb_rvalue);
5795 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p))
5796 == current_function_decl);
5799 case CASE_LABEL_EXPR:
5800 ret = gimplify_case_label_expr (expr_p);
5804 ret = gimplify_return_expr (*expr_p, pre_p);
5808 /* Don't reduce this in place; let gimplify_init_constructor work its
5809 magic. Buf if we're just elaborating this for side effects, just
5810 gimplify any element that has side-effects. */
5811 if (fallback == fb_none)
5813 unsigned HOST_WIDE_INT ix;
5814 constructor_elt *ce;
5815 tree temp = NULL_TREE;
5817 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (*expr_p),
5820 if (TREE_SIDE_EFFECTS (ce->value))
5821 append_to_statement_list (ce->value, &temp);
5826 /* C99 code may assign to an array in a constructed
5827 structure or union, and this has undefined behavior only
5828 on execution, so create a temporary if an lvalue is
5830 else if (fallback == fb_lvalue)
5832 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
5833 mark_addressable (*expr_p);
5839 /* The following are special cases that are not handled by the
5840 original GIMPLE grammar. */
5842 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
5845 ret = gimplify_save_expr (expr_p, pre_p, post_p);
5850 enum gimplify_status r0, r1, r2;
5852 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5853 is_gimple_lvalue, fb_either);
5854 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
5855 is_gimple_val, fb_rvalue);
5856 r2 = gimplify_expr (&TREE_OPERAND (*expr_p, 2), pre_p, post_p,
5857 is_gimple_val, fb_rvalue);
5858 recalculate_side_effects (*expr_p);
5860 ret = MIN (r0, MIN (r1, r2));
5864 case NON_LVALUE_EXPR:
5865 /* This should have been stripped above. */
5869 ret = gimplify_asm_expr (expr_p, pre_p, post_p);
5872 case TRY_FINALLY_EXPR:
5873 case TRY_CATCH_EXPR:
5874 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p, 0));
5875 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p, 1));
5879 case CLEANUP_POINT_EXPR:
5880 ret = gimplify_cleanup_point_expr (expr_p, pre_p);
5884 ret = gimplify_target_expr (expr_p, pre_p, post_p);
5888 gimplify_to_stmt_list (&CATCH_BODY (*expr_p));
5892 case EH_FILTER_EXPR:
5893 gimplify_to_stmt_list (&EH_FILTER_FAILURE (*expr_p));
5897 case CHANGE_DYNAMIC_TYPE_EXPR:
5898 ret = gimplify_expr (&CHANGE_DYNAMIC_TYPE_LOCATION (*expr_p),
5899 pre_p, post_p, is_gimple_reg, fb_lvalue);
5904 enum gimplify_status r0, r1;
5905 r0 = gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p), pre_p, post_p,
5906 is_gimple_val, fb_rvalue);
5907 r1 = gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p), pre_p, post_p,
5908 is_gimple_val, fb_rvalue);
5914 /* We get here when taking the address of a label. We mark
5915 the label as "forced"; meaning it can never be removed and
5916 it is a potential target for any computed goto. */
5917 FORCED_LABEL (*expr_p) = 1;
5921 case STATEMENT_LIST:
5922 ret = gimplify_statement_list (expr_p, pre_p);
5925 case WITH_SIZE_EXPR:
5927 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
5928 post_p == &internal_post ? NULL : post_p,
5929 gimple_test_f, fallback);
5930 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
5931 is_gimple_val, fb_rvalue);
5937 ret = gimplify_var_or_parm_decl (expr_p);
5941 /* When within an OpenMP context, notice uses of variables. */
5942 if (gimplify_omp_ctxp)
5943 omp_notice_variable (gimplify_omp_ctxp, *expr_p, true);
5948 /* Allow callbacks into the gimplifier during optimization. */
5953 ret = gimplify_omp_parallel (expr_p, pre_p);
5957 ret = gimplify_omp_for (expr_p, pre_p);
5962 ret = gimplify_omp_workshare (expr_p, pre_p);
5969 gimplify_to_stmt_list (&OMP_BODY (*expr_p));
5973 ret = gimplify_omp_atomic (expr_p, pre_p);
5981 case POINTER_PLUS_EXPR:
5982 /* Convert ((type *)A)+offset into &A->field_of_type_and_offset.
5983 The second is gimple immediate saving a need for extra statement.
5985 if (TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
5986 && (tmp = maybe_fold_offset_to_reference
5987 (TREE_OPERAND (*expr_p, 0), TREE_OPERAND (*expr_p, 1),
5988 TREE_TYPE (TREE_TYPE (*expr_p)))))
5990 *expr_p = build_fold_addr_expr_with_type (tmp,
5991 TREE_TYPE (*expr_p));
5994 /* Convert (void *)&a + 4 into (void *)&a[1]. */
5995 if (TREE_CODE (TREE_OPERAND (*expr_p, 0)) == NOP_EXPR
5996 && TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
5997 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p,
5999 && (tmp = maybe_fold_offset_to_reference
6000 (TREE_OPERAND (TREE_OPERAND (*expr_p, 0), 0),
6001 TREE_OPERAND (*expr_p, 1),
6002 TREE_TYPE (TREE_TYPE
6003 (TREE_OPERAND (TREE_OPERAND (*expr_p, 0),
6006 tmp = build_fold_addr_expr (tmp);
6007 *expr_p = fold_convert (TREE_TYPE (*expr_p), tmp);
6012 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p)))
6014 case tcc_comparison:
6015 /* Handle comparison of objects of non scalar mode aggregates
6016 with a call to memcmp. It would be nice to only have to do
6017 this for variable-sized objects, but then we'd have to allow
6018 the same nest of reference nodes we allow for MODIFY_EXPR and
6021 Compare scalar mode aggregates as scalar mode values. Using
6022 memcmp for them would be very inefficient at best, and is
6023 plain wrong if bitfields are involved. */
6026 tree type = TREE_TYPE (TREE_OPERAND (*expr_p, 1));
6028 if (!AGGREGATE_TYPE_P (type))
6030 else if (TYPE_MODE (type) != BLKmode)
6031 ret = gimplify_scalar_mode_aggregate_compare (expr_p);
6033 ret = gimplify_variable_sized_compare (expr_p);
6038 /* If *EXPR_P does not need to be special-cased, handle it
6039 according to its class. */
6041 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6042 post_p, is_gimple_val, fb_rvalue);
6048 enum gimplify_status r0, r1;
6050 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6051 post_p, is_gimple_val, fb_rvalue);
6052 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
6053 post_p, is_gimple_val, fb_rvalue);
6059 case tcc_declaration:
6062 goto dont_recalculate;
6065 gcc_assert (TREE_CODE (*expr_p) == TRUTH_AND_EXPR
6066 || TREE_CODE (*expr_p) == TRUTH_OR_EXPR
6067 || TREE_CODE (*expr_p) == TRUTH_XOR_EXPR);
6071 recalculate_side_effects (*expr_p);
6076 /* If we replaced *expr_p, gimplify again. */
6077 if (ret == GS_OK && (*expr_p == NULL || *expr_p == save_expr))
6080 while (ret == GS_OK);
6082 /* If we encountered an error_mark somewhere nested inside, either
6083 stub out the statement or propagate the error back out. */
6084 if (ret == GS_ERROR)
6091 /* This was only valid as a return value from the langhook, which
6092 we handled. Make sure it doesn't escape from any other context. */
6093 gcc_assert (ret != GS_UNHANDLED);
6095 if (fallback == fb_none && *expr_p && !is_gimple_stmt (*expr_p))
6097 /* We aren't looking for a value, and we don't have a valid
6098 statement. If it doesn't have side-effects, throw it away. */
6099 if (!TREE_SIDE_EFFECTS (*expr_p))
6101 else if (!TREE_THIS_VOLATILE (*expr_p))
6103 /* This is probably a _REF that contains something nested that
6104 has side effects. Recurse through the operands to find it. */
6105 enum tree_code code = TREE_CODE (*expr_p);
6112 case VIEW_CONVERT_EXPR:
6113 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6114 gimple_test_f, fallback);
6118 case ARRAY_RANGE_REF:
6119 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6120 gimple_test_f, fallback);
6121 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
6122 gimple_test_f, fallback);
6126 /* Anything else with side-effects must be converted to
6127 a valid statement before we get here. */
6133 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p))
6134 && TYPE_MODE (TREE_TYPE (*expr_p)) != BLKmode)
6136 /* Historically, the compiler has treated a bare reference
6137 to a non-BLKmode volatile lvalue as forcing a load. */
6138 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p));
6139 /* Normally, we do not want to create a temporary for a
6140 TREE_ADDRESSABLE type because such a type should not be
6141 copied by bitwise-assignment. However, we make an
6142 exception here, as all we are doing here is ensuring that
6143 we read the bytes that make up the type. We use
6144 create_tmp_var_raw because create_tmp_var will abort when
6145 given a TREE_ADDRESSABLE type. */
6146 tree tmp = create_tmp_var_raw (type, "vol");
6147 gimple_add_tmp_var (tmp);
6148 *expr_p = build_gimple_modify_stmt (tmp, *expr_p);
6151 /* We can't do anything useful with a volatile reference to
6152 an incomplete type, so just throw it away. Likewise for
6153 a BLKmode type, since any implicit inner load should
6154 already have been turned into an explicit one by the
6155 gimplification process. */
6159 /* If we are gimplifying at the statement level, we're done. Tack
6160 everything together and replace the original statement with the
6162 if (fallback == fb_none || is_statement)
6164 if (internal_pre || internal_post)
6166 append_to_statement_list (*expr_p, &internal_pre);
6167 append_to_statement_list (internal_post, &internal_pre);
6168 annotate_all_with_locus (&internal_pre, input_location);
6169 *expr_p = internal_pre;
6173 else if (TREE_CODE (*expr_p) == STATEMENT_LIST)
6174 annotate_all_with_locus (expr_p, input_location);
6176 annotate_one_with_locus (*expr_p, input_location);
6180 /* Otherwise we're gimplifying a subexpression, so the resulting value is
6183 /* If it's sufficiently simple already, we're done. Unless we are
6184 handling some post-effects internally; if that's the case, we need to
6185 copy into a temp before adding the post-effects to the tree. */
6186 if (!internal_post && (*gimple_test_f) (*expr_p))
6189 /* Otherwise, we need to create a new temporary for the gimplified
6192 /* We can't return an lvalue if we have an internal postqueue. The
6193 object the lvalue refers to would (probably) be modified by the
6194 postqueue; we need to copy the value out first, which means an
6196 if ((fallback & fb_lvalue) && !internal_post
6197 && is_gimple_addressable (*expr_p))
6199 /* An lvalue will do. Take the address of the expression, store it
6200 in a temporary, and replace the expression with an INDIRECT_REF of
6202 tmp = build_fold_addr_expr (*expr_p);
6203 gimplify_expr (&tmp, pre_p, post_p, is_gimple_reg, fb_rvalue);
6204 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (tmp)), tmp);
6206 else if ((fallback & fb_rvalue) && is_gimple_formal_tmp_rhs (*expr_p))
6208 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p)));
6210 /* An rvalue will do. Assign the gimplified expression into a new
6211 temporary TMP and replace the original expression with TMP. */
6213 if (internal_post || (fallback & fb_lvalue))
6214 /* The postqueue might change the value of the expression between
6215 the initialization and use of the temporary, so we can't use a
6216 formal temp. FIXME do we care? */
6217 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6219 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
6221 if (TREE_CODE (*expr_p) != SSA_NAME)
6222 DECL_GIMPLE_FORMAL_TEMP_P (*expr_p) = 1;
6226 #ifdef ENABLE_CHECKING
6227 if (!(fallback & fb_mayfail))
6229 fprintf (stderr, "gimplification failed:\n");
6230 print_generic_expr (stderr, *expr_p, 0);
6231 debug_tree (*expr_p);
6232 internal_error ("gimplification failed");
6235 gcc_assert (fallback & fb_mayfail);
6236 /* If this is an asm statement, and the user asked for the
6237 impossible, don't die. Fail and let gimplify_asm_expr
6243 /* Make sure the temporary matches our predicate. */
6244 gcc_assert ((*gimple_test_f) (*expr_p));
6248 annotate_all_with_locus (&internal_post, input_location);
6249 append_to_statement_list (internal_post, pre_p);
6253 input_location = saved_location;
6257 /* Look through TYPE for variable-sized objects and gimplify each such
6258 size that we find. Add to LIST_P any statements generated. */
6261 gimplify_type_sizes (tree type, tree *list_p)
6265 if (type == NULL || type == error_mark_node)
6268 /* We first do the main variant, then copy into any other variants. */
6269 type = TYPE_MAIN_VARIANT (type);
6271 /* Avoid infinite recursion. */
6272 if (TYPE_SIZES_GIMPLIFIED (type))
6275 TYPE_SIZES_GIMPLIFIED (type) = 1;
6277 switch (TREE_CODE (type))
6283 gimplify_one_sizepos (&TYPE_MIN_VALUE (type), list_p);
6284 gimplify_one_sizepos (&TYPE_MAX_VALUE (type), list_p);
6286 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
6288 TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (type);
6289 TYPE_MAX_VALUE (t) = TYPE_MAX_VALUE (type);
6294 /* These types may not have declarations, so handle them here. */
6295 gimplify_type_sizes (TREE_TYPE (type), list_p);
6296 gimplify_type_sizes (TYPE_DOMAIN (type), list_p);
6301 case QUAL_UNION_TYPE:
6302 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
6303 if (TREE_CODE (field) == FIELD_DECL)
6305 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field), list_p);
6306 gimplify_type_sizes (TREE_TYPE (field), list_p);
6311 case REFERENCE_TYPE:
6312 /* We used to recurse on the pointed-to type here, which turned out to
6313 be incorrect because its definition might refer to variables not
6314 yet initialized at this point if a forward declaration is involved.
6316 It was actually useful for anonymous pointed-to types to ensure
6317 that the sizes evaluation dominates every possible later use of the
6318 values. Restricting to such types here would be safe since there
6319 is no possible forward declaration around, but would introduce an
6320 undesirable middle-end semantic to anonymity. We then defer to
6321 front-ends the responsibility of ensuring that the sizes are
6322 evaluated both early and late enough, e.g. by attaching artificial
6323 type declarations to the tree. */
6330 gimplify_one_sizepos (&TYPE_SIZE (type), list_p);
6331 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type), list_p);
6333 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
6335 TYPE_SIZE (t) = TYPE_SIZE (type);
6336 TYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (type);
6337 TYPE_SIZES_GIMPLIFIED (t) = 1;
6341 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
6342 a size or position, has had all of its SAVE_EXPRs evaluated.
6343 We add any required statements to STMT_P. */
6346 gimplify_one_sizepos (tree *expr_p, tree *stmt_p)
6348 tree type, expr = *expr_p;
6350 /* We don't do anything if the value isn't there, is constant, or contains
6351 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
6352 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
6353 will want to replace it with a new variable, but that will cause problems
6354 if this type is from outside the function. It's OK to have that here. */
6355 if (expr == NULL_TREE || TREE_CONSTANT (expr)
6356 || TREE_CODE (expr) == VAR_DECL
6357 || CONTAINS_PLACEHOLDER_P (expr))
6360 type = TREE_TYPE (expr);
6361 *expr_p = unshare_expr (expr);
6363 gimplify_expr (expr_p, stmt_p, NULL, is_gimple_val, fb_rvalue);
6366 /* Verify that we've an exact type match with the original expression.
6367 In particular, we do not wish to drop a "sizetype" in favour of a
6368 type of similar dimensions. We don't want to pollute the generic
6369 type-stripping code with this knowledge because it doesn't matter
6370 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
6371 and friends retain their "sizetype-ness". */
6372 if (TREE_TYPE (expr) != type
6373 && TREE_CODE (type) == INTEGER_TYPE
6374 && TYPE_IS_SIZETYPE (type))
6378 *expr_p = create_tmp_var (type, NULL);
6379 tmp = build1 (NOP_EXPR, type, expr);
6380 tmp = build_gimple_modify_stmt (*expr_p, tmp);
6381 if (EXPR_HAS_LOCATION (expr))
6382 SET_EXPR_LOCUS (tmp, EXPR_LOCUS (expr));
6384 SET_EXPR_LOCATION (tmp, input_location);
6386 gimplify_and_add (tmp, stmt_p);
6390 #ifdef ENABLE_CHECKING
6391 /* Compare types A and B for a "close enough" match. */
6394 cpt_same_type (tree a, tree b)
6396 if (useless_type_conversion_p (a, b))
6399 /* ??? The C++ FE decomposes METHOD_TYPES to FUNCTION_TYPES and doesn't
6400 link them together. This routine is intended to catch type errors
6401 that will affect the optimizers, and the optimizers don't add new
6402 dereferences of function pointers, so ignore it. */
6403 if ((TREE_CODE (a) == FUNCTION_TYPE || TREE_CODE (a) == METHOD_TYPE)
6404 && (TREE_CODE (b) == FUNCTION_TYPE || TREE_CODE (b) == METHOD_TYPE))
6407 /* ??? The C FE pushes type qualifiers after the fact into the type of
6408 the element from the type of the array. See build_unary_op's handling
6409 of ADDR_EXPR. This seems wrong -- if we were going to do this, we
6410 should have done it when creating the variable in the first place.
6411 Alternately, why aren't the two array types made variants? */
6412 if (TREE_CODE (a) == ARRAY_TYPE && TREE_CODE (b) == ARRAY_TYPE)
6413 return cpt_same_type (TREE_TYPE (a), TREE_TYPE (b));
6415 /* And because of those, we have to recurse down through pointers. */
6416 if (POINTER_TYPE_P (a) && POINTER_TYPE_P (b))
6417 return cpt_same_type (TREE_TYPE (a), TREE_TYPE (b));
6422 /* Check for some cases of the front end missing cast expressions.
6423 The type of a dereference should correspond to the pointer type;
6424 similarly the type of an address should match its object. */
6427 check_pointer_types_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
6428 void *data ATTRIBUTE_UNUSED)
6431 tree ptype, otype, dtype;
6433 switch (TREE_CODE (t))
6437 otype = TREE_TYPE (t);
6438 ptype = TREE_TYPE (TREE_OPERAND (t, 0));
6439 dtype = TREE_TYPE (ptype);
6440 gcc_assert (cpt_same_type (otype, dtype));
6444 ptype = TREE_TYPE (t);
6445 otype = TREE_TYPE (TREE_OPERAND (t, 0));
6446 dtype = TREE_TYPE (ptype);
6447 if (!cpt_same_type (dtype, otype))
6449 /* &array is allowed to produce a pointer to the element, rather than
6450 a pointer to the array type. We must allow this in order to
6451 properly represent assigning the address of an array in C into
6452 pointer to the element type. */
6453 gcc_assert (TREE_CODE (otype) == ARRAY_TYPE
6454 && POINTER_TYPE_P (ptype)
6455 && cpt_same_type (dtype, TREE_TYPE (otype)));
6469 /* Gimplify the body of statements pointed to by BODY_P. FNDECL is the
6470 function decl containing BODY. */
6473 gimplify_body (tree *body_p, tree fndecl, bool do_parms)
6475 location_t saved_location = input_location;
6476 tree body, parm_stmts;
6478 timevar_push (TV_TREE_GIMPLIFY);
6480 gcc_assert (gimplify_ctxp == NULL);
6481 push_gimplify_context ();
6483 /* Unshare most shared trees in the body and in that of any nested functions.
6484 It would seem we don't have to do this for nested functions because
6485 they are supposed to be output and then the outer function gimplified
6486 first, but the g++ front end doesn't always do it that way. */
6487 unshare_body (body_p, fndecl);
6488 unvisit_body (body_p, fndecl);
6490 /* Make sure input_location isn't set to something wierd. */
6491 input_location = DECL_SOURCE_LOCATION (fndecl);
6493 /* Resolve callee-copies. This has to be done before processing
6494 the body so that DECL_VALUE_EXPR gets processed correctly. */
6495 parm_stmts = do_parms ? gimplify_parameters () : NULL;
6497 /* Gimplify the function's body. */
6498 gimplify_stmt (body_p);
6502 body = alloc_stmt_list ();
6503 else if (TREE_CODE (body) == STATEMENT_LIST)
6505 tree t = expr_only (*body_p);
6510 /* If there isn't an outer BIND_EXPR, add one. */
6511 if (TREE_CODE (body) != BIND_EXPR)
6513 tree b = build3 (BIND_EXPR, void_type_node, NULL_TREE,
6514 NULL_TREE, NULL_TREE);
6515 TREE_SIDE_EFFECTS (b) = 1;
6516 append_to_statement_list_force (body, &BIND_EXPR_BODY (b));
6520 /* If we had callee-copies statements, insert them at the beginning
6524 append_to_statement_list_force (BIND_EXPR_BODY (body), &parm_stmts);
6525 BIND_EXPR_BODY (body) = parm_stmts;
6528 /* Unshare again, in case gimplification was sloppy. */
6529 unshare_all_trees (body);
6533 pop_gimplify_context (body);
6534 gcc_assert (gimplify_ctxp == NULL);
6536 #ifdef ENABLE_CHECKING
6537 walk_tree (body_p, check_pointer_types_r, NULL, NULL);
6540 timevar_pop (TV_TREE_GIMPLIFY);
6541 input_location = saved_location;
6544 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
6545 node for the function we want to gimplify. */
6548 gimplify_function_tree (tree fndecl)
6550 tree oldfn, parm, ret;
6552 oldfn = current_function_decl;
6553 current_function_decl = fndecl;
6554 cfun = DECL_STRUCT_FUNCTION (fndecl);
6556 allocate_struct_function (fndecl);
6558 for (parm = DECL_ARGUMENTS (fndecl); parm ; parm = TREE_CHAIN (parm))
6560 /* Preliminarily mark non-addressed complex variables as eligible
6561 for promotion to gimple registers. We'll transform their uses
6563 if ((TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
6564 || TREE_CODE (TREE_TYPE (parm)) == VECTOR_TYPE)
6565 && !TREE_THIS_VOLATILE (parm)
6566 && !needs_to_live_in_memory (parm))
6567 DECL_GIMPLE_REG_P (parm) = 1;
6570 ret = DECL_RESULT (fndecl);
6571 if ((TREE_CODE (TREE_TYPE (ret)) == COMPLEX_TYPE
6572 || TREE_CODE (TREE_TYPE (ret)) == VECTOR_TYPE)
6573 && !needs_to_live_in_memory (ret))
6574 DECL_GIMPLE_REG_P (ret) = 1;
6576 gimplify_body (&DECL_SAVED_TREE (fndecl), fndecl, true);
6578 /* If we're instrumenting function entry/exit, then prepend the call to
6579 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
6580 catch the exit hook. */
6581 /* ??? Add some way to ignore exceptions for this TFE. */
6582 if (flag_instrument_function_entry_exit
6583 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl))
6587 tf = build2 (TRY_FINALLY_EXPR, void_type_node, NULL, NULL);
6588 TREE_SIDE_EFFECTS (tf) = 1;
6589 x = DECL_SAVED_TREE (fndecl);
6590 append_to_statement_list (x, &TREE_OPERAND (tf, 0));
6591 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_EXIT];
6592 x = build_call_expr (x, 0);
6593 append_to_statement_list (x, &TREE_OPERAND (tf, 1));
6595 bind = build3 (BIND_EXPR, void_type_node, NULL, NULL, NULL);
6596 TREE_SIDE_EFFECTS (bind) = 1;
6597 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_ENTER];
6598 x = build_call_expr (x, 0);
6599 append_to_statement_list (x, &BIND_EXPR_BODY (bind));
6600 append_to_statement_list (tf, &BIND_EXPR_BODY (bind));
6602 DECL_SAVED_TREE (fndecl) = bind;
6605 cfun->gimplified = true;
6606 current_function_decl = oldfn;
6607 cfun = oldfn ? DECL_STRUCT_FUNCTION (oldfn) : NULL;
6610 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
6611 force the result to be either ssa_name or an invariant, otherwise
6612 just force it to be a rhs expression. If VAR is not NULL, make the
6613 base variable of the final destination be VAR if suitable. */
6616 force_gimple_operand (tree expr, tree *stmts, bool simple, tree var)
6619 enum gimplify_status ret;
6620 gimple_predicate gimple_test_f;
6624 if (is_gimple_val (expr))
6627 gimple_test_f = simple ? is_gimple_val : is_gimple_reg_rhs;
6629 push_gimplify_context ();
6630 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
6633 expr = build_gimple_modify_stmt (var, expr);
6635 ret = gimplify_expr (&expr, stmts, NULL,
6636 gimple_test_f, fb_rvalue);
6637 gcc_assert (ret != GS_ERROR);
6639 if (gimple_referenced_vars (cfun))
6641 for (t = gimplify_ctxp->temps; t ; t = TREE_CHAIN (t))
6642 add_referenced_var (t);
6645 pop_gimplify_context (NULL);
6650 /* Invokes force_gimple_operand for EXPR with parameters SIMPLE_P and VAR. If
6651 some statements are produced, emits them before BSI. */
6654 force_gimple_operand_bsi (block_stmt_iterator *bsi, tree expr,
6655 bool simple_p, tree var)
6659 expr = force_gimple_operand (expr, &stmts, simple_p, var);
6661 bsi_insert_before (bsi, stmts, BSI_SAME_STMT);
6666 #include "gt-gimplify.h"