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 Free Software Foundation, Inc.
4 Major work done by Sebastian Pop <s.pop@laposte.net>,
5 Diego Novillo <dnovillo@redhat.com> and Jason Merrill <jason@redhat.com>.
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify it under
10 the terms of the GNU General Public License as published by the Free
11 Software Foundation; either version 2, or (at your option) any later
14 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
15 WARRANTY; without even the implied warranty of MERCHANTABILITY or
16 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING. If not, write to the Free
21 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
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"
53 enum gimplify_omp_var_data
59 GOVD_FIRSTPRIVATE = 16,
60 GOVD_LASTPRIVATE = 32,
63 GOVD_DEBUG_PRIVATE = 256,
64 GOVD_DATA_SHARE_CLASS = (GOVD_SHARED | GOVD_PRIVATE | GOVD_FIRSTPRIVATE
65 | GOVD_LASTPRIVATE | GOVD_REDUCTION | GOVD_LOCAL)
68 struct gimplify_omp_ctx
70 struct gimplify_omp_ctx *outer_context;
72 struct pointer_set_t *privatized_types;
74 enum omp_clause_default_kind default_kind;
76 bool is_combined_parallel;
81 struct gimplify_ctx *prev_context;
83 tree current_bind_expr;
85 tree conditional_cleanups;
89 VEC(tree,heap) *case_labels;
90 /* The formal temporary table. Should this be persistent? */
98 static struct gimplify_ctx *gimplify_ctxp;
99 static struct gimplify_omp_ctx *gimplify_omp_ctxp;
103 /* Formal (expression) temporary table handling: Multiple occurrences of
104 the same scalar expression are evaluated into the same temporary. */
106 typedef struct gimple_temp_hash_elt
109 tree temp; /* Value */
112 /* Forward declarations. */
113 static enum gimplify_status gimplify_compound_expr (tree *, tree *, bool);
114 #ifdef ENABLE_CHECKING
115 static bool cpt_same_type (tree a, tree b);
119 /* Return a hash value for a formal temporary table entry. */
122 gimple_tree_hash (const void *p)
124 tree t = ((const elt_t *) p)->val;
125 return iterative_hash_expr (t, 0);
128 /* Compare two formal temporary table entries. */
131 gimple_tree_eq (const void *p1, const void *p2)
133 tree t1 = ((const elt_t *) p1)->val;
134 tree t2 = ((const elt_t *) p2)->val;
135 enum tree_code code = TREE_CODE (t1);
137 if (TREE_CODE (t2) != code
138 || TREE_TYPE (t1) != TREE_TYPE (t2))
141 if (!operand_equal_p (t1, t2, 0))
144 /* Only allow them to compare equal if they also hash equal; otherwise
145 results are nondeterminate, and we fail bootstrap comparison. */
146 gcc_assert (gimple_tree_hash (p1) == gimple_tree_hash (p2));
151 /* Set up a context for the gimplifier. */
154 push_gimplify_context (void)
156 struct gimplify_ctx *c;
158 c = (struct gimplify_ctx *) xcalloc (1, sizeof (struct gimplify_ctx));
159 c->prev_context = gimplify_ctxp;
161 c->temp_htab = htab_create (1000, gimple_tree_hash, gimple_tree_eq, free);
166 /* Tear down a context for the gimplifier. If BODY is non-null, then
167 put the temporaries into the outer BIND_EXPR. Otherwise, put them
168 in the unexpanded_var_list. */
171 pop_gimplify_context (tree body)
173 struct gimplify_ctx *c = gimplify_ctxp;
176 gcc_assert (c && !c->current_bind_expr);
177 gimplify_ctxp = c->prev_context;
179 for (t = c->temps; t ; t = TREE_CHAIN (t))
180 DECL_GIMPLE_FORMAL_TEMP_P (t) = 0;
183 declare_tmp_vars (c->temps, body);
185 record_vars (c->temps);
188 htab_delete (c->temp_htab);
193 gimple_push_bind_expr (tree bind)
195 TREE_CHAIN (bind) = gimplify_ctxp->current_bind_expr;
196 gimplify_ctxp->current_bind_expr = bind;
200 gimple_pop_bind_expr (void)
202 gimplify_ctxp->current_bind_expr
203 = TREE_CHAIN (gimplify_ctxp->current_bind_expr);
207 gimple_current_bind_expr (void)
209 return gimplify_ctxp->current_bind_expr;
212 /* Returns true iff there is a COND_EXPR between us and the innermost
213 CLEANUP_POINT_EXPR. This info is used by gimple_push_cleanup. */
216 gimple_conditional_context (void)
218 return gimplify_ctxp->conditions > 0;
221 /* Note that we've entered a COND_EXPR. */
224 gimple_push_condition (void)
226 #ifdef ENABLE_CHECKING
227 if (gimplify_ctxp->conditions == 0)
228 gcc_assert (!gimplify_ctxp->conditional_cleanups);
230 ++(gimplify_ctxp->conditions);
233 /* Note that we've left a COND_EXPR. If we're back at unconditional scope
234 now, add any conditional cleanups we've seen to the prequeue. */
237 gimple_pop_condition (tree *pre_p)
239 int conds = --(gimplify_ctxp->conditions);
241 gcc_assert (conds >= 0);
244 append_to_statement_list (gimplify_ctxp->conditional_cleanups, pre_p);
245 gimplify_ctxp->conditional_cleanups = NULL_TREE;
249 /* A stable comparison routine for use with splay trees and DECLs. */
252 splay_tree_compare_decl_uid (splay_tree_key xa, splay_tree_key xb)
257 return DECL_UID (a) - DECL_UID (b);
260 /* Create a new omp construct that deals with variable remapping. */
262 static struct gimplify_omp_ctx *
263 new_omp_context (bool is_parallel, bool is_combined_parallel)
265 struct gimplify_omp_ctx *c;
267 c = XCNEW (struct gimplify_omp_ctx);
268 c->outer_context = gimplify_omp_ctxp;
269 c->variables = splay_tree_new (splay_tree_compare_decl_uid, 0, 0);
270 c->privatized_types = pointer_set_create ();
271 c->location = input_location;
272 c->is_parallel = is_parallel;
273 c->is_combined_parallel = is_combined_parallel;
274 c->default_kind = OMP_CLAUSE_DEFAULT_SHARED;
279 /* Destroy an omp construct that deals with variable remapping. */
282 delete_omp_context (struct gimplify_omp_ctx *c)
284 splay_tree_delete (c->variables);
285 pointer_set_destroy (c->privatized_types);
289 static void omp_add_variable (struct gimplify_omp_ctx *, tree, unsigned int);
290 static bool omp_notice_variable (struct gimplify_omp_ctx *, tree, bool);
292 /* A subroutine of append_to_statement_list{,_force}. T is not NULL. */
295 append_to_statement_list_1 (tree t, tree *list_p)
298 tree_stmt_iterator i;
302 if (t && TREE_CODE (t) == STATEMENT_LIST)
307 *list_p = list = alloc_stmt_list ();
311 tsi_link_after (&i, t, TSI_CONTINUE_LINKING);
314 /* Add T to the end of the list container pointed to by LIST_P.
315 If T is an expression with no effects, it is ignored. */
318 append_to_statement_list (tree t, tree *list_p)
320 if (t && TREE_SIDE_EFFECTS (t))
321 append_to_statement_list_1 (t, list_p);
324 /* Similar, but the statement is always added, regardless of side effects. */
327 append_to_statement_list_force (tree t, tree *list_p)
330 append_to_statement_list_1 (t, list_p);
333 /* Both gimplify the statement T and append it to LIST_P. */
336 gimplify_and_add (tree t, tree *list_p)
339 append_to_statement_list (t, list_p);
342 /* Strip off a legitimate source ending from the input string NAME of
343 length LEN. Rather than having to know the names used by all of
344 our front ends, we strip off an ending of a period followed by
345 up to five characters. (Java uses ".class".) */
348 remove_suffix (char *name, int len)
352 for (i = 2; i < 8 && len > i; i++)
354 if (name[len - i] == '.')
356 name[len - i] = '\0';
362 /* Create a nameless artificial label and put it in the current function
363 context. Returns the newly created label. */
366 create_artificial_label (void)
368 tree lab = build_decl (LABEL_DECL, NULL_TREE, void_type_node);
370 DECL_ARTIFICIAL (lab) = 1;
371 DECL_IGNORED_P (lab) = 1;
372 DECL_CONTEXT (lab) = current_function_decl;
376 /* Subroutine for find_single_pointer_decl. */
379 find_single_pointer_decl_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
382 tree *pdecl = (tree *) data;
384 if (DECL_P (*tp) && POINTER_TYPE_P (TREE_TYPE (*tp)))
388 /* We already found a pointer decl; return anything other
389 than NULL_TREE to unwind from walk_tree signalling that
390 we have a duplicate. */
399 /* Find the single DECL of pointer type in the tree T and return it.
400 If there are zero or more than one such DECLs, return NULL. */
403 find_single_pointer_decl (tree t)
405 tree decl = NULL_TREE;
407 if (walk_tree (&t, find_single_pointer_decl_1, &decl, NULL))
409 /* find_single_pointer_decl_1 returns a nonzero value, causing
410 walk_tree to return a nonzero value, to indicate that it
411 found more than one pointer DECL. */
418 /* Create a new temporary name with PREFIX. Returns an identifier. */
420 static GTY(()) unsigned int tmp_var_id_num;
423 create_tmp_var_name (const char *prefix)
429 char *preftmp = ASTRDUP (prefix);
431 remove_suffix (preftmp, strlen (preftmp));
435 ASM_FORMAT_PRIVATE_NAME (tmp_name, prefix ? prefix : "T", tmp_var_id_num++);
436 return get_identifier (tmp_name);
440 /* Create a new temporary variable declaration of type TYPE.
441 Does NOT push it into the current binding. */
444 create_tmp_var_raw (tree type, const char *prefix)
449 /* Make the type of the variable writable. */
450 new_type = build_type_variant (type, 0, 0);
451 TYPE_ATTRIBUTES (new_type) = TYPE_ATTRIBUTES (type);
453 tmp_var = build_decl (VAR_DECL, prefix ? create_tmp_var_name (prefix) : NULL,
456 /* The variable was declared by the compiler. */
457 DECL_ARTIFICIAL (tmp_var) = 1;
458 /* And we don't want debug info for it. */
459 DECL_IGNORED_P (tmp_var) = 1;
461 /* Make the variable writable. */
462 TREE_READONLY (tmp_var) = 0;
464 DECL_EXTERNAL (tmp_var) = 0;
465 TREE_STATIC (tmp_var) = 0;
466 TREE_USED (tmp_var) = 1;
471 /* Create a new temporary variable declaration of type TYPE. DOES push the
472 variable into the current binding. Further, assume that this is called
473 only from gimplification or optimization, at which point the creation of
474 certain types are bugs. */
477 create_tmp_var (tree type, const char *prefix)
481 /* We don't allow types that are addressable (meaning we can't make copies),
482 incomplete, or of variable size. */
483 gcc_assert (!TREE_ADDRESSABLE (type)
484 && COMPLETE_TYPE_P (type)
485 && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST);
487 tmp_var = create_tmp_var_raw (type, prefix);
488 gimple_add_tmp_var (tmp_var);
492 /* Given a tree, try to return a useful variable name that we can use
493 to prefix a temporary that is being assigned the value of the tree.
494 I.E. given <temp> = &A, return A. */
502 STRIP_NOPS (stripped_decl);
503 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
504 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
507 switch (TREE_CODE (stripped_decl))
510 return get_name (TREE_OPERAND (stripped_decl, 0));
518 /* Create a temporary with a name derived from VAL. Subroutine of
519 lookup_tmp_var; nobody else should call this function. */
522 create_tmp_from_val (tree val)
524 return create_tmp_var (TYPE_MAIN_VARIANT (TREE_TYPE (val)), get_name (val));
527 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
528 an existing expression temporary. */
531 lookup_tmp_var (tree val, bool is_formal)
535 /* If not optimizing, never really reuse a temporary. local-alloc
536 won't allocate any variable that is used in more than one basic
537 block, which means it will go into memory, causing much extra
538 work in reload and final and poorer code generation, outweighing
539 the extra memory allocation here. */
540 if (!optimize || !is_formal || TREE_SIDE_EFFECTS (val))
541 ret = create_tmp_from_val (val);
548 slot = htab_find_slot (gimplify_ctxp->temp_htab, (void *)&elt, INSERT);
551 elt_p = XNEW (elt_t);
553 elt_p->temp = ret = create_tmp_from_val (val);
554 *slot = (void *) elt_p;
558 elt_p = (elt_t *) *slot;
564 DECL_GIMPLE_FORMAL_TEMP_P (ret) = 1;
569 /* Returns a formal temporary variable initialized with VAL. PRE_P is as
570 in gimplify_expr. Only use this function if:
572 1) The value of the unfactored expression represented by VAL will not
573 change between the initialization and use of the temporary, and
574 2) The temporary will not be otherwise modified.
576 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
577 and #2 means it is inappropriate for && temps.
579 For other cases, use get_initialized_tmp_var instead. */
582 internal_get_tmp_var (tree val, tree *pre_p, tree *post_p, bool is_formal)
586 gimplify_expr (&val, pre_p, post_p, is_gimple_formal_tmp_rhs, fb_rvalue);
588 t = lookup_tmp_var (val, is_formal);
592 tree u = find_single_pointer_decl (val);
594 if (u && TREE_CODE (u) == VAR_DECL && DECL_BASED_ON_RESTRICT_P (u))
595 u = DECL_GET_RESTRICT_BASE (u);
596 if (u && TYPE_RESTRICT (TREE_TYPE (u)))
598 if (DECL_BASED_ON_RESTRICT_P (t))
599 gcc_assert (u == DECL_GET_RESTRICT_BASE (t));
602 DECL_BASED_ON_RESTRICT_P (t) = 1;
603 SET_DECL_RESTRICT_BASE (t, u);
608 if (TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE)
609 DECL_COMPLEX_GIMPLE_REG_P (t) = 1;
611 mod = build2 (INIT_EXPR, TREE_TYPE (t), t, val);
613 if (EXPR_HAS_LOCATION (val))
614 SET_EXPR_LOCUS (mod, EXPR_LOCUS (val));
616 SET_EXPR_LOCATION (mod, input_location);
618 /* gimplify_modify_expr might want to reduce this further. */
619 gimplify_and_add (mod, pre_p);
621 /* If we're gimplifying into ssa, gimplify_modify_expr will have
622 given our temporary an ssa name. Find and return it. */
623 if (gimplify_ctxp->into_ssa)
624 t = TREE_OPERAND (mod, 0);
629 /* Returns a formal temporary variable initialized with VAL. PRE_P
630 points to a statement list where side-effects needed to compute VAL
634 get_formal_tmp_var (tree val, tree *pre_p)
636 return internal_get_tmp_var (val, pre_p, NULL, true);
639 /* Returns a temporary variable initialized with VAL. PRE_P and POST_P
640 are as in gimplify_expr. */
643 get_initialized_tmp_var (tree val, tree *pre_p, tree *post_p)
645 return internal_get_tmp_var (val, pre_p, post_p, false);
648 /* Declares all the variables in VARS in SCOPE. */
651 declare_tmp_vars (tree vars, tree scope)
658 /* C99 mode puts the default 'return 0;' for main outside the outer
659 braces. So drill down until we find an actual scope. */
660 while (TREE_CODE (scope) == COMPOUND_EXPR)
661 scope = TREE_OPERAND (scope, 0);
663 gcc_assert (TREE_CODE (scope) == BIND_EXPR);
665 temps = nreverse (last);
666 TREE_CHAIN (last) = BIND_EXPR_VARS (scope);
667 BIND_EXPR_VARS (scope) = temps;
672 gimple_add_tmp_var (tree tmp)
674 gcc_assert (!TREE_CHAIN (tmp) && !DECL_SEEN_IN_BIND_EXPR_P (tmp));
676 DECL_CONTEXT (tmp) = current_function_decl;
677 DECL_SEEN_IN_BIND_EXPR_P (tmp) = 1;
681 TREE_CHAIN (tmp) = gimplify_ctxp->temps;
682 gimplify_ctxp->temps = tmp;
684 /* Mark temporaries local within the nearest enclosing parallel. */
685 if (gimplify_omp_ctxp)
687 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
688 while (ctx && !ctx->is_parallel)
689 ctx = ctx->outer_context;
691 omp_add_variable (ctx, tmp, GOVD_LOCAL | GOVD_SEEN);
697 declare_tmp_vars (tmp, DECL_SAVED_TREE (current_function_decl));
700 /* Determines whether to assign a locus to the statement STMT. */
703 should_carry_locus_p (tree stmt)
705 /* Don't emit a line note for a label. We particularly don't want to
706 emit one for the break label, since it doesn't actually correspond
707 to the beginning of the loop/switch. */
708 if (TREE_CODE (stmt) == LABEL_EXPR)
711 /* Do not annotate empty statements, since it confuses gcov. */
712 if (!TREE_SIDE_EFFECTS (stmt))
719 annotate_one_with_locus (tree t, location_t locus)
721 if (EXPR_P (t) && ! EXPR_HAS_LOCATION (t) && should_carry_locus_p (t))
722 SET_EXPR_LOCATION (t, locus);
726 annotate_all_with_locus (tree *stmt_p, location_t locus)
728 tree_stmt_iterator i;
733 for (i = tsi_start (*stmt_p); !tsi_end_p (i); tsi_next (&i))
735 tree t = tsi_stmt (i);
737 /* Assuming we've already been gimplified, we shouldn't
738 see nested chaining constructs anymore. */
739 gcc_assert (TREE_CODE (t) != STATEMENT_LIST
740 && TREE_CODE (t) != COMPOUND_EXPR);
742 annotate_one_with_locus (t, locus);
746 /* Similar to copy_tree_r() but do not copy SAVE_EXPR or TARGET_EXPR nodes.
747 These nodes model computations that should only be done once. If we
748 were to unshare something like SAVE_EXPR(i++), the gimplification
749 process would create wrong code. */
752 mostly_copy_tree_r (tree *tp, int *walk_subtrees, void *data)
754 enum tree_code code = TREE_CODE (*tp);
755 /* Don't unshare types, decls, constants and SAVE_EXPR nodes. */
756 if (TREE_CODE_CLASS (code) == tcc_type
757 || TREE_CODE_CLASS (code) == tcc_declaration
758 || TREE_CODE_CLASS (code) == tcc_constant
759 || code == SAVE_EXPR || code == TARGET_EXPR
760 /* We can't do anything sensible with a BLOCK used as an expression,
761 but we also can't just die when we see it because of non-expression
762 uses. So just avert our eyes and cross our fingers. Silly Java. */
767 gcc_assert (code != BIND_EXPR);
768 copy_tree_r (tp, walk_subtrees, data);
774 /* Callback for walk_tree to unshare most of the shared trees rooted at
775 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
776 then *TP is deep copied by calling copy_tree_r.
778 This unshares the same trees as copy_tree_r with the exception of
779 SAVE_EXPR nodes. These nodes model computations that should only be
780 done once. If we were to unshare something like SAVE_EXPR(i++), the
781 gimplification process would create wrong code. */
784 copy_if_shared_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
785 void *data ATTRIBUTE_UNUSED)
788 enum tree_code code = TREE_CODE (t);
790 /* Skip types, decls, and constants. But we do want to look at their
791 types and the bounds of types. Mark them as visited so we properly
792 unmark their subtrees on the unmark pass. If we've already seen them,
793 don't look down further. */
794 if (TREE_CODE_CLASS (code) == tcc_type
795 || TREE_CODE_CLASS (code) == tcc_declaration
796 || TREE_CODE_CLASS (code) == tcc_constant)
798 if (TREE_VISITED (t))
801 TREE_VISITED (t) = 1;
804 /* If this node has been visited already, unshare it and don't look
806 else if (TREE_VISITED (t))
808 walk_tree (tp, mostly_copy_tree_r, NULL, NULL);
812 /* Otherwise, mark the tree as visited and keep looking. */
814 TREE_VISITED (t) = 1;
820 unmark_visited_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
821 void *data ATTRIBUTE_UNUSED)
823 if (TREE_VISITED (*tp))
824 TREE_VISITED (*tp) = 0;
831 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
832 bodies of any nested functions if we are unsharing the entire body of
836 unshare_body (tree *body_p, tree fndecl)
838 struct cgraph_node *cgn = cgraph_node (fndecl);
840 walk_tree (body_p, copy_if_shared_r, NULL, NULL);
841 if (body_p == &DECL_SAVED_TREE (fndecl))
842 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
843 unshare_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
846 /* Likewise, but mark all trees as not visited. */
849 unvisit_body (tree *body_p, tree fndecl)
851 struct cgraph_node *cgn = cgraph_node (fndecl);
853 walk_tree (body_p, unmark_visited_r, NULL, NULL);
854 if (body_p == &DECL_SAVED_TREE (fndecl))
855 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
856 unvisit_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
859 /* Unshare T and all the trees reached from T via TREE_CHAIN. */
862 unshare_all_trees (tree t)
864 walk_tree (&t, copy_if_shared_r, NULL, NULL);
865 walk_tree (&t, unmark_visited_r, NULL, NULL);
868 /* Unconditionally make an unshared copy of EXPR. This is used when using
869 stored expressions which span multiple functions, such as BINFO_VTABLE,
870 as the normal unsharing process can't tell that they're shared. */
873 unshare_expr (tree expr)
875 walk_tree (&expr, mostly_copy_tree_r, NULL, NULL);
879 /* A terser interface for building a representation of an exception
883 gimple_build_eh_filter (tree body, tree allowed, tree failure)
887 /* FIXME should the allowed types go in TREE_TYPE? */
888 t = build2 (EH_FILTER_EXPR, void_type_node, allowed, NULL_TREE);
889 append_to_statement_list (failure, &EH_FILTER_FAILURE (t));
891 t = build2 (TRY_CATCH_EXPR, void_type_node, NULL_TREE, t);
892 append_to_statement_list (body, &TREE_OPERAND (t, 0));
898 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
899 contain statements and have a value. Assign its value to a temporary
900 and give it void_type_node. Returns the temporary, or NULL_TREE if
901 WRAPPER was already void. */
904 voidify_wrapper_expr (tree wrapper, tree temp)
906 if (!VOID_TYPE_P (TREE_TYPE (wrapper)))
908 tree *p, sub = wrapper;
911 /* Set p to point to the body of the wrapper. */
912 switch (TREE_CODE (sub))
915 /* For a BIND_EXPR, the body is operand 1. */
916 p = &BIND_EXPR_BODY (sub);
920 p = &TREE_OPERAND (sub, 0);
924 /* Advance to the last statement. Set all container types to void. */
925 if (TREE_CODE (*p) == STATEMENT_LIST)
927 tree_stmt_iterator i = tsi_last (*p);
928 p = tsi_end_p (i) ? NULL : tsi_stmt_ptr (i);
932 for (; TREE_CODE (*p) == COMPOUND_EXPR; p = &TREE_OPERAND (*p, 1))
934 TREE_SIDE_EFFECTS (*p) = 1;
935 TREE_TYPE (*p) = void_type_node;
939 if (p == NULL || IS_EMPTY_STMT (*p))
941 /* Look through exception handling. */
942 else if (TREE_CODE (*p) == TRY_FINALLY_EXPR
943 || TREE_CODE (*p) == TRY_CATCH_EXPR)
948 /* The C++ frontend already did this for us. */
949 else if (TREE_CODE (*p) == INIT_EXPR
950 || TREE_CODE (*p) == TARGET_EXPR)
951 temp = TREE_OPERAND (*p, 0);
952 /* If we're returning a dereference, move the dereference
953 outside the wrapper. */
954 else if (TREE_CODE (*p) == INDIRECT_REF)
956 tree ptr = TREE_OPERAND (*p, 0);
957 temp = create_tmp_var (TREE_TYPE (ptr), "retval");
958 *p = build2 (MODIFY_EXPR, TREE_TYPE (ptr), temp, ptr);
959 temp = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (temp)), temp);
960 /* If this is a BIND_EXPR for a const inline function, it might not
961 have TREE_SIDE_EFFECTS set. That is no longer accurate. */
962 TREE_SIDE_EFFECTS (wrapper) = 1;
967 temp = create_tmp_var (TREE_TYPE (wrapper), "retval");
968 *p = build2 (MODIFY_EXPR, TREE_TYPE (temp), temp, *p);
969 TREE_SIDE_EFFECTS (wrapper) = 1;
972 TREE_TYPE (wrapper) = void_type_node;
979 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
980 a temporary through which they communicate. */
983 build_stack_save_restore (tree *save, tree *restore)
985 tree save_call, tmp_var;
988 build_function_call_expr (implicit_built_in_decls[BUILT_IN_STACK_SAVE],
990 tmp_var = create_tmp_var (ptr_type_node, "saved_stack");
992 *save = build2 (MODIFY_EXPR, ptr_type_node, tmp_var, save_call);
994 build_function_call_expr (implicit_built_in_decls[BUILT_IN_STACK_RESTORE],
995 tree_cons (NULL_TREE, tmp_var, NULL_TREE));
998 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
1000 static enum gimplify_status
1001 gimplify_bind_expr (tree *expr_p, tree temp, tree *pre_p)
1003 tree bind_expr = *expr_p;
1004 bool old_save_stack = gimplify_ctxp->save_stack;
1007 temp = voidify_wrapper_expr (bind_expr, temp);
1009 /* Mark variables seen in this bind expr. */
1010 for (t = BIND_EXPR_VARS (bind_expr); t ; t = TREE_CHAIN (t))
1012 if (TREE_CODE (t) == VAR_DECL)
1014 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
1016 /* Mark variable as local. */
1017 if (ctx && !is_global_var (t)
1018 && (! DECL_SEEN_IN_BIND_EXPR_P (t)
1019 || splay_tree_lookup (ctx->variables,
1020 (splay_tree_key) t) == NULL))
1021 omp_add_variable (gimplify_omp_ctxp, t, GOVD_LOCAL | GOVD_SEEN);
1023 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
1026 /* Preliminarily mark non-addressed complex variables as eligible
1027 for promotion to gimple registers. We'll transform their uses
1029 if (TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
1030 && !TREE_THIS_VOLATILE (t)
1031 && (TREE_CODE (t) == VAR_DECL && !DECL_HARD_REGISTER (t))
1032 && !needs_to_live_in_memory (t))
1033 DECL_COMPLEX_GIMPLE_REG_P (t) = 1;
1036 gimple_push_bind_expr (bind_expr);
1037 gimplify_ctxp->save_stack = false;
1039 gimplify_to_stmt_list (&BIND_EXPR_BODY (bind_expr));
1041 if (gimplify_ctxp->save_stack)
1043 tree stack_save, stack_restore;
1045 /* Save stack on entry and restore it on exit. Add a try_finally
1046 block to achieve this. Note that mudflap depends on the
1047 format of the emitted code: see mx_register_decls(). */
1048 build_stack_save_restore (&stack_save, &stack_restore);
1050 t = build2 (TRY_FINALLY_EXPR, void_type_node,
1051 BIND_EXPR_BODY (bind_expr), NULL_TREE);
1052 append_to_statement_list (stack_restore, &TREE_OPERAND (t, 1));
1054 BIND_EXPR_BODY (bind_expr) = NULL_TREE;
1055 append_to_statement_list (stack_save, &BIND_EXPR_BODY (bind_expr));
1056 append_to_statement_list (t, &BIND_EXPR_BODY (bind_expr));
1059 gimplify_ctxp->save_stack = old_save_stack;
1060 gimple_pop_bind_expr ();
1065 append_to_statement_list (bind_expr, pre_p);
1072 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1073 GIMPLE value, it is assigned to a new temporary and the statement is
1074 re-written to return the temporary.
1076 PRE_P points to the list where side effects that must happen before
1077 STMT should be stored. */
1079 static enum gimplify_status
1080 gimplify_return_expr (tree stmt, tree *pre_p)
1082 tree ret_expr = TREE_OPERAND (stmt, 0);
1083 tree result_decl, result;
1085 if (!ret_expr || TREE_CODE (ret_expr) == RESULT_DECL
1086 || ret_expr == error_mark_node)
1089 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
1090 result_decl = NULL_TREE;
1093 result_decl = TREE_OPERAND (ret_expr, 0);
1094 if (TREE_CODE (result_decl) == INDIRECT_REF)
1095 /* See through a return by reference. */
1096 result_decl = TREE_OPERAND (result_decl, 0);
1098 gcc_assert ((TREE_CODE (ret_expr) == MODIFY_EXPR
1099 || TREE_CODE (ret_expr) == INIT_EXPR)
1100 && TREE_CODE (result_decl) == RESULT_DECL);
1103 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1104 Recall that aggregate_value_p is FALSE for any aggregate type that is
1105 returned in registers. If we're returning values in registers, then
1106 we don't want to extend the lifetime of the RESULT_DECL, particularly
1107 across another call. In addition, for those aggregates for which
1108 hard_function_value generates a PARALLEL, we'll die during normal
1109 expansion of structure assignments; there's special code in expand_return
1110 to handle this case that does not exist in expand_expr. */
1112 || aggregate_value_p (result_decl, TREE_TYPE (current_function_decl)))
1113 result = result_decl;
1114 else if (gimplify_ctxp->return_temp)
1115 result = gimplify_ctxp->return_temp;
1118 result = create_tmp_var (TREE_TYPE (result_decl), NULL);
1120 /* ??? With complex control flow (usually involving abnormal edges),
1121 we can wind up warning about an uninitialized value for this. Due
1122 to how this variable is constructed and initialized, this is never
1123 true. Give up and never warn. */
1124 TREE_NO_WARNING (result) = 1;
1126 gimplify_ctxp->return_temp = result;
1129 /* Smash the lhs of the MODIFY_EXPR to the temporary we plan to use.
1130 Then gimplify the whole thing. */
1131 if (result != result_decl)
1132 TREE_OPERAND (ret_expr, 0) = result;
1134 gimplify_and_add (TREE_OPERAND (stmt, 0), pre_p);
1136 /* If we didn't use a temporary, then the result is just the result_decl.
1137 Otherwise we need a simple copy. This should already be gimple. */
1138 if (result == result_decl)
1141 ret_expr = build2 (MODIFY_EXPR, TREE_TYPE (result), result_decl, result);
1142 TREE_OPERAND (stmt, 0) = ret_expr;
1147 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
1148 and initialization explicit. */
1150 static enum gimplify_status
1151 gimplify_decl_expr (tree *stmt_p)
1153 tree stmt = *stmt_p;
1154 tree decl = DECL_EXPR_DECL (stmt);
1156 *stmt_p = NULL_TREE;
1158 if (TREE_TYPE (decl) == error_mark_node)
1161 if ((TREE_CODE (decl) == TYPE_DECL
1162 || TREE_CODE (decl) == VAR_DECL)
1163 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl)))
1164 gimplify_type_sizes (TREE_TYPE (decl), stmt_p);
1166 if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl))
1168 tree init = DECL_INITIAL (decl);
1170 if (!TREE_CONSTANT (DECL_SIZE (decl)))
1172 /* This is a variable-sized decl. Simplify its size and mark it
1173 for deferred expansion. Note that mudflap depends on the format
1174 of the emitted code: see mx_register_decls(). */
1175 tree t, args, addr, ptr_type;
1177 gimplify_one_sizepos (&DECL_SIZE (decl), stmt_p);
1178 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl), stmt_p);
1180 /* All occurrences of this decl in final gimplified code will be
1181 replaced by indirection. Setting DECL_VALUE_EXPR does two
1182 things: First, it lets the rest of the gimplifier know what
1183 replacement to use. Second, it lets the debug info know
1184 where to find the value. */
1185 ptr_type = build_pointer_type (TREE_TYPE (decl));
1186 addr = create_tmp_var (ptr_type, get_name (decl));
1187 DECL_IGNORED_P (addr) = 0;
1188 t = build_fold_indirect_ref (addr);
1189 SET_DECL_VALUE_EXPR (decl, t);
1190 DECL_HAS_VALUE_EXPR_P (decl) = 1;
1192 args = tree_cons (NULL, DECL_SIZE_UNIT (decl), NULL);
1193 t = built_in_decls[BUILT_IN_ALLOCA];
1194 t = build_function_call_expr (t, args);
1195 t = fold_convert (ptr_type, t);
1196 t = build2 (MODIFY_EXPR, void_type_node, addr, t);
1198 gimplify_and_add (t, stmt_p);
1200 /* Indicate that we need to restore the stack level when the
1201 enclosing BIND_EXPR is exited. */
1202 gimplify_ctxp->save_stack = true;
1205 if (init && init != error_mark_node)
1207 if (!TREE_STATIC (decl))
1209 DECL_INITIAL (decl) = NULL_TREE;
1210 init = build2 (INIT_EXPR, void_type_node, decl, init);
1211 gimplify_and_add (init, stmt_p);
1214 /* We must still examine initializers for static variables
1215 as they may contain a label address. */
1216 walk_tree (&init, force_labels_r, NULL, NULL);
1219 /* This decl isn't mentioned in the enclosing block, so add it to the
1220 list of temps. FIXME it seems a bit of a kludge to say that
1221 anonymous artificial vars aren't pushed, but everything else is. */
1222 if (DECL_ARTIFICIAL (decl) && DECL_NAME (decl) == NULL_TREE)
1223 gimple_add_tmp_var (decl);
1229 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1230 and replacing the LOOP_EXPR with goto, but if the loop contains an
1231 EXIT_EXPR, we need to append a label for it to jump to. */
1233 static enum gimplify_status
1234 gimplify_loop_expr (tree *expr_p, tree *pre_p)
1236 tree saved_label = gimplify_ctxp->exit_label;
1237 tree start_label = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
1238 tree jump_stmt = build_and_jump (&LABEL_EXPR_LABEL (start_label));
1240 append_to_statement_list (start_label, pre_p);
1242 gimplify_ctxp->exit_label = NULL_TREE;
1244 gimplify_and_add (LOOP_EXPR_BODY (*expr_p), pre_p);
1246 if (gimplify_ctxp->exit_label)
1248 append_to_statement_list (jump_stmt, pre_p);
1249 *expr_p = build1 (LABEL_EXPR, void_type_node, gimplify_ctxp->exit_label);
1252 *expr_p = jump_stmt;
1254 gimplify_ctxp->exit_label = saved_label;
1259 /* Compare two case labels. Because the front end should already have
1260 made sure that case ranges do not overlap, it is enough to only compare
1261 the CASE_LOW values of each case label. */
1264 compare_case_labels (const void *p1, const void *p2)
1266 tree case1 = *(tree *)p1;
1267 tree case2 = *(tree *)p2;
1269 return tree_int_cst_compare (CASE_LOW (case1), CASE_LOW (case2));
1272 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1275 sort_case_labels (tree label_vec)
1277 size_t len = TREE_VEC_LENGTH (label_vec);
1278 tree default_case = TREE_VEC_ELT (label_vec, len - 1);
1280 if (CASE_LOW (default_case))
1284 /* The last label in the vector should be the default case
1286 for (i = 0; i < len; ++i)
1288 tree t = TREE_VEC_ELT (label_vec, i);
1292 TREE_VEC_ELT (label_vec, i) = TREE_VEC_ELT (label_vec, len - 1);
1293 TREE_VEC_ELT (label_vec, len - 1) = default_case;
1299 qsort (&TREE_VEC_ELT (label_vec, 0), len - 1, sizeof (tree),
1300 compare_case_labels);
1303 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1306 static enum gimplify_status
1307 gimplify_switch_expr (tree *expr_p, tree *pre_p)
1309 tree switch_expr = *expr_p;
1310 enum gimplify_status ret;
1312 ret = gimplify_expr (&SWITCH_COND (switch_expr), pre_p, NULL,
1313 is_gimple_val, fb_rvalue);
1315 if (SWITCH_BODY (switch_expr))
1317 VEC(tree,heap) *labels, *saved_labels;
1318 tree label_vec, default_case = NULL_TREE;
1321 /* If someone can be bothered to fill in the labels, they can
1322 be bothered to null out the body too. */
1323 gcc_assert (!SWITCH_LABELS (switch_expr));
1325 saved_labels = gimplify_ctxp->case_labels;
1326 gimplify_ctxp->case_labels = VEC_alloc (tree, heap, 8);
1328 gimplify_to_stmt_list (&SWITCH_BODY (switch_expr));
1330 labels = gimplify_ctxp->case_labels;
1331 gimplify_ctxp->case_labels = saved_labels;
1334 while (i < VEC_length (tree, labels))
1336 tree elt = VEC_index (tree, labels, i);
1337 tree low = CASE_LOW (elt);
1338 bool remove_element = FALSE;
1342 /* Discard empty ranges. */
1343 tree high = CASE_HIGH (elt);
1344 if (high && INT_CST_LT (high, low))
1345 remove_element = TRUE;
1349 /* The default case must be the last label in the list. */
1350 gcc_assert (!default_case);
1352 remove_element = TRUE;
1356 VEC_ordered_remove (tree, labels, i);
1362 label_vec = make_tree_vec (len + 1);
1363 SWITCH_LABELS (*expr_p) = label_vec;
1364 append_to_statement_list (switch_expr, pre_p);
1368 /* If the switch has no default label, add one, so that we jump
1369 around the switch body. */
1370 default_case = build3 (CASE_LABEL_EXPR, void_type_node, NULL_TREE,
1371 NULL_TREE, create_artificial_label ());
1372 append_to_statement_list (SWITCH_BODY (switch_expr), pre_p);
1373 *expr_p = build1 (LABEL_EXPR, void_type_node,
1374 CASE_LABEL (default_case));
1377 *expr_p = SWITCH_BODY (switch_expr);
1379 for (i = 0; i < len; ++i)
1380 TREE_VEC_ELT (label_vec, i) = VEC_index (tree, labels, i);
1381 TREE_VEC_ELT (label_vec, len) = default_case;
1383 VEC_free (tree, heap, labels);
1385 sort_case_labels (label_vec);
1387 SWITCH_BODY (switch_expr) = NULL;
1390 gcc_assert (SWITCH_LABELS (switch_expr));
1395 static enum gimplify_status
1396 gimplify_case_label_expr (tree *expr_p)
1398 tree expr = *expr_p;
1399 struct gimplify_ctx *ctxp;
1401 /* Invalid OpenMP programs can play Duff's Device type games with
1402 #pragma omp parallel. At least in the C front end, we don't
1403 detect such invalid branches until after gimplification. */
1404 for (ctxp = gimplify_ctxp; ; ctxp = ctxp->prev_context)
1405 if (ctxp->case_labels)
1408 VEC_safe_push (tree, heap, ctxp->case_labels, expr);
1409 *expr_p = build1 (LABEL_EXPR, void_type_node, CASE_LABEL (expr));
1413 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1417 build_and_jump (tree *label_p)
1419 if (label_p == NULL)
1420 /* If there's nowhere to jump, just fall through. */
1423 if (*label_p == NULL_TREE)
1425 tree label = create_artificial_label ();
1429 return build1 (GOTO_EXPR, void_type_node, *label_p);
1432 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1433 This also involves building a label to jump to and communicating it to
1434 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1436 static enum gimplify_status
1437 gimplify_exit_expr (tree *expr_p)
1439 tree cond = TREE_OPERAND (*expr_p, 0);
1442 expr = build_and_jump (&gimplify_ctxp->exit_label);
1443 expr = build3 (COND_EXPR, void_type_node, cond, expr, NULL_TREE);
1449 /* A helper function to be called via walk_tree. Mark all labels under *TP
1450 as being forced. To be called for DECL_INITIAL of static variables. */
1453 force_labels_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
1457 if (TREE_CODE (*tp) == LABEL_DECL)
1458 FORCED_LABEL (*tp) = 1;
1463 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1464 different from its canonical type, wrap the whole thing inside a
1465 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1468 The canonical type of a COMPONENT_REF is the type of the field being
1469 referenced--unless the field is a bit-field which can be read directly
1470 in a smaller mode, in which case the canonical type is the
1471 sign-appropriate type corresponding to that mode. */
1474 canonicalize_component_ref (tree *expr_p)
1476 tree expr = *expr_p;
1479 gcc_assert (TREE_CODE (expr) == COMPONENT_REF);
1481 if (INTEGRAL_TYPE_P (TREE_TYPE (expr)))
1482 type = TREE_TYPE (get_unwidened (expr, NULL_TREE));
1484 type = TREE_TYPE (TREE_OPERAND (expr, 1));
1486 if (TREE_TYPE (expr) != type)
1488 tree old_type = TREE_TYPE (expr);
1490 /* Set the type of the COMPONENT_REF to the underlying type. */
1491 TREE_TYPE (expr) = type;
1493 /* And wrap the whole thing inside a NOP_EXPR. */
1494 expr = build1 (NOP_EXPR, old_type, expr);
1500 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1501 to foo, embed that change in the ADDR_EXPR by converting
1506 where L is the lower bound. For simplicity, only do this for constant
1510 canonicalize_addr_expr (tree *expr_p)
1512 tree expr = *expr_p;
1513 tree ctype = TREE_TYPE (expr);
1514 tree addr_expr = TREE_OPERAND (expr, 0);
1515 tree atype = TREE_TYPE (addr_expr);
1516 tree dctype, datype, ddatype, otype, obj_expr;
1518 /* Both cast and addr_expr types should be pointers. */
1519 if (!POINTER_TYPE_P (ctype) || !POINTER_TYPE_P (atype))
1522 /* The addr_expr type should be a pointer to an array. */
1523 datype = TREE_TYPE (atype);
1524 if (TREE_CODE (datype) != ARRAY_TYPE)
1527 /* Both cast and addr_expr types should address the same object type. */
1528 dctype = TREE_TYPE (ctype);
1529 ddatype = TREE_TYPE (datype);
1530 if (!lang_hooks.types_compatible_p (ddatype, dctype))
1533 /* The addr_expr and the object type should match. */
1534 obj_expr = TREE_OPERAND (addr_expr, 0);
1535 otype = TREE_TYPE (obj_expr);
1536 if (!lang_hooks.types_compatible_p (otype, datype))
1539 /* The lower bound and element sizes must be constant. */
1540 if (!TYPE_SIZE_UNIT (dctype)
1541 || TREE_CODE (TYPE_SIZE_UNIT (dctype)) != INTEGER_CST
1542 || !TYPE_DOMAIN (datype) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype))
1543 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype))) != INTEGER_CST)
1546 /* All checks succeeded. Build a new node to merge the cast. */
1547 *expr_p = build4 (ARRAY_REF, dctype, obj_expr,
1548 TYPE_MIN_VALUE (TYPE_DOMAIN (datype)),
1549 TYPE_MIN_VALUE (TYPE_DOMAIN (datype)),
1550 size_binop (EXACT_DIV_EXPR, TYPE_SIZE_UNIT (dctype),
1551 size_int (TYPE_ALIGN_UNIT (dctype))));
1552 *expr_p = build1 (ADDR_EXPR, ctype, *expr_p);
1555 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1556 underneath as appropriate. */
1558 static enum gimplify_status
1559 gimplify_conversion (tree *expr_p)
1561 gcc_assert (TREE_CODE (*expr_p) == NOP_EXPR
1562 || TREE_CODE (*expr_p) == CONVERT_EXPR);
1564 /* Then strip away all but the outermost conversion. */
1565 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p, 0));
1567 /* And remove the outermost conversion if it's useless. */
1568 if (tree_ssa_useless_type_conversion (*expr_p))
1569 *expr_p = TREE_OPERAND (*expr_p, 0);
1571 /* If we still have a conversion at the toplevel,
1572 then canonicalize some constructs. */
1573 if (TREE_CODE (*expr_p) == NOP_EXPR || TREE_CODE (*expr_p) == CONVERT_EXPR)
1575 tree sub = TREE_OPERAND (*expr_p, 0);
1577 /* If a NOP conversion is changing the type of a COMPONENT_REF
1578 expression, then canonicalize its type now in order to expose more
1579 redundant conversions. */
1580 if (TREE_CODE (sub) == COMPONENT_REF)
1581 canonicalize_component_ref (&TREE_OPERAND (*expr_p, 0));
1583 /* If a NOP conversion is changing a pointer to array of foo
1584 to a pointer to foo, embed that change in the ADDR_EXPR. */
1585 else if (TREE_CODE (sub) == ADDR_EXPR)
1586 canonicalize_addr_expr (expr_p);
1592 /* Gimplify a VAR_DECL or PARM_DECL. Returns GS_OK if we expanded a
1593 DECL_VALUE_EXPR, and it's worth re-examining things. */
1595 static enum gimplify_status
1596 gimplify_var_or_parm_decl (tree *expr_p)
1598 tree decl = *expr_p;
1600 /* ??? If this is a local variable, and it has not been seen in any
1601 outer BIND_EXPR, then it's probably the result of a duplicate
1602 declaration, for which we've already issued an error. It would
1603 be really nice if the front end wouldn't leak these at all.
1604 Currently the only known culprit is C++ destructors, as seen
1605 in g++.old-deja/g++.jason/binding.C. */
1606 if (TREE_CODE (decl) == VAR_DECL
1607 && !DECL_SEEN_IN_BIND_EXPR_P (decl)
1608 && !TREE_STATIC (decl) && !DECL_EXTERNAL (decl)
1609 && decl_function_context (decl) == current_function_decl)
1611 gcc_assert (errorcount || sorrycount);
1615 /* When within an OpenMP context, notice uses of variables. */
1616 if (gimplify_omp_ctxp && omp_notice_variable (gimplify_omp_ctxp, decl, true))
1619 /* If the decl is an alias for another expression, substitute it now. */
1620 if (DECL_HAS_VALUE_EXPR_P (decl))
1622 *expr_p = unshare_expr (DECL_VALUE_EXPR (decl));
1630 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1631 node pointed to by EXPR_P.
1634 : min_lval '[' val ']'
1636 | compound_lval '[' val ']'
1637 | compound_lval '.' ID
1639 This is not part of the original SIMPLE definition, which separates
1640 array and member references, but it seems reasonable to handle them
1641 together. Also, this way we don't run into problems with union
1642 aliasing; gcc requires that for accesses through a union to alias, the
1643 union reference must be explicit, which was not always the case when we
1644 were splitting up array and member refs.
1646 PRE_P points to the list where side effects that must happen before
1647 *EXPR_P should be stored.
1649 POST_P points to the list where side effects that must happen after
1650 *EXPR_P should be stored. */
1652 static enum gimplify_status
1653 gimplify_compound_lval (tree *expr_p, tree *pre_p,
1654 tree *post_p, fallback_t fallback)
1657 VEC(tree,heap) *stack;
1658 enum gimplify_status ret = GS_OK, tret;
1661 /* Create a stack of the subexpressions so later we can walk them in
1662 order from inner to outer. */
1663 stack = VEC_alloc (tree, heap, 10);
1665 /* We can handle anything that get_inner_reference can deal with. */
1666 for (p = expr_p; ; p = &TREE_OPERAND (*p, 0))
1669 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1670 if (TREE_CODE (*p) == INDIRECT_REF)
1671 *p = fold_indirect_ref (*p);
1673 if (handled_component_p (*p))
1675 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
1676 additional COMPONENT_REFs. */
1677 else if ((TREE_CODE (*p) == VAR_DECL || TREE_CODE (*p) == PARM_DECL)
1678 && gimplify_var_or_parm_decl (p) == GS_OK)
1683 VEC_safe_push (tree, heap, stack, *p);
1686 gcc_assert (VEC_length (tree, stack));
1688 /* Now STACK is a stack of pointers to all the refs we've walked through
1689 and P points to the innermost expression.
1691 Java requires that we elaborated nodes in source order. That
1692 means we must gimplify the inner expression followed by each of
1693 the indices, in order. But we can't gimplify the inner
1694 expression until we deal with any variable bounds, sizes, or
1695 positions in order to deal with PLACEHOLDER_EXPRs.
1697 So we do this in three steps. First we deal with the annotations
1698 for any variables in the components, then we gimplify the base,
1699 then we gimplify any indices, from left to right. */
1700 for (i = VEC_length (tree, stack) - 1; i >= 0; i--)
1702 tree t = VEC_index (tree, stack, i);
1704 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
1706 /* Gimplify the low bound and element type size and put them into
1707 the ARRAY_REF. If these values are set, they have already been
1709 if (!TREE_OPERAND (t, 2))
1711 tree low = unshare_expr (array_ref_low_bound (t));
1712 if (!is_gimple_min_invariant (low))
1714 TREE_OPERAND (t, 2) = low;
1715 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1716 is_gimple_formal_tmp_reg, fb_rvalue);
1717 ret = MIN (ret, tret);
1721 if (!TREE_OPERAND (t, 3))
1723 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (t, 0)));
1724 tree elmt_size = unshare_expr (array_ref_element_size (t));
1725 tree factor = size_int (TYPE_ALIGN_UNIT (elmt_type));
1727 /* Divide the element size by the alignment of the element
1729 elmt_size = size_binop (EXACT_DIV_EXPR, elmt_size, factor);
1731 if (!is_gimple_min_invariant (elmt_size))
1733 TREE_OPERAND (t, 3) = elmt_size;
1734 tret = gimplify_expr (&TREE_OPERAND (t, 3), pre_p, post_p,
1735 is_gimple_formal_tmp_reg, fb_rvalue);
1736 ret = MIN (ret, tret);
1740 else if (TREE_CODE (t) == COMPONENT_REF)
1742 /* Set the field offset into T and gimplify it. */
1743 if (!TREE_OPERAND (t, 2))
1745 tree offset = unshare_expr (component_ref_field_offset (t));
1746 tree field = TREE_OPERAND (t, 1);
1748 = size_int (DECL_OFFSET_ALIGN (field) / BITS_PER_UNIT);
1750 /* Divide the offset by its alignment. */
1751 offset = size_binop (EXACT_DIV_EXPR, offset, factor);
1753 if (!is_gimple_min_invariant (offset))
1755 TREE_OPERAND (t, 2) = offset;
1756 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1757 is_gimple_formal_tmp_reg, fb_rvalue);
1758 ret = MIN (ret, tret);
1764 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
1765 so as to match the min_lval predicate. Failure to do so may result
1766 in the creation of large aggregate temporaries. */
1767 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval,
1768 fallback | fb_lvalue);
1769 ret = MIN (ret, tret);
1771 /* And finally, the indices and operands to BIT_FIELD_REF. During this
1772 loop we also remove any useless conversions. */
1773 for (; VEC_length (tree, stack) > 0; )
1775 tree t = VEC_pop (tree, stack);
1777 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
1779 /* Gimplify the dimension.
1780 Temporary fix for gcc.c-torture/execute/20040313-1.c.
1781 Gimplify non-constant array indices into a temporary
1783 FIXME - The real fix is to gimplify post-modify
1784 expressions into a minimal gimple lvalue. However, that
1785 exposes bugs in alias analysis. The alias analyzer does
1786 not handle &PTR->FIELD very well. Will fix after the
1787 branch is merged into mainline (dnovillo 2004-05-03). */
1788 if (!is_gimple_min_invariant (TREE_OPERAND (t, 1)))
1790 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
1791 is_gimple_formal_tmp_reg, fb_rvalue);
1792 ret = MIN (ret, tret);
1795 else if (TREE_CODE (t) == BIT_FIELD_REF)
1797 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
1798 is_gimple_val, fb_rvalue);
1799 ret = MIN (ret, tret);
1800 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1801 is_gimple_val, fb_rvalue);
1802 ret = MIN (ret, tret);
1805 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t, 0));
1807 /* The innermost expression P may have originally had TREE_SIDE_EFFECTS
1808 set which would have caused all the outer expressions in EXPR_P
1809 leading to P to also have had TREE_SIDE_EFFECTS set. */
1810 recalculate_side_effects (t);
1813 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval, fallback);
1814 ret = MIN (ret, tret);
1816 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
1817 if ((fallback & fb_rvalue) && TREE_CODE (*expr_p) == COMPONENT_REF)
1819 canonicalize_component_ref (expr_p);
1820 ret = MIN (ret, GS_OK);
1823 VEC_free (tree, heap, stack);
1828 /* Gimplify the self modifying expression pointed to by EXPR_P
1831 PRE_P points to the list where side effects that must happen before
1832 *EXPR_P should be stored.
1834 POST_P points to the list where side effects that must happen after
1835 *EXPR_P should be stored.
1837 WANT_VALUE is nonzero iff we want to use the value of this expression
1838 in another expression. */
1840 static enum gimplify_status
1841 gimplify_self_mod_expr (tree *expr_p, tree *pre_p, tree *post_p,
1844 enum tree_code code;
1845 tree lhs, lvalue, rhs, t1;
1847 enum tree_code arith_code;
1848 enum gimplify_status ret;
1850 code = TREE_CODE (*expr_p);
1852 gcc_assert (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR
1853 || code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR);
1855 /* Prefix or postfix? */
1856 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
1857 /* Faster to treat as prefix if result is not used. */
1858 postfix = want_value;
1862 /* Add or subtract? */
1863 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
1864 arith_code = PLUS_EXPR;
1866 arith_code = MINUS_EXPR;
1868 /* Gimplify the LHS into a GIMPLE lvalue. */
1869 lvalue = TREE_OPERAND (*expr_p, 0);
1870 ret = gimplify_expr (&lvalue, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
1871 if (ret == GS_ERROR)
1874 /* Extract the operands to the arithmetic operation. */
1876 rhs = TREE_OPERAND (*expr_p, 1);
1878 /* For postfix operator, we evaluate the LHS to an rvalue and then use
1879 that as the result value and in the postqueue operation. */
1882 ret = gimplify_expr (&lhs, pre_p, post_p, is_gimple_val, fb_rvalue);
1883 if (ret == GS_ERROR)
1887 t1 = build2 (arith_code, TREE_TYPE (*expr_p), lhs, rhs);
1888 t1 = build2 (MODIFY_EXPR, TREE_TYPE (lvalue), lvalue, t1);
1892 gimplify_and_add (t1, post_p);
1903 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
1906 maybe_with_size_expr (tree *expr_p)
1908 tree expr = *expr_p;
1909 tree type = TREE_TYPE (expr);
1912 /* If we've already wrapped this or the type is error_mark_node, we can't do
1914 if (TREE_CODE (expr) == WITH_SIZE_EXPR
1915 || type == error_mark_node)
1918 /* If the size isn't known or is a constant, we have nothing to do. */
1919 size = TYPE_SIZE_UNIT (type);
1920 if (!size || TREE_CODE (size) == INTEGER_CST)
1923 /* Otherwise, make a WITH_SIZE_EXPR. */
1924 size = unshare_expr (size);
1925 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, expr);
1926 *expr_p = build2 (WITH_SIZE_EXPR, type, expr, size);
1929 /* Subroutine of gimplify_call_expr: Gimplify a single argument. */
1931 static enum gimplify_status
1932 gimplify_arg (tree *expr_p, tree *pre_p)
1934 bool (*test) (tree);
1937 /* In general, we allow lvalues for function arguments to avoid
1938 extra overhead of copying large aggregates out of even larger
1939 aggregates into temporaries only to copy the temporaries to
1940 the argument list. Make optimizers happy by pulling out to
1941 temporaries those types that fit in registers. */
1942 if (is_gimple_reg_type (TREE_TYPE (*expr_p)))
1943 test = is_gimple_val, fb = fb_rvalue;
1945 test = is_gimple_lvalue, fb = fb_either;
1947 /* If this is a variable sized type, we must remember the size. */
1948 maybe_with_size_expr (expr_p);
1950 /* There is a sequence point before a function call. Side effects in
1951 the argument list must occur before the actual call. So, when
1952 gimplifying arguments, force gimplify_expr to use an internal
1953 post queue which is then appended to the end of PRE_P. */
1954 return gimplify_expr (expr_p, pre_p, NULL, test, fb);
1957 /* Gimplify the CALL_EXPR node pointed to by EXPR_P. PRE_P points to the
1958 list where side effects that must happen before *EXPR_P should be stored.
1959 WANT_VALUE is true if the result of the call is desired. */
1961 static enum gimplify_status
1962 gimplify_call_expr (tree *expr_p, tree *pre_p, bool want_value)
1966 enum gimplify_status ret;
1968 gcc_assert (TREE_CODE (*expr_p) == CALL_EXPR);
1970 /* For reliable diagnostics during inlining, it is necessary that
1971 every call_expr be annotated with file and line. */
1972 if (! EXPR_HAS_LOCATION (*expr_p))
1973 SET_EXPR_LOCATION (*expr_p, input_location);
1975 /* This may be a call to a builtin function.
1977 Builtin function calls may be transformed into different
1978 (and more efficient) builtin function calls under certain
1979 circumstances. Unfortunately, gimplification can muck things
1980 up enough that the builtin expanders are not aware that certain
1981 transformations are still valid.
1983 So we attempt transformation/gimplification of the call before
1984 we gimplify the CALL_EXPR. At this time we do not manage to
1985 transform all calls in the same manner as the expanders do, but
1986 we do transform most of them. */
1987 decl = get_callee_fndecl (*expr_p);
1988 if (decl && DECL_BUILT_IN (decl))
1990 tree arglist = TREE_OPERAND (*expr_p, 1);
1991 tree new = fold_builtin (decl, arglist, !want_value);
1993 if (new && new != *expr_p)
1995 /* There was a transformation of this call which computes the
1996 same value, but in a more efficient way. Return and try
2002 if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
2003 && DECL_FUNCTION_CODE (decl) == BUILT_IN_VA_START)
2005 if (!arglist || !TREE_CHAIN (arglist))
2007 error ("too few arguments to function %<va_start%>");
2008 *expr_p = build_empty_stmt ();
2012 if (fold_builtin_next_arg (TREE_CHAIN (arglist)))
2014 *expr_p = build_empty_stmt ();
2017 /* Avoid gimplifying the second argument to va_start, which needs
2018 to be the plain PARM_DECL. */
2019 return gimplify_arg (&TREE_VALUE (TREE_OPERAND (*expr_p, 1)), pre_p);
2023 /* There is a sequence point before the call, so any side effects in
2024 the calling expression must occur before the actual call. Force
2025 gimplify_expr to use an internal post queue. */
2026 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, NULL,
2027 is_gimple_call_addr, fb_rvalue);
2029 if (PUSH_ARGS_REVERSED)
2030 TREE_OPERAND (*expr_p, 1) = nreverse (TREE_OPERAND (*expr_p, 1));
2031 for (arglist = TREE_OPERAND (*expr_p, 1); arglist;
2032 arglist = TREE_CHAIN (arglist))
2034 enum gimplify_status t;
2036 t = gimplify_arg (&TREE_VALUE (arglist), pre_p);
2041 if (PUSH_ARGS_REVERSED)
2042 TREE_OPERAND (*expr_p, 1) = nreverse (TREE_OPERAND (*expr_p, 1));
2044 /* Try this again in case gimplification exposed something. */
2045 if (ret != GS_ERROR)
2047 decl = get_callee_fndecl (*expr_p);
2048 if (decl && DECL_BUILT_IN (decl))
2050 tree arglist = TREE_OPERAND (*expr_p, 1);
2051 tree new = fold_builtin (decl, arglist, !want_value);
2053 if (new && new != *expr_p)
2055 /* There was a transformation of this call which computes the
2056 same value, but in a more efficient way. Return and try
2064 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2065 decl. This allows us to eliminate redundant or useless
2066 calls to "const" functions. */
2067 if (TREE_CODE (*expr_p) == CALL_EXPR
2068 && (call_expr_flags (*expr_p) & (ECF_CONST | ECF_PURE)))
2069 TREE_SIDE_EFFECTS (*expr_p) = 0;
2074 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2075 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2077 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2078 condition is true or false, respectively. If null, we should generate
2079 our own to skip over the evaluation of this specific expression.
2081 This function is the tree equivalent of do_jump.
2083 shortcut_cond_r should only be called by shortcut_cond_expr. */
2086 shortcut_cond_r (tree pred, tree *true_label_p, tree *false_label_p)
2088 tree local_label = NULL_TREE;
2089 tree t, expr = NULL;
2091 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2092 retain the shortcut semantics. Just insert the gotos here;
2093 shortcut_cond_expr will append the real blocks later. */
2094 if (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2096 /* Turn if (a && b) into
2098 if (a); else goto no;
2099 if (b) goto yes; else goto no;
2102 if (false_label_p == NULL)
2103 false_label_p = &local_label;
2105 t = shortcut_cond_r (TREE_OPERAND (pred, 0), NULL, false_label_p);
2106 append_to_statement_list (t, &expr);
2108 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2110 append_to_statement_list (t, &expr);
2112 else if (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2114 /* Turn if (a || b) into
2117 if (b) goto yes; else goto no;
2120 if (true_label_p == NULL)
2121 true_label_p = &local_label;
2123 t = shortcut_cond_r (TREE_OPERAND (pred, 0), true_label_p, NULL);
2124 append_to_statement_list (t, &expr);
2126 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2128 append_to_statement_list (t, &expr);
2130 else if (TREE_CODE (pred) == COND_EXPR)
2132 /* As long as we're messing with gotos, turn if (a ? b : c) into
2134 if (b) goto yes; else goto no;
2136 if (c) goto yes; else goto no; */
2137 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (pred, 0),
2138 shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2140 shortcut_cond_r (TREE_OPERAND (pred, 2), true_label_p,
2145 expr = build3 (COND_EXPR, void_type_node, pred,
2146 build_and_jump (true_label_p),
2147 build_and_jump (false_label_p));
2152 t = build1 (LABEL_EXPR, void_type_node, local_label);
2153 append_to_statement_list (t, &expr);
2160 shortcut_cond_expr (tree expr)
2162 tree pred = TREE_OPERAND (expr, 0);
2163 tree then_ = TREE_OPERAND (expr, 1);
2164 tree else_ = TREE_OPERAND (expr, 2);
2165 tree true_label, false_label, end_label, t;
2167 tree *false_label_p;
2168 bool emit_end, emit_false, jump_over_else;
2169 bool then_se = then_ && TREE_SIDE_EFFECTS (then_);
2170 bool else_se = else_ && TREE_SIDE_EFFECTS (else_);
2172 /* First do simple transformations. */
2175 /* If there is no 'else', turn (a && b) into if (a) if (b). */
2176 while (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2178 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2179 then_ = shortcut_cond_expr (expr);
2180 then_se = then_ && TREE_SIDE_EFFECTS (then_);
2181 pred = TREE_OPERAND (pred, 0);
2182 expr = build3 (COND_EXPR, void_type_node, pred, then_, NULL_TREE);
2187 /* If there is no 'then', turn
2190 if (a); else if (b); else d. */
2191 while (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2193 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2194 else_ = shortcut_cond_expr (expr);
2195 else_se = else_ && TREE_SIDE_EFFECTS (else_);
2196 pred = TREE_OPERAND (pred, 0);
2197 expr = build3 (COND_EXPR, void_type_node, pred, NULL_TREE, else_);
2201 /* If we're done, great. */
2202 if (TREE_CODE (pred) != TRUTH_ANDIF_EXPR
2203 && TREE_CODE (pred) != TRUTH_ORIF_EXPR)
2206 /* Otherwise we need to mess with gotos. Change
2209 if (a); else goto no;
2212 and recursively gimplify the condition. */
2214 true_label = false_label = end_label = NULL_TREE;
2216 /* If our arms just jump somewhere, hijack those labels so we don't
2217 generate jumps to jumps. */
2220 && TREE_CODE (then_) == GOTO_EXPR
2221 && TREE_CODE (GOTO_DESTINATION (then_)) == LABEL_DECL)
2223 true_label = GOTO_DESTINATION (then_);
2229 && TREE_CODE (else_) == GOTO_EXPR
2230 && TREE_CODE (GOTO_DESTINATION (else_)) == LABEL_DECL)
2232 false_label = GOTO_DESTINATION (else_);
2237 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2239 true_label_p = &true_label;
2241 true_label_p = NULL;
2243 /* The 'else' branch also needs a label if it contains interesting code. */
2244 if (false_label || else_se)
2245 false_label_p = &false_label;
2247 false_label_p = NULL;
2249 /* If there was nothing else in our arms, just forward the label(s). */
2250 if (!then_se && !else_se)
2251 return shortcut_cond_r (pred, true_label_p, false_label_p);
2253 /* If our last subexpression already has a terminal label, reuse it. */
2255 expr = expr_last (else_);
2257 expr = expr_last (then_);
2260 if (expr && TREE_CODE (expr) == LABEL_EXPR)
2261 end_label = LABEL_EXPR_LABEL (expr);
2263 /* If we don't care about jumping to the 'else' branch, jump to the end
2264 if the condition is false. */
2266 false_label_p = &end_label;
2268 /* We only want to emit these labels if we aren't hijacking them. */
2269 emit_end = (end_label == NULL_TREE);
2270 emit_false = (false_label == NULL_TREE);
2272 /* We only emit the jump over the else clause if we have to--if the
2273 then clause may fall through. Otherwise we can wind up with a
2274 useless jump and a useless label at the end of gimplified code,
2275 which will cause us to think that this conditional as a whole
2276 falls through even if it doesn't. If we then inline a function
2277 which ends with such a condition, that can cause us to issue an
2278 inappropriate warning about control reaching the end of a
2279 non-void function. */
2280 jump_over_else = block_may_fallthru (then_);
2282 pred = shortcut_cond_r (pred, true_label_p, false_label_p);
2285 append_to_statement_list (pred, &expr);
2287 append_to_statement_list (then_, &expr);
2292 t = build_and_jump (&end_label);
2293 append_to_statement_list (t, &expr);
2297 t = build1 (LABEL_EXPR, void_type_node, false_label);
2298 append_to_statement_list (t, &expr);
2300 append_to_statement_list (else_, &expr);
2302 if (emit_end && end_label)
2304 t = build1 (LABEL_EXPR, void_type_node, end_label);
2305 append_to_statement_list (t, &expr);
2311 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2314 gimple_boolify (tree expr)
2316 tree type = TREE_TYPE (expr);
2318 if (TREE_CODE (type) == BOOLEAN_TYPE)
2321 switch (TREE_CODE (expr))
2323 case TRUTH_AND_EXPR:
2325 case TRUTH_XOR_EXPR:
2326 case TRUTH_ANDIF_EXPR:
2327 case TRUTH_ORIF_EXPR:
2328 /* Also boolify the arguments of truth exprs. */
2329 TREE_OPERAND (expr, 1) = gimple_boolify (TREE_OPERAND (expr, 1));
2332 case TRUTH_NOT_EXPR:
2333 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2336 case EQ_EXPR: case NE_EXPR:
2337 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2338 /* These expressions always produce boolean results. */
2339 TREE_TYPE (expr) = boolean_type_node;
2343 /* Other expressions that get here must have boolean values, but
2344 might need to be converted to the appropriate mode. */
2345 return fold_convert (boolean_type_node, expr);
2349 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2358 The second form is used when *EXPR_P is of type void.
2360 TARGET is the tree for T1 above.
2362 PRE_P points to the list where side effects that must happen before
2363 *EXPR_P should be stored. */
2365 static enum gimplify_status
2366 gimplify_cond_expr (tree *expr_p, tree *pre_p, fallback_t fallback)
2368 tree expr = *expr_p;
2369 tree tmp, tmp2, type;
2370 enum gimplify_status ret;
2372 type = TREE_TYPE (expr);
2374 /* If this COND_EXPR has a value, copy the values into a temporary within
2376 if (! VOID_TYPE_P (type))
2380 if ((fallback & fb_lvalue) == 0)
2382 result = tmp2 = tmp = create_tmp_var (TREE_TYPE (expr), "iftmp");
2387 tree type = build_pointer_type (TREE_TYPE (expr));
2389 if (TREE_TYPE (TREE_OPERAND (expr, 1)) != void_type_node)
2390 TREE_OPERAND (expr, 1) =
2391 build_fold_addr_expr (TREE_OPERAND (expr, 1));
2393 if (TREE_TYPE (TREE_OPERAND (expr, 2)) != void_type_node)
2394 TREE_OPERAND (expr, 2) =
2395 build_fold_addr_expr (TREE_OPERAND (expr, 2));
2397 tmp2 = tmp = create_tmp_var (type, "iftmp");
2399 expr = build3 (COND_EXPR, void_type_node, TREE_OPERAND (expr, 0),
2400 TREE_OPERAND (expr, 1), TREE_OPERAND (expr, 2));
2402 result = build_fold_indirect_ref (tmp);
2406 /* Build the then clause, 't1 = a;'. But don't build an assignment
2407 if this branch is void; in C++ it can be, if it's a throw. */
2408 if (TREE_TYPE (TREE_OPERAND (expr, 1)) != void_type_node)
2409 TREE_OPERAND (expr, 1)
2410 = build2 (MODIFY_EXPR, void_type_node, tmp, TREE_OPERAND (expr, 1));
2412 /* Build the else clause, 't1 = b;'. */
2413 if (TREE_TYPE (TREE_OPERAND (expr, 2)) != void_type_node)
2414 TREE_OPERAND (expr, 2)
2415 = build2 (MODIFY_EXPR, void_type_node, tmp2, TREE_OPERAND (expr, 2));
2417 TREE_TYPE (expr) = void_type_node;
2418 recalculate_side_effects (expr);
2420 /* Move the COND_EXPR to the prequeue. */
2421 gimplify_and_add (expr, pre_p);
2427 /* Make sure the condition has BOOLEAN_TYPE. */
2428 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2430 /* Break apart && and || conditions. */
2431 if (TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ANDIF_EXPR
2432 || TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ORIF_EXPR)
2434 expr = shortcut_cond_expr (expr);
2436 if (expr != *expr_p)
2440 /* We can't rely on gimplify_expr to re-gimplify the expanded
2441 form properly, as cleanups might cause the target labels to be
2442 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2443 set up a conditional context. */
2444 gimple_push_condition ();
2445 gimplify_stmt (expr_p);
2446 gimple_pop_condition (pre_p);
2452 /* Now do the normal gimplification. */
2453 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL,
2454 is_gimple_condexpr, fb_rvalue);
2456 gimple_push_condition ();
2458 gimplify_to_stmt_list (&TREE_OPERAND (expr, 1));
2459 gimplify_to_stmt_list (&TREE_OPERAND (expr, 2));
2460 recalculate_side_effects (expr);
2462 gimple_pop_condition (pre_p);
2464 if (ret == GS_ERROR)
2466 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2468 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 2)))
2469 /* Rewrite "if (a); else b" to "if (!a) b" */
2471 TREE_OPERAND (expr, 0) = invert_truthvalue (TREE_OPERAND (expr, 0));
2472 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL,
2473 is_gimple_condexpr, fb_rvalue);
2475 tmp = TREE_OPERAND (expr, 1);
2476 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 2);
2477 TREE_OPERAND (expr, 2) = tmp;
2480 /* Both arms are empty; replace the COND_EXPR with its predicate. */
2481 expr = TREE_OPERAND (expr, 0);
2487 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2488 a call to __builtin_memcpy. */
2490 static enum gimplify_status
2491 gimplify_modify_expr_to_memcpy (tree *expr_p, tree size, bool want_value)
2493 tree args, t, to, to_ptr, from;
2495 to = TREE_OPERAND (*expr_p, 0);
2496 from = TREE_OPERAND (*expr_p, 1);
2498 args = tree_cons (NULL, size, NULL);
2500 t = build_fold_addr_expr (from);
2501 args = tree_cons (NULL, t, args);
2503 to_ptr = build_fold_addr_expr (to);
2504 args = tree_cons (NULL, to_ptr, args);
2505 t = implicit_built_in_decls[BUILT_IN_MEMCPY];
2506 t = build_function_call_expr (t, args);
2510 t = build1 (NOP_EXPR, TREE_TYPE (to_ptr), t);
2511 t = build1 (INDIRECT_REF, TREE_TYPE (to), t);
2518 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2519 a call to __builtin_memset. In this case we know that the RHS is
2520 a CONSTRUCTOR with an empty element list. */
2522 static enum gimplify_status
2523 gimplify_modify_expr_to_memset (tree *expr_p, tree size, bool want_value)
2525 tree args, t, to, to_ptr;
2527 to = TREE_OPERAND (*expr_p, 0);
2529 args = tree_cons (NULL, size, NULL);
2531 args = tree_cons (NULL, integer_zero_node, args);
2533 to_ptr = build_fold_addr_expr (to);
2534 args = tree_cons (NULL, to_ptr, args);
2535 t = implicit_built_in_decls[BUILT_IN_MEMSET];
2536 t = build_function_call_expr (t, args);
2540 t = build1 (NOP_EXPR, TREE_TYPE (to_ptr), t);
2541 t = build1 (INDIRECT_REF, TREE_TYPE (to), t);
2548 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
2549 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
2550 assignment. Returns non-null if we detect a potential overlap. */
2552 struct gimplify_init_ctor_preeval_data
2554 /* The base decl of the lhs object. May be NULL, in which case we
2555 have to assume the lhs is indirect. */
2558 /* The alias set of the lhs object. */
2563 gimplify_init_ctor_preeval_1 (tree *tp, int *walk_subtrees, void *xdata)
2565 struct gimplify_init_ctor_preeval_data *data
2566 = (struct gimplify_init_ctor_preeval_data *) xdata;
2569 /* If we find the base object, obviously we have overlap. */
2570 if (data->lhs_base_decl == t)
2573 /* If the constructor component is indirect, determine if we have a
2574 potential overlap with the lhs. The only bits of information we
2575 have to go on at this point are addressability and alias sets. */
2576 if (TREE_CODE (t) == INDIRECT_REF
2577 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
2578 && alias_sets_conflict_p (data->lhs_alias_set, get_alias_set (t)))
2581 if (IS_TYPE_OR_DECL_P (t))
2586 /* A subroutine of gimplify_init_constructor. Pre-evaluate *EXPR_P,
2587 force values that overlap with the lhs (as described by *DATA)
2588 into temporaries. */
2591 gimplify_init_ctor_preeval (tree *expr_p, tree *pre_p, tree *post_p,
2592 struct gimplify_init_ctor_preeval_data *data)
2594 enum gimplify_status one;
2596 /* If the value is invariant, then there's nothing to pre-evaluate.
2597 But ensure it doesn't have any side-effects since a SAVE_EXPR is
2598 invariant but has side effects and might contain a reference to
2599 the object we're initializing. */
2600 if (TREE_INVARIANT (*expr_p) && !TREE_SIDE_EFFECTS (*expr_p))
2603 /* If the type has non-trivial constructors, we can't pre-evaluate. */
2604 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p)))
2607 /* Recurse for nested constructors. */
2608 if (TREE_CODE (*expr_p) == CONSTRUCTOR)
2610 unsigned HOST_WIDE_INT ix;
2611 constructor_elt *ce;
2612 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (*expr_p);
2614 for (ix = 0; VEC_iterate (constructor_elt, v, ix, ce); ix++)
2615 gimplify_init_ctor_preeval (&ce->value, pre_p, post_p, data);
2619 /* We can't preevaluate if the type contains a placeholder. */
2620 if (type_contains_placeholder_p (TREE_TYPE (*expr_p)))
2623 /* Gimplify the constructor element to something appropriate for the rhs
2624 of a MODIFY_EXPR. Given that we know the lhs is an aggregate, we know
2625 the gimplifier will consider this a store to memory. Doing this
2626 gimplification now means that we won't have to deal with complicated
2627 language-specific trees, nor trees like SAVE_EXPR that can induce
2628 exponential search behavior. */
2629 one = gimplify_expr (expr_p, pre_p, post_p, is_gimple_mem_rhs, fb_rvalue);
2630 if (one == GS_ERROR)
2636 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
2637 with the lhs, since "a = { .x=a }" doesn't make sense. This will
2638 always be true for all scalars, since is_gimple_mem_rhs insists on a
2639 temporary variable for them. */
2640 if (DECL_P (*expr_p))
2643 /* If this is of variable size, we have no choice but to assume it doesn't
2644 overlap since we can't make a temporary for it. */
2645 if (!TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (*expr_p))))
2648 /* Otherwise, we must search for overlap ... */
2649 if (!walk_tree (expr_p, gimplify_init_ctor_preeval_1, data, NULL))
2652 /* ... and if found, force the value into a temporary. */
2653 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
2656 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
2657 a RANGE_EXPR in a CONSTRUCTOR for an array.
2661 object[var] = value;
2668 We increment var _after_ the loop exit check because we might otherwise
2669 fail if upper == TYPE_MAX_VALUE (type for upper).
2671 Note that we never have to deal with SAVE_EXPRs here, because this has
2672 already been taken care of for us, in gimplify_init_ctor_preeval(). */
2674 static void gimplify_init_ctor_eval (tree, VEC(constructor_elt,gc) *,
2678 gimplify_init_ctor_eval_range (tree object, tree lower, tree upper,
2679 tree value, tree array_elt_type,
2680 tree *pre_p, bool cleared)
2682 tree loop_entry_label, loop_exit_label;
2683 tree var, var_type, cref;
2685 loop_entry_label = create_artificial_label ();
2686 loop_exit_label = create_artificial_label ();
2688 /* Create and initialize the index variable. */
2689 var_type = TREE_TYPE (upper);
2690 var = create_tmp_var (var_type, NULL);
2691 append_to_statement_list (build2 (MODIFY_EXPR, var_type, var, lower), pre_p);
2693 /* Add the loop entry label. */
2694 append_to_statement_list (build1 (LABEL_EXPR,
2699 /* Build the reference. */
2700 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
2701 var, NULL_TREE, NULL_TREE);
2703 /* If we are a constructor, just call gimplify_init_ctor_eval to do
2704 the store. Otherwise just assign value to the reference. */
2706 if (TREE_CODE (value) == CONSTRUCTOR)
2707 /* NB we might have to call ourself recursively through
2708 gimplify_init_ctor_eval if the value is a constructor. */
2709 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
2712 append_to_statement_list (build2 (MODIFY_EXPR, TREE_TYPE (cref),
2716 /* We exit the loop when the index var is equal to the upper bound. */
2717 gimplify_and_add (build3 (COND_EXPR, void_type_node,
2718 build2 (EQ_EXPR, boolean_type_node,
2726 /* Otherwise, increment the index var... */
2727 append_to_statement_list (build2 (MODIFY_EXPR, var_type, var,
2728 build2 (PLUS_EXPR, var_type, var,
2729 fold_convert (var_type,
2730 integer_one_node))),
2733 /* ...and jump back to the loop entry. */
2734 append_to_statement_list (build1 (GOTO_EXPR,
2739 /* Add the loop exit label. */
2740 append_to_statement_list (build1 (LABEL_EXPR,
2746 /* Return true if FDECL is accessing a field that is zero sized. */
2749 zero_sized_field_decl (tree fdecl)
2751 if (TREE_CODE (fdecl) == FIELD_DECL && DECL_SIZE (fdecl)
2752 && integer_zerop (DECL_SIZE (fdecl)))
2757 /* Return true if TYPE is zero sized. */
2760 zero_sized_type (tree type)
2762 if (AGGREGATE_TYPE_P (type) && TYPE_SIZE (type)
2763 && integer_zerop (TYPE_SIZE (type)))
2768 /* A subroutine of gimplify_init_constructor. Generate individual
2769 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
2770 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
2771 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
2775 gimplify_init_ctor_eval (tree object, VEC(constructor_elt,gc) *elts,
2776 tree *pre_p, bool cleared)
2778 tree array_elt_type = NULL;
2779 unsigned HOST_WIDE_INT ix;
2780 tree purpose, value;
2782 if (TREE_CODE (TREE_TYPE (object)) == ARRAY_TYPE)
2783 array_elt_type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object)));
2785 FOR_EACH_CONSTRUCTOR_ELT (elts, ix, purpose, value)
2789 /* NULL values are created above for gimplification errors. */
2793 if (cleared && initializer_zerop (value))
2796 /* ??? Here's to hoping the front end fills in all of the indices,
2797 so we don't have to figure out what's missing ourselves. */
2798 gcc_assert (purpose);
2800 /* Skip zero-sized fields, unless value has side-effects. This can
2801 happen with calls to functions returning a zero-sized type, which
2802 we shouldn't discard. As a number of downstream passes don't
2803 expect sets of zero-sized fields, we rely on the gimplification of
2804 the MODIFY_EXPR we make below to drop the assignment statement. */
2805 if (! TREE_SIDE_EFFECTS (value) && zero_sized_field_decl (purpose))
2808 /* If we have a RANGE_EXPR, we have to build a loop to assign the
2810 if (TREE_CODE (purpose) == RANGE_EXPR)
2812 tree lower = TREE_OPERAND (purpose, 0);
2813 tree upper = TREE_OPERAND (purpose, 1);
2815 /* If the lower bound is equal to upper, just treat it as if
2816 upper was the index. */
2817 if (simple_cst_equal (lower, upper))
2821 gimplify_init_ctor_eval_range (object, lower, upper, value,
2822 array_elt_type, pre_p, cleared);
2829 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
2830 purpose, NULL_TREE, NULL_TREE);
2834 gcc_assert (TREE_CODE (purpose) == FIELD_DECL);
2835 cref = build3 (COMPONENT_REF, TREE_TYPE (purpose),
2836 unshare_expr (object), purpose, NULL_TREE);
2839 if (TREE_CODE (value) == CONSTRUCTOR
2840 && TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE)
2841 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
2845 init = build2 (INIT_EXPR, TREE_TYPE (cref), cref, value);
2846 gimplify_and_add (init, pre_p);
2851 /* A subroutine of gimplify_modify_expr. Break out elements of a
2852 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
2854 Note that we still need to clear any elements that don't have explicit
2855 initializers, so if not all elements are initialized we keep the
2856 original MODIFY_EXPR, we just remove all of the constructor elements. */
2858 static enum gimplify_status
2859 gimplify_init_constructor (tree *expr_p, tree *pre_p,
2860 tree *post_p, bool want_value)
2863 tree ctor = TREE_OPERAND (*expr_p, 1);
2864 tree type = TREE_TYPE (ctor);
2865 enum gimplify_status ret;
2866 VEC(constructor_elt,gc) *elts;
2868 if (TREE_CODE (ctor) != CONSTRUCTOR)
2869 return GS_UNHANDLED;
2871 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
2872 is_gimple_lvalue, fb_lvalue);
2873 if (ret == GS_ERROR)
2875 object = TREE_OPERAND (*expr_p, 0);
2877 elts = CONSTRUCTOR_ELTS (ctor);
2880 switch (TREE_CODE (type))
2884 case QUAL_UNION_TYPE:
2887 struct gimplify_init_ctor_preeval_data preeval_data;
2888 HOST_WIDE_INT num_type_elements, num_ctor_elements;
2889 HOST_WIDE_INT num_nonzero_elements, num_nonconstant_elements;
2892 /* Aggregate types must lower constructors to initialization of
2893 individual elements. The exception is that a CONSTRUCTOR node
2894 with no elements indicates zero-initialization of the whole. */
2895 if (VEC_empty (constructor_elt, elts))
2898 categorize_ctor_elements (ctor, &num_nonzero_elements,
2899 &num_nonconstant_elements,
2900 &num_ctor_elements, &cleared);
2902 /* If a const aggregate variable is being initialized, then it
2903 should never be a lose to promote the variable to be static. */
2904 if (num_nonconstant_elements == 0
2905 && num_nonzero_elements > 1
2906 && TREE_READONLY (object)
2907 && TREE_CODE (object) == VAR_DECL)
2909 DECL_INITIAL (object) = ctor;
2910 TREE_STATIC (object) = 1;
2911 if (!DECL_NAME (object))
2912 DECL_NAME (object) = create_tmp_var_name ("C");
2913 walk_tree (&DECL_INITIAL (object), force_labels_r, NULL, NULL);
2915 /* ??? C++ doesn't automatically append a .<number> to the
2916 assembler name, and even when it does, it looks a FE private
2917 data structures to figure out what that number should be,
2918 which are not set for this variable. I suppose this is
2919 important for local statics for inline functions, which aren't
2920 "local" in the object file sense. So in order to get a unique
2921 TU-local symbol, we must invoke the lhd version now. */
2922 lhd_set_decl_assembler_name (object);
2924 *expr_p = NULL_TREE;
2928 /* If there are "lots" of initialized elements, even discounting
2929 those that are not address constants (and thus *must* be
2930 computed at runtime), then partition the constructor into
2931 constant and non-constant parts. Block copy the constant
2932 parts in, then generate code for the non-constant parts. */
2933 /* TODO. There's code in cp/typeck.c to do this. */
2935 num_type_elements = count_type_elements (type, true);
2937 /* If count_type_elements could not determine number of type elements
2938 for a constant-sized object, assume clearing is needed.
2939 Don't do this for variable-sized objects, as store_constructor
2940 will ignore the clearing of variable-sized objects. */
2941 if (num_type_elements < 0 && int_size_in_bytes (type) >= 0)
2943 /* If there are "lots" of zeros, then block clear the object first. */
2944 else if (num_type_elements - num_nonzero_elements > CLEAR_RATIO
2945 && num_nonzero_elements < num_type_elements/4)
2947 /* ??? This bit ought not be needed. For any element not present
2948 in the initializer, we should simply set them to zero. Except
2949 we'd need to *find* the elements that are not present, and that
2950 requires trickery to avoid quadratic compile-time behavior in
2951 large cases or excessive memory use in small cases. */
2952 else if (num_ctor_elements < num_type_elements)
2955 /* If there are "lots" of initialized elements, and all of them
2956 are valid address constants, then the entire initializer can
2957 be dropped to memory, and then memcpy'd out. Don't do this
2958 for sparse arrays, though, as it's more efficient to follow
2959 the standard CONSTRUCTOR behavior of memset followed by
2960 individual element initialization. */
2961 if (num_nonconstant_elements == 0 && !cleared)
2963 HOST_WIDE_INT size = int_size_in_bytes (type);
2966 /* ??? We can still get unbounded array types, at least
2967 from the C++ front end. This seems wrong, but attempt
2968 to work around it for now. */
2971 size = int_size_in_bytes (TREE_TYPE (object));
2973 TREE_TYPE (ctor) = type = TREE_TYPE (object);
2976 /* Find the maximum alignment we can assume for the object. */
2977 /* ??? Make use of DECL_OFFSET_ALIGN. */
2978 if (DECL_P (object))
2979 align = DECL_ALIGN (object);
2981 align = TYPE_ALIGN (type);
2983 if (size > 0 && !can_move_by_pieces (size, align))
2985 tree new = create_tmp_var_raw (type, "C");
2987 gimple_add_tmp_var (new);
2988 TREE_STATIC (new) = 1;
2989 TREE_READONLY (new) = 1;
2990 DECL_INITIAL (new) = ctor;
2991 if (align > DECL_ALIGN (new))
2993 DECL_ALIGN (new) = align;
2994 DECL_USER_ALIGN (new) = 1;
2996 walk_tree (&DECL_INITIAL (new), force_labels_r, NULL, NULL);
2998 TREE_OPERAND (*expr_p, 1) = new;
3000 /* This is no longer an assignment of a CONSTRUCTOR, but
3001 we still may have processing to do on the LHS. So
3002 pretend we didn't do anything here to let that happen. */
3003 return GS_UNHANDLED;
3009 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3010 Note that we still have to gimplify, in order to handle the
3011 case of variable sized types. Avoid shared tree structures. */
3012 CONSTRUCTOR_ELTS (ctor) = NULL;
3013 object = unshare_expr (object);
3014 gimplify_stmt (expr_p);
3015 append_to_statement_list (*expr_p, pre_p);
3018 /* If we have not block cleared the object, or if there are nonzero
3019 elements in the constructor, add assignments to the individual
3020 scalar fields of the object. */
3021 if (!cleared || num_nonzero_elements > 0)
3023 preeval_data.lhs_base_decl = get_base_address (object);
3024 if (!DECL_P (preeval_data.lhs_base_decl))
3025 preeval_data.lhs_base_decl = NULL;
3026 preeval_data.lhs_alias_set = get_alias_set (object);
3028 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p, 1),
3029 pre_p, post_p, &preeval_data);
3030 gimplify_init_ctor_eval (object, elts, pre_p, cleared);
3033 *expr_p = NULL_TREE;
3041 /* Extract the real and imaginary parts out of the ctor. */
3042 gcc_assert (VEC_length (constructor_elt, elts) == 2);
3043 r = VEC_index (constructor_elt, elts, 0)->value;
3044 i = VEC_index (constructor_elt, elts, 1)->value;
3045 if (r == NULL || i == NULL)
3047 tree zero = fold_convert (TREE_TYPE (type), integer_zero_node);
3054 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3055 represent creation of a complex value. */
3056 if (TREE_CONSTANT (r) && TREE_CONSTANT (i))
3058 ctor = build_complex (type, r, i);
3059 TREE_OPERAND (*expr_p, 1) = ctor;
3063 ctor = build2 (COMPLEX_EXPR, type, r, i);
3064 TREE_OPERAND (*expr_p, 1) = ctor;
3065 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
3066 rhs_predicate_for (TREE_OPERAND (*expr_p, 0)),
3074 unsigned HOST_WIDE_INT ix;
3075 constructor_elt *ce;
3077 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3078 if (TREE_CONSTANT (ctor))
3080 bool constant_p = true;
3083 /* Even when ctor is constant, it might contain non-*_CST
3084 elements (e.g. { 1.0/0.0 - 1.0/0.0, 0.0 }) and those don't
3085 belong into VECTOR_CST nodes. */
3086 FOR_EACH_CONSTRUCTOR_VALUE (elts, ix, value)
3087 if (!CONSTANT_CLASS_P (value))
3095 TREE_OPERAND (*expr_p, 1) = build_vector_from_ctor (type, elts);
3100 /* Vector types use CONSTRUCTOR all the way through gimple
3101 compilation as a general initializer. */
3102 for (ix = 0; VEC_iterate (constructor_elt, elts, ix, ce); ix++)
3104 enum gimplify_status tret;
3105 tret = gimplify_expr (&ce->value, pre_p, post_p,
3106 is_gimple_val, fb_rvalue);
3107 if (tret == GS_ERROR)
3114 /* So how did we get a CONSTRUCTOR for a scalar type? */
3118 if (ret == GS_ERROR)
3120 else if (want_value)
3122 append_to_statement_list (*expr_p, pre_p);
3130 /* Given a pointer value OP0, return a simplified version of an
3131 indirection through OP0, or NULL_TREE if no simplification is
3132 possible. This may only be applied to a rhs of an expression.
3133 Note that the resulting type may be different from the type pointed
3134 to in the sense that it is still compatible from the langhooks
3138 fold_indirect_ref_rhs (tree t)
3140 tree type = TREE_TYPE (TREE_TYPE (t));
3145 subtype = TREE_TYPE (sub);
3146 if (!POINTER_TYPE_P (subtype))
3149 if (TREE_CODE (sub) == ADDR_EXPR)
3151 tree op = TREE_OPERAND (sub, 0);
3152 tree optype = TREE_TYPE (op);
3154 if (lang_hooks.types_compatible_p (type, optype))
3156 /* *(foo *)&fooarray => fooarray[0] */
3157 else if (TREE_CODE (optype) == ARRAY_TYPE
3158 && lang_hooks.types_compatible_p (type, TREE_TYPE (optype)))
3160 tree type_domain = TYPE_DOMAIN (optype);
3161 tree min_val = size_zero_node;
3162 if (type_domain && TYPE_MIN_VALUE (type_domain))
3163 min_val = TYPE_MIN_VALUE (type_domain);
3164 return build4 (ARRAY_REF, type, op, min_val, NULL_TREE, NULL_TREE);
3168 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
3169 if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
3170 && lang_hooks.types_compatible_p (type, TREE_TYPE (TREE_TYPE (subtype))))
3173 tree min_val = size_zero_node;
3175 sub = fold_indirect_ref_rhs (sub);
3177 sub = build1 (INDIRECT_REF, TREE_TYPE (subtype), osub);
3178 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
3179 if (type_domain && TYPE_MIN_VALUE (type_domain))
3180 min_val = TYPE_MIN_VALUE (type_domain);
3181 return build4 (ARRAY_REF, type, sub, min_val, NULL_TREE, NULL_TREE);
3187 /* Subroutine of gimplify_modify_expr to do simplifications of MODIFY_EXPRs
3188 based on the code of the RHS. We loop for as long as something changes. */
3190 static enum gimplify_status
3191 gimplify_modify_expr_rhs (tree *expr_p, tree *from_p, tree *to_p, tree *pre_p,
3192 tree *post_p, bool want_value)
3194 enum gimplify_status ret = GS_OK;
3196 while (ret != GS_UNHANDLED)
3197 switch (TREE_CODE (*from_p))
3201 /* If we have code like
3205 where the type of "x" is a (possibly cv-qualified variant
3206 of "A"), treat the entire expression as identical to "x".
3207 This kind of code arises in C++ when an object is bound
3208 to a const reference, and if "x" is a TARGET_EXPR we want
3209 to take advantage of the optimization below. */
3210 tree t = fold_indirect_ref_rhs (TREE_OPERAND (*from_p, 0));
3223 /* If we are initializing something from a TARGET_EXPR, strip the
3224 TARGET_EXPR and initialize it directly, if possible. This can't
3225 be done if the initializer is void, since that implies that the
3226 temporary is set in some non-trivial way.
3228 ??? What about code that pulls out the temp and uses it
3229 elsewhere? I think that such code never uses the TARGET_EXPR as
3230 an initializer. If I'm wrong, we'll die because the temp won't
3231 have any RTL. In that case, I guess we'll need to replace
3232 references somehow. */
3233 tree init = TARGET_EXPR_INITIAL (*from_p);
3235 if (!VOID_TYPE_P (TREE_TYPE (init)))
3246 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
3248 gimplify_compound_expr (from_p, pre_p, true);
3253 /* If we're initializing from a CONSTRUCTOR, break this into
3254 individual MODIFY_EXPRs. */
3255 return gimplify_init_constructor (expr_p, pre_p, post_p, want_value);
3258 /* If we're assigning to a non-register type, push the assignment
3259 down into the branches. This is mandatory for ADDRESSABLE types,
3260 since we cannot generate temporaries for such, but it saves a
3261 copy in other cases as well. */
3262 if (!is_gimple_reg_type (TREE_TYPE (*from_p)))
3264 /* This code should mirror the code in gimplify_cond_expr. */
3265 enum tree_code code = TREE_CODE (*expr_p);
3266 tree cond = *from_p;
3267 tree result = *to_p;
3269 ret = gimplify_expr (&result, pre_p, post_p,
3270 is_gimple_min_lval, fb_lvalue);
3271 if (ret != GS_ERROR)
3274 if (TREE_TYPE (TREE_OPERAND (cond, 1)) != void_type_node)
3275 TREE_OPERAND (cond, 1)
3276 = build2 (code, void_type_node, result,
3277 TREE_OPERAND (cond, 1));
3278 if (TREE_TYPE (TREE_OPERAND (cond, 2)) != void_type_node)
3279 TREE_OPERAND (cond, 2)
3280 = build2 (code, void_type_node, unshare_expr (result),
3281 TREE_OPERAND (cond, 2));
3283 TREE_TYPE (cond) = void_type_node;
3284 recalculate_side_effects (cond);
3288 gimplify_and_add (cond, pre_p);
3289 *expr_p = unshare_expr (result);
3300 /* For calls that return in memory, give *to_p as the CALL_EXPR's
3301 return slot so that we don't generate a temporary. */
3302 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p)
3303 && aggregate_value_p (*from_p, *from_p))
3307 if (!(rhs_predicate_for (*to_p))(*from_p))
3308 /* If we need a temporary, *to_p isn't accurate. */
3310 else if (TREE_CODE (*to_p) == RESULT_DECL
3311 && DECL_NAME (*to_p) == NULL_TREE
3312 && needs_to_live_in_memory (*to_p))
3313 /* It's OK to use the return slot directly unless it's an NRV. */
3315 else if (is_gimple_reg_type (TREE_TYPE (*to_p))
3316 || (DECL_P (*to_p) && DECL_REGISTER (*to_p)))
3317 /* Don't force regs into memory. */
3319 else if (TREE_CODE (*to_p) == VAR_DECL
3320 && DECL_GIMPLE_FORMAL_TEMP_P (*to_p))
3321 /* Don't use the original target if it's a formal temp; we
3322 don't want to take their addresses. */
3324 else if (TREE_CODE (*expr_p) == INIT_EXPR)
3325 /* It's OK to use the target directly if it's being
3328 else if (!is_gimple_non_addressable (*to_p))
3329 /* Don't use the original target if it's already addressable;
3330 if its address escapes, and the called function uses the
3331 NRV optimization, a conforming program could see *to_p
3332 change before the called function returns; see c++/19317.
3333 When optimizing, the return_slot pass marks more functions
3334 as safe after we have escape info. */
3341 CALL_EXPR_RETURN_SLOT_OPT (*from_p) = 1;
3342 lang_hooks.mark_addressable (*to_p);
3357 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
3358 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
3359 DECL_COMPLEX_GIMPLE_REG_P set. */
3361 static enum gimplify_status
3362 gimplify_modify_expr_complex_part (tree *expr_p, tree *pre_p, bool want_value)
3364 enum tree_code code, ocode;
3365 tree lhs, rhs, new_rhs, other, realpart, imagpart;
3367 lhs = TREE_OPERAND (*expr_p, 0);
3368 rhs = TREE_OPERAND (*expr_p, 1);
3369 code = TREE_CODE (lhs);
3370 lhs = TREE_OPERAND (lhs, 0);
3372 ocode = code == REALPART_EXPR ? IMAGPART_EXPR : REALPART_EXPR;
3373 other = build1 (ocode, TREE_TYPE (rhs), lhs);
3374 other = get_formal_tmp_var (other, pre_p);
3376 realpart = code == REALPART_EXPR ? rhs : other;
3377 imagpart = code == REALPART_EXPR ? other : rhs;
3379 if (TREE_CONSTANT (realpart) && TREE_CONSTANT (imagpart))
3380 new_rhs = build_complex (TREE_TYPE (lhs), realpart, imagpart);
3382 new_rhs = build2 (COMPLEX_EXPR, TREE_TYPE (lhs), realpart, imagpart);
3384 TREE_OPERAND (*expr_p, 0) = lhs;
3385 TREE_OPERAND (*expr_p, 1) = new_rhs;
3389 append_to_statement_list (*expr_p, pre_p);
3396 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
3402 PRE_P points to the list where side effects that must happen before
3403 *EXPR_P should be stored.
3405 POST_P points to the list where side effects that must happen after
3406 *EXPR_P should be stored.
3408 WANT_VALUE is nonzero iff we want to use the value of this expression
3409 in another expression. */
3411 static enum gimplify_status
3412 gimplify_modify_expr (tree *expr_p, tree *pre_p, tree *post_p, bool want_value)
3414 tree *from_p = &TREE_OPERAND (*expr_p, 1);
3415 tree *to_p = &TREE_OPERAND (*expr_p, 0);
3416 enum gimplify_status ret = GS_UNHANDLED;
3418 gcc_assert (TREE_CODE (*expr_p) == MODIFY_EXPR
3419 || TREE_CODE (*expr_p) == INIT_EXPR);
3421 /* For zero sized types only gimplify the left hand side and right hand side
3422 as statements and throw away the assignment. */
3423 if (zero_sized_type (TREE_TYPE (*from_p)))
3425 gimplify_stmt (from_p);
3426 gimplify_stmt (to_p);
3427 append_to_statement_list (*from_p, pre_p);
3428 append_to_statement_list (*to_p, pre_p);
3429 *expr_p = NULL_TREE;
3433 /* See if any simplifications can be done based on what the RHS is. */
3434 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
3436 if (ret != GS_UNHANDLED)
3439 /* If the value being copied is of variable width, compute the length
3440 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
3441 before gimplifying any of the operands so that we can resolve any
3442 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
3443 the size of the expression to be copied, not of the destination, so
3444 that is what we must here. */
3445 maybe_with_size_expr (from_p);
3447 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
3448 if (ret == GS_ERROR)
3451 ret = gimplify_expr (from_p, pre_p, post_p,
3452 rhs_predicate_for (*to_p), fb_rvalue);
3453 if (ret == GS_ERROR)
3456 /* Now see if the above changed *from_p to something we handle specially. */
3457 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
3459 if (ret != GS_UNHANDLED)
3462 /* If we've got a variable sized assignment between two lvalues (i.e. does
3463 not involve a call), then we can make things a bit more straightforward
3464 by converting the assignment to memcpy or memset. */
3465 if (TREE_CODE (*from_p) == WITH_SIZE_EXPR)
3467 tree from = TREE_OPERAND (*from_p, 0);
3468 tree size = TREE_OPERAND (*from_p, 1);
3470 if (TREE_CODE (from) == CONSTRUCTOR)
3471 return gimplify_modify_expr_to_memset (expr_p, size, want_value);
3472 if (is_gimple_addressable (from))
3475 return gimplify_modify_expr_to_memcpy (expr_p, size, want_value);
3479 /* Transform partial stores to non-addressable complex variables into
3480 total stores. This allows us to use real instead of virtual operands
3481 for these variables, which improves optimization. */
3482 if ((TREE_CODE (*to_p) == REALPART_EXPR
3483 || TREE_CODE (*to_p) == IMAGPART_EXPR)
3484 && is_gimple_reg (TREE_OPERAND (*to_p, 0)))
3485 return gimplify_modify_expr_complex_part (expr_p, pre_p, want_value);
3487 if (gimplify_ctxp->into_ssa && is_gimple_reg (*to_p))
3489 /* If we've somehow already got an SSA_NAME on the LHS, then
3490 we're probably modified it twice. Not good. */
3491 gcc_assert (TREE_CODE (*to_p) != SSA_NAME);
3492 *to_p = make_ssa_name (*to_p, *expr_p);
3497 append_to_statement_list (*expr_p, pre_p);
3505 /* Gimplify a comparison between two variable-sized objects. Do this
3506 with a call to BUILT_IN_MEMCMP. */
3508 static enum gimplify_status
3509 gimplify_variable_sized_compare (tree *expr_p)
3511 tree op0 = TREE_OPERAND (*expr_p, 0);
3512 tree op1 = TREE_OPERAND (*expr_p, 1);
3515 t = TYPE_SIZE_UNIT (TREE_TYPE (op0));
3516 t = unshare_expr (t);
3517 t = SUBSTITUTE_PLACEHOLDER_IN_EXPR (t, op0);
3518 args = tree_cons (NULL, t, NULL);
3519 t = build_fold_addr_expr (op1);
3520 args = tree_cons (NULL, t, args);
3521 dest = build_fold_addr_expr (op0);
3522 args = tree_cons (NULL, dest, args);
3523 t = implicit_built_in_decls[BUILT_IN_MEMCMP];
3524 t = build_function_call_expr (t, args);
3526 = build2 (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), t, integer_zero_node);
3531 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
3532 points to the expression to gimplify.
3534 Expressions of the form 'a && b' are gimplified to:
3536 a && b ? true : false
3538 gimplify_cond_expr will do the rest.
3540 PRE_P points to the list where side effects that must happen before
3541 *EXPR_P should be stored. */
3543 static enum gimplify_status
3544 gimplify_boolean_expr (tree *expr_p)
3546 /* Preserve the original type of the expression. */
3547 tree type = TREE_TYPE (*expr_p);
3549 *expr_p = build3 (COND_EXPR, type, *expr_p,
3550 fold_convert (type, boolean_true_node),
3551 fold_convert (type, boolean_false_node));
3556 /* Gimplifies an expression sequence. This function gimplifies each
3557 expression and re-writes the original expression with the last
3558 expression of the sequence in GIMPLE form.
3560 PRE_P points to the list where the side effects for all the
3561 expressions in the sequence will be emitted.
3563 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
3564 /* ??? Should rearrange to share the pre-queue with all the indirect
3565 invocations of gimplify_expr. Would probably save on creations
3566 of statement_list nodes. */
3568 static enum gimplify_status
3569 gimplify_compound_expr (tree *expr_p, tree *pre_p, bool want_value)
3575 tree *sub_p = &TREE_OPERAND (t, 0);
3577 if (TREE_CODE (*sub_p) == COMPOUND_EXPR)
3578 gimplify_compound_expr (sub_p, pre_p, false);
3580 gimplify_stmt (sub_p);
3581 append_to_statement_list (*sub_p, pre_p);
3583 t = TREE_OPERAND (t, 1);
3585 while (TREE_CODE (t) == COMPOUND_EXPR);
3592 gimplify_stmt (expr_p);
3597 /* Gimplifies a statement list. These may be created either by an
3598 enlightened front-end, or by shortcut_cond_expr. */
3600 static enum gimplify_status
3601 gimplify_statement_list (tree *expr_p)
3603 tree_stmt_iterator i = tsi_start (*expr_p);
3605 while (!tsi_end_p (i))
3609 gimplify_stmt (tsi_stmt_ptr (i));
3614 else if (TREE_CODE (t) == STATEMENT_LIST)
3616 tsi_link_before (&i, t, TSI_SAME_STMT);
3626 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
3627 gimplify. After gimplification, EXPR_P will point to a new temporary
3628 that holds the original value of the SAVE_EXPR node.
3630 PRE_P points to the list where side effects that must happen before
3631 *EXPR_P should be stored. */
3633 static enum gimplify_status
3634 gimplify_save_expr (tree *expr_p, tree *pre_p, tree *post_p)
3636 enum gimplify_status ret = GS_ALL_DONE;
3639 gcc_assert (TREE_CODE (*expr_p) == SAVE_EXPR);
3640 val = TREE_OPERAND (*expr_p, 0);
3642 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
3643 if (!SAVE_EXPR_RESOLVED_P (*expr_p))
3645 /* The operand may be a void-valued expression such as SAVE_EXPRs
3646 generated by the Java frontend for class initialization. It is
3647 being executed only for its side-effects. */
3648 if (TREE_TYPE (val) == void_type_node)
3650 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3651 is_gimple_stmt, fb_none);
3652 append_to_statement_list (TREE_OPERAND (*expr_p, 0), pre_p);
3656 val = get_initialized_tmp_var (val, pre_p, post_p);
3658 TREE_OPERAND (*expr_p, 0) = val;
3659 SAVE_EXPR_RESOLVED_P (*expr_p) = 1;
3667 /* Re-write the ADDR_EXPR node pointed to by EXPR_P
3674 PRE_P points to the list where side effects that must happen before
3675 *EXPR_P should be stored.
3677 POST_P points to the list where side effects that must happen after
3678 *EXPR_P should be stored. */
3680 static enum gimplify_status
3681 gimplify_addr_expr (tree *expr_p, tree *pre_p, tree *post_p)
3683 tree expr = *expr_p;
3684 tree op0 = TREE_OPERAND (expr, 0);
3685 enum gimplify_status ret;
3687 switch (TREE_CODE (op0))
3690 case MISALIGNED_INDIRECT_REF:
3692 /* Check if we are dealing with an expression of the form '&*ptr'.
3693 While the front end folds away '&*ptr' into 'ptr', these
3694 expressions may be generated internally by the compiler (e.g.,
3695 builtins like __builtin_va_end). */
3696 /* Caution: the silent array decomposition semantics we allow for
3697 ADDR_EXPR means we can't always discard the pair. */
3698 /* Gimplification of the ADDR_EXPR operand may drop
3699 cv-qualification conversions, so make sure we add them if
3702 tree op00 = TREE_OPERAND (op0, 0);
3703 tree t_expr = TREE_TYPE (expr);
3704 tree t_op00 = TREE_TYPE (op00);
3706 if (!lang_hooks.types_compatible_p (t_expr, t_op00))
3708 #ifdef ENABLE_CHECKING
3709 tree t_op0 = TREE_TYPE (op0);
3710 gcc_assert (POINTER_TYPE_P (t_expr)
3711 && cpt_same_type (TREE_CODE (t_op0) == ARRAY_TYPE
3712 ? TREE_TYPE (t_op0) : t_op0,
3714 && POINTER_TYPE_P (t_op00)
3715 && cpt_same_type (t_op0, TREE_TYPE (t_op00)));
3717 op00 = fold_convert (TREE_TYPE (expr), op00);
3724 case VIEW_CONVERT_EXPR:
3725 /* Take the address of our operand and then convert it to the type of
3728 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
3729 all clear. The impact of this transformation is even less clear. */
3731 /* If the operand is a useless conversion, look through it. Doing so
3732 guarantees that the ADDR_EXPR and its operand will remain of the
3734 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0, 0)))
3735 op0 = TREE_OPERAND (op0, 0);
3737 *expr_p = fold_convert (TREE_TYPE (expr),
3738 build_fold_addr_expr (TREE_OPERAND (op0, 0)));
3743 /* We use fb_either here because the C frontend sometimes takes
3744 the address of a call that returns a struct; see
3745 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
3746 the implied temporary explicit. */
3747 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, post_p,
3748 is_gimple_addressable, fb_either);
3749 if (ret != GS_ERROR)
3751 op0 = TREE_OPERAND (expr, 0);
3753 /* For various reasons, the gimplification of the expression
3754 may have made a new INDIRECT_REF. */
3755 if (TREE_CODE (op0) == INDIRECT_REF)
3756 goto do_indirect_ref;
3758 /* Make sure TREE_INVARIANT, TREE_CONSTANT, and TREE_SIDE_EFFECTS
3760 recompute_tree_invariant_for_addr_expr (expr);
3762 /* Mark the RHS addressable. */
3763 lang_hooks.mark_addressable (TREE_OPERAND (expr, 0));
3771 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
3772 value; output operands should be a gimple lvalue. */
3774 static enum gimplify_status
3775 gimplify_asm_expr (tree *expr_p, tree *pre_p, tree *post_p)
3777 tree expr = *expr_p;
3778 int noutputs = list_length (ASM_OUTPUTS (expr));
3779 const char **oconstraints
3780 = (const char **) alloca ((noutputs) * sizeof (const char *));
3783 const char *constraint;
3784 bool allows_mem, allows_reg, is_inout;
3785 enum gimplify_status ret, tret;
3788 for (i = 0, link = ASM_OUTPUTS (expr); link; ++i, link = TREE_CHAIN (link))
3790 size_t constraint_len;
3791 oconstraints[i] = constraint
3792 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
3793 constraint_len = strlen (constraint);
3794 if (constraint_len == 0)
3797 parse_output_constraint (&constraint, i, 0, 0,
3798 &allows_mem, &allows_reg, &is_inout);
3800 if (!allows_reg && allows_mem)
3801 lang_hooks.mark_addressable (TREE_VALUE (link));
3803 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
3804 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
3805 fb_lvalue | fb_mayfail);
3806 if (tret == GS_ERROR)
3808 error ("invalid lvalue in asm output %d", i);
3814 /* An input/output operand. To give the optimizers more
3815 flexibility, split it into separate input and output
3820 /* Turn the in/out constraint into an output constraint. */
3821 char *p = xstrdup (constraint);
3823 TREE_VALUE (TREE_PURPOSE (link)) = build_string (constraint_len, p);
3825 /* And add a matching input constraint. */
3828 sprintf (buf, "%d", i);
3830 /* If there are multiple alternatives in the constraint,
3831 handle each of them individually. Those that allow register
3832 will be replaced with operand number, the others will stay
3834 if (strchr (p, ',') != NULL)
3836 size_t len = 0, buflen = strlen (buf);
3837 char *beg, *end, *str, *dst;
3841 end = strchr (beg, ',');
3843 end = strchr (beg, '\0');
3844 if ((size_t) (end - beg) < buflen)
3847 len += end - beg + 1;
3854 str = (char *) alloca (len);
3855 for (beg = p + 1, dst = str;;)
3858 bool mem_p, reg_p, inout_p;
3860 end = strchr (beg, ',');
3865 parse_output_constraint (&tem, i, 0, 0,
3866 &mem_p, ®_p, &inout_p);
3871 memcpy (dst, buf, buflen);
3880 memcpy (dst, beg, len);
3889 input = build_string (dst - str, str);
3892 input = build_string (strlen (buf), buf);
3895 input = build_string (constraint_len - 1, constraint + 1);
3899 input = build_tree_list (build_tree_list (NULL_TREE, input),
3900 unshare_expr (TREE_VALUE (link)));
3901 ASM_INPUTS (expr) = chainon (ASM_INPUTS (expr), input);
3905 for (link = ASM_INPUTS (expr); link; ++i, link = TREE_CHAIN (link))
3908 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
3909 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
3910 oconstraints, &allows_mem, &allows_reg);
3912 /* If the operand is a memory input, it should be an lvalue. */
3913 if (!allows_reg && allows_mem)
3915 lang_hooks.mark_addressable (TREE_VALUE (link));
3916 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
3917 is_gimple_lvalue, fb_lvalue | fb_mayfail);
3918 if (tret == GS_ERROR)
3920 error ("memory input %d is not directly addressable", i);
3926 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
3927 is_gimple_asm_val, fb_rvalue);
3928 if (tret == GS_ERROR)
3936 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
3937 WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
3938 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
3939 return to this function.
3941 FIXME should we complexify the prequeue handling instead? Or use flags
3942 for all the cleanups and let the optimizer tighten them up? The current
3943 code seems pretty fragile; it will break on a cleanup within any
3944 non-conditional nesting. But any such nesting would be broken, anyway;
3945 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
3946 and continues out of it. We can do that at the RTL level, though, so
3947 having an optimizer to tighten up try/finally regions would be a Good
3950 static enum gimplify_status
3951 gimplify_cleanup_point_expr (tree *expr_p, tree *pre_p)
3953 tree_stmt_iterator iter;
3956 tree temp = voidify_wrapper_expr (*expr_p, NULL);
3958 /* We only care about the number of conditions between the innermost
3959 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
3960 any cleanups collected outside the CLEANUP_POINT_EXPR. */
3961 int old_conds = gimplify_ctxp->conditions;
3962 tree old_cleanups = gimplify_ctxp->conditional_cleanups;
3963 gimplify_ctxp->conditions = 0;
3964 gimplify_ctxp->conditional_cleanups = NULL_TREE;
3966 body = TREE_OPERAND (*expr_p, 0);
3967 gimplify_to_stmt_list (&body);
3969 gimplify_ctxp->conditions = old_conds;
3970 gimplify_ctxp->conditional_cleanups = old_cleanups;
3972 for (iter = tsi_start (body); !tsi_end_p (iter); )
3974 tree *wce_p = tsi_stmt_ptr (iter);
3977 if (TREE_CODE (wce) == WITH_CLEANUP_EXPR)
3979 if (tsi_one_before_end_p (iter))
3981 tsi_link_before (&iter, TREE_OPERAND (wce, 0), TSI_SAME_STMT);
3988 enum tree_code code;
3990 if (CLEANUP_EH_ONLY (wce))
3991 code = TRY_CATCH_EXPR;
3993 code = TRY_FINALLY_EXPR;
3995 sl = tsi_split_statement_list_after (&iter);
3996 tfe = build2 (code, void_type_node, sl, NULL_TREE);
3997 append_to_statement_list (TREE_OPERAND (wce, 0),
3998 &TREE_OPERAND (tfe, 1));
4000 iter = tsi_start (sl);
4010 append_to_statement_list (body, pre_p);
4020 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
4021 is the cleanup action required. */
4024 gimple_push_cleanup (tree var, tree cleanup, bool eh_only, tree *pre_p)
4028 /* Errors can result in improperly nested cleanups. Which results in
4029 confusion when trying to resolve the WITH_CLEANUP_EXPR. */
4030 if (errorcount || sorrycount)
4033 if (gimple_conditional_context ())
4035 /* If we're in a conditional context, this is more complex. We only
4036 want to run the cleanup if we actually ran the initialization that
4037 necessitates it, but we want to run it after the end of the
4038 conditional context. So we wrap the try/finally around the
4039 condition and use a flag to determine whether or not to actually
4040 run the destructor. Thus
4044 becomes (approximately)
4048 if (test) { A::A(temp); flag = 1; val = f(temp); }
4051 if (flag) A::~A(temp);
4056 tree flag = create_tmp_var (boolean_type_node, "cleanup");
4057 tree ffalse = build2 (MODIFY_EXPR, void_type_node, flag,
4058 boolean_false_node);
4059 tree ftrue = build2 (MODIFY_EXPR, void_type_node, flag,
4061 cleanup = build3 (COND_EXPR, void_type_node, flag, cleanup, NULL);
4062 wce = build1 (WITH_CLEANUP_EXPR, void_type_node, cleanup);
4063 append_to_statement_list (ffalse, &gimplify_ctxp->conditional_cleanups);
4064 append_to_statement_list (wce, &gimplify_ctxp->conditional_cleanups);
4065 append_to_statement_list (ftrue, pre_p);
4067 /* Because of this manipulation, and the EH edges that jump
4068 threading cannot redirect, the temporary (VAR) will appear
4069 to be used uninitialized. Don't warn. */
4070 TREE_NO_WARNING (var) = 1;
4074 wce = build1 (WITH_CLEANUP_EXPR, void_type_node, cleanup);
4075 CLEANUP_EH_ONLY (wce) = eh_only;
4076 append_to_statement_list (wce, pre_p);
4079 gimplify_stmt (&TREE_OPERAND (wce, 0));
4082 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
4084 static enum gimplify_status
4085 gimplify_target_expr (tree *expr_p, tree *pre_p, tree *post_p)
4087 tree targ = *expr_p;
4088 tree temp = TARGET_EXPR_SLOT (targ);
4089 tree init = TARGET_EXPR_INITIAL (targ);
4090 enum gimplify_status ret;
4094 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
4095 to the temps list. */
4096 gimple_add_tmp_var (temp);
4098 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
4099 expression is supposed to initialize the slot. */
4100 if (VOID_TYPE_P (TREE_TYPE (init)))
4101 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
4104 /* Special handling for BIND_EXPR can result in fewer temps. */
4106 if (TREE_CODE (init) == BIND_EXPR)
4107 gimplify_bind_expr (&init, temp, pre_p);
4110 init = build2 (INIT_EXPR, void_type_node, temp, init);
4111 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt,
4115 if (ret == GS_ERROR)
4117 append_to_statement_list (init, pre_p);
4119 /* If needed, push the cleanup for the temp. */
4120 if (TARGET_EXPR_CLEANUP (targ))
4122 gimplify_stmt (&TARGET_EXPR_CLEANUP (targ));
4123 gimple_push_cleanup (temp, TARGET_EXPR_CLEANUP (targ),
4124 CLEANUP_EH_ONLY (targ), pre_p);
4127 /* Only expand this once. */
4128 TREE_OPERAND (targ, 3) = init;
4129 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
4132 /* We should have expanded this before. */
4133 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp));
4139 /* Gimplification of expression trees. */
4141 /* Gimplify an expression which appears at statement context; usually, this
4142 means replacing it with a suitably gimple STATEMENT_LIST. */
4145 gimplify_stmt (tree *stmt_p)
4147 gimplify_expr (stmt_p, NULL, NULL, is_gimple_stmt, fb_none);
4150 /* Similarly, but force the result to be a STATEMENT_LIST. */
4153 gimplify_to_stmt_list (tree *stmt_p)
4155 gimplify_stmt (stmt_p);
4157 *stmt_p = alloc_stmt_list ();
4158 else if (TREE_CODE (*stmt_p) != STATEMENT_LIST)
4161 *stmt_p = alloc_stmt_list ();
4162 append_to_statement_list (t, stmt_p);
4167 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
4168 to CTX. If entries already exist, force them to be some flavor of private.
4169 If there is no enclosing parallel, do nothing. */
4172 omp_firstprivatize_variable (struct gimplify_omp_ctx *ctx, tree decl)
4176 if (decl == NULL || !DECL_P (decl))
4181 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4184 if (n->value & GOVD_SHARED)
4185 n->value = GOVD_FIRSTPRIVATE | (n->value & GOVD_SEEN);
4189 else if (ctx->is_parallel)
4190 omp_add_variable (ctx, decl, GOVD_FIRSTPRIVATE);
4192 ctx = ctx->outer_context;
4197 /* Similarly for each of the type sizes of TYPE. */
4200 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx *ctx, tree type)
4202 if (type == NULL || type == error_mark_node)
4204 type = TYPE_MAIN_VARIANT (type);
4206 if (pointer_set_insert (ctx->privatized_types, type))
4209 switch (TREE_CODE (type))
4215 omp_firstprivatize_variable (ctx, TYPE_MIN_VALUE (type));
4216 omp_firstprivatize_variable (ctx, TYPE_MAX_VALUE (type));
4220 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
4221 omp_firstprivatize_type_sizes (ctx, TYPE_DOMAIN (type));
4226 case QUAL_UNION_TYPE:
4229 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
4230 if (TREE_CODE (field) == FIELD_DECL)
4232 omp_firstprivatize_variable (ctx, DECL_FIELD_OFFSET (field));
4233 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (field));
4239 case REFERENCE_TYPE:
4240 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (type));
4247 omp_firstprivatize_variable (ctx, TYPE_SIZE (type));
4248 omp_firstprivatize_variable (ctx, TYPE_SIZE_UNIT (type));
4249 lang_hooks.types.omp_firstprivatize_type_sizes (ctx, type);
4252 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
4255 omp_add_variable (struct gimplify_omp_ctx *ctx, tree decl, unsigned int flags)
4258 unsigned int nflags;
4261 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
4264 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
4265 there are constructors involved somewhere. */
4266 if (TREE_ADDRESSABLE (TREE_TYPE (decl))
4267 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
4270 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4273 /* We shouldn't be re-adding the decl with the same data
4275 gcc_assert ((n->value & GOVD_DATA_SHARE_CLASS & flags) == 0);
4276 /* The only combination of data sharing classes we should see is
4277 FIRSTPRIVATE and LASTPRIVATE. */
4278 nflags = n->value | flags;
4279 gcc_assert ((nflags & GOVD_DATA_SHARE_CLASS)
4280 == (GOVD_FIRSTPRIVATE | GOVD_LASTPRIVATE));
4285 /* When adding a variable-sized variable, we have to handle all sorts
4286 of additional bits of data: the pointer replacement variable, and
4287 the parameters of the type. */
4288 if (DECL_SIZE (decl) && !TREE_CONSTANT (DECL_SIZE (decl)))
4290 /* Add the pointer replacement variable as PRIVATE if the variable
4291 replacement is private, else FIRSTPRIVATE since we'll need the
4292 address of the original variable either for SHARED, or for the
4293 copy into or out of the context. */
4294 if (!(flags & GOVD_LOCAL))
4296 nflags = flags & GOVD_PRIVATE ? GOVD_PRIVATE : GOVD_FIRSTPRIVATE;
4297 nflags |= flags & GOVD_SEEN;
4298 t = DECL_VALUE_EXPR (decl);
4299 gcc_assert (TREE_CODE (t) == INDIRECT_REF);
4300 t = TREE_OPERAND (t, 0);
4301 gcc_assert (DECL_P (t));
4302 omp_add_variable (ctx, t, nflags);
4305 /* Add all of the variable and type parameters (which should have
4306 been gimplified to a formal temporary) as FIRSTPRIVATE. */
4307 omp_firstprivatize_variable (ctx, DECL_SIZE_UNIT (decl));
4308 omp_firstprivatize_variable (ctx, DECL_SIZE (decl));
4309 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
4311 /* The variable-sized variable itself is never SHARED, only some form
4312 of PRIVATE. The sharing would take place via the pointer variable
4313 which we remapped above. */
4314 if (flags & GOVD_SHARED)
4315 flags = GOVD_PRIVATE | GOVD_DEBUG_PRIVATE
4316 | (flags & (GOVD_SEEN | GOVD_EXPLICIT));
4318 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
4319 alloca statement we generate for the variable, so make sure it
4320 is available. This isn't automatically needed for the SHARED
4321 case, since we won't be allocating local storage then. */
4323 omp_notice_variable (ctx, TYPE_SIZE_UNIT (TREE_TYPE (decl)), true);
4325 else if (lang_hooks.decls.omp_privatize_by_reference (decl))
4327 gcc_assert ((flags & GOVD_LOCAL) == 0);
4328 omp_firstprivatize_type_sizes (ctx, TREE_TYPE (decl));
4330 /* Similar to the direct variable sized case above, we'll need the
4331 size of references being privatized. */
4332 if ((flags & GOVD_SHARED) == 0)
4334 t = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl)));
4335 if (!TREE_CONSTANT (t))
4336 omp_notice_variable (ctx, t, true);
4340 splay_tree_insert (ctx->variables, (splay_tree_key)decl, flags);
4343 /* Record the fact that DECL was used within the OpenMP context CTX.
4344 IN_CODE is true when real code uses DECL, and false when we should
4345 merely emit default(none) errors. Return true if DECL is going to
4346 be remapped and thus DECL shouldn't be gimplified into its
4347 DECL_VALUE_EXPR (if any). */
4350 omp_notice_variable (struct gimplify_omp_ctx *ctx, tree decl, bool in_code)
4353 unsigned flags = in_code ? GOVD_SEEN : 0;
4354 bool ret = false, shared;
4356 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
4359 /* Threadprivate variables are predetermined. */
4360 if (is_global_var (decl))
4362 if (DECL_THREAD_LOCAL_P (decl))
4365 if (DECL_HAS_VALUE_EXPR_P (decl))
4367 tree value = get_base_address (DECL_VALUE_EXPR (decl));
4369 if (value && DECL_P (value) && DECL_THREAD_LOCAL_P (value))
4374 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4377 enum omp_clause_default_kind default_kind, kind;
4379 if (!ctx->is_parallel)
4382 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
4383 remapped firstprivate instead of shared. To some extent this is
4384 addressed in omp_firstprivatize_type_sizes, but not effectively. */
4385 default_kind = ctx->default_kind;
4386 kind = lang_hooks.decls.omp_predetermined_sharing (decl);
4387 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
4388 default_kind = kind;
4390 switch (default_kind)
4392 case OMP_CLAUSE_DEFAULT_NONE:
4393 error ("%qs not specified in enclosing parallel",
4394 IDENTIFIER_POINTER (DECL_NAME (decl)));
4395 error ("%Henclosing parallel", &ctx->location);
4397 case OMP_CLAUSE_DEFAULT_SHARED:
4398 flags |= GOVD_SHARED;
4400 case OMP_CLAUSE_DEFAULT_PRIVATE:
4401 flags |= GOVD_PRIVATE;
4407 omp_add_variable (ctx, decl, flags);
4409 shared = (flags & GOVD_SHARED) != 0;
4410 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
4414 shared = ((flags | n->value) & GOVD_SHARED) != 0;
4415 ret = lang_hooks.decls.omp_disregard_value_expr (decl, shared);
4417 /* If nothing changed, there's nothing left to do. */
4418 if ((n->value & flags) == flags)
4424 /* If the variable is private in the current context, then we don't
4425 need to propagate anything to an outer context. */
4426 if (flags & GOVD_PRIVATE)
4428 if (ctx->outer_context
4429 && omp_notice_variable (ctx->outer_context, decl, in_code))
4434 /* Verify that DECL is private within CTX. If there's specific information
4435 to the contrary in the innermost scope, generate an error. */
4438 omp_is_private (struct gimplify_omp_ctx *ctx, tree decl)
4442 n = splay_tree_lookup (ctx->variables, (splay_tree_key)decl);
4445 if (n->value & GOVD_SHARED)
4447 if (ctx == gimplify_omp_ctxp)
4449 error ("iteration variable %qs should be private",
4450 IDENTIFIER_POINTER (DECL_NAME (decl)));
4451 n->value = GOVD_PRIVATE;
4457 else if ((n->value & GOVD_EXPLICIT) != 0
4458 && (ctx == gimplify_omp_ctxp
4459 || (ctx->is_combined_parallel
4460 && gimplify_omp_ctxp->outer_context == ctx)))
4462 if ((n->value & GOVD_FIRSTPRIVATE) != 0)
4463 error ("iteration variable %qs should not be firstprivate",
4464 IDENTIFIER_POINTER (DECL_NAME (decl)));
4465 else if ((n->value & GOVD_REDUCTION) != 0)
4466 error ("iteration variable %qs should not be reduction",
4467 IDENTIFIER_POINTER (DECL_NAME (decl)));
4472 if (ctx->is_parallel)
4474 else if (ctx->outer_context)
4475 return omp_is_private (ctx->outer_context, decl);
4477 return !is_global_var (decl);
4480 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
4481 and previous omp contexts. */
4484 gimplify_scan_omp_clauses (tree *list_p, tree *pre_p, bool in_parallel,
4485 bool in_combined_parallel)
4487 struct gimplify_omp_ctx *ctx, *outer_ctx;
4490 ctx = new_omp_context (in_parallel, in_combined_parallel);
4491 outer_ctx = ctx->outer_context;
4493 while ((c = *list_p) != NULL)
4495 enum gimplify_status gs;
4496 bool remove = false;
4497 bool notice_outer = true;
4501 switch (OMP_CLAUSE_CODE (c))
4503 case OMP_CLAUSE_PRIVATE:
4504 flags = GOVD_PRIVATE | GOVD_EXPLICIT;
4505 notice_outer = false;
4507 case OMP_CLAUSE_SHARED:
4508 flags = GOVD_SHARED | GOVD_EXPLICIT;
4510 case OMP_CLAUSE_FIRSTPRIVATE:
4511 flags = GOVD_FIRSTPRIVATE | GOVD_EXPLICIT;
4513 case OMP_CLAUSE_LASTPRIVATE:
4514 flags = GOVD_LASTPRIVATE | GOVD_SEEN | GOVD_EXPLICIT;
4516 case OMP_CLAUSE_REDUCTION:
4517 flags = GOVD_REDUCTION | GOVD_SEEN | GOVD_EXPLICIT;
4521 decl = OMP_CLAUSE_DECL (c);
4522 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
4527 /* Handle NRV results passed by reference. */
4528 if (TREE_CODE (decl) == INDIRECT_REF
4529 && TREE_CODE (TREE_OPERAND (decl, 0)) == RESULT_DECL
4530 && DECL_BY_REFERENCE (TREE_OPERAND (decl, 0)))
4531 OMP_CLAUSE_DECL (c) = decl = TREE_OPERAND (decl, 0);
4532 omp_add_variable (ctx, decl, flags);
4533 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION
4534 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c))
4536 omp_add_variable (ctx, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c),
4537 GOVD_LOCAL | GOVD_SEEN);
4538 gimplify_omp_ctxp = ctx;
4539 push_gimplify_context ();
4540 gimplify_stmt (&OMP_CLAUSE_REDUCTION_INIT (c));
4541 pop_gimplify_context (OMP_CLAUSE_REDUCTION_INIT (c));
4542 push_gimplify_context ();
4543 gimplify_stmt (&OMP_CLAUSE_REDUCTION_MERGE (c));
4544 pop_gimplify_context (OMP_CLAUSE_REDUCTION_MERGE (c));
4545 gimplify_omp_ctxp = outer_ctx;
4551 case OMP_CLAUSE_COPYIN:
4552 case OMP_CLAUSE_COPYPRIVATE:
4553 decl = OMP_CLAUSE_DECL (c);
4554 if (decl == error_mark_node || TREE_TYPE (decl) == error_mark_node)
4559 /* Handle NRV results passed by reference. */
4560 if (TREE_CODE (decl) == INDIRECT_REF
4561 && TREE_CODE (TREE_OPERAND (decl, 0)) == RESULT_DECL
4562 && DECL_BY_REFERENCE (TREE_OPERAND (decl, 0)))
4563 OMP_CLAUSE_DECL (c) = decl = TREE_OPERAND (decl, 0);
4566 omp_notice_variable (outer_ctx, decl, true);
4570 OMP_CLAUSE_OPERAND (c, 0)
4571 = gimple_boolify (OMP_CLAUSE_OPERAND (c, 0));
4574 case OMP_CLAUSE_SCHEDULE:
4575 case OMP_CLAUSE_NUM_THREADS:
4576 gs = gimplify_expr (&OMP_CLAUSE_OPERAND (c, 0), pre_p, NULL,
4577 is_gimple_val, fb_rvalue);
4582 case OMP_CLAUSE_NOWAIT:
4583 case OMP_CLAUSE_ORDERED:
4586 case OMP_CLAUSE_DEFAULT:
4587 ctx->default_kind = OMP_CLAUSE_DEFAULT_KIND (c);
4595 *list_p = OMP_CLAUSE_CHAIN (c);
4597 list_p = &OMP_CLAUSE_CHAIN (c);
4600 gimplify_omp_ctxp = ctx;
4603 /* For all variables that were not actually used within the context,
4604 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
4607 gimplify_adjust_omp_clauses_1 (splay_tree_node n, void *data)
4609 tree *list_p = (tree *) data;
4610 tree decl = (tree) n->key;
4611 unsigned flags = n->value;
4612 enum omp_clause_code code;
4616 if (flags & (GOVD_EXPLICIT | GOVD_LOCAL))
4618 if ((flags & GOVD_SEEN) == 0)
4620 if (flags & GOVD_DEBUG_PRIVATE)
4622 gcc_assert ((flags & GOVD_DATA_SHARE_CLASS) == GOVD_PRIVATE);
4623 private_debug = true;
4627 = lang_hooks.decls.omp_private_debug_clause (decl,
4628 !!(flags & GOVD_SHARED));
4630 code = OMP_CLAUSE_PRIVATE;
4631 else if (flags & GOVD_SHARED)
4633 if (is_global_var (decl))
4635 code = OMP_CLAUSE_SHARED;
4637 else if (flags & GOVD_PRIVATE)
4638 code = OMP_CLAUSE_PRIVATE;
4639 else if (flags & GOVD_FIRSTPRIVATE)
4640 code = OMP_CLAUSE_FIRSTPRIVATE;
4644 clause = build_omp_clause (code);
4645 OMP_CLAUSE_DECL (clause) = decl;
4646 OMP_CLAUSE_CHAIN (clause) = *list_p;
4648 OMP_CLAUSE_PRIVATE_DEBUG (clause) = 1;
4655 gimplify_adjust_omp_clauses (tree *list_p)
4657 struct gimplify_omp_ctx *ctx = gimplify_omp_ctxp;
4660 while ((c = *list_p) != NULL)
4663 bool remove = false;
4665 switch (OMP_CLAUSE_CODE (c))
4667 case OMP_CLAUSE_PRIVATE:
4668 case OMP_CLAUSE_SHARED:
4669 case OMP_CLAUSE_FIRSTPRIVATE:
4670 decl = OMP_CLAUSE_DECL (c);
4671 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
4672 remove = !(n->value & GOVD_SEEN);
4675 bool shared = OMP_CLAUSE_CODE (c) == OMP_CLAUSE_SHARED;
4676 if ((n->value & GOVD_DEBUG_PRIVATE)
4677 || lang_hooks.decls.omp_private_debug_clause (decl, shared))
4679 gcc_assert ((n->value & GOVD_DEBUG_PRIVATE) == 0
4680 || ((n->value & GOVD_DATA_SHARE_CLASS)
4682 OMP_CLAUSE_SET_CODE (c, OMP_CLAUSE_PRIVATE);
4683 OMP_CLAUSE_PRIVATE_DEBUG (c) = 1;
4688 case OMP_CLAUSE_LASTPRIVATE:
4689 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
4690 accurately reflect the presence of a FIRSTPRIVATE clause. */
4691 decl = OMP_CLAUSE_DECL (c);
4692 n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);
4693 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c)
4694 = (n->value & GOVD_FIRSTPRIVATE) != 0;
4697 case OMP_CLAUSE_REDUCTION:
4698 case OMP_CLAUSE_COPYIN:
4699 case OMP_CLAUSE_COPYPRIVATE:
4701 case OMP_CLAUSE_NUM_THREADS:
4702 case OMP_CLAUSE_SCHEDULE:
4703 case OMP_CLAUSE_NOWAIT:
4704 case OMP_CLAUSE_ORDERED:
4705 case OMP_CLAUSE_DEFAULT:
4713 *list_p = OMP_CLAUSE_CHAIN (c);
4715 list_p = &OMP_CLAUSE_CHAIN (c);
4718 /* Add in any implicit data sharing. */
4719 splay_tree_foreach (ctx->variables, gimplify_adjust_omp_clauses_1, list_p);
4721 gimplify_omp_ctxp = ctx->outer_context;
4722 delete_omp_context (ctx);
4725 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
4726 gimplification of the body, as well as scanning the body for used
4727 variables. We need to do this scan now, because variable-sized
4728 decls will be decomposed during gimplification. */
4730 static enum gimplify_status
4731 gimplify_omp_parallel (tree *expr_p, tree *pre_p)
4733 tree expr = *expr_p;
4735 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr), pre_p, true,
4736 OMP_PARALLEL_COMBINED (expr));
4738 push_gimplify_context ();
4740 gimplify_stmt (&OMP_PARALLEL_BODY (expr));
4742 if (TREE_CODE (OMP_PARALLEL_BODY (expr)) == BIND_EXPR)
4743 pop_gimplify_context (OMP_PARALLEL_BODY (expr));
4745 pop_gimplify_context (NULL_TREE);
4747 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr));
4752 /* Gimplify the gross structure of an OMP_FOR statement. */
4754 static enum gimplify_status
4755 gimplify_omp_for (tree *expr_p, tree *pre_p)
4757 tree for_stmt, decl, t;
4758 enum gimplify_status ret = 0;
4762 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt), pre_p, false, false);
4764 t = OMP_FOR_INIT (for_stmt);
4765 gcc_assert (TREE_CODE (t) == MODIFY_EXPR);
4766 decl = TREE_OPERAND (t, 0);
4767 gcc_assert (DECL_P (decl));
4768 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl)));
4770 /* Make sure the iteration variable is private. */
4771 if (omp_is_private (gimplify_omp_ctxp, decl))
4772 omp_notice_variable (gimplify_omp_ctxp, decl, true);
4774 omp_add_variable (gimplify_omp_ctxp, decl, GOVD_PRIVATE | GOVD_SEEN);
4776 ret |= gimplify_expr (&TREE_OPERAND (t, 1), &OMP_FOR_PRE_BODY (for_stmt),
4777 NULL, is_gimple_val, fb_rvalue);
4779 t = OMP_FOR_COND (for_stmt);
4780 gcc_assert (COMPARISON_CLASS_P (t));
4781 gcc_assert (TREE_OPERAND (t, 0) == decl);
4783 ret |= gimplify_expr (&TREE_OPERAND (t, 1), &OMP_FOR_PRE_BODY (for_stmt),
4784 NULL, is_gimple_val, fb_rvalue);
4786 t = OMP_FOR_INCR (for_stmt);
4787 switch (TREE_CODE (t))
4789 case PREINCREMENT_EXPR:
4790 case POSTINCREMENT_EXPR:
4791 t = build_int_cst (TREE_TYPE (decl), 1);
4793 case PREDECREMENT_EXPR:
4794 case POSTDECREMENT_EXPR:
4795 t = build_int_cst (TREE_TYPE (decl), -1);
4798 t = build2 (PLUS_EXPR, TREE_TYPE (decl), decl, t);
4799 t = build2 (MODIFY_EXPR, void_type_node, decl, t);
4800 OMP_FOR_INCR (for_stmt) = t;
4804 gcc_assert (TREE_OPERAND (t, 0) == decl);
4805 t = TREE_OPERAND (t, 1);
4806 switch (TREE_CODE (t))
4809 if (TREE_OPERAND (t, 1) == decl)
4811 TREE_OPERAND (t, 1) = TREE_OPERAND (t, 0);
4812 TREE_OPERAND (t, 0) = decl;
4816 gcc_assert (TREE_OPERAND (t, 0) == decl);
4822 ret |= gimplify_expr (&TREE_OPERAND (t, 1), &OMP_FOR_PRE_BODY (for_stmt),
4823 NULL, is_gimple_val, fb_rvalue);
4830 gimplify_to_stmt_list (&OMP_FOR_BODY (for_stmt));
4831 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt));
4833 return ret == GS_ALL_DONE ? GS_ALL_DONE : GS_ERROR;
4836 /* Gimplify the gross structure of other OpenMP worksharing constructs.
4837 In particular, OMP_SECTIONS and OMP_SINGLE. */
4839 static enum gimplify_status
4840 gimplify_omp_workshare (tree *expr_p, tree *pre_p)
4842 tree stmt = *expr_p;
4844 gimplify_scan_omp_clauses (&OMP_CLAUSES (stmt), pre_p, false, false);
4845 gimplify_to_stmt_list (&OMP_BODY (stmt));
4846 gimplify_adjust_omp_clauses (&OMP_CLAUSES (stmt));
4851 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
4852 stabilized the lhs of the atomic operation as *ADDR. Return true if
4853 EXPR is this stabilized form. */
4856 goa_lhs_expr_p (tree expr, tree addr)
4858 /* Also include casts to other type variants. The C front end is fond
4859 of adding these for e.g. volatile variables. This is like
4860 STRIP_TYPE_NOPS but includes the main variant lookup. */
4861 while ((TREE_CODE (expr) == NOP_EXPR
4862 || TREE_CODE (expr) == CONVERT_EXPR
4863 || TREE_CODE (expr) == NON_LVALUE_EXPR)
4864 && TREE_OPERAND (expr, 0) != error_mark_node
4865 && (TYPE_MAIN_VARIANT (TREE_TYPE (expr))
4866 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (expr, 0)))))
4867 expr = TREE_OPERAND (expr, 0);
4869 if (TREE_CODE (expr) == INDIRECT_REF && TREE_OPERAND (expr, 0) == addr)
4871 if (TREE_CODE (addr) == ADDR_EXPR && expr == TREE_OPERAND (addr, 0))
4876 /* A subroutine of gimplify_omp_atomic. Attempt to implement the atomic
4877 operation as a __sync_fetch_and_op builtin. INDEX is log2 of the
4878 size of the data type, and thus usable to find the index of the builtin
4879 decl. Returns GS_UNHANDLED if the expression is not of the proper form. */
4881 static enum gimplify_status
4882 gimplify_omp_atomic_fetch_op (tree *expr_p, tree addr, tree rhs, int index)
4884 enum built_in_function base;
4885 tree decl, args, itype;
4886 enum insn_code *optab;
4888 /* Check for one of the supported fetch-op operations. */
4889 switch (TREE_CODE (rhs))
4892 base = BUILT_IN_FETCH_AND_ADD_N;
4893 optab = sync_add_optab;
4896 base = BUILT_IN_FETCH_AND_SUB_N;
4897 optab = sync_add_optab;
4900 base = BUILT_IN_FETCH_AND_AND_N;
4901 optab = sync_and_optab;
4904 base = BUILT_IN_FETCH_AND_OR_N;
4905 optab = sync_ior_optab;
4908 base = BUILT_IN_FETCH_AND_XOR_N;
4909 optab = sync_xor_optab;
4912 return GS_UNHANDLED;
4915 /* Make sure the expression is of the proper form. */
4916 if (goa_lhs_expr_p (TREE_OPERAND (rhs, 0), addr))
4917 rhs = TREE_OPERAND (rhs, 1);
4918 else if (commutative_tree_code (TREE_CODE (rhs))
4919 && goa_lhs_expr_p (TREE_OPERAND (rhs, 1), addr))
4920 rhs = TREE_OPERAND (rhs, 0);
4922 return GS_UNHANDLED;
4924 decl = built_in_decls[base + index + 1];
4925 itype = TREE_TYPE (TREE_TYPE (decl));
4927 if (optab[TYPE_MODE (itype)] == CODE_FOR_nothing)
4928 return GS_UNHANDLED;
4930 args = tree_cons (NULL, fold_convert (itype, rhs), NULL);
4931 args = tree_cons (NULL, addr, args);
4932 *expr_p = build_function_call_expr (decl, args);
4936 /* A subroutine of gimplify_omp_atomic_pipeline. Walk *EXPR_P and replace
4937 appearances of *LHS_ADDR with LHS_VAR. If an expression does not involve
4938 the lhs, evaluate it into a temporary. Return 1 if the lhs appeared as
4939 a subexpression, 0 if it did not, or -1 if an error was encountered. */
4942 goa_stabilize_expr (tree *expr_p, tree *pre_p, tree lhs_addr, tree lhs_var)
4944 tree expr = *expr_p;
4947 if (goa_lhs_expr_p (expr, lhs_addr))
4952 if (is_gimple_val (expr))
4956 switch (TREE_CODE_CLASS (TREE_CODE (expr)))
4959 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 1), pre_p,
4962 saw_lhs |= goa_stabilize_expr (&TREE_OPERAND (expr, 0), pre_p,
4971 enum gimplify_status gs;
4972 gs = gimplify_expr (expr_p, pre_p, NULL, is_gimple_val, fb_rvalue);
4973 if (gs != GS_ALL_DONE)
4980 /* A subroutine of gimplify_omp_atomic. Implement the atomic operation as:
4984 newval = rhs; // with oldval replacing *addr in rhs
4985 oldval = __sync_val_compare_and_swap (addr, oldval, newval);
4986 if (oldval != newval)
4989 INDEX is log2 of the size of the data type, and thus usable to find the
4990 index of the builtin decl. */
4992 static enum gimplify_status
4993 gimplify_omp_atomic_pipeline (tree *expr_p, tree *pre_p, tree addr,
4994 tree rhs, int index)
4996 tree oldval, oldival, oldival2, newval, newival, label;
4997 tree type, itype, cmpxchg, args, x, iaddr;
4999 cmpxchg = built_in_decls[BUILT_IN_VAL_COMPARE_AND_SWAP_N + index + 1];
5000 type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr)));
5001 itype = TREE_TYPE (TREE_TYPE (cmpxchg));
5003 if (sync_compare_and_swap[TYPE_MODE (itype)] == CODE_FOR_nothing)
5004 return GS_UNHANDLED;
5006 oldval = create_tmp_var (type, NULL);
5007 newval = create_tmp_var (type, NULL);
5009 /* Precompute as much of RHS as possible. In the same walk, replace
5010 occurrences of the lhs value with our temporary. */
5011 if (goa_stabilize_expr (&rhs, pre_p, addr, oldval) < 0)
5014 x = build_fold_indirect_ref (addr);
5015 x = build2 (MODIFY_EXPR, void_type_node, oldval, x);
5016 gimplify_and_add (x, pre_p);
5018 /* For floating-point values, we'll need to view-convert them to integers
5019 so that we can perform the atomic compare and swap. Simplify the
5020 following code by always setting up the "i"ntegral variables. */
5021 if (INTEGRAL_TYPE_P (type) || POINTER_TYPE_P (type))
5029 oldival = create_tmp_var (itype, NULL);
5030 newival = create_tmp_var (itype, NULL);
5032 x = build1 (VIEW_CONVERT_EXPR, itype, oldval);
5033 x = build2 (MODIFY_EXPR, void_type_node, oldival, x);
5034 gimplify_and_add (x, pre_p);
5035 iaddr = fold_convert (build_pointer_type (itype), addr);
5038 oldival2 = create_tmp_var (itype, NULL);
5040 label = create_artificial_label ();
5041 x = build1 (LABEL_EXPR, void_type_node, label);
5042 gimplify_and_add (x, pre_p);
5044 x = build2 (MODIFY_EXPR, void_type_node, newval, rhs);
5045 gimplify_and_add (x, pre_p);
5047 if (newval != newival)
5049 x = build1 (VIEW_CONVERT_EXPR, itype, newval);
5050 x = build2 (MODIFY_EXPR, void_type_node, newival, x);
5051 gimplify_and_add (x, pre_p);
5054 x = build2 (MODIFY_EXPR, void_type_node, oldival2, oldival);
5055 gimplify_and_add (x, pre_p);
5057 args = tree_cons (NULL, fold_convert (itype, newival), NULL);
5058 args = tree_cons (NULL, fold_convert (itype, oldival), args);
5059 args = tree_cons (NULL, iaddr, args);
5060 x = build_function_call_expr (cmpxchg, args);
5061 if (oldval == oldival)
5062 x = fold_convert (type, x);
5063 x = build2 (MODIFY_EXPR, void_type_node, oldival, x);
5064 gimplify_and_add (x, pre_p);
5066 /* For floating point, be prepared for the loop backedge. */
5067 if (oldval != oldival)
5069 x = build1 (VIEW_CONVERT_EXPR, type, oldival);
5070 x = build2 (MODIFY_EXPR, void_type_node, oldval, x);
5071 gimplify_and_add (x, pre_p);
5074 /* Note that we always perform the comparison as an integer, even for
5075 floating point. This allows the atomic operation to properly
5076 succeed even with NaNs and -0.0. */
5077 x = build3 (COND_EXPR, void_type_node,
5078 build2 (NE_EXPR, boolean_type_node, oldival, oldival2),
5079 build1 (GOTO_EXPR, void_type_node, label), NULL);
5080 gimplify_and_add (x, pre_p);
5086 /* A subroutine of gimplify_omp_atomic. Implement the atomic operation as:
5088 GOMP_atomic_start ();
5092 The result is not globally atomic, but works so long as all parallel
5093 references are within #pragma omp atomic directives. According to
5094 responses received from omp@openmp.org, appears to be within spec.
5095 Which makes sense, since that's how several other compilers handle
5096 this situation as well. */
5098 static enum gimplify_status
5099 gimplify_omp_atomic_mutex (tree *expr_p, tree *pre_p, tree addr, tree rhs)
5103 t = built_in_decls[BUILT_IN_GOMP_ATOMIC_START];
5104 t = build_function_call_expr (t, NULL);
5105 gimplify_and_add (t, pre_p);
5107 t = build_fold_indirect_ref (addr);
5108 t = build2 (MODIFY_EXPR, void_type_node, t, rhs);
5109 gimplify_and_add (t, pre_p);
5111 t = built_in_decls[BUILT_IN_GOMP_ATOMIC_END];
5112 t = build_function_call_expr (t, NULL);
5113 gimplify_and_add (t, pre_p);
5119 /* Gimplify an OMP_ATOMIC statement. */
5121 static enum gimplify_status
5122 gimplify_omp_atomic (tree *expr_p, tree *pre_p)
5124 tree addr = TREE_OPERAND (*expr_p, 0);
5125 tree rhs = TREE_OPERAND (*expr_p, 1);
5126 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr)));
5127 HOST_WIDE_INT index;
5129 /* Make sure the type is one of the supported sizes. */
5130 index = tree_low_cst (TYPE_SIZE_UNIT (type), 1);
5131 index = exact_log2 (index);
5132 if (index >= 0 && index <= 4)
5134 enum gimplify_status gs;
5137 if (DECL_P (TREE_OPERAND (addr, 0)))
5138 align = DECL_ALIGN_UNIT (TREE_OPERAND (addr, 0));
5139 else if (TREE_CODE (TREE_OPERAND (addr, 0)) == COMPONENT_REF
5140 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (addr, 0), 1))
5142 align = DECL_ALIGN_UNIT (TREE_OPERAND (TREE_OPERAND (addr, 0), 1));
5144 align = TYPE_ALIGN_UNIT (type);
5146 /* __sync builtins require strict data alignment. */
5147 if (exact_log2 (align) >= index)
5149 /* When possible, use specialized atomic update functions. */
5150 if (INTEGRAL_TYPE_P (type) || POINTER_TYPE_P (type))
5152 gs = gimplify_omp_atomic_fetch_op (expr_p, addr, rhs, index);
5153 if (gs != GS_UNHANDLED)
5157 /* If we don't have specialized __sync builtins, try and implement
5158 as a compare and swap loop. */
5159 gs = gimplify_omp_atomic_pipeline (expr_p, pre_p, addr, rhs, index);
5160 if (gs != GS_UNHANDLED)
5165 /* The ultimate fallback is wrapping the operation in a mutex. */
5166 return gimplify_omp_atomic_mutex (expr_p, pre_p, addr, rhs);
5169 /* Gimplifies the expression tree pointed to by EXPR_P. Return 0 if
5170 gimplification failed.
5172 PRE_P points to the list where side effects that must happen before
5173 EXPR should be stored.
5175 POST_P points to the list where side effects that must happen after
5176 EXPR should be stored, or NULL if there is no suitable list. In
5177 that case, we copy the result to a temporary, emit the
5178 post-effects, and then return the temporary.
5180 GIMPLE_TEST_F points to a function that takes a tree T and
5181 returns nonzero if T is in the GIMPLE form requested by the
5182 caller. The GIMPLE predicates are in tree-gimple.c.
5184 This test is used twice. Before gimplification, the test is
5185 invoked to determine whether *EXPR_P is already gimple enough. If
5186 that fails, *EXPR_P is gimplified according to its code and
5187 GIMPLE_TEST_F is called again. If the test still fails, then a new
5188 temporary variable is created and assigned the value of the
5189 gimplified expression.
5191 FALLBACK tells the function what sort of a temporary we want. If the 1
5192 bit is set, an rvalue is OK. If the 2 bit is set, an lvalue is OK.
5193 If both are set, either is OK, but an lvalue is preferable.
5195 The return value is either GS_ERROR or GS_ALL_DONE, since this function
5196 iterates until solution. */
5198 enum gimplify_status
5199 gimplify_expr (tree *expr_p, tree *pre_p, tree *post_p,
5200 bool (* gimple_test_f) (tree), fallback_t fallback)
5203 tree internal_pre = NULL_TREE;
5204 tree internal_post = NULL_TREE;
5206 int is_statement = (pre_p == NULL);
5207 location_t saved_location;
5208 enum gimplify_status ret;
5210 save_expr = *expr_p;
5211 if (save_expr == NULL_TREE)
5214 /* We used to check the predicate here and return immediately if it
5215 succeeds. This is wrong; the design is for gimplification to be
5216 idempotent, and for the predicates to only test for valid forms, not
5217 whether they are fully simplified. */
5219 /* Set up our internal queues if needed. */
5221 pre_p = &internal_pre;
5223 post_p = &internal_post;
5225 saved_location = input_location;
5226 if (save_expr != error_mark_node
5227 && EXPR_HAS_LOCATION (*expr_p))
5228 input_location = EXPR_LOCATION (*expr_p);
5230 /* Loop over the specific gimplifiers until the toplevel node
5231 remains the same. */
5234 /* Strip away as many useless type conversions as possible
5236 STRIP_USELESS_TYPE_CONVERSION (*expr_p);
5238 /* Remember the expr. */
5239 save_expr = *expr_p;
5241 /* Die, die, die, my darling. */
5242 if (save_expr == error_mark_node
5243 || (TREE_TYPE (save_expr)
5244 && TREE_TYPE (save_expr) == error_mark_node))
5250 /* Do any language-specific gimplification. */
5251 ret = lang_hooks.gimplify_expr (expr_p, pre_p, post_p);
5254 if (*expr_p == NULL_TREE)
5256 if (*expr_p != save_expr)
5259 else if (ret != GS_UNHANDLED)
5263 switch (TREE_CODE (*expr_p))
5265 /* First deal with the special cases. */
5267 case POSTINCREMENT_EXPR:
5268 case POSTDECREMENT_EXPR:
5269 case PREINCREMENT_EXPR:
5270 case PREDECREMENT_EXPR:
5271 ret = gimplify_self_mod_expr (expr_p, pre_p, post_p,
5272 fallback != fb_none);
5276 case ARRAY_RANGE_REF:
5280 case VIEW_CONVERT_EXPR:
5281 ret = gimplify_compound_lval (expr_p, pre_p, post_p,
5282 fallback ? fallback : fb_rvalue);
5286 ret = gimplify_cond_expr (expr_p, pre_p, fallback);
5287 /* C99 code may assign to an array in a structure value of a
5288 conditional expression, and this has undefined behavior
5289 only on execution, so create a temporary if an lvalue is
5291 if (fallback == fb_lvalue)
5293 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
5294 lang_hooks.mark_addressable (*expr_p);
5299 ret = gimplify_call_expr (expr_p, pre_p, fallback != fb_none);
5300 /* C99 code may assign to an array in a structure returned
5301 from a function, and this has undefined behavior only on
5302 execution, so create a temporary if an lvalue is
5304 if (fallback == fb_lvalue)
5306 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
5307 lang_hooks.mark_addressable (*expr_p);
5315 ret = gimplify_compound_expr (expr_p, pre_p, fallback != fb_none);
5320 ret = gimplify_modify_expr (expr_p, pre_p, post_p,
5321 fallback != fb_none);
5323 /* The distinction between MODIFY_EXPR and INIT_EXPR is no longer
5325 if (*expr_p && TREE_CODE (*expr_p) == INIT_EXPR)
5326 TREE_SET_CODE (*expr_p, MODIFY_EXPR);
5329 case TRUTH_ANDIF_EXPR:
5330 case TRUTH_ORIF_EXPR:
5331 ret = gimplify_boolean_expr (expr_p);
5334 case TRUTH_NOT_EXPR:
5335 TREE_OPERAND (*expr_p, 0)
5336 = gimple_boolify (TREE_OPERAND (*expr_p, 0));
5337 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5338 is_gimple_val, fb_rvalue);
5339 recalculate_side_effects (*expr_p);
5343 ret = gimplify_addr_expr (expr_p, pre_p, post_p);
5347 ret = gimplify_va_arg_expr (expr_p, pre_p, post_p);
5352 if (IS_EMPTY_STMT (*expr_p))
5358 if (VOID_TYPE_P (TREE_TYPE (*expr_p))
5359 || fallback == fb_none)
5361 /* Just strip a conversion to void (or in void context) and
5363 *expr_p = TREE_OPERAND (*expr_p, 0);
5367 ret = gimplify_conversion (expr_p);
5368 if (ret == GS_ERROR)
5370 if (*expr_p != save_expr)
5374 case FIX_TRUNC_EXPR:
5376 case FIX_FLOOR_EXPR:
5377 case FIX_ROUND_EXPR:
5378 /* unary_expr: ... | '(' cast ')' val | ... */
5379 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5380 is_gimple_val, fb_rvalue);
5381 recalculate_side_effects (*expr_p);
5385 *expr_p = fold_indirect_ref (*expr_p);
5386 if (*expr_p != save_expr)
5388 /* else fall through. */
5389 case ALIGN_INDIRECT_REF:
5390 case MISALIGNED_INDIRECT_REF:
5391 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5392 is_gimple_reg, fb_rvalue);
5393 recalculate_side_effects (*expr_p);
5396 /* Constants need not be gimplified. */
5406 /* If we require an lvalue, such as for ADDR_EXPR, retain the
5407 CONST_DECL node. Otherwise the decl is replaceable by its
5409 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
5410 if (fallback & fb_lvalue)
5413 *expr_p = DECL_INITIAL (*expr_p);
5417 ret = gimplify_decl_expr (expr_p);
5421 /* FIXME make this a decl. */
5426 ret = gimplify_bind_expr (expr_p, NULL, pre_p);
5430 ret = gimplify_loop_expr (expr_p, pre_p);
5434 ret = gimplify_switch_expr (expr_p, pre_p);
5438 ret = gimplify_exit_expr (expr_p);
5442 /* If the target is not LABEL, then it is a computed jump
5443 and the target needs to be gimplified. */
5444 if (TREE_CODE (GOTO_DESTINATION (*expr_p)) != LABEL_DECL)
5445 ret = gimplify_expr (&GOTO_DESTINATION (*expr_p), pre_p,
5446 NULL, is_gimple_val, fb_rvalue);
5451 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p))
5452 == current_function_decl);
5455 case CASE_LABEL_EXPR:
5456 ret = gimplify_case_label_expr (expr_p);
5460 ret = gimplify_return_expr (*expr_p, pre_p);
5464 /* Don't reduce this in place; let gimplify_init_constructor work its
5465 magic. Buf if we're just elaborating this for side effects, just
5466 gimplify any element that has side-effects. */
5467 if (fallback == fb_none)
5469 unsigned HOST_WIDE_INT ix;
5470 constructor_elt *ce;
5471 tree temp = NULL_TREE;
5473 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (*expr_p),
5476 if (TREE_SIDE_EFFECTS (ce->value))
5477 append_to_statement_list (ce->value, &temp);
5482 /* C99 code may assign to an array in a constructed
5483 structure or union, and this has undefined behavior only
5484 on execution, so create a temporary if an lvalue is
5486 else if (fallback == fb_lvalue)
5488 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
5489 lang_hooks.mark_addressable (*expr_p);
5495 /* The following are special cases that are not handled by the
5496 original GIMPLE grammar. */
5498 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
5501 ret = gimplify_save_expr (expr_p, pre_p, post_p);
5506 enum gimplify_status r0, r1, r2;
5508 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5509 is_gimple_lvalue, fb_either);
5510 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
5511 is_gimple_val, fb_rvalue);
5512 r2 = gimplify_expr (&TREE_OPERAND (*expr_p, 2), pre_p, post_p,
5513 is_gimple_val, fb_rvalue);
5514 recalculate_side_effects (*expr_p);
5516 ret = MIN (r0, MIN (r1, r2));
5520 case NON_LVALUE_EXPR:
5521 /* This should have been stripped above. */
5525 ret = gimplify_asm_expr (expr_p, pre_p, post_p);
5528 case TRY_FINALLY_EXPR:
5529 case TRY_CATCH_EXPR:
5530 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p, 0));
5531 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p, 1));
5535 case CLEANUP_POINT_EXPR:
5536 ret = gimplify_cleanup_point_expr (expr_p, pre_p);
5540 ret = gimplify_target_expr (expr_p, pre_p, post_p);
5544 gimplify_to_stmt_list (&CATCH_BODY (*expr_p));
5548 case EH_FILTER_EXPR:
5549 gimplify_to_stmt_list (&EH_FILTER_FAILURE (*expr_p));
5555 enum gimplify_status r0, r1;
5556 r0 = gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p), pre_p, post_p,
5557 is_gimple_val, fb_rvalue);
5558 r1 = gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p), pre_p, post_p,
5559 is_gimple_val, fb_rvalue);
5565 /* We get here when taking the address of a label. We mark
5566 the label as "forced"; meaning it can never be removed and
5567 it is a potential target for any computed goto. */
5568 FORCED_LABEL (*expr_p) = 1;
5572 case STATEMENT_LIST:
5573 ret = gimplify_statement_list (expr_p);
5576 case WITH_SIZE_EXPR:
5578 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
5579 post_p == &internal_post ? NULL : post_p,
5580 gimple_test_f, fallback);
5581 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
5582 is_gimple_val, fb_rvalue);
5588 ret = gimplify_var_or_parm_decl (expr_p);
5592 /* When within an OpenMP context, notice uses of variables. */
5593 if (gimplify_omp_ctxp)
5594 omp_notice_variable (gimplify_omp_ctxp, *expr_p, true);
5599 /* Allow callbacks into the gimplifier during optimization. */
5604 ret = gimplify_omp_parallel (expr_p, pre_p);
5608 ret = gimplify_omp_for (expr_p, pre_p);
5613 ret = gimplify_omp_workshare (expr_p, pre_p);
5620 gimplify_to_stmt_list (&OMP_BODY (*expr_p));
5624 ret = gimplify_omp_atomic (expr_p, pre_p);
5633 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p)))
5635 case tcc_comparison:
5636 /* If this is a comparison of objects of aggregate type,
5637 handle it specially (by converting to a call to
5638 memcmp). It would be nice to only have to do this
5639 for variable-sized objects, but then we'd have to
5640 allow the same nest of reference nodes we allow for
5641 MODIFY_EXPR and that's too complex. */
5642 if (!AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p, 1))))
5644 ret = gimplify_variable_sized_compare (expr_p);
5647 /* If *EXPR_P does not need to be special-cased, handle it
5648 according to its class. */
5650 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
5651 post_p, is_gimple_val, fb_rvalue);
5657 enum gimplify_status r0, r1;
5659 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
5660 post_p, is_gimple_val, fb_rvalue);
5661 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
5662 post_p, is_gimple_val, fb_rvalue);
5668 case tcc_declaration:
5671 goto dont_recalculate;
5674 gcc_assert (TREE_CODE (*expr_p) == TRUTH_AND_EXPR
5675 || TREE_CODE (*expr_p) == TRUTH_OR_EXPR
5676 || TREE_CODE (*expr_p) == TRUTH_XOR_EXPR);
5680 recalculate_side_effects (*expr_p);
5685 /* If we replaced *expr_p, gimplify again. */
5686 if (ret == GS_OK && (*expr_p == NULL || *expr_p == save_expr))
5689 while (ret == GS_OK);
5691 /* If we encountered an error_mark somewhere nested inside, either
5692 stub out the statement or propagate the error back out. */
5693 if (ret == GS_ERROR)
5700 /* This was only valid as a return value from the langhook, which
5701 we handled. Make sure it doesn't escape from any other context. */
5702 gcc_assert (ret != GS_UNHANDLED);
5704 if (fallback == fb_none && *expr_p && !is_gimple_stmt (*expr_p))
5706 /* We aren't looking for a value, and we don't have a valid
5707 statement. If it doesn't have side-effects, throw it away. */
5708 if (!TREE_SIDE_EFFECTS (*expr_p))
5710 else if (!TREE_THIS_VOLATILE (*expr_p))
5712 /* This is probably a _REF that contains something nested that
5713 has side effects. Recurse through the operands to find it. */
5714 enum tree_code code = TREE_CODE (*expr_p);
5719 case REALPART_EXPR: case IMAGPART_EXPR:
5720 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5721 gimple_test_f, fallback);
5724 case ARRAY_REF: case ARRAY_RANGE_REF:
5725 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
5726 gimple_test_f, fallback);
5727 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
5728 gimple_test_f, fallback);
5732 /* Anything else with side-effects must be converted to
5733 a valid statement before we get here. */
5739 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p)))
5741 /* Historically, the compiler has treated a bare
5742 reference to a volatile lvalue as forcing a load. */
5743 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p));
5744 /* Normally, we do not want to create a temporary for a
5745 TREE_ADDRESSABLE type because such a type should not be
5746 copied by bitwise-assignment. However, we make an
5747 exception here, as all we are doing here is ensuring that
5748 we read the bytes that make up the type. We use
5749 create_tmp_var_raw because create_tmp_var will abort when
5750 given a TREE_ADDRESSABLE type. */
5751 tree tmp = create_tmp_var_raw (type, "vol");
5752 gimple_add_tmp_var (tmp);
5753 *expr_p = build2 (MODIFY_EXPR, type, tmp, *expr_p);
5756 /* We can't do anything useful with a volatile reference to
5757 incomplete type, so just throw it away. */
5761 /* If we are gimplifying at the statement level, we're done. Tack
5762 everything together and replace the original statement with the
5764 if (fallback == fb_none || is_statement)
5766 if (internal_pre || internal_post)
5768 append_to_statement_list (*expr_p, &internal_pre);
5769 append_to_statement_list (internal_post, &internal_pre);
5770 annotate_all_with_locus (&internal_pre, input_location);
5771 *expr_p = internal_pre;
5775 else if (TREE_CODE (*expr_p) == STATEMENT_LIST)
5776 annotate_all_with_locus (expr_p, input_location);
5778 annotate_one_with_locus (*expr_p, input_location);
5782 /* Otherwise we're gimplifying a subexpression, so the resulting value is
5785 /* If it's sufficiently simple already, we're done. Unless we are
5786 handling some post-effects internally; if that's the case, we need to
5787 copy into a temp before adding the post-effects to the tree. */
5788 if (!internal_post && (*gimple_test_f) (*expr_p))
5791 /* Otherwise, we need to create a new temporary for the gimplified
5794 /* We can't return an lvalue if we have an internal postqueue. The
5795 object the lvalue refers to would (probably) be modified by the
5796 postqueue; we need to copy the value out first, which means an
5798 if ((fallback & fb_lvalue) && !internal_post
5799 && is_gimple_addressable (*expr_p))
5801 /* An lvalue will do. Take the address of the expression, store it
5802 in a temporary, and replace the expression with an INDIRECT_REF of
5804 tmp = build_fold_addr_expr (*expr_p);
5805 gimplify_expr (&tmp, pre_p, post_p, is_gimple_reg, fb_rvalue);
5806 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (tmp)), tmp);
5808 else if ((fallback & fb_rvalue) && is_gimple_formal_tmp_rhs (*expr_p))
5810 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p)));
5812 /* An rvalue will do. Assign the gimplified expression into a new
5813 temporary TMP and replace the original expression with TMP. */
5815 if (internal_post || (fallback & fb_lvalue))
5816 /* The postqueue might change the value of the expression between
5817 the initialization and use of the temporary, so we can't use a
5818 formal temp. FIXME do we care? */
5819 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
5821 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
5823 if (TREE_CODE (*expr_p) != SSA_NAME)
5824 DECL_GIMPLE_FORMAL_TEMP_P (*expr_p) = 1;
5828 #ifdef ENABLE_CHECKING
5829 if (!(fallback & fb_mayfail))
5831 fprintf (stderr, "gimplification failed:\n");
5832 print_generic_expr (stderr, *expr_p, 0);
5833 debug_tree (*expr_p);
5834 internal_error ("gimplification failed");
5837 gcc_assert (fallback & fb_mayfail);
5838 /* If this is an asm statement, and the user asked for the
5839 impossible, don't die. Fail and let gimplify_asm_expr
5845 /* Make sure the temporary matches our predicate. */
5846 gcc_assert ((*gimple_test_f) (*expr_p));
5850 annotate_all_with_locus (&internal_post, input_location);
5851 append_to_statement_list (internal_post, pre_p);
5855 input_location = saved_location;
5859 /* Look through TYPE for variable-sized objects and gimplify each such
5860 size that we find. Add to LIST_P any statements generated. */
5863 gimplify_type_sizes (tree type, tree *list_p)
5867 if (type == NULL || type == error_mark_node)
5870 /* We first do the main variant, then copy into any other variants. */
5871 type = TYPE_MAIN_VARIANT (type);
5873 /* Avoid infinite recursion. */
5874 if (TYPE_SIZES_GIMPLIFIED (type))
5877 TYPE_SIZES_GIMPLIFIED (type) = 1;
5879 switch (TREE_CODE (type))
5885 gimplify_one_sizepos (&TYPE_MIN_VALUE (type), list_p);
5886 gimplify_one_sizepos (&TYPE_MAX_VALUE (type), list_p);
5888 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5890 TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (type);
5891 TYPE_MAX_VALUE (t) = TYPE_MAX_VALUE (type);
5896 /* These types may not have declarations, so handle them here. */
5897 gimplify_type_sizes (TREE_TYPE (type), list_p);
5898 gimplify_type_sizes (TYPE_DOMAIN (type), list_p);
5903 case QUAL_UNION_TYPE:
5904 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
5905 if (TREE_CODE (field) == FIELD_DECL)
5907 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field), list_p);
5908 gimplify_type_sizes (TREE_TYPE (field), list_p);
5913 case REFERENCE_TYPE:
5914 gimplify_type_sizes (TREE_TYPE (type), list_p);
5921 gimplify_one_sizepos (&TYPE_SIZE (type), list_p);
5922 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type), list_p);
5924 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5926 TYPE_SIZE (t) = TYPE_SIZE (type);
5927 TYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (type);
5928 TYPE_SIZES_GIMPLIFIED (t) = 1;
5932 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
5933 a size or position, has had all of its SAVE_EXPRs evaluated.
5934 We add any required statements to STMT_P. */
5937 gimplify_one_sizepos (tree *expr_p, tree *stmt_p)
5939 tree type, expr = *expr_p;
5941 /* We don't do anything if the value isn't there, is constant, or contains
5942 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
5943 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
5944 will want to replace it with a new variable, but that will cause problems
5945 if this type is from outside the function. It's OK to have that here. */
5946 if (expr == NULL_TREE || TREE_CONSTANT (expr)
5947 || TREE_CODE (expr) == VAR_DECL
5948 || CONTAINS_PLACEHOLDER_P (expr))
5951 type = TREE_TYPE (expr);
5952 *expr_p = unshare_expr (expr);
5954 gimplify_expr (expr_p, stmt_p, NULL, is_gimple_val, fb_rvalue);
5957 /* Verify that we've an exact type match with the original expression.
5958 In particular, we do not wish to drop a "sizetype" in favour of a
5959 type of similar dimensions. We don't want to pollute the generic
5960 type-stripping code with this knowledge because it doesn't matter
5961 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
5962 and friends retain their "sizetype-ness". */
5963 if (TREE_TYPE (expr) != type
5964 && TREE_CODE (type) == INTEGER_TYPE
5965 && TYPE_IS_SIZETYPE (type))
5969 *expr_p = create_tmp_var (type, NULL);
5970 tmp = build1 (NOP_EXPR, type, expr);
5971 tmp = build2 (MODIFY_EXPR, type, *expr_p, tmp);
5972 if (EXPR_HAS_LOCATION (expr))
5973 SET_EXPR_LOCUS (tmp, EXPR_LOCUS (expr));
5975 SET_EXPR_LOCATION (tmp, input_location);
5977 gimplify_and_add (tmp, stmt_p);
5981 #ifdef ENABLE_CHECKING
5982 /* Compare types A and B for a "close enough" match. */
5985 cpt_same_type (tree a, tree b)
5987 if (lang_hooks.types_compatible_p (a, b))
5990 /* ??? The C++ FE decomposes METHOD_TYPES to FUNCTION_TYPES and doesn't
5991 link them together. This routine is intended to catch type errors
5992 that will affect the optimizers, and the optimizers don't add new
5993 dereferences of function pointers, so ignore it. */
5994 if ((TREE_CODE (a) == FUNCTION_TYPE || TREE_CODE (a) == METHOD_TYPE)
5995 && (TREE_CODE (b) == FUNCTION_TYPE || TREE_CODE (b) == METHOD_TYPE))
5998 /* ??? The C FE pushes type qualifiers after the fact into the type of
5999 the element from the type of the array. See build_unary_op's handling
6000 of ADDR_EXPR. This seems wrong -- if we were going to do this, we
6001 should have done it when creating the variable in the first place.
6002 Alternately, why aren't the two array types made variants? */
6003 if (TREE_CODE (a) == ARRAY_TYPE && TREE_CODE (b) == ARRAY_TYPE)
6004 return cpt_same_type (TREE_TYPE (a), TREE_TYPE (b));
6006 /* And because of those, we have to recurse down through pointers. */
6007 if (POINTER_TYPE_P (a) && POINTER_TYPE_P (b))
6008 return cpt_same_type (TREE_TYPE (a), TREE_TYPE (b));
6013 /* Check for some cases of the front end missing cast expressions.
6014 The type of a dereference should correspond to the pointer type;
6015 similarly the type of an address should match its object. */
6018 check_pointer_types_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
6019 void *data ATTRIBUTE_UNUSED)
6022 tree ptype, otype, dtype;
6024 switch (TREE_CODE (t))
6028 otype = TREE_TYPE (t);
6029 ptype = TREE_TYPE (TREE_OPERAND (t, 0));
6030 dtype = TREE_TYPE (ptype);
6031 gcc_assert (cpt_same_type (otype, dtype));
6035 ptype = TREE_TYPE (t);
6036 otype = TREE_TYPE (TREE_OPERAND (t, 0));
6037 dtype = TREE_TYPE (ptype);
6038 if (!cpt_same_type (otype, dtype))
6040 /* &array is allowed to produce a pointer to the element, rather than
6041 a pointer to the array type. We must allow this in order to
6042 properly represent assigning the address of an array in C into
6043 pointer to the element type. */
6044 gcc_assert (TREE_CODE (otype) == ARRAY_TYPE
6045 && POINTER_TYPE_P (ptype)
6046 && cpt_same_type (TREE_TYPE (otype), dtype));
6060 /* Gimplify the body of statements pointed to by BODY_P. FNDECL is the
6061 function decl containing BODY. */
6064 gimplify_body (tree *body_p, tree fndecl, bool do_parms)
6066 location_t saved_location = input_location;
6067 tree body, parm_stmts;
6069 timevar_push (TV_TREE_GIMPLIFY);
6071 gcc_assert (gimplify_ctxp == NULL);
6072 push_gimplify_context ();
6074 /* Unshare most shared trees in the body and in that of any nested functions.
6075 It would seem we don't have to do this for nested functions because
6076 they are supposed to be output and then the outer function gimplified
6077 first, but the g++ front end doesn't always do it that way. */
6078 unshare_body (body_p, fndecl);
6079 unvisit_body (body_p, fndecl);
6081 /* Make sure input_location isn't set to something wierd. */
6082 input_location = DECL_SOURCE_LOCATION (fndecl);
6084 /* Resolve callee-copies. This has to be done before processing
6085 the body so that DECL_VALUE_EXPR gets processed correctly. */
6086 parm_stmts = do_parms ? gimplify_parameters () : NULL;
6088 /* Gimplify the function's body. */
6089 gimplify_stmt (body_p);
6093 body = alloc_stmt_list ();
6094 else if (TREE_CODE (body) == STATEMENT_LIST)
6096 tree t = expr_only (*body_p);
6101 /* If there isn't an outer BIND_EXPR, add one. */
6102 if (TREE_CODE (body) != BIND_EXPR)
6104 tree b = build3 (BIND_EXPR, void_type_node, NULL_TREE,
6105 NULL_TREE, NULL_TREE);
6106 TREE_SIDE_EFFECTS (b) = 1;
6107 append_to_statement_list_force (body, &BIND_EXPR_BODY (b));
6111 /* If we had callee-copies statements, insert them at the beginning
6115 append_to_statement_list_force (BIND_EXPR_BODY (body), &parm_stmts);
6116 BIND_EXPR_BODY (body) = parm_stmts;
6119 /* Unshare again, in case gimplification was sloppy. */
6120 unshare_all_trees (body);
6124 pop_gimplify_context (body);
6125 gcc_assert (gimplify_ctxp == NULL);
6127 #ifdef ENABLE_CHECKING
6128 walk_tree (body_p, check_pointer_types_r, NULL, NULL);
6131 timevar_pop (TV_TREE_GIMPLIFY);
6132 input_location = saved_location;
6135 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
6136 node for the function we want to gimplify. */
6139 gimplify_function_tree (tree fndecl)
6141 tree oldfn, parm, ret;
6143 oldfn = current_function_decl;
6144 current_function_decl = fndecl;
6145 cfun = DECL_STRUCT_FUNCTION (fndecl);
6147 allocate_struct_function (fndecl);
6149 for (parm = DECL_ARGUMENTS (fndecl); parm ; parm = TREE_CHAIN (parm))
6151 /* Preliminarily mark non-addressed complex variables as eligible
6152 for promotion to gimple registers. We'll transform their uses
6154 if (TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
6155 && !TREE_THIS_VOLATILE (parm)
6156 && !needs_to_live_in_memory (parm))
6157 DECL_COMPLEX_GIMPLE_REG_P (parm) = 1;
6160 ret = DECL_RESULT (fndecl);
6161 if (TREE_CODE (TREE_TYPE (ret)) == COMPLEX_TYPE
6162 && !needs_to_live_in_memory (ret))
6163 DECL_COMPLEX_GIMPLE_REG_P (ret) = 1;
6165 gimplify_body (&DECL_SAVED_TREE (fndecl), fndecl, true);
6167 /* If we're instrumenting function entry/exit, then prepend the call to
6168 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
6169 catch the exit hook. */
6170 /* ??? Add some way to ignore exceptions for this TFE. */
6171 if (flag_instrument_function_entry_exit
6172 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl))
6176 tf = build2 (TRY_FINALLY_EXPR, void_type_node, NULL, NULL);
6177 TREE_SIDE_EFFECTS (tf) = 1;
6178 x = DECL_SAVED_TREE (fndecl);
6179 append_to_statement_list (x, &TREE_OPERAND (tf, 0));
6180 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_EXIT];
6181 x = build_function_call_expr (x, NULL);
6182 append_to_statement_list (x, &TREE_OPERAND (tf, 1));
6184 bind = build3 (BIND_EXPR, void_type_node, NULL, NULL, NULL);
6185 TREE_SIDE_EFFECTS (bind) = 1;
6186 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_ENTER];
6187 x = build_function_call_expr (x, NULL);
6188 append_to_statement_list (x, &BIND_EXPR_BODY (bind));
6189 append_to_statement_list (tf, &BIND_EXPR_BODY (bind));
6191 DECL_SAVED_TREE (fndecl) = bind;
6194 current_function_decl = oldfn;
6195 cfun = oldfn ? DECL_STRUCT_FUNCTION (oldfn) : NULL;
6199 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
6200 force the result to be either ssa_name or an invariant, otherwise
6201 just force it to be a rhs expression. If VAR is not NULL, make the
6202 base variable of the final destination be VAR if suitable. */
6205 force_gimple_operand (tree expr, tree *stmts, bool simple, tree var)
6208 enum gimplify_status ret;
6209 gimple_predicate gimple_test_f;
6213 if (is_gimple_val (expr))
6216 gimple_test_f = simple ? is_gimple_val : is_gimple_reg_rhs;
6218 push_gimplify_context ();
6219 gimplify_ctxp->into_ssa = in_ssa_p;
6222 expr = build2 (MODIFY_EXPR, TREE_TYPE (var), var, expr);
6224 ret = gimplify_expr (&expr, stmts, NULL,
6225 gimple_test_f, fb_rvalue);
6226 gcc_assert (ret != GS_ERROR);
6228 if (referenced_vars)
6230 for (t = gimplify_ctxp->temps; t ; t = TREE_CHAIN (t))
6231 add_referenced_tmp_var (t);
6234 pop_gimplify_context (NULL);
6239 /* Invokes force_gimple_operand for EXPR with parameters SIMPLE_P and VAR. If
6240 some statements are produced, emits them before BSI. */
6243 force_gimple_operand_bsi (block_stmt_iterator *bsi, tree expr,
6244 bool simple_p, tree var)
6248 expr = force_gimple_operand (expr, &stmts, simple_p, var);
6250 bsi_insert_before (bsi, stmts, BSI_SAME_STMT);
6255 #include "gt-gimplify.h"