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 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, 59 Temple Place - Suite 330, 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 static struct gimplify_ctx
52 tree current_bind_expr;
54 tree conditional_cleanups;
57 varray_type case_labels;
58 /* The formal temporary table. Should this be persistent? */
66 /* Formal (expression) temporary table handling: Multiple occurrences of
67 the same scalar expression are evaluated into the same temporary. */
69 typedef struct gimple_temp_hash_elt
72 tree temp; /* Value */
75 /* Forward declarations. */
76 static enum gimplify_status gimplify_compound_expr (tree *, tree *, bool);
77 #ifdef ENABLE_CHECKING
78 static bool cpt_same_type (tree a, tree b);
82 /* Return a hash value for a formal temporary table entry. */
85 gimple_tree_hash (const void *p)
87 tree t = ((const elt_t *) p)->val;
88 return iterative_hash_expr (t, 0);
91 /* Compare two formal temporary table entries. */
94 gimple_tree_eq (const void *p1, const void *p2)
96 tree t1 = ((const elt_t *) p1)->val;
97 tree t2 = ((const elt_t *) p2)->val;
98 enum tree_code code = TREE_CODE (t1);
100 if (TREE_CODE (t2) != code
101 || TREE_TYPE (t1) != TREE_TYPE (t2))
104 if (!operand_equal_p (t1, t2, 0))
107 /* Only allow them to compare equal if they also hash equal; otherwise
108 results are nondeterminate, and we fail bootstrap comparison. */
109 gcc_assert (gimple_tree_hash (p1) == gimple_tree_hash (p2));
114 /* Set up a context for the gimplifier. */
117 push_gimplify_context (void)
119 gcc_assert (!gimplify_ctxp);
121 = (struct gimplify_ctx *) xcalloc (1, sizeof (struct gimplify_ctx));
123 gimplify_ctxp->temp_htab
124 = htab_create (1000, gimple_tree_hash, gimple_tree_eq, free);
126 gimplify_ctxp->temp_htab = NULL;
129 /* Tear down a context for the gimplifier. If BODY is non-null, then
130 put the temporaries into the outer BIND_EXPR. Otherwise, put them
131 in the unexpanded_var_list. */
134 pop_gimplify_context (tree body)
138 gcc_assert (gimplify_ctxp && !gimplify_ctxp->current_bind_expr);
140 for (t = gimplify_ctxp->temps; t ; t = TREE_CHAIN (t))
141 DECL_GIMPLE_FORMAL_TEMP_P (t) = 0;
144 declare_tmp_vars (gimplify_ctxp->temps, body);
146 record_vars (gimplify_ctxp->temps);
149 if (!quiet_flag && optimize)
150 fprintf (stderr, " collisions: %f ",
151 htab_collisions (gimplify_ctxp->temp_htab));
155 htab_delete (gimplify_ctxp->temp_htab);
156 free (gimplify_ctxp);
157 gimplify_ctxp = NULL;
161 gimple_push_bind_expr (tree bind)
163 TREE_CHAIN (bind) = gimplify_ctxp->current_bind_expr;
164 gimplify_ctxp->current_bind_expr = bind;
168 gimple_pop_bind_expr (void)
170 gimplify_ctxp->current_bind_expr
171 = TREE_CHAIN (gimplify_ctxp->current_bind_expr);
175 gimple_current_bind_expr (void)
177 return gimplify_ctxp->current_bind_expr;
180 /* Returns true iff there is a COND_EXPR between us and the innermost
181 CLEANUP_POINT_EXPR. This info is used by gimple_push_cleanup. */
184 gimple_conditional_context (void)
186 return gimplify_ctxp->conditions > 0;
189 /* Note that we've entered a COND_EXPR. */
192 gimple_push_condition (void)
194 #ifdef ENABLE_CHECKING
195 if (gimplify_ctxp->conditions == 0)
196 gcc_assert (!gimplify_ctxp->conditional_cleanups);
198 ++(gimplify_ctxp->conditions);
201 /* Note that we've left a COND_EXPR. If we're back at unconditional scope
202 now, add any conditional cleanups we've seen to the prequeue. */
205 gimple_pop_condition (tree *pre_p)
207 int conds = --(gimplify_ctxp->conditions);
209 gcc_assert (conds >= 0);
212 append_to_statement_list (gimplify_ctxp->conditional_cleanups, pre_p);
213 gimplify_ctxp->conditional_cleanups = NULL_TREE;
217 /* A subroutine of append_to_statement_list{,_force}. T is not NULL. */
220 append_to_statement_list_1 (tree t, tree *list_p)
223 tree_stmt_iterator i;
227 if (t && TREE_CODE (t) == STATEMENT_LIST)
232 *list_p = list = alloc_stmt_list ();
236 tsi_link_after (&i, t, TSI_CONTINUE_LINKING);
239 /* Add T to the end of the list container pointed by LIST_P.
240 If T is an expression with no effects, it is ignored. */
243 append_to_statement_list (tree t, tree *list_p)
245 if (t && TREE_SIDE_EFFECTS (t))
246 append_to_statement_list_1 (t, list_p);
249 /* Similar, but the statement is always added, regardless of side effects. */
252 append_to_statement_list_force (tree t, tree *list_p)
255 append_to_statement_list_1 (t, list_p);
258 /* Both gimplify the statement T and append it to LIST_P. */
261 gimplify_and_add (tree t, tree *list_p)
264 append_to_statement_list (t, list_p);
267 /* Strip off a legitimate source ending from the input string NAME of
268 length LEN. Rather than having to know the names used by all of
269 our front ends, we strip off an ending of a period followed by
270 up to five characters. (Java uses ".class".) */
273 remove_suffix (char *name, int len)
277 for (i = 2; i < 8 && len > i; i++)
279 if (name[len - i] == '.')
281 name[len - i] = '\0';
287 /* Create a nameless artificial label and put it in the current function
288 context. Returns the newly created label. */
291 create_artificial_label (void)
293 tree lab = build_decl (LABEL_DECL, NULL_TREE, void_type_node);
295 DECL_ARTIFICIAL (lab) = 1;
296 DECL_IGNORED_P (lab) = 1;
297 DECL_CONTEXT (lab) = current_function_decl;
301 /* Create a new temporary name with PREFIX. Returns an identifier. */
303 static GTY(()) unsigned int tmp_var_id_num;
306 create_tmp_var_name (const char *prefix)
312 char *preftmp = ASTRDUP (prefix);
314 remove_suffix (preftmp, strlen (preftmp));
318 ASM_FORMAT_PRIVATE_NAME (tmp_name, prefix ? prefix : "T", tmp_var_id_num++);
319 return get_identifier (tmp_name);
323 /* Create a new temporary variable declaration of type TYPE.
324 Does NOT push it into the current binding. */
327 create_tmp_var_raw (tree type, const char *prefix)
332 /* Make the type of the variable writable. */
333 new_type = build_type_variant (type, 0, 0);
334 TYPE_ATTRIBUTES (new_type) = TYPE_ATTRIBUTES (type);
336 tmp_var = build_decl (VAR_DECL, prefix ? create_tmp_var_name (prefix) : NULL,
339 /* The variable was declared by the compiler. */
340 DECL_ARTIFICIAL (tmp_var) = 1;
341 /* And we don't want debug info for it. */
342 DECL_IGNORED_P (tmp_var) = 1;
344 /* Make the variable writable. */
345 TREE_READONLY (tmp_var) = 0;
347 DECL_EXTERNAL (tmp_var) = 0;
348 TREE_STATIC (tmp_var) = 0;
349 TREE_USED (tmp_var) = 1;
354 /* Create a new temporary variable declaration of type TYPE. DOES push the
355 variable into the current binding. Further, assume that this is called
356 only from gimplification or optimization, at which point the creation of
357 certain types are bugs. */
360 create_tmp_var (tree type, const char *prefix)
364 /* We don't allow types that are addressable (meaning we can't make copies),
365 incomplete, or of variable size. */
366 gcc_assert (!TREE_ADDRESSABLE (type)
367 && COMPLETE_TYPE_P (type)
368 && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST);
370 tmp_var = create_tmp_var_raw (type, prefix);
371 gimple_add_tmp_var (tmp_var);
375 /* Given a tree, try to return a useful variable name that we can use
376 to prefix a temporary that is being assigned the value of the tree.
377 I.E. given <temp> = &A, return A. */
385 STRIP_NOPS (stripped_decl);
386 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
387 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
390 switch (TREE_CODE (stripped_decl))
393 return get_name (TREE_OPERAND (stripped_decl, 0));
401 /* Create a temporary with a name derived from VAL. Subroutine of
402 lookup_tmp_var; nobody else should call this function. */
405 create_tmp_from_val (tree val)
407 return create_tmp_var (TREE_TYPE (val), get_name (val));
410 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
411 an existing expression temporary. */
414 lookup_tmp_var (tree val, bool is_formal)
418 /* If not optimizing, never really reuse a temporary. local-alloc
419 won't allocate any variable that is used in more than one basic
420 block, which means it will go into memory, causing much extra
421 work in reload and final and poorer code generation, outweighing
422 the extra memory allocation here. */
423 if (!optimize || !is_formal || TREE_SIDE_EFFECTS (val))
424 ret = create_tmp_from_val (val);
431 slot = htab_find_slot (gimplify_ctxp->temp_htab, (void *)&elt, INSERT);
434 elt_p = xmalloc (sizeof (*elt_p));
436 elt_p->temp = ret = create_tmp_from_val (val);
437 *slot = (void *) elt_p;
441 elt_p = (elt_t *) *slot;
447 DECL_GIMPLE_FORMAL_TEMP_P (ret) = 1;
452 /* Returns a formal temporary variable initialized with VAL. PRE_P is as
453 in gimplify_expr. Only use this function if:
455 1) The value of the unfactored expression represented by VAL will not
456 change between the initialization and use of the temporary, and
457 2) The temporary will not be otherwise modified.
459 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
460 and #2 means it is inappropriate for && temps.
462 For other cases, use get_initialized_tmp_var instead. */
465 internal_get_tmp_var (tree val, tree *pre_p, tree *post_p, bool is_formal)
469 gimplify_expr (&val, pre_p, post_p, is_gimple_formal_tmp_rhs, fb_rvalue);
471 t = lookup_tmp_var (val, is_formal);
473 mod = build (MODIFY_EXPR, TREE_TYPE (t), t, val);
475 if (EXPR_HAS_LOCATION (val))
476 SET_EXPR_LOCUS (mod, EXPR_LOCUS (val));
478 SET_EXPR_LOCATION (mod, input_location);
480 /* gimplify_modify_expr might want to reduce this further. */
481 gimplify_and_add (mod, pre_p);
483 /* If we're gimplifying into ssa, gimplify_modify_expr will have
484 given our temporary an ssa name. Find and return it. */
485 if (gimplify_ctxp->into_ssa)
486 t = TREE_OPERAND (mod, 0);
492 get_formal_tmp_var (tree val, tree *pre_p)
494 return internal_get_tmp_var (val, pre_p, NULL, true);
497 /* Returns a temporary variable initialized with VAL. PRE_P and POST_P
498 are as in gimplify_expr. */
501 get_initialized_tmp_var (tree val, tree *pre_p, tree *post_p)
503 return internal_get_tmp_var (val, pre_p, post_p, false);
506 /* Declares all the variables in VARS in SCOPE. */
509 declare_tmp_vars (tree vars, tree scope)
516 /* C99 mode puts the default 'return 0;' for main outside the outer
517 braces. So drill down until we find an actual scope. */
518 while (TREE_CODE (scope) == COMPOUND_EXPR)
519 scope = TREE_OPERAND (scope, 0);
521 gcc_assert (TREE_CODE (scope) == BIND_EXPR);
523 temps = nreverse (last);
524 TREE_CHAIN (last) = BIND_EXPR_VARS (scope);
525 BIND_EXPR_VARS (scope) = temps;
530 gimple_add_tmp_var (tree tmp)
532 gcc_assert (!TREE_CHAIN (tmp) && !DECL_SEEN_IN_BIND_EXPR_P (tmp));
534 DECL_CONTEXT (tmp) = current_function_decl;
535 DECL_SEEN_IN_BIND_EXPR_P (tmp) = 1;
539 TREE_CHAIN (tmp) = gimplify_ctxp->temps;
540 gimplify_ctxp->temps = tmp;
545 declare_tmp_vars (tmp, DECL_SAVED_TREE (current_function_decl));
548 /* Determines whether to assign a locus to the statement STMT. */
551 should_carry_locus_p (tree stmt)
553 /* Don't emit a line note for a label. We particularly don't want to
554 emit one for the break label, since it doesn't actually correspond
555 to the beginning of the loop/switch. */
556 if (TREE_CODE (stmt) == LABEL_EXPR)
559 /* Do not annotate empty statements, since it confuses gcov. */
560 if (!TREE_SIDE_EFFECTS (stmt))
567 annotate_one_with_locus (tree t, location_t locus)
569 if (EXPR_P (t) && ! EXPR_HAS_LOCATION (t) && should_carry_locus_p (t))
570 SET_EXPR_LOCATION (t, locus);
574 annotate_all_with_locus (tree *stmt_p, location_t locus)
576 tree_stmt_iterator i;
581 for (i = tsi_start (*stmt_p); !tsi_end_p (i); tsi_next (&i))
583 tree t = tsi_stmt (i);
585 /* Assuming we've already been gimplified, we shouldn't
586 see nested chaining constructs anymore. */
587 gcc_assert (TREE_CODE (t) != STATEMENT_LIST
588 && TREE_CODE (t) != COMPOUND_EXPR);
590 annotate_one_with_locus (t, locus);
594 /* Similar to copy_tree_r() but do not copy SAVE_EXPR or TARGET_EXPR nodes.
595 These nodes model computations that should only be done once. If we
596 were to unshare something like SAVE_EXPR(i++), the gimplification
597 process would create wrong code. */
600 mostly_copy_tree_r (tree *tp, int *walk_subtrees, void *data)
602 enum tree_code code = TREE_CODE (*tp);
603 /* Don't unshare types, decls, constants and SAVE_EXPR nodes. */
604 if (TREE_CODE_CLASS (code) == tcc_type
605 || TREE_CODE_CLASS (code) == tcc_declaration
606 || TREE_CODE_CLASS (code) == tcc_constant
607 || code == SAVE_EXPR || code == TARGET_EXPR
608 /* We can't do anything sensible with a BLOCK used as an expression,
609 but we also can't just die when we see it because of non-expression
610 uses. So just avert our eyes and cross our fingers. Silly Java. */
615 gcc_assert (code != BIND_EXPR);
616 copy_tree_r (tp, walk_subtrees, data);
622 /* Callback for walk_tree to unshare most of the shared trees rooted at
623 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
624 then *TP is deep copied by calling copy_tree_r.
626 This unshares the same trees as copy_tree_r with the exception of
627 SAVE_EXPR nodes. These nodes model computations that should only be
628 done once. If we were to unshare something like SAVE_EXPR(i++), the
629 gimplification process would create wrong code. */
632 copy_if_shared_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
633 void *data ATTRIBUTE_UNUSED)
636 enum tree_code code = TREE_CODE (t);
638 /* Skip types, decls, and constants. But we do want to look at their
639 types and the bounds of types. Mark them as visited so we properly
640 unmark their subtrees on the unmark pass. If we've already seen them,
641 don't look down further. */
642 if (TREE_CODE_CLASS (code) == tcc_type
643 || TREE_CODE_CLASS (code) == tcc_declaration
644 || TREE_CODE_CLASS (code) == tcc_constant)
646 if (TREE_VISITED (t))
649 TREE_VISITED (t) = 1;
652 /* If this node has been visited already, unshare it and don't look
654 else if (TREE_VISITED (t))
656 walk_tree (tp, mostly_copy_tree_r, NULL, NULL);
660 /* Otherwise, mark the tree as visited and keep looking. */
662 TREE_VISITED (t) = 1;
668 unmark_visited_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
669 void *data ATTRIBUTE_UNUSED)
671 if (TREE_VISITED (*tp))
672 TREE_VISITED (*tp) = 0;
679 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
680 bodies of any nested functions if we are unsharing the entire body of
684 unshare_body (tree *body_p, tree fndecl)
686 struct cgraph_node *cgn = cgraph_node (fndecl);
688 walk_tree (body_p, copy_if_shared_r, NULL, NULL);
689 if (body_p == &DECL_SAVED_TREE (fndecl))
690 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
691 unshare_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
694 /* Likewise, but mark all trees as not visited. */
697 unvisit_body (tree *body_p, tree fndecl)
699 struct cgraph_node *cgn = cgraph_node (fndecl);
701 walk_tree (body_p, unmark_visited_r, NULL, NULL);
702 if (body_p == &DECL_SAVED_TREE (fndecl))
703 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
704 unvisit_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
707 /* Unshare T and all the trees reached from T via TREE_CHAIN. */
710 unshare_all_trees (tree t)
712 walk_tree (&t, copy_if_shared_r, NULL, NULL);
713 walk_tree (&t, unmark_visited_r, NULL, NULL);
716 /* Unconditionally make an unshared copy of EXPR. This is used when using
717 stored expressions which span multiple functions, such as BINFO_VTABLE,
718 as the normal unsharing process can't tell that they're shared. */
721 unshare_expr (tree expr)
723 walk_tree (&expr, mostly_copy_tree_r, NULL, NULL);
727 /* A terser interface for building a representation of an exception
731 gimple_build_eh_filter (tree body, tree allowed, tree failure)
735 /* FIXME should the allowed types go in TREE_TYPE? */
736 t = build (EH_FILTER_EXPR, void_type_node, allowed, NULL_TREE);
737 append_to_statement_list (failure, &EH_FILTER_FAILURE (t));
739 t = build (TRY_CATCH_EXPR, void_type_node, NULL_TREE, t);
740 append_to_statement_list (body, &TREE_OPERAND (t, 0));
746 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
747 contain statements and have a value. Assign its value to a temporary
748 and give it void_type_node. Returns the temporary, or NULL_TREE if
749 WRAPPER was already void. */
752 voidify_wrapper_expr (tree wrapper, tree temp)
754 if (!VOID_TYPE_P (TREE_TYPE (wrapper)))
756 tree *p, sub = wrapper;
759 /* Set p to point to the body of the wrapper. */
760 switch (TREE_CODE (sub))
763 /* For a BIND_EXPR, the body is operand 1. */
764 p = &BIND_EXPR_BODY (sub);
768 p = &TREE_OPERAND (sub, 0);
772 /* Advance to the last statement. Set all container types to void. */
773 if (TREE_CODE (*p) == STATEMENT_LIST)
775 tree_stmt_iterator i = tsi_last (*p);
776 p = tsi_end_p (i) ? NULL : tsi_stmt_ptr (i);
780 for (; TREE_CODE (*p) == COMPOUND_EXPR; p = &TREE_OPERAND (*p, 1))
782 TREE_SIDE_EFFECTS (*p) = 1;
783 TREE_TYPE (*p) = void_type_node;
787 if (p == NULL || IS_EMPTY_STMT (*p))
789 /* Look through exception handling. */
790 else if (TREE_CODE (*p) == TRY_FINALLY_EXPR
791 || TREE_CODE (*p) == TRY_CATCH_EXPR)
796 /* The C++ frontend already did this for us. */
797 else if (TREE_CODE (*p) == INIT_EXPR
798 || TREE_CODE (*p) == TARGET_EXPR)
799 temp = TREE_OPERAND (*p, 0);
800 /* If we're returning a dereference, move the dereference
801 outside the wrapper. */
802 else if (TREE_CODE (*p) == INDIRECT_REF)
804 tree ptr = TREE_OPERAND (*p, 0);
805 temp = create_tmp_var (TREE_TYPE (ptr), "retval");
806 *p = build (MODIFY_EXPR, TREE_TYPE (ptr), temp, ptr);
807 temp = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (temp)), temp);
808 /* If this is a BIND_EXPR for a const inline function, it might not
809 have TREE_SIDE_EFFECTS set. That is no longer accurate. */
810 TREE_SIDE_EFFECTS (wrapper) = 1;
815 temp = create_tmp_var (TREE_TYPE (wrapper), "retval");
816 *p = build (MODIFY_EXPR, TREE_TYPE (temp), temp, *p);
817 TREE_SIDE_EFFECTS (wrapper) = 1;
820 TREE_TYPE (wrapper) = void_type_node;
827 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
828 a temporary through which they communicate. */
831 build_stack_save_restore (tree *save, tree *restore)
833 tree save_call, tmp_var;
836 build_function_call_expr (implicit_built_in_decls[BUILT_IN_STACK_SAVE],
838 tmp_var = create_tmp_var (ptr_type_node, "saved_stack");
840 *save = build (MODIFY_EXPR, ptr_type_node, tmp_var, save_call);
842 build_function_call_expr (implicit_built_in_decls[BUILT_IN_STACK_RESTORE],
843 tree_cons (NULL_TREE, tmp_var, NULL_TREE));
846 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
848 static enum gimplify_status
849 gimplify_bind_expr (tree *expr_p, tree temp, tree *pre_p)
851 tree bind_expr = *expr_p;
852 bool old_save_stack = gimplify_ctxp->save_stack;
855 temp = voidify_wrapper_expr (bind_expr, temp);
857 /* Mark variables seen in this bind expr. */
858 for (t = BIND_EXPR_VARS (bind_expr); t ; t = TREE_CHAIN (t))
859 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
861 gimple_push_bind_expr (bind_expr);
862 gimplify_ctxp->save_stack = false;
864 gimplify_to_stmt_list (&BIND_EXPR_BODY (bind_expr));
866 if (gimplify_ctxp->save_stack)
868 tree stack_save, stack_restore;
870 /* Save stack on entry and restore it on exit. Add a try_finally
871 block to achieve this. Note that mudflap depends on the
872 format of the emitted code: see mx_register_decls(). */
873 build_stack_save_restore (&stack_save, &stack_restore);
875 t = build (TRY_FINALLY_EXPR, void_type_node,
876 BIND_EXPR_BODY (bind_expr), NULL_TREE);
877 append_to_statement_list (stack_restore, &TREE_OPERAND (t, 1));
879 BIND_EXPR_BODY (bind_expr) = NULL_TREE;
880 append_to_statement_list (stack_save, &BIND_EXPR_BODY (bind_expr));
881 append_to_statement_list (t, &BIND_EXPR_BODY (bind_expr));
884 gimplify_ctxp->save_stack = old_save_stack;
885 gimple_pop_bind_expr ();
890 append_to_statement_list (bind_expr, pre_p);
897 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
898 GIMPLE value, it is assigned to a new temporary and the statement is
899 re-written to return the temporary.
901 PRE_P points to the list where side effects that must happen before
902 STMT should be stored. */
904 static enum gimplify_status
905 gimplify_return_expr (tree stmt, tree *pre_p)
907 tree ret_expr = TREE_OPERAND (stmt, 0);
908 tree result_decl, result;
910 if (!ret_expr || TREE_CODE (ret_expr) == RESULT_DECL
911 || ret_expr == error_mark_node)
914 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
915 result_decl = NULL_TREE;
918 result_decl = TREE_OPERAND (ret_expr, 0);
919 if (TREE_CODE (result_decl) == INDIRECT_REF)
920 /* See through a return by reference. */
921 result_decl = TREE_OPERAND (result_decl, 0);
923 gcc_assert ((TREE_CODE (ret_expr) == MODIFY_EXPR
924 || TREE_CODE (ret_expr) == INIT_EXPR)
925 && TREE_CODE (result_decl) == RESULT_DECL);
928 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
929 Recall that aggregate_value_p is FALSE for any aggregate type that is
930 returned in registers. If we're returning values in registers, then
931 we don't want to extend the lifetime of the RESULT_DECL, particularly
932 across another call. In addition, for those aggregates for which
933 hard_function_value generates a PARALLEL, we'll die during normal
934 expansion of structure assignments; there's special code in expand_return
935 to handle this case that does not exist in expand_expr. */
937 || aggregate_value_p (result_decl, TREE_TYPE (current_function_decl)))
938 result = result_decl;
939 else if (gimplify_ctxp->return_temp)
940 result = gimplify_ctxp->return_temp;
943 result = create_tmp_var (TREE_TYPE (result_decl), NULL);
945 /* ??? With complex control flow (usually involving abnormal edges),
946 we can wind up warning about an uninitialized value for this. Due
947 to how this variable is constructed and initialized, this is never
948 true. Give up and never warn. */
949 TREE_NO_WARNING (result) = 1;
951 gimplify_ctxp->return_temp = result;
954 /* Smash the lhs of the MODIFY_EXPR to the temporary we plan to use.
955 Then gimplify the whole thing. */
956 if (result != result_decl)
957 TREE_OPERAND (ret_expr, 0) = result;
959 gimplify_and_add (TREE_OPERAND (stmt, 0), pre_p);
961 /* If we didn't use a temporary, then the result is just the result_decl.
962 Otherwise we need a simple copy. This should already be gimple. */
963 if (result == result_decl)
966 ret_expr = build (MODIFY_EXPR, TREE_TYPE (result), result_decl, result);
967 TREE_OPERAND (stmt, 0) = ret_expr;
972 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
973 and initialization explicit. */
975 static enum gimplify_status
976 gimplify_decl_expr (tree *stmt_p)
979 tree decl = DECL_EXPR_DECL (stmt);
983 if (TREE_TYPE (decl) == error_mark_node)
986 if ((TREE_CODE (decl) == TYPE_DECL
987 || TREE_CODE (decl) == VAR_DECL)
988 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl)))
989 gimplify_type_sizes (TREE_TYPE (decl), stmt_p);
991 if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl))
993 tree init = DECL_INITIAL (decl);
995 if (!TREE_CONSTANT (DECL_SIZE (decl)))
997 /* This is a variable-sized decl. Simplify its size and mark it
998 for deferred expansion. Note that mudflap depends on the format
999 of the emitted code: see mx_register_decls(). */
1000 tree t, args, addr, ptr_type;
1002 gimplify_one_sizepos (&DECL_SIZE (decl), stmt_p);
1003 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl), stmt_p);
1005 /* All occurrences of this decl in final gimplified code will be
1006 replaced by indirection. Setting DECL_VALUE_EXPR does two
1007 things: First, it lets the rest of the gimplifier know what
1008 replacement to use. Second, it lets the debug info know
1009 where to find the value. */
1010 ptr_type = build_pointer_type (TREE_TYPE (decl));
1011 addr = create_tmp_var (ptr_type, get_name (decl));
1012 DECL_IGNORED_P (addr) = 0;
1013 t = build_fold_indirect_ref (addr);
1014 DECL_VALUE_EXPR (decl) = t;
1016 args = tree_cons (NULL, DECL_SIZE_UNIT (decl), NULL);
1017 t = built_in_decls[BUILT_IN_ALLOCA];
1018 t = build_function_call_expr (t, args);
1019 t = fold_convert (ptr_type, t);
1020 t = build2 (MODIFY_EXPR, void_type_node, addr, t);
1022 gimplify_and_add (t, stmt_p);
1024 /* Indicate that we need to restore the stack level when the
1025 enclosing BIND_EXPR is exited. */
1026 gimplify_ctxp->save_stack = true;
1029 if (init && init != error_mark_node)
1031 if (!TREE_STATIC (decl))
1033 DECL_INITIAL (decl) = NULL_TREE;
1034 init = build (MODIFY_EXPR, void_type_node, decl, init);
1035 gimplify_and_add (init, stmt_p);
1038 /* We must still examine initializers for static variables
1039 as they may contain a label address. */
1040 walk_tree (&init, force_labels_r, NULL, NULL);
1043 /* This decl isn't mentioned in the enclosing block, so add it to the
1044 list of temps. FIXME it seems a bit of a kludge to say that
1045 anonymous artificial vars aren't pushed, but everything else is. */
1046 if (DECL_ARTIFICIAL (decl) && DECL_NAME (decl) == NULL_TREE)
1047 gimple_add_tmp_var (decl);
1053 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1054 and replacing the LOOP_EXPR with goto, but if the loop contains an
1055 EXIT_EXPR, we need to append a label for it to jump to. */
1057 static enum gimplify_status
1058 gimplify_loop_expr (tree *expr_p, tree *pre_p)
1060 tree saved_label = gimplify_ctxp->exit_label;
1061 tree start_label = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
1062 tree jump_stmt = build_and_jump (&LABEL_EXPR_LABEL (start_label));
1064 append_to_statement_list (start_label, pre_p);
1066 gimplify_ctxp->exit_label = NULL_TREE;
1068 gimplify_and_add (LOOP_EXPR_BODY (*expr_p), pre_p);
1070 if (gimplify_ctxp->exit_label)
1072 append_to_statement_list (jump_stmt, pre_p);
1073 *expr_p = build1 (LABEL_EXPR, void_type_node, gimplify_ctxp->exit_label);
1076 *expr_p = jump_stmt;
1078 gimplify_ctxp->exit_label = saved_label;
1083 /* Compare two case labels. Because the front end should already have
1084 made sure that case ranges do not overlap, it is enough to only compare
1085 the CASE_LOW values of each case label. */
1088 compare_case_labels (const void *p1, const void *p2)
1090 tree case1 = *(tree *)p1;
1091 tree case2 = *(tree *)p2;
1093 return tree_int_cst_compare (CASE_LOW (case1), CASE_LOW (case2));
1096 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1099 sort_case_labels (tree label_vec)
1101 size_t len = TREE_VEC_LENGTH (label_vec);
1102 tree default_case = TREE_VEC_ELT (label_vec, len - 1);
1104 if (CASE_LOW (default_case))
1108 /* The last label in the vector should be the default case
1110 for (i = 0; i < len; ++i)
1112 tree t = TREE_VEC_ELT (label_vec, i);
1116 TREE_VEC_ELT (label_vec, i) = TREE_VEC_ELT (label_vec, len - 1);
1117 TREE_VEC_ELT (label_vec, len - 1) = default_case;
1123 qsort (&TREE_VEC_ELT (label_vec, 0), len - 1, sizeof (tree),
1124 compare_case_labels);
1127 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1130 static enum gimplify_status
1131 gimplify_switch_expr (tree *expr_p, tree *pre_p)
1133 tree switch_expr = *expr_p;
1134 enum gimplify_status ret;
1136 ret = gimplify_expr (&SWITCH_COND (switch_expr), pre_p, NULL,
1137 is_gimple_val, fb_rvalue);
1139 if (SWITCH_BODY (switch_expr))
1141 varray_type labels, saved_labels;
1142 tree label_vec, default_case = NULL_TREE;
1145 /* If someone can be bothered to fill in the labels, they can
1146 be bothered to null out the body too. */
1147 gcc_assert (!SWITCH_LABELS (switch_expr));
1149 saved_labels = gimplify_ctxp->case_labels;
1150 VARRAY_TREE_INIT (gimplify_ctxp->case_labels, 8, "case_labels");
1152 gimplify_to_stmt_list (&SWITCH_BODY (switch_expr));
1154 labels = gimplify_ctxp->case_labels;
1155 gimplify_ctxp->case_labels = saved_labels;
1157 len = VARRAY_ACTIVE_SIZE (labels);
1159 for (i = 0; i < len; ++i)
1161 tree t = VARRAY_TREE (labels, i);
1164 /* The default case must be the last label in the list. */
1166 VARRAY_TREE (labels, i) = VARRAY_TREE (labels, len - 1);
1172 label_vec = make_tree_vec (len + 1);
1173 SWITCH_LABELS (*expr_p) = label_vec;
1174 append_to_statement_list (switch_expr, pre_p);
1178 /* If the switch has no default label, add one, so that we jump
1179 around the switch body. */
1180 default_case = build (CASE_LABEL_EXPR, void_type_node, NULL_TREE,
1181 NULL_TREE, create_artificial_label ());
1182 append_to_statement_list (SWITCH_BODY (switch_expr), pre_p);
1183 *expr_p = build (LABEL_EXPR, void_type_node,
1184 CASE_LABEL (default_case));
1187 *expr_p = SWITCH_BODY (switch_expr);
1189 for (i = 0; i < len; ++i)
1190 TREE_VEC_ELT (label_vec, i) = VARRAY_TREE (labels, i);
1191 TREE_VEC_ELT (label_vec, len) = default_case;
1193 sort_case_labels (label_vec);
1195 SWITCH_BODY (switch_expr) = NULL;
1198 gcc_assert (SWITCH_LABELS (switch_expr));
1203 static enum gimplify_status
1204 gimplify_case_label_expr (tree *expr_p)
1206 tree expr = *expr_p;
1208 gcc_assert (gimplify_ctxp->case_labels);
1209 VARRAY_PUSH_TREE (gimplify_ctxp->case_labels, expr);
1210 *expr_p = build (LABEL_EXPR, void_type_node, CASE_LABEL (expr));
1214 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1218 build_and_jump (tree *label_p)
1220 if (label_p == NULL)
1221 /* If there's nowhere to jump, just fall through. */
1224 if (*label_p == NULL_TREE)
1226 tree label = create_artificial_label ();
1230 return build1 (GOTO_EXPR, void_type_node, *label_p);
1233 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1234 This also involves building a label to jump to and communicating it to
1235 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1237 static enum gimplify_status
1238 gimplify_exit_expr (tree *expr_p)
1240 tree cond = TREE_OPERAND (*expr_p, 0);
1243 expr = build_and_jump (&gimplify_ctxp->exit_label);
1244 expr = build (COND_EXPR, void_type_node, cond, expr, NULL_TREE);
1250 /* A helper function to be called via walk_tree. Mark all labels under *TP
1251 as being forced. To be called for DECL_INITIAL of static variables. */
1254 force_labels_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
1258 if (TREE_CODE (*tp) == LABEL_DECL)
1259 FORCED_LABEL (*tp) = 1;
1264 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1265 different from its canonical type, wrap the whole thing inside a
1266 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1269 The canonical type of a COMPONENT_REF is the type of the field being
1270 referenced--unless the field is a bit-field which can be read directly
1271 in a smaller mode, in which case the canonical type is the
1272 sign-appropriate type corresponding to that mode. */
1275 canonicalize_component_ref (tree *expr_p)
1277 tree expr = *expr_p;
1280 gcc_assert (TREE_CODE (expr) == COMPONENT_REF);
1282 if (INTEGRAL_TYPE_P (TREE_TYPE (expr)))
1283 type = TREE_TYPE (get_unwidened (expr, NULL_TREE));
1285 type = TREE_TYPE (TREE_OPERAND (expr, 1));
1287 if (TREE_TYPE (expr) != type)
1289 tree old_type = TREE_TYPE (expr);
1291 /* Set the type of the COMPONENT_REF to the underlying type. */
1292 TREE_TYPE (expr) = type;
1294 /* And wrap the whole thing inside a NOP_EXPR. */
1295 expr = build1 (NOP_EXPR, old_type, expr);
1301 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1302 to foo, embed that change in the ADDR_EXPR by converting
1307 where L is the lower bound. For simplicity, only do this for constant
1311 canonicalize_addr_expr (tree *expr_p)
1313 tree expr = *expr_p;
1314 tree ctype = TREE_TYPE (expr);
1315 tree addr_expr = TREE_OPERAND (expr, 0);
1316 tree atype = TREE_TYPE (addr_expr);
1317 tree dctype, datype, ddatype, otype, obj_expr;
1319 /* Both cast and addr_expr types should be pointers. */
1320 if (!POINTER_TYPE_P (ctype) || !POINTER_TYPE_P (atype))
1323 /* The addr_expr type should be a pointer to an array. */
1324 datype = TREE_TYPE (atype);
1325 if (TREE_CODE (datype) != ARRAY_TYPE)
1328 /* Both cast and addr_expr types should address the same object type. */
1329 dctype = TREE_TYPE (ctype);
1330 ddatype = TREE_TYPE (datype);
1331 if (!lang_hooks.types_compatible_p (ddatype, dctype))
1334 /* The addr_expr and the object type should match. */
1335 obj_expr = TREE_OPERAND (addr_expr, 0);
1336 otype = TREE_TYPE (obj_expr);
1337 if (!lang_hooks.types_compatible_p (otype, datype))
1340 /* The lower bound and element sizes must be constant. */
1341 if (!TYPE_SIZE_UNIT (dctype)
1342 || TREE_CODE (TYPE_SIZE_UNIT (dctype)) != INTEGER_CST
1343 || !TYPE_DOMAIN (datype) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype))
1344 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype))) != INTEGER_CST)
1347 /* All checks succeeded. Build a new node to merge the cast. */
1348 *expr_p = build4 (ARRAY_REF, dctype, obj_expr,
1349 TYPE_MIN_VALUE (TYPE_DOMAIN (datype)),
1350 TYPE_MIN_VALUE (TYPE_DOMAIN (datype)),
1351 size_binop (EXACT_DIV_EXPR, TYPE_SIZE_UNIT (dctype),
1352 size_int (TYPE_ALIGN_UNIT (dctype))));
1353 *expr_p = build1 (ADDR_EXPR, ctype, *expr_p);
1356 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1357 underneath as appropriate. */
1359 static enum gimplify_status
1360 gimplify_conversion (tree *expr_p)
1362 gcc_assert (TREE_CODE (*expr_p) == NOP_EXPR
1363 || TREE_CODE (*expr_p) == CONVERT_EXPR);
1365 /* Then strip away all but the outermost conversion. */
1366 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p, 0));
1368 /* And remove the outermost conversion if it's useless. */
1369 if (tree_ssa_useless_type_conversion (*expr_p))
1370 *expr_p = TREE_OPERAND (*expr_p, 0);
1372 /* If we still have a conversion at the toplevel,
1373 then canonicalize some constructs. */
1374 if (TREE_CODE (*expr_p) == NOP_EXPR || TREE_CODE (*expr_p) == CONVERT_EXPR)
1376 tree sub = TREE_OPERAND (*expr_p, 0);
1378 /* If a NOP conversion is changing the type of a COMPONENT_REF
1379 expression, then canonicalize its type now in order to expose more
1380 redundant conversions. */
1381 if (TREE_CODE (sub) == COMPONENT_REF)
1382 canonicalize_component_ref (&TREE_OPERAND (*expr_p, 0));
1384 /* If a NOP conversion is changing a pointer to array of foo
1385 to a pointer to foo, embed that change in the ADDR_EXPR. */
1386 else if (TREE_CODE (sub) == ADDR_EXPR)
1387 canonicalize_addr_expr (expr_p);
1393 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1394 node pointed by EXPR_P.
1397 : min_lval '[' val ']'
1399 | compound_lval '[' val ']'
1400 | compound_lval '.' ID
1402 This is not part of the original SIMPLE definition, which separates
1403 array and member references, but it seems reasonable to handle them
1404 together. Also, this way we don't run into problems with union
1405 aliasing; gcc requires that for accesses through a union to alias, the
1406 union reference must be explicit, which was not always the case when we
1407 were splitting up array and member refs.
1409 PRE_P points to the list where side effects that must happen before
1410 *EXPR_P should be stored.
1412 POST_P points to the list where side effects that must happen after
1413 *EXPR_P should be stored. */
1415 static enum gimplify_status
1416 gimplify_compound_lval (tree *expr_p, tree *pre_p,
1417 tree *post_p, fallback_t fallback)
1420 VEC(tree,heap) *stack;
1421 enum gimplify_status ret = GS_OK, tret;
1424 /* Create a stack of the subexpressions so later we can walk them in
1425 order from inner to outer. */
1426 stack = VEC_alloc (tree, heap, 10);
1428 /* We can handle anything that get_inner_reference can deal with. */
1429 for (p = expr_p; ; p = &TREE_OPERAND (*p, 0))
1431 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1432 if (TREE_CODE (*p) == INDIRECT_REF)
1433 *p = fold_indirect_ref (*p);
1434 if (!handled_component_p (*p))
1436 VEC_safe_push (tree, heap, stack, *p);
1439 gcc_assert (VEC_length (tree, stack));
1441 /* Now STACK is a stack of pointers to all the refs we've walked through
1442 and P points to the innermost expression.
1444 Java requires that we elaborated nodes in source order. That
1445 means we must gimplify the inner expression followed by each of
1446 the indices, in order. But we can't gimplify the inner
1447 expression until we deal with any variable bounds, sizes, or
1448 positions in order to deal with PLACEHOLDER_EXPRs.
1450 So we do this in three steps. First we deal with the annotations
1451 for any variables in the components, then we gimplify the base,
1452 then we gimplify any indices, from left to right. */
1453 for (i = VEC_length (tree, stack) - 1; i >= 0; i--)
1455 tree t = VEC_index (tree, stack, i);
1457 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
1459 /* Gimplify the low bound and element type size and put them into
1460 the ARRAY_REF. If these values are set, they have already been
1462 if (!TREE_OPERAND (t, 2))
1464 tree low = unshare_expr (array_ref_low_bound (t));
1465 if (!is_gimple_min_invariant (low))
1467 TREE_OPERAND (t, 2) = low;
1468 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1469 is_gimple_formal_tmp_reg, fb_rvalue);
1470 ret = MIN (ret, tret);
1474 if (!TREE_OPERAND (t, 3))
1476 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (t, 0)));
1477 tree elmt_size = unshare_expr (array_ref_element_size (t));
1478 tree factor = size_int (TYPE_ALIGN_UNIT (elmt_type));
1480 /* Divide the element size by the alignment of the element
1482 elmt_size = size_binop (EXACT_DIV_EXPR, elmt_size, factor);
1484 if (!is_gimple_min_invariant (elmt_size))
1486 TREE_OPERAND (t, 3) = elmt_size;
1487 tret = gimplify_expr (&TREE_OPERAND (t, 3), pre_p, post_p,
1488 is_gimple_formal_tmp_reg, fb_rvalue);
1489 ret = MIN (ret, tret);
1493 else if (TREE_CODE (t) == COMPONENT_REF)
1495 /* Set the field offset into T and gimplify it. */
1496 if (!TREE_OPERAND (t, 2))
1498 tree offset = unshare_expr (component_ref_field_offset (t));
1499 tree field = TREE_OPERAND (t, 1);
1501 = size_int (DECL_OFFSET_ALIGN (field) / BITS_PER_UNIT);
1503 /* Divide the offset by its alignment. */
1504 offset = size_binop (EXACT_DIV_EXPR, offset, factor);
1506 if (!is_gimple_min_invariant (offset))
1508 TREE_OPERAND (t, 2) = offset;
1509 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1510 is_gimple_formal_tmp_reg, fb_rvalue);
1511 ret = MIN (ret, tret);
1517 /* Step 2 is to gimplify the base expression. */
1518 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval, fallback);
1519 ret = MIN (ret, tret);
1521 /* And finally, the indices and operands to BIT_FIELD_REF. During this
1522 loop we also remove any useless conversions. */
1523 for (; VEC_length (tree, stack) > 0; )
1525 tree t = VEC_pop (tree, stack);
1527 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
1529 /* Gimplify the dimension.
1530 Temporary fix for gcc.c-torture/execute/20040313-1.c.
1531 Gimplify non-constant array indices into a temporary
1533 FIXME - The real fix is to gimplify post-modify
1534 expressions into a minimal gimple lvalue. However, that
1535 exposes bugs in alias analysis. The alias analyzer does
1536 not handle &PTR->FIELD very well. Will fix after the
1537 branch is merged into mainline (dnovillo 2004-05-03). */
1538 if (!is_gimple_min_invariant (TREE_OPERAND (t, 1)))
1540 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
1541 is_gimple_formal_tmp_reg, fb_rvalue);
1542 ret = MIN (ret, tret);
1545 else if (TREE_CODE (t) == BIT_FIELD_REF)
1547 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
1548 is_gimple_val, fb_rvalue);
1549 ret = MIN (ret, tret);
1550 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1551 is_gimple_val, fb_rvalue);
1552 ret = MIN (ret, tret);
1555 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t, 0));
1557 /* The innermost expression P may have originally had TREE_SIDE_EFFECTS
1558 set which would have caused all the outer expressions in EXPR_P
1559 leading to P to also have had TREE_SIDE_EFFECTS set. */
1560 recalculate_side_effects (t);
1563 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval, fallback);
1564 ret = MIN (ret, tret);
1566 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
1567 if ((fallback & fb_rvalue) && TREE_CODE (*expr_p) == COMPONENT_REF)
1569 canonicalize_component_ref (expr_p);
1570 ret = MIN (ret, GS_OK);
1573 VEC_free (tree, heap, stack);
1578 /* Gimplify the self modifying expression pointed by EXPR_P (++, --, +=, -=).
1580 PRE_P points to the list where side effects that must happen before
1581 *EXPR_P should be stored.
1583 POST_P points to the list where side effects that must happen after
1584 *EXPR_P should be stored.
1586 WANT_VALUE is nonzero iff we want to use the value of this expression
1587 in another expression. */
1589 static enum gimplify_status
1590 gimplify_self_mod_expr (tree *expr_p, tree *pre_p, tree *post_p,
1593 enum tree_code code;
1594 tree lhs, lvalue, rhs, t1;
1596 enum tree_code arith_code;
1597 enum gimplify_status ret;
1599 code = TREE_CODE (*expr_p);
1601 gcc_assert (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR
1602 || code == PREINCREMENT_EXPR || code == PREDECREMENT_EXPR);
1604 /* Prefix or postfix? */
1605 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
1606 /* Faster to treat as prefix if result is not used. */
1607 postfix = want_value;
1611 /* Add or subtract? */
1612 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
1613 arith_code = PLUS_EXPR;
1615 arith_code = MINUS_EXPR;
1617 /* Gimplify the LHS into a GIMPLE lvalue. */
1618 lvalue = TREE_OPERAND (*expr_p, 0);
1619 ret = gimplify_expr (&lvalue, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
1620 if (ret == GS_ERROR)
1623 /* Extract the operands to the arithmetic operation. */
1625 rhs = TREE_OPERAND (*expr_p, 1);
1627 /* For postfix operator, we evaluate the LHS to an rvalue and then use
1628 that as the result value and in the postqueue operation. */
1631 ret = gimplify_expr (&lhs, pre_p, post_p, is_gimple_val, fb_rvalue);
1632 if (ret == GS_ERROR)
1636 t1 = build (arith_code, TREE_TYPE (*expr_p), lhs, rhs);
1637 t1 = build (MODIFY_EXPR, TREE_TYPE (lvalue), lvalue, t1);
1641 gimplify_and_add (t1, post_p);
1652 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
1655 maybe_with_size_expr (tree *expr_p)
1657 tree expr = *expr_p;
1658 tree type = TREE_TYPE (expr);
1661 /* If we've already wrapped this or the type is error_mark_node, we can't do
1663 if (TREE_CODE (expr) == WITH_SIZE_EXPR
1664 || type == error_mark_node)
1667 /* If the size isn't known or is a constant, we have nothing to do. */
1668 size = TYPE_SIZE_UNIT (type);
1669 if (!size || TREE_CODE (size) == INTEGER_CST)
1672 /* Otherwise, make a WITH_SIZE_EXPR. */
1673 size = unshare_expr (size);
1674 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, expr);
1675 *expr_p = build2 (WITH_SIZE_EXPR, type, expr, size);
1678 /* Subroutine of gimplify_call_expr: Gimplify a single argument. */
1680 static enum gimplify_status
1681 gimplify_arg (tree *expr_p, tree *pre_p)
1683 bool (*test) (tree);
1686 /* In general, we allow lvalues for function arguments to avoid
1687 extra overhead of copying large aggregates out of even larger
1688 aggregates into temporaries only to copy the temporaries to
1689 the argument list. Make optimizers happy by pulling out to
1690 temporaries those types that fit in registers. */
1691 if (is_gimple_reg_type (TREE_TYPE (*expr_p)))
1692 test = is_gimple_val, fb = fb_rvalue;
1694 test = is_gimple_lvalue, fb = fb_either;
1696 /* If this is a variable sized type, we must remember the size. */
1697 maybe_with_size_expr (expr_p);
1699 /* There is a sequence point before a function call. Side effects in
1700 the argument list must occur before the actual call. So, when
1701 gimplifying arguments, force gimplify_expr to use an internal
1702 post queue which is then appended to the end of PRE_P. */
1703 return gimplify_expr (expr_p, pre_p, NULL, test, fb);
1706 /* Gimplify the CALL_EXPR node pointed by EXPR_P. PRE_P points to the
1707 list where side effects that must happen before *EXPR_P should be stored.
1708 WANT_VALUE is true if the result of the call is desired. */
1710 static enum gimplify_status
1711 gimplify_call_expr (tree *expr_p, tree *pre_p, bool want_value)
1715 enum gimplify_status ret;
1717 gcc_assert (TREE_CODE (*expr_p) == CALL_EXPR);
1719 /* For reliable diagnostics during inlining, it is necessary that
1720 every call_expr be annotated with file and line. */
1721 if (! EXPR_HAS_LOCATION (*expr_p))
1722 SET_EXPR_LOCATION (*expr_p, input_location);
1724 /* This may be a call to a builtin function.
1726 Builtin function calls may be transformed into different
1727 (and more efficient) builtin function calls under certain
1728 circumstances. Unfortunately, gimplification can muck things
1729 up enough that the builtin expanders are not aware that certain
1730 transformations are still valid.
1732 So we attempt transformation/gimplification of the call before
1733 we gimplify the CALL_EXPR. At this time we do not manage to
1734 transform all calls in the same manner as the expanders do, but
1735 we do transform most of them. */
1736 decl = get_callee_fndecl (*expr_p);
1737 if (decl && DECL_BUILT_IN (decl))
1739 tree fndecl = get_callee_fndecl (*expr_p);
1740 tree arglist = TREE_OPERAND (*expr_p, 1);
1741 tree new = fold_builtin (fndecl, arglist, !want_value);
1743 if (new && new != *expr_p)
1745 /* There was a transformation of this call which computes the
1746 same value, but in a more efficient way. Return and try
1752 if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
1753 && DECL_FUNCTION_CODE (decl) == BUILT_IN_VA_START)
1755 if (!arglist || !TREE_CHAIN (arglist))
1757 error ("too few arguments to function %<va_start%>");
1758 *expr_p = build_empty_stmt ();
1762 if (fold_builtin_next_arg (TREE_CHAIN (arglist)))
1764 *expr_p = build_empty_stmt ();
1767 /* Avoid gimplifying the second argument to va_start, which needs
1768 to be the plain PARM_DECL. */
1769 return gimplify_arg (&TREE_VALUE (TREE_OPERAND (*expr_p, 1)), pre_p);
1773 /* There is a sequence point before the call, so any side effects in
1774 the calling expression must occur before the actual call. Force
1775 gimplify_expr to use an internal post queue. */
1776 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, NULL,
1777 is_gimple_call_addr, fb_rvalue);
1779 if (PUSH_ARGS_REVERSED)
1780 TREE_OPERAND (*expr_p, 1) = nreverse (TREE_OPERAND (*expr_p, 1));
1781 for (arglist = TREE_OPERAND (*expr_p, 1); arglist;
1782 arglist = TREE_CHAIN (arglist))
1784 enum gimplify_status t;
1786 t = gimplify_arg (&TREE_VALUE (arglist), pre_p);
1791 if (PUSH_ARGS_REVERSED)
1792 TREE_OPERAND (*expr_p, 1) = nreverse (TREE_OPERAND (*expr_p, 1));
1794 /* Try this again in case gimplification exposed something. */
1795 if (ret != GS_ERROR && decl && DECL_BUILT_IN (decl))
1797 tree fndecl = get_callee_fndecl (*expr_p);
1798 tree arglist = TREE_OPERAND (*expr_p, 1);
1799 tree new = fold_builtin (fndecl, arglist, !want_value);
1801 if (new && new != *expr_p)
1803 /* There was a transformation of this call which computes the
1804 same value, but in a more efficient way. Return and try
1811 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
1812 decl. This allows us to eliminate redundant or useless
1813 calls to "const" functions. */
1814 if (TREE_CODE (*expr_p) == CALL_EXPR
1815 && (call_expr_flags (*expr_p) & (ECF_CONST | ECF_PURE)))
1816 TREE_SIDE_EFFECTS (*expr_p) = 0;
1821 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
1822 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
1824 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
1825 condition is true or false, respectively. If null, we should generate
1826 our own to skip over the evaluation of this specific expression.
1828 This function is the tree equivalent of do_jump.
1830 shortcut_cond_r should only be called by shortcut_cond_expr. */
1833 shortcut_cond_r (tree pred, tree *true_label_p, tree *false_label_p)
1835 tree local_label = NULL_TREE;
1836 tree t, expr = NULL;
1838 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
1839 retain the shortcut semantics. Just insert the gotos here;
1840 shortcut_cond_expr will append the real blocks later. */
1841 if (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
1843 /* Turn if (a && b) into
1845 if (a); else goto no;
1846 if (b) goto yes; else goto no;
1849 if (false_label_p == NULL)
1850 false_label_p = &local_label;
1852 t = shortcut_cond_r (TREE_OPERAND (pred, 0), NULL, false_label_p);
1853 append_to_statement_list (t, &expr);
1855 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
1857 append_to_statement_list (t, &expr);
1859 else if (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
1861 /* Turn if (a || b) into
1864 if (b) goto yes; else goto no;
1867 if (true_label_p == NULL)
1868 true_label_p = &local_label;
1870 t = shortcut_cond_r (TREE_OPERAND (pred, 0), true_label_p, NULL);
1871 append_to_statement_list (t, &expr);
1873 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
1875 append_to_statement_list (t, &expr);
1877 else if (TREE_CODE (pred) == COND_EXPR)
1879 /* As long as we're messing with gotos, turn if (a ? b : c) into
1881 if (b) goto yes; else goto no;
1883 if (c) goto yes; else goto no; */
1884 expr = build (COND_EXPR, void_type_node, TREE_OPERAND (pred, 0),
1885 shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
1887 shortcut_cond_r (TREE_OPERAND (pred, 2), true_label_p,
1892 expr = build (COND_EXPR, void_type_node, pred,
1893 build_and_jump (true_label_p),
1894 build_and_jump (false_label_p));
1899 t = build1 (LABEL_EXPR, void_type_node, local_label);
1900 append_to_statement_list (t, &expr);
1907 shortcut_cond_expr (tree expr)
1909 tree pred = TREE_OPERAND (expr, 0);
1910 tree then_ = TREE_OPERAND (expr, 1);
1911 tree else_ = TREE_OPERAND (expr, 2);
1912 tree true_label, false_label, end_label, t;
1914 tree *false_label_p;
1915 bool emit_end, emit_false, jump_over_else;
1916 bool then_se = then_ && TREE_SIDE_EFFECTS (then_);
1917 bool else_se = else_ && TREE_SIDE_EFFECTS (else_);
1919 /* First do simple transformations. */
1922 /* If there is no 'else', turn (a && b) into if (a) if (b). */
1923 while (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
1925 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
1926 then_ = shortcut_cond_expr (expr);
1927 then_se = then_ && TREE_SIDE_EFFECTS (then_);
1928 pred = TREE_OPERAND (pred, 0);
1929 expr = build (COND_EXPR, void_type_node, pred, then_, NULL_TREE);
1934 /* If there is no 'then', turn
1937 if (a); else if (b); else d. */
1938 while (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
1940 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
1941 else_ = shortcut_cond_expr (expr);
1942 else_se = else_ && TREE_SIDE_EFFECTS (else_);
1943 pred = TREE_OPERAND (pred, 0);
1944 expr = build (COND_EXPR, void_type_node, pred, NULL_TREE, else_);
1948 /* If we're done, great. */
1949 if (TREE_CODE (pred) != TRUTH_ANDIF_EXPR
1950 && TREE_CODE (pred) != TRUTH_ORIF_EXPR)
1953 /* Otherwise we need to mess with gotos. Change
1956 if (a); else goto no;
1959 and recursively gimplify the condition. */
1961 true_label = false_label = end_label = NULL_TREE;
1963 /* If our arms just jump somewhere, hijack those labels so we don't
1964 generate jumps to jumps. */
1967 && TREE_CODE (then_) == GOTO_EXPR
1968 && TREE_CODE (GOTO_DESTINATION (then_)) == LABEL_DECL)
1970 true_label = GOTO_DESTINATION (then_);
1976 && TREE_CODE (else_) == GOTO_EXPR
1977 && TREE_CODE (GOTO_DESTINATION (else_)) == LABEL_DECL)
1979 false_label = GOTO_DESTINATION (else_);
1984 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
1986 true_label_p = &true_label;
1988 true_label_p = NULL;
1990 /* The 'else' branch also needs a label if it contains interesting code. */
1991 if (false_label || else_se)
1992 false_label_p = &false_label;
1994 false_label_p = NULL;
1996 /* If there was nothing else in our arms, just forward the label(s). */
1997 if (!then_se && !else_se)
1998 return shortcut_cond_r (pred, true_label_p, false_label_p);
2000 /* If our last subexpression already has a terminal label, reuse it. */
2002 expr = expr_last (else_);
2004 expr = expr_last (then_);
2007 if (expr && TREE_CODE (expr) == LABEL_EXPR)
2008 end_label = LABEL_EXPR_LABEL (expr);
2010 /* If we don't care about jumping to the 'else' branch, jump to the end
2011 if the condition is false. */
2013 false_label_p = &end_label;
2015 /* We only want to emit these labels if we aren't hijacking them. */
2016 emit_end = (end_label == NULL_TREE);
2017 emit_false = (false_label == NULL_TREE);
2019 /* We only emit the jump over the else clause if we have to--if the
2020 then clause may fall through. Otherwise we can wind up with a
2021 useless jump and a useless label at the end of gimplified code,
2022 which will cause us to think that this conditional as a whole
2023 falls through even if it doesn't. If we then inline a function
2024 which ends with such a condition, that can cause us to issue an
2025 inappropriate warning about control reaching the end of a
2026 non-void function. */
2027 jump_over_else = block_may_fallthru (then_);
2029 pred = shortcut_cond_r (pred, true_label_p, false_label_p);
2032 append_to_statement_list (pred, &expr);
2034 append_to_statement_list (then_, &expr);
2039 t = build_and_jump (&end_label);
2040 append_to_statement_list (t, &expr);
2044 t = build1 (LABEL_EXPR, void_type_node, false_label);
2045 append_to_statement_list (t, &expr);
2047 append_to_statement_list (else_, &expr);
2049 if (emit_end && end_label)
2051 t = build1 (LABEL_EXPR, void_type_node, end_label);
2052 append_to_statement_list (t, &expr);
2058 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2061 gimple_boolify (tree expr)
2063 tree type = TREE_TYPE (expr);
2065 if (TREE_CODE (type) == BOOLEAN_TYPE)
2068 switch (TREE_CODE (expr))
2070 case TRUTH_AND_EXPR:
2072 case TRUTH_XOR_EXPR:
2073 case TRUTH_ANDIF_EXPR:
2074 case TRUTH_ORIF_EXPR:
2075 /* Also boolify the arguments of truth exprs. */
2076 TREE_OPERAND (expr, 1) = gimple_boolify (TREE_OPERAND (expr, 1));
2079 case TRUTH_NOT_EXPR:
2080 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2083 case EQ_EXPR: case NE_EXPR:
2084 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2085 /* These expressions always produce boolean results. */
2086 TREE_TYPE (expr) = boolean_type_node;
2090 /* Other expressions that get here must have boolean values, but
2091 might need to be converted to the appropriate mode. */
2092 return convert (boolean_type_node, expr);
2096 /* Convert the conditional expression pointed by EXPR_P '(p) ? a : b;'
2105 The second form is used when *EXPR_P is of type void.
2107 TARGET is the tree for T1 above.
2109 PRE_P points to the list where side effects that must happen before
2110 *EXPR_P should be stored.
2112 POST_P points to the list where side effects that must happen after
2113 *EXPR_P should be stored. */
2115 static enum gimplify_status
2116 gimplify_cond_expr (tree *expr_p, tree *pre_p, tree *post_p, tree target,
2117 fallback_t fallback)
2119 tree expr = *expr_p;
2120 tree tmp, tmp2, type;
2121 enum gimplify_status ret;
2123 type = TREE_TYPE (expr);
2125 TREE_TYPE (expr) = void_type_node;
2127 /* If this COND_EXPR has a value, copy the values into a temporary within
2129 else if (! VOID_TYPE_P (type))
2135 ret = gimplify_expr (&target, pre_p, post_p,
2136 is_gimple_min_lval, fb_lvalue);
2137 if (ret != GS_ERROR)
2139 result = tmp = target;
2140 tmp2 = unshare_expr (target);
2142 else if ((fallback & fb_lvalue) == 0)
2144 result = tmp2 = tmp = create_tmp_var (TREE_TYPE (expr), "iftmp");
2149 tree type = build_pointer_type (TREE_TYPE (expr));
2151 if (TREE_TYPE (TREE_OPERAND (expr, 1)) != void_type_node)
2152 TREE_OPERAND (expr, 1) =
2153 build_fold_addr_expr (TREE_OPERAND (expr, 1));
2155 if (TREE_TYPE (TREE_OPERAND (expr, 2)) != void_type_node)
2156 TREE_OPERAND (expr, 2) =
2157 build_fold_addr_expr (TREE_OPERAND (expr, 2));
2159 tmp2 = tmp = create_tmp_var (type, "iftmp");
2161 expr = build (COND_EXPR, void_type_node, TREE_OPERAND (expr, 0),
2162 TREE_OPERAND (expr, 1), TREE_OPERAND (expr, 2));
2164 result = build_fold_indirect_ref (tmp);
2168 /* Build the then clause, 't1 = a;'. But don't build an assignment
2169 if this branch is void; in C++ it can be, if it's a throw. */
2170 if (TREE_TYPE (TREE_OPERAND (expr, 1)) != void_type_node)
2171 TREE_OPERAND (expr, 1)
2172 = build (MODIFY_EXPR, void_type_node, tmp, TREE_OPERAND (expr, 1));
2174 /* Build the else clause, 't1 = b;'. */
2175 if (TREE_TYPE (TREE_OPERAND (expr, 2)) != void_type_node)
2176 TREE_OPERAND (expr, 2)
2177 = build (MODIFY_EXPR, void_type_node, tmp2, TREE_OPERAND (expr, 2));
2179 TREE_TYPE (expr) = void_type_node;
2180 recalculate_side_effects (expr);
2182 /* Move the COND_EXPR to the prequeue. */
2183 gimplify_and_add (expr, pre_p);
2189 /* Make sure the condition has BOOLEAN_TYPE. */
2190 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2192 /* Break apart && and || conditions. */
2193 if (TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ANDIF_EXPR
2194 || TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ORIF_EXPR)
2196 expr = shortcut_cond_expr (expr);
2198 if (expr != *expr_p)
2202 /* We can't rely on gimplify_expr to re-gimplify the expanded
2203 form properly, as cleanups might cause the target labels to be
2204 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2205 set up a conditional context. */
2206 gimple_push_condition ();
2207 gimplify_stmt (expr_p);
2208 gimple_pop_condition (pre_p);
2214 /* Now do the normal gimplification. */
2215 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL,
2216 is_gimple_condexpr, fb_rvalue);
2218 gimple_push_condition ();
2220 gimplify_to_stmt_list (&TREE_OPERAND (expr, 1));
2221 gimplify_to_stmt_list (&TREE_OPERAND (expr, 2));
2222 recalculate_side_effects (expr);
2224 gimple_pop_condition (pre_p);
2226 if (ret == GS_ERROR)
2228 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2230 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 2)))
2231 /* Rewrite "if (a); else b" to "if (!a) b" */
2233 TREE_OPERAND (expr, 0) = invert_truthvalue (TREE_OPERAND (expr, 0));
2234 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL,
2235 is_gimple_condexpr, fb_rvalue);
2237 tmp = TREE_OPERAND (expr, 1);
2238 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 2);
2239 TREE_OPERAND (expr, 2) = tmp;
2242 /* Both arms are empty; replace the COND_EXPR with its predicate. */
2243 expr = TREE_OPERAND (expr, 0);
2249 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2250 a call to __builtin_memcpy. */
2252 static enum gimplify_status
2253 gimplify_modify_expr_to_memcpy (tree *expr_p, tree size, bool want_value)
2255 tree args, t, to, to_ptr, from;
2257 to = TREE_OPERAND (*expr_p, 0);
2258 from = TREE_OPERAND (*expr_p, 1);
2260 args = tree_cons (NULL, size, NULL);
2262 t = build_fold_addr_expr (from);
2263 args = tree_cons (NULL, t, args);
2265 to_ptr = build_fold_addr_expr (to);
2266 args = tree_cons (NULL, to_ptr, args);
2267 t = implicit_built_in_decls[BUILT_IN_MEMCPY];
2268 t = build_function_call_expr (t, args);
2272 t = build1 (NOP_EXPR, TREE_TYPE (to_ptr), t);
2273 t = build1 (INDIRECT_REF, TREE_TYPE (to), t);
2280 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2281 a call to __builtin_memset. In this case we know that the RHS is
2282 a CONSTRUCTOR with an empty element list. */
2284 static enum gimplify_status
2285 gimplify_modify_expr_to_memset (tree *expr_p, tree size, bool want_value)
2287 tree args, t, to, to_ptr;
2289 to = TREE_OPERAND (*expr_p, 0);
2291 args = tree_cons (NULL, size, NULL);
2293 args = tree_cons (NULL, integer_zero_node, args);
2295 to_ptr = build_fold_addr_expr (to);
2296 args = tree_cons (NULL, to_ptr, args);
2297 t = implicit_built_in_decls[BUILT_IN_MEMSET];
2298 t = build_function_call_expr (t, args);
2302 t = build1 (NOP_EXPR, TREE_TYPE (to_ptr), t);
2303 t = build1 (INDIRECT_REF, TREE_TYPE (to), t);
2310 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
2311 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
2312 assignment. Returns non-null if we detect a potential overlap. */
2314 struct gimplify_init_ctor_preeval_data
2316 /* The base decl of the lhs object. May be NULL, in which case we
2317 have to assume the lhs is indirect. */
2320 /* The alias set of the lhs object. */
2325 gimplify_init_ctor_preeval_1 (tree *tp, int *walk_subtrees, void *xdata)
2327 struct gimplify_init_ctor_preeval_data *data
2328 = (struct gimplify_init_ctor_preeval_data *) xdata;
2331 /* If we find the base object, obviously we have overlap. */
2332 if (data->lhs_base_decl == t)
2335 /* If the constructor component is indirect, determine if we have a
2336 potential overlap with the lhs. The only bits of information we
2337 have to go on at this point are addressability and alias sets. */
2338 if (TREE_CODE (t) == INDIRECT_REF
2339 && (!data->lhs_base_decl || TREE_ADDRESSABLE (data->lhs_base_decl))
2340 && alias_sets_conflict_p (data->lhs_alias_set, get_alias_set (t)))
2343 if (IS_TYPE_OR_DECL_P (t))
2348 /* A subroutine of gimplify_init_constructor. Pre-evaluate *EXPR_P,
2349 force values that overlap with the lhs (as described by *DATA)
2350 into temporaries. */
2353 gimplify_init_ctor_preeval (tree *expr_p, tree *pre_p, tree *post_p,
2354 struct gimplify_init_ctor_preeval_data *data)
2356 enum gimplify_status one;
2358 /* If the value is invariant, then there's nothing to pre-evaluate.
2359 But ensure it doesn't have any side-effects since a SAVE_EXPR is
2360 invariant but has side effects and might contain a reference to
2361 the object we're initializing. */
2362 if (TREE_INVARIANT (*expr_p) && !TREE_SIDE_EFFECTS (*expr_p))
2365 /* If the type has non-trivial constructors, we can't pre-evaluate. */
2366 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p)))
2369 /* Recurse for nested constructors. */
2370 if (TREE_CODE (*expr_p) == CONSTRUCTOR)
2373 for (list = CONSTRUCTOR_ELTS (*expr_p); list ; list = TREE_CHAIN (list))
2374 gimplify_init_ctor_preeval (&TREE_VALUE (list), pre_p, post_p, data);
2378 /* We can't preevaluate if the type contains a placeholder. */
2379 if (type_contains_placeholder_p (TREE_TYPE (*expr_p)))
2382 /* Gimplify the constructor element to something appropriate for the rhs
2383 of a MODIFY_EXPR. Given that we know the lhs is an aggregate, we know
2384 the gimplifier will consider this a store to memory. Doing this
2385 gimplification now means that we won't have to deal with complicated
2386 language-specific trees, nor trees like SAVE_EXPR that can induce
2387 exponential search behavior. */
2388 one = gimplify_expr (expr_p, pre_p, post_p, is_gimple_mem_rhs, fb_rvalue);
2389 if (one == GS_ERROR)
2395 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
2396 with the lhs, since "a = { .x=a }" doesn't make sense. This will
2397 always be true for all scalars, since is_gimple_mem_rhs insists on a
2398 temporary variable for them. */
2399 if (DECL_P (*expr_p))
2402 /* If this is of variable size, we have no choice but to assume it doesn't
2403 overlap since we can't make a temporary for it. */
2404 if (!TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (*expr_p))))
2407 /* Otherwise, we must search for overlap ... */
2408 if (!walk_tree (expr_p, gimplify_init_ctor_preeval_1, data, NULL))
2411 /* ... and if found, force the value into a temporary. */
2412 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
2415 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
2416 a RANGE_EXPR in a CONSTRUCTOR for an array.
2420 object[var] = value;
2427 We increment var _after_ the loop exit check because we might otherwise
2428 fail if upper == TYPE_MAX_VALUE (type for upper).
2430 Note that we never have to deal with SAVE_EXPRs here, because this has
2431 already been taken care of for us, in gimplify_init_ctor_preeval(). */
2433 static void gimplify_init_ctor_eval (tree, tree, tree *, bool);
2436 gimplify_init_ctor_eval_range (tree object, tree lower, tree upper,
2437 tree value, tree array_elt_type,
2438 tree *pre_p, bool cleared)
2440 tree loop_entry_label, loop_exit_label;
2441 tree var, var_type, cref;
2443 loop_entry_label = create_artificial_label ();
2444 loop_exit_label = create_artificial_label ();
2446 /* Create and initialize the index variable. */
2447 var_type = TREE_TYPE (upper);
2448 var = create_tmp_var (var_type, NULL);
2449 append_to_statement_list (build2 (MODIFY_EXPR, var_type, var, lower), pre_p);
2451 /* Add the loop entry label. */
2452 append_to_statement_list (build1 (LABEL_EXPR,
2457 /* Build the reference. */
2458 cref = build4 (ARRAY_REF, array_elt_type, unshare_expr (object),
2459 var, NULL_TREE, NULL_TREE);
2461 /* If we are a constructor, just call gimplify_init_ctor_eval to do
2462 the store. Otherwise just assign value to the reference. */
2464 if (TREE_CODE (value) == CONSTRUCTOR)
2465 /* NB we might have to call ourself recursively through
2466 gimplify_init_ctor_eval if the value is a constructor. */
2467 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
2470 append_to_statement_list (build2 (MODIFY_EXPR, TREE_TYPE (cref),
2474 /* We exit the loop when the index var is equal to the upper bound. */
2475 gimplify_and_add (build3 (COND_EXPR, void_type_node,
2476 build2 (EQ_EXPR, boolean_type_node,
2484 /* Otherwise, increment the index var... */
2485 append_to_statement_list (build2 (MODIFY_EXPR, var_type, var,
2486 build2 (PLUS_EXPR, var_type, var,
2487 fold_convert (var_type,
2488 integer_one_node))),
2491 /* ...and jump back to the loop entry. */
2492 append_to_statement_list (build1 (GOTO_EXPR,
2497 /* Add the loop exit label. */
2498 append_to_statement_list (build1 (LABEL_EXPR,
2504 /* A subroutine of gimplify_init_constructor. Generate individual
2505 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
2506 assignments should happen. LIST is the CONSTRUCTOR_ELTS of the
2507 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
2511 gimplify_init_ctor_eval (tree object, tree list, tree *pre_p, bool cleared)
2513 tree array_elt_type = NULL;
2515 if (TREE_CODE (TREE_TYPE (object)) == ARRAY_TYPE)
2516 array_elt_type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object)));
2518 for (; list; list = TREE_CHAIN (list))
2520 tree purpose, value, cref, init;
2522 purpose = TREE_PURPOSE (list);
2523 value = TREE_VALUE (list);
2525 /* NULL values are created above for gimplification errors. */
2529 if (cleared && initializer_zerop (value))
2532 /* ??? Here's to hoping the front end fills in all of the indices,
2533 so we don't have to figure out what's missing ourselves. */
2534 gcc_assert (purpose);
2536 /* If we have a RANGE_EXPR, we have to build a loop to assign the
2538 if (TREE_CODE (purpose) == RANGE_EXPR)
2540 tree lower = TREE_OPERAND (purpose, 0);
2541 tree upper = TREE_OPERAND (purpose, 1);
2543 /* If the lower bound is equal to upper, just treat it as if
2544 upper was the index. */
2545 if (simple_cst_equal (lower, upper))
2549 gimplify_init_ctor_eval_range (object, lower, upper, value,
2550 array_elt_type, pre_p, cleared);
2557 cref = build (ARRAY_REF, array_elt_type, unshare_expr (object),
2558 purpose, NULL_TREE, NULL_TREE);
2561 cref = build (COMPONENT_REF, TREE_TYPE (purpose),
2562 unshare_expr (object), purpose, NULL_TREE);
2564 if (TREE_CODE (value) == CONSTRUCTOR)
2565 gimplify_init_ctor_eval (cref, CONSTRUCTOR_ELTS (value),
2569 init = build (MODIFY_EXPR, TREE_TYPE (cref), cref, value);
2570 gimplify_and_add (init, pre_p);
2575 /* A subroutine of gimplify_modify_expr. Break out elements of a
2576 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
2578 Note that we still need to clear any elements that don't have explicit
2579 initializers, so if not all elements are initialized we keep the
2580 original MODIFY_EXPR, we just remove all of the constructor elements. */
2582 static enum gimplify_status
2583 gimplify_init_constructor (tree *expr_p, tree *pre_p,
2584 tree *post_p, bool want_value)
2587 tree ctor = TREE_OPERAND (*expr_p, 1);
2588 tree type = TREE_TYPE (ctor);
2589 enum gimplify_status ret;
2592 if (TREE_CODE (ctor) != CONSTRUCTOR)
2593 return GS_UNHANDLED;
2595 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
2596 is_gimple_lvalue, fb_lvalue);
2597 if (ret == GS_ERROR)
2599 object = TREE_OPERAND (*expr_p, 0);
2601 elt_list = CONSTRUCTOR_ELTS (ctor);
2604 switch (TREE_CODE (type))
2608 case QUAL_UNION_TYPE:
2611 struct gimplify_init_ctor_preeval_data preeval_data;
2612 HOST_WIDE_INT num_type_elements, num_ctor_elements;
2613 HOST_WIDE_INT num_nonzero_elements, num_nonconstant_elements;
2616 /* Aggregate types must lower constructors to initialization of
2617 individual elements. The exception is that a CONSTRUCTOR node
2618 with no elements indicates zero-initialization of the whole. */
2619 if (elt_list == NULL)
2622 categorize_ctor_elements (ctor, &num_nonzero_elements,
2623 &num_nonconstant_elements,
2624 &num_ctor_elements, &cleared);
2626 /* If a const aggregate variable is being initialized, then it
2627 should never be a lose to promote the variable to be static. */
2628 if (num_nonconstant_elements == 0
2629 && num_nonzero_elements > 1
2630 && TREE_READONLY (object)
2631 && TREE_CODE (object) == VAR_DECL)
2633 DECL_INITIAL (object) = ctor;
2634 TREE_STATIC (object) = 1;
2635 if (!DECL_NAME (object))
2636 DECL_NAME (object) = create_tmp_var_name ("C");
2637 walk_tree (&DECL_INITIAL (object), force_labels_r, NULL, NULL);
2639 /* ??? C++ doesn't automatically append a .<number> to the
2640 assembler name, and even when it does, it looks a FE private
2641 data structures to figure out what that number should be,
2642 which are not set for this variable. I suppose this is
2643 important for local statics for inline functions, which aren't
2644 "local" in the object file sense. So in order to get a unique
2645 TU-local symbol, we must invoke the lhd version now. */
2646 lhd_set_decl_assembler_name (object);
2648 *expr_p = NULL_TREE;
2652 /* If there are "lots" of initialized elements, even discounting
2653 those that are not address constants (and thus *must* be
2654 computed at runtime), then partition the constructor into
2655 constant and non-constant parts. Block copy the constant
2656 parts in, then generate code for the non-constant parts. */
2657 /* TODO. There's code in cp/typeck.c to do this. */
2659 num_type_elements = count_type_elements (TREE_TYPE (ctor));
2661 /* If there are "lots" of zeros, then block clear the object first. */
2662 if (num_type_elements - num_nonzero_elements > CLEAR_RATIO
2663 && num_nonzero_elements < num_type_elements/4)
2666 /* ??? This bit ought not be needed. For any element not present
2667 in the initializer, we should simply set them to zero. Except
2668 we'd need to *find* the elements that are not present, and that
2669 requires trickery to avoid quadratic compile-time behavior in
2670 large cases or excessive memory use in small cases. */
2671 else if (num_ctor_elements < num_type_elements)
2674 /* If there are "lots" of initialized elements, and all of them
2675 are valid address constants, then the entire initializer can
2676 be dropped to memory, and then memcpy'd out. Don't do this
2677 for sparse arrays, though, as it's more efficient to follow
2678 the standard CONSTRUCTOR behavior of memset followed by
2679 individual element initialization. */
2680 if (num_nonconstant_elements == 0 && !cleared)
2682 HOST_WIDE_INT size = int_size_in_bytes (type);
2685 /* ??? We can still get unbounded array types, at least
2686 from the C++ front end. This seems wrong, but attempt
2687 to work around it for now. */
2690 size = int_size_in_bytes (TREE_TYPE (object));
2692 TREE_TYPE (ctor) = type = TREE_TYPE (object);
2695 /* Find the maximum alignment we can assume for the object. */
2696 /* ??? Make use of DECL_OFFSET_ALIGN. */
2697 if (DECL_P (object))
2698 align = DECL_ALIGN (object);
2700 align = TYPE_ALIGN (type);
2702 if (size > 0 && !can_move_by_pieces (size, align))
2704 tree new = create_tmp_var_raw (type, "C");
2706 gimple_add_tmp_var (new);
2707 TREE_STATIC (new) = 1;
2708 TREE_READONLY (new) = 1;
2709 DECL_INITIAL (new) = ctor;
2710 if (align > DECL_ALIGN (new))
2712 DECL_ALIGN (new) = align;
2713 DECL_USER_ALIGN (new) = 1;
2715 walk_tree (&DECL_INITIAL (new), force_labels_r, NULL, NULL);
2717 TREE_OPERAND (*expr_p, 1) = new;
2719 /* This is no longer an assignment of a CONSTRUCTOR, but
2720 we still may have processing to do on the LHS. So
2721 pretend we didn't do anything here to let that happen. */
2722 return GS_UNHANDLED;
2728 /* Zap the CONSTRUCTOR element list, which simplifies this case.
2729 Note that we still have to gimplify, in order to handle the
2730 case of variable sized types. Avoid shared tree structures. */
2731 CONSTRUCTOR_ELTS (ctor) = NULL_TREE;
2732 object = unshare_expr (object);
2733 gimplify_stmt (expr_p);
2734 append_to_statement_list (*expr_p, pre_p);
2737 /* If we have not block cleared the object, or if there are nonzero
2738 elements in the constructor, add assignments to the individual
2739 scalar fields of the object. */
2740 if (!cleared || num_nonzero_elements > 0)
2742 preeval_data.lhs_base_decl = get_base_address (object);
2743 if (!DECL_P (preeval_data.lhs_base_decl))
2744 preeval_data.lhs_base_decl = NULL;
2745 preeval_data.lhs_alias_set = get_alias_set (object);
2747 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p, 1),
2748 pre_p, post_p, &preeval_data);
2749 gimplify_init_ctor_eval (object, elt_list, pre_p, cleared);
2752 *expr_p = NULL_TREE;
2760 /* Extract the real and imaginary parts out of the ctor. */
2764 r = TREE_VALUE (elt_list);
2765 elt_list = TREE_CHAIN (elt_list);
2768 i = TREE_VALUE (elt_list);
2769 gcc_assert (!TREE_CHAIN (elt_list));
2772 if (r == NULL || i == NULL)
2774 tree zero = convert (TREE_TYPE (type), integer_zero_node);
2781 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
2782 represent creation of a complex value. */
2783 if (TREE_CONSTANT (r) && TREE_CONSTANT (i))
2785 ctor = build_complex (type, r, i);
2786 TREE_OPERAND (*expr_p, 1) = ctor;
2790 ctor = build (COMPLEX_EXPR, type, r, i);
2791 TREE_OPERAND (*expr_p, 1) = ctor;
2792 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
2793 rhs_predicate_for (TREE_OPERAND (*expr_p, 0)),
2800 /* Go ahead and simplify constant constructors to VECTOR_CST. */
2801 if (TREE_CONSTANT (ctor))
2805 /* Even when ctor is constant, it might contain non-*_CST
2806 elements (e.g. { 1.0/0.0 - 1.0/0.0, 0.0 }) and those don't
2807 belong into VECTOR_CST nodes. */
2808 for (tem = elt_list; tem; tem = TREE_CHAIN (tem))
2809 if (! CONSTANT_CLASS_P (TREE_VALUE (tem)))
2814 TREE_OPERAND (*expr_p, 1) = build_vector (type, elt_list);
2819 /* Vector types use CONSTRUCTOR all the way through gimple
2820 compilation as a general initializer. */
2821 for (; elt_list; elt_list = TREE_CHAIN (elt_list))
2823 enum gimplify_status tret;
2824 tret = gimplify_expr (&TREE_VALUE (elt_list), pre_p, post_p,
2825 is_gimple_val, fb_rvalue);
2826 if (tret == GS_ERROR)
2832 /* So how did we get a CONSTRUCTOR for a scalar type? */
2836 if (ret == GS_ERROR)
2838 else if (want_value)
2840 append_to_statement_list (*expr_p, pre_p);
2848 /* Given a pointer value OP0, return a simplified version of an
2849 indirection through OP0, or NULL_TREE if no simplification is
2850 possible. This may only be applied to a rhs of an expression.
2851 Note that the resulting type may be different from the type pointed
2852 to in the sense that it is still compatible from the langhooks
2856 fold_indirect_ref_rhs (tree t)
2858 tree type = TREE_TYPE (TREE_TYPE (t));
2863 subtype = TREE_TYPE (sub);
2864 if (!POINTER_TYPE_P (subtype))
2867 if (TREE_CODE (sub) == ADDR_EXPR)
2869 tree op = TREE_OPERAND (sub, 0);
2870 tree optype = TREE_TYPE (op);
2872 if (lang_hooks.types_compatible_p (type, optype))
2874 /* *(foo *)&fooarray => fooarray[0] */
2875 else if (TREE_CODE (optype) == ARRAY_TYPE
2876 && lang_hooks.types_compatible_p (type, TREE_TYPE (optype)))
2878 tree type_domain = TYPE_DOMAIN (optype);
2879 tree min_val = size_zero_node;
2880 if (type_domain && TYPE_MIN_VALUE (type_domain))
2881 min_val = TYPE_MIN_VALUE (type_domain);
2882 return build4 (ARRAY_REF, type, op, min_val, NULL_TREE, NULL_TREE);
2886 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
2887 if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
2888 && lang_hooks.types_compatible_p (type, TREE_TYPE (TREE_TYPE (subtype))))
2891 tree min_val = size_zero_node;
2892 sub = fold_indirect_ref_rhs (sub);
2894 sub = build1 (INDIRECT_REF, TREE_TYPE (subtype), sub);
2895 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
2896 if (type_domain && TYPE_MIN_VALUE (type_domain))
2897 min_val = TYPE_MIN_VALUE (type_domain);
2898 return build4 (ARRAY_REF, type, sub, min_val, NULL_TREE, NULL_TREE);
2904 /* Subroutine of gimplify_modify_expr to do simplifications of MODIFY_EXPRs
2905 based on the code of the RHS. We loop for as long as something changes. */
2907 static enum gimplify_status
2908 gimplify_modify_expr_rhs (tree *expr_p, tree *from_p, tree *to_p, tree *pre_p,
2909 tree *post_p, bool want_value)
2911 enum gimplify_status ret = GS_OK;
2913 while (ret != GS_UNHANDLED)
2914 switch (TREE_CODE (*from_p))
2918 /* If we have code like
2922 where the type of "x" is a (possibly cv-qualified variant
2923 of "A"), treat the entire expression as identical to "x".
2924 This kind of code arises in C++ when an object is bound
2925 to a const reference, and if "x" is a TARGET_EXPR we want
2926 to take advantage of the optimization below. */
2927 tree t = fold_indirect_ref_rhs (TREE_OPERAND (*from_p, 0));
2940 /* If we are initializing something from a TARGET_EXPR, strip the
2941 TARGET_EXPR and initialize it directly, if possible. This can't
2942 be done if the initializer is void, since that implies that the
2943 temporary is set in some non-trivial way.
2945 ??? What about code that pulls out the temp and uses it
2946 elsewhere? I think that such code never uses the TARGET_EXPR as
2947 an initializer. If I'm wrong, we'll die because the temp won't
2948 have any RTL. In that case, I guess we'll need to replace
2949 references somehow. */
2950 tree init = TARGET_EXPR_INITIAL (*from_p);
2952 if (!VOID_TYPE_P (TREE_TYPE (init)))
2963 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
2965 gimplify_compound_expr (from_p, pre_p, true);
2970 /* If we're initializing from a CONSTRUCTOR, break this into
2971 individual MODIFY_EXPRs. */
2972 return gimplify_init_constructor (expr_p, pre_p, post_p, want_value);
2975 /* If we're assigning to a non-register type, push the assignment
2976 down into the branches. This is mandatory for ADDRESSABLE types,
2977 since we cannot generate temporaries for such, but it saves a
2978 copy in other cases as well. */
2979 if (!is_gimple_reg_type (TREE_TYPE (*from_p)))
2982 return gimplify_cond_expr (expr_p, pre_p, post_p, *to_p,
2997 /* Gimplify the MODIFY_EXPR node pointed by EXPR_P.
3003 PRE_P points to the list where side effects that must happen before
3004 *EXPR_P should be stored.
3006 POST_P points to the list where side effects that must happen after
3007 *EXPR_P should be stored.
3009 WANT_VALUE is nonzero iff we want to use the value of this expression
3010 in another expression. */
3012 static enum gimplify_status
3013 gimplify_modify_expr (tree *expr_p, tree *pre_p, tree *post_p, bool want_value)
3015 tree *from_p = &TREE_OPERAND (*expr_p, 1);
3016 tree *to_p = &TREE_OPERAND (*expr_p, 0);
3017 enum gimplify_status ret = GS_UNHANDLED;
3019 gcc_assert (TREE_CODE (*expr_p) == MODIFY_EXPR
3020 || TREE_CODE (*expr_p) == INIT_EXPR);
3022 /* The distinction between MODIFY_EXPR and INIT_EXPR is no longer useful. */
3023 if (TREE_CODE (*expr_p) == INIT_EXPR)
3024 TREE_SET_CODE (*expr_p, MODIFY_EXPR);
3026 /* See if any simplifications can be done based on what the RHS is. */
3027 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
3029 if (ret != GS_UNHANDLED)
3032 /* If the value being copied is of variable width, compute the length
3033 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
3034 before gimplifying any of the operands so that we can resolve any
3035 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
3036 the size of the expression to be copied, not of the destination, so
3037 that is what we must here. */
3038 maybe_with_size_expr (from_p);
3040 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
3041 if (ret == GS_ERROR)
3044 ret = gimplify_expr (from_p, pre_p, post_p,
3045 rhs_predicate_for (*to_p), fb_rvalue);
3046 if (ret == GS_ERROR)
3049 /* Now see if the above changed *from_p to something we handle specially. */
3050 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
3052 if (ret != GS_UNHANDLED)
3055 /* If we've got a variable sized assignment between two lvalues (i.e. does
3056 not involve a call), then we can make things a bit more straightforward
3057 by converting the assignment to memcpy or memset. */
3058 if (TREE_CODE (*from_p) == WITH_SIZE_EXPR)
3060 tree from = TREE_OPERAND (*from_p, 0);
3061 tree size = TREE_OPERAND (*from_p, 1);
3063 if (TREE_CODE (from) == CONSTRUCTOR)
3064 return gimplify_modify_expr_to_memset (expr_p, size, want_value);
3065 if (is_gimple_addressable (from))
3068 return gimplify_modify_expr_to_memcpy (expr_p, size, want_value);
3072 if (gimplify_ctxp->into_ssa && is_gimple_reg (*to_p))
3074 /* If we've somehow already got an SSA_NAME on the LHS, then
3075 we're probably modified it twice. Not good. */
3076 gcc_assert (TREE_CODE (*to_p) != SSA_NAME);
3077 *to_p = make_ssa_name (*to_p, *expr_p);
3082 append_to_statement_list (*expr_p, pre_p);
3090 /* Gimplify a comparison between two variable-sized objects. Do this
3091 with a call to BUILT_IN_MEMCMP. */
3093 static enum gimplify_status
3094 gimplify_variable_sized_compare (tree *expr_p)
3096 tree op0 = TREE_OPERAND (*expr_p, 0);
3097 tree op1 = TREE_OPERAND (*expr_p, 1);
3100 t = TYPE_SIZE_UNIT (TREE_TYPE (op0));
3101 t = unshare_expr (t);
3102 t = SUBSTITUTE_PLACEHOLDER_IN_EXPR (t, op0);
3103 args = tree_cons (NULL, t, NULL);
3104 t = build_fold_addr_expr (op1);
3105 args = tree_cons (NULL, t, args);
3106 dest = build_fold_addr_expr (op0);
3107 args = tree_cons (NULL, dest, args);
3108 t = implicit_built_in_decls[BUILT_IN_MEMCMP];
3109 t = build_function_call_expr (t, args);
3111 = build (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), t, integer_zero_node);
3116 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
3117 points to the expression to gimplify.
3119 Expressions of the form 'a && b' are gimplified to:
3121 a && b ? true : false
3123 gimplify_cond_expr will do the rest.
3125 PRE_P points to the list where side effects that must happen before
3126 *EXPR_P should be stored. */
3128 static enum gimplify_status
3129 gimplify_boolean_expr (tree *expr_p)
3131 /* Preserve the original type of the expression. */
3132 tree type = TREE_TYPE (*expr_p);
3134 *expr_p = build (COND_EXPR, type, *expr_p,
3135 convert (type, boolean_true_node),
3136 convert (type, boolean_false_node));
3141 /* Gimplifies an expression sequence. This function gimplifies each
3142 expression and re-writes the original expression with the last
3143 expression of the sequence in GIMPLE form.
3145 PRE_P points to the list where the side effects for all the
3146 expressions in the sequence will be emitted.
3148 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
3149 /* ??? Should rearrange to share the pre-queue with all the indirect
3150 invocations of gimplify_expr. Would probably save on creations
3151 of statement_list nodes. */
3153 static enum gimplify_status
3154 gimplify_compound_expr (tree *expr_p, tree *pre_p, bool want_value)
3160 tree *sub_p = &TREE_OPERAND (t, 0);
3162 if (TREE_CODE (*sub_p) == COMPOUND_EXPR)
3163 gimplify_compound_expr (sub_p, pre_p, false);
3165 gimplify_stmt (sub_p);
3166 append_to_statement_list (*sub_p, pre_p);
3168 t = TREE_OPERAND (t, 1);
3170 while (TREE_CODE (t) == COMPOUND_EXPR);
3177 gimplify_stmt (expr_p);
3182 /* Gimplifies a statement list. These may be created either by an
3183 enlightened front-end, or by shortcut_cond_expr. */
3185 static enum gimplify_status
3186 gimplify_statement_list (tree *expr_p)
3188 tree_stmt_iterator i = tsi_start (*expr_p);
3190 while (!tsi_end_p (i))
3194 gimplify_stmt (tsi_stmt_ptr (i));
3199 else if (TREE_CODE (t) == STATEMENT_LIST)
3201 tsi_link_before (&i, t, TSI_SAME_STMT);
3211 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
3212 gimplify. After gimplification, EXPR_P will point to a new temporary
3213 that holds the original value of the SAVE_EXPR node.
3215 PRE_P points to the list where side effects that must happen before
3216 *EXPR_P should be stored. */
3218 static enum gimplify_status
3219 gimplify_save_expr (tree *expr_p, tree *pre_p, tree *post_p)
3221 enum gimplify_status ret = GS_ALL_DONE;
3224 gcc_assert (TREE_CODE (*expr_p) == SAVE_EXPR);
3225 val = TREE_OPERAND (*expr_p, 0);
3227 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
3228 if (!SAVE_EXPR_RESOLVED_P (*expr_p))
3230 /* The operand may be a void-valued expression such as SAVE_EXPRs
3231 generated by the Java frontend for class initialization. It is
3232 being executed only for its side-effects. */
3233 if (TREE_TYPE (val) == void_type_node)
3235 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3236 is_gimple_stmt, fb_none);
3237 append_to_statement_list (TREE_OPERAND (*expr_p, 0), pre_p);
3241 val = get_initialized_tmp_var (val, pre_p, post_p);
3243 TREE_OPERAND (*expr_p, 0) = val;
3244 SAVE_EXPR_RESOLVED_P (*expr_p) = 1;
3252 /* Re-write the ADDR_EXPR node pointed by EXPR_P
3259 PRE_P points to the list where side effects that must happen before
3260 *EXPR_P should be stored.
3262 POST_P points to the list where side effects that must happen after
3263 *EXPR_P should be stored. */
3265 static enum gimplify_status
3266 gimplify_addr_expr (tree *expr_p, tree *pre_p, tree *post_p)
3268 tree expr = *expr_p;
3269 tree op0 = TREE_OPERAND (expr, 0);
3270 enum gimplify_status ret;
3272 switch (TREE_CODE (op0))
3275 case MISALIGNED_INDIRECT_REF:
3277 /* Check if we are dealing with an expression of the form '&*ptr'.
3278 While the front end folds away '&*ptr' into 'ptr', these
3279 expressions may be generated internally by the compiler (e.g.,
3280 builtins like __builtin_va_end). */
3281 /* Caution: the silent array decomposition semantics we allow for
3282 ADDR_EXPR means we can't always discard the pair. */
3283 /* Gimplification of the ADDR_EXPR operand may drop
3284 cv-qualification conversions, so make sure we add them if
3287 tree op00 = TREE_OPERAND (op0, 0);
3288 tree t_expr = TREE_TYPE (expr);
3289 tree t_op00 = TREE_TYPE (op00);
3291 if (!lang_hooks.types_compatible_p (t_expr, t_op00))
3293 #ifdef ENABLE_CHECKING
3294 tree t_op0 = TREE_TYPE (op0);
3295 gcc_assert (POINTER_TYPE_P (t_expr)
3296 && cpt_same_type (TREE_CODE (t_op0) == ARRAY_TYPE
3297 ? TREE_TYPE (t_op0) : t_op0,
3299 && POINTER_TYPE_P (t_op00)
3300 && cpt_same_type (t_op0, TREE_TYPE (t_op00)));
3302 op00 = fold_convert (TREE_TYPE (expr), op00);
3309 case VIEW_CONVERT_EXPR:
3310 /* Take the address of our operand and then convert it to the type of
3313 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
3314 all clear. The impact of this transformation is even less clear. */
3316 /* If the operand is a useless conversion, look through it. Doing so
3317 guarantees that the ADDR_EXPR and its operand will remain of the
3319 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0, 0)))
3320 op0 = TREE_OPERAND (op0, 0);
3322 *expr_p = fold_convert (TREE_TYPE (expr),
3323 build_fold_addr_expr (TREE_OPERAND (op0, 0)));
3328 /* We use fb_either here because the C frontend sometimes takes
3329 the address of a call that returns a struct; see
3330 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
3331 the implied temporary explicit. */
3332 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, post_p,
3333 is_gimple_addressable, fb_either);
3334 if (ret != GS_ERROR)
3336 op0 = TREE_OPERAND (expr, 0);
3338 /* For various reasons, the gimplification of the expression
3339 may have made a new INDIRECT_REF. */
3340 if (TREE_CODE (op0) == INDIRECT_REF)
3341 goto do_indirect_ref;
3343 /* Make sure TREE_INVARIANT, TREE_CONSTANT, and TREE_SIDE_EFFECTS
3345 recompute_tree_invarant_for_addr_expr (expr);
3347 /* Mark the RHS addressable. */
3348 lang_hooks.mark_addressable (TREE_OPERAND (expr, 0));
3356 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
3357 value; output operands should be a gimple lvalue. */
3359 static enum gimplify_status
3360 gimplify_asm_expr (tree *expr_p, tree *pre_p, tree *post_p)
3362 tree expr = *expr_p;
3363 int noutputs = list_length (ASM_OUTPUTS (expr));
3364 const char **oconstraints
3365 = (const char **) alloca ((noutputs) * sizeof (const char *));
3368 const char *constraint;
3369 bool allows_mem, allows_reg, is_inout;
3370 enum gimplify_status ret, tret;
3373 for (i = 0, link = ASM_OUTPUTS (expr); link; ++i, link = TREE_CHAIN (link))
3375 size_t constraint_len;
3376 oconstraints[i] = constraint
3377 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
3378 constraint_len = strlen (constraint);
3379 if (constraint_len == 0)
3382 parse_output_constraint (&constraint, i, 0, 0,
3383 &allows_mem, &allows_reg, &is_inout);
3385 if (!allows_reg && allows_mem)
3386 lang_hooks.mark_addressable (TREE_VALUE (link));
3388 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
3389 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
3390 fb_lvalue | fb_mayfail);
3391 if (tret == GS_ERROR)
3393 error ("invalid lvalue in asm output %d", i);
3399 /* An input/output operand. To give the optimizers more
3400 flexibility, split it into separate input and output
3405 /* Turn the in/out constraint into an output constraint. */
3406 char *p = xstrdup (constraint);
3408 TREE_VALUE (TREE_PURPOSE (link)) = build_string (constraint_len, p);
3410 /* And add a matching input constraint. */
3413 sprintf (buf, "%d", i);
3415 /* If there are multiple alternatives in the constraint,
3416 handle each of them individually. Those that allow register
3417 will be replaced with operand number, the others will stay
3419 if (strchr (p, ',') != NULL)
3421 size_t len = 0, buflen = strlen (buf);
3422 char *beg, *end, *str, *dst;
3426 end = strchr (beg, ',');
3428 end = strchr (beg, '\0');
3429 if ((size_t) (end - beg) < buflen)
3432 len += end - beg + 1;
3440 for (beg = p + 1, dst = str;;)
3443 bool mem_p, reg_p, inout_p;
3445 end = strchr (beg, ',');
3450 parse_output_constraint (&tem, i, 0, 0,
3451 &mem_p, ®_p, &inout_p);
3456 memcpy (dst, buf, buflen);
3465 memcpy (dst, beg, len);
3474 input = build_string (dst - str, str);
3477 input = build_string (strlen (buf), buf);
3480 input = build_string (constraint_len - 1, constraint + 1);
3484 input = build_tree_list (build_tree_list (NULL_TREE, input),
3485 unshare_expr (TREE_VALUE (link)));
3486 ASM_INPUTS (expr) = chainon (ASM_INPUTS (expr), input);
3490 for (link = ASM_INPUTS (expr); link; ++i, link = TREE_CHAIN (link))
3493 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
3494 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
3495 oconstraints, &allows_mem, &allows_reg);
3497 /* If the operand is a memory input, it should be an lvalue. */
3498 if (!allows_reg && allows_mem)
3500 lang_hooks.mark_addressable (TREE_VALUE (link));
3501 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
3502 is_gimple_lvalue, fb_lvalue | fb_mayfail);
3503 if (tret == GS_ERROR)
3505 error ("memory input %d is not directly addressable", i);
3511 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
3512 is_gimple_asm_val, fb_rvalue);
3513 if (tret == GS_ERROR)
3521 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
3522 WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
3523 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
3524 return to this function.
3526 FIXME should we complexify the prequeue handling instead? Or use flags
3527 for all the cleanups and let the optimizer tighten them up? The current
3528 code seems pretty fragile; it will break on a cleanup within any
3529 non-conditional nesting. But any such nesting would be broken, anyway;
3530 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
3531 and continues out of it. We can do that at the RTL level, though, so
3532 having an optimizer to tighten up try/finally regions would be a Good
3535 static enum gimplify_status
3536 gimplify_cleanup_point_expr (tree *expr_p, tree *pre_p)
3538 tree_stmt_iterator iter;
3541 tree temp = voidify_wrapper_expr (*expr_p, NULL);
3543 /* We only care about the number of conditions between the innermost
3544 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count. */
3545 int old_conds = gimplify_ctxp->conditions;
3546 gimplify_ctxp->conditions = 0;
3548 body = TREE_OPERAND (*expr_p, 0);
3549 gimplify_to_stmt_list (&body);
3551 gimplify_ctxp->conditions = old_conds;
3553 for (iter = tsi_start (body); !tsi_end_p (iter); )
3555 tree *wce_p = tsi_stmt_ptr (iter);
3558 if (TREE_CODE (wce) == WITH_CLEANUP_EXPR)
3560 if (tsi_one_before_end_p (iter))
3562 tsi_link_before (&iter, TREE_OPERAND (wce, 0), TSI_SAME_STMT);
3569 enum tree_code code;
3571 if (CLEANUP_EH_ONLY (wce))
3572 code = TRY_CATCH_EXPR;
3574 code = TRY_FINALLY_EXPR;
3576 sl = tsi_split_statement_list_after (&iter);
3577 tfe = build (code, void_type_node, sl, NULL_TREE);
3578 append_to_statement_list (TREE_OPERAND (wce, 0),
3579 &TREE_OPERAND (tfe, 1));
3581 iter = tsi_start (sl);
3591 append_to_statement_list (body, pre_p);
3601 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
3602 is the cleanup action required. */
3605 gimple_push_cleanup (tree var, tree cleanup, bool eh_only, tree *pre_p)
3609 /* Errors can result in improperly nested cleanups. Which results in
3610 confusion when trying to resolve the WITH_CLEANUP_EXPR. */
3611 if (errorcount || sorrycount)
3614 if (gimple_conditional_context ())
3616 /* If we're in a conditional context, this is more complex. We only
3617 want to run the cleanup if we actually ran the initialization that
3618 necessitates it, but we want to run it after the end of the
3619 conditional context. So we wrap the try/finally around the
3620 condition and use a flag to determine whether or not to actually
3621 run the destructor. Thus
3625 becomes (approximately)
3629 if (test) { A::A(temp); flag = 1; val = f(temp); }
3632 if (flag) A::~A(temp);
3637 tree flag = create_tmp_var (boolean_type_node, "cleanup");
3638 tree ffalse = build (MODIFY_EXPR, void_type_node, flag,
3639 boolean_false_node);
3640 tree ftrue = build (MODIFY_EXPR, void_type_node, flag,
3642 cleanup = build (COND_EXPR, void_type_node, flag, cleanup, NULL);
3643 wce = build (WITH_CLEANUP_EXPR, void_type_node, cleanup);
3644 append_to_statement_list (ffalse, &gimplify_ctxp->conditional_cleanups);
3645 append_to_statement_list (wce, &gimplify_ctxp->conditional_cleanups);
3646 append_to_statement_list (ftrue, pre_p);
3648 /* Because of this manipulation, and the EH edges that jump
3649 threading cannot redirect, the temporary (VAR) will appear
3650 to be used uninitialized. Don't warn. */
3651 TREE_NO_WARNING (var) = 1;
3655 wce = build (WITH_CLEANUP_EXPR, void_type_node, cleanup);
3656 CLEANUP_EH_ONLY (wce) = eh_only;
3657 append_to_statement_list (wce, pre_p);
3660 gimplify_stmt (&TREE_OPERAND (wce, 0));
3663 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
3665 static enum gimplify_status
3666 gimplify_target_expr (tree *expr_p, tree *pre_p, tree *post_p)
3668 tree targ = *expr_p;
3669 tree temp = TARGET_EXPR_SLOT (targ);
3670 tree init = TARGET_EXPR_INITIAL (targ);
3671 enum gimplify_status ret;
3675 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
3676 to the temps list. */
3677 gimple_add_tmp_var (temp);
3679 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
3680 expression is supposed to initialize the slot. */
3681 if (VOID_TYPE_P (TREE_TYPE (init)))
3682 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
3685 /* Special handling for BIND_EXPR can result in fewer temps. */
3687 if (TREE_CODE (init) == BIND_EXPR)
3688 gimplify_bind_expr (&init, temp, pre_p);
3691 init = build (MODIFY_EXPR, void_type_node, temp, init);
3692 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt,
3696 if (ret == GS_ERROR)
3698 append_to_statement_list (init, pre_p);
3700 /* If needed, push the cleanup for the temp. */
3701 if (TARGET_EXPR_CLEANUP (targ))
3703 gimplify_stmt (&TARGET_EXPR_CLEANUP (targ));
3704 gimple_push_cleanup (temp, TARGET_EXPR_CLEANUP (targ),
3705 CLEANUP_EH_ONLY (targ), pre_p);
3708 /* Only expand this once. */
3709 TREE_OPERAND (targ, 3) = init;
3710 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
3713 /* We should have expanded this before. */
3714 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp));
3720 /* Gimplification of expression trees. */
3722 /* Gimplify an expression which appears at statement context; usually, this
3723 means replacing it with a suitably gimple STATEMENT_LIST. */
3726 gimplify_stmt (tree *stmt_p)
3728 gimplify_expr (stmt_p, NULL, NULL, is_gimple_stmt, fb_none);
3731 /* Similarly, but force the result to be a STATEMENT_LIST. */
3734 gimplify_to_stmt_list (tree *stmt_p)
3736 gimplify_stmt (stmt_p);
3738 *stmt_p = alloc_stmt_list ();
3739 else if (TREE_CODE (*stmt_p) != STATEMENT_LIST)
3742 *stmt_p = alloc_stmt_list ();
3743 append_to_statement_list (t, stmt_p);
3748 /* Gimplifies the expression tree pointed by EXPR_P. Return 0 if
3749 gimplification failed.
3751 PRE_P points to the list where side effects that must happen before
3752 EXPR should be stored.
3754 POST_P points to the list where side effects that must happen after
3755 EXPR should be stored, or NULL if there is no suitable list. In
3756 that case, we copy the result to a temporary, emit the
3757 post-effects, and then return the temporary.
3759 GIMPLE_TEST_F points to a function that takes a tree T and
3760 returns nonzero if T is in the GIMPLE form requested by the
3761 caller. The GIMPLE predicates are in tree-gimple.c.
3763 This test is used twice. Before gimplification, the test is
3764 invoked to determine whether *EXPR_P is already gimple enough. If
3765 that fails, *EXPR_P is gimplified according to its code and
3766 GIMPLE_TEST_F is called again. If the test still fails, then a new
3767 temporary variable is created and assigned the value of the
3768 gimplified expression.
3770 FALLBACK tells the function what sort of a temporary we want. If the 1
3771 bit is set, an rvalue is OK. If the 2 bit is set, an lvalue is OK.
3772 If both are set, either is OK, but an lvalue is preferable.
3774 The return value is either GS_ERROR or GS_ALL_DONE, since this function
3775 iterates until solution. */
3777 enum gimplify_status
3778 gimplify_expr (tree *expr_p, tree *pre_p, tree *post_p,
3779 bool (* gimple_test_f) (tree), fallback_t fallback)
3782 tree internal_pre = NULL_TREE;
3783 tree internal_post = NULL_TREE;
3785 int is_statement = (pre_p == NULL);
3786 location_t saved_location;
3787 enum gimplify_status ret;
3789 save_expr = *expr_p;
3790 if (save_expr == NULL_TREE)
3793 /* We used to check the predicate here and return immediately if it
3794 succeeds. This is wrong; the design is for gimplification to be
3795 idempotent, and for the predicates to only test for valid forms, not
3796 whether they are fully simplified. */
3798 /* Set up our internal queues if needed. */
3800 pre_p = &internal_pre;
3802 post_p = &internal_post;
3804 saved_location = input_location;
3805 if (save_expr != error_mark_node
3806 && EXPR_HAS_LOCATION (*expr_p))
3807 input_location = EXPR_LOCATION (*expr_p);
3809 /* Loop over the specific gimplifiers until the toplevel node
3810 remains the same. */
3813 /* Strip away as many useless type conversions as possible
3815 STRIP_USELESS_TYPE_CONVERSION (*expr_p);
3817 /* Remember the expr. */
3818 save_expr = *expr_p;
3820 /* Die, die, die, my darling. */
3821 if (save_expr == error_mark_node
3822 || (TREE_TYPE (save_expr)
3823 && TREE_TYPE (save_expr) == error_mark_node))
3829 /* Do any language-specific gimplification. */
3830 ret = lang_hooks.gimplify_expr (expr_p, pre_p, post_p);
3833 if (*expr_p == NULL_TREE)
3835 if (*expr_p != save_expr)
3838 else if (ret != GS_UNHANDLED)
3842 switch (TREE_CODE (*expr_p))
3844 /* First deal with the special cases. */
3846 case POSTINCREMENT_EXPR:
3847 case POSTDECREMENT_EXPR:
3848 case PREINCREMENT_EXPR:
3849 case PREDECREMENT_EXPR:
3850 ret = gimplify_self_mod_expr (expr_p, pre_p, post_p,
3851 fallback != fb_none);
3855 case ARRAY_RANGE_REF:
3859 case VIEW_CONVERT_EXPR:
3860 ret = gimplify_compound_lval (expr_p, pre_p, post_p,
3861 fallback ? fallback : fb_rvalue);
3865 ret = gimplify_cond_expr (expr_p, pre_p, post_p, NULL_TREE,
3867 /* C99 code may assign to an array in a structure value of a
3868 conditional expression, and this has undefined behavior
3869 only on execution, so create a temporary if an lvalue is
3871 if (fallback == fb_lvalue)
3873 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
3874 lang_hooks.mark_addressable (*expr_p);
3879 ret = gimplify_call_expr (expr_p, pre_p, fallback != fb_none);
3880 /* C99 code may assign to an array in a structure returned
3881 from a function, and this has undefined behavior only on
3882 execution, so create a temporary if an lvalue is
3884 if (fallback == fb_lvalue)
3886 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
3887 lang_hooks.mark_addressable (*expr_p);
3895 ret = gimplify_compound_expr (expr_p, pre_p, fallback != fb_none);
3900 ret = gimplify_modify_expr (expr_p, pre_p, post_p,
3901 fallback != fb_none);
3904 case TRUTH_ANDIF_EXPR:
3905 case TRUTH_ORIF_EXPR:
3906 ret = gimplify_boolean_expr (expr_p);
3909 case TRUTH_NOT_EXPR:
3910 TREE_OPERAND (*expr_p, 0)
3911 = gimple_boolify (TREE_OPERAND (*expr_p, 0));
3912 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3913 is_gimple_val, fb_rvalue);
3914 recalculate_side_effects (*expr_p);
3918 ret = gimplify_addr_expr (expr_p, pre_p, post_p);
3922 ret = gimplify_va_arg_expr (expr_p, pre_p, post_p);
3927 if (IS_EMPTY_STMT (*expr_p))
3933 if (VOID_TYPE_P (TREE_TYPE (*expr_p))
3934 || fallback == fb_none)
3936 /* Just strip a conversion to void (or in void context) and
3938 *expr_p = TREE_OPERAND (*expr_p, 0);
3942 ret = gimplify_conversion (expr_p);
3943 if (ret == GS_ERROR)
3945 if (*expr_p != save_expr)
3949 case FIX_TRUNC_EXPR:
3951 case FIX_FLOOR_EXPR:
3952 case FIX_ROUND_EXPR:
3953 /* unary_expr: ... | '(' cast ')' val | ... */
3954 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3955 is_gimple_val, fb_rvalue);
3956 recalculate_side_effects (*expr_p);
3960 *expr_p = fold_indirect_ref (*expr_p);
3961 if (*expr_p != save_expr)
3963 /* else fall through. */
3964 case ALIGN_INDIRECT_REF:
3965 case MISALIGNED_INDIRECT_REF:
3966 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3967 is_gimple_reg, fb_rvalue);
3968 recalculate_side_effects (*expr_p);
3971 /* Constants need not be gimplified. */
3981 /* If we require an lvalue, such as for ADDR_EXPR, retain the
3982 CONST_DECL node. Otherwise the decl is replaceable by its
3984 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
3985 if (fallback & fb_lvalue)
3988 *expr_p = DECL_INITIAL (*expr_p);
3992 ret = gimplify_decl_expr (expr_p);
3996 /* FIXME make this a decl. */
4001 ret = gimplify_bind_expr (expr_p, NULL, pre_p);
4005 ret = gimplify_loop_expr (expr_p, pre_p);
4009 ret = gimplify_switch_expr (expr_p, pre_p);
4013 ret = gimplify_exit_expr (expr_p);
4017 /* If the target is not LABEL, then it is a computed jump
4018 and the target needs to be gimplified. */
4019 if (TREE_CODE (GOTO_DESTINATION (*expr_p)) != LABEL_DECL)
4020 ret = gimplify_expr (&GOTO_DESTINATION (*expr_p), pre_p,
4021 NULL, is_gimple_val, fb_rvalue);
4026 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p))
4027 == current_function_decl);
4030 case CASE_LABEL_EXPR:
4031 ret = gimplify_case_label_expr (expr_p);
4035 ret = gimplify_return_expr (*expr_p, pre_p);
4039 /* Don't reduce this in place; let gimplify_init_constructor work its
4040 magic. Buf if we're just elaborating this for side effects, just
4041 gimplify any element that has side-effects. */
4042 if (fallback == fb_none)
4044 for (tmp = CONSTRUCTOR_ELTS (*expr_p); tmp;
4045 tmp = TREE_CHAIN (tmp))
4046 if (TREE_SIDE_EFFECTS (TREE_VALUE (tmp)))
4047 gimplify_expr (&TREE_VALUE (tmp), pre_p, post_p,
4048 gimple_test_f, fallback);
4050 *expr_p = NULL_TREE;
4056 /* The following are special cases that are not handled by the
4057 original GIMPLE grammar. */
4059 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
4062 ret = gimplify_save_expr (expr_p, pre_p, post_p);
4067 enum gimplify_status r0, r1, r2;
4069 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
4070 is_gimple_lvalue, fb_either);
4071 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
4072 is_gimple_val, fb_rvalue);
4073 r2 = gimplify_expr (&TREE_OPERAND (*expr_p, 2), pre_p, post_p,
4074 is_gimple_val, fb_rvalue);
4075 recalculate_side_effects (*expr_p);
4077 ret = MIN (r0, MIN (r1, r2));
4081 case NON_LVALUE_EXPR:
4082 /* This should have been stripped above. */
4086 ret = gimplify_asm_expr (expr_p, pre_p, post_p);
4089 case TRY_FINALLY_EXPR:
4090 case TRY_CATCH_EXPR:
4091 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p, 0));
4092 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p, 1));
4096 case CLEANUP_POINT_EXPR:
4097 ret = gimplify_cleanup_point_expr (expr_p, pre_p);
4101 ret = gimplify_target_expr (expr_p, pre_p, post_p);
4105 gimplify_to_stmt_list (&CATCH_BODY (*expr_p));
4109 case EH_FILTER_EXPR:
4110 gimplify_to_stmt_list (&EH_FILTER_FAILURE (*expr_p));
4116 enum gimplify_status r0, r1;
4117 r0 = gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p), pre_p, post_p,
4118 is_gimple_val, fb_rvalue);
4119 r1 = gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p), pre_p, post_p,
4120 is_gimple_val, fb_rvalue);
4126 /* We get here when taking the address of a label. We mark
4127 the label as "forced"; meaning it can never be removed and
4128 it is a potential target for any computed goto. */
4129 FORCED_LABEL (*expr_p) = 1;
4133 case STATEMENT_LIST:
4134 ret = gimplify_statement_list (expr_p);
4137 case WITH_SIZE_EXPR:
4139 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
4140 post_p == &internal_post ? NULL : post_p,
4141 gimple_test_f, fallback);
4142 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
4143 is_gimple_val, fb_rvalue);
4148 /* ??? If this is a local variable, and it has not been seen in any
4149 outer BIND_EXPR, then it's probably the result of a duplicate
4150 declaration, for which we've already issued an error. It would
4151 be really nice if the front end wouldn't leak these at all.
4152 Currently the only known culprit is C++ destructors, as seen
4153 in g++.old-deja/g++.jason/binding.C. */
4155 if (!TREE_STATIC (tmp) && !DECL_EXTERNAL (tmp)
4156 && decl_function_context (tmp) == current_function_decl
4157 && !DECL_SEEN_IN_BIND_EXPR_P (tmp))
4159 gcc_assert (errorcount || sorrycount);
4168 /* If this is a local variable sized decl, it must be accessed
4169 indirectly. Perform that substitution. */
4170 if (DECL_VALUE_EXPR (tmp))
4172 *expr_p = unshare_expr (DECL_VALUE_EXPR (tmp));
4181 /* Allow callbacks into the gimplifier during optimization. */
4186 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p)))
4188 case tcc_comparison:
4189 /* If this is a comparison of objects of aggregate type,
4190 handle it specially (by converting to a call to
4191 memcmp). It would be nice to only have to do this
4192 for variable-sized objects, but then we'd have to
4193 allow the same nest of reference nodes we allow for
4194 MODIFY_EXPR and that's too complex. */
4195 if (!AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p, 1))))
4197 ret = gimplify_variable_sized_compare (expr_p);
4200 /* If *EXPR_P does not need to be special-cased, handle it
4201 according to its class. */
4203 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
4204 post_p, is_gimple_val, fb_rvalue);
4210 enum gimplify_status r0, r1;
4212 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
4213 post_p, is_gimple_val, fb_rvalue);
4214 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
4215 post_p, is_gimple_val, fb_rvalue);
4221 case tcc_declaration:
4224 goto dont_recalculate;
4227 gcc_assert (TREE_CODE (*expr_p) == TRUTH_AND_EXPR
4228 || TREE_CODE (*expr_p) == TRUTH_OR_EXPR
4229 || TREE_CODE (*expr_p) == TRUTH_XOR_EXPR);
4233 recalculate_side_effects (*expr_p);
4238 /* If we replaced *expr_p, gimplify again. */
4239 if (ret == GS_OK && (*expr_p == NULL || *expr_p == save_expr))
4242 while (ret == GS_OK);
4244 /* If we encountered an error_mark somewhere nested inside, either
4245 stub out the statement or propagate the error back out. */
4246 if (ret == GS_ERROR)
4253 /* This was only valid as a return value from the langhook, which
4254 we handled. Make sure it doesn't escape from any other context. */
4255 gcc_assert (ret != GS_UNHANDLED);
4257 if (fallback == fb_none && *expr_p && !is_gimple_stmt (*expr_p))
4259 /* We aren't looking for a value, and we don't have a valid
4260 statement. If it doesn't have side-effects, throw it away. */
4261 if (!TREE_SIDE_EFFECTS (*expr_p))
4263 else if (!TREE_THIS_VOLATILE (*expr_p))
4265 /* This is probably a _REF that contains something nested that
4266 has side effects. Recurse through the operands to find it. */
4267 enum tree_code code = TREE_CODE (*expr_p);
4272 case REALPART_EXPR: case IMAGPART_EXPR:
4273 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
4274 gimple_test_f, fallback);
4277 case ARRAY_REF: case ARRAY_RANGE_REF:
4278 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
4279 gimple_test_f, fallback);
4280 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
4281 gimple_test_f, fallback);
4285 /* Anything else with side-effects must be converted to
4286 a valid statement before we get here. */
4292 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p)))
4294 /* Historically, the compiler has treated a bare
4295 reference to a volatile lvalue as forcing a load. */
4296 tree tmp = create_tmp_var (TREE_TYPE (*expr_p), "vol");
4297 *expr_p = build (MODIFY_EXPR, TREE_TYPE (tmp), tmp, *expr_p);
4300 /* We can't do anything useful with a volatile reference to
4301 incomplete type, so just throw it away. */
4305 /* If we are gimplifying at the statement level, we're done. Tack
4306 everything together and replace the original statement with the
4308 if (fallback == fb_none || is_statement)
4310 if (internal_pre || internal_post)
4312 append_to_statement_list (*expr_p, &internal_pre);
4313 append_to_statement_list (internal_post, &internal_pre);
4314 annotate_all_with_locus (&internal_pre, input_location);
4315 *expr_p = internal_pre;
4319 else if (TREE_CODE (*expr_p) == STATEMENT_LIST)
4320 annotate_all_with_locus (expr_p, input_location);
4322 annotate_one_with_locus (*expr_p, input_location);
4326 /* Otherwise we're gimplifying a subexpression, so the resulting value is
4329 /* If it's sufficiently simple already, we're done. Unless we are
4330 handling some post-effects internally; if that's the case, we need to
4331 copy into a temp before adding the post-effects to the tree. */
4332 if (!internal_post && (*gimple_test_f) (*expr_p))
4335 /* Otherwise, we need to create a new temporary for the gimplified
4338 /* We can't return an lvalue if we have an internal postqueue. The
4339 object the lvalue refers to would (probably) be modified by the
4340 postqueue; we need to copy the value out first, which means an
4342 if ((fallback & fb_lvalue) && !internal_post
4343 && is_gimple_addressable (*expr_p))
4345 /* An lvalue will do. Take the address of the expression, store it
4346 in a temporary, and replace the expression with an INDIRECT_REF of
4348 tmp = build_fold_addr_expr (*expr_p);
4349 gimplify_expr (&tmp, pre_p, post_p, is_gimple_reg, fb_rvalue);
4350 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (tmp)), tmp);
4352 else if ((fallback & fb_rvalue) && is_gimple_formal_tmp_rhs (*expr_p))
4354 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p)));
4356 /* An rvalue will do. Assign the gimplified expression into a new
4357 temporary TMP and replace the original expression with TMP. */
4359 if (internal_post || (fallback & fb_lvalue))
4360 /* The postqueue might change the value of the expression between
4361 the initialization and use of the temporary, so we can't use a
4362 formal temp. FIXME do we care? */
4363 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
4365 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
4367 if (TREE_CODE (*expr_p) != SSA_NAME)
4368 DECL_GIMPLE_FORMAL_TEMP_P (*expr_p) = 1;
4372 #ifdef ENABLE_CHECKING
4373 if (!(fallback & fb_mayfail))
4375 fprintf (stderr, "gimplification failed:\n");
4376 print_generic_expr (stderr, *expr_p, 0);
4377 debug_tree (*expr_p);
4378 internal_error ("gimplification failed");
4381 gcc_assert (fallback & fb_mayfail);
4382 /* If this is an asm statement, and the user asked for the
4383 impossible, don't die. Fail and let gimplify_asm_expr
4389 /* Make sure the temporary matches our predicate. */
4390 gcc_assert ((*gimple_test_f) (*expr_p));
4394 annotate_all_with_locus (&internal_post, input_location);
4395 append_to_statement_list (internal_post, pre_p);
4399 input_location = saved_location;
4403 /* Look through TYPE for variable-sized objects and gimplify each such
4404 size that we find. Add to LIST_P any statements generated. */
4407 gimplify_type_sizes (tree type, tree *list_p)
4414 /* We first do the main variant, then copy into any other variants. */
4415 type = TYPE_MAIN_VARIANT (type);
4417 /* Avoid infinite recursion. */
4418 if (TYPE_SIZES_GIMPLIFIED (type)
4419 || type == error_mark_node)
4422 TYPE_SIZES_GIMPLIFIED (type) = 1;
4424 switch (TREE_CODE (type))
4431 gimplify_one_sizepos (&TYPE_MIN_VALUE (type), list_p);
4432 gimplify_one_sizepos (&TYPE_MAX_VALUE (type), list_p);
4434 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
4436 TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (type);
4437 TYPE_MAX_VALUE (t) = TYPE_MAX_VALUE (type);
4442 /* These types may not have declarations, so handle them here. */
4443 gimplify_type_sizes (TREE_TYPE (type), list_p);
4444 gimplify_type_sizes (TYPE_DOMAIN (type), list_p);
4449 case QUAL_UNION_TYPE:
4450 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
4451 if (TREE_CODE (field) == FIELD_DECL)
4453 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field), list_p);
4454 gimplify_type_sizes (TREE_TYPE (field), list_p);
4459 case REFERENCE_TYPE:
4460 gimplify_type_sizes (TREE_TYPE (type), list_p);
4467 gimplify_one_sizepos (&TYPE_SIZE (type), list_p);
4468 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type), list_p);
4470 for (t = TYPE_NEXT_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
4472 TYPE_SIZE (t) = TYPE_SIZE (type);
4473 TYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (type);
4474 TYPE_SIZES_GIMPLIFIED (t) = 1;
4478 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
4479 a size or position, has had all of its SAVE_EXPRs evaluated.
4480 We add any required statements to STMT_P. */
4483 gimplify_one_sizepos (tree *expr_p, tree *stmt_p)
4485 /* We don't do anything if the value isn't there, is constant, or contains
4486 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
4487 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
4488 will want to replace it with a new variable, but that will cause problems
4489 if this type is from outside the function. It's OK to have that here. */
4490 if (*expr_p == NULL_TREE || TREE_CONSTANT (*expr_p)
4491 || TREE_CODE (*expr_p) == VAR_DECL
4492 || CONTAINS_PLACEHOLDER_P (*expr_p))
4495 *expr_p = unshare_expr (*expr_p);
4496 gimplify_expr (expr_p, stmt_p, NULL, is_gimple_val, fb_rvalue);
4499 #ifdef ENABLE_CHECKING
4500 /* Compare types A and B for a "close enough" match. */
4503 cpt_same_type (tree a, tree b)
4505 if (lang_hooks.types_compatible_p (a, b))
4508 /* ??? The C++ FE decomposes METHOD_TYPES to FUNCTION_TYPES and doesn't
4509 link them together. This routine is intended to catch type errors
4510 that will affect the optimizers, and the optimizers don't add new
4511 dereferences of function pointers, so ignore it. */
4512 if ((TREE_CODE (a) == FUNCTION_TYPE || TREE_CODE (a) == METHOD_TYPE)
4513 && (TREE_CODE (b) == FUNCTION_TYPE || TREE_CODE (b) == METHOD_TYPE))
4516 /* ??? The C FE pushes type qualifiers after the fact into the type of
4517 the element from the type of the array. See build_unary_op's handling
4518 of ADDR_EXPR. This seems wrong -- if we were going to do this, we
4519 should have done it when creating the variable in the first place.
4520 Alternately, why aren't the two array types made variants? */
4521 if (TREE_CODE (a) == ARRAY_TYPE && TREE_CODE (b) == ARRAY_TYPE)
4522 return cpt_same_type (TREE_TYPE (a), TREE_TYPE (b));
4524 /* And because of those, we have to recurse down through pointers. */
4525 if (POINTER_TYPE_P (a) && POINTER_TYPE_P (b))
4526 return cpt_same_type (TREE_TYPE (a), TREE_TYPE (b));
4531 /* Check for some cases of the front end missing cast expressions.
4532 The type of a dereference should correspond to the pointer type;
4533 similarly the type of an address should match its object. */
4536 check_pointer_types_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
4537 void *data ATTRIBUTE_UNUSED)
4540 tree ptype, otype, dtype;
4542 switch (TREE_CODE (t))
4546 otype = TREE_TYPE (t);
4547 ptype = TREE_TYPE (TREE_OPERAND (t, 0));
4548 dtype = TREE_TYPE (ptype);
4549 gcc_assert (cpt_same_type (otype, dtype));
4553 ptype = TREE_TYPE (t);
4554 otype = TREE_TYPE (TREE_OPERAND (t, 0));
4555 dtype = TREE_TYPE (ptype);
4556 if (!cpt_same_type (otype, dtype))
4558 /* &array is allowed to produce a pointer to the element, rather than
4559 a pointer to the array type. We must allow this in order to
4560 properly represent assigning the address of an array in C into
4561 pointer to the element type. */
4562 gcc_assert (TREE_CODE (otype) == ARRAY_TYPE
4563 && POINTER_TYPE_P (ptype)
4564 && cpt_same_type (TREE_TYPE (otype), dtype));
4578 /* Gimplify the body of statements pointed by BODY_P. FNDECL is the
4579 function decl containing BODY. */
4582 gimplify_body (tree *body_p, tree fndecl, bool do_parms)
4584 location_t saved_location = input_location;
4585 tree body, parm_stmts;
4587 timevar_push (TV_TREE_GIMPLIFY);
4588 push_gimplify_context ();
4590 /* Unshare most shared trees in the body and in that of any nested functions.
4591 It would seem we don't have to do this for nested functions because
4592 they are supposed to be output and then the outer function gimplified
4593 first, but the g++ front end doesn't always do it that way. */
4594 unshare_body (body_p, fndecl);
4595 unvisit_body (body_p, fndecl);
4597 /* Make sure input_location isn't set to something wierd. */
4598 input_location = DECL_SOURCE_LOCATION (fndecl);
4600 /* Resolve callee-copies. This has to be done before processing
4601 the body so that DECL_VALUE_EXPR gets processed correctly. */
4602 parm_stmts = do_parms ? gimplify_parameters () : NULL;
4604 /* Gimplify the function's body. */
4605 gimplify_stmt (body_p);
4609 body = alloc_stmt_list ();
4610 else if (TREE_CODE (body) == STATEMENT_LIST)
4612 tree t = expr_only (*body_p);
4617 /* If there isn't an outer BIND_EXPR, add one. */
4618 if (TREE_CODE (body) != BIND_EXPR)
4620 tree b = build (BIND_EXPR, void_type_node, NULL_TREE,
4621 NULL_TREE, NULL_TREE);
4622 TREE_SIDE_EFFECTS (b) = 1;
4623 append_to_statement_list_force (body, &BIND_EXPR_BODY (b));
4627 /* If we had callee-copies statements, insert them at the beginning
4631 append_to_statement_list_force (BIND_EXPR_BODY (body), &parm_stmts);
4632 BIND_EXPR_BODY (body) = parm_stmts;
4635 /* Unshare again, in case gimplification was sloppy. */
4636 unshare_all_trees (body);
4640 pop_gimplify_context (body);
4642 #ifdef ENABLE_CHECKING
4643 walk_tree (body_p, check_pointer_types_r, NULL, NULL);
4646 timevar_pop (TV_TREE_GIMPLIFY);
4647 input_location = saved_location;
4650 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
4651 node for the function we want to gimplify. */
4654 gimplify_function_tree (tree fndecl)
4658 oldfn = current_function_decl;
4659 current_function_decl = fndecl;
4660 cfun = DECL_STRUCT_FUNCTION (fndecl);
4662 allocate_struct_function (fndecl);
4664 gimplify_body (&DECL_SAVED_TREE (fndecl), fndecl, true);
4666 /* If we're instrumenting function entry/exit, then prepend the call to
4667 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
4668 catch the exit hook. */
4669 /* ??? Add some way to ignore exceptions for this TFE. */
4670 if (flag_instrument_function_entry_exit
4671 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl))
4675 tf = build (TRY_FINALLY_EXPR, void_type_node, NULL, NULL);
4676 TREE_SIDE_EFFECTS (tf) = 1;
4677 x = DECL_SAVED_TREE (fndecl);
4678 append_to_statement_list (x, &TREE_OPERAND (tf, 0));
4679 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_EXIT];
4680 x = build_function_call_expr (x, NULL);
4681 append_to_statement_list (x, &TREE_OPERAND (tf, 1));
4683 bind = build (BIND_EXPR, void_type_node, NULL, NULL, NULL);
4684 TREE_SIDE_EFFECTS (bind) = 1;
4685 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_ENTER];
4686 x = build_function_call_expr (x, NULL);
4687 append_to_statement_list (x, &BIND_EXPR_BODY (bind));
4688 append_to_statement_list (tf, &BIND_EXPR_BODY (bind));
4690 DECL_SAVED_TREE (fndecl) = bind;
4693 current_function_decl = oldfn;
4694 cfun = oldfn ? DECL_STRUCT_FUNCTION (oldfn) : NULL;
4698 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
4699 force the result to be either ssa_name or an invariant, otherwise
4700 just force it to be a rhs expression. If VAR is not NULL, make the
4701 base variable of the final destination be VAR if suitable. */
4704 force_gimple_operand (tree expr, tree *stmts, bool simple, tree var)
4707 enum gimplify_status ret;
4708 gimple_predicate gimple_test_f;
4712 if (is_gimple_val (expr))
4715 gimple_test_f = simple ? is_gimple_val : is_gimple_reg_rhs;
4717 push_gimplify_context ();
4718 gimplify_ctxp->into_ssa = in_ssa_p;
4721 expr = build (MODIFY_EXPR, TREE_TYPE (var), var, expr);
4723 ret = gimplify_expr (&expr, stmts, NULL,
4724 gimple_test_f, fb_rvalue);
4725 gcc_assert (ret != GS_ERROR);
4727 if (referenced_vars)
4729 for (t = gimplify_ctxp->temps; t ; t = TREE_CHAIN (t))
4730 add_referenced_tmp_var (t);
4733 pop_gimplify_context (NULL);
4738 /* Invokes force_gimple_operand for EXPR with parameters SIMPLE_P and VAR. If
4739 some statements are produced, emits them before BSI. */
4742 force_gimple_operand_bsi (block_stmt_iterator *bsi, tree expr,
4743 bool simple_p, tree var)
4747 expr = force_gimple_operand (expr, &stmts, simple_p, var);
4749 bsi_insert_before (bsi, stmts, BSI_SAME_STMT);
4754 #include "gt-gimplify.h"