1 /* Tree lowering pass. This pass converts the GENERIC functions-as-trees
2 tree representation into the GIMPLE form.
3 Copyright (C) 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
4 Major work done by Sebastian Pop <s.pop@laposte.net>,
5 Diego Novillo <dnovillo@redhat.com> and Jason Merrill <jason@redhat.com>.
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify it under
10 the terms of the GNU General Public License as published by the Free
11 Software Foundation; either version 2, or (at your option) any later
14 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
15 WARRANTY; without even the implied warranty of MERCHANTABILITY or
16 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING. If not, write to the Free
21 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
26 #include "coretypes.h"
31 #include "tree-gimple.h"
32 #include "tree-inline.h"
33 #include "diagnostic.h"
34 #include "langhooks.h"
35 #include "langhooks-def.h"
36 #include "tree-flow.h"
50 static struct gimplify_ctx
52 tree current_bind_expr
;
54 tree conditional_cleanups
;
57 VEC(tree
,heap
) *case_labels
;
58 /* The formal temporary table. Should this be persistent? */
66 /* Formal (expression) temporary table handling: Multiple occurrences of
67 the same scalar expression are evaluated into the same temporary. */
69 typedef struct gimple_temp_hash_elt
72 tree temp
; /* Value */
75 /* Forward declarations. */
76 static enum gimplify_status
gimplify_compound_expr (tree
*, tree
*, bool);
77 #ifdef ENABLE_CHECKING
78 static bool cpt_same_type (tree a
, tree b
);
82 /* Return a hash value for a formal temporary table entry. */
85 gimple_tree_hash (const void *p
)
87 tree t
= ((const elt_t
*) p
)->val
;
88 return iterative_hash_expr (t
, 0);
91 /* Compare two formal temporary table entries. */
94 gimple_tree_eq (const void *p1
, const void *p2
)
96 tree t1
= ((const elt_t
*) p1
)->val
;
97 tree t2
= ((const elt_t
*) p2
)->val
;
98 enum tree_code code
= TREE_CODE (t1
);
100 if (TREE_CODE (t2
) != code
101 || TREE_TYPE (t1
) != TREE_TYPE (t2
))
104 if (!operand_equal_p (t1
, t2
, 0))
107 /* Only allow them to compare equal if they also hash equal; otherwise
108 results are nondeterminate, and we fail bootstrap comparison. */
109 gcc_assert (gimple_tree_hash (p1
) == gimple_tree_hash (p2
));
114 /* Set up a context for the gimplifier. */
117 push_gimplify_context (void)
119 gcc_assert (!gimplify_ctxp
);
121 = (struct gimplify_ctx
*) xcalloc (1, sizeof (struct gimplify_ctx
));
123 gimplify_ctxp
->temp_htab
124 = htab_create (1000, gimple_tree_hash
, gimple_tree_eq
, free
);
126 gimplify_ctxp
->temp_htab
= NULL
;
129 /* Tear down a context for the gimplifier. If BODY is non-null, then
130 put the temporaries into the outer BIND_EXPR. Otherwise, put them
131 in the unexpanded_var_list. */
134 pop_gimplify_context (tree body
)
138 gcc_assert (gimplify_ctxp
&& !gimplify_ctxp
->current_bind_expr
);
140 for (t
= gimplify_ctxp
->temps
; t
; t
= TREE_CHAIN (t
))
141 DECL_GIMPLE_FORMAL_TEMP_P (t
) = 0;
144 declare_tmp_vars (gimplify_ctxp
->temps
, body
);
146 record_vars (gimplify_ctxp
->temps
);
149 if (!quiet_flag
&& optimize
)
150 fprintf (stderr
, " collisions: %f ",
151 htab_collisions (gimplify_ctxp
->temp_htab
));
155 htab_delete (gimplify_ctxp
->temp_htab
);
156 free (gimplify_ctxp
);
157 gimplify_ctxp
= NULL
;
161 gimple_push_bind_expr (tree bind
)
163 TREE_CHAIN (bind
) = gimplify_ctxp
->current_bind_expr
;
164 gimplify_ctxp
->current_bind_expr
= bind
;
168 gimple_pop_bind_expr (void)
170 gimplify_ctxp
->current_bind_expr
171 = TREE_CHAIN (gimplify_ctxp
->current_bind_expr
);
175 gimple_current_bind_expr (void)
177 return gimplify_ctxp
->current_bind_expr
;
180 /* Returns true iff there is a COND_EXPR between us and the innermost
181 CLEANUP_POINT_EXPR. This info is used by gimple_push_cleanup. */
184 gimple_conditional_context (void)
186 return gimplify_ctxp
->conditions
> 0;
189 /* Note that we've entered a COND_EXPR. */
192 gimple_push_condition (void)
194 #ifdef ENABLE_CHECKING
195 if (gimplify_ctxp
->conditions
== 0)
196 gcc_assert (!gimplify_ctxp
->conditional_cleanups
);
198 ++(gimplify_ctxp
->conditions
);
201 /* Note that we've left a COND_EXPR. If we're back at unconditional scope
202 now, add any conditional cleanups we've seen to the prequeue. */
205 gimple_pop_condition (tree
*pre_p
)
207 int conds
= --(gimplify_ctxp
->conditions
);
209 gcc_assert (conds
>= 0);
212 append_to_statement_list (gimplify_ctxp
->conditional_cleanups
, pre_p
);
213 gimplify_ctxp
->conditional_cleanups
= NULL_TREE
;
217 /* A subroutine of append_to_statement_list{,_force}. T is not NULL. */
220 append_to_statement_list_1 (tree t
, tree
*list_p
)
223 tree_stmt_iterator i
;
227 if (t
&& TREE_CODE (t
) == STATEMENT_LIST
)
232 *list_p
= list
= alloc_stmt_list ();
236 tsi_link_after (&i
, t
, TSI_CONTINUE_LINKING
);
239 /* Add T to the end of the list container pointed by LIST_P.
240 If T is an expression with no effects, it is ignored. */
243 append_to_statement_list (tree t
, tree
*list_p
)
245 if (t
&& TREE_SIDE_EFFECTS (t
))
246 append_to_statement_list_1 (t
, list_p
);
249 /* Similar, but the statement is always added, regardless of side effects. */
252 append_to_statement_list_force (tree t
, tree
*list_p
)
255 append_to_statement_list_1 (t
, list_p
);
258 /* Both gimplify the statement T and append it to LIST_P. */
261 gimplify_and_add (tree t
, tree
*list_p
)
264 append_to_statement_list (t
, list_p
);
267 /* Strip off a legitimate source ending from the input string NAME of
268 length LEN. Rather than having to know the names used by all of
269 our front ends, we strip off an ending of a period followed by
270 up to five characters. (Java uses ".class".) */
273 remove_suffix (char *name
, int len
)
277 for (i
= 2; i
< 8 && len
> i
; i
++)
279 if (name
[len
- i
] == '.')
281 name
[len
- i
] = '\0';
287 /* Create a nameless artificial label and put it in the current function
288 context. Returns the newly created label. */
291 create_artificial_label (void)
293 tree lab
= build_decl (LABEL_DECL
, NULL_TREE
, void_type_node
);
295 DECL_ARTIFICIAL (lab
) = 1;
296 DECL_IGNORED_P (lab
) = 1;
297 DECL_CONTEXT (lab
) = current_function_decl
;
301 /* Create a new temporary name with PREFIX. Returns an identifier. */
303 static GTY(()) unsigned int tmp_var_id_num
;
306 create_tmp_var_name (const char *prefix
)
312 char *preftmp
= ASTRDUP (prefix
);
314 remove_suffix (preftmp
, strlen (preftmp
));
318 ASM_FORMAT_PRIVATE_NAME (tmp_name
, prefix
? prefix
: "T", tmp_var_id_num
++);
319 return get_identifier (tmp_name
);
323 /* Create a new temporary variable declaration of type TYPE.
324 Does NOT push it into the current binding. */
327 create_tmp_var_raw (tree type
, const char *prefix
)
332 /* Make the type of the variable writable. */
333 new_type
= build_type_variant (type
, 0, 0);
334 TYPE_ATTRIBUTES (new_type
) = TYPE_ATTRIBUTES (type
);
336 tmp_var
= build_decl (VAR_DECL
, prefix
? create_tmp_var_name (prefix
) : NULL
,
339 /* The variable was declared by the compiler. */
340 DECL_ARTIFICIAL (tmp_var
) = 1;
341 /* And we don't want debug info for it. */
342 DECL_IGNORED_P (tmp_var
) = 1;
344 /* Make the variable writable. */
345 TREE_READONLY (tmp_var
) = 0;
347 DECL_EXTERNAL (tmp_var
) = 0;
348 TREE_STATIC (tmp_var
) = 0;
349 TREE_USED (tmp_var
) = 1;
354 /* Create a new temporary variable declaration of type TYPE. DOES push the
355 variable into the current binding. Further, assume that this is called
356 only from gimplification or optimization, at which point the creation of
357 certain types are bugs. */
360 create_tmp_var (tree type
, const char *prefix
)
364 /* We don't allow types that are addressable (meaning we can't make copies),
365 incomplete, or of variable size. */
366 gcc_assert (!TREE_ADDRESSABLE (type
)
367 && COMPLETE_TYPE_P (type
)
368 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
);
370 tmp_var
= create_tmp_var_raw (type
, prefix
);
371 gimple_add_tmp_var (tmp_var
);
375 /* Given a tree, try to return a useful variable name that we can use
376 to prefix a temporary that is being assigned the value of the tree.
377 I.E. given <temp> = &A, return A. */
385 STRIP_NOPS (stripped_decl
);
386 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
387 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
390 switch (TREE_CODE (stripped_decl
))
393 return get_name (TREE_OPERAND (stripped_decl
, 0));
401 /* Create a temporary with a name derived from VAL. Subroutine of
402 lookup_tmp_var; nobody else should call this function. */
405 create_tmp_from_val (tree val
)
407 return create_tmp_var (TREE_TYPE (val
), get_name (val
));
410 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
411 an existing expression temporary. */
414 lookup_tmp_var (tree val
, bool is_formal
)
418 /* If not optimizing, never really reuse a temporary. local-alloc
419 won't allocate any variable that is used in more than one basic
420 block, which means it will go into memory, causing much extra
421 work in reload and final and poorer code generation, outweighing
422 the extra memory allocation here. */
423 if (!optimize
|| !is_formal
|| TREE_SIDE_EFFECTS (val
))
424 ret
= create_tmp_from_val (val
);
431 slot
= htab_find_slot (gimplify_ctxp
->temp_htab
, (void *)&elt
, INSERT
);
434 elt_p
= xmalloc (sizeof (*elt_p
));
436 elt_p
->temp
= ret
= create_tmp_from_val (val
);
437 *slot
= (void *) elt_p
;
441 elt_p
= (elt_t
*) *slot
;
447 DECL_GIMPLE_FORMAL_TEMP_P (ret
) = 1;
452 /* Returns a formal temporary variable initialized with VAL. PRE_P is as
453 in gimplify_expr. Only use this function if:
455 1) The value of the unfactored expression represented by VAL will not
456 change between the initialization and use of the temporary, and
457 2) The temporary will not be otherwise modified.
459 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
460 and #2 means it is inappropriate for && temps.
462 For other cases, use get_initialized_tmp_var instead. */
465 internal_get_tmp_var (tree val
, tree
*pre_p
, tree
*post_p
, bool is_formal
)
469 gimplify_expr (&val
, pre_p
, post_p
, is_gimple_formal_tmp_rhs
, fb_rvalue
);
471 t
= lookup_tmp_var (val
, is_formal
);
473 if (TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
)
474 DECL_COMPLEX_GIMPLE_REG_P (t
) = 1;
476 mod
= build (MODIFY_EXPR
, TREE_TYPE (t
), t
, val
);
478 if (EXPR_HAS_LOCATION (val
))
479 SET_EXPR_LOCUS (mod
, EXPR_LOCUS (val
));
481 SET_EXPR_LOCATION (mod
, input_location
);
483 /* gimplify_modify_expr might want to reduce this further. */
484 gimplify_and_add (mod
, pre_p
);
486 /* If we're gimplifying into ssa, gimplify_modify_expr will have
487 given our temporary an ssa name. Find and return it. */
488 if (gimplify_ctxp
->into_ssa
)
489 t
= TREE_OPERAND (mod
, 0);
495 get_formal_tmp_var (tree val
, tree
*pre_p
)
497 return internal_get_tmp_var (val
, pre_p
, NULL
, true);
500 /* Returns a temporary variable initialized with VAL. PRE_P and POST_P
501 are as in gimplify_expr. */
504 get_initialized_tmp_var (tree val
, tree
*pre_p
, tree
*post_p
)
506 return internal_get_tmp_var (val
, pre_p
, post_p
, false);
509 /* Declares all the variables in VARS in SCOPE. */
512 declare_tmp_vars (tree vars
, tree scope
)
519 /* C99 mode puts the default 'return 0;' for main outside the outer
520 braces. So drill down until we find an actual scope. */
521 while (TREE_CODE (scope
) == COMPOUND_EXPR
)
522 scope
= TREE_OPERAND (scope
, 0);
524 gcc_assert (TREE_CODE (scope
) == BIND_EXPR
);
526 temps
= nreverse (last
);
527 TREE_CHAIN (last
) = BIND_EXPR_VARS (scope
);
528 BIND_EXPR_VARS (scope
) = temps
;
533 gimple_add_tmp_var (tree tmp
)
535 gcc_assert (!TREE_CHAIN (tmp
) && !DECL_SEEN_IN_BIND_EXPR_P (tmp
));
537 DECL_CONTEXT (tmp
) = current_function_decl
;
538 DECL_SEEN_IN_BIND_EXPR_P (tmp
) = 1;
542 TREE_CHAIN (tmp
) = gimplify_ctxp
->temps
;
543 gimplify_ctxp
->temps
= tmp
;
548 declare_tmp_vars (tmp
, DECL_SAVED_TREE (current_function_decl
));
551 /* Determines whether to assign a locus to the statement STMT. */
554 should_carry_locus_p (tree stmt
)
556 /* Don't emit a line note for a label. We particularly don't want to
557 emit one for the break label, since it doesn't actually correspond
558 to the beginning of the loop/switch. */
559 if (TREE_CODE (stmt
) == LABEL_EXPR
)
562 /* Do not annotate empty statements, since it confuses gcov. */
563 if (!TREE_SIDE_EFFECTS (stmt
))
570 annotate_one_with_locus (tree t
, location_t locus
)
572 if (EXPR_P (t
) && ! EXPR_HAS_LOCATION (t
) && should_carry_locus_p (t
))
573 SET_EXPR_LOCATION (t
, locus
);
577 annotate_all_with_locus (tree
*stmt_p
, location_t locus
)
579 tree_stmt_iterator i
;
584 for (i
= tsi_start (*stmt_p
); !tsi_end_p (i
); tsi_next (&i
))
586 tree t
= tsi_stmt (i
);
588 /* Assuming we've already been gimplified, we shouldn't
589 see nested chaining constructs anymore. */
590 gcc_assert (TREE_CODE (t
) != STATEMENT_LIST
591 && TREE_CODE (t
) != COMPOUND_EXPR
);
593 annotate_one_with_locus (t
, locus
);
597 /* Similar to copy_tree_r() but do not copy SAVE_EXPR or TARGET_EXPR nodes.
598 These nodes model computations that should only be done once. If we
599 were to unshare something like SAVE_EXPR(i++), the gimplification
600 process would create wrong code. */
603 mostly_copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data
)
605 enum tree_code code
= TREE_CODE (*tp
);
606 /* Don't unshare types, decls, constants and SAVE_EXPR nodes. */
607 if (TREE_CODE_CLASS (code
) == tcc_type
608 || TREE_CODE_CLASS (code
) == tcc_declaration
609 || TREE_CODE_CLASS (code
) == tcc_constant
610 || code
== SAVE_EXPR
|| code
== TARGET_EXPR
611 /* We can't do anything sensible with a BLOCK used as an expression,
612 but we also can't just die when we see it because of non-expression
613 uses. So just avert our eyes and cross our fingers. Silly Java. */
618 gcc_assert (code
!= BIND_EXPR
);
619 copy_tree_r (tp
, walk_subtrees
, data
);
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
) == tcc_type
646 || TREE_CODE_CLASS (code
) == tcc_declaration
647 || TREE_CODE_CLASS (code
) == tcc_constant
)
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. */
665 TREE_VISITED (t
) = 1;
671 unmark_visited_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
672 void *data ATTRIBUTE_UNUSED
)
674 if (TREE_VISITED (*tp
))
675 TREE_VISITED (*tp
) = 0;
682 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
683 bodies of any nested functions if we are unsharing the entire body of
687 unshare_body (tree
*body_p
, tree fndecl
)
689 struct cgraph_node
*cgn
= cgraph_node (fndecl
);
691 walk_tree (body_p
, copy_if_shared_r
, NULL
, NULL
);
692 if (body_p
== &DECL_SAVED_TREE (fndecl
))
693 for (cgn
= cgn
->nested
; cgn
; cgn
= cgn
->next_nested
)
694 unshare_body (&DECL_SAVED_TREE (cgn
->decl
), cgn
->decl
);
697 /* Likewise, but mark all trees as not visited. */
700 unvisit_body (tree
*body_p
, tree fndecl
)
702 struct cgraph_node
*cgn
= cgraph_node (fndecl
);
704 walk_tree (body_p
, unmark_visited_r
, NULL
, NULL
);
705 if (body_p
== &DECL_SAVED_TREE (fndecl
))
706 for (cgn
= cgn
->nested
; cgn
; cgn
= cgn
->next_nested
)
707 unvisit_body (&DECL_SAVED_TREE (cgn
->decl
), cgn
->decl
);
710 /* Unshare T and all the trees reached from T via TREE_CHAIN. */
713 unshare_all_trees (tree t
)
715 walk_tree (&t
, copy_if_shared_r
, NULL
, NULL
);
716 walk_tree (&t
, unmark_visited_r
, NULL
, NULL
);
719 /* Unconditionally make an unshared copy of EXPR. This is used when using
720 stored expressions which span multiple functions, such as BINFO_VTABLE,
721 as the normal unsharing process can't tell that they're shared. */
724 unshare_expr (tree expr
)
726 walk_tree (&expr
, mostly_copy_tree_r
, NULL
, NULL
);
730 /* A terser interface for building a representation of an exception
734 gimple_build_eh_filter (tree body
, tree allowed
, tree failure
)
738 /* FIXME should the allowed types go in TREE_TYPE? */
739 t
= build (EH_FILTER_EXPR
, void_type_node
, allowed
, NULL_TREE
);
740 append_to_statement_list (failure
, &EH_FILTER_FAILURE (t
));
742 t
= build (TRY_CATCH_EXPR
, void_type_node
, NULL_TREE
, t
);
743 append_to_statement_list (body
, &TREE_OPERAND (t
, 0));
749 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
750 contain statements and have a value. Assign its value to a temporary
751 and give it void_type_node. Returns the temporary, or NULL_TREE if
752 WRAPPER was already void. */
755 voidify_wrapper_expr (tree wrapper
, tree temp
)
757 if (!VOID_TYPE_P (TREE_TYPE (wrapper
)))
759 tree
*p
, sub
= wrapper
;
762 /* Set p to point to the body of the wrapper. */
763 switch (TREE_CODE (sub
))
766 /* For a BIND_EXPR, the body is operand 1. */
767 p
= &BIND_EXPR_BODY (sub
);
771 p
= &TREE_OPERAND (sub
, 0);
775 /* Advance to the last statement. Set all container types to void. */
776 if (TREE_CODE (*p
) == STATEMENT_LIST
)
778 tree_stmt_iterator i
= tsi_last (*p
);
779 p
= tsi_end_p (i
) ? NULL
: tsi_stmt_ptr (i
);
783 for (; TREE_CODE (*p
) == COMPOUND_EXPR
; p
= &TREE_OPERAND (*p
, 1))
785 TREE_SIDE_EFFECTS (*p
) = 1;
786 TREE_TYPE (*p
) = void_type_node
;
790 if (p
== NULL
|| IS_EMPTY_STMT (*p
))
792 /* Look through exception handling. */
793 else if (TREE_CODE (*p
) == TRY_FINALLY_EXPR
794 || TREE_CODE (*p
) == TRY_CATCH_EXPR
)
799 /* The C++ frontend already did this for us. */
800 else if (TREE_CODE (*p
) == INIT_EXPR
801 || TREE_CODE (*p
) == TARGET_EXPR
)
802 temp
= TREE_OPERAND (*p
, 0);
803 /* If we're returning a dereference, move the dereference
804 outside the wrapper. */
805 else if (TREE_CODE (*p
) == INDIRECT_REF
)
807 tree ptr
= TREE_OPERAND (*p
, 0);
808 temp
= create_tmp_var (TREE_TYPE (ptr
), "retval");
809 *p
= build (MODIFY_EXPR
, TREE_TYPE (ptr
), temp
, ptr
);
810 temp
= build1 (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (temp
)), temp
);
811 /* If this is a BIND_EXPR for a const inline function, it might not
812 have TREE_SIDE_EFFECTS set. That is no longer accurate. */
813 TREE_SIDE_EFFECTS (wrapper
) = 1;
818 temp
= create_tmp_var (TREE_TYPE (wrapper
), "retval");
819 *p
= build (MODIFY_EXPR
, TREE_TYPE (temp
), temp
, *p
);
820 TREE_SIDE_EFFECTS (wrapper
) = 1;
823 TREE_TYPE (wrapper
) = void_type_node
;
830 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
831 a temporary through which they communicate. */
834 build_stack_save_restore (tree
*save
, tree
*restore
)
836 tree save_call
, tmp_var
;
839 build_function_call_expr (implicit_built_in_decls
[BUILT_IN_STACK_SAVE
],
841 tmp_var
= create_tmp_var (ptr_type_node
, "saved_stack");
843 *save
= build (MODIFY_EXPR
, ptr_type_node
, tmp_var
, save_call
);
845 build_function_call_expr (implicit_built_in_decls
[BUILT_IN_STACK_RESTORE
],
846 tree_cons (NULL_TREE
, tmp_var
, NULL_TREE
));
849 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
851 static enum gimplify_status
852 gimplify_bind_expr (tree
*expr_p
, tree temp
, tree
*pre_p
)
854 tree bind_expr
= *expr_p
;
855 bool old_save_stack
= gimplify_ctxp
->save_stack
;
858 temp
= voidify_wrapper_expr (bind_expr
, temp
);
860 /* Mark variables seen in this bind expr. */
861 for (t
= BIND_EXPR_VARS (bind_expr
); t
; t
= TREE_CHAIN (t
))
863 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
865 /* Preliminarily mark non-addressed complex variables as eligible
866 for promotion to gimple registers. We'll transform their uses
868 if (TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
869 && !TREE_THIS_VOLATILE (t
)
870 && (TREE_CODE (t
) == VAR_DECL
&& !DECL_HARD_REGISTER (t
))
871 && !needs_to_live_in_memory (t
))
872 DECL_COMPLEX_GIMPLE_REG_P (t
) = 1;
875 gimple_push_bind_expr (bind_expr
);
876 gimplify_ctxp
->save_stack
= false;
878 gimplify_to_stmt_list (&BIND_EXPR_BODY (bind_expr
));
880 if (gimplify_ctxp
->save_stack
)
882 tree stack_save
, stack_restore
;
884 /* Save stack on entry and restore it on exit. Add a try_finally
885 block to achieve this. Note that mudflap depends on the
886 format of the emitted code: see mx_register_decls(). */
887 build_stack_save_restore (&stack_save
, &stack_restore
);
889 t
= build (TRY_FINALLY_EXPR
, void_type_node
,
890 BIND_EXPR_BODY (bind_expr
), NULL_TREE
);
891 append_to_statement_list (stack_restore
, &TREE_OPERAND (t
, 1));
893 BIND_EXPR_BODY (bind_expr
) = NULL_TREE
;
894 append_to_statement_list (stack_save
, &BIND_EXPR_BODY (bind_expr
));
895 append_to_statement_list (t
, &BIND_EXPR_BODY (bind_expr
));
898 gimplify_ctxp
->save_stack
= old_save_stack
;
899 gimple_pop_bind_expr ();
904 append_to_statement_list (bind_expr
, pre_p
);
911 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
912 GIMPLE value, it is assigned to a new temporary and the statement is
913 re-written to return the temporary.
915 PRE_P points to the list where side effects that must happen before
916 STMT should be stored. */
918 static enum gimplify_status
919 gimplify_return_expr (tree stmt
, tree
*pre_p
)
921 tree ret_expr
= TREE_OPERAND (stmt
, 0);
922 tree result_decl
, result
;
924 if (!ret_expr
|| TREE_CODE (ret_expr
) == RESULT_DECL
925 || ret_expr
== error_mark_node
)
928 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
929 result_decl
= NULL_TREE
;
932 result_decl
= TREE_OPERAND (ret_expr
, 0);
933 if (TREE_CODE (result_decl
) == INDIRECT_REF
)
934 /* See through a return by reference. */
935 result_decl
= TREE_OPERAND (result_decl
, 0);
937 gcc_assert ((TREE_CODE (ret_expr
) == MODIFY_EXPR
938 || TREE_CODE (ret_expr
) == INIT_EXPR
)
939 && TREE_CODE (result_decl
) == RESULT_DECL
);
942 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
943 Recall that aggregate_value_p is FALSE for any aggregate type that is
944 returned in registers. If we're returning values in registers, then
945 we don't want to extend the lifetime of the RESULT_DECL, particularly
946 across another call. In addition, for those aggregates for which
947 hard_function_value generates a PARALLEL, we'll die during normal
948 expansion of structure assignments; there's special code in expand_return
949 to handle this case that does not exist in expand_expr. */
951 || aggregate_value_p (result_decl
, TREE_TYPE (current_function_decl
)))
952 result
= result_decl
;
953 else if (gimplify_ctxp
->return_temp
)
954 result
= gimplify_ctxp
->return_temp
;
957 result
= create_tmp_var (TREE_TYPE (result_decl
), NULL
);
959 /* ??? With complex control flow (usually involving abnormal edges),
960 we can wind up warning about an uninitialized value for this. Due
961 to how this variable is constructed and initialized, this is never
962 true. Give up and never warn. */
963 TREE_NO_WARNING (result
) = 1;
965 gimplify_ctxp
->return_temp
= result
;
968 /* Smash the lhs of the MODIFY_EXPR to the temporary we plan to use.
969 Then gimplify the whole thing. */
970 if (result
!= result_decl
)
971 TREE_OPERAND (ret_expr
, 0) = result
;
973 gimplify_and_add (TREE_OPERAND (stmt
, 0), pre_p
);
975 /* If we didn't use a temporary, then the result is just the result_decl.
976 Otherwise we need a simple copy. This should already be gimple. */
977 if (result
== result_decl
)
980 ret_expr
= build (MODIFY_EXPR
, TREE_TYPE (result
), result_decl
, result
);
981 TREE_OPERAND (stmt
, 0) = ret_expr
;
986 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
987 and initialization explicit. */
989 static enum gimplify_status
990 gimplify_decl_expr (tree
*stmt_p
)
993 tree decl
= DECL_EXPR_DECL (stmt
);
997 if (TREE_TYPE (decl
) == error_mark_node
)
1000 if ((TREE_CODE (decl
) == TYPE_DECL
1001 || TREE_CODE (decl
) == VAR_DECL
)
1002 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl
)))
1003 gimplify_type_sizes (TREE_TYPE (decl
), stmt_p
);
1005 if (TREE_CODE (decl
) == VAR_DECL
&& !DECL_EXTERNAL (decl
))
1007 tree init
= DECL_INITIAL (decl
);
1009 if (!TREE_CONSTANT (DECL_SIZE (decl
)))
1011 /* This is a variable-sized decl. Simplify its size and mark it
1012 for deferred expansion. Note that mudflap depends on the format
1013 of the emitted code: see mx_register_decls(). */
1014 tree t
, args
, addr
, ptr_type
;
1016 gimplify_one_sizepos (&DECL_SIZE (decl
), stmt_p
);
1017 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl
), stmt_p
);
1019 /* All occurrences of this decl in final gimplified code will be
1020 replaced by indirection. Setting DECL_VALUE_EXPR does two
1021 things: First, it lets the rest of the gimplifier know what
1022 replacement to use. Second, it lets the debug info know
1023 where to find the value. */
1024 ptr_type
= build_pointer_type (TREE_TYPE (decl
));
1025 addr
= create_tmp_var (ptr_type
, get_name (decl
));
1026 DECL_IGNORED_P (addr
) = 0;
1027 t
= build_fold_indirect_ref (addr
);
1028 SET_DECL_VALUE_EXPR (decl
, t
);
1029 DECL_HAS_VALUE_EXPR_P (decl
) = 1;
1031 args
= tree_cons (NULL
, DECL_SIZE_UNIT (decl
), NULL
);
1032 t
= built_in_decls
[BUILT_IN_ALLOCA
];
1033 t
= build_function_call_expr (t
, args
);
1034 t
= fold_convert (ptr_type
, t
);
1035 t
= build2 (MODIFY_EXPR
, void_type_node
, addr
, t
);
1037 gimplify_and_add (t
, stmt_p
);
1039 /* Indicate that we need to restore the stack level when the
1040 enclosing BIND_EXPR is exited. */
1041 gimplify_ctxp
->save_stack
= true;
1044 if (init
&& init
!= error_mark_node
)
1046 if (!TREE_STATIC (decl
))
1048 DECL_INITIAL (decl
) = NULL_TREE
;
1049 init
= build (MODIFY_EXPR
, void_type_node
, decl
, init
);
1050 gimplify_and_add (init
, stmt_p
);
1053 /* We must still examine initializers for static variables
1054 as they may contain a label address. */
1055 walk_tree (&init
, force_labels_r
, NULL
, NULL
);
1058 /* This decl isn't mentioned in the enclosing block, so add it to the
1059 list of temps. FIXME it seems a bit of a kludge to say that
1060 anonymous artificial vars aren't pushed, but everything else is. */
1061 if (DECL_ARTIFICIAL (decl
) && DECL_NAME (decl
) == NULL_TREE
)
1062 gimple_add_tmp_var (decl
);
1068 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1069 and replacing the LOOP_EXPR with goto, but if the loop contains an
1070 EXIT_EXPR, we need to append a label for it to jump to. */
1072 static enum gimplify_status
1073 gimplify_loop_expr (tree
*expr_p
, tree
*pre_p
)
1075 tree saved_label
= gimplify_ctxp
->exit_label
;
1076 tree start_label
= build1 (LABEL_EXPR
, void_type_node
, NULL_TREE
);
1077 tree jump_stmt
= build_and_jump (&LABEL_EXPR_LABEL (start_label
));
1079 append_to_statement_list (start_label
, pre_p
);
1081 gimplify_ctxp
->exit_label
= NULL_TREE
;
1083 gimplify_and_add (LOOP_EXPR_BODY (*expr_p
), pre_p
);
1085 if (gimplify_ctxp
->exit_label
)
1087 append_to_statement_list (jump_stmt
, pre_p
);
1088 *expr_p
= build1 (LABEL_EXPR
, void_type_node
, gimplify_ctxp
->exit_label
);
1091 *expr_p
= jump_stmt
;
1093 gimplify_ctxp
->exit_label
= saved_label
;
1098 /* Compare two case labels. Because the front end should already have
1099 made sure that case ranges do not overlap, it is enough to only compare
1100 the CASE_LOW values of each case label. */
1103 compare_case_labels (const void *p1
, const void *p2
)
1105 tree case1
= *(tree
*)p1
;
1106 tree case2
= *(tree
*)p2
;
1108 return tree_int_cst_compare (CASE_LOW (case1
), CASE_LOW (case2
));
1111 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1114 sort_case_labels (tree label_vec
)
1116 size_t len
= TREE_VEC_LENGTH (label_vec
);
1117 tree default_case
= TREE_VEC_ELT (label_vec
, len
- 1);
1119 if (CASE_LOW (default_case
))
1123 /* The last label in the vector should be the default case
1125 for (i
= 0; i
< len
; ++i
)
1127 tree t
= TREE_VEC_ELT (label_vec
, i
);
1131 TREE_VEC_ELT (label_vec
, i
) = TREE_VEC_ELT (label_vec
, len
- 1);
1132 TREE_VEC_ELT (label_vec
, len
- 1) = default_case
;
1138 qsort (&TREE_VEC_ELT (label_vec
, 0), len
- 1, sizeof (tree
),
1139 compare_case_labels
);
1142 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1145 static enum gimplify_status
1146 gimplify_switch_expr (tree
*expr_p
, tree
*pre_p
)
1148 tree switch_expr
= *expr_p
;
1149 enum gimplify_status ret
;
1151 ret
= gimplify_expr (&SWITCH_COND (switch_expr
), pre_p
, NULL
,
1152 is_gimple_val
, fb_rvalue
);
1154 if (SWITCH_BODY (switch_expr
))
1156 VEC(tree
,heap
) *labels
, *saved_labels
;
1157 tree label_vec
, default_case
= NULL_TREE
;
1160 /* If someone can be bothered to fill in the labels, they can
1161 be bothered to null out the body too. */
1162 gcc_assert (!SWITCH_LABELS (switch_expr
));
1164 saved_labels
= gimplify_ctxp
->case_labels
;
1165 gimplify_ctxp
->case_labels
= VEC_alloc (tree
, heap
, 8);
1167 gimplify_to_stmt_list (&SWITCH_BODY (switch_expr
));
1169 labels
= gimplify_ctxp
->case_labels
;
1170 gimplify_ctxp
->case_labels
= saved_labels
;
1172 len
= VEC_length (tree
, labels
);
1174 for (i
= 0; i
< len
; ++i
)
1176 tree t
= VEC_index (tree
, labels
, i
);
1179 /* The default case must be the last label in the list. */
1181 VEC_replace (tree
, labels
, i
, VEC_index (tree
, labels
, len
- 1));
1187 label_vec
= make_tree_vec (len
+ 1);
1188 SWITCH_LABELS (*expr_p
) = label_vec
;
1189 append_to_statement_list (switch_expr
, pre_p
);
1193 /* If the switch has no default label, add one, so that we jump
1194 around the switch body. */
1195 default_case
= build (CASE_LABEL_EXPR
, void_type_node
, NULL_TREE
,
1196 NULL_TREE
, create_artificial_label ());
1197 append_to_statement_list (SWITCH_BODY (switch_expr
), pre_p
);
1198 *expr_p
= build (LABEL_EXPR
, void_type_node
,
1199 CASE_LABEL (default_case
));
1202 *expr_p
= SWITCH_BODY (switch_expr
);
1204 for (i
= 0; i
< len
; ++i
)
1205 TREE_VEC_ELT (label_vec
, i
) = VEC_index (tree
, labels
, i
);
1206 TREE_VEC_ELT (label_vec
, len
) = default_case
;
1208 VEC_free (tree
, heap
, labels
);
1210 sort_case_labels (label_vec
);
1212 SWITCH_BODY (switch_expr
) = NULL
;
1215 gcc_assert (SWITCH_LABELS (switch_expr
));
1220 static enum gimplify_status
1221 gimplify_case_label_expr (tree
*expr_p
)
1223 tree expr
= *expr_p
;
1225 gcc_assert (gimplify_ctxp
->case_labels
);
1226 VEC_safe_push (tree
, heap
, gimplify_ctxp
->case_labels
, expr
);
1227 *expr_p
= build (LABEL_EXPR
, void_type_node
, CASE_LABEL (expr
));
1231 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1235 build_and_jump (tree
*label_p
)
1237 if (label_p
== NULL
)
1238 /* If there's nowhere to jump, just fall through. */
1241 if (*label_p
== NULL_TREE
)
1243 tree label
= create_artificial_label ();
1247 return build1 (GOTO_EXPR
, void_type_node
, *label_p
);
1250 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1251 This also involves building a label to jump to and communicating it to
1252 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1254 static enum gimplify_status
1255 gimplify_exit_expr (tree
*expr_p
)
1257 tree cond
= TREE_OPERAND (*expr_p
, 0);
1260 expr
= build_and_jump (&gimplify_ctxp
->exit_label
);
1261 expr
= build (COND_EXPR
, void_type_node
, cond
, expr
, NULL_TREE
);
1267 /* A helper function to be called via walk_tree. Mark all labels under *TP
1268 as being forced. To be called for DECL_INITIAL of static variables. */
1271 force_labels_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
1275 if (TREE_CODE (*tp
) == LABEL_DECL
)
1276 FORCED_LABEL (*tp
) = 1;
1281 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1282 different from its canonical type, wrap the whole thing inside a
1283 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1286 The canonical type of a COMPONENT_REF is the type of the field being
1287 referenced--unless the field is a bit-field which can be read directly
1288 in a smaller mode, in which case the canonical type is the
1289 sign-appropriate type corresponding to that mode. */
1292 canonicalize_component_ref (tree
*expr_p
)
1294 tree expr
= *expr_p
;
1297 gcc_assert (TREE_CODE (expr
) == COMPONENT_REF
);
1299 if (INTEGRAL_TYPE_P (TREE_TYPE (expr
)))
1300 type
= TREE_TYPE (get_unwidened (expr
, NULL_TREE
));
1302 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
1304 if (TREE_TYPE (expr
) != type
)
1306 tree old_type
= TREE_TYPE (expr
);
1308 /* Set the type of the COMPONENT_REF to the underlying type. */
1309 TREE_TYPE (expr
) = type
;
1311 /* And wrap the whole thing inside a NOP_EXPR. */
1312 expr
= build1 (NOP_EXPR
, old_type
, expr
);
1318 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1319 to foo, embed that change in the ADDR_EXPR by converting
1324 where L is the lower bound. For simplicity, only do this for constant
1328 canonicalize_addr_expr (tree
*expr_p
)
1330 tree expr
= *expr_p
;
1331 tree ctype
= TREE_TYPE (expr
);
1332 tree addr_expr
= TREE_OPERAND (expr
, 0);
1333 tree atype
= TREE_TYPE (addr_expr
);
1334 tree dctype
, datype
, ddatype
, otype
, obj_expr
;
1336 /* Both cast and addr_expr types should be pointers. */
1337 if (!POINTER_TYPE_P (ctype
) || !POINTER_TYPE_P (atype
))
1340 /* The addr_expr type should be a pointer to an array. */
1341 datype
= TREE_TYPE (atype
);
1342 if (TREE_CODE (datype
) != ARRAY_TYPE
)
1345 /* Both cast and addr_expr types should address the same object type. */
1346 dctype
= TREE_TYPE (ctype
);
1347 ddatype
= TREE_TYPE (datype
);
1348 if (!lang_hooks
.types_compatible_p (ddatype
, dctype
))
1351 /* The addr_expr and the object type should match. */
1352 obj_expr
= TREE_OPERAND (addr_expr
, 0);
1353 otype
= TREE_TYPE (obj_expr
);
1354 if (!lang_hooks
.types_compatible_p (otype
, datype
))
1357 /* The lower bound and element sizes must be constant. */
1358 if (!TYPE_SIZE_UNIT (dctype
)
1359 || TREE_CODE (TYPE_SIZE_UNIT (dctype
)) != INTEGER_CST
1360 || !TYPE_DOMAIN (datype
) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))
1361 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))) != INTEGER_CST
)
1364 /* All checks succeeded. Build a new node to merge the cast. */
1365 *expr_p
= build4 (ARRAY_REF
, dctype
, obj_expr
,
1366 TYPE_MIN_VALUE (TYPE_DOMAIN (datype
)),
1367 TYPE_MIN_VALUE (TYPE_DOMAIN (datype
)),
1368 size_binop (EXACT_DIV_EXPR
, TYPE_SIZE_UNIT (dctype
),
1369 size_int (TYPE_ALIGN_UNIT (dctype
))));
1370 *expr_p
= build1 (ADDR_EXPR
, ctype
, *expr_p
);
1373 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1374 underneath as appropriate. */
1376 static enum gimplify_status
1377 gimplify_conversion (tree
*expr_p
)
1379 gcc_assert (TREE_CODE (*expr_p
) == NOP_EXPR
1380 || TREE_CODE (*expr_p
) == CONVERT_EXPR
);
1382 /* Then strip away all but the outermost conversion. */
1383 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p
, 0));
1385 /* And remove the outermost conversion if it's useless. */
1386 if (tree_ssa_useless_type_conversion (*expr_p
))
1387 *expr_p
= TREE_OPERAND (*expr_p
, 0);
1389 /* If we still have a conversion at the toplevel,
1390 then canonicalize some constructs. */
1391 if (TREE_CODE (*expr_p
) == NOP_EXPR
|| TREE_CODE (*expr_p
) == CONVERT_EXPR
)
1393 tree sub
= TREE_OPERAND (*expr_p
, 0);
1395 /* If a NOP conversion is changing the type of a COMPONENT_REF
1396 expression, then canonicalize its type now in order to expose more
1397 redundant conversions. */
1398 if (TREE_CODE (sub
) == COMPONENT_REF
)
1399 canonicalize_component_ref (&TREE_OPERAND (*expr_p
, 0));
1401 /* If a NOP conversion is changing a pointer to array of foo
1402 to a pointer to foo, embed that change in the ADDR_EXPR. */
1403 else if (TREE_CODE (sub
) == ADDR_EXPR
)
1404 canonicalize_addr_expr (expr_p
);
1410 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1411 node pointed by EXPR_P.
1414 : min_lval '[' val ']'
1416 | compound_lval '[' val ']'
1417 | compound_lval '.' ID
1419 This is not part of the original SIMPLE definition, which separates
1420 array and member references, but it seems reasonable to handle them
1421 together. Also, this way we don't run into problems with union
1422 aliasing; gcc requires that for accesses through a union to alias, the
1423 union reference must be explicit, which was not always the case when we
1424 were splitting up array and member refs.
1426 PRE_P points to the list where side effects that must happen before
1427 *EXPR_P should be stored.
1429 POST_P points to the list where side effects that must happen after
1430 *EXPR_P should be stored. */
1432 static enum gimplify_status
1433 gimplify_compound_lval (tree
*expr_p
, tree
*pre_p
,
1434 tree
*post_p
, fallback_t fallback
)
1437 VEC(tree
,heap
) *stack
;
1438 enum gimplify_status ret
= GS_OK
, tret
;
1441 /* Create a stack of the subexpressions so later we can walk them in
1442 order from inner to outer. */
1443 stack
= VEC_alloc (tree
, heap
, 10);
1445 /* We can handle anything that get_inner_reference can deal with. */
1446 for (p
= expr_p
; ; p
= &TREE_OPERAND (*p
, 0))
1448 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1449 if (TREE_CODE (*p
) == INDIRECT_REF
)
1450 *p
= fold_indirect_ref (*p
);
1451 if (!handled_component_p (*p
))
1453 VEC_safe_push (tree
, heap
, stack
, *p
);
1456 gcc_assert (VEC_length (tree
, stack
));
1458 /* Now STACK is a stack of pointers to all the refs we've walked through
1459 and P points to the innermost expression.
1461 Java requires that we elaborated nodes in source order. That
1462 means we must gimplify the inner expression followed by each of
1463 the indices, in order. But we can't gimplify the inner
1464 expression until we deal with any variable bounds, sizes, or
1465 positions in order to deal with PLACEHOLDER_EXPRs.
1467 So we do this in three steps. First we deal with the annotations
1468 for any variables in the components, then we gimplify the base,
1469 then we gimplify any indices, from left to right. */
1470 for (i
= VEC_length (tree
, stack
) - 1; i
>= 0; i
--)
1472 tree t
= VEC_index (tree
, stack
, i
);
1474 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
1476 /* Gimplify the low bound and element type size and put them into
1477 the ARRAY_REF. If these values are set, they have already been
1479 if (!TREE_OPERAND (t
, 2))
1481 tree low
= unshare_expr (array_ref_low_bound (t
));
1482 if (!is_gimple_min_invariant (low
))
1484 TREE_OPERAND (t
, 2) = low
;
1485 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
1486 is_gimple_formal_tmp_reg
, fb_rvalue
);
1487 ret
= MIN (ret
, tret
);
1491 if (!TREE_OPERAND (t
, 3))
1493 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (t
, 0)));
1494 tree elmt_size
= unshare_expr (array_ref_element_size (t
));
1495 tree factor
= size_int (TYPE_ALIGN_UNIT (elmt_type
));
1497 /* Divide the element size by the alignment of the element
1499 elmt_size
= size_binop (EXACT_DIV_EXPR
, elmt_size
, factor
);
1501 if (!is_gimple_min_invariant (elmt_size
))
1503 TREE_OPERAND (t
, 3) = elmt_size
;
1504 tret
= gimplify_expr (&TREE_OPERAND (t
, 3), pre_p
, post_p
,
1505 is_gimple_formal_tmp_reg
, fb_rvalue
);
1506 ret
= MIN (ret
, tret
);
1510 else if (TREE_CODE (t
) == COMPONENT_REF
)
1512 /* Set the field offset into T and gimplify it. */
1513 if (!TREE_OPERAND (t
, 2))
1515 tree offset
= unshare_expr (component_ref_field_offset (t
));
1516 tree field
= TREE_OPERAND (t
, 1);
1518 = size_int (DECL_OFFSET_ALIGN (field
) / BITS_PER_UNIT
);
1520 /* Divide the offset by its alignment. */
1521 offset
= size_binop (EXACT_DIV_EXPR
, offset
, factor
);
1523 if (!is_gimple_min_invariant (offset
))
1525 TREE_OPERAND (t
, 2) = offset
;
1526 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
1527 is_gimple_formal_tmp_reg
, fb_rvalue
);
1528 ret
= MIN (ret
, tret
);
1534 /* Step 2 is to gimplify the base expression. */
1535 tret
= gimplify_expr (p
, pre_p
, post_p
, is_gimple_min_lval
, fallback
);
1536 ret
= MIN (ret
, tret
);
1538 /* And finally, the indices and operands to BIT_FIELD_REF. During this
1539 loop we also remove any useless conversions. */
1540 for (; VEC_length (tree
, stack
) > 0; )
1542 tree t
= VEC_pop (tree
, stack
);
1544 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
1546 /* Gimplify the dimension.
1547 Temporary fix for gcc.c-torture/execute/20040313-1.c.
1548 Gimplify non-constant array indices into a temporary
1550 FIXME - The real fix is to gimplify post-modify
1551 expressions into a minimal gimple lvalue. However, that
1552 exposes bugs in alias analysis. The alias analyzer does
1553 not handle &PTR->FIELD very well. Will fix after the
1554 branch is merged into mainline (dnovillo 2004-05-03). */
1555 if (!is_gimple_min_invariant (TREE_OPERAND (t
, 1)))
1557 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), pre_p
, post_p
,
1558 is_gimple_formal_tmp_reg
, fb_rvalue
);
1559 ret
= MIN (ret
, tret
);
1562 else if (TREE_CODE (t
) == BIT_FIELD_REF
)
1564 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), pre_p
, post_p
,
1565 is_gimple_val
, fb_rvalue
);
1566 ret
= MIN (ret
, tret
);
1567 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
1568 is_gimple_val
, fb_rvalue
);
1569 ret
= MIN (ret
, tret
);
1572 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t
, 0));
1574 /* The innermost expression P may have originally had TREE_SIDE_EFFECTS
1575 set which would have caused all the outer expressions in EXPR_P
1576 leading to P to also have had TREE_SIDE_EFFECTS set. */
1577 recalculate_side_effects (t
);
1580 tret
= gimplify_expr (p
, pre_p
, post_p
, is_gimple_min_lval
, fallback
);
1581 ret
= MIN (ret
, tret
);
1583 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
1584 if ((fallback
& fb_rvalue
) && TREE_CODE (*expr_p
) == COMPONENT_REF
)
1586 canonicalize_component_ref (expr_p
);
1587 ret
= MIN (ret
, GS_OK
);
1590 VEC_free (tree
, heap
, stack
);
1595 /* Gimplify the self modifying expression pointed by EXPR_P (++, --, +=, -=).
1597 PRE_P points to the list where side effects that must happen before
1598 *EXPR_P should be stored.
1600 POST_P points to the list where side effects that must happen after
1601 *EXPR_P should be stored.
1603 WANT_VALUE is nonzero iff we want to use the value of this expression
1604 in another expression. */
1606 static enum gimplify_status
1607 gimplify_self_mod_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
,
1610 enum tree_code code
;
1611 tree lhs
, lvalue
, rhs
, t1
;
1613 enum tree_code arith_code
;
1614 enum gimplify_status ret
;
1616 code
= TREE_CODE (*expr_p
);
1618 gcc_assert (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
1619 || code
== PREINCREMENT_EXPR
|| code
== PREDECREMENT_EXPR
);
1621 /* Prefix or postfix? */
1622 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
1623 /* Faster to treat as prefix if result is not used. */
1624 postfix
= want_value
;
1628 /* Add or subtract? */
1629 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
1630 arith_code
= PLUS_EXPR
;
1632 arith_code
= MINUS_EXPR
;
1634 /* Gimplify the LHS into a GIMPLE lvalue. */
1635 lvalue
= TREE_OPERAND (*expr_p
, 0);
1636 ret
= gimplify_expr (&lvalue
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
1637 if (ret
== GS_ERROR
)
1640 /* Extract the operands to the arithmetic operation. */
1642 rhs
= TREE_OPERAND (*expr_p
, 1);
1644 /* For postfix operator, we evaluate the LHS to an rvalue and then use
1645 that as the result value and in the postqueue operation. */
1648 ret
= gimplify_expr (&lhs
, pre_p
, post_p
, is_gimple_val
, fb_rvalue
);
1649 if (ret
== GS_ERROR
)
1653 t1
= build (arith_code
, TREE_TYPE (*expr_p
), lhs
, rhs
);
1654 t1
= build (MODIFY_EXPR
, TREE_TYPE (lvalue
), lvalue
, t1
);
1658 gimplify_and_add (t1
, post_p
);
1669 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
1672 maybe_with_size_expr (tree
*expr_p
)
1674 tree expr
= *expr_p
;
1675 tree type
= TREE_TYPE (expr
);
1678 /* If we've already wrapped this or the type is error_mark_node, we can't do
1680 if (TREE_CODE (expr
) == WITH_SIZE_EXPR
1681 || type
== error_mark_node
)
1684 /* If the size isn't known or is a constant, we have nothing to do. */
1685 size
= TYPE_SIZE_UNIT (type
);
1686 if (!size
|| TREE_CODE (size
) == INTEGER_CST
)
1689 /* Otherwise, make a WITH_SIZE_EXPR. */
1690 size
= unshare_expr (size
);
1691 size
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (size
, expr
);
1692 *expr_p
= build2 (WITH_SIZE_EXPR
, type
, expr
, size
);
1695 /* Subroutine of gimplify_call_expr: Gimplify a single argument. */
1697 static enum gimplify_status
1698 gimplify_arg (tree
*expr_p
, tree
*pre_p
)
1700 bool (*test
) (tree
);
1703 /* In general, we allow lvalues for function arguments to avoid
1704 extra overhead of copying large aggregates out of even larger
1705 aggregates into temporaries only to copy the temporaries to
1706 the argument list. Make optimizers happy by pulling out to
1707 temporaries those types that fit in registers. */
1708 if (is_gimple_reg_type (TREE_TYPE (*expr_p
)))
1709 test
= is_gimple_val
, fb
= fb_rvalue
;
1711 test
= is_gimple_lvalue
, fb
= fb_either
;
1713 /* If this is a variable sized type, we must remember the size. */
1714 maybe_with_size_expr (expr_p
);
1716 /* There is a sequence point before a function call. Side effects in
1717 the argument list must occur before the actual call. So, when
1718 gimplifying arguments, force gimplify_expr to use an internal
1719 post queue which is then appended to the end of PRE_P. */
1720 return gimplify_expr (expr_p
, pre_p
, NULL
, test
, fb
);
1723 /* Gimplify the CALL_EXPR node pointed by EXPR_P. PRE_P points to the
1724 list where side effects that must happen before *EXPR_P should be stored.
1725 WANT_VALUE is true if the result of the call is desired. */
1727 static enum gimplify_status
1728 gimplify_call_expr (tree
*expr_p
, tree
*pre_p
, bool want_value
)
1732 enum gimplify_status ret
;
1734 gcc_assert (TREE_CODE (*expr_p
) == CALL_EXPR
);
1736 /* For reliable diagnostics during inlining, it is necessary that
1737 every call_expr be annotated with file and line. */
1738 if (! EXPR_HAS_LOCATION (*expr_p
))
1739 SET_EXPR_LOCATION (*expr_p
, input_location
);
1741 /* This may be a call to a builtin function.
1743 Builtin function calls may be transformed into different
1744 (and more efficient) builtin function calls under certain
1745 circumstances. Unfortunately, gimplification can muck things
1746 up enough that the builtin expanders are not aware that certain
1747 transformations are still valid.
1749 So we attempt transformation/gimplification of the call before
1750 we gimplify the CALL_EXPR. At this time we do not manage to
1751 transform all calls in the same manner as the expanders do, but
1752 we do transform most of them. */
1753 decl
= get_callee_fndecl (*expr_p
);
1754 if (decl
&& DECL_BUILT_IN (decl
))
1756 tree fndecl
= get_callee_fndecl (*expr_p
);
1757 tree arglist
= TREE_OPERAND (*expr_p
, 1);
1758 tree
new = fold_builtin (fndecl
, arglist
, !want_value
);
1760 if (new && new != *expr_p
)
1762 /* There was a transformation of this call which computes the
1763 same value, but in a more efficient way. Return and try
1769 if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1770 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_START
)
1772 if (!arglist
|| !TREE_CHAIN (arglist
))
1774 error ("too few arguments to function %<va_start%>");
1775 *expr_p
= build_empty_stmt ();
1779 if (fold_builtin_next_arg (TREE_CHAIN (arglist
)))
1781 *expr_p
= build_empty_stmt ();
1784 /* Avoid gimplifying the second argument to va_start, which needs
1785 to be the plain PARM_DECL. */
1786 return gimplify_arg (&TREE_VALUE (TREE_OPERAND (*expr_p
, 1)), pre_p
);
1790 /* There is a sequence point before the call, so any side effects in
1791 the calling expression must occur before the actual call. Force
1792 gimplify_expr to use an internal post queue. */
1793 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, NULL
,
1794 is_gimple_call_addr
, fb_rvalue
);
1796 if (PUSH_ARGS_REVERSED
)
1797 TREE_OPERAND (*expr_p
, 1) = nreverse (TREE_OPERAND (*expr_p
, 1));
1798 for (arglist
= TREE_OPERAND (*expr_p
, 1); arglist
;
1799 arglist
= TREE_CHAIN (arglist
))
1801 enum gimplify_status t
;
1803 t
= gimplify_arg (&TREE_VALUE (arglist
), pre_p
);
1808 if (PUSH_ARGS_REVERSED
)
1809 TREE_OPERAND (*expr_p
, 1) = nreverse (TREE_OPERAND (*expr_p
, 1));
1811 /* Try this again in case gimplification exposed something. */
1812 if (ret
!= GS_ERROR
&& decl
&& DECL_BUILT_IN (decl
))
1814 tree fndecl
= get_callee_fndecl (*expr_p
);
1815 tree arglist
= TREE_OPERAND (*expr_p
, 1);
1816 tree
new = fold_builtin (fndecl
, arglist
, !want_value
);
1818 if (new && new != *expr_p
)
1820 /* There was a transformation of this call which computes the
1821 same value, but in a more efficient way. Return and try
1828 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
1829 decl. This allows us to eliminate redundant or useless
1830 calls to "const" functions. */
1831 if (TREE_CODE (*expr_p
) == CALL_EXPR
1832 && (call_expr_flags (*expr_p
) & (ECF_CONST
| ECF_PURE
)))
1833 TREE_SIDE_EFFECTS (*expr_p
) = 0;
1838 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
1839 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
1841 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
1842 condition is true or false, respectively. If null, we should generate
1843 our own to skip over the evaluation of this specific expression.
1845 This function is the tree equivalent of do_jump.
1847 shortcut_cond_r should only be called by shortcut_cond_expr. */
1850 shortcut_cond_r (tree pred
, tree
*true_label_p
, tree
*false_label_p
)
1852 tree local_label
= NULL_TREE
;
1853 tree t
, expr
= NULL
;
1855 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
1856 retain the shortcut semantics. Just insert the gotos here;
1857 shortcut_cond_expr will append the real blocks later. */
1858 if (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
1860 /* Turn if (a && b) into
1862 if (a); else goto no;
1863 if (b) goto yes; else goto no;
1866 if (false_label_p
== NULL
)
1867 false_label_p
= &local_label
;
1869 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), NULL
, false_label_p
);
1870 append_to_statement_list (t
, &expr
);
1872 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
1874 append_to_statement_list (t
, &expr
);
1876 else if (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
1878 /* Turn if (a || b) into
1881 if (b) goto yes; else goto no;
1884 if (true_label_p
== NULL
)
1885 true_label_p
= &local_label
;
1887 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), true_label_p
, NULL
);
1888 append_to_statement_list (t
, &expr
);
1890 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
1892 append_to_statement_list (t
, &expr
);
1894 else if (TREE_CODE (pred
) == COND_EXPR
)
1896 /* As long as we're messing with gotos, turn if (a ? b : c) into
1898 if (b) goto yes; else goto no;
1900 if (c) goto yes; else goto no; */
1901 expr
= build (COND_EXPR
, void_type_node
, TREE_OPERAND (pred
, 0),
1902 shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
1904 shortcut_cond_r (TREE_OPERAND (pred
, 2), true_label_p
,
1909 expr
= build (COND_EXPR
, void_type_node
, pred
,
1910 build_and_jump (true_label_p
),
1911 build_and_jump (false_label_p
));
1916 t
= build1 (LABEL_EXPR
, void_type_node
, local_label
);
1917 append_to_statement_list (t
, &expr
);
1924 shortcut_cond_expr (tree expr
)
1926 tree pred
= TREE_OPERAND (expr
, 0);
1927 tree then_
= TREE_OPERAND (expr
, 1);
1928 tree else_
= TREE_OPERAND (expr
, 2);
1929 tree true_label
, false_label
, end_label
, t
;
1931 tree
*false_label_p
;
1932 bool emit_end
, emit_false
, jump_over_else
;
1933 bool then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
1934 bool else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
1936 /* First do simple transformations. */
1939 /* If there is no 'else', turn (a && b) into if (a) if (b). */
1940 while (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
1942 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
1943 then_
= shortcut_cond_expr (expr
);
1944 then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
1945 pred
= TREE_OPERAND (pred
, 0);
1946 expr
= build (COND_EXPR
, void_type_node
, pred
, then_
, NULL_TREE
);
1951 /* If there is no 'then', turn
1954 if (a); else if (b); else d. */
1955 while (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
1957 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
1958 else_
= shortcut_cond_expr (expr
);
1959 else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
1960 pred
= TREE_OPERAND (pred
, 0);
1961 expr
= build (COND_EXPR
, void_type_node
, pred
, NULL_TREE
, else_
);
1965 /* If we're done, great. */
1966 if (TREE_CODE (pred
) != TRUTH_ANDIF_EXPR
1967 && TREE_CODE (pred
) != TRUTH_ORIF_EXPR
)
1970 /* Otherwise we need to mess with gotos. Change
1973 if (a); else goto no;
1976 and recursively gimplify the condition. */
1978 true_label
= false_label
= end_label
= NULL_TREE
;
1980 /* If our arms just jump somewhere, hijack those labels so we don't
1981 generate jumps to jumps. */
1984 && TREE_CODE (then_
) == GOTO_EXPR
1985 && TREE_CODE (GOTO_DESTINATION (then_
)) == LABEL_DECL
)
1987 true_label
= GOTO_DESTINATION (then_
);
1993 && TREE_CODE (else_
) == GOTO_EXPR
1994 && TREE_CODE (GOTO_DESTINATION (else_
)) == LABEL_DECL
)
1996 false_label
= GOTO_DESTINATION (else_
);
2001 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2003 true_label_p
= &true_label
;
2005 true_label_p
= NULL
;
2007 /* The 'else' branch also needs a label if it contains interesting code. */
2008 if (false_label
|| else_se
)
2009 false_label_p
= &false_label
;
2011 false_label_p
= NULL
;
2013 /* If there was nothing else in our arms, just forward the label(s). */
2014 if (!then_se
&& !else_se
)
2015 return shortcut_cond_r (pred
, true_label_p
, false_label_p
);
2017 /* If our last subexpression already has a terminal label, reuse it. */
2019 expr
= expr_last (else_
);
2021 expr
= expr_last (then_
);
2024 if (expr
&& TREE_CODE (expr
) == LABEL_EXPR
)
2025 end_label
= LABEL_EXPR_LABEL (expr
);
2027 /* If we don't care about jumping to the 'else' branch, jump to the end
2028 if the condition is false. */
2030 false_label_p
= &end_label
;
2032 /* We only want to emit these labels if we aren't hijacking them. */
2033 emit_end
= (end_label
== NULL_TREE
);
2034 emit_false
= (false_label
== NULL_TREE
);
2036 /* We only emit the jump over the else clause if we have to--if the
2037 then clause may fall through. Otherwise we can wind up with a
2038 useless jump and a useless label at the end of gimplified code,
2039 which will cause us to think that this conditional as a whole
2040 falls through even if it doesn't. If we then inline a function
2041 which ends with such a condition, that can cause us to issue an
2042 inappropriate warning about control reaching the end of a
2043 non-void function. */
2044 jump_over_else
= block_may_fallthru (then_
);
2046 pred
= shortcut_cond_r (pred
, true_label_p
, false_label_p
);
2049 append_to_statement_list (pred
, &expr
);
2051 append_to_statement_list (then_
, &expr
);
2056 t
= build_and_jump (&end_label
);
2057 append_to_statement_list (t
, &expr
);
2061 t
= build1 (LABEL_EXPR
, void_type_node
, false_label
);
2062 append_to_statement_list (t
, &expr
);
2064 append_to_statement_list (else_
, &expr
);
2066 if (emit_end
&& end_label
)
2068 t
= build1 (LABEL_EXPR
, void_type_node
, end_label
);
2069 append_to_statement_list (t
, &expr
);
2075 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2078 gimple_boolify (tree expr
)
2080 tree type
= TREE_TYPE (expr
);
2082 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
2085 switch (TREE_CODE (expr
))
2087 case TRUTH_AND_EXPR
:
2089 case TRUTH_XOR_EXPR
:
2090 case TRUTH_ANDIF_EXPR
:
2091 case TRUTH_ORIF_EXPR
:
2092 /* Also boolify the arguments of truth exprs. */
2093 TREE_OPERAND (expr
, 1) = gimple_boolify (TREE_OPERAND (expr
, 1));
2096 case TRUTH_NOT_EXPR
:
2097 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
2100 case EQ_EXPR
: case NE_EXPR
:
2101 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
2102 /* These expressions always produce boolean results. */
2103 TREE_TYPE (expr
) = boolean_type_node
;
2107 /* Other expressions that get here must have boolean values, but
2108 might need to be converted to the appropriate mode. */
2109 return convert (boolean_type_node
, expr
);
2113 /* Convert the conditional expression pointed by EXPR_P '(p) ? a : b;'
2122 The second form is used when *EXPR_P is of type void.
2124 TARGET is the tree for T1 above.
2126 PRE_P points to the list where side effects that must happen before
2127 *EXPR_P should be stored.
2129 POST_P points to the list where side effects that must happen after
2130 *EXPR_P should be stored. */
2132 static enum gimplify_status
2133 gimplify_cond_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
, tree target
,
2134 fallback_t fallback
)
2136 tree expr
= *expr_p
;
2137 tree tmp
, tmp2
, type
;
2138 enum gimplify_status ret
;
2140 type
= TREE_TYPE (expr
);
2142 /* If this COND_EXPR has a value, copy the values into a temporary within
2144 if (! VOID_TYPE_P (type
))
2150 ret
= gimplify_expr (&target
, pre_p
, post_p
,
2151 is_gimple_min_lval
, fb_lvalue
);
2152 if (ret
!= GS_ERROR
)
2154 result
= tmp
= target
;
2155 tmp2
= unshare_expr (target
);
2157 else if ((fallback
& fb_lvalue
) == 0)
2159 result
= tmp2
= tmp
= create_tmp_var (TREE_TYPE (expr
), "iftmp");
2164 tree type
= build_pointer_type (TREE_TYPE (expr
));
2166 if (TREE_TYPE (TREE_OPERAND (expr
, 1)) != void_type_node
)
2167 TREE_OPERAND (expr
, 1) =
2168 build_fold_addr_expr (TREE_OPERAND (expr
, 1));
2170 if (TREE_TYPE (TREE_OPERAND (expr
, 2)) != void_type_node
)
2171 TREE_OPERAND (expr
, 2) =
2172 build_fold_addr_expr (TREE_OPERAND (expr
, 2));
2174 tmp2
= tmp
= create_tmp_var (type
, "iftmp");
2176 expr
= build (COND_EXPR
, void_type_node
, TREE_OPERAND (expr
, 0),
2177 TREE_OPERAND (expr
, 1), TREE_OPERAND (expr
, 2));
2179 result
= build_fold_indirect_ref (tmp
);
2183 /* Build the then clause, 't1 = a;'. But don't build an assignment
2184 if this branch is void; in C++ it can be, if it's a throw. */
2185 if (TREE_TYPE (TREE_OPERAND (expr
, 1)) != void_type_node
)
2186 TREE_OPERAND (expr
, 1)
2187 = build (MODIFY_EXPR
, void_type_node
, tmp
, TREE_OPERAND (expr
, 1));
2189 /* Build the else clause, 't1 = b;'. */
2190 if (TREE_TYPE (TREE_OPERAND (expr
, 2)) != void_type_node
)
2191 TREE_OPERAND (expr
, 2)
2192 = build (MODIFY_EXPR
, void_type_node
, tmp2
, TREE_OPERAND (expr
, 2));
2194 TREE_TYPE (expr
) = void_type_node
;
2195 recalculate_side_effects (expr
);
2197 /* Move the COND_EXPR to the prequeue. */
2198 gimplify_and_add (expr
, pre_p
);
2204 /* Make sure the condition has BOOLEAN_TYPE. */
2205 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
2207 /* Break apart && and || conditions. */
2208 if (TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ANDIF_EXPR
2209 || TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ORIF_EXPR
)
2211 expr
= shortcut_cond_expr (expr
);
2213 if (expr
!= *expr_p
)
2217 /* We can't rely on gimplify_expr to re-gimplify the expanded
2218 form properly, as cleanups might cause the target labels to be
2219 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2220 set up a conditional context. */
2221 gimple_push_condition ();
2222 gimplify_stmt (expr_p
);
2223 gimple_pop_condition (pre_p
);
2229 /* Now do the normal gimplification. */
2230 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, NULL
,
2231 is_gimple_condexpr
, fb_rvalue
);
2233 gimple_push_condition ();
2235 gimplify_to_stmt_list (&TREE_OPERAND (expr
, 1));
2236 gimplify_to_stmt_list (&TREE_OPERAND (expr
, 2));
2237 recalculate_side_effects (expr
);
2239 gimple_pop_condition (pre_p
);
2241 if (ret
== GS_ERROR
)
2243 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
2245 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 2)))
2246 /* Rewrite "if (a); else b" to "if (!a) b" */
2248 TREE_OPERAND (expr
, 0) = invert_truthvalue (TREE_OPERAND (expr
, 0));
2249 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, NULL
,
2250 is_gimple_condexpr
, fb_rvalue
);
2252 tmp
= TREE_OPERAND (expr
, 1);
2253 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 2);
2254 TREE_OPERAND (expr
, 2) = tmp
;
2257 /* Both arms are empty; replace the COND_EXPR with its predicate. */
2258 expr
= TREE_OPERAND (expr
, 0);
2264 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2265 a call to __builtin_memcpy. */
2267 static enum gimplify_status
2268 gimplify_modify_expr_to_memcpy (tree
*expr_p
, tree size
, bool want_value
)
2270 tree args
, t
, to
, to_ptr
, from
;
2272 to
= TREE_OPERAND (*expr_p
, 0);
2273 from
= TREE_OPERAND (*expr_p
, 1);
2275 args
= tree_cons (NULL
, size
, NULL
);
2277 t
= build_fold_addr_expr (from
);
2278 args
= tree_cons (NULL
, t
, args
);
2280 to_ptr
= build_fold_addr_expr (to
);
2281 args
= tree_cons (NULL
, to_ptr
, args
);
2282 t
= implicit_built_in_decls
[BUILT_IN_MEMCPY
];
2283 t
= build_function_call_expr (t
, args
);
2287 t
= build1 (NOP_EXPR
, TREE_TYPE (to_ptr
), t
);
2288 t
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
2295 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2296 a call to __builtin_memset. In this case we know that the RHS is
2297 a CONSTRUCTOR with an empty element list. */
2299 static enum gimplify_status
2300 gimplify_modify_expr_to_memset (tree
*expr_p
, tree size
, bool want_value
)
2302 tree args
, t
, to
, to_ptr
;
2304 to
= TREE_OPERAND (*expr_p
, 0);
2306 args
= tree_cons (NULL
, size
, NULL
);
2308 args
= tree_cons (NULL
, integer_zero_node
, args
);
2310 to_ptr
= build_fold_addr_expr (to
);
2311 args
= tree_cons (NULL
, to_ptr
, args
);
2312 t
= implicit_built_in_decls
[BUILT_IN_MEMSET
];
2313 t
= build_function_call_expr (t
, args
);
2317 t
= build1 (NOP_EXPR
, TREE_TYPE (to_ptr
), t
);
2318 t
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
2325 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
2326 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
2327 assignment. Returns non-null if we detect a potential overlap. */
2329 struct gimplify_init_ctor_preeval_data
2331 /* The base decl of the lhs object. May be NULL, in which case we
2332 have to assume the lhs is indirect. */
2335 /* The alias set of the lhs object. */
2340 gimplify_init_ctor_preeval_1 (tree
*tp
, int *walk_subtrees
, void *xdata
)
2342 struct gimplify_init_ctor_preeval_data
*data
2343 = (struct gimplify_init_ctor_preeval_data
*) xdata
;
2346 /* If we find the base object, obviously we have overlap. */
2347 if (data
->lhs_base_decl
== t
)
2350 /* If the constructor component is indirect, determine if we have a
2351 potential overlap with the lhs. The only bits of information we
2352 have to go on at this point are addressability and alias sets. */
2353 if (TREE_CODE (t
) == INDIRECT_REF
2354 && (!data
->lhs_base_decl
|| TREE_ADDRESSABLE (data
->lhs_base_decl
))
2355 && alias_sets_conflict_p (data
->lhs_alias_set
, get_alias_set (t
)))
2358 if (IS_TYPE_OR_DECL_P (t
))
2363 /* A subroutine of gimplify_init_constructor. Pre-evaluate *EXPR_P,
2364 force values that overlap with the lhs (as described by *DATA)
2365 into temporaries. */
2368 gimplify_init_ctor_preeval (tree
*expr_p
, tree
*pre_p
, tree
*post_p
,
2369 struct gimplify_init_ctor_preeval_data
*data
)
2371 enum gimplify_status one
;
2373 /* If the value is invariant, then there's nothing to pre-evaluate.
2374 But ensure it doesn't have any side-effects since a SAVE_EXPR is
2375 invariant but has side effects and might contain a reference to
2376 the object we're initializing. */
2377 if (TREE_INVARIANT (*expr_p
) && !TREE_SIDE_EFFECTS (*expr_p
))
2380 /* If the type has non-trivial constructors, we can't pre-evaluate. */
2381 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p
)))
2384 /* Recurse for nested constructors. */
2385 if (TREE_CODE (*expr_p
) == CONSTRUCTOR
)
2388 for (list
= CONSTRUCTOR_ELTS (*expr_p
); list
; list
= TREE_CHAIN (list
))
2389 gimplify_init_ctor_preeval (&TREE_VALUE (list
), pre_p
, post_p
, data
);
2393 /* We can't preevaluate if the type contains a placeholder. */
2394 if (type_contains_placeholder_p (TREE_TYPE (*expr_p
)))
2397 /* Gimplify the constructor element to something appropriate for the rhs
2398 of a MODIFY_EXPR. Given that we know the lhs is an aggregate, we know
2399 the gimplifier will consider this a store to memory. Doing this
2400 gimplification now means that we won't have to deal with complicated
2401 language-specific trees, nor trees like SAVE_EXPR that can induce
2402 exponential search behavior. */
2403 one
= gimplify_expr (expr_p
, pre_p
, post_p
, is_gimple_mem_rhs
, fb_rvalue
);
2404 if (one
== GS_ERROR
)
2410 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
2411 with the lhs, since "a = { .x=a }" doesn't make sense. This will
2412 always be true for all scalars, since is_gimple_mem_rhs insists on a
2413 temporary variable for them. */
2414 if (DECL_P (*expr_p
))
2417 /* If this is of variable size, we have no choice but to assume it doesn't
2418 overlap since we can't make a temporary for it. */
2419 if (!TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (*expr_p
))))
2422 /* Otherwise, we must search for overlap ... */
2423 if (!walk_tree (expr_p
, gimplify_init_ctor_preeval_1
, data
, NULL
))
2426 /* ... and if found, force the value into a temporary. */
2427 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
2430 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
2431 a RANGE_EXPR in a CONSTRUCTOR for an array.
2435 object[var] = value;
2442 We increment var _after_ the loop exit check because we might otherwise
2443 fail if upper == TYPE_MAX_VALUE (type for upper).
2445 Note that we never have to deal with SAVE_EXPRs here, because this has
2446 already been taken care of for us, in gimplify_init_ctor_preeval(). */
2448 static void gimplify_init_ctor_eval (tree
, tree
, tree
*, bool);
2451 gimplify_init_ctor_eval_range (tree object
, tree lower
, tree upper
,
2452 tree value
, tree array_elt_type
,
2453 tree
*pre_p
, bool cleared
)
2455 tree loop_entry_label
, loop_exit_label
;
2456 tree var
, var_type
, cref
;
2458 loop_entry_label
= create_artificial_label ();
2459 loop_exit_label
= create_artificial_label ();
2461 /* Create and initialize the index variable. */
2462 var_type
= TREE_TYPE (upper
);
2463 var
= create_tmp_var (var_type
, NULL
);
2464 append_to_statement_list (build2 (MODIFY_EXPR
, var_type
, var
, lower
), pre_p
);
2466 /* Add the loop entry label. */
2467 append_to_statement_list (build1 (LABEL_EXPR
,
2472 /* Build the reference. */
2473 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
2474 var
, NULL_TREE
, NULL_TREE
);
2476 /* If we are a constructor, just call gimplify_init_ctor_eval to do
2477 the store. Otherwise just assign value to the reference. */
2479 if (TREE_CODE (value
) == CONSTRUCTOR
)
2480 /* NB we might have to call ourself recursively through
2481 gimplify_init_ctor_eval if the value is a constructor. */
2482 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
2485 append_to_statement_list (build2 (MODIFY_EXPR
, TREE_TYPE (cref
),
2489 /* We exit the loop when the index var is equal to the upper bound. */
2490 gimplify_and_add (build3 (COND_EXPR
, void_type_node
,
2491 build2 (EQ_EXPR
, boolean_type_node
,
2499 /* Otherwise, increment the index var... */
2500 append_to_statement_list (build2 (MODIFY_EXPR
, var_type
, var
,
2501 build2 (PLUS_EXPR
, var_type
, var
,
2502 fold_convert (var_type
,
2503 integer_one_node
))),
2506 /* ...and jump back to the loop entry. */
2507 append_to_statement_list (build1 (GOTO_EXPR
,
2512 /* Add the loop exit label. */
2513 append_to_statement_list (build1 (LABEL_EXPR
,
2519 /* Return true if FDECL is accessing a field that is zero sized. */
2522 zero_sized_field_decl (tree fdecl
)
2524 if (TREE_CODE (fdecl
) == FIELD_DECL
&& DECL_SIZE (fdecl
)
2525 && integer_zerop (DECL_SIZE (fdecl
)))
2530 /* A subroutine of gimplify_init_constructor. Generate individual
2531 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
2532 assignments should happen. LIST is the CONSTRUCTOR_ELTS of the
2533 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
2537 gimplify_init_ctor_eval (tree object
, tree list
, tree
*pre_p
, bool cleared
)
2539 tree array_elt_type
= NULL
;
2541 if (TREE_CODE (TREE_TYPE (object
)) == ARRAY_TYPE
)
2542 array_elt_type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object
)));
2544 for (; list
; list
= TREE_CHAIN (list
))
2546 tree purpose
, value
, cref
, init
;
2548 purpose
= TREE_PURPOSE (list
);
2549 value
= TREE_VALUE (list
);
2551 /* NULL values are created above for gimplification errors. */
2555 if (cleared
&& initializer_zerop (value
))
2558 /* ??? Here's to hoping the front end fills in all of the indices,
2559 so we don't have to figure out what's missing ourselves. */
2560 gcc_assert (purpose
);
2562 if (zero_sized_field_decl (purpose
))
2565 /* If we have a RANGE_EXPR, we have to build a loop to assign the
2567 if (TREE_CODE (purpose
) == RANGE_EXPR
)
2569 tree lower
= TREE_OPERAND (purpose
, 0);
2570 tree upper
= TREE_OPERAND (purpose
, 1);
2572 /* If the lower bound is equal to upper, just treat it as if
2573 upper was the index. */
2574 if (simple_cst_equal (lower
, upper
))
2578 gimplify_init_ctor_eval_range (object
, lower
, upper
, value
,
2579 array_elt_type
, pre_p
, cleared
);
2586 cref
= build (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
2587 purpose
, NULL_TREE
, NULL_TREE
);
2590 cref
= build (COMPONENT_REF
, TREE_TYPE (purpose
),
2591 unshare_expr (object
), purpose
, NULL_TREE
);
2593 if (TREE_CODE (value
) == CONSTRUCTOR
)
2594 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
2598 init
= build (MODIFY_EXPR
, TREE_TYPE (cref
), cref
, value
);
2599 gimplify_and_add (init
, pre_p
);
2604 /* A subroutine of gimplify_modify_expr. Break out elements of a
2605 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
2607 Note that we still need to clear any elements that don't have explicit
2608 initializers, so if not all elements are initialized we keep the
2609 original MODIFY_EXPR, we just remove all of the constructor elements. */
2611 static enum gimplify_status
2612 gimplify_init_constructor (tree
*expr_p
, tree
*pre_p
,
2613 tree
*post_p
, bool want_value
)
2616 tree ctor
= TREE_OPERAND (*expr_p
, 1);
2617 tree type
= TREE_TYPE (ctor
);
2618 enum gimplify_status ret
;
2621 if (TREE_CODE (ctor
) != CONSTRUCTOR
)
2622 return GS_UNHANDLED
;
2624 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
2625 is_gimple_lvalue
, fb_lvalue
);
2626 if (ret
== GS_ERROR
)
2628 object
= TREE_OPERAND (*expr_p
, 0);
2630 elt_list
= CONSTRUCTOR_ELTS (ctor
);
2633 switch (TREE_CODE (type
))
2637 case QUAL_UNION_TYPE
:
2640 struct gimplify_init_ctor_preeval_data preeval_data
;
2641 HOST_WIDE_INT num_type_elements
, num_ctor_elements
;
2642 HOST_WIDE_INT num_nonzero_elements
, num_nonconstant_elements
;
2645 /* Aggregate types must lower constructors to initialization of
2646 individual elements. The exception is that a CONSTRUCTOR node
2647 with no elements indicates zero-initialization of the whole. */
2648 if (elt_list
== NULL
)
2651 categorize_ctor_elements (ctor
, &num_nonzero_elements
,
2652 &num_nonconstant_elements
,
2653 &num_ctor_elements
, &cleared
);
2655 /* If a const aggregate variable is being initialized, then it
2656 should never be a lose to promote the variable to be static. */
2657 if (num_nonconstant_elements
== 0
2658 && num_nonzero_elements
> 1
2659 && TREE_READONLY (object
)
2660 && TREE_CODE (object
) == VAR_DECL
)
2662 DECL_INITIAL (object
) = ctor
;
2663 TREE_STATIC (object
) = 1;
2664 if (!DECL_NAME (object
))
2665 DECL_NAME (object
) = create_tmp_var_name ("C");
2666 walk_tree (&DECL_INITIAL (object
), force_labels_r
, NULL
, NULL
);
2668 /* ??? C++ doesn't automatically append a .<number> to the
2669 assembler name, and even when it does, it looks a FE private
2670 data structures to figure out what that number should be,
2671 which are not set for this variable. I suppose this is
2672 important for local statics for inline functions, which aren't
2673 "local" in the object file sense. So in order to get a unique
2674 TU-local symbol, we must invoke the lhd version now. */
2675 lhd_set_decl_assembler_name (object
);
2677 *expr_p
= NULL_TREE
;
2681 /* If there are "lots" of initialized elements, even discounting
2682 those that are not address constants (and thus *must* be
2683 computed at runtime), then partition the constructor into
2684 constant and non-constant parts. Block copy the constant
2685 parts in, then generate code for the non-constant parts. */
2686 /* TODO. There's code in cp/typeck.c to do this. */
2688 num_type_elements
= count_type_elements (TREE_TYPE (ctor
));
2690 /* If there are "lots" of zeros, then block clear the object first. */
2691 if (num_type_elements
- num_nonzero_elements
> CLEAR_RATIO
2692 && num_nonzero_elements
< num_type_elements
/4)
2695 /* ??? This bit ought not be needed. For any element not present
2696 in the initializer, we should simply set them to zero. Except
2697 we'd need to *find* the elements that are not present, and that
2698 requires trickery to avoid quadratic compile-time behavior in
2699 large cases or excessive memory use in small cases. */
2700 else if (num_ctor_elements
< num_type_elements
)
2703 /* If there are "lots" of initialized elements, and all of them
2704 are valid address constants, then the entire initializer can
2705 be dropped to memory, and then memcpy'd out. Don't do this
2706 for sparse arrays, though, as it's more efficient to follow
2707 the standard CONSTRUCTOR behavior of memset followed by
2708 individual element initialization. */
2709 if (num_nonconstant_elements
== 0 && !cleared
)
2711 HOST_WIDE_INT size
= int_size_in_bytes (type
);
2714 /* ??? We can still get unbounded array types, at least
2715 from the C++ front end. This seems wrong, but attempt
2716 to work around it for now. */
2719 size
= int_size_in_bytes (TREE_TYPE (object
));
2721 TREE_TYPE (ctor
) = type
= TREE_TYPE (object
);
2724 /* Find the maximum alignment we can assume for the object. */
2725 /* ??? Make use of DECL_OFFSET_ALIGN. */
2726 if (DECL_P (object
))
2727 align
= DECL_ALIGN (object
);
2729 align
= TYPE_ALIGN (type
);
2731 if (size
> 0 && !can_move_by_pieces (size
, align
))
2733 tree
new = create_tmp_var_raw (type
, "C");
2735 gimple_add_tmp_var (new);
2736 TREE_STATIC (new) = 1;
2737 TREE_READONLY (new) = 1;
2738 DECL_INITIAL (new) = ctor
;
2739 if (align
> DECL_ALIGN (new))
2741 DECL_ALIGN (new) = align
;
2742 DECL_USER_ALIGN (new) = 1;
2744 walk_tree (&DECL_INITIAL (new), force_labels_r
, NULL
, NULL
);
2746 TREE_OPERAND (*expr_p
, 1) = new;
2748 /* This is no longer an assignment of a CONSTRUCTOR, but
2749 we still may have processing to do on the LHS. So
2750 pretend we didn't do anything here to let that happen. */
2751 return GS_UNHANDLED
;
2757 /* Zap the CONSTRUCTOR element list, which simplifies this case.
2758 Note that we still have to gimplify, in order to handle the
2759 case of variable sized types. Avoid shared tree structures. */
2760 CONSTRUCTOR_ELTS (ctor
) = NULL_TREE
;
2761 object
= unshare_expr (object
);
2762 gimplify_stmt (expr_p
);
2763 append_to_statement_list (*expr_p
, pre_p
);
2766 /* If we have not block cleared the object, or if there are nonzero
2767 elements in the constructor, add assignments to the individual
2768 scalar fields of the object. */
2769 if (!cleared
|| num_nonzero_elements
> 0)
2771 preeval_data
.lhs_base_decl
= get_base_address (object
);
2772 if (!DECL_P (preeval_data
.lhs_base_decl
))
2773 preeval_data
.lhs_base_decl
= NULL
;
2774 preeval_data
.lhs_alias_set
= get_alias_set (object
);
2776 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p
, 1),
2777 pre_p
, post_p
, &preeval_data
);
2778 gimplify_init_ctor_eval (object
, elt_list
, pre_p
, cleared
);
2781 *expr_p
= NULL_TREE
;
2789 /* Extract the real and imaginary parts out of the ctor. */
2793 r
= TREE_VALUE (elt_list
);
2794 elt_list
= TREE_CHAIN (elt_list
);
2797 i
= TREE_VALUE (elt_list
);
2798 gcc_assert (!TREE_CHAIN (elt_list
));
2801 if (r
== NULL
|| i
== NULL
)
2803 tree zero
= convert (TREE_TYPE (type
), integer_zero_node
);
2810 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
2811 represent creation of a complex value. */
2812 if (TREE_CONSTANT (r
) && TREE_CONSTANT (i
))
2814 ctor
= build_complex (type
, r
, i
);
2815 TREE_OPERAND (*expr_p
, 1) = ctor
;
2819 ctor
= build (COMPLEX_EXPR
, type
, r
, i
);
2820 TREE_OPERAND (*expr_p
, 1) = ctor
;
2821 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
2822 rhs_predicate_for (TREE_OPERAND (*expr_p
, 0)),
2829 /* Go ahead and simplify constant constructors to VECTOR_CST. */
2830 if (TREE_CONSTANT (ctor
))
2834 /* Even when ctor is constant, it might contain non-*_CST
2835 elements (e.g. { 1.0/0.0 - 1.0/0.0, 0.0 }) and those don't
2836 belong into VECTOR_CST nodes. */
2837 for (tem
= elt_list
; tem
; tem
= TREE_CHAIN (tem
))
2838 if (! CONSTANT_CLASS_P (TREE_VALUE (tem
)))
2843 TREE_OPERAND (*expr_p
, 1) = build_vector (type
, elt_list
);
2848 /* Vector types use CONSTRUCTOR all the way through gimple
2849 compilation as a general initializer. */
2850 for (; elt_list
; elt_list
= TREE_CHAIN (elt_list
))
2852 enum gimplify_status tret
;
2853 tret
= gimplify_expr (&TREE_VALUE (elt_list
), pre_p
, post_p
,
2854 is_gimple_val
, fb_rvalue
);
2855 if (tret
== GS_ERROR
)
2861 /* So how did we get a CONSTRUCTOR for a scalar type? */
2865 if (ret
== GS_ERROR
)
2867 else if (want_value
)
2869 append_to_statement_list (*expr_p
, pre_p
);
2877 /* Given a pointer value OP0, return a simplified version of an
2878 indirection through OP0, or NULL_TREE if no simplification is
2879 possible. This may only be applied to a rhs of an expression.
2880 Note that the resulting type may be different from the type pointed
2881 to in the sense that it is still compatible from the langhooks
2885 fold_indirect_ref_rhs (tree t
)
2887 tree type
= TREE_TYPE (TREE_TYPE (t
));
2892 subtype
= TREE_TYPE (sub
);
2893 if (!POINTER_TYPE_P (subtype
))
2896 if (TREE_CODE (sub
) == ADDR_EXPR
)
2898 tree op
= TREE_OPERAND (sub
, 0);
2899 tree optype
= TREE_TYPE (op
);
2901 if (lang_hooks
.types_compatible_p (type
, optype
))
2903 /* *(foo *)&fooarray => fooarray[0] */
2904 else if (TREE_CODE (optype
) == ARRAY_TYPE
2905 && lang_hooks
.types_compatible_p (type
, TREE_TYPE (optype
)))
2907 tree type_domain
= TYPE_DOMAIN (optype
);
2908 tree min_val
= size_zero_node
;
2909 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
2910 min_val
= TYPE_MIN_VALUE (type_domain
);
2911 return build4 (ARRAY_REF
, type
, op
, min_val
, NULL_TREE
, NULL_TREE
);
2915 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
2916 if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
2917 && lang_hooks
.types_compatible_p (type
, TREE_TYPE (TREE_TYPE (subtype
))))
2920 tree min_val
= size_zero_node
;
2921 sub
= fold_indirect_ref_rhs (sub
);
2923 sub
= build1 (INDIRECT_REF
, TREE_TYPE (subtype
), sub
);
2924 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
2925 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
2926 min_val
= TYPE_MIN_VALUE (type_domain
);
2927 return build4 (ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
, NULL_TREE
);
2933 /* Subroutine of gimplify_modify_expr to do simplifications of MODIFY_EXPRs
2934 based on the code of the RHS. We loop for as long as something changes. */
2936 static enum gimplify_status
2937 gimplify_modify_expr_rhs (tree
*expr_p
, tree
*from_p
, tree
*to_p
, tree
*pre_p
,
2938 tree
*post_p
, bool want_value
)
2940 enum gimplify_status ret
= GS_OK
;
2942 while (ret
!= GS_UNHANDLED
)
2943 switch (TREE_CODE (*from_p
))
2947 /* If we have code like
2951 where the type of "x" is a (possibly cv-qualified variant
2952 of "A"), treat the entire expression as identical to "x".
2953 This kind of code arises in C++ when an object is bound
2954 to a const reference, and if "x" is a TARGET_EXPR we want
2955 to take advantage of the optimization below. */
2956 tree t
= fold_indirect_ref_rhs (TREE_OPERAND (*from_p
, 0));
2969 /* If we are initializing something from a TARGET_EXPR, strip the
2970 TARGET_EXPR and initialize it directly, if possible. This can't
2971 be done if the initializer is void, since that implies that the
2972 temporary is set in some non-trivial way.
2974 ??? What about code that pulls out the temp and uses it
2975 elsewhere? I think that such code never uses the TARGET_EXPR as
2976 an initializer. If I'm wrong, we'll die because the temp won't
2977 have any RTL. In that case, I guess we'll need to replace
2978 references somehow. */
2979 tree init
= TARGET_EXPR_INITIAL (*from_p
);
2981 if (!VOID_TYPE_P (TREE_TYPE (init
)))
2992 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
2994 gimplify_compound_expr (from_p
, pre_p
, true);
2999 /* If we're initializing from a CONSTRUCTOR, break this into
3000 individual MODIFY_EXPRs. */
3001 return gimplify_init_constructor (expr_p
, pre_p
, post_p
, want_value
);
3004 /* If we're assigning to a non-register type, push the assignment
3005 down into the branches. This is mandatory for ADDRESSABLE types,
3006 since we cannot generate temporaries for such, but it saves a
3007 copy in other cases as well. */
3008 if (!is_gimple_reg_type (TREE_TYPE (*from_p
)))
3011 return gimplify_cond_expr (expr_p
, pre_p
, post_p
, *to_p
,
3019 /* For calls that return in memory, give *to_p as the CALL_EXPR's
3020 return slot so that we don't generate a temporary. */
3021 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p
)
3022 && aggregate_value_p (*from_p
, *from_p
))
3026 if (TREE_CODE (*to_p
) == RESULT_DECL
3027 && needs_to_live_in_memory (*to_p
))
3028 /* It's always OK to use the return slot directly. */
3030 else if (!is_gimple_non_addressable (*to_p
))
3031 /* Don't use the original target if it's already addressable;
3032 if its address escapes, and the called function uses the
3033 NRV optimization, a conforming program could see *to_p
3034 change before the called function returns; see c++/19317.
3035 When optimizing, the return_slot pass marks more functions
3036 as safe after we have escape info. */
3038 else if (DECL_GIMPLE_FORMAL_TEMP_P (*to_p
))
3039 /* Don't use the original target if it's a formal temp; we
3040 don't want to take their addresses. */
3042 else if (is_gimple_reg_type (TREE_TYPE (*to_p
)))
3043 /* Also don't force regs into memory. */
3050 CALL_EXPR_RETURN_SLOT_OPT (*from_p
) = 1;
3051 lang_hooks
.mark_addressable (*to_p
);
3066 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
3067 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
3068 DECL_COMPLEX_GIMPLE_REG_P set. */
3070 static enum gimplify_status
3071 gimplify_modify_expr_complex_part (tree
*expr_p
, tree
*pre_p
, bool want_value
)
3073 enum tree_code code
, ocode
;
3074 tree lhs
, rhs
, new_rhs
, other
, realpart
, imagpart
;
3076 lhs
= TREE_OPERAND (*expr_p
, 0);
3077 rhs
= TREE_OPERAND (*expr_p
, 1);
3078 code
= TREE_CODE (lhs
);
3079 lhs
= TREE_OPERAND (lhs
, 0);
3081 ocode
= code
== REALPART_EXPR
? IMAGPART_EXPR
: REALPART_EXPR
;
3082 other
= build1 (ocode
, TREE_TYPE (rhs
), lhs
);
3083 other
= get_formal_tmp_var (other
, pre_p
);
3085 realpart
= code
== REALPART_EXPR
? rhs
: other
;
3086 imagpart
= code
== REALPART_EXPR
? other
: rhs
;
3088 if (TREE_CONSTANT (realpart
) && TREE_CONSTANT (imagpart
))
3089 new_rhs
= build_complex (TREE_TYPE (lhs
), realpart
, imagpart
);
3091 new_rhs
= build2 (COMPLEX_EXPR
, TREE_TYPE (lhs
), realpart
, imagpart
);
3093 TREE_OPERAND (*expr_p
, 0) = lhs
;
3094 TREE_OPERAND (*expr_p
, 1) = new_rhs
;
3098 append_to_statement_list (*expr_p
, pre_p
);
3105 /* Gimplify the MODIFY_EXPR node pointed by EXPR_P.
3111 PRE_P points to the list where side effects that must happen before
3112 *EXPR_P should be stored.
3114 POST_P points to the list where side effects that must happen after
3115 *EXPR_P should be stored.
3117 WANT_VALUE is nonzero iff we want to use the value of this expression
3118 in another expression. */
3120 static enum gimplify_status
3121 gimplify_modify_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
, bool want_value
)
3123 tree
*from_p
= &TREE_OPERAND (*expr_p
, 1);
3124 tree
*to_p
= &TREE_OPERAND (*expr_p
, 0);
3125 enum gimplify_status ret
= GS_UNHANDLED
;
3127 gcc_assert (TREE_CODE (*expr_p
) == MODIFY_EXPR
3128 || TREE_CODE (*expr_p
) == INIT_EXPR
);
3130 /* The distinction between MODIFY_EXPR and INIT_EXPR is no longer useful. */
3131 if (TREE_CODE (*expr_p
) == INIT_EXPR
)
3132 TREE_SET_CODE (*expr_p
, MODIFY_EXPR
);
3134 /* See if any simplifications can be done based on what the RHS is. */
3135 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
3137 if (ret
!= GS_UNHANDLED
)
3140 /* If the value being copied is of variable width, compute the length
3141 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
3142 before gimplifying any of the operands so that we can resolve any
3143 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
3144 the size of the expression to be copied, not of the destination, so
3145 that is what we must here. */
3146 maybe_with_size_expr (from_p
);
3148 ret
= gimplify_expr (to_p
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
3149 if (ret
== GS_ERROR
)
3152 ret
= gimplify_expr (from_p
, pre_p
, post_p
,
3153 rhs_predicate_for (*to_p
), fb_rvalue
);
3154 if (ret
== GS_ERROR
)
3157 /* Now see if the above changed *from_p to something we handle specially. */
3158 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
3160 if (ret
!= GS_UNHANDLED
)
3163 /* If we've got a variable sized assignment between two lvalues (i.e. does
3164 not involve a call), then we can make things a bit more straightforward
3165 by converting the assignment to memcpy or memset. */
3166 if (TREE_CODE (*from_p
) == WITH_SIZE_EXPR
)
3168 tree from
= TREE_OPERAND (*from_p
, 0);
3169 tree size
= TREE_OPERAND (*from_p
, 1);
3171 if (TREE_CODE (from
) == CONSTRUCTOR
)
3172 return gimplify_modify_expr_to_memset (expr_p
, size
, want_value
);
3173 if (is_gimple_addressable (from
))
3176 return gimplify_modify_expr_to_memcpy (expr_p
, size
, want_value
);
3180 /* Transform partial stores to non-addressable complex variables into
3181 total stores. This allows us to use real instead of virtual operands
3182 for these variables, which improves optimization. */
3183 if ((TREE_CODE (*to_p
) == REALPART_EXPR
3184 || TREE_CODE (*to_p
) == IMAGPART_EXPR
)
3185 && is_gimple_reg (TREE_OPERAND (*to_p
, 0)))
3186 return gimplify_modify_expr_complex_part (expr_p
, pre_p
, want_value
);
3188 if (gimplify_ctxp
->into_ssa
&& is_gimple_reg (*to_p
))
3190 /* If we've somehow already got an SSA_NAME on the LHS, then
3191 we're probably modified it twice. Not good. */
3192 gcc_assert (TREE_CODE (*to_p
) != SSA_NAME
);
3193 *to_p
= make_ssa_name (*to_p
, *expr_p
);
3198 append_to_statement_list (*expr_p
, pre_p
);
3206 /* Gimplify a comparison between two variable-sized objects. Do this
3207 with a call to BUILT_IN_MEMCMP. */
3209 static enum gimplify_status
3210 gimplify_variable_sized_compare (tree
*expr_p
)
3212 tree op0
= TREE_OPERAND (*expr_p
, 0);
3213 tree op1
= TREE_OPERAND (*expr_p
, 1);
3216 t
= TYPE_SIZE_UNIT (TREE_TYPE (op0
));
3217 t
= unshare_expr (t
);
3218 t
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (t
, op0
);
3219 args
= tree_cons (NULL
, t
, NULL
);
3220 t
= build_fold_addr_expr (op1
);
3221 args
= tree_cons (NULL
, t
, args
);
3222 dest
= build_fold_addr_expr (op0
);
3223 args
= tree_cons (NULL
, dest
, args
);
3224 t
= implicit_built_in_decls
[BUILT_IN_MEMCMP
];
3225 t
= build_function_call_expr (t
, args
);
3227 = build (TREE_CODE (*expr_p
), TREE_TYPE (*expr_p
), t
, integer_zero_node
);
3232 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
3233 points to the expression to gimplify.
3235 Expressions of the form 'a && b' are gimplified to:
3237 a && b ? true : false
3239 gimplify_cond_expr will do the rest.
3241 PRE_P points to the list where side effects that must happen before
3242 *EXPR_P should be stored. */
3244 static enum gimplify_status
3245 gimplify_boolean_expr (tree
*expr_p
)
3247 /* Preserve the original type of the expression. */
3248 tree type
= TREE_TYPE (*expr_p
);
3250 *expr_p
= build (COND_EXPR
, type
, *expr_p
,
3251 convert (type
, boolean_true_node
),
3252 convert (type
, boolean_false_node
));
3257 /* Gimplifies an expression sequence. This function gimplifies each
3258 expression and re-writes the original expression with the last
3259 expression of the sequence in GIMPLE form.
3261 PRE_P points to the list where the side effects for all the
3262 expressions in the sequence will be emitted.
3264 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
3265 /* ??? Should rearrange to share the pre-queue with all the indirect
3266 invocations of gimplify_expr. Would probably save on creations
3267 of statement_list nodes. */
3269 static enum gimplify_status
3270 gimplify_compound_expr (tree
*expr_p
, tree
*pre_p
, bool want_value
)
3276 tree
*sub_p
= &TREE_OPERAND (t
, 0);
3278 if (TREE_CODE (*sub_p
) == COMPOUND_EXPR
)
3279 gimplify_compound_expr (sub_p
, pre_p
, false);
3281 gimplify_stmt (sub_p
);
3282 append_to_statement_list (*sub_p
, pre_p
);
3284 t
= TREE_OPERAND (t
, 1);
3286 while (TREE_CODE (t
) == COMPOUND_EXPR
);
3293 gimplify_stmt (expr_p
);
3298 /* Gimplifies a statement list. These may be created either by an
3299 enlightened front-end, or by shortcut_cond_expr. */
3301 static enum gimplify_status
3302 gimplify_statement_list (tree
*expr_p
)
3304 tree_stmt_iterator i
= tsi_start (*expr_p
);
3306 while (!tsi_end_p (i
))
3310 gimplify_stmt (tsi_stmt_ptr (i
));
3315 else if (TREE_CODE (t
) == STATEMENT_LIST
)
3317 tsi_link_before (&i
, t
, TSI_SAME_STMT
);
3327 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
3328 gimplify. After gimplification, EXPR_P will point to a new temporary
3329 that holds the original value of the SAVE_EXPR node.
3331 PRE_P points to the list where side effects that must happen before
3332 *EXPR_P should be stored. */
3334 static enum gimplify_status
3335 gimplify_save_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
3337 enum gimplify_status ret
= GS_ALL_DONE
;
3340 gcc_assert (TREE_CODE (*expr_p
) == SAVE_EXPR
);
3341 val
= TREE_OPERAND (*expr_p
, 0);
3343 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
3344 if (!SAVE_EXPR_RESOLVED_P (*expr_p
))
3346 /* The operand may be a void-valued expression such as SAVE_EXPRs
3347 generated by the Java frontend for class initialization. It is
3348 being executed only for its side-effects. */
3349 if (TREE_TYPE (val
) == void_type_node
)
3351 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
3352 is_gimple_stmt
, fb_none
);
3353 append_to_statement_list (TREE_OPERAND (*expr_p
, 0), pre_p
);
3357 val
= get_initialized_tmp_var (val
, pre_p
, post_p
);
3359 TREE_OPERAND (*expr_p
, 0) = val
;
3360 SAVE_EXPR_RESOLVED_P (*expr_p
) = 1;
3368 /* Re-write the ADDR_EXPR node pointed by EXPR_P
3375 PRE_P points to the list where side effects that must happen before
3376 *EXPR_P should be stored.
3378 POST_P points to the list where side effects that must happen after
3379 *EXPR_P should be stored. */
3381 static enum gimplify_status
3382 gimplify_addr_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
3384 tree expr
= *expr_p
;
3385 tree op0
= TREE_OPERAND (expr
, 0);
3386 enum gimplify_status ret
;
3388 switch (TREE_CODE (op0
))
3391 case MISALIGNED_INDIRECT_REF
:
3393 /* Check if we are dealing with an expression of the form '&*ptr'.
3394 While the front end folds away '&*ptr' into 'ptr', these
3395 expressions may be generated internally by the compiler (e.g.,
3396 builtins like __builtin_va_end). */
3397 /* Caution: the silent array decomposition semantics we allow for
3398 ADDR_EXPR means we can't always discard the pair. */
3399 /* Gimplification of the ADDR_EXPR operand may drop
3400 cv-qualification conversions, so make sure we add them if
3403 tree op00
= TREE_OPERAND (op0
, 0);
3404 tree t_expr
= TREE_TYPE (expr
);
3405 tree t_op00
= TREE_TYPE (op00
);
3407 if (!lang_hooks
.types_compatible_p (t_expr
, t_op00
))
3409 #ifdef ENABLE_CHECKING
3410 tree t_op0
= TREE_TYPE (op0
);
3411 gcc_assert (POINTER_TYPE_P (t_expr
)
3412 && cpt_same_type (TREE_CODE (t_op0
) == ARRAY_TYPE
3413 ? TREE_TYPE (t_op0
) : t_op0
,
3415 && POINTER_TYPE_P (t_op00
)
3416 && cpt_same_type (t_op0
, TREE_TYPE (t_op00
)));
3418 op00
= fold_convert (TREE_TYPE (expr
), op00
);
3425 case VIEW_CONVERT_EXPR
:
3426 /* Take the address of our operand and then convert it to the type of
3429 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
3430 all clear. The impact of this transformation is even less clear. */
3432 /* If the operand is a useless conversion, look through it. Doing so
3433 guarantees that the ADDR_EXPR and its operand will remain of the
3435 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0
, 0)))
3436 op0
= TREE_OPERAND (op0
, 0);
3438 *expr_p
= fold_convert (TREE_TYPE (expr
),
3439 build_fold_addr_expr (TREE_OPERAND (op0
, 0)));
3444 /* We use fb_either here because the C frontend sometimes takes
3445 the address of a call that returns a struct; see
3446 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
3447 the implied temporary explicit. */
3448 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, post_p
,
3449 is_gimple_addressable
, fb_either
);
3450 if (ret
!= GS_ERROR
)
3452 op0
= TREE_OPERAND (expr
, 0);
3454 /* For various reasons, the gimplification of the expression
3455 may have made a new INDIRECT_REF. */
3456 if (TREE_CODE (op0
) == INDIRECT_REF
)
3457 goto do_indirect_ref
;
3459 /* Make sure TREE_INVARIANT, TREE_CONSTANT, and TREE_SIDE_EFFECTS
3461 recompute_tree_invarant_for_addr_expr (expr
);
3463 /* Mark the RHS addressable. */
3464 lang_hooks
.mark_addressable (TREE_OPERAND (expr
, 0));
3472 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
3473 value; output operands should be a gimple lvalue. */
3475 static enum gimplify_status
3476 gimplify_asm_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
3478 tree expr
= *expr_p
;
3479 int noutputs
= list_length (ASM_OUTPUTS (expr
));
3480 const char **oconstraints
3481 = (const char **) alloca ((noutputs
) * sizeof (const char *));
3484 const char *constraint
;
3485 bool allows_mem
, allows_reg
, is_inout
;
3486 enum gimplify_status ret
, tret
;
3489 for (i
= 0, link
= ASM_OUTPUTS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
3491 size_t constraint_len
;
3492 oconstraints
[i
] = constraint
3493 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
3494 constraint_len
= strlen (constraint
);
3495 if (constraint_len
== 0)
3498 parse_output_constraint (&constraint
, i
, 0, 0,
3499 &allows_mem
, &allows_reg
, &is_inout
);
3501 if (!allows_reg
&& allows_mem
)
3502 lang_hooks
.mark_addressable (TREE_VALUE (link
));
3504 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
3505 is_inout
? is_gimple_min_lval
: is_gimple_lvalue
,
3506 fb_lvalue
| fb_mayfail
);
3507 if (tret
== GS_ERROR
)
3509 error ("invalid lvalue in asm output %d", i
);
3515 /* An input/output operand. To give the optimizers more
3516 flexibility, split it into separate input and output
3521 /* Turn the in/out constraint into an output constraint. */
3522 char *p
= xstrdup (constraint
);
3524 TREE_VALUE (TREE_PURPOSE (link
)) = build_string (constraint_len
, p
);
3526 /* And add a matching input constraint. */
3529 sprintf (buf
, "%d", i
);
3531 /* If there are multiple alternatives in the constraint,
3532 handle each of them individually. Those that allow register
3533 will be replaced with operand number, the others will stay
3535 if (strchr (p
, ',') != NULL
)
3537 size_t len
= 0, buflen
= strlen (buf
);
3538 char *beg
, *end
, *str
, *dst
;
3542 end
= strchr (beg
, ',');
3544 end
= strchr (beg
, '\0');
3545 if ((size_t) (end
- beg
) < buflen
)
3548 len
+= end
- beg
+ 1;
3556 for (beg
= p
+ 1, dst
= str
;;)
3559 bool mem_p
, reg_p
, inout_p
;
3561 end
= strchr (beg
, ',');
3566 parse_output_constraint (&tem
, i
, 0, 0,
3567 &mem_p
, ®_p
, &inout_p
);
3572 memcpy (dst
, buf
, buflen
);
3581 memcpy (dst
, beg
, len
);
3590 input
= build_string (dst
- str
, str
);
3593 input
= build_string (strlen (buf
), buf
);
3596 input
= build_string (constraint_len
- 1, constraint
+ 1);
3600 input
= build_tree_list (build_tree_list (NULL_TREE
, input
),
3601 unshare_expr (TREE_VALUE (link
)));
3602 ASM_INPUTS (expr
) = chainon (ASM_INPUTS (expr
), input
);
3606 for (link
= ASM_INPUTS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
3609 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
3610 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
3611 oconstraints
, &allows_mem
, &allows_reg
);
3613 /* If the operand is a memory input, it should be an lvalue. */
3614 if (!allows_reg
&& allows_mem
)
3616 lang_hooks
.mark_addressable (TREE_VALUE (link
));
3617 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
3618 is_gimple_lvalue
, fb_lvalue
| fb_mayfail
);
3619 if (tret
== GS_ERROR
)
3621 error ("memory input %d is not directly addressable", i
);
3627 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
3628 is_gimple_asm_val
, fb_rvalue
);
3629 if (tret
== GS_ERROR
)
3637 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
3638 WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
3639 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
3640 return to this function.
3642 FIXME should we complexify the prequeue handling instead? Or use flags
3643 for all the cleanups and let the optimizer tighten them up? The current
3644 code seems pretty fragile; it will break on a cleanup within any
3645 non-conditional nesting. But any such nesting would be broken, anyway;
3646 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
3647 and continues out of it. We can do that at the RTL level, though, so
3648 having an optimizer to tighten up try/finally regions would be a Good
3651 static enum gimplify_status
3652 gimplify_cleanup_point_expr (tree
*expr_p
, tree
*pre_p
)
3654 tree_stmt_iterator iter
;
3657 tree temp
= voidify_wrapper_expr (*expr_p
, NULL
);
3659 /* We only care about the number of conditions between the innermost
3660 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count. */
3661 int old_conds
= gimplify_ctxp
->conditions
;
3662 gimplify_ctxp
->conditions
= 0;
3664 body
= TREE_OPERAND (*expr_p
, 0);
3665 gimplify_to_stmt_list (&body
);
3667 gimplify_ctxp
->conditions
= old_conds
;
3669 for (iter
= tsi_start (body
); !tsi_end_p (iter
); )
3671 tree
*wce_p
= tsi_stmt_ptr (iter
);
3674 if (TREE_CODE (wce
) == WITH_CLEANUP_EXPR
)
3676 if (tsi_one_before_end_p (iter
))
3678 tsi_link_before (&iter
, TREE_OPERAND (wce
, 0), TSI_SAME_STMT
);
3685 enum tree_code code
;
3687 if (CLEANUP_EH_ONLY (wce
))
3688 code
= TRY_CATCH_EXPR
;
3690 code
= TRY_FINALLY_EXPR
;
3692 sl
= tsi_split_statement_list_after (&iter
);
3693 tfe
= build (code
, void_type_node
, sl
, NULL_TREE
);
3694 append_to_statement_list (TREE_OPERAND (wce
, 0),
3695 &TREE_OPERAND (tfe
, 1));
3697 iter
= tsi_start (sl
);
3707 append_to_statement_list (body
, pre_p
);
3717 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
3718 is the cleanup action required. */
3721 gimple_push_cleanup (tree var
, tree cleanup
, bool eh_only
, tree
*pre_p
)
3725 /* Errors can result in improperly nested cleanups. Which results in
3726 confusion when trying to resolve the WITH_CLEANUP_EXPR. */
3727 if (errorcount
|| sorrycount
)
3730 if (gimple_conditional_context ())
3732 /* If we're in a conditional context, this is more complex. We only
3733 want to run the cleanup if we actually ran the initialization that
3734 necessitates it, but we want to run it after the end of the
3735 conditional context. So we wrap the try/finally around the
3736 condition and use a flag to determine whether or not to actually
3737 run the destructor. Thus
3741 becomes (approximately)
3745 if (test) { A::A(temp); flag = 1; val = f(temp); }
3748 if (flag) A::~A(temp);
3753 tree flag
= create_tmp_var (boolean_type_node
, "cleanup");
3754 tree ffalse
= build (MODIFY_EXPR
, void_type_node
, flag
,
3755 boolean_false_node
);
3756 tree ftrue
= build (MODIFY_EXPR
, void_type_node
, flag
,
3758 cleanup
= build (COND_EXPR
, void_type_node
, flag
, cleanup
, NULL
);
3759 wce
= build (WITH_CLEANUP_EXPR
, void_type_node
, cleanup
);
3760 append_to_statement_list (ffalse
, &gimplify_ctxp
->conditional_cleanups
);
3761 append_to_statement_list (wce
, &gimplify_ctxp
->conditional_cleanups
);
3762 append_to_statement_list (ftrue
, pre_p
);
3764 /* Because of this manipulation, and the EH edges that jump
3765 threading cannot redirect, the temporary (VAR) will appear
3766 to be used uninitialized. Don't warn. */
3767 TREE_NO_WARNING (var
) = 1;
3771 wce
= build (WITH_CLEANUP_EXPR
, void_type_node
, cleanup
);
3772 CLEANUP_EH_ONLY (wce
) = eh_only
;
3773 append_to_statement_list (wce
, pre_p
);
3776 gimplify_stmt (&TREE_OPERAND (wce
, 0));
3779 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
3781 static enum gimplify_status
3782 gimplify_target_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
3784 tree targ
= *expr_p
;
3785 tree temp
= TARGET_EXPR_SLOT (targ
);
3786 tree init
= TARGET_EXPR_INITIAL (targ
);
3787 enum gimplify_status ret
;
3791 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
3792 to the temps list. */
3793 gimple_add_tmp_var (temp
);
3795 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
3796 expression is supposed to initialize the slot. */
3797 if (VOID_TYPE_P (TREE_TYPE (init
)))
3798 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
, fb_none
);
3801 /* Special handling for BIND_EXPR can result in fewer temps. */
3803 if (TREE_CODE (init
) == BIND_EXPR
)
3804 gimplify_bind_expr (&init
, temp
, pre_p
);
3807 init
= build (MODIFY_EXPR
, void_type_node
, temp
, init
);
3808 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
,
3812 if (ret
== GS_ERROR
)
3814 append_to_statement_list (init
, pre_p
);
3816 /* If needed, push the cleanup for the temp. */
3817 if (TARGET_EXPR_CLEANUP (targ
))
3819 gimplify_stmt (&TARGET_EXPR_CLEANUP (targ
));
3820 gimple_push_cleanup (temp
, TARGET_EXPR_CLEANUP (targ
),
3821 CLEANUP_EH_ONLY (targ
), pre_p
);
3824 /* Only expand this once. */
3825 TREE_OPERAND (targ
, 3) = init
;
3826 TARGET_EXPR_INITIAL (targ
) = NULL_TREE
;
3829 /* We should have expanded this before. */
3830 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp
));
3836 /* Gimplification of expression trees. */
3838 /* Gimplify an expression which appears at statement context; usually, this
3839 means replacing it with a suitably gimple STATEMENT_LIST. */
3842 gimplify_stmt (tree
*stmt_p
)
3844 gimplify_expr (stmt_p
, NULL
, NULL
, is_gimple_stmt
, fb_none
);
3847 /* Similarly, but force the result to be a STATEMENT_LIST. */
3850 gimplify_to_stmt_list (tree
*stmt_p
)
3852 gimplify_stmt (stmt_p
);
3854 *stmt_p
= alloc_stmt_list ();
3855 else if (TREE_CODE (*stmt_p
) != STATEMENT_LIST
)
3858 *stmt_p
= alloc_stmt_list ();
3859 append_to_statement_list (t
, stmt_p
);
3864 /* Gimplifies the expression tree pointed by EXPR_P. Return 0 if
3865 gimplification failed.
3867 PRE_P points to the list where side effects that must happen before
3868 EXPR should be stored.
3870 POST_P points to the list where side effects that must happen after
3871 EXPR should be stored, or NULL if there is no suitable list. In
3872 that case, we copy the result to a temporary, emit the
3873 post-effects, and then return the temporary.
3875 GIMPLE_TEST_F points to a function that takes a tree T and
3876 returns nonzero if T is in the GIMPLE form requested by the
3877 caller. The GIMPLE predicates are in tree-gimple.c.
3879 This test is used twice. Before gimplification, the test is
3880 invoked to determine whether *EXPR_P is already gimple enough. If
3881 that fails, *EXPR_P is gimplified according to its code and
3882 GIMPLE_TEST_F is called again. If the test still fails, then a new
3883 temporary variable is created and assigned the value of the
3884 gimplified expression.
3886 FALLBACK tells the function what sort of a temporary we want. If the 1
3887 bit is set, an rvalue is OK. If the 2 bit is set, an lvalue is OK.
3888 If both are set, either is OK, but an lvalue is preferable.
3890 The return value is either GS_ERROR or GS_ALL_DONE, since this function
3891 iterates until solution. */
3893 enum gimplify_status
3894 gimplify_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
,
3895 bool (* gimple_test_f
) (tree
), fallback_t fallback
)
3898 tree internal_pre
= NULL_TREE
;
3899 tree internal_post
= NULL_TREE
;
3901 int is_statement
= (pre_p
== NULL
);
3902 location_t saved_location
;
3903 enum gimplify_status ret
;
3905 save_expr
= *expr_p
;
3906 if (save_expr
== NULL_TREE
)
3909 /* We used to check the predicate here and return immediately if it
3910 succeeds. This is wrong; the design is for gimplification to be
3911 idempotent, and for the predicates to only test for valid forms, not
3912 whether they are fully simplified. */
3914 /* Set up our internal queues if needed. */
3916 pre_p
= &internal_pre
;
3918 post_p
= &internal_post
;
3920 saved_location
= input_location
;
3921 if (save_expr
!= error_mark_node
3922 && EXPR_HAS_LOCATION (*expr_p
))
3923 input_location
= EXPR_LOCATION (*expr_p
);
3925 /* Loop over the specific gimplifiers until the toplevel node
3926 remains the same. */
3929 /* Strip away as many useless type conversions as possible
3931 STRIP_USELESS_TYPE_CONVERSION (*expr_p
);
3933 /* Remember the expr. */
3934 save_expr
= *expr_p
;
3936 /* Die, die, die, my darling. */
3937 if (save_expr
== error_mark_node
3938 || (TREE_TYPE (save_expr
)
3939 && TREE_TYPE (save_expr
) == error_mark_node
))
3945 /* Do any language-specific gimplification. */
3946 ret
= lang_hooks
.gimplify_expr (expr_p
, pre_p
, post_p
);
3949 if (*expr_p
== NULL_TREE
)
3951 if (*expr_p
!= save_expr
)
3954 else if (ret
!= GS_UNHANDLED
)
3958 switch (TREE_CODE (*expr_p
))
3960 /* First deal with the special cases. */
3962 case POSTINCREMENT_EXPR
:
3963 case POSTDECREMENT_EXPR
:
3964 case PREINCREMENT_EXPR
:
3965 case PREDECREMENT_EXPR
:
3966 ret
= gimplify_self_mod_expr (expr_p
, pre_p
, post_p
,
3967 fallback
!= fb_none
);
3971 case ARRAY_RANGE_REF
:
3975 case VIEW_CONVERT_EXPR
:
3976 ret
= gimplify_compound_lval (expr_p
, pre_p
, post_p
,
3977 fallback
? fallback
: fb_rvalue
);
3981 ret
= gimplify_cond_expr (expr_p
, pre_p
, post_p
, NULL_TREE
,
3983 /* C99 code may assign to an array in a structure value of a
3984 conditional expression, and this has undefined behavior
3985 only on execution, so create a temporary if an lvalue is
3987 if (fallback
== fb_lvalue
)
3989 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
3990 lang_hooks
.mark_addressable (*expr_p
);
3995 ret
= gimplify_call_expr (expr_p
, pre_p
, fallback
!= fb_none
);
3996 /* C99 code may assign to an array in a structure returned
3997 from a function, and this has undefined behavior only on
3998 execution, so create a temporary if an lvalue is
4000 if (fallback
== fb_lvalue
)
4002 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
4003 lang_hooks
.mark_addressable (*expr_p
);
4011 ret
= gimplify_compound_expr (expr_p
, pre_p
, fallback
!= fb_none
);
4016 ret
= gimplify_modify_expr (expr_p
, pre_p
, post_p
,
4017 fallback
!= fb_none
);
4020 case TRUTH_ANDIF_EXPR
:
4021 case TRUTH_ORIF_EXPR
:
4022 ret
= gimplify_boolean_expr (expr_p
);
4025 case TRUTH_NOT_EXPR
:
4026 TREE_OPERAND (*expr_p
, 0)
4027 = gimple_boolify (TREE_OPERAND (*expr_p
, 0));
4028 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
4029 is_gimple_val
, fb_rvalue
);
4030 recalculate_side_effects (*expr_p
);
4034 ret
= gimplify_addr_expr (expr_p
, pre_p
, post_p
);
4038 ret
= gimplify_va_arg_expr (expr_p
, pre_p
, post_p
);
4043 if (IS_EMPTY_STMT (*expr_p
))
4049 if (VOID_TYPE_P (TREE_TYPE (*expr_p
))
4050 || fallback
== fb_none
)
4052 /* Just strip a conversion to void (or in void context) and
4054 *expr_p
= TREE_OPERAND (*expr_p
, 0);
4058 ret
= gimplify_conversion (expr_p
);
4059 if (ret
== GS_ERROR
)
4061 if (*expr_p
!= save_expr
)
4065 case FIX_TRUNC_EXPR
:
4067 case FIX_FLOOR_EXPR
:
4068 case FIX_ROUND_EXPR
:
4069 /* unary_expr: ... | '(' cast ')' val | ... */
4070 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
4071 is_gimple_val
, fb_rvalue
);
4072 recalculate_side_effects (*expr_p
);
4076 *expr_p
= fold_indirect_ref (*expr_p
);
4077 if (*expr_p
!= save_expr
)
4079 /* else fall through. */
4080 case ALIGN_INDIRECT_REF
:
4081 case MISALIGNED_INDIRECT_REF
:
4082 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
4083 is_gimple_reg
, fb_rvalue
);
4084 recalculate_side_effects (*expr_p
);
4087 /* Constants need not be gimplified. */
4097 /* If we require an lvalue, such as for ADDR_EXPR, retain the
4098 CONST_DECL node. Otherwise the decl is replaceable by its
4100 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
4101 if (fallback
& fb_lvalue
)
4104 *expr_p
= DECL_INITIAL (*expr_p
);
4108 ret
= gimplify_decl_expr (expr_p
);
4112 /* FIXME make this a decl. */
4117 ret
= gimplify_bind_expr (expr_p
, NULL
, pre_p
);
4121 ret
= gimplify_loop_expr (expr_p
, pre_p
);
4125 ret
= gimplify_switch_expr (expr_p
, pre_p
);
4129 ret
= gimplify_exit_expr (expr_p
);
4133 /* If the target is not LABEL, then it is a computed jump
4134 and the target needs to be gimplified. */
4135 if (TREE_CODE (GOTO_DESTINATION (*expr_p
)) != LABEL_DECL
)
4136 ret
= gimplify_expr (&GOTO_DESTINATION (*expr_p
), pre_p
,
4137 NULL
, is_gimple_val
, fb_rvalue
);
4142 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p
))
4143 == current_function_decl
);
4146 case CASE_LABEL_EXPR
:
4147 ret
= gimplify_case_label_expr (expr_p
);
4151 ret
= gimplify_return_expr (*expr_p
, pre_p
);
4155 /* Don't reduce this in place; let gimplify_init_constructor work its
4156 magic. Buf if we're just elaborating this for side effects, just
4157 gimplify any element that has side-effects. */
4158 if (fallback
== fb_none
)
4160 for (tmp
= CONSTRUCTOR_ELTS (*expr_p
); tmp
;
4161 tmp
= TREE_CHAIN (tmp
))
4162 if (TREE_SIDE_EFFECTS (TREE_VALUE (tmp
)))
4163 gimplify_expr (&TREE_VALUE (tmp
), pre_p
, post_p
,
4164 gimple_test_f
, fallback
);
4166 *expr_p
= NULL_TREE
;
4172 /* The following are special cases that are not handled by the
4173 original GIMPLE grammar. */
4175 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
4178 ret
= gimplify_save_expr (expr_p
, pre_p
, post_p
);
4183 enum gimplify_status r0
, r1
, r2
;
4185 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
4186 is_gimple_lvalue
, fb_either
);
4187 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
4188 is_gimple_val
, fb_rvalue
);
4189 r2
= gimplify_expr (&TREE_OPERAND (*expr_p
, 2), pre_p
, post_p
,
4190 is_gimple_val
, fb_rvalue
);
4191 recalculate_side_effects (*expr_p
);
4193 ret
= MIN (r0
, MIN (r1
, r2
));
4197 case NON_LVALUE_EXPR
:
4198 /* This should have been stripped above. */
4202 ret
= gimplify_asm_expr (expr_p
, pre_p
, post_p
);
4205 case TRY_FINALLY_EXPR
:
4206 case TRY_CATCH_EXPR
:
4207 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p
, 0));
4208 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p
, 1));
4212 case CLEANUP_POINT_EXPR
:
4213 ret
= gimplify_cleanup_point_expr (expr_p
, pre_p
);
4217 ret
= gimplify_target_expr (expr_p
, pre_p
, post_p
);
4221 gimplify_to_stmt_list (&CATCH_BODY (*expr_p
));
4225 case EH_FILTER_EXPR
:
4226 gimplify_to_stmt_list (&EH_FILTER_FAILURE (*expr_p
));
4232 enum gimplify_status r0
, r1
;
4233 r0
= gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p
), pre_p
, post_p
,
4234 is_gimple_val
, fb_rvalue
);
4235 r1
= gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p
), pre_p
, post_p
,
4236 is_gimple_val
, fb_rvalue
);
4242 /* We get here when taking the address of a label. We mark
4243 the label as "forced"; meaning it can never be removed and
4244 it is a potential target for any computed goto. */
4245 FORCED_LABEL (*expr_p
) = 1;
4249 case STATEMENT_LIST
:
4250 ret
= gimplify_statement_list (expr_p
);
4253 case WITH_SIZE_EXPR
:
4255 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
4256 post_p
== &internal_post
? NULL
: post_p
,
4257 gimple_test_f
, fallback
);
4258 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
4259 is_gimple_val
, fb_rvalue
);
4264 /* ??? If this is a local variable, and it has not been seen in any
4265 outer BIND_EXPR, then it's probably the result of a duplicate
4266 declaration, for which we've already issued an error. It would
4267 be really nice if the front end wouldn't leak these at all.
4268 Currently the only known culprit is C++ destructors, as seen
4269 in g++.old-deja/g++.jason/binding.C. */
4271 if (!TREE_STATIC (tmp
) && !DECL_EXTERNAL (tmp
)
4272 && decl_function_context (tmp
) == current_function_decl
4273 && !DECL_SEEN_IN_BIND_EXPR_P (tmp
))
4275 gcc_assert (errorcount
|| sorrycount
);
4284 /* If this is a local variable sized decl, it must be accessed
4285 indirectly. Perform that substitution. */
4286 if (DECL_HAS_VALUE_EXPR_P (tmp
))
4288 *expr_p
= unshare_expr (DECL_VALUE_EXPR (tmp
));
4297 /* Allow callbacks into the gimplifier during optimization. */
4302 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p
)))
4304 case tcc_comparison
:
4305 /* If this is a comparison of objects of aggregate type,
4306 handle it specially (by converting to a call to
4307 memcmp). It would be nice to only have to do this
4308 for variable-sized objects, but then we'd have to
4309 allow the same nest of reference nodes we allow for
4310 MODIFY_EXPR and that's too complex. */
4311 if (!AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p
, 1))))
4313 ret
= gimplify_variable_sized_compare (expr_p
);
4316 /* If *EXPR_P does not need to be special-cased, handle it
4317 according to its class. */
4319 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
4320 post_p
, is_gimple_val
, fb_rvalue
);
4326 enum gimplify_status r0
, r1
;
4328 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
4329 post_p
, is_gimple_val
, fb_rvalue
);
4330 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
,
4331 post_p
, is_gimple_val
, fb_rvalue
);
4337 case tcc_declaration
:
4340 goto dont_recalculate
;
4343 gcc_assert (TREE_CODE (*expr_p
) == TRUTH_AND_EXPR
4344 || TREE_CODE (*expr_p
) == TRUTH_OR_EXPR
4345 || TREE_CODE (*expr_p
) == TRUTH_XOR_EXPR
);
4349 recalculate_side_effects (*expr_p
);
4354 /* If we replaced *expr_p, gimplify again. */
4355 if (ret
== GS_OK
&& (*expr_p
== NULL
|| *expr_p
== save_expr
))
4358 while (ret
== GS_OK
);
4360 /* If we encountered an error_mark somewhere nested inside, either
4361 stub out the statement or propagate the error back out. */
4362 if (ret
== GS_ERROR
)
4369 /* This was only valid as a return value from the langhook, which
4370 we handled. Make sure it doesn't escape from any other context. */
4371 gcc_assert (ret
!= GS_UNHANDLED
);
4373 if (fallback
== fb_none
&& *expr_p
&& !is_gimple_stmt (*expr_p
))
4375 /* We aren't looking for a value, and we don't have a valid
4376 statement. If it doesn't have side-effects, throw it away. */
4377 if (!TREE_SIDE_EFFECTS (*expr_p
))
4379 else if (!TREE_THIS_VOLATILE (*expr_p
))
4381 /* This is probably a _REF that contains something nested that
4382 has side effects. Recurse through the operands to find it. */
4383 enum tree_code code
= TREE_CODE (*expr_p
);
4388 case REALPART_EXPR
: case IMAGPART_EXPR
:
4389 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
4390 gimple_test_f
, fallback
);
4393 case ARRAY_REF
: case ARRAY_RANGE_REF
:
4394 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
4395 gimple_test_f
, fallback
);
4396 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
4397 gimple_test_f
, fallback
);
4401 /* Anything else with side-effects must be converted to
4402 a valid statement before we get here. */
4408 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p
)))
4410 /* Historically, the compiler has treated a bare
4411 reference to a volatile lvalue as forcing a load. */
4412 tree tmp
= create_tmp_var (TREE_TYPE (*expr_p
), "vol");
4413 *expr_p
= build (MODIFY_EXPR
, TREE_TYPE (tmp
), tmp
, *expr_p
);
4416 /* We can't do anything useful with a volatile reference to
4417 incomplete type, so just throw it away. */
4421 /* If we are gimplifying at the statement level, we're done. Tack
4422 everything together and replace the original statement with the
4424 if (fallback
== fb_none
|| is_statement
)
4426 if (internal_pre
|| internal_post
)
4428 append_to_statement_list (*expr_p
, &internal_pre
);
4429 append_to_statement_list (internal_post
, &internal_pre
);
4430 annotate_all_with_locus (&internal_pre
, input_location
);
4431 *expr_p
= internal_pre
;
4435 else if (TREE_CODE (*expr_p
) == STATEMENT_LIST
)
4436 annotate_all_with_locus (expr_p
, input_location
);
4438 annotate_one_with_locus (*expr_p
, input_location
);
4442 /* Otherwise we're gimplifying a subexpression, so the resulting value is
4445 /* If it's sufficiently simple already, we're done. Unless we are
4446 handling some post-effects internally; if that's the case, we need to
4447 copy into a temp before adding the post-effects to the tree. */
4448 if (!internal_post
&& (*gimple_test_f
) (*expr_p
))
4451 /* Otherwise, we need to create a new temporary for the gimplified
4454 /* We can't return an lvalue if we have an internal postqueue. The
4455 object the lvalue refers to would (probably) be modified by the
4456 postqueue; we need to copy the value out first, which means an
4458 if ((fallback
& fb_lvalue
) && !internal_post
4459 && is_gimple_addressable (*expr_p
))
4461 /* An lvalue will do. Take the address of the expression, store it
4462 in a temporary, and replace the expression with an INDIRECT_REF of
4464 tmp
= build_fold_addr_expr (*expr_p
);
4465 gimplify_expr (&tmp
, pre_p
, post_p
, is_gimple_reg
, fb_rvalue
);
4466 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (tmp
)), tmp
);
4468 else if ((fallback
& fb_rvalue
) && is_gimple_formal_tmp_rhs (*expr_p
))
4470 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p
)));
4472 /* An rvalue will do. Assign the gimplified expression into a new
4473 temporary TMP and replace the original expression with TMP. */
4475 if (internal_post
|| (fallback
& fb_lvalue
))
4476 /* The postqueue might change the value of the expression between
4477 the initialization and use of the temporary, so we can't use a
4478 formal temp. FIXME do we care? */
4479 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
4481 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
4483 if (TREE_CODE (*expr_p
) != SSA_NAME
)
4484 DECL_GIMPLE_FORMAL_TEMP_P (*expr_p
) = 1;
4488 #ifdef ENABLE_CHECKING
4489 if (!(fallback
& fb_mayfail
))
4491 fprintf (stderr
, "gimplification failed:\n");
4492 print_generic_expr (stderr
, *expr_p
, 0);
4493 debug_tree (*expr_p
);
4494 internal_error ("gimplification failed");
4497 gcc_assert (fallback
& fb_mayfail
);
4498 /* If this is an asm statement, and the user asked for the
4499 impossible, don't die. Fail and let gimplify_asm_expr
4505 /* Make sure the temporary matches our predicate. */
4506 gcc_assert ((*gimple_test_f
) (*expr_p
));
4510 annotate_all_with_locus (&internal_post
, input_location
);
4511 append_to_statement_list (internal_post
, pre_p
);
4515 input_location
= saved_location
;
4519 /* Look through TYPE for variable-sized objects and gimplify each such
4520 size that we find. Add to LIST_P any statements generated. */
4523 gimplify_type_sizes (tree type
, tree
*list_p
)
4527 if (type
== NULL
|| type
== error_mark_node
)
4530 /* We first do the main variant, then copy into any other variants. */
4531 type
= TYPE_MAIN_VARIANT (type
);
4533 /* Avoid infinite recursion. */
4534 if (TYPE_SIZES_GIMPLIFIED (type
))
4537 TYPE_SIZES_GIMPLIFIED (type
) = 1;
4539 switch (TREE_CODE (type
))
4546 gimplify_one_sizepos (&TYPE_MIN_VALUE (type
), list_p
);
4547 gimplify_one_sizepos (&TYPE_MAX_VALUE (type
), list_p
);
4549 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
4551 TYPE_MIN_VALUE (t
) = TYPE_MIN_VALUE (type
);
4552 TYPE_MAX_VALUE (t
) = TYPE_MAX_VALUE (type
);
4557 /* These types may not have declarations, so handle them here. */
4558 gimplify_type_sizes (TREE_TYPE (type
), list_p
);
4559 gimplify_type_sizes (TYPE_DOMAIN (type
), list_p
);
4564 case QUAL_UNION_TYPE
:
4565 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
4566 if (TREE_CODE (field
) == FIELD_DECL
)
4568 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field
), list_p
);
4569 gimplify_type_sizes (TREE_TYPE (field
), list_p
);
4574 case REFERENCE_TYPE
:
4575 gimplify_type_sizes (TREE_TYPE (type
), list_p
);
4582 gimplify_one_sizepos (&TYPE_SIZE (type
), list_p
);
4583 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type
), list_p
);
4585 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
4587 TYPE_SIZE (t
) = TYPE_SIZE (type
);
4588 TYPE_SIZE_UNIT (t
) = TYPE_SIZE_UNIT (type
);
4589 TYPE_SIZES_GIMPLIFIED (t
) = 1;
4593 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
4594 a size or position, has had all of its SAVE_EXPRs evaluated.
4595 We add any required statements to STMT_P. */
4598 gimplify_one_sizepos (tree
*expr_p
, tree
*stmt_p
)
4600 /* We don't do anything if the value isn't there, is constant, or contains
4601 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
4602 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
4603 will want to replace it with a new variable, but that will cause problems
4604 if this type is from outside the function. It's OK to have that here. */
4605 if (*expr_p
== NULL_TREE
|| TREE_CONSTANT (*expr_p
)
4606 || TREE_CODE (*expr_p
) == VAR_DECL
4607 || CONTAINS_PLACEHOLDER_P (*expr_p
))
4610 *expr_p
= unshare_expr (*expr_p
);
4611 gimplify_expr (expr_p
, stmt_p
, NULL
, is_gimple_val
, fb_rvalue
);
4614 #ifdef ENABLE_CHECKING
4615 /* Compare types A and B for a "close enough" match. */
4618 cpt_same_type (tree a
, tree b
)
4620 if (lang_hooks
.types_compatible_p (a
, b
))
4623 /* ??? The C++ FE decomposes METHOD_TYPES to FUNCTION_TYPES and doesn't
4624 link them together. This routine is intended to catch type errors
4625 that will affect the optimizers, and the optimizers don't add new
4626 dereferences of function pointers, so ignore it. */
4627 if ((TREE_CODE (a
) == FUNCTION_TYPE
|| TREE_CODE (a
) == METHOD_TYPE
)
4628 && (TREE_CODE (b
) == FUNCTION_TYPE
|| TREE_CODE (b
) == METHOD_TYPE
))
4631 /* ??? The C FE pushes type qualifiers after the fact into the type of
4632 the element from the type of the array. See build_unary_op's handling
4633 of ADDR_EXPR. This seems wrong -- if we were going to do this, we
4634 should have done it when creating the variable in the first place.
4635 Alternately, why aren't the two array types made variants? */
4636 if (TREE_CODE (a
) == ARRAY_TYPE
&& TREE_CODE (b
) == ARRAY_TYPE
)
4637 return cpt_same_type (TREE_TYPE (a
), TREE_TYPE (b
));
4639 /* And because of those, we have to recurse down through pointers. */
4640 if (POINTER_TYPE_P (a
) && POINTER_TYPE_P (b
))
4641 return cpt_same_type (TREE_TYPE (a
), TREE_TYPE (b
));
4646 /* Check for some cases of the front end missing cast expressions.
4647 The type of a dereference should correspond to the pointer type;
4648 similarly the type of an address should match its object. */
4651 check_pointer_types_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
4652 void *data ATTRIBUTE_UNUSED
)
4655 tree ptype
, otype
, dtype
;
4657 switch (TREE_CODE (t
))
4661 otype
= TREE_TYPE (t
);
4662 ptype
= TREE_TYPE (TREE_OPERAND (t
, 0));
4663 dtype
= TREE_TYPE (ptype
);
4664 gcc_assert (cpt_same_type (otype
, dtype
));
4668 ptype
= TREE_TYPE (t
);
4669 otype
= TREE_TYPE (TREE_OPERAND (t
, 0));
4670 dtype
= TREE_TYPE (ptype
);
4671 if (!cpt_same_type (otype
, dtype
))
4673 /* &array is allowed to produce a pointer to the element, rather than
4674 a pointer to the array type. We must allow this in order to
4675 properly represent assigning the address of an array in C into
4676 pointer to the element type. */
4677 gcc_assert (TREE_CODE (otype
) == ARRAY_TYPE
4678 && POINTER_TYPE_P (ptype
)
4679 && cpt_same_type (TREE_TYPE (otype
), dtype
));
4693 /* Gimplify the body of statements pointed by BODY_P. FNDECL is the
4694 function decl containing BODY. */
4697 gimplify_body (tree
*body_p
, tree fndecl
, bool do_parms
)
4699 location_t saved_location
= input_location
;
4700 tree body
, parm_stmts
;
4702 timevar_push (TV_TREE_GIMPLIFY
);
4703 push_gimplify_context ();
4705 /* Unshare most shared trees in the body and in that of any nested functions.
4706 It would seem we don't have to do this for nested functions because
4707 they are supposed to be output and then the outer function gimplified
4708 first, but the g++ front end doesn't always do it that way. */
4709 unshare_body (body_p
, fndecl
);
4710 unvisit_body (body_p
, fndecl
);
4712 /* Make sure input_location isn't set to something wierd. */
4713 input_location
= DECL_SOURCE_LOCATION (fndecl
);
4715 /* Resolve callee-copies. This has to be done before processing
4716 the body so that DECL_VALUE_EXPR gets processed correctly. */
4717 parm_stmts
= do_parms
? gimplify_parameters () : NULL
;
4719 /* Gimplify the function's body. */
4720 gimplify_stmt (body_p
);
4724 body
= alloc_stmt_list ();
4725 else if (TREE_CODE (body
) == STATEMENT_LIST
)
4727 tree t
= expr_only (*body_p
);
4732 /* If there isn't an outer BIND_EXPR, add one. */
4733 if (TREE_CODE (body
) != BIND_EXPR
)
4735 tree b
= build (BIND_EXPR
, void_type_node
, NULL_TREE
,
4736 NULL_TREE
, NULL_TREE
);
4737 TREE_SIDE_EFFECTS (b
) = 1;
4738 append_to_statement_list_force (body
, &BIND_EXPR_BODY (b
));
4742 /* If we had callee-copies statements, insert them at the beginning
4746 append_to_statement_list_force (BIND_EXPR_BODY (body
), &parm_stmts
);
4747 BIND_EXPR_BODY (body
) = parm_stmts
;
4750 /* Unshare again, in case gimplification was sloppy. */
4751 unshare_all_trees (body
);
4755 pop_gimplify_context (body
);
4757 #ifdef ENABLE_CHECKING
4758 walk_tree (body_p
, check_pointer_types_r
, NULL
, NULL
);
4761 timevar_pop (TV_TREE_GIMPLIFY
);
4762 input_location
= saved_location
;
4765 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
4766 node for the function we want to gimplify. */
4769 gimplify_function_tree (tree fndecl
)
4771 tree oldfn
, parm
, ret
;
4773 oldfn
= current_function_decl
;
4774 current_function_decl
= fndecl
;
4775 cfun
= DECL_STRUCT_FUNCTION (fndecl
);
4777 allocate_struct_function (fndecl
);
4779 for (parm
= DECL_ARGUMENTS (fndecl
); parm
; parm
= TREE_CHAIN (parm
))
4781 /* Preliminarily mark non-addressed complex variables as eligible
4782 for promotion to gimple registers. We'll transform their uses
4784 if (TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
4785 && !TREE_THIS_VOLATILE (parm
)
4786 && !needs_to_live_in_memory (parm
))
4787 DECL_COMPLEX_GIMPLE_REG_P (parm
) = 1;
4790 ret
= DECL_RESULT (fndecl
);
4791 if (TREE_CODE (TREE_TYPE (ret
)) == COMPLEX_TYPE
4792 && !needs_to_live_in_memory (ret
))
4793 DECL_COMPLEX_GIMPLE_REG_P (ret
) = 1;
4795 gimplify_body (&DECL_SAVED_TREE (fndecl
), fndecl
, true);
4797 /* If we're instrumenting function entry/exit, then prepend the call to
4798 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
4799 catch the exit hook. */
4800 /* ??? Add some way to ignore exceptions for this TFE. */
4801 if (flag_instrument_function_entry_exit
4802 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl
))
4806 tf
= build (TRY_FINALLY_EXPR
, void_type_node
, NULL
, NULL
);
4807 TREE_SIDE_EFFECTS (tf
) = 1;
4808 x
= DECL_SAVED_TREE (fndecl
);
4809 append_to_statement_list (x
, &TREE_OPERAND (tf
, 0));
4810 x
= implicit_built_in_decls
[BUILT_IN_PROFILE_FUNC_EXIT
];
4811 x
= build_function_call_expr (x
, NULL
);
4812 append_to_statement_list (x
, &TREE_OPERAND (tf
, 1));
4814 bind
= build (BIND_EXPR
, void_type_node
, NULL
, NULL
, NULL
);
4815 TREE_SIDE_EFFECTS (bind
) = 1;
4816 x
= implicit_built_in_decls
[BUILT_IN_PROFILE_FUNC_ENTER
];
4817 x
= build_function_call_expr (x
, NULL
);
4818 append_to_statement_list (x
, &BIND_EXPR_BODY (bind
));
4819 append_to_statement_list (tf
, &BIND_EXPR_BODY (bind
));
4821 DECL_SAVED_TREE (fndecl
) = bind
;
4824 current_function_decl
= oldfn
;
4825 cfun
= oldfn
? DECL_STRUCT_FUNCTION (oldfn
) : NULL
;
4829 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
4830 force the result to be either ssa_name or an invariant, otherwise
4831 just force it to be a rhs expression. If VAR is not NULL, make the
4832 base variable of the final destination be VAR if suitable. */
4835 force_gimple_operand (tree expr
, tree
*stmts
, bool simple
, tree var
)
4838 enum gimplify_status ret
;
4839 gimple_predicate gimple_test_f
;
4843 if (is_gimple_val (expr
))
4846 gimple_test_f
= simple
? is_gimple_val
: is_gimple_reg_rhs
;
4848 push_gimplify_context ();
4849 gimplify_ctxp
->into_ssa
= in_ssa_p
;
4852 expr
= build (MODIFY_EXPR
, TREE_TYPE (var
), var
, expr
);
4854 ret
= gimplify_expr (&expr
, stmts
, NULL
,
4855 gimple_test_f
, fb_rvalue
);
4856 gcc_assert (ret
!= GS_ERROR
);
4858 if (referenced_vars
)
4860 for (t
= gimplify_ctxp
->temps
; t
; t
= TREE_CHAIN (t
))
4861 add_referenced_tmp_var (t
);
4864 pop_gimplify_context (NULL
);
4869 /* Invokes force_gimple_operand for EXPR with parameters SIMPLE_P and VAR. If
4870 some statements are produced, emits them before BSI. */
4873 force_gimple_operand_bsi (block_stmt_iterator
*bsi
, tree expr
,
4874 bool simple_p
, tree var
)
4878 expr
= force_gimple_operand (expr
, &stmts
, simple_p
, var
);
4880 bsi_insert_before (bsi
, stmts
, BSI_SAME_STMT
);
4885 #include "gt-gimplify.h"