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 3, or (at your option) any later
15 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
16 WARRANTY; without even the implied warranty of MERCHANTABILITY or
17 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
26 #include "coretypes.h"
31 #include "tree-gimple.h"
32 #include "tree-inline.h"
33 #include "diagnostic.h"
34 #include "langhooks.h"
35 #include "langhooks-def.h"
36 #include "tree-flow.h"
50 #include "pointer-set.h"
51 #include "splay-tree.h"
54 enum gimplify_omp_var_data
60 GOVD_FIRSTPRIVATE = 16,
61 GOVD_LASTPRIVATE = 32,
64 GOVD_DEBUG_PRIVATE = 256,
65 GOVD_DATA_SHARE_CLASS = (GOVD_SHARED | GOVD_PRIVATE | GOVD_FIRSTPRIVATE
66 | GOVD_LASTPRIVATE | GOVD_REDUCTION | GOVD_LOCAL)
69 struct gimplify_omp_ctx
71 struct gimplify_omp_ctx *outer_context;
73 struct pointer_set_t *privatized_types;
75 enum omp_clause_default_kind default_kind;
77 bool is_combined_parallel;
82 struct gimplify_ctx *prev_context;
84 tree current_bind_expr;
86 tree conditional_cleanups;
90 VEC(tree,heap) *case_labels;
91 /* The formal temporary table. Should this be persistent? */
97 bool allow_rhs_cond_expr;
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);
117 /* Mark X addressable. Unlike the langhook we expect X to be in gimple
118 form and we don't do any syntax checking. */
120 mark_addressable (tree x)
122 while (handled_component_p (x))
123 x = TREE_OPERAND (x, 0);
124 if (TREE_CODE (x) != VAR_DECL && TREE_CODE (x) != PARM_DECL)
126 TREE_ADDRESSABLE (x) = 1;
129 /* Return a hash value for a formal temporary table entry. */
132 gimple_tree_hash (const void *p)
134 tree t = ((const elt_t *) p)->val;
135 return iterative_hash_expr (t, 0);
138 /* Compare two formal temporary table entries. */
141 gimple_tree_eq (const void *p1, const void *p2)
143 tree t1 = ((const elt_t *) p1)->val;
144 tree t2 = ((const elt_t *) p2)->val;
145 enum tree_code code = TREE_CODE (t1);
147 if (TREE_CODE (t2) != code
148 || TREE_TYPE (t1) != TREE_TYPE (t2))
151 if (!operand_equal_p (t1, t2, 0))
154 /* Only allow them to compare equal if they also hash equal; otherwise
155 results are nondeterminate, and we fail bootstrap comparison. */
156 gcc_assert (gimple_tree_hash (p1) == gimple_tree_hash (p2));
161 /* Set up a context for the gimplifier. */
164 push_gimplify_context (void)
166 struct gimplify_ctx *c;
168 c = (struct gimplify_ctx *) xcalloc (1, sizeof (struct gimplify_ctx));
169 c->prev_context = gimplify_ctxp;
171 c->temp_htab = htab_create (1000, gimple_tree_hash, gimple_tree_eq, free);
176 /* Tear down a context for the gimplifier. If BODY is non-null, then
177 put the temporaries into the outer BIND_EXPR. Otherwise, put them
178 in the unexpanded_var_list. */
181 pop_gimplify_context (tree body)
183 struct gimplify_ctx *c = gimplify_ctxp;
186 gcc_assert (c && !c->current_bind_expr);
187 gimplify_ctxp = c->prev_context;
189 for (t = c->temps; t ; t = TREE_CHAIN (t))
190 DECL_GIMPLE_FORMAL_TEMP_P (t) = 0;
193 declare_vars (c->temps, body, false);
195 record_vars (c->temps);
198 htab_delete (c->temp_htab);
203 gimple_push_bind_expr (tree bind)
205 TREE_CHAIN (bind) = gimplify_ctxp->current_bind_expr;
206 gimplify_ctxp->current_bind_expr = bind;
210 gimple_pop_bind_expr (void)
212 gimplify_ctxp->current_bind_expr
213 = TREE_CHAIN (gimplify_ctxp->current_bind_expr);
217 gimple_current_bind_expr (void)
219 return gimplify_ctxp->current_bind_expr;
222 /* Returns true iff there is a COND_EXPR between us and the innermost
223 CLEANUP_POINT_EXPR. This info is used by gimple_push_cleanup. */
226 gimple_conditional_context (void)
228 return gimplify_ctxp->conditions > 0;
231 /* Note that we've entered a COND_EXPR. */
234 gimple_push_condition (void)
236 #ifdef ENABLE_CHECKING
237 if (gimplify_ctxp->conditions == 0)
238 gcc_assert (!gimplify_ctxp->conditional_cleanups);
240 ++(gimplify_ctxp->conditions);
243 /* Note that we've left a COND_EXPR. If we're back at unconditional scope
244 now, add any conditional cleanups we've seen to the prequeue. */
247 gimple_pop_condition (tree *pre_p)
249 int conds = --(gimplify_ctxp->conditions);
251 gcc_assert (conds >= 0);
254 append_to_statement_list (gimplify_ctxp->conditional_cleanups, pre_p);
255 gimplify_ctxp->conditional_cleanups = NULL_TREE;
259 /* A stable comparison routine for use with splay trees and DECLs. */
262 splay_tree_compare_decl_uid (splay_tree_key xa, splay_tree_key xb)
267 return DECL_UID (a) - DECL_UID (b);
270 /* Create a new omp construct that deals with variable remapping. */
272 static struct gimplify_omp_ctx *
273 new_omp_context (bool is_parallel, bool is_combined_parallel)
275 struct gimplify_omp_ctx *c;
277 c = XCNEW (struct gimplify_omp_ctx);
278 c->outer_context = gimplify_omp_ctxp;
279 c->variables = splay_tree_new (splay_tree_compare_decl_uid, 0, 0);
280 c->privatized_types = pointer_set_create ();
281 c->location = input_location;
282 c->is_parallel = is_parallel;
283 c->is_combined_parallel = is_combined_parallel;
284 c->default_kind = OMP_CLAUSE_DEFAULT_SHARED;
289 /* Destroy an omp construct that deals with variable remapping. */
292 delete_omp_context (struct gimplify_omp_ctx *c)
294 splay_tree_delete (c->variables);
295 pointer_set_destroy (c->privatized_types);
299 static void omp_add_variable (struct gimplify_omp_ctx *, tree, unsigned int);
300 static bool omp_notice_variable (struct gimplify_omp_ctx *, tree, bool);
302 /* A subroutine of append_to_statement_list{,_force}. T is not NULL. */
305 append_to_statement_list_1 (tree t, tree *list_p)
308 tree_stmt_iterator i;
312 if (t && TREE_CODE (t) == STATEMENT_LIST)
317 *list_p = list = alloc_stmt_list ();
321 tsi_link_after (&i, t, TSI_CONTINUE_LINKING);
324 /* Add T to the end of the list container pointed to by LIST_P.
325 If T is an expression with no effects, it is ignored. */
328 append_to_statement_list (tree t, tree *list_p)
330 if (t && TREE_SIDE_EFFECTS (t))
331 append_to_statement_list_1 (t, list_p);
334 /* Similar, but the statement is always added, regardless of side effects. */
337 append_to_statement_list_force (tree t, tree *list_p)
340 append_to_statement_list_1 (t, list_p);
343 /* Both gimplify the statement T and append it to LIST_P. */
346 gimplify_and_add (tree t, tree *list_p)
349 append_to_statement_list (t, list_p);
352 /* Strip off a legitimate source ending from the input string NAME of
353 length LEN. Rather than having to know the names used by all of
354 our front ends, we strip off an ending of a period followed by
355 up to five characters. (Java uses ".class".) */
358 remove_suffix (char *name, int len)
362 for (i = 2; i < 8 && len > i; i++)
364 if (name[len - i] == '.')
366 name[len - i] = '\0';
372 /* Create a nameless artificial label and put it in the current function
373 context. Returns the newly created label. */
376 create_artificial_label (void)
378 tree lab = build_decl (LABEL_DECL, NULL_TREE, void_type_node);
380 DECL_ARTIFICIAL (lab) = 1;
381 DECL_IGNORED_P (lab) = 1;
382 DECL_CONTEXT (lab) = current_function_decl;
386 /* Subroutine for find_single_pointer_decl. */
389 find_single_pointer_decl_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
392 tree *pdecl = (tree *) data;
394 if (DECL_P (*tp) && POINTER_TYPE_P (TREE_TYPE (*tp)))
398 /* We already found a pointer decl; return anything other
399 than NULL_TREE to unwind from walk_tree signalling that
400 we have a duplicate. */
409 /* Find the single DECL of pointer type in the tree T and return it.
410 If there are zero or more than one such DECLs, return NULL. */
413 find_single_pointer_decl (tree t)
415 tree decl = NULL_TREE;
417 if (walk_tree (&t, find_single_pointer_decl_1, &decl, NULL))
419 /* find_single_pointer_decl_1 returns a nonzero value, causing
420 walk_tree to return a nonzero value, to indicate that it
421 found more than one pointer DECL. */
428 /* Create a new temporary name with PREFIX. Returns an identifier. */
430 static GTY(()) unsigned int tmp_var_id_num;
433 create_tmp_var_name (const char *prefix)
439 char *preftmp = ASTRDUP (prefix);
441 remove_suffix (preftmp, strlen (preftmp));
445 ASM_FORMAT_PRIVATE_NAME (tmp_name, prefix ? prefix : "T", tmp_var_id_num++);
446 return get_identifier (tmp_name);
450 /* Create a new temporary variable declaration of type TYPE.
451 Does NOT push it into the current binding. */
454 create_tmp_var_raw (tree type, const char *prefix)
459 /* Make the type of the variable writable. */
460 new_type = build_type_variant (type, 0, 0);
461 TYPE_ATTRIBUTES (new_type) = TYPE_ATTRIBUTES (type);
463 tmp_var = build_decl (VAR_DECL, prefix ? create_tmp_var_name (prefix) : NULL,
466 /* The variable was declared by the compiler. */
467 DECL_ARTIFICIAL (tmp_var) = 1;
468 /* And we don't want debug info for it. */
469 DECL_IGNORED_P (tmp_var) = 1;
471 /* Make the variable writable. */
472 TREE_READONLY (tmp_var) = 0;
474 DECL_EXTERNAL (tmp_var) = 0;
475 TREE_STATIC (tmp_var) = 0;
476 TREE_USED (tmp_var) = 1;
481 /* Create a new temporary variable declaration of type TYPE. DOES push the
482 variable into the current binding. Further, assume that this is called
483 only from gimplification or optimization, at which point the creation of
484 certain types are bugs. */
487 create_tmp_var (tree type, const char *prefix)
491 /* We don't allow types that are addressable (meaning we can't make copies),
492 or incomplete. We also used to reject every variable size objects here,
493 but now support those for which a constant upper bound can be obtained.
494 The processing for variable sizes is performed in gimple_add_tmp_var,
495 point at which it really matters and possibly reached via paths not going
496 through this function, e.g. after direct calls to create_tmp_var_raw. */
497 gcc_assert (!TREE_ADDRESSABLE (type) && COMPLETE_TYPE_P (type));
499 tmp_var = create_tmp_var_raw (type, prefix);
500 gimple_add_tmp_var (tmp_var);
504 /* Given a tree, try to return a useful variable name that we can use
505 to prefix a temporary that is being assigned the value of the tree.
506 I.E. given <temp> = &A, return A. */
509 get_name (const_tree t)
511 const_tree stripped_decl;
514 STRIP_NOPS (stripped_decl);
515 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
516 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
519 switch (TREE_CODE (stripped_decl))
522 return get_name (TREE_OPERAND (stripped_decl, 0));
529 /* Create a temporary with a name derived from VAL. Subroutine of
530 lookup_tmp_var; nobody else should call this function. */
533 create_tmp_from_val (tree val)
535 return create_tmp_var (TYPE_MAIN_VARIANT (TREE_TYPE (val)), get_name (val));
538 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
539 an existing expression temporary. */
542 lookup_tmp_var (tree val, bool is_formal)
546 /* If not optimizing, never really reuse a temporary. local-alloc
547 won't allocate any variable that is used in more than one basic
548 block, which means it will go into memory, causing much extra
549 work in reload and final and poorer code generation, outweighing
550 the extra memory allocation here. */
551 if (!optimize || !is_formal || TREE_SIDE_EFFECTS (val))
552 ret = create_tmp_from_val (val);
559 slot = htab_find_slot (gimplify_ctxp->temp_htab, (void *)&elt, INSERT);
562 elt_p = XNEW (elt_t);
564 elt_p->temp = ret = create_tmp_from_val (val);
565 *slot = (void *) elt_p;
569 elt_p = (elt_t *) *slot;
575 DECL_GIMPLE_FORMAL_TEMP_P (ret) = 1;
580 /* Returns a formal temporary variable initialized with VAL. PRE_P is as
581 in gimplify_expr. Only use this function if:
583 1) The value of the unfactored expression represented by VAL will not
584 change between the initialization and use of the temporary, and
585 2) The temporary will not be otherwise modified.
587 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
588 and #2 means it is inappropriate for && temps.
590 For other cases, use get_initialized_tmp_var instead. */
593 internal_get_tmp_var (tree val, tree *pre_p, tree *post_p, bool is_formal)
597 gimplify_expr (&val, pre_p, post_p, is_gimple_formal_tmp_rhs, fb_rvalue);
599 t = lookup_tmp_var (val, is_formal);
603 tree u = find_single_pointer_decl (val);
605 if (u && TREE_CODE (u) == VAR_DECL && DECL_BASED_ON_RESTRICT_P (u))
606 u = DECL_GET_RESTRICT_BASE (u);
607 if (u && TYPE_RESTRICT (TREE_TYPE (u)))
609 if (DECL_BASED_ON_RESTRICT_P (t))
610 gcc_assert (u == DECL_GET_RESTRICT_BASE (t));
613 DECL_BASED_ON_RESTRICT_P (t) = 1;
614 SET_DECL_RESTRICT_BASE (t, u);
619 if (TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
620 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
621 DECL_GIMPLE_REG_P (t) = 1;
623 mod = build2 (INIT_EXPR, TREE_TYPE (t), t, unshare_expr (val));
625 if (EXPR_HAS_LOCATION (val))
626 SET_EXPR_LOCUS (mod, EXPR_LOCUS (val));
628 SET_EXPR_LOCATION (mod, input_location);
630 /* gimplify_modify_expr might want to reduce this further. */
631 gimplify_and_add (mod, pre_p);
633 /* If we're gimplifying into ssa, gimplify_modify_expr will have
634 given our temporary an ssa name. Find and return it. */
635 if (gimplify_ctxp->into_ssa)
636 t = TREE_OPERAND (mod, 0);
641 /* Returns a formal temporary variable initialized with VAL. PRE_P
642 points to a statement list where side-effects needed to compute VAL
646 get_formal_tmp_var (tree val, tree *pre_p)
648 return internal_get_tmp_var (val, pre_p, NULL, true);
651 /* Returns a temporary variable initialized with VAL. PRE_P and POST_P
652 are as in gimplify_expr. */
655 get_initialized_tmp_var (tree val, tree *pre_p, tree *post_p)
657 return internal_get_tmp_var (val, pre_p, post_p, false);
660 /* Declares all the variables in VARS in SCOPE. If DEBUG_INFO is
661 true, generate debug info for them; otherwise don't. */
664 declare_vars (tree vars, tree scope, bool debug_info)
671 /* C99 mode puts the default 'return 0;' for main outside the outer
672 braces. So drill down until we find an actual scope. */
673 while (TREE_CODE (scope) == COMPOUND_EXPR)
674 scope = TREE_OPERAND (scope, 0);
676 gcc_assert (TREE_CODE (scope) == BIND_EXPR);
678 temps = nreverse (last);
680 block = BIND_EXPR_BLOCK (scope);
681 if (!block || !debug_info)
683 TREE_CHAIN (last) = BIND_EXPR_VARS (scope);
684 BIND_EXPR_VARS (scope) = temps;
688 /* We need to attach the nodes both to the BIND_EXPR and to its
689 associated BLOCK for debugging purposes. The key point here
690 is that the BLOCK_VARS of the BIND_EXPR_BLOCK of a BIND_EXPR
691 is a subchain of the BIND_EXPR_VARS of the BIND_EXPR. */
692 if (BLOCK_VARS (block))
693 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), temps);
696 BIND_EXPR_VARS (scope) = chainon (BIND_EXPR_VARS (scope), temps);
697 BLOCK_VARS (block) = temps;
703 /* For VAR a VAR_DECL of variable size, try to find a constant upper bound
704 for the size and adjust DECL_SIZE/DECL_SIZE_UNIT accordingly. Abort if
705 no such upper bound can be obtained. */
708 force_constant_size (tree var)
710 /* The only attempt we make is by querying the maximum size of objects
711 of the variable's type. */
713 HOST_WIDE_INT max_size;
715 gcc_assert (TREE_CODE (var) == VAR_DECL);
717 max_size = max_int_size_in_bytes (TREE_TYPE (var));
719 gcc_assert (max_size >= 0);
722 = build_int_cst (TREE_TYPE (DECL_SIZE_UNIT (var)), max_size);
724 = build_int_cst (TREE_TYPE (DECL_SIZE (var)), max_size * BITS_PER_UNIT);
728 gimple_add_tmp_var (tree tmp)
730 gcc_assert (!TREE_CHAIN (tmp) && !DECL_SEEN_IN_BIND_EXPR_P (tmp));
732 /* Later processing assumes that the object size is constant, which might
733 not be true at this point. Force the use of a constant upper bound in
735 if (!host_integerp (DECL_SIZE_UNIT (tmp), 1))
736 force_constant_size (tmp);
738 DECL_CONTEXT (tmp) = current_function_decl;
739 DECL_SEEN_IN_BIND_EXPR_P (tmp) = 1;
743 TREE_CHAIN (tmp) = gimplify_ctxp->temps;
744 gimplify_ctxp->temps = tmp;
746 /* Mark temporaries local within the nearest enclosing parallel. */
747 if (gimplify_omp_ctxp)
749 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
750 while (ctx && !ctx->is_parallel)
751 ctx = ctx->outer_context;
753 omp_add_variable (ctx, tmp, GOVD_LOCAL | GOVD_SEEN);
759 declare_vars (tmp, DECL_SAVED_TREE (current_function_decl), false);
762 /* Determines whether to assign a locus to the statement STMT. */
765 should_carry_locus_p (const_tree stmt)
767 /* Don't emit a line note for a label. We particularly don't want to
768 emit one for the break label, since it doesn't actually correspond
769 to the beginning of the loop/switch. */
770 if (TREE_CODE (stmt) == LABEL_EXPR)
773 /* Do not annotate empty statements, since it confuses gcov. */
774 if (!TREE_SIDE_EFFECTS (stmt))
781 annotate_one_with_locus (tree t, location_t locus)
783 if (CAN_HAVE_LOCATION_P (t)
784 && ! EXPR_HAS_LOCATION (t) && should_carry_locus_p (t))
785 SET_EXPR_LOCATION (t, locus);
789 annotate_all_with_locus (tree *stmt_p, location_t locus)
791 tree_stmt_iterator i;
796 for (i = tsi_start (*stmt_p); !tsi_end_p (i); tsi_next (&i))
798 tree t = tsi_stmt (i);
800 /* Assuming we've already been gimplified, we shouldn't
801 see nested chaining constructs anymore. */
802 gcc_assert (TREE_CODE (t) != STATEMENT_LIST
803 && TREE_CODE (t) != COMPOUND_EXPR);
805 annotate_one_with_locus (t, locus);
809 /* Similar to copy_tree_r() but do not copy SAVE_EXPR or TARGET_EXPR nodes.
810 These nodes model computations that should only be done once. If we
811 were to unshare something like SAVE_EXPR(i++), the gimplification
812 process would create wrong code. */
815 mostly_copy_tree_r (tree *tp, int *walk_subtrees, void *data)
817 enum tree_code code = TREE_CODE (*tp);
818 /* Don't unshare types, decls, constants and SAVE_EXPR nodes. */
819 if (TREE_CODE_CLASS (code) == tcc_type
820 || TREE_CODE_CLASS (code) == tcc_declaration
821 || TREE_CODE_CLASS (code) == tcc_constant
822 || code == SAVE_EXPR || code == TARGET_EXPR
823 /* We can't do anything sensible with a BLOCK used as an expression,
824 but we also can't just die when we see it because of non-expression
825 uses. So just avert our eyes and cross our fingers. Silly Java. */
830 gcc_assert (code != BIND_EXPR);
831 copy_tree_r (tp, walk_subtrees, data);
837 /* Callback for walk_tree to unshare most of the shared trees rooted at
838 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
839 then *TP is deep copied by calling copy_tree_r.
841 This unshares the same trees as copy_tree_r with the exception of
842 SAVE_EXPR nodes. These nodes model computations that should only be
843 done once. If we were to unshare something like SAVE_EXPR(i++), the
844 gimplification process would create wrong code. */
847 copy_if_shared_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
848 void *data ATTRIBUTE_UNUSED)
851 enum tree_code code = TREE_CODE (t);
853 /* Skip types, decls, and constants. But we do want to look at their
854 types and the bounds of types. Mark them as visited so we properly
855 unmark their subtrees on the unmark pass. If we've already seen them,
856 don't look down further. */
857 if (TREE_CODE_CLASS (code) == tcc_type
858 || TREE_CODE_CLASS (code) == tcc_declaration
859 || TREE_CODE_CLASS (code) == tcc_constant)
861 if (TREE_VISITED (t))
864 TREE_VISITED (t) = 1;
867 /* If this node has been visited already, unshare it and don't look
869 else if (TREE_VISITED (t))
871 walk_tree (tp, mostly_copy_tree_r, NULL, NULL);
875 /* Otherwise, mark the tree as visited and keep looking. */
877 TREE_VISITED (t) = 1;
883 unmark_visited_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
884 void *data ATTRIBUTE_UNUSED)
886 if (TREE_VISITED (*tp))
887 TREE_VISITED (*tp) = 0;
894 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
895 bodies of any nested functions if we are unsharing the entire body of
899 unshare_body (tree *body_p, tree fndecl)
901 struct cgraph_node *cgn = cgraph_node (fndecl);
903 walk_tree (body_p, copy_if_shared_r, NULL, NULL);
904 if (body_p == &DECL_SAVED_TREE (fndecl))
905 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
906 unshare_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
909 /* Likewise, but mark all trees as not visited. */
912 unvisit_body (tree *body_p, tree fndecl)
914 struct cgraph_node *cgn = cgraph_node (fndecl);
916 walk_tree (body_p, unmark_visited_r, NULL, NULL);
917 if (body_p == &DECL_SAVED_TREE (fndecl))
918 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
919 unvisit_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
922 /* Unshare T and all the trees reached from T via TREE_CHAIN. */
925 unshare_all_trees (tree t)
927 walk_tree (&t, copy_if_shared_r, NULL, NULL);
928 walk_tree (&t, unmark_visited_r, NULL, NULL);
931 /* Unconditionally make an unshared copy of EXPR. This is used when using
932 stored expressions which span multiple functions, such as BINFO_VTABLE,
933 as the normal unsharing process can't tell that they're shared. */
936 unshare_expr (tree expr)
938 walk_tree (&expr, mostly_copy_tree_r, NULL, NULL);
942 /* A terser interface for building a representation of an exception
946 gimple_build_eh_filter (tree body, tree allowed, tree failure)
950 /* FIXME should the allowed types go in TREE_TYPE? */
951 t = build2 (EH_FILTER_EXPR, void_type_node, allowed, NULL_TREE);
952 append_to_statement_list (failure, &EH_FILTER_FAILURE (t));
954 t = build2 (TRY_CATCH_EXPR, void_type_node, NULL_TREE, t);
955 append_to_statement_list (body, &TREE_OPERAND (t, 0));
961 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
962 contain statements and have a value. Assign its value to a temporary
963 and give it void_type_node. Returns the temporary, or NULL_TREE if
964 WRAPPER was already void. */
967 voidify_wrapper_expr (tree wrapper, tree temp)
969 tree type = TREE_TYPE (wrapper);
970 if (type && !VOID_TYPE_P (type))
974 /* Set p to point to the body of the wrapper. Loop until we find
975 something that isn't a wrapper. */
976 for (p = &wrapper; p && *p; )
978 switch (TREE_CODE (*p))
981 TREE_SIDE_EFFECTS (*p) = 1;
982 TREE_TYPE (*p) = void_type_node;
983 /* For a BIND_EXPR, the body is operand 1. */
984 p = &BIND_EXPR_BODY (*p);
987 case CLEANUP_POINT_EXPR:
988 case TRY_FINALLY_EXPR:
990 TREE_SIDE_EFFECTS (*p) = 1;
991 TREE_TYPE (*p) = void_type_node;
992 p = &TREE_OPERAND (*p, 0);
997 tree_stmt_iterator i = tsi_last (*p);
998 TREE_SIDE_EFFECTS (*p) = 1;
999 TREE_TYPE (*p) = void_type_node;
1000 p = tsi_end_p (i) ? NULL : tsi_stmt_ptr (i);
1005 /* Advance to the last statement. Set all container types to void. */
1006 for (; TREE_CODE (*p) == COMPOUND_EXPR; p = &TREE_OPERAND (*p, 1))
1008 TREE_SIDE_EFFECTS (*p) = 1;
1009 TREE_TYPE (*p) = void_type_node;
1019 if (p == NULL || IS_EMPTY_STMT (*p))
1023 /* The wrapper is on the RHS of an assignment that we're pushing
1025 gcc_assert (TREE_CODE (temp) == INIT_EXPR
1026 || TREE_CODE (temp) == GIMPLE_MODIFY_STMT
1027 || TREE_CODE (temp) == MODIFY_EXPR);
1028 GENERIC_TREE_OPERAND (temp, 1) = *p;
1033 temp = create_tmp_var (type, "retval");
1034 *p = build2 (INIT_EXPR, type, temp, *p);
1043 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
1044 a temporary through which they communicate. */
1047 build_stack_save_restore (tree *save, tree *restore)
1049 tree save_call, tmp_var;
1052 build_call_expr (implicit_built_in_decls[BUILT_IN_STACK_SAVE], 0);
1053 tmp_var = create_tmp_var (ptr_type_node, "saved_stack");
1055 *save = build_gimple_modify_stmt (tmp_var, save_call);
1057 build_call_expr (implicit_built_in_decls[BUILT_IN_STACK_RESTORE],
1061 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
1063 static enum gimplify_status
1064 gimplify_bind_expr (tree *expr_p, tree *pre_p)
1066 tree bind_expr = *expr_p;
1067 bool old_save_stack = gimplify_ctxp->save_stack;
1070 tree temp = voidify_wrapper_expr (bind_expr, NULL);
1072 /* Mark variables seen in this bind expr. */
1073 for (t = BIND_EXPR_VARS (bind_expr); t ; t = TREE_CHAIN (t))
1075 if (TREE_CODE (t) == VAR_DECL)
1077 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
1079 /* Mark variable as local. */
1080 if (ctx && !is_global_var (t)
1081 && (! DECL_SEEN_IN_BIND_EXPR_P (t)
1082 || splay_tree_lookup (ctx->variables,
1083 (splay_tree_key) t) == NULL))
1084 omp_add_variable (gimplify_omp_ctxp, t, GOVD_LOCAL | GOVD_SEEN);
1086 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
1089 /* Preliminarily mark non-addressed complex variables as eligible
1090 for promotion to gimple registers. We'll transform their uses
1092 if ((TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
1093 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
1094 && !TREE_THIS_VOLATILE (t)
1095 && (TREE_CODE (t) == VAR_DECL && !DECL_HARD_REGISTER (t))
1096 && !needs_to_live_in_memory (t))
1097 DECL_GIMPLE_REG_P (t) = 1;
1100 gimple_push_bind_expr (bind_expr);
1101 gimplify_ctxp->save_stack = false;
1103 gimplify_to_stmt_list (&BIND_EXPR_BODY (bind_expr));
1105 if (gimplify_ctxp->save_stack)
1107 tree stack_save, stack_restore;
1109 /* Save stack on entry and restore it on exit. Add a try_finally
1110 block to achieve this. Note that mudflap depends on the
1111 format of the emitted code: see mx_register_decls(). */
1112 build_stack_save_restore (&stack_save, &stack_restore);
1114 t = build2 (TRY_FINALLY_EXPR, void_type_node,
1115 BIND_EXPR_BODY (bind_expr), NULL_TREE);
1116 append_to_statement_list (stack_restore, &TREE_OPERAND (t, 1));
1118 BIND_EXPR_BODY (bind_expr) = NULL_TREE;
1119 append_to_statement_list (stack_save, &BIND_EXPR_BODY (bind_expr));
1120 append_to_statement_list (t, &BIND_EXPR_BODY (bind_expr));
1123 gimplify_ctxp->save_stack = old_save_stack;
1124 gimple_pop_bind_expr ();
1129 append_to_statement_list (bind_expr, pre_p);
1136 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1137 GIMPLE value, it is assigned to a new temporary and the statement is
1138 re-written to return the temporary.
1140 PRE_P points to the list where side effects that must happen before
1141 STMT should be stored. */
1143 static enum gimplify_status
1144 gimplify_return_expr (tree stmt, tree *pre_p)
1146 tree ret_expr = TREE_OPERAND (stmt, 0);
1147 tree result_decl, result;
1149 if (!ret_expr || TREE_CODE (ret_expr) == RESULT_DECL
1150 || ret_expr == error_mark_node)
1153 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
1154 result_decl = NULL_TREE;
1157 result_decl = GENERIC_TREE_OPERAND (ret_expr, 0);
1158 if (TREE_CODE (result_decl) == INDIRECT_REF)
1159 /* See through a return by reference. */
1160 result_decl = TREE_OPERAND (result_decl, 0);
1162 gcc_assert ((TREE_CODE (ret_expr) == MODIFY_EXPR
1163 || TREE_CODE (ret_expr) == GIMPLE_MODIFY_STMT
1164 || TREE_CODE (ret_expr) == INIT_EXPR)
1165 && TREE_CODE (result_decl) == RESULT_DECL);
1168 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1169 Recall that aggregate_value_p is FALSE for any aggregate type that is
1170 returned in registers. If we're returning values in registers, then
1171 we don't want to extend the lifetime of the RESULT_DECL, particularly
1172 across another call. In addition, for those aggregates for which
1173 hard_function_value generates a PARALLEL, we'll die during normal
1174 expansion of structure assignments; there's special code in expand_return
1175 to handle this case that does not exist in expand_expr. */
1177 || aggregate_value_p (result_decl, TREE_TYPE (current_function_decl)))
1178 result = result_decl;
1179 else if (gimplify_ctxp->return_temp)
1180 result = gimplify_ctxp->return_temp;
1183 result = create_tmp_var (TREE_TYPE (result_decl), NULL);
1184 if (TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
1185 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
1186 DECL_GIMPLE_REG_P (result) = 1;
1188 /* ??? With complex control flow (usually involving abnormal edges),
1189 we can wind up warning about an uninitialized value for this. Due
1190 to how this variable is constructed and initialized, this is never
1191 true. Give up and never warn. */
1192 TREE_NO_WARNING (result) = 1;
1194 gimplify_ctxp->return_temp = result;
1197 /* Smash the lhs of the GIMPLE_MODIFY_STMT to the temporary we plan to use.
1198 Then gimplify the whole thing. */
1199 if (result != result_decl)
1200 GENERIC_TREE_OPERAND (ret_expr, 0) = result;
1202 gimplify_and_add (TREE_OPERAND (stmt, 0), pre_p);
1204 /* If we didn't use a temporary, then the result is just the result_decl.
1205 Otherwise we need a simple copy. This should already be gimple. */
1206 if (result == result_decl)
1209 ret_expr = build_gimple_modify_stmt (result_decl, result);
1210 TREE_OPERAND (stmt, 0) = ret_expr;
1216 gimplify_vla_decl (tree decl, tree *stmt_p)
1218 /* This is a variable-sized decl. Simplify its size and mark it
1219 for deferred expansion. Note that mudflap depends on the format
1220 of the emitted code: see mx_register_decls(). */
1221 tree t, addr, ptr_type;
1223 gimplify_one_sizepos (&DECL_SIZE (decl), stmt_p);
1224 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl), stmt_p);
1226 /* All occurrences of this decl in final gimplified code will be
1227 replaced by indirection. Setting DECL_VALUE_EXPR does two
1228 things: First, it lets the rest of the gimplifier know what
1229 replacement to use. Second, it lets the debug info know
1230 where to find the value. */
1231 ptr_type = build_pointer_type (TREE_TYPE (decl));
1232 addr = create_tmp_var (ptr_type, get_name (decl));
1233 DECL_IGNORED_P (addr) = 0;
1234 t = build_fold_indirect_ref (addr);
1235 SET_DECL_VALUE_EXPR (decl, t);
1236 DECL_HAS_VALUE_EXPR_P (decl) = 1;
1238 t = built_in_decls[BUILT_IN_ALLOCA];
1239 t = build_call_expr (t, 1, DECL_SIZE_UNIT (decl));
1240 t = fold_convert (ptr_type, t);
1241 t = build_gimple_modify_stmt (addr, t);
1243 gimplify_and_add (t, stmt_p);
1245 /* Indicate that we need to restore the stack level when the
1246 enclosing BIND_EXPR is exited. */
1247 gimplify_ctxp->save_stack = true;
1250 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
1251 and initialization explicit. */
1253 static enum gimplify_status
1254 gimplify_decl_expr (tree *stmt_p)
1256 tree stmt = *stmt_p;
1257 tree decl = DECL_EXPR_DECL (stmt);
1259 *stmt_p = NULL_TREE;
1261 if (TREE_TYPE (decl) == error_mark_node)
1264 if ((TREE_CODE (decl) == TYPE_DECL
1265 || TREE_CODE (decl) == VAR_DECL)
1266 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl)))
1267 gimplify_type_sizes (TREE_TYPE (decl), stmt_p);
1269 if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl))
1271 tree init = DECL_INITIAL (decl);
1273 if (TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
1274 gimplify_vla_decl (decl, stmt_p);
1276 if (init && init != error_mark_node)
1278 if (!TREE_STATIC (decl))
1280 DECL_INITIAL (decl) = NULL_TREE;
1281 init = build2 (INIT_EXPR, void_type_node, decl, init);
1282 gimplify_and_add (init, stmt_p);
1285 /* We must still examine initializers for static variables
1286 as they may contain a label address. */
1287 walk_tree (&init, force_labels_r, NULL, NULL);
1290 /* Some front ends do not explicitly declare all anonymous
1291 artificial variables. We compensate here by declaring the
1292 variables, though it would be better if the front ends would
1293 explicitly declare them. */
1294 if (!DECL_SEEN_IN_BIND_EXPR_P (decl)
1295 && DECL_ARTIFICIAL (decl) && DECL_NAME (decl) == NULL_TREE)
1296 gimple_add_tmp_var (decl);
1302 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1303 and replacing the LOOP_EXPR with goto, but if the loop contains an
1304 EXIT_EXPR, we need to append a label for it to jump to. */
1306 static enum gimplify_status
1307 gimplify_loop_expr (tree *expr_p, tree *pre_p)
1309 tree saved_label = gimplify_ctxp->exit_label;
1310 tree start_label = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
1311 tree jump_stmt = build_and_jump (&LABEL_EXPR_LABEL (start_label));
1313 append_to_statement_list (start_label, pre_p);
1315 gimplify_ctxp->exit_label = NULL_TREE;
1317 gimplify_and_add (LOOP_EXPR_BODY (*expr_p), pre_p);
1319 if (gimplify_ctxp->exit_label)
1321 append_to_statement_list (jump_stmt, pre_p);
1322 *expr_p = build1 (LABEL_EXPR, void_type_node, gimplify_ctxp->exit_label);
1325 *expr_p = jump_stmt;
1327 gimplify_ctxp->exit_label = saved_label;
1332 /* Compare two case labels. Because the front end should already have
1333 made sure that case ranges do not overlap, it is enough to only compare
1334 the CASE_LOW values of each case label. */
1337 compare_case_labels (const void *p1, const void *p2)
1339 const_tree const case1 = *(const_tree const*)p1;
1340 const_tree const case2 = *(const_tree const*)p2;
1342 return tree_int_cst_compare (CASE_LOW (case1), CASE_LOW (case2));
1345 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1348 sort_case_labels (tree label_vec)
1350 size_t len = TREE_VEC_LENGTH (label_vec);
1351 tree default_case = TREE_VEC_ELT (label_vec, len - 1);
1353 if (CASE_LOW (default_case))
1357 /* The last label in the vector should be the default case
1359 for (i = 0; i < len; ++i)
1361 tree t = TREE_VEC_ELT (label_vec, i);
1365 TREE_VEC_ELT (label_vec, i) = TREE_VEC_ELT (label_vec, len - 1);
1366 TREE_VEC_ELT (label_vec, len - 1) = default_case;
1372 qsort (&TREE_VEC_ELT (label_vec, 0), len - 1, sizeof (tree),
1373 compare_case_labels);
1376 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1379 static enum gimplify_status
1380 gimplify_switch_expr (tree *expr_p, tree *pre_p)
1382 tree switch_expr = *expr_p;
1383 enum gimplify_status ret;
1385 ret = gimplify_expr (&SWITCH_COND (switch_expr), pre_p, NULL,
1386 is_gimple_val, fb_rvalue);
1388 if (SWITCH_BODY (switch_expr))
1390 VEC(tree,heap) *labels, *saved_labels;
1391 tree label_vec, default_case = NULL_TREE;
1394 /* If someone can be bothered to fill in the labels, they can
1395 be bothered to null out the body too. */
1396 gcc_assert (!SWITCH_LABELS (switch_expr));
1398 saved_labels = gimplify_ctxp->case_labels;
1399 gimplify_ctxp->case_labels = VEC_alloc (tree, heap, 8);
1401 gimplify_to_stmt_list (&SWITCH_BODY (switch_expr));
1403 labels = gimplify_ctxp->case_labels;
1404 gimplify_ctxp->case_labels = saved_labels;
1407 while (i < VEC_length (tree, labels))
1409 tree elt = VEC_index (tree, labels, i);
1410 tree low = CASE_LOW (elt);
1411 bool remove_element = FALSE;
1415 /* Discard empty ranges. */
1416 tree high = CASE_HIGH (elt);
1417 if (high && tree_int_cst_lt (high, low))
1418 remove_element = TRUE;
1422 /* The default case must be the last label in the list. */
1423 gcc_assert (!default_case);
1425 remove_element = TRUE;
1429 VEC_ordered_remove (tree, labels, i);
1435 label_vec = make_tree_vec (len + 1);
1436 SWITCH_LABELS (*expr_p) = label_vec;
1437 append_to_statement_list (switch_expr, pre_p);
1441 /* If the switch has no default label, add one, so that we jump
1442 around the switch body. */
1443 default_case = build3 (CASE_LABEL_EXPR, void_type_node, NULL_TREE,
1444 NULL_TREE, create_artificial_label ());
1445 append_to_statement_list (SWITCH_BODY (switch_expr), pre_p);
1446 *expr_p = build1 (LABEL_EXPR, void_type_node,
1447 CASE_LABEL (default_case));
1450 *expr_p = SWITCH_BODY (switch_expr);
1452 for (i = 0; i < len; ++i)
1453 TREE_VEC_ELT (label_vec, i) = VEC_index (tree, labels, i);
1454 TREE_VEC_ELT (label_vec, len) = default_case;
1456 VEC_free (tree, heap, labels);
1458 sort_case_labels (label_vec);
1460 SWITCH_BODY (switch_expr) = NULL;
1463 gcc_assert (SWITCH_LABELS (switch_expr));
1468 static enum gimplify_status
1469 gimplify_case_label_expr (tree *expr_p)
1471 tree expr = *expr_p;
1472 struct gimplify_ctx *ctxp;
1474 /* Invalid OpenMP programs can play Duff's Device type games with
1475 #pragma omp parallel. At least in the C front end, we don't
1476 detect such invalid branches until after gimplification. */
1477 for (ctxp = gimplify_ctxp; ; ctxp = ctxp->prev_context)
1478 if (ctxp->case_labels)
1481 VEC_safe_push (tree, heap, ctxp->case_labels, expr);
1482 *expr_p = build1 (LABEL_EXPR, void_type_node, CASE_LABEL (expr));
1486 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1490 build_and_jump (tree *label_p)
1492 if (label_p == NULL)
1493 /* If there's nowhere to jump, just fall through. */
1496 if (*label_p == NULL_TREE)
1498 tree label = create_artificial_label ();
1502 return build1 (GOTO_EXPR, void_type_node, *label_p);
1505 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1506 This also involves building a label to jump to and communicating it to
1507 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1509 static enum gimplify_status
1510 gimplify_exit_expr (tree *expr_p)
1512 tree cond = TREE_OPERAND (*expr_p, 0);
1515 expr = build_and_jump (&gimplify_ctxp->exit_label);
1516 expr = build3 (COND_EXPR, void_type_node, cond, expr, NULL_TREE);
1522 /* A helper function to be called via walk_tree. Mark all labels under *TP
1523 as being forced. To be called for DECL_INITIAL of static variables. */
1526 force_labels_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
1530 if (TREE_CODE (*tp) == LABEL_DECL)
1531 FORCED_LABEL (*tp) = 1;
1536 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1537 different from its canonical type, wrap the whole thing inside a
1538 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1541 The canonical type of a COMPONENT_REF is the type of the field being
1542 referenced--unless the field is a bit-field which can be read directly
1543 in a smaller mode, in which case the canonical type is the
1544 sign-appropriate type corresponding to that mode. */
1547 canonicalize_component_ref (tree *expr_p)
1549 tree expr = *expr_p;
1552 gcc_assert (TREE_CODE (expr) == COMPONENT_REF);
1554 if (INTEGRAL_TYPE_P (TREE_TYPE (expr)))
1555 type = TREE_TYPE (get_unwidened (expr, NULL_TREE));
1557 type = TREE_TYPE (TREE_OPERAND (expr, 1));
1559 /* One could argue that all the stuff below is not necessary for
1560 the non-bitfield case and declare it a FE error if type
1561 adjustment would be needed. */
1562 if (TREE_TYPE (expr) != type)
1564 #ifdef ENABLE_TYPES_CHECKING
1565 tree old_type = TREE_TYPE (expr);
1569 /* We need to preserve qualifiers and propagate them from
1571 type_quals = TYPE_QUALS (type)
1572 | TYPE_QUALS (TREE_TYPE (TREE_OPERAND (expr, 0)));
1573 if (TYPE_QUALS (type) != type_quals)
1574 type = build_qualified_type (TYPE_MAIN_VARIANT (type), type_quals);
1576 /* Set the type of the COMPONENT_REF to the underlying type. */
1577 TREE_TYPE (expr) = type;
1579 #ifdef ENABLE_TYPES_CHECKING
1580 /* It is now a FE error, if the conversion from the canonical
1581 type to the original expression type is not useless. */
1582 gcc_assert (useless_type_conversion_p (old_type, type));
1587 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1588 to foo, embed that change in the ADDR_EXPR by converting
1593 where L is the lower bound. For simplicity, only do this for constant
1595 The constraint is that the type of &array[L] is trivially convertible
1599 canonicalize_addr_expr (tree *expr_p)
1601 tree expr = *expr_p;
1602 tree addr_expr = TREE_OPERAND (expr, 0);
1603 tree datype, ddatype, pddatype;
1605 /* We simplify only conversions from an ADDR_EXPR to a pointer type. */
1606 if (!POINTER_TYPE_P (TREE_TYPE (expr))
1607 || TREE_CODE (addr_expr) != ADDR_EXPR)
1610 /* The addr_expr type should be a pointer to an array. */
1611 datype = TREE_TYPE (TREE_TYPE (addr_expr));
1612 if (TREE_CODE (datype) != ARRAY_TYPE)
1615 /* The pointer to element type shall be trivially convertible to
1616 the expression pointer type. */
1617 ddatype = TREE_TYPE (datype);
1618 pddatype = build_pointer_type (ddatype);
1619 if (!useless_type_conversion_p (pddatype, ddatype))
1622 /* The lower bound and element sizes must be constant. */
1623 if (!TYPE_SIZE_UNIT (ddatype)
1624 || TREE_CODE (TYPE_SIZE_UNIT (ddatype)) != INTEGER_CST
1625 || !TYPE_DOMAIN (datype) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype))
1626 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype))) != INTEGER_CST)
1629 /* All checks succeeded. Build a new node to merge the cast. */
1630 *expr_p = build4 (ARRAY_REF, ddatype, TREE_OPERAND (addr_expr, 0),
1631 TYPE_MIN_VALUE (TYPE_DOMAIN (datype)),
1632 NULL_TREE, NULL_TREE);
1633 *expr_p = build1 (ADDR_EXPR, pddatype, *expr_p);
1636 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1637 underneath as appropriate. */
1639 static enum gimplify_status
1640 gimplify_conversion (tree *expr_p)
1643 gcc_assert (TREE_CODE (*expr_p) == NOP_EXPR
1644 || TREE_CODE (*expr_p) == CONVERT_EXPR);
1646 /* Then strip away all but the outermost conversion. */
1647 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p, 0));
1649 /* And remove the outermost conversion if it's useless. */
1650 if (tree_ssa_useless_type_conversion (*expr_p))
1651 *expr_p = TREE_OPERAND (*expr_p, 0);
1653 /* Attempt to avoid NOP_EXPR by producing reference to a subtype.
1654 For example this fold (subclass *)&A into &A->subclass avoiding
1655 a need for statement. */
1656 if (TREE_CODE (*expr_p) == NOP_EXPR
1657 && POINTER_TYPE_P (TREE_TYPE (*expr_p))
1658 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p, 0)))
1659 && (tem = maybe_fold_offset_to_reference
1660 (TREE_OPERAND (*expr_p, 0),
1661 integer_zero_node, TREE_TYPE (TREE_TYPE (*expr_p)))))
1663 tree ptr_type = build_pointer_type (TREE_TYPE (tem));
1664 if (useless_type_conversion_p (TREE_TYPE (*expr_p), ptr_type))
1665 *expr_p = build_fold_addr_expr_with_type (tem, ptr_type);
1668 /* If we still have a conversion at the toplevel,
1669 then canonicalize some constructs. */
1670 if (TREE_CODE (*expr_p) == NOP_EXPR || TREE_CODE (*expr_p) == CONVERT_EXPR)
1672 tree sub = TREE_OPERAND (*expr_p, 0);
1674 /* If a NOP conversion is changing the type of a COMPONENT_REF
1675 expression, then canonicalize its type now in order to expose more
1676 redundant conversions. */
1677 if (TREE_CODE (sub) == COMPONENT_REF)
1678 canonicalize_component_ref (&TREE_OPERAND (*expr_p, 0));
1680 /* If a NOP conversion is changing a pointer to array of foo
1681 to a pointer to foo, embed that change in the ADDR_EXPR. */
1682 else if (TREE_CODE (sub) == ADDR_EXPR)
1683 canonicalize_addr_expr (expr_p);
1689 /* Gimplify a VAR_DECL or PARM_DECL. Returns GS_OK if we expanded a
1690 DECL_VALUE_EXPR, and it's worth re-examining things. */
1692 static enum gimplify_status
1693 gimplify_var_or_parm_decl (tree *expr_p)
1695 tree decl = *expr_p;
1697 /* ??? If this is a local variable, and it has not been seen in any
1698 outer BIND_EXPR, then it's probably the result of a duplicate
1699 declaration, for which we've already issued an error. It would
1700 be really nice if the front end wouldn't leak these at all.
1701 Currently the only known culprit is C++ destructors, as seen
1702 in g++.old-deja/g++.jason/binding.C. */
1703 if (TREE_CODE (decl) == VAR_DECL
1704 && !DECL_SEEN_IN_BIND_EXPR_P (decl)
1705 && !TREE_STATIC (decl) && !DECL_EXTERNAL (decl)
1706 && decl_function_context (decl) == current_function_decl)
1708 gcc_assert (errorcount || sorrycount);
1712 /* When within an OpenMP context, notice uses of variables. */
1713 if (gimplify_omp_ctxp && omp_notice_variable (gimplify_omp_ctxp, decl, true))
1716 /* If the decl is an alias for another expression, substitute it now. */
1717 if (DECL_HAS_VALUE_EXPR_P (decl))
1719 *expr_p = unshare_expr (DECL_VALUE_EXPR (decl));
1727 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1728 node pointed to by EXPR_P.
1731 : min_lval '[' val ']'
1733 | compound_lval '[' val ']'
1734 | compound_lval '.' ID
1736 This is not part of the original SIMPLE definition, which separates
1737 array and member references, but it seems reasonable to handle them
1738 together. Also, this way we don't run into problems with union
1739 aliasing; gcc requires that for accesses through a union to alias, the
1740 union reference must be explicit, which was not always the case when we
1741 were splitting up array and member refs.
1743 PRE_P points to the list where side effects that must happen before
1744 *EXPR_P should be stored.
1746 POST_P points to the list where side effects that must happen after
1747 *EXPR_P should be stored. */
1749 static enum gimplify_status
1750 gimplify_compound_lval (tree *expr_p, tree *pre_p,
1751 tree *post_p, fallback_t fallback)
1754 VEC(tree,heap) *stack;
1755 enum gimplify_status ret = GS_OK, tret;
1758 /* Create a stack of the subexpressions so later we can walk them in
1759 order from inner to outer. */
1760 stack = VEC_alloc (tree, heap, 10);
1762 /* We can handle anything that get_inner_reference can deal with. */
1763 for (p = expr_p; ; p = &TREE_OPERAND (*p, 0))
1766 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1767 if (TREE_CODE (*p) == INDIRECT_REF)
1768 *p = fold_indirect_ref (*p);
1770 if (handled_component_p (*p))
1772 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
1773 additional COMPONENT_REFs. */
1774 else if ((TREE_CODE (*p) == VAR_DECL || TREE_CODE (*p) == PARM_DECL)
1775 && gimplify_var_or_parm_decl (p) == GS_OK)
1780 VEC_safe_push (tree, heap, stack, *p);
1783 gcc_assert (VEC_length (tree, stack));
1785 /* Now STACK is a stack of pointers to all the refs we've walked through
1786 and P points to the innermost expression.
1788 Java requires that we elaborated nodes in source order. That
1789 means we must gimplify the inner expression followed by each of
1790 the indices, in order. But we can't gimplify the inner
1791 expression until we deal with any variable bounds, sizes, or
1792 positions in order to deal with PLACEHOLDER_EXPRs.
1794 So we do this in three steps. First we deal with the annotations
1795 for any variables in the components, then we gimplify the base,
1796 then we gimplify any indices, from left to right. */
1797 for (i = VEC_length (tree, stack) - 1; i >= 0; i--)
1799 tree t = VEC_index (tree, stack, i);
1801 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
1803 /* Gimplify the low bound and element type size and put them into
1804 the ARRAY_REF. If these values are set, they have already been
1806 if (!TREE_OPERAND (t, 2))
1808 tree low = unshare_expr (array_ref_low_bound (t));
1809 if (!is_gimple_min_invariant (low))
1811 TREE_OPERAND (t, 2) = low;
1812 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1813 is_gimple_formal_tmp_reg, fb_rvalue);
1814 ret = MIN (ret, tret);
1818 if (!TREE_OPERAND (t, 3))
1820 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (t, 0)));
1821 tree elmt_size = unshare_expr (array_ref_element_size (t));
1822 tree factor = size_int (TYPE_ALIGN_UNIT (elmt_type));
1824 /* Divide the element size by the alignment of the element
1826 elmt_size = size_binop (EXACT_DIV_EXPR, elmt_size, factor);
1828 if (!is_gimple_min_invariant (elmt_size))
1830 TREE_OPERAND (t, 3) = elmt_size;
1831 tret = gimplify_expr (&TREE_OPERAND (t, 3), pre_p, post_p,
1832 is_gimple_formal_tmp_reg, fb_rvalue);
1833 ret = MIN (ret, tret);
1837 else if (TREE_CODE (t) == COMPONENT_REF)
1839 /* Set the field offset into T and gimplify it. */
1840 if (!TREE_OPERAND (t, 2))
1842 tree offset = unshare_expr (component_ref_field_offset (t));
1843 tree field = TREE_OPERAND (t, 1);
1845 = size_int (DECL_OFFSET_ALIGN (field) / BITS_PER_UNIT);
1847 /* Divide the offset by its alignment. */
1848 offset = size_binop (EXACT_DIV_EXPR, offset, factor);
1850 if (!is_gimple_min_invariant (offset))
1852 TREE_OPERAND (t, 2) = offset;
1853 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1854 is_gimple_formal_tmp_reg, fb_rvalue);
1855 ret = MIN (ret, tret);
1861 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
1862 so as to match the min_lval predicate. Failure to do so may result
1863 in the creation of large aggregate temporaries. */
1864 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval,
1865 fallback | fb_lvalue);
1866 ret = MIN (ret, tret);
1868 /* And finally, the indices and operands to BIT_FIELD_REF. During this
1869 loop we also remove any useless conversions. */
1870 for (; VEC_length (tree, stack) > 0; )
1872 tree t = VEC_pop (tree, stack);
1874 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
1876 /* Gimplify the dimension.
1877 Temporary fix for gcc.c-torture/execute/20040313-1.c.
1878 Gimplify non-constant array indices into a temporary
1880 FIXME - The real fix is to gimplify post-modify
1881 expressions into a minimal gimple lvalue. However, that
1882 exposes bugs in alias analysis. The alias analyzer does
1883 not handle &PTR->FIELD very well. Will fix after the
1884 branch is merged into mainline (dnovillo 2004-05-03). */
1885 if (!is_gimple_min_invariant (TREE_OPERAND (t, 1)))
1887 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
1888 is_gimple_formal_tmp_reg, fb_rvalue);
1889 ret = MIN (ret, tret);
1892 else if (TREE_CODE (t) == BIT_FIELD_REF)
1894 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
1895 is_gimple_val, fb_rvalue);
1896 ret = MIN (ret, tret);
1897 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1898 is_gimple_val, fb_rvalue);
1899 ret = MIN (ret, tret);
1902 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t, 0));
1904 /* The innermost expression P may have originally had TREE_SIDE_EFFECTS
1905 set which would have caused all the outer expressions in EXPR_P
1906 leading to P to also have had TREE_SIDE_EFFECTS set. */
1907 recalculate_side_effects (t);
1910 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval, fallback);
1911 ret = MIN (ret, tret);
1913 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
1914 if ((fallback & fb_rvalue) && TREE_CODE (*expr_p) == COMPONENT_REF)
1916 canonicalize_component_ref (expr_p);
1917 ret = MIN (ret, GS_OK);
1920 VEC_free (tree, heap, stack);
1925 /* Gimplify the self modifying expression pointed to by EXPR_P
1928 PRE_P points to the list where side effects that must happen before
1929 *EXPR_P should be stored.
1931 POST_P points to the list where side effects that must happen after
1932 *EXPR_P should be stored.
1934 WANT_VALUE is nonzero iff we want to use the value of this expression
1935 in another expression. */
1937 static enum gimplify_status
1938 gimplify_self_mod_expr (tree *expr_p, tree *pre_p, tree *post_p,
1941 enum tree_code code;
1942 tree lhs, lvalue, rhs, t1, post = NULL, *orig_post_p = post_p;
1944 enum tree_code arith_code;
1945 enum gimplify_status ret;
1947 code = TREE_CODE (*expr_p);
1949 gcc_assert (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR
1950 || code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR);
1952 /* Prefix or postfix? */
1953 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
1954 /* Faster to treat as prefix if result is not used. */
1955 postfix = want_value;
1959 /* For postfix, make sure the inner expression's post side effects
1960 are executed after side effects from this expression. */
1964 /* Add or subtract? */
1965 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
1966 arith_code = PLUS_EXPR;
1968 arith_code = MINUS_EXPR;
1970 /* Gimplify the LHS into a GIMPLE lvalue. */
1971 lvalue = TREE_OPERAND (*expr_p, 0);
1972 ret = gimplify_expr (&lvalue, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
1973 if (ret == GS_ERROR)
1976 /* Extract the operands to the arithmetic operation. */
1978 rhs = TREE_OPERAND (*expr_p, 1);
1980 /* For postfix operator, we evaluate the LHS to an rvalue and then use
1981 that as the result value and in the postqueue operation. */
1984 ret = gimplify_expr (&lhs, pre_p, post_p, is_gimple_val, fb_rvalue);
1985 if (ret == GS_ERROR)
1989 /* For POINTERs increment, use POINTER_PLUS_EXPR. */
1990 if (POINTER_TYPE_P (TREE_TYPE (lhs)))
1992 rhs = fold_convert (sizetype, rhs);
1993 if (arith_code == MINUS_EXPR)
1994 rhs = fold_build1 (NEGATE_EXPR, TREE_TYPE (rhs), rhs);
1995 arith_code = POINTER_PLUS_EXPR;
1998 t1 = build2 (arith_code, TREE_TYPE (*expr_p), lhs, rhs);
1999 t1 = build_gimple_modify_stmt (lvalue, t1);
2003 gimplify_and_add (t1, orig_post_p);
2004 append_to_statement_list (post, orig_post_p);
2015 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
2018 maybe_with_size_expr (tree *expr_p)
2020 tree expr = *expr_p;
2021 tree type = TREE_TYPE (expr);
2024 /* If we've already wrapped this or the type is error_mark_node, we can't do
2026 if (TREE_CODE (expr) == WITH_SIZE_EXPR
2027 || type == error_mark_node)
2030 /* If the size isn't known or is a constant, we have nothing to do. */
2031 size = TYPE_SIZE_UNIT (type);
2032 if (!size || TREE_CODE (size) == INTEGER_CST)
2035 /* Otherwise, make a WITH_SIZE_EXPR. */
2036 size = unshare_expr (size);
2037 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, expr);
2038 *expr_p = build2 (WITH_SIZE_EXPR, type, expr, size);
2041 /* Subroutine of gimplify_call_expr: Gimplify a single argument. */
2043 static enum gimplify_status
2044 gimplify_arg (tree *expr_p, tree *pre_p)
2046 bool (*test) (tree);
2049 /* In general, we allow lvalues for function arguments to avoid
2050 extra overhead of copying large aggregates out of even larger
2051 aggregates into temporaries only to copy the temporaries to
2052 the argument list. Make optimizers happy by pulling out to
2053 temporaries those types that fit in registers. */
2054 if (is_gimple_reg_type (TREE_TYPE (*expr_p)))
2055 test = is_gimple_val, fb = fb_rvalue;
2057 test = is_gimple_lvalue, fb = fb_either;
2059 /* If this is a variable sized type, we must remember the size. */
2060 maybe_with_size_expr (expr_p);
2062 /* There is a sequence point before a function call. Side effects in
2063 the argument list must occur before the actual call. So, when
2064 gimplifying arguments, force gimplify_expr to use an internal
2065 post queue which is then appended to the end of PRE_P. */
2066 return gimplify_expr (expr_p, pre_p, NULL, test, fb);
2069 /* Gimplify the CALL_EXPR node pointed to by EXPR_P. PRE_P points to the
2070 list where side effects that must happen before *EXPR_P should be stored.
2071 WANT_VALUE is true if the result of the call is desired. */
2073 static enum gimplify_status
2074 gimplify_call_expr (tree *expr_p, tree *pre_p, bool want_value)
2076 tree decl, parms, p;
2077 enum gimplify_status ret;
2080 gcc_assert (TREE_CODE (*expr_p) == CALL_EXPR);
2082 /* For reliable diagnostics during inlining, it is necessary that
2083 every call_expr be annotated with file and line. */
2084 if (! EXPR_HAS_LOCATION (*expr_p))
2085 SET_EXPR_LOCATION (*expr_p, input_location);
2087 /* This may be a call to a builtin function.
2089 Builtin function calls may be transformed into different
2090 (and more efficient) builtin function calls under certain
2091 circumstances. Unfortunately, gimplification can muck things
2092 up enough that the builtin expanders are not aware that certain
2093 transformations are still valid.
2095 So we attempt transformation/gimplification of the call before
2096 we gimplify the CALL_EXPR. At this time we do not manage to
2097 transform all calls in the same manner as the expanders do, but
2098 we do transform most of them. */
2099 decl = get_callee_fndecl (*expr_p);
2100 if (decl && DECL_BUILT_IN (decl))
2102 tree new = fold_call_expr (*expr_p, !want_value);
2104 if (new && new != *expr_p)
2106 /* There was a transformation of this call which computes the
2107 same value, but in a more efficient way. Return and try
2113 if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
2114 && DECL_FUNCTION_CODE (decl) == BUILT_IN_VA_START)
2116 if (call_expr_nargs (*expr_p) < 2)
2118 error ("too few arguments to function %<va_start%>");
2119 *expr_p = build_empty_stmt ();
2123 if (fold_builtin_next_arg (*expr_p, true))
2125 *expr_p = build_empty_stmt ();
2128 /* Avoid gimplifying the second argument to va_start, which needs
2129 to be the plain PARM_DECL. */
2130 return gimplify_arg (&CALL_EXPR_ARG (*expr_p, 0), pre_p);
2134 /* There is a sequence point before the call, so any side effects in
2135 the calling expression must occur before the actual call. Force
2136 gimplify_expr to use an internal post queue. */
2137 ret = gimplify_expr (&CALL_EXPR_FN (*expr_p), pre_p, NULL,
2138 is_gimple_call_addr, fb_rvalue);
2140 nargs = call_expr_nargs (*expr_p);
2142 /* Get argument types for verification. */
2143 decl = get_callee_fndecl (*expr_p);
2146 parms = TYPE_ARG_TYPES (TREE_TYPE (decl));
2147 else if (POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_FN (*expr_p))))
2148 parms = TYPE_ARG_TYPES (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (*expr_p))));
2150 /* Verify if the type of the argument matches that of the function
2151 declaration. If we cannot verify this or there is a mismatch,
2152 mark the call expression so it doesn't get inlined later. */
2153 if (decl && DECL_ARGUMENTS (decl))
2155 for (i = 0, p = DECL_ARGUMENTS (decl); i < nargs;
2156 i++, p = TREE_CHAIN (p))
2158 /* We cannot distinguish a varargs function from the case
2159 of excess parameters, still deferring the inlining decision
2160 to the callee is possible. */
2163 if (p == error_mark_node
2164 || CALL_EXPR_ARG (*expr_p, i) == error_mark_node
2165 || !fold_convertible_p (DECL_ARG_TYPE (p),
2166 CALL_EXPR_ARG (*expr_p, i)))
2168 CALL_CANNOT_INLINE_P (*expr_p) = 1;
2175 for (i = 0, p = parms; i < nargs; i++, p = TREE_CHAIN (p))
2177 /* If this is a varargs function defer inlining decision
2181 if (TREE_VALUE (p) == error_mark_node
2182 || CALL_EXPR_ARG (*expr_p, i) == error_mark_node
2183 || TREE_CODE (TREE_VALUE (p)) == VOID_TYPE
2184 || !fold_convertible_p (TREE_VALUE (p),
2185 CALL_EXPR_ARG (*expr_p, i)))
2187 CALL_CANNOT_INLINE_P (*expr_p) = 1;
2195 CALL_CANNOT_INLINE_P (*expr_p) = 1;
2200 /* If the last argument is __builtin_va_arg_pack () and it is not
2201 passed as a named argument, decrease the number of CALL_EXPR
2202 arguments and set instead the CALL_EXPR_VA_ARG_PACK flag. */
2205 && TREE_CODE (CALL_EXPR_ARG (*expr_p, nargs - 1)) == CALL_EXPR)
2207 tree last_arg = CALL_EXPR_ARG (*expr_p, nargs - 1);
2208 tree last_arg_fndecl = get_callee_fndecl (last_arg);
2211 && TREE_CODE (last_arg_fndecl) == FUNCTION_DECL
2212 && DECL_BUILT_IN_CLASS (last_arg_fndecl) == BUILT_IN_NORMAL
2213 && DECL_FUNCTION_CODE (last_arg_fndecl) == BUILT_IN_VA_ARG_PACK)
2215 tree call = *expr_p;
2218 *expr_p = build_call_array (TREE_TYPE (call), CALL_EXPR_FN (call),
2219 nargs, CALL_EXPR_ARGP (call));
2220 /* Copy all CALL_EXPR flags, locus and block, except
2221 CALL_EXPR_VA_ARG_PACK flag. */
2222 CALL_EXPR_STATIC_CHAIN (*expr_p) = CALL_EXPR_STATIC_CHAIN (call);
2223 CALL_EXPR_TAILCALL (*expr_p) = CALL_EXPR_TAILCALL (call);
2224 CALL_EXPR_RETURN_SLOT_OPT (*expr_p)
2225 = CALL_EXPR_RETURN_SLOT_OPT (call);
2226 CALL_FROM_THUNK_P (*expr_p) = CALL_FROM_THUNK_P (call);
2227 CALL_CANNOT_INLINE_P (*expr_p)
2228 = CALL_CANNOT_INLINE_P (call);
2229 TREE_NOTHROW (*expr_p) = TREE_NOTHROW (call);
2230 SET_EXPR_LOCUS (*expr_p, EXPR_LOCUS (call));
2231 TREE_BLOCK (*expr_p) = TREE_BLOCK (call);
2232 /* Set CALL_EXPR_VA_ARG_PACK. */
2233 CALL_EXPR_VA_ARG_PACK (*expr_p) = 1;
2237 /* Finally, gimplify the function arguments. */
2238 for (i = (PUSH_ARGS_REVERSED ? nargs - 1 : 0);
2239 PUSH_ARGS_REVERSED ? i >= 0 : i < nargs;
2240 PUSH_ARGS_REVERSED ? i-- : i++)
2242 enum gimplify_status t;
2244 t = gimplify_arg (&CALL_EXPR_ARG (*expr_p, i), pre_p);
2250 /* Try this again in case gimplification exposed something. */
2251 if (ret != GS_ERROR)
2253 tree new = fold_call_expr (*expr_p, !want_value);
2255 if (new && new != *expr_p)
2257 /* There was a transformation of this call which computes the
2258 same value, but in a more efficient way. Return and try
2265 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2266 decl. This allows us to eliminate redundant or useless
2267 calls to "const" functions. */
2268 if (TREE_CODE (*expr_p) == CALL_EXPR
2269 && (call_expr_flags (*expr_p) & (ECF_CONST | ECF_PURE)))
2270 TREE_SIDE_EFFECTS (*expr_p) = 0;
2275 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2276 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2278 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2279 condition is true or false, respectively. If null, we should generate
2280 our own to skip over the evaluation of this specific expression.
2282 This function is the tree equivalent of do_jump.
2284 shortcut_cond_r should only be called by shortcut_cond_expr. */
2287 shortcut_cond_r (tree pred, tree *true_label_p, tree *false_label_p)
2289 tree local_label = NULL_TREE;
2290 tree t, expr = NULL;
2292 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2293 retain the shortcut semantics. Just insert the gotos here;
2294 shortcut_cond_expr will append the real blocks later. */
2295 if (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2297 /* Turn if (a && b) into
2299 if (a); else goto no;
2300 if (b) goto yes; else goto no;
2303 if (false_label_p == NULL)
2304 false_label_p = &local_label;
2306 t = shortcut_cond_r (TREE_OPERAND (pred, 0), NULL, false_label_p);
2307 append_to_statement_list (t, &expr);
2309 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2311 append_to_statement_list (t, &expr);
2313 else if (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2315 /* Turn if (a || b) into
2318 if (b) goto yes; else goto no;
2321 if (true_label_p == NULL)
2322 true_label_p = &local_label;
2324 t = shortcut_cond_r (TREE_OPERAND (pred, 0), true_label_p, NULL);
2325 append_to_statement_list (t, &expr);
2327 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2329 append_to_statement_list (t, &expr);
2331 else if (TREE_CODE (pred) == COND_EXPR)
2333 /* As long as we're messing with gotos, turn if (a ? b : c) into
2335 if (b) goto yes; else goto no;
2337 if (c) goto yes; else goto no; */
2338 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (pred, 0),
2339 shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2341 shortcut_cond_r (TREE_OPERAND (pred, 2), true_label_p,
2346 expr = build3 (COND_EXPR, void_type_node, pred,
2347 build_and_jump (true_label_p),
2348 build_and_jump (false_label_p));
2353 t = build1 (LABEL_EXPR, void_type_node, local_label);
2354 append_to_statement_list (t, &expr);
2361 shortcut_cond_expr (tree expr)
2363 tree pred = TREE_OPERAND (expr, 0);
2364 tree then_ = TREE_OPERAND (expr, 1);
2365 tree else_ = TREE_OPERAND (expr, 2);
2366 tree true_label, false_label, end_label, t;
2368 tree *false_label_p;
2369 bool emit_end, emit_false, jump_over_else;
2370 bool then_se = then_ && TREE_SIDE_EFFECTS (then_);
2371 bool else_se = else_ && TREE_SIDE_EFFECTS (else_);
2373 /* First do simple transformations. */
2376 /* If there is no 'else', turn (a && b) into if (a) if (b). */
2377 while (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2379 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2380 then_ = shortcut_cond_expr (expr);
2381 then_se = then_ && TREE_SIDE_EFFECTS (then_);
2382 pred = TREE_OPERAND (pred, 0);
2383 expr = build3 (COND_EXPR, void_type_node, pred, then_, NULL_TREE);
2388 /* If there is no 'then', turn
2391 if (a); else if (b); else d. */
2392 while (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2394 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2395 else_ = shortcut_cond_expr (expr);
2396 else_se = else_ && TREE_SIDE_EFFECTS (else_);
2397 pred = TREE_OPERAND (pred, 0);
2398 expr = build3 (COND_EXPR, void_type_node, pred, NULL_TREE, else_);
2402 /* If we're done, great. */
2403 if (TREE_CODE (pred) != TRUTH_ANDIF_EXPR
2404 && TREE_CODE (pred) != TRUTH_ORIF_EXPR)
2407 /* Otherwise we need to mess with gotos. Change
2410 if (a); else goto no;
2413 and recursively gimplify the condition. */
2415 true_label = false_label = end_label = NULL_TREE;
2417 /* If our arms just jump somewhere, hijack those labels so we don't
2418 generate jumps to jumps. */
2421 && TREE_CODE (then_) == GOTO_EXPR
2422 && TREE_CODE (GOTO_DESTINATION (then_)) == LABEL_DECL)
2424 true_label = GOTO_DESTINATION (then_);
2430 && TREE_CODE (else_) == GOTO_EXPR
2431 && TREE_CODE (GOTO_DESTINATION (else_)) == LABEL_DECL)
2433 false_label = GOTO_DESTINATION (else_);
2438 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2440 true_label_p = &true_label;
2442 true_label_p = NULL;
2444 /* The 'else' branch also needs a label if it contains interesting code. */
2445 if (false_label || else_se)
2446 false_label_p = &false_label;
2448 false_label_p = NULL;
2450 /* If there was nothing else in our arms, just forward the label(s). */
2451 if (!then_se && !else_se)
2452 return shortcut_cond_r (pred, true_label_p, false_label_p);
2454 /* If our last subexpression already has a terminal label, reuse it. */
2456 expr = expr_last (else_);
2458 expr = expr_last (then_);
2461 if (expr && TREE_CODE (expr) == LABEL_EXPR)
2462 end_label = LABEL_EXPR_LABEL (expr);
2464 /* If we don't care about jumping to the 'else' branch, jump to the end
2465 if the condition is false. */
2467 false_label_p = &end_label;
2469 /* We only want to emit these labels if we aren't hijacking them. */
2470 emit_end = (end_label == NULL_TREE);
2471 emit_false = (false_label == NULL_TREE);
2473 /* We only emit the jump over the else clause if we have to--if the
2474 then clause may fall through. Otherwise we can wind up with a
2475 useless jump and a useless label at the end of gimplified code,
2476 which will cause us to think that this conditional as a whole
2477 falls through even if it doesn't. If we then inline a function
2478 which ends with such a condition, that can cause us to issue an
2479 inappropriate warning about control reaching the end of a
2480 non-void function. */
2481 jump_over_else = block_may_fallthru (then_);
2483 pred = shortcut_cond_r (pred, true_label_p, false_label_p);
2486 append_to_statement_list (pred, &expr);
2488 append_to_statement_list (then_, &expr);
2493 t = build_and_jump (&end_label);
2494 append_to_statement_list (t, &expr);
2498 t = build1 (LABEL_EXPR, void_type_node, false_label);
2499 append_to_statement_list (t, &expr);
2501 append_to_statement_list (else_, &expr);
2503 if (emit_end && end_label)
2505 t = build1 (LABEL_EXPR, void_type_node, end_label);
2506 append_to_statement_list (t, &expr);
2512 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2515 gimple_boolify (tree expr)
2517 tree type = TREE_TYPE (expr);
2519 if (TREE_CODE (type) == BOOLEAN_TYPE)
2522 switch (TREE_CODE (expr))
2524 case TRUTH_AND_EXPR:
2526 case TRUTH_XOR_EXPR:
2527 case TRUTH_ANDIF_EXPR:
2528 case TRUTH_ORIF_EXPR:
2529 /* Also boolify the arguments of truth exprs. */
2530 TREE_OPERAND (expr, 1) = gimple_boolify (TREE_OPERAND (expr, 1));
2533 case TRUTH_NOT_EXPR:
2534 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2537 case EQ_EXPR: case NE_EXPR:
2538 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2539 /* These expressions always produce boolean results. */
2540 TREE_TYPE (expr) = boolean_type_node;
2544 /* Other expressions that get here must have boolean values, but
2545 might need to be converted to the appropriate mode. */
2546 return fold_convert (boolean_type_node, expr);
2550 /* Given a conditional expression *EXPR_P without side effects, gimplify
2551 its operands. New statements are inserted to PRE_P. */
2553 static enum gimplify_status
2554 gimplify_pure_cond_expr (tree *expr_p, tree *pre_p)
2556 tree expr = *expr_p, cond;
2557 enum gimplify_status ret, tret;
2558 enum tree_code code;
2560 cond = gimple_boolify (COND_EXPR_COND (expr));
2562 /* We need to handle && and || specially, as their gimplification
2563 creates pure cond_expr, thus leading to an infinite cycle otherwise. */
2564 code = TREE_CODE (cond);
2565 if (code == TRUTH_ANDIF_EXPR)
2566 TREE_SET_CODE (cond, TRUTH_AND_EXPR);
2567 else if (code == TRUTH_ORIF_EXPR)
2568 TREE_SET_CODE (cond, TRUTH_OR_EXPR);
2569 ret = gimplify_expr (&cond, pre_p, NULL,
2570 is_gimple_condexpr, fb_rvalue);
2571 COND_EXPR_COND (*expr_p) = cond;
2573 tret = gimplify_expr (&COND_EXPR_THEN (expr), pre_p, NULL,
2574 is_gimple_val, fb_rvalue);
2575 ret = MIN (ret, tret);
2576 tret = gimplify_expr (&COND_EXPR_ELSE (expr), pre_p, NULL,
2577 is_gimple_val, fb_rvalue);
2579 return MIN (ret, tret);
2582 /* Returns true if evaluating EXPR could trap.
2583 EXPR is GENERIC, while tree_could_trap_p can be called
2587 generic_expr_could_trap_p (tree expr)
2591 if (!expr || is_gimple_val (expr))
2594 if (!EXPR_P (expr) || tree_could_trap_p (expr))
2597 n = TREE_OPERAND_LENGTH (expr);
2598 for (i = 0; i < n; i++)
2599 if (generic_expr_could_trap_p (TREE_OPERAND (expr, i)))
2605 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2614 The second form is used when *EXPR_P is of type void.
2616 TARGET is the tree for T1 above.
2618 PRE_P points to the list where side effects that must happen before
2619 *EXPR_P should be stored. */
2621 static enum gimplify_status
2622 gimplify_cond_expr (tree *expr_p, tree *pre_p, fallback_t fallback)
2624 tree expr = *expr_p;
2625 tree tmp, tmp2, type;
2626 enum gimplify_status ret;
2628 type = TREE_TYPE (expr);
2630 /* If this COND_EXPR has a value, copy the values into a temporary within
2632 if (! VOID_TYPE_P (type))
2636 if ((fallback & fb_lvalue) == 0)
2638 if (gimplify_ctxp->allow_rhs_cond_expr
2639 /* If either branch has side effects or could trap, it can't be
2640 evaluated unconditionally. */
2641 && !TREE_SIDE_EFFECTS (TREE_OPERAND (*expr_p, 1))
2642 && !generic_expr_could_trap_p (TREE_OPERAND (*expr_p, 1))
2643 && !TREE_SIDE_EFFECTS (TREE_OPERAND (*expr_p, 2))
2644 && !generic_expr_could_trap_p (TREE_OPERAND (*expr_p, 2)))
2645 return gimplify_pure_cond_expr (expr_p, pre_p);
2647 result = tmp2 = tmp = create_tmp_var (TREE_TYPE (expr), "iftmp");
2652 tree type = build_pointer_type (TREE_TYPE (expr));
2654 if (TREE_TYPE (TREE_OPERAND (expr, 1)) != void_type_node)
2655 TREE_OPERAND (expr, 1) =
2656 build_fold_addr_expr (TREE_OPERAND (expr, 1));
2658 if (TREE_TYPE (TREE_OPERAND (expr, 2)) != void_type_node)
2659 TREE_OPERAND (expr, 2) =
2660 build_fold_addr_expr (TREE_OPERAND (expr, 2));
2662 tmp2 = tmp = create_tmp_var (type, "iftmp");
2664 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (expr, 0),
2665 TREE_OPERAND (expr, 1), TREE_OPERAND (expr, 2));
2667 result = build_fold_indirect_ref (tmp);
2671 /* Build the then clause, 't1 = a;'. But don't build an assignment
2672 if this branch is void; in C++ it can be, if it's a throw. */
2673 if (TREE_TYPE (TREE_OPERAND (expr, 1)) != void_type_node)
2674 TREE_OPERAND (expr, 1)
2675 = build_gimple_modify_stmt (tmp, TREE_OPERAND (expr, 1));
2677 /* Build the else clause, 't1 = b;'. */
2678 if (TREE_TYPE (TREE_OPERAND (expr, 2)) != void_type_node)
2679 TREE_OPERAND (expr, 2)
2680 = build_gimple_modify_stmt (tmp2, TREE_OPERAND (expr, 2));
2682 TREE_TYPE (expr) = void_type_node;
2683 recalculate_side_effects (expr);
2685 /* Move the COND_EXPR to the prequeue. */
2686 gimplify_and_add (expr, pre_p);
2692 /* Make sure the condition has BOOLEAN_TYPE. */
2693 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2695 /* Break apart && and || conditions. */
2696 if (TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ANDIF_EXPR
2697 || TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ORIF_EXPR)
2699 expr = shortcut_cond_expr (expr);
2701 if (expr != *expr_p)
2705 /* We can't rely on gimplify_expr to re-gimplify the expanded
2706 form properly, as cleanups might cause the target labels to be
2707 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2708 set up a conditional context. */
2709 gimple_push_condition ();
2710 gimplify_stmt (expr_p);
2711 gimple_pop_condition (pre_p);
2717 /* Now do the normal gimplification. */
2718 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL,
2719 is_gimple_condexpr, fb_rvalue);
2721 gimple_push_condition ();
2723 gimplify_to_stmt_list (&TREE_OPERAND (expr, 1));
2724 gimplify_to_stmt_list (&TREE_OPERAND (expr, 2));
2725 recalculate_side_effects (expr);
2727 gimple_pop_condition (pre_p);
2729 if (ret == GS_ERROR)
2731 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2733 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 2)))
2734 /* Rewrite "if (a); else b" to "if (!a) b" */
2736 TREE_OPERAND (expr, 0) = invert_truthvalue (TREE_OPERAND (expr, 0));
2737 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL,
2738 is_gimple_condexpr, fb_rvalue);
2740 tmp = TREE_OPERAND (expr, 1);
2741 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 2);
2742 TREE_OPERAND (expr, 2) = tmp;
2745 /* Both arms are empty; replace the COND_EXPR with its predicate. */
2746 expr = TREE_OPERAND (expr, 0);
2752 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2753 a call to __builtin_memcpy. */
2755 static enum gimplify_status
2756 gimplify_modify_expr_to_memcpy (tree *expr_p, tree size, bool want_value)
2758 tree t, to, to_ptr, from, from_ptr;
2760 to = GENERIC_TREE_OPERAND (*expr_p, 0);
2761 from = GENERIC_TREE_OPERAND (*expr_p, 1);
2763 from_ptr = build_fold_addr_expr (from);
2765 to_ptr = build_fold_addr_expr (to);
2766 t = implicit_built_in_decls[BUILT_IN_MEMCPY];
2767 t = build_call_expr (t, 3, to_ptr, from_ptr, size);
2771 t = build1 (NOP_EXPR, TREE_TYPE (to_ptr), t);
2772 t = build1 (INDIRECT_REF, TREE_TYPE (to), t);
2779 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2780 a call to __builtin_memset. In this case we know that the RHS is
2781 a CONSTRUCTOR with an empty element list. */
2783 static enum gimplify_status
2784 gimplify_modify_expr_to_memset (tree *expr_p, tree size, bool want_value)
2788 to = GENERIC_TREE_OPERAND (*expr_p, 0);
2790 to_ptr = build_fold_addr_expr (to);
2791 t = implicit_built_in_decls[BUILT_IN_MEMSET];
2792 t = build_call_expr (t, 3, to_ptr, integer_zero_node, size);
2796 t = build1 (NOP_EXPR, TREE_TYPE (to_ptr), t);
2797 t = build1 (INDIRECT_REF, TREE_TYPE (to), t);
2804 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
2805 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
2806 assignment. Returns non-null if we detect a potential overlap. */
2808 struct gimplify_init_ctor_preeval_data
2810 /* The base decl of the lhs object. May be NULL, in which case we
2811 have to assume the lhs is indirect. */
2814 /* The alias set of the lhs object. */
2815 alias_set_type lhs_alias_set;
2819 gimplify_init_ctor_preeval_1 (tree *tp, int *walk_subtrees, void *xdata)
2821 struct gimplify_init_ctor_preeval_data *data
2822 = (struct gimplify_init_ctor_preeval_data *) xdata;
2825 /* If we find the base object, obviously we have overlap. */
2826 if (data->lhs_base_decl == t)
2829 /* If the constructor component is indirect, determine if we have a
2830 potential overlap with the lhs. The only bits of information we
2831 have to go on at this point are addressability and alias sets. */
2832 if (TREE_CODE (t) == INDIRECT_REF
2833 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
2834 && alias_sets_conflict_p (data->lhs_alias_set, get_alias_set (t)))
2837 /* If the constructor component is a call, determine if it can hide a
2838 potential overlap with the lhs through an INDIRECT_REF like above. */
2839 if (TREE_CODE (t) == CALL_EXPR)
2841 tree type, fntype = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (t)));
2843 for (type = TYPE_ARG_TYPES (fntype); type; type = TREE_CHAIN (type))
2844 if (POINTER_TYPE_P (TREE_VALUE (type))
2845 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
2846 && alias_sets_conflict_p (data->lhs_alias_set,
2848 (TREE_TYPE (TREE_VALUE (type)))))
2852 if (IS_TYPE_OR_DECL_P (t))
2857 /* A subroutine of gimplify_init_constructor. Pre-evaluate *EXPR_P,
2858 force values that overlap with the lhs (as described by *DATA)
2859 into temporaries. */
2862 gimplify_init_ctor_preeval (tree *expr_p, tree *pre_p, tree *post_p,
2863 struct gimplify_init_ctor_preeval_data *data)
2865 enum gimplify_status one;
2867 /* If the value is invariant, then there's nothing to pre-evaluate.
2868 But ensure it doesn't have any side-effects since a SAVE_EXPR is
2869 invariant but has side effects and might contain a reference to
2870 the object we're initializing. */
2871 if (TREE_INVARIANT (*expr_p) && !TREE_SIDE_EFFECTS (*expr_p))
2874 /* If the type has non-trivial constructors, we can't pre-evaluate. */
2875 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p)))
2878 /* Recurse for nested constructors. */
2879 if (TREE_CODE (*expr_p) == CONSTRUCTOR)
2881 unsigned HOST_WIDE_INT ix;
2882 constructor_elt *ce;
2883 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (*expr_p);
2885 for (ix = 0; VEC_iterate (constructor_elt, v, ix, ce); ix++)
2886 gimplify_init_ctor_preeval (&ce->value, pre_p, post_p, data);
2890 /* If this is a variable sized type, we must remember the size. */
2891 maybe_with_size_expr (expr_p);
2893 /* Gimplify the constructor element to something appropriate for the rhs
2894 of a MODIFY_EXPR. Given that we know the lhs is an aggregate, we know
2895 the gimplifier will consider this a store to memory. Doing this
2896 gimplification now means that we won't have to deal with complicated
2897 language-specific trees, nor trees like SAVE_EXPR that can induce
2898 exponential search behavior. */
2899 one = gimplify_expr (expr_p, pre_p, post_p, is_gimple_mem_rhs, fb_rvalue);
2900 if (one == GS_ERROR)
2906 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
2907 with the lhs, since "a = { .x=a }" doesn't make sense. This will
2908 always be true for all scalars, since is_gimple_mem_rhs insists on a
2909 temporary variable for them. */
2910 if (DECL_P (*expr_p))
2913 /* If this is of variable size, we have no choice but to assume it doesn't
2914 overlap since we can't make a temporary for it. */
2915 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (*expr_p))) != INTEGER_CST)
2918 /* Otherwise, we must search for overlap ... */
2919 if (!walk_tree (expr_p, gimplify_init_ctor_preeval_1, data, NULL))
2922 /* ... and if found, force the value into a temporary. */
2923 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
2926 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
2927 a RANGE_EXPR in a CONSTRUCTOR for an array.
2931 object[var] = value;
2938 We increment var _after_ the loop exit check because we might otherwise
2939 fail if upper == TYPE_MAX_VALUE (type for upper).
2941 Note that we never have to deal with SAVE_EXPRs here, because this has
2942 already been taken care of for us, in gimplify_init_ctor_preeval(). */
2944 static void gimplify_init_ctor_eval (tree, VEC(constructor_elt,gc) *,
2948 gimplify_init_ctor_eval_range (tree object, tree lower, tree upper,
2949 tree value, tree array_elt_type,
2950 tree *pre_p, bool cleared)
2952 tree loop_entry_label, loop_exit_label;
2953 tree var, var_type, cref, tmp;
2955 loop_entry_label = create_artificial_label ();
2956 loop_exit_label = create_artificial_label ();
2958 /* Create and initialize the index variable. */
2959 var_type = TREE_TYPE (upper);
2960 var = create_tmp_var (var_type, NULL);
2961 append_to_statement_list (build_gimple_modify_stmt (var, lower), pre_p);
2963 /* Add the loop entry label. */
2964 append_to_statement_list (build1 (LABEL_EXPR,
2969 /* Build the reference. */
2970 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
2971 var, NULL_TREE, NULL_TREE);
2973 /* If we are a constructor, just call gimplify_init_ctor_eval to do
2974 the store. Otherwise just assign value to the reference. */
2976 if (TREE_CODE (value) == CONSTRUCTOR)
2977 /* NB we might have to call ourself recursively through
2978 gimplify_init_ctor_eval if the value is a constructor. */
2979 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
2982 append_to_statement_list (build_gimple_modify_stmt (cref, value), pre_p);
2984 /* We exit the loop when the index var is equal to the upper bound. */
2985 gimplify_and_add (build3 (COND_EXPR, void_type_node,
2986 build2 (EQ_EXPR, boolean_type_node,
2994 /* Otherwise, increment the index var... */
2995 tmp = build2 (PLUS_EXPR, var_type, var,
2996 fold_convert (var_type, integer_one_node));
2997 append_to_statement_list (build_gimple_modify_stmt (var, tmp), pre_p);
2999 /* ...and jump back to the loop entry. */
3000 append_to_statement_list (build1 (GOTO_EXPR,
3005 /* Add the loop exit label. */
3006 append_to_statement_list (build1 (LABEL_EXPR,
3012 /* Return true if FDECL is accessing a field that is zero sized. */
3015 zero_sized_field_decl (const_tree fdecl)
3017 if (TREE_CODE (fdecl) == FIELD_DECL && DECL_SIZE (fdecl)
3018 && integer_zerop (DECL_SIZE (fdecl)))
3023 /* Return true if TYPE is zero sized. */
3026 zero_sized_type (const_tree type)
3028 if (AGGREGATE_TYPE_P (type) && TYPE_SIZE (type)
3029 && integer_zerop (TYPE_SIZE (type)))
3034 /* A subroutine of gimplify_init_constructor. Generate individual
3035 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
3036 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
3037 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
3041 gimplify_init_ctor_eval (tree object, VEC(constructor_elt,gc) *elts,
3042 tree *pre_p, bool cleared)
3044 tree array_elt_type = NULL;
3045 unsigned HOST_WIDE_INT ix;
3046 tree purpose, value;
3048 if (TREE_CODE (TREE_TYPE (object)) == ARRAY_TYPE)
3049 array_elt_type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object)));
3051 FOR_EACH_CONSTRUCTOR_ELT (elts, ix, purpose, value)
3055 /* NULL values are created above for gimplification errors. */
3059 if (cleared && initializer_zerop (value))
3062 /* ??? Here's to hoping the front end fills in all of the indices,
3063 so we don't have to figure out what's missing ourselves. */
3064 gcc_assert (purpose);
3066 /* Skip zero-sized fields, unless value has side-effects. This can
3067 happen with calls to functions returning a zero-sized type, which
3068 we shouldn't discard. As a number of downstream passes don't
3069 expect sets of zero-sized fields, we rely on the gimplification of
3070 the MODIFY_EXPR we make below to drop the assignment statement. */
3071 if (! TREE_SIDE_EFFECTS (value) && zero_sized_field_decl (purpose))
3074 /* If we have a RANGE_EXPR, we have to build a loop to assign the
3076 if (TREE_CODE (purpose) == RANGE_EXPR)
3078 tree lower = TREE_OPERAND (purpose, 0);
3079 tree upper = TREE_OPERAND (purpose, 1);
3081 /* If the lower bound is equal to upper, just treat it as if
3082 upper was the index. */
3083 if (simple_cst_equal (lower, upper))
3087 gimplify_init_ctor_eval_range (object, lower, upper, value,
3088 array_elt_type, pre_p, cleared);
3095 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
3096 purpose, NULL_TREE, NULL_TREE);
3100 gcc_assert (TREE_CODE (purpose) == FIELD_DECL);
3101 cref = build3 (COMPONENT_REF, TREE_TYPE (purpose),
3102 unshare_expr (object), purpose, NULL_TREE);
3105 if (TREE_CODE (value) == CONSTRUCTOR
3106 && TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE)
3107 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
3111 init = build2 (INIT_EXPR, TREE_TYPE (cref), cref, value);
3112 gimplify_and_add (init, pre_p);
3117 /* A subroutine of gimplify_modify_expr. Break out elements of a
3118 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
3120 Note that we still need to clear any elements that don't have explicit
3121 initializers, so if not all elements are initialized we keep the
3122 original MODIFY_EXPR, we just remove all of the constructor elements. */
3124 static enum gimplify_status
3125 gimplify_init_constructor (tree *expr_p, tree *pre_p,
3126 tree *post_p, bool want_value)
3129 tree ctor = GENERIC_TREE_OPERAND (*expr_p, 1);
3130 tree type = TREE_TYPE (ctor);
3131 enum gimplify_status ret;
3132 VEC(constructor_elt,gc) *elts;
3134 if (TREE_CODE (ctor) != CONSTRUCTOR)
3135 return GS_UNHANDLED;
3137 ret = gimplify_expr (&GENERIC_TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3138 is_gimple_lvalue, fb_lvalue);
3139 if (ret == GS_ERROR)
3141 object = GENERIC_TREE_OPERAND (*expr_p, 0);
3143 elts = CONSTRUCTOR_ELTS (ctor);
3146 switch (TREE_CODE (type))
3150 case QUAL_UNION_TYPE:
3153 struct gimplify_init_ctor_preeval_data preeval_data;
3154 HOST_WIDE_INT num_type_elements, num_ctor_elements;
3155 HOST_WIDE_INT num_nonzero_elements;
3156 bool cleared, valid_const_initializer;
3158 /* Aggregate types must lower constructors to initialization of
3159 individual elements. The exception is that a CONSTRUCTOR node
3160 with no elements indicates zero-initialization of the whole. */
3161 if (VEC_empty (constructor_elt, elts))
3164 /* Fetch information about the constructor to direct later processing.
3165 We might want to make static versions of it in various cases, and
3166 can only do so if it known to be a valid constant initializer. */
3167 valid_const_initializer
3168 = categorize_ctor_elements (ctor, &num_nonzero_elements,
3169 &num_ctor_elements, &cleared);
3171 /* If a const aggregate variable is being initialized, then it
3172 should never be a lose to promote the variable to be static. */
3173 if (valid_const_initializer
3174 && num_nonzero_elements > 1
3175 && TREE_READONLY (object)
3176 && TREE_CODE (object) == VAR_DECL)
3178 DECL_INITIAL (object) = ctor;
3179 TREE_STATIC (object) = 1;
3180 if (!DECL_NAME (object))
3181 DECL_NAME (object) = create_tmp_var_name ("C");
3182 walk_tree (&DECL_INITIAL (object), force_labels_r, NULL, NULL);
3184 /* ??? C++ doesn't automatically append a .<number> to the
3185 assembler name, and even when it does, it looks a FE private
3186 data structures to figure out what that number should be,
3187 which are not set for this variable. I suppose this is
3188 important for local statics for inline functions, which aren't
3189 "local" in the object file sense. So in order to get a unique
3190 TU-local symbol, we must invoke the lhd version now. */
3191 lhd_set_decl_assembler_name (object);
3193 *expr_p = NULL_TREE;
3197 /* If there are "lots" of initialized elements, even discounting
3198 those that are not address constants (and thus *must* be
3199 computed at runtime), then partition the constructor into
3200 constant and non-constant parts. Block copy the constant
3201 parts in, then generate code for the non-constant parts. */
3202 /* TODO. There's code in cp/typeck.c to do this. */
3204 num_type_elements = count_type_elements (type, true);
3206 /* If count_type_elements could not determine number of type elements
3207 for a constant-sized object, assume clearing is needed.
3208 Don't do this for variable-sized objects, as store_constructor
3209 will ignore the clearing of variable-sized objects. */
3210 if (num_type_elements < 0 && int_size_in_bytes (type) >= 0)
3212 /* If there are "lots" of zeros, then block clear the object first. */
3213 else if (num_type_elements - num_nonzero_elements > CLEAR_RATIO
3214 && num_nonzero_elements < num_type_elements/4)
3216 /* ??? This bit ought not be needed. For any element not present
3217 in the initializer, we should simply set them to zero. Except
3218 we'd need to *find* the elements that are not present, and that
3219 requires trickery to avoid quadratic compile-time behavior in
3220 large cases or excessive memory use in small cases. */
3221 else if (num_ctor_elements < num_type_elements)
3224 /* If there are "lots" of initialized elements, and all of them
3225 are valid address constants, then the entire initializer can
3226 be dropped to memory, and then memcpy'd out. Don't do this
3227 for sparse arrays, though, as it's more efficient to follow
3228 the standard CONSTRUCTOR behavior of memset followed by
3229 individual element initialization. */
3230 if (valid_const_initializer && !cleared)
3232 HOST_WIDE_INT size = int_size_in_bytes (type);
3235 /* ??? We can still get unbounded array types, at least
3236 from the C++ front end. This seems wrong, but attempt
3237 to work around it for now. */
3240 size = int_size_in_bytes (TREE_TYPE (object));
3242 TREE_TYPE (ctor) = type = TREE_TYPE (object);
3245 /* Find the maximum alignment we can assume for the object. */
3246 /* ??? Make use of DECL_OFFSET_ALIGN. */
3247 if (DECL_P (object))
3248 align = DECL_ALIGN (object);
3250 align = TYPE_ALIGN (type);
3252 if (size > 0 && !can_move_by_pieces (size, align))
3254 tree new = create_tmp_var_raw (type, "C");
3256 gimple_add_tmp_var (new);
3257 TREE_STATIC (new) = 1;
3258 TREE_READONLY (new) = 1;
3259 DECL_INITIAL (new) = ctor;
3260 if (align > DECL_ALIGN (new))
3262 DECL_ALIGN (new) = align;
3263 DECL_USER_ALIGN (new) = 1;
3265 walk_tree (&DECL_INITIAL (new), force_labels_r, NULL, NULL);
3267 GENERIC_TREE_OPERAND (*expr_p, 1) = new;
3269 /* This is no longer an assignment of a CONSTRUCTOR, but
3270 we still may have processing to do on the LHS. So
3271 pretend we didn't do anything here to let that happen. */
3272 return GS_UNHANDLED;
3276 /* If there are nonzero elements, pre-evaluate to capture elements
3277 overlapping with the lhs into temporaries. We must do this before
3278 clearing to fetch the values before they are zeroed-out. */
3279 if (num_nonzero_elements > 0)
3281 preeval_data.lhs_base_decl = get_base_address (object);
3282 if (!DECL_P (preeval_data.lhs_base_decl))
3283 preeval_data.lhs_base_decl = NULL;
3284 preeval_data.lhs_alias_set = get_alias_set (object);
3286 gimplify_init_ctor_preeval (&GENERIC_TREE_OPERAND (*expr_p, 1),
3287 pre_p, post_p, &preeval_data);
3292 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3293 Note that we still have to gimplify, in order to handle the
3294 case of variable sized types. Avoid shared tree structures. */
3295 CONSTRUCTOR_ELTS (ctor) = NULL;
3296 object = unshare_expr (object);
3297 gimplify_stmt (expr_p);
3298 append_to_statement_list (*expr_p, pre_p);
3301 /* If we have not block cleared the object, or if there are nonzero
3302 elements in the constructor, add assignments to the individual
3303 scalar fields of the object. */
3304 if (!cleared || num_nonzero_elements > 0)
3305 gimplify_init_ctor_eval (object, elts, pre_p, cleared);
3307 *expr_p = NULL_TREE;
3315 /* Extract the real and imaginary parts out of the ctor. */
3316 gcc_assert (VEC_length (constructor_elt, elts) == 2);
3317 r = VEC_index (constructor_elt, elts, 0)->value;
3318 i = VEC_index (constructor_elt, elts, 1)->value;
3319 if (r == NULL || i == NULL)
3321 tree zero = fold_convert (TREE_TYPE (type), integer_zero_node);
3328 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3329 represent creation of a complex value. */
3330 if (TREE_CONSTANT (r) && TREE_CONSTANT (i))
3332 ctor = build_complex (type, r, i);
3333 TREE_OPERAND (*expr_p, 1) = ctor;
3337 ctor = build2 (COMPLEX_EXPR, type, r, i);
3338 TREE_OPERAND (*expr_p, 1) = ctor;
3339 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
3340 rhs_predicate_for (TREE_OPERAND (*expr_p, 0)),
3348 unsigned HOST_WIDE_INT ix;
3349 constructor_elt *ce;
3351 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3352 if (TREE_CONSTANT (ctor))
3354 bool constant_p = true;
3357 /* Even when ctor is constant, it might contain non-*_CST
3358 elements, such as addresses or trapping values like
3359 1.0/0.0 - 1.0/0.0. Such expressions don't belong
3360 in VECTOR_CST nodes. */
3361 FOR_EACH_CONSTRUCTOR_VALUE (elts, ix, value)
3362 if (!CONSTANT_CLASS_P (value))
3370 TREE_OPERAND (*expr_p, 1) = build_vector_from_ctor (type, elts);
3374 /* Don't reduce an initializer constant even if we can't
3375 make a VECTOR_CST. It won't do anything for us, and it'll
3376 prevent us from representing it as a single constant. */
3377 if (initializer_constant_valid_p (ctor, type))
3380 TREE_CONSTANT (ctor) = 0;
3381 TREE_INVARIANT (ctor) = 0;
3384 /* Vector types use CONSTRUCTOR all the way through gimple
3385 compilation as a general initializer. */
3386 for (ix = 0; VEC_iterate (constructor_elt, elts, ix, ce); ix++)
3388 enum gimplify_status tret;
3389 tret = gimplify_expr (&ce->value, pre_p, post_p,
3390 is_gimple_val, fb_rvalue);
3391 if (tret == GS_ERROR)
3394 if (!is_gimple_reg (GENERIC_TREE_OPERAND (*expr_p, 0)))
3395 GENERIC_TREE_OPERAND (*expr_p, 1) = get_formal_tmp_var (ctor, pre_p);
3400 /* So how did we get a CONSTRUCTOR for a scalar type? */
3404 if (ret == GS_ERROR)
3406 else if (want_value)
3408 append_to_statement_list (*expr_p, pre_p);
3416 /* Given a pointer value OP0, return a simplified version of an
3417 indirection through OP0, or NULL_TREE if no simplification is
3418 possible. This may only be applied to a rhs of an expression.
3419 Note that the resulting type may be different from the type pointed
3420 to in the sense that it is still compatible from the langhooks
3424 fold_indirect_ref_rhs (tree t)
3426 tree type = TREE_TYPE (TREE_TYPE (t));
3430 STRIP_USELESS_TYPE_CONVERSION (sub);
3431 subtype = TREE_TYPE (sub);
3432 if (!POINTER_TYPE_P (subtype))
3435 if (TREE_CODE (sub) == ADDR_EXPR)
3437 tree op = TREE_OPERAND (sub, 0);
3438 tree optype = TREE_TYPE (op);
3440 if (useless_type_conversion_p (type, optype))
3442 /* *(foo *)&fooarray => fooarray[0] */
3443 else if (TREE_CODE (optype) == ARRAY_TYPE
3444 && useless_type_conversion_p (type, TREE_TYPE (optype)))
3446 tree type_domain = TYPE_DOMAIN (optype);
3447 tree min_val = size_zero_node;
3448 if (type_domain && TYPE_MIN_VALUE (type_domain))
3449 min_val = TYPE_MIN_VALUE (type_domain);
3450 return build4 (ARRAY_REF, type, op, min_val, NULL_TREE, NULL_TREE);
3454 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
3455 if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
3456 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (subtype))))
3459 tree min_val = size_zero_node;
3461 sub = fold_indirect_ref_rhs (sub);
3463 sub = build1 (INDIRECT_REF, TREE_TYPE (subtype), osub);
3464 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
3465 if (type_domain && TYPE_MIN_VALUE (type_domain))
3466 min_val = TYPE_MIN_VALUE (type_domain);
3467 return build4 (ARRAY_REF, type, sub, min_val, NULL_TREE, NULL_TREE);
3473 /* Subroutine of gimplify_modify_expr to do simplifications of
3474 MODIFY_EXPRs based on the code of the RHS. We loop for as long as
3475 something changes. */
3477 static enum gimplify_status
3478 gimplify_modify_expr_rhs (tree *expr_p, tree *from_p, tree *to_p, tree *pre_p,
3479 tree *post_p, bool want_value)
3481 enum gimplify_status ret = GS_OK;
3483 while (ret != GS_UNHANDLED)
3484 switch (TREE_CODE (*from_p))
3487 /* If we're assigning from a constant constructor, move the
3488 constructor expression to the RHS of the MODIFY_EXPR. */
3489 if (DECL_INITIAL (*from_p)
3490 && TYPE_READONLY (TREE_TYPE (*from_p))
3491 && TREE_CODE (DECL_INITIAL (*from_p)) == CONSTRUCTOR)
3493 *from_p = DECL_INITIAL (*from_p);
3500 /* If we have code like
3504 where the type of "x" is a (possibly cv-qualified variant
3505 of "A"), treat the entire expression as identical to "x".
3506 This kind of code arises in C++ when an object is bound
3507 to a const reference, and if "x" is a TARGET_EXPR we want
3508 to take advantage of the optimization below. */
3509 tree t = fold_indirect_ref_rhs (TREE_OPERAND (*from_p, 0));
3522 /* If we are initializing something from a TARGET_EXPR, strip the
3523 TARGET_EXPR and initialize it directly, if possible. This can't
3524 be done if the initializer is void, since that implies that the
3525 temporary is set in some non-trivial way.
3527 ??? What about code that pulls out the temp and uses it
3528 elsewhere? I think that such code never uses the TARGET_EXPR as
3529 an initializer. If I'm wrong, we'll die because the temp won't
3530 have any RTL. In that case, I guess we'll need to replace
3531 references somehow. */
3532 tree init = TARGET_EXPR_INITIAL (*from_p);
3534 if (!VOID_TYPE_P (TREE_TYPE (init)))
3545 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
3547 gimplify_compound_expr (from_p, pre_p, true);
3552 /* If we're initializing from a CONSTRUCTOR, break this into
3553 individual MODIFY_EXPRs. */
3554 return gimplify_init_constructor (expr_p, pre_p, post_p, want_value);
3557 /* If we're assigning to a non-register type, push the assignment
3558 down into the branches. This is mandatory for ADDRESSABLE types,
3559 since we cannot generate temporaries for such, but it saves a
3560 copy in other cases as well. */
3561 if (!is_gimple_reg_type (TREE_TYPE (*from_p)))
3563 /* This code should mirror the code in gimplify_cond_expr. */
3564 enum tree_code code = TREE_CODE (*expr_p);
3565 tree cond = *from_p;
3566 tree result = *to_p;
3568 ret = gimplify_expr (&result, pre_p, post_p,
3569 is_gimple_min_lval, fb_lvalue);
3570 if (ret != GS_ERROR)
3573 if (TREE_TYPE (TREE_OPERAND (cond, 1)) != void_type_node)
3574 TREE_OPERAND (cond, 1)
3575 = build2 (code, void_type_node, result,
3576 TREE_OPERAND (cond, 1));
3577 if (TREE_TYPE (TREE_OPERAND (cond, 2)) != void_type_node)
3578 TREE_OPERAND (cond, 2)
3579 = build2 (code, void_type_node, unshare_expr (result),
3580 TREE_OPERAND (cond, 2));
3582 TREE_TYPE (cond) = void_type_node;
3583 recalculate_side_effects (cond);
3587 gimplify_and_add (cond, pre_p);
3588 *expr_p = unshare_expr (result);
3599 /* For calls that return in memory, give *to_p as the CALL_EXPR's
3600 return slot so that we don't generate a temporary. */
3601 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p)
3602 && aggregate_value_p (*from_p, *from_p))
3606 if (!(rhs_predicate_for (*to_p))(*from_p))
3607 /* If we need a temporary, *to_p isn't accurate. */
3609 else if (TREE_CODE (*to_p) == RESULT_DECL
3610 && DECL_NAME (*to_p) == NULL_TREE
3611 && needs_to_live_in_memory (*to_p))
3612 /* It's OK to use the return slot directly unless it's an NRV. */
3614 else if (is_gimple_reg_type (TREE_TYPE (*to_p))
3615 || (DECL_P (*to_p) && DECL_REGISTER (*to_p)))
3616 /* Don't force regs into memory. */
3618 else if (TREE_CODE (*to_p) == VAR_DECL
3619 && DECL_GIMPLE_FORMAL_TEMP_P (*to_p))
3620 /* Don't use the original target if it's a formal temp; we
3621 don't want to take their addresses. */
3623 else if (TREE_CODE (*expr_p) == INIT_EXPR)
3624 /* It's OK to use the target directly if it's being
3627 else if (!is_gimple_non_addressable (*to_p))
3628 /* Don't use the original target if it's already addressable;
3629 if its address escapes, and the called function uses the
3630 NRV optimization, a conforming program could see *to_p
3631 change before the called function returns; see c++/19317.
3632 When optimizing, the return_slot pass marks more functions
3633 as safe after we have escape info. */
3640 CALL_EXPR_RETURN_SLOT_OPT (*from_p) = 1;
3641 mark_addressable (*to_p);
3648 /* If we're initializing from a container, push the initialization
3650 case CLEANUP_POINT_EXPR:
3652 case STATEMENT_LIST:
3654 tree wrap = *from_p;
3657 ret = gimplify_expr (to_p, pre_p, post_p,
3658 is_gimple_min_lval, fb_lvalue);
3659 if (ret != GS_ERROR)
3662 t = voidify_wrapper_expr (wrap, *expr_p);
3663 gcc_assert (t == *expr_p);
3667 gimplify_and_add (wrap, pre_p);
3668 *expr_p = unshare_expr (*to_p);
3683 /* Destructively convert the TREE pointer in TP into a gimple tuple if
3687 tree_to_gimple_tuple (tree *tp)
3690 switch (TREE_CODE (*tp))
3692 case GIMPLE_MODIFY_STMT:
3696 struct gimple_stmt *gs;
3697 tree lhs = TREE_OPERAND (*tp, 0);
3698 bool def_stmt_self_p = false;
3700 if (TREE_CODE (lhs) == SSA_NAME)
3702 if (SSA_NAME_DEF_STMT (lhs) == *tp)
3703 def_stmt_self_p = true;
3706 gs = &make_node (GIMPLE_MODIFY_STMT)->gstmt;
3707 gs->base = (*tp)->base;
3708 /* The set to base above overwrites the CODE. */
3709 TREE_SET_CODE ((tree) gs, GIMPLE_MODIFY_STMT);
3711 SET_EXPR_LOCUS ((tree) gs, EXPR_LOCUS (*tp));
3712 gs->operands[0] = TREE_OPERAND (*tp, 0);
3713 gs->operands[1] = TREE_OPERAND (*tp, 1);
3714 gs->block = TREE_BLOCK (*tp);
3717 /* If we re-gimplify a set to an SSA_NAME, we must change the
3718 SSA name's DEF_STMT link. */
3719 if (def_stmt_self_p)
3720 SSA_NAME_DEF_STMT (GIMPLE_STMT_OPERAND (*tp, 0)) = *tp;
3729 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
3730 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
3731 DECL_GIMPLE_REG_P set. */
3733 static enum gimplify_status
3734 gimplify_modify_expr_complex_part (tree *expr_p, tree *pre_p, bool want_value)
3736 enum tree_code code, ocode;
3737 tree lhs, rhs, new_rhs, other, realpart, imagpart;
3739 lhs = GENERIC_TREE_OPERAND (*expr_p, 0);
3740 rhs = GENERIC_TREE_OPERAND (*expr_p, 1);
3741 code = TREE_CODE (lhs);
3742 lhs = TREE_OPERAND (lhs, 0);
3744 ocode = code == REALPART_EXPR ? IMAGPART_EXPR : REALPART_EXPR;
3745 other = build1 (ocode, TREE_TYPE (rhs), lhs);
3746 other = get_formal_tmp_var (other, pre_p);
3748 realpart = code == REALPART_EXPR ? rhs : other;
3749 imagpart = code == REALPART_EXPR ? other : rhs;
3751 if (TREE_CONSTANT (realpart) && TREE_CONSTANT (imagpart))
3752 new_rhs = build_complex (TREE_TYPE (lhs), realpart, imagpart);
3754 new_rhs = build2 (COMPLEX_EXPR, TREE_TYPE (lhs), realpart, imagpart);
3756 GENERIC_TREE_OPERAND (*expr_p, 0) = lhs;
3757 GENERIC_TREE_OPERAND (*expr_p, 1) = new_rhs;
3761 tree_to_gimple_tuple (expr_p);
3763 append_to_statement_list (*expr_p, pre_p);
3770 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
3776 PRE_P points to the list where side effects that must happen before
3777 *EXPR_P should be stored.
3779 POST_P points to the list where side effects that must happen after
3780 *EXPR_P should be stored.
3782 WANT_VALUE is nonzero iff we want to use the value of this expression
3783 in another expression. */
3785 static enum gimplify_status
3786 gimplify_modify_expr (tree *expr_p, tree *pre_p, tree *post_p, bool want_value)
3788 tree *from_p = &GENERIC_TREE_OPERAND (*expr_p, 1);
3789 tree *to_p = &GENERIC_TREE_OPERAND (*expr_p, 0);
3790 enum gimplify_status ret = GS_UNHANDLED;
3792 gcc_assert (TREE_CODE (*expr_p) == MODIFY_EXPR
3793 || TREE_CODE (*expr_p) == GIMPLE_MODIFY_STMT
3794 || TREE_CODE (*expr_p) == INIT_EXPR);
3796 /* See if any simplifications can be done based on what the RHS is. */
3797 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
3799 if (ret != GS_UNHANDLED)
3802 /* For zero sized types only gimplify the left hand side and right hand
3803 side as statements and throw away the assignment. Do this after
3804 gimplify_modify_expr_rhs so we handle TARGET_EXPRs of addressable
3806 if (zero_sized_type (TREE_TYPE (*from_p)))
3808 gimplify_stmt (from_p);
3809 gimplify_stmt (to_p);
3810 append_to_statement_list (*from_p, pre_p);
3811 append_to_statement_list (*to_p, pre_p);
3812 *expr_p = NULL_TREE;
3816 /* If the value being copied is of variable width, compute the length
3817 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
3818 before gimplifying any of the operands so that we can resolve any
3819 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
3820 the size of the expression to be copied, not of the destination, so
3821 that is what we must here. */
3822 maybe_with_size_expr (from_p);
3824 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
3825 if (ret == GS_ERROR)
3828 ret = gimplify_expr (from_p, pre_p, post_p,
3829 rhs_predicate_for (*to_p), fb_rvalue);
3830 if (ret == GS_ERROR)
3833 /* Now see if the above changed *from_p to something we handle specially. */
3834 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
3836 if (ret != GS_UNHANDLED)
3839 /* If we've got a variable sized assignment between two lvalues (i.e. does
3840 not involve a call), then we can make things a bit more straightforward
3841 by converting the assignment to memcpy or memset. */
3842 if (TREE_CODE (*from_p) == WITH_SIZE_EXPR)
3844 tree from = TREE_OPERAND (*from_p, 0);
3845 tree size = TREE_OPERAND (*from_p, 1);
3847 if (TREE_CODE (from) == CONSTRUCTOR)
3848 return gimplify_modify_expr_to_memset (expr_p, size, want_value);
3849 if (is_gimple_addressable (from))
3852 return gimplify_modify_expr_to_memcpy (expr_p, size, want_value);
3856 /* Transform partial stores to non-addressable complex variables into
3857 total stores. This allows us to use real instead of virtual operands
3858 for these variables, which improves optimization. */
3859 if ((TREE_CODE (*to_p) == REALPART_EXPR
3860 || TREE_CODE (*to_p) == IMAGPART_EXPR)
3861 && is_gimple_reg (TREE_OPERAND (*to_p, 0)))
3862 return gimplify_modify_expr_complex_part (expr_p, pre_p, want_value);
3864 if (gimplify_ctxp->into_ssa && is_gimple_reg (*to_p))
3866 /* If we've somehow already got an SSA_NAME on the LHS, then
3867 we're probably modified it twice. Not good. */
3868 gcc_assert (TREE_CODE (*to_p) != SSA_NAME);
3869 *to_p = make_ssa_name (*to_p, *expr_p);
3872 /* Try to alleviate the effects of the gimplification creating artificial
3873 temporaries (see for example is_gimple_reg_rhs) on the debug info. */
3874 if (!gimplify_ctxp->into_ssa
3875 && DECL_P (*from_p) && DECL_IGNORED_P (*from_p)
3876 && DECL_P (*to_p) && !DECL_IGNORED_P (*to_p))
3878 if (!DECL_NAME (*from_p) && DECL_NAME (*to_p))
3880 = create_tmp_var_name (IDENTIFIER_POINTER (DECL_NAME (*to_p)));
3881 DECL_DEBUG_EXPR_IS_FROM (*from_p) = 1;
3882 SET_DECL_DEBUG_EXPR (*from_p, *to_p);
3887 tree_to_gimple_tuple (expr_p);
3889 append_to_statement_list (*expr_p, pre_p);
3897 /* Gimplify a comparison between two variable-sized objects. Do this
3898 with a call to BUILT_IN_MEMCMP. */
3900 static enum gimplify_status
3901 gimplify_variable_sized_compare (tree *expr_p)
3903 tree op0 = TREE_OPERAND (*expr_p, 0);
3904 tree op1 = TREE_OPERAND (*expr_p, 1);
3905 tree t, arg, dest, src;
3907 arg = TYPE_SIZE_UNIT (TREE_TYPE (op0));
3908 arg = unshare_expr (arg);
3909 arg = SUBSTITUTE_PLACEHOLDER_IN_EXPR (arg, op0);
3910 src = build_fold_addr_expr (op1);
3911 dest = build_fold_addr_expr (op0);
3912 t = implicit_built_in_decls[BUILT_IN_MEMCMP];
3913 t = build_call_expr (t, 3, dest, src, arg);
3915 = build2 (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), t, integer_zero_node);
3920 /* Gimplify a comparison between two aggregate objects of integral scalar
3921 mode as a comparison between the bitwise equivalent scalar values. */
3923 static enum gimplify_status
3924 gimplify_scalar_mode_aggregate_compare (tree *expr_p)
3926 tree op0 = TREE_OPERAND (*expr_p, 0);
3927 tree op1 = TREE_OPERAND (*expr_p, 1);
3929 tree type = TREE_TYPE (op0);
3930 tree scalar_type = lang_hooks.types.type_for_mode (TYPE_MODE (type), 1);
3932 op0 = fold_build1 (VIEW_CONVERT_EXPR, scalar_type, op0);
3933 op1 = fold_build1 (VIEW_CONVERT_EXPR, scalar_type, op1);
3936 = fold_build2 (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), op0, op1);
3941 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
3942 points to the expression to gimplify.
3944 Expressions of the form 'a && b' are gimplified to:
3946 a && b ? true : false
3948 gimplify_cond_expr will do the rest.
3950 PRE_P points to the list where side effects that must happen before
3951 *EXPR_P should be stored. */
3953 static enum gimplify_status
3954 gimplify_boolean_expr (tree *expr_p)
3956 /* Preserve the original type of the expression. */
3957 tree type = TREE_TYPE (*expr_p);
3959 *expr_p = build3 (COND_EXPR, type, *expr_p,
3960 fold_convert (type, boolean_true_node),
3961 fold_convert (type, boolean_false_node));
3966 /* Gimplifies an expression sequence. This function gimplifies each
3967 expression and re-writes the original expression with the last
3968 expression of the sequence in GIMPLE form.
3970 PRE_P points to the list where the side effects for all the
3971 expressions in the sequence will be emitted.
3973 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
3974 /* ??? Should rearrange to share the pre-queue with all the indirect
3975 invocations of gimplify_expr. Would probably save on creations
3976 of statement_list nodes. */
3978 static enum gimplify_status
3979 gimplify_compound_expr (tree *expr_p, tree *pre_p, bool want_value)
3985 tree *sub_p = &TREE_OPERAND (t, 0);
3987 if (TREE_CODE (*sub_p) == COMPOUND_EXPR)
3988 gimplify_compound_expr (sub_p, pre_p, false);
3990 gimplify_stmt (sub_p);
3991 append_to_statement_list (*sub_p, pre_p);
3993 t = TREE_OPERAND (t, 1);
3995 while (TREE_CODE (t) == COMPOUND_EXPR);
4002 gimplify_stmt (expr_p);
4007 /* Gimplifies a statement list. These may be created either by an
4008 enlightened front-end, or by shortcut_cond_expr. */
4010 static enum gimplify_status
4011 gimplify_statement_list (tree *expr_p, tree *pre_p)
4013 tree temp = voidify_wrapper_expr (*expr_p, NULL);
4015 tree_stmt_iterator i = tsi_start (*expr_p);
4017 while (!tsi_end_p (i))
4021 gimplify_stmt (tsi_stmt_ptr (i));
4026 else if (TREE_CODE (t) == STATEMENT_LIST)
4028 tsi_link_before (&i, t, TSI_SAME_STMT);
4037 append_to_statement_list (*expr_p, pre_p);
4045 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
4046 gimplify. After gimplification, EXPR_P will point to a new temporary
4047 that holds the original value of the SAVE_EXPR node.
4049 PRE_P points to the list where side effects that must happen before
4050 *EXPR_P should be stored. */
4052 static enum gimplify_status
4053 gimplify_save_expr (tree *expr_p, tree *pre_p, tree *post_p)
4055 enum gimplify_status ret = GS_ALL_DONE;
4058 gcc_assert (TREE_CODE (*expr_p) == SAVE_EXPR);
4059 val = TREE_OPERAND (*expr_p, 0);
4061 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
4062 if (!SAVE_EXPR_RESOLVED_P (*expr_p))
4064 /* The operand may be a void-valued expression such as SAVE_EXPRs
4065 generated by the Java frontend for class initialization. It is
4066 being executed only for its side-effects. */
4067 if (TREE_TYPE (val) == void_type_node)
4069 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
4070 is_gimple_stmt, fb_none);
4071 append_to_statement_list (TREE_OPERAND (*expr_p, 0), pre_p);
4075 val = get_initialized_tmp_var (val, pre_p, post_p);
4077 TREE_OPERAND (*expr_p, 0) = val;
4078 SAVE_EXPR_RESOLVED_P (*expr_p) = 1;
4086 /* Re-write the ADDR_EXPR node pointed to by EXPR_P
4093 PRE_P points to the list where side effects that must happen before
4094 *EXPR_P should be stored.
4096 POST_P points to the list where side effects that must happen after
4097 *EXPR_P should be stored. */
4099 static enum gimplify_status
4100 gimplify_addr_expr (tree *expr_p, tree *pre_p, tree *post_p)
4102 tree expr = *expr_p;
4103 tree op0 = TREE_OPERAND (expr, 0);
4104 enum gimplify_status ret;
4106 switch (TREE_CODE (op0))
4109 case MISALIGNED_INDIRECT_REF:
4111 /* Check if we are dealing with an expression of the form '&*ptr'.
4112 While the front end folds away '&*ptr' into 'ptr', these
4113 expressions may be generated internally by the compiler (e.g.,
4114 builtins like __builtin_va_end). */
4115 /* Caution: the silent array decomposition semantics we allow for
4116 ADDR_EXPR means we can't always discard the pair. */
4117 /* Gimplification of the ADDR_EXPR operand may drop
4118 cv-qualification conversions, so make sure we add them if
4121 tree op00 = TREE_OPERAND (op0, 0);
4122 tree t_expr = TREE_TYPE (expr);
4123 tree t_op00 = TREE_TYPE (op00);
4125 if (!useless_type_conversion_p (t_expr, t_op00))
4126 op00 = fold_convert (TREE_TYPE (expr), op00);
4132 case VIEW_CONVERT_EXPR:
4133 /* Take the address of our operand and then convert it to the type of
4136 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
4137 all clear. The impact of this transformation is even less clear. */
4139 /* If the operand is a useless conversion, look through it. Doing so
4140 guarantees that the ADDR_EXPR and its operand will remain of the
4142 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0, 0)))
4143 op0 = TREE_OPERAND (op0, 0);
4145 *expr_p = fold_convert (TREE_TYPE (expr),
4146 build_fold_addr_expr (TREE_OPERAND (op0, 0)));
4151 /* We use fb_either here because the C frontend sometimes takes
4152 the address of a call that returns a struct; see
4153 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
4154 the implied temporary explicit. */
4156 /* Mark the RHS addressable. */
4157 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, post_p,
4158 is_gimple_addressable, fb_either);
4159 if (ret != GS_ERROR)
4161 op0 = TREE_OPERAND (expr, 0);
4163 /* For various reasons, the gimplification of the expression
4164 may have made a new INDIRECT_REF. */
4165 if (TREE_CODE (op0) == INDIRECT_REF)
4166 goto do_indirect_ref;
4168 /* Make sure TREE_INVARIANT, TREE_CONSTANT, and TREE_SIDE_EFFECTS
4170 recompute_tree_invariant_for_addr_expr (expr);
4172 mark_addressable (TREE_OPERAND (expr, 0));
4180 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
4181 value; output operands should be a gimple lvalue. */
4183 static enum gimplify_status
4184 gimplify_asm_expr (tree *expr_p, tree *pre_p, tree *post_p)
4186 tree expr = *expr_p;
4187 int noutputs = list_length (ASM_OUTPUTS (expr));
4188 const char **oconstraints
4189 = (const char **) alloca ((noutputs) * sizeof (const char *));
4192 const char *constraint;
4193 bool allows_mem, allows_reg, is_inout;
4194 enum gimplify_status ret, tret;
4197 for (i = 0, link = ASM_OUTPUTS (expr); link; ++i, link = TREE_CHAIN (link))
4199 size_t constraint_len;
4200 oconstraints[i] = constraint
4201 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4202 constraint_len = strlen (constraint);
4203 if (constraint_len == 0)
4206 parse_output_constraint (&constraint, i, 0, 0,
4207 &allows_mem, &allows_reg, &is_inout);
4209 if (!allows_reg && allows_mem)
4210 mark_addressable (TREE_VALUE (link));
4212 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4213 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
4214 fb_lvalue | fb_mayfail);
4215 if (tret == GS_ERROR)
4217 error ("invalid lvalue in asm output %d", i);
4223 /* An input/output operand. To give the optimizers more
4224 flexibility, split it into separate input and output
4229 /* Turn the in/out constraint into an output constraint. */
4230 char *p = xstrdup (constraint);
4232 TREE_VALUE (TREE_PURPOSE (link)) = build_string (constraint_len, p);
4234 /* And add a matching input constraint. */
4237 sprintf (buf, "%d", i);
4239 /* If there are multiple alternatives in the constraint,
4240 handle each of them individually. Those that allow register
4241 will be replaced with operand number, the others will stay
4243 if (strchr (p, ',') != NULL)
4245 size_t len = 0, buflen = strlen (buf);
4246 char *beg, *end, *str, *dst;
4250 end = strchr (beg, ',');
4252 end = strchr (beg, '\0');
4253 if ((size_t) (end - beg) < buflen)
4256 len += end - beg + 1;
4263 str = (char *) alloca (len);
4264 for (beg = p + 1, dst = str;;)
4267 bool mem_p, reg_p, inout_p;
4269 end = strchr (beg, ',');
4274 parse_output_constraint (&tem, i, 0, 0,
4275 &mem_p, ®_p, &inout_p);
4280 memcpy (dst, buf, buflen);
4289 memcpy (dst, beg, len);
4298 input = build_string (dst - str, str);
4301 input = build_string (strlen (buf), buf);
4304 input = build_string (constraint_len - 1, constraint + 1);
4308 input = build_tree_list (build_tree_list (NULL_TREE, input),
4309 unshare_expr (TREE_VALUE (link)));
4310 ASM_INPUTS (expr) = chainon (ASM_INPUTS (expr), input);
4314 for (link = ASM_INPUTS (expr); link; ++i, link = TREE_CHAIN (link))
4317 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4318 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
4319 oconstraints, &allows_mem, &allows_reg);
4321 /* If we can't make copies, we can only accept memory. */
4322 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (link))))
4328 error ("impossible constraint in %<asm%>");
4329 error ("non-memory input %d must stay in memory", i);
4334 /* If the operand is a memory input, it should be an lvalue. */
4335 if (!allows_reg && allows_mem)
4337 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4338 is_gimple_lvalue, fb_lvalue | fb_mayfail);
4339 mark_addressable (TREE_VALUE (link));
4340 if (tret == GS_ERROR)
4342 error ("memory input %d is not directly addressable", i);
4348 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4349 is_gimple_asm_val, fb_rvalue);
4350 if (tret == GS_ERROR)
4358 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
4359 WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
4360 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
4361 return to this function.
4363 FIXME should we complexify the prequeue handling instead? Or use flags
4364 for all the cleanups and let the optimizer tighten them up? The current
4365 code seems pretty fragile; it will break on a cleanup within any
4366 non-conditional nesting. But any such nesting would be broken, anyway;
4367 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
4368 and continues out of it. We can do that at the RTL level, though, so
4369 having an optimizer to tighten up try/finally regions would be a Good
4372 static enum gimplify_status
4373 gimplify_cleanup_point_expr (tree *expr_p, tree *pre_p)
4375 tree_stmt_iterator iter;
4378 tree temp = voidify_wrapper_expr (*expr_p, NULL);
4380 /* We only care about the number of conditions between the innermost
4381 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
4382 any cleanups collected outside the CLEANUP_POINT_EXPR. */
4383 int old_conds = gimplify_ctxp->conditions;
4384 tree old_cleanups = gimplify_ctxp->conditional_cleanups;
4385 gimplify_ctxp->conditions = 0;
4386 gimplify_ctxp->conditional_cleanups = NULL_TREE;
4388 body = TREE_OPERAND (*expr_p, 0);
4389 gimplify_to_stmt_list (&body);
4391 gimplify_ctxp->conditions = old_conds;
4392 gimplify_ctxp->conditional_cleanups = old_cleanups;
4394 for (iter = tsi_start (body); !tsi_end_p (iter); )
4396 tree *wce_p = tsi_stmt_ptr (iter);
4399 if (TREE_CODE (wce) == WITH_CLEANUP_EXPR)
4401 if (tsi_one_before_end_p (iter))
4403 tsi_link_before (&iter, TREE_OPERAND (wce, 0), TSI_SAME_STMT);
4410 enum tree_code code;
4412 if (CLEANUP_EH_ONLY (wce))
4413 code = TRY_CATCH_EXPR;
4415 code = TRY_FINALLY_EXPR;
4417 sl = tsi_split_statement_list_after (&iter);
4418 tfe = build2 (code, void_type_node, sl, NULL_TREE);
4419 append_to_statement_list (TREE_OPERAND (wce, 0),
4420 &TREE_OPERAND (tfe, 1));
4422 iter = tsi_start (sl);
4432 append_to_statement_list (body, pre_p);
4442 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
4443 is the cleanup action required. */
4446 gimple_push_cleanup (tree var, tree cleanup, bool eh_only, tree *pre_p)
4450 /* Errors can result in improperly nested cleanups. Which results in
4451 confusion when trying to resolve the WITH_CLEANUP_EXPR. */
4452 if (errorcount || sorrycount)
4455 if (gimple_conditional_context ())
4457 /* If we're in a conditional context, this is more complex. We only
4458 want to run the cleanup if we actually ran the initialization that
4459 necessitates it, but we want to run it after the end of the
4460 conditional context. So we wrap the try/finally around the
4461 condition and use a flag to determine whether or not to actually
4462 run the destructor. Thus
4466 becomes (approximately)
4470 if (test) { A::A(temp); flag = 1; val = f(temp); }
4473 if (flag) A::~A(temp);
4478 tree flag = create_tmp_var (boolean_type_node, "cleanup");
4479 tree ffalse = build_gimple_modify_stmt (flag, boolean_false_node);
4480 tree ftrue = build_gimple_modify_stmt (flag, boolean_true_node);
4481 cleanup = build3 (COND_EXPR, void_type_node, flag, cleanup, NULL);
4482 wce = build1 (WITH_CLEANUP_EXPR, void_type_node, cleanup);
4483 append_to_statement_list (ffalse, &gimplify_ctxp->conditional_cleanups);
4484 append_to_statement_list (wce, &gimplify_ctxp->conditional_cleanups);
4485 append_to_statement_list (ftrue, pre_p);
4487 /* Because of this manipulation, and the EH edges that jump
4488 threading cannot redirect, the temporary (VAR) will appear
4489 to be used uninitialized. Don't warn. */
4490 TREE_NO_WARNING (var) = 1;
4494 wce = build1 (WITH_CLEANUP_EXPR, void_type_node, cleanup);
4495 CLEANUP_EH_ONLY (wce) = eh_only;
4496 append_to_statement_list (wce, pre_p);
4499 gimplify_stmt (&TREE_OPERAND (wce, 0));
4502 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
4504 static enum gimplify_status
4505 gimplify_target_expr (tree *expr_p, tree *pre_p, tree *post_p)
4507 tree targ = *expr_p;
4508 tree temp = TARGET_EXPR_SLOT (targ);
4509 tree init = TARGET_EXPR_INITIAL (targ);
4510 enum gimplify_status ret;
4514 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
4515 to the temps list. Handle also variable length TARGET_EXPRs. */
4516 if (TREE_CODE (DECL_SIZE (temp)) != INTEGER_CST)
4518 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (temp)))
4519 gimplify_type_sizes (TREE_TYPE (temp), pre_p);
4520 gimplify_vla_decl (temp, pre_p);
4523 gimple_add_tmp_var (temp);
4525 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
4526 expression is supposed to initialize the slot. */
4527 if (VOID_TYPE_P (TREE_TYPE (init)))
4528 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
4531 init = build2 (INIT_EXPR, void_type_node, temp, init);
4532 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt,
4535 if (ret == GS_ERROR)
4537 /* PR c++/28266 Make sure this is expanded only once. */
4538 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
4541 append_to_statement_list (init, pre_p);
4543 /* If needed, push the cleanup for the temp. */
4544 if (TARGET_EXPR_CLEANUP (targ))
4546 gimplify_stmt (&TARGET_EXPR_CLEANUP (targ));
4547 gimple_push_cleanup (temp, TARGET_EXPR_CLEANUP (targ),
4548 CLEANUP_EH_ONLY (targ), pre_p);
4551 /* Only expand this once. */
4552 TREE_OPERAND (targ, 3) = init;
4553 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
4556 /* We should have expanded this before. */
4557 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp));
4563 /* Gimplification of expression trees. */
4565 /* Gimplify an expression which appears at statement context; usually, this
4566 means replacing it with a suitably gimple STATEMENT_LIST. */
4569 gimplify_stmt (tree *stmt_p)
4571 gimplify_expr (stmt_p, NULL, NULL, is_gimple_stmt, fb_none);
4574 /* Similarly, but force the result to be a STATEMENT_LIST. */
4577 gimplify_to_stmt_list (tree *stmt_p)
4579 gimplify_stmt (stmt_p);
4581 *stmt_p = alloc_stmt_list ();
4582 else if (TREE_CODE (*stmt_p) != STATEMENT_LIST)
4585 *stmt_p = alloc_stmt_list ();
4586 append_to_statement_list (t, stmt_p);
4591 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
4592 to CTX. If entries already exist, force them to be some flavor of private.
4593 If there is no enclosing parallel, do nothing. */
4596 omp_firstprivatize_variable (struct gimplify_omp_ctx *ctx, tree decl)
4600 if (decl == NULL || !DECL_P (decl))
4605 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4608 if (n->value & GOVD_SHARED)
4609 n->value = GOVD_FIRSTPRIVATE | (n->value & GOVD_SEEN);
4613 else if (ctx->is_parallel)
4614 omp_add_variable (ctx, decl, GOVD_FIRSTPRIVATE);
4616 ctx = ctx->outer_context;
4621 /* Similarly for each of the type sizes of TYPE. */
4624 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx *ctx, tree type)
4626 if (type == NULL || type == error_mark_node)
4628 type = TYPE_MAIN_VARIANT (type);
4630 if (pointer_set_insert (ctx->privatized_types, type))
4633 switch (TREE_CODE (type))
4639 case FIXED_POINT_TYPE:
4640 omp_firstprivatize_variable (ctx, TYPE_MIN_VALUE (type));
4641 omp_firstprivatize_variable (ctx, TYPE_MAX_VALUE (type));
4645 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
4646 omp_firstprivatize_type_sizes (ctx, TYPE_DOMAIN (type));
4651 case QUAL_UNION_TYPE:
4654 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
4655 if (TREE_CODE (field) == FIELD_DECL)
4657 omp_firstprivatize_variable (ctx, DECL_FIELD_OFFSET (field));
4658 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (field));
4664 case REFERENCE_TYPE:
4665 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
4672 omp_firstprivatize_variable (ctx, TYPE_SIZE (type));
4673 omp_firstprivatize_variable (ctx, TYPE_SIZE_UNIT (type));
4674 lang_hooks.types.omp_firstprivatize_type_sizes (ctx, type);
4677 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
4680 omp_add_variable (struct gimplify_omp_ctx *ctx, tree decl, unsigned int flags)
4683 unsigned int nflags;
4686 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
4689 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
4690 there are constructors involved somewhere. */
4691 if (TREE_ADDRESSABLE (TREE_TYPE (decl))
4692 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
4695 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4698 /* We shouldn't be re-adding the decl with the same data
4700 gcc_assert ((n->value & GOVD_DATA_SHARE_CLASS & flags) == 0);
4701 /* The only combination of data sharing classes we should see is
4702 FIRSTPRIVATE and LASTPRIVATE. */
4703 nflags = n->value | flags;
4704 gcc_assert ((nflags & GOVD_DATA_SHARE_CLASS)
4705 == (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE));
4710 /* When adding a variable-sized variable, we have to handle all sorts
4711 of additional bits of data: the pointer replacement variable, and
4712 the parameters of the type. */
4713 if (DECL_SIZE (decl) && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
4715 /* Add the pointer replacement variable as PRIVATE if the variable
4716 replacement is private, else FIRSTPRIVATE since we'll need the
4717 address of the original variable either for SHARED, or for the
4718 copy into or out of the context. */
4719 if (!(flags & GOVD_LOCAL))
4721 nflags = flags & GOVD_PRIVATE ? GOVD_PRIVATE : GOVD_FIRSTPRIVATE;
4722 nflags |= flags & GOVD_SEEN;
4723 t = DECL_VALUE_EXPR (decl);
4724 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
4725 t = TREE_OPERAND (t, 0);
4726 gcc_assert (DECL_P (t));
4727 omp_add_variable (ctx, t, nflags);
4730 /* Add all of the variable and type parameters (which should have
4731 been gimplified to a formal temporary) as FIRSTPRIVATE. */
4732 omp_firstprivatize_variable (ctx, DECL_SIZE_UNIT (decl));
4733 omp_firstprivatize_variable (ctx, DECL_SIZE (decl));
4734 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
4736 /* The variable-sized variable itself is never SHARED, only some form
4737 of PRIVATE. The sharing would take place via the pointer variable
4738 which we remapped above. */
4739 if (flags & GOVD_SHARED)
4740 flags = GOVD_PRIVATE | GOVD_DEBUG_PRIVATE
4741 | (flags & (GOVD_SEEN | GOVD_EXPLICIT));
4743 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
4744 alloca statement we generate for the variable, so make sure it
4745 is available. This isn't automatically needed for the SHARED
4746 case, since we won't be allocating local storage then.
4747 For local variables TYPE_SIZE_UNIT might not be gimplified yet,
4748 in this case omp_notice_variable will be called later
4749 on when it is gimplified. */
4750 else if (! (flags & GOVD_LOCAL))
4751 omp_notice_variable (ctx, TYPE_SIZE_UNIT (TREE_TYPE (decl)), true);
4753 else if (lang_hooks.decls.omp_privatize_by_reference (decl))
4755 gcc_assert ((flags & GOVD_LOCAL) == 0);
4756 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
4758 /* Similar to the direct variable sized case above, we'll need the
4759 size of references being privatized. */
4760 if ((flags & GOVD_SHARED) == 0)
4762 t = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl)));
4763 if (TREE_CODE (t) != INTEGER_CST)
4764 omp_notice_variable (ctx, t, true);
4768 splay_tree_insert (ctx->variables, (splay_tree_key)decl, flags);
4771 /* Record the fact that DECL was used within the OpenMP context CTX.
4772 IN_CODE is true when real code uses DECL, and false when we should
4773 merely emit default(none) errors. Return true if DECL is going to
4774 be remapped and thus DECL shouldn't be gimplified into its
4775 DECL_VALUE_EXPR (if any). */
4778 omp_notice_variable (struct gimplify_omp_ctx *ctx, tree decl, bool in_code)
4781 unsigned flags = in_code ? GOVD_SEEN : 0;
4782 bool ret = false, shared;
4784 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
4787 /* Threadprivate variables are predetermined. */
4788 if (is_global_var (decl))
4790 if (DECL_THREAD_LOCAL_P (decl))
4793 if (DECL_HAS_VALUE_EXPR_P (decl))
4795 tree value = get_base_address (DECL_VALUE_EXPR (decl));
4797 if (value && DECL_P (value) && DECL_THREAD_LOCAL_P (value))
4802 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4805 enum omp_clause_default_kind default_kind, kind;
4807 if (!ctx->is_parallel)
4810 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
4811 remapped firstprivate instead of shared. To some extent this is
4812 addressed in omp_firstprivatize_type_sizes, but not effectively. */
4813 default_kind = ctx->default_kind;
4814 kind = lang_hooks.decls.omp_predetermined_sharing (decl);
4815 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
4816 default_kind = kind;
4818 switch (default_kind)
4820 case OMP_CLAUSE_DEFAULT_NONE:
4821 error ("%qs not specified in enclosing parallel",
4822 IDENTIFIER_POINTER (DECL_NAME (decl)));
4823 error ("%Henclosing parallel", &ctx->location);
4825 case OMP_CLAUSE_DEFAULT_SHARED:
4826 flags |= GOVD_SHARED;
4828 case OMP_CLAUSE_DEFAULT_PRIVATE:
4829 flags |= GOVD_PRIVATE;
4835 omp_add_variable (ctx, decl, flags);
4837 shared = (flags & GOVD_SHARED) != 0;
4838 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
4842 shared = ((flags | n->value) & GOVD_SHARED) != 0;
4843 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
4845 /* If nothing changed, there's nothing left to do. */
4846 if ((n->value & flags) == flags)
4852 /* If the variable is private in the current context, then we don't
4853 need to propagate anything to an outer context. */
4854 if (flags & GOVD_PRIVATE)
4856 if (ctx->outer_context
4857 && omp_notice_variable (ctx->outer_context, decl, in_code))
4862 /* Verify that DECL is private within CTX. If there's specific information
4863 to the contrary in the innermost scope, generate an error. */
4866 omp_is_private (struct gimplify_omp_ctx *ctx, tree decl)
4870 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4873 if (n->value & GOVD_SHARED)
4875 if (ctx == gimplify_omp_ctxp)
4877 error ("iteration variable %qs should be private",
4878 IDENTIFIER_POINTER (DECL_NAME (decl)));
4879 n->value = GOVD_PRIVATE;
4885 else if ((n->value & GOVD_EXPLICIT) != 0
4886 && (ctx == gimplify_omp_ctxp
4887 || (ctx->is_combined_parallel
4888 && gimplify_omp_ctxp->outer_context == ctx)))
4890 if ((n->value & GOVD_FIRSTPRIVATE) != 0)
4891 error ("iteration variable %qs should not be firstprivate",
4892 IDENTIFIER_POINTER (DECL_NAME (decl)));
4893 else if ((n->value & GOVD_REDUCTION) != 0)
4894 error ("iteration variable %qs should not be reduction",
4895 IDENTIFIER_POINTER (DECL_NAME (decl)));
4900 if (ctx->is_parallel)
4902 else if (ctx->outer_context)
4903 return omp_is_private (ctx->outer_context, decl);
4905 return !is_global_var (decl);
4908 /* Return true if DECL is private within a parallel region
4909 that binds to the current construct's context or in parallel
4910 region's REDUCTION clause. */
4913 omp_check_private (struct gimplify_omp_ctx *ctx, tree decl)
4919 ctx = ctx->outer_context;
4921 return !(is_global_var (decl)
4922 /* References might be private, but might be shared too. */
4923 || lang_hooks.decls.omp_privatize_by_reference (decl));
4925 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
4927 return (n->value & GOVD_SHARED) == 0;
4929 while (!ctx->is_parallel);
4933 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
4934 and previous omp contexts. */
4937 gimplify_scan_omp_clauses (tree *list_p, tree *pre_p, bool in_parallel,
4938 bool in_combined_parallel)
4940 struct gimplify_omp_ctx *ctx, *outer_ctx;
4943 ctx = new_omp_context (in_parallel, in_combined_parallel);
4944 outer_ctx = ctx->outer_context;
4946 while ((c = *list_p) != NULL)
4948 enum gimplify_status gs;
4949 bool remove = false;
4950 bool notice_outer = true;
4951 const char *check_non_private = NULL;
4955 switch (OMP_CLAUSE_CODE (c))
4957 case OMP_CLAUSE_PRIVATE:
4958 flags = GOVD_PRIVATE | GOVD_EXPLICIT;
4959 notice_outer = false;
4961 case OMP_CLAUSE_SHARED:
4962 flags = GOVD_SHARED | GOVD_EXPLICIT;
4964 case OMP_CLAUSE_FIRSTPRIVATE:
4965 flags = GOVD_FIRSTPRIVATE | GOVD_EXPLICIT;
4966 check_non_private = "firstprivate";
4968 case OMP_CLAUSE_LASTPRIVATE:
4969 flags = GOVD_LASTPRIVATE | GOVD_SEEN | GOVD_EXPLICIT;
4970 check_non_private = "lastprivate";
4972 case OMP_CLAUSE_REDUCTION:
4973 flags = GOVD_REDUCTION | GOVD_SEEN | GOVD_EXPLICIT;
4974 check_non_private = "reduction";
4978 decl = OMP_CLAUSE_DECL (c);
4979 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
4984 omp_add_variable (ctx, decl, flags);
4985 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION
4986 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c))
4988 omp_add_variable (ctx, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c),
4989 GOVD_LOCAL | GOVD_SEEN);
4990 gimplify_omp_ctxp = ctx;
4991 push_gimplify_context ();
4992 gimplify_stmt (&OMP_CLAUSE_REDUCTION_INIT (c));
4993 pop_gimplify_context (OMP_CLAUSE_REDUCTION_INIT (c));
4994 push_gimplify_context ();
4995 gimplify_stmt (&OMP_CLAUSE_REDUCTION_MERGE (c));
4996 pop_gimplify_context (OMP_CLAUSE_REDUCTION_MERGE (c));
4997 gimplify_omp_ctxp = outer_ctx;
5003 case OMP_CLAUSE_COPYIN:
5004 case OMP_CLAUSE_COPYPRIVATE:
5005 decl = OMP_CLAUSE_DECL (c);
5006 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
5013 omp_notice_variable (outer_ctx, decl, true);
5014 if (check_non_private
5016 && omp_check_private (ctx, decl))
5018 error ("%s variable %qs is private in outer context",
5019 check_non_private, IDENTIFIER_POINTER (DECL_NAME (decl)));
5025 OMP_CLAUSE_OPERAND (c, 0)
5026 = gimple_boolify (OMP_CLAUSE_OPERAND (c, 0));
5029 case OMP_CLAUSE_SCHEDULE:
5030 case OMP_CLAUSE_NUM_THREADS:
5031 gs = gimplify_expr (&OMP_CLAUSE_OPERAND (c, 0), pre_p, NULL,
5032 is_gimple_val, fb_rvalue);
5037 case OMP_CLAUSE_NOWAIT:
5038 case OMP_CLAUSE_ORDERED:
5041 case OMP_CLAUSE_DEFAULT:
5042 ctx->default_kind = OMP_CLAUSE_DEFAULT_KIND (c);
5050 *list_p = OMP_CLAUSE_CHAIN (c);
5052 list_p = &OMP_CLAUSE_CHAIN (c);
5055 gimplify_omp_ctxp = ctx;
5058 /* For all variables that were not actually used within the context,
5059 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
5062 gimplify_adjust_omp_clauses_1 (splay_tree_node n, void *data)
5064 tree *list_p = (tree *) data;
5065 tree decl = (tree) n->key;
5066 unsigned flags = n->value;
5067 enum omp_clause_code code;
5071 if (flags & (GOVD_EXPLICIT | GOVD_LOCAL))
5073 if ((flags & GOVD_SEEN) == 0)
5075 if (flags & GOVD_DEBUG_PRIVATE)
5077 gcc_assert ((flags & GOVD_DATA_SHARE_CLASS) == GOVD_PRIVATE);
5078 private_debug = true;
5082 = lang_hooks.decls.omp_private_debug_clause (decl,
5083 !!(flags & GOVD_SHARED));
5085 code = OMP_CLAUSE_PRIVATE;
5086 else if (flags & GOVD_SHARED)
5088 if (is_global_var (decl))
5090 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp->outer_context;
5094 = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5095 if (on && (on->value & (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE
5096 | GOVD_PRIVATE | GOVD_REDUCTION)) != 0)
5098 ctx = ctx->outer_context;
5103 code = OMP_CLAUSE_SHARED;
5105 else if (flags & GOVD_PRIVATE)
5106 code = OMP_CLAUSE_PRIVATE;
5107 else if (flags & GOVD_FIRSTPRIVATE)
5108 code = OMP_CLAUSE_FIRSTPRIVATE;
5112 clause = build_omp_clause (code);
5113 OMP_CLAUSE_DECL (clause) = decl;
5114 OMP_CLAUSE_CHAIN (clause) = *list_p;
5116 OMP_CLAUSE_PRIVATE_DEBUG (clause) = 1;
5123 gimplify_adjust_omp_clauses (tree *list_p)
5125 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
5128 while ((c = *list_p) != NULL)
5131 bool remove = false;
5133 switch (OMP_CLAUSE_CODE (c))
5135 case OMP_CLAUSE_PRIVATE:
5136 case OMP_CLAUSE_SHARED:
5137 case OMP_CLAUSE_FIRSTPRIVATE:
5138 decl = OMP_CLAUSE_DECL (c);
5139 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5140 remove = !(n->value & GOVD_SEEN);
5143 bool shared = OMP_CLAUSE_CODE (c) == OMP_CLAUSE_SHARED;
5144 if ((n->value & GOVD_DEBUG_PRIVATE)
5145 || lang_hooks.decls.omp_private_debug_clause (decl, shared))
5147 gcc_assert ((n->value & GOVD_DEBUG_PRIVATE) == 0
5148 || ((n->value & GOVD_DATA_SHARE_CLASS)
5150 OMP_CLAUSE_SET_CODE (c, OMP_CLAUSE_PRIVATE);
5151 OMP_CLAUSE_PRIVATE_DEBUG (c) = 1;
5156 case OMP_CLAUSE_LASTPRIVATE:
5157 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
5158 accurately reflect the presence of a FIRSTPRIVATE clause. */
5159 decl = OMP_CLAUSE_DECL (c);
5160 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5161 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)
5162 = (n->value & GOVD_FIRSTPRIVATE) != 0;
5165 case OMP_CLAUSE_REDUCTION:
5166 case OMP_CLAUSE_COPYIN:
5167 case OMP_CLAUSE_COPYPRIVATE:
5169 case OMP_CLAUSE_NUM_THREADS:
5170 case OMP_CLAUSE_SCHEDULE:
5171 case OMP_CLAUSE_NOWAIT:
5172 case OMP_CLAUSE_ORDERED:
5173 case OMP_CLAUSE_DEFAULT:
5181 *list_p = OMP_CLAUSE_CHAIN (c);
5183 list_p = &OMP_CLAUSE_CHAIN (c);
5186 /* Add in any implicit data sharing. */
5187 splay_tree_foreach (ctx->variables, gimplify_adjust_omp_clauses_1, list_p);
5189 gimplify_omp_ctxp = ctx->outer_context;
5190 delete_omp_context (ctx);
5193 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
5194 gimplification of the body, as well as scanning the body for used
5195 variables. We need to do this scan now, because variable-sized
5196 decls will be decomposed during gimplification. */
5198 static enum gimplify_status
5199 gimplify_omp_parallel (tree *expr_p, tree *pre_p)
5201 tree expr = *expr_p;
5203 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr), pre_p, true,
5204 OMP_PARALLEL_COMBINED (expr));
5206 push_gimplify_context ();
5208 gimplify_stmt (&OMP_PARALLEL_BODY (expr));
5210 if (TREE_CODE (OMP_PARALLEL_BODY (expr)) == BIND_EXPR)
5211 pop_gimplify_context (OMP_PARALLEL_BODY (expr));
5213 pop_gimplify_context (NULL_TREE);
5215 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr));
5220 /* Gimplify the gross structure of an OMP_FOR statement. */
5222 static enum gimplify_status
5223 gimplify_omp_for (tree *expr_p, tree *pre_p)
5225 tree for_stmt, decl, var, t;
5226 enum gimplify_status ret = GS_OK;
5227 tree body, init_decl = NULL_TREE;
5231 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt), pre_p, false, false);
5233 t = OMP_FOR_INIT (for_stmt);
5234 gcc_assert (TREE_CODE (t) == MODIFY_EXPR
5235 || TREE_CODE (t) == GIMPLE_MODIFY_STMT);
5236 decl = GENERIC_TREE_OPERAND (t, 0);
5237 gcc_assert (DECL_P (decl));
5238 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl)));
5240 /* Make sure the iteration variable is private. */
5241 if (omp_is_private (gimplify_omp_ctxp, decl))
5242 omp_notice_variable (gimplify_omp_ctxp, decl, true);
5244 omp_add_variable (gimplify_omp_ctxp, decl, GOVD_PRIVATE | GOVD_SEEN);
5246 /* If DECL is not a gimple register, create a temporary variable to act as an
5247 iteration counter. This is valid, since DECL cannot be modified in the
5248 body of the loop. */
5249 if (!is_gimple_reg (decl))
5251 var = create_tmp_var (TREE_TYPE (decl), get_name (decl));
5252 GENERIC_TREE_OPERAND (t, 0) = var;
5254 init_decl = build_gimple_modify_stmt (decl, var);
5255 omp_add_variable (gimplify_omp_ctxp, var, GOVD_PRIVATE | GOVD_SEEN);
5260 ret |= gimplify_expr (&GENERIC_TREE_OPERAND (t, 1),
5261 &OMP_FOR_PRE_BODY (for_stmt),
5262 NULL, is_gimple_val, fb_rvalue);
5264 tree_to_gimple_tuple (&OMP_FOR_INIT (for_stmt));
5266 t = OMP_FOR_COND (for_stmt);
5267 gcc_assert (COMPARISON_CLASS_P (t));
5268 gcc_assert (GENERIC_TREE_OPERAND (t, 0) == decl);
5269 TREE_OPERAND (t, 0) = var;
5271 ret |= gimplify_expr (&GENERIC_TREE_OPERAND (t, 1),
5272 &OMP_FOR_PRE_BODY (for_stmt),
5273 NULL, is_gimple_val, fb_rvalue);
5275 tree_to_gimple_tuple (&OMP_FOR_INCR (for_stmt));
5276 t = OMP_FOR_INCR (for_stmt);
5277 switch (TREE_CODE (t))
5279 case PREINCREMENT_EXPR:
5280 case POSTINCREMENT_EXPR:
5281 t = build_int_cst (TREE_TYPE (decl), 1);
5282 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
5283 t = build_gimple_modify_stmt (var, t);
5284 OMP_FOR_INCR (for_stmt) = t;
5287 case PREDECREMENT_EXPR:
5288 case POSTDECREMENT_EXPR:
5289 t = build_int_cst (TREE_TYPE (decl), -1);
5290 t = build2 (PLUS_EXPR, TREE_TYPE (decl), var, t);
5291 t = build_gimple_modify_stmt (var, t);
5292 OMP_FOR_INCR (for_stmt) = t;
5295 case GIMPLE_MODIFY_STMT:
5296 gcc_assert (GIMPLE_STMT_OPERAND (t, 0) == decl);
5297 GIMPLE_STMT_OPERAND (t, 0) = var;
5299 t = GIMPLE_STMT_OPERAND (t, 1);
5300 switch (TREE_CODE (t))
5303 if (TREE_OPERAND (t, 1) == decl)
5305 TREE_OPERAND (t, 1) = TREE_OPERAND (t, 0);
5306 TREE_OPERAND (t, 0) = var;
5312 gcc_assert (TREE_OPERAND (t, 0) == decl);
5313 TREE_OPERAND (t, 0) = var;
5319 ret |= gimplify_expr (&TREE_OPERAND (t, 1), &OMP_FOR_PRE_BODY (for_stmt),
5320 NULL, is_gimple_val, fb_rvalue);
5327 body = OMP_FOR_BODY (for_stmt);
5328 gimplify_to_stmt_list (&body);
5329 t = alloc_stmt_list ();
5331 append_to_statement_list (init_decl, &t);
5332 append_to_statement_list (body, &t);
5333 OMP_FOR_BODY (for_stmt) = t;
5334 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt));
5336 return ret == GS_ALL_DONE ? GS_ALL_DONE : GS_ERROR;
5339 /* Gimplify the gross structure of other OpenMP worksharing constructs.
5340 In particular, OMP_SECTIONS and OMP_SINGLE. */
5342 static enum gimplify_status
5343 gimplify_omp_workshare (tree *expr_p, tree *pre_p)
5345 tree stmt = *expr_p;
5347 gimplify_scan_omp_clauses (&OMP_CLAUSES (stmt), pre_p, false, false);
5348 gimplify_to_stmt_list (&OMP_BODY (stmt));
5349 gimplify_adjust_omp_clauses (&OMP_CLAUSES (stmt));
5354 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
5355 stabilized the lhs of the atomic operation as *ADDR. Return true if
5356 EXPR is this stabilized form. */
5359 goa_lhs_expr_p (tree expr, tree addr)
5361 /* Also include casts to other type variants. The C front end is fond
5362 of adding these for e.g. volatile variables. This is like
5363 STRIP_TYPE_NOPS but includes the main variant lookup. */
5364 while ((TREE_CODE (expr) == NOP_EXPR
5365 || TREE_CODE (expr) == CONVERT_EXPR
5366 || TREE_CODE (expr) == NON_LVALUE_EXPR)
5367 && TREE_OPERAND (expr, 0) != error_mark_node
5368 && (TYPE_MAIN_VARIANT (TREE_TYPE (expr))
5369 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (expr, 0)))))
5370 expr = TREE_OPERAND (expr, 0);
5372 if (TREE_CODE (expr) == INDIRECT_REF)
5374 expr = TREE_OPERAND (expr, 0);
5376 && (TREE_CODE (expr) == NOP_EXPR
5377 || TREE_CODE (expr) == CONVERT_EXPR
5378 || TREE_CODE (expr) == NON_LVALUE_EXPR)
5379 && TREE_CODE (expr) == TREE_CODE (addr)
5380 && TYPE_MAIN_VARIANT (TREE_TYPE (expr))
5381 == TYPE_MAIN_VARIANT (TREE_TYPE (addr)))
5383 expr = TREE_OPERAND (expr, 0);
5384 addr = TREE_OPERAND (addr, 0);
5386 return expr == addr;
5388 if (TREE_CODE (addr) == ADDR_EXPR && expr == TREE_OPERAND (addr, 0))
5393 /* Walk *EXPR_P and replace
5394 appearances of *LHS_ADDR with LHS_VAR. If an expression does not involve
5395 the lhs, evaluate it into a temporary. Return 1 if the lhs appeared as
5396 a subexpression, 0 if it did not, or -1 if an error was encountered. */
5399 goa_stabilize_expr (tree *expr_p, tree *pre_p, tree lhs_addr, tree lhs_var)
5401 tree expr = *expr_p;
5404 if (goa_lhs_expr_p (expr, lhs_addr))
5409 if (is_gimple_val (expr))
5413 switch (TREE_CODE_CLASS (TREE_CODE (expr)))
5416 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p,
5419 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p,
5428 enum gimplify_status gs;
5429 gs = gimplify_expr (expr_p, pre_p, NULL, is_gimple_val, fb_rvalue);
5430 if (gs != GS_ALL_DONE)
5437 /* Gimplify an OMP_ATOMIC statement. */
5439 static enum gimplify_status
5440 gimplify_omp_atomic (tree *expr_p, tree *pre_p)
5442 tree addr = TREE_OPERAND (*expr_p, 0);
5443 tree rhs = TREE_OPERAND (*expr_p, 1);
5444 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr)));
5445 tree tmp_load, load, store;
5447 tmp_load = create_tmp_var (type, NULL);
5448 if (goa_stabilize_expr (&rhs, pre_p, addr, tmp_load) < 0)
5451 if (gimplify_expr (&addr, pre_p, NULL, is_gimple_val, fb_rvalue)
5455 load = build2 (OMP_ATOMIC_LOAD, void_type_node, tmp_load, addr);
5456 append_to_statement_list (load, pre_p);
5457 if (gimplify_expr (&rhs, pre_p, NULL, is_gimple_val, fb_rvalue)
5460 store = build1 (OMP_ATOMIC_STORE, void_type_node, rhs);
5467 /* Gimplifies the expression tree pointed to by EXPR_P. Return 0 if
5468 gimplification failed.
5470 PRE_P points to the list where side effects that must happen before
5471 EXPR should be stored.
5473 POST_P points to the list where side effects that must happen after
5474 EXPR should be stored, or NULL if there is no suitable list. In
5475 that case, we copy the result to a temporary, emit the
5476 post-effects, and then return the temporary.
5478 GIMPLE_TEST_F points to a function that takes a tree T and
5479 returns nonzero if T is in the GIMPLE form requested by the
5480 caller. The GIMPLE predicates are in tree-gimple.c.
5482 This test is used twice. Before gimplification, the test is
5483 invoked to determine whether *EXPR_P is already gimple enough. If
5484 that fails, *EXPR_P is gimplified according to its code and
5485 GIMPLE_TEST_F is called again. If the test still fails, then a new
5486 temporary variable is created and assigned the value of the
5487 gimplified expression.
5489 FALLBACK tells the function what sort of a temporary we want. If the 1
5490 bit is set, an rvalue is OK. If the 2 bit is set, an lvalue is OK.
5491 If both are set, either is OK, but an lvalue is preferable.
5493 The return value is either GS_ERROR or GS_ALL_DONE, since this function
5494 iterates until solution. */
5496 enum gimplify_status
5497 gimplify_expr (tree *expr_p, tree *pre_p, tree *post_p,
5498 bool (* gimple_test_f) (tree), fallback_t fallback)
5501 tree internal_pre = NULL_TREE;
5502 tree internal_post = NULL_TREE;
5504 int is_statement = (pre_p == NULL);
5505 location_t saved_location;
5506 enum gimplify_status ret;
5508 save_expr = *expr_p;
5509 if (save_expr == NULL_TREE)
5512 /* We used to check the predicate here and return immediately if it
5513 succeeds. This is wrong; the design is for gimplification to be
5514 idempotent, and for the predicates to only test for valid forms, not
5515 whether they are fully simplified. */
5517 /* Set up our internal queues if needed. */
5519 pre_p = &internal_pre;
5521 post_p = &internal_post;
5523 saved_location = input_location;
5524 if (save_expr != error_mark_node
5525 && EXPR_HAS_LOCATION (*expr_p))
5526 input_location = EXPR_LOCATION (*expr_p);
5528 /* Loop over the specific gimplifiers until the toplevel node
5529 remains the same. */
5532 /* Strip away as many useless type conversions as possible
5534 STRIP_USELESS_TYPE_CONVERSION (*expr_p);
5536 /* Remember the expr. */
5537 save_expr = *expr_p;
5539 /* Die, die, die, my darling. */
5540 if (save_expr == error_mark_node
5541 || (!GIMPLE_STMT_P (save_expr)
5542 && TREE_TYPE (save_expr)
5543 && TREE_TYPE (save_expr) == error_mark_node))
5549 /* Do any language-specific gimplification. */
5550 ret = lang_hooks.gimplify_expr (expr_p, pre_p, post_p);
5553 if (*expr_p == NULL_TREE)
5555 if (*expr_p != save_expr)
5558 else if (ret != GS_UNHANDLED)
5562 switch (TREE_CODE (*expr_p))
5564 /* First deal with the special cases. */
5566 case POSTINCREMENT_EXPR:
5567 case POSTDECREMENT_EXPR:
5568 case PREINCREMENT_EXPR:
5569 case PREDECREMENT_EXPR:
5570 ret = gimplify_self_mod_expr (expr_p, pre_p, post_p,
5571 fallback != fb_none);
5575 case ARRAY_RANGE_REF:
5579 case VIEW_CONVERT_EXPR:
5580 ret = gimplify_compound_lval (expr_p, pre_p, post_p,
5581 fallback ? fallback : fb_rvalue);
5585 ret = gimplify_cond_expr (expr_p, pre_p, fallback);
5586 /* C99 code may assign to an array in a structure value of a
5587 conditional expression, and this has undefined behavior
5588 only on execution, so create a temporary if an lvalue is
5590 if (fallback == fb_lvalue)
5592 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
5593 mark_addressable (*expr_p);
5598 ret = gimplify_call_expr (expr_p, pre_p, fallback != fb_none);
5599 /* C99 code may assign to an array in a structure returned
5600 from a function, and this has undefined behavior only on
5601 execution, so create a temporary if an lvalue is
5603 if (fallback == fb_lvalue)
5605 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
5606 mark_addressable (*expr_p);
5614 ret = gimplify_compound_expr (expr_p, pre_p, fallback != fb_none);
5618 case GIMPLE_MODIFY_STMT:
5620 ret = gimplify_modify_expr (expr_p, pre_p, post_p,
5621 fallback != fb_none);
5625 /* The distinction between MODIFY_EXPR and INIT_EXPR is no longer
5627 if (TREE_CODE (*expr_p) == INIT_EXPR)
5628 TREE_SET_CODE (*expr_p, MODIFY_EXPR);
5630 /* Convert MODIFY_EXPR to GIMPLE_MODIFY_STMT. */
5631 if (TREE_CODE (*expr_p) == MODIFY_EXPR)
5632 tree_to_gimple_tuple (expr_p);
5637 case TRUTH_ANDIF_EXPR:
5638 case TRUTH_ORIF_EXPR:
5639 ret = gimplify_boolean_expr (expr_p);
5642 case TRUTH_NOT_EXPR:
5643 TREE_OPERAND (*expr_p, 0)
5644 = gimple_boolify (TREE_OPERAND (*expr_p, 0));
5645 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5646 is_gimple_val, fb_rvalue);
5647 recalculate_side_effects (*expr_p);
5651 ret = gimplify_addr_expr (expr_p, pre_p, post_p);
5655 ret = gimplify_va_arg_expr (expr_p, pre_p, post_p);
5660 if (IS_EMPTY_STMT (*expr_p))
5666 if (VOID_TYPE_P (TREE_TYPE (*expr_p))
5667 || fallback == fb_none)
5669 /* Just strip a conversion to void (or in void context) and
5671 *expr_p = TREE_OPERAND (*expr_p, 0);
5675 ret = gimplify_conversion (expr_p);
5676 if (ret == GS_ERROR)
5678 if (*expr_p != save_expr)
5682 case FIX_TRUNC_EXPR:
5683 /* unary_expr: ... | '(' cast ')' val | ... */
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 *expr_p = fold_indirect_ref (*expr_p);
5691 if (*expr_p != save_expr)
5693 /* else fall through. */
5694 case ALIGN_INDIRECT_REF:
5695 case MISALIGNED_INDIRECT_REF:
5696 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5697 is_gimple_reg, fb_rvalue);
5698 recalculate_side_effects (*expr_p);
5701 /* Constants need not be gimplified. */
5712 /* If we require an lvalue, such as for ADDR_EXPR, retain the
5713 CONST_DECL node. Otherwise the decl is replaceable by its
5715 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
5716 if (fallback & fb_lvalue)
5719 *expr_p = DECL_INITIAL (*expr_p);
5723 ret = gimplify_decl_expr (expr_p);
5727 /* FIXME make this a decl. */
5732 ret = gimplify_bind_expr (expr_p, pre_p);
5736 ret = gimplify_loop_expr (expr_p, pre_p);
5740 ret = gimplify_switch_expr (expr_p, pre_p);
5744 ret = gimplify_exit_expr (expr_p);
5748 /* If the target is not LABEL, then it is a computed jump
5749 and the target needs to be gimplified. */
5750 if (TREE_CODE (GOTO_DESTINATION (*expr_p)) != LABEL_DECL)
5751 ret = gimplify_expr (&GOTO_DESTINATION (*expr_p), pre_p,
5752 NULL, is_gimple_val, fb_rvalue);
5757 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p))
5758 == current_function_decl);
5761 case CASE_LABEL_EXPR:
5762 ret = gimplify_case_label_expr (expr_p);
5766 ret = gimplify_return_expr (*expr_p, pre_p);
5770 /* Don't reduce this in place; let gimplify_init_constructor work its
5771 magic. Buf if we're just elaborating this for side effects, just
5772 gimplify any element that has side-effects. */
5773 if (fallback == fb_none)
5775 unsigned HOST_WIDE_INT ix;
5776 constructor_elt *ce;
5777 tree temp = NULL_TREE;
5779 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (*expr_p),
5782 if (TREE_SIDE_EFFECTS (ce->value))
5783 append_to_statement_list (ce->value, &temp);
5788 /* C99 code may assign to an array in a constructed
5789 structure or union, and this has undefined behavior only
5790 on execution, so create a temporary if an lvalue is
5792 else if (fallback == fb_lvalue)
5794 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
5795 mark_addressable (*expr_p);
5801 /* The following are special cases that are not handled by the
5802 original GIMPLE grammar. */
5804 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
5807 ret = gimplify_save_expr (expr_p, pre_p, post_p);
5812 enum gimplify_status r0, r1, r2;
5814 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5815 is_gimple_lvalue, fb_either);
5816 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
5817 is_gimple_val, fb_rvalue);
5818 r2 = gimplify_expr (&TREE_OPERAND (*expr_p, 2), pre_p, post_p,
5819 is_gimple_val, fb_rvalue);
5820 recalculate_side_effects (*expr_p);
5822 ret = MIN (r0, MIN (r1, r2));
5826 case NON_LVALUE_EXPR:
5827 /* This should have been stripped above. */
5831 ret = gimplify_asm_expr (expr_p, pre_p, post_p);
5834 case TRY_FINALLY_EXPR:
5835 case TRY_CATCH_EXPR:
5836 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p, 0));
5837 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p, 1));
5841 case CLEANUP_POINT_EXPR:
5842 ret = gimplify_cleanup_point_expr (expr_p, pre_p);
5846 ret = gimplify_target_expr (expr_p, pre_p, post_p);
5850 gimplify_to_stmt_list (&CATCH_BODY (*expr_p));
5854 case EH_FILTER_EXPR:
5855 gimplify_to_stmt_list (&EH_FILTER_FAILURE (*expr_p));
5859 case CHANGE_DYNAMIC_TYPE_EXPR:
5860 ret = gimplify_expr (&CHANGE_DYNAMIC_TYPE_LOCATION (*expr_p),
5861 pre_p, post_p, is_gimple_reg, fb_lvalue);
5866 enum gimplify_status r0, r1;
5867 r0 = gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p), pre_p, post_p,
5868 is_gimple_val, fb_rvalue);
5869 r1 = gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p), pre_p, post_p,
5870 is_gimple_val, fb_rvalue);
5876 /* We get here when taking the address of a label. We mark
5877 the label as "forced"; meaning it can never be removed and
5878 it is a potential target for any computed goto. */
5879 FORCED_LABEL (*expr_p) = 1;
5883 case STATEMENT_LIST:
5884 ret = gimplify_statement_list (expr_p, pre_p);
5887 case WITH_SIZE_EXPR:
5889 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
5890 post_p == &internal_post ? NULL : post_p,
5891 gimple_test_f, fallback);
5892 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
5893 is_gimple_val, fb_rvalue);
5899 ret = gimplify_var_or_parm_decl (expr_p);
5903 /* When within an OpenMP context, notice uses of variables. */
5904 if (gimplify_omp_ctxp)
5905 omp_notice_variable (gimplify_omp_ctxp, *expr_p, true);
5910 /* Allow callbacks into the gimplifier during optimization. */
5915 ret = gimplify_omp_parallel (expr_p, pre_p);
5919 ret = gimplify_omp_for (expr_p, pre_p);
5924 ret = gimplify_omp_workshare (expr_p, pre_p);
5931 gimplify_to_stmt_list (&OMP_BODY (*expr_p));
5935 ret = gimplify_omp_atomic (expr_p, pre_p);
5940 case OMP_ATOMIC_LOAD:
5941 case OMP_ATOMIC_STORE:
5946 case POINTER_PLUS_EXPR:
5947 /* Convert ((type *)A)+offset into &A->field_of_type_and_offset.
5948 The second is gimple immediate saving a need for extra statement.
5950 if (TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
5951 && (tmp = maybe_fold_offset_to_reference
5952 (TREE_OPERAND (*expr_p, 0), TREE_OPERAND (*expr_p, 1),
5953 TREE_TYPE (TREE_TYPE (*expr_p)))))
5955 tree ptr_type = build_pointer_type (TREE_TYPE (tmp));
5956 if (useless_type_conversion_p (TREE_TYPE (*expr_p), ptr_type))
5958 *expr_p = build_fold_addr_expr_with_type (tmp, ptr_type);
5962 /* Convert (void *)&a + 4 into (void *)&a[1]. */
5963 if (TREE_CODE (TREE_OPERAND (*expr_p, 0)) == NOP_EXPR
5964 && TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
5965 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p,
5967 && (tmp = maybe_fold_offset_to_reference
5968 (TREE_OPERAND (TREE_OPERAND (*expr_p, 0), 0),
5969 TREE_OPERAND (*expr_p, 1),
5970 TREE_TYPE (TREE_TYPE
5971 (TREE_OPERAND (TREE_OPERAND (*expr_p, 0),
5974 tmp = build_fold_addr_expr (tmp);
5975 *expr_p = fold_convert (TREE_TYPE (*expr_p), tmp);
5980 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p)))
5982 case tcc_comparison:
5983 /* Handle comparison of objects of non scalar mode aggregates
5984 with a call to memcmp. It would be nice to only have to do
5985 this for variable-sized objects, but then we'd have to allow
5986 the same nest of reference nodes we allow for MODIFY_EXPR and
5989 Compare scalar mode aggregates as scalar mode values. Using
5990 memcmp for them would be very inefficient at best, and is
5991 plain wrong if bitfields are involved. */
5994 tree type = TREE_TYPE (TREE_OPERAND (*expr_p, 1));
5996 if (!AGGREGATE_TYPE_P (type))
5998 else if (TYPE_MODE (type) != BLKmode)
5999 ret = gimplify_scalar_mode_aggregate_compare (expr_p);
6001 ret = gimplify_variable_sized_compare (expr_p);
6006 /* If *EXPR_P does not need to be special-cased, handle it
6007 according to its class. */
6009 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6010 post_p, is_gimple_val, fb_rvalue);
6016 enum gimplify_status r0, r1;
6018 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6019 post_p, is_gimple_val, fb_rvalue);
6020 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
6021 post_p, is_gimple_val, fb_rvalue);
6027 case tcc_declaration:
6030 goto dont_recalculate;
6033 gcc_assert (TREE_CODE (*expr_p) == TRUTH_AND_EXPR
6034 || TREE_CODE (*expr_p) == TRUTH_OR_EXPR
6035 || TREE_CODE (*expr_p) == TRUTH_XOR_EXPR);
6039 recalculate_side_effects (*expr_p);
6044 /* If we replaced *expr_p, gimplify again. */
6045 if (ret == GS_OK && (*expr_p == NULL || *expr_p == save_expr))
6048 while (ret == GS_OK);
6050 /* If we encountered an error_mark somewhere nested inside, either
6051 stub out the statement or propagate the error back out. */
6052 if (ret == GS_ERROR)
6059 /* This was only valid as a return value from the langhook, which
6060 we handled. Make sure it doesn't escape from any other context. */
6061 gcc_assert (ret != GS_UNHANDLED);
6063 if (fallback == fb_none && *expr_p && !is_gimple_stmt (*expr_p))
6065 /* We aren't looking for a value, and we don't have a valid
6066 statement. If it doesn't have side-effects, throw it away. */
6067 if (!TREE_SIDE_EFFECTS (*expr_p))
6069 else if (!TREE_THIS_VOLATILE (*expr_p))
6071 /* This is probably a _REF that contains something nested that
6072 has side effects. Recurse through the operands to find it. */
6073 enum tree_code code = TREE_CODE (*expr_p);
6080 case VIEW_CONVERT_EXPR:
6081 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6082 gimple_test_f, fallback);
6086 case ARRAY_RANGE_REF:
6087 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6088 gimple_test_f, fallback);
6089 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
6090 gimple_test_f, fallback);
6094 /* Anything else with side-effects must be converted to
6095 a valid statement before we get here. */
6101 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p))
6102 && TYPE_MODE (TREE_TYPE (*expr_p)) != BLKmode)
6104 /* Historically, the compiler has treated a bare reference
6105 to a non-BLKmode volatile lvalue as forcing a load. */
6106 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p));
6107 /* Normally, we do not want to create a temporary for a
6108 TREE_ADDRESSABLE type because such a type should not be
6109 copied by bitwise-assignment. However, we make an
6110 exception here, as all we are doing here is ensuring that
6111 we read the bytes that make up the type. We use
6112 create_tmp_var_raw because create_tmp_var will abort when
6113 given a TREE_ADDRESSABLE type. */
6114 tree tmp = create_tmp_var_raw (type, "vol");
6115 gimple_add_tmp_var (tmp);
6116 *expr_p = build_gimple_modify_stmt (tmp, *expr_p);
6119 /* We can't do anything useful with a volatile reference to
6120 an incomplete type, so just throw it away. Likewise for
6121 a BLKmode type, since any implicit inner load should
6122 already have been turned into an explicit one by the
6123 gimplification process. */
6127 /* If we are gimplifying at the statement level, we're done. Tack
6128 everything together and replace the original statement with the
6130 if (fallback == fb_none || is_statement)
6132 if (internal_pre || internal_post)
6134 append_to_statement_list (*expr_p, &internal_pre);
6135 append_to_statement_list (internal_post, &internal_pre);
6136 annotate_all_with_locus (&internal_pre, input_location);
6137 *expr_p = internal_pre;
6141 else if (TREE_CODE (*expr_p) == STATEMENT_LIST)
6142 annotate_all_with_locus (expr_p, input_location);
6144 annotate_one_with_locus (*expr_p, input_location);
6148 /* Otherwise we're gimplifying a subexpression, so the resulting value is
6151 /* If it's sufficiently simple already, we're done. Unless we are
6152 handling some post-effects internally; if that's the case, we need to
6153 copy into a temp before adding the post-effects to the tree. */
6154 if (!internal_post && (*gimple_test_f) (*expr_p))
6157 /* Otherwise, we need to create a new temporary for the gimplified
6160 /* We can't return an lvalue if we have an internal postqueue. The
6161 object the lvalue refers to would (probably) be modified by the
6162 postqueue; we need to copy the value out first, which means an
6164 if ((fallback & fb_lvalue) && !internal_post
6165 && is_gimple_addressable (*expr_p))
6167 /* An lvalue will do. Take the address of the expression, store it
6168 in a temporary, and replace the expression with an INDIRECT_REF of
6170 tmp = build_fold_addr_expr (*expr_p);
6171 gimplify_expr (&tmp, pre_p, post_p, is_gimple_reg, fb_rvalue);
6172 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (tmp)), tmp);
6174 else if ((fallback & fb_rvalue) && is_gimple_formal_tmp_rhs (*expr_p))
6176 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p)));
6178 /* An rvalue will do. Assign the gimplified expression into a new
6179 temporary TMP and replace the original expression with TMP. */
6181 if (internal_post || (fallback & fb_lvalue))
6182 /* The postqueue might change the value of the expression between
6183 the initialization and use of the temporary, so we can't use a
6184 formal temp. FIXME do we care? */
6185 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6187 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
6189 if (TREE_CODE (*expr_p) != SSA_NAME)
6190 DECL_GIMPLE_FORMAL_TEMP_P (*expr_p) = 1;
6194 #ifdef ENABLE_CHECKING
6195 if (!(fallback & fb_mayfail))
6197 fprintf (stderr, "gimplification failed:\n");
6198 print_generic_expr (stderr, *expr_p, 0);
6199 debug_tree (*expr_p);
6200 internal_error ("gimplification failed");
6203 gcc_assert (fallback & fb_mayfail);
6204 /* If this is an asm statement, and the user asked for the
6205 impossible, don't die. Fail and let gimplify_asm_expr
6211 /* Make sure the temporary matches our predicate. */
6212 gcc_assert ((*gimple_test_f) (*expr_p));
6216 annotate_all_with_locus (&internal_post, input_location);
6217 append_to_statement_list (internal_post, pre_p);
6221 input_location = saved_location;
6225 /* Look through TYPE for variable-sized objects and gimplify each such
6226 size that we find. Add to LIST_P any statements generated. */
6229 gimplify_type_sizes (tree type, tree *list_p)
6233 if (type == NULL || type == error_mark_node)
6236 /* We first do the main variant, then copy into any other variants. */
6237 type = TYPE_MAIN_VARIANT (type);
6239 /* Avoid infinite recursion. */
6240 if (TYPE_SIZES_GIMPLIFIED (type))
6243 TYPE_SIZES_GIMPLIFIED (type) = 1;
6245 switch (TREE_CODE (type))
6251 case FIXED_POINT_TYPE:
6252 gimplify_one_sizepos (&TYPE_MIN_VALUE (type), list_p);
6253 gimplify_one_sizepos (&TYPE_MAX_VALUE (type), list_p);
6255 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
6257 TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (type);
6258 TYPE_MAX_VALUE (t) = TYPE_MAX_VALUE (type);
6263 /* These types may not have declarations, so handle them here. */
6264 gimplify_type_sizes (TREE_TYPE (type), list_p);
6265 gimplify_type_sizes (TYPE_DOMAIN (type), list_p);
6270 case QUAL_UNION_TYPE:
6271 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
6272 if (TREE_CODE (field) == FIELD_DECL)
6274 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field), list_p);
6275 gimplify_type_sizes (TREE_TYPE (field), list_p);
6280 case REFERENCE_TYPE:
6281 /* We used to recurse on the pointed-to type here, which turned out to
6282 be incorrect because its definition might refer to variables not
6283 yet initialized at this point if a forward declaration is involved.
6285 It was actually useful for anonymous pointed-to types to ensure
6286 that the sizes evaluation dominates every possible later use of the
6287 values. Restricting to such types here would be safe since there
6288 is no possible forward declaration around, but would introduce an
6289 undesirable middle-end semantic to anonymity. We then defer to
6290 front-ends the responsibility of ensuring that the sizes are
6291 evaluated both early and late enough, e.g. by attaching artificial
6292 type declarations to the tree. */
6299 gimplify_one_sizepos (&TYPE_SIZE (type), list_p);
6300 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type), list_p);
6302 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
6304 TYPE_SIZE (t) = TYPE_SIZE (type);
6305 TYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (type);
6306 TYPE_SIZES_GIMPLIFIED (t) = 1;
6310 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
6311 a size or position, has had all of its SAVE_EXPRs evaluated.
6312 We add any required statements to STMT_P. */
6315 gimplify_one_sizepos (tree *expr_p, tree *stmt_p)
6317 tree type, expr = *expr_p;
6319 /* We don't do anything if the value isn't there, is constant, or contains
6320 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
6321 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
6322 will want to replace it with a new variable, but that will cause problems
6323 if this type is from outside the function. It's OK to have that here. */
6324 if (expr == NULL_TREE || TREE_CONSTANT (expr)
6325 || TREE_CODE (expr) == VAR_DECL
6326 || CONTAINS_PLACEHOLDER_P (expr))
6329 type = TREE_TYPE (expr);
6330 *expr_p = unshare_expr (expr);
6332 gimplify_expr (expr_p, stmt_p, NULL, is_gimple_val, fb_rvalue);
6335 /* Verify that we've an exact type match with the original expression.
6336 In particular, we do not wish to drop a "sizetype" in favour of a
6337 type of similar dimensions. We don't want to pollute the generic
6338 type-stripping code with this knowledge because it doesn't matter
6339 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
6340 and friends retain their "sizetype-ness". */
6341 if (TREE_TYPE (expr) != type
6342 && TREE_CODE (type) == INTEGER_TYPE
6343 && TYPE_IS_SIZETYPE (type))
6347 *expr_p = create_tmp_var (type, NULL);
6348 tmp = build1 (NOP_EXPR, type, expr);
6349 tmp = build_gimple_modify_stmt (*expr_p, tmp);
6350 if (EXPR_HAS_LOCATION (expr))
6351 SET_EXPR_LOCUS (tmp, EXPR_LOCUS (expr));
6353 SET_EXPR_LOCATION (tmp, input_location);
6355 gimplify_and_add (tmp, stmt_p);
6360 /* Gimplify the body of statements pointed to by BODY_P. FNDECL is the
6361 function decl containing BODY. */
6364 gimplify_body (tree *body_p, tree fndecl, bool do_parms)
6366 location_t saved_location = input_location;
6367 tree body, parm_stmts;
6369 timevar_push (TV_TREE_GIMPLIFY);
6371 gcc_assert (gimplify_ctxp == NULL);
6372 push_gimplify_context ();
6374 /* Unshare most shared trees in the body and in that of any nested functions.
6375 It would seem we don't have to do this for nested functions because
6376 they are supposed to be output and then the outer function gimplified
6377 first, but the g++ front end doesn't always do it that way. */
6378 unshare_body (body_p, fndecl);
6379 unvisit_body (body_p, fndecl);
6381 /* Make sure input_location isn't set to something wierd. */
6382 input_location = DECL_SOURCE_LOCATION (fndecl);
6384 /* Resolve callee-copies. This has to be done before processing
6385 the body so that DECL_VALUE_EXPR gets processed correctly. */
6386 parm_stmts = do_parms ? gimplify_parameters () : NULL;
6388 /* Gimplify the function's body. */
6389 gimplify_stmt (body_p);
6393 body = alloc_stmt_list ();
6394 else if (TREE_CODE (body) == STATEMENT_LIST)
6396 tree t = expr_only (*body_p);
6401 /* If there isn't an outer BIND_EXPR, add one. */
6402 if (TREE_CODE (body) != BIND_EXPR)
6404 tree b = build3 (BIND_EXPR, void_type_node, NULL_TREE,
6405 NULL_TREE, NULL_TREE);
6406 TREE_SIDE_EFFECTS (b) = 1;
6407 append_to_statement_list_force (body, &BIND_EXPR_BODY (b));
6411 /* If we had callee-copies statements, insert them at the beginning
6415 append_to_statement_list_force (BIND_EXPR_BODY (body), &parm_stmts);
6416 BIND_EXPR_BODY (body) = parm_stmts;
6419 /* Unshare again, in case gimplification was sloppy. */
6420 unshare_all_trees (body);
6424 pop_gimplify_context (body);
6425 gcc_assert (gimplify_ctxp == NULL);
6427 #ifdef ENABLE_TYPES_CHECKING
6428 if (!errorcount && !sorrycount)
6429 verify_gimple_1 (BIND_EXPR_BODY (*body_p));
6432 timevar_pop (TV_TREE_GIMPLIFY);
6433 input_location = saved_location;
6436 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
6437 node for the function we want to gimplify. */
6440 gimplify_function_tree (tree fndecl)
6442 tree oldfn, parm, ret;
6444 oldfn = current_function_decl;
6445 current_function_decl = fndecl;
6446 if (DECL_STRUCT_FUNCTION (fndecl))
6447 push_cfun (DECL_STRUCT_FUNCTION (fndecl));
6449 push_struct_function (fndecl);
6451 for (parm = DECL_ARGUMENTS (fndecl); parm ; parm = TREE_CHAIN (parm))
6453 /* Preliminarily mark non-addressed complex variables as eligible
6454 for promotion to gimple registers. We'll transform their uses
6456 if ((TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
6457 || TREE_CODE (TREE_TYPE (parm)) == VECTOR_TYPE)
6458 && !TREE_THIS_VOLATILE (parm)
6459 && !needs_to_live_in_memory (parm))
6460 DECL_GIMPLE_REG_P (parm) = 1;
6463 ret = DECL_RESULT (fndecl);
6464 if ((TREE_CODE (TREE_TYPE (ret)) == COMPLEX_TYPE
6465 || TREE_CODE (TREE_TYPE (ret)) == VECTOR_TYPE)
6466 && !needs_to_live_in_memory (ret))
6467 DECL_GIMPLE_REG_P (ret) = 1;
6469 gimplify_body (&DECL_SAVED_TREE (fndecl), fndecl, true);
6471 /* If we're instrumenting function entry/exit, then prepend the call to
6472 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
6473 catch the exit hook. */
6474 /* ??? Add some way to ignore exceptions for this TFE. */
6475 if (flag_instrument_function_entry_exit
6476 && !DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl)
6477 && !flag_instrument_functions_exclude_p (fndecl))
6481 tf = build2 (TRY_FINALLY_EXPR, void_type_node, NULL, NULL);
6482 TREE_SIDE_EFFECTS (tf) = 1;
6483 x = DECL_SAVED_TREE (fndecl);
6484 append_to_statement_list (x, &TREE_OPERAND (tf, 0));
6485 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_EXIT];
6486 x = build_call_expr (x, 0);
6487 append_to_statement_list (x, &TREE_OPERAND (tf, 1));
6489 bind = build3 (BIND_EXPR, void_type_node, NULL, NULL, NULL);
6490 TREE_SIDE_EFFECTS (bind) = 1;
6491 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_ENTER];
6492 x = build_call_expr (x, 0);
6493 append_to_statement_list (x, &BIND_EXPR_BODY (bind));
6494 append_to_statement_list (tf, &BIND_EXPR_BODY (bind));
6496 DECL_SAVED_TREE (fndecl) = bind;
6499 cfun->gimplified = true;
6500 current_function_decl = oldfn;
6504 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
6505 force the result to be either ssa_name or an invariant, otherwise
6506 just force it to be a rhs expression. If VAR is not NULL, make the
6507 base variable of the final destination be VAR if suitable. */
6510 force_gimple_operand (tree expr, tree *stmts, bool simple, tree var)
6513 enum gimplify_status ret;
6514 gimple_predicate gimple_test_f;
6518 if (is_gimple_val (expr))
6521 gimple_test_f = simple ? is_gimple_val : is_gimple_reg_rhs;
6523 push_gimplify_context ();
6524 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
6525 gimplify_ctxp->allow_rhs_cond_expr = true;
6528 expr = build_gimple_modify_stmt (var, expr);
6530 if (TREE_CODE (expr) != GIMPLE_MODIFY_STMT
6531 && TREE_TYPE (expr) == void_type_node)
6533 gimplify_and_add (expr, stmts);
6538 ret = gimplify_expr (&expr, stmts, NULL,
6539 gimple_test_f, fb_rvalue);
6540 gcc_assert (ret != GS_ERROR);
6543 if (gimple_referenced_vars (cfun))
6545 for (t = gimplify_ctxp->temps; t ; t = TREE_CHAIN (t))
6546 add_referenced_var (t);
6549 pop_gimplify_context (NULL);
6554 /* Invokes force_gimple_operand for EXPR with parameters SIMPLE_P and VAR. If
6555 some statements are produced, emits them at BSI. If BEFORE is true.
6556 the statements are appended before BSI, otherwise they are appended after
6557 it. M specifies the way BSI moves after insertion (BSI_SAME_STMT or
6558 BSI_CONTINUE_LINKING are the usual values). */
6561 force_gimple_operand_bsi (block_stmt_iterator *bsi, tree expr,
6562 bool simple_p, tree var, bool before,
6563 enum bsi_iterator_update m)
6567 expr = force_gimple_operand (expr, &stmts, simple_p, var);
6570 if (gimple_in_ssa_p (cfun))
6572 tree_stmt_iterator tsi;
6574 for (tsi = tsi_start (stmts); !tsi_end_p (tsi); tsi_next (&tsi))
6575 mark_symbols_for_renaming (tsi_stmt (tsi));
6579 bsi_insert_before (bsi, stmts, m);
6581 bsi_insert_after (bsi, stmts, m);
6587 #include "gt-gimplify.h"