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? */
99 static struct gimplify_ctx *gimplify_ctxp;
100 static struct gimplify_omp_ctx *gimplify_omp_ctxp;
104 /* Formal (expression) temporary table handling: Multiple occurrences of
105 the same scalar expression are evaluated into the same temporary. */
107 typedef struct gimple_temp_hash_elt
110 tree temp; /* Value */
113 /* Forward declarations. */
114 static enum gimplify_status gimplify_compound_expr (tree *, tree *, bool);
116 /* Mark X addressable. Unlike the langhook we expect X to be in gimple
117 form and we don't do any syntax checking. */
119 mark_addressable (tree x)
121 while (handled_component_p (x))
122 x = TREE_OPERAND (x, 0);
123 if (TREE_CODE (x) != VAR_DECL && TREE_CODE (x) != PARM_DECL)
125 TREE_ADDRESSABLE (x) = 1;
128 /* Return a hash value for a formal temporary table entry. */
131 gimple_tree_hash (const void *p)
133 tree t = ((const elt_t *) p)->val;
134 return iterative_hash_expr (t, 0);
137 /* Compare two formal temporary table entries. */
140 gimple_tree_eq (const void *p1, const void *p2)
142 tree t1 = ((const elt_t *) p1)->val;
143 tree t2 = ((const elt_t *) p2)->val;
144 enum tree_code code = TREE_CODE (t1);
146 if (TREE_CODE (t2) != code
147 || TREE_TYPE (t1) != TREE_TYPE (t2))
150 if (!operand_equal_p (t1, t2, 0))
153 /* Only allow them to compare equal if they also hash equal; otherwise
154 results are nondeterminate, and we fail bootstrap comparison. */
155 gcc_assert (gimple_tree_hash (p1) == gimple_tree_hash (p2));
160 /* Set up a context for the gimplifier. */
163 push_gimplify_context (void)
165 struct gimplify_ctx *c;
167 c = (struct gimplify_ctx *) xcalloc (1, sizeof (struct gimplify_ctx));
168 c->prev_context = gimplify_ctxp;
170 c->temp_htab = htab_create (1000, gimple_tree_hash, gimple_tree_eq, free);
175 /* Tear down a context for the gimplifier. If BODY is non-null, then
176 put the temporaries into the outer BIND_EXPR. Otherwise, put them
177 in the unexpanded_var_list. */
180 pop_gimplify_context (tree body)
182 struct gimplify_ctx *c = gimplify_ctxp;
185 gcc_assert (c && !c->current_bind_expr);
186 gimplify_ctxp = c->prev_context;
188 for (t = c->temps; t ; t = TREE_CHAIN (t))
189 DECL_GIMPLE_FORMAL_TEMP_P (t) = 0;
192 declare_vars (c->temps, body, false);
194 record_vars (c->temps);
197 htab_delete (c->temp_htab);
202 gimple_push_bind_expr (tree bind)
204 TREE_CHAIN (bind) = gimplify_ctxp->current_bind_expr;
205 gimplify_ctxp->current_bind_expr = bind;
209 gimple_pop_bind_expr (void)
211 gimplify_ctxp->current_bind_expr
212 = TREE_CHAIN (gimplify_ctxp->current_bind_expr);
216 gimple_current_bind_expr (void)
218 return gimplify_ctxp->current_bind_expr;
221 /* Returns true iff there is a COND_EXPR between us and the innermost
222 CLEANUP_POINT_EXPR. This info is used by gimple_push_cleanup. */
225 gimple_conditional_context (void)
227 return gimplify_ctxp->conditions > 0;
230 /* Note that we've entered a COND_EXPR. */
233 gimple_push_condition (void)
235 #ifdef ENABLE_CHECKING
236 if (gimplify_ctxp->conditions == 0)
237 gcc_assert (!gimplify_ctxp->conditional_cleanups);
239 ++(gimplify_ctxp->conditions);
242 /* Note that we've left a COND_EXPR. If we're back at unconditional scope
243 now, add any conditional cleanups we've seen to the prequeue. */
246 gimple_pop_condition (tree *pre_p)
248 int conds = --(gimplify_ctxp->conditions);
250 gcc_assert (conds >= 0);
253 append_to_statement_list (gimplify_ctxp->conditional_cleanups, pre_p);
254 gimplify_ctxp->conditional_cleanups = NULL_TREE;
258 /* A stable comparison routine for use with splay trees and DECLs. */
261 splay_tree_compare_decl_uid (splay_tree_key xa, splay_tree_key xb)
266 return DECL_UID (a) - DECL_UID (b);
269 /* Create a new omp construct that deals with variable remapping. */
271 static struct gimplify_omp_ctx *
272 new_omp_context (bool is_parallel, bool is_combined_parallel)
274 struct gimplify_omp_ctx *c;
276 c = XCNEW (struct gimplify_omp_ctx);
277 c->outer_context = gimplify_omp_ctxp;
278 c->variables = splay_tree_new (splay_tree_compare_decl_uid, 0, 0);
279 c->privatized_types = pointer_set_create ();
280 c->location = input_location;
281 c->is_parallel = is_parallel;
282 c->is_combined_parallel = is_combined_parallel;
283 c->default_kind = OMP_CLAUSE_DEFAULT_SHARED;
288 /* Destroy an omp construct that deals with variable remapping. */
291 delete_omp_context (struct gimplify_omp_ctx *c)
293 splay_tree_delete (c->variables);
294 pointer_set_destroy (c->privatized_types);
298 static void omp_add_variable (struct gimplify_omp_ctx *, tree, unsigned int);
299 static bool omp_notice_variable (struct gimplify_omp_ctx *, tree, bool);
301 /* A subroutine of append_to_statement_list{,_force}. T is not NULL. */
304 append_to_statement_list_1 (tree t, tree *list_p)
307 tree_stmt_iterator i;
311 if (t && TREE_CODE (t) == STATEMENT_LIST)
316 *list_p = list = alloc_stmt_list ();
320 tsi_link_after (&i, t, TSI_CONTINUE_LINKING);
323 /* Add T to the end of the list container pointed to by LIST_P.
324 If T is an expression with no effects, it is ignored. */
327 append_to_statement_list (tree t, tree *list_p)
329 if (t && TREE_SIDE_EFFECTS (t))
330 append_to_statement_list_1 (t, list_p);
333 /* Similar, but the statement is always added, regardless of side effects. */
336 append_to_statement_list_force (tree t, tree *list_p)
339 append_to_statement_list_1 (t, list_p);
342 /* Both gimplify the statement T and append it to LIST_P. */
345 gimplify_and_add (tree t, tree *list_p)
348 append_to_statement_list (t, list_p);
351 /* Strip off a legitimate source ending from the input string NAME of
352 length LEN. Rather than having to know the names used by all of
353 our front ends, we strip off an ending of a period followed by
354 up to five characters. (Java uses ".class".) */
357 remove_suffix (char *name, int len)
361 for (i = 2; i < 8 && len > i; i++)
363 if (name[len - i] == '.')
365 name[len - i] = '\0';
371 /* Create a nameless artificial label and put it in the current function
372 context. Returns the newly created label. */
375 create_artificial_label (void)
377 tree lab = build_decl (LABEL_DECL, NULL_TREE, void_type_node);
379 DECL_ARTIFICIAL (lab) = 1;
380 DECL_IGNORED_P (lab) = 1;
381 DECL_CONTEXT (lab) = current_function_decl;
385 /* Subroutine for find_single_pointer_decl. */
388 find_single_pointer_decl_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
391 tree *pdecl = (tree *) data;
393 if (DECL_P (*tp) && POINTER_TYPE_P (TREE_TYPE (*tp)))
397 /* We already found a pointer decl; return anything other
398 than NULL_TREE to unwind from walk_tree signalling that
399 we have a duplicate. */
408 /* Find the single DECL of pointer type in the tree T and return it.
409 If there are zero or more than one such DECLs, return NULL. */
412 find_single_pointer_decl (tree t)
414 tree decl = NULL_TREE;
416 if (walk_tree (&t, find_single_pointer_decl_1, &decl, NULL))
418 /* find_single_pointer_decl_1 returns a nonzero value, causing
419 walk_tree to return a nonzero value, to indicate that it
420 found more than one pointer DECL. */
427 /* Create a new temporary name with PREFIX. Returns an identifier. */
429 static GTY(()) unsigned int tmp_var_id_num;
432 create_tmp_var_name (const char *prefix)
438 char *preftmp = ASTRDUP (prefix);
440 remove_suffix (preftmp, strlen (preftmp));
444 ASM_FORMAT_PRIVATE_NAME (tmp_name, prefix ? prefix : "T", tmp_var_id_num++);
445 return get_identifier (tmp_name);
449 /* Create a new temporary variable declaration of type TYPE.
450 Does NOT push it into the current binding. */
453 create_tmp_var_raw (tree type, const char *prefix)
458 /* Make the type of the variable writable. */
459 new_type = build_type_variant (type, 0, 0);
460 TYPE_ATTRIBUTES (new_type) = TYPE_ATTRIBUTES (type);
462 tmp_var = build_decl (VAR_DECL, prefix ? create_tmp_var_name (prefix) : NULL,
465 /* The variable was declared by the compiler. */
466 DECL_ARTIFICIAL (tmp_var) = 1;
467 /* And we don't want debug info for it. */
468 DECL_IGNORED_P (tmp_var) = 1;
470 /* Make the variable writable. */
471 TREE_READONLY (tmp_var) = 0;
473 DECL_EXTERNAL (tmp_var) = 0;
474 TREE_STATIC (tmp_var) = 0;
475 TREE_USED (tmp_var) = 1;
480 /* Create a new temporary variable declaration of type TYPE. DOES push the
481 variable into the current binding. Further, assume that this is called
482 only from gimplification or optimization, at which point the creation of
483 certain types are bugs. */
486 create_tmp_var (tree type, const char *prefix)
490 /* We don't allow types that are addressable (meaning we can't make copies),
491 or incomplete. We also used to reject every variable size objects here,
492 but now support those for which a constant upper bound can be obtained.
493 The processing for variable sizes is performed in gimple_add_tmp_var,
494 point at which it really matters and possibly reached via paths not going
495 through this function, e.g. after direct calls to create_tmp_var_raw. */
496 gcc_assert (!TREE_ADDRESSABLE (type) && COMPLETE_TYPE_P (type));
498 tmp_var = create_tmp_var_raw (type, prefix);
499 gimple_add_tmp_var (tmp_var);
503 /* Given a tree, try to return a useful variable name that we can use
504 to prefix a temporary that is being assigned the value of the tree.
505 I.E. given <temp> = &A, return A. */
508 get_name (const_tree t)
510 const_tree stripped_decl;
513 STRIP_NOPS (stripped_decl);
514 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
515 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
518 switch (TREE_CODE (stripped_decl))
521 return get_name (TREE_OPERAND (stripped_decl, 0));
528 /* Create a temporary with a name derived from VAL. Subroutine of
529 lookup_tmp_var; nobody else should call this function. */
532 create_tmp_from_val (tree val)
534 return create_tmp_var (TYPE_MAIN_VARIANT (TREE_TYPE (val)), get_name (val));
537 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
538 an existing expression temporary. */
541 lookup_tmp_var (tree val, bool is_formal)
545 /* If not optimizing, never really reuse a temporary. local-alloc
546 won't allocate any variable that is used in more than one basic
547 block, which means it will go into memory, causing much extra
548 work in reload and final and poorer code generation, outweighing
549 the extra memory allocation here. */
550 if (!optimize || !is_formal || TREE_SIDE_EFFECTS (val))
551 ret = create_tmp_from_val (val);
558 slot = htab_find_slot (gimplify_ctxp->temp_htab, (void *)&elt, INSERT);
561 elt_p = XNEW (elt_t);
563 elt_p->temp = ret = create_tmp_from_val (val);
564 *slot = (void *) elt_p;
568 elt_p = (elt_t *) *slot;
574 DECL_GIMPLE_FORMAL_TEMP_P (ret) = 1;
579 /* Returns a formal temporary variable initialized with VAL. PRE_P is as
580 in gimplify_expr. Only use this function if:
582 1) The value of the unfactored expression represented by VAL will not
583 change between the initialization and use of the temporary, and
584 2) The temporary will not be otherwise modified.
586 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
587 and #2 means it is inappropriate for && temps.
589 For other cases, use get_initialized_tmp_var instead. */
592 internal_get_tmp_var (tree val, tree *pre_p, tree *post_p, bool is_formal)
596 gimplify_expr (&val, pre_p, post_p, is_gimple_formal_tmp_rhs, fb_rvalue);
598 t = lookup_tmp_var (val, is_formal);
602 tree u = find_single_pointer_decl (val);
604 if (u && TREE_CODE (u) == VAR_DECL && DECL_BASED_ON_RESTRICT_P (u))
605 u = DECL_GET_RESTRICT_BASE (u);
606 if (u && TYPE_RESTRICT (TREE_TYPE (u)))
608 if (DECL_BASED_ON_RESTRICT_P (t))
609 gcc_assert (u == DECL_GET_RESTRICT_BASE (t));
612 DECL_BASED_ON_RESTRICT_P (t) = 1;
613 SET_DECL_RESTRICT_BASE (t, u);
618 if (TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
619 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
620 DECL_GIMPLE_REG_P (t) = 1;
622 mod = build2 (INIT_EXPR, TREE_TYPE (t), t, unshare_expr (val));
624 if (EXPR_HAS_LOCATION (val))
625 SET_EXPR_LOCUS (mod, EXPR_LOCUS (val));
627 SET_EXPR_LOCATION (mod, input_location);
629 /* gimplify_modify_expr might want to reduce this further. */
630 gimplify_and_add (mod, pre_p);
632 /* If we're gimplifying into ssa, gimplify_modify_expr will have
633 given our temporary an ssa name. Find and return it. */
634 if (gimplify_ctxp->into_ssa)
635 t = TREE_OPERAND (mod, 0);
640 /* Returns a formal temporary variable initialized with VAL. PRE_P
641 points to a statement list where side-effects needed to compute VAL
645 get_formal_tmp_var (tree val, tree *pre_p)
647 return internal_get_tmp_var (val, pre_p, NULL, true);
650 /* Returns a temporary variable initialized with VAL. PRE_P and POST_P
651 are as in gimplify_expr. */
654 get_initialized_tmp_var (tree val, tree *pre_p, tree *post_p)
656 return internal_get_tmp_var (val, pre_p, post_p, false);
659 /* Declares all the variables in VARS in SCOPE. If DEBUG_INFO is
660 true, generate debug info for them; otherwise don't. */
663 declare_vars (tree vars, tree scope, bool debug_info)
670 /* C99 mode puts the default 'return 0;' for main outside the outer
671 braces. So drill down until we find an actual scope. */
672 while (TREE_CODE (scope) == COMPOUND_EXPR)
673 scope = TREE_OPERAND (scope, 0);
675 gcc_assert (TREE_CODE (scope) == BIND_EXPR);
677 temps = nreverse (last);
679 block = BIND_EXPR_BLOCK (scope);
680 if (!block || !debug_info)
682 TREE_CHAIN (last) = BIND_EXPR_VARS (scope);
683 BIND_EXPR_VARS (scope) = temps;
687 /* We need to attach the nodes both to the BIND_EXPR and to its
688 associated BLOCK for debugging purposes. The key point here
689 is that the BLOCK_VARS of the BIND_EXPR_BLOCK of a BIND_EXPR
690 is a subchain of the BIND_EXPR_VARS of the BIND_EXPR. */
691 if (BLOCK_VARS (block))
692 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), temps);
695 BIND_EXPR_VARS (scope) = chainon (BIND_EXPR_VARS (scope), temps);
696 BLOCK_VARS (block) = temps;
702 /* For VAR a VAR_DECL of variable size, try to find a constant upper bound
703 for the size and adjust DECL_SIZE/DECL_SIZE_UNIT accordingly. Abort if
704 no such upper bound can be obtained. */
707 force_constant_size (tree var)
709 /* The only attempt we make is by querying the maximum size of objects
710 of the variable's type. */
712 HOST_WIDE_INT max_size;
714 gcc_assert (TREE_CODE (var) == VAR_DECL);
716 max_size = max_int_size_in_bytes (TREE_TYPE (var));
718 gcc_assert (max_size >= 0);
721 = build_int_cst (TREE_TYPE (DECL_SIZE_UNIT (var)), max_size);
723 = build_int_cst (TREE_TYPE (DECL_SIZE (var)), max_size * BITS_PER_UNIT);
727 gimple_add_tmp_var (tree tmp)
729 gcc_assert (!TREE_CHAIN (tmp) && !DECL_SEEN_IN_BIND_EXPR_P (tmp));
731 /* Later processing assumes that the object size is constant, which might
732 not be true at this point. Force the use of a constant upper bound in
734 if (!host_integerp (DECL_SIZE_UNIT (tmp), 1))
735 force_constant_size (tmp);
737 DECL_CONTEXT (tmp) = current_function_decl;
738 DECL_SEEN_IN_BIND_EXPR_P (tmp) = 1;
742 TREE_CHAIN (tmp) = gimplify_ctxp->temps;
743 gimplify_ctxp->temps = tmp;
745 /* Mark temporaries local within the nearest enclosing parallel. */
746 if (gimplify_omp_ctxp)
748 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
749 while (ctx && !ctx->is_parallel)
750 ctx = ctx->outer_context;
752 omp_add_variable (ctx, tmp, GOVD_LOCAL | GOVD_SEEN);
758 declare_vars (tmp, DECL_SAVED_TREE (current_function_decl), false);
761 /* Determines whether to assign a locus to the statement STMT. */
764 should_carry_locus_p (tree stmt)
766 /* Don't emit a line note for a label. We particularly don't want to
767 emit one for the break label, since it doesn't actually correspond
768 to the beginning of the loop/switch. */
769 if (TREE_CODE (stmt) == LABEL_EXPR)
772 /* Do not annotate empty statements, since it confuses gcov. */
773 if (!TREE_SIDE_EFFECTS (stmt))
780 annotate_one_with_locus (tree t, location_t locus)
782 if (CAN_HAVE_LOCATION_P (t)
783 && ! EXPR_HAS_LOCATION (t) && should_carry_locus_p (t))
784 SET_EXPR_LOCATION (t, locus);
788 annotate_all_with_locus (tree *stmt_p, location_t locus)
790 tree_stmt_iterator i;
795 for (i = tsi_start (*stmt_p); !tsi_end_p (i); tsi_next (&i))
797 tree t = tsi_stmt (i);
799 /* Assuming we've already been gimplified, we shouldn't
800 see nested chaining constructs anymore. */
801 gcc_assert (TREE_CODE (t) != STATEMENT_LIST
802 && TREE_CODE (t) != COMPOUND_EXPR);
804 annotate_one_with_locus (t, locus);
808 /* Similar to copy_tree_r() but do not copy SAVE_EXPR or TARGET_EXPR nodes.
809 These nodes model computations that should only be done once. If we
810 were to unshare something like SAVE_EXPR(i++), the gimplification
811 process would create wrong code. */
814 mostly_copy_tree_r (tree *tp, int *walk_subtrees, void *data)
816 enum tree_code code = TREE_CODE (*tp);
817 /* Don't unshare types, decls, constants and SAVE_EXPR nodes. */
818 if (TREE_CODE_CLASS (code) == tcc_type
819 || TREE_CODE_CLASS (code) == tcc_declaration
820 || TREE_CODE_CLASS (code) == tcc_constant
821 || code == SAVE_EXPR || code == TARGET_EXPR
822 /* We can't do anything sensible with a BLOCK used as an expression,
823 but we also can't just die when we see it because of non-expression
824 uses. So just avert our eyes and cross our fingers. Silly Java. */
829 gcc_assert (code != BIND_EXPR);
830 copy_tree_r (tp, walk_subtrees, data);
836 /* Callback for walk_tree to unshare most of the shared trees rooted at
837 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
838 then *TP is deep copied by calling copy_tree_r.
840 This unshares the same trees as copy_tree_r with the exception of
841 SAVE_EXPR nodes. These nodes model computations that should only be
842 done once. If we were to unshare something like SAVE_EXPR(i++), the
843 gimplification process would create wrong code. */
846 copy_if_shared_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
847 void *data ATTRIBUTE_UNUSED)
850 enum tree_code code = TREE_CODE (t);
852 /* Skip types, decls, and constants. But we do want to look at their
853 types and the bounds of types. Mark them as visited so we properly
854 unmark their subtrees on the unmark pass. If we've already seen them,
855 don't look down further. */
856 if (TREE_CODE_CLASS (code) == tcc_type
857 || TREE_CODE_CLASS (code) == tcc_declaration
858 || TREE_CODE_CLASS (code) == tcc_constant)
860 if (TREE_VISITED (t))
863 TREE_VISITED (t) = 1;
866 /* If this node has been visited already, unshare it and don't look
868 else if (TREE_VISITED (t))
870 walk_tree (tp, mostly_copy_tree_r, NULL, NULL);
874 /* Otherwise, mark the tree as visited and keep looking. */
876 TREE_VISITED (t) = 1;
882 unmark_visited_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
883 void *data ATTRIBUTE_UNUSED)
885 if (TREE_VISITED (*tp))
886 TREE_VISITED (*tp) = 0;
893 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
894 bodies of any nested functions if we are unsharing the entire body of
898 unshare_body (tree *body_p, tree fndecl)
900 struct cgraph_node *cgn = cgraph_node (fndecl);
902 walk_tree (body_p, copy_if_shared_r, NULL, NULL);
903 if (body_p == &DECL_SAVED_TREE (fndecl))
904 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
905 unshare_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
908 /* Likewise, but mark all trees as not visited. */
911 unvisit_body (tree *body_p, tree fndecl)
913 struct cgraph_node *cgn = cgraph_node (fndecl);
915 walk_tree (body_p, unmark_visited_r, NULL, NULL);
916 if (body_p == &DECL_SAVED_TREE (fndecl))
917 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
918 unvisit_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
921 /* Unshare T and all the trees reached from T via TREE_CHAIN. */
924 unshare_all_trees (tree t)
926 walk_tree (&t, copy_if_shared_r, NULL, NULL);
927 walk_tree (&t, unmark_visited_r, NULL, NULL);
930 /* Unconditionally make an unshared copy of EXPR. This is used when using
931 stored expressions which span multiple functions, such as BINFO_VTABLE,
932 as the normal unsharing process can't tell that they're shared. */
935 unshare_expr (tree expr)
937 walk_tree (&expr, mostly_copy_tree_r, NULL, NULL);
941 /* A terser interface for building a representation of an exception
945 gimple_build_eh_filter (tree body, tree allowed, tree failure)
949 /* FIXME should the allowed types go in TREE_TYPE? */
950 t = build2 (EH_FILTER_EXPR, void_type_node, allowed, NULL_TREE);
951 append_to_statement_list (failure, &EH_FILTER_FAILURE (t));
953 t = build2 (TRY_CATCH_EXPR, void_type_node, NULL_TREE, t);
954 append_to_statement_list (body, &TREE_OPERAND (t, 0));
960 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
961 contain statements and have a value. Assign its value to a temporary
962 and give it void_type_node. Returns the temporary, or NULL_TREE if
963 WRAPPER was already void. */
966 voidify_wrapper_expr (tree wrapper, tree temp)
968 tree type = TREE_TYPE (wrapper);
969 if (type && !VOID_TYPE_P (type))
973 /* Set p to point to the body of the wrapper. Loop until we find
974 something that isn't a wrapper. */
975 for (p = &wrapper; p && *p; )
977 switch (TREE_CODE (*p))
980 TREE_SIDE_EFFECTS (*p) = 1;
981 TREE_TYPE (*p) = void_type_node;
982 /* For a BIND_EXPR, the body is operand 1. */
983 p = &BIND_EXPR_BODY (*p);
986 case CLEANUP_POINT_EXPR:
987 case TRY_FINALLY_EXPR:
989 TREE_SIDE_EFFECTS (*p) = 1;
990 TREE_TYPE (*p) = void_type_node;
991 p = &TREE_OPERAND (*p, 0);
996 tree_stmt_iterator i = tsi_last (*p);
997 TREE_SIDE_EFFECTS (*p) = 1;
998 TREE_TYPE (*p) = void_type_node;
999 p = tsi_end_p (i) ? NULL : tsi_stmt_ptr (i);
1004 /* Advance to the last statement. Set all container types to void. */
1005 for (; TREE_CODE (*p) == COMPOUND_EXPR; p = &TREE_OPERAND (*p, 1))
1007 TREE_SIDE_EFFECTS (*p) = 1;
1008 TREE_TYPE (*p) = void_type_node;
1018 if (p == NULL || IS_EMPTY_STMT (*p))
1022 /* The wrapper is on the RHS of an assignment that we're pushing
1024 gcc_assert (TREE_CODE (temp) == INIT_EXPR
1025 || TREE_CODE (temp) == GIMPLE_MODIFY_STMT
1026 || TREE_CODE (temp) == MODIFY_EXPR);
1027 GENERIC_TREE_OPERAND (temp, 1) = *p;
1032 temp = create_tmp_var (type, "retval");
1033 *p = build2 (INIT_EXPR, type, temp, *p);
1042 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
1043 a temporary through which they communicate. */
1046 build_stack_save_restore (tree *save, tree *restore)
1048 tree save_call, tmp_var;
1051 build_call_expr (implicit_built_in_decls[BUILT_IN_STACK_SAVE], 0);
1052 tmp_var = create_tmp_var (ptr_type_node, "saved_stack");
1054 *save = build_gimple_modify_stmt (tmp_var, save_call);
1056 build_call_expr (implicit_built_in_decls[BUILT_IN_STACK_RESTORE],
1060 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
1062 static enum gimplify_status
1063 gimplify_bind_expr (tree *expr_p, tree *pre_p)
1065 tree bind_expr = *expr_p;
1066 bool old_save_stack = gimplify_ctxp->save_stack;
1069 tree temp = voidify_wrapper_expr (bind_expr, NULL);
1071 /* Mark variables seen in this bind expr. */
1072 for (t = BIND_EXPR_VARS (bind_expr); t ; t = TREE_CHAIN (t))
1074 if (TREE_CODE (t) == VAR_DECL)
1076 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
1078 /* Mark variable as local. */
1079 if (ctx && !is_global_var (t)
1080 && (! DECL_SEEN_IN_BIND_EXPR_P (t)
1081 || splay_tree_lookup (ctx->variables,
1082 (splay_tree_key) t) == NULL))
1083 omp_add_variable (gimplify_omp_ctxp, t, GOVD_LOCAL | GOVD_SEEN);
1085 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
1088 /* Preliminarily mark non-addressed complex variables as eligible
1089 for promotion to gimple registers. We'll transform their uses
1091 if ((TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
1092 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
1093 && !TREE_THIS_VOLATILE (t)
1094 && (TREE_CODE (t) == VAR_DECL && !DECL_HARD_REGISTER (t))
1095 && !needs_to_live_in_memory (t))
1096 DECL_GIMPLE_REG_P (t) = 1;
1099 gimple_push_bind_expr (bind_expr);
1100 gimplify_ctxp->save_stack = false;
1102 gimplify_to_stmt_list (&BIND_EXPR_BODY (bind_expr));
1104 if (gimplify_ctxp->save_stack)
1106 tree stack_save, stack_restore;
1108 /* Save stack on entry and restore it on exit. Add a try_finally
1109 block to achieve this. Note that mudflap depends on the
1110 format of the emitted code: see mx_register_decls(). */
1111 build_stack_save_restore (&stack_save, &stack_restore);
1113 t = build2 (TRY_FINALLY_EXPR, void_type_node,
1114 BIND_EXPR_BODY (bind_expr), NULL_TREE);
1115 append_to_statement_list (stack_restore, &TREE_OPERAND (t, 1));
1117 BIND_EXPR_BODY (bind_expr) = NULL_TREE;
1118 append_to_statement_list (stack_save, &BIND_EXPR_BODY (bind_expr));
1119 append_to_statement_list (t, &BIND_EXPR_BODY (bind_expr));
1122 gimplify_ctxp->save_stack = old_save_stack;
1123 gimple_pop_bind_expr ();
1128 append_to_statement_list (bind_expr, pre_p);
1135 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1136 GIMPLE value, it is assigned to a new temporary and the statement is
1137 re-written to return the temporary.
1139 PRE_P points to the list where side effects that must happen before
1140 STMT should be stored. */
1142 static enum gimplify_status
1143 gimplify_return_expr (tree stmt, tree *pre_p)
1145 tree ret_expr = TREE_OPERAND (stmt, 0);
1146 tree result_decl, result;
1148 if (!ret_expr || TREE_CODE (ret_expr) == RESULT_DECL
1149 || ret_expr == error_mark_node)
1152 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
1153 result_decl = NULL_TREE;
1156 result_decl = GENERIC_TREE_OPERAND (ret_expr, 0);
1157 if (TREE_CODE (result_decl) == INDIRECT_REF)
1158 /* See through a return by reference. */
1159 result_decl = TREE_OPERAND (result_decl, 0);
1161 gcc_assert ((TREE_CODE (ret_expr) == MODIFY_EXPR
1162 || TREE_CODE (ret_expr) == GIMPLE_MODIFY_STMT
1163 || TREE_CODE (ret_expr) == INIT_EXPR)
1164 && TREE_CODE (result_decl) == RESULT_DECL);
1167 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1168 Recall that aggregate_value_p is FALSE for any aggregate type that is
1169 returned in registers. If we're returning values in registers, then
1170 we don't want to extend the lifetime of the RESULT_DECL, particularly
1171 across another call. In addition, for those aggregates for which
1172 hard_function_value generates a PARALLEL, we'll die during normal
1173 expansion of structure assignments; there's special code in expand_return
1174 to handle this case that does not exist in expand_expr. */
1176 || aggregate_value_p (result_decl, TREE_TYPE (current_function_decl)))
1177 result = result_decl;
1178 else if (gimplify_ctxp->return_temp)
1179 result = gimplify_ctxp->return_temp;
1182 result = create_tmp_var (TREE_TYPE (result_decl), NULL);
1183 if (TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
1184 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
1185 DECL_GIMPLE_REG_P (result) = 1;
1187 /* ??? With complex control flow (usually involving abnormal edges),
1188 we can wind up warning about an uninitialized value for this. Due
1189 to how this variable is constructed and initialized, this is never
1190 true. Give up and never warn. */
1191 TREE_NO_WARNING (result) = 1;
1193 gimplify_ctxp->return_temp = result;
1196 /* Smash the lhs of the GIMPLE_MODIFY_STMT to the temporary we plan to use.
1197 Then gimplify the whole thing. */
1198 if (result != result_decl)
1199 GENERIC_TREE_OPERAND (ret_expr, 0) = result;
1201 gimplify_and_add (TREE_OPERAND (stmt, 0), pre_p);
1203 /* If we didn't use a temporary, then the result is just the result_decl.
1204 Otherwise we need a simple copy. This should already be gimple. */
1205 if (result == result_decl)
1208 ret_expr = build_gimple_modify_stmt (result_decl, result);
1209 TREE_OPERAND (stmt, 0) = ret_expr;
1214 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
1215 and initialization explicit. */
1217 static enum gimplify_status
1218 gimplify_decl_expr (tree *stmt_p)
1220 tree stmt = *stmt_p;
1221 tree decl = DECL_EXPR_DECL (stmt);
1223 *stmt_p = NULL_TREE;
1225 if (TREE_TYPE (decl) == error_mark_node)
1228 if ((TREE_CODE (decl) == TYPE_DECL
1229 || TREE_CODE (decl) == VAR_DECL)
1230 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl)))
1231 gimplify_type_sizes (TREE_TYPE (decl), stmt_p);
1233 if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl))
1235 tree init = DECL_INITIAL (decl);
1237 if (TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
1239 /* This is a variable-sized decl. Simplify its size and mark it
1240 for deferred expansion. Note that mudflap depends on the format
1241 of the emitted code: see mx_register_decls(). */
1242 tree t, addr, ptr_type;
1244 gimplify_one_sizepos (&DECL_SIZE (decl), stmt_p);
1245 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl), stmt_p);
1247 /* All occurrences of this decl in final gimplified code will be
1248 replaced by indirection. Setting DECL_VALUE_EXPR does two
1249 things: First, it lets the rest of the gimplifier know what
1250 replacement to use. Second, it lets the debug info know
1251 where to find the value. */
1252 ptr_type = build_pointer_type (TREE_TYPE (decl));
1253 addr = create_tmp_var (ptr_type, get_name (decl));
1254 DECL_IGNORED_P (addr) = 0;
1255 t = build_fold_indirect_ref (addr);
1256 SET_DECL_VALUE_EXPR (decl, t);
1257 DECL_HAS_VALUE_EXPR_P (decl) = 1;
1259 t = built_in_decls[BUILT_IN_ALLOCA];
1260 t = build_call_expr (t, 1, DECL_SIZE_UNIT (decl));
1261 t = fold_convert (ptr_type, t);
1262 t = build_gimple_modify_stmt (addr, t);
1264 gimplify_and_add (t, stmt_p);
1266 /* Indicate that we need to restore the stack level when the
1267 enclosing BIND_EXPR is exited. */
1268 gimplify_ctxp->save_stack = true;
1271 if (init && init != error_mark_node)
1273 if (!TREE_STATIC (decl))
1275 DECL_INITIAL (decl) = NULL_TREE;
1276 init = build2 (INIT_EXPR, void_type_node, decl, init);
1277 gimplify_and_add (init, stmt_p);
1280 /* We must still examine initializers for static variables
1281 as they may contain a label address. */
1282 walk_tree (&init, force_labels_r, NULL, NULL);
1285 /* Some front ends do not explicitly declare all anonymous
1286 artificial variables. We compensate here by declaring the
1287 variables, though it would be better if the front ends would
1288 explicitly declare them. */
1289 if (!DECL_SEEN_IN_BIND_EXPR_P (decl)
1290 && DECL_ARTIFICIAL (decl) && DECL_NAME (decl) == NULL_TREE)
1291 gimple_add_tmp_var (decl);
1297 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1298 and replacing the LOOP_EXPR with goto, but if the loop contains an
1299 EXIT_EXPR, we need to append a label for it to jump to. */
1301 static enum gimplify_status
1302 gimplify_loop_expr (tree *expr_p, tree *pre_p)
1304 tree saved_label = gimplify_ctxp->exit_label;
1305 tree start_label = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
1306 tree jump_stmt = build_and_jump (&LABEL_EXPR_LABEL (start_label));
1308 append_to_statement_list (start_label, pre_p);
1310 gimplify_ctxp->exit_label = NULL_TREE;
1312 gimplify_and_add (LOOP_EXPR_BODY (*expr_p), pre_p);
1314 if (gimplify_ctxp->exit_label)
1316 append_to_statement_list (jump_stmt, pre_p);
1317 *expr_p = build1 (LABEL_EXPR, void_type_node, gimplify_ctxp->exit_label);
1320 *expr_p = jump_stmt;
1322 gimplify_ctxp->exit_label = saved_label;
1327 /* Compare two case labels. Because the front end should already have
1328 made sure that case ranges do not overlap, it is enough to only compare
1329 the CASE_LOW values of each case label. */
1332 compare_case_labels (const void *p1, const void *p2)
1334 const_tree const case1 = *(const_tree const*)p1;
1335 const_tree const case2 = *(const_tree const*)p2;
1337 return tree_int_cst_compare (CASE_LOW (case1), CASE_LOW (case2));
1340 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1343 sort_case_labels (tree label_vec)
1345 size_t len = TREE_VEC_LENGTH (label_vec);
1346 tree default_case = TREE_VEC_ELT (label_vec, len - 1);
1348 if (CASE_LOW (default_case))
1352 /* The last label in the vector should be the default case
1354 for (i = 0; i < len; ++i)
1356 tree t = TREE_VEC_ELT (label_vec, i);
1360 TREE_VEC_ELT (label_vec, i) = TREE_VEC_ELT (label_vec, len - 1);
1361 TREE_VEC_ELT (label_vec, len - 1) = default_case;
1367 qsort (&TREE_VEC_ELT (label_vec, 0), len - 1, sizeof (tree),
1368 compare_case_labels);
1371 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1374 static enum gimplify_status
1375 gimplify_switch_expr (tree *expr_p, tree *pre_p)
1377 tree switch_expr = *expr_p;
1378 enum gimplify_status ret;
1380 ret = gimplify_expr (&SWITCH_COND (switch_expr), pre_p, NULL,
1381 is_gimple_val, fb_rvalue);
1383 if (SWITCH_BODY (switch_expr))
1385 VEC(tree,heap) *labels, *saved_labels;
1386 tree label_vec, default_case = NULL_TREE;
1389 /* If someone can be bothered to fill in the labels, they can
1390 be bothered to null out the body too. */
1391 gcc_assert (!SWITCH_LABELS (switch_expr));
1393 saved_labels = gimplify_ctxp->case_labels;
1394 gimplify_ctxp->case_labels = VEC_alloc (tree, heap, 8);
1396 gimplify_to_stmt_list (&SWITCH_BODY (switch_expr));
1398 labels = gimplify_ctxp->case_labels;
1399 gimplify_ctxp->case_labels = saved_labels;
1402 while (i < VEC_length (tree, labels))
1404 tree elt = VEC_index (tree, labels, i);
1405 tree low = CASE_LOW (elt);
1406 bool remove_element = FALSE;
1410 /* Discard empty ranges. */
1411 tree high = CASE_HIGH (elt);
1412 if (high && INT_CST_LT (high, low))
1413 remove_element = TRUE;
1417 /* The default case must be the last label in the list. */
1418 gcc_assert (!default_case);
1420 remove_element = TRUE;
1424 VEC_ordered_remove (tree, labels, i);
1430 label_vec = make_tree_vec (len + 1);
1431 SWITCH_LABELS (*expr_p) = label_vec;
1432 append_to_statement_list (switch_expr, pre_p);
1436 /* If the switch has no default label, add one, so that we jump
1437 around the switch body. */
1438 default_case = build3 (CASE_LABEL_EXPR, void_type_node, NULL_TREE,
1439 NULL_TREE, create_artificial_label ());
1440 append_to_statement_list (SWITCH_BODY (switch_expr), pre_p);
1441 *expr_p = build1 (LABEL_EXPR, void_type_node,
1442 CASE_LABEL (default_case));
1445 *expr_p = SWITCH_BODY (switch_expr);
1447 for (i = 0; i < len; ++i)
1448 TREE_VEC_ELT (label_vec, i) = VEC_index (tree, labels, i);
1449 TREE_VEC_ELT (label_vec, len) = default_case;
1451 VEC_free (tree, heap, labels);
1453 sort_case_labels (label_vec);
1455 SWITCH_BODY (switch_expr) = NULL;
1458 gcc_assert (SWITCH_LABELS (switch_expr));
1463 static enum gimplify_status
1464 gimplify_case_label_expr (tree *expr_p)
1466 tree expr = *expr_p;
1467 struct gimplify_ctx *ctxp;
1469 /* Invalid OpenMP programs can play Duff's Device type games with
1470 #pragma omp parallel. At least in the C front end, we don't
1471 detect such invalid branches until after gimplification. */
1472 for (ctxp = gimplify_ctxp; ; ctxp = ctxp->prev_context)
1473 if (ctxp->case_labels)
1476 VEC_safe_push (tree, heap, ctxp->case_labels, expr);
1477 *expr_p = build1 (LABEL_EXPR, void_type_node, CASE_LABEL (expr));
1481 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1485 build_and_jump (tree *label_p)
1487 if (label_p == NULL)
1488 /* If there's nowhere to jump, just fall through. */
1491 if (*label_p == NULL_TREE)
1493 tree label = create_artificial_label ();
1497 return build1 (GOTO_EXPR, void_type_node, *label_p);
1500 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1501 This also involves building a label to jump to and communicating it to
1502 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1504 static enum gimplify_status
1505 gimplify_exit_expr (tree *expr_p)
1507 tree cond = TREE_OPERAND (*expr_p, 0);
1510 expr = build_and_jump (&gimplify_ctxp->exit_label);
1511 expr = build3 (COND_EXPR, void_type_node, cond, expr, NULL_TREE);
1517 /* A helper function to be called via walk_tree. Mark all labels under *TP
1518 as being forced. To be called for DECL_INITIAL of static variables. */
1521 force_labels_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
1525 if (TREE_CODE (*tp) == LABEL_DECL)
1526 FORCED_LABEL (*tp) = 1;
1531 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1532 different from its canonical type, wrap the whole thing inside a
1533 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1536 The canonical type of a COMPONENT_REF is the type of the field being
1537 referenced--unless the field is a bit-field which can be read directly
1538 in a smaller mode, in which case the canonical type is the
1539 sign-appropriate type corresponding to that mode. */
1542 canonicalize_component_ref (tree *expr_p)
1544 tree expr = *expr_p;
1547 gcc_assert (TREE_CODE (expr) == COMPONENT_REF);
1549 if (INTEGRAL_TYPE_P (TREE_TYPE (expr)))
1550 type = TREE_TYPE (get_unwidened (expr, NULL_TREE));
1552 type = TREE_TYPE (TREE_OPERAND (expr, 1));
1554 if (TREE_TYPE (expr) != type)
1556 tree old_type = TREE_TYPE (expr);
1558 /* Set the type of the COMPONENT_REF to the underlying type. */
1559 TREE_TYPE (expr) = type;
1561 /* And wrap the whole thing inside a NOP_EXPR. */
1562 expr = build1 (NOP_EXPR, old_type, expr);
1568 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1569 to foo, embed that change in the ADDR_EXPR by converting
1574 where L is the lower bound. For simplicity, only do this for constant
1578 canonicalize_addr_expr (tree *expr_p)
1580 tree expr = *expr_p;
1581 tree ctype = TREE_TYPE (expr);
1582 tree addr_expr = TREE_OPERAND (expr, 0);
1583 tree atype = TREE_TYPE (addr_expr);
1584 tree dctype, datype, ddatype, otype, obj_expr;
1586 /* Both cast and addr_expr types should be pointers. */
1587 if (!POINTER_TYPE_P (ctype) || !POINTER_TYPE_P (atype))
1590 /* The addr_expr type should be a pointer to an array. */
1591 datype = TREE_TYPE (atype);
1592 if (TREE_CODE (datype) != ARRAY_TYPE)
1595 /* Both cast and addr_expr types should address the same object type. */
1596 dctype = TREE_TYPE (ctype);
1597 ddatype = TREE_TYPE (datype);
1598 if (!useless_type_conversion_p (dctype, ddatype))
1601 /* The addr_expr and the object type should match. */
1602 obj_expr = TREE_OPERAND (addr_expr, 0);
1603 otype = TREE_TYPE (obj_expr);
1604 if (!useless_type_conversion_p (datype, otype))
1607 /* The lower bound and element sizes must be constant. */
1608 if (!TYPE_SIZE_UNIT (dctype)
1609 || TREE_CODE (TYPE_SIZE_UNIT (dctype)) != INTEGER_CST
1610 || !TYPE_DOMAIN (datype) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype))
1611 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype))) != INTEGER_CST)
1614 /* All checks succeeded. Build a new node to merge the cast. */
1615 *expr_p = build4 (ARRAY_REF, dctype, obj_expr,
1616 TYPE_MIN_VALUE (TYPE_DOMAIN (datype)),
1617 NULL_TREE, NULL_TREE);
1618 *expr_p = build1 (ADDR_EXPR, ctype, *expr_p);
1621 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1622 underneath as appropriate. */
1624 static enum gimplify_status
1625 gimplify_conversion (tree *expr_p)
1628 gcc_assert (TREE_CODE (*expr_p) == NOP_EXPR
1629 || TREE_CODE (*expr_p) == CONVERT_EXPR);
1631 /* Then strip away all but the outermost conversion. */
1632 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p, 0));
1634 /* And remove the outermost conversion if it's useless. */
1635 if (tree_ssa_useless_type_conversion (*expr_p))
1636 *expr_p = TREE_OPERAND (*expr_p, 0);
1638 /* Attempt to avoid NOP_EXPR by producing reference to a subtype.
1639 For example this fold (subclass *)&A into &A->subclass avoiding
1640 a need for statement. */
1641 if (TREE_CODE (*expr_p) == NOP_EXPR
1642 && POINTER_TYPE_P (TREE_TYPE (*expr_p))
1643 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p, 0)))
1644 && (tem = maybe_fold_offset_to_reference
1645 (TREE_OPERAND (*expr_p, 0),
1646 integer_zero_node, TREE_TYPE (TREE_TYPE (*expr_p)))))
1648 tree ptr_type = build_pointer_type (TREE_TYPE (tem));
1649 if (useless_type_conversion_p (TREE_TYPE (*expr_p), ptr_type))
1650 *expr_p = build_fold_addr_expr_with_type (tem, ptr_type);
1653 /* If we still have a conversion at the toplevel,
1654 then canonicalize some constructs. */
1655 if (TREE_CODE (*expr_p) == NOP_EXPR || TREE_CODE (*expr_p) == CONVERT_EXPR)
1657 tree sub = TREE_OPERAND (*expr_p, 0);
1659 /* If a NOP conversion is changing the type of a COMPONENT_REF
1660 expression, then canonicalize its type now in order to expose more
1661 redundant conversions. */
1662 if (TREE_CODE (sub) == COMPONENT_REF)
1663 canonicalize_component_ref (&TREE_OPERAND (*expr_p, 0));
1665 /* If a NOP conversion is changing a pointer to array of foo
1666 to a pointer to foo, embed that change in the ADDR_EXPR. */
1667 else if (TREE_CODE (sub) == ADDR_EXPR)
1668 canonicalize_addr_expr (expr_p);
1674 /* Gimplify a VAR_DECL or PARM_DECL. Returns GS_OK if we expanded a
1675 DECL_VALUE_EXPR, and it's worth re-examining things. */
1677 static enum gimplify_status
1678 gimplify_var_or_parm_decl (tree *expr_p)
1680 tree decl = *expr_p;
1682 /* ??? If this is a local variable, and it has not been seen in any
1683 outer BIND_EXPR, then it's probably the result of a duplicate
1684 declaration, for which we've already issued an error. It would
1685 be really nice if the front end wouldn't leak these at all.
1686 Currently the only known culprit is C++ destructors, as seen
1687 in g++.old-deja/g++.jason/binding.C. */
1688 if (TREE_CODE (decl) == VAR_DECL
1689 && !DECL_SEEN_IN_BIND_EXPR_P (decl)
1690 && !TREE_STATIC (decl) && !DECL_EXTERNAL (decl)
1691 && decl_function_context (decl) == current_function_decl)
1693 gcc_assert (errorcount || sorrycount);
1697 /* When within an OpenMP context, notice uses of variables. */
1698 if (gimplify_omp_ctxp && omp_notice_variable (gimplify_omp_ctxp, decl, true))
1701 /* If the decl is an alias for another expression, substitute it now. */
1702 if (DECL_HAS_VALUE_EXPR_P (decl))
1704 *expr_p = unshare_expr (DECL_VALUE_EXPR (decl));
1712 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1713 node pointed to by EXPR_P.
1716 : min_lval '[' val ']'
1718 | compound_lval '[' val ']'
1719 | compound_lval '.' ID
1721 This is not part of the original SIMPLE definition, which separates
1722 array and member references, but it seems reasonable to handle them
1723 together. Also, this way we don't run into problems with union
1724 aliasing; gcc requires that for accesses through a union to alias, the
1725 union reference must be explicit, which was not always the case when we
1726 were splitting up array and member refs.
1728 PRE_P points to the list where side effects that must happen before
1729 *EXPR_P should be stored.
1731 POST_P points to the list where side effects that must happen after
1732 *EXPR_P should be stored. */
1734 static enum gimplify_status
1735 gimplify_compound_lval (tree *expr_p, tree *pre_p,
1736 tree *post_p, fallback_t fallback)
1739 VEC(tree,heap) *stack;
1740 enum gimplify_status ret = GS_OK, tret;
1743 /* Create a stack of the subexpressions so later we can walk them in
1744 order from inner to outer. */
1745 stack = VEC_alloc (tree, heap, 10);
1747 /* We can handle anything that get_inner_reference can deal with. */
1748 for (p = expr_p; ; p = &TREE_OPERAND (*p, 0))
1751 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1752 if (TREE_CODE (*p) == INDIRECT_REF)
1753 *p = fold_indirect_ref (*p);
1755 if (handled_component_p (*p))
1757 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
1758 additional COMPONENT_REFs. */
1759 else if ((TREE_CODE (*p) == VAR_DECL || TREE_CODE (*p) == PARM_DECL)
1760 && gimplify_var_or_parm_decl (p) == GS_OK)
1765 VEC_safe_push (tree, heap, stack, *p);
1768 gcc_assert (VEC_length (tree, stack));
1770 /* Now STACK is a stack of pointers to all the refs we've walked through
1771 and P points to the innermost expression.
1773 Java requires that we elaborated nodes in source order. That
1774 means we must gimplify the inner expression followed by each of
1775 the indices, in order. But we can't gimplify the inner
1776 expression until we deal with any variable bounds, sizes, or
1777 positions in order to deal with PLACEHOLDER_EXPRs.
1779 So we do this in three steps. First we deal with the annotations
1780 for any variables in the components, then we gimplify the base,
1781 then we gimplify any indices, from left to right. */
1782 for (i = VEC_length (tree, stack) - 1; i >= 0; i--)
1784 tree t = VEC_index (tree, stack, i);
1786 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
1788 /* Gimplify the low bound and element type size and put them into
1789 the ARRAY_REF. If these values are set, they have already been
1791 if (!TREE_OPERAND (t, 2))
1793 tree low = unshare_expr (array_ref_low_bound (t));
1794 if (!is_gimple_min_invariant (low))
1796 TREE_OPERAND (t, 2) = low;
1797 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1798 is_gimple_formal_tmp_reg, fb_rvalue);
1799 ret = MIN (ret, tret);
1803 if (!TREE_OPERAND (t, 3))
1805 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (t, 0)));
1806 tree elmt_size = unshare_expr (array_ref_element_size (t));
1807 tree factor = size_int (TYPE_ALIGN_UNIT (elmt_type));
1809 /* Divide the element size by the alignment of the element
1811 elmt_size = size_binop (EXACT_DIV_EXPR, elmt_size, factor);
1813 if (!is_gimple_min_invariant (elmt_size))
1815 TREE_OPERAND (t, 3) = elmt_size;
1816 tret = gimplify_expr (&TREE_OPERAND (t, 3), pre_p, post_p,
1817 is_gimple_formal_tmp_reg, fb_rvalue);
1818 ret = MIN (ret, tret);
1822 else if (TREE_CODE (t) == COMPONENT_REF)
1824 /* Set the field offset into T and gimplify it. */
1825 if (!TREE_OPERAND (t, 2))
1827 tree offset = unshare_expr (component_ref_field_offset (t));
1828 tree field = TREE_OPERAND (t, 1);
1830 = size_int (DECL_OFFSET_ALIGN (field) / BITS_PER_UNIT);
1832 /* Divide the offset by its alignment. */
1833 offset = size_binop (EXACT_DIV_EXPR, offset, factor);
1835 if (!is_gimple_min_invariant (offset))
1837 TREE_OPERAND (t, 2) = offset;
1838 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1839 is_gimple_formal_tmp_reg, fb_rvalue);
1840 ret = MIN (ret, tret);
1846 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
1847 so as to match the min_lval predicate. Failure to do so may result
1848 in the creation of large aggregate temporaries. */
1849 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval,
1850 fallback | fb_lvalue);
1851 ret = MIN (ret, tret);
1853 /* And finally, the indices and operands to BIT_FIELD_REF. During this
1854 loop we also remove any useless conversions. */
1855 for (; VEC_length (tree, stack) > 0; )
1857 tree t = VEC_pop (tree, stack);
1859 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
1861 /* Gimplify the dimension.
1862 Temporary fix for gcc.c-torture/execute/20040313-1.c.
1863 Gimplify non-constant array indices into a temporary
1865 FIXME - The real fix is to gimplify post-modify
1866 expressions into a minimal gimple lvalue. However, that
1867 exposes bugs in alias analysis. The alias analyzer does
1868 not handle &PTR->FIELD very well. Will fix after the
1869 branch is merged into mainline (dnovillo 2004-05-03). */
1870 if (!is_gimple_min_invariant (TREE_OPERAND (t, 1)))
1872 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
1873 is_gimple_formal_tmp_reg, fb_rvalue);
1874 ret = MIN (ret, tret);
1877 else if (TREE_CODE (t) == BIT_FIELD_REF)
1879 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
1880 is_gimple_val, fb_rvalue);
1881 ret = MIN (ret, tret);
1882 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1883 is_gimple_val, fb_rvalue);
1884 ret = MIN (ret, tret);
1887 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t, 0));
1889 /* The innermost expression P may have originally had TREE_SIDE_EFFECTS
1890 set which would have caused all the outer expressions in EXPR_P
1891 leading to P to also have had TREE_SIDE_EFFECTS set. */
1892 recalculate_side_effects (t);
1895 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval, fallback);
1896 ret = MIN (ret, tret);
1898 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
1899 if ((fallback & fb_rvalue) && TREE_CODE (*expr_p) == COMPONENT_REF)
1901 canonicalize_component_ref (expr_p);
1902 ret = MIN (ret, GS_OK);
1905 VEC_free (tree, heap, stack);
1910 /* Gimplify the self modifying expression pointed to by EXPR_P
1913 PRE_P points to the list where side effects that must happen before
1914 *EXPR_P should be stored.
1916 POST_P points to the list where side effects that must happen after
1917 *EXPR_P should be stored.
1919 WANT_VALUE is nonzero iff we want to use the value of this expression
1920 in another expression. */
1922 static enum gimplify_status
1923 gimplify_self_mod_expr (tree *expr_p, tree *pre_p, tree *post_p,
1926 enum tree_code code;
1927 tree lhs, lvalue, rhs, t1, post = NULL, *orig_post_p = post_p;
1929 enum tree_code arith_code;
1930 enum gimplify_status ret;
1932 code = TREE_CODE (*expr_p);
1934 gcc_assert (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR
1935 || code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR);
1937 /* Prefix or postfix? */
1938 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
1939 /* Faster to treat as prefix if result is not used. */
1940 postfix = want_value;
1944 /* For postfix, make sure the inner expression's post side effects
1945 are executed after side effects from this expression. */
1949 /* Add or subtract? */
1950 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
1951 arith_code = PLUS_EXPR;
1953 arith_code = MINUS_EXPR;
1955 /* Gimplify the LHS into a GIMPLE lvalue. */
1956 lvalue = TREE_OPERAND (*expr_p, 0);
1957 ret = gimplify_expr (&lvalue, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
1958 if (ret == GS_ERROR)
1961 /* Extract the operands to the arithmetic operation. */
1963 rhs = TREE_OPERAND (*expr_p, 1);
1965 /* For postfix operator, we evaluate the LHS to an rvalue and then use
1966 that as the result value and in the postqueue operation. */
1969 ret = gimplify_expr (&lhs, pre_p, post_p, is_gimple_val, fb_rvalue);
1970 if (ret == GS_ERROR)
1974 /* For POINTERs increment, use POINTER_PLUS_EXPR. */
1975 if (POINTER_TYPE_P (TREE_TYPE (lhs)))
1977 rhs = fold_convert (sizetype, rhs);
1978 if (arith_code == MINUS_EXPR)
1979 rhs = fold_build1 (NEGATE_EXPR, TREE_TYPE (rhs), rhs);
1980 arith_code = POINTER_PLUS_EXPR;
1983 t1 = build2 (arith_code, TREE_TYPE (*expr_p), lhs, rhs);
1984 t1 = build_gimple_modify_stmt (lvalue, t1);
1988 gimplify_and_add (t1, orig_post_p);
1989 append_to_statement_list (post, orig_post_p);
2000 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
2003 maybe_with_size_expr (tree *expr_p)
2005 tree expr = *expr_p;
2006 tree type = TREE_TYPE (expr);
2009 /* If we've already wrapped this or the type is error_mark_node, we can't do
2011 if (TREE_CODE (expr) == WITH_SIZE_EXPR
2012 || type == error_mark_node)
2015 /* If the size isn't known or is a constant, we have nothing to do. */
2016 size = TYPE_SIZE_UNIT (type);
2017 if (!size || TREE_CODE (size) == INTEGER_CST)
2020 /* Otherwise, make a WITH_SIZE_EXPR. */
2021 size = unshare_expr (size);
2022 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, expr);
2023 *expr_p = build2 (WITH_SIZE_EXPR, type, expr, size);
2026 /* Subroutine of gimplify_call_expr: Gimplify a single argument. */
2028 static enum gimplify_status
2029 gimplify_arg (tree *expr_p, tree *pre_p)
2031 bool (*test) (tree);
2034 /* In general, we allow lvalues for function arguments to avoid
2035 extra overhead of copying large aggregates out of even larger
2036 aggregates into temporaries only to copy the temporaries to
2037 the argument list. Make optimizers happy by pulling out to
2038 temporaries those types that fit in registers. */
2039 if (is_gimple_reg_type (TREE_TYPE (*expr_p)))
2040 test = is_gimple_val, fb = fb_rvalue;
2042 test = is_gimple_lvalue, fb = fb_either;
2044 /* If this is a variable sized type, we must remember the size. */
2045 maybe_with_size_expr (expr_p);
2047 /* There is a sequence point before a function call. Side effects in
2048 the argument list must occur before the actual call. So, when
2049 gimplifying arguments, force gimplify_expr to use an internal
2050 post queue which is then appended to the end of PRE_P. */
2051 return gimplify_expr (expr_p, pre_p, NULL, test, fb);
2054 /* Gimplify the CALL_EXPR node pointed to by EXPR_P. PRE_P points to the
2055 list where side effects that must happen before *EXPR_P should be stored.
2056 WANT_VALUE is true if the result of the call is desired. */
2058 static enum gimplify_status
2059 gimplify_call_expr (tree *expr_p, tree *pre_p, bool want_value)
2061 tree decl, parms, p;
2062 enum gimplify_status ret;
2065 gcc_assert (TREE_CODE (*expr_p) == CALL_EXPR);
2067 /* For reliable diagnostics during inlining, it is necessary that
2068 every call_expr be annotated with file and line. */
2069 if (! EXPR_HAS_LOCATION (*expr_p))
2070 SET_EXPR_LOCATION (*expr_p, input_location);
2072 /* This may be a call to a builtin function.
2074 Builtin function calls may be transformed into different
2075 (and more efficient) builtin function calls under certain
2076 circumstances. Unfortunately, gimplification can muck things
2077 up enough that the builtin expanders are not aware that certain
2078 transformations are still valid.
2080 So we attempt transformation/gimplification of the call before
2081 we gimplify the CALL_EXPR. At this time we do not manage to
2082 transform all calls in the same manner as the expanders do, but
2083 we do transform most of them. */
2084 decl = get_callee_fndecl (*expr_p);
2085 if (decl && DECL_BUILT_IN (decl))
2087 tree new = fold_call_expr (*expr_p, !want_value);
2089 if (new && new != *expr_p)
2091 /* There was a transformation of this call which computes the
2092 same value, but in a more efficient way. Return and try
2098 if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
2099 && DECL_FUNCTION_CODE (decl) == BUILT_IN_VA_START)
2101 if (call_expr_nargs (*expr_p) < 2)
2103 error ("too few arguments to function %<va_start%>");
2104 *expr_p = build_empty_stmt ();
2108 if (fold_builtin_next_arg (*expr_p, true))
2110 *expr_p = build_empty_stmt ();
2113 /* Avoid gimplifying the second argument to va_start, which needs
2114 to be the plain PARM_DECL. */
2115 return gimplify_arg (&CALL_EXPR_ARG (*expr_p, 0), pre_p);
2119 /* There is a sequence point before the call, so any side effects in
2120 the calling expression must occur before the actual call. Force
2121 gimplify_expr to use an internal post queue. */
2122 ret = gimplify_expr (&CALL_EXPR_FN (*expr_p), pre_p, NULL,
2123 is_gimple_call_addr, fb_rvalue);
2125 nargs = call_expr_nargs (*expr_p);
2127 /* Get argument types for verification. */
2128 decl = get_callee_fndecl (*expr_p);
2131 parms = TYPE_ARG_TYPES (TREE_TYPE (decl));
2132 else if (POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_FN (*expr_p))))
2133 parms = TYPE_ARG_TYPES (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (*expr_p))));
2135 /* Verify if the type of the argument matches that of the function
2136 declaration. If we cannot verify this or there is a mismatch,
2137 mark the call expression so it doesn't get inlined later. */
2138 if (decl && DECL_ARGUMENTS (decl))
2140 for (i = 0, p = DECL_ARGUMENTS (decl); i < nargs;
2141 i++, p = TREE_CHAIN (p))
2143 /* We cannot distinguish a varargs function from the case
2144 of excess parameters, still deferring the inlining decision
2145 to the callee is possible. */
2148 if (p == error_mark_node
2149 || CALL_EXPR_ARG (*expr_p, i) == error_mark_node
2150 || !fold_convertible_p (DECL_ARG_TYPE (p),
2151 CALL_EXPR_ARG (*expr_p, i)))
2153 CALL_CANNOT_INLINE_P (*expr_p) = 1;
2160 for (i = 0, p = parms; i < nargs; i++, p = TREE_CHAIN (p))
2162 /* If this is a varargs function defer inlining decision
2166 if (TREE_VALUE (p) == error_mark_node
2167 || CALL_EXPR_ARG (*expr_p, i) == error_mark_node
2168 || TREE_CODE (TREE_VALUE (p)) == VOID_TYPE
2169 || !fold_convertible_p (TREE_VALUE (p),
2170 CALL_EXPR_ARG (*expr_p, i)))
2172 CALL_CANNOT_INLINE_P (*expr_p) = 1;
2177 else if (nargs != 0)
2178 CALL_CANNOT_INLINE_P (*expr_p) = 1;
2180 /* Finally, gimplify the function arguments. */
2181 for (i = (PUSH_ARGS_REVERSED ? nargs - 1 : 0);
2182 PUSH_ARGS_REVERSED ? i >= 0 : i < nargs;
2183 PUSH_ARGS_REVERSED ? i-- : i++)
2185 enum gimplify_status t;
2187 t = gimplify_arg (&CALL_EXPR_ARG (*expr_p, i), pre_p);
2193 /* Try this again in case gimplification exposed something. */
2194 if (ret != GS_ERROR)
2196 tree new = fold_call_expr (*expr_p, !want_value);
2198 if (new && new != *expr_p)
2200 /* There was a transformation of this call which computes the
2201 same value, but in a more efficient way. Return and try
2208 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2209 decl. This allows us to eliminate redundant or useless
2210 calls to "const" functions. */
2211 if (TREE_CODE (*expr_p) == CALL_EXPR
2212 && (call_expr_flags (*expr_p) & (ECF_CONST | ECF_PURE)))
2213 TREE_SIDE_EFFECTS (*expr_p) = 0;
2218 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2219 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2221 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2222 condition is true or false, respectively. If null, we should generate
2223 our own to skip over the evaluation of this specific expression.
2225 This function is the tree equivalent of do_jump.
2227 shortcut_cond_r should only be called by shortcut_cond_expr. */
2230 shortcut_cond_r (tree pred, tree *true_label_p, tree *false_label_p)
2232 tree local_label = NULL_TREE;
2233 tree t, expr = NULL;
2235 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2236 retain the shortcut semantics. Just insert the gotos here;
2237 shortcut_cond_expr will append the real blocks later. */
2238 if (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2240 /* Turn if (a && b) into
2242 if (a); else goto no;
2243 if (b) goto yes; else goto no;
2246 if (false_label_p == NULL)
2247 false_label_p = &local_label;
2249 t = shortcut_cond_r (TREE_OPERAND (pred, 0), NULL, false_label_p);
2250 append_to_statement_list (t, &expr);
2252 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2254 append_to_statement_list (t, &expr);
2256 else if (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2258 /* Turn if (a || b) into
2261 if (b) goto yes; else goto no;
2264 if (true_label_p == NULL)
2265 true_label_p = &local_label;
2267 t = shortcut_cond_r (TREE_OPERAND (pred, 0), true_label_p, NULL);
2268 append_to_statement_list (t, &expr);
2270 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2272 append_to_statement_list (t, &expr);
2274 else if (TREE_CODE (pred) == COND_EXPR)
2276 /* As long as we're messing with gotos, turn if (a ? b : c) into
2278 if (b) goto yes; else goto no;
2280 if (c) goto yes; else goto no; */
2281 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (pred, 0),
2282 shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2284 shortcut_cond_r (TREE_OPERAND (pred, 2), true_label_p,
2289 expr = build3 (COND_EXPR, void_type_node, pred,
2290 build_and_jump (true_label_p),
2291 build_and_jump (false_label_p));
2296 t = build1 (LABEL_EXPR, void_type_node, local_label);
2297 append_to_statement_list (t, &expr);
2304 shortcut_cond_expr (tree expr)
2306 tree pred = TREE_OPERAND (expr, 0);
2307 tree then_ = TREE_OPERAND (expr, 1);
2308 tree else_ = TREE_OPERAND (expr, 2);
2309 tree true_label, false_label, end_label, t;
2311 tree *false_label_p;
2312 bool emit_end, emit_false, jump_over_else;
2313 bool then_se = then_ && TREE_SIDE_EFFECTS (then_);
2314 bool else_se = else_ && TREE_SIDE_EFFECTS (else_);
2316 /* First do simple transformations. */
2319 /* If there is no 'else', turn (a && b) into if (a) if (b). */
2320 while (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2322 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2323 then_ = shortcut_cond_expr (expr);
2324 then_se = then_ && TREE_SIDE_EFFECTS (then_);
2325 pred = TREE_OPERAND (pred, 0);
2326 expr = build3 (COND_EXPR, void_type_node, pred, then_, NULL_TREE);
2331 /* If there is no 'then', turn
2334 if (a); else if (b); else d. */
2335 while (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2337 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2338 else_ = shortcut_cond_expr (expr);
2339 else_se = else_ && TREE_SIDE_EFFECTS (else_);
2340 pred = TREE_OPERAND (pred, 0);
2341 expr = build3 (COND_EXPR, void_type_node, pred, NULL_TREE, else_);
2345 /* If we're done, great. */
2346 if (TREE_CODE (pred) != TRUTH_ANDIF_EXPR
2347 && TREE_CODE (pred) != TRUTH_ORIF_EXPR)
2350 /* Otherwise we need to mess with gotos. Change
2353 if (a); else goto no;
2356 and recursively gimplify the condition. */
2358 true_label = false_label = end_label = NULL_TREE;
2360 /* If our arms just jump somewhere, hijack those labels so we don't
2361 generate jumps to jumps. */
2364 && TREE_CODE (then_) == GOTO_EXPR
2365 && TREE_CODE (GOTO_DESTINATION (then_)) == LABEL_DECL)
2367 true_label = GOTO_DESTINATION (then_);
2373 && TREE_CODE (else_) == GOTO_EXPR
2374 && TREE_CODE (GOTO_DESTINATION (else_)) == LABEL_DECL)
2376 false_label = GOTO_DESTINATION (else_);
2381 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2383 true_label_p = &true_label;
2385 true_label_p = NULL;
2387 /* The 'else' branch also needs a label if it contains interesting code. */
2388 if (false_label || else_se)
2389 false_label_p = &false_label;
2391 false_label_p = NULL;
2393 /* If there was nothing else in our arms, just forward the label(s). */
2394 if (!then_se && !else_se)
2395 return shortcut_cond_r (pred, true_label_p, false_label_p);
2397 /* If our last subexpression already has a terminal label, reuse it. */
2399 expr = expr_last (else_);
2401 expr = expr_last (then_);
2404 if (expr && TREE_CODE (expr) == LABEL_EXPR)
2405 end_label = LABEL_EXPR_LABEL (expr);
2407 /* If we don't care about jumping to the 'else' branch, jump to the end
2408 if the condition is false. */
2410 false_label_p = &end_label;
2412 /* We only want to emit these labels if we aren't hijacking them. */
2413 emit_end = (end_label == NULL_TREE);
2414 emit_false = (false_label == NULL_TREE);
2416 /* We only emit the jump over the else clause if we have to--if the
2417 then clause may fall through. Otherwise we can wind up with a
2418 useless jump and a useless label at the end of gimplified code,
2419 which will cause us to think that this conditional as a whole
2420 falls through even if it doesn't. If we then inline a function
2421 which ends with such a condition, that can cause us to issue an
2422 inappropriate warning about control reaching the end of a
2423 non-void function. */
2424 jump_over_else = block_may_fallthru (then_);
2426 pred = shortcut_cond_r (pred, true_label_p, false_label_p);
2429 append_to_statement_list (pred, &expr);
2431 append_to_statement_list (then_, &expr);
2436 t = build_and_jump (&end_label);
2437 append_to_statement_list (t, &expr);
2441 t = build1 (LABEL_EXPR, void_type_node, false_label);
2442 append_to_statement_list (t, &expr);
2444 append_to_statement_list (else_, &expr);
2446 if (emit_end && end_label)
2448 t = build1 (LABEL_EXPR, void_type_node, end_label);
2449 append_to_statement_list (t, &expr);
2455 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2458 gimple_boolify (tree expr)
2460 tree type = TREE_TYPE (expr);
2462 if (TREE_CODE (type) == BOOLEAN_TYPE)
2465 switch (TREE_CODE (expr))
2467 case TRUTH_AND_EXPR:
2469 case TRUTH_XOR_EXPR:
2470 case TRUTH_ANDIF_EXPR:
2471 case TRUTH_ORIF_EXPR:
2472 /* Also boolify the arguments of truth exprs. */
2473 TREE_OPERAND (expr, 1) = gimple_boolify (TREE_OPERAND (expr, 1));
2476 case TRUTH_NOT_EXPR:
2477 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2480 case EQ_EXPR: case NE_EXPR:
2481 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2482 /* These expressions always produce boolean results. */
2483 TREE_TYPE (expr) = boolean_type_node;
2487 /* Other expressions that get here must have boolean values, but
2488 might need to be converted to the appropriate mode. */
2489 return fold_convert (boolean_type_node, expr);
2493 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2502 The second form is used when *EXPR_P is of type void.
2504 TARGET is the tree for T1 above.
2506 PRE_P points to the list where side effects that must happen before
2507 *EXPR_P should be stored. */
2509 static enum gimplify_status
2510 gimplify_cond_expr (tree *expr_p, tree *pre_p, fallback_t fallback)
2512 tree expr = *expr_p;
2513 tree tmp, tmp2, type;
2514 enum gimplify_status ret;
2516 type = TREE_TYPE (expr);
2518 /* If this COND_EXPR has a value, copy the values into a temporary within
2520 if (! VOID_TYPE_P (type))
2524 if ((fallback & fb_lvalue) == 0)
2526 result = tmp2 = tmp = create_tmp_var (TREE_TYPE (expr), "iftmp");
2531 tree type = build_pointer_type (TREE_TYPE (expr));
2533 if (TREE_TYPE (TREE_OPERAND (expr, 1)) != void_type_node)
2534 TREE_OPERAND (expr, 1) =
2535 build_fold_addr_expr (TREE_OPERAND (expr, 1));
2537 if (TREE_TYPE (TREE_OPERAND (expr, 2)) != void_type_node)
2538 TREE_OPERAND (expr, 2) =
2539 build_fold_addr_expr (TREE_OPERAND (expr, 2));
2541 tmp2 = tmp = create_tmp_var (type, "iftmp");
2543 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (expr, 0),
2544 TREE_OPERAND (expr, 1), TREE_OPERAND (expr, 2));
2546 result = build_fold_indirect_ref (tmp);
2550 /* Build the then clause, 't1 = a;'. But don't build an assignment
2551 if this branch is void; in C++ it can be, if it's a throw. */
2552 if (TREE_TYPE (TREE_OPERAND (expr, 1)) != void_type_node)
2553 TREE_OPERAND (expr, 1)
2554 = build_gimple_modify_stmt (tmp, TREE_OPERAND (expr, 1));
2556 /* Build the else clause, 't1 = b;'. */
2557 if (TREE_TYPE (TREE_OPERAND (expr, 2)) != void_type_node)
2558 TREE_OPERAND (expr, 2)
2559 = build_gimple_modify_stmt (tmp2, TREE_OPERAND (expr, 2));
2561 TREE_TYPE (expr) = void_type_node;
2562 recalculate_side_effects (expr);
2564 /* Move the COND_EXPR to the prequeue. */
2565 gimplify_and_add (expr, pre_p);
2571 /* Make sure the condition has BOOLEAN_TYPE. */
2572 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2574 /* Break apart && and || conditions. */
2575 if (TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ANDIF_EXPR
2576 || TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ORIF_EXPR)
2578 expr = shortcut_cond_expr (expr);
2580 if (expr != *expr_p)
2584 /* We can't rely on gimplify_expr to re-gimplify the expanded
2585 form properly, as cleanups might cause the target labels to be
2586 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2587 set up a conditional context. */
2588 gimple_push_condition ();
2589 gimplify_stmt (expr_p);
2590 gimple_pop_condition (pre_p);
2596 /* Now do the normal gimplification. */
2597 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL,
2598 is_gimple_condexpr, fb_rvalue);
2600 gimple_push_condition ();
2602 gimplify_to_stmt_list (&TREE_OPERAND (expr, 1));
2603 gimplify_to_stmt_list (&TREE_OPERAND (expr, 2));
2604 recalculate_side_effects (expr);
2606 gimple_pop_condition (pre_p);
2608 if (ret == GS_ERROR)
2610 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2612 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 2)))
2613 /* Rewrite "if (a); else b" to "if (!a) b" */
2615 TREE_OPERAND (expr, 0) = invert_truthvalue (TREE_OPERAND (expr, 0));
2616 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL,
2617 is_gimple_condexpr, fb_rvalue);
2619 tmp = TREE_OPERAND (expr, 1);
2620 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 2);
2621 TREE_OPERAND (expr, 2) = tmp;
2624 /* Both arms are empty; replace the COND_EXPR with its predicate. */
2625 expr = TREE_OPERAND (expr, 0);
2631 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2632 a call to __builtin_memcpy. */
2634 static enum gimplify_status
2635 gimplify_modify_expr_to_memcpy (tree *expr_p, tree size, bool want_value)
2637 tree t, to, to_ptr, from, from_ptr;
2639 to = GENERIC_TREE_OPERAND (*expr_p, 0);
2640 from = GENERIC_TREE_OPERAND (*expr_p, 1);
2642 from_ptr = build_fold_addr_expr (from);
2644 to_ptr = build_fold_addr_expr (to);
2645 t = implicit_built_in_decls[BUILT_IN_MEMCPY];
2646 t = build_call_expr (t, 3, to_ptr, from_ptr, size);
2650 t = build1 (NOP_EXPR, TREE_TYPE (to_ptr), t);
2651 t = build1 (INDIRECT_REF, TREE_TYPE (to), t);
2658 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2659 a call to __builtin_memset. In this case we know that the RHS is
2660 a CONSTRUCTOR with an empty element list. */
2662 static enum gimplify_status
2663 gimplify_modify_expr_to_memset (tree *expr_p, tree size, bool want_value)
2667 to = GENERIC_TREE_OPERAND (*expr_p, 0);
2669 to_ptr = build_fold_addr_expr (to);
2670 t = implicit_built_in_decls[BUILT_IN_MEMSET];
2671 t = build_call_expr (t, 3, to_ptr, integer_zero_node, size);
2675 t = build1 (NOP_EXPR, TREE_TYPE (to_ptr), t);
2676 t = build1 (INDIRECT_REF, TREE_TYPE (to), t);
2683 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
2684 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
2685 assignment. Returns non-null if we detect a potential overlap. */
2687 struct gimplify_init_ctor_preeval_data
2689 /* The base decl of the lhs object. May be NULL, in which case we
2690 have to assume the lhs is indirect. */
2693 /* The alias set of the lhs object. */
2694 alias_set_type lhs_alias_set;
2698 gimplify_init_ctor_preeval_1 (tree *tp, int *walk_subtrees, void *xdata)
2700 struct gimplify_init_ctor_preeval_data *data
2701 = (struct gimplify_init_ctor_preeval_data *) xdata;
2704 /* If we find the base object, obviously we have overlap. */
2705 if (data->lhs_base_decl == t)
2708 /* If the constructor component is indirect, determine if we have a
2709 potential overlap with the lhs. The only bits of information we
2710 have to go on at this point are addressability and alias sets. */
2711 if (TREE_CODE (t) == INDIRECT_REF
2712 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
2713 && alias_sets_conflict_p (data->lhs_alias_set, get_alias_set (t)))
2716 /* If the constructor component is a call, determine if it can hide a
2717 potential overlap with the lhs through an INDIRECT_REF like above. */
2718 if (TREE_CODE (t) == CALL_EXPR)
2720 tree type, fntype = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (t)));
2722 for (type = TYPE_ARG_TYPES (fntype); type; type = TREE_CHAIN (type))
2723 if (POINTER_TYPE_P (TREE_VALUE (type))
2724 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
2725 && alias_sets_conflict_p (data->lhs_alias_set,
2727 (TREE_TYPE (TREE_VALUE (type)))))
2731 if (IS_TYPE_OR_DECL_P (t))
2736 /* A subroutine of gimplify_init_constructor. Pre-evaluate *EXPR_P,
2737 force values that overlap with the lhs (as described by *DATA)
2738 into temporaries. */
2741 gimplify_init_ctor_preeval (tree *expr_p, tree *pre_p, tree *post_p,
2742 struct gimplify_init_ctor_preeval_data *data)
2744 enum gimplify_status one;
2746 /* If the value is invariant, then there's nothing to pre-evaluate.
2747 But ensure it doesn't have any side-effects since a SAVE_EXPR is
2748 invariant but has side effects and might contain a reference to
2749 the object we're initializing. */
2750 if (TREE_INVARIANT (*expr_p) && !TREE_SIDE_EFFECTS (*expr_p))
2753 /* If the type has non-trivial constructors, we can't pre-evaluate. */
2754 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p)))
2757 /* Recurse for nested constructors. */
2758 if (TREE_CODE (*expr_p) == CONSTRUCTOR)
2760 unsigned HOST_WIDE_INT ix;
2761 constructor_elt *ce;
2762 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (*expr_p);
2764 for (ix = 0; VEC_iterate (constructor_elt, v, ix, ce); ix++)
2765 gimplify_init_ctor_preeval (&ce->value, pre_p, post_p, data);
2769 /* If this is a variable sized type, we must remember the size. */
2770 maybe_with_size_expr (expr_p);
2772 /* Gimplify the constructor element to something appropriate for the rhs
2773 of a MODIFY_EXPR. Given that we know the lhs is an aggregate, we know
2774 the gimplifier will consider this a store to memory. Doing this
2775 gimplification now means that we won't have to deal with complicated
2776 language-specific trees, nor trees like SAVE_EXPR that can induce
2777 exponential search behavior. */
2778 one = gimplify_expr (expr_p, pre_p, post_p, is_gimple_mem_rhs, fb_rvalue);
2779 if (one == GS_ERROR)
2785 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
2786 with the lhs, since "a = { .x=a }" doesn't make sense. This will
2787 always be true for all scalars, since is_gimple_mem_rhs insists on a
2788 temporary variable for them. */
2789 if (DECL_P (*expr_p))
2792 /* If this is of variable size, we have no choice but to assume it doesn't
2793 overlap since we can't make a temporary for it. */
2794 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (*expr_p))) != INTEGER_CST)
2797 /* Otherwise, we must search for overlap ... */
2798 if (!walk_tree (expr_p, gimplify_init_ctor_preeval_1, data, NULL))
2801 /* ... and if found, force the value into a temporary. */
2802 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
2805 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
2806 a RANGE_EXPR in a CONSTRUCTOR for an array.
2810 object[var] = value;
2817 We increment var _after_ the loop exit check because we might otherwise
2818 fail if upper == TYPE_MAX_VALUE (type for upper).
2820 Note that we never have to deal with SAVE_EXPRs here, because this has
2821 already been taken care of for us, in gimplify_init_ctor_preeval(). */
2823 static void gimplify_init_ctor_eval (tree, VEC(constructor_elt,gc) *,
2827 gimplify_init_ctor_eval_range (tree object, tree lower, tree upper,
2828 tree value, tree array_elt_type,
2829 tree *pre_p, bool cleared)
2831 tree loop_entry_label, loop_exit_label;
2832 tree var, var_type, cref, tmp;
2834 loop_entry_label = create_artificial_label ();
2835 loop_exit_label = create_artificial_label ();
2837 /* Create and initialize the index variable. */
2838 var_type = TREE_TYPE (upper);
2839 var = create_tmp_var (var_type, NULL);
2840 append_to_statement_list (build_gimple_modify_stmt (var, lower), pre_p);
2842 /* Add the loop entry label. */
2843 append_to_statement_list (build1 (LABEL_EXPR,
2848 /* Build the reference. */
2849 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
2850 var, NULL_TREE, NULL_TREE);
2852 /* If we are a constructor, just call gimplify_init_ctor_eval to do
2853 the store. Otherwise just assign value to the reference. */
2855 if (TREE_CODE (value) == CONSTRUCTOR)
2856 /* NB we might have to call ourself recursively through
2857 gimplify_init_ctor_eval if the value is a constructor. */
2858 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
2861 append_to_statement_list (build_gimple_modify_stmt (cref, value), pre_p);
2863 /* We exit the loop when the index var is equal to the upper bound. */
2864 gimplify_and_add (build3 (COND_EXPR, void_type_node,
2865 build2 (EQ_EXPR, boolean_type_node,
2873 /* Otherwise, increment the index var... */
2874 tmp = build2 (PLUS_EXPR, var_type, var,
2875 fold_convert (var_type, integer_one_node));
2876 append_to_statement_list (build_gimple_modify_stmt (var, tmp), pre_p);
2878 /* ...and jump back to the loop entry. */
2879 append_to_statement_list (build1 (GOTO_EXPR,
2884 /* Add the loop exit label. */
2885 append_to_statement_list (build1 (LABEL_EXPR,
2891 /* Return true if FDECL is accessing a field that is zero sized. */
2894 zero_sized_field_decl (tree fdecl)
2896 if (TREE_CODE (fdecl) == FIELD_DECL && DECL_SIZE (fdecl)
2897 && integer_zerop (DECL_SIZE (fdecl)))
2902 /* Return true if TYPE is zero sized. */
2905 zero_sized_type (tree type)
2907 if (AGGREGATE_TYPE_P (type) && TYPE_SIZE (type)
2908 && integer_zerop (TYPE_SIZE (type)))
2913 /* A subroutine of gimplify_init_constructor. Generate individual
2914 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
2915 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
2916 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
2920 gimplify_init_ctor_eval (tree object, VEC(constructor_elt,gc) *elts,
2921 tree *pre_p, bool cleared)
2923 tree array_elt_type = NULL;
2924 unsigned HOST_WIDE_INT ix;
2925 tree purpose, value;
2927 if (TREE_CODE (TREE_TYPE (object)) == ARRAY_TYPE)
2928 array_elt_type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object)));
2930 FOR_EACH_CONSTRUCTOR_ELT (elts, ix, purpose, value)
2934 /* NULL values are created above for gimplification errors. */
2938 if (cleared && initializer_zerop (value))
2941 /* ??? Here's to hoping the front end fills in all of the indices,
2942 so we don't have to figure out what's missing ourselves. */
2943 gcc_assert (purpose);
2945 /* Skip zero-sized fields, unless value has side-effects. This can
2946 happen with calls to functions returning a zero-sized type, which
2947 we shouldn't discard. As a number of downstream passes don't
2948 expect sets of zero-sized fields, we rely on the gimplification of
2949 the MODIFY_EXPR we make below to drop the assignment statement. */
2950 if (! TREE_SIDE_EFFECTS (value) && zero_sized_field_decl (purpose))
2953 /* If we have a RANGE_EXPR, we have to build a loop to assign the
2955 if (TREE_CODE (purpose) == RANGE_EXPR)
2957 tree lower = TREE_OPERAND (purpose, 0);
2958 tree upper = TREE_OPERAND (purpose, 1);
2960 /* If the lower bound is equal to upper, just treat it as if
2961 upper was the index. */
2962 if (simple_cst_equal (lower, upper))
2966 gimplify_init_ctor_eval_range (object, lower, upper, value,
2967 array_elt_type, pre_p, cleared);
2974 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
2975 purpose, NULL_TREE, NULL_TREE);
2979 gcc_assert (TREE_CODE (purpose) == FIELD_DECL);
2980 cref = build3 (COMPONENT_REF, TREE_TYPE (purpose),
2981 unshare_expr (object), purpose, NULL_TREE);
2984 if (TREE_CODE (value) == CONSTRUCTOR
2985 && TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE)
2986 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
2990 init = build2 (INIT_EXPR, TREE_TYPE (cref), cref, value);
2991 gimplify_and_add (init, pre_p);
2996 /* A subroutine of gimplify_modify_expr. Break out elements of a
2997 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
2999 Note that we still need to clear any elements that don't have explicit
3000 initializers, so if not all elements are initialized we keep the
3001 original MODIFY_EXPR, we just remove all of the constructor elements. */
3003 static enum gimplify_status
3004 gimplify_init_constructor (tree *expr_p, tree *pre_p,
3005 tree *post_p, bool want_value)
3008 tree ctor = GENERIC_TREE_OPERAND (*expr_p, 1);
3009 tree type = TREE_TYPE (ctor);
3010 enum gimplify_status ret;
3011 VEC(constructor_elt,gc) *elts;
3013 if (TREE_CODE (ctor) != CONSTRUCTOR)
3014 return GS_UNHANDLED;
3016 ret = gimplify_expr (&GENERIC_TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3017 is_gimple_lvalue, fb_lvalue);
3018 if (ret == GS_ERROR)
3020 object = GENERIC_TREE_OPERAND (*expr_p, 0);
3022 elts = CONSTRUCTOR_ELTS (ctor);
3025 switch (TREE_CODE (type))
3029 case QUAL_UNION_TYPE:
3032 struct gimplify_init_ctor_preeval_data preeval_data;
3033 HOST_WIDE_INT num_type_elements, num_ctor_elements;
3034 HOST_WIDE_INT num_nonzero_elements;
3035 bool cleared, valid_const_initializer;
3037 /* Aggregate types must lower constructors to initialization of
3038 individual elements. The exception is that a CONSTRUCTOR node
3039 with no elements indicates zero-initialization of the whole. */
3040 if (VEC_empty (constructor_elt, elts))
3043 /* Fetch information about the constructor to direct later processing.
3044 We might want to make static versions of it in various cases, and
3045 can only do so if it known to be a valid constant initializer. */
3046 valid_const_initializer
3047 = categorize_ctor_elements (ctor, &num_nonzero_elements,
3048 &num_ctor_elements, &cleared);
3050 /* If a const aggregate variable is being initialized, then it
3051 should never be a lose to promote the variable to be static. */
3052 if (valid_const_initializer
3053 && num_nonzero_elements > 1
3054 && TREE_READONLY (object)
3055 && TREE_CODE (object) == VAR_DECL)
3057 DECL_INITIAL (object) = ctor;
3058 TREE_STATIC (object) = 1;
3059 if (!DECL_NAME (object))
3060 DECL_NAME (object) = create_tmp_var_name ("C");
3061 walk_tree (&DECL_INITIAL (object), force_labels_r, NULL, NULL);
3063 /* ??? C++ doesn't automatically append a .<number> to the
3064 assembler name, and even when it does, it looks a FE private
3065 data structures to figure out what that number should be,
3066 which are not set for this variable. I suppose this is
3067 important for local statics for inline functions, which aren't
3068 "local" in the object file sense. So in order to get a unique
3069 TU-local symbol, we must invoke the lhd version now. */
3070 lhd_set_decl_assembler_name (object);
3072 *expr_p = NULL_TREE;
3076 /* If there are "lots" of initialized elements, even discounting
3077 those that are not address constants (and thus *must* be
3078 computed at runtime), then partition the constructor into
3079 constant and non-constant parts. Block copy the constant
3080 parts in, then generate code for the non-constant parts. */
3081 /* TODO. There's code in cp/typeck.c to do this. */
3083 num_type_elements = count_type_elements (type, true);
3085 /* If count_type_elements could not determine number of type elements
3086 for a constant-sized object, assume clearing is needed.
3087 Don't do this for variable-sized objects, as store_constructor
3088 will ignore the clearing of variable-sized objects. */
3089 if (num_type_elements < 0 && int_size_in_bytes (type) >= 0)
3091 /* If there are "lots" of zeros, then block clear the object first. */
3092 else if (num_type_elements - num_nonzero_elements > CLEAR_RATIO
3093 && num_nonzero_elements < num_type_elements/4)
3095 /* ??? This bit ought not be needed. For any element not present
3096 in the initializer, we should simply set them to zero. Except
3097 we'd need to *find* the elements that are not present, and that
3098 requires trickery to avoid quadratic compile-time behavior in
3099 large cases or excessive memory use in small cases. */
3100 else if (num_ctor_elements < num_type_elements)
3103 /* If there are "lots" of initialized elements, and all of them
3104 are valid address constants, then the entire initializer can
3105 be dropped to memory, and then memcpy'd out. Don't do this
3106 for sparse arrays, though, as it's more efficient to follow
3107 the standard CONSTRUCTOR behavior of memset followed by
3108 individual element initialization. */
3109 if (valid_const_initializer && !cleared)
3111 HOST_WIDE_INT size = int_size_in_bytes (type);
3114 /* ??? We can still get unbounded array types, at least
3115 from the C++ front end. This seems wrong, but attempt
3116 to work around it for now. */
3119 size = int_size_in_bytes (TREE_TYPE (object));
3121 TREE_TYPE (ctor) = type = TREE_TYPE (object);
3124 /* Find the maximum alignment we can assume for the object. */
3125 /* ??? Make use of DECL_OFFSET_ALIGN. */
3126 if (DECL_P (object))
3127 align = DECL_ALIGN (object);
3129 align = TYPE_ALIGN (type);
3131 if (size > 0 && !can_move_by_pieces (size, align))
3133 tree new = create_tmp_var_raw (type, "C");
3135 gimple_add_tmp_var (new);
3136 TREE_STATIC (new) = 1;
3137 TREE_READONLY (new) = 1;
3138 DECL_INITIAL (new) = ctor;
3139 if (align > DECL_ALIGN (new))
3141 DECL_ALIGN (new) = align;
3142 DECL_USER_ALIGN (new) = 1;
3144 walk_tree (&DECL_INITIAL (new), force_labels_r, NULL, NULL);
3146 GENERIC_TREE_OPERAND (*expr_p, 1) = new;
3148 /* This is no longer an assignment of a CONSTRUCTOR, but
3149 we still may have processing to do on the LHS. So
3150 pretend we didn't do anything here to let that happen. */
3151 return GS_UNHANDLED;
3155 /* If there are nonzero elements, pre-evaluate to capture elements
3156 overlapping with the lhs into temporaries. We must do this before
3157 clearing to fetch the values before they are zeroed-out. */
3158 if (num_nonzero_elements > 0)
3160 preeval_data.lhs_base_decl = get_base_address (object);
3161 if (!DECL_P (preeval_data.lhs_base_decl))
3162 preeval_data.lhs_base_decl = NULL;
3163 preeval_data.lhs_alias_set = get_alias_set (object);
3165 gimplify_init_ctor_preeval (&GENERIC_TREE_OPERAND (*expr_p, 1),
3166 pre_p, post_p, &preeval_data);
3171 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3172 Note that we still have to gimplify, in order to handle the
3173 case of variable sized types. Avoid shared tree structures. */
3174 CONSTRUCTOR_ELTS (ctor) = NULL;
3175 object = unshare_expr (object);
3176 gimplify_stmt (expr_p);
3177 append_to_statement_list (*expr_p, pre_p);
3180 /* If we have not block cleared the object, or if there are nonzero
3181 elements in the constructor, add assignments to the individual
3182 scalar fields of the object. */
3183 if (!cleared || num_nonzero_elements > 0)
3184 gimplify_init_ctor_eval (object, elts, pre_p, cleared);
3186 *expr_p = NULL_TREE;
3194 /* Extract the real and imaginary parts out of the ctor. */
3195 gcc_assert (VEC_length (constructor_elt, elts) == 2);
3196 r = VEC_index (constructor_elt, elts, 0)->value;
3197 i = VEC_index (constructor_elt, elts, 1)->value;
3198 if (r == NULL || i == NULL)
3200 tree zero = fold_convert (TREE_TYPE (type), integer_zero_node);
3207 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3208 represent creation of a complex value. */
3209 if (TREE_CONSTANT (r) && TREE_CONSTANT (i))
3211 ctor = build_complex (type, r, i);
3212 TREE_OPERAND (*expr_p, 1) = ctor;
3216 ctor = build2 (COMPLEX_EXPR, type, r, i);
3217 TREE_OPERAND (*expr_p, 1) = ctor;
3218 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
3219 rhs_predicate_for (TREE_OPERAND (*expr_p, 0)),
3227 unsigned HOST_WIDE_INT ix;
3228 constructor_elt *ce;
3230 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3231 if (TREE_CONSTANT (ctor))
3233 bool constant_p = true;
3236 /* Even when ctor is constant, it might contain non-*_CST
3237 elements (e.g. { 1.0/0.0 - 1.0/0.0, 0.0 }) and those don't
3238 belong into VECTOR_CST nodes. */
3239 FOR_EACH_CONSTRUCTOR_VALUE (elts, ix, value)
3240 if (!CONSTANT_CLASS_P (value))
3248 TREE_OPERAND (*expr_p, 1) = build_vector_from_ctor (type, elts);
3252 /* Don't reduce a TREE_CONSTANT vector ctor even if we can't
3253 make a VECTOR_CST. It won't do anything for us, and it'll
3254 prevent us from representing it as a single constant. */
3258 /* Vector types use CONSTRUCTOR all the way through gimple
3259 compilation as a general initializer. */
3260 for (ix = 0; VEC_iterate (constructor_elt, elts, ix, ce); ix++)
3262 enum gimplify_status tret;
3263 tret = gimplify_expr (&ce->value, pre_p, post_p,
3264 is_gimple_val, fb_rvalue);
3265 if (tret == GS_ERROR)
3268 if (!is_gimple_reg (GENERIC_TREE_OPERAND (*expr_p, 0)))
3269 GENERIC_TREE_OPERAND (*expr_p, 1) = get_formal_tmp_var (ctor, pre_p);
3274 /* So how did we get a CONSTRUCTOR for a scalar type? */
3278 if (ret == GS_ERROR)
3280 else if (want_value)
3282 append_to_statement_list (*expr_p, pre_p);
3290 /* Given a pointer value OP0, return a simplified version of an
3291 indirection through OP0, or NULL_TREE if no simplification is
3292 possible. This may only be applied to a rhs of an expression.
3293 Note that the resulting type may be different from the type pointed
3294 to in the sense that it is still compatible from the langhooks
3298 fold_indirect_ref_rhs (tree t)
3300 tree type = TREE_TYPE (TREE_TYPE (t));
3304 STRIP_USELESS_TYPE_CONVERSION (sub);
3305 subtype = TREE_TYPE (sub);
3306 if (!POINTER_TYPE_P (subtype))
3309 if (TREE_CODE (sub) == ADDR_EXPR)
3311 tree op = TREE_OPERAND (sub, 0);
3312 tree optype = TREE_TYPE (op);
3314 if (useless_type_conversion_p (type, optype))
3316 /* *(foo *)&fooarray => fooarray[0] */
3317 else if (TREE_CODE (optype) == ARRAY_TYPE
3318 && useless_type_conversion_p (type, TREE_TYPE (optype)))
3320 tree type_domain = TYPE_DOMAIN (optype);
3321 tree min_val = size_zero_node;
3322 if (type_domain && TYPE_MIN_VALUE (type_domain))
3323 min_val = TYPE_MIN_VALUE (type_domain);
3324 return build4 (ARRAY_REF, type, op, min_val, NULL_TREE, NULL_TREE);
3328 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
3329 if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
3330 && useless_type_conversion_p (type, TREE_TYPE (TREE_TYPE (subtype))))
3333 tree min_val = size_zero_node;
3335 sub = fold_indirect_ref_rhs (sub);
3337 sub = build1 (INDIRECT_REF, TREE_TYPE (subtype), osub);
3338 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
3339 if (type_domain && TYPE_MIN_VALUE (type_domain))
3340 min_val = TYPE_MIN_VALUE (type_domain);
3341 return build4 (ARRAY_REF, type, sub, min_val, NULL_TREE, NULL_TREE);
3347 /* Subroutine of gimplify_modify_expr to do simplifications of MODIFY_EXPRs
3348 based on the code of the RHS. We loop for as long as something changes. */
3350 static enum gimplify_status
3351 gimplify_modify_expr_rhs (tree *expr_p, tree *from_p, tree *to_p, tree *pre_p,
3352 tree *post_p, bool want_value)
3354 enum gimplify_status ret = GS_OK;
3356 while (ret != GS_UNHANDLED)
3357 switch (TREE_CODE (*from_p))
3361 /* If we have code like
3365 where the type of "x" is a (possibly cv-qualified variant
3366 of "A"), treat the entire expression as identical to "x".
3367 This kind of code arises in C++ when an object is bound
3368 to a const reference, and if "x" is a TARGET_EXPR we want
3369 to take advantage of the optimization below. */
3370 tree t = fold_indirect_ref_rhs (TREE_OPERAND (*from_p, 0));
3383 /* If we are initializing something from a TARGET_EXPR, strip the
3384 TARGET_EXPR and initialize it directly, if possible. This can't
3385 be done if the initializer is void, since that implies that the
3386 temporary is set in some non-trivial way.
3388 ??? What about code that pulls out the temp and uses it
3389 elsewhere? I think that such code never uses the TARGET_EXPR as
3390 an initializer. If I'm wrong, we'll die because the temp won't
3391 have any RTL. In that case, I guess we'll need to replace
3392 references somehow. */
3393 tree init = TARGET_EXPR_INITIAL (*from_p);
3395 if (!VOID_TYPE_P (TREE_TYPE (init)))
3406 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
3408 gimplify_compound_expr (from_p, pre_p, true);
3413 /* If we're initializing from a CONSTRUCTOR, break this into
3414 individual MODIFY_EXPRs. */
3415 return gimplify_init_constructor (expr_p, pre_p, post_p, want_value);
3418 /* If we're assigning to a non-register type, push the assignment
3419 down into the branches. This is mandatory for ADDRESSABLE types,
3420 since we cannot generate temporaries for such, but it saves a
3421 copy in other cases as well. */
3422 if (!is_gimple_reg_type (TREE_TYPE (*from_p)))
3424 /* This code should mirror the code in gimplify_cond_expr. */
3425 enum tree_code code = TREE_CODE (*expr_p);
3426 tree cond = *from_p;
3427 tree result = *to_p;
3429 ret = gimplify_expr (&result, pre_p, post_p,
3430 is_gimple_min_lval, fb_lvalue);
3431 if (ret != GS_ERROR)
3434 if (TREE_TYPE (TREE_OPERAND (cond, 1)) != void_type_node)
3435 TREE_OPERAND (cond, 1)
3436 = build2 (code, void_type_node, result,
3437 TREE_OPERAND (cond, 1));
3438 if (TREE_TYPE (TREE_OPERAND (cond, 2)) != void_type_node)
3439 TREE_OPERAND (cond, 2)
3440 = build2 (code, void_type_node, unshare_expr (result),
3441 TREE_OPERAND (cond, 2));
3443 TREE_TYPE (cond) = void_type_node;
3444 recalculate_side_effects (cond);
3448 gimplify_and_add (cond, pre_p);
3449 *expr_p = unshare_expr (result);
3460 /* For calls that return in memory, give *to_p as the CALL_EXPR's
3461 return slot so that we don't generate a temporary. */
3462 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p)
3463 && aggregate_value_p (*from_p, *from_p))
3467 if (!(rhs_predicate_for (*to_p))(*from_p))
3468 /* If we need a temporary, *to_p isn't accurate. */
3470 else if (TREE_CODE (*to_p) == RESULT_DECL
3471 && DECL_NAME (*to_p) == NULL_TREE
3472 && needs_to_live_in_memory (*to_p))
3473 /* It's OK to use the return slot directly unless it's an NRV. */
3475 else if (is_gimple_reg_type (TREE_TYPE (*to_p))
3476 || (DECL_P (*to_p) && DECL_REGISTER (*to_p)))
3477 /* Don't force regs into memory. */
3479 else if (TREE_CODE (*to_p) == VAR_DECL
3480 && DECL_GIMPLE_FORMAL_TEMP_P (*to_p))
3481 /* Don't use the original target if it's a formal temp; we
3482 don't want to take their addresses. */
3484 else if (TREE_CODE (*expr_p) == INIT_EXPR)
3485 /* It's OK to use the target directly if it's being
3488 else if (!is_gimple_non_addressable (*to_p))
3489 /* Don't use the original target if it's already addressable;
3490 if its address escapes, and the called function uses the
3491 NRV optimization, a conforming program could see *to_p
3492 change before the called function returns; see c++/19317.
3493 When optimizing, the return_slot pass marks more functions
3494 as safe after we have escape info. */
3501 CALL_EXPR_RETURN_SLOT_OPT (*from_p) = 1;
3502 mark_addressable (*to_p);
3509 /* If we're initializing from a container, push the initialization
3511 case CLEANUP_POINT_EXPR:
3513 case STATEMENT_LIST:
3515 tree wrap = *from_p;
3518 ret = gimplify_expr (to_p, pre_p, post_p,
3519 is_gimple_min_lval, fb_lvalue);
3520 if (ret != GS_ERROR)
3523 t = voidify_wrapper_expr (wrap, *expr_p);
3524 gcc_assert (t == *expr_p);
3528 gimplify_and_add (wrap, pre_p);
3529 *expr_p = unshare_expr (*to_p);
3544 /* Destructively convert the TREE pointer in TP into a gimple tuple if
3548 tree_to_gimple_tuple (tree *tp)
3551 switch (TREE_CODE (*tp))
3553 case GIMPLE_MODIFY_STMT:
3557 struct gimple_stmt *gs;
3558 tree lhs = TREE_OPERAND (*tp, 0);
3559 bool def_stmt_self_p = false;
3561 if (TREE_CODE (lhs) == SSA_NAME)
3563 if (SSA_NAME_DEF_STMT (lhs) == *tp)
3564 def_stmt_self_p = true;
3567 gs = &make_node (GIMPLE_MODIFY_STMT)->gstmt;
3568 gs->base = (*tp)->base;
3569 /* The set to base above overwrites the CODE. */
3570 TREE_SET_CODE ((tree) gs, GIMPLE_MODIFY_STMT);
3572 gs->locus = EXPR_LOCUS (*tp);
3573 gs->operands[0] = TREE_OPERAND (*tp, 0);
3574 gs->operands[1] = TREE_OPERAND (*tp, 1);
3575 gs->block = TREE_BLOCK (*tp);
3578 /* If we re-gimplify a set to an SSA_NAME, we must change the
3579 SSA name's DEF_STMT link. */
3580 if (def_stmt_self_p)
3581 SSA_NAME_DEF_STMT (GIMPLE_STMT_OPERAND (*tp, 0)) = *tp;
3590 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
3591 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
3592 DECL_GIMPLE_REG_P set. */
3594 static enum gimplify_status
3595 gimplify_modify_expr_complex_part (tree *expr_p, tree *pre_p, bool want_value)
3597 enum tree_code code, ocode;
3598 tree lhs, rhs, new_rhs, other, realpart, imagpart;
3600 lhs = GENERIC_TREE_OPERAND (*expr_p, 0);
3601 rhs = GENERIC_TREE_OPERAND (*expr_p, 1);
3602 code = TREE_CODE (lhs);
3603 lhs = TREE_OPERAND (lhs, 0);
3605 ocode = code == REALPART_EXPR ? IMAGPART_EXPR : REALPART_EXPR;
3606 other = build1 (ocode, TREE_TYPE (rhs), lhs);
3607 other = get_formal_tmp_var (other, pre_p);
3609 realpart = code == REALPART_EXPR ? rhs : other;
3610 imagpart = code == REALPART_EXPR ? other : rhs;
3612 if (TREE_CONSTANT (realpart) && TREE_CONSTANT (imagpart))
3613 new_rhs = build_complex (TREE_TYPE (lhs), realpart, imagpart);
3615 new_rhs = build2 (COMPLEX_EXPR, TREE_TYPE (lhs), realpart, imagpart);
3617 GENERIC_TREE_OPERAND (*expr_p, 0) = lhs;
3618 GENERIC_TREE_OPERAND (*expr_p, 1) = new_rhs;
3622 tree_to_gimple_tuple (expr_p);
3624 append_to_statement_list (*expr_p, pre_p);
3631 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
3637 PRE_P points to the list where side effects that must happen before
3638 *EXPR_P should be stored.
3640 POST_P points to the list where side effects that must happen after
3641 *EXPR_P should be stored.
3643 WANT_VALUE is nonzero iff we want to use the value of this expression
3644 in another expression. */
3646 static enum gimplify_status
3647 gimplify_modify_expr (tree *expr_p, tree *pre_p, tree *post_p, bool want_value)
3649 tree *from_p = &GENERIC_TREE_OPERAND (*expr_p, 1);
3650 tree *to_p = &GENERIC_TREE_OPERAND (*expr_p, 0);
3651 enum gimplify_status ret = GS_UNHANDLED;
3653 gcc_assert (TREE_CODE (*expr_p) == MODIFY_EXPR
3654 || TREE_CODE (*expr_p) == GIMPLE_MODIFY_STMT
3655 || TREE_CODE (*expr_p) == INIT_EXPR);
3657 /* For zero sized types only gimplify the left hand side and right hand side
3658 as statements and throw away the assignment. */
3659 if (zero_sized_type (TREE_TYPE (*from_p)))
3661 gimplify_stmt (from_p);
3662 gimplify_stmt (to_p);
3663 append_to_statement_list (*from_p, pre_p);
3664 append_to_statement_list (*to_p, pre_p);
3665 *expr_p = NULL_TREE;
3669 /* See if any simplifications can be done based on what the RHS is. */
3670 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
3672 if (ret != GS_UNHANDLED)
3675 /* If the value being copied is of variable width, compute the length
3676 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
3677 before gimplifying any of the operands so that we can resolve any
3678 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
3679 the size of the expression to be copied, not of the destination, so
3680 that is what we must here. */
3681 maybe_with_size_expr (from_p);
3683 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
3684 if (ret == GS_ERROR)
3687 ret = gimplify_expr (from_p, pre_p, post_p,
3688 rhs_predicate_for (*to_p), fb_rvalue);
3689 if (ret == GS_ERROR)
3692 /* Now see if the above changed *from_p to something we handle specially. */
3693 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
3695 if (ret != GS_UNHANDLED)
3698 /* If we've got a variable sized assignment between two lvalues (i.e. does
3699 not involve a call), then we can make things a bit more straightforward
3700 by converting the assignment to memcpy or memset. */
3701 if (TREE_CODE (*from_p) == WITH_SIZE_EXPR)
3703 tree from = TREE_OPERAND (*from_p, 0);
3704 tree size = TREE_OPERAND (*from_p, 1);
3706 if (TREE_CODE (from) == CONSTRUCTOR)
3707 return gimplify_modify_expr_to_memset (expr_p, size, want_value);
3708 if (is_gimple_addressable (from))
3711 return gimplify_modify_expr_to_memcpy (expr_p, size, want_value);
3715 /* Transform partial stores to non-addressable complex variables into
3716 total stores. This allows us to use real instead of virtual operands
3717 for these variables, which improves optimization. */
3718 if ((TREE_CODE (*to_p) == REALPART_EXPR
3719 || TREE_CODE (*to_p) == IMAGPART_EXPR)
3720 && is_gimple_reg (TREE_OPERAND (*to_p, 0)))
3721 return gimplify_modify_expr_complex_part (expr_p, pre_p, want_value);
3723 if (gimplify_ctxp->into_ssa && is_gimple_reg (*to_p))
3725 /* If we've somehow already got an SSA_NAME on the LHS, then
3726 we're probably modified it twice. Not good. */
3727 gcc_assert (TREE_CODE (*to_p) != SSA_NAME);
3728 *to_p = make_ssa_name (*to_p, *expr_p);
3731 /* Try to alleviate the effects of the gimplification creating artificial
3732 temporaries (see for example is_gimple_reg_rhs) on the debug info. */
3733 if (!gimplify_ctxp->into_ssa
3734 && DECL_P (*from_p) && DECL_IGNORED_P (*from_p)
3735 && DECL_P (*to_p) && !DECL_IGNORED_P (*to_p))
3737 if (!DECL_NAME (*from_p) && DECL_NAME (*to_p))
3739 = create_tmp_var_name (IDENTIFIER_POINTER (DECL_NAME (*to_p)));
3740 DECL_DEBUG_EXPR_IS_FROM (*from_p) = 1;
3741 SET_DECL_DEBUG_EXPR (*from_p, *to_p);
3746 tree_to_gimple_tuple (expr_p);
3748 append_to_statement_list (*expr_p, pre_p);
3756 /* Gimplify a comparison between two variable-sized objects. Do this
3757 with a call to BUILT_IN_MEMCMP. */
3759 static enum gimplify_status
3760 gimplify_variable_sized_compare (tree *expr_p)
3762 tree op0 = TREE_OPERAND (*expr_p, 0);
3763 tree op1 = TREE_OPERAND (*expr_p, 1);
3764 tree t, arg, dest, src;
3766 arg = TYPE_SIZE_UNIT (TREE_TYPE (op0));
3767 arg = unshare_expr (arg);
3768 arg = SUBSTITUTE_PLACEHOLDER_IN_EXPR (arg, op0);
3769 src = build_fold_addr_expr (op1);
3770 dest = build_fold_addr_expr (op0);
3771 t = implicit_built_in_decls[BUILT_IN_MEMCMP];
3772 t = build_call_expr (t, 3, dest, src, arg);
3774 = build2 (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), t, integer_zero_node);
3779 /* Gimplify a comparison between two aggregate objects of integral scalar
3780 mode as a comparison between the bitwise equivalent scalar values. */
3782 static enum gimplify_status
3783 gimplify_scalar_mode_aggregate_compare (tree *expr_p)
3785 tree op0 = TREE_OPERAND (*expr_p, 0);
3786 tree op1 = TREE_OPERAND (*expr_p, 1);
3788 tree type = TREE_TYPE (op0);
3789 tree scalar_type = lang_hooks.types.type_for_mode (TYPE_MODE (type), 1);
3791 op0 = fold_build1 (VIEW_CONVERT_EXPR, scalar_type, op0);
3792 op1 = fold_build1 (VIEW_CONVERT_EXPR, scalar_type, op1);
3795 = fold_build2 (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), op0, op1);
3800 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
3801 points to the expression to gimplify.
3803 Expressions of the form 'a && b' are gimplified to:
3805 a && b ? true : false
3807 gimplify_cond_expr will do the rest.
3809 PRE_P points to the list where side effects that must happen before
3810 *EXPR_P should be stored. */
3812 static enum gimplify_status
3813 gimplify_boolean_expr (tree *expr_p)
3815 /* Preserve the original type of the expression. */
3816 tree type = TREE_TYPE (*expr_p);
3818 *expr_p = build3 (COND_EXPR, type, *expr_p,
3819 fold_convert (type, boolean_true_node),
3820 fold_convert (type, boolean_false_node));
3825 /* Gimplifies an expression sequence. This function gimplifies each
3826 expression and re-writes the original expression with the last
3827 expression of the sequence in GIMPLE form.
3829 PRE_P points to the list where the side effects for all the
3830 expressions in the sequence will be emitted.
3832 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
3833 /* ??? Should rearrange to share the pre-queue with all the indirect
3834 invocations of gimplify_expr. Would probably save on creations
3835 of statement_list nodes. */
3837 static enum gimplify_status
3838 gimplify_compound_expr (tree *expr_p, tree *pre_p, bool want_value)
3844 tree *sub_p = &TREE_OPERAND (t, 0);
3846 if (TREE_CODE (*sub_p) == COMPOUND_EXPR)
3847 gimplify_compound_expr (sub_p, pre_p, false);
3849 gimplify_stmt (sub_p);
3850 append_to_statement_list (*sub_p, pre_p);
3852 t = TREE_OPERAND (t, 1);
3854 while (TREE_CODE (t) == COMPOUND_EXPR);
3861 gimplify_stmt (expr_p);
3866 /* Gimplifies a statement list. These may be created either by an
3867 enlightened front-end, or by shortcut_cond_expr. */
3869 static enum gimplify_status
3870 gimplify_statement_list (tree *expr_p, tree *pre_p)
3872 tree temp = voidify_wrapper_expr (*expr_p, NULL);
3874 tree_stmt_iterator i = tsi_start (*expr_p);
3876 while (!tsi_end_p (i))
3880 gimplify_stmt (tsi_stmt_ptr (i));
3885 else if (TREE_CODE (t) == STATEMENT_LIST)
3887 tsi_link_before (&i, t, TSI_SAME_STMT);
3896 append_to_statement_list (*expr_p, pre_p);
3904 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
3905 gimplify. After gimplification, EXPR_P will point to a new temporary
3906 that holds the original value of the SAVE_EXPR node.
3908 PRE_P points to the list where side effects that must happen before
3909 *EXPR_P should be stored. */
3911 static enum gimplify_status
3912 gimplify_save_expr (tree *expr_p, tree *pre_p, tree *post_p)
3914 enum gimplify_status ret = GS_ALL_DONE;
3917 gcc_assert (TREE_CODE (*expr_p) == SAVE_EXPR);
3918 val = TREE_OPERAND (*expr_p, 0);
3920 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
3921 if (!SAVE_EXPR_RESOLVED_P (*expr_p))
3923 /* The operand may be a void-valued expression such as SAVE_EXPRs
3924 generated by the Java frontend for class initialization. It is
3925 being executed only for its side-effects. */
3926 if (TREE_TYPE (val) == void_type_node)
3928 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3929 is_gimple_stmt, fb_none);
3930 append_to_statement_list (TREE_OPERAND (*expr_p, 0), pre_p);
3934 val = get_initialized_tmp_var (val, pre_p, post_p);
3936 TREE_OPERAND (*expr_p, 0) = val;
3937 SAVE_EXPR_RESOLVED_P (*expr_p) = 1;
3945 /* Re-write the ADDR_EXPR node pointed to by EXPR_P
3952 PRE_P points to the list where side effects that must happen before
3953 *EXPR_P should be stored.
3955 POST_P points to the list where side effects that must happen after
3956 *EXPR_P should be stored. */
3958 static enum gimplify_status
3959 gimplify_addr_expr (tree *expr_p, tree *pre_p, tree *post_p)
3961 tree expr = *expr_p;
3962 tree op0 = TREE_OPERAND (expr, 0);
3963 enum gimplify_status ret;
3965 switch (TREE_CODE (op0))
3968 case MISALIGNED_INDIRECT_REF:
3970 /* Check if we are dealing with an expression of the form '&*ptr'.
3971 While the front end folds away '&*ptr' into 'ptr', these
3972 expressions may be generated internally by the compiler (e.g.,
3973 builtins like __builtin_va_end). */
3974 /* Caution: the silent array decomposition semantics we allow for
3975 ADDR_EXPR means we can't always discard the pair. */
3976 /* Gimplification of the ADDR_EXPR operand may drop
3977 cv-qualification conversions, so make sure we add them if
3980 tree op00 = TREE_OPERAND (op0, 0);
3981 tree t_expr = TREE_TYPE (expr);
3982 tree t_op00 = TREE_TYPE (op00);
3984 if (!useless_type_conversion_p (t_expr, t_op00))
3985 op00 = fold_convert (TREE_TYPE (expr), op00);
3991 case VIEW_CONVERT_EXPR:
3992 /* Take the address of our operand and then convert it to the type of
3995 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
3996 all clear. The impact of this transformation is even less clear. */
3998 /* If the operand is a useless conversion, look through it. Doing so
3999 guarantees that the ADDR_EXPR and its operand will remain of the
4001 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0, 0)))
4002 op0 = TREE_OPERAND (op0, 0);
4004 *expr_p = fold_convert (TREE_TYPE (expr),
4005 build_fold_addr_expr (TREE_OPERAND (op0, 0)));
4010 /* We use fb_either here because the C frontend sometimes takes
4011 the address of a call that returns a struct; see
4012 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
4013 the implied temporary explicit. */
4015 /* Mark the RHS addressable. */
4016 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, post_p,
4017 is_gimple_addressable, fb_either);
4018 if (ret != GS_ERROR)
4020 op0 = TREE_OPERAND (expr, 0);
4022 /* For various reasons, the gimplification of the expression
4023 may have made a new INDIRECT_REF. */
4024 if (TREE_CODE (op0) == INDIRECT_REF)
4025 goto do_indirect_ref;
4027 /* Make sure TREE_INVARIANT, TREE_CONSTANT, and TREE_SIDE_EFFECTS
4029 recompute_tree_invariant_for_addr_expr (expr);
4031 mark_addressable (TREE_OPERAND (expr, 0));
4039 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
4040 value; output operands should be a gimple lvalue. */
4042 static enum gimplify_status
4043 gimplify_asm_expr (tree *expr_p, tree *pre_p, tree *post_p)
4045 tree expr = *expr_p;
4046 int noutputs = list_length (ASM_OUTPUTS (expr));
4047 const char **oconstraints
4048 = (const char **) alloca ((noutputs) * sizeof (const char *));
4051 const char *constraint;
4052 bool allows_mem, allows_reg, is_inout;
4053 enum gimplify_status ret, tret;
4056 for (i = 0, link = ASM_OUTPUTS (expr); link; ++i, link = TREE_CHAIN (link))
4058 size_t constraint_len;
4059 oconstraints[i] = constraint
4060 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4061 constraint_len = strlen (constraint);
4062 if (constraint_len == 0)
4065 parse_output_constraint (&constraint, i, 0, 0,
4066 &allows_mem, &allows_reg, &is_inout);
4068 if (!allows_reg && allows_mem)
4069 mark_addressable (TREE_VALUE (link));
4071 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4072 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
4073 fb_lvalue | fb_mayfail);
4074 if (tret == GS_ERROR)
4076 error ("invalid lvalue in asm output %d", i);
4082 /* An input/output operand. To give the optimizers more
4083 flexibility, split it into separate input and output
4088 /* Turn the in/out constraint into an output constraint. */
4089 char *p = xstrdup (constraint);
4091 TREE_VALUE (TREE_PURPOSE (link)) = build_string (constraint_len, p);
4093 /* And add a matching input constraint. */
4096 sprintf (buf, "%d", i);
4098 /* If there are multiple alternatives in the constraint,
4099 handle each of them individually. Those that allow register
4100 will be replaced with operand number, the others will stay
4102 if (strchr (p, ',') != NULL)
4104 size_t len = 0, buflen = strlen (buf);
4105 char *beg, *end, *str, *dst;
4109 end = strchr (beg, ',');
4111 end = strchr (beg, '\0');
4112 if ((size_t) (end - beg) < buflen)
4115 len += end - beg + 1;
4122 str = (char *) alloca (len);
4123 for (beg = p + 1, dst = str;;)
4126 bool mem_p, reg_p, inout_p;
4128 end = strchr (beg, ',');
4133 parse_output_constraint (&tem, i, 0, 0,
4134 &mem_p, ®_p, &inout_p);
4139 memcpy (dst, buf, buflen);
4148 memcpy (dst, beg, len);
4157 input = build_string (dst - str, str);
4160 input = build_string (strlen (buf), buf);
4163 input = build_string (constraint_len - 1, constraint + 1);
4167 input = build_tree_list (build_tree_list (NULL_TREE, input),
4168 unshare_expr (TREE_VALUE (link)));
4169 ASM_INPUTS (expr) = chainon (ASM_INPUTS (expr), input);
4173 for (link = ASM_INPUTS (expr); link; ++i, link = TREE_CHAIN (link))
4176 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4177 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
4178 oconstraints, &allows_mem, &allows_reg);
4180 /* If we can't make copies, we can only accept memory. */
4181 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (link))))
4187 error ("impossible constraint in %<asm%>");
4188 error ("non-memory input %d must stay in memory", i);
4193 /* If the operand is a memory input, it should be an lvalue. */
4194 if (!allows_reg && allows_mem)
4196 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4197 is_gimple_lvalue, fb_lvalue | fb_mayfail);
4198 mark_addressable (TREE_VALUE (link));
4199 if (tret == GS_ERROR)
4201 error ("memory input %d is not directly addressable", i);
4207 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
4208 is_gimple_asm_val, fb_rvalue);
4209 if (tret == GS_ERROR)
4217 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
4218 WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
4219 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
4220 return to this function.
4222 FIXME should we complexify the prequeue handling instead? Or use flags
4223 for all the cleanups and let the optimizer tighten them up? The current
4224 code seems pretty fragile; it will break on a cleanup within any
4225 non-conditional nesting. But any such nesting would be broken, anyway;
4226 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
4227 and continues out of it. We can do that at the RTL level, though, so
4228 having an optimizer to tighten up try/finally regions would be a Good
4231 static enum gimplify_status
4232 gimplify_cleanup_point_expr (tree *expr_p, tree *pre_p)
4234 tree_stmt_iterator iter;
4237 tree temp = voidify_wrapper_expr (*expr_p, NULL);
4239 /* We only care about the number of conditions between the innermost
4240 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
4241 any cleanups collected outside the CLEANUP_POINT_EXPR. */
4242 int old_conds = gimplify_ctxp->conditions;
4243 tree old_cleanups = gimplify_ctxp->conditional_cleanups;
4244 gimplify_ctxp->conditions = 0;
4245 gimplify_ctxp->conditional_cleanups = NULL_TREE;
4247 body = TREE_OPERAND (*expr_p, 0);
4248 gimplify_to_stmt_list (&body);
4250 gimplify_ctxp->conditions = old_conds;
4251 gimplify_ctxp->conditional_cleanups = old_cleanups;
4253 for (iter = tsi_start (body); !tsi_end_p (iter); )
4255 tree *wce_p = tsi_stmt_ptr (iter);
4258 if (TREE_CODE (wce) == WITH_CLEANUP_EXPR)
4260 if (tsi_one_before_end_p (iter))
4262 tsi_link_before (&iter, TREE_OPERAND (wce, 0), TSI_SAME_STMT);
4269 enum tree_code code;
4271 if (CLEANUP_EH_ONLY (wce))
4272 code = TRY_CATCH_EXPR;
4274 code = TRY_FINALLY_EXPR;
4276 sl = tsi_split_statement_list_after (&iter);
4277 tfe = build2 (code, void_type_node, sl, NULL_TREE);
4278 append_to_statement_list (TREE_OPERAND (wce, 0),
4279 &TREE_OPERAND (tfe, 1));
4281 iter = tsi_start (sl);
4291 append_to_statement_list (body, pre_p);
4301 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
4302 is the cleanup action required. */
4305 gimple_push_cleanup (tree var, tree cleanup, bool eh_only, tree *pre_p)
4309 /* Errors can result in improperly nested cleanups. Which results in
4310 confusion when trying to resolve the WITH_CLEANUP_EXPR. */
4311 if (errorcount || sorrycount)
4314 if (gimple_conditional_context ())
4316 /* If we're in a conditional context, this is more complex. We only
4317 want to run the cleanup if we actually ran the initialization that
4318 necessitates it, but we want to run it after the end of the
4319 conditional context. So we wrap the try/finally around the
4320 condition and use a flag to determine whether or not to actually
4321 run the destructor. Thus
4325 becomes (approximately)
4329 if (test) { A::A(temp); flag = 1; val = f(temp); }
4332 if (flag) A::~A(temp);
4337 tree flag = create_tmp_var (boolean_type_node, "cleanup");
4338 tree ffalse = build_gimple_modify_stmt (flag, boolean_false_node);
4339 tree ftrue = build_gimple_modify_stmt (flag, boolean_true_node);
4340 cleanup = build3 (COND_EXPR, void_type_node, flag, cleanup, NULL);
4341 wce = build1 (WITH_CLEANUP_EXPR, void_type_node, cleanup);
4342 append_to_statement_list (ffalse, &gimplify_ctxp->conditional_cleanups);
4343 append_to_statement_list (wce, &gimplify_ctxp->conditional_cleanups);
4344 append_to_statement_list (ftrue, pre_p);
4346 /* Because of this manipulation, and the EH edges that jump
4347 threading cannot redirect, the temporary (VAR) will appear
4348 to be used uninitialized. Don't warn. */
4349 TREE_NO_WARNING (var) = 1;
4353 wce = build1 (WITH_CLEANUP_EXPR, void_type_node, cleanup);
4354 CLEANUP_EH_ONLY (wce) = eh_only;
4355 append_to_statement_list (wce, pre_p);
4358 gimplify_stmt (&TREE_OPERAND (wce, 0));
4361 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
4363 static enum gimplify_status
4364 gimplify_target_expr (tree *expr_p, tree *pre_p, tree *post_p)
4366 tree targ = *expr_p;
4367 tree temp = TARGET_EXPR_SLOT (targ);
4368 tree init = TARGET_EXPR_INITIAL (targ);
4369 enum gimplify_status ret;
4373 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
4374 to the temps list. */
4375 gimple_add_tmp_var (temp);
4377 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
4378 expression is supposed to initialize the slot. */
4379 if (VOID_TYPE_P (TREE_TYPE (init)))
4380 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
4383 init = build2 (INIT_EXPR, void_type_node, temp, init);
4384 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt,
4387 if (ret == GS_ERROR)
4389 /* PR c++/28266 Make sure this is expanded only once. */
4390 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
4393 append_to_statement_list (init, pre_p);
4395 /* If needed, push the cleanup for the temp. */
4396 if (TARGET_EXPR_CLEANUP (targ))
4398 gimplify_stmt (&TARGET_EXPR_CLEANUP (targ));
4399 gimple_push_cleanup (temp, TARGET_EXPR_CLEANUP (targ),
4400 CLEANUP_EH_ONLY (targ), pre_p);
4403 /* Only expand this once. */
4404 TREE_OPERAND (targ, 3) = init;
4405 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
4408 /* We should have expanded this before. */
4409 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp));
4415 /* Gimplification of expression trees. */
4417 /* Gimplify an expression which appears at statement context; usually, this
4418 means replacing it with a suitably gimple STATEMENT_LIST. */
4421 gimplify_stmt (tree *stmt_p)
4423 gimplify_expr (stmt_p, NULL, NULL, is_gimple_stmt, fb_none);
4426 /* Similarly, but force the result to be a STATEMENT_LIST. */
4429 gimplify_to_stmt_list (tree *stmt_p)
4431 gimplify_stmt (stmt_p);
4433 *stmt_p = alloc_stmt_list ();
4434 else if (TREE_CODE (*stmt_p) != STATEMENT_LIST)
4437 *stmt_p = alloc_stmt_list ();
4438 append_to_statement_list (t, stmt_p);
4443 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
4444 to CTX. If entries already exist, force them to be some flavor of private.
4445 If there is no enclosing parallel, do nothing. */
4448 omp_firstprivatize_variable (struct gimplify_omp_ctx *ctx, tree decl)
4452 if (decl == NULL || !DECL_P (decl))
4457 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4460 if (n->value & GOVD_SHARED)
4461 n->value = GOVD_FIRSTPRIVATE | (n->value & GOVD_SEEN);
4465 else if (ctx->is_parallel)
4466 omp_add_variable (ctx, decl, GOVD_FIRSTPRIVATE);
4468 ctx = ctx->outer_context;
4473 /* Similarly for each of the type sizes of TYPE. */
4476 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx *ctx, tree type)
4478 if (type == NULL || type == error_mark_node)
4480 type = TYPE_MAIN_VARIANT (type);
4482 if (pointer_set_insert (ctx->privatized_types, type))
4485 switch (TREE_CODE (type))
4491 case FIXED_POINT_TYPE:
4492 omp_firstprivatize_variable (ctx, TYPE_MIN_VALUE (type));
4493 omp_firstprivatize_variable (ctx, TYPE_MAX_VALUE (type));
4497 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
4498 omp_firstprivatize_type_sizes (ctx, TYPE_DOMAIN (type));
4503 case QUAL_UNION_TYPE:
4506 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
4507 if (TREE_CODE (field) == FIELD_DECL)
4509 omp_firstprivatize_variable (ctx, DECL_FIELD_OFFSET (field));
4510 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (field));
4516 case REFERENCE_TYPE:
4517 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
4524 omp_firstprivatize_variable (ctx, TYPE_SIZE (type));
4525 omp_firstprivatize_variable (ctx, TYPE_SIZE_UNIT (type));
4526 lang_hooks.types.omp_firstprivatize_type_sizes (ctx, type);
4529 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
4532 omp_add_variable (struct gimplify_omp_ctx *ctx, tree decl, unsigned int flags)
4535 unsigned int nflags;
4538 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
4541 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
4542 there are constructors involved somewhere. */
4543 if (TREE_ADDRESSABLE (TREE_TYPE (decl))
4544 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
4547 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4550 /* We shouldn't be re-adding the decl with the same data
4552 gcc_assert ((n->value & GOVD_DATA_SHARE_CLASS & flags) == 0);
4553 /* The only combination of data sharing classes we should see is
4554 FIRSTPRIVATE and LASTPRIVATE. */
4555 nflags = n->value | flags;
4556 gcc_assert ((nflags & GOVD_DATA_SHARE_CLASS)
4557 == (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE));
4562 /* When adding a variable-sized variable, we have to handle all sorts
4563 of additional bits of data: the pointer replacement variable, and
4564 the parameters of the type. */
4565 if (DECL_SIZE (decl) && TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
4567 /* Add the pointer replacement variable as PRIVATE if the variable
4568 replacement is private, else FIRSTPRIVATE since we'll need the
4569 address of the original variable either for SHARED, or for the
4570 copy into or out of the context. */
4571 if (!(flags & GOVD_LOCAL))
4573 nflags = flags & GOVD_PRIVATE ? GOVD_PRIVATE : GOVD_FIRSTPRIVATE;
4574 nflags |= flags & GOVD_SEEN;
4575 t = DECL_VALUE_EXPR (decl);
4576 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
4577 t = TREE_OPERAND (t, 0);
4578 gcc_assert (DECL_P (t));
4579 omp_add_variable (ctx, t, nflags);
4582 /* Add all of the variable and type parameters (which should have
4583 been gimplified to a formal temporary) as FIRSTPRIVATE. */
4584 omp_firstprivatize_variable (ctx, DECL_SIZE_UNIT (decl));
4585 omp_firstprivatize_variable (ctx, DECL_SIZE (decl));
4586 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
4588 /* The variable-sized variable itself is never SHARED, only some form
4589 of PRIVATE. The sharing would take place via the pointer variable
4590 which we remapped above. */
4591 if (flags & GOVD_SHARED)
4592 flags = GOVD_PRIVATE | GOVD_DEBUG_PRIVATE
4593 | (flags & (GOVD_SEEN | GOVD_EXPLICIT));
4595 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
4596 alloca statement we generate for the variable, so make sure it
4597 is available. This isn't automatically needed for the SHARED
4598 case, since we won't be allocating local storage then.
4599 For local variables TYPE_SIZE_UNIT might not be gimplified yet,
4600 in this case omp_notice_variable will be called later
4601 on when it is gimplified. */
4602 else if (! (flags & GOVD_LOCAL))
4603 omp_notice_variable (ctx, TYPE_SIZE_UNIT (TREE_TYPE (decl)), true);
4605 else if (lang_hooks.decls.omp_privatize_by_reference (decl))
4607 gcc_assert ((flags & GOVD_LOCAL) == 0);
4608 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
4610 /* Similar to the direct variable sized case above, we'll need the
4611 size of references being privatized. */
4612 if ((flags & GOVD_SHARED) == 0)
4614 t = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl)));
4615 if (TREE_CODE (t) != INTEGER_CST)
4616 omp_notice_variable (ctx, t, true);
4620 splay_tree_insert (ctx->variables, (splay_tree_key)decl, flags);
4623 /* Record the fact that DECL was used within the OpenMP context CTX.
4624 IN_CODE is true when real code uses DECL, and false when we should
4625 merely emit default(none) errors. Return true if DECL is going to
4626 be remapped and thus DECL shouldn't be gimplified into its
4627 DECL_VALUE_EXPR (if any). */
4630 omp_notice_variable (struct gimplify_omp_ctx *ctx, tree decl, bool in_code)
4633 unsigned flags = in_code ? GOVD_SEEN : 0;
4634 bool ret = false, shared;
4636 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
4639 /* Threadprivate variables are predetermined. */
4640 if (is_global_var (decl))
4642 if (DECL_THREAD_LOCAL_P (decl))
4645 if (DECL_HAS_VALUE_EXPR_P (decl))
4647 tree value = get_base_address (DECL_VALUE_EXPR (decl));
4649 if (value && DECL_P (value) && DECL_THREAD_LOCAL_P (value))
4654 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4657 enum omp_clause_default_kind default_kind, kind;
4659 if (!ctx->is_parallel)
4662 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
4663 remapped firstprivate instead of shared. To some extent this is
4664 addressed in omp_firstprivatize_type_sizes, but not effectively. */
4665 default_kind = ctx->default_kind;
4666 kind = lang_hooks.decls.omp_predetermined_sharing (decl);
4667 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
4668 default_kind = kind;
4670 switch (default_kind)
4672 case OMP_CLAUSE_DEFAULT_NONE:
4673 error ("%qs not specified in enclosing parallel",
4674 IDENTIFIER_POINTER (DECL_NAME (decl)));
4675 error ("%Henclosing parallel", &ctx->location);
4677 case OMP_CLAUSE_DEFAULT_SHARED:
4678 flags |= GOVD_SHARED;
4680 case OMP_CLAUSE_DEFAULT_PRIVATE:
4681 flags |= GOVD_PRIVATE;
4687 omp_add_variable (ctx, decl, flags);
4689 shared = (flags & GOVD_SHARED) != 0;
4690 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
4694 shared = ((flags | n->value) & GOVD_SHARED) != 0;
4695 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
4697 /* If nothing changed, there's nothing left to do. */
4698 if ((n->value & flags) == flags)
4704 /* If the variable is private in the current context, then we don't
4705 need to propagate anything to an outer context. */
4706 if (flags & GOVD_PRIVATE)
4708 if (ctx->outer_context
4709 && omp_notice_variable (ctx->outer_context, decl, in_code))
4714 /* Verify that DECL is private within CTX. If there's specific information
4715 to the contrary in the innermost scope, generate an error. */
4718 omp_is_private (struct gimplify_omp_ctx *ctx, tree decl)
4722 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4725 if (n->value & GOVD_SHARED)
4727 if (ctx == gimplify_omp_ctxp)
4729 error ("iteration variable %qs should be private",
4730 IDENTIFIER_POINTER (DECL_NAME (decl)));
4731 n->value = GOVD_PRIVATE;
4737 else if ((n->value & GOVD_EXPLICIT) != 0
4738 && (ctx == gimplify_omp_ctxp
4739 || (ctx->is_combined_parallel
4740 && gimplify_omp_ctxp->outer_context == ctx)))
4742 if ((n->value & GOVD_FIRSTPRIVATE) != 0)
4743 error ("iteration variable %qs should not be firstprivate",
4744 IDENTIFIER_POINTER (DECL_NAME (decl)));
4745 else if ((n->value & GOVD_REDUCTION) != 0)
4746 error ("iteration variable %qs should not be reduction",
4747 IDENTIFIER_POINTER (DECL_NAME (decl)));
4752 if (ctx->is_parallel)
4754 else if (ctx->outer_context)
4755 return omp_is_private (ctx->outer_context, decl);
4757 return !is_global_var (decl);
4760 /* Return true if DECL is private within a parallel region
4761 that binds to the current construct's context or in parallel
4762 region's REDUCTION clause. */
4765 omp_check_private (struct gimplify_omp_ctx *ctx, tree decl)
4771 ctx = ctx->outer_context;
4773 return !(is_global_var (decl)
4774 /* References might be private, but might be shared too. */
4775 || lang_hooks.decls.omp_privatize_by_reference (decl));
4777 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
4779 return (n->value & GOVD_SHARED) == 0;
4781 while (!ctx->is_parallel);
4785 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
4786 and previous omp contexts. */
4789 gimplify_scan_omp_clauses (tree *list_p, tree *pre_p, bool in_parallel,
4790 bool in_combined_parallel)
4792 struct gimplify_omp_ctx *ctx, *outer_ctx;
4795 ctx = new_omp_context (in_parallel, in_combined_parallel);
4796 outer_ctx = ctx->outer_context;
4798 while ((c = *list_p) != NULL)
4800 enum gimplify_status gs;
4801 bool remove = false;
4802 bool notice_outer = true;
4803 const char *check_non_private = NULL;
4807 switch (OMP_CLAUSE_CODE (c))
4809 case OMP_CLAUSE_PRIVATE:
4810 flags = GOVD_PRIVATE | GOVD_EXPLICIT;
4811 notice_outer = false;
4813 case OMP_CLAUSE_SHARED:
4814 flags = GOVD_SHARED | GOVD_EXPLICIT;
4816 case OMP_CLAUSE_FIRSTPRIVATE:
4817 flags = GOVD_FIRSTPRIVATE | GOVD_EXPLICIT;
4818 check_non_private = "firstprivate";
4820 case OMP_CLAUSE_LASTPRIVATE:
4821 flags = GOVD_LASTPRIVATE | GOVD_SEEN | GOVD_EXPLICIT;
4822 check_non_private = "lastprivate";
4824 case OMP_CLAUSE_REDUCTION:
4825 flags = GOVD_REDUCTION | GOVD_SEEN | GOVD_EXPLICIT;
4826 check_non_private = "reduction";
4830 decl = OMP_CLAUSE_DECL (c);
4831 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
4836 omp_add_variable (ctx, decl, flags);
4837 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION
4838 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c))
4840 omp_add_variable (ctx, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c),
4841 GOVD_LOCAL | GOVD_SEEN);
4842 gimplify_omp_ctxp = ctx;
4843 push_gimplify_context ();
4844 gimplify_stmt (&OMP_CLAUSE_REDUCTION_INIT (c));
4845 pop_gimplify_context (OMP_CLAUSE_REDUCTION_INIT (c));
4846 push_gimplify_context ();
4847 gimplify_stmt (&OMP_CLAUSE_REDUCTION_MERGE (c));
4848 pop_gimplify_context (OMP_CLAUSE_REDUCTION_MERGE (c));
4849 gimplify_omp_ctxp = outer_ctx;
4855 case OMP_CLAUSE_COPYIN:
4856 case OMP_CLAUSE_COPYPRIVATE:
4857 decl = OMP_CLAUSE_DECL (c);
4858 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
4865 omp_notice_variable (outer_ctx, decl, true);
4866 if (check_non_private
4868 && omp_check_private (ctx, decl))
4870 error ("%s variable %qs is private in outer context",
4871 check_non_private, IDENTIFIER_POINTER (DECL_NAME (decl)));
4877 OMP_CLAUSE_OPERAND (c, 0)
4878 = gimple_boolify (OMP_CLAUSE_OPERAND (c, 0));
4881 case OMP_CLAUSE_SCHEDULE:
4882 case OMP_CLAUSE_NUM_THREADS:
4883 gs = gimplify_expr (&OMP_CLAUSE_OPERAND (c, 0), pre_p, NULL,
4884 is_gimple_val, fb_rvalue);
4889 case OMP_CLAUSE_NOWAIT:
4890 case OMP_CLAUSE_ORDERED:
4893 case OMP_CLAUSE_DEFAULT:
4894 ctx->default_kind = OMP_CLAUSE_DEFAULT_KIND (c);
4902 *list_p = OMP_CLAUSE_CHAIN (c);
4904 list_p = &OMP_CLAUSE_CHAIN (c);
4907 gimplify_omp_ctxp = ctx;
4910 /* For all variables that were not actually used within the context,
4911 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
4914 gimplify_adjust_omp_clauses_1 (splay_tree_node n, void *data)
4916 tree *list_p = (tree *) data;
4917 tree decl = (tree) n->key;
4918 unsigned flags = n->value;
4919 enum omp_clause_code code;
4923 if (flags & (GOVD_EXPLICIT | GOVD_LOCAL))
4925 if ((flags & GOVD_SEEN) == 0)
4927 if (flags & GOVD_DEBUG_PRIVATE)
4929 gcc_assert ((flags & GOVD_DATA_SHARE_CLASS) == GOVD_PRIVATE);
4930 private_debug = true;
4934 = lang_hooks.decls.omp_private_debug_clause (decl,
4935 !!(flags & GOVD_SHARED));
4937 code = OMP_CLAUSE_PRIVATE;
4938 else if (flags & GOVD_SHARED)
4940 if (is_global_var (decl))
4942 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp->outer_context;
4946 = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
4947 if (on && (on->value & (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE
4948 | GOVD_PRIVATE | GOVD_REDUCTION)) != 0)
4950 ctx = ctx->outer_context;
4955 code = OMP_CLAUSE_SHARED;
4957 else if (flags & GOVD_PRIVATE)
4958 code = OMP_CLAUSE_PRIVATE;
4959 else if (flags & GOVD_FIRSTPRIVATE)
4960 code = OMP_CLAUSE_FIRSTPRIVATE;
4964 clause = build_omp_clause (code);
4965 OMP_CLAUSE_DECL (clause) = decl;
4966 OMP_CLAUSE_CHAIN (clause) = *list_p;
4968 OMP_CLAUSE_PRIVATE_DEBUG (clause) = 1;
4975 gimplify_adjust_omp_clauses (tree *list_p)
4977 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
4980 while ((c = *list_p) != NULL)
4983 bool remove = false;
4985 switch (OMP_CLAUSE_CODE (c))
4987 case OMP_CLAUSE_PRIVATE:
4988 case OMP_CLAUSE_SHARED:
4989 case OMP_CLAUSE_FIRSTPRIVATE:
4990 decl = OMP_CLAUSE_DECL (c);
4991 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
4992 remove = !(n->value & GOVD_SEEN);
4995 bool shared = OMP_CLAUSE_CODE (c) == OMP_CLAUSE_SHARED;
4996 if ((n->value & GOVD_DEBUG_PRIVATE)
4997 || lang_hooks.decls.omp_private_debug_clause (decl, shared))
4999 gcc_assert ((n->value & GOVD_DEBUG_PRIVATE) == 0
5000 || ((n->value & GOVD_DATA_SHARE_CLASS)
5002 OMP_CLAUSE_SET_CODE (c, OMP_CLAUSE_PRIVATE);
5003 OMP_CLAUSE_PRIVATE_DEBUG (c) = 1;
5008 case OMP_CLAUSE_LASTPRIVATE:
5009 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
5010 accurately reflect the presence of a FIRSTPRIVATE clause. */
5011 decl = OMP_CLAUSE_DECL (c);
5012 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
5013 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)
5014 = (n->value & GOVD_FIRSTPRIVATE) != 0;
5017 case OMP_CLAUSE_REDUCTION:
5018 case OMP_CLAUSE_COPYIN:
5019 case OMP_CLAUSE_COPYPRIVATE:
5021 case OMP_CLAUSE_NUM_THREADS:
5022 case OMP_CLAUSE_SCHEDULE:
5023 case OMP_CLAUSE_NOWAIT:
5024 case OMP_CLAUSE_ORDERED:
5025 case OMP_CLAUSE_DEFAULT:
5033 *list_p = OMP_CLAUSE_CHAIN (c);
5035 list_p = &OMP_CLAUSE_CHAIN (c);
5038 /* Add in any implicit data sharing. */
5039 splay_tree_foreach (ctx->variables, gimplify_adjust_omp_clauses_1, list_p);
5041 gimplify_omp_ctxp = ctx->outer_context;
5042 delete_omp_context (ctx);
5045 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
5046 gimplification of the body, as well as scanning the body for used
5047 variables. We need to do this scan now, because variable-sized
5048 decls will be decomposed during gimplification. */
5050 static enum gimplify_status
5051 gimplify_omp_parallel (tree *expr_p, tree *pre_p)
5053 tree expr = *expr_p;
5055 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr), pre_p, true,
5056 OMP_PARALLEL_COMBINED (expr));
5058 push_gimplify_context ();
5060 gimplify_stmt (&OMP_PARALLEL_BODY (expr));
5062 if (TREE_CODE (OMP_PARALLEL_BODY (expr)) == BIND_EXPR)
5063 pop_gimplify_context (OMP_PARALLEL_BODY (expr));
5065 pop_gimplify_context (NULL_TREE);
5067 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr));
5072 /* Gimplify the gross structure of an OMP_FOR statement. */
5074 static enum gimplify_status
5075 gimplify_omp_for (tree *expr_p, tree *pre_p)
5077 tree for_stmt, decl, t;
5078 enum gimplify_status ret = GS_OK;
5082 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt), pre_p, false, false);
5084 t = OMP_FOR_INIT (for_stmt);
5085 gcc_assert (TREE_CODE (t) == MODIFY_EXPR
5086 || TREE_CODE (t) == GIMPLE_MODIFY_STMT);
5087 decl = GENERIC_TREE_OPERAND (t, 0);
5088 gcc_assert (DECL_P (decl));
5089 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl)));
5091 /* Make sure the iteration variable is private. */
5092 if (omp_is_private (gimplify_omp_ctxp, decl))
5093 omp_notice_variable (gimplify_omp_ctxp, decl, true);
5095 omp_add_variable (gimplify_omp_ctxp, decl, GOVD_PRIVATE | GOVD_SEEN);
5097 ret |= gimplify_expr (&GENERIC_TREE_OPERAND (t, 1),
5098 &OMP_FOR_PRE_BODY (for_stmt),
5099 NULL, is_gimple_val, fb_rvalue);
5101 tree_to_gimple_tuple (&OMP_FOR_INIT (for_stmt));
5103 t = OMP_FOR_COND (for_stmt);
5104 gcc_assert (COMPARISON_CLASS_P (t));
5105 gcc_assert (GENERIC_TREE_OPERAND (t, 0) == decl);
5107 ret |= gimplify_expr (&GENERIC_TREE_OPERAND (t, 1),
5108 &OMP_FOR_PRE_BODY (for_stmt),
5109 NULL, is_gimple_val, fb_rvalue);
5111 tree_to_gimple_tuple (&OMP_FOR_INCR (for_stmt));
5112 t = OMP_FOR_INCR (for_stmt);
5113 switch (TREE_CODE (t))
5115 case PREINCREMENT_EXPR:
5116 case POSTINCREMENT_EXPR:
5117 t = build_int_cst (TREE_TYPE (decl), 1);
5118 t = build2 (PLUS_EXPR, TREE_TYPE (decl), decl, t);
5119 t = build_gimple_modify_stmt (decl, t);
5120 OMP_FOR_INCR (for_stmt) = t;
5123 case PREDECREMENT_EXPR:
5124 case POSTDECREMENT_EXPR:
5125 t = build_int_cst (TREE_TYPE (decl), -1);
5126 t = build2 (PLUS_EXPR, TREE_TYPE (decl), decl, t);
5127 t = build_gimple_modify_stmt (decl, t);
5128 OMP_FOR_INCR (for_stmt) = t;
5131 case GIMPLE_MODIFY_STMT:
5132 gcc_assert (GIMPLE_STMT_OPERAND (t, 0) == decl);
5133 t = GIMPLE_STMT_OPERAND (t, 1);
5134 switch (TREE_CODE (t))
5137 if (TREE_OPERAND (t, 1) == decl)
5139 TREE_OPERAND (t, 1) = TREE_OPERAND (t, 0);
5140 TREE_OPERAND (t, 0) = decl;
5144 gcc_assert (TREE_OPERAND (t, 0) == decl);
5150 ret |= gimplify_expr (&TREE_OPERAND (t, 1), &OMP_FOR_PRE_BODY (for_stmt),
5151 NULL, is_gimple_val, fb_rvalue);
5158 gimplify_to_stmt_list (&OMP_FOR_BODY (for_stmt));
5159 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt));
5161 return ret == GS_ALL_DONE ? GS_ALL_DONE : GS_ERROR;
5164 /* Gimplify the gross structure of other OpenMP worksharing constructs.
5165 In particular, OMP_SECTIONS and OMP_SINGLE. */
5167 static enum gimplify_status
5168 gimplify_omp_workshare (tree *expr_p, tree *pre_p)
5170 tree stmt = *expr_p;
5172 gimplify_scan_omp_clauses (&OMP_CLAUSES (stmt), pre_p, false, false);
5173 gimplify_to_stmt_list (&OMP_BODY (stmt));
5174 gimplify_adjust_omp_clauses (&OMP_CLAUSES (stmt));
5179 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
5180 stabilized the lhs of the atomic operation as *ADDR. Return true if
5181 EXPR is this stabilized form. */
5184 goa_lhs_expr_p (tree expr, tree addr)
5186 /* Also include casts to other type variants. The C front end is fond
5187 of adding these for e.g. volatile variables. This is like
5188 STRIP_TYPE_NOPS but includes the main variant lookup. */
5189 while ((TREE_CODE (expr) == NOP_EXPR
5190 || TREE_CODE (expr) == CONVERT_EXPR
5191 || TREE_CODE (expr) == NON_LVALUE_EXPR)
5192 && TREE_OPERAND (expr, 0) != error_mark_node
5193 && (TYPE_MAIN_VARIANT (TREE_TYPE (expr))
5194 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (expr, 0)))))
5195 expr = TREE_OPERAND (expr, 0);
5197 if (TREE_CODE (expr) == INDIRECT_REF && TREE_OPERAND (expr, 0) == addr)
5199 if (TREE_CODE (addr) == ADDR_EXPR && expr == TREE_OPERAND (addr, 0))
5204 /* A subroutine of gimplify_omp_atomic. Attempt to implement the atomic
5205 operation as a __sync_fetch_and_op builtin. INDEX is log2 of the
5206 size of the data type, and thus usable to find the index of the builtin
5207 decl. Returns GS_UNHANDLED if the expression is not of the proper form. */
5209 static enum gimplify_status
5210 gimplify_omp_atomic_fetch_op (tree *expr_p, tree addr, tree rhs, int index)
5212 enum built_in_function base;
5214 enum insn_code *optab;
5216 /* Check for one of the supported fetch-op operations. */
5217 switch (TREE_CODE (rhs))
5219 case POINTER_PLUS_EXPR:
5221 base = BUILT_IN_FETCH_AND_ADD_N;
5222 optab = sync_add_optab;
5225 base = BUILT_IN_FETCH_AND_SUB_N;
5226 optab = sync_add_optab;
5229 base = BUILT_IN_FETCH_AND_AND_N;
5230 optab = sync_and_optab;
5233 base = BUILT_IN_FETCH_AND_OR_N;
5234 optab = sync_ior_optab;
5237 base = BUILT_IN_FETCH_AND_XOR_N;
5238 optab = sync_xor_optab;
5241 return GS_UNHANDLED;
5244 /* Make sure the expression is of the proper form. */
5245 if (goa_lhs_expr_p (TREE_OPERAND (rhs, 0), addr))
5246 rhs = TREE_OPERAND (rhs, 1);
5247 else if (commutative_tree_code (TREE_CODE (rhs))
5248 && goa_lhs_expr_p (TREE_OPERAND (rhs, 1), addr))
5249 rhs = TREE_OPERAND (rhs, 0);
5251 return GS_UNHANDLED;
5253 decl = built_in_decls[base + index + 1];
5254 itype = TREE_TYPE (TREE_TYPE (decl));
5256 if (optab[TYPE_MODE (itype)] == CODE_FOR_nothing)
5257 return GS_UNHANDLED;
5259 *expr_p = build_call_expr (decl, 2, addr, fold_convert (itype, rhs));
5263 /* A subroutine of gimplify_omp_atomic_pipeline. Walk *EXPR_P and replace
5264 appearances of *LHS_ADDR with LHS_VAR. If an expression does not involve
5265 the lhs, evaluate it into a temporary. Return 1 if the lhs appeared as
5266 a subexpression, 0 if it did not, or -1 if an error was encountered. */
5269 goa_stabilize_expr (tree *expr_p, tree *pre_p, tree lhs_addr, tree lhs_var)
5271 tree expr = *expr_p;
5274 if (goa_lhs_expr_p (expr, lhs_addr))
5279 if (is_gimple_val (expr))
5283 switch (TREE_CODE_CLASS (TREE_CODE (expr)))
5286 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p,
5289 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p,
5298 enum gimplify_status gs;
5299 gs = gimplify_expr (expr_p, pre_p, NULL, is_gimple_val, fb_rvalue);
5300 if (gs != GS_ALL_DONE)
5307 /* A subroutine of gimplify_omp_atomic. Implement the atomic operation as:
5311 newval = rhs; // with oldval replacing *addr in rhs
5312 oldval = __sync_val_compare_and_swap (addr, oldval, newval);
5313 if (oldval != newval)
5316 INDEX is log2 of the size of the data type, and thus usable to find the
5317 index of the builtin decl. */
5319 static enum gimplify_status
5320 gimplify_omp_atomic_pipeline (tree *expr_p, tree *pre_p, tree addr,
5321 tree rhs, int index)
5323 tree oldval, oldival, oldival2, newval, newival, label;
5324 tree type, itype, cmpxchg, x, iaddr;
5326 cmpxchg = built_in_decls[BUILT_IN_VAL_COMPARE_AND_SWAP_N + index + 1];
5327 type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr)));
5328 itype = TREE_TYPE (TREE_TYPE (cmpxchg));
5330 if (sync_compare_and_swap[TYPE_MODE (itype)] == CODE_FOR_nothing)
5331 return GS_UNHANDLED;
5333 oldval = create_tmp_var (type, NULL);
5334 newval = create_tmp_var (type, NULL);
5336 /* Precompute as much of RHS as possible. In the same walk, replace
5337 occurrences of the lhs value with our temporary. */
5338 if (goa_stabilize_expr (&rhs, pre_p, addr, oldval) < 0)
5341 x = build_fold_indirect_ref (addr);
5342 x = build_gimple_modify_stmt (oldval, x);
5343 gimplify_and_add (x, pre_p);
5345 /* For floating-point values, we'll need to view-convert them to integers
5346 so that we can perform the atomic compare and swap. Simplify the
5347 following code by always setting up the "i"ntegral variables. */
5348 if (INTEGRAL_TYPE_P (type) || POINTER_TYPE_P (type))
5356 oldival = create_tmp_var (itype, NULL);
5357 newival = create_tmp_var (itype, NULL);
5359 x = build1 (VIEW_CONVERT_EXPR, itype, oldval);
5360 x = build_gimple_modify_stmt (oldival, x);
5361 gimplify_and_add (x, pre_p);
5362 iaddr = fold_convert (build_pointer_type (itype), addr);
5365 oldival2 = create_tmp_var (itype, NULL);
5367 label = create_artificial_label ();
5368 x = build1 (LABEL_EXPR, void_type_node, label);
5369 gimplify_and_add (x, pre_p);
5371 x = build_gimple_modify_stmt (newval, rhs);
5372 gimplify_and_add (x, pre_p);
5374 if (newval != newival)
5376 x = build1 (VIEW_CONVERT_EXPR, itype, newval);
5377 x = build_gimple_modify_stmt (newival, x);
5378 gimplify_and_add (x, pre_p);
5381 x = build_gimple_modify_stmt (oldival2, fold_convert (itype, oldival));
5382 gimplify_and_add (x, pre_p);
5384 x = build_call_expr (cmpxchg, 3, iaddr, fold_convert (itype, oldival),
5385 fold_convert (itype, newival));
5386 if (oldval == oldival)
5387 x = fold_convert (type, x);
5388 x = build_gimple_modify_stmt (oldival, x);
5389 gimplify_and_add (x, pre_p);
5391 /* For floating point, be prepared for the loop backedge. */
5392 if (oldval != oldival)
5394 x = build1 (VIEW_CONVERT_EXPR, type, oldival);
5395 x = build_gimple_modify_stmt (oldval, x);
5396 gimplify_and_add (x, pre_p);
5399 /* Note that we always perform the comparison as an integer, even for
5400 floating point. This allows the atomic operation to properly
5401 succeed even with NaNs and -0.0. */
5402 x = build3 (COND_EXPR, void_type_node,
5403 build2 (NE_EXPR, boolean_type_node,
5404 fold_convert (itype, oldival), oldival2),
5405 build1 (GOTO_EXPR, void_type_node, label), NULL);
5406 gimplify_and_add (x, pre_p);
5412 /* A subroutine of gimplify_omp_atomic. Implement the atomic operation as:
5414 GOMP_atomic_start ();
5418 The result is not globally atomic, but works so long as all parallel
5419 references are within #pragma omp atomic directives. According to
5420 responses received from omp@openmp.org, appears to be within spec.
5421 Which makes sense, since that's how several other compilers handle
5422 this situation as well. */
5424 static enum gimplify_status
5425 gimplify_omp_atomic_mutex (tree *expr_p, tree *pre_p, tree addr, tree rhs)
5429 t = built_in_decls[BUILT_IN_GOMP_ATOMIC_START];
5430 t = build_call_expr (t, 0);
5431 gimplify_and_add (t, pre_p);
5433 t = build_fold_indirect_ref (addr);
5434 t = build_gimple_modify_stmt (t, rhs);
5435 gimplify_and_add (t, pre_p);
5437 t = built_in_decls[BUILT_IN_GOMP_ATOMIC_END];
5438 t = build_call_expr (t, 0);
5439 gimplify_and_add (t, pre_p);
5445 /* Gimplify an OMP_ATOMIC statement. */
5447 static enum gimplify_status
5448 gimplify_omp_atomic (tree *expr_p, tree *pre_p)
5450 tree addr = TREE_OPERAND (*expr_p, 0);
5451 tree rhs = TREE_OPERAND (*expr_p, 1);
5452 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr)));
5453 HOST_WIDE_INT index;
5455 /* Make sure the type is one of the supported sizes. */
5456 index = tree_low_cst (TYPE_SIZE_UNIT (type), 1);
5457 index = exact_log2 (index);
5458 if (index >= 0 && index <= 4)
5460 enum gimplify_status gs;
5463 if (DECL_P (TREE_OPERAND (addr, 0)))
5464 align = DECL_ALIGN_UNIT (TREE_OPERAND (addr, 0));
5465 else if (TREE_CODE (TREE_OPERAND (addr, 0)) == COMPONENT_REF
5466 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (addr, 0), 1))
5468 align = DECL_ALIGN_UNIT (TREE_OPERAND (TREE_OPERAND (addr, 0), 1));
5470 align = TYPE_ALIGN_UNIT (type);
5472 /* __sync builtins require strict data alignment. */
5473 if (exact_log2 (align) >= index)
5475 /* When possible, use specialized atomic update functions. */
5476 if (INTEGRAL_TYPE_P (type) || POINTER_TYPE_P (type))
5478 gs = gimplify_omp_atomic_fetch_op (expr_p, addr, rhs, index);
5479 if (gs != GS_UNHANDLED)
5483 /* If we don't have specialized __sync builtins, try and implement
5484 as a compare and swap loop. */
5485 gs = gimplify_omp_atomic_pipeline (expr_p, pre_p, addr, rhs, index);
5486 if (gs != GS_UNHANDLED)
5491 /* The ultimate fallback is wrapping the operation in a mutex. */
5492 return gimplify_omp_atomic_mutex (expr_p, pre_p, addr, rhs);
5495 /* Gimplifies the expression tree pointed to by EXPR_P. Return 0 if
5496 gimplification failed.
5498 PRE_P points to the list where side effects that must happen before
5499 EXPR should be stored.
5501 POST_P points to the list where side effects that must happen after
5502 EXPR should be stored, or NULL if there is no suitable list. In
5503 that case, we copy the result to a temporary, emit the
5504 post-effects, and then return the temporary.
5506 GIMPLE_TEST_F points to a function that takes a tree T and
5507 returns nonzero if T is in the GIMPLE form requested by the
5508 caller. The GIMPLE predicates are in tree-gimple.c.
5510 This test is used twice. Before gimplification, the test is
5511 invoked to determine whether *EXPR_P is already gimple enough. If
5512 that fails, *EXPR_P is gimplified according to its code and
5513 GIMPLE_TEST_F is called again. If the test still fails, then a new
5514 temporary variable is created and assigned the value of the
5515 gimplified expression.
5517 FALLBACK tells the function what sort of a temporary we want. If the 1
5518 bit is set, an rvalue is OK. If the 2 bit is set, an lvalue is OK.
5519 If both are set, either is OK, but an lvalue is preferable.
5521 The return value is either GS_ERROR or GS_ALL_DONE, since this function
5522 iterates until solution. */
5524 enum gimplify_status
5525 gimplify_expr (tree *expr_p, tree *pre_p, tree *post_p,
5526 bool (* gimple_test_f) (tree), fallback_t fallback)
5529 tree internal_pre = NULL_TREE;
5530 tree internal_post = NULL_TREE;
5532 int is_statement = (pre_p == NULL);
5533 location_t saved_location;
5534 enum gimplify_status ret;
5536 save_expr = *expr_p;
5537 if (save_expr == NULL_TREE)
5540 /* We used to check the predicate here and return immediately if it
5541 succeeds. This is wrong; the design is for gimplification to be
5542 idempotent, and for the predicates to only test for valid forms, not
5543 whether they are fully simplified. */
5545 /* Set up our internal queues if needed. */
5547 pre_p = &internal_pre;
5549 post_p = &internal_post;
5551 saved_location = input_location;
5552 if (save_expr != error_mark_node
5553 && EXPR_HAS_LOCATION (*expr_p))
5554 input_location = EXPR_LOCATION (*expr_p);
5556 /* Loop over the specific gimplifiers until the toplevel node
5557 remains the same. */
5560 /* Strip away as many useless type conversions as possible
5562 STRIP_USELESS_TYPE_CONVERSION (*expr_p);
5564 /* Remember the expr. */
5565 save_expr = *expr_p;
5567 /* Die, die, die, my darling. */
5568 if (save_expr == error_mark_node
5569 || (!GIMPLE_STMT_P (save_expr)
5570 && TREE_TYPE (save_expr)
5571 && TREE_TYPE (save_expr) == error_mark_node))
5577 /* Do any language-specific gimplification. */
5578 ret = lang_hooks.gimplify_expr (expr_p, pre_p, post_p);
5581 if (*expr_p == NULL_TREE)
5583 if (*expr_p != save_expr)
5586 else if (ret != GS_UNHANDLED)
5590 switch (TREE_CODE (*expr_p))
5592 /* First deal with the special cases. */
5594 case POSTINCREMENT_EXPR:
5595 case POSTDECREMENT_EXPR:
5596 case PREINCREMENT_EXPR:
5597 case PREDECREMENT_EXPR:
5598 ret = gimplify_self_mod_expr (expr_p, pre_p, post_p,
5599 fallback != fb_none);
5603 case ARRAY_RANGE_REF:
5607 case VIEW_CONVERT_EXPR:
5608 ret = gimplify_compound_lval (expr_p, pre_p, post_p,
5609 fallback ? fallback : fb_rvalue);
5613 ret = gimplify_cond_expr (expr_p, pre_p, fallback);
5614 /* C99 code may assign to an array in a structure value of a
5615 conditional expression, and this has undefined behavior
5616 only on execution, so create a temporary if an lvalue is
5618 if (fallback == fb_lvalue)
5620 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
5621 mark_addressable (*expr_p);
5626 ret = gimplify_call_expr (expr_p, pre_p, fallback != fb_none);
5627 /* C99 code may assign to an array in a structure returned
5628 from a function, and this has undefined behavior only on
5629 execution, so create a temporary if an lvalue is
5631 if (fallback == fb_lvalue)
5633 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
5634 mark_addressable (*expr_p);
5642 ret = gimplify_compound_expr (expr_p, pre_p, fallback != fb_none);
5646 case GIMPLE_MODIFY_STMT:
5648 ret = gimplify_modify_expr (expr_p, pre_p, post_p,
5649 fallback != fb_none);
5653 /* The distinction between MODIFY_EXPR and INIT_EXPR is no longer
5655 if (TREE_CODE (*expr_p) == INIT_EXPR)
5656 TREE_SET_CODE (*expr_p, MODIFY_EXPR);
5658 /* Convert MODIFY_EXPR to GIMPLE_MODIFY_STMT. */
5659 if (TREE_CODE (*expr_p) == MODIFY_EXPR)
5660 tree_to_gimple_tuple (expr_p);
5665 case TRUTH_ANDIF_EXPR:
5666 case TRUTH_ORIF_EXPR:
5667 ret = gimplify_boolean_expr (expr_p);
5670 case TRUTH_NOT_EXPR:
5671 TREE_OPERAND (*expr_p, 0)
5672 = gimple_boolify (TREE_OPERAND (*expr_p, 0));
5673 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5674 is_gimple_val, fb_rvalue);
5675 recalculate_side_effects (*expr_p);
5679 ret = gimplify_addr_expr (expr_p, pre_p, post_p);
5683 ret = gimplify_va_arg_expr (expr_p, pre_p, post_p);
5688 if (IS_EMPTY_STMT (*expr_p))
5694 if (VOID_TYPE_P (TREE_TYPE (*expr_p))
5695 || fallback == fb_none)
5697 /* Just strip a conversion to void (or in void context) and
5699 *expr_p = TREE_OPERAND (*expr_p, 0);
5703 ret = gimplify_conversion (expr_p);
5704 if (ret == GS_ERROR)
5706 if (*expr_p != save_expr)
5710 case FIX_TRUNC_EXPR:
5711 /* unary_expr: ... | '(' cast ')' val | ... */
5712 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5713 is_gimple_val, fb_rvalue);
5714 recalculate_side_effects (*expr_p);
5718 *expr_p = fold_indirect_ref (*expr_p);
5719 if (*expr_p != save_expr)
5721 /* else fall through. */
5722 case ALIGN_INDIRECT_REF:
5723 case MISALIGNED_INDIRECT_REF:
5724 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5725 is_gimple_reg, fb_rvalue);
5726 recalculate_side_effects (*expr_p);
5729 /* Constants need not be gimplified. */
5740 /* If we require an lvalue, such as for ADDR_EXPR, retain the
5741 CONST_DECL node. Otherwise the decl is replaceable by its
5743 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
5744 if (fallback & fb_lvalue)
5747 *expr_p = DECL_INITIAL (*expr_p);
5751 ret = gimplify_decl_expr (expr_p);
5755 /* FIXME make this a decl. */
5760 ret = gimplify_bind_expr (expr_p, pre_p);
5764 ret = gimplify_loop_expr (expr_p, pre_p);
5768 ret = gimplify_switch_expr (expr_p, pre_p);
5772 ret = gimplify_exit_expr (expr_p);
5776 /* If the target is not LABEL, then it is a computed jump
5777 and the target needs to be gimplified. */
5778 if (TREE_CODE (GOTO_DESTINATION (*expr_p)) != LABEL_DECL)
5779 ret = gimplify_expr (&GOTO_DESTINATION (*expr_p), pre_p,
5780 NULL, is_gimple_val, fb_rvalue);
5785 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p))
5786 == current_function_decl);
5789 case CASE_LABEL_EXPR:
5790 ret = gimplify_case_label_expr (expr_p);
5794 ret = gimplify_return_expr (*expr_p, pre_p);
5798 /* Don't reduce this in place; let gimplify_init_constructor work its
5799 magic. Buf if we're just elaborating this for side effects, just
5800 gimplify any element that has side-effects. */
5801 if (fallback == fb_none)
5803 unsigned HOST_WIDE_INT ix;
5804 constructor_elt *ce;
5805 tree temp = NULL_TREE;
5807 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (*expr_p),
5810 if (TREE_SIDE_EFFECTS (ce->value))
5811 append_to_statement_list (ce->value, &temp);
5816 /* C99 code may assign to an array in a constructed
5817 structure or union, and this has undefined behavior only
5818 on execution, so create a temporary if an lvalue is
5820 else if (fallback == fb_lvalue)
5822 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
5823 mark_addressable (*expr_p);
5829 /* The following are special cases that are not handled by the
5830 original GIMPLE grammar. */
5832 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
5835 ret = gimplify_save_expr (expr_p, pre_p, post_p);
5840 enum gimplify_status r0, r1, r2;
5842 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5843 is_gimple_lvalue, fb_either);
5844 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
5845 is_gimple_val, fb_rvalue);
5846 r2 = gimplify_expr (&TREE_OPERAND (*expr_p, 2), pre_p, post_p,
5847 is_gimple_val, fb_rvalue);
5848 recalculate_side_effects (*expr_p);
5850 ret = MIN (r0, MIN (r1, r2));
5854 case NON_LVALUE_EXPR:
5855 /* This should have been stripped above. */
5859 ret = gimplify_asm_expr (expr_p, pre_p, post_p);
5862 case TRY_FINALLY_EXPR:
5863 case TRY_CATCH_EXPR:
5864 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p, 0));
5865 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p, 1));
5869 case CLEANUP_POINT_EXPR:
5870 ret = gimplify_cleanup_point_expr (expr_p, pre_p);
5874 ret = gimplify_target_expr (expr_p, pre_p, post_p);
5878 gimplify_to_stmt_list (&CATCH_BODY (*expr_p));
5882 case EH_FILTER_EXPR:
5883 gimplify_to_stmt_list (&EH_FILTER_FAILURE (*expr_p));
5887 case CHANGE_DYNAMIC_TYPE_EXPR:
5888 ret = gimplify_expr (&CHANGE_DYNAMIC_TYPE_LOCATION (*expr_p),
5889 pre_p, post_p, is_gimple_reg, fb_lvalue);
5894 enum gimplify_status r0, r1;
5895 r0 = gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p), pre_p, post_p,
5896 is_gimple_val, fb_rvalue);
5897 r1 = gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p), pre_p, post_p,
5898 is_gimple_val, fb_rvalue);
5904 /* We get here when taking the address of a label. We mark
5905 the label as "forced"; meaning it can never be removed and
5906 it is a potential target for any computed goto. */
5907 FORCED_LABEL (*expr_p) = 1;
5911 case STATEMENT_LIST:
5912 ret = gimplify_statement_list (expr_p, pre_p);
5915 case WITH_SIZE_EXPR:
5917 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
5918 post_p == &internal_post ? NULL : post_p,
5919 gimple_test_f, fallback);
5920 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
5921 is_gimple_val, fb_rvalue);
5927 ret = gimplify_var_or_parm_decl (expr_p);
5931 /* When within an OpenMP context, notice uses of variables. */
5932 if (gimplify_omp_ctxp)
5933 omp_notice_variable (gimplify_omp_ctxp, *expr_p, true);
5938 /* Allow callbacks into the gimplifier during optimization. */
5943 ret = gimplify_omp_parallel (expr_p, pre_p);
5947 ret = gimplify_omp_for (expr_p, pre_p);
5952 ret = gimplify_omp_workshare (expr_p, pre_p);
5959 gimplify_to_stmt_list (&OMP_BODY (*expr_p));
5963 ret = gimplify_omp_atomic (expr_p, pre_p);
5971 case POINTER_PLUS_EXPR:
5972 /* Convert ((type *)A)+offset into &A->field_of_type_and_offset.
5973 The second is gimple immediate saving a need for extra statement.
5975 if (TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
5976 && (tmp = maybe_fold_offset_to_reference
5977 (TREE_OPERAND (*expr_p, 0), TREE_OPERAND (*expr_p, 1),
5978 TREE_TYPE (TREE_TYPE (*expr_p)))))
5980 tree ptr_type = build_pointer_type (TREE_TYPE (tmp));
5981 if (useless_type_conversion_p (TREE_TYPE (*expr_p), ptr_type))
5983 *expr_p = build_fold_addr_expr_with_type (tmp, ptr_type);
5987 /* Convert (void *)&a + 4 into (void *)&a[1]. */
5988 if (TREE_CODE (TREE_OPERAND (*expr_p, 0)) == NOP_EXPR
5989 && TREE_CODE (TREE_OPERAND (*expr_p, 1)) == INTEGER_CST
5990 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p,
5992 && (tmp = maybe_fold_offset_to_reference
5993 (TREE_OPERAND (TREE_OPERAND (*expr_p, 0), 0),
5994 TREE_OPERAND (*expr_p, 1),
5995 TREE_TYPE (TREE_TYPE
5996 (TREE_OPERAND (TREE_OPERAND (*expr_p, 0),
5999 tmp = build_fold_addr_expr (tmp);
6000 *expr_p = fold_convert (TREE_TYPE (*expr_p), tmp);
6005 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p)))
6007 case tcc_comparison:
6008 /* Handle comparison of objects of non scalar mode aggregates
6009 with a call to memcmp. It would be nice to only have to do
6010 this for variable-sized objects, but then we'd have to allow
6011 the same nest of reference nodes we allow for MODIFY_EXPR and
6014 Compare scalar mode aggregates as scalar mode values. Using
6015 memcmp for them would be very inefficient at best, and is
6016 plain wrong if bitfields are involved. */
6019 tree type = TREE_TYPE (TREE_OPERAND (*expr_p, 1));
6021 if (!AGGREGATE_TYPE_P (type))
6023 else if (TYPE_MODE (type) != BLKmode)
6024 ret = gimplify_scalar_mode_aggregate_compare (expr_p);
6026 ret = gimplify_variable_sized_compare (expr_p);
6031 /* If *EXPR_P does not need to be special-cased, handle it
6032 according to its class. */
6034 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6035 post_p, is_gimple_val, fb_rvalue);
6041 enum gimplify_status r0, r1;
6043 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
6044 post_p, is_gimple_val, fb_rvalue);
6045 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
6046 post_p, is_gimple_val, fb_rvalue);
6052 case tcc_declaration:
6055 goto dont_recalculate;
6058 gcc_assert (TREE_CODE (*expr_p) == TRUTH_AND_EXPR
6059 || TREE_CODE (*expr_p) == TRUTH_OR_EXPR
6060 || TREE_CODE (*expr_p) == TRUTH_XOR_EXPR);
6064 recalculate_side_effects (*expr_p);
6069 /* If we replaced *expr_p, gimplify again. */
6070 if (ret == GS_OK && (*expr_p == NULL || *expr_p == save_expr))
6073 while (ret == GS_OK);
6075 /* If we encountered an error_mark somewhere nested inside, either
6076 stub out the statement or propagate the error back out. */
6077 if (ret == GS_ERROR)
6084 /* This was only valid as a return value from the langhook, which
6085 we handled. Make sure it doesn't escape from any other context. */
6086 gcc_assert (ret != GS_UNHANDLED);
6088 if (fallback == fb_none && *expr_p && !is_gimple_stmt (*expr_p))
6090 /* We aren't looking for a value, and we don't have a valid
6091 statement. If it doesn't have side-effects, throw it away. */
6092 if (!TREE_SIDE_EFFECTS (*expr_p))
6094 else if (!TREE_THIS_VOLATILE (*expr_p))
6096 /* This is probably a _REF that contains something nested that
6097 has side effects. Recurse through the operands to find it. */
6098 enum tree_code code = TREE_CODE (*expr_p);
6105 case VIEW_CONVERT_EXPR:
6106 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6107 gimple_test_f, fallback);
6111 case ARRAY_RANGE_REF:
6112 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
6113 gimple_test_f, fallback);
6114 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
6115 gimple_test_f, fallback);
6119 /* Anything else with side-effects must be converted to
6120 a valid statement before we get here. */
6126 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p))
6127 && TYPE_MODE (TREE_TYPE (*expr_p)) != BLKmode)
6129 /* Historically, the compiler has treated a bare reference
6130 to a non-BLKmode volatile lvalue as forcing a load. */
6131 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p));
6132 /* Normally, we do not want to create a temporary for a
6133 TREE_ADDRESSABLE type because such a type should not be
6134 copied by bitwise-assignment. However, we make an
6135 exception here, as all we are doing here is ensuring that
6136 we read the bytes that make up the type. We use
6137 create_tmp_var_raw because create_tmp_var will abort when
6138 given a TREE_ADDRESSABLE type. */
6139 tree tmp = create_tmp_var_raw (type, "vol");
6140 gimple_add_tmp_var (tmp);
6141 *expr_p = build_gimple_modify_stmt (tmp, *expr_p);
6144 /* We can't do anything useful with a volatile reference to
6145 an incomplete type, so just throw it away. Likewise for
6146 a BLKmode type, since any implicit inner load should
6147 already have been turned into an explicit one by the
6148 gimplification process. */
6152 /* If we are gimplifying at the statement level, we're done. Tack
6153 everything together and replace the original statement with the
6155 if (fallback == fb_none || is_statement)
6157 if (internal_pre || internal_post)
6159 append_to_statement_list (*expr_p, &internal_pre);
6160 append_to_statement_list (internal_post, &internal_pre);
6161 annotate_all_with_locus (&internal_pre, input_location);
6162 *expr_p = internal_pre;
6166 else if (TREE_CODE (*expr_p) == STATEMENT_LIST)
6167 annotate_all_with_locus (expr_p, input_location);
6169 annotate_one_with_locus (*expr_p, input_location);
6173 /* Otherwise we're gimplifying a subexpression, so the resulting value is
6176 /* If it's sufficiently simple already, we're done. Unless we are
6177 handling some post-effects internally; if that's the case, we need to
6178 copy into a temp before adding the post-effects to the tree. */
6179 if (!internal_post && (*gimple_test_f) (*expr_p))
6182 /* Otherwise, we need to create a new temporary for the gimplified
6185 /* We can't return an lvalue if we have an internal postqueue. The
6186 object the lvalue refers to would (probably) be modified by the
6187 postqueue; we need to copy the value out first, which means an
6189 if ((fallback & fb_lvalue) && !internal_post
6190 && is_gimple_addressable (*expr_p))
6192 /* An lvalue will do. Take the address of the expression, store it
6193 in a temporary, and replace the expression with an INDIRECT_REF of
6195 tmp = build_fold_addr_expr (*expr_p);
6196 gimplify_expr (&tmp, pre_p, post_p, is_gimple_reg, fb_rvalue);
6197 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (tmp)), tmp);
6199 else if ((fallback & fb_rvalue) && is_gimple_formal_tmp_rhs (*expr_p))
6201 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p)));
6203 /* An rvalue will do. Assign the gimplified expression into a new
6204 temporary TMP and replace the original expression with TMP. */
6206 if (internal_post || (fallback & fb_lvalue))
6207 /* The postqueue might change the value of the expression between
6208 the initialization and use of the temporary, so we can't use a
6209 formal temp. FIXME do we care? */
6210 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
6212 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
6214 if (TREE_CODE (*expr_p) != SSA_NAME)
6215 DECL_GIMPLE_FORMAL_TEMP_P (*expr_p) = 1;
6219 #ifdef ENABLE_CHECKING
6220 if (!(fallback & fb_mayfail))
6222 fprintf (stderr, "gimplification failed:\n");
6223 print_generic_expr (stderr, *expr_p, 0);
6224 debug_tree (*expr_p);
6225 internal_error ("gimplification failed");
6228 gcc_assert (fallback & fb_mayfail);
6229 /* If this is an asm statement, and the user asked for the
6230 impossible, don't die. Fail and let gimplify_asm_expr
6236 /* Make sure the temporary matches our predicate. */
6237 gcc_assert ((*gimple_test_f) (*expr_p));
6241 annotate_all_with_locus (&internal_post, input_location);
6242 append_to_statement_list (internal_post, pre_p);
6246 input_location = saved_location;
6250 /* Look through TYPE for variable-sized objects and gimplify each such
6251 size that we find. Add to LIST_P any statements generated. */
6254 gimplify_type_sizes (tree type, tree *list_p)
6258 if (type == NULL || type == error_mark_node)
6261 /* We first do the main variant, then copy into any other variants. */
6262 type = TYPE_MAIN_VARIANT (type);
6264 /* Avoid infinite recursion. */
6265 if (TYPE_SIZES_GIMPLIFIED (type))
6268 TYPE_SIZES_GIMPLIFIED (type) = 1;
6270 switch (TREE_CODE (type))
6276 case FIXED_POINT_TYPE:
6277 gimplify_one_sizepos (&TYPE_MIN_VALUE (type), list_p);
6278 gimplify_one_sizepos (&TYPE_MAX_VALUE (type), list_p);
6280 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
6282 TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (type);
6283 TYPE_MAX_VALUE (t) = TYPE_MAX_VALUE (type);
6288 /* These types may not have declarations, so handle them here. */
6289 gimplify_type_sizes (TREE_TYPE (type), list_p);
6290 gimplify_type_sizes (TYPE_DOMAIN (type), list_p);
6295 case QUAL_UNION_TYPE:
6296 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
6297 if (TREE_CODE (field) == FIELD_DECL)
6299 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field), list_p);
6300 gimplify_type_sizes (TREE_TYPE (field), list_p);
6305 case REFERENCE_TYPE:
6306 /* We used to recurse on the pointed-to type here, which turned out to
6307 be incorrect because its definition might refer to variables not
6308 yet initialized at this point if a forward declaration is involved.
6310 It was actually useful for anonymous pointed-to types to ensure
6311 that the sizes evaluation dominates every possible later use of the
6312 values. Restricting to such types here would be safe since there
6313 is no possible forward declaration around, but would introduce an
6314 undesirable middle-end semantic to anonymity. We then defer to
6315 front-ends the responsibility of ensuring that the sizes are
6316 evaluated both early and late enough, e.g. by attaching artificial
6317 type declarations to the tree. */
6324 gimplify_one_sizepos (&TYPE_SIZE (type), list_p);
6325 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type), list_p);
6327 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
6329 TYPE_SIZE (t) = TYPE_SIZE (type);
6330 TYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (type);
6331 TYPE_SIZES_GIMPLIFIED (t) = 1;
6335 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
6336 a size or position, has had all of its SAVE_EXPRs evaluated.
6337 We add any required statements to STMT_P. */
6340 gimplify_one_sizepos (tree *expr_p, tree *stmt_p)
6342 tree type, expr = *expr_p;
6344 /* We don't do anything if the value isn't there, is constant, or contains
6345 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
6346 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
6347 will want to replace it with a new variable, but that will cause problems
6348 if this type is from outside the function. It's OK to have that here. */
6349 if (expr == NULL_TREE || TREE_CONSTANT (expr)
6350 || TREE_CODE (expr) == VAR_DECL
6351 || CONTAINS_PLACEHOLDER_P (expr))
6354 type = TREE_TYPE (expr);
6355 *expr_p = unshare_expr (expr);
6357 gimplify_expr (expr_p, stmt_p, NULL, is_gimple_val, fb_rvalue);
6360 /* Verify that we've an exact type match with the original expression.
6361 In particular, we do not wish to drop a "sizetype" in favour of a
6362 type of similar dimensions. We don't want to pollute the generic
6363 type-stripping code with this knowledge because it doesn't matter
6364 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
6365 and friends retain their "sizetype-ness". */
6366 if (TREE_TYPE (expr) != type
6367 && TREE_CODE (type) == INTEGER_TYPE
6368 && TYPE_IS_SIZETYPE (type))
6372 *expr_p = create_tmp_var (type, NULL);
6373 tmp = build1 (NOP_EXPR, type, expr);
6374 tmp = build_gimple_modify_stmt (*expr_p, tmp);
6375 if (EXPR_HAS_LOCATION (expr))
6376 SET_EXPR_LOCUS (tmp, EXPR_LOCUS (expr));
6378 SET_EXPR_LOCATION (tmp, input_location);
6380 gimplify_and_add (tmp, stmt_p);
6385 /* Gimplify the body of statements pointed to by BODY_P. FNDECL is the
6386 function decl containing BODY. */
6389 gimplify_body (tree *body_p, tree fndecl, bool do_parms)
6391 location_t saved_location = input_location;
6392 tree body, parm_stmts;
6394 timevar_push (TV_TREE_GIMPLIFY);
6396 gcc_assert (gimplify_ctxp == NULL);
6397 push_gimplify_context ();
6399 /* Unshare most shared trees in the body and in that of any nested functions.
6400 It would seem we don't have to do this for nested functions because
6401 they are supposed to be output and then the outer function gimplified
6402 first, but the g++ front end doesn't always do it that way. */
6403 unshare_body (body_p, fndecl);
6404 unvisit_body (body_p, fndecl);
6406 /* Make sure input_location isn't set to something wierd. */
6407 input_location = DECL_SOURCE_LOCATION (fndecl);
6409 /* Resolve callee-copies. This has to be done before processing
6410 the body so that DECL_VALUE_EXPR gets processed correctly. */
6411 parm_stmts = do_parms ? gimplify_parameters () : NULL;
6413 /* Gimplify the function's body. */
6414 gimplify_stmt (body_p);
6418 body = alloc_stmt_list ();
6419 else if (TREE_CODE (body) == STATEMENT_LIST)
6421 tree t = expr_only (*body_p);
6426 /* If there isn't an outer BIND_EXPR, add one. */
6427 if (TREE_CODE (body) != BIND_EXPR)
6429 tree b = build3 (BIND_EXPR, void_type_node, NULL_TREE,
6430 NULL_TREE, NULL_TREE);
6431 TREE_SIDE_EFFECTS (b) = 1;
6432 append_to_statement_list_force (body, &BIND_EXPR_BODY (b));
6436 /* If we had callee-copies statements, insert them at the beginning
6440 append_to_statement_list_force (BIND_EXPR_BODY (body), &parm_stmts);
6441 BIND_EXPR_BODY (body) = parm_stmts;
6444 /* Unshare again, in case gimplification was sloppy. */
6445 unshare_all_trees (body);
6449 pop_gimplify_context (body);
6450 gcc_assert (gimplify_ctxp == NULL);
6452 #ifdef ENABLE_TYPES_CHECKING
6453 if (!errorcount && !sorrycount)
6454 verify_gimple_1 (BIND_EXPR_BODY (*body_p));
6457 timevar_pop (TV_TREE_GIMPLIFY);
6458 input_location = saved_location;
6461 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
6462 node for the function we want to gimplify. */
6465 gimplify_function_tree (tree fndecl)
6467 tree oldfn, parm, ret;
6469 oldfn = current_function_decl;
6470 current_function_decl = fndecl;
6471 cfun = DECL_STRUCT_FUNCTION (fndecl);
6473 allocate_struct_function (fndecl);
6475 for (parm = DECL_ARGUMENTS (fndecl); parm ; parm = TREE_CHAIN (parm))
6477 /* Preliminarily mark non-addressed complex variables as eligible
6478 for promotion to gimple registers. We'll transform their uses
6480 if ((TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
6481 || TREE_CODE (TREE_TYPE (parm)) == VECTOR_TYPE)
6482 && !TREE_THIS_VOLATILE (parm)
6483 && !needs_to_live_in_memory (parm))
6484 DECL_GIMPLE_REG_P (parm) = 1;
6487 ret = DECL_RESULT (fndecl);
6488 if ((TREE_CODE (TREE_TYPE (ret)) == COMPLEX_TYPE
6489 || TREE_CODE (TREE_TYPE (ret)) == VECTOR_TYPE)
6490 && !needs_to_live_in_memory (ret))
6491 DECL_GIMPLE_REG_P (ret) = 1;
6493 gimplify_body (&DECL_SAVED_TREE (fndecl), fndecl, true);
6495 /* If we're instrumenting function entry/exit, then prepend the call to
6496 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
6497 catch the exit hook. */
6498 /* ??? Add some way to ignore exceptions for this TFE. */
6499 if (flag_instrument_function_entry_exit
6500 && !DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl)
6501 && !flag_instrument_functions_exclude_p (fndecl))
6505 tf = build2 (TRY_FINALLY_EXPR, void_type_node, NULL, NULL);
6506 TREE_SIDE_EFFECTS (tf) = 1;
6507 x = DECL_SAVED_TREE (fndecl);
6508 append_to_statement_list (x, &TREE_OPERAND (tf, 0));
6509 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_EXIT];
6510 x = build_call_expr (x, 0);
6511 append_to_statement_list (x, &TREE_OPERAND (tf, 1));
6513 bind = build3 (BIND_EXPR, void_type_node, NULL, NULL, NULL);
6514 TREE_SIDE_EFFECTS (bind) = 1;
6515 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_ENTER];
6516 x = build_call_expr (x, 0);
6517 append_to_statement_list (x, &BIND_EXPR_BODY (bind));
6518 append_to_statement_list (tf, &BIND_EXPR_BODY (bind));
6520 DECL_SAVED_TREE (fndecl) = bind;
6523 cfun->gimplified = true;
6524 current_function_decl = oldfn;
6525 cfun = oldfn ? DECL_STRUCT_FUNCTION (oldfn) : NULL;
6528 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
6529 force the result to be either ssa_name or an invariant, otherwise
6530 just force it to be a rhs expression. If VAR is not NULL, make the
6531 base variable of the final destination be VAR if suitable. */
6534 force_gimple_operand (tree expr, tree *stmts, bool simple, tree var)
6537 enum gimplify_status ret;
6538 gimple_predicate gimple_test_f;
6542 if (is_gimple_val (expr))
6545 gimple_test_f = simple ? is_gimple_val : is_gimple_reg_rhs;
6547 push_gimplify_context ();
6548 gimplify_ctxp->into_ssa = gimple_in_ssa_p (cfun);
6551 expr = build_gimple_modify_stmt (var, expr);
6553 ret = gimplify_expr (&expr, stmts, NULL,
6554 gimple_test_f, fb_rvalue);
6555 gcc_assert (ret != GS_ERROR);
6557 if (gimple_referenced_vars (cfun))
6559 for (t = gimplify_ctxp->temps; t ; t = TREE_CHAIN (t))
6560 add_referenced_var (t);
6563 pop_gimplify_context (NULL);
6568 /* Invokes force_gimple_operand for EXPR with parameters SIMPLE_P and VAR. If
6569 some statements are produced, emits them at BSI. If BEFORE is true.
6570 the statements are appended before BSI, otherwise they are appended after
6571 it. M specifies the way BSI moves after insertion (BSI_SAME_STMT or
6572 BSI_CONTINUE_LINKING are the usual values). */
6575 force_gimple_operand_bsi (block_stmt_iterator *bsi, tree expr,
6576 bool simple_p, tree var, bool before,
6577 enum bsi_iterator_update m)
6581 expr = force_gimple_operand (expr, &stmts, simple_p, var);
6584 if (gimple_in_ssa_p (cfun))
6586 tree_stmt_iterator tsi;
6588 for (tsi = tsi_start (stmts); !tsi_end_p (tsi); tsi_next (&tsi))
6589 mark_symbols_for_renaming (tsi_stmt (tsi));
6593 bsi_insert_before (bsi, stmts, m);
6595 bsi_insert_after (bsi, stmts, m);
6601 #include "gt-gimplify.h"