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 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"
32 #include "tree-gimple.h"
33 #include "tree-inline.h"
34 #include "diagnostic.h"
35 #include "langhooks.h"
36 #include "langhooks-def.h"
37 #include "tree-flow.h"
50 static struct gimplify_ctx
52 tree current_bind_expr;
55 tree conditional_cleanups;
59 varray_type case_labels;
60 /* The formal temporary table. Should this be persistent? */
65 /* Formal (expression) temporary table handling: Multiple occurrences of
66 the same scalar expression are evaluated into the same temporary. */
68 typedef struct gimple_temp_hash_elt
71 tree temp; /* Value */
74 /* Forward declarations. */
75 static hashval_t gimple_tree_hash (const void *);
76 static int gimple_tree_eq (const void *, const void *);
77 static bool gimple_conditional_context (void);
78 static void gimple_push_condition (void);
79 static void gimple_pop_condition (tree *);
80 static void append_to_statement_list_1 (tree, tree *, bool);
81 static inline void remove_suffix (char *, int);
82 static inline tree create_tmp_from_val (tree);
83 static tree lookup_tmp_var (tree, bool);
84 static tree internal_get_tmp_var (tree, tree *, tree *, bool);
85 static bool should_carry_locus_p (tree);
86 static tree mostly_copy_tree_r (tree *, int *, void *);
87 static tree mark_decls_volatile_r (tree *, int *, void *);
88 static tree copy_if_shared_r (tree *, int *, void *);
89 static tree unmark_visited_r (tree *, int *, void *);
90 static void unshare_body (tree *, tree);
91 static void unvisit_body (tree *, tree);
92 static void build_stack_save_restore (tree *, tree *);
93 static enum gimplify_status gimplify_bind_expr (tree *, tree, tree *);
94 static enum gimplify_status gimplify_return_expr (tree, tree *);
95 static enum gimplify_status gimplify_loop_expr (tree *, tree *);
96 static int compare_case_labels (const void *, const void *);
97 static enum gimplify_status gimplify_switch_expr (tree *, tree *);
98 static enum gimplify_status gimplify_case_label_expr (tree *);
99 static enum gimplify_status gimplify_labeled_block_expr (tree *);
100 static enum gimplify_status gimplify_exit_block_expr (tree *);
101 static enum gimplify_status gimplify_exit_expr (tree *);
102 static enum gimplify_status gimplify_init_constructor (tree *, tree *, tree *,
104 static void canonicalize_component_ref (tree *);
105 static void canonicalize_addr_expr (tree *);
106 static enum gimplify_status gimplify_conversion (tree *);
107 static enum gimplify_status gimplify_minimax_expr (tree *, tree *, tree *);
108 static enum gimplify_status gimplify_array_ref_to_plus (tree *, tree *,
110 static tree build_addr_expr_with_type (tree, tree);
111 static tree build_addr_expr (tree);
112 static enum gimplify_status gimplify_compound_lval (tree *, tree *, tree *,
114 static enum gimplify_status gimplify_self_mod_expr (tree *, tree *, tree *,
116 static enum gimplify_status gimplify_call_expr (tree *, tree *,
118 static tree shortcut_cond_r (tree, tree *, tree *);
119 static tree shortcut_cond_expr (tree);
120 static tree gimple_boolify (tree);
121 static enum gimplify_status gimplify_cond_expr (tree *, tree *, tree);
122 static enum gimplify_status gimplify_modify_expr (tree *, tree *, tree *,
124 static enum gimplify_status gimplify_modify_expr_rhs (tree *, tree *, tree *,
125 tree *, tree *, bool);
126 static enum gimplify_status gimplify_variable_sized_compare (tree *);
127 static enum gimplify_status gimplify_boolean_expr (tree *);
128 static enum gimplify_status gimplify_compound_expr (tree *, tree *, bool);
129 static enum gimplify_status gimplify_statement_list (tree *);
130 static enum gimplify_status gimplify_save_expr (tree *, tree *, tree *);
131 static enum gimplify_status gimplify_addr_expr (tree *, tree *, tree *);
132 static enum gimplify_status gimplify_asm_expr (tree *, tree *, tree *);
133 static enum gimplify_status gimplify_cleanup_point_expr (tree *, tree *);
134 static void gimple_push_cleanup (tree, tree, tree *);
135 static enum gimplify_status gimplify_target_expr (tree *, tree *, tree *);
136 #ifdef ENABLE_CHECKING
137 static bool cpt_same_type (tree, tree);
138 static tree check_pointer_types_r (tree *, int *, void *);
141 /* Return a hash value for a formal temporary table entry. */
144 gimple_tree_hash (const void *p)
146 tree t = ((const elt_t *)p)->val;
147 return iterative_hash_expr (t, 0);
150 /* Compare two formal temporary table entries. */
153 gimple_tree_eq (const void *p1, const void *p2)
155 tree t1 = ((const elt_t *)p1)->val;
156 tree t2 = ((const elt_t *)p2)->val;
157 enum tree_code code = TREE_CODE (t1);
159 if (TREE_CODE (t2) != code
160 || TREE_TYPE (t1) != TREE_TYPE (t2))
163 if (!operand_equal_p (t1, t2, 0))
166 /* Only allow them to compare equal if they also hash equal; otherwise
167 results are nondeterminate, and we fail bootstrap comparison. */
168 if (gimple_tree_hash (p1) != gimple_tree_hash (p2))
174 /* Set up a context for the gimplifier. */
177 push_gimplify_context (void)
182 = (struct gimplify_ctx *) xcalloc (1, sizeof (struct gimplify_ctx));
183 gimplify_ctxp->temp_htab
184 = htab_create (1000, gimple_tree_hash, gimple_tree_eq, free);
187 /* Tear down a context for the gimplifier. If BODY is non-null, then
188 put the temporaries into the outer BIND_EXPR. Otherwise, put them
189 in the unexpanded_var_list. */
192 pop_gimplify_context (tree body)
194 if (!gimplify_ctxp || gimplify_ctxp->current_bind_expr)
198 declare_tmp_vars (gimplify_ctxp->temps, body);
200 record_vars (gimplify_ctxp->temps);
204 fprintf (stderr, " collisions: %f ",
205 htab_collisions (gimplify_ctxp->temp_htab));
208 htab_delete (gimplify_ctxp->temp_htab);
209 free (gimplify_ctxp);
210 gimplify_ctxp = NULL;
214 gimple_push_bind_expr (tree bind)
216 TREE_CHAIN (bind) = gimplify_ctxp->current_bind_expr;
217 gimplify_ctxp->current_bind_expr = bind;
221 gimple_pop_bind_expr (void)
223 gimplify_ctxp->current_bind_expr
224 = TREE_CHAIN (gimplify_ctxp->current_bind_expr);
228 gimple_current_bind_expr (void)
230 return gimplify_ctxp->current_bind_expr;
233 /* Returns true iff there is a COND_EXPR between us and the innermost
234 CLEANUP_POINT_EXPR. This info is used by gimple_push_cleanup. */
237 gimple_conditional_context (void)
239 return gimplify_ctxp->conditions > 0;
242 /* Note that we've entered a COND_EXPR. */
245 gimple_push_condition (void)
247 ++(gimplify_ctxp->conditions);
250 /* Note that we've left a COND_EXPR. If we're back at unconditional scope
251 now, add any conditional cleanups we've seen to the prequeue. */
254 gimple_pop_condition (tree *pre_p)
256 int conds = --(gimplify_ctxp->conditions);
259 append_to_statement_list (gimplify_ctxp->conditional_cleanups, pre_p);
260 gimplify_ctxp->conditional_cleanups = NULL_TREE;
266 /* A subroutine of append_to_statement_list{,_force}. */
269 append_to_statement_list_1 (tree t, tree *list_p, bool side_effects)
272 tree_stmt_iterator i;
279 if (t && TREE_CODE (t) == STATEMENT_LIST)
284 *list_p = list = alloc_stmt_list ();
288 tsi_link_after (&i, t, TSI_CONTINUE_LINKING);
291 /* Add T to the end of the list container pointed by LIST_P.
292 If T is an expression with no effects, it is ignored. */
295 append_to_statement_list (tree t, tree *list_p)
297 append_to_statement_list_1 (t, list_p, t ? TREE_SIDE_EFFECTS (t) : false);
300 /* Similar, but the statement is always added, regardless of side effects. */
303 append_to_statement_list_force (tree t, tree *list_p)
305 append_to_statement_list_1 (t, list_p, t != NULL);
308 /* Both gimplify the statement T and append it to LIST_P. */
311 gimplify_and_add (tree t, tree *list_p)
314 append_to_statement_list (t, list_p);
317 /* Strip off a legitimate source ending from the input string NAME of
318 length LEN. Rather than having to know the names used by all of
319 our front ends, we strip off an ending of a period followed by
320 up to five characters. (Java uses ".class".) */
323 remove_suffix (char *name, int len)
327 for (i = 2; i < 8 && len > i; i++)
329 if (name[len - i] == '.')
331 name[len - i] = '\0';
337 /* Create a nameless artificial label and put it in the current function
338 context. Returns the newly created label. */
341 create_artificial_label (void)
343 tree lab = build_decl (LABEL_DECL, NULL_TREE, void_type_node);
344 DECL_ARTIFICIAL (lab) = 1;
345 DECL_CONTEXT (lab) = current_function_decl;
349 /* Create a new temporary name with PREFIX. Returns an identifier. */
351 static GTY(()) unsigned int tmp_var_id_num;
354 create_tmp_var_name (const char *prefix)
360 char *preftmp = ASTRDUP (prefix);
361 remove_suffix (preftmp, strlen (preftmp));
365 ASM_FORMAT_PRIVATE_NAME (tmp_name, prefix ? prefix : "T", tmp_var_id_num++);
366 return get_identifier (tmp_name);
370 /* Create a new temporary variable declaration of type TYPE.
371 Does NOT push it into the current binding. */
374 create_tmp_var_raw (tree type, const char *prefix)
379 /* Make the type of the variable writable. */
380 new_type = build_type_variant (type, 0, 0);
381 TYPE_ATTRIBUTES (new_type) = TYPE_ATTRIBUTES (type);
383 tmp_var = build_decl (VAR_DECL, create_tmp_var_name (prefix), type);
385 /* The variable was declared by the compiler. */
386 DECL_ARTIFICIAL (tmp_var) = 1;
387 /* And we don't want debug info for it. */
388 DECL_IGNORED_P (tmp_var) = 1;
390 /* Make the variable writable. */
391 TREE_READONLY (tmp_var) = 0;
393 DECL_EXTERNAL (tmp_var) = 0;
394 TREE_STATIC (tmp_var) = 0;
395 TREE_USED (tmp_var) = 1;
400 /* Create a new temporary variable declaration of type TYPE. DOES push the
401 variable into the current binding. Further, assume that this is called
402 only from gimplification or optimization, at which point the creation of
403 certain types are bugs. */
406 create_tmp_var (tree type, const char *prefix)
410 #if defined ENABLE_CHECKING
411 /* We don't allow types that are addressable (meaning we can't make copies),
412 incomplete, or of variable size. */
413 if (TREE_ADDRESSABLE (type)
414 || !COMPLETE_TYPE_P (type)
415 || TREE_CODE (TYPE_SIZE_UNIT (type)) != INTEGER_CST)
419 tmp_var = create_tmp_var_raw (type, prefix);
420 gimple_add_tmp_var (tmp_var);
424 /* Given a tree, try to return a useful variable name that we can use
425 to prefix a temporary that is being assigned the value of the tree.
426 I.E. given <temp> = &A, return A. */
434 STRIP_NOPS (stripped_decl);
435 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
436 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
439 switch (TREE_CODE (stripped_decl))
442 return get_name (TREE_OPERAND (stripped_decl, 0));
450 /* Create a temporary with a name derived from VAL. Subroutine of
451 lookup_tmp_var; nobody else should call this function. */
454 create_tmp_from_val (tree val)
456 return create_tmp_var (TREE_TYPE (val), get_name (val));
459 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
460 an existing expression temporary. */
463 lookup_tmp_var (tree val, bool is_formal)
465 if (!is_formal || TREE_SIDE_EFFECTS (val))
466 return create_tmp_from_val (val);
473 slot = htab_find_slot (gimplify_ctxp->temp_htab, (void *)&elt, INSERT);
476 elt_p = xmalloc (sizeof (*elt_p));
478 elt_p->temp = create_tmp_from_val (val);
479 *slot = (void *)elt_p;
482 elt_p = (elt_t *) *slot;
488 /* Returns a formal temporary variable initialized with VAL. PRE_P is as
489 in gimplify_expr. Only use this function if:
491 1) The value of the unfactored expression represented by VAL will not
492 change between the initialization and use of the temporary, and
493 2) The temporary will not be otherwise modified.
495 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
496 and #2 means it is inappropriate for && temps.
498 For other cases, use get_initialized_tmp_var instead. */
501 internal_get_tmp_var (tree val, tree *pre_p, tree *post_p, bool is_formal)
506 gimplify_expr (&val, pre_p, post_p, is_gimple_rhs, fb_rvalue);
508 t = lookup_tmp_var (val, is_formal);
510 mod = build (MODIFY_EXPR, TREE_TYPE (t), t, val);
512 class = TREE_CODE_CLASS (TREE_CODE (val));
513 if (EXPR_LOCUS (val))
514 SET_EXPR_LOCUS (mod, EXPR_LOCUS (val));
516 annotate_with_locus (mod, input_location);
517 /* gimplify_modify_expr might want to reduce this further. */
518 gimplify_stmt (&mod);
519 append_to_statement_list (mod, pre_p);
525 get_formal_tmp_var (tree val, tree *pre_p)
527 return internal_get_tmp_var (val, pre_p, NULL, true);
530 /* Returns a temporary variable initialized with VAL. PRE_P and POST_P
531 are as in gimplify_expr. */
534 get_initialized_tmp_var (tree val, tree *pre_p, tree *post_p)
536 return internal_get_tmp_var (val, pre_p, post_p, false);
539 /* Returns true if T is a GIMPLE temporary variable, false otherwise. */
542 is_gimple_tmp_var (tree t)
544 /* FIXME this could trigger for other local artificials, too. */
545 return (TREE_CODE (t) == VAR_DECL && DECL_ARTIFICIAL (t)
546 && !TREE_STATIC (t) && !DECL_EXTERNAL (t));
549 /* Declares all the variables in VARS in SCOPE. Returns the last
550 DECL_STMT emitted. */
553 declare_tmp_vars (tree vars, tree scope)
560 /* C99 mode puts the default 'return 0;' for main() outside the outer
561 braces. So drill down until we find an actual scope. */
562 while (TREE_CODE (scope) == COMPOUND_EXPR)
563 scope = TREE_OPERAND (scope, 0);
565 if (TREE_CODE (scope) != BIND_EXPR)
568 temps = nreverse (last);
569 TREE_CHAIN (last) = BIND_EXPR_VARS (scope);
570 BIND_EXPR_VARS (scope) = temps;
572 /* We don't add the temps to the block for this BIND_EXPR, as we're
573 not interested in debugging info for them. */
578 gimple_add_tmp_var (tree tmp)
580 if (TREE_CHAIN (tmp) || tmp->decl.seen_in_bind_expr)
583 DECL_CONTEXT (tmp) = current_function_decl;
584 tmp->decl.seen_in_bind_expr = 1;
588 TREE_CHAIN (tmp) = gimplify_ctxp->temps;
589 gimplify_ctxp->temps = tmp;
594 declare_tmp_vars (tmp, DECL_SAVED_TREE (current_function_decl));
597 /* Determines whether to assign a locus to the statement STMT. */
600 should_carry_locus_p (tree stmt)
602 /* Don't emit a line note for a label. We particularly don't want to
603 emit one for the break label, since it doesn't actually correspond
604 to the beginning of the loop/switch. */
605 if (TREE_CODE (stmt) == LABEL_EXPR)
608 /* Do not annotate empty statements, since it confuses gcov. */
609 if (!TREE_SIDE_EFFECTS (stmt))
616 annotate_one_with_locus (tree t, location_t locus)
618 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (t)))
619 && ! EXPR_HAS_LOCATION (t)
620 && should_carry_locus_p (t))
621 annotate_with_locus (t, locus);
625 annotate_all_with_locus (tree *stmt_p, location_t locus)
627 tree_stmt_iterator i;
632 for (i = tsi_start (*stmt_p); !tsi_end_p (i); tsi_next (&i))
634 tree t = tsi_stmt (i);
636 #ifdef ENABLE_CHECKING
637 /* Assuming we've already been gimplified, we shouldn't
638 see nested chaining constructs anymore. */
639 if (TREE_CODE (t) == STATEMENT_LIST
640 || TREE_CODE (t) == COMPOUND_EXPR)
644 annotate_one_with_locus (t, locus);
648 /* Similar to copy_tree_r() but do not copy SAVE_EXPR or TARGET_EXPR nodes.
649 These nodes model computations that should only be done once. If we
650 were to unshare something like SAVE_EXPR(i++), the gimplification
651 process would create wrong code. */
654 mostly_copy_tree_r (tree *tp, int *walk_subtrees, void *data)
656 enum tree_code code = TREE_CODE (*tp);
657 /* Don't unshare types, decls, constants and SAVE_EXPR nodes. */
658 if (TREE_CODE_CLASS (code) == 't'
659 || TREE_CODE_CLASS (code) == 'd'
660 || TREE_CODE_CLASS (code) == 'c'
661 || code == SAVE_EXPR || code == TARGET_EXPR
662 /* We can't do anything sensible with a BLOCK used as an expression,
663 but we also can't abort when we see it because of non-expression
664 uses. So just avert our eyes and cross our fingers. Silly Java. */
667 else if (code == BIND_EXPR)
670 copy_tree_r (tp, walk_subtrees, data);
675 /* Mark all the _DECL nodes under *TP as volatile. FIXME: This must die
676 after VA_ARG_EXPRs are properly lowered. */
679 mark_decls_volatile_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
680 void *data ATTRIBUTE_UNUSED)
683 TREE_THIS_VOLATILE (*tp) = 1;
689 /* Callback for walk_tree to unshare most of the shared trees rooted at
690 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
691 then *TP is deep copied by calling copy_tree_r.
693 This unshares the same trees as copy_tree_r with the exception of
694 SAVE_EXPR nodes. These nodes model computations that should only be
695 done once. If we were to unshare something like SAVE_EXPR(i++), the
696 gimplification process would create wrong code. */
699 copy_if_shared_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
700 void *data ATTRIBUTE_UNUSED)
703 enum tree_code code = TREE_CODE (t);
705 /* Skip types, decls, and constants. But we do want to look at their
706 types and the bounds of types. Mark them as visited so we properly
707 unmark their subtrees on the unmark pass. If we've already seen them,
708 don't look down further. */
709 if (TREE_CODE_CLASS (code) == 't'
710 || TREE_CODE_CLASS (code) == 'd'
711 || TREE_CODE_CLASS (code) == 'c')
713 if (TREE_VISITED (t))
716 TREE_VISITED (t) = 1;
719 /* Special-case BIND_EXPR. We should never be copying these, therefore
720 we can omit examining BIND_EXPR_VARS. Which also avoids problems with
721 double processing of the DECL_INITIAL, which could be seen via both
722 the BIND_EXPR_VARS and a DECL_STMT. */
723 else if (code == BIND_EXPR)
725 if (TREE_VISITED (t))
727 TREE_VISITED (t) = 1;
729 walk_tree (&BIND_EXPR_BODY (t), copy_if_shared_r, NULL, NULL);
732 /* If this node has been visited already, unshare it and don't look
734 else if (TREE_VISITED (t))
736 walk_tree (tp, mostly_copy_tree_r, NULL, NULL);
740 /* Otherwise, mark the tree as visited and keep looking. */
743 TREE_VISITED (t) = 1;
744 if (TREE_CODE (*tp) == VA_ARG_EXPR
745 && targetm.calls.gimplify_va_arg_expr == NULL)
747 /* Mark any _DECL inside the operand as volatile to avoid
748 the optimizers messing around with it. We have to do this
749 early, otherwise we might mark a variable as volatile
750 after we gimplify other statements that use the variable
751 assuming it's not volatile. */
753 /* FIXME once most targets define the above hook, this should
754 go away (perhaps along with the #include "target.h"). */
755 walk_tree (&TREE_OPERAND (*tp, 0), mark_decls_volatile_r,
764 unmark_visited_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
765 void *data ATTRIBUTE_UNUSED)
767 if (TREE_VISITED (*tp))
768 TREE_VISITED (*tp) = 0;
775 /* Unshare all the trees in BODY_P, a pointer to the body of FNDECL, and the
776 bodies of any nested functions. */
779 unshare_body (tree *body_p, tree fndecl)
781 struct cgraph_node *cgn = cgraph_node (fndecl);
783 walk_tree (body_p, copy_if_shared_r, NULL, NULL);
784 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
785 unshare_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
788 /* Likewise, but mark all trees as not visited. */
791 unvisit_body (tree *body_p, tree fndecl)
793 struct cgraph_node *cgn = cgraph_node (fndecl);
795 walk_tree (body_p, unmark_visited_r, NULL, NULL);
796 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
797 unvisit_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
800 /* Unshare T and all the trees reached from T via TREE_CHAIN. */
803 unshare_all_trees (tree t)
805 walk_tree (&t, copy_if_shared_r, NULL, NULL);
806 walk_tree (&t, unmark_visited_r, NULL, NULL);
809 /* Unconditionally make an unshared copy of EXPR. This is used when using
810 stored expressions which span multiple functions, such as BINFO_VTABLE,
811 as the normal unsharing process can't tell that they're shared. */
814 unshare_expr (tree expr)
816 walk_tree (&expr, mostly_copy_tree_r, NULL, NULL);
820 /* A terser interface for building a representation of a exception
824 gimple_build_eh_filter (tree body, tree allowed, tree failure)
828 /* FIXME should the allowed types go in TREE_TYPE? */
829 t = build (EH_FILTER_EXPR, void_type_node, allowed, NULL_TREE);
830 append_to_statement_list (failure, &EH_FILTER_FAILURE (t));
832 t = build (TRY_CATCH_EXPR, void_type_node, NULL_TREE, t);
833 append_to_statement_list (body, &TREE_OPERAND (t, 0));
839 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
840 contain statements and have a value. Assign its value to a temporary
841 and give it void_type_node. Returns the temporary, or NULL_TREE if
842 WRAPPER was already void. */
845 voidify_wrapper_expr (tree wrapper, tree temp)
847 if (!VOID_TYPE_P (TREE_TYPE (wrapper)))
849 tree *p, sub = wrapper;
852 /* Set p to point to the body of the wrapper. */
853 switch (TREE_CODE (sub))
856 /* For a BIND_EXPR, the body is operand 1. */
857 p = &BIND_EXPR_BODY (sub);
861 p = &TREE_OPERAND (sub, 0);
865 /* Advance to the last statement. Set all container types to void. */
866 if (TREE_CODE (*p) == STATEMENT_LIST)
868 tree_stmt_iterator i = tsi_last (*p);
869 p = tsi_end_p (i) ? NULL : tsi_stmt_ptr (i);
873 for (; TREE_CODE (*p) == COMPOUND_EXPR; p = &TREE_OPERAND (*p, 1))
875 TREE_SIDE_EFFECTS (*p) = 1;
876 TREE_TYPE (*p) = void_type_node;
880 if (p == NULL || IS_EMPTY_STMT (*p))
882 /* Look through exception handling. */
883 else if (TREE_CODE (*p) == TRY_FINALLY_EXPR
884 || TREE_CODE (*p) == TRY_CATCH_EXPR)
889 /* The C++ frontend already did this for us. */
890 else if (TREE_CODE (*p) == INIT_EXPR)
891 temp = TREE_OPERAND (*p, 0);
892 /* If we're returning a dereference, move the dereference
893 outside the wrapper. */
894 else if (TREE_CODE (*p) == INDIRECT_REF)
896 tree ptr = TREE_OPERAND (*p, 0);
897 temp = create_tmp_var (TREE_TYPE (ptr), "retval");
898 *p = build (MODIFY_EXPR, TREE_TYPE (ptr), temp, ptr);
899 temp = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (temp)), temp);
900 /* If this is a BIND_EXPR for a const inline function, it might not
901 have TREE_SIDE_EFFECTS set. That is no longer accurate. */
902 TREE_SIDE_EFFECTS (wrapper) = 1;
907 temp = create_tmp_var (TREE_TYPE (wrapper), "retval");
908 *p = build (MODIFY_EXPR, TREE_TYPE (temp), temp, *p);
909 TREE_SIDE_EFFECTS (wrapper) = 1;
912 TREE_TYPE (wrapper) = void_type_node;
919 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
920 a temporary through which they communicate. */
923 build_stack_save_restore (tree *save, tree *restore)
925 tree save_call, tmp_var;
928 build_function_call_expr (implicit_built_in_decls[BUILT_IN_STACK_SAVE],
930 tmp_var = create_tmp_var (ptr_type_node, "saved_stack");
932 *save = build (MODIFY_EXPR, ptr_type_node, tmp_var, save_call);
934 build_function_call_expr (implicit_built_in_decls[BUILT_IN_STACK_RESTORE],
935 tree_cons (NULL_TREE, tmp_var, NULL_TREE));
938 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
940 static enum gimplify_status
941 gimplify_bind_expr (tree *expr_p, tree temp, tree *pre_p)
943 tree bind_expr = *expr_p;
944 bool old_save_stack = gimplify_ctxp->save_stack;
947 temp = voidify_wrapper_expr (bind_expr, temp);
949 /* Mark variables seen in this bind expr. */
950 for (t = BIND_EXPR_VARS (bind_expr); t ; t = TREE_CHAIN (t))
951 t->decl.seen_in_bind_expr = 1;
953 gimple_push_bind_expr (bind_expr);
954 gimplify_ctxp->save_stack = false;
956 gimplify_to_stmt_list (&BIND_EXPR_BODY (bind_expr));
958 if (gimplify_ctxp->save_stack)
960 tree stack_save, stack_restore;
962 /* Save stack on entry and restore it on exit. Add a try_finally
963 block to achieve this. Note that mudflap depends on the
964 format of the emitted code: see mx_register_decls(). */
965 build_stack_save_restore (&stack_save, &stack_restore);
967 t = build (TRY_FINALLY_EXPR, void_type_node,
968 BIND_EXPR_BODY (bind_expr), NULL_TREE);
969 append_to_statement_list (stack_restore, &TREE_OPERAND (t, 1));
971 BIND_EXPR_BODY (bind_expr) = NULL_TREE;
972 append_to_statement_list (stack_save, &BIND_EXPR_BODY (bind_expr));
973 append_to_statement_list (t, &BIND_EXPR_BODY (bind_expr));
976 gimplify_ctxp->save_stack = old_save_stack;
977 gimple_pop_bind_expr ();
982 append_to_statement_list (bind_expr, pre_p);
989 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
990 GIMPLE value, it is assigned to a new temporary and the statement is
991 re-written to return the temporary.
993 PRE_P points to the list where side effects that must happen before
994 STMT should be stored. */
996 static enum gimplify_status
997 gimplify_return_expr (tree stmt, tree *pre_p)
999 tree ret_expr = TREE_OPERAND (stmt, 0);
1000 tree result_decl, result;
1002 if (!ret_expr || TREE_CODE (ret_expr) == RESULT_DECL)
1005 if (ret_expr == error_mark_node)
1008 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
1009 result_decl = NULL_TREE;
1012 result_decl = TREE_OPERAND (ret_expr, 0);
1013 #ifdef ENABLE_CHECKING
1014 if ((TREE_CODE (ret_expr) != MODIFY_EXPR
1015 && TREE_CODE (ret_expr) != INIT_EXPR)
1016 || TREE_CODE (result_decl) != RESULT_DECL)
1021 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1022 Recall that aggregate_value_p is FALSE for any aggregate type that is
1023 returned in registers. If we're returning values in registers, then
1024 we don't want to extend the lifetime of the RESULT_DECL, particularly
1025 across another call. In addition, for those aggregates for which
1026 hard_function_value generates a PARALLEL, we'll abort during normal
1027 expansion of structure assignments; there's special code in expand_return
1028 to handle this case that does not exist in expand_expr. */
1030 || aggregate_value_p (result_decl, TREE_TYPE (current_function_decl)))
1031 result = result_decl;
1032 else if (gimplify_ctxp->return_temp)
1033 result = gimplify_ctxp->return_temp;
1036 result = create_tmp_var (TREE_TYPE (result_decl), NULL);
1038 /* ??? With complex control flow (usually involving abnormal edges),
1039 we can wind up warning about an uninitialized value for this. Due
1040 to how this variable is constructed and initialized, this is never
1041 true. Give up and never warn. */
1042 TREE_NO_WARNING (result) = 1;
1044 gimplify_ctxp->return_temp = result;
1047 /* Smash the lhs of the MODIFY_EXPR to the temporary we plan to use.
1048 Then gimplify the whole thing. */
1049 if (result != result_decl)
1050 TREE_OPERAND (ret_expr, 0) = result;
1051 gimplify_stmt (&TREE_OPERAND (stmt, 0));
1052 append_to_statement_list (TREE_OPERAND (stmt, 0), pre_p);
1054 /* If we didn't use a temporary, then the result is just the result_decl.
1055 Otherwise we need a simple copy. This should already be gimple. */
1056 if (result == result_decl)
1059 ret_expr = build (MODIFY_EXPR, TREE_TYPE (result), result_decl, result);
1060 TREE_OPERAND (stmt, 0) = ret_expr;
1065 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1066 and replacing the LOOP_EXPR with goto, but if the loop contains an
1067 EXIT_EXPR, we need to append a label for it to jump to. */
1069 static enum gimplify_status
1070 gimplify_loop_expr (tree *expr_p, tree *pre_p)
1072 tree saved_label = gimplify_ctxp->exit_label;
1073 tree start_label = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
1074 tree jump_stmt = build_and_jump (&LABEL_EXPR_LABEL (start_label));
1076 append_to_statement_list (start_label, pre_p);
1078 gimplify_ctxp->exit_label = NULL_TREE;
1080 gimplify_stmt (&LOOP_EXPR_BODY (*expr_p));
1081 append_to_statement_list (LOOP_EXPR_BODY (*expr_p), pre_p);
1083 if (gimplify_ctxp->exit_label)
1085 append_to_statement_list (jump_stmt, pre_p);
1086 *expr_p = build1 (LABEL_EXPR, void_type_node, gimplify_ctxp->exit_label);
1089 *expr_p = jump_stmt;
1091 gimplify_ctxp->exit_label = saved_label;
1096 /* Compare two case labels. Because the front end should already have
1097 made sure that case ranges do not overlap, it is enough to only compare
1098 the CASE_LOW values of each case label. */
1101 compare_case_labels (const void *p1, const void *p2)
1103 tree case1 = *(tree *)p1;
1104 tree case2 = *(tree *)p2;
1106 return tree_int_cst_compare (CASE_LOW (case1), CASE_LOW (case2));
1109 /* Sort the case labels in LABEL_VEC in ascending order. */
1112 sort_case_labels (tree label_vec)
1114 size_t len = TREE_VEC_LENGTH (label_vec);
1115 tree default_case = TREE_VEC_ELT (label_vec, len - 1);
1117 if (CASE_LOW (default_case))
1121 /* The last label in the vector should be the default case
1123 for (i = 0; i < len; ++i)
1125 tree t = TREE_VEC_ELT (label_vec, i);
1129 TREE_VEC_ELT (label_vec, i) = TREE_VEC_ELT (label_vec, len - 1);
1130 TREE_VEC_ELT (label_vec, len - 1) = default_case;
1136 qsort (&TREE_VEC_ELT (label_vec, 0), len - 1, sizeof (tree),
1137 compare_case_labels);
1140 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1143 static enum gimplify_status
1144 gimplify_switch_expr (tree *expr_p, tree *pre_p)
1146 tree switch_expr = *expr_p;
1147 enum gimplify_status ret;
1149 ret = gimplify_expr (&SWITCH_COND (switch_expr), pre_p, NULL,
1150 is_gimple_val, fb_rvalue);
1152 if (SWITCH_BODY (switch_expr))
1154 varray_type labels, saved_labels;
1155 tree label_vec, default_case = NULL_TREE;
1158 /* If someone can be bothered to fill in the labels, they can
1159 be bothered to null out the body too. */
1160 if (SWITCH_LABELS (switch_expr))
1163 saved_labels = gimplify_ctxp->case_labels;
1164 VARRAY_TREE_INIT (gimplify_ctxp->case_labels, 8, "case_labels");
1166 gimplify_to_stmt_list (&SWITCH_BODY (switch_expr));
1168 labels = gimplify_ctxp->case_labels;
1169 gimplify_ctxp->case_labels = saved_labels;
1171 len = VARRAY_ACTIVE_SIZE (labels);
1173 for (i = 0; i < len; ++i)
1175 tree t = VARRAY_TREE (labels, i);
1178 /* The default case must be the last label in the list. */
1180 VARRAY_TREE (labels, i) = VARRAY_TREE (labels, len - 1);
1186 label_vec = make_tree_vec (len + 1);
1187 SWITCH_LABELS (*expr_p) = label_vec;
1188 append_to_statement_list (switch_expr, pre_p);
1192 /* If the switch has no default label, add one, so that we jump
1193 around the switch body. */
1194 default_case = build (CASE_LABEL_EXPR, void_type_node, NULL_TREE,
1195 NULL_TREE, create_artificial_label ());
1196 append_to_statement_list (SWITCH_BODY (switch_expr), pre_p);
1197 *expr_p = build (LABEL_EXPR, void_type_node,
1198 CASE_LABEL (default_case));
1201 *expr_p = SWITCH_BODY (switch_expr);
1203 for (i = 0; i < len; ++i)
1204 TREE_VEC_ELT (label_vec, i) = VARRAY_TREE (labels, i);
1205 TREE_VEC_ELT (label_vec, len) = default_case;
1207 sort_case_labels (label_vec);
1209 SWITCH_BODY (switch_expr) = NULL;
1211 else if (!SWITCH_LABELS (switch_expr))
1217 static enum gimplify_status
1218 gimplify_case_label_expr (tree *expr_p)
1220 tree expr = *expr_p;
1221 if (gimplify_ctxp->case_labels)
1222 VARRAY_PUSH_TREE (gimplify_ctxp->case_labels, expr);
1225 *expr_p = build (LABEL_EXPR, void_type_node, CASE_LABEL (expr));
1229 /* Gimplify a LABELED_BLOCK_EXPR into a LABEL_EXPR following
1230 a (possibly empty) body. */
1232 static enum gimplify_status
1233 gimplify_labeled_block_expr (tree *expr_p)
1235 tree body = LABELED_BLOCK_BODY (*expr_p);
1236 tree label = LABELED_BLOCK_LABEL (*expr_p);
1239 DECL_CONTEXT (label) = current_function_decl;
1240 t = build (LABEL_EXPR, void_type_node, label);
1241 if (body != NULL_TREE)
1242 t = build (COMPOUND_EXPR, void_type_node, body, t);
1248 /* Gimplify a EXIT_BLOCK_EXPR into a GOTO_EXPR. */
1250 static enum gimplify_status
1251 gimplify_exit_block_expr (tree *expr_p)
1253 tree labeled_block = TREE_OPERAND (*expr_p, 0);
1256 /* First operand must be a LABELED_BLOCK_EXPR, which should
1257 already be lowered (or partially lowered) when we get here. */
1258 #if defined ENABLE_CHECKING
1259 if (TREE_CODE (labeled_block) != LABELED_BLOCK_EXPR)
1263 label = LABELED_BLOCK_LABEL (labeled_block);
1264 *expr_p = build1 (GOTO_EXPR, void_type_node, label);
1269 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1273 build_and_jump (tree *label_p)
1275 if (label_p == NULL)
1276 /* If there's nowhere to jump, just fall through. */
1279 if (*label_p == NULL_TREE)
1281 tree label = create_artificial_label ();
1285 return build1 (GOTO_EXPR, void_type_node, *label_p);
1288 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1289 This also involves building a label to jump to and communicating it to
1290 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1292 static enum gimplify_status
1293 gimplify_exit_expr (tree *expr_p)
1295 tree cond = TREE_OPERAND (*expr_p, 0);
1298 expr = build_and_jump (&gimplify_ctxp->exit_label);
1299 expr = build (COND_EXPR, void_type_node, cond, expr, NULL_TREE);
1305 /* A helper function to be called via walk_tree. Mark all labels under *TP
1306 as being forced. To be called for DECL_INITIAL of static variables. */
1309 force_labels_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
1313 if (TREE_CODE (*tp) == LABEL_DECL)
1314 FORCED_LABEL (*tp) = 1;
1319 /* Break out elements of a constructor used as an initializer into separate
1322 Note that we still need to clear any elements that don't have explicit
1323 initializers, so if not all elements are initialized we keep the
1324 original MODIFY_EXPR, we just remove all of the constructor elements. */
1326 static enum gimplify_status
1327 gimplify_init_constructor (tree *expr_p, tree *pre_p,
1328 tree *post_p, bool want_value)
1330 tree object = TREE_OPERAND (*expr_p, 0);
1331 tree ctor = TREE_OPERAND (*expr_p, 1);
1332 tree type = TREE_TYPE (ctor);
1333 enum gimplify_status ret;
1336 if (TREE_CODE (ctor) != CONSTRUCTOR)
1337 return GS_UNHANDLED;
1339 elt_list = CONSTRUCTOR_ELTS (ctor);
1342 switch (TREE_CODE (type))
1346 case QUAL_UNION_TYPE:
1349 HOST_WIDE_INT i, num_elements, num_nonzero_elements;
1350 HOST_WIDE_INT num_nonconstant_elements;
1353 /* Aggregate types must lower constructors to initialization of
1354 individual elements. The exception is that a CONSTRUCTOR node
1355 with no elements indicates zero-initialization of the whole. */
1356 if (elt_list == NULL)
1364 return GS_UNHANDLED;
1367 categorize_ctor_elements (ctor, &num_nonzero_elements,
1368 &num_nonconstant_elements);
1369 num_elements = count_type_elements (TREE_TYPE (ctor));
1371 /* If a const aggregate variable is being initialized, then it
1372 should never be a lose to promote the variable to be static. */
1373 if (num_nonconstant_elements == 0
1374 && TREE_READONLY (object)
1375 && TREE_CODE (object) == VAR_DECL)
1377 DECL_INITIAL (object) = ctor;
1378 TREE_STATIC (object) = 1;
1379 if (!DECL_NAME (object))
1380 DECL_NAME (object) = create_tmp_var_name ("C");
1381 walk_tree (&DECL_INITIAL (object), force_labels_r, NULL, NULL);
1383 /* ??? C++ doesn't automatically append a .<number> to the
1384 assembler name, and even when it does, it looks a FE private
1385 data structures to figure out what that number should be,
1386 which are not set for this variable. I suppose this is
1387 important for local statics for inline functions, which aren't
1388 "local" in the object file sense. So in order to get a unique
1389 TU-local symbol, we must invoke the lhd version now. */
1390 lhd_set_decl_assembler_name (object);
1392 *expr_p = NULL_TREE;
1396 /* If there are "lots" of initialized elements, and all of them
1397 are valid address constants, then the entire initializer can
1398 be dropped to memory, and then memcpy'd out. */
1399 if (num_nonconstant_elements == 0)
1401 HOST_WIDE_INT size = int_size_in_bytes (type);
1404 /* ??? We can still get unbounded array types, at least
1405 from the C++ front end. This seems wrong, but attempt
1406 to work around it for now. */
1409 size = int_size_in_bytes (TREE_TYPE (object));
1411 TREE_TYPE (ctor) = type = TREE_TYPE (object);
1414 /* Find the maximum alignment we can assume for the object. */
1415 /* ??? Make use of DECL_OFFSET_ALIGN. */
1416 if (DECL_P (object))
1417 align = DECL_ALIGN (object);
1419 align = TYPE_ALIGN (type);
1421 if (size > 0 && !can_move_by_pieces (size, align))
1423 tree new = create_tmp_var_raw (type, "C");
1424 gimple_add_tmp_var (new);
1425 TREE_STATIC (new) = 1;
1426 TREE_READONLY (new) = 1;
1427 DECL_INITIAL (new) = ctor;
1428 if (align > DECL_ALIGN (new))
1430 DECL_ALIGN (new) = align;
1431 DECL_USER_ALIGN (new) = 1;
1433 walk_tree (&DECL_INITIAL (new), force_labels_r, NULL, NULL);
1435 TREE_OPERAND (*expr_p, 1) = new;
1440 /* If there are "lots" of initialized elements, even discounting
1441 those that are not address constants (and thus *must* be
1442 computed at runtime), then partition the constructor into
1443 constant and non-constant parts. Block copy the constant
1444 parts in, then generate code for the non-constant parts. */
1445 /* TODO. There's code in cp/typeck.c to do this. */
1447 /* If there are "lots" of zeros, then block clear the object first. */
1449 if (num_elements - num_nonzero_elements > CLEAR_RATIO
1450 && num_nonzero_elements < num_elements/4)
1453 /* ??? This bit ought not be needed. For any element not present
1454 in the initializer, we should simply set them to zero. Except
1455 we'd need to *find* the elements that are not present, and that
1456 requires trickery to avoid quadratic compile-time behavior in
1457 large cases or excessive memory use in small cases. */
1460 HOST_WIDE_INT len = list_length (elt_list);
1461 if (TREE_CODE (type) == ARRAY_TYPE)
1463 tree nelts = array_type_nelts (type);
1464 if (!host_integerp (nelts, 1)
1465 || tree_low_cst (nelts, 1) != len)
1468 else if (len != fields_length (type))
1474 CONSTRUCTOR_ELTS (ctor) = NULL_TREE;
1475 append_to_statement_list (*expr_p, pre_p);
1478 for (i = 0; elt_list; i++, elt_list = TREE_CHAIN (elt_list))
1480 tree purpose, value, cref, init;
1482 purpose = TREE_PURPOSE (elt_list);
1483 value = TREE_VALUE (elt_list);
1485 if (cleared && initializer_zerop (value))
1488 if (TREE_CODE (type) == ARRAY_TYPE)
1490 tree t = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object)));
1492 /* ??? Here's to hoping the front end fills in all of the
1493 indicies, so we don't have to figure out what's missing
1497 /* ??? Need to handle this. */
1498 if (TREE_CODE (purpose) == RANGE_EXPR)
1501 cref = build (ARRAY_REF, t, object, purpose, NULL_TREE, NULL_TREE);
1504 cref = build (COMPONENT_REF, TREE_TYPE (purpose), object,
1505 purpose, NULL_TREE);
1507 init = build (MODIFY_EXPR, TREE_TYPE (purpose), cref, value);
1508 /* Each member initialization is a full-expression. */
1509 gimplify_stmt (&init);
1510 append_to_statement_list (init, pre_p);
1513 *expr_p = NULL_TREE;
1521 /* Extract the real and imaginary parts out of the ctor. */
1525 r = TREE_VALUE (elt_list);
1526 elt_list = TREE_CHAIN (elt_list);
1529 i = TREE_VALUE (elt_list);
1530 if (TREE_CHAIN (elt_list))
1534 if (r == NULL || i == NULL)
1536 tree zero = convert (TREE_TYPE (type), integer_zero_node);
1543 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
1544 represent creation of a complex value. */
1545 if (TREE_CONSTANT (r) && TREE_CONSTANT (i))
1547 ctor = build_complex (type, r, i);
1548 TREE_OPERAND (*expr_p, 1) = ctor;
1552 ctor = build (COMPLEX_EXPR, type, r, i);
1553 TREE_OPERAND (*expr_p, 1) = ctor;
1554 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
1555 is_gimple_rhs, fb_rvalue);
1561 /* Go ahead and simplify constant constructors to VECTOR_CST. */
1562 if (TREE_CONSTANT (ctor))
1563 TREE_OPERAND (*expr_p, 1) = build_vector (type, elt_list);
1566 /* Vector types use CONSTRUCTOR all the way through gimple
1567 compilation as a general initializer. */
1568 for (; elt_list; elt_list = TREE_CHAIN (elt_list))
1570 enum gimplify_status tret;
1571 tret = gimplify_expr (&TREE_VALUE (elt_list), pre_p, post_p,
1572 is_gimple_constructor_elt, fb_rvalue);
1573 if (tret == GS_ERROR)
1580 /* So how did we get a CONSTRUCTOR for a scalar type? */
1584 if (ret == GS_ERROR)
1586 else if (want_value)
1588 append_to_statement_list (*expr_p, pre_p);
1596 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1597 different from its canonical type, wrap the whole thing inside a
1598 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1601 The canonical type of a COMPONENT_REF is the type of the field being
1602 referenced--unless the field is a bit-field which can be read directly
1603 in a smaller mode, in which case the canonical type is the
1604 sign-appropriate type corresponding to that mode. */
1607 canonicalize_component_ref (tree *expr_p)
1609 tree expr = *expr_p;
1612 if (TREE_CODE (expr) != COMPONENT_REF)
1615 if (INTEGRAL_TYPE_P (TREE_TYPE (expr)))
1616 type = TREE_TYPE (get_unwidened (expr, NULL_TREE));
1618 type = TREE_TYPE (TREE_OPERAND (expr, 1));
1620 if (TREE_TYPE (expr) != type)
1622 tree old_type = TREE_TYPE (expr);
1624 /* Set the type of the COMPONENT_REF to the underlying type. */
1625 TREE_TYPE (expr) = type;
1627 /* And wrap the whole thing inside a NOP_EXPR. */
1628 expr = build1 (NOP_EXPR, old_type, expr);
1634 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1635 to foo, embed that change in the ADDR_EXPR by converting
1640 where L is the lower bound. Only do this for constant lower bound since
1641 we have no place to put any statements made during gimplification of
1645 canonicalize_addr_expr (tree *expr_p)
1647 tree expr = *expr_p;
1648 tree ctype = TREE_TYPE (expr);
1649 tree addr_expr = TREE_OPERAND (expr, 0);
1650 tree atype = TREE_TYPE (addr_expr);
1651 tree dctype, datype, ddatype, otype, obj_expr;
1653 /* Both cast and addr_expr types should be pointers. */
1654 if (!POINTER_TYPE_P (ctype) || !POINTER_TYPE_P (atype))
1657 /* The addr_expr type should be a pointer to an array. */
1658 datype = TREE_TYPE (atype);
1659 if (TREE_CODE (datype) != ARRAY_TYPE)
1662 /* Both cast and addr_expr types should address the same object type. */
1663 dctype = TREE_TYPE (ctype);
1664 ddatype = TREE_TYPE (datype);
1665 if (!lang_hooks.types_compatible_p (ddatype, dctype))
1668 /* The addr_expr and the object type should match. */
1669 obj_expr = TREE_OPERAND (addr_expr, 0);
1670 otype = TREE_TYPE (obj_expr);
1671 if (!lang_hooks.types_compatible_p (otype, datype))
1674 /* The lower bound and element sizes must be constant. */
1675 if (TREE_CODE (TYPE_SIZE_UNIT (dctype)) != INTEGER_CST
1676 || !TYPE_DOMAIN (datype) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype))
1677 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype))) != INTEGER_CST)
1680 /* All checks succeeded. Build a new node to merge the cast. */
1681 *expr_p = build4 (ARRAY_REF, dctype, obj_expr,
1682 TYPE_MIN_VALUE (TYPE_DOMAIN (datype)),
1683 TYPE_MIN_VALUE (TYPE_DOMAIN (datype)),
1684 size_binop (EXACT_DIV_EXPR, TYPE_SIZE_UNIT (dctype),
1685 size_int (TYPE_ALIGN (dctype)
1687 *expr_p = build1 (ADDR_EXPR, ctype, *expr_p);
1690 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1691 underneath as appropriate. */
1693 static enum gimplify_status
1694 gimplify_conversion (tree *expr_p)
1696 /* Strip away as many useless type conversions as possible
1698 STRIP_USELESS_TYPE_CONVERSION (*expr_p);
1700 /* If we still have a conversion at the toplevel, then strip
1701 away all but the outermost conversion. */
1702 if (TREE_CODE (*expr_p) == NOP_EXPR || TREE_CODE (*expr_p) == CONVERT_EXPR)
1704 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p, 0));
1706 /* And remove the outermost conversion if it's useless. */
1707 if (tree_ssa_useless_type_conversion (*expr_p))
1708 *expr_p = TREE_OPERAND (*expr_p, 0);
1711 /* If we still have a conversion at the toplevel,
1712 then canonicalize some constructs. */
1713 if (TREE_CODE (*expr_p) == NOP_EXPR || TREE_CODE (*expr_p) == CONVERT_EXPR)
1715 tree sub = TREE_OPERAND (*expr_p, 0);
1717 /* If a NOP conversion is changing the type of a COMPONENT_REF
1718 expression, then canonicalize its type now in order to expose more
1719 redundant conversions. */
1720 if (TREE_CODE (sub) == COMPONENT_REF)
1721 canonicalize_component_ref (&TREE_OPERAND (*expr_p, 0));
1723 /* If a NOP conversion is changing a pointer to array of foo
1724 to a pointer to foo, embed that change in the ADDR_EXPR. */
1725 else if (TREE_CODE (sub) == ADDR_EXPR)
1726 canonicalize_addr_expr (expr_p);
1732 /* Reduce MIN/MAX_EXPR to a COND_EXPR for further gimplification. */
1734 static enum gimplify_status
1735 gimplify_minimax_expr (tree *expr_p, tree *pre_p, tree *post_p)
1737 tree op1 = TREE_OPERAND (*expr_p, 0);
1738 tree op2 = TREE_OPERAND (*expr_p, 1);
1739 enum tree_code code;
1740 enum gimplify_status r0, r1;
1742 if (TREE_CODE (*expr_p) == MIN_EXPR)
1747 r0 = gimplify_expr (&op1, pre_p, post_p, is_gimple_val, fb_rvalue);
1748 r1 = gimplify_expr (&op2, pre_p, post_p, is_gimple_val, fb_rvalue);
1750 *expr_p = build (COND_EXPR, TREE_TYPE (*expr_p),
1751 build (code, boolean_type_node, op1, op2),
1754 if (r0 == GS_ERROR || r1 == GS_ERROR)
1760 /* Subroutine of gimplify_compound_lval.
1761 Converts an ARRAY_REF to the equivalent *(&array + offset) form. */
1763 static enum gimplify_status
1764 gimplify_array_ref_to_plus (tree *expr_p, tree *pre_p, tree *post_p)
1766 tree array = TREE_OPERAND (*expr_p, 0);
1767 tree arrtype = TREE_TYPE (array);
1768 tree elttype = TREE_TYPE (arrtype);
1769 tree size = array_ref_element_size (*expr_p);
1770 tree ptrtype = build_pointer_type (elttype);
1771 enum tree_code add_code = PLUS_EXPR;
1772 tree idx = TREE_OPERAND (*expr_p, 1);
1773 tree minidx = unshare_expr (array_ref_low_bound (*expr_p));
1774 tree offset, addr, result;
1775 enum gimplify_status ret;
1777 /* If the array domain does not start at zero, apply the offset. */
1778 if (!integer_zerop (minidx))
1780 idx = convert (TREE_TYPE (minidx), idx);
1781 idx = fold (build (MINUS_EXPR, TREE_TYPE (minidx), idx, minidx));
1784 /* If the index is negative -- a technically invalid situation now
1785 that we've biased the index back to zero -- then casting it to
1786 unsigned has ill effects. In particular, -1*4U/4U != -1.
1787 Represent this as a subtraction of a positive rather than addition
1788 of a negative. This will prevent any conversion back to ARRAY_REF
1789 from getting the wrong results from the division. */
1790 if (TREE_CODE (idx) == INTEGER_CST && tree_int_cst_sgn (idx) < 0)
1792 idx = fold (build1 (NEGATE_EXPR, TREE_TYPE (idx), idx));
1793 add_code = MINUS_EXPR;
1796 /* Pointer arithmetic must be done in sizetype. */
1797 idx = fold_convert (sizetype, idx);
1799 /* Convert the index to a byte offset. */
1800 offset = size_binop (MULT_EXPR, size, idx);
1802 ret = gimplify_expr (&array, pre_p, post_p, is_gimple_min_lval, fb_lvalue);
1803 if (ret == GS_ERROR)
1806 addr = build_fold_addr_expr_with_type (array, ptrtype);
1807 result = fold (build (add_code, ptrtype, addr, offset));
1808 *expr_p = build1 (INDIRECT_REF, elttype, result);
1813 /* Build an expression for the address of T. Folds away INDIRECT_REF to
1814 avoid confusing the gimplify process. */
1817 build_addr_expr_with_type (tree t, tree ptrtype)
1819 if (TREE_CODE (t) == INDIRECT_REF)
1821 t = TREE_OPERAND (t, 0);
1822 if (TREE_TYPE (t) != ptrtype)
1823 t = build1 (NOP_EXPR, ptrtype, t);
1829 if (TREE_CODE (base) == REALPART_EXPR
1830 || TREE_CODE (base) == IMAGPART_EXPR)
1831 base = TREE_OPERAND (base, 0);
1833 while (handled_component_p (base))
1834 base = TREE_OPERAND (base, 0);
1837 TREE_ADDRESSABLE (base) = 1;
1839 t = build1 (ADDR_EXPR, ptrtype, t);
1846 build_addr_expr (tree t)
1848 return build_addr_expr_with_type (t, build_pointer_type (TREE_TYPE (t)));
1851 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1852 node pointed by EXPR_P.
1855 : min_lval '[' val ']'
1857 | compound_lval '[' val ']'
1858 | compound_lval '.' ID
1860 This is not part of the original SIMPLE definition, which separates
1861 array and member references, but it seems reasonable to handle them
1862 together. Also, this way we don't run into problems with union
1863 aliasing; gcc requires that for accesses through a union to alias, the
1864 union reference must be explicit, which was not always the case when we
1865 were splitting up array and member refs.
1867 PRE_P points to the list where side effects that must happen before
1868 *EXPR_P should be stored.
1870 POST_P points to the list where side effects that must happen after
1871 *EXPR_P should be stored. */
1873 static enum gimplify_status
1874 gimplify_compound_lval (tree *expr_p, tree *pre_p,
1875 tree *post_p, bool want_lvalue)
1879 enum gimplify_status ret = GS_OK, tret;
1881 #if defined ENABLE_CHECKING
1882 if (TREE_CODE (*expr_p) != ARRAY_REF
1883 && TREE_CODE (*expr_p) != ARRAY_RANGE_REF
1884 && TREE_CODE (*expr_p) != COMPONENT_REF
1885 && TREE_CODE (*expr_p) != BIT_FIELD_REF
1886 && TREE_CODE (*expr_p) != REALPART_EXPR
1887 && TREE_CODE (*expr_p) != IMAGPART_EXPR)
1891 /* Create a stack of the subexpressions so later we can walk them in
1892 order from inner to outer. */
1893 VARRAY_TREE_INIT (stack, 10, "stack");
1895 /* We can either handle one REALPART_EXPR or IMAGEPART_EXPR or
1896 nest of handled components. */
1897 if (TREE_CODE (*expr_p) == REALPART_EXPR
1898 || TREE_CODE (*expr_p) == IMAGPART_EXPR)
1899 p = &TREE_OPERAND (*expr_p, 0);
1901 for (p = expr_p; handled_component_p (*p); p = &TREE_OPERAND (*p, 0))
1902 VARRAY_PUSH_TREE (stack, *p);
1904 /* Now STACK is a stack of pointers to all the refs we've walked through
1905 and P points to the innermost expression.
1907 Process each of the outer nodes from left to right, then gimplify the
1908 base. We need to do it in this order so that PLACEHOLDER_EXPRs
1910 for (; VARRAY_ACTIVE_SIZE (stack) > 0; )
1912 tree t = VARRAY_TOP_TREE (stack);
1914 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
1916 /* Gimplify the dimension.
1917 Temporary fix for gcc.c-torture/execute/20040313-1.c.
1918 Gimplify non-constant array indices into a temporary
1920 FIXME - The real fix is to gimplify post-modify
1921 expressions into a minimal gimple lvalue. However, that
1922 exposes bugs in alias analysis. The alias analyzer does
1923 not handle &PTR->FIELD very well. Will fix after the
1924 branch is merged into mainline (dnovillo 2004-05-03). */
1925 if (!is_gimple_min_invariant (TREE_OPERAND (t, 1)))
1927 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
1928 is_gimple_tmp_var, fb_rvalue);
1929 ret = MIN (ret, tret);
1932 /* Gimplify the low bound and element type size and put them into
1933 the ARRAY_REF. If these values are set, they have already been
1935 if (!TREE_OPERAND (t, 2))
1937 tree low = unshare_expr (array_ref_low_bound (t));
1938 if (!is_gimple_min_invariant (low))
1940 TREE_OPERAND (t, 2) = low;
1941 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1942 is_gimple_tmp_var, fb_rvalue);
1943 ret = MIN (ret, tret);
1947 if (!TREE_OPERAND (t, 3))
1949 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (t, 0)));
1950 tree elmt_size = unshare_expr (array_ref_element_size (t));
1951 tree factor = size_int (TYPE_ALIGN (elmt_type) / BITS_PER_UNIT);
1953 /* Divide the element size by the alignment of the element
1955 elmt_size = size_binop (EXACT_DIV_EXPR, elmt_size, factor);
1957 if (!is_gimple_min_invariant (elmt_size))
1959 TREE_OPERAND (t, 3) = elmt_size;
1960 tret = gimplify_expr (&TREE_OPERAND (t, 3), pre_p, post_p,
1961 is_gimple_tmp_var, fb_rvalue);
1962 ret = MIN (ret, tret);
1966 else if (TREE_CODE (t) == COMPONENT_REF)
1968 /* Set the field offset into T and gimplify it. */
1969 if (!TREE_OPERAND (t, 2))
1971 tree offset = unshare_expr (component_ref_field_offset (t));
1972 tree field = TREE_OPERAND (t, 1);
1974 = size_int (DECL_OFFSET_ALIGN (field) / BITS_PER_UNIT);
1976 /* Divide the offset by its alignment. */
1977 offset = size_binop (EXACT_DIV_EXPR, offset, factor);
1979 if (!is_gimple_min_invariant (offset))
1981 TREE_OPERAND (t, 2) = offset;
1982 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1983 is_gimple_tmp_var, fb_rvalue);
1984 ret = MIN (ret, tret);
1988 else if (TREE_CODE (t) == BIT_FIELD_REF)
1990 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
1991 is_gimple_val, fb_rvalue);
1992 ret = MIN (ret, tret);
1993 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1994 is_gimple_val, fb_rvalue);
1995 ret = MIN (ret, tret);
1998 recalculate_side_effects (t);
2002 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval,
2003 want_lvalue ? fb_lvalue : fb_rvalue);
2004 ret = MIN (ret, tret);
2006 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
2007 if (!want_lvalue && TREE_CODE (*expr_p) == COMPONENT_REF)
2009 canonicalize_component_ref (expr_p);
2010 ret = MIN (ret, GS_OK);
2016 /* Gimplify the self modifying expression pointed by EXPR_P (++, --, +=, -=).
2018 PRE_P points to the list where side effects that must happen before
2019 *EXPR_P should be stored.
2021 POST_P points to the list where side effects that must happen after
2022 *EXPR_P should be stored.
2024 WANT_VALUE is nonzero iff we want to use the value of this expression
2025 in another expression. */
2027 static enum gimplify_status
2028 gimplify_self_mod_expr (tree *expr_p, tree *pre_p, tree *post_p,
2031 enum tree_code code;
2032 tree lhs, lvalue, rhs, t1;
2034 enum tree_code arith_code;
2035 enum gimplify_status ret;
2037 code = TREE_CODE (*expr_p);
2039 #if defined ENABLE_CHECKING
2040 if (code != POSTINCREMENT_EXPR
2041 && code != POSTDECREMENT_EXPR
2042 && code != PREINCREMENT_EXPR
2043 && code != PREDECREMENT_EXPR)
2047 /* Prefix or postfix? */
2048 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
2049 /* Faster to treat as prefix if result is not used. */
2050 postfix = want_value;
2054 /* Add or subtract? */
2055 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2056 arith_code = PLUS_EXPR;
2058 arith_code = MINUS_EXPR;
2060 /* Gimplify the LHS into a GIMPLE lvalue. */
2061 lvalue = TREE_OPERAND (*expr_p, 0);
2062 ret = gimplify_expr (&lvalue, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
2063 if (ret == GS_ERROR)
2066 /* Extract the operands to the arithmetic operation. */
2068 rhs = TREE_OPERAND (*expr_p, 1);
2070 /* For postfix operator, we evaluate the LHS to an rvalue and then use
2071 that as the result value and in the postqueue operation. */
2074 ret = gimplify_expr (&lhs, pre_p, post_p, is_gimple_val, fb_rvalue);
2075 if (ret == GS_ERROR)
2079 t1 = build (arith_code, TREE_TYPE (*expr_p), lhs, rhs);
2080 t1 = build (MODIFY_EXPR, TREE_TYPE (lvalue), lvalue, t1);
2084 gimplify_stmt (&t1);
2085 append_to_statement_list (t1, post_p);
2096 /* Gimplify the CALL_EXPR node pointed by EXPR_P.
2099 : ID '(' arglist ')'
2105 PRE_P points to the list where side effects that must happen before
2106 *EXPR_P should be stored. */
2108 static enum gimplify_status
2109 gimplify_call_expr (tree *expr_p, tree *pre_p, bool (*gimple_test_f) (tree))
2113 enum gimplify_status ret;
2115 #if defined ENABLE_CHECKING
2116 if (TREE_CODE (*expr_p) != CALL_EXPR)
2120 /* For reliable diagnostics during inlining, it is necessary that
2121 every call_expr be annotated with file and line. */
2122 if (!EXPR_LOCUS (*expr_p))
2123 annotate_with_locus (*expr_p, input_location);
2125 /* This may be a call to a builtin function.
2127 Builtin function calls may be transformed into different
2128 (and more efficient) builtin function calls under certain
2129 circumstances. Unfortunately, gimplification can muck things
2130 up enough that the builtin expanders are not aware that certain
2131 transformations are still valid.
2133 So we attempt transformation/gimplification of the call before
2134 we gimplify the CALL_EXPR. At this time we do not manage to
2135 transform all calls in the same manner as the expanders do, but
2136 we do transform most of them. */
2137 decl = get_callee_fndecl (*expr_p);
2138 if (decl && DECL_BUILT_IN (decl))
2142 /* If it is allocation of stack, record the need to restore the memory
2143 when the enclosing bind_expr is exited. */
2144 if (DECL_FUNCTION_CODE (decl) == BUILT_IN_STACK_ALLOC)
2145 gimplify_ctxp->save_stack = true;
2147 /* If it is restore of the stack, reset it, since it means we are
2148 regimplifying the bind_expr. Note that we use the fact that
2149 for try_finally_expr, try part is processed first. */
2150 if (DECL_FUNCTION_CODE (decl) == BUILT_IN_STACK_RESTORE)
2151 gimplify_ctxp->save_stack = false;
2153 new = simplify_builtin (*expr_p, gimple_test_f == is_gimple_stmt);
2155 if (new && new != *expr_p)
2157 /* There was a transformation of this call which computes the
2158 same value, but in a more efficient way. Return and try
2165 /* There is a sequence point before the call, so any side effects in
2166 the calling expression must occur before the actual call. Force
2167 gimplify_expr to use an internal post queue. */
2168 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, NULL,
2169 is_gimple_call_addr, fb_rvalue);
2171 if (PUSH_ARGS_REVERSED)
2172 TREE_OPERAND (*expr_p, 1) = nreverse (TREE_OPERAND (*expr_p, 1));
2173 for (arglist = TREE_OPERAND (*expr_p, 1); arglist;
2174 arglist = TREE_CHAIN (arglist))
2176 enum gimplify_status t;
2178 /* There is a sequence point before a function call. Side effects in
2179 the argument list must occur before the actual call. So, when
2180 gimplifying arguments, force gimplify_expr to use an internal
2181 post queue which is then appended to the end of PRE_P. */
2182 t = gimplify_expr (&TREE_VALUE (arglist), pre_p, NULL, is_gimple_val,
2188 if (PUSH_ARGS_REVERSED)
2189 TREE_OPERAND (*expr_p, 1) = nreverse (TREE_OPERAND (*expr_p, 1));
2191 /* Try this again in case gimplification exposed something. */
2192 if (ret != GS_ERROR && decl && DECL_BUILT_IN (decl))
2194 tree new = simplify_builtin (*expr_p, gimple_test_f == is_gimple_stmt);
2196 if (new && new != *expr_p)
2198 /* There was a transformation of this call which computes the
2199 same value, but in a more efficient way. Return and try
2206 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2207 decl. This allows us to eliminate redundant or useless
2208 calls to "const" functions. */
2209 if (TREE_CODE (*expr_p) == CALL_EXPR
2210 && (call_expr_flags (*expr_p) & (ECF_CONST | ECF_PURE)))
2211 TREE_SIDE_EFFECTS (*expr_p) = 0;
2216 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2217 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2219 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2220 condition is true or false, respectively. If null, we should generate
2221 our own to skip over the evaluation of this specific expression.
2223 This function is the tree equivalent of do_jump.
2225 shortcut_cond_r should only be called by shortcut_cond_expr. */
2228 shortcut_cond_r (tree pred, tree *true_label_p, tree *false_label_p)
2230 tree local_label = NULL_TREE;
2231 tree t, expr = NULL;
2233 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2234 retain the shortcut semantics. Just insert the gotos here;
2235 shortcut_cond_expr will append the real blocks later. */
2236 if (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2238 /* Turn if (a && b) into
2240 if (a); else goto no;
2241 if (b) goto yes; else goto no;
2244 if (false_label_p == NULL)
2245 false_label_p = &local_label;
2247 t = shortcut_cond_r (TREE_OPERAND (pred, 0), NULL, false_label_p);
2248 append_to_statement_list (t, &expr);
2250 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2252 append_to_statement_list (t, &expr);
2254 else if (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2256 /* Turn if (a || b) into
2259 if (b) goto yes; else goto no;
2262 if (true_label_p == NULL)
2263 true_label_p = &local_label;
2265 t = shortcut_cond_r (TREE_OPERAND (pred, 0), true_label_p, NULL);
2266 append_to_statement_list (t, &expr);
2268 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2270 append_to_statement_list (t, &expr);
2272 else if (TREE_CODE (pred) == COND_EXPR)
2274 /* As long as we're messing with gotos, turn if (a ? b : c) into
2276 if (b) goto yes; else goto no;
2278 if (c) goto yes; else goto no; */
2279 expr = build (COND_EXPR, void_type_node, TREE_OPERAND (pred, 0),
2280 shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2282 shortcut_cond_r (TREE_OPERAND (pred, 2), true_label_p,
2287 expr = build (COND_EXPR, void_type_node, pred,
2288 build_and_jump (true_label_p),
2289 build_and_jump (false_label_p));
2294 t = build1 (LABEL_EXPR, void_type_node, local_label);
2295 append_to_statement_list (t, &expr);
2302 shortcut_cond_expr (tree expr)
2304 tree pred = TREE_OPERAND (expr, 0);
2305 tree then_ = TREE_OPERAND (expr, 1);
2306 tree else_ = TREE_OPERAND (expr, 2);
2307 tree true_label, false_label, end_label, t;
2309 tree *false_label_p;
2310 bool emit_end, emit_false;
2311 bool then_se = then_ && TREE_SIDE_EFFECTS (then_);
2312 bool else_se = else_ && TREE_SIDE_EFFECTS (else_);
2314 /* First do simple transformations. */
2317 /* If there is no 'else', turn (a && b) into if (a) if (b). */
2318 while (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2320 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2321 then_ = shortcut_cond_expr (expr);
2322 pred = TREE_OPERAND (pred, 0);
2323 expr = build (COND_EXPR, void_type_node, pred, then_, NULL_TREE);
2328 /* If there is no 'then', turn
2331 if (a); else if (b); else d. */
2332 while (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2334 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2335 else_ = shortcut_cond_expr (expr);
2336 pred = TREE_OPERAND (pred, 0);
2337 expr = build (COND_EXPR, void_type_node, pred, NULL_TREE, else_);
2341 /* If we're done, great. */
2342 if (TREE_CODE (pred) != TRUTH_ANDIF_EXPR
2343 && TREE_CODE (pred) != TRUTH_ORIF_EXPR)
2346 /* Otherwise we need to mess with gotos. Change
2349 if (a); else goto no;
2352 and recursively gimplify the condition. */
2354 true_label = false_label = end_label = NULL_TREE;
2356 /* If our arms just jump somewhere, hijack those labels so we don't
2357 generate jumps to jumps. */
2360 && TREE_CODE (then_) == GOTO_EXPR
2361 && TREE_CODE (GOTO_DESTINATION (then_)) == LABEL_DECL)
2363 true_label = GOTO_DESTINATION (then_);
2369 && TREE_CODE (else_) == GOTO_EXPR
2370 && TREE_CODE (GOTO_DESTINATION (else_)) == LABEL_DECL)
2372 false_label = GOTO_DESTINATION (else_);
2377 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2379 true_label_p = &true_label;
2381 true_label_p = NULL;
2383 /* The 'else' branch also needs a label if it contains interesting code. */
2384 if (false_label || else_se)
2385 false_label_p = &false_label;
2387 false_label_p = NULL;
2389 /* If there was nothing else in our arms, just forward the label(s). */
2390 if (!then_se && !else_se)
2391 return shortcut_cond_r (pred, true_label_p, false_label_p);
2393 /* If our last subexpression already has a terminal label, reuse it. */
2395 expr = expr_last (else_);
2397 expr = expr_last (then_);
2400 if (expr && TREE_CODE (expr) == LABEL_EXPR)
2401 end_label = LABEL_EXPR_LABEL (expr);
2403 /* If we don't care about jumping to the 'else' branch, jump to the end
2404 if the condition is false. */
2406 false_label_p = &end_label;
2408 /* We only want to emit these labels if we aren't hijacking them. */
2409 emit_end = (end_label == NULL_TREE);
2410 emit_false = (false_label == NULL_TREE);
2412 pred = shortcut_cond_r (pred, true_label_p, false_label_p);
2415 append_to_statement_list (pred, &expr);
2417 append_to_statement_list (then_, &expr);
2420 t = build_and_jump (&end_label);
2421 append_to_statement_list (t, &expr);
2424 t = build1 (LABEL_EXPR, void_type_node, false_label);
2425 append_to_statement_list (t, &expr);
2427 append_to_statement_list (else_, &expr);
2429 if (emit_end && end_label)
2431 t = build1 (LABEL_EXPR, void_type_node, end_label);
2432 append_to_statement_list (t, &expr);
2438 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2441 gimple_boolify (tree expr)
2443 tree type = TREE_TYPE (expr);
2445 if (TREE_CODE (type) == BOOLEAN_TYPE)
2448 /* If this is the predicate of a COND_EXPR, it might not even be a
2450 expr = lang_hooks.truthvalue_conversion (expr);
2452 switch (TREE_CODE (expr))
2454 case TRUTH_AND_EXPR:
2456 case TRUTH_XOR_EXPR:
2457 case TRUTH_ANDIF_EXPR:
2458 case TRUTH_ORIF_EXPR:
2459 /* Also boolify the arguments of truth exprs. */
2460 TREE_OPERAND (expr, 1) = gimple_boolify (TREE_OPERAND (expr, 1));
2463 case TRUTH_NOT_EXPR:
2464 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2467 case EQ_EXPR: case NE_EXPR:
2468 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2469 /* These expressions always produce boolean results. */
2470 TREE_TYPE (expr) = boolean_type_node;
2474 /* Other expressions that get here must have boolean values, but
2475 might need to be converted to the appropriate mode. */
2476 return convert (boolean_type_node, expr);
2480 /* Convert the conditional expression pointed by EXPR_P '(p) ? a : b;'
2489 The second form is used when *EXPR_P is of type void.
2491 TARGET is the tree for T1 above.
2493 PRE_P points to the list where side effects that must happen before
2494 *EXPR_P should be stored. */
2496 static enum gimplify_status
2497 gimplify_cond_expr (tree *expr_p, tree *pre_p, tree target)
2499 tree expr = *expr_p;
2501 enum gimplify_status ret;
2503 type = TREE_TYPE (expr);
2505 TREE_TYPE (expr) = void_type_node;
2507 /* If this COND_EXPR has a value, copy the values into a temporary within
2509 else if (! VOID_TYPE_P (type))
2518 tmp = create_tmp_var (TREE_TYPE (expr), "iftmp");
2522 /* Build the then clause, 't1 = a;'. But don't build an assignment
2523 if this branch is void; in C++ it can be, if it's a throw. */
2524 if (TREE_TYPE (TREE_OPERAND (expr, 1)) != void_type_node)
2525 TREE_OPERAND (expr, 1)
2526 = build (MODIFY_EXPR, void_type_node, tmp, TREE_OPERAND (expr, 1));
2528 /* Build the else clause, 't1 = b;'. */
2529 if (TREE_TYPE (TREE_OPERAND (expr, 2)) != void_type_node)
2530 TREE_OPERAND (expr, 2)
2531 = build (MODIFY_EXPR, void_type_node, tmp, TREE_OPERAND (expr, 2));
2533 TREE_TYPE (expr) = void_type_node;
2534 recalculate_side_effects (expr);
2536 /* Move the COND_EXPR to the prequeue and use the temp in its place. */
2537 gimplify_stmt (&expr);
2538 append_to_statement_list (expr, pre_p);
2544 /* Make sure the condition has BOOLEAN_TYPE. */
2545 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2547 /* Break apart && and || conditions. */
2548 if (TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ANDIF_EXPR
2549 || TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ORIF_EXPR)
2551 expr = shortcut_cond_expr (expr);
2553 if (expr != *expr_p)
2557 /* We can't rely on gimplify_expr to re-gimplify the expanded
2558 form properly, as cleanups might cause the target labels to be
2559 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2560 set up a conditional context. */
2561 gimple_push_condition ();
2562 gimplify_stmt (expr_p);
2563 gimple_pop_condition (pre_p);
2569 /* Now do the normal gimplification. */
2570 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL,
2571 is_gimple_condexpr, fb_rvalue);
2573 gimple_push_condition ();
2575 gimplify_to_stmt_list (&TREE_OPERAND (expr, 1));
2576 gimplify_to_stmt_list (&TREE_OPERAND (expr, 2));
2577 recalculate_side_effects (expr);
2579 gimple_pop_condition (pre_p);
2581 if (ret == GS_ERROR)
2583 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2585 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 2)))
2586 /* Rewrite "if (a); else b" to "if (!a) b" */
2588 TREE_OPERAND (expr, 0) = invert_truthvalue (TREE_OPERAND (expr, 0));
2589 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL,
2590 is_gimple_condexpr, fb_rvalue);
2592 tmp = TREE_OPERAND (expr, 1);
2593 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 2);
2594 TREE_OPERAND (expr, 2) = tmp;
2597 /* Both arms are empty; replace the COND_EXPR with its predicate. */
2598 expr = TREE_OPERAND (expr, 0);
2604 /* Gimplify the MODIFY_EXPR node pointed by EXPR_P.
2610 PRE_P points to the list where side effects that must happen before
2611 *EXPR_P should be stored.
2613 POST_P points to the list where side effects that must happen after
2614 *EXPR_P should be stored.
2616 WANT_VALUE is nonzero iff we want to use the value of this expression
2617 in another expression. */
2619 static enum gimplify_status
2620 gimplify_modify_expr (tree *expr_p, tree *pre_p, tree *post_p, bool want_value)
2622 tree *from_p = &TREE_OPERAND (*expr_p, 1);
2623 tree *to_p = &TREE_OPERAND (*expr_p, 0);
2624 enum gimplify_status ret = GS_UNHANDLED;
2626 #if defined ENABLE_CHECKING
2627 if (TREE_CODE (*expr_p) != MODIFY_EXPR && TREE_CODE (*expr_p) != INIT_EXPR)
2631 /* The distinction between MODIFY_EXPR and INIT_EXPR is no longer useful. */
2632 if (TREE_CODE (*expr_p) == INIT_EXPR)
2633 TREE_SET_CODE (*expr_p, MODIFY_EXPR);
2635 /* See if any simplifications can be done based on what the RHS is. */
2636 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
2638 if (ret != GS_UNHANDLED)
2641 /* If the value being copied is of variable width, expose the length
2642 if the copy by converting the whole thing to a memcpy. Note that
2643 we need to do this before gimplifying any of the operands
2644 so that we can resolve any PLACEHOLDER_EXPRs in the size. */
2645 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (*to_p))) != INTEGER_CST)
2649 t = TYPE_SIZE_UNIT (TREE_TYPE (*to_p));
2650 t = SUBSTITUTE_PLACEHOLDER_IN_EXPR (t, *to_p);
2651 t = SUBSTITUTE_PLACEHOLDER_IN_EXPR (t, *from_p);
2652 t = unshare_expr (t);
2653 args = tree_cons (NULL, t, NULL);
2654 t = build_fold_addr_expr (*from_p);
2655 args = tree_cons (NULL, t, args);
2656 dest = build_fold_addr_expr (*to_p);
2657 args = tree_cons (NULL, dest, args);
2658 t = implicit_built_in_decls[BUILT_IN_MEMCPY];
2659 t = build_function_call_expr (t, args);
2662 t = build1 (NOP_EXPR, TREE_TYPE (dest), t);
2663 t = build1 (INDIRECT_REF, TREE_TYPE (*to_p), t);
2669 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
2670 if (ret == GS_ERROR)
2673 ret = gimplify_expr (from_p, pre_p, post_p, is_gimple_rhs, fb_rvalue);
2674 if (ret == GS_ERROR)
2677 /* Now see if the above changed *from_p to something we handle specially. */
2678 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
2680 if (ret != GS_UNHANDLED)
2683 /* If the destination is already simple, nothing else needed. */
2684 if (is_gimple_tmp_var (*to_p))
2688 /* If the RHS of the MODIFY_EXPR may throw or make a nonlocal goto and
2689 the LHS is a user variable, then we need to introduce a temporary.
2690 ie temp = RHS; LHS = temp.
2692 This way the optimizers can determine that the user variable is
2693 only modified if evaluation of the RHS does not throw.
2695 FIXME this should be handled by the is_gimple_rhs predicate. */
2697 if (aggregate_value_p (TREE_TYPE (*from_p), NULL_TREE))
2698 /* Don't force a temp of a large aggregate type; the copy could be
2699 arbitrarily expensive. Instead we will generate a V_MAY_DEF for
2701 else if (TREE_CODE (*from_p) == CALL_EXPR
2702 || (flag_non_call_exceptions && tree_could_trap_p (*from_p))
2703 /* If we're dealing with a renamable type, either source or dest
2704 must be a renamed variable. */
2705 || (is_gimple_reg_type (TREE_TYPE (*from_p))
2706 && !is_gimple_reg (*to_p)))
2707 gimplify_expr (from_p, pre_p, post_p, is_gimple_val, fb_rvalue);
2709 ret = want_value ? GS_OK : GS_ALL_DONE;
2714 append_to_statement_list (*expr_p, pre_p);
2721 /* Subroutine of above to do simplications of MODIFY_EXPRs based on
2722 the code of the RHS. We loop for as long as we can do something. */
2724 static enum gimplify_status
2725 gimplify_modify_expr_rhs (tree *expr_p, tree *from_p, tree *to_p, tree *pre_p,
2726 tree *post_p, bool want_value)
2728 enum gimplify_status ret = GS_OK;
2730 while (ret != GS_UNHANDLED)
2731 switch (TREE_CODE (*from_p))
2735 /* If we are initializing something from a TARGET_EXPR, strip the
2736 TARGET_EXPR and initialize it directly, if possible. This can't
2737 be done if the initializer is void, since that implies that the
2738 temporary is set in some non-trivial way.
2740 ??? What about code that pulls out the temp and uses it
2741 elsewhere? I think that such code never uses the TARGET_EXPR as
2742 an initializer. If I'm wrong, we'll abort because the temp won't
2743 have any RTL. In that case, I guess we'll need to replace
2744 references somehow. */
2745 tree init = TARGET_EXPR_INITIAL (*from_p);
2747 if (!VOID_TYPE_P (TREE_TYPE (init)))
2758 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
2760 gimplify_compound_expr (from_p, pre_p, true);
2765 /* If we're initializing from a CONSTRUCTOR, break this into
2766 individual MODIFY_EXPRs. */
2767 return gimplify_init_constructor (expr_p, pre_p, post_p, want_value);
2770 /* If we're assigning from a ?: expression with ADDRESSABLE type, push
2771 the assignment down into the branches, since we can't generate a
2772 temporary of such a type. */
2773 if (TREE_ADDRESSABLE (TREE_TYPE (*from_p)))
2776 return gimplify_cond_expr (expr_p, pre_p, *to_p);
2790 /* Gimplify a comparison between two variable-sized objects. Do this
2791 with a call to BUILT_IN_MEMCMP. */
2793 static enum gimplify_status
2794 gimplify_variable_sized_compare (tree *expr_p)
2796 tree op0 = TREE_OPERAND (*expr_p, 0);
2797 tree op1 = TREE_OPERAND (*expr_p, 1);
2800 t = TYPE_SIZE_UNIT (TREE_TYPE (op0));
2801 t = SUBSTITUTE_PLACEHOLDER_IN_EXPR (t, op0);
2802 t = unshare_expr (t);
2803 args = tree_cons (NULL, t, NULL);
2804 t = build_addr_expr (op1);
2805 args = tree_cons (NULL, t, args);
2806 dest = build_addr_expr (op0);
2807 args = tree_cons (NULL, dest, args);
2808 t = implicit_built_in_decls[BUILT_IN_MEMCMP];
2809 t = build_function_call_expr (t, args);
2811 = build (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), t, integer_zero_node);
2816 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
2817 points to the expression to gimplify.
2819 Expressions of the form 'a && b' are gimplified to:
2821 a && b ? true : false
2823 gimplify_cond_expr will do the rest.
2825 PRE_P points to the list where side effects that must happen before
2826 *EXPR_P should be stored. */
2828 static enum gimplify_status
2829 gimplify_boolean_expr (tree *expr_p)
2831 /* Preserve the original type of the expression. */
2832 tree type = TREE_TYPE (*expr_p);
2834 *expr_p = build (COND_EXPR, type, *expr_p,
2835 convert (type, boolean_true_node),
2836 convert (type, boolean_false_node));
2841 /* Gimplifies an expression sequence. This function gimplifies each
2842 expression and re-writes the original expression with the last
2843 expression of the sequence in GIMPLE form.
2845 PRE_P points to the list where the side effects for all the
2846 expressions in the sequence will be emitted.
2848 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
2849 /* ??? Should rearrange to share the pre-queue with all the indirect
2850 invocations of gimplify_expr. Would probably save on creations
2851 of statement_list nodes. */
2853 static enum gimplify_status
2854 gimplify_compound_expr (tree *expr_p, tree *pre_p, bool want_value)
2860 tree *sub_p = &TREE_OPERAND (t, 0);
2862 if (TREE_CODE (*sub_p) == COMPOUND_EXPR)
2863 gimplify_compound_expr (sub_p, pre_p, false);
2865 gimplify_stmt (sub_p);
2866 append_to_statement_list (*sub_p, pre_p);
2868 t = TREE_OPERAND (t, 1);
2870 while (TREE_CODE (t) == COMPOUND_EXPR);
2877 gimplify_stmt (expr_p);
2882 /* Gimplifies a statement list. These may be created either by an
2883 enlightened front-end, or by shortcut_cond_expr. */
2885 static enum gimplify_status
2886 gimplify_statement_list (tree *expr_p)
2888 tree_stmt_iterator i = tsi_start (*expr_p);
2890 while (!tsi_end_p (i))
2894 gimplify_stmt (tsi_stmt_ptr (i));
2899 else if (TREE_CODE (t) == STATEMENT_LIST)
2901 tsi_link_before (&i, t, TSI_SAME_STMT);
2911 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
2912 gimplify. After gimplification, EXPR_P will point to a new temporary
2913 that holds the original value of the SAVE_EXPR node.
2915 PRE_P points to the list where side effects that must happen before
2916 *EXPR_P should be stored. */
2918 static enum gimplify_status
2919 gimplify_save_expr (tree *expr_p, tree *pre_p, tree *post_p)
2921 enum gimplify_status ret = GS_ALL_DONE;
2924 #if defined ENABLE_CHECKING
2925 if (TREE_CODE (*expr_p) != SAVE_EXPR)
2929 val = TREE_OPERAND (*expr_p, 0);
2931 /* If the operand is already a GIMPLE temporary, just re-write the
2933 if (is_gimple_tmp_var (val))
2935 /* The operand may be a void-valued expression such as SAVE_EXPRs
2936 generated by the Java frontend for class initialization. It is
2937 being executed only for its side-effects. */
2938 else if (TREE_TYPE (val) == void_type_node)
2940 tree body = TREE_OPERAND (*expr_p, 0);
2941 ret = gimplify_expr (& body, pre_p, post_p, is_gimple_stmt, fb_none);
2942 append_to_statement_list (body, pre_p);
2946 *expr_p = TREE_OPERAND (*expr_p, 0)
2947 = get_initialized_tmp_var (val, pre_p, post_p);
2952 /* Re-write the ADDR_EXPR node pointed by EXPR_P
2959 PRE_P points to the list where side effects that must happen before
2960 *EXPR_P should be stored.
2962 POST_P points to the list where side effects that must happen after
2963 *EXPR_P should be stored. */
2965 static enum gimplify_status
2966 gimplify_addr_expr (tree *expr_p, tree *pre_p, tree *post_p)
2968 tree expr = *expr_p;
2969 tree op0 = TREE_OPERAND (expr, 0);
2970 enum gimplify_status ret;
2972 switch (TREE_CODE (op0))
2975 /* Check if we are dealing with an expression of the form '&*ptr'.
2976 While the front end folds away '&*ptr' into 'ptr', these
2977 expressions may be generated internally by the compiler (e.g.,
2978 builtins like __builtin_va_end). */
2979 *expr_p = TREE_OPERAND (op0, 0);
2984 /* Fold &a[6] to (&a + 6). */
2985 ret = gimplify_array_ref_to_plus (&TREE_OPERAND (expr, 0),
2988 /* This added an INDIRECT_REF. Fold it away. */
2989 *expr_p = TREE_OPERAND (TREE_OPERAND (expr, 0), 0);
2992 case VIEW_CONVERT_EXPR:
2993 /* Take the address of our operand and then convert it to the type of
2995 *expr_p = fold_convert (TREE_TYPE (expr),
2996 build_addr_expr (TREE_OPERAND (op0, 0)));
3001 /* We use fb_either here because the C frontend sometimes takes
3002 the address of a call that returns a struct. */
3003 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, post_p,
3004 is_gimple_addr_expr_arg, fb_either);
3005 if (ret != GS_ERROR)
3007 /* At this point, the argument of the ADDR_EXPR should be
3008 sufficiently simple that there are never side effects. */
3009 /* ??? Could split out the decision code from build1 to verify. */
3010 TREE_SIDE_EFFECTS (expr) = 0;
3012 /* Make sure TREE_INVARIANT/TREE_CONSTANT is set properly. */
3013 recompute_tree_invarant_for_addr_expr (expr);
3015 /* Mark the RHS addressable. */
3016 lang_hooks.mark_addressable (TREE_OPERAND (expr, 0));
3021 /* If the operand is gimplified into a _DECL, mark the address expression
3022 as TREE_INVARIANT. */
3023 if (DECL_P (TREE_OPERAND (expr, 0)))
3024 TREE_INVARIANT (expr) = 1;
3029 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
3030 value; output operands should be a gimple lvalue. */
3032 static enum gimplify_status
3033 gimplify_asm_expr (tree *expr_p, tree *pre_p, tree *post_p)
3035 tree expr = *expr_p;
3036 int noutputs = list_length (ASM_OUTPUTS (expr));
3037 const char **oconstraints
3038 = (const char **) alloca ((noutputs) * sizeof (const char *));
3041 const char *constraint;
3042 bool allows_mem, allows_reg, is_inout;
3043 enum gimplify_status ret, tret;
3046 = resolve_asm_operand_names (ASM_STRING (expr), ASM_OUTPUTS (expr),
3050 for (i = 0, link = ASM_OUTPUTS (expr); link; ++i, link = TREE_CHAIN (link))
3052 oconstraints[i] = constraint
3053 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
3055 parse_output_constraint (&constraint, i, 0, 0,
3056 &allows_mem, &allows_reg, &is_inout);
3058 if (!allows_reg && allows_mem)
3059 lang_hooks.mark_addressable (TREE_VALUE (link));
3061 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
3062 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
3063 fb_lvalue | fb_mayfail);
3064 if (tret == GS_ERROR)
3066 error ("invalid lvalue in asm output %d", i);
3072 /* An input/output operand. To give the optimizers more
3073 flexibility, split it into separate input and output
3077 size_t constraint_len = strlen (constraint);
3079 /* Turn the in/out constraint into an output constraint. */
3080 char *p = xstrdup (constraint);
3082 TREE_VALUE (TREE_PURPOSE (link)) = build_string (constraint_len, p);
3085 /* And add a matching input constraint. */
3088 sprintf (buf, "%d", i);
3089 input = build_string (strlen (buf), buf);
3092 input = build_string (constraint_len - 1, constraint + 1);
3093 input = build_tree_list (build_tree_list (NULL_TREE, input),
3094 unshare_expr (TREE_VALUE (link)));
3095 ASM_INPUTS (expr) = chainon (ASM_INPUTS (expr), input);
3099 for (link = ASM_INPUTS (expr); link; ++i, link = TREE_CHAIN (link))
3102 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
3103 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
3104 oconstraints, &allows_mem, &allows_reg);
3106 /* If the operand is a memory input, it should be an lvalue. */
3107 if (!allows_reg && allows_mem)
3109 lang_hooks.mark_addressable (TREE_VALUE (link));
3110 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
3111 is_gimple_lvalue, fb_lvalue | fb_mayfail);
3112 if (tret == GS_ERROR)
3114 error ("memory input %d is not directly addressable", i);
3120 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
3121 is_gimple_val, fb_rvalue);
3122 if (tret == GS_ERROR)
3130 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
3131 WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
3132 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
3133 return to this function.
3135 FIXME should we complexify the prequeue handling instead? Or use flags
3136 for all the cleanups and let the optimizer tighten them up? The current
3137 code seems pretty fragile; it will break on a cleanup within any
3138 non-conditional nesting. But any such nesting would be broken, anyway;
3139 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
3140 and continues out of it. We can do that at the RTL level, though, so
3141 having an optimizer to tighten up try/finally regions would be a Good
3144 static enum gimplify_status
3145 gimplify_cleanup_point_expr (tree *expr_p, tree *pre_p)
3147 tree_stmt_iterator iter;
3150 tree temp = voidify_wrapper_expr (*expr_p, NULL);
3152 /* We only care about the number of conditions between the innermost
3153 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count. */
3154 int old_conds = gimplify_ctxp->conditions;
3155 gimplify_ctxp->conditions = 0;
3157 body = TREE_OPERAND (*expr_p, 0);
3158 gimplify_to_stmt_list (&body);
3160 gimplify_ctxp->conditions = old_conds;
3162 for (iter = tsi_start (body); !tsi_end_p (iter); )
3164 tree *wce_p = tsi_stmt_ptr (iter);
3167 if (TREE_CODE (wce) == WITH_CLEANUP_EXPR)
3169 if (tsi_one_before_end_p (iter))
3171 tsi_link_before (&iter, TREE_OPERAND (wce, 1), TSI_SAME_STMT);
3179 sl = tsi_split_statement_list_after (&iter);
3180 tfe = build (TRY_FINALLY_EXPR, void_type_node, sl, NULL_TREE);
3181 append_to_statement_list (TREE_OPERAND (wce, 1),
3182 &TREE_OPERAND (tfe, 1));
3184 iter = tsi_start (sl);
3194 append_to_statement_list (body, pre_p);
3204 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
3205 is the cleanup action required. */
3208 gimple_push_cleanup (tree var, tree cleanup, tree *pre_p)
3212 /* Errors can result in improperly nested cleanups. Which results in
3213 confusion when trying to resolve the WITH_CLEANUP_EXPR. */
3214 if (errorcount || sorrycount)
3217 if (gimple_conditional_context ())
3219 /* If we're in a conditional context, this is more complex. We only
3220 want to run the cleanup if we actually ran the initialization that
3221 necessitates it, but we want to run it after the end of the
3222 conditional context. So we wrap the try/finally around the
3223 condition and use a flag to determine whether or not to actually
3224 run the destructor. Thus
3228 becomes (approximately)
3232 if (test) { A::A(temp); flag = 1; val = f(temp); }
3235 if (flag) A::~A(temp);
3240 tree flag = create_tmp_var (boolean_type_node, "cleanup");
3241 tree ffalse = build (MODIFY_EXPR, void_type_node, flag,
3242 boolean_false_node);
3243 tree ftrue = build (MODIFY_EXPR, void_type_node, flag,
3245 cleanup = build (COND_EXPR, void_type_node, flag, cleanup, NULL);
3246 wce = build (WITH_CLEANUP_EXPR, void_type_node, NULL_TREE,
3247 cleanup, NULL_TREE);
3248 append_to_statement_list (ffalse, &gimplify_ctxp->conditional_cleanups);
3249 append_to_statement_list (wce, &gimplify_ctxp->conditional_cleanups);
3250 append_to_statement_list (ftrue, pre_p);
3252 /* Because of this manipulation, and the EH edges that jump
3253 threading cannot redirect, the temporary (VAR) will appear
3254 to be used uninitialized. Don't warn. */
3255 TREE_NO_WARNING (var) = 1;
3259 wce = build (WITH_CLEANUP_EXPR, void_type_node, NULL_TREE,
3260 cleanup, NULL_TREE);
3261 append_to_statement_list (wce, pre_p);
3264 gimplify_stmt (&TREE_OPERAND (wce, 1));
3267 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
3269 static enum gimplify_status
3270 gimplify_target_expr (tree *expr_p, tree *pre_p, tree *post_p)
3272 tree targ = *expr_p;
3273 tree temp = TARGET_EXPR_SLOT (targ);
3274 tree init = TARGET_EXPR_INITIAL (targ);
3275 enum gimplify_status ret;
3279 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
3280 to the temps list. */
3281 gimple_add_tmp_var (temp);
3283 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
3284 expression is supposed to initialize the slot. */
3285 if (VOID_TYPE_P (TREE_TYPE (init)))
3286 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
3289 /* Special handling for BIND_EXPR can result in fewer temps. */
3291 if (TREE_CODE (init) == BIND_EXPR)
3292 gimplify_bind_expr (&init, temp, pre_p);
3295 init = build (MODIFY_EXPR, void_type_node, temp, init);
3296 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt,
3300 if (ret == GS_ERROR)
3302 append_to_statement_list (init, pre_p);
3304 /* If needed, push the cleanup for the temp. */
3305 if (TARGET_EXPR_CLEANUP (targ))
3307 gimplify_stmt (&TARGET_EXPR_CLEANUP (targ));
3308 gimple_push_cleanup (temp, TARGET_EXPR_CLEANUP (targ), pre_p);
3311 /* Only expand this once. */
3312 TREE_OPERAND (targ, 3) = init;
3313 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
3315 else if (!temp->decl.seen_in_bind_expr)
3316 /* We should have expanded this before. */
3323 /* Gimplification of expression trees. */
3325 /* Gimplify an expression which appears at statement context; usually, this
3326 means replacing it with a suitably gimple STATEMENT_LIST. */
3329 gimplify_stmt (tree *stmt_p)
3331 gimplify_expr (stmt_p, NULL, NULL, is_gimple_stmt, fb_none);
3334 /* Similarly, but force the result to be a STATEMENT_LIST. */
3337 gimplify_to_stmt_list (tree *stmt_p)
3339 gimplify_stmt (stmt_p);
3341 *stmt_p = alloc_stmt_list ();
3342 else if (TREE_CODE (*stmt_p) != STATEMENT_LIST)
3345 *stmt_p = alloc_stmt_list ();
3346 append_to_statement_list (t, stmt_p);
3351 /* Gimplifies the expression tree pointed by EXPR_P. Return 0 if
3352 gimplification failed.
3354 PRE_P points to the list where side effects that must happen before
3355 EXPR should be stored.
3357 POST_P points to the list where side effects that must happen after
3358 EXPR should be stored, or NULL if there is no suitable list. In
3359 that case, we copy the result to a temporary, emit the
3360 post-effects, and then return the temporary.
3362 GIMPLE_TEST_F points to a function that takes a tree T and
3363 returns nonzero if T is in the GIMPLE form requested by the
3364 caller. The GIMPLE predicates are in tree-gimple.c.
3366 This test is used twice. Before gimplification, the test is
3367 invoked to determine whether *EXPR_P is already gimple enough. If
3368 that fails, *EXPR_P is gimplified according to its code and
3369 GIMPLE_TEST_F is called again. If the test still fails, then a new
3370 temporary variable is created and assigned the value of the
3371 gimplified expression.
3373 FALLBACK tells the function what sort of a temporary we want. If the 1
3374 bit is set, an rvalue is OK. If the 2 bit is set, an lvalue is OK.
3375 If both are set, either is OK, but an lvalue is preferable.
3377 The return value is either GS_ERROR or GS_ALL_DONE, since this function
3378 iterates until solution. */
3380 enum gimplify_status
3381 gimplify_expr (tree *expr_p, tree *pre_p, tree *post_p,
3382 bool (* gimple_test_f) (tree), fallback_t fallback)
3385 tree internal_pre = NULL_TREE;
3386 tree internal_post = NULL_TREE;
3388 int is_statement = (pre_p == NULL);
3390 location_t saved_location;
3391 enum gimplify_status ret;
3393 save_expr = *expr_p;
3394 if (save_expr == NULL_TREE)
3397 /* We used to check the predicate here and return immediately if it
3398 succeeds. This is wrong; the design is for gimplification to be
3399 idempotent, and for the predicates to only test for valid forms, not
3400 whether they are fully simplified. */
3402 /* Set up our internal queues if needed. */
3404 pre_p = &internal_pre;
3406 post_p = &internal_post;
3408 saved_location = input_location;
3409 if (save_expr == error_mark_node)
3412 locus = EXPR_LOCUS (save_expr);
3414 input_location = *locus;
3416 /* Loop over the specific gimplifiers until the toplevel node
3417 remains the same. */
3420 /* Strip any uselessness. */
3421 STRIP_MAIN_TYPE_NOPS (*expr_p);
3423 /* Remember the expr. */
3424 save_expr = *expr_p;
3426 /* Die, die, die, my darling. */
3427 if (save_expr == error_mark_node
3428 || (TREE_TYPE (save_expr)
3429 && TREE_TYPE (save_expr) == error_mark_node))
3435 /* Do any language-specific gimplification. */
3436 ret = lang_hooks.gimplify_expr (expr_p, pre_p, post_p);
3439 if (*expr_p == NULL_TREE)
3441 if (*expr_p != save_expr)
3444 else if (ret != GS_UNHANDLED)
3448 switch (TREE_CODE (*expr_p))
3450 /* First deal with the special cases. */
3452 case POSTINCREMENT_EXPR:
3453 case POSTDECREMENT_EXPR:
3454 case PREINCREMENT_EXPR:
3455 case PREDECREMENT_EXPR:
3456 ret = gimplify_self_mod_expr (expr_p, pre_p, post_p,
3457 fallback != fb_none);
3461 case ARRAY_RANGE_REF:
3465 ret = gimplify_compound_lval (expr_p, pre_p, post_p,
3466 fallback & fb_lvalue);
3470 ret = gimplify_cond_expr (expr_p, pre_p, NULL_TREE);
3474 ret = gimplify_call_expr (expr_p, pre_p, gimple_test_f);
3481 ret = gimplify_compound_expr (expr_p, pre_p, fallback != fb_none);
3486 ret = gimplify_modify_expr (expr_p, pre_p, post_p,
3487 fallback != fb_none);
3490 case TRUTH_ANDIF_EXPR:
3491 case TRUTH_ORIF_EXPR:
3492 ret = gimplify_boolean_expr (expr_p);
3495 case TRUTH_NOT_EXPR:
3496 TREE_OPERAND (*expr_p, 0)
3497 = gimple_boolify (TREE_OPERAND (*expr_p, 0));
3498 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3499 is_gimple_val, fb_rvalue);
3500 recalculate_side_effects (*expr_p);
3504 ret = gimplify_addr_expr (expr_p, pre_p, post_p);
3508 ret = gimplify_va_arg_expr (expr_p, pre_p, post_p);
3511 case VIEW_CONVERT_EXPR:
3512 if (VOID_TYPE_P (TREE_TYPE (*expr_p))
3513 || fallback == fb_none)
3515 /* Just strip a conversion to void (or in void context) and
3517 *expr_p = TREE_OPERAND (*expr_p, 0);
3521 /* If both types are BLKmode or if one type is of variable size,
3522 convert this into a pointer punning operation. This avoids
3523 copies of large data or making a variable-size temporary. */
3524 if ((TYPE_MODE (TREE_TYPE (*expr_p)) == BLKmode
3525 && TYPE_MODE (TREE_TYPE (TREE_OPERAND (*expr_p, 0))) == BLKmode)
3526 || !TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (*expr_p)))
3527 || !TREE_CONSTANT (TYPE_SIZE (TREE_TYPE
3528 (TREE_OPERAND (*expr_p,0)))))
3530 tree restype = TREE_TYPE (*expr_p);
3531 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (*expr_p),
3532 fold_convert (build_pointer_type (restype),
3534 (TREE_OPERAND (*expr_p, 0))));
3541 if (IS_EMPTY_STMT (*expr_p))
3547 if (VOID_TYPE_P (TREE_TYPE (*expr_p))
3548 || fallback == fb_none)
3550 /* Just strip a conversion to void (or in void context) and
3552 *expr_p = TREE_OPERAND (*expr_p, 0);
3556 ret = gimplify_conversion (expr_p);
3557 if (ret == GS_ERROR)
3559 if (*expr_p != save_expr)
3563 case FIX_TRUNC_EXPR:
3565 case FIX_FLOOR_EXPR:
3566 case FIX_ROUND_EXPR:
3568 /* unary_expr: ... | '(' cast ')' val | ... */
3569 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3570 is_gimple_val, fb_rvalue);
3571 recalculate_side_effects (*expr_p);
3575 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3576 is_gimple_reg, fb_rvalue);
3577 recalculate_side_effects (*expr_p);
3580 /* Constants need not be gimplified. */
3590 *expr_p = DECL_INITIAL (*expr_p);
3594 /* FIXME make this a decl. */
3599 ret = gimplify_bind_expr (expr_p, NULL, pre_p);
3603 ret = gimplify_loop_expr (expr_p, pre_p);
3607 ret = gimplify_switch_expr (expr_p, pre_p);
3610 case LABELED_BLOCK_EXPR:
3611 ret = gimplify_labeled_block_expr (expr_p);
3614 case EXIT_BLOCK_EXPR:
3615 ret = gimplify_exit_block_expr (expr_p);
3619 ret = gimplify_exit_expr (expr_p);
3623 /* If the target is not LABEL, then it is a computed jump
3624 and the target needs to be gimplified. */
3625 if (TREE_CODE (GOTO_DESTINATION (*expr_p)) != LABEL_DECL)
3626 ret = gimplify_expr (&GOTO_DESTINATION (*expr_p), pre_p,
3627 NULL, is_gimple_val, fb_rvalue);
3632 #ifdef ENABLE_CHECKING
3633 if (decl_function_context (LABEL_EXPR_LABEL (*expr_p)) != current_function_decl)
3638 case CASE_LABEL_EXPR:
3639 ret = gimplify_case_label_expr (expr_p);
3643 ret = gimplify_return_expr (*expr_p, pre_p);
3647 /* Don't reduce this in place; let gimplify_init_constructor work
3652 /* The following are special cases that are not handled by the
3653 original GIMPLE grammar. */
3655 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
3658 ret = gimplify_save_expr (expr_p, pre_p, post_p);
3663 enum gimplify_status r0, r1, r2;
3665 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3666 is_gimple_min_lval, fb_either);
3667 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
3668 is_gimple_val, fb_rvalue);
3669 r2 = gimplify_expr (&TREE_OPERAND (*expr_p, 2), pre_p, post_p,
3670 is_gimple_val, fb_rvalue);
3671 recalculate_side_effects (*expr_p);
3673 ret = MIN (r0, MIN (r1, r2));
3677 case NON_LVALUE_EXPR:
3678 /* This should have been stripped above. */
3683 ret = gimplify_asm_expr (expr_p, pre_p, post_p);
3686 case TRY_FINALLY_EXPR:
3687 case TRY_CATCH_EXPR:
3688 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p, 0));
3689 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p, 1));
3693 case CLEANUP_POINT_EXPR:
3694 ret = gimplify_cleanup_point_expr (expr_p, pre_p);
3698 ret = gimplify_target_expr (expr_p, pre_p, post_p);
3702 gimplify_to_stmt_list (&CATCH_BODY (*expr_p));
3706 case EH_FILTER_EXPR:
3707 gimplify_to_stmt_list (&EH_FILTER_FAILURE (*expr_p));
3713 enum gimplify_status r0, r1;
3714 r0 = gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p), pre_p, post_p,
3715 is_gimple_val, fb_rvalue);
3716 r1 = gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p), pre_p, post_p,
3717 is_gimple_val, fb_rvalue);
3724 ret = gimplify_minimax_expr (expr_p, pre_p, post_p);
3728 /* We get here when taking the address of a label. We mark
3729 the label as "forced"; meaning it can never be removed and
3730 it is a potential target for any computed goto. */
3731 FORCED_LABEL (*expr_p) = 1;
3735 case STATEMENT_LIST:
3736 ret = gimplify_statement_list (expr_p);
3740 /* ??? If this is a local variable, and it has not been seen in any
3741 outer BIND_EXPR, then it's probably the result of a duplicate
3742 declaration, for which we've already issued an error. It would
3743 be really nice if the front end wouldn't leak these at all.
3744 Currently the only known culprit is C++ destructors, as seen
3745 in g++.old-deja/g++.jason/binding.C. */
3747 if (!TREE_STATIC (tmp) && !DECL_EXTERNAL (tmp)
3748 && decl_function_context (tmp) == current_function_decl
3749 && !tmp->decl.seen_in_bind_expr)
3751 #ifdef ENABLE_CHECKING
3752 if (!errorcount && !sorrycount)
3762 /* If this is a comparison of objects of aggregate type, handle
3763 it specially (by converting to a call to memcmp). It would be
3764 nice to only have to do this for variable-sized objects, but
3765 then we'd have to allow the same nest of reference nodes we
3766 allow for MODIFY_EXPR and that's too complex. */
3767 if (TREE_CODE_CLASS (TREE_CODE (*expr_p)) == '<'
3768 && (AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p, 1)))))
3769 ret = gimplify_variable_sized_compare (expr_p);
3771 /* If *EXPR_P does not need to be special-cased, handle it
3772 according to its class. */
3773 else if (TREE_CODE_CLASS (TREE_CODE (*expr_p)) == '1')
3774 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
3775 post_p, is_gimple_val, fb_rvalue);
3776 else if (TREE_CODE_CLASS (TREE_CODE (*expr_p)) == '2'
3777 || TREE_CODE_CLASS (TREE_CODE (*expr_p)) == '<'
3778 || TREE_CODE (*expr_p) == TRUTH_AND_EXPR
3779 || TREE_CODE (*expr_p) == TRUTH_OR_EXPR
3780 || TREE_CODE (*expr_p) == TRUTH_XOR_EXPR)
3782 enum gimplify_status r0, r1;
3784 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
3785 post_p, is_gimple_val, fb_rvalue);
3786 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
3787 post_p, is_gimple_val, fb_rvalue);
3791 else if (TREE_CODE_CLASS (TREE_CODE (*expr_p)) == 'd'
3792 || TREE_CODE_CLASS (TREE_CODE (*expr_p)) == 'c')
3798 /* Fail if we don't know how to handle this tree code. */
3801 recalculate_side_effects (*expr_p);
3805 /* If we replaced *expr_p, gimplify again. */
3806 if (ret == GS_OK && (*expr_p == NULL || *expr_p == save_expr))
3809 while (ret == GS_OK);
3811 /* If we encountered an error_mark somewhere nested inside, either
3812 stub out the statement or propagate the error back out. */
3813 if (ret == GS_ERROR)
3820 #ifdef ENABLE_CHECKING
3821 /* This was only valid as a return value from the langhook, which
3822 we handled. Make sure it doesn't escape from any other context. */
3823 if (ret == GS_UNHANDLED)
3827 if (fallback == fb_none && *expr_p && !is_gimple_stmt (*expr_p))
3829 /* We aren't looking for a value, and we don't have a valid
3830 statement. If it doesn't have side-effects, throw it away. */
3831 if (!TREE_SIDE_EFFECTS (*expr_p))
3833 else if (!TREE_THIS_VOLATILE (*expr_p))
3835 /* This is probably a _REF that contains something nested that
3836 has side effects. Recurse through the operands to find it. */
3837 enum tree_code code = TREE_CODE (*expr_p);
3839 if (code == COMPONENT_REF
3840 || code == REALPART_EXPR || code == IMAGPART_EXPR)
3841 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3842 gimple_test_f, fallback);
3843 else if (code == ARRAY_REF || code == ARRAY_RANGE_REF)
3845 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3846 gimple_test_f, fallback);
3847 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
3848 gimple_test_f, fallback);
3851 /* Anything else with side-effects
3852 must be converted to a valid statement before we get here. */
3857 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p)))
3859 /* Historically, the compiler has treated a bare
3860 reference to a volatile lvalue as forcing a load. */
3861 tree tmp = create_tmp_var (TREE_TYPE (*expr_p), "vol");
3862 *expr_p = build (MODIFY_EXPR, TREE_TYPE (tmp), tmp, *expr_p);
3865 /* We can't do anything useful with a volatile reference to
3866 incomplete type, so just throw it away. */
3870 /* If we are gimplifying at the statement level, we're done. Tack
3871 everything together and replace the original statement with the
3873 if (fallback == fb_none || is_statement)
3875 if (internal_pre || internal_post)
3877 append_to_statement_list (*expr_p, &internal_pre);
3878 append_to_statement_list (internal_post, &internal_pre);
3879 annotate_all_with_locus (&internal_pre, input_location);
3880 *expr_p = internal_pre;
3884 else if (TREE_CODE (*expr_p) == STATEMENT_LIST)
3885 annotate_all_with_locus (expr_p, input_location);
3887 annotate_one_with_locus (*expr_p, input_location);
3891 /* Otherwise we're gimplifying a subexpression, so the resulting value is
3894 /* If it's sufficiently simple already, we're done. Unless we are
3895 handling some post-effects internally; if that's the case, we need to
3896 copy into a temp before adding the post-effects to the tree. */
3897 if (!internal_post && (*gimple_test_f) (*expr_p))
3900 /* Otherwise, we need to create a new temporary for the gimplified
3903 /* We can't return an lvalue if we have an internal postqueue. The
3904 object the lvalue refers to would (probably) be modified by the
3905 postqueue; we need to copy the value out first, which means an
3907 if ((fallback & fb_lvalue) && !internal_post
3908 && is_gimple_addr_expr_arg (*expr_p))
3910 /* An lvalue will do. Take the address of the expression, store it
3911 in a temporary, and replace the expression with an INDIRECT_REF of
3913 tmp = build_fold_addr_expr (*expr_p);
3914 gimplify_expr (&tmp, pre_p, post_p, is_gimple_reg, fb_rvalue);
3915 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (tmp)), tmp);
3917 else if ((fallback & fb_rvalue) && is_gimple_rhs (*expr_p))
3919 #if defined ENABLE_CHECKING
3920 if (VOID_TYPE_P (TREE_TYPE (*expr_p)))
3924 /* An rvalue will do. Assign the gimplified expression into a new
3925 temporary TMP and replace the original expression with TMP. */
3927 if (internal_post || (fallback & fb_lvalue))
3928 /* The postqueue might change the value of the expression between
3929 the initialization and use of the temporary, so we can't use a
3930 formal temp. FIXME do we care? */
3931 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
3933 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
3935 else if (fallback & fb_mayfail)
3937 /* If this is an asm statement, and the user asked for the impossible,
3938 don't abort. Fail and let gimplify_asm_expr issue an error. */
3944 fprintf (stderr, "gimplification failed:\n");
3945 print_generic_expr (stderr, *expr_p, 0);
3946 debug_tree (*expr_p);
3950 #if defined ENABLE_CHECKING
3951 /* Make sure the temporary matches our predicate. */
3952 if (!(*gimple_test_f) (*expr_p))
3958 annotate_all_with_locus (&internal_post, input_location);
3959 append_to_statement_list (internal_post, pre_p);
3963 input_location = saved_location;
3967 /* Look through TYPE for variable-sized objects and gimplify each such
3968 size that we find. Add to LIST_P any statements generated. */
3971 gimplify_type_sizes (tree type, tree *list_p)
3975 switch (TREE_CODE (type))
3985 gimplify_one_sizepos (&TYPE_MIN_VALUE (type), list_p);
3986 gimplify_one_sizepos (&TYPE_MAX_VALUE (type), list_p);
3990 /* These anonymous types don't have declarations, so handle them here. */
3991 gimplify_type_sizes (TYPE_DOMAIN (type), list_p);
3996 case QUAL_UNION_TYPE:
3997 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3998 if (TREE_CODE (field) == FIELD_DECL)
3999 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field), list_p);
4006 gimplify_one_sizepos (&TYPE_SIZE (type), list_p);
4007 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type), list_p);
4010 /* Subroutine of the above to gimplify one size or position, *EXPR_P.
4011 We add any required statements to STMT_P. */
4014 gimplify_one_sizepos (tree *expr_p, tree *stmt_p)
4016 /* We don't do anything if the value isn't there, is constant, or contains
4017 A PLACEHOLDER_EXPR. */
4018 if (*expr_p == NULL_TREE || TREE_CONSTANT (*expr_p)
4019 || CONTAINS_PLACEHOLDER_P (*expr_p))
4022 gimplify_expr (expr_p, stmt_p, NULL, is_gimple_val, fb_rvalue);
4025 #ifdef ENABLE_CHECKING
4026 /* Compare types A and B for a "close enough" match. */
4029 cpt_same_type (tree a, tree b)
4031 if (lang_hooks.types_compatible_p (a, b))
4034 /* ??? The C++ FE decomposes METHOD_TYPES to FUNCTION_TYPES and doesn't
4035 link them together. This routine is intended to catch type errors
4036 that will affect the optimizers, and the optimizers don't add new
4037 dereferences of function pointers, so ignore it. */
4038 if ((TREE_CODE (a) == FUNCTION_TYPE || TREE_CODE (a) == METHOD_TYPE)
4039 && (TREE_CODE (b) == FUNCTION_TYPE || TREE_CODE (b) == METHOD_TYPE))
4042 /* ??? The C FE pushes type qualifiers after the fact into the type of
4043 the element from the type of the array. See build_unary_op's handling
4044 of ADDR_EXPR. This seems wrong -- if we were going to do this, we
4045 should have done it when creating the variable in the first place.
4046 Alternately, why aren't the two array types made variants? */
4047 if (TREE_CODE (a) == ARRAY_TYPE && TREE_CODE (b) == ARRAY_TYPE)
4048 return cpt_same_type (TREE_TYPE (a), TREE_TYPE (b));
4050 /* And because of those, we have to recurse down through pointers. */
4051 if (POINTER_TYPE_P (a) && POINTER_TYPE_P (b))
4052 return cpt_same_type (TREE_TYPE (a), TREE_TYPE (b));
4057 /* Check for some cases of the front end missing cast expressions.
4058 The type of a dereference should correspond to the pointer type;
4059 similarly the type of an address should match its object. */
4062 check_pointer_types_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
4063 void *data ATTRIBUTE_UNUSED)
4066 tree ptype, otype, dtype;
4068 switch (TREE_CODE (t))
4072 otype = TREE_TYPE (t);
4073 ptype = TREE_TYPE (TREE_OPERAND (t, 0));
4074 dtype = TREE_TYPE (ptype);
4075 if (!cpt_same_type (otype, dtype))
4080 ptype = TREE_TYPE (t);
4081 otype = TREE_TYPE (TREE_OPERAND (t, 0));
4082 dtype = TREE_TYPE (ptype);
4083 if (!cpt_same_type (otype, dtype))
4085 /* &array is allowed to produce a pointer to the element, rather than
4086 a pointer to the array type. We must allow this in order to
4087 properly represent assigning the address of an array in C into
4088 pointer to the element type. */
4089 if (TREE_CODE (otype) == ARRAY_TYPE
4090 && POINTER_TYPE_P (ptype)
4091 && cpt_same_type (TREE_TYPE (otype), dtype))
4106 /* Gimplify the body of statements pointed by BODY_P. FNDECL is the
4107 function decl containing BODY. */
4110 gimplify_body (tree *body_p, tree fndecl)
4112 location_t saved_location = input_location;
4115 timevar_push (TV_TREE_GIMPLIFY);
4116 push_gimplify_context ();
4118 /* Unshare most shared trees in the body and in that of any nested functions.
4119 It would seem we don't have to do this for nested functions because
4120 they are supposed to be output and then the outer function gimplified
4121 first, but the g++ front end doesn't always do it that way. */
4122 unshare_body (body_p, fndecl);
4123 unvisit_body (body_p, fndecl);
4125 /* Make sure input_location isn't set to something wierd. */
4126 input_location = DECL_SOURCE_LOCATION (fndecl);
4128 /* Gimplify the function's body. */
4129 gimplify_stmt (body_p);
4132 /* Unshare again, in case gimplification was sloppy. */
4133 unshare_all_trees (body);
4136 body = alloc_stmt_list ();
4137 else if (TREE_CODE (body) == STATEMENT_LIST)
4139 tree t = expr_only (*body_p);
4144 /* If there isn't an outer BIND_EXPR, add one. */
4145 if (TREE_CODE (body) != BIND_EXPR)
4147 tree b = build (BIND_EXPR, void_type_node, NULL_TREE,
4148 NULL_TREE, NULL_TREE);
4149 TREE_SIDE_EFFECTS (b) = 1;
4150 append_to_statement_list_force (body, &BIND_EXPR_BODY (b));
4155 pop_gimplify_context (body);
4157 #ifdef ENABLE_CHECKING
4158 walk_tree (body_p, check_pointer_types_r, NULL, NULL);
4161 timevar_pop (TV_TREE_GIMPLIFY);
4162 input_location = saved_location;
4165 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
4166 node for the function we want to gimplify. */
4169 gimplify_function_tree (tree fndecl)
4173 oldfn = current_function_decl;
4174 current_function_decl = fndecl;
4176 gimplify_body (&DECL_SAVED_TREE (fndecl), fndecl);
4178 /* If we're instrumenting function entry/exit, then prepend the call to
4179 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
4180 catch the exit hook. */
4181 /* ??? Add some way to ignore exceptions for this TFE. */
4182 if (flag_instrument_function_entry_exit
4183 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl))
4187 tf = build (TRY_FINALLY_EXPR, void_type_node, NULL, NULL);
4188 TREE_SIDE_EFFECTS (tf) = 1;
4189 x = DECL_SAVED_TREE (fndecl);
4190 append_to_statement_list (x, &TREE_OPERAND (tf, 0));
4191 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_EXIT];
4192 x = build_function_call_expr (x, NULL);
4193 append_to_statement_list (x, &TREE_OPERAND (tf, 1));
4195 bind = build (BIND_EXPR, void_type_node, NULL, NULL, NULL);
4196 TREE_SIDE_EFFECTS (bind) = 1;
4197 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_ENTER];
4198 x = build_function_call_expr (x, NULL);
4199 append_to_statement_list (x, &BIND_EXPR_BODY (bind));
4200 append_to_statement_list (tf, &BIND_EXPR_BODY (bind));
4202 DECL_SAVED_TREE (fndecl) = bind;
4205 current_function_decl = oldfn;
4208 #include "gt-gimplify.h"