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 enum gimplify_status gimplify_compound_expr (tree *, tree *, bool);
78 /* Return a hash value for a formal temporary table entry. */
81 gimple_tree_hash (const void *p)
83 tree t = ((const elt_t *) p)->val;
84 return iterative_hash_expr (t, 0);
87 /* Compare two formal temporary table entries. */
90 gimple_tree_eq (const void *p1, const void *p2)
92 tree t1 = ((const elt_t *) p1)->val;
93 tree t2 = ((const elt_t *) p2)->val;
94 enum tree_code code = TREE_CODE (t1);
96 if (TREE_CODE (t2) != code
97 || TREE_TYPE (t1) != TREE_TYPE (t2))
100 if (!operand_equal_p (t1, t2, 0))
103 /* Only allow them to compare equal if they also hash equal; otherwise
104 results are nondeterminate, and we fail bootstrap comparison. */
105 if (gimple_tree_hash (p1) != gimple_tree_hash (p2))
111 /* Set up a context for the gimplifier. */
114 push_gimplify_context (void)
119 = (struct gimplify_ctx *) xcalloc (1, sizeof (struct gimplify_ctx));
120 gimplify_ctxp->temp_htab
121 = htab_create (1000, gimple_tree_hash, gimple_tree_eq, free);
124 /* Tear down a context for the gimplifier. If BODY is non-null, then
125 put the temporaries into the outer BIND_EXPR. Otherwise, put them
126 in the unexpanded_var_list. */
129 pop_gimplify_context (tree body)
131 if (!gimplify_ctxp || gimplify_ctxp->current_bind_expr)
135 declare_tmp_vars (gimplify_ctxp->temps, body);
137 record_vars (gimplify_ctxp->temps);
141 fprintf (stderr, " collisions: %f ",
142 htab_collisions (gimplify_ctxp->temp_htab));
145 htab_delete (gimplify_ctxp->temp_htab);
146 free (gimplify_ctxp);
147 gimplify_ctxp = NULL;
151 gimple_push_bind_expr (tree bind)
153 TREE_CHAIN (bind) = gimplify_ctxp->current_bind_expr;
154 gimplify_ctxp->current_bind_expr = bind;
158 gimple_pop_bind_expr (void)
160 gimplify_ctxp->current_bind_expr
161 = TREE_CHAIN (gimplify_ctxp->current_bind_expr);
165 gimple_current_bind_expr (void)
167 return gimplify_ctxp->current_bind_expr;
170 /* Returns true iff there is a COND_EXPR between us and the innermost
171 CLEANUP_POINT_EXPR. This info is used by gimple_push_cleanup. */
174 gimple_conditional_context (void)
176 return gimplify_ctxp->conditions > 0;
179 /* Note that we've entered a COND_EXPR. */
182 gimple_push_condition (void)
184 ++(gimplify_ctxp->conditions);
187 /* Note that we've left a COND_EXPR. If we're back at unconditional scope
188 now, add any conditional cleanups we've seen to the prequeue. */
191 gimple_pop_condition (tree *pre_p)
193 int conds = --(gimplify_ctxp->conditions);
197 append_to_statement_list (gimplify_ctxp->conditional_cleanups, pre_p);
198 gimplify_ctxp->conditional_cleanups = NULL_TREE;
204 /* A subroutine of append_to_statement_list{,_force}. */
207 append_to_statement_list_1 (tree t, tree *list_p, bool side_effects)
210 tree_stmt_iterator i;
217 if (t && TREE_CODE (t) == STATEMENT_LIST)
222 *list_p = list = alloc_stmt_list ();
226 tsi_link_after (&i, t, TSI_CONTINUE_LINKING);
229 /* Add T to the end of the list container pointed by LIST_P.
230 If T is an expression with no effects, it is ignored. */
233 append_to_statement_list (tree t, tree *list_p)
235 append_to_statement_list_1 (t, list_p, t ? TREE_SIDE_EFFECTS (t) : false);
238 /* Similar, but the statement is always added, regardless of side effects. */
241 append_to_statement_list_force (tree t, tree *list_p)
243 append_to_statement_list_1 (t, list_p, t != NULL);
246 /* Both gimplify the statement T and append it to LIST_P. */
249 gimplify_and_add (tree t, tree *list_p)
252 append_to_statement_list (t, list_p);
255 /* Strip off a legitimate source ending from the input string NAME of
256 length LEN. Rather than having to know the names used by all of
257 our front ends, we strip off an ending of a period followed by
258 up to five characters. (Java uses ".class".) */
261 remove_suffix (char *name, int len)
265 for (i = 2; i < 8 && len > i; i++)
267 if (name[len - i] == '.')
269 name[len - i] = '\0';
275 /* Create a nameless artificial label and put it in the current function
276 context. Returns the newly created label. */
279 create_artificial_label (void)
281 tree lab = build_decl (LABEL_DECL, NULL_TREE, void_type_node);
283 DECL_ARTIFICIAL (lab) = 1;
284 DECL_CONTEXT (lab) = current_function_decl;
288 /* Create a new temporary name with PREFIX. Returns an identifier. */
290 static GTY(()) unsigned int tmp_var_id_num;
293 create_tmp_var_name (const char *prefix)
299 char *preftmp = ASTRDUP (prefix);
301 remove_suffix (preftmp, strlen (preftmp));
305 ASM_FORMAT_PRIVATE_NAME (tmp_name, prefix ? prefix : "T", tmp_var_id_num++);
306 return get_identifier (tmp_name);
310 /* Create a new temporary variable declaration of type TYPE.
311 Does NOT push it into the current binding. */
314 create_tmp_var_raw (tree type, const char *prefix)
319 /* Make the type of the variable writable. */
320 new_type = build_type_variant (type, 0, 0);
321 TYPE_ATTRIBUTES (new_type) = TYPE_ATTRIBUTES (type);
323 tmp_var = build_decl (VAR_DECL, create_tmp_var_name (prefix), type);
325 /* The variable was declared by the compiler. */
326 DECL_ARTIFICIAL (tmp_var) = 1;
327 /* And we don't want debug info for it. */
328 DECL_IGNORED_P (tmp_var) = 1;
330 /* Make the variable writable. */
331 TREE_READONLY (tmp_var) = 0;
333 DECL_EXTERNAL (tmp_var) = 0;
334 TREE_STATIC (tmp_var) = 0;
335 TREE_USED (tmp_var) = 1;
340 /* Create a new temporary variable declaration of type TYPE. DOES push the
341 variable into the current binding. Further, assume that this is called
342 only from gimplification or optimization, at which point the creation of
343 certain types are bugs. */
346 create_tmp_var (tree type, const char *prefix)
350 #if defined ENABLE_CHECKING
351 /* We don't allow types that are addressable (meaning we can't make copies),
352 incomplete, or of variable size. */
353 if (TREE_ADDRESSABLE (type)
354 || !COMPLETE_TYPE_P (type)
355 || TREE_CODE (TYPE_SIZE_UNIT (type)) != INTEGER_CST)
359 tmp_var = create_tmp_var_raw (type, prefix);
360 gimple_add_tmp_var (tmp_var);
364 /* Given a tree, try to return a useful variable name that we can use
365 to prefix a temporary that is being assigned the value of the tree.
366 I.E. given <temp> = &A, return A. */
374 STRIP_NOPS (stripped_decl);
375 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
376 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
379 switch (TREE_CODE (stripped_decl))
382 return get_name (TREE_OPERAND (stripped_decl, 0));
390 /* Create a temporary with a name derived from VAL. Subroutine of
391 lookup_tmp_var; nobody else should call this function. */
394 create_tmp_from_val (tree val)
396 return create_tmp_var (TREE_TYPE (val), get_name (val));
399 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
400 an existing expression temporary. */
403 lookup_tmp_var (tree val, bool is_formal)
405 if (!is_formal || TREE_SIDE_EFFECTS (val))
406 return create_tmp_from_val (val);
413 slot = htab_find_slot (gimplify_ctxp->temp_htab, (void *)&elt, INSERT);
416 elt_p = xmalloc (sizeof (*elt_p));
418 elt_p->temp = create_tmp_from_val (val);
419 TREE_READONLY (elt_p->temp) = 1;
420 *slot = (void *) elt_p;
423 elt_p = (elt_t *) *slot;
429 /* Returns a formal temporary variable initialized with VAL. PRE_P is as
430 in gimplify_expr. Only use this function if:
432 1) The value of the unfactored expression represented by VAL will not
433 change between the initialization and use of the temporary, and
434 2) The temporary will not be otherwise modified.
436 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
437 and #2 means it is inappropriate for && temps.
439 For other cases, use get_initialized_tmp_var instead. */
442 internal_get_tmp_var (tree val, tree *pre_p, tree *post_p, bool is_formal)
447 gimplify_expr (&val, pre_p, post_p, is_gimple_tmp_rhs, fb_rvalue);
449 t = lookup_tmp_var (val, is_formal);
451 mod = build (MODIFY_EXPR, TREE_TYPE (t), t, val);
453 class = TREE_CODE_CLASS (TREE_CODE (val));
454 if (EXPR_HAS_LOCATION (val))
455 SET_EXPR_LOCUS (mod, EXPR_LOCUS (val));
457 SET_EXPR_LOCATION (mod, input_location);
459 /* gimplify_modify_expr might want to reduce this further. */
460 gimplify_and_add (mod, pre_p);
465 get_formal_tmp_var (tree val, tree *pre_p)
467 return internal_get_tmp_var (val, pre_p, NULL, true);
470 /* Returns a temporary variable initialized with VAL. PRE_P and POST_P
471 are as in gimplify_expr. */
474 get_initialized_tmp_var (tree val, tree *pre_p, tree *post_p)
476 return internal_get_tmp_var (val, pre_p, post_p, false);
479 /* Returns true if T is a GIMPLE temporary variable, false otherwise. */
482 is_gimple_tmp_var (tree t)
484 /* FIXME this could trigger for other local artificials, too. */
485 return (TREE_CODE (t) == VAR_DECL && DECL_ARTIFICIAL (t)
486 && !TREE_STATIC (t) && !DECL_EXTERNAL (t));
489 /* Declares all the variables in VARS in SCOPE. */
492 declare_tmp_vars (tree vars, tree scope)
499 /* C99 mode puts the default 'return 0;' for main outside the outer
500 braces. So drill down until we find an actual scope. */
501 while (TREE_CODE (scope) == COMPOUND_EXPR)
502 scope = TREE_OPERAND (scope, 0);
504 if (TREE_CODE (scope) != BIND_EXPR)
507 temps = nreverse (last);
508 TREE_CHAIN (last) = BIND_EXPR_VARS (scope);
509 BIND_EXPR_VARS (scope) = temps;
514 gimple_add_tmp_var (tree tmp)
516 if (TREE_CHAIN (tmp) || DECL_SEEN_IN_BIND_EXPR_P (tmp))
519 DECL_CONTEXT (tmp) = current_function_decl;
520 DECL_SEEN_IN_BIND_EXPR_P (tmp) = 1;
524 TREE_CHAIN (tmp) = gimplify_ctxp->temps;
525 gimplify_ctxp->temps = tmp;
530 declare_tmp_vars (tmp, DECL_SAVED_TREE (current_function_decl));
533 /* Determines whether to assign a locus to the statement STMT. */
536 should_carry_locus_p (tree stmt)
538 /* Don't emit a line note for a label. We particularly don't want to
539 emit one for the break label, since it doesn't actually correspond
540 to the beginning of the loop/switch. */
541 if (TREE_CODE (stmt) == LABEL_EXPR)
544 /* Do not annotate empty statements, since it confuses gcov. */
545 if (!TREE_SIDE_EFFECTS (stmt))
552 annotate_one_with_locus (tree t, location_t locus)
554 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (t)))
555 && ! EXPR_HAS_LOCATION (t)
556 && should_carry_locus_p (t))
557 SET_EXPR_LOCATION (t, locus);
561 annotate_all_with_locus (tree *stmt_p, location_t locus)
563 tree_stmt_iterator i;
568 for (i = tsi_start (*stmt_p); !tsi_end_p (i); tsi_next (&i))
570 tree t = tsi_stmt (i);
572 #ifdef ENABLE_CHECKING
573 /* Assuming we've already been gimplified, we shouldn't
574 see nested chaining constructs anymore. */
575 if (TREE_CODE (t) == STATEMENT_LIST
576 || TREE_CODE (t) == COMPOUND_EXPR)
580 annotate_one_with_locus (t, locus);
584 /* Similar to copy_tree_r() but do not copy SAVE_EXPR or TARGET_EXPR nodes.
585 These nodes model computations that should only be done once. If we
586 were to unshare something like SAVE_EXPR(i++), the gimplification
587 process would create wrong code. */
590 mostly_copy_tree_r (tree *tp, int *walk_subtrees, void *data)
592 enum tree_code code = TREE_CODE (*tp);
593 /* Don't unshare types, decls, constants and SAVE_EXPR nodes. */
594 if (TREE_CODE_CLASS (code) == 't'
595 || TREE_CODE_CLASS (code) == 'd'
596 || TREE_CODE_CLASS (code) == 'c'
597 || code == SAVE_EXPR || code == TARGET_EXPR
598 /* We can't do anything sensible with a BLOCK used as an expression,
599 but we also can't abort when we see it because of non-expression
600 uses. So just avert our eyes and cross our fingers. Silly Java. */
603 else if (code == BIND_EXPR)
606 copy_tree_r (tp, walk_subtrees, data);
611 /* Mark all the _DECL nodes under *TP as volatile. FIXME: This must die
612 after VA_ARG_EXPRs are properly lowered. */
615 mark_decls_volatile_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
616 void *data ATTRIBUTE_UNUSED)
619 TREE_THIS_VOLATILE (*tp) = 1;
625 /* Callback for walk_tree to unshare most of the shared trees rooted at
626 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
627 then *TP is deep copied by calling copy_tree_r.
629 This unshares the same trees as copy_tree_r with the exception of
630 SAVE_EXPR nodes. These nodes model computations that should only be
631 done once. If we were to unshare something like SAVE_EXPR(i++), the
632 gimplification process would create wrong code. */
635 copy_if_shared_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
636 void *data ATTRIBUTE_UNUSED)
639 enum tree_code code = TREE_CODE (t);
641 /* Skip types, decls, and constants. But we do want to look at their
642 types and the bounds of types. Mark them as visited so we properly
643 unmark their subtrees on the unmark pass. If we've already seen them,
644 don't look down further. */
645 if (TREE_CODE_CLASS (code) == 't'
646 || TREE_CODE_CLASS (code) == 'd'
647 || TREE_CODE_CLASS (code) == 'c')
649 if (TREE_VISITED (t))
652 TREE_VISITED (t) = 1;
655 /* If this node has been visited already, unshare it and don't look
657 else if (TREE_VISITED (t))
659 walk_tree (tp, mostly_copy_tree_r, NULL, NULL);
663 /* Otherwise, mark the tree as visited and keep looking. */
666 TREE_VISITED (t) = 1;
667 if (TREE_CODE (*tp) == VA_ARG_EXPR
668 && targetm.gimplify_va_arg_expr == NULL)
670 /* Mark any _DECL inside the operand as volatile to avoid
671 the optimizers messing around with it. We have to do this
672 early, otherwise we might mark a variable as volatile
673 after we gimplify other statements that use the variable
674 assuming it's not volatile. */
676 /* FIXME once most targets define the above hook, this should
677 go away (perhaps along with the #include "target.h"). */
678 walk_tree (&TREE_OPERAND (*tp, 0), mark_decls_volatile_r,
687 unmark_visited_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
688 void *data ATTRIBUTE_UNUSED)
690 if (TREE_VISITED (*tp))
691 TREE_VISITED (*tp) = 0;
698 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
699 bodies of any nested functions if we are unsharing the entire body of
703 unshare_body (tree *body_p, tree fndecl)
705 struct cgraph_node *cgn = cgraph_node (fndecl);
707 walk_tree (body_p, copy_if_shared_r, NULL, NULL);
708 if (body_p == &DECL_SAVED_TREE (fndecl))
709 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
710 unshare_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
713 /* Likewise, but mark all trees as not visited. */
716 unvisit_body (tree *body_p, tree fndecl)
718 struct cgraph_node *cgn = cgraph_node (fndecl);
720 walk_tree (body_p, unmark_visited_r, NULL, NULL);
721 if (body_p == &DECL_SAVED_TREE (fndecl))
722 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
723 unvisit_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
726 /* Unshare T and all the trees reached from T via TREE_CHAIN. */
729 unshare_all_trees (tree t)
731 walk_tree (&t, copy_if_shared_r, NULL, NULL);
732 walk_tree (&t, unmark_visited_r, NULL, NULL);
735 /* Unconditionally make an unshared copy of EXPR. This is used when using
736 stored expressions which span multiple functions, such as BINFO_VTABLE,
737 as the normal unsharing process can't tell that they're shared. */
740 unshare_expr (tree expr)
742 walk_tree (&expr, mostly_copy_tree_r, NULL, NULL);
746 /* A terser interface for building a representation of a exception
750 gimple_build_eh_filter (tree body, tree allowed, tree failure)
754 /* FIXME should the allowed types go in TREE_TYPE? */
755 t = build (EH_FILTER_EXPR, void_type_node, allowed, NULL_TREE);
756 append_to_statement_list (failure, &EH_FILTER_FAILURE (t));
758 t = build (TRY_CATCH_EXPR, void_type_node, NULL_TREE, t);
759 append_to_statement_list (body, &TREE_OPERAND (t, 0));
765 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
766 contain statements and have a value. Assign its value to a temporary
767 and give it void_type_node. Returns the temporary, or NULL_TREE if
768 WRAPPER was already void. */
771 voidify_wrapper_expr (tree wrapper, tree temp)
773 if (!VOID_TYPE_P (TREE_TYPE (wrapper)))
775 tree *p, sub = wrapper;
778 /* Set p to point to the body of the wrapper. */
779 switch (TREE_CODE (sub))
782 /* For a BIND_EXPR, the body is operand 1. */
783 p = &BIND_EXPR_BODY (sub);
787 p = &TREE_OPERAND (sub, 0);
791 /* Advance to the last statement. Set all container types to void. */
792 if (TREE_CODE (*p) == STATEMENT_LIST)
794 tree_stmt_iterator i = tsi_last (*p);
795 p = tsi_end_p (i) ? NULL : tsi_stmt_ptr (i);
799 for (; TREE_CODE (*p) == COMPOUND_EXPR; p = &TREE_OPERAND (*p, 1))
801 TREE_SIDE_EFFECTS (*p) = 1;
802 TREE_TYPE (*p) = void_type_node;
806 if (p == NULL || IS_EMPTY_STMT (*p))
808 /* Look through exception handling. */
809 else if (TREE_CODE (*p) == TRY_FINALLY_EXPR
810 || TREE_CODE (*p) == TRY_CATCH_EXPR)
815 /* The C++ frontend already did this for us. */
816 else if (TREE_CODE (*p) == INIT_EXPR
817 || TREE_CODE (*p) == TARGET_EXPR)
818 temp = TREE_OPERAND (*p, 0);
819 /* If we're returning a dereference, move the dereference
820 outside the wrapper. */
821 else if (TREE_CODE (*p) == INDIRECT_REF)
823 tree ptr = TREE_OPERAND (*p, 0);
824 temp = create_tmp_var (TREE_TYPE (ptr), "retval");
825 *p = build (MODIFY_EXPR, TREE_TYPE (ptr), temp, ptr);
826 temp = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (temp)), temp);
827 /* If this is a BIND_EXPR for a const inline function, it might not
828 have TREE_SIDE_EFFECTS set. That is no longer accurate. */
829 TREE_SIDE_EFFECTS (wrapper) = 1;
834 temp = create_tmp_var (TREE_TYPE (wrapper), "retval");
835 *p = build (MODIFY_EXPR, TREE_TYPE (temp), temp, *p);
836 TREE_SIDE_EFFECTS (wrapper) = 1;
839 TREE_TYPE (wrapper) = void_type_node;
846 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
847 a temporary through which they communicate. */
850 build_stack_save_restore (tree *save, tree *restore)
852 tree save_call, tmp_var;
855 build_function_call_expr (implicit_built_in_decls[BUILT_IN_STACK_SAVE],
857 tmp_var = create_tmp_var (ptr_type_node, "saved_stack");
859 *save = build (MODIFY_EXPR, ptr_type_node, tmp_var, save_call);
861 build_function_call_expr (implicit_built_in_decls[BUILT_IN_STACK_RESTORE],
862 tree_cons (NULL_TREE, tmp_var, NULL_TREE));
865 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
867 static enum gimplify_status
868 gimplify_bind_expr (tree *expr_p, tree temp, tree *pre_p)
870 tree bind_expr = *expr_p;
871 bool old_save_stack = gimplify_ctxp->save_stack;
874 temp = voidify_wrapper_expr (bind_expr, temp);
876 /* Mark variables seen in this bind expr. */
877 for (t = BIND_EXPR_VARS (bind_expr); t ; t = TREE_CHAIN (t))
878 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
880 gimple_push_bind_expr (bind_expr);
881 gimplify_ctxp->save_stack = false;
883 gimplify_to_stmt_list (&BIND_EXPR_BODY (bind_expr));
885 if (gimplify_ctxp->save_stack)
887 tree stack_save, stack_restore;
889 /* Save stack on entry and restore it on exit. Add a try_finally
890 block to achieve this. Note that mudflap depends on the
891 format of the emitted code: see mx_register_decls(). */
892 build_stack_save_restore (&stack_save, &stack_restore);
894 t = build (TRY_FINALLY_EXPR, void_type_node,
895 BIND_EXPR_BODY (bind_expr), NULL_TREE);
896 append_to_statement_list (stack_restore, &TREE_OPERAND (t, 1));
898 BIND_EXPR_BODY (bind_expr) = NULL_TREE;
899 append_to_statement_list (stack_save, &BIND_EXPR_BODY (bind_expr));
900 append_to_statement_list (t, &BIND_EXPR_BODY (bind_expr));
903 gimplify_ctxp->save_stack = old_save_stack;
904 gimple_pop_bind_expr ();
909 append_to_statement_list (bind_expr, pre_p);
916 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
917 GIMPLE value, it is assigned to a new temporary and the statement is
918 re-written to return the temporary.
920 PRE_P points to the list where side effects that must happen before
921 STMT should be stored. */
923 static enum gimplify_status
924 gimplify_return_expr (tree stmt, tree *pre_p)
926 tree ret_expr = TREE_OPERAND (stmt, 0);
927 tree result_decl, result;
929 if (!ret_expr || TREE_CODE (ret_expr) == RESULT_DECL
930 || ret_expr == error_mark_node)
933 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
934 result_decl = NULL_TREE;
937 result_decl = TREE_OPERAND (ret_expr, 0);
938 #ifdef ENABLE_CHECKING
939 if ((TREE_CODE (ret_expr) != MODIFY_EXPR
940 && TREE_CODE (ret_expr) != INIT_EXPR)
941 || TREE_CODE (result_decl) != RESULT_DECL)
946 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
947 Recall that aggregate_value_p is FALSE for any aggregate type that is
948 returned in registers. If we're returning values in registers, then
949 we don't want to extend the lifetime of the RESULT_DECL, particularly
950 across another call. In addition, for those aggregates for which
951 hard_function_value generates a PARALLEL, we'll abort during normal
952 expansion of structure assignments; there's special code in expand_return
953 to handle this case that does not exist in expand_expr. */
955 || aggregate_value_p (result_decl, TREE_TYPE (current_function_decl)))
956 result = result_decl;
957 else if (gimplify_ctxp->return_temp)
958 result = gimplify_ctxp->return_temp;
961 result = create_tmp_var (TREE_TYPE (result_decl), NULL);
963 /* ??? With complex control flow (usually involving abnormal edges),
964 we can wind up warning about an uninitialized value for this. Due
965 to how this variable is constructed and initialized, this is never
966 true. Give up and never warn. */
967 TREE_NO_WARNING (result) = 1;
969 gimplify_ctxp->return_temp = result;
972 /* Smash the lhs of the MODIFY_EXPR to the temporary we plan to use.
973 Then gimplify the whole thing. */
974 if (result != result_decl)
975 TREE_OPERAND (ret_expr, 0) = result;
977 gimplify_and_add (TREE_OPERAND (stmt, 0), pre_p);
979 /* If we didn't use a temporary, then the result is just the result_decl.
980 Otherwise we need a simple copy. This should already be gimple. */
981 if (result == result_decl)
984 ret_expr = build (MODIFY_EXPR, TREE_TYPE (result), result_decl, result);
985 TREE_OPERAND (stmt, 0) = ret_expr;
990 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
991 and initialization explicit. */
993 static enum gimplify_status
994 gimplify_decl_expr (tree *stmt_p)
997 tree decl = DECL_EXPR_DECL (stmt);
1001 if (TREE_TYPE (decl) == error_mark_node)
1004 else if (TREE_CODE (decl) == TYPE_DECL)
1005 gimplify_type_sizes (TREE_TYPE (decl), stmt_p);
1007 else if (TREE_CODE (decl) == VAR_DECL && !DECL_EXTERNAL (decl))
1009 tree init = DECL_INITIAL (decl);
1011 if (!TREE_CONSTANT (DECL_SIZE (decl)))
1013 /* This is a variable-sized decl. Simplify its size and mark it
1014 for deferred expansion. Note that mudflap depends on the format
1015 of the emitted code: see mx_register_decls(). */
1018 gimplify_type_sizes (TREE_TYPE (decl), stmt_p);
1019 gimplify_one_sizepos (&DECL_SIZE (decl), stmt_p);
1020 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl), stmt_p);
1022 args = tree_cons (NULL, DECL_SIZE_UNIT (decl), NULL);
1023 t = build_fold_addr_expr (decl);
1024 args = tree_cons (NULL, t, args);
1025 t = implicit_built_in_decls[BUILT_IN_STACK_ALLOC];
1026 t = build_function_call_expr (t, args);
1028 gimplify_and_add (t, stmt_p);
1029 DECL_DEFER_OUTPUT (decl) = 1;
1032 if (init && init != error_mark_node)
1034 if (!TREE_STATIC (decl))
1036 DECL_INITIAL (decl) = NULL_TREE;
1037 init = build (MODIFY_EXPR, void_type_node, decl, init);
1038 gimplify_and_add (init, stmt_p);
1041 /* We must still examine initializers for static variables
1042 as they may contain a label address. */
1043 walk_tree (&init, force_labels_r, NULL, NULL);
1046 /* This decl isn't mentioned in the enclosing block, so add it to the
1047 list of temps. FIXME it seems a bit of a kludge to say that
1048 anonymous artificial vars aren't pushed, but everything else is. */
1049 if (DECL_ARTIFICIAL (decl) && DECL_NAME (decl) == NULL_TREE)
1050 gimple_add_tmp_var (decl);
1056 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1057 and replacing the LOOP_EXPR with goto, but if the loop contains an
1058 EXIT_EXPR, we need to append a label for it to jump to. */
1060 static enum gimplify_status
1061 gimplify_loop_expr (tree *expr_p, tree *pre_p)
1063 tree saved_label = gimplify_ctxp->exit_label;
1064 tree start_label = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
1065 tree jump_stmt = build_and_jump (&LABEL_EXPR_LABEL (start_label));
1067 append_to_statement_list (start_label, pre_p);
1069 gimplify_ctxp->exit_label = NULL_TREE;
1071 gimplify_and_add (LOOP_EXPR_BODY (*expr_p), pre_p);
1073 if (gimplify_ctxp->exit_label)
1075 append_to_statement_list (jump_stmt, pre_p);
1076 *expr_p = build1 (LABEL_EXPR, void_type_node, gimplify_ctxp->exit_label);
1079 *expr_p = jump_stmt;
1081 gimplify_ctxp->exit_label = saved_label;
1086 /* Compare two case labels. Because the front end should already have
1087 made sure that case ranges do not overlap, it is enough to only compare
1088 the CASE_LOW values of each case label. */
1091 compare_case_labels (const void *p1, const void *p2)
1093 tree case1 = *(tree *)p1;
1094 tree case2 = *(tree *)p2;
1096 return tree_int_cst_compare (CASE_LOW (case1), CASE_LOW (case2));
1099 /* Sort the case labels in LABEL_VEC in ascending order. */
1102 sort_case_labels (tree label_vec)
1104 size_t len = TREE_VEC_LENGTH (label_vec);
1105 tree default_case = TREE_VEC_ELT (label_vec, len - 1);
1107 if (CASE_LOW (default_case))
1111 /* The last label in the vector should be the default case
1113 for (i = 0; i < len; ++i)
1115 tree t = TREE_VEC_ELT (label_vec, i);
1119 TREE_VEC_ELT (label_vec, i) = TREE_VEC_ELT (label_vec, len - 1);
1120 TREE_VEC_ELT (label_vec, len - 1) = default_case;
1126 qsort (&TREE_VEC_ELT (label_vec, 0), len - 1, sizeof (tree),
1127 compare_case_labels);
1130 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1133 static enum gimplify_status
1134 gimplify_switch_expr (tree *expr_p, tree *pre_p)
1136 tree switch_expr = *expr_p;
1137 enum gimplify_status ret;
1139 ret = gimplify_expr (&SWITCH_COND (switch_expr), pre_p, NULL,
1140 is_gimple_val, fb_rvalue);
1142 if (SWITCH_BODY (switch_expr))
1144 varray_type labels, saved_labels;
1145 tree label_vec, default_case = NULL_TREE;
1148 /* If someone can be bothered to fill in the labels, they can
1149 be bothered to null out the body too. */
1150 if (SWITCH_LABELS (switch_expr))
1153 saved_labels = gimplify_ctxp->case_labels;
1154 VARRAY_TREE_INIT (gimplify_ctxp->case_labels, 8, "case_labels");
1156 gimplify_to_stmt_list (&SWITCH_BODY (switch_expr));
1158 labels = gimplify_ctxp->case_labels;
1159 gimplify_ctxp->case_labels = saved_labels;
1161 len = VARRAY_ACTIVE_SIZE (labels);
1163 for (i = 0; i < len; ++i)
1165 tree t = VARRAY_TREE (labels, i);
1168 /* The default case must be the last label in the list. */
1170 VARRAY_TREE (labels, i) = VARRAY_TREE (labels, len - 1);
1176 label_vec = make_tree_vec (len + 1);
1177 SWITCH_LABELS (*expr_p) = label_vec;
1178 append_to_statement_list (switch_expr, pre_p);
1182 /* If the switch has no default label, add one, so that we jump
1183 around the switch body. */
1184 default_case = build (CASE_LABEL_EXPR, void_type_node, NULL_TREE,
1185 NULL_TREE, create_artificial_label ());
1186 append_to_statement_list (SWITCH_BODY (switch_expr), pre_p);
1187 *expr_p = build (LABEL_EXPR, void_type_node,
1188 CASE_LABEL (default_case));
1191 *expr_p = SWITCH_BODY (switch_expr);
1193 for (i = 0; i < len; ++i)
1194 TREE_VEC_ELT (label_vec, i) = VARRAY_TREE (labels, i);
1195 TREE_VEC_ELT (label_vec, len) = default_case;
1197 sort_case_labels (label_vec);
1199 SWITCH_BODY (switch_expr) = NULL;
1201 else if (!SWITCH_LABELS (switch_expr))
1207 static enum gimplify_status
1208 gimplify_case_label_expr (tree *expr_p)
1210 tree expr = *expr_p;
1211 if (gimplify_ctxp->case_labels)
1212 VARRAY_PUSH_TREE (gimplify_ctxp->case_labels, expr);
1215 *expr_p = build (LABEL_EXPR, void_type_node, CASE_LABEL (expr));
1219 /* Gimplify a LABELED_BLOCK_EXPR into a LABEL_EXPR following
1220 a (possibly empty) body. */
1222 static enum gimplify_status
1223 gimplify_labeled_block_expr (tree *expr_p)
1225 tree body = LABELED_BLOCK_BODY (*expr_p);
1226 tree label = LABELED_BLOCK_LABEL (*expr_p);
1229 DECL_CONTEXT (label) = current_function_decl;
1230 t = build (LABEL_EXPR, void_type_node, label);
1231 if (body != NULL_TREE)
1232 t = build (COMPOUND_EXPR, void_type_node, body, t);
1238 /* Gimplify a EXIT_BLOCK_EXPR into a GOTO_EXPR. */
1240 static enum gimplify_status
1241 gimplify_exit_block_expr (tree *expr_p)
1243 tree labeled_block = TREE_OPERAND (*expr_p, 0);
1246 /* First operand must be a LABELED_BLOCK_EXPR, which should
1247 already be lowered (or partially lowered) when we get here. */
1248 #if defined ENABLE_CHECKING
1249 if (TREE_CODE (labeled_block) != LABELED_BLOCK_EXPR)
1253 label = LABELED_BLOCK_LABEL (labeled_block);
1254 *expr_p = build1 (GOTO_EXPR, void_type_node, label);
1259 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1263 build_and_jump (tree *label_p)
1265 if (label_p == NULL)
1266 /* If there's nowhere to jump, just fall through. */
1269 if (*label_p == NULL_TREE)
1271 tree label = create_artificial_label ();
1275 return build1 (GOTO_EXPR, void_type_node, *label_p);
1278 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1279 This also involves building a label to jump to and communicating it to
1280 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1282 static enum gimplify_status
1283 gimplify_exit_expr (tree *expr_p)
1285 tree cond = TREE_OPERAND (*expr_p, 0);
1288 expr = build_and_jump (&gimplify_ctxp->exit_label);
1289 expr = build (COND_EXPR, void_type_node, cond, expr, NULL_TREE);
1295 /* A helper function to be called via walk_tree. Mark all labels under *TP
1296 as being forced. To be called for DECL_INITIAL of static variables. */
1299 force_labels_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
1303 if (TREE_CODE (*tp) == LABEL_DECL)
1304 FORCED_LABEL (*tp) = 1;
1309 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1310 different from its canonical type, wrap the whole thing inside a
1311 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1314 The canonical type of a COMPONENT_REF is the type of the field being
1315 referenced--unless the field is a bit-field which can be read directly
1316 in a smaller mode, in which case the canonical type is the
1317 sign-appropriate type corresponding to that mode. */
1320 canonicalize_component_ref (tree *expr_p)
1322 tree expr = *expr_p;
1325 if (TREE_CODE (expr) != COMPONENT_REF)
1328 if (INTEGRAL_TYPE_P (TREE_TYPE (expr)))
1329 type = TREE_TYPE (get_unwidened (expr, NULL_TREE));
1331 type = TREE_TYPE (TREE_OPERAND (expr, 1));
1333 if (TREE_TYPE (expr) != type)
1335 tree old_type = TREE_TYPE (expr);
1337 /* Set the type of the COMPONENT_REF to the underlying type. */
1338 TREE_TYPE (expr) = type;
1340 /* And wrap the whole thing inside a NOP_EXPR. */
1341 expr = build1 (NOP_EXPR, old_type, expr);
1347 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1348 to foo, embed that change in the ADDR_EXPR by converting
1353 where L is the lower bound. For simplicity, only do this for constant
1357 canonicalize_addr_expr (tree *expr_p)
1359 tree expr = *expr_p;
1360 tree ctype = TREE_TYPE (expr);
1361 tree addr_expr = TREE_OPERAND (expr, 0);
1362 tree atype = TREE_TYPE (addr_expr);
1363 tree dctype, datype, ddatype, otype, obj_expr;
1365 /* Both cast and addr_expr types should be pointers. */
1366 if (!POINTER_TYPE_P (ctype) || !POINTER_TYPE_P (atype))
1369 /* The addr_expr type should be a pointer to an array. */
1370 datype = TREE_TYPE (atype);
1371 if (TREE_CODE (datype) != ARRAY_TYPE)
1374 /* Both cast and addr_expr types should address the same object type. */
1375 dctype = TREE_TYPE (ctype);
1376 ddatype = TREE_TYPE (datype);
1377 if (!lang_hooks.types_compatible_p (ddatype, dctype))
1380 /* The addr_expr and the object type should match. */
1381 obj_expr = TREE_OPERAND (addr_expr, 0);
1382 otype = TREE_TYPE (obj_expr);
1383 if (!lang_hooks.types_compatible_p (otype, datype))
1386 /* The lower bound and element sizes must be constant. */
1387 if (TREE_CODE (TYPE_SIZE_UNIT (dctype)) != INTEGER_CST
1388 || !TYPE_DOMAIN (datype) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype))
1389 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype))) != INTEGER_CST)
1392 /* All checks succeeded. Build a new node to merge the cast. */
1393 *expr_p = build4 (ARRAY_REF, dctype, obj_expr,
1394 TYPE_MIN_VALUE (TYPE_DOMAIN (datype)),
1395 TYPE_MIN_VALUE (TYPE_DOMAIN (datype)),
1396 size_binop (EXACT_DIV_EXPR, TYPE_SIZE_UNIT (dctype),
1397 size_int (TYPE_ALIGN (dctype)
1399 *expr_p = build1 (ADDR_EXPR, ctype, *expr_p);
1402 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1403 underneath as appropriate. */
1405 static enum gimplify_status
1406 gimplify_conversion (tree *expr_p)
1408 /* If we still have a conversion at the toplevel, then strip
1409 away all but the outermost conversion. */
1410 if (TREE_CODE (*expr_p) == NOP_EXPR || TREE_CODE (*expr_p) == CONVERT_EXPR)
1412 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p, 0));
1414 /* And remove the outermost conversion if it's useless. */
1415 if (tree_ssa_useless_type_conversion (*expr_p))
1416 *expr_p = TREE_OPERAND (*expr_p, 0);
1419 /* If we still have a conversion at the toplevel,
1420 then canonicalize some constructs. */
1421 if (TREE_CODE (*expr_p) == NOP_EXPR || TREE_CODE (*expr_p) == CONVERT_EXPR)
1423 tree sub = TREE_OPERAND (*expr_p, 0);
1425 /* If a NOP conversion is changing the type of a COMPONENT_REF
1426 expression, then canonicalize its type now in order to expose more
1427 redundant conversions. */
1428 if (TREE_CODE (sub) == COMPONENT_REF)
1429 canonicalize_component_ref (&TREE_OPERAND (*expr_p, 0));
1431 /* If a NOP conversion is changing a pointer to array of foo
1432 to a pointer to foo, embed that change in the ADDR_EXPR. */
1433 else if (TREE_CODE (sub) == ADDR_EXPR)
1434 canonicalize_addr_expr (expr_p);
1440 /* Reduce MIN/MAX_EXPR to a COND_EXPR for further gimplification. */
1442 static enum gimplify_status
1443 gimplify_minimax_expr (tree *expr_p, tree *pre_p, tree *post_p)
1445 tree op1 = TREE_OPERAND (*expr_p, 0);
1446 tree op2 = TREE_OPERAND (*expr_p, 1);
1447 enum tree_code code;
1448 enum gimplify_status r0, r1;
1450 if (TREE_CODE (*expr_p) == MIN_EXPR)
1455 r0 = gimplify_expr (&op1, pre_p, post_p, is_gimple_val, fb_rvalue);
1456 r1 = gimplify_expr (&op2, pre_p, post_p, is_gimple_val, fb_rvalue);
1458 *expr_p = build (COND_EXPR, TREE_TYPE (*expr_p),
1459 build (code, boolean_type_node, op1, op2),
1462 if (r0 == GS_ERROR || r1 == GS_ERROR)
1468 /* Subroutine of gimplify_compound_lval.
1469 Converts an ARRAY_REF to the equivalent *(&array + offset) form. */
1471 static enum gimplify_status
1472 gimplify_array_ref_to_plus (tree *expr_p, tree *pre_p, tree *post_p)
1474 tree array = TREE_OPERAND (*expr_p, 0);
1475 tree arrtype = TREE_TYPE (array);
1476 tree elttype = TREE_TYPE (arrtype);
1477 tree size = array_ref_element_size (*expr_p);
1478 tree ptrtype = build_pointer_type (elttype);
1479 enum tree_code add_code = PLUS_EXPR;
1480 tree idx = TREE_OPERAND (*expr_p, 1);
1481 tree minidx = unshare_expr (array_ref_low_bound (*expr_p));
1482 tree offset, addr, result;
1483 enum gimplify_status ret;
1485 /* If the array domain does not start at zero, apply the offset. */
1486 if (!integer_zerop (minidx))
1488 idx = convert (TREE_TYPE (minidx), idx);
1489 idx = fold (build (MINUS_EXPR, TREE_TYPE (minidx), idx, minidx));
1492 /* If the index is negative -- a technically invalid situation now
1493 that we've biased the index back to zero -- then casting it to
1494 unsigned has ill effects. In particular, -1*4U/4U != -1.
1495 Represent this as a subtraction of a positive rather than addition
1496 of a negative. This will prevent any conversion back to ARRAY_REF
1497 from getting the wrong results from the division. */
1498 if (TREE_CODE (idx) == INTEGER_CST && tree_int_cst_sgn (idx) < 0)
1500 idx = fold (build1 (NEGATE_EXPR, TREE_TYPE (idx), idx));
1501 add_code = MINUS_EXPR;
1504 /* Pointer arithmetic must be done in sizetype. */
1505 idx = fold_convert (sizetype, idx);
1507 /* Convert the index to a byte offset. */
1508 offset = size_binop (MULT_EXPR, size, idx);
1510 ret = gimplify_expr (&array, pre_p, post_p, is_gimple_min_lval, fb_lvalue);
1511 if (ret == GS_ERROR)
1514 addr = build_fold_addr_expr_with_type (array, ptrtype);
1515 result = fold (build (add_code, ptrtype, addr, offset));
1516 *expr_p = build1 (INDIRECT_REF, elttype, result);
1521 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1522 node pointed by EXPR_P.
1525 : min_lval '[' val ']'
1527 | compound_lval '[' val ']'
1528 | compound_lval '.' ID
1530 This is not part of the original SIMPLE definition, which separates
1531 array and member references, but it seems reasonable to handle them
1532 together. Also, this way we don't run into problems with union
1533 aliasing; gcc requires that for accesses through a union to alias, the
1534 union reference must be explicit, which was not always the case when we
1535 were splitting up array and member refs.
1537 PRE_P points to the list where side effects that must happen before
1538 *EXPR_P should be stored.
1540 POST_P points to the list where side effects that must happen after
1541 *EXPR_P should be stored. */
1543 static enum gimplify_status
1544 gimplify_compound_lval (tree *expr_p, tree *pre_p,
1545 tree *post_p, fallback_t fallback)
1549 enum gimplify_status ret = GS_OK, tret;
1552 #if defined ENABLE_CHECKING
1553 if (TREE_CODE (*expr_p) != ARRAY_REF
1554 && TREE_CODE (*expr_p) != ARRAY_RANGE_REF
1555 && TREE_CODE (*expr_p) != COMPONENT_REF
1556 && TREE_CODE (*expr_p) != BIT_FIELD_REF
1557 && TREE_CODE (*expr_p) != REALPART_EXPR
1558 && TREE_CODE (*expr_p) != IMAGPART_EXPR)
1562 /* Create a stack of the subexpressions so later we can walk them in
1563 order from inner to outer. */
1564 VARRAY_TREE_INIT (stack, 10, "stack");
1566 /* We can either handle REALPART_EXPR, IMAGEPART_EXPR anything that
1567 handled_components can deal with. */
1569 (handled_component_p (*p)
1570 || TREE_CODE (*p) == REALPART_EXPR || TREE_CODE (*p) == IMAGPART_EXPR);
1571 p = &TREE_OPERAND (*p, 0))
1572 VARRAY_PUSH_TREE (stack, *p);
1574 /* Now STACK is a stack of pointers to all the refs we've walked through
1575 and P points to the innermost expression.
1577 Java requires that we elaborated nodes in source order. That
1578 means we must gimplify the inner expression followed by each of
1579 the indices, in order. But we can't gimplify the inner
1580 expression until we deal with any variable bounds, sizes, or
1581 positions in order to deal with PLACEHOLDER_EXPRs.
1583 So we do this in three steps. First we deal with the annotations
1584 for any variables in the components, then we gimplify the base,
1585 then we gimplify any indices, from left to right. */
1586 for (i = VARRAY_ACTIVE_SIZE (stack) - 1; i >= 0; i--)
1588 tree t = VARRAY_TREE (stack, i);
1590 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
1592 /* Gimplify the low bound and element type size and put them into
1593 the ARRAY_REF. If these values are set, they have already been
1595 if (!TREE_OPERAND (t, 2))
1597 tree low = unshare_expr (array_ref_low_bound (t));
1598 if (!is_gimple_min_invariant (low))
1600 TREE_OPERAND (t, 2) = low;
1601 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1602 is_gimple_tmp_var, fb_rvalue);
1603 ret = MIN (ret, tret);
1607 if (!TREE_OPERAND (t, 3))
1609 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (t, 0)));
1610 tree elmt_size = unshare_expr (array_ref_element_size (t));
1611 tree factor = size_int (TYPE_ALIGN (elmt_type) / BITS_PER_UNIT);
1613 /* Divide the element size by the alignment of the element
1615 elmt_size = size_binop (EXACT_DIV_EXPR, elmt_size, factor);
1617 if (!is_gimple_min_invariant (elmt_size))
1619 TREE_OPERAND (t, 3) = elmt_size;
1620 tret = gimplify_expr (&TREE_OPERAND (t, 3), pre_p, post_p,
1621 is_gimple_tmp_var, fb_rvalue);
1622 ret = MIN (ret, tret);
1626 else if (TREE_CODE (t) == COMPONENT_REF)
1628 /* Set the field offset into T and gimplify it. */
1629 if (!TREE_OPERAND (t, 2))
1631 tree offset = unshare_expr (component_ref_field_offset (t));
1632 tree field = TREE_OPERAND (t, 1);
1634 = size_int (DECL_OFFSET_ALIGN (field) / BITS_PER_UNIT);
1636 /* Divide the offset by its alignment. */
1637 offset = size_binop (EXACT_DIV_EXPR, offset, factor);
1639 if (!is_gimple_min_invariant (offset))
1641 TREE_OPERAND (t, 2) = offset;
1642 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1643 is_gimple_tmp_var, fb_rvalue);
1644 ret = MIN (ret, tret);
1650 /* Step 2 is to gimplify the base expression. */
1651 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval, fallback);
1652 ret = MIN (ret, tret);
1654 /* And finally, the indices and operands to BIT_FIELD_REF. During this
1655 loop we also remove any useless conversions. */
1656 for (; VARRAY_ACTIVE_SIZE (stack) > 0; )
1658 tree t = VARRAY_TOP_TREE (stack);
1660 if (TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
1662 /* Gimplify the dimension.
1663 Temporary fix for gcc.c-torture/execute/20040313-1.c.
1664 Gimplify non-constant array indices into a temporary
1666 FIXME - The real fix is to gimplify post-modify
1667 expressions into a minimal gimple lvalue. However, that
1668 exposes bugs in alias analysis. The alias analyzer does
1669 not handle &PTR->FIELD very well. Will fix after the
1670 branch is merged into mainline (dnovillo 2004-05-03). */
1671 if (!is_gimple_min_invariant (TREE_OPERAND (t, 1)))
1673 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
1674 is_gimple_tmp_var, fb_rvalue);
1675 ret = MIN (ret, tret);
1678 else if (TREE_CODE (t) == BIT_FIELD_REF)
1680 tret = gimplify_expr (&TREE_OPERAND (t, 1), pre_p, post_p,
1681 is_gimple_val, fb_rvalue);
1682 ret = MIN (ret, tret);
1683 tret = gimplify_expr (&TREE_OPERAND (t, 2), pre_p, post_p,
1684 is_gimple_val, fb_rvalue);
1685 ret = MIN (ret, tret);
1688 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t, 0));
1690 /* The innermost expression P may have originally had TREE_SIDE_EFFECTS
1691 set which would have caused all the outer expressions in EXPR_P
1692 leading to P to also have had TREE_SIDE_EFFECTS set. */
1693 recalculate_side_effects (t);
1697 tret = gimplify_expr (p, pre_p, post_p, is_gimple_min_lval, fallback);
1698 ret = MIN (ret, tret);
1700 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
1701 if ((fallback & fb_rvalue) && TREE_CODE (*expr_p) == COMPONENT_REF)
1703 canonicalize_component_ref (expr_p);
1704 ret = MIN (ret, GS_OK);
1710 /* Gimplify the self modifying expression pointed by EXPR_P (++, --, +=, -=).
1712 PRE_P points to the list where side effects that must happen before
1713 *EXPR_P should be stored.
1715 POST_P points to the list where side effects that must happen after
1716 *EXPR_P should be stored.
1718 WANT_VALUE is nonzero iff we want to use the value of this expression
1719 in another expression. */
1721 static enum gimplify_status
1722 gimplify_self_mod_expr (tree *expr_p, tree *pre_p, tree *post_p,
1725 enum tree_code code;
1726 tree lhs, lvalue, rhs, t1;
1728 enum tree_code arith_code;
1729 enum gimplify_status ret;
1731 code = TREE_CODE (*expr_p);
1733 #if defined ENABLE_CHECKING
1734 if (code != POSTINCREMENT_EXPR
1735 && code != POSTDECREMENT_EXPR
1736 && code != PREINCREMENT_EXPR
1737 && code != PREDECREMENT_EXPR)
1741 /* Prefix or postfix? */
1742 if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
1743 /* Faster to treat as prefix if result is not used. */
1744 postfix = want_value;
1748 /* Add or subtract? */
1749 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
1750 arith_code = PLUS_EXPR;
1752 arith_code = MINUS_EXPR;
1754 /* Gimplify the LHS into a GIMPLE lvalue. */
1755 lvalue = TREE_OPERAND (*expr_p, 0);
1756 ret = gimplify_expr (&lvalue, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
1757 if (ret == GS_ERROR)
1760 /* Extract the operands to the arithmetic operation. */
1762 rhs = TREE_OPERAND (*expr_p, 1);
1764 /* For postfix operator, we evaluate the LHS to an rvalue and then use
1765 that as the result value and in the postqueue operation. */
1768 ret = gimplify_expr (&lhs, pre_p, post_p, is_gimple_val, fb_rvalue);
1769 if (ret == GS_ERROR)
1773 t1 = build (arith_code, TREE_TYPE (*expr_p), lhs, rhs);
1774 t1 = build (MODIFY_EXPR, TREE_TYPE (lvalue), lvalue, t1);
1778 gimplify_and_add (t1, post_p);
1789 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
1792 maybe_with_size_expr (tree *expr_p)
1794 tree expr, type, size;
1797 type = TREE_TYPE (expr);
1798 if (type == error_mark_node)
1801 size = TYPE_SIZE_UNIT (type);
1802 if (size && TREE_CODE (size) != INTEGER_CST)
1804 size = unshare_expr (size);
1805 size = SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, expr);
1806 *expr_p = build2 (WITH_SIZE_EXPR, type, expr, size);
1810 /* Subroutine of gimplify_call_expr: Gimplify a single argument. */
1812 static enum gimplify_status
1813 gimplify_arg (tree *expr_p, tree *pre_p)
1815 bool (*test) (tree);
1818 /* In general, we allow lvalues for function arguments to avoid
1819 extra overhead of copying large aggregates out of even larger
1820 aggregates into temporaries only to copy the temporaries to
1821 the argument list. Make optimizers happy by pulling out to
1822 temporaries those types that fit in registers. */
1823 if (is_gimple_reg_type (TREE_TYPE (*expr_p)))
1824 test = is_gimple_val, fb = fb_rvalue;
1826 test = is_gimple_lvalue, fb = fb_either;
1828 /* If this is a variable sized type, we must remember the size. */
1829 maybe_with_size_expr (expr_p);
1831 /* There is a sequence point before a function call. Side effects in
1832 the argument list must occur before the actual call. So, when
1833 gimplifying arguments, force gimplify_expr to use an internal
1834 post queue which is then appended to the end of PRE_P. */
1835 return gimplify_expr (expr_p, pre_p, NULL, test, fb);
1838 /* Gimplify the CALL_EXPR node pointed by EXPR_P. PRE_P points to the
1839 list where side effects that must happen before *EXPR_P should be stored.
1840 WANT_VALUE is true if the result of the call is desired. */
1842 static enum gimplify_status
1843 gimplify_call_expr (tree *expr_p, tree *pre_p, bool want_value)
1847 enum gimplify_status ret;
1849 #if defined ENABLE_CHECKING
1850 if (TREE_CODE (*expr_p) != CALL_EXPR)
1854 /* For reliable diagnostics during inlining, it is necessary that
1855 every call_expr be annotated with file and line. */
1856 if (! EXPR_HAS_LOCATION (*expr_p))
1857 SET_EXPR_LOCATION (*expr_p, input_location);
1859 /* This may be a call to a builtin function.
1861 Builtin function calls may be transformed into different
1862 (and more efficient) builtin function calls under certain
1863 circumstances. Unfortunately, gimplification can muck things
1864 up enough that the builtin expanders are not aware that certain
1865 transformations are still valid.
1867 So we attempt transformation/gimplification of the call before
1868 we gimplify the CALL_EXPR. At this time we do not manage to
1869 transform all calls in the same manner as the expanders do, but
1870 we do transform most of them. */
1871 decl = get_callee_fndecl (*expr_p);
1872 if (decl && DECL_BUILT_IN (decl))
1876 /* If it is allocation of stack, record the need to restore the memory
1877 when the enclosing bind_expr is exited. */
1878 if (DECL_FUNCTION_CODE (decl) == BUILT_IN_STACK_ALLOC)
1879 gimplify_ctxp->save_stack = true;
1881 /* If it is restore of the stack, reset it, since it means we are
1882 regimplifying the bind_expr. Note that we use the fact that
1883 for try_finally_expr, try part is processed first. */
1884 if (DECL_FUNCTION_CODE (decl) == BUILT_IN_STACK_RESTORE)
1885 gimplify_ctxp->save_stack = false;
1887 new = simplify_builtin (*expr_p, !want_value);
1889 if (new && new != *expr_p)
1891 /* There was a transformation of this call which computes the
1892 same value, but in a more efficient way. Return and try
1898 if (DECL_FUNCTION_CODE (decl) == BUILT_IN_VA_START)
1899 /* Avoid gimplifying the second argument to va_start, which needs
1900 to be the plain PARM_DECL. */
1901 return gimplify_arg (&TREE_VALUE (TREE_OPERAND (*expr_p, 1)), pre_p);
1904 /* There is a sequence point before the call, so any side effects in
1905 the calling expression must occur before the actual call. Force
1906 gimplify_expr to use an internal post queue. */
1907 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, NULL,
1908 is_gimple_call_addr, fb_rvalue);
1910 if (PUSH_ARGS_REVERSED)
1911 TREE_OPERAND (*expr_p, 1) = nreverse (TREE_OPERAND (*expr_p, 1));
1912 for (arglist = TREE_OPERAND (*expr_p, 1); arglist;
1913 arglist = TREE_CHAIN (arglist))
1915 enum gimplify_status t;
1917 t = gimplify_arg (&TREE_VALUE (arglist), pre_p);
1922 if (PUSH_ARGS_REVERSED)
1923 TREE_OPERAND (*expr_p, 1) = nreverse (TREE_OPERAND (*expr_p, 1));
1925 /* Try this again in case gimplification exposed something. */
1926 if (ret != GS_ERROR && decl && DECL_BUILT_IN (decl))
1928 tree new = simplify_builtin (*expr_p, !want_value);
1930 if (new && new != *expr_p)
1932 /* There was a transformation of this call which computes the
1933 same value, but in a more efficient way. Return and try
1940 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
1941 decl. This allows us to eliminate redundant or useless
1942 calls to "const" functions. */
1943 if (TREE_CODE (*expr_p) == CALL_EXPR
1944 && (call_expr_flags (*expr_p) & (ECF_CONST | ECF_PURE)))
1945 TREE_SIDE_EFFECTS (*expr_p) = 0;
1950 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
1951 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
1953 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
1954 condition is true or false, respectively. If null, we should generate
1955 our own to skip over the evaluation of this specific expression.
1957 This function is the tree equivalent of do_jump.
1959 shortcut_cond_r should only be called by shortcut_cond_expr. */
1962 shortcut_cond_r (tree pred, tree *true_label_p, tree *false_label_p)
1964 tree local_label = NULL_TREE;
1965 tree t, expr = NULL;
1967 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
1968 retain the shortcut semantics. Just insert the gotos here;
1969 shortcut_cond_expr will append the real blocks later. */
1970 if (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
1972 /* Turn if (a && b) into
1974 if (a); else goto no;
1975 if (b) goto yes; else goto no;
1978 if (false_label_p == NULL)
1979 false_label_p = &local_label;
1981 t = shortcut_cond_r (TREE_OPERAND (pred, 0), NULL, false_label_p);
1982 append_to_statement_list (t, &expr);
1984 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
1986 append_to_statement_list (t, &expr);
1988 else if (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
1990 /* Turn if (a || b) into
1993 if (b) goto yes; else goto no;
1996 if (true_label_p == NULL)
1997 true_label_p = &local_label;
1999 t = shortcut_cond_r (TREE_OPERAND (pred, 0), true_label_p, NULL);
2000 append_to_statement_list (t, &expr);
2002 t = shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2004 append_to_statement_list (t, &expr);
2006 else if (TREE_CODE (pred) == COND_EXPR)
2008 /* As long as we're messing with gotos, turn if (a ? b : c) into
2010 if (b) goto yes; else goto no;
2012 if (c) goto yes; else goto no; */
2013 expr = build (COND_EXPR, void_type_node, TREE_OPERAND (pred, 0),
2014 shortcut_cond_r (TREE_OPERAND (pred, 1), true_label_p,
2016 shortcut_cond_r (TREE_OPERAND (pred, 2), true_label_p,
2021 expr = build (COND_EXPR, void_type_node, pred,
2022 build_and_jump (true_label_p),
2023 build_and_jump (false_label_p));
2028 t = build1 (LABEL_EXPR, void_type_node, local_label);
2029 append_to_statement_list (t, &expr);
2036 shortcut_cond_expr (tree expr)
2038 tree pred = TREE_OPERAND (expr, 0);
2039 tree then_ = TREE_OPERAND (expr, 1);
2040 tree else_ = TREE_OPERAND (expr, 2);
2041 tree true_label, false_label, end_label, t;
2043 tree *false_label_p;
2044 bool emit_end, emit_false;
2045 bool then_se = then_ && TREE_SIDE_EFFECTS (then_);
2046 bool else_se = else_ && TREE_SIDE_EFFECTS (else_);
2048 /* First do simple transformations. */
2051 /* If there is no 'else', turn (a && b) into if (a) if (b). */
2052 while (TREE_CODE (pred) == TRUTH_ANDIF_EXPR)
2054 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2055 then_ = shortcut_cond_expr (expr);
2056 pred = TREE_OPERAND (pred, 0);
2057 expr = build (COND_EXPR, void_type_node, pred, then_, NULL_TREE);
2062 /* If there is no 'then', turn
2065 if (a); else if (b); else d. */
2066 while (TREE_CODE (pred) == TRUTH_ORIF_EXPR)
2068 TREE_OPERAND (expr, 0) = TREE_OPERAND (pred, 1);
2069 else_ = shortcut_cond_expr (expr);
2070 pred = TREE_OPERAND (pred, 0);
2071 expr = build (COND_EXPR, void_type_node, pred, NULL_TREE, else_);
2075 /* If we're done, great. */
2076 if (TREE_CODE (pred) != TRUTH_ANDIF_EXPR
2077 && TREE_CODE (pred) != TRUTH_ORIF_EXPR)
2080 /* Otherwise we need to mess with gotos. Change
2083 if (a); else goto no;
2086 and recursively gimplify the condition. */
2088 true_label = false_label = end_label = NULL_TREE;
2090 /* If our arms just jump somewhere, hijack those labels so we don't
2091 generate jumps to jumps. */
2094 && TREE_CODE (then_) == GOTO_EXPR
2095 && TREE_CODE (GOTO_DESTINATION (then_)) == LABEL_DECL)
2097 true_label = GOTO_DESTINATION (then_);
2103 && TREE_CODE (else_) == GOTO_EXPR
2104 && TREE_CODE (GOTO_DESTINATION (else_)) == LABEL_DECL)
2106 false_label = GOTO_DESTINATION (else_);
2111 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2113 true_label_p = &true_label;
2115 true_label_p = NULL;
2117 /* The 'else' branch also needs a label if it contains interesting code. */
2118 if (false_label || else_se)
2119 false_label_p = &false_label;
2121 false_label_p = NULL;
2123 /* If there was nothing else in our arms, just forward the label(s). */
2124 if (!then_se && !else_se)
2125 return shortcut_cond_r (pred, true_label_p, false_label_p);
2127 /* If our last subexpression already has a terminal label, reuse it. */
2129 expr = expr_last (else_);
2131 expr = expr_last (then_);
2134 if (expr && TREE_CODE (expr) == LABEL_EXPR)
2135 end_label = LABEL_EXPR_LABEL (expr);
2137 /* If we don't care about jumping to the 'else' branch, jump to the end
2138 if the condition is false. */
2140 false_label_p = &end_label;
2142 /* We only want to emit these labels if we aren't hijacking them. */
2143 emit_end = (end_label == NULL_TREE);
2144 emit_false = (false_label == NULL_TREE);
2146 pred = shortcut_cond_r (pred, true_label_p, false_label_p);
2149 append_to_statement_list (pred, &expr);
2151 append_to_statement_list (then_, &expr);
2154 t = build_and_jump (&end_label);
2155 append_to_statement_list (t, &expr);
2158 t = build1 (LABEL_EXPR, void_type_node, false_label);
2159 append_to_statement_list (t, &expr);
2161 append_to_statement_list (else_, &expr);
2163 if (emit_end && end_label)
2165 t = build1 (LABEL_EXPR, void_type_node, end_label);
2166 append_to_statement_list (t, &expr);
2172 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2175 gimple_boolify (tree expr)
2177 tree type = TREE_TYPE (expr);
2179 if (TREE_CODE (type) == BOOLEAN_TYPE)
2182 /* If this is the predicate of a COND_EXPR, it might not even be a
2184 expr = lang_hooks.truthvalue_conversion (expr);
2186 switch (TREE_CODE (expr))
2188 case TRUTH_AND_EXPR:
2190 case TRUTH_XOR_EXPR:
2191 case TRUTH_ANDIF_EXPR:
2192 case TRUTH_ORIF_EXPR:
2193 /* Also boolify the arguments of truth exprs. */
2194 TREE_OPERAND (expr, 1) = gimple_boolify (TREE_OPERAND (expr, 1));
2197 case TRUTH_NOT_EXPR:
2198 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2201 case EQ_EXPR: case NE_EXPR:
2202 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2203 /* These expressions always produce boolean results. */
2204 TREE_TYPE (expr) = boolean_type_node;
2208 /* Other expressions that get here must have boolean values, but
2209 might need to be converted to the appropriate mode. */
2210 return convert (boolean_type_node, expr);
2214 /* Convert the conditional expression pointed by EXPR_P '(p) ? a : b;'
2223 The second form is used when *EXPR_P is of type void.
2225 TARGET is the tree for T1 above.
2227 PRE_P points to the list where side effects that must happen before
2228 *EXPR_P should be stored. */
2230 static enum gimplify_status
2231 gimplify_cond_expr (tree *expr_p, tree *pre_p, tree target)
2233 tree expr = *expr_p;
2235 enum gimplify_status ret;
2237 type = TREE_TYPE (expr);
2239 TREE_TYPE (expr) = void_type_node;
2241 /* If this COND_EXPR has a value, copy the values into a temporary within
2243 else if (! VOID_TYPE_P (type))
2252 tmp = create_tmp_var (TREE_TYPE (expr), "iftmp");
2256 /* Build the then clause, 't1 = a;'. But don't build an assignment
2257 if this branch is void; in C++ it can be, if it's a throw. */
2258 if (TREE_TYPE (TREE_OPERAND (expr, 1)) != void_type_node)
2259 TREE_OPERAND (expr, 1)
2260 = build (MODIFY_EXPR, void_type_node, tmp, TREE_OPERAND (expr, 1));
2262 /* Build the else clause, 't1 = b;'. */
2263 if (TREE_TYPE (TREE_OPERAND (expr, 2)) != void_type_node)
2264 TREE_OPERAND (expr, 2)
2265 = build (MODIFY_EXPR, void_type_node, tmp, TREE_OPERAND (expr, 2));
2267 TREE_TYPE (expr) = void_type_node;
2268 recalculate_side_effects (expr);
2270 /* Move the COND_EXPR to the prequeue and use the temp in its place. */
2271 gimplify_and_add (expr, pre_p);
2277 /* Make sure the condition has BOOLEAN_TYPE. */
2278 TREE_OPERAND (expr, 0) = gimple_boolify (TREE_OPERAND (expr, 0));
2280 /* Break apart && and || conditions. */
2281 if (TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ANDIF_EXPR
2282 || TREE_CODE (TREE_OPERAND (expr, 0)) == TRUTH_ORIF_EXPR)
2284 expr = shortcut_cond_expr (expr);
2286 if (expr != *expr_p)
2290 /* We can't rely on gimplify_expr to re-gimplify the expanded
2291 form properly, as cleanups might cause the target labels to be
2292 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2293 set up a conditional context. */
2294 gimple_push_condition ();
2295 gimplify_stmt (expr_p);
2296 gimple_pop_condition (pre_p);
2302 /* Now do the normal gimplification. */
2303 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL,
2304 is_gimple_condexpr, fb_rvalue);
2306 gimple_push_condition ();
2308 gimplify_to_stmt_list (&TREE_OPERAND (expr, 1));
2309 gimplify_to_stmt_list (&TREE_OPERAND (expr, 2));
2310 recalculate_side_effects (expr);
2312 gimple_pop_condition (pre_p);
2314 if (ret == GS_ERROR)
2316 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2318 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 2)))
2319 /* Rewrite "if (a); else b" to "if (!a) b" */
2321 TREE_OPERAND (expr, 0) = invert_truthvalue (TREE_OPERAND (expr, 0));
2322 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, NULL,
2323 is_gimple_condexpr, fb_rvalue);
2325 tmp = TREE_OPERAND (expr, 1);
2326 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 2);
2327 TREE_OPERAND (expr, 2) = tmp;
2330 /* Both arms are empty; replace the COND_EXPR with its predicate. */
2331 expr = TREE_OPERAND (expr, 0);
2337 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2338 a call to __builtin_memcpy. */
2340 static enum gimplify_status
2341 gimplify_modify_expr_to_memcpy (tree *expr_p, tree size, bool want_value)
2343 tree args, t, to, to_ptr, from;
2345 to = TREE_OPERAND (*expr_p, 0);
2346 from = TREE_OPERAND (*expr_p, 1);
2348 args = tree_cons (NULL, size, NULL);
2350 t = build_fold_addr_expr (from);
2351 args = tree_cons (NULL, t, args);
2353 to_ptr = build_fold_addr_expr (to);
2354 args = tree_cons (NULL, to_ptr, args);
2355 t = implicit_built_in_decls[BUILT_IN_MEMCPY];
2356 t = build_function_call_expr (t, args);
2360 t = build1 (NOP_EXPR, TREE_TYPE (to_ptr), t);
2361 t = build1 (INDIRECT_REF, TREE_TYPE (to), t);
2368 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2369 a call to __builtin_memset. In this case we know that the RHS is
2370 a CONSTRUCTOR with an empty element list. */
2372 static enum gimplify_status
2373 gimplify_modify_expr_to_memset (tree *expr_p, tree size, bool want_value)
2375 tree args, t, to, to_ptr;
2377 to = TREE_OPERAND (*expr_p, 0);
2379 args = tree_cons (NULL, size, NULL);
2381 args = tree_cons (NULL, integer_zero_node, args);
2383 to_ptr = build_fold_addr_expr (to);
2384 args = tree_cons (NULL, to_ptr, args);
2385 t = implicit_built_in_decls[BUILT_IN_MEMSET];
2386 t = build_function_call_expr (t, args);
2390 t = build1 (NOP_EXPR, TREE_TYPE (to_ptr), t);
2391 t = build1 (INDIRECT_REF, TREE_TYPE (to), t);
2398 /* A subroutine of gimplify_modify_expr. Break out elements of a
2399 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
2401 Note that we still need to clear any elements that don't have explicit
2402 initializers, so if not all elements are initialized we keep the
2403 original MODIFY_EXPR, we just remove all of the constructor elements. */
2405 static enum gimplify_status
2406 gimplify_init_constructor (tree *expr_p, tree *pre_p,
2407 tree *post_p, bool want_value)
2409 tree object = TREE_OPERAND (*expr_p, 0);
2410 tree ctor = TREE_OPERAND (*expr_p, 1);
2411 tree type = TREE_TYPE (ctor);
2412 enum gimplify_status ret;
2415 if (TREE_CODE (ctor) != CONSTRUCTOR)
2416 return GS_UNHANDLED;
2418 elt_list = CONSTRUCTOR_ELTS (ctor);
2421 switch (TREE_CODE (type))
2425 case QUAL_UNION_TYPE:
2428 HOST_WIDE_INT i, num_elements, num_nonzero_elements;
2429 HOST_WIDE_INT num_nonconstant_elements;
2432 /* Aggregate types must lower constructors to initialization of
2433 individual elements. The exception is that a CONSTRUCTOR node
2434 with no elements indicates zero-initialization of the whole. */
2435 if (elt_list == NULL)
2443 return GS_UNHANDLED;
2446 categorize_ctor_elements (ctor, &num_nonzero_elements,
2447 &num_nonconstant_elements);
2448 num_elements = count_type_elements (TREE_TYPE (ctor));
2450 /* If a const aggregate variable is being initialized, then it
2451 should never be a lose to promote the variable to be static. */
2452 if (num_nonconstant_elements == 0
2453 && TREE_READONLY (object)
2454 && TREE_CODE (object) == VAR_DECL)
2456 DECL_INITIAL (object) = ctor;
2457 TREE_STATIC (object) = 1;
2458 if (!DECL_NAME (object))
2459 DECL_NAME (object) = create_tmp_var_name ("C");
2460 walk_tree (&DECL_INITIAL (object), force_labels_r, NULL, NULL);
2462 /* ??? C++ doesn't automatically append a .<number> to the
2463 assembler name, and even when it does, it looks a FE private
2464 data structures to figure out what that number should be,
2465 which are not set for this variable. I suppose this is
2466 important for local statics for inline functions, which aren't
2467 "local" in the object file sense. So in order to get a unique
2468 TU-local symbol, we must invoke the lhd version now. */
2469 lhd_set_decl_assembler_name (object);
2471 *expr_p = NULL_TREE;
2475 /* If there are "lots" of initialized elements, and all of them
2476 are valid address constants, then the entire initializer can
2477 be dropped to memory, and then memcpy'd out. */
2478 if (num_nonconstant_elements == 0)
2480 HOST_WIDE_INT size = int_size_in_bytes (type);
2483 /* ??? We can still get unbounded array types, at least
2484 from the C++ front end. This seems wrong, but attempt
2485 to work around it for now. */
2488 size = int_size_in_bytes (TREE_TYPE (object));
2490 TREE_TYPE (ctor) = type = TREE_TYPE (object);
2493 /* Find the maximum alignment we can assume for the object. */
2494 /* ??? Make use of DECL_OFFSET_ALIGN. */
2495 if (DECL_P (object))
2496 align = DECL_ALIGN (object);
2498 align = TYPE_ALIGN (type);
2500 if (size > 0 && !can_move_by_pieces (size, align))
2502 tree new = create_tmp_var_raw (type, "C");
2503 gimple_add_tmp_var (new);
2504 TREE_STATIC (new) = 1;
2505 TREE_READONLY (new) = 1;
2506 DECL_INITIAL (new) = ctor;
2507 if (align > DECL_ALIGN (new))
2509 DECL_ALIGN (new) = align;
2510 DECL_USER_ALIGN (new) = 1;
2512 walk_tree (&DECL_INITIAL (new), force_labels_r, NULL, NULL);
2514 TREE_OPERAND (*expr_p, 1) = new;
2519 /* If there are "lots" of initialized elements, even discounting
2520 those that are not address constants (and thus *must* be
2521 computed at runtime), then partition the constructor into
2522 constant and non-constant parts. Block copy the constant
2523 parts in, then generate code for the non-constant parts. */
2524 /* TODO. There's code in cp/typeck.c to do this. */
2526 /* If there are "lots" of zeros, then block clear the object first. */
2528 if (num_elements - num_nonzero_elements > CLEAR_RATIO
2529 && num_nonzero_elements < num_elements/4)
2532 /* ??? This bit ought not be needed. For any element not present
2533 in the initializer, we should simply set them to zero. Except
2534 we'd need to *find* the elements that are not present, and that
2535 requires trickery to avoid quadratic compile-time behavior in
2536 large cases or excessive memory use in small cases. */
2539 HOST_WIDE_INT len = list_length (elt_list);
2540 if (TREE_CODE (type) == ARRAY_TYPE)
2542 tree nelts = array_type_nelts (type);
2543 if (!host_integerp (nelts, 1)
2544 || tree_low_cst (nelts, 1) + 1 != len)
2547 else if (len != fields_length (type))
2553 /* Zap the CONSTRUCTOR element list, which simplifies this case.
2554 Note that we still have to gimplify, in order to handle the
2555 case of variable sized types. Make an unshared copy of
2556 OBJECT before that so we can match a PLACEHOLDER_EXPR to it
2557 later, if needed. */
2558 CONSTRUCTOR_ELTS (ctor) = NULL_TREE;
2559 object = unshare_expr (TREE_OPERAND (*expr_p, 0));
2560 gimplify_stmt (expr_p);
2561 append_to_statement_list (*expr_p, pre_p);
2564 for (i = 0; elt_list; i++, elt_list = TREE_CHAIN (elt_list))
2566 tree purpose, value, cref, init;
2568 purpose = TREE_PURPOSE (elt_list);
2569 value = TREE_VALUE (elt_list);
2571 if (cleared && initializer_zerop (value))
2574 if (TREE_CODE (type) == ARRAY_TYPE)
2576 tree t = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object)));
2578 /* ??? Here's to hoping the front end fills in all of the
2579 indicies, so we don't have to figure out what's missing
2583 /* ??? Need to handle this. */
2584 if (TREE_CODE (purpose) == RANGE_EXPR)
2587 cref = build (ARRAY_REF, t, unshare_expr (object), purpose,
2588 NULL_TREE, NULL_TREE);
2591 cref = build (COMPONENT_REF, TREE_TYPE (purpose),
2592 unshare_expr (object), purpose, NULL_TREE);
2594 init = build (MODIFY_EXPR, TREE_TYPE (purpose), cref, value);
2596 /* Each member initialization is a full-expression. */
2597 gimplify_and_add (init, pre_p);
2600 *expr_p = NULL_TREE;
2608 /* Extract the real and imaginary parts out of the ctor. */
2612 r = TREE_VALUE (elt_list);
2613 elt_list = TREE_CHAIN (elt_list);
2616 i = TREE_VALUE (elt_list);
2617 if (TREE_CHAIN (elt_list))
2621 if (r == NULL || i == NULL)
2623 tree zero = convert (TREE_TYPE (type), integer_zero_node);
2630 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
2631 represent creation of a complex value. */
2632 if (TREE_CONSTANT (r) && TREE_CONSTANT (i))
2634 ctor = build_complex (type, r, i);
2635 TREE_OPERAND (*expr_p, 1) = ctor;
2639 ctor = build (COMPLEX_EXPR, type, r, i);
2640 TREE_OPERAND (*expr_p, 1) = ctor;
2641 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
2642 is_gimple_tmp_rhs, fb_rvalue);
2648 /* Go ahead and simplify constant constructors to VECTOR_CST. */
2649 if (TREE_CONSTANT (ctor))
2650 TREE_OPERAND (*expr_p, 1) = build_vector (type, elt_list);
2653 /* Vector types use CONSTRUCTOR all the way through gimple
2654 compilation as a general initializer. */
2655 for (; elt_list; elt_list = TREE_CHAIN (elt_list))
2657 enum gimplify_status tret;
2658 tret = gimplify_expr (&TREE_VALUE (elt_list), pre_p, post_p,
2659 is_gimple_constructor_elt, fb_rvalue);
2660 if (tret == GS_ERROR)
2667 /* So how did we get a CONSTRUCTOR for a scalar type? */
2671 if (ret == GS_ERROR)
2673 else if (want_value)
2675 append_to_statement_list (*expr_p, pre_p);
2683 /* Subroutine of gimplify_modify_expr to do simplifications of MODIFY_EXPRs
2684 based on the code of the RHS. We loop for as long as something changes. */
2686 static enum gimplify_status
2687 gimplify_modify_expr_rhs (tree *expr_p, tree *from_p, tree *to_p, tree *pre_p,
2688 tree *post_p, bool want_value)
2690 enum gimplify_status ret = GS_OK;
2692 while (ret != GS_UNHANDLED)
2693 switch (TREE_CODE (*from_p))
2697 /* If we are initializing something from a TARGET_EXPR, strip the
2698 TARGET_EXPR and initialize it directly, if possible. This can't
2699 be done if the initializer is void, since that implies that the
2700 temporary is set in some non-trivial way.
2702 ??? What about code that pulls out the temp and uses it
2703 elsewhere? I think that such code never uses the TARGET_EXPR as
2704 an initializer. If I'm wrong, we'll abort because the temp won't
2705 have any RTL. In that case, I guess we'll need to replace
2706 references somehow. */
2707 tree init = TARGET_EXPR_INITIAL (*from_p);
2709 if (!VOID_TYPE_P (TREE_TYPE (init)))
2720 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
2722 gimplify_compound_expr (from_p, pre_p, true);
2727 /* If we're initializing from a CONSTRUCTOR, break this into
2728 individual MODIFY_EXPRs. */
2729 return gimplify_init_constructor (expr_p, pre_p, post_p, want_value);
2732 /* If we're assigning from a ?: expression with ADDRESSABLE type, push
2733 the assignment down into the branches, since we can't generate a
2734 temporary of such a type. */
2735 if (TREE_ADDRESSABLE (TREE_TYPE (*from_p)))
2738 return gimplify_cond_expr (expr_p, pre_p, *to_p);
2752 /* Gimplify the MODIFY_EXPR node pointed by EXPR_P.
2758 PRE_P points to the list where side effects that must happen before
2759 *EXPR_P should be stored.
2761 POST_P points to the list where side effects that must happen after
2762 *EXPR_P should be stored.
2764 WANT_VALUE is nonzero iff we want to use the value of this expression
2765 in another expression. */
2767 static enum gimplify_status
2768 gimplify_modify_expr (tree *expr_p, tree *pre_p, tree *post_p, bool want_value)
2770 tree *from_p = &TREE_OPERAND (*expr_p, 1);
2771 tree *to_p = &TREE_OPERAND (*expr_p, 0);
2772 enum gimplify_status ret = GS_UNHANDLED;
2774 #if defined ENABLE_CHECKING
2775 if (TREE_CODE (*expr_p) != MODIFY_EXPR && TREE_CODE (*expr_p) != INIT_EXPR)
2779 /* The distinction between MODIFY_EXPR and INIT_EXPR is no longer useful. */
2780 if (TREE_CODE (*expr_p) == INIT_EXPR)
2781 TREE_SET_CODE (*expr_p, MODIFY_EXPR);
2783 /* See if any simplifications can be done based on what the RHS is. */
2784 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
2786 if (ret != GS_UNHANDLED)
2789 /* If the value being copied is of variable width, compute the length
2790 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
2791 before gimplifying any of the operands so that we can resolve any
2792 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
2793 the size of the expression to be copied, not of the destination, so
2794 that is what we must here. */
2795 maybe_with_size_expr (from_p);
2797 ret = gimplify_expr (to_p, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
2798 if (ret == GS_ERROR)
2801 ret = gimplify_expr (from_p, pre_p, post_p,
2802 rhs_predicate_for (*to_p), fb_rvalue);
2803 if (ret == GS_ERROR)
2806 /* Now see if the above changed *from_p to something we handle specially. */
2807 ret = gimplify_modify_expr_rhs (expr_p, from_p, to_p, pre_p, post_p,
2809 if (ret != GS_UNHANDLED)
2812 /* If we've got a variable sized assignment between two lvalues (i.e. does
2813 not involve a call), then we can make things a bit more straightforward
2814 by converting the assignment to memcpy or memset. */
2815 if (TREE_CODE (*from_p) == WITH_SIZE_EXPR)
2817 tree from = TREE_OPERAND (*from_p, 0);
2818 tree size = TREE_OPERAND (*from_p, 1);
2820 if (TREE_CODE (from) == CONSTRUCTOR)
2821 return gimplify_modify_expr_to_memset (expr_p, size, want_value);
2822 if (is_gimple_addr_expr_arg (from))
2825 return gimplify_modify_expr_to_memcpy (expr_p, size, want_value);
2829 /* If the destination is already simple, nothing else needed. */
2830 if (is_gimple_tmp_var (*to_p) || !want_value)
2837 append_to_statement_list (*expr_p, pre_p);
2844 /* Gimplify a comparison between two variable-sized objects. Do this
2845 with a call to BUILT_IN_MEMCMP. */
2847 static enum gimplify_status
2848 gimplify_variable_sized_compare (tree *expr_p)
2850 tree op0 = TREE_OPERAND (*expr_p, 0);
2851 tree op1 = TREE_OPERAND (*expr_p, 1);
2854 t = TYPE_SIZE_UNIT (TREE_TYPE (op0));
2855 t = unshare_expr (t);
2856 t = SUBSTITUTE_PLACEHOLDER_IN_EXPR (t, op0);
2857 args = tree_cons (NULL, t, NULL);
2858 t = build_fold_addr_expr (op1);
2859 args = tree_cons (NULL, t, args);
2860 dest = build_fold_addr_expr (op0);
2861 args = tree_cons (NULL, dest, args);
2862 t = implicit_built_in_decls[BUILT_IN_MEMCMP];
2863 t = build_function_call_expr (t, args);
2865 = build (TREE_CODE (*expr_p), TREE_TYPE (*expr_p), t, integer_zero_node);
2870 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
2871 points to the expression to gimplify.
2873 Expressions of the form 'a && b' are gimplified to:
2875 a && b ? true : false
2877 gimplify_cond_expr will do the rest.
2879 PRE_P points to the list where side effects that must happen before
2880 *EXPR_P should be stored. */
2882 static enum gimplify_status
2883 gimplify_boolean_expr (tree *expr_p)
2885 /* Preserve the original type of the expression. */
2886 tree type = TREE_TYPE (*expr_p);
2888 *expr_p = build (COND_EXPR, type, *expr_p,
2889 convert (type, boolean_true_node),
2890 convert (type, boolean_false_node));
2895 /* Gimplifies an expression sequence. This function gimplifies each
2896 expression and re-writes the original expression with the last
2897 expression of the sequence in GIMPLE form.
2899 PRE_P points to the list where the side effects for all the
2900 expressions in the sequence will be emitted.
2902 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
2903 /* ??? Should rearrange to share the pre-queue with all the indirect
2904 invocations of gimplify_expr. Would probably save on creations
2905 of statement_list nodes. */
2907 static enum gimplify_status
2908 gimplify_compound_expr (tree *expr_p, tree *pre_p, bool want_value)
2914 tree *sub_p = &TREE_OPERAND (t, 0);
2916 if (TREE_CODE (*sub_p) == COMPOUND_EXPR)
2917 gimplify_compound_expr (sub_p, pre_p, false);
2919 gimplify_stmt (sub_p);
2920 append_to_statement_list (*sub_p, pre_p);
2922 t = TREE_OPERAND (t, 1);
2924 while (TREE_CODE (t) == COMPOUND_EXPR);
2931 gimplify_stmt (expr_p);
2936 /* Gimplifies a statement list. These may be created either by an
2937 enlightened front-end, or by shortcut_cond_expr. */
2939 static enum gimplify_status
2940 gimplify_statement_list (tree *expr_p)
2942 tree_stmt_iterator i = tsi_start (*expr_p);
2944 while (!tsi_end_p (i))
2948 gimplify_stmt (tsi_stmt_ptr (i));
2953 else if (TREE_CODE (t) == STATEMENT_LIST)
2955 tsi_link_before (&i, t, TSI_SAME_STMT);
2965 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
2966 gimplify. After gimplification, EXPR_P will point to a new temporary
2967 that holds the original value of the SAVE_EXPR node.
2969 PRE_P points to the list where side effects that must happen before
2970 *EXPR_P should be stored. */
2972 static enum gimplify_status
2973 gimplify_save_expr (tree *expr_p, tree *pre_p, tree *post_p)
2975 enum gimplify_status ret = GS_ALL_DONE;
2978 #if defined ENABLE_CHECKING
2979 if (TREE_CODE (*expr_p) != SAVE_EXPR)
2983 val = TREE_OPERAND (*expr_p, 0);
2985 /* If the operand is already a GIMPLE temporary, just re-write the
2987 if (is_gimple_tmp_var (val))
2989 /* The operand may be a void-valued expression such as SAVE_EXPRs
2990 generated by the Java frontend for class initialization. It is
2991 being executed only for its side-effects. */
2992 else if (TREE_TYPE (val) == void_type_node)
2994 tree body = TREE_OPERAND (*expr_p, 0);
2995 ret = gimplify_expr (& body, pre_p, post_p, is_gimple_stmt, fb_none);
2996 append_to_statement_list (body, pre_p);
3000 *expr_p = TREE_OPERAND (*expr_p, 0)
3001 = get_initialized_tmp_var (val, pre_p, post_p);
3006 /* Re-write the ADDR_EXPR node pointed by EXPR_P
3013 PRE_P points to the list where side effects that must happen before
3014 *EXPR_P should be stored.
3016 POST_P points to the list where side effects that must happen after
3017 *EXPR_P should be stored. */
3019 static enum gimplify_status
3020 gimplify_addr_expr (tree *expr_p, tree *pre_p, tree *post_p)
3022 tree expr = *expr_p;
3023 tree op0 = TREE_OPERAND (expr, 0);
3024 enum gimplify_status ret;
3026 switch (TREE_CODE (op0))
3029 /* Check if we are dealing with an expression of the form '&*ptr'.
3030 While the front end folds away '&*ptr' into 'ptr', these
3031 expressions may be generated internally by the compiler (e.g.,
3032 builtins like __builtin_va_end). */
3033 *expr_p = TREE_OPERAND (op0, 0);
3038 /* Fold &a[6] to (&a + 6). */
3039 ret = gimplify_array_ref_to_plus (&TREE_OPERAND (expr, 0),
3042 /* This added an INDIRECT_REF. Fold it away. */
3043 *expr_p = TREE_OPERAND (TREE_OPERAND (expr, 0), 0);
3046 case VIEW_CONVERT_EXPR:
3047 /* Take the address of our operand and then convert it to the type of
3050 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
3051 all clear. The impact of this transformation is even less clear. */
3052 *expr_p = fold_convert (TREE_TYPE (expr),
3053 build_fold_addr_expr (TREE_OPERAND (op0, 0)));
3058 /* We use fb_either here because the C frontend sometimes takes
3059 the address of a call that returns a struct. */
3060 ret = gimplify_expr (&TREE_OPERAND (expr, 0), pre_p, post_p,
3061 is_gimple_addr_expr_arg, fb_either);
3062 if (ret != GS_ERROR)
3064 /* Make sure TREE_INVARIANT, TREE_CONSTANT, and TREE_SIDE_EFFECTS
3066 recompute_tree_invarant_for_addr_expr (expr);
3068 /* Mark the RHS addressable. */
3069 lang_hooks.mark_addressable (TREE_OPERAND (expr, 0));
3074 /* If the operand is gimplified into a _DECL, mark the address expression
3075 as TREE_INVARIANT. */
3076 if (DECL_P (TREE_OPERAND (expr, 0)))
3077 TREE_INVARIANT (expr) = 1;
3082 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
3083 value; output operands should be a gimple lvalue. */
3085 static enum gimplify_status
3086 gimplify_asm_expr (tree *expr_p, tree *pre_p, tree *post_p)
3088 tree expr = *expr_p;
3089 int noutputs = list_length (ASM_OUTPUTS (expr));
3090 const char **oconstraints
3091 = (const char **) alloca ((noutputs) * sizeof (const char *));
3094 const char *constraint;
3095 bool allows_mem, allows_reg, is_inout;
3096 enum gimplify_status ret, tret;
3099 = resolve_asm_operand_names (ASM_STRING (expr), ASM_OUTPUTS (expr),
3103 for (i = 0, link = ASM_OUTPUTS (expr); link; ++i, link = TREE_CHAIN (link))
3105 oconstraints[i] = constraint
3106 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
3108 parse_output_constraint (&constraint, i, 0, 0,
3109 &allows_mem, &allows_reg, &is_inout);
3111 if (!allows_reg && allows_mem)
3112 lang_hooks.mark_addressable (TREE_VALUE (link));
3114 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
3115 is_inout ? is_gimple_min_lval : is_gimple_lvalue,
3116 fb_lvalue | fb_mayfail);
3117 if (tret == GS_ERROR)
3119 error ("invalid lvalue in asm output %d", i);
3125 /* An input/output operand. To give the optimizers more
3126 flexibility, split it into separate input and output
3130 size_t constraint_len = strlen (constraint);
3132 /* Turn the in/out constraint into an output constraint. */
3133 char *p = xstrdup (constraint);
3135 TREE_VALUE (TREE_PURPOSE (link)) = build_string (constraint_len, p);
3138 /* And add a matching input constraint. */
3141 sprintf (buf, "%d", i);
3142 input = build_string (strlen (buf), buf);
3145 input = build_string (constraint_len - 1, constraint + 1);
3146 input = build_tree_list (build_tree_list (NULL_TREE, input),
3147 unshare_expr (TREE_VALUE (link)));
3148 ASM_INPUTS (expr) = chainon (ASM_INPUTS (expr), input);
3152 for (link = ASM_INPUTS (expr); link; ++i, link = TREE_CHAIN (link))
3155 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
3156 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
3157 oconstraints, &allows_mem, &allows_reg);
3159 /* If the operand is a memory input, it should be an lvalue. */
3160 if (!allows_reg && allows_mem)
3162 lang_hooks.mark_addressable (TREE_VALUE (link));
3163 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
3164 is_gimple_lvalue, fb_lvalue | fb_mayfail);
3165 if (tret == GS_ERROR)
3167 error ("memory input %d is not directly addressable", i);
3173 tret = gimplify_expr (&TREE_VALUE (link), pre_p, post_p,
3174 is_gimple_val, fb_rvalue);
3175 if (tret == GS_ERROR)
3183 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
3184 WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
3185 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
3186 return to this function.
3188 FIXME should we complexify the prequeue handling instead? Or use flags
3189 for all the cleanups and let the optimizer tighten them up? The current
3190 code seems pretty fragile; it will break on a cleanup within any
3191 non-conditional nesting. But any such nesting would be broken, anyway;
3192 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
3193 and continues out of it. We can do that at the RTL level, though, so
3194 having an optimizer to tighten up try/finally regions would be a Good
3197 static enum gimplify_status
3198 gimplify_cleanup_point_expr (tree *expr_p, tree *pre_p)
3200 tree_stmt_iterator iter;
3203 tree temp = voidify_wrapper_expr (*expr_p, NULL);
3205 /* We only care about the number of conditions between the innermost
3206 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count. */
3207 int old_conds = gimplify_ctxp->conditions;
3208 gimplify_ctxp->conditions = 0;
3210 body = TREE_OPERAND (*expr_p, 0);
3211 gimplify_to_stmt_list (&body);
3213 gimplify_ctxp->conditions = old_conds;
3215 for (iter = tsi_start (body); !tsi_end_p (iter); )
3217 tree *wce_p = tsi_stmt_ptr (iter);
3220 if (TREE_CODE (wce) == WITH_CLEANUP_EXPR)
3222 if (tsi_one_before_end_p (iter))
3224 tsi_link_before (&iter, TREE_OPERAND (wce, 0), TSI_SAME_STMT);
3232 sl = tsi_split_statement_list_after (&iter);
3233 tfe = build (TRY_FINALLY_EXPR, void_type_node, sl, NULL_TREE);
3234 append_to_statement_list (TREE_OPERAND (wce, 0),
3235 &TREE_OPERAND (tfe, 1));
3237 iter = tsi_start (sl);
3247 append_to_statement_list (body, pre_p);
3257 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
3258 is the cleanup action required. */
3261 gimple_push_cleanup (tree var, tree cleanup, tree *pre_p)
3265 /* Errors can result in improperly nested cleanups. Which results in
3266 confusion when trying to resolve the WITH_CLEANUP_EXPR. */
3267 if (errorcount || sorrycount)
3270 if (gimple_conditional_context ())
3272 /* If we're in a conditional context, this is more complex. We only
3273 want to run the cleanup if we actually ran the initialization that
3274 necessitates it, but we want to run it after the end of the
3275 conditional context. So we wrap the try/finally around the
3276 condition and use a flag to determine whether or not to actually
3277 run the destructor. Thus
3281 becomes (approximately)
3285 if (test) { A::A(temp); flag = 1; val = f(temp); }
3288 if (flag) A::~A(temp);
3293 tree flag = create_tmp_var (boolean_type_node, "cleanup");
3294 tree ffalse = build (MODIFY_EXPR, void_type_node, flag,
3295 boolean_false_node);
3296 tree ftrue = build (MODIFY_EXPR, void_type_node, flag,
3298 cleanup = build (COND_EXPR, void_type_node, flag, cleanup, NULL);
3299 wce = build (WITH_CLEANUP_EXPR, void_type_node, cleanup);
3300 append_to_statement_list (ffalse, &gimplify_ctxp->conditional_cleanups);
3301 append_to_statement_list (wce, &gimplify_ctxp->conditional_cleanups);
3302 append_to_statement_list (ftrue, pre_p);
3304 /* Because of this manipulation, and the EH edges that jump
3305 threading cannot redirect, the temporary (VAR) will appear
3306 to be used uninitialized. Don't warn. */
3307 TREE_NO_WARNING (var) = 1;
3311 wce = build (WITH_CLEANUP_EXPR, void_type_node, cleanup);
3312 append_to_statement_list (wce, pre_p);
3315 gimplify_stmt (&TREE_OPERAND (wce, 0));
3318 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
3320 static enum gimplify_status
3321 gimplify_target_expr (tree *expr_p, tree *pre_p, tree *post_p)
3323 tree targ = *expr_p;
3324 tree temp = TARGET_EXPR_SLOT (targ);
3325 tree init = TARGET_EXPR_INITIAL (targ);
3326 enum gimplify_status ret;
3330 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
3331 to the temps list. */
3332 gimple_add_tmp_var (temp);
3334 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
3335 expression is supposed to initialize the slot. */
3336 if (VOID_TYPE_P (TREE_TYPE (init)))
3337 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt, fb_none);
3340 /* Special handling for BIND_EXPR can result in fewer temps. */
3342 if (TREE_CODE (init) == BIND_EXPR)
3343 gimplify_bind_expr (&init, temp, pre_p);
3346 init = build (MODIFY_EXPR, void_type_node, temp, init);
3347 ret = gimplify_expr (&init, pre_p, post_p, is_gimple_stmt,
3351 if (ret == GS_ERROR)
3353 append_to_statement_list (init, pre_p);
3355 /* If needed, push the cleanup for the temp. */
3356 if (TARGET_EXPR_CLEANUP (targ))
3358 gimplify_stmt (&TARGET_EXPR_CLEANUP (targ));
3359 gimple_push_cleanup (temp, TARGET_EXPR_CLEANUP (targ), pre_p);
3362 /* Only expand this once. */
3363 TREE_OPERAND (targ, 3) = init;
3364 TARGET_EXPR_INITIAL (targ) = NULL_TREE;
3366 else if (!DECL_SEEN_IN_BIND_EXPR_P (temp))
3367 /* We should have expanded this before. */
3374 /* Gimplification of expression trees. */
3376 /* Gimplify an expression which appears at statement context; usually, this
3377 means replacing it with a suitably gimple STATEMENT_LIST. */
3380 gimplify_stmt (tree *stmt_p)
3382 gimplify_expr (stmt_p, NULL, NULL, is_gimple_stmt, fb_none);
3385 /* Similarly, but force the result to be a STATEMENT_LIST. */
3388 gimplify_to_stmt_list (tree *stmt_p)
3390 gimplify_stmt (stmt_p);
3392 *stmt_p = alloc_stmt_list ();
3393 else if (TREE_CODE (*stmt_p) != STATEMENT_LIST)
3396 *stmt_p = alloc_stmt_list ();
3397 append_to_statement_list (t, stmt_p);
3402 /* Gimplifies the expression tree pointed by EXPR_P. Return 0 if
3403 gimplification failed.
3405 PRE_P points to the list where side effects that must happen before
3406 EXPR should be stored.
3408 POST_P points to the list where side effects that must happen after
3409 EXPR should be stored, or NULL if there is no suitable list. In
3410 that case, we copy the result to a temporary, emit the
3411 post-effects, and then return the temporary.
3413 GIMPLE_TEST_F points to a function that takes a tree T and
3414 returns nonzero if T is in the GIMPLE form requested by the
3415 caller. The GIMPLE predicates are in tree-gimple.c.
3417 This test is used twice. Before gimplification, the test is
3418 invoked to determine whether *EXPR_P is already gimple enough. If
3419 that fails, *EXPR_P is gimplified according to its code and
3420 GIMPLE_TEST_F is called again. If the test still fails, then a new
3421 temporary variable is created and assigned the value of the
3422 gimplified expression.
3424 FALLBACK tells the function what sort of a temporary we want. If the 1
3425 bit is set, an rvalue is OK. If the 2 bit is set, an lvalue is OK.
3426 If both are set, either is OK, but an lvalue is preferable.
3428 The return value is either GS_ERROR or GS_ALL_DONE, since this function
3429 iterates until solution. */
3431 enum gimplify_status
3432 gimplify_expr (tree *expr_p, tree *pre_p, tree *post_p,
3433 bool (* gimple_test_f) (tree), fallback_t fallback)
3436 tree internal_pre = NULL_TREE;
3437 tree internal_post = NULL_TREE;
3439 int is_statement = (pre_p == NULL);
3440 location_t saved_location;
3441 enum gimplify_status ret;
3443 save_expr = *expr_p;
3444 if (save_expr == NULL_TREE)
3447 /* We used to check the predicate here and return immediately if it
3448 succeeds. This is wrong; the design is for gimplification to be
3449 idempotent, and for the predicates to only test for valid forms, not
3450 whether they are fully simplified. */
3452 /* Set up our internal queues if needed. */
3454 pre_p = &internal_pre;
3456 post_p = &internal_post;
3458 saved_location = input_location;
3459 if (save_expr != error_mark_node
3460 && EXPR_HAS_LOCATION (*expr_p))
3461 input_location = EXPR_LOCATION (*expr_p);
3463 /* Loop over the specific gimplifiers until the toplevel node
3464 remains the same. */
3467 /* Strip away as many useless type conversions as possible
3469 STRIP_USELESS_TYPE_CONVERSION (*expr_p);
3471 /* Remember the expr. */
3472 save_expr = *expr_p;
3474 /* Die, die, die, my darling. */
3475 if (save_expr == error_mark_node
3476 || (TREE_TYPE (save_expr)
3477 && TREE_TYPE (save_expr) == error_mark_node))
3483 /* Do any language-specific gimplification. */
3484 ret = lang_hooks.gimplify_expr (expr_p, pre_p, post_p);
3487 if (*expr_p == NULL_TREE)
3489 if (*expr_p != save_expr)
3492 else if (ret != GS_UNHANDLED)
3496 switch (TREE_CODE (*expr_p))
3498 /* First deal with the special cases. */
3500 case POSTINCREMENT_EXPR:
3501 case POSTDECREMENT_EXPR:
3502 case PREINCREMENT_EXPR:
3503 case PREDECREMENT_EXPR:
3504 ret = gimplify_self_mod_expr (expr_p, pre_p, post_p,
3505 fallback != fb_none);
3509 case ARRAY_RANGE_REF:
3513 ret = gimplify_compound_lval (expr_p, pre_p, post_p,
3514 fallback ? fallback : fb_rvalue);
3518 ret = gimplify_cond_expr (expr_p, pre_p, NULL_TREE);
3522 ret = gimplify_call_expr (expr_p, pre_p, fallback != fb_none);
3529 ret = gimplify_compound_expr (expr_p, pre_p, fallback != fb_none);
3534 ret = gimplify_modify_expr (expr_p, pre_p, post_p,
3535 fallback != fb_none);
3538 case TRUTH_ANDIF_EXPR:
3539 case TRUTH_ORIF_EXPR:
3540 ret = gimplify_boolean_expr (expr_p);
3543 case TRUTH_NOT_EXPR:
3544 TREE_OPERAND (*expr_p, 0)
3545 = gimple_boolify (TREE_OPERAND (*expr_p, 0));
3546 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3547 is_gimple_val, fb_rvalue);
3548 recalculate_side_effects (*expr_p);
3552 ret = gimplify_addr_expr (expr_p, pre_p, post_p);
3556 ret = gimplify_va_arg_expr (expr_p, pre_p, post_p);
3559 case VIEW_CONVERT_EXPR:
3560 if (VOID_TYPE_P (TREE_TYPE (*expr_p))
3561 || fallback == fb_none)
3563 /* Just strip a conversion to void (or in void context) and
3565 *expr_p = TREE_OPERAND (*expr_p, 0);
3569 /* If both types are BLKmode or if one type is of variable size,
3570 convert this into a pointer punning operation. This avoids
3571 copies of large data or making a variable-size temporary.
3573 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
3574 all clear. The impact of this transformation is even less
3577 if ((TYPE_MODE (TREE_TYPE (*expr_p)) == BLKmode
3578 && TYPE_MODE (TREE_TYPE (TREE_OPERAND (*expr_p, 0))) == BLKmode)
3579 || !TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (*expr_p)))
3580 || !TREE_CONSTANT (TYPE_SIZE (TREE_TYPE
3581 (TREE_OPERAND (*expr_p,0)))))
3583 tree restype = TREE_TYPE (*expr_p);
3584 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (*expr_p),
3585 fold_convert (build_pointer_type (restype),
3586 build_fold_addr_expr
3587 (TREE_OPERAND (*expr_p, 0))));
3594 if (IS_EMPTY_STMT (*expr_p))
3600 if (VOID_TYPE_P (TREE_TYPE (*expr_p))
3601 || fallback == fb_none)
3603 /* Just strip a conversion to void (or in void context) and
3605 *expr_p = TREE_OPERAND (*expr_p, 0);
3609 ret = gimplify_conversion (expr_p);
3610 if (ret == GS_ERROR)
3612 if (*expr_p != save_expr)
3616 case FIX_TRUNC_EXPR:
3618 case FIX_FLOOR_EXPR:
3619 case FIX_ROUND_EXPR:
3621 /* unary_expr: ... | '(' cast ')' val | ... */
3622 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3623 is_gimple_val, fb_rvalue);
3624 recalculate_side_effects (*expr_p);
3628 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3629 is_gimple_reg, fb_rvalue);
3630 recalculate_side_effects (*expr_p);
3633 /* Constants need not be gimplified. */
3643 *expr_p = DECL_INITIAL (*expr_p);
3647 ret = gimplify_decl_expr (expr_p);
3651 /* FIXME make this a decl. */
3656 ret = gimplify_bind_expr (expr_p, NULL, pre_p);
3660 ret = gimplify_loop_expr (expr_p, pre_p);
3664 ret = gimplify_switch_expr (expr_p, pre_p);
3667 case LABELED_BLOCK_EXPR:
3668 ret = gimplify_labeled_block_expr (expr_p);
3671 case EXIT_BLOCK_EXPR:
3672 ret = gimplify_exit_block_expr (expr_p);
3676 ret = gimplify_exit_expr (expr_p);
3680 /* If the target is not LABEL, then it is a computed jump
3681 and the target needs to be gimplified. */
3682 if (TREE_CODE (GOTO_DESTINATION (*expr_p)) != LABEL_DECL)
3683 ret = gimplify_expr (&GOTO_DESTINATION (*expr_p), pre_p,
3684 NULL, is_gimple_val, fb_rvalue);
3689 #ifdef ENABLE_CHECKING
3690 if (decl_function_context (LABEL_EXPR_LABEL (*expr_p)) != current_function_decl)
3695 case CASE_LABEL_EXPR:
3696 ret = gimplify_case_label_expr (expr_p);
3700 ret = gimplify_return_expr (*expr_p, pre_p);
3704 /* Don't reduce this in place; let gimplify_init_constructor work its
3705 magic. Buf if we're just elaborating this for side effects, just
3706 gimplify any element that has side-effects. */
3707 if (fallback == fb_none)
3709 for (tmp = CONSTRUCTOR_ELTS (*expr_p); tmp;
3710 tmp = TREE_CHAIN (tmp))
3711 if (TREE_SIDE_EFFECTS (TREE_VALUE (tmp)))
3712 gimplify_expr (&TREE_VALUE (tmp), pre_p, post_p,
3713 gimple_test_f, fallback);
3715 *expr_p = NULL_TREE;
3721 /* The following are special cases that are not handled by the
3722 original GIMPLE grammar. */
3724 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
3727 ret = gimplify_save_expr (expr_p, pre_p, post_p);
3732 enum gimplify_status r0, r1, r2;
3734 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3735 is_gimple_lvalue, fb_either);
3736 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
3737 is_gimple_val, fb_rvalue);
3738 r2 = gimplify_expr (&TREE_OPERAND (*expr_p, 2), pre_p, post_p,
3739 is_gimple_val, fb_rvalue);
3740 recalculate_side_effects (*expr_p);
3742 ret = MIN (r0, MIN (r1, r2));
3746 case NON_LVALUE_EXPR:
3747 /* This should have been stripped above. */
3752 ret = gimplify_asm_expr (expr_p, pre_p, post_p);
3755 case TRY_FINALLY_EXPR:
3756 case TRY_CATCH_EXPR:
3757 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p, 0));
3758 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p, 1));
3762 case CLEANUP_POINT_EXPR:
3763 ret = gimplify_cleanup_point_expr (expr_p, pre_p);
3767 ret = gimplify_target_expr (expr_p, pre_p, post_p);
3771 gimplify_to_stmt_list (&CATCH_BODY (*expr_p));
3775 case EH_FILTER_EXPR:
3776 gimplify_to_stmt_list (&EH_FILTER_FAILURE (*expr_p));
3782 enum gimplify_status r0, r1;
3783 r0 = gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p), pre_p, post_p,
3784 is_gimple_val, fb_rvalue);
3785 r1 = gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p), pre_p, post_p,
3786 is_gimple_val, fb_rvalue);
3793 ret = gimplify_minimax_expr (expr_p, pre_p, post_p);
3797 /* We get here when taking the address of a label. We mark
3798 the label as "forced"; meaning it can never be removed and
3799 it is a potential target for any computed goto. */
3800 FORCED_LABEL (*expr_p) = 1;
3804 case STATEMENT_LIST:
3805 ret = gimplify_statement_list (expr_p);
3808 case WITH_SIZE_EXPR:
3810 enum gimplify_status r0, r1;
3811 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
3812 post_p == &internal_post ? NULL : post_p,
3813 gimple_test_f, fallback);
3814 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
3815 is_gimple_val, fb_rvalue);
3820 /* ??? If this is a local variable, and it has not been seen in any
3821 outer BIND_EXPR, then it's probably the result of a duplicate
3822 declaration, for which we've already issued an error. It would
3823 be really nice if the front end wouldn't leak these at all.
3824 Currently the only known culprit is C++ destructors, as seen
3825 in g++.old-deja/g++.jason/binding.C. */
3827 if (!TREE_STATIC (tmp) && !DECL_EXTERNAL (tmp)
3828 && decl_function_context (tmp) == current_function_decl
3829 && !DECL_SEEN_IN_BIND_EXPR_P (tmp))
3831 #ifdef ENABLE_CHECKING
3832 if (!errorcount && !sorrycount)
3842 /* Allow callbacks into the gimplifier during optimization. */
3847 /* If this is a comparison of objects of aggregate type, handle
3848 it specially (by converting to a call to memcmp). It would be
3849 nice to only have to do this for variable-sized objects, but
3850 then we'd have to allow the same nest of reference nodes we
3851 allow for MODIFY_EXPR and that's too complex. */
3852 if (TREE_CODE_CLASS (TREE_CODE (*expr_p)) == '<'
3853 && (AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p, 1)))))
3854 ret = gimplify_variable_sized_compare (expr_p);
3856 /* If *EXPR_P does not need to be special-cased, handle it
3857 according to its class. */
3858 else if (TREE_CODE_CLASS (TREE_CODE (*expr_p)) == '1')
3859 ret = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
3860 post_p, is_gimple_val, fb_rvalue);
3861 else if (TREE_CODE_CLASS (TREE_CODE (*expr_p)) == '2'
3862 || TREE_CODE_CLASS (TREE_CODE (*expr_p)) == '<'
3863 || TREE_CODE (*expr_p) == TRUTH_AND_EXPR
3864 || TREE_CODE (*expr_p) == TRUTH_OR_EXPR
3865 || TREE_CODE (*expr_p) == TRUTH_XOR_EXPR)
3867 enum gimplify_status r0, r1;
3869 r0 = gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p,
3870 post_p, is_gimple_val, fb_rvalue);
3871 r1 = gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p,
3872 post_p, is_gimple_val, fb_rvalue);
3876 else if (TREE_CODE_CLASS (TREE_CODE (*expr_p)) == 'd'
3877 || TREE_CODE_CLASS (TREE_CODE (*expr_p)) == 'c')
3883 /* Fail if we don't know how to handle this tree code. */
3886 recalculate_side_effects (*expr_p);
3890 /* If we replaced *expr_p, gimplify again. */
3891 if (ret == GS_OK && (*expr_p == NULL || *expr_p == save_expr))
3894 while (ret == GS_OK);
3896 /* If we encountered an error_mark somewhere nested inside, either
3897 stub out the statement or propagate the error back out. */
3898 if (ret == GS_ERROR)
3905 #ifdef ENABLE_CHECKING
3906 /* This was only valid as a return value from the langhook, which
3907 we handled. Make sure it doesn't escape from any other context. */
3908 if (ret == GS_UNHANDLED)
3912 if (fallback == fb_none && *expr_p && !is_gimple_stmt (*expr_p))
3914 /* We aren't looking for a value, and we don't have a valid
3915 statement. If it doesn't have side-effects, throw it away. */
3916 if (!TREE_SIDE_EFFECTS (*expr_p))
3918 else if (!TREE_THIS_VOLATILE (*expr_p))
3920 /* This is probably a _REF that contains something nested that
3921 has side effects. Recurse through the operands to find it. */
3922 enum tree_code code = TREE_CODE (*expr_p);
3924 if (code == COMPONENT_REF
3925 || code == REALPART_EXPR || code == IMAGPART_EXPR)
3926 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3927 gimple_test_f, fallback);
3928 else if (code == ARRAY_REF || code == ARRAY_RANGE_REF)
3930 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
3931 gimple_test_f, fallback);
3932 gimplify_expr (&TREE_OPERAND (*expr_p, 1), pre_p, post_p,
3933 gimple_test_f, fallback);
3936 /* Anything else with side-effects
3937 must be converted to a valid statement before we get here. */
3942 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p)))
3944 /* Historically, the compiler has treated a bare
3945 reference to a volatile lvalue as forcing a load. */
3946 tree tmp = create_tmp_var (TREE_TYPE (*expr_p), "vol");
3947 *expr_p = build (MODIFY_EXPR, TREE_TYPE (tmp), tmp, *expr_p);
3950 /* We can't do anything useful with a volatile reference to
3951 incomplete type, so just throw it away. */
3955 /* If we are gimplifying at the statement level, we're done. Tack
3956 everything together and replace the original statement with the
3958 if (fallback == fb_none || is_statement)
3960 if (internal_pre || internal_post)
3962 append_to_statement_list (*expr_p, &internal_pre);
3963 append_to_statement_list (internal_post, &internal_pre);
3964 annotate_all_with_locus (&internal_pre, input_location);
3965 *expr_p = internal_pre;
3969 else if (TREE_CODE (*expr_p) == STATEMENT_LIST)
3970 annotate_all_with_locus (expr_p, input_location);
3972 annotate_one_with_locus (*expr_p, input_location);
3976 /* Otherwise we're gimplifying a subexpression, so the resulting value is
3979 /* If it's sufficiently simple already, we're done. Unless we are
3980 handling some post-effects internally; if that's the case, we need to
3981 copy into a temp before adding the post-effects to the tree. */
3982 if (!internal_post && (*gimple_test_f) (*expr_p))
3985 /* Otherwise, we need to create a new temporary for the gimplified
3988 /* We can't return an lvalue if we have an internal postqueue. The
3989 object the lvalue refers to would (probably) be modified by the
3990 postqueue; we need to copy the value out first, which means an
3992 if ((fallback & fb_lvalue) && !internal_post
3993 && is_gimple_addr_expr_arg (*expr_p))
3995 /* An lvalue will do. Take the address of the expression, store it
3996 in a temporary, and replace the expression with an INDIRECT_REF of
3998 tmp = build_fold_addr_expr (*expr_p);
3999 gimplify_expr (&tmp, pre_p, post_p, is_gimple_reg, fb_rvalue);
4000 *expr_p = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (tmp)), tmp);
4002 else if ((fallback & fb_rvalue) && is_gimple_tmp_rhs (*expr_p))
4004 #if defined ENABLE_CHECKING
4005 if (VOID_TYPE_P (TREE_TYPE (*expr_p)))
4009 /* An rvalue will do. Assign the gimplified expression into a new
4010 temporary TMP and replace the original expression with TMP. */
4012 if (internal_post || (fallback & fb_lvalue))
4013 /* The postqueue might change the value of the expression between
4014 the initialization and use of the temporary, so we can't use a
4015 formal temp. FIXME do we care? */
4016 *expr_p = get_initialized_tmp_var (*expr_p, pre_p, post_p);
4018 *expr_p = get_formal_tmp_var (*expr_p, pre_p);
4020 else if (fallback & fb_mayfail)
4022 /* If this is an asm statement, and the user asked for the impossible,
4023 don't abort. Fail and let gimplify_asm_expr issue an error. */
4029 fprintf (stderr, "gimplification failed:\n");
4030 print_generic_expr (stderr, *expr_p, 0);
4031 debug_tree (*expr_p);
4035 #if defined ENABLE_CHECKING
4036 /* Make sure the temporary matches our predicate. */
4037 if (!(*gimple_test_f) (*expr_p))
4043 annotate_all_with_locus (&internal_post, input_location);
4044 append_to_statement_list (internal_post, pre_p);
4048 input_location = saved_location;
4052 /* Look through TYPE for variable-sized objects and gimplify each such
4053 size that we find. Add to LIST_P any statements generated. */
4056 gimplify_type_sizes (tree type, tree *list_p)
4060 switch (TREE_CODE (type))
4070 gimplify_one_sizepos (&TYPE_MIN_VALUE (type), list_p);
4071 gimplify_one_sizepos (&TYPE_MAX_VALUE (type), list_p);
4075 /* These anonymous types don't have declarations, so handle them here. */
4076 gimplify_type_sizes (TYPE_DOMAIN (type), list_p);
4081 case QUAL_UNION_TYPE:
4082 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
4083 if (TREE_CODE (field) == FIELD_DECL)
4084 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field), list_p);
4091 gimplify_one_sizepos (&TYPE_SIZE (type), list_p);
4092 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type), list_p);
4095 /* Subroutine of the above to gimplify one size or position, *EXPR_P.
4096 We add any required statements to STMT_P. */
4099 gimplify_one_sizepos (tree *expr_p, tree *stmt_p)
4101 /* We don't do anything if the value isn't there, is constant, or contains
4102 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
4103 a VAR_DECL. If it's a VAR_DECL from another function, the gimplfier
4104 will want to replace it with a new variable, but that will cause problems
4105 if this type is from outside the function. It's OK to have that here. */
4106 if (*expr_p == NULL_TREE || TREE_CONSTANT (*expr_p)
4107 || TREE_CODE (*expr_p) == VAR_DECL
4108 || CONTAINS_PLACEHOLDER_P (*expr_p))
4111 gimplify_expr (expr_p, stmt_p, NULL, is_gimple_val, fb_rvalue);
4114 #ifdef ENABLE_CHECKING
4115 /* Compare types A and B for a "close enough" match. */
4118 cpt_same_type (tree a, tree b)
4120 if (lang_hooks.types_compatible_p (a, b))
4123 /* ??? The C++ FE decomposes METHOD_TYPES to FUNCTION_TYPES and doesn't
4124 link them together. This routine is intended to catch type errors
4125 that will affect the optimizers, and the optimizers don't add new
4126 dereferences of function pointers, so ignore it. */
4127 if ((TREE_CODE (a) == FUNCTION_TYPE || TREE_CODE (a) == METHOD_TYPE)
4128 && (TREE_CODE (b) == FUNCTION_TYPE || TREE_CODE (b) == METHOD_TYPE))
4131 /* ??? The C FE pushes type qualifiers after the fact into the type of
4132 the element from the type of the array. See build_unary_op's handling
4133 of ADDR_EXPR. This seems wrong -- if we were going to do this, we
4134 should have done it when creating the variable in the first place.
4135 Alternately, why aren't the two array types made variants? */
4136 if (TREE_CODE (a) == ARRAY_TYPE && TREE_CODE (b) == ARRAY_TYPE)
4137 return cpt_same_type (TREE_TYPE (a), TREE_TYPE (b));
4139 /* And because of those, we have to recurse down through pointers. */
4140 if (POINTER_TYPE_P (a) && POINTER_TYPE_P (b))
4141 return cpt_same_type (TREE_TYPE (a), TREE_TYPE (b));
4146 /* Check for some cases of the front end missing cast expressions.
4147 The type of a dereference should correspond to the pointer type;
4148 similarly the type of an address should match its object. */
4151 check_pointer_types_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
4152 void *data ATTRIBUTE_UNUSED)
4155 tree ptype, otype, dtype;
4157 switch (TREE_CODE (t))
4161 otype = TREE_TYPE (t);
4162 ptype = TREE_TYPE (TREE_OPERAND (t, 0));
4163 dtype = TREE_TYPE (ptype);
4164 if (!cpt_same_type (otype, dtype))
4169 ptype = TREE_TYPE (t);
4170 otype = TREE_TYPE (TREE_OPERAND (t, 0));
4171 dtype = TREE_TYPE (ptype);
4172 if (!cpt_same_type (otype, dtype))
4174 /* &array is allowed to produce a pointer to the element, rather than
4175 a pointer to the array type. We must allow this in order to
4176 properly represent assigning the address of an array in C into
4177 pointer to the element type. */
4178 if (TREE_CODE (otype) == ARRAY_TYPE
4179 && POINTER_TYPE_P (ptype)
4180 && cpt_same_type (TREE_TYPE (otype), dtype))
4195 /* Gimplify the body of statements pointed by BODY_P. FNDECL is the
4196 function decl containing BODY. */
4199 gimplify_body (tree *body_p, tree fndecl)
4201 location_t saved_location = input_location;
4204 timevar_push (TV_TREE_GIMPLIFY);
4205 push_gimplify_context ();
4207 /* Unshare most shared trees in the body and in that of any nested functions.
4208 It would seem we don't have to do this for nested functions because
4209 they are supposed to be output and then the outer function gimplified
4210 first, but the g++ front end doesn't always do it that way. */
4211 unshare_body (body_p, fndecl);
4212 unvisit_body (body_p, fndecl);
4214 /* Make sure input_location isn't set to something wierd. */
4215 input_location = DECL_SOURCE_LOCATION (fndecl);
4217 /* Gimplify the function's body. */
4218 gimplify_stmt (body_p);
4221 /* Unshare again, in case gimplification was sloppy. */
4222 unshare_all_trees (body);
4225 body = alloc_stmt_list ();
4226 else if (TREE_CODE (body) == STATEMENT_LIST)
4228 tree t = expr_only (*body_p);
4233 /* If there isn't an outer BIND_EXPR, add one. */
4234 if (TREE_CODE (body) != BIND_EXPR)
4236 tree b = build (BIND_EXPR, void_type_node, NULL_TREE,
4237 NULL_TREE, NULL_TREE);
4238 TREE_SIDE_EFFECTS (b) = 1;
4239 append_to_statement_list_force (body, &BIND_EXPR_BODY (b));
4244 pop_gimplify_context (body);
4246 #ifdef ENABLE_CHECKING
4247 walk_tree (body_p, check_pointer_types_r, NULL, NULL);
4250 timevar_pop (TV_TREE_GIMPLIFY);
4251 input_location = saved_location;
4254 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
4255 node for the function we want to gimplify. */
4258 gimplify_function_tree (tree fndecl)
4262 oldfn = current_function_decl;
4263 current_function_decl = fndecl;
4265 gimplify_body (&DECL_SAVED_TREE (fndecl), fndecl);
4267 /* If we're instrumenting function entry/exit, then prepend the call to
4268 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
4269 catch the exit hook. */
4270 /* ??? Add some way to ignore exceptions for this TFE. */
4271 if (flag_instrument_function_entry_exit
4272 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl))
4276 tf = build (TRY_FINALLY_EXPR, void_type_node, NULL, NULL);
4277 TREE_SIDE_EFFECTS (tf) = 1;
4278 x = DECL_SAVED_TREE (fndecl);
4279 append_to_statement_list (x, &TREE_OPERAND (tf, 0));
4280 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_EXIT];
4281 x = build_function_call_expr (x, NULL);
4282 append_to_statement_list (x, &TREE_OPERAND (tf, 1));
4284 bind = build (BIND_EXPR, void_type_node, NULL, NULL, NULL);
4285 TREE_SIDE_EFFECTS (bind) = 1;
4286 x = implicit_built_in_decls[BUILT_IN_PROFILE_FUNC_ENTER];
4287 x = build_function_call_expr (x, NULL);
4288 append_to_statement_list (x, &BIND_EXPR_BODY (bind));
4289 append_to_statement_list (tf, &BIND_EXPR_BODY (bind));
4291 DECL_SAVED_TREE (fndecl) = bind;
4294 current_function_decl = oldfn;
4297 #include "gt-gimplify.h"