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 to 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 if (TREE_CODE (t
) == VAR_DECL
)
864 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
866 /* Preliminarily mark non-addressed complex variables as eligible
867 for promotion to gimple registers. We'll transform their uses
869 if (TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
870 && !TREE_THIS_VOLATILE (t
)
871 && (TREE_CODE (t
) == VAR_DECL
&& !DECL_HARD_REGISTER (t
))
872 && !needs_to_live_in_memory (t
))
873 DECL_COMPLEX_GIMPLE_REG_P (t
) = 1;
876 gimple_push_bind_expr (bind_expr
);
877 gimplify_ctxp
->save_stack
= false;
879 gimplify_to_stmt_list (&BIND_EXPR_BODY (bind_expr
));
881 if (gimplify_ctxp
->save_stack
)
883 tree stack_save
, stack_restore
;
885 /* Save stack on entry and restore it on exit. Add a try_finally
886 block to achieve this. Note that mudflap depends on the
887 format of the emitted code: see mx_register_decls(). */
888 build_stack_save_restore (&stack_save
, &stack_restore
);
890 t
= build (TRY_FINALLY_EXPR
, void_type_node
,
891 BIND_EXPR_BODY (bind_expr
), NULL_TREE
);
892 append_to_statement_list (stack_restore
, &TREE_OPERAND (t
, 1));
894 BIND_EXPR_BODY (bind_expr
) = NULL_TREE
;
895 append_to_statement_list (stack_save
, &BIND_EXPR_BODY (bind_expr
));
896 append_to_statement_list (t
, &BIND_EXPR_BODY (bind_expr
));
899 gimplify_ctxp
->save_stack
= old_save_stack
;
900 gimple_pop_bind_expr ();
905 append_to_statement_list (bind_expr
, pre_p
);
912 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
913 GIMPLE value, it is assigned to a new temporary and the statement is
914 re-written to return the temporary.
916 PRE_P points to the list where side effects that must happen before
917 STMT should be stored. */
919 static enum gimplify_status
920 gimplify_return_expr (tree stmt
, tree
*pre_p
)
922 tree ret_expr
= TREE_OPERAND (stmt
, 0);
923 tree result_decl
, result
;
925 if (!ret_expr
|| TREE_CODE (ret_expr
) == RESULT_DECL
926 || ret_expr
== error_mark_node
)
929 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
930 result_decl
= NULL_TREE
;
933 result_decl
= TREE_OPERAND (ret_expr
, 0);
934 if (TREE_CODE (result_decl
) == INDIRECT_REF
)
935 /* See through a return by reference. */
936 result_decl
= TREE_OPERAND (result_decl
, 0);
938 gcc_assert ((TREE_CODE (ret_expr
) == MODIFY_EXPR
939 || TREE_CODE (ret_expr
) == INIT_EXPR
)
940 && TREE_CODE (result_decl
) == RESULT_DECL
);
943 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
944 Recall that aggregate_value_p is FALSE for any aggregate type that is
945 returned in registers. If we're returning values in registers, then
946 we don't want to extend the lifetime of the RESULT_DECL, particularly
947 across another call. In addition, for those aggregates for which
948 hard_function_value generates a PARALLEL, we'll die during normal
949 expansion of structure assignments; there's special code in expand_return
950 to handle this case that does not exist in expand_expr. */
952 || aggregate_value_p (result_decl
, TREE_TYPE (current_function_decl
)))
953 result
= result_decl
;
954 else if (gimplify_ctxp
->return_temp
)
955 result
= gimplify_ctxp
->return_temp
;
958 result
= create_tmp_var (TREE_TYPE (result_decl
), NULL
);
960 /* ??? With complex control flow (usually involving abnormal edges),
961 we can wind up warning about an uninitialized value for this. Due
962 to how this variable is constructed and initialized, this is never
963 true. Give up and never warn. */
964 TREE_NO_WARNING (result
) = 1;
966 gimplify_ctxp
->return_temp
= result
;
969 /* Smash the lhs of the MODIFY_EXPR to the temporary we plan to use.
970 Then gimplify the whole thing. */
971 if (result
!= result_decl
)
972 TREE_OPERAND (ret_expr
, 0) = result
;
974 gimplify_and_add (TREE_OPERAND (stmt
, 0), pre_p
);
976 /* If we didn't use a temporary, then the result is just the result_decl.
977 Otherwise we need a simple copy. This should already be gimple. */
978 if (result
== result_decl
)
981 ret_expr
= build (MODIFY_EXPR
, TREE_TYPE (result
), result_decl
, result
);
982 TREE_OPERAND (stmt
, 0) = ret_expr
;
987 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
988 and initialization explicit. */
990 static enum gimplify_status
991 gimplify_decl_expr (tree
*stmt_p
)
994 tree decl
= DECL_EXPR_DECL (stmt
);
998 if (TREE_TYPE (decl
) == error_mark_node
)
1001 if ((TREE_CODE (decl
) == TYPE_DECL
1002 || TREE_CODE (decl
) == VAR_DECL
)
1003 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl
)))
1004 gimplify_type_sizes (TREE_TYPE (decl
), stmt_p
);
1006 if (TREE_CODE (decl
) == VAR_DECL
&& !DECL_EXTERNAL (decl
))
1008 tree init
= DECL_INITIAL (decl
);
1010 if (!TREE_CONSTANT (DECL_SIZE (decl
)))
1012 /* This is a variable-sized decl. Simplify its size and mark it
1013 for deferred expansion. Note that mudflap depends on the format
1014 of the emitted code: see mx_register_decls(). */
1015 tree t
, args
, addr
, ptr_type
;
1017 gimplify_one_sizepos (&DECL_SIZE (decl
), stmt_p
);
1018 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl
), stmt_p
);
1020 /* All occurrences of this decl in final gimplified code will be
1021 replaced by indirection. Setting DECL_VALUE_EXPR does two
1022 things: First, it lets the rest of the gimplifier know what
1023 replacement to use. Second, it lets the debug info know
1024 where to find the value. */
1025 ptr_type
= build_pointer_type (TREE_TYPE (decl
));
1026 addr
= create_tmp_var (ptr_type
, get_name (decl
));
1027 DECL_IGNORED_P (addr
) = 0;
1028 t
= build_fold_indirect_ref (addr
);
1029 SET_DECL_VALUE_EXPR (decl
, t
);
1030 DECL_HAS_VALUE_EXPR_P (decl
) = 1;
1032 args
= tree_cons (NULL
, DECL_SIZE_UNIT (decl
), NULL
);
1033 t
= built_in_decls
[BUILT_IN_ALLOCA
];
1034 t
= build_function_call_expr (t
, args
);
1035 t
= fold_convert (ptr_type
, t
);
1036 t
= build2 (MODIFY_EXPR
, void_type_node
, addr
, t
);
1038 gimplify_and_add (t
, stmt_p
);
1040 /* Indicate that we need to restore the stack level when the
1041 enclosing BIND_EXPR is exited. */
1042 gimplify_ctxp
->save_stack
= true;
1045 if (init
&& init
!= error_mark_node
)
1047 if (!TREE_STATIC (decl
))
1049 DECL_INITIAL (decl
) = NULL_TREE
;
1050 init
= build (MODIFY_EXPR
, void_type_node
, decl
, init
);
1051 gimplify_and_add (init
, stmt_p
);
1054 /* We must still examine initializers for static variables
1055 as they may contain a label address. */
1056 walk_tree (&init
, force_labels_r
, NULL
, NULL
);
1059 /* This decl isn't mentioned in the enclosing block, so add it to the
1060 list of temps. FIXME it seems a bit of a kludge to say that
1061 anonymous artificial vars aren't pushed, but everything else is. */
1062 if (DECL_ARTIFICIAL (decl
) && DECL_NAME (decl
) == NULL_TREE
)
1063 gimple_add_tmp_var (decl
);
1069 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1070 and replacing the LOOP_EXPR with goto, but if the loop contains an
1071 EXIT_EXPR, we need to append a label for it to jump to. */
1073 static enum gimplify_status
1074 gimplify_loop_expr (tree
*expr_p
, tree
*pre_p
)
1076 tree saved_label
= gimplify_ctxp
->exit_label
;
1077 tree start_label
= build1 (LABEL_EXPR
, void_type_node
, NULL_TREE
);
1078 tree jump_stmt
= build_and_jump (&LABEL_EXPR_LABEL (start_label
));
1080 append_to_statement_list (start_label
, pre_p
);
1082 gimplify_ctxp
->exit_label
= NULL_TREE
;
1084 gimplify_and_add (LOOP_EXPR_BODY (*expr_p
), pre_p
);
1086 if (gimplify_ctxp
->exit_label
)
1088 append_to_statement_list (jump_stmt
, pre_p
);
1089 *expr_p
= build1 (LABEL_EXPR
, void_type_node
, gimplify_ctxp
->exit_label
);
1092 *expr_p
= jump_stmt
;
1094 gimplify_ctxp
->exit_label
= saved_label
;
1099 /* Compare two case labels. Because the front end should already have
1100 made sure that case ranges do not overlap, it is enough to only compare
1101 the CASE_LOW values of each case label. */
1104 compare_case_labels (const void *p1
, const void *p2
)
1106 tree case1
= *(tree
*)p1
;
1107 tree case2
= *(tree
*)p2
;
1109 return tree_int_cst_compare (CASE_LOW (case1
), CASE_LOW (case2
));
1112 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1115 sort_case_labels (tree label_vec
)
1117 size_t len
= TREE_VEC_LENGTH (label_vec
);
1118 tree default_case
= TREE_VEC_ELT (label_vec
, len
- 1);
1120 if (CASE_LOW (default_case
))
1124 /* The last label in the vector should be the default case
1126 for (i
= 0; i
< len
; ++i
)
1128 tree t
= TREE_VEC_ELT (label_vec
, i
);
1132 TREE_VEC_ELT (label_vec
, i
) = TREE_VEC_ELT (label_vec
, len
- 1);
1133 TREE_VEC_ELT (label_vec
, len
- 1) = default_case
;
1139 qsort (&TREE_VEC_ELT (label_vec
, 0), len
- 1, sizeof (tree
),
1140 compare_case_labels
);
1143 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1146 static enum gimplify_status
1147 gimplify_switch_expr (tree
*expr_p
, tree
*pre_p
)
1149 tree switch_expr
= *expr_p
;
1150 enum gimplify_status ret
;
1152 ret
= gimplify_expr (&SWITCH_COND (switch_expr
), pre_p
, NULL
,
1153 is_gimple_val
, fb_rvalue
);
1155 if (SWITCH_BODY (switch_expr
))
1157 VEC(tree
,heap
) *labels
, *saved_labels
;
1158 tree label_vec
, default_case
= NULL_TREE
;
1161 /* If someone can be bothered to fill in the labels, they can
1162 be bothered to null out the body too. */
1163 gcc_assert (!SWITCH_LABELS (switch_expr
));
1165 saved_labels
= gimplify_ctxp
->case_labels
;
1166 gimplify_ctxp
->case_labels
= VEC_alloc (tree
, heap
, 8);
1168 gimplify_to_stmt_list (&SWITCH_BODY (switch_expr
));
1170 labels
= gimplify_ctxp
->case_labels
;
1171 gimplify_ctxp
->case_labels
= saved_labels
;
1173 len
= VEC_length (tree
, labels
);
1175 for (i
= 0; i
< len
; ++i
)
1177 tree t
= VEC_index (tree
, labels
, i
);
1180 /* The default case must be the last label in the list. */
1182 VEC_replace (tree
, labels
, i
, VEC_index (tree
, labels
, len
- 1));
1188 label_vec
= make_tree_vec (len
+ 1);
1189 SWITCH_LABELS (*expr_p
) = label_vec
;
1190 append_to_statement_list (switch_expr
, pre_p
);
1194 /* If the switch has no default label, add one, so that we jump
1195 around the switch body. */
1196 default_case
= build (CASE_LABEL_EXPR
, void_type_node
, NULL_TREE
,
1197 NULL_TREE
, create_artificial_label ());
1198 append_to_statement_list (SWITCH_BODY (switch_expr
), pre_p
);
1199 *expr_p
= build (LABEL_EXPR
, void_type_node
,
1200 CASE_LABEL (default_case
));
1203 *expr_p
= SWITCH_BODY (switch_expr
);
1205 for (i
= 0; i
< len
; ++i
)
1206 TREE_VEC_ELT (label_vec
, i
) = VEC_index (tree
, labels
, i
);
1207 TREE_VEC_ELT (label_vec
, len
) = default_case
;
1209 VEC_free (tree
, heap
, labels
);
1211 sort_case_labels (label_vec
);
1213 SWITCH_BODY (switch_expr
) = NULL
;
1216 gcc_assert (SWITCH_LABELS (switch_expr
));
1221 static enum gimplify_status
1222 gimplify_case_label_expr (tree
*expr_p
)
1224 tree expr
= *expr_p
;
1226 gcc_assert (gimplify_ctxp
->case_labels
);
1227 VEC_safe_push (tree
, heap
, gimplify_ctxp
->case_labels
, expr
);
1228 *expr_p
= build (LABEL_EXPR
, void_type_node
, CASE_LABEL (expr
));
1232 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1236 build_and_jump (tree
*label_p
)
1238 if (label_p
== NULL
)
1239 /* If there's nowhere to jump, just fall through. */
1242 if (*label_p
== NULL_TREE
)
1244 tree label
= create_artificial_label ();
1248 return build1 (GOTO_EXPR
, void_type_node
, *label_p
);
1251 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1252 This also involves building a label to jump to and communicating it to
1253 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1255 static enum gimplify_status
1256 gimplify_exit_expr (tree
*expr_p
)
1258 tree cond
= TREE_OPERAND (*expr_p
, 0);
1261 expr
= build_and_jump (&gimplify_ctxp
->exit_label
);
1262 expr
= build (COND_EXPR
, void_type_node
, cond
, expr
, NULL_TREE
);
1268 /* A helper function to be called via walk_tree. Mark all labels under *TP
1269 as being forced. To be called for DECL_INITIAL of static variables. */
1272 force_labels_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
1276 if (TREE_CODE (*tp
) == LABEL_DECL
)
1277 FORCED_LABEL (*tp
) = 1;
1282 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1283 different from its canonical type, wrap the whole thing inside a
1284 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1287 The canonical type of a COMPONENT_REF is the type of the field being
1288 referenced--unless the field is a bit-field which can be read directly
1289 in a smaller mode, in which case the canonical type is the
1290 sign-appropriate type corresponding to that mode. */
1293 canonicalize_component_ref (tree
*expr_p
)
1295 tree expr
= *expr_p
;
1298 gcc_assert (TREE_CODE (expr
) == COMPONENT_REF
);
1300 if (INTEGRAL_TYPE_P (TREE_TYPE (expr
)))
1301 type
= TREE_TYPE (get_unwidened (expr
, NULL_TREE
));
1303 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
1305 if (TREE_TYPE (expr
) != type
)
1307 tree old_type
= TREE_TYPE (expr
);
1309 /* Set the type of the COMPONENT_REF to the underlying type. */
1310 TREE_TYPE (expr
) = type
;
1312 /* And wrap the whole thing inside a NOP_EXPR. */
1313 expr
= build1 (NOP_EXPR
, old_type
, expr
);
1319 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1320 to foo, embed that change in the ADDR_EXPR by converting
1325 where L is the lower bound. For simplicity, only do this for constant
1329 canonicalize_addr_expr (tree
*expr_p
)
1331 tree expr
= *expr_p
;
1332 tree ctype
= TREE_TYPE (expr
);
1333 tree addr_expr
= TREE_OPERAND (expr
, 0);
1334 tree atype
= TREE_TYPE (addr_expr
);
1335 tree dctype
, datype
, ddatype
, otype
, obj_expr
;
1337 /* Both cast and addr_expr types should be pointers. */
1338 if (!POINTER_TYPE_P (ctype
) || !POINTER_TYPE_P (atype
))
1341 /* The addr_expr type should be a pointer to an array. */
1342 datype
= TREE_TYPE (atype
);
1343 if (TREE_CODE (datype
) != ARRAY_TYPE
)
1346 /* Both cast and addr_expr types should address the same object type. */
1347 dctype
= TREE_TYPE (ctype
);
1348 ddatype
= TREE_TYPE (datype
);
1349 if (!lang_hooks
.types_compatible_p (ddatype
, dctype
))
1352 /* The addr_expr and the object type should match. */
1353 obj_expr
= TREE_OPERAND (addr_expr
, 0);
1354 otype
= TREE_TYPE (obj_expr
);
1355 if (!lang_hooks
.types_compatible_p (otype
, datype
))
1358 /* The lower bound and element sizes must be constant. */
1359 if (!TYPE_SIZE_UNIT (dctype
)
1360 || TREE_CODE (TYPE_SIZE_UNIT (dctype
)) != INTEGER_CST
1361 || !TYPE_DOMAIN (datype
) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))
1362 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))) != INTEGER_CST
)
1365 /* All checks succeeded. Build a new node to merge the cast. */
1366 *expr_p
= build4 (ARRAY_REF
, dctype
, obj_expr
,
1367 TYPE_MIN_VALUE (TYPE_DOMAIN (datype
)),
1368 TYPE_MIN_VALUE (TYPE_DOMAIN (datype
)),
1369 size_binop (EXACT_DIV_EXPR
, TYPE_SIZE_UNIT (dctype
),
1370 size_int (TYPE_ALIGN_UNIT (dctype
))));
1371 *expr_p
= build1 (ADDR_EXPR
, ctype
, *expr_p
);
1374 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1375 underneath as appropriate. */
1377 static enum gimplify_status
1378 gimplify_conversion (tree
*expr_p
)
1380 gcc_assert (TREE_CODE (*expr_p
) == NOP_EXPR
1381 || TREE_CODE (*expr_p
) == CONVERT_EXPR
);
1383 /* Then strip away all but the outermost conversion. */
1384 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p
, 0));
1386 /* And remove the outermost conversion if it's useless. */
1387 if (tree_ssa_useless_type_conversion (*expr_p
))
1388 *expr_p
= TREE_OPERAND (*expr_p
, 0);
1390 /* If we still have a conversion at the toplevel,
1391 then canonicalize some constructs. */
1392 if (TREE_CODE (*expr_p
) == NOP_EXPR
|| TREE_CODE (*expr_p
) == CONVERT_EXPR
)
1394 tree sub
= TREE_OPERAND (*expr_p
, 0);
1396 /* If a NOP conversion is changing the type of a COMPONENT_REF
1397 expression, then canonicalize its type now in order to expose more
1398 redundant conversions. */
1399 if (TREE_CODE (sub
) == COMPONENT_REF
)
1400 canonicalize_component_ref (&TREE_OPERAND (*expr_p
, 0));
1402 /* If a NOP conversion is changing a pointer to array of foo
1403 to a pointer to foo, embed that change in the ADDR_EXPR. */
1404 else if (TREE_CODE (sub
) == ADDR_EXPR
)
1405 canonicalize_addr_expr (expr_p
);
1411 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1412 node pointed to by EXPR_P.
1415 : min_lval '[' val ']'
1417 | compound_lval '[' val ']'
1418 | compound_lval '.' ID
1420 This is not part of the original SIMPLE definition, which separates
1421 array and member references, but it seems reasonable to handle them
1422 together. Also, this way we don't run into problems with union
1423 aliasing; gcc requires that for accesses through a union to alias, the
1424 union reference must be explicit, which was not always the case when we
1425 were splitting up array and member refs.
1427 PRE_P points to the list where side effects that must happen before
1428 *EXPR_P should be stored.
1430 POST_P points to the list where side effects that must happen after
1431 *EXPR_P should be stored. */
1433 static enum gimplify_status
1434 gimplify_compound_lval (tree
*expr_p
, tree
*pre_p
,
1435 tree
*post_p
, fallback_t fallback
)
1438 VEC(tree
,heap
) *stack
;
1439 enum gimplify_status ret
= GS_OK
, tret
;
1442 /* Create a stack of the subexpressions so later we can walk them in
1443 order from inner to outer. */
1444 stack
= VEC_alloc (tree
, heap
, 10);
1446 /* We can handle anything that get_inner_reference can deal with. */
1447 for (p
= expr_p
; ; p
= &TREE_OPERAND (*p
, 0))
1449 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1450 if (TREE_CODE (*p
) == INDIRECT_REF
)
1451 *p
= fold_indirect_ref (*p
);
1452 if (!handled_component_p (*p
))
1454 VEC_safe_push (tree
, heap
, stack
, *p
);
1457 gcc_assert (VEC_length (tree
, stack
));
1459 /* Now STACK is a stack of pointers to all the refs we've walked through
1460 and P points to the innermost expression.
1462 Java requires that we elaborated nodes in source order. That
1463 means we must gimplify the inner expression followed by each of
1464 the indices, in order. But we can't gimplify the inner
1465 expression until we deal with any variable bounds, sizes, or
1466 positions in order to deal with PLACEHOLDER_EXPRs.
1468 So we do this in three steps. First we deal with the annotations
1469 for any variables in the components, then we gimplify the base,
1470 then we gimplify any indices, from left to right. */
1471 for (i
= VEC_length (tree
, stack
) - 1; i
>= 0; i
--)
1473 tree t
= VEC_index (tree
, stack
, i
);
1475 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
1477 /* Gimplify the low bound and element type size and put them into
1478 the ARRAY_REF. If these values are set, they have already been
1480 if (!TREE_OPERAND (t
, 2))
1482 tree low
= unshare_expr (array_ref_low_bound (t
));
1483 if (!is_gimple_min_invariant (low
))
1485 TREE_OPERAND (t
, 2) = low
;
1486 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
1487 is_gimple_formal_tmp_reg
, fb_rvalue
);
1488 ret
= MIN (ret
, tret
);
1492 if (!TREE_OPERAND (t
, 3))
1494 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (t
, 0)));
1495 tree elmt_size
= unshare_expr (array_ref_element_size (t
));
1496 tree factor
= size_int (TYPE_ALIGN_UNIT (elmt_type
));
1498 /* Divide the element size by the alignment of the element
1500 elmt_size
= size_binop (EXACT_DIV_EXPR
, elmt_size
, factor
);
1502 if (!is_gimple_min_invariant (elmt_size
))
1504 TREE_OPERAND (t
, 3) = elmt_size
;
1505 tret
= gimplify_expr (&TREE_OPERAND (t
, 3), pre_p
, post_p
,
1506 is_gimple_formal_tmp_reg
, fb_rvalue
);
1507 ret
= MIN (ret
, tret
);
1511 else if (TREE_CODE (t
) == COMPONENT_REF
)
1513 /* Set the field offset into T and gimplify it. */
1514 if (!TREE_OPERAND (t
, 2))
1516 tree offset
= unshare_expr (component_ref_field_offset (t
));
1517 tree field
= TREE_OPERAND (t
, 1);
1519 = size_int (DECL_OFFSET_ALIGN (field
) / BITS_PER_UNIT
);
1521 /* Divide the offset by its alignment. */
1522 offset
= size_binop (EXACT_DIV_EXPR
, offset
, factor
);
1524 if (!is_gimple_min_invariant (offset
))
1526 TREE_OPERAND (t
, 2) = offset
;
1527 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
1528 is_gimple_formal_tmp_reg
, fb_rvalue
);
1529 ret
= MIN (ret
, tret
);
1535 /* Step 2 is to gimplify the base expression. */
1536 tret
= gimplify_expr (p
, pre_p
, post_p
, is_gimple_min_lval
, fallback
);
1537 ret
= MIN (ret
, tret
);
1539 /* And finally, the indices and operands to BIT_FIELD_REF. During this
1540 loop we also remove any useless conversions. */
1541 for (; VEC_length (tree
, stack
) > 0; )
1543 tree t
= VEC_pop (tree
, stack
);
1545 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
1547 /* Gimplify the dimension.
1548 Temporary fix for gcc.c-torture/execute/20040313-1.c.
1549 Gimplify non-constant array indices into a temporary
1551 FIXME - The real fix is to gimplify post-modify
1552 expressions into a minimal gimple lvalue. However, that
1553 exposes bugs in alias analysis. The alias analyzer does
1554 not handle &PTR->FIELD very well. Will fix after the
1555 branch is merged into mainline (dnovillo 2004-05-03). */
1556 if (!is_gimple_min_invariant (TREE_OPERAND (t
, 1)))
1558 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), pre_p
, post_p
,
1559 is_gimple_formal_tmp_reg
, fb_rvalue
);
1560 ret
= MIN (ret
, tret
);
1563 else if (TREE_CODE (t
) == BIT_FIELD_REF
)
1565 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), pre_p
, post_p
,
1566 is_gimple_val
, fb_rvalue
);
1567 ret
= MIN (ret
, tret
);
1568 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
1569 is_gimple_val
, fb_rvalue
);
1570 ret
= MIN (ret
, tret
);
1573 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t
, 0));
1575 /* The innermost expression P may have originally had TREE_SIDE_EFFECTS
1576 set which would have caused all the outer expressions in EXPR_P
1577 leading to P to also have had TREE_SIDE_EFFECTS set. */
1578 recalculate_side_effects (t
);
1581 tret
= gimplify_expr (p
, pre_p
, post_p
, is_gimple_min_lval
, fallback
);
1582 ret
= MIN (ret
, tret
);
1584 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
1585 if ((fallback
& fb_rvalue
) && TREE_CODE (*expr_p
) == COMPONENT_REF
)
1587 canonicalize_component_ref (expr_p
);
1588 ret
= MIN (ret
, GS_OK
);
1591 VEC_free (tree
, heap
, stack
);
1596 /* Gimplify the self modifying expression pointed to by EXPR_P
1599 PRE_P points to the list where side effects that must happen before
1600 *EXPR_P should be stored.
1602 POST_P points to the list where side effects that must happen after
1603 *EXPR_P should be stored.
1605 WANT_VALUE is nonzero iff we want to use the value of this expression
1606 in another expression. */
1608 static enum gimplify_status
1609 gimplify_self_mod_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
,
1612 enum tree_code code
;
1613 tree lhs
, lvalue
, rhs
, t1
;
1615 enum tree_code arith_code
;
1616 enum gimplify_status ret
;
1618 code
= TREE_CODE (*expr_p
);
1620 gcc_assert (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
1621 || code
== PREINCREMENT_EXPR
|| code
== PREDECREMENT_EXPR
);
1623 /* Prefix or postfix? */
1624 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
1625 /* Faster to treat as prefix if result is not used. */
1626 postfix
= want_value
;
1630 /* Add or subtract? */
1631 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
1632 arith_code
= PLUS_EXPR
;
1634 arith_code
= MINUS_EXPR
;
1636 /* Gimplify the LHS into a GIMPLE lvalue. */
1637 lvalue
= TREE_OPERAND (*expr_p
, 0);
1638 ret
= gimplify_expr (&lvalue
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
1639 if (ret
== GS_ERROR
)
1642 /* Extract the operands to the arithmetic operation. */
1644 rhs
= TREE_OPERAND (*expr_p
, 1);
1646 /* For postfix operator, we evaluate the LHS to an rvalue and then use
1647 that as the result value and in the postqueue operation. */
1650 ret
= gimplify_expr (&lhs
, pre_p
, post_p
, is_gimple_val
, fb_rvalue
);
1651 if (ret
== GS_ERROR
)
1655 t1
= build (arith_code
, TREE_TYPE (*expr_p
), lhs
, rhs
);
1656 t1
= build (MODIFY_EXPR
, TREE_TYPE (lvalue
), lvalue
, t1
);
1660 gimplify_and_add (t1
, post_p
);
1671 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
1674 maybe_with_size_expr (tree
*expr_p
)
1676 tree expr
= *expr_p
;
1677 tree type
= TREE_TYPE (expr
);
1680 /* If we've already wrapped this or the type is error_mark_node, we can't do
1682 if (TREE_CODE (expr
) == WITH_SIZE_EXPR
1683 || type
== error_mark_node
)
1686 /* If the size isn't known or is a constant, we have nothing to do. */
1687 size
= TYPE_SIZE_UNIT (type
);
1688 if (!size
|| TREE_CODE (size
) == INTEGER_CST
)
1691 /* Otherwise, make a WITH_SIZE_EXPR. */
1692 size
= unshare_expr (size
);
1693 size
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (size
, expr
);
1694 *expr_p
= build2 (WITH_SIZE_EXPR
, type
, expr
, size
);
1697 /* Subroutine of gimplify_call_expr: Gimplify a single argument. */
1699 static enum gimplify_status
1700 gimplify_arg (tree
*expr_p
, tree
*pre_p
)
1702 bool (*test
) (tree
);
1705 /* In general, we allow lvalues for function arguments to avoid
1706 extra overhead of copying large aggregates out of even larger
1707 aggregates into temporaries only to copy the temporaries to
1708 the argument list. Make optimizers happy by pulling out to
1709 temporaries those types that fit in registers. */
1710 if (is_gimple_reg_type (TREE_TYPE (*expr_p
)))
1711 test
= is_gimple_val
, fb
= fb_rvalue
;
1713 test
= is_gimple_lvalue
, fb
= fb_either
;
1715 /* If this is a variable sized type, we must remember the size. */
1716 maybe_with_size_expr (expr_p
);
1718 /* There is a sequence point before a function call. Side effects in
1719 the argument list must occur before the actual call. So, when
1720 gimplifying arguments, force gimplify_expr to use an internal
1721 post queue which is then appended to the end of PRE_P. */
1722 return gimplify_expr (expr_p
, pre_p
, NULL
, test
, fb
);
1725 /* Gimplify the CALL_EXPR node pointed to by EXPR_P. PRE_P points to the
1726 list where side effects that must happen before *EXPR_P should be stored.
1727 WANT_VALUE is true if the result of the call is desired. */
1729 static enum gimplify_status
1730 gimplify_call_expr (tree
*expr_p
, tree
*pre_p
, bool want_value
)
1734 enum gimplify_status ret
;
1736 gcc_assert (TREE_CODE (*expr_p
) == CALL_EXPR
);
1738 /* For reliable diagnostics during inlining, it is necessary that
1739 every call_expr be annotated with file and line. */
1740 if (! EXPR_HAS_LOCATION (*expr_p
))
1741 SET_EXPR_LOCATION (*expr_p
, input_location
);
1743 /* This may be a call to a builtin function.
1745 Builtin function calls may be transformed into different
1746 (and more efficient) builtin function calls under certain
1747 circumstances. Unfortunately, gimplification can muck things
1748 up enough that the builtin expanders are not aware that certain
1749 transformations are still valid.
1751 So we attempt transformation/gimplification of the call before
1752 we gimplify the CALL_EXPR. At this time we do not manage to
1753 transform all calls in the same manner as the expanders do, but
1754 we do transform most of them. */
1755 decl
= get_callee_fndecl (*expr_p
);
1756 if (decl
&& DECL_BUILT_IN (decl
))
1758 tree fndecl
= get_callee_fndecl (*expr_p
);
1759 tree arglist
= TREE_OPERAND (*expr_p
, 1);
1760 tree
new = fold_builtin (fndecl
, arglist
, !want_value
);
1762 if (new && new != *expr_p
)
1764 /* There was a transformation of this call which computes the
1765 same value, but in a more efficient way. Return and try
1771 if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1772 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_START
)
1774 if (!arglist
|| !TREE_CHAIN (arglist
))
1776 error ("too few arguments to function %<va_start%>");
1777 *expr_p
= build_empty_stmt ();
1781 if (fold_builtin_next_arg (TREE_CHAIN (arglist
)))
1783 *expr_p
= build_empty_stmt ();
1786 /* Avoid gimplifying the second argument to va_start, which needs
1787 to be the plain PARM_DECL. */
1788 return gimplify_arg (&TREE_VALUE (TREE_OPERAND (*expr_p
, 1)), pre_p
);
1792 /* There is a sequence point before the call, so any side effects in
1793 the calling expression must occur before the actual call. Force
1794 gimplify_expr to use an internal post queue. */
1795 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, NULL
,
1796 is_gimple_call_addr
, fb_rvalue
);
1798 if (PUSH_ARGS_REVERSED
)
1799 TREE_OPERAND (*expr_p
, 1) = nreverse (TREE_OPERAND (*expr_p
, 1));
1800 for (arglist
= TREE_OPERAND (*expr_p
, 1); arglist
;
1801 arglist
= TREE_CHAIN (arglist
))
1803 enum gimplify_status t
;
1805 t
= gimplify_arg (&TREE_VALUE (arglist
), pre_p
);
1810 if (PUSH_ARGS_REVERSED
)
1811 TREE_OPERAND (*expr_p
, 1) = nreverse (TREE_OPERAND (*expr_p
, 1));
1813 /* Try this again in case gimplification exposed something. */
1814 if (ret
!= GS_ERROR
&& decl
&& DECL_BUILT_IN (decl
))
1816 tree fndecl
= get_callee_fndecl (*expr_p
);
1817 tree arglist
= TREE_OPERAND (*expr_p
, 1);
1818 tree
new = fold_builtin (fndecl
, arglist
, !want_value
);
1820 if (new && new != *expr_p
)
1822 /* There was a transformation of this call which computes the
1823 same value, but in a more efficient way. Return and try
1830 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
1831 decl. This allows us to eliminate redundant or useless
1832 calls to "const" functions. */
1833 if (TREE_CODE (*expr_p
) == CALL_EXPR
1834 && (call_expr_flags (*expr_p
) & (ECF_CONST
| ECF_PURE
)))
1835 TREE_SIDE_EFFECTS (*expr_p
) = 0;
1840 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
1841 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
1843 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
1844 condition is true or false, respectively. If null, we should generate
1845 our own to skip over the evaluation of this specific expression.
1847 This function is the tree equivalent of do_jump.
1849 shortcut_cond_r should only be called by shortcut_cond_expr. */
1852 shortcut_cond_r (tree pred
, tree
*true_label_p
, tree
*false_label_p
)
1854 tree local_label
= NULL_TREE
;
1855 tree t
, expr
= NULL
;
1857 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
1858 retain the shortcut semantics. Just insert the gotos here;
1859 shortcut_cond_expr will append the real blocks later. */
1860 if (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
1862 /* Turn if (a && b) into
1864 if (a); else goto no;
1865 if (b) goto yes; else goto no;
1868 if (false_label_p
== NULL
)
1869 false_label_p
= &local_label
;
1871 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), NULL
, false_label_p
);
1872 append_to_statement_list (t
, &expr
);
1874 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
1876 append_to_statement_list (t
, &expr
);
1878 else if (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
1880 /* Turn if (a || b) into
1883 if (b) goto yes; else goto no;
1886 if (true_label_p
== NULL
)
1887 true_label_p
= &local_label
;
1889 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), true_label_p
, NULL
);
1890 append_to_statement_list (t
, &expr
);
1892 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
1894 append_to_statement_list (t
, &expr
);
1896 else if (TREE_CODE (pred
) == COND_EXPR
)
1898 /* As long as we're messing with gotos, turn if (a ? b : c) into
1900 if (b) goto yes; else goto no;
1902 if (c) goto yes; else goto no; */
1903 expr
= build (COND_EXPR
, void_type_node
, TREE_OPERAND (pred
, 0),
1904 shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
1906 shortcut_cond_r (TREE_OPERAND (pred
, 2), true_label_p
,
1911 expr
= build (COND_EXPR
, void_type_node
, pred
,
1912 build_and_jump (true_label_p
),
1913 build_and_jump (false_label_p
));
1918 t
= build1 (LABEL_EXPR
, void_type_node
, local_label
);
1919 append_to_statement_list (t
, &expr
);
1926 shortcut_cond_expr (tree expr
)
1928 tree pred
= TREE_OPERAND (expr
, 0);
1929 tree then_
= TREE_OPERAND (expr
, 1);
1930 tree else_
= TREE_OPERAND (expr
, 2);
1931 tree true_label
, false_label
, end_label
, t
;
1933 tree
*false_label_p
;
1934 bool emit_end
, emit_false
, jump_over_else
;
1935 bool then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
1936 bool else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
1938 /* First do simple transformations. */
1941 /* If there is no 'else', turn (a && b) into if (a) if (b). */
1942 while (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
1944 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
1945 then_
= shortcut_cond_expr (expr
);
1946 then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
1947 pred
= TREE_OPERAND (pred
, 0);
1948 expr
= build (COND_EXPR
, void_type_node
, pred
, then_
, NULL_TREE
);
1953 /* If there is no 'then', turn
1956 if (a); else if (b); else d. */
1957 while (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
1959 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
1960 else_
= shortcut_cond_expr (expr
);
1961 else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
1962 pred
= TREE_OPERAND (pred
, 0);
1963 expr
= build (COND_EXPR
, void_type_node
, pred
, NULL_TREE
, else_
);
1967 /* If we're done, great. */
1968 if (TREE_CODE (pred
) != TRUTH_ANDIF_EXPR
1969 && TREE_CODE (pred
) != TRUTH_ORIF_EXPR
)
1972 /* Otherwise we need to mess with gotos. Change
1975 if (a); else goto no;
1978 and recursively gimplify the condition. */
1980 true_label
= false_label
= end_label
= NULL_TREE
;
1982 /* If our arms just jump somewhere, hijack those labels so we don't
1983 generate jumps to jumps. */
1986 && TREE_CODE (then_
) == GOTO_EXPR
1987 && TREE_CODE (GOTO_DESTINATION (then_
)) == LABEL_DECL
)
1989 true_label
= GOTO_DESTINATION (then_
);
1995 && TREE_CODE (else_
) == GOTO_EXPR
1996 && TREE_CODE (GOTO_DESTINATION (else_
)) == LABEL_DECL
)
1998 false_label
= GOTO_DESTINATION (else_
);
2003 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2005 true_label_p
= &true_label
;
2007 true_label_p
= NULL
;
2009 /* The 'else' branch also needs a label if it contains interesting code. */
2010 if (false_label
|| else_se
)
2011 false_label_p
= &false_label
;
2013 false_label_p
= NULL
;
2015 /* If there was nothing else in our arms, just forward the label(s). */
2016 if (!then_se
&& !else_se
)
2017 return shortcut_cond_r (pred
, true_label_p
, false_label_p
);
2019 /* If our last subexpression already has a terminal label, reuse it. */
2021 expr
= expr_last (else_
);
2023 expr
= expr_last (then_
);
2026 if (expr
&& TREE_CODE (expr
) == LABEL_EXPR
)
2027 end_label
= LABEL_EXPR_LABEL (expr
);
2029 /* If we don't care about jumping to the 'else' branch, jump to the end
2030 if the condition is false. */
2032 false_label_p
= &end_label
;
2034 /* We only want to emit these labels if we aren't hijacking them. */
2035 emit_end
= (end_label
== NULL_TREE
);
2036 emit_false
= (false_label
== NULL_TREE
);
2038 /* We only emit the jump over the else clause if we have to--if the
2039 then clause may fall through. Otherwise we can wind up with a
2040 useless jump and a useless label at the end of gimplified code,
2041 which will cause us to think that this conditional as a whole
2042 falls through even if it doesn't. If we then inline a function
2043 which ends with such a condition, that can cause us to issue an
2044 inappropriate warning about control reaching the end of a
2045 non-void function. */
2046 jump_over_else
= block_may_fallthru (then_
);
2048 pred
= shortcut_cond_r (pred
, true_label_p
, false_label_p
);
2051 append_to_statement_list (pred
, &expr
);
2053 append_to_statement_list (then_
, &expr
);
2058 t
= build_and_jump (&end_label
);
2059 append_to_statement_list (t
, &expr
);
2063 t
= build1 (LABEL_EXPR
, void_type_node
, false_label
);
2064 append_to_statement_list (t
, &expr
);
2066 append_to_statement_list (else_
, &expr
);
2068 if (emit_end
&& end_label
)
2070 t
= build1 (LABEL_EXPR
, void_type_node
, end_label
);
2071 append_to_statement_list (t
, &expr
);
2077 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2080 gimple_boolify (tree expr
)
2082 tree type
= TREE_TYPE (expr
);
2084 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
2087 switch (TREE_CODE (expr
))
2089 case TRUTH_AND_EXPR
:
2091 case TRUTH_XOR_EXPR
:
2092 case TRUTH_ANDIF_EXPR
:
2093 case TRUTH_ORIF_EXPR
:
2094 /* Also boolify the arguments of truth exprs. */
2095 TREE_OPERAND (expr
, 1) = gimple_boolify (TREE_OPERAND (expr
, 1));
2098 case TRUTH_NOT_EXPR
:
2099 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
2102 case EQ_EXPR
: case NE_EXPR
:
2103 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
2104 /* These expressions always produce boolean results. */
2105 TREE_TYPE (expr
) = boolean_type_node
;
2109 /* Other expressions that get here must have boolean values, but
2110 might need to be converted to the appropriate mode. */
2111 return convert (boolean_type_node
, expr
);
2115 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2124 The second form is used when *EXPR_P is of type void.
2126 TARGET is the tree for T1 above.
2128 PRE_P points to the list where side effects that must happen before
2129 *EXPR_P should be stored.
2131 POST_P points to the list where side effects that must happen after
2132 *EXPR_P should be stored. */
2134 static enum gimplify_status
2135 gimplify_cond_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
, tree target
,
2136 fallback_t fallback
)
2138 tree expr
= *expr_p
;
2139 tree tmp
, tmp2
, type
;
2140 enum gimplify_status ret
;
2142 type
= TREE_TYPE (expr
);
2144 /* If this COND_EXPR has a value, copy the values into a temporary within
2146 if (! VOID_TYPE_P (type
))
2152 ret
= gimplify_expr (&target
, pre_p
, post_p
,
2153 is_gimple_min_lval
, fb_lvalue
);
2154 if (ret
!= GS_ERROR
)
2156 result
= tmp
= target
;
2157 tmp2
= unshare_expr (target
);
2159 else if ((fallback
& fb_lvalue
) == 0)
2161 result
= tmp2
= tmp
= create_tmp_var (TREE_TYPE (expr
), "iftmp");
2166 tree type
= build_pointer_type (TREE_TYPE (expr
));
2168 if (TREE_TYPE (TREE_OPERAND (expr
, 1)) != void_type_node
)
2169 TREE_OPERAND (expr
, 1) =
2170 build_fold_addr_expr (TREE_OPERAND (expr
, 1));
2172 if (TREE_TYPE (TREE_OPERAND (expr
, 2)) != void_type_node
)
2173 TREE_OPERAND (expr
, 2) =
2174 build_fold_addr_expr (TREE_OPERAND (expr
, 2));
2176 tmp2
= tmp
= create_tmp_var (type
, "iftmp");
2178 expr
= build (COND_EXPR
, void_type_node
, TREE_OPERAND (expr
, 0),
2179 TREE_OPERAND (expr
, 1), TREE_OPERAND (expr
, 2));
2181 result
= build_fold_indirect_ref (tmp
);
2185 /* Build the then clause, 't1 = a;'. But don't build an assignment
2186 if this branch is void; in C++ it can be, if it's a throw. */
2187 if (TREE_TYPE (TREE_OPERAND (expr
, 1)) != void_type_node
)
2188 TREE_OPERAND (expr
, 1)
2189 = build (MODIFY_EXPR
, void_type_node
, tmp
, TREE_OPERAND (expr
, 1));
2191 /* Build the else clause, 't1 = b;'. */
2192 if (TREE_TYPE (TREE_OPERAND (expr
, 2)) != void_type_node
)
2193 TREE_OPERAND (expr
, 2)
2194 = build (MODIFY_EXPR
, void_type_node
, tmp2
, TREE_OPERAND (expr
, 2));
2196 TREE_TYPE (expr
) = void_type_node
;
2197 recalculate_side_effects (expr
);
2199 /* Move the COND_EXPR to the prequeue. */
2200 gimplify_and_add (expr
, pre_p
);
2206 /* Make sure the condition has BOOLEAN_TYPE. */
2207 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
2209 /* Break apart && and || conditions. */
2210 if (TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ANDIF_EXPR
2211 || TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ORIF_EXPR
)
2213 expr
= shortcut_cond_expr (expr
);
2215 if (expr
!= *expr_p
)
2219 /* We can't rely on gimplify_expr to re-gimplify the expanded
2220 form properly, as cleanups might cause the target labels to be
2221 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2222 set up a conditional context. */
2223 gimple_push_condition ();
2224 gimplify_stmt (expr_p
);
2225 gimple_pop_condition (pre_p
);
2231 /* Now do the normal gimplification. */
2232 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, NULL
,
2233 is_gimple_condexpr
, fb_rvalue
);
2235 gimple_push_condition ();
2237 gimplify_to_stmt_list (&TREE_OPERAND (expr
, 1));
2238 gimplify_to_stmt_list (&TREE_OPERAND (expr
, 2));
2239 recalculate_side_effects (expr
);
2241 gimple_pop_condition (pre_p
);
2243 if (ret
== GS_ERROR
)
2245 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
2247 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 2)))
2248 /* Rewrite "if (a); else b" to "if (!a) b" */
2250 TREE_OPERAND (expr
, 0) = invert_truthvalue (TREE_OPERAND (expr
, 0));
2251 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, NULL
,
2252 is_gimple_condexpr
, fb_rvalue
);
2254 tmp
= TREE_OPERAND (expr
, 1);
2255 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 2);
2256 TREE_OPERAND (expr
, 2) = tmp
;
2259 /* Both arms are empty; replace the COND_EXPR with its predicate. */
2260 expr
= TREE_OPERAND (expr
, 0);
2266 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2267 a call to __builtin_memcpy. */
2269 static enum gimplify_status
2270 gimplify_modify_expr_to_memcpy (tree
*expr_p
, tree size
, bool want_value
)
2272 tree args
, t
, to
, to_ptr
, from
;
2274 to
= TREE_OPERAND (*expr_p
, 0);
2275 from
= TREE_OPERAND (*expr_p
, 1);
2277 args
= tree_cons (NULL
, size
, NULL
);
2279 t
= build_fold_addr_expr (from
);
2280 args
= tree_cons (NULL
, t
, args
);
2282 to_ptr
= build_fold_addr_expr (to
);
2283 args
= tree_cons (NULL
, to_ptr
, args
);
2284 t
= implicit_built_in_decls
[BUILT_IN_MEMCPY
];
2285 t
= build_function_call_expr (t
, args
);
2289 t
= build1 (NOP_EXPR
, TREE_TYPE (to_ptr
), t
);
2290 t
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
2297 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2298 a call to __builtin_memset. In this case we know that the RHS is
2299 a CONSTRUCTOR with an empty element list. */
2301 static enum gimplify_status
2302 gimplify_modify_expr_to_memset (tree
*expr_p
, tree size
, bool want_value
)
2304 tree args
, t
, to
, to_ptr
;
2306 to
= TREE_OPERAND (*expr_p
, 0);
2308 args
= tree_cons (NULL
, size
, NULL
);
2310 args
= tree_cons (NULL
, integer_zero_node
, args
);
2312 to_ptr
= build_fold_addr_expr (to
);
2313 args
= tree_cons (NULL
, to_ptr
, args
);
2314 t
= implicit_built_in_decls
[BUILT_IN_MEMSET
];
2315 t
= build_function_call_expr (t
, args
);
2319 t
= build1 (NOP_EXPR
, TREE_TYPE (to_ptr
), t
);
2320 t
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
2327 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
2328 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
2329 assignment. Returns non-null if we detect a potential overlap. */
2331 struct gimplify_init_ctor_preeval_data
2333 /* The base decl of the lhs object. May be NULL, in which case we
2334 have to assume the lhs is indirect. */
2337 /* The alias set of the lhs object. */
2342 gimplify_init_ctor_preeval_1 (tree
*tp
, int *walk_subtrees
, void *xdata
)
2344 struct gimplify_init_ctor_preeval_data
*data
2345 = (struct gimplify_init_ctor_preeval_data
*) xdata
;
2348 /* If we find the base object, obviously we have overlap. */
2349 if (data
->lhs_base_decl
== t
)
2352 /* If the constructor component is indirect, determine if we have a
2353 potential overlap with the lhs. The only bits of information we
2354 have to go on at this point are addressability and alias sets. */
2355 if (TREE_CODE (t
) == INDIRECT_REF
2356 && (!data
->lhs_base_decl
|| TREE_ADDRESSABLE (data
->lhs_base_decl
))
2357 && alias_sets_conflict_p (data
->lhs_alias_set
, get_alias_set (t
)))
2360 if (IS_TYPE_OR_DECL_P (t
))
2365 /* A subroutine of gimplify_init_constructor. Pre-evaluate *EXPR_P,
2366 force values that overlap with the lhs (as described by *DATA)
2367 into temporaries. */
2370 gimplify_init_ctor_preeval (tree
*expr_p
, tree
*pre_p
, tree
*post_p
,
2371 struct gimplify_init_ctor_preeval_data
*data
)
2373 enum gimplify_status one
;
2375 /* If the value is invariant, then there's nothing to pre-evaluate.
2376 But ensure it doesn't have any side-effects since a SAVE_EXPR is
2377 invariant but has side effects and might contain a reference to
2378 the object we're initializing. */
2379 if (TREE_INVARIANT (*expr_p
) && !TREE_SIDE_EFFECTS (*expr_p
))
2382 /* If the type has non-trivial constructors, we can't pre-evaluate. */
2383 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p
)))
2386 /* Recurse for nested constructors. */
2387 if (TREE_CODE (*expr_p
) == CONSTRUCTOR
)
2389 unsigned HOST_WIDE_INT ix
;
2390 constructor_elt
*ce
;
2391 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (*expr_p
);
2393 for (ix
= 0; VEC_iterate (constructor_elt
, v
, ix
, ce
); ix
++)
2394 gimplify_init_ctor_preeval (&ce
->value
, pre_p
, post_p
, data
);
2398 /* We can't preevaluate if the type contains a placeholder. */
2399 if (type_contains_placeholder_p (TREE_TYPE (*expr_p
)))
2402 /* Gimplify the constructor element to something appropriate for the rhs
2403 of a MODIFY_EXPR. Given that we know the lhs is an aggregate, we know
2404 the gimplifier will consider this a store to memory. Doing this
2405 gimplification now means that we won't have to deal with complicated
2406 language-specific trees, nor trees like SAVE_EXPR that can induce
2407 exponential search behavior. */
2408 one
= gimplify_expr (expr_p
, pre_p
, post_p
, is_gimple_mem_rhs
, fb_rvalue
);
2409 if (one
== GS_ERROR
)
2415 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
2416 with the lhs, since "a = { .x=a }" doesn't make sense. This will
2417 always be true for all scalars, since is_gimple_mem_rhs insists on a
2418 temporary variable for them. */
2419 if (DECL_P (*expr_p
))
2422 /* If this is of variable size, we have no choice but to assume it doesn't
2423 overlap since we can't make a temporary for it. */
2424 if (!TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (*expr_p
))))
2427 /* Otherwise, we must search for overlap ... */
2428 if (!walk_tree (expr_p
, gimplify_init_ctor_preeval_1
, data
, NULL
))
2431 /* ... and if found, force the value into a temporary. */
2432 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
2435 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
2436 a RANGE_EXPR in a CONSTRUCTOR for an array.
2440 object[var] = value;
2447 We increment var _after_ the loop exit check because we might otherwise
2448 fail if upper == TYPE_MAX_VALUE (type for upper).
2450 Note that we never have to deal with SAVE_EXPRs here, because this has
2451 already been taken care of for us, in gimplify_init_ctor_preeval(). */
2453 static void gimplify_init_ctor_eval (tree
, VEC(constructor_elt
,gc
) *,
2457 gimplify_init_ctor_eval_range (tree object
, tree lower
, tree upper
,
2458 tree value
, tree array_elt_type
,
2459 tree
*pre_p
, bool cleared
)
2461 tree loop_entry_label
, loop_exit_label
;
2462 tree var
, var_type
, cref
;
2464 loop_entry_label
= create_artificial_label ();
2465 loop_exit_label
= create_artificial_label ();
2467 /* Create and initialize the index variable. */
2468 var_type
= TREE_TYPE (upper
);
2469 var
= create_tmp_var (var_type
, NULL
);
2470 append_to_statement_list (build2 (MODIFY_EXPR
, var_type
, var
, lower
), pre_p
);
2472 /* Add the loop entry label. */
2473 append_to_statement_list (build1 (LABEL_EXPR
,
2478 /* Build the reference. */
2479 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
2480 var
, NULL_TREE
, NULL_TREE
);
2482 /* If we are a constructor, just call gimplify_init_ctor_eval to do
2483 the store. Otherwise just assign value to the reference. */
2485 if (TREE_CODE (value
) == CONSTRUCTOR
)
2486 /* NB we might have to call ourself recursively through
2487 gimplify_init_ctor_eval if the value is a constructor. */
2488 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
2491 append_to_statement_list (build2 (MODIFY_EXPR
, TREE_TYPE (cref
),
2495 /* We exit the loop when the index var is equal to the upper bound. */
2496 gimplify_and_add (build3 (COND_EXPR
, void_type_node
,
2497 build2 (EQ_EXPR
, boolean_type_node
,
2505 /* Otherwise, increment the index var... */
2506 append_to_statement_list (build2 (MODIFY_EXPR
, var_type
, var
,
2507 build2 (PLUS_EXPR
, var_type
, var
,
2508 fold_convert (var_type
,
2509 integer_one_node
))),
2512 /* ...and jump back to the loop entry. */
2513 append_to_statement_list (build1 (GOTO_EXPR
,
2518 /* Add the loop exit label. */
2519 append_to_statement_list (build1 (LABEL_EXPR
,
2525 /* Return true if FDECL is accessing a field that is zero sized. */
2528 zero_sized_field_decl (tree fdecl
)
2530 if (TREE_CODE (fdecl
) == FIELD_DECL
&& DECL_SIZE (fdecl
)
2531 && integer_zerop (DECL_SIZE (fdecl
)))
2536 /* Return true if TYPE is zero sized. */
2539 zero_sized_type (tree type
)
2541 if (AGGREGATE_TYPE_P (type
) && TYPE_SIZE (type
)
2542 && integer_zerop (TYPE_SIZE (type
)))
2547 /* A subroutine of gimplify_init_constructor. Generate individual
2548 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
2549 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
2550 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
2554 gimplify_init_ctor_eval (tree object
, VEC(constructor_elt
,gc
) *elts
,
2555 tree
*pre_p
, bool cleared
)
2557 tree array_elt_type
= NULL
;
2558 unsigned HOST_WIDE_INT ix
;
2559 tree purpose
, value
;
2561 if (TREE_CODE (TREE_TYPE (object
)) == ARRAY_TYPE
)
2562 array_elt_type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object
)));
2564 FOR_EACH_CONSTRUCTOR_ELT (elts
, ix
, purpose
, value
)
2568 /* NULL values are created above for gimplification errors. */
2572 if (cleared
&& initializer_zerop (value
))
2575 /* ??? Here's to hoping the front end fills in all of the indices,
2576 so we don't have to figure out what's missing ourselves. */
2577 gcc_assert (purpose
);
2579 /* Skip zero-sized fields, unless value has side-effects. This can
2580 happen with calls to functions returning a zero-sized type, which
2581 we shouldn't discard. As a number of downstream passes don't
2582 expect sets of zero-sized fields, we rely on the gimplification of
2583 the MODIFY_EXPR we make below to drop the assignment statement. */
2584 if (! TREE_SIDE_EFFECTS (value
) && zero_sized_field_decl (purpose
))
2587 /* If we have a RANGE_EXPR, we have to build a loop to assign the
2589 if (TREE_CODE (purpose
) == RANGE_EXPR
)
2591 tree lower
= TREE_OPERAND (purpose
, 0);
2592 tree upper
= TREE_OPERAND (purpose
, 1);
2594 /* If the lower bound is equal to upper, just treat it as if
2595 upper was the index. */
2596 if (simple_cst_equal (lower
, upper
))
2600 gimplify_init_ctor_eval_range (object
, lower
, upper
, value
,
2601 array_elt_type
, pre_p
, cleared
);
2608 cref
= build (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
2609 purpose
, NULL_TREE
, NULL_TREE
);
2613 gcc_assert (TREE_CODE (purpose
) == FIELD_DECL
);
2614 cref
= build (COMPONENT_REF
, TREE_TYPE (purpose
),
2615 unshare_expr (object
), purpose
, NULL_TREE
);
2618 if (TREE_CODE (value
) == CONSTRUCTOR
2619 && TREE_CODE (TREE_TYPE (value
)) != VECTOR_TYPE
)
2620 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
2624 init
= build (MODIFY_EXPR
, TREE_TYPE (cref
), cref
, value
);
2625 gimplify_and_add (init
, pre_p
);
2630 /* A subroutine of gimplify_modify_expr. Break out elements of a
2631 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
2633 Note that we still need to clear any elements that don't have explicit
2634 initializers, so if not all elements are initialized we keep the
2635 original MODIFY_EXPR, we just remove all of the constructor elements. */
2637 static enum gimplify_status
2638 gimplify_init_constructor (tree
*expr_p
, tree
*pre_p
,
2639 tree
*post_p
, bool want_value
)
2642 tree ctor
= TREE_OPERAND (*expr_p
, 1);
2643 tree type
= TREE_TYPE (ctor
);
2644 enum gimplify_status ret
;
2645 VEC(constructor_elt
,gc
) *elts
;
2647 if (TREE_CODE (ctor
) != CONSTRUCTOR
)
2648 return GS_UNHANDLED
;
2650 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
2651 is_gimple_lvalue
, fb_lvalue
);
2652 if (ret
== GS_ERROR
)
2654 object
= TREE_OPERAND (*expr_p
, 0);
2656 elts
= CONSTRUCTOR_ELTS (ctor
);
2659 switch (TREE_CODE (type
))
2663 case QUAL_UNION_TYPE
:
2666 struct gimplify_init_ctor_preeval_data preeval_data
;
2667 HOST_WIDE_INT num_type_elements
, num_ctor_elements
;
2668 HOST_WIDE_INT num_nonzero_elements
, num_nonconstant_elements
;
2671 /* Aggregate types must lower constructors to initialization of
2672 individual elements. The exception is that a CONSTRUCTOR node
2673 with no elements indicates zero-initialization of the whole. */
2674 if (VEC_empty (constructor_elt
, elts
))
2677 categorize_ctor_elements (ctor
, &num_nonzero_elements
,
2678 &num_nonconstant_elements
,
2679 &num_ctor_elements
, &cleared
);
2681 /* If a const aggregate variable is being initialized, then it
2682 should never be a lose to promote the variable to be static. */
2683 if (num_nonconstant_elements
== 0
2684 && num_nonzero_elements
> 1
2685 && TREE_READONLY (object
)
2686 && TREE_CODE (object
) == VAR_DECL
)
2688 DECL_INITIAL (object
) = ctor
;
2689 TREE_STATIC (object
) = 1;
2690 if (!DECL_NAME (object
))
2691 DECL_NAME (object
) = create_tmp_var_name ("C");
2692 walk_tree (&DECL_INITIAL (object
), force_labels_r
, NULL
, NULL
);
2694 /* ??? C++ doesn't automatically append a .<number> to the
2695 assembler name, and even when it does, it looks a FE private
2696 data structures to figure out what that number should be,
2697 which are not set for this variable. I suppose this is
2698 important for local statics for inline functions, which aren't
2699 "local" in the object file sense. So in order to get a unique
2700 TU-local symbol, we must invoke the lhd version now. */
2701 lhd_set_decl_assembler_name (object
);
2703 *expr_p
= NULL_TREE
;
2707 /* If there are "lots" of initialized elements, even discounting
2708 those that are not address constants (and thus *must* be
2709 computed at runtime), then partition the constructor into
2710 constant and non-constant parts. Block copy the constant
2711 parts in, then generate code for the non-constant parts. */
2712 /* TODO. There's code in cp/typeck.c to do this. */
2714 num_type_elements
= count_type_elements (type
, true);
2716 /* If count_type_elements could not determine number of type elements
2717 for a constant-sized object, assume clearing is needed.
2718 Don't do this for variable-sized objects, as store_constructor
2719 will ignore the clearing of variable-sized objects. */
2720 if (num_type_elements
< 0 && int_size_in_bytes (type
) >= 0)
2722 /* If there are "lots" of zeros, then block clear the object first. */
2723 else if (num_type_elements
- num_nonzero_elements
> CLEAR_RATIO
2724 && num_nonzero_elements
< num_type_elements
/4)
2726 /* ??? This bit ought not be needed. For any element not present
2727 in the initializer, we should simply set them to zero. Except
2728 we'd need to *find* the elements that are not present, and that
2729 requires trickery to avoid quadratic compile-time behavior in
2730 large cases or excessive memory use in small cases. */
2731 else if (num_ctor_elements
< num_type_elements
)
2734 /* If there are "lots" of initialized elements, and all of them
2735 are valid address constants, then the entire initializer can
2736 be dropped to memory, and then memcpy'd out. Don't do this
2737 for sparse arrays, though, as it's more efficient to follow
2738 the standard CONSTRUCTOR behavior of memset followed by
2739 individual element initialization. */
2740 if (num_nonconstant_elements
== 0 && !cleared
)
2742 HOST_WIDE_INT size
= int_size_in_bytes (type
);
2745 /* ??? We can still get unbounded array types, at least
2746 from the C++ front end. This seems wrong, but attempt
2747 to work around it for now. */
2750 size
= int_size_in_bytes (TREE_TYPE (object
));
2752 TREE_TYPE (ctor
) = type
= TREE_TYPE (object
);
2755 /* Find the maximum alignment we can assume for the object. */
2756 /* ??? Make use of DECL_OFFSET_ALIGN. */
2757 if (DECL_P (object
))
2758 align
= DECL_ALIGN (object
);
2760 align
= TYPE_ALIGN (type
);
2762 if (size
> 0 && !can_move_by_pieces (size
, align
))
2764 tree
new = create_tmp_var_raw (type
, "C");
2766 gimple_add_tmp_var (new);
2767 TREE_STATIC (new) = 1;
2768 TREE_READONLY (new) = 1;
2769 DECL_INITIAL (new) = ctor
;
2770 if (align
> DECL_ALIGN (new))
2772 DECL_ALIGN (new) = align
;
2773 DECL_USER_ALIGN (new) = 1;
2775 walk_tree (&DECL_INITIAL (new), force_labels_r
, NULL
, NULL
);
2777 TREE_OPERAND (*expr_p
, 1) = new;
2779 /* This is no longer an assignment of a CONSTRUCTOR, but
2780 we still may have processing to do on the LHS. So
2781 pretend we didn't do anything here to let that happen. */
2782 return GS_UNHANDLED
;
2788 /* Zap the CONSTRUCTOR element list, which simplifies this case.
2789 Note that we still have to gimplify, in order to handle the
2790 case of variable sized types. Avoid shared tree structures. */
2791 CONSTRUCTOR_ELTS (ctor
) = NULL
;
2792 object
= unshare_expr (object
);
2793 gimplify_stmt (expr_p
);
2794 append_to_statement_list (*expr_p
, pre_p
);
2797 /* If we have not block cleared the object, or if there are nonzero
2798 elements in the constructor, add assignments to the individual
2799 scalar fields of the object. */
2800 if (!cleared
|| num_nonzero_elements
> 0)
2802 preeval_data
.lhs_base_decl
= get_base_address (object
);
2803 if (!DECL_P (preeval_data
.lhs_base_decl
))
2804 preeval_data
.lhs_base_decl
= NULL
;
2805 preeval_data
.lhs_alias_set
= get_alias_set (object
);
2807 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p
, 1),
2808 pre_p
, post_p
, &preeval_data
);
2809 gimplify_init_ctor_eval (object
, elts
, pre_p
, cleared
);
2812 *expr_p
= NULL_TREE
;
2820 /* Extract the real and imaginary parts out of the ctor. */
2821 gcc_assert (VEC_length (constructor_elt
, elts
) == 2);
2822 r
= VEC_index (constructor_elt
, elts
, 0)->value
;
2823 i
= VEC_index (constructor_elt
, elts
, 1)->value
;
2824 if (r
== NULL
|| i
== NULL
)
2826 tree zero
= convert (TREE_TYPE (type
), integer_zero_node
);
2833 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
2834 represent creation of a complex value. */
2835 if (TREE_CONSTANT (r
) && TREE_CONSTANT (i
))
2837 ctor
= build_complex (type
, r
, i
);
2838 TREE_OPERAND (*expr_p
, 1) = ctor
;
2842 ctor
= build (COMPLEX_EXPR
, type
, r
, i
);
2843 TREE_OPERAND (*expr_p
, 1) = ctor
;
2844 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
2845 rhs_predicate_for (TREE_OPERAND (*expr_p
, 0)),
2853 unsigned HOST_WIDE_INT ix
;
2854 constructor_elt
*ce
;
2856 /* Go ahead and simplify constant constructors to VECTOR_CST. */
2857 if (TREE_CONSTANT (ctor
))
2859 bool constant_p
= true;
2862 /* Even when ctor is constant, it might contain non-*_CST
2863 elements (e.g. { 1.0/0.0 - 1.0/0.0, 0.0 }) and those don't
2864 belong into VECTOR_CST nodes. */
2865 FOR_EACH_CONSTRUCTOR_VALUE (elts
, ix
, value
)
2866 if (!CONSTANT_CLASS_P (value
))
2874 TREE_OPERAND (*expr_p
, 1) = build_vector_from_ctor (type
, elts
);
2879 /* Vector types use CONSTRUCTOR all the way through gimple
2880 compilation as a general initializer. */
2881 for (ix
= 0; VEC_iterate (constructor_elt
, elts
, ix
, ce
); ix
++)
2883 enum gimplify_status tret
;
2884 tret
= gimplify_expr (&ce
->value
, pre_p
, post_p
,
2885 is_gimple_val
, fb_rvalue
);
2886 if (tret
== GS_ERROR
)
2893 /* So how did we get a CONSTRUCTOR for a scalar type? */
2897 if (ret
== GS_ERROR
)
2899 else if (want_value
)
2901 append_to_statement_list (*expr_p
, pre_p
);
2909 /* Given a pointer value OP0, return a simplified version of an
2910 indirection through OP0, or NULL_TREE if no simplification is
2911 possible. This may only be applied to a rhs of an expression.
2912 Note that the resulting type may be different from the type pointed
2913 to in the sense that it is still compatible from the langhooks
2917 fold_indirect_ref_rhs (tree t
)
2919 tree type
= TREE_TYPE (TREE_TYPE (t
));
2924 subtype
= TREE_TYPE (sub
);
2925 if (!POINTER_TYPE_P (subtype
))
2928 if (TREE_CODE (sub
) == ADDR_EXPR
)
2930 tree op
= TREE_OPERAND (sub
, 0);
2931 tree optype
= TREE_TYPE (op
);
2933 if (lang_hooks
.types_compatible_p (type
, optype
))
2935 /* *(foo *)&fooarray => fooarray[0] */
2936 else if (TREE_CODE (optype
) == ARRAY_TYPE
2937 && lang_hooks
.types_compatible_p (type
, TREE_TYPE (optype
)))
2939 tree type_domain
= TYPE_DOMAIN (optype
);
2940 tree min_val
= size_zero_node
;
2941 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
2942 min_val
= TYPE_MIN_VALUE (type_domain
);
2943 return build4 (ARRAY_REF
, type
, op
, min_val
, NULL_TREE
, NULL_TREE
);
2947 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
2948 if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
2949 && lang_hooks
.types_compatible_p (type
, TREE_TYPE (TREE_TYPE (subtype
))))
2952 tree min_val
= size_zero_node
;
2954 sub
= fold_indirect_ref_rhs (sub
);
2956 sub
= build1 (INDIRECT_REF
, TREE_TYPE (subtype
), osub
);
2957 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
2958 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
2959 min_val
= TYPE_MIN_VALUE (type_domain
);
2960 return build4 (ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
, NULL_TREE
);
2966 /* Subroutine of gimplify_modify_expr to do simplifications of MODIFY_EXPRs
2967 based on the code of the RHS. We loop for as long as something changes. */
2969 static enum gimplify_status
2970 gimplify_modify_expr_rhs (tree
*expr_p
, tree
*from_p
, tree
*to_p
, tree
*pre_p
,
2971 tree
*post_p
, bool want_value
)
2973 enum gimplify_status ret
= GS_OK
;
2975 while (ret
!= GS_UNHANDLED
)
2976 switch (TREE_CODE (*from_p
))
2980 /* If we have code like
2984 where the type of "x" is a (possibly cv-qualified variant
2985 of "A"), treat the entire expression as identical to "x".
2986 This kind of code arises in C++ when an object is bound
2987 to a const reference, and if "x" is a TARGET_EXPR we want
2988 to take advantage of the optimization below. */
2989 tree t
= fold_indirect_ref_rhs (TREE_OPERAND (*from_p
, 0));
3002 /* If we are initializing something from a TARGET_EXPR, strip the
3003 TARGET_EXPR and initialize it directly, if possible. This can't
3004 be done if the initializer is void, since that implies that the
3005 temporary is set in some non-trivial way.
3007 ??? What about code that pulls out the temp and uses it
3008 elsewhere? I think that such code never uses the TARGET_EXPR as
3009 an initializer. If I'm wrong, we'll die because the temp won't
3010 have any RTL. In that case, I guess we'll need to replace
3011 references somehow. */
3012 tree init
= TARGET_EXPR_INITIAL (*from_p
);
3014 if (!VOID_TYPE_P (TREE_TYPE (init
)))
3025 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
3027 gimplify_compound_expr (from_p
, pre_p
, true);
3032 /* If we're initializing from a CONSTRUCTOR, break this into
3033 individual MODIFY_EXPRs. */
3034 return gimplify_init_constructor (expr_p
, pre_p
, post_p
, want_value
);
3037 /* If we're assigning to a non-register type, push the assignment
3038 down into the branches. This is mandatory for ADDRESSABLE types,
3039 since we cannot generate temporaries for such, but it saves a
3040 copy in other cases as well. */
3041 if (!is_gimple_reg_type (TREE_TYPE (*from_p
)))
3044 return gimplify_cond_expr (expr_p
, pre_p
, post_p
, *to_p
,
3052 /* For calls that return in memory, give *to_p as the CALL_EXPR's
3053 return slot so that we don't generate a temporary. */
3054 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p
)
3055 && aggregate_value_p (*from_p
, *from_p
))
3059 if (TREE_CODE (*to_p
) == RESULT_DECL
3060 && needs_to_live_in_memory (*to_p
))
3061 /* It's always OK to use the return slot directly. */
3063 else if (!is_gimple_non_addressable (*to_p
))
3064 /* Don't use the original target if it's already addressable;
3065 if its address escapes, and the called function uses the
3066 NRV optimization, a conforming program could see *to_p
3067 change before the called function returns; see c++/19317.
3068 When optimizing, the return_slot pass marks more functions
3069 as safe after we have escape info. */
3071 else if (TREE_CODE (*to_p
) != PARM_DECL
3072 && DECL_GIMPLE_FORMAL_TEMP_P (*to_p
))
3073 /* Don't use the original target if it's a formal temp; we
3074 don't want to take their addresses. */
3076 else if (is_gimple_reg_type (TREE_TYPE (*to_p
)))
3077 /* Also don't force regs into memory. */
3084 CALL_EXPR_RETURN_SLOT_OPT (*from_p
) = 1;
3085 lang_hooks
.mark_addressable (*to_p
);
3100 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
3101 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
3102 DECL_COMPLEX_GIMPLE_REG_P set. */
3104 static enum gimplify_status
3105 gimplify_modify_expr_complex_part (tree
*expr_p
, tree
*pre_p
, bool want_value
)
3107 enum tree_code code
, ocode
;
3108 tree lhs
, rhs
, new_rhs
, other
, realpart
, imagpart
;
3110 lhs
= TREE_OPERAND (*expr_p
, 0);
3111 rhs
= TREE_OPERAND (*expr_p
, 1);
3112 code
= TREE_CODE (lhs
);
3113 lhs
= TREE_OPERAND (lhs
, 0);
3115 ocode
= code
== REALPART_EXPR
? IMAGPART_EXPR
: REALPART_EXPR
;
3116 other
= build1 (ocode
, TREE_TYPE (rhs
), lhs
);
3117 other
= get_formal_tmp_var (other
, pre_p
);
3119 realpart
= code
== REALPART_EXPR
? rhs
: other
;
3120 imagpart
= code
== REALPART_EXPR
? other
: rhs
;
3122 if (TREE_CONSTANT (realpart
) && TREE_CONSTANT (imagpart
))
3123 new_rhs
= build_complex (TREE_TYPE (lhs
), realpart
, imagpart
);
3125 new_rhs
= build2 (COMPLEX_EXPR
, TREE_TYPE (lhs
), realpart
, imagpart
);
3127 TREE_OPERAND (*expr_p
, 0) = lhs
;
3128 TREE_OPERAND (*expr_p
, 1) = new_rhs
;
3132 append_to_statement_list (*expr_p
, pre_p
);
3139 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
3145 PRE_P points to the list where side effects that must happen before
3146 *EXPR_P should be stored.
3148 POST_P points to the list where side effects that must happen after
3149 *EXPR_P should be stored.
3151 WANT_VALUE is nonzero iff we want to use the value of this expression
3152 in another expression. */
3154 static enum gimplify_status
3155 gimplify_modify_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
, bool want_value
)
3157 tree
*from_p
= &TREE_OPERAND (*expr_p
, 1);
3158 tree
*to_p
= &TREE_OPERAND (*expr_p
, 0);
3159 enum gimplify_status ret
= GS_UNHANDLED
;
3161 gcc_assert (TREE_CODE (*expr_p
) == MODIFY_EXPR
3162 || TREE_CODE (*expr_p
) == INIT_EXPR
);
3164 /* The distinction between MODIFY_EXPR and INIT_EXPR is no longer useful. */
3165 if (TREE_CODE (*expr_p
) == INIT_EXPR
)
3166 TREE_SET_CODE (*expr_p
, MODIFY_EXPR
);
3168 /* For zero sized types only gimplify the left hand side and right hand side
3169 as statements and throw away the assignment. */
3170 if (zero_sized_type (TREE_TYPE (*from_p
)))
3172 gimplify_stmt (from_p
);
3173 gimplify_stmt (to_p
);
3174 append_to_statement_list (*from_p
, pre_p
);
3175 append_to_statement_list (*to_p
, pre_p
);
3176 *expr_p
= NULL_TREE
;
3180 /* See if any simplifications can be done based on what the RHS is. */
3181 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
3183 if (ret
!= GS_UNHANDLED
)
3186 /* If the value being copied is of variable width, compute the length
3187 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
3188 before gimplifying any of the operands so that we can resolve any
3189 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
3190 the size of the expression to be copied, not of the destination, so
3191 that is what we must here. */
3192 maybe_with_size_expr (from_p
);
3194 ret
= gimplify_expr (to_p
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
3195 if (ret
== GS_ERROR
)
3198 ret
= gimplify_expr (from_p
, pre_p
, post_p
,
3199 rhs_predicate_for (*to_p
), fb_rvalue
);
3200 if (ret
== GS_ERROR
)
3203 /* Now see if the above changed *from_p to something we handle specially. */
3204 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
3206 if (ret
!= GS_UNHANDLED
)
3209 /* If we've got a variable sized assignment between two lvalues (i.e. does
3210 not involve a call), then we can make things a bit more straightforward
3211 by converting the assignment to memcpy or memset. */
3212 if (TREE_CODE (*from_p
) == WITH_SIZE_EXPR
)
3214 tree from
= TREE_OPERAND (*from_p
, 0);
3215 tree size
= TREE_OPERAND (*from_p
, 1);
3217 if (TREE_CODE (from
) == CONSTRUCTOR
)
3218 return gimplify_modify_expr_to_memset (expr_p
, size
, want_value
);
3219 if (is_gimple_addressable (from
))
3222 return gimplify_modify_expr_to_memcpy (expr_p
, size
, want_value
);
3226 /* Transform partial stores to non-addressable complex variables into
3227 total stores. This allows us to use real instead of virtual operands
3228 for these variables, which improves optimization. */
3229 if ((TREE_CODE (*to_p
) == REALPART_EXPR
3230 || TREE_CODE (*to_p
) == IMAGPART_EXPR
)
3231 && is_gimple_reg (TREE_OPERAND (*to_p
, 0)))
3232 return gimplify_modify_expr_complex_part (expr_p
, pre_p
, want_value
);
3234 if (gimplify_ctxp
->into_ssa
&& is_gimple_reg (*to_p
))
3236 /* If we've somehow already got an SSA_NAME on the LHS, then
3237 we're probably modified it twice. Not good. */
3238 gcc_assert (TREE_CODE (*to_p
) != SSA_NAME
);
3239 *to_p
= make_ssa_name (*to_p
, *expr_p
);
3244 append_to_statement_list (*expr_p
, pre_p
);
3252 /* Gimplify a comparison between two variable-sized objects. Do this
3253 with a call to BUILT_IN_MEMCMP. */
3255 static enum gimplify_status
3256 gimplify_variable_sized_compare (tree
*expr_p
)
3258 tree op0
= TREE_OPERAND (*expr_p
, 0);
3259 tree op1
= TREE_OPERAND (*expr_p
, 1);
3262 t
= TYPE_SIZE_UNIT (TREE_TYPE (op0
));
3263 t
= unshare_expr (t
);
3264 t
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (t
, op0
);
3265 args
= tree_cons (NULL
, t
, NULL
);
3266 t
= build_fold_addr_expr (op1
);
3267 args
= tree_cons (NULL
, t
, args
);
3268 dest
= build_fold_addr_expr (op0
);
3269 args
= tree_cons (NULL
, dest
, args
);
3270 t
= implicit_built_in_decls
[BUILT_IN_MEMCMP
];
3271 t
= build_function_call_expr (t
, args
);
3273 = build (TREE_CODE (*expr_p
), TREE_TYPE (*expr_p
), t
, integer_zero_node
);
3278 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
3279 points to the expression to gimplify.
3281 Expressions of the form 'a && b' are gimplified to:
3283 a && b ? true : false
3285 gimplify_cond_expr will do the rest.
3287 PRE_P points to the list where side effects that must happen before
3288 *EXPR_P should be stored. */
3290 static enum gimplify_status
3291 gimplify_boolean_expr (tree
*expr_p
)
3293 /* Preserve the original type of the expression. */
3294 tree type
= TREE_TYPE (*expr_p
);
3296 *expr_p
= build (COND_EXPR
, type
, *expr_p
,
3297 convert (type
, boolean_true_node
),
3298 convert (type
, boolean_false_node
));
3303 /* Gimplifies an expression sequence. This function gimplifies each
3304 expression and re-writes the original expression with the last
3305 expression of the sequence in GIMPLE form.
3307 PRE_P points to the list where the side effects for all the
3308 expressions in the sequence will be emitted.
3310 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
3311 /* ??? Should rearrange to share the pre-queue with all the indirect
3312 invocations of gimplify_expr. Would probably save on creations
3313 of statement_list nodes. */
3315 static enum gimplify_status
3316 gimplify_compound_expr (tree
*expr_p
, tree
*pre_p
, bool want_value
)
3322 tree
*sub_p
= &TREE_OPERAND (t
, 0);
3324 if (TREE_CODE (*sub_p
) == COMPOUND_EXPR
)
3325 gimplify_compound_expr (sub_p
, pre_p
, false);
3327 gimplify_stmt (sub_p
);
3328 append_to_statement_list (*sub_p
, pre_p
);
3330 t
= TREE_OPERAND (t
, 1);
3332 while (TREE_CODE (t
) == COMPOUND_EXPR
);
3339 gimplify_stmt (expr_p
);
3344 /* Gimplifies a statement list. These may be created either by an
3345 enlightened front-end, or by shortcut_cond_expr. */
3347 static enum gimplify_status
3348 gimplify_statement_list (tree
*expr_p
)
3350 tree_stmt_iterator i
= tsi_start (*expr_p
);
3352 while (!tsi_end_p (i
))
3356 gimplify_stmt (tsi_stmt_ptr (i
));
3361 else if (TREE_CODE (t
) == STATEMENT_LIST
)
3363 tsi_link_before (&i
, t
, TSI_SAME_STMT
);
3373 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
3374 gimplify. After gimplification, EXPR_P will point to a new temporary
3375 that holds the original value of the SAVE_EXPR node.
3377 PRE_P points to the list where side effects that must happen before
3378 *EXPR_P should be stored. */
3380 static enum gimplify_status
3381 gimplify_save_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
3383 enum gimplify_status ret
= GS_ALL_DONE
;
3386 gcc_assert (TREE_CODE (*expr_p
) == SAVE_EXPR
);
3387 val
= TREE_OPERAND (*expr_p
, 0);
3389 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
3390 if (!SAVE_EXPR_RESOLVED_P (*expr_p
))
3392 /* The operand may be a void-valued expression such as SAVE_EXPRs
3393 generated by the Java frontend for class initialization. It is
3394 being executed only for its side-effects. */
3395 if (TREE_TYPE (val
) == void_type_node
)
3397 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
3398 is_gimple_stmt
, fb_none
);
3399 append_to_statement_list (TREE_OPERAND (*expr_p
, 0), pre_p
);
3403 val
= get_initialized_tmp_var (val
, pre_p
, post_p
);
3405 TREE_OPERAND (*expr_p
, 0) = val
;
3406 SAVE_EXPR_RESOLVED_P (*expr_p
) = 1;
3414 /* Re-write the ADDR_EXPR node pointed to by EXPR_P
3421 PRE_P points to the list where side effects that must happen before
3422 *EXPR_P should be stored.
3424 POST_P points to the list where side effects that must happen after
3425 *EXPR_P should be stored. */
3427 static enum gimplify_status
3428 gimplify_addr_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
3430 tree expr
= *expr_p
;
3431 tree op0
= TREE_OPERAND (expr
, 0);
3432 enum gimplify_status ret
;
3434 switch (TREE_CODE (op0
))
3437 case MISALIGNED_INDIRECT_REF
:
3439 /* Check if we are dealing with an expression of the form '&*ptr'.
3440 While the front end folds away '&*ptr' into 'ptr', these
3441 expressions may be generated internally by the compiler (e.g.,
3442 builtins like __builtin_va_end). */
3443 /* Caution: the silent array decomposition semantics we allow for
3444 ADDR_EXPR means we can't always discard the pair. */
3445 /* Gimplification of the ADDR_EXPR operand may drop
3446 cv-qualification conversions, so make sure we add them if
3449 tree op00
= TREE_OPERAND (op0
, 0);
3450 tree t_expr
= TREE_TYPE (expr
);
3451 tree t_op00
= TREE_TYPE (op00
);
3453 if (!lang_hooks
.types_compatible_p (t_expr
, t_op00
))
3455 #ifdef ENABLE_CHECKING
3456 tree t_op0
= TREE_TYPE (op0
);
3457 gcc_assert (POINTER_TYPE_P (t_expr
)
3458 && cpt_same_type (TREE_CODE (t_op0
) == ARRAY_TYPE
3459 ? TREE_TYPE (t_op0
) : t_op0
,
3461 && POINTER_TYPE_P (t_op00
)
3462 && cpt_same_type (t_op0
, TREE_TYPE (t_op00
)));
3464 op00
= fold_convert (TREE_TYPE (expr
), op00
);
3471 case VIEW_CONVERT_EXPR
:
3472 /* Take the address of our operand and then convert it to the type of
3475 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
3476 all clear. The impact of this transformation is even less clear. */
3478 /* If the operand is a useless conversion, look through it. Doing so
3479 guarantees that the ADDR_EXPR and its operand will remain of the
3481 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0
, 0)))
3482 op0
= TREE_OPERAND (op0
, 0);
3484 *expr_p
= fold_convert (TREE_TYPE (expr
),
3485 build_fold_addr_expr (TREE_OPERAND (op0
, 0)));
3490 /* We use fb_either here because the C frontend sometimes takes
3491 the address of a call that returns a struct; see
3492 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
3493 the implied temporary explicit. */
3494 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, post_p
,
3495 is_gimple_addressable
, fb_either
);
3496 if (ret
!= GS_ERROR
)
3498 op0
= TREE_OPERAND (expr
, 0);
3500 /* For various reasons, the gimplification of the expression
3501 may have made a new INDIRECT_REF. */
3502 if (TREE_CODE (op0
) == INDIRECT_REF
)
3503 goto do_indirect_ref
;
3505 /* Make sure TREE_INVARIANT, TREE_CONSTANT, and TREE_SIDE_EFFECTS
3507 recompute_tree_invarant_for_addr_expr (expr
);
3509 /* Mark the RHS addressable. */
3510 lang_hooks
.mark_addressable (TREE_OPERAND (expr
, 0));
3518 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
3519 value; output operands should be a gimple lvalue. */
3521 static enum gimplify_status
3522 gimplify_asm_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
3524 tree expr
= *expr_p
;
3525 int noutputs
= list_length (ASM_OUTPUTS (expr
));
3526 const char **oconstraints
3527 = (const char **) alloca ((noutputs
) * sizeof (const char *));
3530 const char *constraint
;
3531 bool allows_mem
, allows_reg
, is_inout
;
3532 enum gimplify_status ret
, tret
;
3535 for (i
= 0, link
= ASM_OUTPUTS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
3537 size_t constraint_len
;
3538 oconstraints
[i
] = constraint
3539 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
3540 constraint_len
= strlen (constraint
);
3541 if (constraint_len
== 0)
3544 parse_output_constraint (&constraint
, i
, 0, 0,
3545 &allows_mem
, &allows_reg
, &is_inout
);
3547 if (!allows_reg
&& allows_mem
)
3548 lang_hooks
.mark_addressable (TREE_VALUE (link
));
3550 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
3551 is_inout
? is_gimple_min_lval
: is_gimple_lvalue
,
3552 fb_lvalue
| fb_mayfail
);
3553 if (tret
== GS_ERROR
)
3555 error ("invalid lvalue in asm output %d", i
);
3561 /* An input/output operand. To give the optimizers more
3562 flexibility, split it into separate input and output
3567 /* Turn the in/out constraint into an output constraint. */
3568 char *p
= xstrdup (constraint
);
3570 TREE_VALUE (TREE_PURPOSE (link
)) = build_string (constraint_len
, p
);
3572 /* And add a matching input constraint. */
3575 sprintf (buf
, "%d", i
);
3577 /* If there are multiple alternatives in the constraint,
3578 handle each of them individually. Those that allow register
3579 will be replaced with operand number, the others will stay
3581 if (strchr (p
, ',') != NULL
)
3583 size_t len
= 0, buflen
= strlen (buf
);
3584 char *beg
, *end
, *str
, *dst
;
3588 end
= strchr (beg
, ',');
3590 end
= strchr (beg
, '\0');
3591 if ((size_t) (end
- beg
) < buflen
)
3594 len
+= end
- beg
+ 1;
3602 for (beg
= p
+ 1, dst
= str
;;)
3605 bool mem_p
, reg_p
, inout_p
;
3607 end
= strchr (beg
, ',');
3612 parse_output_constraint (&tem
, i
, 0, 0,
3613 &mem_p
, ®_p
, &inout_p
);
3618 memcpy (dst
, buf
, buflen
);
3627 memcpy (dst
, beg
, len
);
3636 input
= build_string (dst
- str
, str
);
3639 input
= build_string (strlen (buf
), buf
);
3642 input
= build_string (constraint_len
- 1, constraint
+ 1);
3646 input
= build_tree_list (build_tree_list (NULL_TREE
, input
),
3647 unshare_expr (TREE_VALUE (link
)));
3648 ASM_INPUTS (expr
) = chainon (ASM_INPUTS (expr
), input
);
3652 for (link
= ASM_INPUTS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
3655 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
3656 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
3657 oconstraints
, &allows_mem
, &allows_reg
);
3659 /* If the operand is a memory input, it should be an lvalue. */
3660 if (!allows_reg
&& allows_mem
)
3662 lang_hooks
.mark_addressable (TREE_VALUE (link
));
3663 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
3664 is_gimple_lvalue
, fb_lvalue
| fb_mayfail
);
3665 if (tret
== GS_ERROR
)
3667 error ("memory input %d is not directly addressable", i
);
3673 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
3674 is_gimple_asm_val
, fb_rvalue
);
3675 if (tret
== GS_ERROR
)
3683 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
3684 WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
3685 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
3686 return to this function.
3688 FIXME should we complexify the prequeue handling instead? Or use flags
3689 for all the cleanups and let the optimizer tighten them up? The current
3690 code seems pretty fragile; it will break on a cleanup within any
3691 non-conditional nesting. But any such nesting would be broken, anyway;
3692 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
3693 and continues out of it. We can do that at the RTL level, though, so
3694 having an optimizer to tighten up try/finally regions would be a Good
3697 static enum gimplify_status
3698 gimplify_cleanup_point_expr (tree
*expr_p
, tree
*pre_p
)
3700 tree_stmt_iterator iter
;
3703 tree temp
= voidify_wrapper_expr (*expr_p
, NULL
);
3705 /* We only care about the number of conditions between the innermost
3706 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count. */
3707 int old_conds
= gimplify_ctxp
->conditions
;
3708 gimplify_ctxp
->conditions
= 0;
3710 body
= TREE_OPERAND (*expr_p
, 0);
3711 gimplify_to_stmt_list (&body
);
3713 gimplify_ctxp
->conditions
= old_conds
;
3715 for (iter
= tsi_start (body
); !tsi_end_p (iter
); )
3717 tree
*wce_p
= tsi_stmt_ptr (iter
);
3720 if (TREE_CODE (wce
) == WITH_CLEANUP_EXPR
)
3722 if (tsi_one_before_end_p (iter
))
3724 tsi_link_before (&iter
, TREE_OPERAND (wce
, 0), TSI_SAME_STMT
);
3731 enum tree_code code
;
3733 if (CLEANUP_EH_ONLY (wce
))
3734 code
= TRY_CATCH_EXPR
;
3736 code
= TRY_FINALLY_EXPR
;
3738 sl
= tsi_split_statement_list_after (&iter
);
3739 tfe
= build (code
, void_type_node
, sl
, NULL_TREE
);
3740 append_to_statement_list (TREE_OPERAND (wce
, 0),
3741 &TREE_OPERAND (tfe
, 1));
3743 iter
= tsi_start (sl
);
3753 append_to_statement_list (body
, pre_p
);
3763 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
3764 is the cleanup action required. */
3767 gimple_push_cleanup (tree var
, tree cleanup
, bool eh_only
, tree
*pre_p
)
3771 /* Errors can result in improperly nested cleanups. Which results in
3772 confusion when trying to resolve the WITH_CLEANUP_EXPR. */
3773 if (errorcount
|| sorrycount
)
3776 if (gimple_conditional_context ())
3778 /* If we're in a conditional context, this is more complex. We only
3779 want to run the cleanup if we actually ran the initialization that
3780 necessitates it, but we want to run it after the end of the
3781 conditional context. So we wrap the try/finally around the
3782 condition and use a flag to determine whether or not to actually
3783 run the destructor. Thus
3787 becomes (approximately)
3791 if (test) { A::A(temp); flag = 1; val = f(temp); }
3794 if (flag) A::~A(temp);
3799 tree flag
= create_tmp_var (boolean_type_node
, "cleanup");
3800 tree ffalse
= build (MODIFY_EXPR
, void_type_node
, flag
,
3801 boolean_false_node
);
3802 tree ftrue
= build (MODIFY_EXPR
, void_type_node
, flag
,
3804 cleanup
= build (COND_EXPR
, void_type_node
, flag
, cleanup
, NULL
);
3805 wce
= build (WITH_CLEANUP_EXPR
, void_type_node
, cleanup
);
3806 append_to_statement_list (ffalse
, &gimplify_ctxp
->conditional_cleanups
);
3807 append_to_statement_list (wce
, &gimplify_ctxp
->conditional_cleanups
);
3808 append_to_statement_list (ftrue
, pre_p
);
3810 /* Because of this manipulation, and the EH edges that jump
3811 threading cannot redirect, the temporary (VAR) will appear
3812 to be used uninitialized. Don't warn. */
3813 TREE_NO_WARNING (var
) = 1;
3817 wce
= build (WITH_CLEANUP_EXPR
, void_type_node
, cleanup
);
3818 CLEANUP_EH_ONLY (wce
) = eh_only
;
3819 append_to_statement_list (wce
, pre_p
);
3822 gimplify_stmt (&TREE_OPERAND (wce
, 0));
3825 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
3827 static enum gimplify_status
3828 gimplify_target_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
3830 tree targ
= *expr_p
;
3831 tree temp
= TARGET_EXPR_SLOT (targ
);
3832 tree init
= TARGET_EXPR_INITIAL (targ
);
3833 enum gimplify_status ret
;
3837 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
3838 to the temps list. */
3839 gimple_add_tmp_var (temp
);
3841 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
3842 expression is supposed to initialize the slot. */
3843 if (VOID_TYPE_P (TREE_TYPE (init
)))
3844 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
, fb_none
);
3847 /* Special handling for BIND_EXPR can result in fewer temps. */
3849 if (TREE_CODE (init
) == BIND_EXPR
)
3850 gimplify_bind_expr (&init
, temp
, pre_p
);
3853 init
= build (MODIFY_EXPR
, void_type_node
, temp
, init
);
3854 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
,
3858 if (ret
== GS_ERROR
)
3860 append_to_statement_list (init
, pre_p
);
3862 /* If needed, push the cleanup for the temp. */
3863 if (TARGET_EXPR_CLEANUP (targ
))
3865 gimplify_stmt (&TARGET_EXPR_CLEANUP (targ
));
3866 gimple_push_cleanup (temp
, TARGET_EXPR_CLEANUP (targ
),
3867 CLEANUP_EH_ONLY (targ
), pre_p
);
3870 /* Only expand this once. */
3871 TREE_OPERAND (targ
, 3) = init
;
3872 TARGET_EXPR_INITIAL (targ
) = NULL_TREE
;
3875 /* We should have expanded this before. */
3876 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp
));
3882 /* Gimplification of expression trees. */
3884 /* Gimplify an expression which appears at statement context; usually, this
3885 means replacing it with a suitably gimple STATEMENT_LIST. */
3888 gimplify_stmt (tree
*stmt_p
)
3890 gimplify_expr (stmt_p
, NULL
, NULL
, is_gimple_stmt
, fb_none
);
3893 /* Similarly, but force the result to be a STATEMENT_LIST. */
3896 gimplify_to_stmt_list (tree
*stmt_p
)
3898 gimplify_stmt (stmt_p
);
3900 *stmt_p
= alloc_stmt_list ();
3901 else if (TREE_CODE (*stmt_p
) != STATEMENT_LIST
)
3904 *stmt_p
= alloc_stmt_list ();
3905 append_to_statement_list (t
, stmt_p
);
3910 /* Gimplifies the expression tree pointed to by EXPR_P. Return 0 if
3911 gimplification failed.
3913 PRE_P points to the list where side effects that must happen before
3914 EXPR should be stored.
3916 POST_P points to the list where side effects that must happen after
3917 EXPR should be stored, or NULL if there is no suitable list. In
3918 that case, we copy the result to a temporary, emit the
3919 post-effects, and then return the temporary.
3921 GIMPLE_TEST_F points to a function that takes a tree T and
3922 returns nonzero if T is in the GIMPLE form requested by the
3923 caller. The GIMPLE predicates are in tree-gimple.c.
3925 This test is used twice. Before gimplification, the test is
3926 invoked to determine whether *EXPR_P is already gimple enough. If
3927 that fails, *EXPR_P is gimplified according to its code and
3928 GIMPLE_TEST_F is called again. If the test still fails, then a new
3929 temporary variable is created and assigned the value of the
3930 gimplified expression.
3932 FALLBACK tells the function what sort of a temporary we want. If the 1
3933 bit is set, an rvalue is OK. If the 2 bit is set, an lvalue is OK.
3934 If both are set, either is OK, but an lvalue is preferable.
3936 The return value is either GS_ERROR or GS_ALL_DONE, since this function
3937 iterates until solution. */
3939 enum gimplify_status
3940 gimplify_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
,
3941 bool (* gimple_test_f
) (tree
), fallback_t fallback
)
3944 tree internal_pre
= NULL_TREE
;
3945 tree internal_post
= NULL_TREE
;
3947 int is_statement
= (pre_p
== NULL
);
3948 location_t saved_location
;
3949 enum gimplify_status ret
;
3951 save_expr
= *expr_p
;
3952 if (save_expr
== NULL_TREE
)
3955 /* We used to check the predicate here and return immediately if it
3956 succeeds. This is wrong; the design is for gimplification to be
3957 idempotent, and for the predicates to only test for valid forms, not
3958 whether they are fully simplified. */
3960 /* Set up our internal queues if needed. */
3962 pre_p
= &internal_pre
;
3964 post_p
= &internal_post
;
3966 saved_location
= input_location
;
3967 if (save_expr
!= error_mark_node
3968 && EXPR_HAS_LOCATION (*expr_p
))
3969 input_location
= EXPR_LOCATION (*expr_p
);
3971 /* Loop over the specific gimplifiers until the toplevel node
3972 remains the same. */
3975 /* Strip away as many useless type conversions as possible
3977 STRIP_USELESS_TYPE_CONVERSION (*expr_p
);
3979 /* Remember the expr. */
3980 save_expr
= *expr_p
;
3982 /* Die, die, die, my darling. */
3983 if (save_expr
== error_mark_node
3984 || (TREE_TYPE (save_expr
)
3985 && TREE_TYPE (save_expr
) == error_mark_node
))
3991 /* Do any language-specific gimplification. */
3992 ret
= lang_hooks
.gimplify_expr (expr_p
, pre_p
, post_p
);
3995 if (*expr_p
== NULL_TREE
)
3997 if (*expr_p
!= save_expr
)
4000 else if (ret
!= GS_UNHANDLED
)
4004 switch (TREE_CODE (*expr_p
))
4006 /* First deal with the special cases. */
4008 case POSTINCREMENT_EXPR
:
4009 case POSTDECREMENT_EXPR
:
4010 case PREINCREMENT_EXPR
:
4011 case PREDECREMENT_EXPR
:
4012 ret
= gimplify_self_mod_expr (expr_p
, pre_p
, post_p
,
4013 fallback
!= fb_none
);
4017 case ARRAY_RANGE_REF
:
4021 case VIEW_CONVERT_EXPR
:
4022 ret
= gimplify_compound_lval (expr_p
, pre_p
, post_p
,
4023 fallback
? fallback
: fb_rvalue
);
4027 ret
= gimplify_cond_expr (expr_p
, pre_p
, post_p
, NULL_TREE
,
4029 /* C99 code may assign to an array in a structure value of a
4030 conditional expression, and this has undefined behavior
4031 only on execution, so create a temporary if an lvalue is
4033 if (fallback
== fb_lvalue
)
4035 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
4036 lang_hooks
.mark_addressable (*expr_p
);
4041 ret
= gimplify_call_expr (expr_p
, pre_p
, fallback
!= fb_none
);
4042 /* C99 code may assign to an array in a structure returned
4043 from a function, and this has undefined behavior only on
4044 execution, so create a temporary if an lvalue is
4046 if (fallback
== fb_lvalue
)
4048 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
4049 lang_hooks
.mark_addressable (*expr_p
);
4057 ret
= gimplify_compound_expr (expr_p
, pre_p
, fallback
!= fb_none
);
4062 ret
= gimplify_modify_expr (expr_p
, pre_p
, post_p
,
4063 fallback
!= fb_none
);
4066 case TRUTH_ANDIF_EXPR
:
4067 case TRUTH_ORIF_EXPR
:
4068 ret
= gimplify_boolean_expr (expr_p
);
4071 case TRUTH_NOT_EXPR
:
4072 TREE_OPERAND (*expr_p
, 0)
4073 = gimple_boolify (TREE_OPERAND (*expr_p
, 0));
4074 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
4075 is_gimple_val
, fb_rvalue
);
4076 recalculate_side_effects (*expr_p
);
4080 ret
= gimplify_addr_expr (expr_p
, pre_p
, post_p
);
4084 ret
= gimplify_va_arg_expr (expr_p
, pre_p
, post_p
);
4089 if (IS_EMPTY_STMT (*expr_p
))
4095 if (VOID_TYPE_P (TREE_TYPE (*expr_p
))
4096 || fallback
== fb_none
)
4098 /* Just strip a conversion to void (or in void context) and
4100 *expr_p
= TREE_OPERAND (*expr_p
, 0);
4104 ret
= gimplify_conversion (expr_p
);
4105 if (ret
== GS_ERROR
)
4107 if (*expr_p
!= save_expr
)
4111 case FIX_TRUNC_EXPR
:
4113 case FIX_FLOOR_EXPR
:
4114 case FIX_ROUND_EXPR
:
4115 /* unary_expr: ... | '(' cast ')' val | ... */
4116 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
4117 is_gimple_val
, fb_rvalue
);
4118 recalculate_side_effects (*expr_p
);
4122 *expr_p
= fold_indirect_ref (*expr_p
);
4123 if (*expr_p
!= save_expr
)
4125 /* else fall through. */
4126 case ALIGN_INDIRECT_REF
:
4127 case MISALIGNED_INDIRECT_REF
:
4128 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
4129 is_gimple_reg
, fb_rvalue
);
4130 recalculate_side_effects (*expr_p
);
4133 /* Constants need not be gimplified. */
4143 /* If we require an lvalue, such as for ADDR_EXPR, retain the
4144 CONST_DECL node. Otherwise the decl is replaceable by its
4146 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
4147 if (fallback
& fb_lvalue
)
4150 *expr_p
= DECL_INITIAL (*expr_p
);
4154 ret
= gimplify_decl_expr (expr_p
);
4158 /* FIXME make this a decl. */
4163 ret
= gimplify_bind_expr (expr_p
, NULL
, pre_p
);
4167 ret
= gimplify_loop_expr (expr_p
, pre_p
);
4171 ret
= gimplify_switch_expr (expr_p
, pre_p
);
4175 ret
= gimplify_exit_expr (expr_p
);
4179 /* If the target is not LABEL, then it is a computed jump
4180 and the target needs to be gimplified. */
4181 if (TREE_CODE (GOTO_DESTINATION (*expr_p
)) != LABEL_DECL
)
4182 ret
= gimplify_expr (&GOTO_DESTINATION (*expr_p
), pre_p
,
4183 NULL
, is_gimple_val
, fb_rvalue
);
4188 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p
))
4189 == current_function_decl
);
4192 case CASE_LABEL_EXPR
:
4193 ret
= gimplify_case_label_expr (expr_p
);
4197 ret
= gimplify_return_expr (*expr_p
, pre_p
);
4201 /* Don't reduce this in place; let gimplify_init_constructor work its
4202 magic. Buf if we're just elaborating this for side effects, just
4203 gimplify any element that has side-effects. */
4204 if (fallback
== fb_none
)
4206 unsigned HOST_WIDE_INT ix
;
4207 constructor_elt
*ce
;
4209 VEC_iterate (constructor_elt
, CONSTRUCTOR_ELTS (*expr_p
),
4212 if (TREE_SIDE_EFFECTS (ce
->value
))
4213 gimplify_expr (&ce
->value
, pre_p
, post_p
,
4214 gimple_test_f
, fallback
);
4216 *expr_p
= NULL_TREE
;
4222 /* The following are special cases that are not handled by the
4223 original GIMPLE grammar. */
4225 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
4228 ret
= gimplify_save_expr (expr_p
, pre_p
, post_p
);
4233 enum gimplify_status r0
, r1
, r2
;
4235 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
4236 is_gimple_lvalue
, fb_either
);
4237 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
4238 is_gimple_val
, fb_rvalue
);
4239 r2
= gimplify_expr (&TREE_OPERAND (*expr_p
, 2), pre_p
, post_p
,
4240 is_gimple_val
, fb_rvalue
);
4241 recalculate_side_effects (*expr_p
);
4243 ret
= MIN (r0
, MIN (r1
, r2
));
4247 case NON_LVALUE_EXPR
:
4248 /* This should have been stripped above. */
4252 ret
= gimplify_asm_expr (expr_p
, pre_p
, post_p
);
4255 case TRY_FINALLY_EXPR
:
4256 case TRY_CATCH_EXPR
:
4257 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p
, 0));
4258 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p
, 1));
4262 case CLEANUP_POINT_EXPR
:
4263 ret
= gimplify_cleanup_point_expr (expr_p
, pre_p
);
4267 ret
= gimplify_target_expr (expr_p
, pre_p
, post_p
);
4271 gimplify_to_stmt_list (&CATCH_BODY (*expr_p
));
4275 case EH_FILTER_EXPR
:
4276 gimplify_to_stmt_list (&EH_FILTER_FAILURE (*expr_p
));
4282 enum gimplify_status r0
, r1
;
4283 r0
= gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p
), pre_p
, post_p
,
4284 is_gimple_val
, fb_rvalue
);
4285 r1
= gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p
), pre_p
, post_p
,
4286 is_gimple_val
, fb_rvalue
);
4292 /* We get here when taking the address of a label. We mark
4293 the label as "forced"; meaning it can never be removed and
4294 it is a potential target for any computed goto. */
4295 FORCED_LABEL (*expr_p
) = 1;
4299 case STATEMENT_LIST
:
4300 ret
= gimplify_statement_list (expr_p
);
4303 case WITH_SIZE_EXPR
:
4305 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
4306 post_p
== &internal_post
? NULL
: post_p
,
4307 gimple_test_f
, fallback
);
4308 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
4309 is_gimple_val
, fb_rvalue
);
4314 /* ??? If this is a local variable, and it has not been seen in any
4315 outer BIND_EXPR, then it's probably the result of a duplicate
4316 declaration, for which we've already issued an error. It would
4317 be really nice if the front end wouldn't leak these at all.
4318 Currently the only known culprit is C++ destructors, as seen
4319 in g++.old-deja/g++.jason/binding.C. */
4321 if (!TREE_STATIC (tmp
) && !DECL_EXTERNAL (tmp
)
4322 && decl_function_context (tmp
) == current_function_decl
4323 && !DECL_SEEN_IN_BIND_EXPR_P (tmp
))
4325 gcc_assert (errorcount
|| sorrycount
);
4334 /* If this is a local variable sized decl, it must be accessed
4335 indirectly. Perform that substitution. */
4336 if (DECL_HAS_VALUE_EXPR_P (tmp
))
4338 *expr_p
= unshare_expr (DECL_VALUE_EXPR (tmp
));
4347 /* Allow callbacks into the gimplifier during optimization. */
4352 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p
)))
4354 case tcc_comparison
:
4355 /* If this is a comparison of objects of aggregate type,
4356 handle it specially (by converting to a call to
4357 memcmp). It would be nice to only have to do this
4358 for variable-sized objects, but then we'd have to
4359 allow the same nest of reference nodes we allow for
4360 MODIFY_EXPR and that's too complex. */
4361 if (!AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p
, 1))))
4363 ret
= gimplify_variable_sized_compare (expr_p
);
4366 /* If *EXPR_P does not need to be special-cased, handle it
4367 according to its class. */
4369 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
4370 post_p
, is_gimple_val
, fb_rvalue
);
4376 enum gimplify_status r0
, r1
;
4378 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
4379 post_p
, is_gimple_val
, fb_rvalue
);
4380 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
,
4381 post_p
, is_gimple_val
, fb_rvalue
);
4387 case tcc_declaration
:
4390 goto dont_recalculate
;
4393 gcc_assert (TREE_CODE (*expr_p
) == TRUTH_AND_EXPR
4394 || TREE_CODE (*expr_p
) == TRUTH_OR_EXPR
4395 || TREE_CODE (*expr_p
) == TRUTH_XOR_EXPR
);
4399 recalculate_side_effects (*expr_p
);
4404 /* If we replaced *expr_p, gimplify again. */
4405 if (ret
== GS_OK
&& (*expr_p
== NULL
|| *expr_p
== save_expr
))
4408 while (ret
== GS_OK
);
4410 /* If we encountered an error_mark somewhere nested inside, either
4411 stub out the statement or propagate the error back out. */
4412 if (ret
== GS_ERROR
)
4419 /* This was only valid as a return value from the langhook, which
4420 we handled. Make sure it doesn't escape from any other context. */
4421 gcc_assert (ret
!= GS_UNHANDLED
);
4423 if (fallback
== fb_none
&& *expr_p
&& !is_gimple_stmt (*expr_p
))
4425 /* We aren't looking for a value, and we don't have a valid
4426 statement. If it doesn't have side-effects, throw it away. */
4427 if (!TREE_SIDE_EFFECTS (*expr_p
))
4429 else if (!TREE_THIS_VOLATILE (*expr_p
))
4431 /* This is probably a _REF that contains something nested that
4432 has side effects. Recurse through the operands to find it. */
4433 enum tree_code code
= TREE_CODE (*expr_p
);
4438 case REALPART_EXPR
: case IMAGPART_EXPR
:
4439 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
4440 gimple_test_f
, fallback
);
4443 case ARRAY_REF
: case ARRAY_RANGE_REF
:
4444 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
4445 gimple_test_f
, fallback
);
4446 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
4447 gimple_test_f
, fallback
);
4451 /* Anything else with side-effects must be converted to
4452 a valid statement before we get here. */
4458 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p
)))
4460 /* Historically, the compiler has treated a bare
4461 reference to a volatile lvalue as forcing a load. */
4462 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p
));
4463 /* Normally, we do want to create a temporary for a
4464 TREE_ADDRESSABLE type because such a type should not be
4465 copied by bitwise-assignment. However, we make an
4466 exception here, as all we are doing here is ensuring that
4467 we read the bytes that make up the type. We use
4468 create_tmp_var_raw because create_tmp_var will abort when
4469 given a TREE_ADDRESSABLE type. */
4470 tree tmp
= create_tmp_var_raw (type
, "vol");
4471 gimple_add_tmp_var (tmp
);
4472 *expr_p
= build (MODIFY_EXPR
, type
, tmp
, *expr_p
);
4475 /* We can't do anything useful with a volatile reference to
4476 incomplete type, so just throw it away. */
4480 /* If we are gimplifying at the statement level, we're done. Tack
4481 everything together and replace the original statement with the
4483 if (fallback
== fb_none
|| is_statement
)
4485 if (internal_pre
|| internal_post
)
4487 append_to_statement_list (*expr_p
, &internal_pre
);
4488 append_to_statement_list (internal_post
, &internal_pre
);
4489 annotate_all_with_locus (&internal_pre
, input_location
);
4490 *expr_p
= internal_pre
;
4494 else if (TREE_CODE (*expr_p
) == STATEMENT_LIST
)
4495 annotate_all_with_locus (expr_p
, input_location
);
4497 annotate_one_with_locus (*expr_p
, input_location
);
4501 /* Otherwise we're gimplifying a subexpression, so the resulting value is
4504 /* If it's sufficiently simple already, we're done. Unless we are
4505 handling some post-effects internally; if that's the case, we need to
4506 copy into a temp before adding the post-effects to the tree. */
4507 if (!internal_post
&& (*gimple_test_f
) (*expr_p
))
4510 /* Otherwise, we need to create a new temporary for the gimplified
4513 /* We can't return an lvalue if we have an internal postqueue. The
4514 object the lvalue refers to would (probably) be modified by the
4515 postqueue; we need to copy the value out first, which means an
4517 if ((fallback
& fb_lvalue
) && !internal_post
4518 && is_gimple_addressable (*expr_p
))
4520 /* An lvalue will do. Take the address of the expression, store it
4521 in a temporary, and replace the expression with an INDIRECT_REF of
4523 tmp
= build_fold_addr_expr (*expr_p
);
4524 gimplify_expr (&tmp
, pre_p
, post_p
, is_gimple_reg
, fb_rvalue
);
4525 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (tmp
)), tmp
);
4527 else if ((fallback
& fb_rvalue
) && is_gimple_formal_tmp_rhs (*expr_p
))
4529 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p
)));
4531 /* An rvalue will do. Assign the gimplified expression into a new
4532 temporary TMP and replace the original expression with TMP. */
4534 if (internal_post
|| (fallback
& fb_lvalue
))
4535 /* The postqueue might change the value of the expression between
4536 the initialization and use of the temporary, so we can't use a
4537 formal temp. FIXME do we care? */
4538 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
4540 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
4542 if (TREE_CODE (*expr_p
) != SSA_NAME
)
4543 DECL_GIMPLE_FORMAL_TEMP_P (*expr_p
) = 1;
4547 #ifdef ENABLE_CHECKING
4548 if (!(fallback
& fb_mayfail
))
4550 fprintf (stderr
, "gimplification failed:\n");
4551 print_generic_expr (stderr
, *expr_p
, 0);
4552 debug_tree (*expr_p
);
4553 internal_error ("gimplification failed");
4556 gcc_assert (fallback
& fb_mayfail
);
4557 /* If this is an asm statement, and the user asked for the
4558 impossible, don't die. Fail and let gimplify_asm_expr
4564 /* Make sure the temporary matches our predicate. */
4565 gcc_assert ((*gimple_test_f
) (*expr_p
));
4569 annotate_all_with_locus (&internal_post
, input_location
);
4570 append_to_statement_list (internal_post
, pre_p
);
4574 input_location
= saved_location
;
4578 /* Look through TYPE for variable-sized objects and gimplify each such
4579 size that we find. Add to LIST_P any statements generated. */
4582 gimplify_type_sizes (tree type
, tree
*list_p
)
4586 if (type
== NULL
|| type
== error_mark_node
)
4589 /* We first do the main variant, then copy into any other variants. */
4590 type
= TYPE_MAIN_VARIANT (type
);
4592 /* Avoid infinite recursion. */
4593 if (TYPE_SIZES_GIMPLIFIED (type
))
4596 TYPE_SIZES_GIMPLIFIED (type
) = 1;
4598 switch (TREE_CODE (type
))
4605 gimplify_one_sizepos (&TYPE_MIN_VALUE (type
), list_p
);
4606 gimplify_one_sizepos (&TYPE_MAX_VALUE (type
), list_p
);
4608 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
4610 TYPE_MIN_VALUE (t
) = TYPE_MIN_VALUE (type
);
4611 TYPE_MAX_VALUE (t
) = TYPE_MAX_VALUE (type
);
4616 /* These types may not have declarations, so handle them here. */
4617 gimplify_type_sizes (TREE_TYPE (type
), list_p
);
4618 gimplify_type_sizes (TYPE_DOMAIN (type
), list_p
);
4623 case QUAL_UNION_TYPE
:
4624 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
4625 if (TREE_CODE (field
) == FIELD_DECL
)
4627 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field
), list_p
);
4628 gimplify_type_sizes (TREE_TYPE (field
), list_p
);
4633 case REFERENCE_TYPE
:
4634 gimplify_type_sizes (TREE_TYPE (type
), list_p
);
4641 gimplify_one_sizepos (&TYPE_SIZE (type
), list_p
);
4642 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type
), list_p
);
4644 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
4646 TYPE_SIZE (t
) = TYPE_SIZE (type
);
4647 TYPE_SIZE_UNIT (t
) = TYPE_SIZE_UNIT (type
);
4648 TYPE_SIZES_GIMPLIFIED (t
) = 1;
4652 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
4653 a size or position, has had all of its SAVE_EXPRs evaluated.
4654 We add any required statements to STMT_P. */
4657 gimplify_one_sizepos (tree
*expr_p
, tree
*stmt_p
)
4659 tree type
, expr
= *expr_p
;
4661 /* We don't do anything if the value isn't there, is constant, or contains
4662 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
4663 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
4664 will want to replace it with a new variable, but that will cause problems
4665 if this type is from outside the function. It's OK to have that here. */
4666 if (expr
== NULL_TREE
|| TREE_CONSTANT (expr
)
4667 || TREE_CODE (expr
) == VAR_DECL
4668 || CONTAINS_PLACEHOLDER_P (expr
))
4671 type
= TREE_TYPE (expr
);
4672 *expr_p
= unshare_expr (expr
);
4674 gimplify_expr (expr_p
, stmt_p
, NULL
, is_gimple_val
, fb_rvalue
);
4677 /* Verify that we've an exact type match with the original expression.
4678 In particular, we do not wish to drop a "sizetype" in favour of a
4679 type of similar dimensions. We don't want to pollute the generic
4680 type-stripping code with this knowledge because it doesn't matter
4681 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
4682 and friends retain their "sizetype-ness". */
4683 if (TREE_TYPE (expr
) != type
4684 && TREE_CODE (type
) == INTEGER_TYPE
4685 && TYPE_IS_SIZETYPE (type
))
4689 *expr_p
= create_tmp_var (type
, NULL
);
4690 tmp
= build1 (NOP_EXPR
, type
, expr
);
4691 tmp
= build2 (MODIFY_EXPR
, type
, *expr_p
, expr
);
4692 if (EXPR_HAS_LOCATION (expr
))
4693 SET_EXPR_LOCUS (tmp
, EXPR_LOCUS (expr
));
4695 SET_EXPR_LOCATION (tmp
, input_location
);
4697 gimplify_and_add (tmp
, stmt_p
);
4701 #ifdef ENABLE_CHECKING
4702 /* Compare types A and B for a "close enough" match. */
4705 cpt_same_type (tree a
, tree b
)
4707 if (lang_hooks
.types_compatible_p (a
, b
))
4710 /* ??? The C++ FE decomposes METHOD_TYPES to FUNCTION_TYPES and doesn't
4711 link them together. This routine is intended to catch type errors
4712 that will affect the optimizers, and the optimizers don't add new
4713 dereferences of function pointers, so ignore it. */
4714 if ((TREE_CODE (a
) == FUNCTION_TYPE
|| TREE_CODE (a
) == METHOD_TYPE
)
4715 && (TREE_CODE (b
) == FUNCTION_TYPE
|| TREE_CODE (b
) == METHOD_TYPE
))
4718 /* ??? The C FE pushes type qualifiers after the fact into the type of
4719 the element from the type of the array. See build_unary_op's handling
4720 of ADDR_EXPR. This seems wrong -- if we were going to do this, we
4721 should have done it when creating the variable in the first place.
4722 Alternately, why aren't the two array types made variants? */
4723 if (TREE_CODE (a
) == ARRAY_TYPE
&& TREE_CODE (b
) == ARRAY_TYPE
)
4724 return cpt_same_type (TREE_TYPE (a
), TREE_TYPE (b
));
4726 /* And because of those, we have to recurse down through pointers. */
4727 if (POINTER_TYPE_P (a
) && POINTER_TYPE_P (b
))
4728 return cpt_same_type (TREE_TYPE (a
), TREE_TYPE (b
));
4733 /* Check for some cases of the front end missing cast expressions.
4734 The type of a dereference should correspond to the pointer type;
4735 similarly the type of an address should match its object. */
4738 check_pointer_types_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
4739 void *data ATTRIBUTE_UNUSED
)
4742 tree ptype
, otype
, dtype
;
4744 switch (TREE_CODE (t
))
4748 otype
= TREE_TYPE (t
);
4749 ptype
= TREE_TYPE (TREE_OPERAND (t
, 0));
4750 dtype
= TREE_TYPE (ptype
);
4751 gcc_assert (cpt_same_type (otype
, dtype
));
4755 ptype
= TREE_TYPE (t
);
4756 otype
= TREE_TYPE (TREE_OPERAND (t
, 0));
4757 dtype
= TREE_TYPE (ptype
);
4758 if (!cpt_same_type (otype
, dtype
))
4760 /* &array is allowed to produce a pointer to the element, rather than
4761 a pointer to the array type. We must allow this in order to
4762 properly represent assigning the address of an array in C into
4763 pointer to the element type. */
4764 gcc_assert (TREE_CODE (otype
) == ARRAY_TYPE
4765 && POINTER_TYPE_P (ptype
)
4766 && cpt_same_type (TREE_TYPE (otype
), dtype
));
4780 /* Gimplify the body of statements pointed to by BODY_P. FNDECL is the
4781 function decl containing BODY. */
4784 gimplify_body (tree
*body_p
, tree fndecl
, bool do_parms
)
4786 location_t saved_location
= input_location
;
4787 tree body
, parm_stmts
;
4789 timevar_push (TV_TREE_GIMPLIFY
);
4790 push_gimplify_context ();
4792 /* Unshare most shared trees in the body and in that of any nested functions.
4793 It would seem we don't have to do this for nested functions because
4794 they are supposed to be output and then the outer function gimplified
4795 first, but the g++ front end doesn't always do it that way. */
4796 unshare_body (body_p
, fndecl
);
4797 unvisit_body (body_p
, fndecl
);
4799 /* Make sure input_location isn't set to something wierd. */
4800 input_location
= DECL_SOURCE_LOCATION (fndecl
);
4802 /* Resolve callee-copies. This has to be done before processing
4803 the body so that DECL_VALUE_EXPR gets processed correctly. */
4804 parm_stmts
= do_parms
? gimplify_parameters () : NULL
;
4806 /* Gimplify the function's body. */
4807 gimplify_stmt (body_p
);
4811 body
= alloc_stmt_list ();
4812 else if (TREE_CODE (body
) == STATEMENT_LIST
)
4814 tree t
= expr_only (*body_p
);
4819 /* If there isn't an outer BIND_EXPR, add one. */
4820 if (TREE_CODE (body
) != BIND_EXPR
)
4822 tree b
= build (BIND_EXPR
, void_type_node
, NULL_TREE
,
4823 NULL_TREE
, NULL_TREE
);
4824 TREE_SIDE_EFFECTS (b
) = 1;
4825 append_to_statement_list_force (body
, &BIND_EXPR_BODY (b
));
4829 /* If we had callee-copies statements, insert them at the beginning
4833 append_to_statement_list_force (BIND_EXPR_BODY (body
), &parm_stmts
);
4834 BIND_EXPR_BODY (body
) = parm_stmts
;
4837 /* Unshare again, in case gimplification was sloppy. */
4838 unshare_all_trees (body
);
4842 pop_gimplify_context (body
);
4844 #ifdef ENABLE_CHECKING
4845 walk_tree (body_p
, check_pointer_types_r
, NULL
, NULL
);
4848 timevar_pop (TV_TREE_GIMPLIFY
);
4849 input_location
= saved_location
;
4852 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
4853 node for the function we want to gimplify. */
4856 gimplify_function_tree (tree fndecl
)
4858 tree oldfn
, parm
, ret
;
4860 oldfn
= current_function_decl
;
4861 current_function_decl
= fndecl
;
4862 cfun
= DECL_STRUCT_FUNCTION (fndecl
);
4864 allocate_struct_function (fndecl
);
4866 for (parm
= DECL_ARGUMENTS (fndecl
); parm
; parm
= TREE_CHAIN (parm
))
4868 /* Preliminarily mark non-addressed complex variables as eligible
4869 for promotion to gimple registers. We'll transform their uses
4871 if (TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
4872 && !TREE_THIS_VOLATILE (parm
)
4873 && !needs_to_live_in_memory (parm
))
4874 DECL_COMPLEX_GIMPLE_REG_P (parm
) = 1;
4877 ret
= DECL_RESULT (fndecl
);
4878 if (TREE_CODE (TREE_TYPE (ret
)) == COMPLEX_TYPE
4879 && !needs_to_live_in_memory (ret
))
4880 DECL_COMPLEX_GIMPLE_REG_P (ret
) = 1;
4882 gimplify_body (&DECL_SAVED_TREE (fndecl
), fndecl
, true);
4884 /* If we're instrumenting function entry/exit, then prepend the call to
4885 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
4886 catch the exit hook. */
4887 /* ??? Add some way to ignore exceptions for this TFE. */
4888 if (flag_instrument_function_entry_exit
4889 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl
))
4893 tf
= build (TRY_FINALLY_EXPR
, void_type_node
, NULL
, NULL
);
4894 TREE_SIDE_EFFECTS (tf
) = 1;
4895 x
= DECL_SAVED_TREE (fndecl
);
4896 append_to_statement_list (x
, &TREE_OPERAND (tf
, 0));
4897 x
= implicit_built_in_decls
[BUILT_IN_PROFILE_FUNC_EXIT
];
4898 x
= build_function_call_expr (x
, NULL
);
4899 append_to_statement_list (x
, &TREE_OPERAND (tf
, 1));
4901 bind
= build (BIND_EXPR
, void_type_node
, NULL
, NULL
, NULL
);
4902 TREE_SIDE_EFFECTS (bind
) = 1;
4903 x
= implicit_built_in_decls
[BUILT_IN_PROFILE_FUNC_ENTER
];
4904 x
= build_function_call_expr (x
, NULL
);
4905 append_to_statement_list (x
, &BIND_EXPR_BODY (bind
));
4906 append_to_statement_list (tf
, &BIND_EXPR_BODY (bind
));
4908 DECL_SAVED_TREE (fndecl
) = bind
;
4911 current_function_decl
= oldfn
;
4912 cfun
= oldfn
? DECL_STRUCT_FUNCTION (oldfn
) : NULL
;
4916 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
4917 force the result to be either ssa_name or an invariant, otherwise
4918 just force it to be a rhs expression. If VAR is not NULL, make the
4919 base variable of the final destination be VAR if suitable. */
4922 force_gimple_operand (tree expr
, tree
*stmts
, bool simple
, tree var
)
4925 enum gimplify_status ret
;
4926 gimple_predicate gimple_test_f
;
4930 if (is_gimple_val (expr
))
4933 gimple_test_f
= simple
? is_gimple_val
: is_gimple_reg_rhs
;
4935 push_gimplify_context ();
4936 gimplify_ctxp
->into_ssa
= in_ssa_p
;
4939 expr
= build (MODIFY_EXPR
, TREE_TYPE (var
), var
, expr
);
4941 ret
= gimplify_expr (&expr
, stmts
, NULL
,
4942 gimple_test_f
, fb_rvalue
);
4943 gcc_assert (ret
!= GS_ERROR
);
4945 if (referenced_vars
)
4947 for (t
= gimplify_ctxp
->temps
; t
; t
= TREE_CHAIN (t
))
4948 add_referenced_tmp_var (t
);
4951 pop_gimplify_context (NULL
);
4956 /* Invokes force_gimple_operand for EXPR with parameters SIMPLE_P and VAR. If
4957 some statements are produced, emits them before BSI. */
4960 force_gimple_operand_bsi (block_stmt_iterator
*bsi
, tree expr
,
4961 bool simple_p
, tree var
)
4965 expr
= force_gimple_operand (expr
, &stmts
, simple_p
, var
);
4967 bsi_insert_before (bsi
, stmts
, BSI_SAME_STMT
);
4972 #include "gt-gimplify.h"