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, 2006, 2007, 2008
4 Free Software Foundation, Inc.
5 Major work done by Sebastian Pop <s.pop@laposte.net>,
6 Diego Novillo <dnovillo@redhat.com> and Jason Merrill <jason@redhat.com>.
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify it under
11 the terms of the GNU General Public License as published by the Free
12 Software Foundation; either version 3, or (at your option) any later
15 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
16 WARRANTY; without even the implied warranty of MERCHANTABILITY or
17 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
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 #include "pointer-set.h"
51 #include "splay-tree.h"
54 enum gimplify_omp_var_data
60 GOVD_FIRSTPRIVATE
= 16,
61 GOVD_LASTPRIVATE
= 32,
64 GOVD_DEBUG_PRIVATE
= 256,
65 GOVD_DATA_SHARE_CLASS
= (GOVD_SHARED
| GOVD_PRIVATE
| GOVD_FIRSTPRIVATE
66 | GOVD_LASTPRIVATE
| GOVD_REDUCTION
| GOVD_LOCAL
)
69 struct gimplify_omp_ctx
71 struct gimplify_omp_ctx
*outer_context
;
73 struct pointer_set_t
*privatized_types
;
75 enum omp_clause_default_kind default_kind
;
77 bool is_combined_parallel
;
82 struct gimplify_ctx
*prev_context
;
84 tree current_bind_expr
;
86 tree conditional_cleanups
;
90 VEC(tree
,heap
) *case_labels
;
91 /* The formal temporary table. Should this be persistent? */
97 bool allow_rhs_cond_expr
;
100 static struct gimplify_ctx
*gimplify_ctxp
;
101 static struct gimplify_omp_ctx
*gimplify_omp_ctxp
;
105 /* Formal (expression) temporary table handling: Multiple occurrences of
106 the same scalar expression are evaluated into the same temporary. */
108 typedef struct gimple_temp_hash_elt
111 tree temp
; /* Value */
114 /* Forward declarations. */
115 static enum gimplify_status
gimplify_compound_expr (tree
*, tree
*, bool);
117 /* Mark X addressable. Unlike the langhook we expect X to be in gimple
118 form and we don't do any syntax checking. */
120 mark_addressable (tree x
)
122 while (handled_component_p (x
))
123 x
= TREE_OPERAND (x
, 0);
124 if (TREE_CODE (x
) != VAR_DECL
&& TREE_CODE (x
) != PARM_DECL
)
126 TREE_ADDRESSABLE (x
) = 1;
129 /* Return a hash value for a formal temporary table entry. */
132 gimple_tree_hash (const void *p
)
134 tree t
= ((const elt_t
*) p
)->val
;
135 return iterative_hash_expr (t
, 0);
138 /* Compare two formal temporary table entries. */
141 gimple_tree_eq (const void *p1
, const void *p2
)
143 tree t1
= ((const elt_t
*) p1
)->val
;
144 tree t2
= ((const elt_t
*) p2
)->val
;
145 enum tree_code code
= TREE_CODE (t1
);
147 if (TREE_CODE (t2
) != code
148 || TREE_TYPE (t1
) != TREE_TYPE (t2
))
151 if (!operand_equal_p (t1
, t2
, 0))
154 /* Only allow them to compare equal if they also hash equal; otherwise
155 results are nondeterminate, and we fail bootstrap comparison. */
156 gcc_assert (gimple_tree_hash (p1
) == gimple_tree_hash (p2
));
161 /* Set up a context for the gimplifier. */
164 push_gimplify_context (void)
166 struct gimplify_ctx
*c
;
168 c
= (struct gimplify_ctx
*) xcalloc (1, sizeof (struct gimplify_ctx
));
169 c
->prev_context
= gimplify_ctxp
;
171 c
->temp_htab
= htab_create (1000, gimple_tree_hash
, gimple_tree_eq
, free
);
176 /* Tear down a context for the gimplifier. If BODY is non-null, then
177 put the temporaries into the outer BIND_EXPR. Otherwise, put them
178 in the local_decls. */
181 pop_gimplify_context (tree body
)
183 struct gimplify_ctx
*c
= gimplify_ctxp
;
186 gcc_assert (c
&& !c
->current_bind_expr
);
187 gimplify_ctxp
= c
->prev_context
;
189 for (t
= c
->temps
; t
; t
= TREE_CHAIN (t
))
190 DECL_GIMPLE_FORMAL_TEMP_P (t
) = 0;
193 declare_vars (c
->temps
, body
, false);
195 record_vars (c
->temps
);
198 htab_delete (c
->temp_htab
);
203 gimple_push_bind_expr (tree bind
)
205 TREE_CHAIN (bind
) = gimplify_ctxp
->current_bind_expr
;
206 gimplify_ctxp
->current_bind_expr
= bind
;
210 gimple_pop_bind_expr (void)
212 gimplify_ctxp
->current_bind_expr
213 = TREE_CHAIN (gimplify_ctxp
->current_bind_expr
);
217 gimple_current_bind_expr (void)
219 return gimplify_ctxp
->current_bind_expr
;
222 /* Returns true iff there is a COND_EXPR between us and the innermost
223 CLEANUP_POINT_EXPR. This info is used by gimple_push_cleanup. */
226 gimple_conditional_context (void)
228 return gimplify_ctxp
->conditions
> 0;
231 /* Note that we've entered a COND_EXPR. */
234 gimple_push_condition (void)
236 #ifdef ENABLE_CHECKING
237 if (gimplify_ctxp
->conditions
== 0)
238 gcc_assert (!gimplify_ctxp
->conditional_cleanups
);
240 ++(gimplify_ctxp
->conditions
);
243 /* Note that we've left a COND_EXPR. If we're back at unconditional scope
244 now, add any conditional cleanups we've seen to the prequeue. */
247 gimple_pop_condition (tree
*pre_p
)
249 int conds
= --(gimplify_ctxp
->conditions
);
251 gcc_assert (conds
>= 0);
254 append_to_statement_list (gimplify_ctxp
->conditional_cleanups
, pre_p
);
255 gimplify_ctxp
->conditional_cleanups
= NULL_TREE
;
259 /* A stable comparison routine for use with splay trees and DECLs. */
262 splay_tree_compare_decl_uid (splay_tree_key xa
, splay_tree_key xb
)
267 return DECL_UID (a
) - DECL_UID (b
);
270 /* Create a new omp construct that deals with variable remapping. */
272 static struct gimplify_omp_ctx
*
273 new_omp_context (bool is_parallel
, bool is_combined_parallel
)
275 struct gimplify_omp_ctx
*c
;
277 c
= XCNEW (struct gimplify_omp_ctx
);
278 c
->outer_context
= gimplify_omp_ctxp
;
279 c
->variables
= splay_tree_new (splay_tree_compare_decl_uid
, 0, 0);
280 c
->privatized_types
= pointer_set_create ();
281 c
->location
= input_location
;
282 c
->is_parallel
= is_parallel
;
283 c
->is_combined_parallel
= is_combined_parallel
;
284 c
->default_kind
= OMP_CLAUSE_DEFAULT_SHARED
;
289 /* Destroy an omp construct that deals with variable remapping. */
292 delete_omp_context (struct gimplify_omp_ctx
*c
)
294 splay_tree_delete (c
->variables
);
295 pointer_set_destroy (c
->privatized_types
);
299 static void omp_add_variable (struct gimplify_omp_ctx
*, tree
, unsigned int);
300 static bool omp_notice_variable (struct gimplify_omp_ctx
*, tree
, bool);
302 /* A subroutine of append_to_statement_list{,_force}. T is not NULL. */
305 append_to_statement_list_1 (tree t
, tree
*list_p
)
308 tree_stmt_iterator i
;
312 if (t
&& TREE_CODE (t
) == STATEMENT_LIST
)
317 *list_p
= list
= alloc_stmt_list ();
321 tsi_link_after (&i
, t
, TSI_CONTINUE_LINKING
);
324 /* Add T to the end of the list container pointed to by LIST_P.
325 If T is an expression with no effects, it is ignored. */
328 append_to_statement_list (tree t
, tree
*list_p
)
330 if (t
&& TREE_SIDE_EFFECTS (t
))
331 append_to_statement_list_1 (t
, list_p
);
334 /* Similar, but the statement is always added, regardless of side effects. */
337 append_to_statement_list_force (tree t
, tree
*list_p
)
340 append_to_statement_list_1 (t
, list_p
);
343 /* Both gimplify the statement T and append it to LIST_P. */
346 gimplify_and_add (tree t
, tree
*list_p
)
349 append_to_statement_list (t
, list_p
);
352 /* Strip off a legitimate source ending from the input string NAME of
353 length LEN. Rather than having to know the names used by all of
354 our front ends, we strip off an ending of a period followed by
355 up to five characters. (Java uses ".class".) */
358 remove_suffix (char *name
, int len
)
362 for (i
= 2; i
< 8 && len
> i
; i
++)
364 if (name
[len
- i
] == '.')
366 name
[len
- i
] = '\0';
372 /* Create a nameless artificial label and put it in the current function
373 context. Returns the newly created label. */
376 create_artificial_label (void)
378 tree lab
= build_decl (LABEL_DECL
, NULL_TREE
, void_type_node
);
380 DECL_ARTIFICIAL (lab
) = 1;
381 DECL_IGNORED_P (lab
) = 1;
382 DECL_CONTEXT (lab
) = current_function_decl
;
386 /* Subroutine for find_single_pointer_decl. */
389 find_single_pointer_decl_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
392 tree
*pdecl
= (tree
*) data
;
394 if (DECL_P (*tp
) && POINTER_TYPE_P (TREE_TYPE (*tp
)))
398 /* We already found a pointer decl; return anything other
399 than NULL_TREE to unwind from walk_tree signalling that
400 we have a duplicate. */
409 /* Find the single DECL of pointer type in the tree T and return it.
410 If there are zero or more than one such DECLs, return NULL. */
413 find_single_pointer_decl (tree t
)
415 tree decl
= NULL_TREE
;
417 if (walk_tree (&t
, find_single_pointer_decl_1
, &decl
, NULL
))
419 /* find_single_pointer_decl_1 returns a nonzero value, causing
420 walk_tree to return a nonzero value, to indicate that it
421 found more than one pointer DECL. */
428 /* Create a new temporary name with PREFIX. Returns an identifier. */
430 static GTY(()) unsigned int tmp_var_id_num
;
433 create_tmp_var_name (const char *prefix
)
439 char *preftmp
= ASTRDUP (prefix
);
441 remove_suffix (preftmp
, strlen (preftmp
));
445 ASM_FORMAT_PRIVATE_NAME (tmp_name
, prefix
? prefix
: "T", tmp_var_id_num
++);
446 return get_identifier (tmp_name
);
450 /* Create a new temporary variable declaration of type TYPE.
451 Does NOT push it into the current binding. */
454 create_tmp_var_raw (tree type
, const char *prefix
)
459 /* Make the type of the variable writable. */
460 new_type
= build_type_variant (type
, 0, 0);
461 TYPE_ATTRIBUTES (new_type
) = TYPE_ATTRIBUTES (type
);
463 tmp_var
= build_decl (VAR_DECL
, prefix
? create_tmp_var_name (prefix
) : NULL
,
466 /* The variable was declared by the compiler. */
467 DECL_ARTIFICIAL (tmp_var
) = 1;
468 /* And we don't want debug info for it. */
469 DECL_IGNORED_P (tmp_var
) = 1;
471 /* Make the variable writable. */
472 TREE_READONLY (tmp_var
) = 0;
474 DECL_EXTERNAL (tmp_var
) = 0;
475 TREE_STATIC (tmp_var
) = 0;
476 TREE_USED (tmp_var
) = 1;
481 /* Create a new temporary variable declaration of type TYPE. DOES push the
482 variable into the current binding. Further, assume that this is called
483 only from gimplification or optimization, at which point the creation of
484 certain types are bugs. */
487 create_tmp_var (tree type
, const char *prefix
)
491 /* We don't allow types that are addressable (meaning we can't make copies),
492 or incomplete. We also used to reject every variable size objects here,
493 but now support those for which a constant upper bound can be obtained.
494 The processing for variable sizes is performed in gimple_add_tmp_var,
495 point at which it really matters and possibly reached via paths not going
496 through this function, e.g. after direct calls to create_tmp_var_raw. */
497 gcc_assert (!TREE_ADDRESSABLE (type
) && COMPLETE_TYPE_P (type
));
499 tmp_var
= create_tmp_var_raw (type
, prefix
);
500 gimple_add_tmp_var (tmp_var
);
504 /* Given a tree, try to return a useful variable name that we can use
505 to prefix a temporary that is being assigned the value of the tree.
506 I.E. given <temp> = &A, return A. */
509 get_name (const_tree t
)
511 const_tree stripped_decl
;
514 STRIP_NOPS (stripped_decl
);
515 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
516 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
519 switch (TREE_CODE (stripped_decl
))
522 return get_name (TREE_OPERAND (stripped_decl
, 0));
529 /* Create a temporary with a name derived from VAL. Subroutine of
530 lookup_tmp_var; nobody else should call this function. */
533 create_tmp_from_val (tree val
)
535 return create_tmp_var (TYPE_MAIN_VARIANT (TREE_TYPE (val
)), get_name (val
));
538 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
539 an existing expression temporary. */
542 lookup_tmp_var (tree val
, bool is_formal
)
546 /* If not optimizing, never really reuse a temporary. local-alloc
547 won't allocate any variable that is used in more than one basic
548 block, which means it will go into memory, causing much extra
549 work in reload and final and poorer code generation, outweighing
550 the extra memory allocation here. */
551 if (!optimize
|| !is_formal
|| TREE_SIDE_EFFECTS (val
))
552 ret
= create_tmp_from_val (val
);
559 slot
= htab_find_slot (gimplify_ctxp
->temp_htab
, (void *)&elt
, INSERT
);
562 elt_p
= XNEW (elt_t
);
564 elt_p
->temp
= ret
= create_tmp_from_val (val
);
565 *slot
= (void *) elt_p
;
569 elt_p
= (elt_t
*) *slot
;
575 DECL_GIMPLE_FORMAL_TEMP_P (ret
) = 1;
580 /* Returns a formal temporary variable initialized with VAL. PRE_P is as
581 in gimplify_expr. Only use this function if:
583 1) The value of the unfactored expression represented by VAL will not
584 change between the initialization and use of the temporary, and
585 2) The temporary will not be otherwise modified.
587 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
588 and #2 means it is inappropriate for && temps.
590 For other cases, use get_initialized_tmp_var instead. */
593 internal_get_tmp_var (tree val
, tree
*pre_p
, tree
*post_p
, bool is_formal
)
597 gimplify_expr (&val
, pre_p
, post_p
, is_gimple_formal_tmp_rhs
, fb_rvalue
);
599 t
= lookup_tmp_var (val
, is_formal
);
603 tree u
= find_single_pointer_decl (val
);
605 if (u
&& TREE_CODE (u
) == VAR_DECL
&& DECL_BASED_ON_RESTRICT_P (u
))
606 u
= DECL_GET_RESTRICT_BASE (u
);
607 if (u
&& TYPE_RESTRICT (TREE_TYPE (u
)))
609 if (DECL_BASED_ON_RESTRICT_P (t
))
610 gcc_assert (u
== DECL_GET_RESTRICT_BASE (t
));
613 DECL_BASED_ON_RESTRICT_P (t
) = 1;
614 SET_DECL_RESTRICT_BASE (t
, u
);
619 if (TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
620 || TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
621 DECL_GIMPLE_REG_P (t
) = 1;
623 mod
= build2 (INIT_EXPR
, TREE_TYPE (t
), t
, unshare_expr (val
));
625 if (EXPR_HAS_LOCATION (val
))
626 SET_EXPR_LOCUS (mod
, EXPR_LOCUS (val
));
628 SET_EXPR_LOCATION (mod
, input_location
);
630 /* gimplify_modify_expr might want to reduce this further. */
631 gimplify_and_add (mod
, pre_p
);
633 /* If we're gimplifying into ssa, gimplify_modify_expr will have
634 given our temporary an ssa name. Find and return it. */
635 if (gimplify_ctxp
->into_ssa
)
636 t
= TREE_OPERAND (mod
, 0);
641 /* Returns a formal temporary variable initialized with VAL. PRE_P
642 points to a statement list where side-effects needed to compute VAL
646 get_formal_tmp_var (tree val
, tree
*pre_p
)
648 return internal_get_tmp_var (val
, pre_p
, NULL
, true);
651 /* Returns a temporary variable initialized with VAL. PRE_P and POST_P
652 are as in gimplify_expr. */
655 get_initialized_tmp_var (tree val
, tree
*pre_p
, tree
*post_p
)
657 return internal_get_tmp_var (val
, pre_p
, post_p
, false);
660 /* Declares all the variables in VARS in SCOPE. If DEBUG_INFO is
661 true, generate debug info for them; otherwise don't. */
664 declare_vars (tree vars
, tree scope
, bool debug_info
)
671 /* C99 mode puts the default 'return 0;' for main outside the outer
672 braces. So drill down until we find an actual scope. */
673 while (TREE_CODE (scope
) == COMPOUND_EXPR
)
674 scope
= TREE_OPERAND (scope
, 0);
676 gcc_assert (TREE_CODE (scope
) == BIND_EXPR
);
678 temps
= nreverse (last
);
680 block
= BIND_EXPR_BLOCK (scope
);
681 if (!block
|| !debug_info
)
683 TREE_CHAIN (last
) = BIND_EXPR_VARS (scope
);
684 BIND_EXPR_VARS (scope
) = temps
;
688 /* We need to attach the nodes both to the BIND_EXPR and to its
689 associated BLOCK for debugging purposes. The key point here
690 is that the BLOCK_VARS of the BIND_EXPR_BLOCK of a BIND_EXPR
691 is a subchain of the BIND_EXPR_VARS of the BIND_EXPR. */
692 if (BLOCK_VARS (block
))
693 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), temps
);
696 BIND_EXPR_VARS (scope
) = chainon (BIND_EXPR_VARS (scope
), temps
);
697 BLOCK_VARS (block
) = temps
;
703 /* For VAR a VAR_DECL of variable size, try to find a constant upper bound
704 for the size and adjust DECL_SIZE/DECL_SIZE_UNIT accordingly. Abort if
705 no such upper bound can be obtained. */
708 force_constant_size (tree var
)
710 /* The only attempt we make is by querying the maximum size of objects
711 of the variable's type. */
713 HOST_WIDE_INT max_size
;
715 gcc_assert (TREE_CODE (var
) == VAR_DECL
);
717 max_size
= max_int_size_in_bytes (TREE_TYPE (var
));
719 gcc_assert (max_size
>= 0);
722 = build_int_cst (TREE_TYPE (DECL_SIZE_UNIT (var
)), max_size
);
724 = build_int_cst (TREE_TYPE (DECL_SIZE (var
)), max_size
* BITS_PER_UNIT
);
728 gimple_add_tmp_var (tree tmp
)
730 gcc_assert (!TREE_CHAIN (tmp
) && !DECL_SEEN_IN_BIND_EXPR_P (tmp
));
732 /* Later processing assumes that the object size is constant, which might
733 not be true at this point. Force the use of a constant upper bound in
735 if (!host_integerp (DECL_SIZE_UNIT (tmp
), 1))
736 force_constant_size (tmp
);
738 DECL_CONTEXT (tmp
) = current_function_decl
;
739 DECL_SEEN_IN_BIND_EXPR_P (tmp
) = 1;
743 TREE_CHAIN (tmp
) = gimplify_ctxp
->temps
;
744 gimplify_ctxp
->temps
= tmp
;
746 /* Mark temporaries local within the nearest enclosing parallel. */
747 if (gimplify_omp_ctxp
)
749 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
750 while (ctx
&& !ctx
->is_parallel
)
751 ctx
= ctx
->outer_context
;
753 omp_add_variable (ctx
, tmp
, GOVD_LOCAL
| GOVD_SEEN
);
759 declare_vars (tmp
, DECL_SAVED_TREE (current_function_decl
), false);
762 /* Determines whether to assign a locus to the statement STMT. */
765 should_carry_locus_p (const_tree stmt
)
767 /* Don't emit a line note for a label. We particularly don't want to
768 emit one for the break label, since it doesn't actually correspond
769 to the beginning of the loop/switch. */
770 if (TREE_CODE (stmt
) == LABEL_EXPR
)
773 /* Do not annotate empty statements, since it confuses gcov. */
774 if (!TREE_SIDE_EFFECTS (stmt
))
781 annotate_one_with_locus (tree t
, location_t locus
)
783 if (CAN_HAVE_LOCATION_P (t
)
784 && ! EXPR_HAS_LOCATION (t
) && should_carry_locus_p (t
))
785 SET_EXPR_LOCATION (t
, locus
);
789 annotate_all_with_locus (tree
*stmt_p
, location_t locus
)
791 tree_stmt_iterator i
;
796 for (i
= tsi_start (*stmt_p
); !tsi_end_p (i
); tsi_next (&i
))
798 tree t
= tsi_stmt (i
);
800 /* Assuming we've already been gimplified, we shouldn't
801 see nested chaining constructs anymore. */
802 gcc_assert (TREE_CODE (t
) != STATEMENT_LIST
803 && TREE_CODE (t
) != COMPOUND_EXPR
);
805 annotate_one_with_locus (t
, locus
);
809 /* Similar to copy_tree_r() but do not copy SAVE_EXPR or TARGET_EXPR nodes.
810 These nodes model computations that should only be done once. If we
811 were to unshare something like SAVE_EXPR(i++), the gimplification
812 process would create wrong code. */
815 mostly_copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data
)
817 enum tree_code code
= TREE_CODE (*tp
);
818 /* Don't unshare types, decls, constants and SAVE_EXPR nodes. */
819 if (TREE_CODE_CLASS (code
) == tcc_type
820 || TREE_CODE_CLASS (code
) == tcc_declaration
821 || TREE_CODE_CLASS (code
) == tcc_constant
822 || code
== SAVE_EXPR
|| code
== TARGET_EXPR
823 /* We can't do anything sensible with a BLOCK used as an expression,
824 but we also can't just die when we see it because of non-expression
825 uses. So just avert our eyes and cross our fingers. Silly Java. */
830 gcc_assert (code
!= BIND_EXPR
);
831 copy_tree_r (tp
, walk_subtrees
, data
);
837 /* Callback for walk_tree to unshare most of the shared trees rooted at
838 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
839 then *TP is deep copied by calling copy_tree_r.
841 This unshares the same trees as copy_tree_r with the exception of
842 SAVE_EXPR nodes. These nodes model computations that should only be
843 done once. If we were to unshare something like SAVE_EXPR(i++), the
844 gimplification process would create wrong code. */
847 copy_if_shared_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
848 void *data ATTRIBUTE_UNUSED
)
851 enum tree_code code
= TREE_CODE (t
);
853 /* Skip types, decls, and constants. But we do want to look at their
854 types and the bounds of types. Mark them as visited so we properly
855 unmark their subtrees on the unmark pass. If we've already seen them,
856 don't look down further. */
857 if (TREE_CODE_CLASS (code
) == tcc_type
858 || TREE_CODE_CLASS (code
) == tcc_declaration
859 || TREE_CODE_CLASS (code
) == tcc_constant
)
861 if (TREE_VISITED (t
))
864 TREE_VISITED (t
) = 1;
867 /* If this node has been visited already, unshare it and don't look
869 else if (TREE_VISITED (t
))
871 walk_tree (tp
, mostly_copy_tree_r
, NULL
, NULL
);
875 /* Otherwise, mark the tree as visited and keep looking. */
877 TREE_VISITED (t
) = 1;
883 unmark_visited_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
884 void *data ATTRIBUTE_UNUSED
)
886 if (TREE_VISITED (*tp
))
887 TREE_VISITED (*tp
) = 0;
894 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
895 bodies of any nested functions if we are unsharing the entire body of
899 unshare_body (tree
*body_p
, tree fndecl
)
901 struct cgraph_node
*cgn
= cgraph_node (fndecl
);
903 walk_tree (body_p
, copy_if_shared_r
, NULL
, NULL
);
904 if (body_p
== &DECL_SAVED_TREE (fndecl
))
905 for (cgn
= cgn
->nested
; cgn
; cgn
= cgn
->next_nested
)
906 unshare_body (&DECL_SAVED_TREE (cgn
->decl
), cgn
->decl
);
909 /* Likewise, but mark all trees as not visited. */
912 unvisit_body (tree
*body_p
, tree fndecl
)
914 struct cgraph_node
*cgn
= cgraph_node (fndecl
);
916 walk_tree (body_p
, unmark_visited_r
, NULL
, NULL
);
917 if (body_p
== &DECL_SAVED_TREE (fndecl
))
918 for (cgn
= cgn
->nested
; cgn
; cgn
= cgn
->next_nested
)
919 unvisit_body (&DECL_SAVED_TREE (cgn
->decl
), cgn
->decl
);
922 /* Unshare T and all the trees reached from T via TREE_CHAIN. */
925 unshare_all_trees (tree t
)
927 walk_tree (&t
, copy_if_shared_r
, NULL
, NULL
);
928 walk_tree (&t
, unmark_visited_r
, NULL
, NULL
);
931 /* Unconditionally make an unshared copy of EXPR. This is used when using
932 stored expressions which span multiple functions, such as BINFO_VTABLE,
933 as the normal unsharing process can't tell that they're shared. */
936 unshare_expr (tree expr
)
938 walk_tree (&expr
, mostly_copy_tree_r
, NULL
, NULL
);
942 /* A terser interface for building a representation of an exception
946 gimple_build_eh_filter (tree body
, tree allowed
, tree failure
)
950 /* FIXME should the allowed types go in TREE_TYPE? */
951 t
= build2 (EH_FILTER_EXPR
, void_type_node
, allowed
, NULL_TREE
);
952 append_to_statement_list (failure
, &EH_FILTER_FAILURE (t
));
954 t
= build2 (TRY_CATCH_EXPR
, void_type_node
, NULL_TREE
, t
);
955 append_to_statement_list (body
, &TREE_OPERAND (t
, 0));
961 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
962 contain statements and have a value. Assign its value to a temporary
963 and give it void_type_node. Returns the temporary, or NULL_TREE if
964 WRAPPER was already void. */
967 voidify_wrapper_expr (tree wrapper
, tree temp
)
969 tree type
= TREE_TYPE (wrapper
);
970 if (type
&& !VOID_TYPE_P (type
))
974 /* Set p to point to the body of the wrapper. Loop until we find
975 something that isn't a wrapper. */
976 for (p
= &wrapper
; p
&& *p
; )
978 switch (TREE_CODE (*p
))
981 TREE_SIDE_EFFECTS (*p
) = 1;
982 TREE_TYPE (*p
) = void_type_node
;
983 /* For a BIND_EXPR, the body is operand 1. */
984 p
= &BIND_EXPR_BODY (*p
);
987 case CLEANUP_POINT_EXPR
:
988 case TRY_FINALLY_EXPR
:
990 TREE_SIDE_EFFECTS (*p
) = 1;
991 TREE_TYPE (*p
) = void_type_node
;
992 p
= &TREE_OPERAND (*p
, 0);
997 tree_stmt_iterator i
= tsi_last (*p
);
998 TREE_SIDE_EFFECTS (*p
) = 1;
999 TREE_TYPE (*p
) = void_type_node
;
1000 p
= tsi_end_p (i
) ? NULL
: tsi_stmt_ptr (i
);
1005 /* Advance to the last statement. Set all container types to void. */
1006 for (; TREE_CODE (*p
) == COMPOUND_EXPR
; p
= &TREE_OPERAND (*p
, 1))
1008 TREE_SIDE_EFFECTS (*p
) = 1;
1009 TREE_TYPE (*p
) = void_type_node
;
1019 if (p
== NULL
|| IS_EMPTY_STMT (*p
))
1023 /* The wrapper is on the RHS of an assignment that we're pushing
1025 gcc_assert (TREE_CODE (temp
) == INIT_EXPR
1026 || TREE_CODE (temp
) == GIMPLE_MODIFY_STMT
1027 || TREE_CODE (temp
) == MODIFY_EXPR
);
1028 GENERIC_TREE_OPERAND (temp
, 1) = *p
;
1033 temp
= create_tmp_var (type
, "retval");
1034 *p
= build2 (INIT_EXPR
, type
, temp
, *p
);
1043 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
1044 a temporary through which they communicate. */
1047 build_stack_save_restore (tree
*save
, tree
*restore
)
1049 tree save_call
, tmp_var
;
1052 build_call_expr (implicit_built_in_decls
[BUILT_IN_STACK_SAVE
], 0);
1053 tmp_var
= create_tmp_var (ptr_type_node
, "saved_stack");
1055 *save
= build_gimple_modify_stmt (tmp_var
, save_call
);
1057 build_call_expr (implicit_built_in_decls
[BUILT_IN_STACK_RESTORE
],
1061 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
1063 static enum gimplify_status
1064 gimplify_bind_expr (tree
*expr_p
, tree
*pre_p
)
1066 tree bind_expr
= *expr_p
;
1067 bool old_save_stack
= gimplify_ctxp
->save_stack
;
1070 tree temp
= voidify_wrapper_expr (bind_expr
, NULL
);
1072 /* Mark variables seen in this bind expr. */
1073 for (t
= BIND_EXPR_VARS (bind_expr
); t
; t
= TREE_CHAIN (t
))
1075 if (TREE_CODE (t
) == VAR_DECL
)
1077 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
1079 /* Mark variable as local. */
1080 if (ctx
&& !is_global_var (t
)
1081 && (! DECL_SEEN_IN_BIND_EXPR_P (t
)
1082 || splay_tree_lookup (ctx
->variables
,
1083 (splay_tree_key
) t
) == NULL
))
1084 omp_add_variable (gimplify_omp_ctxp
, t
, GOVD_LOCAL
| GOVD_SEEN
);
1086 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
1089 /* Preliminarily mark non-addressed complex variables as eligible
1090 for promotion to gimple registers. We'll transform their uses
1092 if ((TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
1093 || TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
1094 && !TREE_THIS_VOLATILE (t
)
1095 && (TREE_CODE (t
) == VAR_DECL
&& !DECL_HARD_REGISTER (t
))
1096 && !needs_to_live_in_memory (t
))
1097 DECL_GIMPLE_REG_P (t
) = 1;
1100 gimple_push_bind_expr (bind_expr
);
1101 gimplify_ctxp
->save_stack
= false;
1103 gimplify_to_stmt_list (&BIND_EXPR_BODY (bind_expr
));
1105 if (gimplify_ctxp
->save_stack
)
1107 tree stack_save
, stack_restore
;
1109 /* Save stack on entry and restore it on exit. Add a try_finally
1110 block to achieve this. Note that mudflap depends on the
1111 format of the emitted code: see mx_register_decls(). */
1112 build_stack_save_restore (&stack_save
, &stack_restore
);
1114 t
= build2 (TRY_FINALLY_EXPR
, void_type_node
,
1115 BIND_EXPR_BODY (bind_expr
), NULL_TREE
);
1116 append_to_statement_list (stack_restore
, &TREE_OPERAND (t
, 1));
1118 BIND_EXPR_BODY (bind_expr
) = NULL_TREE
;
1119 append_to_statement_list (stack_save
, &BIND_EXPR_BODY (bind_expr
));
1120 append_to_statement_list (t
, &BIND_EXPR_BODY (bind_expr
));
1123 gimplify_ctxp
->save_stack
= old_save_stack
;
1124 gimple_pop_bind_expr ();
1129 append_to_statement_list (bind_expr
, pre_p
);
1136 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1137 GIMPLE value, it is assigned to a new temporary and the statement is
1138 re-written to return the temporary.
1140 PRE_P points to the list where side effects that must happen before
1141 STMT should be stored. */
1143 static enum gimplify_status
1144 gimplify_return_expr (tree stmt
, tree
*pre_p
)
1146 tree ret_expr
= TREE_OPERAND (stmt
, 0);
1147 tree result_decl
, result
;
1149 if (!ret_expr
|| TREE_CODE (ret_expr
) == RESULT_DECL
1150 || ret_expr
== error_mark_node
)
1153 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
1154 result_decl
= NULL_TREE
;
1157 result_decl
= GENERIC_TREE_OPERAND (ret_expr
, 0);
1158 if (TREE_CODE (result_decl
) == INDIRECT_REF
)
1159 /* See through a return by reference. */
1160 result_decl
= TREE_OPERAND (result_decl
, 0);
1162 gcc_assert ((TREE_CODE (ret_expr
) == MODIFY_EXPR
1163 || TREE_CODE (ret_expr
) == GIMPLE_MODIFY_STMT
1164 || TREE_CODE (ret_expr
) == INIT_EXPR
)
1165 && TREE_CODE (result_decl
) == RESULT_DECL
);
1168 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1169 Recall that aggregate_value_p is FALSE for any aggregate type that is
1170 returned in registers. If we're returning values in registers, then
1171 we don't want to extend the lifetime of the RESULT_DECL, particularly
1172 across another call. In addition, for those aggregates for which
1173 hard_function_value generates a PARALLEL, we'll die during normal
1174 expansion of structure assignments; there's special code in expand_return
1175 to handle this case that does not exist in expand_expr. */
1177 || aggregate_value_p (result_decl
, TREE_TYPE (current_function_decl
)))
1178 result
= result_decl
;
1179 else if (gimplify_ctxp
->return_temp
)
1180 result
= gimplify_ctxp
->return_temp
;
1183 result
= create_tmp_var (TREE_TYPE (result_decl
), NULL
);
1184 if (TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
1185 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
1186 DECL_GIMPLE_REG_P (result
) = 1;
1188 /* ??? With complex control flow (usually involving abnormal edges),
1189 we can wind up warning about an uninitialized value for this. Due
1190 to how this variable is constructed and initialized, this is never
1191 true. Give up and never warn. */
1192 TREE_NO_WARNING (result
) = 1;
1194 gimplify_ctxp
->return_temp
= result
;
1197 /* Smash the lhs of the GIMPLE_MODIFY_STMT to the temporary we plan to use.
1198 Then gimplify the whole thing. */
1199 if (result
!= result_decl
)
1200 GENERIC_TREE_OPERAND (ret_expr
, 0) = result
;
1202 gimplify_and_add (TREE_OPERAND (stmt
, 0), pre_p
);
1204 /* If we didn't use a temporary, then the result is just the result_decl.
1205 Otherwise we need a simple copy. This should already be gimple. */
1206 if (result
== result_decl
)
1209 ret_expr
= build_gimple_modify_stmt (result_decl
, result
);
1210 TREE_OPERAND (stmt
, 0) = ret_expr
;
1216 gimplify_vla_decl (tree decl
, tree
*stmt_p
)
1218 /* This is a variable-sized decl. Simplify its size and mark it
1219 for deferred expansion. Note that mudflap depends on the format
1220 of the emitted code: see mx_register_decls(). */
1221 tree t
, addr
, ptr_type
;
1223 gimplify_one_sizepos (&DECL_SIZE (decl
), stmt_p
);
1224 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl
), stmt_p
);
1226 /* All occurrences of this decl in final gimplified code will be
1227 replaced by indirection. Setting DECL_VALUE_EXPR does two
1228 things: First, it lets the rest of the gimplifier know what
1229 replacement to use. Second, it lets the debug info know
1230 where to find the value. */
1231 ptr_type
= build_pointer_type (TREE_TYPE (decl
));
1232 addr
= create_tmp_var (ptr_type
, get_name (decl
));
1233 DECL_IGNORED_P (addr
) = 0;
1234 t
= build_fold_indirect_ref (addr
);
1235 SET_DECL_VALUE_EXPR (decl
, t
);
1236 DECL_HAS_VALUE_EXPR_P (decl
) = 1;
1238 t
= built_in_decls
[BUILT_IN_ALLOCA
];
1239 t
= build_call_expr (t
, 1, DECL_SIZE_UNIT (decl
));
1240 t
= fold_convert (ptr_type
, t
);
1241 t
= build_gimple_modify_stmt (addr
, t
);
1243 gimplify_and_add (t
, stmt_p
);
1245 /* Indicate that we need to restore the stack level when the
1246 enclosing BIND_EXPR is exited. */
1247 gimplify_ctxp
->save_stack
= true;
1250 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
1251 and initialization explicit. */
1253 static enum gimplify_status
1254 gimplify_decl_expr (tree
*stmt_p
)
1256 tree stmt
= *stmt_p
;
1257 tree decl
= DECL_EXPR_DECL (stmt
);
1259 *stmt_p
= NULL_TREE
;
1261 if (TREE_TYPE (decl
) == error_mark_node
)
1264 if ((TREE_CODE (decl
) == TYPE_DECL
1265 || TREE_CODE (decl
) == VAR_DECL
)
1266 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl
)))
1267 gimplify_type_sizes (TREE_TYPE (decl
), stmt_p
);
1269 if (TREE_CODE (decl
) == VAR_DECL
&& !DECL_EXTERNAL (decl
))
1271 tree init
= DECL_INITIAL (decl
);
1273 if (TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
1274 gimplify_vla_decl (decl
, stmt_p
);
1276 if (init
&& init
!= error_mark_node
)
1278 if (!TREE_STATIC (decl
))
1280 DECL_INITIAL (decl
) = NULL_TREE
;
1281 init
= build2 (INIT_EXPR
, void_type_node
, decl
, init
);
1282 gimplify_and_add (init
, stmt_p
);
1285 /* We must still examine initializers for static variables
1286 as they may contain a label address. */
1287 walk_tree (&init
, force_labels_r
, NULL
, NULL
);
1290 /* Some front ends do not explicitly declare all anonymous
1291 artificial variables. We compensate here by declaring the
1292 variables, though it would be better if the front ends would
1293 explicitly declare them. */
1294 if (!DECL_SEEN_IN_BIND_EXPR_P (decl
)
1295 && DECL_ARTIFICIAL (decl
) && DECL_NAME (decl
) == NULL_TREE
)
1296 gimple_add_tmp_var (decl
);
1302 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1303 and replacing the LOOP_EXPR with goto, but if the loop contains an
1304 EXIT_EXPR, we need to append a label for it to jump to. */
1306 static enum gimplify_status
1307 gimplify_loop_expr (tree
*expr_p
, tree
*pre_p
)
1309 tree saved_label
= gimplify_ctxp
->exit_label
;
1310 tree start_label
= build1 (LABEL_EXPR
, void_type_node
, NULL_TREE
);
1311 tree jump_stmt
= build_and_jump (&LABEL_EXPR_LABEL (start_label
));
1313 append_to_statement_list (start_label
, pre_p
);
1315 gimplify_ctxp
->exit_label
= NULL_TREE
;
1317 gimplify_and_add (LOOP_EXPR_BODY (*expr_p
), pre_p
);
1319 if (gimplify_ctxp
->exit_label
)
1321 append_to_statement_list (jump_stmt
, pre_p
);
1322 *expr_p
= build1 (LABEL_EXPR
, void_type_node
, gimplify_ctxp
->exit_label
);
1325 *expr_p
= jump_stmt
;
1327 gimplify_ctxp
->exit_label
= saved_label
;
1332 /* Compare two case labels. Because the front end should already have
1333 made sure that case ranges do not overlap, it is enough to only compare
1334 the CASE_LOW values of each case label. */
1337 compare_case_labels (const void *p1
, const void *p2
)
1339 const_tree
const case1
= *(const_tree
const*)p1
;
1340 const_tree
const case2
= *(const_tree
const*)p2
;
1342 return tree_int_cst_compare (CASE_LOW (case1
), CASE_LOW (case2
));
1345 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1348 sort_case_labels (tree label_vec
)
1350 size_t len
= TREE_VEC_LENGTH (label_vec
);
1351 tree default_case
= TREE_VEC_ELT (label_vec
, len
- 1);
1353 if (CASE_LOW (default_case
))
1357 /* The last label in the vector should be the default case
1359 for (i
= 0; i
< len
; ++i
)
1361 tree t
= TREE_VEC_ELT (label_vec
, i
);
1365 TREE_VEC_ELT (label_vec
, i
) = TREE_VEC_ELT (label_vec
, len
- 1);
1366 TREE_VEC_ELT (label_vec
, len
- 1) = default_case
;
1372 qsort (&TREE_VEC_ELT (label_vec
, 0), len
- 1, sizeof (tree
),
1373 compare_case_labels
);
1376 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1379 static enum gimplify_status
1380 gimplify_switch_expr (tree
*expr_p
, tree
*pre_p
)
1382 tree switch_expr
= *expr_p
;
1383 enum gimplify_status ret
;
1385 ret
= gimplify_expr (&SWITCH_COND (switch_expr
), pre_p
, NULL
,
1386 is_gimple_val
, fb_rvalue
);
1388 if (SWITCH_BODY (switch_expr
))
1390 VEC(tree
,heap
) *labels
, *saved_labels
;
1391 tree label_vec
, default_case
= NULL_TREE
;
1394 /* If someone can be bothered to fill in the labels, they can
1395 be bothered to null out the body too. */
1396 gcc_assert (!SWITCH_LABELS (switch_expr
));
1398 saved_labels
= gimplify_ctxp
->case_labels
;
1399 gimplify_ctxp
->case_labels
= VEC_alloc (tree
, heap
, 8);
1401 gimplify_to_stmt_list (&SWITCH_BODY (switch_expr
));
1403 labels
= gimplify_ctxp
->case_labels
;
1404 gimplify_ctxp
->case_labels
= saved_labels
;
1407 while (i
< VEC_length (tree
, labels
))
1409 tree elt
= VEC_index (tree
, labels
, i
);
1410 tree low
= CASE_LOW (elt
);
1411 bool remove_element
= FALSE
;
1415 /* Discard empty ranges. */
1416 tree high
= CASE_HIGH (elt
);
1417 if (high
&& tree_int_cst_lt (high
, low
))
1418 remove_element
= TRUE
;
1422 /* The default case must be the last label in the list. */
1423 gcc_assert (!default_case
);
1425 remove_element
= TRUE
;
1429 VEC_ordered_remove (tree
, labels
, i
);
1435 label_vec
= make_tree_vec (len
+ 1);
1436 SWITCH_LABELS (*expr_p
) = label_vec
;
1437 append_to_statement_list (switch_expr
, pre_p
);
1441 /* If the switch has no default label, add one, so that we jump
1442 around the switch body. */
1443 default_case
= build3 (CASE_LABEL_EXPR
, void_type_node
, NULL_TREE
,
1444 NULL_TREE
, create_artificial_label ());
1445 append_to_statement_list (SWITCH_BODY (switch_expr
), pre_p
);
1446 *expr_p
= build1 (LABEL_EXPR
, void_type_node
,
1447 CASE_LABEL (default_case
));
1450 *expr_p
= SWITCH_BODY (switch_expr
);
1452 for (i
= 0; i
< len
; ++i
)
1453 TREE_VEC_ELT (label_vec
, i
) = VEC_index (tree
, labels
, i
);
1454 TREE_VEC_ELT (label_vec
, len
) = default_case
;
1456 VEC_free (tree
, heap
, labels
);
1458 sort_case_labels (label_vec
);
1460 SWITCH_BODY (switch_expr
) = NULL
;
1463 gcc_assert (SWITCH_LABELS (switch_expr
));
1468 static enum gimplify_status
1469 gimplify_case_label_expr (tree
*expr_p
)
1471 tree expr
= *expr_p
;
1472 struct gimplify_ctx
*ctxp
;
1474 /* Invalid OpenMP programs can play Duff's Device type games with
1475 #pragma omp parallel. At least in the C front end, we don't
1476 detect such invalid branches until after gimplification. */
1477 for (ctxp
= gimplify_ctxp
; ; ctxp
= ctxp
->prev_context
)
1478 if (ctxp
->case_labels
)
1481 VEC_safe_push (tree
, heap
, ctxp
->case_labels
, expr
);
1482 *expr_p
= build1 (LABEL_EXPR
, void_type_node
, CASE_LABEL (expr
));
1486 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1490 build_and_jump (tree
*label_p
)
1492 if (label_p
== NULL
)
1493 /* If there's nowhere to jump, just fall through. */
1496 if (*label_p
== NULL_TREE
)
1498 tree label
= create_artificial_label ();
1502 return build1 (GOTO_EXPR
, void_type_node
, *label_p
);
1505 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1506 This also involves building a label to jump to and communicating it to
1507 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1509 static enum gimplify_status
1510 gimplify_exit_expr (tree
*expr_p
)
1512 tree cond
= TREE_OPERAND (*expr_p
, 0);
1515 expr
= build_and_jump (&gimplify_ctxp
->exit_label
);
1516 expr
= build3 (COND_EXPR
, void_type_node
, cond
, expr
, NULL_TREE
);
1522 /* A helper function to be called via walk_tree. Mark all labels under *TP
1523 as being forced. To be called for DECL_INITIAL of static variables. */
1526 force_labels_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
1530 if (TREE_CODE (*tp
) == LABEL_DECL
)
1531 FORCED_LABEL (*tp
) = 1;
1536 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1537 different from its canonical type, wrap the whole thing inside a
1538 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1541 The canonical type of a COMPONENT_REF is the type of the field being
1542 referenced--unless the field is a bit-field which can be read directly
1543 in a smaller mode, in which case the canonical type is the
1544 sign-appropriate type corresponding to that mode. */
1547 canonicalize_component_ref (tree
*expr_p
)
1549 tree expr
= *expr_p
;
1552 gcc_assert (TREE_CODE (expr
) == COMPONENT_REF
);
1554 if (INTEGRAL_TYPE_P (TREE_TYPE (expr
)))
1555 type
= TREE_TYPE (get_unwidened (expr
, NULL_TREE
));
1557 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
1559 /* One could argue that all the stuff below is not necessary for
1560 the non-bitfield case and declare it a FE error if type
1561 adjustment would be needed. */
1562 if (TREE_TYPE (expr
) != type
)
1564 #ifdef ENABLE_TYPES_CHECKING
1565 tree old_type
= TREE_TYPE (expr
);
1569 /* We need to preserve qualifiers and propagate them from
1571 type_quals
= TYPE_QUALS (type
)
1572 | TYPE_QUALS (TREE_TYPE (TREE_OPERAND (expr
, 0)));
1573 if (TYPE_QUALS (type
) != type_quals
)
1574 type
= build_qualified_type (TYPE_MAIN_VARIANT (type
), type_quals
);
1576 /* Set the type of the COMPONENT_REF to the underlying type. */
1577 TREE_TYPE (expr
) = type
;
1579 #ifdef ENABLE_TYPES_CHECKING
1580 /* It is now a FE error, if the conversion from the canonical
1581 type to the original expression type is not useless. */
1582 gcc_assert (useless_type_conversion_p (old_type
, type
));
1587 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1588 to foo, embed that change in the ADDR_EXPR by converting
1593 where L is the lower bound. For simplicity, only do this for constant
1595 The constraint is that the type of &array[L] is trivially convertible
1599 canonicalize_addr_expr (tree
*expr_p
)
1601 tree expr
= *expr_p
;
1602 tree addr_expr
= TREE_OPERAND (expr
, 0);
1603 tree datype
, ddatype
, pddatype
;
1605 /* We simplify only conversions from an ADDR_EXPR to a pointer type. */
1606 if (!POINTER_TYPE_P (TREE_TYPE (expr
))
1607 || TREE_CODE (addr_expr
) != ADDR_EXPR
)
1610 /* The addr_expr type should be a pointer to an array. */
1611 datype
= TREE_TYPE (TREE_TYPE (addr_expr
));
1612 if (TREE_CODE (datype
) != ARRAY_TYPE
)
1615 /* The pointer to element type shall be trivially convertible to
1616 the expression pointer type. */
1617 ddatype
= TREE_TYPE (datype
);
1618 pddatype
= build_pointer_type (ddatype
);
1619 if (!useless_type_conversion_p (pddatype
, ddatype
))
1622 /* The lower bound and element sizes must be constant. */
1623 if (!TYPE_SIZE_UNIT (ddatype
)
1624 || TREE_CODE (TYPE_SIZE_UNIT (ddatype
)) != INTEGER_CST
1625 || !TYPE_DOMAIN (datype
) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))
1626 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))) != INTEGER_CST
)
1629 /* All checks succeeded. Build a new node to merge the cast. */
1630 *expr_p
= build4 (ARRAY_REF
, ddatype
, TREE_OPERAND (addr_expr
, 0),
1631 TYPE_MIN_VALUE (TYPE_DOMAIN (datype
)),
1632 NULL_TREE
, NULL_TREE
);
1633 *expr_p
= build1 (ADDR_EXPR
, pddatype
, *expr_p
);
1636 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1637 underneath as appropriate. */
1639 static enum gimplify_status
1640 gimplify_conversion (tree
*expr_p
)
1643 gcc_assert (TREE_CODE (*expr_p
) == NOP_EXPR
1644 || TREE_CODE (*expr_p
) == CONVERT_EXPR
);
1646 /* Then strip away all but the outermost conversion. */
1647 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p
, 0));
1649 /* And remove the outermost conversion if it's useless. */
1650 if (tree_ssa_useless_type_conversion (*expr_p
))
1651 *expr_p
= TREE_OPERAND (*expr_p
, 0);
1653 /* Attempt to avoid NOP_EXPR by producing reference to a subtype.
1654 For example this fold (subclass *)&A into &A->subclass avoiding
1655 a need for statement. */
1656 if (TREE_CODE (*expr_p
) == NOP_EXPR
1657 && POINTER_TYPE_P (TREE_TYPE (*expr_p
))
1658 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p
, 0)))
1659 && (tem
= maybe_fold_offset_to_reference
1660 (TREE_OPERAND (*expr_p
, 0),
1661 integer_zero_node
, TREE_TYPE (TREE_TYPE (*expr_p
)))))
1663 tree ptr_type
= build_pointer_type (TREE_TYPE (tem
));
1664 if (useless_type_conversion_p (TREE_TYPE (*expr_p
), ptr_type
))
1665 *expr_p
= build_fold_addr_expr_with_type (tem
, ptr_type
);
1668 /* If we still have a conversion at the toplevel,
1669 then canonicalize some constructs. */
1670 if (TREE_CODE (*expr_p
) == NOP_EXPR
|| TREE_CODE (*expr_p
) == CONVERT_EXPR
)
1672 tree sub
= TREE_OPERAND (*expr_p
, 0);
1674 /* If a NOP conversion is changing the type of a COMPONENT_REF
1675 expression, then canonicalize its type now in order to expose more
1676 redundant conversions. */
1677 if (TREE_CODE (sub
) == COMPONENT_REF
)
1678 canonicalize_component_ref (&TREE_OPERAND (*expr_p
, 0));
1680 /* If a NOP conversion is changing a pointer to array of foo
1681 to a pointer to foo, embed that change in the ADDR_EXPR. */
1682 else if (TREE_CODE (sub
) == ADDR_EXPR
)
1683 canonicalize_addr_expr (expr_p
);
1689 /* Gimplify a VAR_DECL or PARM_DECL. Returns GS_OK if we expanded a
1690 DECL_VALUE_EXPR, and it's worth re-examining things. */
1692 static enum gimplify_status
1693 gimplify_var_or_parm_decl (tree
*expr_p
)
1695 tree decl
= *expr_p
;
1697 /* ??? If this is a local variable, and it has not been seen in any
1698 outer BIND_EXPR, then it's probably the result of a duplicate
1699 declaration, for which we've already issued an error. It would
1700 be really nice if the front end wouldn't leak these at all.
1701 Currently the only known culprit is C++ destructors, as seen
1702 in g++.old-deja/g++.jason/binding.C. */
1703 if (TREE_CODE (decl
) == VAR_DECL
1704 && !DECL_SEEN_IN_BIND_EXPR_P (decl
)
1705 && !TREE_STATIC (decl
) && !DECL_EXTERNAL (decl
)
1706 && decl_function_context (decl
) == current_function_decl
)
1708 gcc_assert (errorcount
|| sorrycount
);
1712 /* When within an OpenMP context, notice uses of variables. */
1713 if (gimplify_omp_ctxp
&& omp_notice_variable (gimplify_omp_ctxp
, decl
, true))
1716 /* If the decl is an alias for another expression, substitute it now. */
1717 if (DECL_HAS_VALUE_EXPR_P (decl
))
1719 *expr_p
= unshare_expr (DECL_VALUE_EXPR (decl
));
1727 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1728 node pointed to by EXPR_P.
1731 : min_lval '[' val ']'
1733 | compound_lval '[' val ']'
1734 | compound_lval '.' ID
1736 This is not part of the original SIMPLE definition, which separates
1737 array and member references, but it seems reasonable to handle them
1738 together. Also, this way we don't run into problems with union
1739 aliasing; gcc requires that for accesses through a union to alias, the
1740 union reference must be explicit, which was not always the case when we
1741 were splitting up array and member refs.
1743 PRE_P points to the list where side effects that must happen before
1744 *EXPR_P should be stored.
1746 POST_P points to the list where side effects that must happen after
1747 *EXPR_P should be stored. */
1749 static enum gimplify_status
1750 gimplify_compound_lval (tree
*expr_p
, tree
*pre_p
,
1751 tree
*post_p
, fallback_t fallback
)
1754 VEC(tree
,heap
) *stack
;
1755 enum gimplify_status ret
= GS_OK
, tret
;
1758 /* Create a stack of the subexpressions so later we can walk them in
1759 order from inner to outer. */
1760 stack
= VEC_alloc (tree
, heap
, 10);
1762 /* We can handle anything that get_inner_reference can deal with. */
1763 for (p
= expr_p
; ; p
= &TREE_OPERAND (*p
, 0))
1766 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1767 if (TREE_CODE (*p
) == INDIRECT_REF
)
1768 *p
= fold_indirect_ref (*p
);
1770 if (handled_component_p (*p
))
1772 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
1773 additional COMPONENT_REFs. */
1774 else if ((TREE_CODE (*p
) == VAR_DECL
|| TREE_CODE (*p
) == PARM_DECL
)
1775 && gimplify_var_or_parm_decl (p
) == GS_OK
)
1780 VEC_safe_push (tree
, heap
, stack
, *p
);
1783 gcc_assert (VEC_length (tree
, stack
));
1785 /* Now STACK is a stack of pointers to all the refs we've walked through
1786 and P points to the innermost expression.
1788 Java requires that we elaborated nodes in source order. That
1789 means we must gimplify the inner expression followed by each of
1790 the indices, in order. But we can't gimplify the inner
1791 expression until we deal with any variable bounds, sizes, or
1792 positions in order to deal with PLACEHOLDER_EXPRs.
1794 So we do this in three steps. First we deal with the annotations
1795 for any variables in the components, then we gimplify the base,
1796 then we gimplify any indices, from left to right. */
1797 for (i
= VEC_length (tree
, stack
) - 1; i
>= 0; i
--)
1799 tree t
= VEC_index (tree
, stack
, i
);
1801 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
1803 /* Gimplify the low bound and element type size and put them into
1804 the ARRAY_REF. If these values are set, they have already been
1806 if (!TREE_OPERAND (t
, 2))
1808 tree low
= unshare_expr (array_ref_low_bound (t
));
1809 if (!is_gimple_min_invariant (low
))
1811 TREE_OPERAND (t
, 2) = low
;
1812 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
1813 is_gimple_formal_tmp_reg
, fb_rvalue
);
1814 ret
= MIN (ret
, tret
);
1818 if (!TREE_OPERAND (t
, 3))
1820 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (t
, 0)));
1821 tree elmt_size
= unshare_expr (array_ref_element_size (t
));
1822 tree factor
= size_int (TYPE_ALIGN_UNIT (elmt_type
));
1824 /* Divide the element size by the alignment of the element
1826 elmt_size
= size_binop (EXACT_DIV_EXPR
, elmt_size
, factor
);
1828 if (!is_gimple_min_invariant (elmt_size
))
1830 TREE_OPERAND (t
, 3) = elmt_size
;
1831 tret
= gimplify_expr (&TREE_OPERAND (t
, 3), pre_p
, post_p
,
1832 is_gimple_formal_tmp_reg
, fb_rvalue
);
1833 ret
= MIN (ret
, tret
);
1837 else if (TREE_CODE (t
) == COMPONENT_REF
)
1839 /* Set the field offset into T and gimplify it. */
1840 if (!TREE_OPERAND (t
, 2))
1842 tree offset
= unshare_expr (component_ref_field_offset (t
));
1843 tree field
= TREE_OPERAND (t
, 1);
1845 = size_int (DECL_OFFSET_ALIGN (field
) / BITS_PER_UNIT
);
1847 /* Divide the offset by its alignment. */
1848 offset
= size_binop (EXACT_DIV_EXPR
, offset
, factor
);
1850 if (!is_gimple_min_invariant (offset
))
1852 TREE_OPERAND (t
, 2) = offset
;
1853 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
1854 is_gimple_formal_tmp_reg
, fb_rvalue
);
1855 ret
= MIN (ret
, tret
);
1861 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
1862 so as to match the min_lval predicate. Failure to do so may result
1863 in the creation of large aggregate temporaries. */
1864 tret
= gimplify_expr (p
, pre_p
, post_p
, is_gimple_min_lval
,
1865 fallback
| fb_lvalue
);
1866 ret
= MIN (ret
, tret
);
1868 /* And finally, the indices and operands to BIT_FIELD_REF. During this
1869 loop we also remove any useless conversions. */
1870 for (; VEC_length (tree
, stack
) > 0; )
1872 tree t
= VEC_pop (tree
, stack
);
1874 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
1876 /* Gimplify the dimension.
1877 Temporary fix for gcc.c-torture/execute/20040313-1.c.
1878 Gimplify non-constant array indices into a temporary
1880 FIXME - The real fix is to gimplify post-modify
1881 expressions into a minimal gimple lvalue. However, that
1882 exposes bugs in alias analysis. The alias analyzer does
1883 not handle &PTR->FIELD very well. Will fix after the
1884 branch is merged into mainline (dnovillo 2004-05-03). */
1885 if (!is_gimple_min_invariant (TREE_OPERAND (t
, 1)))
1887 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), pre_p
, post_p
,
1888 is_gimple_formal_tmp_reg
, fb_rvalue
);
1889 ret
= MIN (ret
, tret
);
1892 else if (TREE_CODE (t
) == BIT_FIELD_REF
)
1894 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), pre_p
, post_p
,
1895 is_gimple_val
, fb_rvalue
);
1896 ret
= MIN (ret
, tret
);
1897 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
1898 is_gimple_val
, fb_rvalue
);
1899 ret
= MIN (ret
, tret
);
1902 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t
, 0));
1904 /* The innermost expression P may have originally had TREE_SIDE_EFFECTS
1905 set which would have caused all the outer expressions in EXPR_P
1906 leading to P to also have had TREE_SIDE_EFFECTS set. */
1907 recalculate_side_effects (t
);
1910 tret
= gimplify_expr (p
, pre_p
, post_p
, is_gimple_min_lval
, fallback
);
1911 ret
= MIN (ret
, tret
);
1913 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
1914 if ((fallback
& fb_rvalue
) && TREE_CODE (*expr_p
) == COMPONENT_REF
)
1916 canonicalize_component_ref (expr_p
);
1917 ret
= MIN (ret
, GS_OK
);
1920 VEC_free (tree
, heap
, stack
);
1925 /* Gimplify the self modifying expression pointed to by EXPR_P
1928 PRE_P points to the list where side effects that must happen before
1929 *EXPR_P should be stored.
1931 POST_P points to the list where side effects that must happen after
1932 *EXPR_P should be stored.
1934 WANT_VALUE is nonzero iff we want to use the value of this expression
1935 in another expression. */
1937 static enum gimplify_status
1938 gimplify_self_mod_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
,
1941 enum tree_code code
;
1942 tree lhs
, lvalue
, rhs
, t1
, post
= NULL
, *orig_post_p
= post_p
;
1944 enum tree_code arith_code
;
1945 enum gimplify_status ret
;
1947 code
= TREE_CODE (*expr_p
);
1949 gcc_assert (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
1950 || code
== PREINCREMENT_EXPR
|| code
== PREDECREMENT_EXPR
);
1952 /* Prefix or postfix? */
1953 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
1954 /* Faster to treat as prefix if result is not used. */
1955 postfix
= want_value
;
1959 /* For postfix, make sure the inner expression's post side effects
1960 are executed after side effects from this expression. */
1964 /* Add or subtract? */
1965 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
1966 arith_code
= PLUS_EXPR
;
1968 arith_code
= MINUS_EXPR
;
1970 /* Gimplify the LHS into a GIMPLE lvalue. */
1971 lvalue
= TREE_OPERAND (*expr_p
, 0);
1972 ret
= gimplify_expr (&lvalue
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
1973 if (ret
== GS_ERROR
)
1976 /* Extract the operands to the arithmetic operation. */
1978 rhs
= TREE_OPERAND (*expr_p
, 1);
1980 /* For postfix operator, we evaluate the LHS to an rvalue and then use
1981 that as the result value and in the postqueue operation. */
1984 ret
= gimplify_expr (&lhs
, pre_p
, post_p
, is_gimple_val
, fb_rvalue
);
1985 if (ret
== GS_ERROR
)
1989 /* For POINTERs increment, use POINTER_PLUS_EXPR. */
1990 if (POINTER_TYPE_P (TREE_TYPE (lhs
)))
1992 rhs
= fold_convert (sizetype
, rhs
);
1993 if (arith_code
== MINUS_EXPR
)
1994 rhs
= fold_build1 (NEGATE_EXPR
, TREE_TYPE (rhs
), rhs
);
1995 arith_code
= POINTER_PLUS_EXPR
;
1998 t1
= build2 (arith_code
, TREE_TYPE (*expr_p
), lhs
, rhs
);
1999 t1
= build_gimple_modify_stmt (lvalue
, t1
);
2003 gimplify_and_add (t1
, orig_post_p
);
2004 append_to_statement_list (post
, orig_post_p
);
2015 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
2018 maybe_with_size_expr (tree
*expr_p
)
2020 tree expr
= *expr_p
;
2021 tree type
= TREE_TYPE (expr
);
2024 /* If we've already wrapped this or the type is error_mark_node, we can't do
2026 if (TREE_CODE (expr
) == WITH_SIZE_EXPR
2027 || type
== error_mark_node
)
2030 /* If the size isn't known or is a constant, we have nothing to do. */
2031 size
= TYPE_SIZE_UNIT (type
);
2032 if (!size
|| TREE_CODE (size
) == INTEGER_CST
)
2035 /* Otherwise, make a WITH_SIZE_EXPR. */
2036 size
= unshare_expr (size
);
2037 size
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (size
, expr
);
2038 *expr_p
= build2 (WITH_SIZE_EXPR
, type
, expr
, size
);
2041 /* Subroutine of gimplify_call_expr: Gimplify a single argument. */
2043 static enum gimplify_status
2044 gimplify_arg (tree
*expr_p
, tree
*pre_p
)
2046 bool (*test
) (tree
);
2049 /* In general, we allow lvalues for function arguments to avoid
2050 extra overhead of copying large aggregates out of even larger
2051 aggregates into temporaries only to copy the temporaries to
2052 the argument list. Make optimizers happy by pulling out to
2053 temporaries those types that fit in registers. */
2054 if (is_gimple_reg_type (TREE_TYPE (*expr_p
)))
2055 test
= is_gimple_val
, fb
= fb_rvalue
;
2057 test
= is_gimple_lvalue
, fb
= fb_either
;
2059 /* If this is a variable sized type, we must remember the size. */
2060 maybe_with_size_expr (expr_p
);
2062 /* There is a sequence point before a function call. Side effects in
2063 the argument list must occur before the actual call. So, when
2064 gimplifying arguments, force gimplify_expr to use an internal
2065 post queue which is then appended to the end of PRE_P. */
2066 return gimplify_expr (expr_p
, pre_p
, NULL
, test
, fb
);
2069 /* Gimplify the CALL_EXPR node pointed to by EXPR_P. PRE_P points to the
2070 list where side effects that must happen before *EXPR_P should be stored.
2071 WANT_VALUE is true if the result of the call is desired. */
2073 static enum gimplify_status
2074 gimplify_call_expr (tree
*expr_p
, tree
*pre_p
, bool want_value
)
2076 tree decl
, parms
, p
;
2077 enum gimplify_status ret
;
2080 gcc_assert (TREE_CODE (*expr_p
) == CALL_EXPR
);
2082 /* For reliable diagnostics during inlining, it is necessary that
2083 every call_expr be annotated with file and line. */
2084 if (! EXPR_HAS_LOCATION (*expr_p
))
2085 SET_EXPR_LOCATION (*expr_p
, input_location
);
2087 /* This may be a call to a builtin function.
2089 Builtin function calls may be transformed into different
2090 (and more efficient) builtin function calls under certain
2091 circumstances. Unfortunately, gimplification can muck things
2092 up enough that the builtin expanders are not aware that certain
2093 transformations are still valid.
2095 So we attempt transformation/gimplification of the call before
2096 we gimplify the CALL_EXPR. At this time we do not manage to
2097 transform all calls in the same manner as the expanders do, but
2098 we do transform most of them. */
2099 decl
= get_callee_fndecl (*expr_p
);
2100 if (decl
&& DECL_BUILT_IN (decl
))
2102 tree
new = fold_call_expr (*expr_p
, !want_value
);
2104 if (new && new != *expr_p
)
2106 /* There was a transformation of this call which computes the
2107 same value, but in a more efficient way. Return and try
2113 if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
2114 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_START
)
2116 if (call_expr_nargs (*expr_p
) < 2)
2118 error ("too few arguments to function %<va_start%>");
2119 *expr_p
= build_empty_stmt ();
2123 if (fold_builtin_next_arg (*expr_p
, true))
2125 *expr_p
= build_empty_stmt ();
2128 /* Avoid gimplifying the second argument to va_start, which needs
2129 to be the plain PARM_DECL. */
2130 return gimplify_arg (&CALL_EXPR_ARG (*expr_p
, 0), pre_p
);
2134 /* There is a sequence point before the call, so any side effects in
2135 the calling expression must occur before the actual call. Force
2136 gimplify_expr to use an internal post queue. */
2137 ret
= gimplify_expr (&CALL_EXPR_FN (*expr_p
), pre_p
, NULL
,
2138 is_gimple_call_addr
, fb_rvalue
);
2140 nargs
= call_expr_nargs (*expr_p
);
2142 /* Get argument types for verification. */
2143 decl
= get_callee_fndecl (*expr_p
);
2146 parms
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2147 else if (POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_FN (*expr_p
))))
2148 parms
= TYPE_ARG_TYPES (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (*expr_p
))));
2150 /* Verify if the type of the argument matches that of the function
2151 declaration. If we cannot verify this or there is a mismatch,
2152 mark the call expression so it doesn't get inlined later. */
2153 if (decl
&& DECL_ARGUMENTS (decl
))
2155 for (i
= 0, p
= DECL_ARGUMENTS (decl
); i
< nargs
;
2156 i
++, p
= TREE_CHAIN (p
))
2158 /* We cannot distinguish a varargs function from the case
2159 of excess parameters, still deferring the inlining decision
2160 to the callee is possible. */
2163 if (p
== error_mark_node
2164 || CALL_EXPR_ARG (*expr_p
, i
) == error_mark_node
2165 || !fold_convertible_p (DECL_ARG_TYPE (p
),
2166 CALL_EXPR_ARG (*expr_p
, i
)))
2168 CALL_CANNOT_INLINE_P (*expr_p
) = 1;
2175 for (i
= 0, p
= parms
; i
< nargs
; i
++, p
= TREE_CHAIN (p
))
2177 /* If this is a varargs function defer inlining decision
2181 if (TREE_VALUE (p
) == error_mark_node
2182 || CALL_EXPR_ARG (*expr_p
, i
) == error_mark_node
2183 || TREE_CODE (TREE_VALUE (p
)) == VOID_TYPE
2184 || !fold_convertible_p (TREE_VALUE (p
),
2185 CALL_EXPR_ARG (*expr_p
, i
)))
2187 CALL_CANNOT_INLINE_P (*expr_p
) = 1;
2195 CALL_CANNOT_INLINE_P (*expr_p
) = 1;
2200 /* If the last argument is __builtin_va_arg_pack () and it is not
2201 passed as a named argument, decrease the number of CALL_EXPR
2202 arguments and set instead the CALL_EXPR_VA_ARG_PACK flag. */
2205 && TREE_CODE (CALL_EXPR_ARG (*expr_p
, nargs
- 1)) == CALL_EXPR
)
2207 tree last_arg
= CALL_EXPR_ARG (*expr_p
, nargs
- 1);
2208 tree last_arg_fndecl
= get_callee_fndecl (last_arg
);
2211 && TREE_CODE (last_arg_fndecl
) == FUNCTION_DECL
2212 && DECL_BUILT_IN_CLASS (last_arg_fndecl
) == BUILT_IN_NORMAL
2213 && DECL_FUNCTION_CODE (last_arg_fndecl
) == BUILT_IN_VA_ARG_PACK
)
2215 tree call
= *expr_p
;
2218 *expr_p
= build_call_array (TREE_TYPE (call
), CALL_EXPR_FN (call
),
2219 nargs
, CALL_EXPR_ARGP (call
));
2220 /* Copy all CALL_EXPR flags, locus and block, except
2221 CALL_EXPR_VA_ARG_PACK flag. */
2222 CALL_EXPR_STATIC_CHAIN (*expr_p
) = CALL_EXPR_STATIC_CHAIN (call
);
2223 CALL_EXPR_TAILCALL (*expr_p
) = CALL_EXPR_TAILCALL (call
);
2224 CALL_EXPR_RETURN_SLOT_OPT (*expr_p
)
2225 = CALL_EXPR_RETURN_SLOT_OPT (call
);
2226 CALL_FROM_THUNK_P (*expr_p
) = CALL_FROM_THUNK_P (call
);
2227 CALL_CANNOT_INLINE_P (*expr_p
)
2228 = CALL_CANNOT_INLINE_P (call
);
2229 TREE_NOTHROW (*expr_p
) = TREE_NOTHROW (call
);
2230 SET_EXPR_LOCUS (*expr_p
, EXPR_LOCUS (call
));
2231 TREE_BLOCK (*expr_p
) = TREE_BLOCK (call
);
2232 /* Set CALL_EXPR_VA_ARG_PACK. */
2233 CALL_EXPR_VA_ARG_PACK (*expr_p
) = 1;
2237 /* Finally, gimplify the function arguments. */
2238 for (i
= (PUSH_ARGS_REVERSED
? nargs
- 1 : 0);
2239 PUSH_ARGS_REVERSED
? i
>= 0 : i
< nargs
;
2240 PUSH_ARGS_REVERSED
? i
-- : i
++)
2242 enum gimplify_status t
;
2244 t
= gimplify_arg (&CALL_EXPR_ARG (*expr_p
, i
), pre_p
);
2250 /* Try this again in case gimplification exposed something. */
2251 if (ret
!= GS_ERROR
)
2253 tree
new = fold_call_expr (*expr_p
, !want_value
);
2255 if (new && new != *expr_p
)
2257 /* There was a transformation of this call which computes the
2258 same value, but in a more efficient way. Return and try
2265 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2266 decl. This allows us to eliminate redundant or useless
2267 calls to "const" functions. */
2268 if (TREE_CODE (*expr_p
) == CALL_EXPR
2269 && (call_expr_flags (*expr_p
) & (ECF_CONST
| ECF_PURE
)))
2270 TREE_SIDE_EFFECTS (*expr_p
) = 0;
2275 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2276 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2278 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2279 condition is true or false, respectively. If null, we should generate
2280 our own to skip over the evaluation of this specific expression.
2282 This function is the tree equivalent of do_jump.
2284 shortcut_cond_r should only be called by shortcut_cond_expr. */
2287 shortcut_cond_r (tree pred
, tree
*true_label_p
, tree
*false_label_p
)
2289 tree local_label
= NULL_TREE
;
2290 tree t
, expr
= NULL
;
2292 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2293 retain the shortcut semantics. Just insert the gotos here;
2294 shortcut_cond_expr will append the real blocks later. */
2295 if (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2297 /* Turn if (a && b) into
2299 if (a); else goto no;
2300 if (b) goto yes; else goto no;
2303 if (false_label_p
== NULL
)
2304 false_label_p
= &local_label
;
2306 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), NULL
, false_label_p
);
2307 append_to_statement_list (t
, &expr
);
2309 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2311 append_to_statement_list (t
, &expr
);
2313 else if (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2315 /* Turn if (a || b) into
2318 if (b) goto yes; else goto no;
2321 if (true_label_p
== NULL
)
2322 true_label_p
= &local_label
;
2324 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), true_label_p
, NULL
);
2325 append_to_statement_list (t
, &expr
);
2327 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2329 append_to_statement_list (t
, &expr
);
2331 else if (TREE_CODE (pred
) == COND_EXPR
)
2333 /* As long as we're messing with gotos, turn if (a ? b : c) into
2335 if (b) goto yes; else goto no;
2337 if (c) goto yes; else goto no; */
2338 expr
= build3 (COND_EXPR
, void_type_node
, TREE_OPERAND (pred
, 0),
2339 shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2341 shortcut_cond_r (TREE_OPERAND (pred
, 2), true_label_p
,
2346 expr
= build3 (COND_EXPR
, void_type_node
, pred
,
2347 build_and_jump (true_label_p
),
2348 build_and_jump (false_label_p
));
2353 t
= build1 (LABEL_EXPR
, void_type_node
, local_label
);
2354 append_to_statement_list (t
, &expr
);
2361 shortcut_cond_expr (tree expr
)
2363 tree pred
= TREE_OPERAND (expr
, 0);
2364 tree then_
= TREE_OPERAND (expr
, 1);
2365 tree else_
= TREE_OPERAND (expr
, 2);
2366 tree true_label
, false_label
, end_label
, t
;
2368 tree
*false_label_p
;
2369 bool emit_end
, emit_false
, jump_over_else
;
2370 bool then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2371 bool else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2373 /* First do simple transformations. */
2376 /* If there is no 'else', turn (a && b) into if (a) if (b). */
2377 while (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2379 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2380 then_
= shortcut_cond_expr (expr
);
2381 then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2382 pred
= TREE_OPERAND (pred
, 0);
2383 expr
= build3 (COND_EXPR
, void_type_node
, pred
, then_
, NULL_TREE
);
2388 /* If there is no 'then', turn
2391 if (a); else if (b); else d. */
2392 while (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2394 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2395 else_
= shortcut_cond_expr (expr
);
2396 else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2397 pred
= TREE_OPERAND (pred
, 0);
2398 expr
= build3 (COND_EXPR
, void_type_node
, pred
, NULL_TREE
, else_
);
2402 /* If we're done, great. */
2403 if (TREE_CODE (pred
) != TRUTH_ANDIF_EXPR
2404 && TREE_CODE (pred
) != TRUTH_ORIF_EXPR
)
2407 /* Otherwise we need to mess with gotos. Change
2410 if (a); else goto no;
2413 and recursively gimplify the condition. */
2415 true_label
= false_label
= end_label
= NULL_TREE
;
2417 /* If our arms just jump somewhere, hijack those labels so we don't
2418 generate jumps to jumps. */
2421 && TREE_CODE (then_
) == GOTO_EXPR
2422 && TREE_CODE (GOTO_DESTINATION (then_
)) == LABEL_DECL
)
2424 true_label
= GOTO_DESTINATION (then_
);
2430 && TREE_CODE (else_
) == GOTO_EXPR
2431 && TREE_CODE (GOTO_DESTINATION (else_
)) == LABEL_DECL
)
2433 false_label
= GOTO_DESTINATION (else_
);
2438 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2440 true_label_p
= &true_label
;
2442 true_label_p
= NULL
;
2444 /* The 'else' branch also needs a label if it contains interesting code. */
2445 if (false_label
|| else_se
)
2446 false_label_p
= &false_label
;
2448 false_label_p
= NULL
;
2450 /* If there was nothing else in our arms, just forward the label(s). */
2451 if (!then_se
&& !else_se
)
2452 return shortcut_cond_r (pred
, true_label_p
, false_label_p
);
2454 /* If our last subexpression already has a terminal label, reuse it. */
2456 expr
= expr_last (else_
);
2458 expr
= expr_last (then_
);
2461 if (expr
&& TREE_CODE (expr
) == LABEL_EXPR
)
2462 end_label
= LABEL_EXPR_LABEL (expr
);
2464 /* If we don't care about jumping to the 'else' branch, jump to the end
2465 if the condition is false. */
2467 false_label_p
= &end_label
;
2469 /* We only want to emit these labels if we aren't hijacking them. */
2470 emit_end
= (end_label
== NULL_TREE
);
2471 emit_false
= (false_label
== NULL_TREE
);
2473 /* We only emit the jump over the else clause if we have to--if the
2474 then clause may fall through. Otherwise we can wind up with a
2475 useless jump and a useless label at the end of gimplified code,
2476 which will cause us to think that this conditional as a whole
2477 falls through even if it doesn't. If we then inline a function
2478 which ends with such a condition, that can cause us to issue an
2479 inappropriate warning about control reaching the end of a
2480 non-void function. */
2481 jump_over_else
= block_may_fallthru (then_
);
2483 pred
= shortcut_cond_r (pred
, true_label_p
, false_label_p
);
2486 append_to_statement_list (pred
, &expr
);
2488 append_to_statement_list (then_
, &expr
);
2493 t
= build_and_jump (&end_label
);
2494 append_to_statement_list (t
, &expr
);
2498 t
= build1 (LABEL_EXPR
, void_type_node
, false_label
);
2499 append_to_statement_list (t
, &expr
);
2501 append_to_statement_list (else_
, &expr
);
2503 if (emit_end
&& end_label
)
2505 t
= build1 (LABEL_EXPR
, void_type_node
, end_label
);
2506 append_to_statement_list (t
, &expr
);
2512 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2515 gimple_boolify (tree expr
)
2517 tree type
= TREE_TYPE (expr
);
2519 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
2522 switch (TREE_CODE (expr
))
2524 case TRUTH_AND_EXPR
:
2526 case TRUTH_XOR_EXPR
:
2527 case TRUTH_ANDIF_EXPR
:
2528 case TRUTH_ORIF_EXPR
:
2529 /* Also boolify the arguments of truth exprs. */
2530 TREE_OPERAND (expr
, 1) = gimple_boolify (TREE_OPERAND (expr
, 1));
2533 case TRUTH_NOT_EXPR
:
2534 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
2537 case EQ_EXPR
: case NE_EXPR
:
2538 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
2539 /* These expressions always produce boolean results. */
2540 TREE_TYPE (expr
) = boolean_type_node
;
2544 /* Other expressions that get here must have boolean values, but
2545 might need to be converted to the appropriate mode. */
2546 return fold_convert (boolean_type_node
, expr
);
2550 /* Given a conditional expression *EXPR_P without side effects, gimplify
2551 its operands. New statements are inserted to PRE_P. */
2553 static enum gimplify_status
2554 gimplify_pure_cond_expr (tree
*expr_p
, tree
*pre_p
)
2556 tree expr
= *expr_p
, cond
;
2557 enum gimplify_status ret
, tret
;
2558 enum tree_code code
;
2560 cond
= gimple_boolify (COND_EXPR_COND (expr
));
2562 /* We need to handle && and || specially, as their gimplification
2563 creates pure cond_expr, thus leading to an infinite cycle otherwise. */
2564 code
= TREE_CODE (cond
);
2565 if (code
== TRUTH_ANDIF_EXPR
)
2566 TREE_SET_CODE (cond
, TRUTH_AND_EXPR
);
2567 else if (code
== TRUTH_ORIF_EXPR
)
2568 TREE_SET_CODE (cond
, TRUTH_OR_EXPR
);
2569 ret
= gimplify_expr (&cond
, pre_p
, NULL
,
2570 is_gimple_condexpr
, fb_rvalue
);
2571 COND_EXPR_COND (*expr_p
) = cond
;
2573 tret
= gimplify_expr (&COND_EXPR_THEN (expr
), pre_p
, NULL
,
2574 is_gimple_val
, fb_rvalue
);
2575 ret
= MIN (ret
, tret
);
2576 tret
= gimplify_expr (&COND_EXPR_ELSE (expr
), pre_p
, NULL
,
2577 is_gimple_val
, fb_rvalue
);
2579 return MIN (ret
, tret
);
2582 /* Returns true if evaluating EXPR could trap.
2583 EXPR is GENERIC, while tree_could_trap_p can be called
2587 generic_expr_could_trap_p (tree expr
)
2591 if (!expr
|| is_gimple_val (expr
))
2594 if (!EXPR_P (expr
) || tree_could_trap_p (expr
))
2597 n
= TREE_OPERAND_LENGTH (expr
);
2598 for (i
= 0; i
< n
; i
++)
2599 if (generic_expr_could_trap_p (TREE_OPERAND (expr
, i
)))
2605 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2614 The second form is used when *EXPR_P is of type void.
2616 TARGET is the tree for T1 above.
2618 PRE_P points to the list where side effects that must happen before
2619 *EXPR_P should be stored. */
2621 static enum gimplify_status
2622 gimplify_cond_expr (tree
*expr_p
, tree
*pre_p
, fallback_t fallback
)
2624 tree expr
= *expr_p
;
2625 tree tmp
, tmp2
, type
;
2626 enum gimplify_status ret
;
2628 type
= TREE_TYPE (expr
);
2630 /* If this COND_EXPR has a value, copy the values into a temporary within
2632 if (! VOID_TYPE_P (type
))
2636 /* If an rvalue is ok or we do not require an lvalue, avoid creating
2637 an addressable temporary. */
2638 if (((fallback
& fb_rvalue
)
2639 || !(fallback
& fb_lvalue
))
2640 && !TREE_ADDRESSABLE (type
))
2642 if (gimplify_ctxp
->allow_rhs_cond_expr
2643 /* If either branch has side effects or could trap, it can't be
2644 evaluated unconditionally. */
2645 && !TREE_SIDE_EFFECTS (TREE_OPERAND (*expr_p
, 1))
2646 && !generic_expr_could_trap_p (TREE_OPERAND (*expr_p
, 1))
2647 && !TREE_SIDE_EFFECTS (TREE_OPERAND (*expr_p
, 2))
2648 && !generic_expr_could_trap_p (TREE_OPERAND (*expr_p
, 2)))
2649 return gimplify_pure_cond_expr (expr_p
, pre_p
);
2651 result
= tmp2
= tmp
= create_tmp_var (TREE_TYPE (expr
), "iftmp");
2656 tree type
= build_pointer_type (TREE_TYPE (expr
));
2658 if (TREE_TYPE (TREE_OPERAND (expr
, 1)) != void_type_node
)
2659 TREE_OPERAND (expr
, 1) =
2660 build_fold_addr_expr (TREE_OPERAND (expr
, 1));
2662 if (TREE_TYPE (TREE_OPERAND (expr
, 2)) != void_type_node
)
2663 TREE_OPERAND (expr
, 2) =
2664 build_fold_addr_expr (TREE_OPERAND (expr
, 2));
2666 tmp2
= tmp
= create_tmp_var (type
, "iftmp");
2668 expr
= build3 (COND_EXPR
, void_type_node
, TREE_OPERAND (expr
, 0),
2669 TREE_OPERAND (expr
, 1), TREE_OPERAND (expr
, 2));
2671 result
= build_fold_indirect_ref (tmp
);
2675 /* Build the then clause, 't1 = a;'. But don't build an assignment
2676 if this branch is void; in C++ it can be, if it's a throw. */
2677 if (TREE_TYPE (TREE_OPERAND (expr
, 1)) != void_type_node
)
2678 TREE_OPERAND (expr
, 1)
2679 = build_gimple_modify_stmt (tmp
, TREE_OPERAND (expr
, 1));
2681 /* Build the else clause, 't1 = b;'. */
2682 if (TREE_TYPE (TREE_OPERAND (expr
, 2)) != void_type_node
)
2683 TREE_OPERAND (expr
, 2)
2684 = build_gimple_modify_stmt (tmp2
, TREE_OPERAND (expr
, 2));
2686 TREE_TYPE (expr
) = void_type_node
;
2687 recalculate_side_effects (expr
);
2689 /* Move the COND_EXPR to the prequeue. */
2690 gimplify_and_add (expr
, pre_p
);
2696 /* Make sure the condition has BOOLEAN_TYPE. */
2697 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
2699 /* Break apart && and || conditions. */
2700 if (TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ANDIF_EXPR
2701 || TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ORIF_EXPR
)
2703 expr
= shortcut_cond_expr (expr
);
2705 if (expr
!= *expr_p
)
2709 /* We can't rely on gimplify_expr to re-gimplify the expanded
2710 form properly, as cleanups might cause the target labels to be
2711 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2712 set up a conditional context. */
2713 gimple_push_condition ();
2714 gimplify_stmt (expr_p
);
2715 gimple_pop_condition (pre_p
);
2721 /* Now do the normal gimplification. */
2722 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, NULL
,
2723 is_gimple_condexpr
, fb_rvalue
);
2725 gimple_push_condition ();
2727 gimplify_to_stmt_list (&TREE_OPERAND (expr
, 1));
2728 gimplify_to_stmt_list (&TREE_OPERAND (expr
, 2));
2729 recalculate_side_effects (expr
);
2731 gimple_pop_condition (pre_p
);
2733 if (ret
== GS_ERROR
)
2735 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
2737 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 2)))
2738 /* Rewrite "if (a); else b" to "if (!a) b" */
2740 TREE_OPERAND (expr
, 0) = invert_truthvalue (TREE_OPERAND (expr
, 0));
2741 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, NULL
,
2742 is_gimple_condexpr
, fb_rvalue
);
2744 tmp
= TREE_OPERAND (expr
, 1);
2745 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 2);
2746 TREE_OPERAND (expr
, 2) = tmp
;
2749 /* Both arms are empty; replace the COND_EXPR with its predicate. */
2750 expr
= TREE_OPERAND (expr
, 0);
2756 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2757 a call to __builtin_memcpy. */
2759 static enum gimplify_status
2760 gimplify_modify_expr_to_memcpy (tree
*expr_p
, tree size
, bool want_value
)
2762 tree t
, to
, to_ptr
, from
, from_ptr
;
2764 to
= GENERIC_TREE_OPERAND (*expr_p
, 0);
2765 from
= GENERIC_TREE_OPERAND (*expr_p
, 1);
2767 from_ptr
= build_fold_addr_expr (from
);
2769 to_ptr
= build_fold_addr_expr (to
);
2770 t
= implicit_built_in_decls
[BUILT_IN_MEMCPY
];
2771 t
= build_call_expr (t
, 3, to_ptr
, from_ptr
, size
);
2775 t
= build1 (NOP_EXPR
, TREE_TYPE (to_ptr
), t
);
2776 t
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
2783 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2784 a call to __builtin_memset. In this case we know that the RHS is
2785 a CONSTRUCTOR with an empty element list. */
2787 static enum gimplify_status
2788 gimplify_modify_expr_to_memset (tree
*expr_p
, tree size
, bool want_value
)
2792 to
= GENERIC_TREE_OPERAND (*expr_p
, 0);
2794 to_ptr
= build_fold_addr_expr (to
);
2795 t
= implicit_built_in_decls
[BUILT_IN_MEMSET
];
2796 t
= build_call_expr (t
, 3, to_ptr
, integer_zero_node
, size
);
2800 t
= build1 (NOP_EXPR
, TREE_TYPE (to_ptr
), t
);
2801 t
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
2808 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
2809 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
2810 assignment. Returns non-null if we detect a potential overlap. */
2812 struct gimplify_init_ctor_preeval_data
2814 /* The base decl of the lhs object. May be NULL, in which case we
2815 have to assume the lhs is indirect. */
2818 /* The alias set of the lhs object. */
2819 alias_set_type lhs_alias_set
;
2823 gimplify_init_ctor_preeval_1 (tree
*tp
, int *walk_subtrees
, void *xdata
)
2825 struct gimplify_init_ctor_preeval_data
*data
2826 = (struct gimplify_init_ctor_preeval_data
*) xdata
;
2829 /* If we find the base object, obviously we have overlap. */
2830 if (data
->lhs_base_decl
== t
)
2833 /* If the constructor component is indirect, determine if we have a
2834 potential overlap with the lhs. The only bits of information we
2835 have to go on at this point are addressability and alias sets. */
2836 if (TREE_CODE (t
) == INDIRECT_REF
2837 && (!data
->lhs_base_decl
|| TREE_ADDRESSABLE (data
->lhs_base_decl
))
2838 && alias_sets_conflict_p (data
->lhs_alias_set
, get_alias_set (t
)))
2841 /* If the constructor component is a call, determine if it can hide a
2842 potential overlap with the lhs through an INDIRECT_REF like above. */
2843 if (TREE_CODE (t
) == CALL_EXPR
)
2845 tree type
, fntype
= TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (t
)));
2847 for (type
= TYPE_ARG_TYPES (fntype
); type
; type
= TREE_CHAIN (type
))
2848 if (POINTER_TYPE_P (TREE_VALUE (type
))
2849 && (!data
->lhs_base_decl
|| TREE_ADDRESSABLE (data
->lhs_base_decl
))
2850 && alias_sets_conflict_p (data
->lhs_alias_set
,
2852 (TREE_TYPE (TREE_VALUE (type
)))))
2856 if (IS_TYPE_OR_DECL_P (t
))
2861 /* A subroutine of gimplify_init_constructor. Pre-evaluate *EXPR_P,
2862 force values that overlap with the lhs (as described by *DATA)
2863 into temporaries. */
2866 gimplify_init_ctor_preeval (tree
*expr_p
, tree
*pre_p
, tree
*post_p
,
2867 struct gimplify_init_ctor_preeval_data
*data
)
2869 enum gimplify_status one
;
2871 /* If the value is invariant, then there's nothing to pre-evaluate.
2872 But ensure it doesn't have any side-effects since a SAVE_EXPR is
2873 invariant but has side effects and might contain a reference to
2874 the object we're initializing. */
2875 if (TREE_INVARIANT (*expr_p
) && !TREE_SIDE_EFFECTS (*expr_p
))
2878 /* If the type has non-trivial constructors, we can't pre-evaluate. */
2879 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p
)))
2882 /* Recurse for nested constructors. */
2883 if (TREE_CODE (*expr_p
) == CONSTRUCTOR
)
2885 unsigned HOST_WIDE_INT ix
;
2886 constructor_elt
*ce
;
2887 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (*expr_p
);
2889 for (ix
= 0; VEC_iterate (constructor_elt
, v
, ix
, ce
); ix
++)
2890 gimplify_init_ctor_preeval (&ce
->value
, pre_p
, post_p
, data
);
2894 /* If this is a variable sized type, we must remember the size. */
2895 maybe_with_size_expr (expr_p
);
2897 /* Gimplify the constructor element to something appropriate for the rhs
2898 of a MODIFY_EXPR. Given that we know the lhs is an aggregate, we know
2899 the gimplifier will consider this a store to memory. Doing this
2900 gimplification now means that we won't have to deal with complicated
2901 language-specific trees, nor trees like SAVE_EXPR that can induce
2902 exponential search behavior. */
2903 one
= gimplify_expr (expr_p
, pre_p
, post_p
, is_gimple_mem_rhs
, fb_rvalue
);
2904 if (one
== GS_ERROR
)
2910 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
2911 with the lhs, since "a = { .x=a }" doesn't make sense. This will
2912 always be true for all scalars, since is_gimple_mem_rhs insists on a
2913 temporary variable for them. */
2914 if (DECL_P (*expr_p
))
2917 /* If this is of variable size, we have no choice but to assume it doesn't
2918 overlap since we can't make a temporary for it. */
2919 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (*expr_p
))) != INTEGER_CST
)
2922 /* Otherwise, we must search for overlap ... */
2923 if (!walk_tree (expr_p
, gimplify_init_ctor_preeval_1
, data
, NULL
))
2926 /* ... and if found, force the value into a temporary. */
2927 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
2930 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
2931 a RANGE_EXPR in a CONSTRUCTOR for an array.
2935 object[var] = value;
2942 We increment var _after_ the loop exit check because we might otherwise
2943 fail if upper == TYPE_MAX_VALUE (type for upper).
2945 Note that we never have to deal with SAVE_EXPRs here, because this has
2946 already been taken care of for us, in gimplify_init_ctor_preeval(). */
2948 static void gimplify_init_ctor_eval (tree
, VEC(constructor_elt
,gc
) *,
2952 gimplify_init_ctor_eval_range (tree object
, tree lower
, tree upper
,
2953 tree value
, tree array_elt_type
,
2954 tree
*pre_p
, bool cleared
)
2956 tree loop_entry_label
, loop_exit_label
;
2957 tree var
, var_type
, cref
, tmp
;
2959 loop_entry_label
= create_artificial_label ();
2960 loop_exit_label
= create_artificial_label ();
2962 /* Create and initialize the index variable. */
2963 var_type
= TREE_TYPE (upper
);
2964 var
= create_tmp_var (var_type
, NULL
);
2965 append_to_statement_list (build_gimple_modify_stmt (var
, lower
), pre_p
);
2967 /* Add the loop entry label. */
2968 append_to_statement_list (build1 (LABEL_EXPR
,
2973 /* Build the reference. */
2974 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
2975 var
, NULL_TREE
, NULL_TREE
);
2977 /* If we are a constructor, just call gimplify_init_ctor_eval to do
2978 the store. Otherwise just assign value to the reference. */
2980 if (TREE_CODE (value
) == CONSTRUCTOR
)
2981 /* NB we might have to call ourself recursively through
2982 gimplify_init_ctor_eval if the value is a constructor. */
2983 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
2986 append_to_statement_list (build_gimple_modify_stmt (cref
, value
), pre_p
);
2988 /* We exit the loop when the index var is equal to the upper bound. */
2989 gimplify_and_add (build3 (COND_EXPR
, void_type_node
,
2990 build2 (EQ_EXPR
, boolean_type_node
,
2998 /* Otherwise, increment the index var... */
2999 tmp
= build2 (PLUS_EXPR
, var_type
, var
,
3000 fold_convert (var_type
, integer_one_node
));
3001 append_to_statement_list (build_gimple_modify_stmt (var
, tmp
), pre_p
);
3003 /* ...and jump back to the loop entry. */
3004 append_to_statement_list (build1 (GOTO_EXPR
,
3009 /* Add the loop exit label. */
3010 append_to_statement_list (build1 (LABEL_EXPR
,
3016 /* Return true if FDECL is accessing a field that is zero sized. */
3019 zero_sized_field_decl (const_tree fdecl
)
3021 if (TREE_CODE (fdecl
) == FIELD_DECL
&& DECL_SIZE (fdecl
)
3022 && integer_zerop (DECL_SIZE (fdecl
)))
3027 /* Return true if TYPE is zero sized. */
3030 zero_sized_type (const_tree type
)
3032 if (AGGREGATE_TYPE_P (type
) && TYPE_SIZE (type
)
3033 && integer_zerop (TYPE_SIZE (type
)))
3038 /* A subroutine of gimplify_init_constructor. Generate individual
3039 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
3040 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
3041 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
3045 gimplify_init_ctor_eval (tree object
, VEC(constructor_elt
,gc
) *elts
,
3046 tree
*pre_p
, bool cleared
)
3048 tree array_elt_type
= NULL
;
3049 unsigned HOST_WIDE_INT ix
;
3050 tree purpose
, value
;
3052 if (TREE_CODE (TREE_TYPE (object
)) == ARRAY_TYPE
)
3053 array_elt_type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object
)));
3055 FOR_EACH_CONSTRUCTOR_ELT (elts
, ix
, purpose
, value
)
3059 /* NULL values are created above for gimplification errors. */
3063 if (cleared
&& initializer_zerop (value
))
3066 /* ??? Here's to hoping the front end fills in all of the indices,
3067 so we don't have to figure out what's missing ourselves. */
3068 gcc_assert (purpose
);
3070 /* Skip zero-sized fields, unless value has side-effects. This can
3071 happen with calls to functions returning a zero-sized type, which
3072 we shouldn't discard. As a number of downstream passes don't
3073 expect sets of zero-sized fields, we rely on the gimplification of
3074 the MODIFY_EXPR we make below to drop the assignment statement. */
3075 if (! TREE_SIDE_EFFECTS (value
) && zero_sized_field_decl (purpose
))
3078 /* If we have a RANGE_EXPR, we have to build a loop to assign the
3080 if (TREE_CODE (purpose
) == RANGE_EXPR
)
3082 tree lower
= TREE_OPERAND (purpose
, 0);
3083 tree upper
= TREE_OPERAND (purpose
, 1);
3085 /* If the lower bound is equal to upper, just treat it as if
3086 upper was the index. */
3087 if (simple_cst_equal (lower
, upper
))
3091 gimplify_init_ctor_eval_range (object
, lower
, upper
, value
,
3092 array_elt_type
, pre_p
, cleared
);
3099 /* Do not use bitsizetype for ARRAY_REF indices. */
3100 if (TYPE_DOMAIN (TREE_TYPE (object
)))
3101 purpose
= fold_convert (TREE_TYPE (TYPE_DOMAIN (TREE_TYPE (object
))),
3103 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
3104 purpose
, NULL_TREE
, NULL_TREE
);
3108 gcc_assert (TREE_CODE (purpose
) == FIELD_DECL
);
3109 cref
= build3 (COMPONENT_REF
, TREE_TYPE (purpose
),
3110 unshare_expr (object
), purpose
, NULL_TREE
);
3113 if (TREE_CODE (value
) == CONSTRUCTOR
3114 && TREE_CODE (TREE_TYPE (value
)) != VECTOR_TYPE
)
3115 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
3119 init
= build2 (INIT_EXPR
, TREE_TYPE (cref
), cref
, value
);
3120 gimplify_and_add (init
, pre_p
);
3125 /* A subroutine of gimplify_modify_expr. Break out elements of a
3126 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
3128 Note that we still need to clear any elements that don't have explicit
3129 initializers, so if not all elements are initialized we keep the
3130 original MODIFY_EXPR, we just remove all of the constructor elements.
3132 If NOTIFY_TEMP_CREATION is true, do not gimplify, just return
3133 GS_ERROR if we would have to create a temporary when gimplifying
3134 this constructor. Otherwise, return GS_OK.
3136 If NOTIFY_TEMP_CREATION is false, just do the gimplification. */
3138 static enum gimplify_status
3139 gimplify_init_constructor (tree
*expr_p
, tree
*pre_p
,
3140 tree
*post_p
, bool want_value
,
3141 bool notify_temp_creation
)
3144 tree ctor
= GENERIC_TREE_OPERAND (*expr_p
, 1);
3145 tree type
= TREE_TYPE (ctor
);
3146 enum gimplify_status ret
;
3147 VEC(constructor_elt
,gc
) *elts
;
3149 if (TREE_CODE (ctor
) != CONSTRUCTOR
)
3150 return GS_UNHANDLED
;
3152 if (!notify_temp_creation
)
3154 ret
= gimplify_expr (&GENERIC_TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
3155 is_gimple_lvalue
, fb_lvalue
);
3156 if (ret
== GS_ERROR
)
3159 object
= GENERIC_TREE_OPERAND (*expr_p
, 0);
3161 elts
= CONSTRUCTOR_ELTS (ctor
);
3164 switch (TREE_CODE (type
))
3168 case QUAL_UNION_TYPE
:
3171 struct gimplify_init_ctor_preeval_data preeval_data
;
3172 HOST_WIDE_INT num_type_elements
, num_ctor_elements
;
3173 HOST_WIDE_INT num_nonzero_elements
;
3174 bool cleared
, valid_const_initializer
;
3176 /* Aggregate types must lower constructors to initialization of
3177 individual elements. The exception is that a CONSTRUCTOR node
3178 with no elements indicates zero-initialization of the whole. */
3179 if (VEC_empty (constructor_elt
, elts
))
3181 if (notify_temp_creation
)
3186 /* Fetch information about the constructor to direct later processing.
3187 We might want to make static versions of it in various cases, and
3188 can only do so if it known to be a valid constant initializer. */
3189 valid_const_initializer
3190 = categorize_ctor_elements (ctor
, &num_nonzero_elements
,
3191 &num_ctor_elements
, &cleared
);
3193 /* If a const aggregate variable is being initialized, then it
3194 should never be a lose to promote the variable to be static. */
3195 if (valid_const_initializer
3196 && num_nonzero_elements
> 1
3197 && TREE_READONLY (object
)
3198 && TREE_CODE (object
) == VAR_DECL
)
3200 if (notify_temp_creation
)
3202 DECL_INITIAL (object
) = ctor
;
3203 TREE_STATIC (object
) = 1;
3204 if (!DECL_NAME (object
))
3205 DECL_NAME (object
) = create_tmp_var_name ("C");
3206 walk_tree (&DECL_INITIAL (object
), force_labels_r
, NULL
, NULL
);
3208 /* ??? C++ doesn't automatically append a .<number> to the
3209 assembler name, and even when it does, it looks a FE private
3210 data structures to figure out what that number should be,
3211 which are not set for this variable. I suppose this is
3212 important for local statics for inline functions, which aren't
3213 "local" in the object file sense. So in order to get a unique
3214 TU-local symbol, we must invoke the lhd version now. */
3215 lhd_set_decl_assembler_name (object
);
3217 *expr_p
= NULL_TREE
;
3221 /* If there are "lots" of initialized elements, even discounting
3222 those that are not address constants (and thus *must* be
3223 computed at runtime), then partition the constructor into
3224 constant and non-constant parts. Block copy the constant
3225 parts in, then generate code for the non-constant parts. */
3226 /* TODO. There's code in cp/typeck.c to do this. */
3228 num_type_elements
= count_type_elements (type
, true);
3230 /* If count_type_elements could not determine number of type elements
3231 for a constant-sized object, assume clearing is needed.
3232 Don't do this for variable-sized objects, as store_constructor
3233 will ignore the clearing of variable-sized objects. */
3234 if (num_type_elements
< 0 && int_size_in_bytes (type
) >= 0)
3236 /* If there are "lots" of zeros, then block clear the object first. */
3237 else if (num_type_elements
- num_nonzero_elements
> CLEAR_RATIO
3238 && num_nonzero_elements
< num_type_elements
/4)
3240 /* ??? This bit ought not be needed. For any element not present
3241 in the initializer, we should simply set them to zero. Except
3242 we'd need to *find* the elements that are not present, and that
3243 requires trickery to avoid quadratic compile-time behavior in
3244 large cases or excessive memory use in small cases. */
3245 else if (num_ctor_elements
< num_type_elements
)
3248 /* If there are "lots" of initialized elements, and all of them
3249 are valid address constants, then the entire initializer can
3250 be dropped to memory, and then memcpy'd out. Don't do this
3251 for sparse arrays, though, as it's more efficient to follow
3252 the standard CONSTRUCTOR behavior of memset followed by
3253 individual element initialization. */
3254 if (valid_const_initializer
&& !cleared
)
3256 HOST_WIDE_INT size
= int_size_in_bytes (type
);
3259 /* ??? We can still get unbounded array types, at least
3260 from the C++ front end. This seems wrong, but attempt
3261 to work around it for now. */
3264 size
= int_size_in_bytes (TREE_TYPE (object
));
3266 TREE_TYPE (ctor
) = type
= TREE_TYPE (object
);
3269 /* Find the maximum alignment we can assume for the object. */
3270 /* ??? Make use of DECL_OFFSET_ALIGN. */
3271 if (DECL_P (object
))
3272 align
= DECL_ALIGN (object
);
3274 align
= TYPE_ALIGN (type
);
3276 if (size
> 0 && !can_move_by_pieces (size
, align
))
3280 if (notify_temp_creation
)
3283 new = create_tmp_var_raw (type
, "C");
3285 gimple_add_tmp_var (new);
3286 TREE_STATIC (new) = 1;
3287 TREE_READONLY (new) = 1;
3288 DECL_INITIAL (new) = ctor
;
3289 if (align
> DECL_ALIGN (new))
3291 DECL_ALIGN (new) = align
;
3292 DECL_USER_ALIGN (new) = 1;
3294 walk_tree (&DECL_INITIAL (new), force_labels_r
, NULL
, NULL
);
3296 GENERIC_TREE_OPERAND (*expr_p
, 1) = new;
3298 /* This is no longer an assignment of a CONSTRUCTOR, but
3299 we still may have processing to do on the LHS. So
3300 pretend we didn't do anything here to let that happen. */
3301 return GS_UNHANDLED
;
3305 if (notify_temp_creation
)
3308 /* If there are nonzero elements, pre-evaluate to capture elements
3309 overlapping with the lhs into temporaries. We must do this before
3310 clearing to fetch the values before they are zeroed-out. */
3311 if (num_nonzero_elements
> 0)
3313 preeval_data
.lhs_base_decl
= get_base_address (object
);
3314 if (!DECL_P (preeval_data
.lhs_base_decl
))
3315 preeval_data
.lhs_base_decl
= NULL
;
3316 preeval_data
.lhs_alias_set
= get_alias_set (object
);
3318 gimplify_init_ctor_preeval (&GENERIC_TREE_OPERAND (*expr_p
, 1),
3319 pre_p
, post_p
, &preeval_data
);
3324 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3325 Note that we still have to gimplify, in order to handle the
3326 case of variable sized types. Avoid shared tree structures. */
3327 CONSTRUCTOR_ELTS (ctor
) = NULL
;
3328 object
= unshare_expr (object
);
3329 gimplify_stmt (expr_p
);
3330 append_to_statement_list (*expr_p
, pre_p
);
3333 /* If we have not block cleared the object, or if there are nonzero
3334 elements in the constructor, add assignments to the individual
3335 scalar fields of the object. */
3336 if (!cleared
|| num_nonzero_elements
> 0)
3337 gimplify_init_ctor_eval (object
, elts
, pre_p
, cleared
);
3339 *expr_p
= NULL_TREE
;
3347 if (notify_temp_creation
)
3350 /* Extract the real and imaginary parts out of the ctor. */
3351 gcc_assert (VEC_length (constructor_elt
, elts
) == 2);
3352 r
= VEC_index (constructor_elt
, elts
, 0)->value
;
3353 i
= VEC_index (constructor_elt
, elts
, 1)->value
;
3354 if (r
== NULL
|| i
== NULL
)
3356 tree zero
= fold_convert (TREE_TYPE (type
), integer_zero_node
);
3363 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3364 represent creation of a complex value. */
3365 if (TREE_CONSTANT (r
) && TREE_CONSTANT (i
))
3367 ctor
= build_complex (type
, r
, i
);
3368 TREE_OPERAND (*expr_p
, 1) = ctor
;
3372 ctor
= build2 (COMPLEX_EXPR
, type
, r
, i
);
3373 TREE_OPERAND (*expr_p
, 1) = ctor
;
3374 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
3375 rhs_predicate_for (TREE_OPERAND (*expr_p
, 0)),
3383 unsigned HOST_WIDE_INT ix
;
3384 constructor_elt
*ce
;
3386 if (notify_temp_creation
)
3389 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3390 if (TREE_CONSTANT (ctor
))
3392 bool constant_p
= true;
3395 /* Even when ctor is constant, it might contain non-*_CST
3396 elements, such as addresses or trapping values like
3397 1.0/0.0 - 1.0/0.0. Such expressions don't belong
3398 in VECTOR_CST nodes. */
3399 FOR_EACH_CONSTRUCTOR_VALUE (elts
, ix
, value
)
3400 if (!CONSTANT_CLASS_P (value
))
3408 TREE_OPERAND (*expr_p
, 1) = build_vector_from_ctor (type
, elts
);
3412 /* Don't reduce an initializer constant even if we can't
3413 make a VECTOR_CST. It won't do anything for us, and it'll
3414 prevent us from representing it as a single constant. */
3415 if (initializer_constant_valid_p (ctor
, type
))
3418 TREE_CONSTANT (ctor
) = 0;
3419 TREE_INVARIANT (ctor
) = 0;
3422 /* Vector types use CONSTRUCTOR all the way through gimple
3423 compilation as a general initializer. */
3424 for (ix
= 0; VEC_iterate (constructor_elt
, elts
, ix
, ce
); ix
++)
3426 enum gimplify_status tret
;
3427 tret
= gimplify_expr (&ce
->value
, pre_p
, post_p
,
3428 is_gimple_val
, fb_rvalue
);
3429 if (tret
== GS_ERROR
)
3432 if (!is_gimple_reg (GENERIC_TREE_OPERAND (*expr_p
, 0)))
3433 GENERIC_TREE_OPERAND (*expr_p
, 1) = get_formal_tmp_var (ctor
, pre_p
);
3438 /* So how did we get a CONSTRUCTOR for a scalar type? */
3442 if (ret
== GS_ERROR
)
3444 else if (want_value
)
3446 append_to_statement_list (*expr_p
, pre_p
);
3454 /* Given a pointer value OP0, return a simplified version of an
3455 indirection through OP0, or NULL_TREE if no simplification is
3456 possible. Note that the resulting type may be different from
3457 the type pointed to in the sense that it is still compatible
3458 from the langhooks point of view. */
3461 gimple_fold_indirect_ref (tree t
)
3463 tree type
= TREE_TYPE (TREE_TYPE (t
));
3467 STRIP_USELESS_TYPE_CONVERSION (sub
);
3468 subtype
= TREE_TYPE (sub
);
3469 if (!POINTER_TYPE_P (subtype
))
3472 if (TREE_CODE (sub
) == ADDR_EXPR
)
3474 tree op
= TREE_OPERAND (sub
, 0);
3475 tree optype
= TREE_TYPE (op
);
3477 if (useless_type_conversion_p (type
, optype
))
3480 /* *(foo *)&fooarray => fooarray[0] */
3481 if (TREE_CODE (optype
) == ARRAY_TYPE
3482 && useless_type_conversion_p (type
, TREE_TYPE (optype
)))
3484 tree type_domain
= TYPE_DOMAIN (optype
);
3485 tree min_val
= size_zero_node
;
3486 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
3487 min_val
= TYPE_MIN_VALUE (type_domain
);
3488 return build4 (ARRAY_REF
, type
, op
, min_val
, NULL_TREE
, NULL_TREE
);
3492 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
3493 if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
3494 && useless_type_conversion_p (type
, TREE_TYPE (TREE_TYPE (subtype
))))
3497 tree min_val
= size_zero_node
;
3499 sub
= gimple_fold_indirect_ref (sub
);
3501 sub
= build1 (INDIRECT_REF
, TREE_TYPE (subtype
), osub
);
3502 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
3503 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
3504 min_val
= TYPE_MIN_VALUE (type_domain
);
3505 return build4 (ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
, NULL_TREE
);
3511 /* Given a pointer value OP0, return a simplified version of an
3512 indirection through OP0, or NULL_TREE if no simplification is
3513 possible. This may only be applied to a rhs of an expression.
3514 Note that the resulting type may be different from the type pointed
3515 to in the sense that it is still compatible from the langhooks
3519 gimple_fold_indirect_ref_rhs (tree t
)
3521 return gimple_fold_indirect_ref (t
);
3524 /* Subroutine of gimplify_modify_expr to do simplifications of
3525 MODIFY_EXPRs based on the code of the RHS. We loop for as long as
3526 something changes. */
3528 static enum gimplify_status
3529 gimplify_modify_expr_rhs (tree
*expr_p
, tree
*from_p
, tree
*to_p
, tree
*pre_p
,
3530 tree
*post_p
, bool want_value
)
3532 enum gimplify_status ret
= GS_OK
;
3534 while (ret
!= GS_UNHANDLED
)
3535 switch (TREE_CODE (*from_p
))
3538 /* If we're assigning from a constant constructor, move the
3539 constructor expression to the RHS of the MODIFY_EXPR. */
3540 if (DECL_INITIAL (*from_p
)
3541 && TYPE_READONLY (TREE_TYPE (*from_p
))
3542 && !TREE_THIS_VOLATILE (*from_p
)
3543 && TREE_CODE (DECL_INITIAL (*from_p
)) == CONSTRUCTOR
)
3545 tree old_from
= *from_p
;
3547 /* Move the constructor into the RHS. */
3548 *from_p
= unshare_expr (DECL_INITIAL (*from_p
));
3550 /* Let's see if gimplify_init_constructor will need to put
3551 it in memory. If so, revert the change. */
3552 ret
= gimplify_init_constructor (expr_p
, NULL
, NULL
, false, true);
3553 if (ret
== GS_ERROR
)
3568 /* If we have code like
3572 where the type of "x" is a (possibly cv-qualified variant
3573 of "A"), treat the entire expression as identical to "x".
3574 This kind of code arises in C++ when an object is bound
3575 to a const reference, and if "x" is a TARGET_EXPR we want
3576 to take advantage of the optimization below. */
3577 tree t
= gimple_fold_indirect_ref_rhs (TREE_OPERAND (*from_p
, 0));
3590 /* If we are initializing something from a TARGET_EXPR, strip the
3591 TARGET_EXPR and initialize it directly, if possible. This can't
3592 be done if the initializer is void, since that implies that the
3593 temporary is set in some non-trivial way.
3595 ??? What about code that pulls out the temp and uses it
3596 elsewhere? I think that such code never uses the TARGET_EXPR as
3597 an initializer. If I'm wrong, we'll die because the temp won't
3598 have any RTL. In that case, I guess we'll need to replace
3599 references somehow. */
3600 tree init
= TARGET_EXPR_INITIAL (*from_p
);
3603 && !VOID_TYPE_P (TREE_TYPE (init
)))
3614 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
3616 gimplify_compound_expr (from_p
, pre_p
, true);
3621 /* If we're initializing from a CONSTRUCTOR, break this into
3622 individual MODIFY_EXPRs. */
3623 return gimplify_init_constructor (expr_p
, pre_p
, post_p
, want_value
,
3627 /* If we're assigning to a non-register type, push the assignment
3628 down into the branches. This is mandatory for ADDRESSABLE types,
3629 since we cannot generate temporaries for such, but it saves a
3630 copy in other cases as well. */
3631 if (!is_gimple_reg_type (TREE_TYPE (*from_p
)))
3633 /* This code should mirror the code in gimplify_cond_expr. */
3634 enum tree_code code
= TREE_CODE (*expr_p
);
3635 tree cond
= *from_p
;
3636 tree result
= *to_p
;
3638 ret
= gimplify_expr (&result
, pre_p
, post_p
,
3639 is_gimple_lvalue
, fb_lvalue
);
3640 if (ret
!= GS_ERROR
)
3643 if (TREE_TYPE (TREE_OPERAND (cond
, 1)) != void_type_node
)
3644 TREE_OPERAND (cond
, 1)
3645 = build2 (code
, void_type_node
, result
,
3646 TREE_OPERAND (cond
, 1));
3647 if (TREE_TYPE (TREE_OPERAND (cond
, 2)) != void_type_node
)
3648 TREE_OPERAND (cond
, 2)
3649 = build2 (code
, void_type_node
, unshare_expr (result
),
3650 TREE_OPERAND (cond
, 2));
3652 TREE_TYPE (cond
) = void_type_node
;
3653 recalculate_side_effects (cond
);
3657 gimplify_and_add (cond
, pre_p
);
3658 *expr_p
= unshare_expr (result
);
3669 /* For calls that return in memory, give *to_p as the CALL_EXPR's
3670 return slot so that we don't generate a temporary. */
3671 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p
)
3672 && aggregate_value_p (*from_p
, *from_p
))
3676 if (!(rhs_predicate_for (*to_p
))(*from_p
))
3677 /* If we need a temporary, *to_p isn't accurate. */
3679 else if (TREE_CODE (*to_p
) == RESULT_DECL
3680 && DECL_NAME (*to_p
) == NULL_TREE
3681 && needs_to_live_in_memory (*to_p
))
3682 /* It's OK to use the return slot directly unless it's an NRV. */
3684 else if (is_gimple_reg_type (TREE_TYPE (*to_p
))
3685 || (DECL_P (*to_p
) && DECL_REGISTER (*to_p
)))
3686 /* Don't force regs into memory. */
3688 else if (TREE_CODE (*to_p
) == VAR_DECL
3689 && DECL_GIMPLE_FORMAL_TEMP_P (*to_p
))
3690 /* Don't use the original target if it's a formal temp; we
3691 don't want to take their addresses. */
3693 else if (TREE_CODE (*expr_p
) == INIT_EXPR
)
3694 /* It's OK to use the target directly if it's being
3697 else if (!is_gimple_non_addressable (*to_p
))
3698 /* Don't use the original target if it's already addressable;
3699 if its address escapes, and the called function uses the
3700 NRV optimization, a conforming program could see *to_p
3701 change before the called function returns; see c++/19317.
3702 When optimizing, the return_slot pass marks more functions
3703 as safe after we have escape info. */
3710 CALL_EXPR_RETURN_SLOT_OPT (*from_p
) = 1;
3711 mark_addressable (*to_p
);
3718 /* If we're initializing from a container, push the initialization
3720 case CLEANUP_POINT_EXPR
:
3722 case STATEMENT_LIST
:
3724 tree wrap
= *from_p
;
3727 ret
= gimplify_expr (to_p
, pre_p
, post_p
,
3728 is_gimple_min_lval
, fb_lvalue
);
3729 if (ret
!= GS_ERROR
)
3732 t
= voidify_wrapper_expr (wrap
, *expr_p
);
3733 gcc_assert (t
== *expr_p
);
3737 gimplify_and_add (wrap
, pre_p
);
3738 *expr_p
= unshare_expr (*to_p
);
3753 /* Destructively convert the TREE pointer in TP into a gimple tuple if
3757 tree_to_gimple_tuple (tree
*tp
)
3760 switch (TREE_CODE (*tp
))
3762 case GIMPLE_MODIFY_STMT
:
3766 struct gimple_stmt
*gs
;
3767 tree lhs
= TREE_OPERAND (*tp
, 0);
3768 bool def_stmt_self_p
= false;
3770 if (TREE_CODE (lhs
) == SSA_NAME
)
3772 if (SSA_NAME_DEF_STMT (lhs
) == *tp
)
3773 def_stmt_self_p
= true;
3776 gs
= &make_node (GIMPLE_MODIFY_STMT
)->gstmt
;
3777 gs
->base
= (*tp
)->base
;
3778 /* The set to base above overwrites the CODE. */
3779 TREE_SET_CODE ((tree
) gs
, GIMPLE_MODIFY_STMT
);
3781 SET_EXPR_LOCUS ((tree
) gs
, EXPR_LOCUS (*tp
));
3782 gs
->operands
[0] = TREE_OPERAND (*tp
, 0);
3783 gs
->operands
[1] = TREE_OPERAND (*tp
, 1);
3784 gs
->block
= TREE_BLOCK (*tp
);
3787 /* If we re-gimplify a set to an SSA_NAME, we must change the
3788 SSA name's DEF_STMT link. */
3789 if (def_stmt_self_p
)
3790 SSA_NAME_DEF_STMT (GIMPLE_STMT_OPERAND (*tp
, 0)) = *tp
;
3799 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
3800 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
3801 DECL_GIMPLE_REG_P set.
3803 IMPORTANT NOTE: This promotion is performed by introducing a load of the
3804 other, unmodified part of the complex object just before the total store.
3805 As a consequence, if the object is still uninitialized, an undefined value
3806 will be loaded into a register, which may result in a spurious exception
3807 if the register is floating-point and the value happens to be a signaling
3808 NaN for example. Then the fully-fledged complex operations lowering pass
3809 followed by a DCE pass are necessary in order to fix things up. */
3811 static enum gimplify_status
3812 gimplify_modify_expr_complex_part (tree
*expr_p
, tree
*pre_p
, bool want_value
)
3814 enum tree_code code
, ocode
;
3815 tree lhs
, rhs
, new_rhs
, other
, realpart
, imagpart
;
3817 lhs
= GENERIC_TREE_OPERAND (*expr_p
, 0);
3818 rhs
= GENERIC_TREE_OPERAND (*expr_p
, 1);
3819 code
= TREE_CODE (lhs
);
3820 lhs
= TREE_OPERAND (lhs
, 0);
3822 ocode
= code
== REALPART_EXPR
? IMAGPART_EXPR
: REALPART_EXPR
;
3823 other
= build1 (ocode
, TREE_TYPE (rhs
), lhs
);
3824 other
= get_formal_tmp_var (other
, pre_p
);
3826 realpart
= code
== REALPART_EXPR
? rhs
: other
;
3827 imagpart
= code
== REALPART_EXPR
? other
: rhs
;
3829 if (TREE_CONSTANT (realpart
) && TREE_CONSTANT (imagpart
))
3830 new_rhs
= build_complex (TREE_TYPE (lhs
), realpart
, imagpart
);
3832 new_rhs
= build2 (COMPLEX_EXPR
, TREE_TYPE (lhs
), realpart
, imagpart
);
3834 GENERIC_TREE_OPERAND (*expr_p
, 0) = lhs
;
3835 GENERIC_TREE_OPERAND (*expr_p
, 1) = new_rhs
;
3839 tree_to_gimple_tuple (expr_p
);
3841 append_to_statement_list (*expr_p
, pre_p
);
3848 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
3854 PRE_P points to the list where side effects that must happen before
3855 *EXPR_P should be stored.
3857 POST_P points to the list where side effects that must happen after
3858 *EXPR_P should be stored.
3860 WANT_VALUE is nonzero iff we want to use the value of this expression
3861 in another expression. */
3863 static enum gimplify_status
3864 gimplify_modify_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
, bool want_value
)
3866 tree
*from_p
= &GENERIC_TREE_OPERAND (*expr_p
, 1);
3867 tree
*to_p
= &GENERIC_TREE_OPERAND (*expr_p
, 0);
3868 enum gimplify_status ret
= GS_UNHANDLED
;
3870 gcc_assert (TREE_CODE (*expr_p
) == MODIFY_EXPR
3871 || TREE_CODE (*expr_p
) == GIMPLE_MODIFY_STMT
3872 || TREE_CODE (*expr_p
) == INIT_EXPR
);
3874 /* Insert pointer conversions required by the middle-end that are not
3875 required by the frontend. This fixes middle-end type checking for
3876 for example gcc.dg/redecl-6.c. */
3877 if (POINTER_TYPE_P (TREE_TYPE (*to_p
))
3878 && lang_hooks
.types_compatible_p (TREE_TYPE (*to_p
), TREE_TYPE (*from_p
)))
3880 STRIP_USELESS_TYPE_CONVERSION (*from_p
);
3881 if (!useless_type_conversion_p (TREE_TYPE (*to_p
), TREE_TYPE (*from_p
)))
3882 *from_p
= fold_convert (TREE_TYPE (*to_p
), *from_p
);
3885 /* See if any simplifications can be done based on what the RHS is. */
3886 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
3888 if (ret
!= GS_UNHANDLED
)
3891 /* For zero sized types only gimplify the left hand side and right hand
3892 side as statements and throw away the assignment. Do this after
3893 gimplify_modify_expr_rhs so we handle TARGET_EXPRs of addressable
3895 if (zero_sized_type (TREE_TYPE (*from_p
)))
3897 gimplify_stmt (from_p
);
3898 gimplify_stmt (to_p
);
3899 append_to_statement_list (*from_p
, pre_p
);
3900 append_to_statement_list (*to_p
, pre_p
);
3901 *expr_p
= NULL_TREE
;
3905 /* If the value being copied is of variable width, compute the length
3906 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
3907 before gimplifying any of the operands so that we can resolve any
3908 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
3909 the size of the expression to be copied, not of the destination, so
3910 that is what we must here. */
3911 maybe_with_size_expr (from_p
);
3913 ret
= gimplify_expr (to_p
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
3914 if (ret
== GS_ERROR
)
3917 ret
= gimplify_expr (from_p
, pre_p
, post_p
,
3918 rhs_predicate_for (*to_p
), fb_rvalue
);
3919 if (ret
== GS_ERROR
)
3922 /* Now see if the above changed *from_p to something we handle specially. */
3923 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
3925 if (ret
!= GS_UNHANDLED
)
3928 /* If we've got a variable sized assignment between two lvalues (i.e. does
3929 not involve a call), then we can make things a bit more straightforward
3930 by converting the assignment to memcpy or memset. */
3931 if (TREE_CODE (*from_p
) == WITH_SIZE_EXPR
)
3933 tree from
= TREE_OPERAND (*from_p
, 0);
3934 tree size
= TREE_OPERAND (*from_p
, 1);
3936 if (TREE_CODE (from
) == CONSTRUCTOR
)
3937 return gimplify_modify_expr_to_memset (expr_p
, size
, want_value
);
3938 if (is_gimple_addressable (from
))
3941 return gimplify_modify_expr_to_memcpy (expr_p
, size
, want_value
);
3945 /* Transform partial stores to non-addressable complex variables into
3946 total stores. This allows us to use real instead of virtual operands
3947 for these variables, which improves optimization. */
3948 if ((TREE_CODE (*to_p
) == REALPART_EXPR
3949 || TREE_CODE (*to_p
) == IMAGPART_EXPR
)
3950 && is_gimple_reg (TREE_OPERAND (*to_p
, 0)))
3951 return gimplify_modify_expr_complex_part (expr_p
, pre_p
, want_value
);
3953 if (gimplify_ctxp
->into_ssa
&& is_gimple_reg (*to_p
))
3955 /* If we've somehow already got an SSA_NAME on the LHS, then
3956 we're probably modified it twice. Not good. */
3957 gcc_assert (TREE_CODE (*to_p
) != SSA_NAME
);
3958 *to_p
= make_ssa_name (*to_p
, *expr_p
);
3961 /* Try to alleviate the effects of the gimplification creating artificial
3962 temporaries (see for example is_gimple_reg_rhs) on the debug info. */
3963 if (!gimplify_ctxp
->into_ssa
3964 && DECL_P (*from_p
) && DECL_IGNORED_P (*from_p
)
3965 && DECL_P (*to_p
) && !DECL_IGNORED_P (*to_p
))
3967 if (!DECL_NAME (*from_p
) && DECL_NAME (*to_p
))
3969 = create_tmp_var_name (IDENTIFIER_POINTER (DECL_NAME (*to_p
)));
3970 DECL_DEBUG_EXPR_IS_FROM (*from_p
) = 1;
3971 SET_DECL_DEBUG_EXPR (*from_p
, *to_p
);
3976 tree_to_gimple_tuple (expr_p
);
3978 append_to_statement_list (*expr_p
, pre_p
);
3986 /* Gimplify a comparison between two variable-sized objects. Do this
3987 with a call to BUILT_IN_MEMCMP. */
3989 static enum gimplify_status
3990 gimplify_variable_sized_compare (tree
*expr_p
)
3992 tree op0
= TREE_OPERAND (*expr_p
, 0);
3993 tree op1
= TREE_OPERAND (*expr_p
, 1);
3994 tree t
, arg
, dest
, src
;
3996 arg
= TYPE_SIZE_UNIT (TREE_TYPE (op0
));
3997 arg
= unshare_expr (arg
);
3998 arg
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (arg
, op0
);
3999 src
= build_fold_addr_expr (op1
);
4000 dest
= build_fold_addr_expr (op0
);
4001 t
= implicit_built_in_decls
[BUILT_IN_MEMCMP
];
4002 t
= build_call_expr (t
, 3, dest
, src
, arg
);
4004 = build2 (TREE_CODE (*expr_p
), TREE_TYPE (*expr_p
), t
, integer_zero_node
);
4009 /* Gimplify a comparison between two aggregate objects of integral scalar
4010 mode as a comparison between the bitwise equivalent scalar values. */
4012 static enum gimplify_status
4013 gimplify_scalar_mode_aggregate_compare (tree
*expr_p
)
4015 tree op0
= TREE_OPERAND (*expr_p
, 0);
4016 tree op1
= TREE_OPERAND (*expr_p
, 1);
4018 tree type
= TREE_TYPE (op0
);
4019 tree scalar_type
= lang_hooks
.types
.type_for_mode (TYPE_MODE (type
), 1);
4021 op0
= fold_build1 (VIEW_CONVERT_EXPR
, scalar_type
, op0
);
4022 op1
= fold_build1 (VIEW_CONVERT_EXPR
, scalar_type
, op1
);
4025 = fold_build2 (TREE_CODE (*expr_p
), TREE_TYPE (*expr_p
), op0
, op1
);
4030 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
4031 points to the expression to gimplify.
4033 Expressions of the form 'a && b' are gimplified to:
4035 a && b ? true : false
4037 gimplify_cond_expr will do the rest.
4039 PRE_P points to the list where side effects that must happen before
4040 *EXPR_P should be stored. */
4042 static enum gimplify_status
4043 gimplify_boolean_expr (tree
*expr_p
)
4045 /* Preserve the original type of the expression. */
4046 tree type
= TREE_TYPE (*expr_p
);
4048 *expr_p
= build3 (COND_EXPR
, type
, *expr_p
,
4049 fold_convert (type
, boolean_true_node
),
4050 fold_convert (type
, boolean_false_node
));
4055 /* Gimplifies an expression sequence. This function gimplifies each
4056 expression and re-writes the original expression with the last
4057 expression of the sequence in GIMPLE form.
4059 PRE_P points to the list where the side effects for all the
4060 expressions in the sequence will be emitted.
4062 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
4063 /* ??? Should rearrange to share the pre-queue with all the indirect
4064 invocations of gimplify_expr. Would probably save on creations
4065 of statement_list nodes. */
4067 static enum gimplify_status
4068 gimplify_compound_expr (tree
*expr_p
, tree
*pre_p
, bool want_value
)
4074 tree
*sub_p
= &TREE_OPERAND (t
, 0);
4076 if (TREE_CODE (*sub_p
) == COMPOUND_EXPR
)
4077 gimplify_compound_expr (sub_p
, pre_p
, false);
4079 gimplify_stmt (sub_p
);
4080 append_to_statement_list (*sub_p
, pre_p
);
4082 t
= TREE_OPERAND (t
, 1);
4084 while (TREE_CODE (t
) == COMPOUND_EXPR
);
4091 gimplify_stmt (expr_p
);
4096 /* Gimplifies a statement list. These may be created either by an
4097 enlightened front-end, or by shortcut_cond_expr. */
4099 static enum gimplify_status
4100 gimplify_statement_list (tree
*expr_p
, tree
*pre_p
)
4102 tree temp
= voidify_wrapper_expr (*expr_p
, NULL
);
4104 tree_stmt_iterator i
= tsi_start (*expr_p
);
4106 while (!tsi_end_p (i
))
4110 gimplify_stmt (tsi_stmt_ptr (i
));
4115 else if (TREE_CODE (t
) == STATEMENT_LIST
)
4117 tsi_link_before (&i
, t
, TSI_SAME_STMT
);
4126 append_to_statement_list (*expr_p
, pre_p
);
4134 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
4135 gimplify. After gimplification, EXPR_P will point to a new temporary
4136 that holds the original value of the SAVE_EXPR node.
4138 PRE_P points to the list where side effects that must happen before
4139 *EXPR_P should be stored. */
4141 static enum gimplify_status
4142 gimplify_save_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
4144 enum gimplify_status ret
= GS_ALL_DONE
;
4147 gcc_assert (TREE_CODE (*expr_p
) == SAVE_EXPR
);
4148 val
= TREE_OPERAND (*expr_p
, 0);
4150 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
4151 if (!SAVE_EXPR_RESOLVED_P (*expr_p
))
4153 /* The operand may be a void-valued expression such as SAVE_EXPRs
4154 generated by the Java frontend for class initialization. It is
4155 being executed only for its side-effects. */
4156 if (TREE_TYPE (val
) == void_type_node
)
4158 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
4159 is_gimple_stmt
, fb_none
);
4160 append_to_statement_list (TREE_OPERAND (*expr_p
, 0), pre_p
);
4164 val
= get_initialized_tmp_var (val
, pre_p
, post_p
);
4166 TREE_OPERAND (*expr_p
, 0) = val
;
4167 SAVE_EXPR_RESOLVED_P (*expr_p
) = 1;
4175 /* Re-write the ADDR_EXPR node pointed to by EXPR_P
4182 PRE_P points to the list where side effects that must happen before
4183 *EXPR_P should be stored.
4185 POST_P points to the list where side effects that must happen after
4186 *EXPR_P should be stored. */
4188 static enum gimplify_status
4189 gimplify_addr_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
4191 tree expr
= *expr_p
;
4192 tree op0
= TREE_OPERAND (expr
, 0);
4193 enum gimplify_status ret
;
4195 switch (TREE_CODE (op0
))
4198 case MISALIGNED_INDIRECT_REF
:
4200 /* Check if we are dealing with an expression of the form '&*ptr'.
4201 While the front end folds away '&*ptr' into 'ptr', these
4202 expressions may be generated internally by the compiler (e.g.,
4203 builtins like __builtin_va_end). */
4204 /* Caution: the silent array decomposition semantics we allow for
4205 ADDR_EXPR means we can't always discard the pair. */
4206 /* Gimplification of the ADDR_EXPR operand may drop
4207 cv-qualification conversions, so make sure we add them if
4210 tree op00
= TREE_OPERAND (op0
, 0);
4211 tree t_expr
= TREE_TYPE (expr
);
4212 tree t_op00
= TREE_TYPE (op00
);
4214 if (!useless_type_conversion_p (t_expr
, t_op00
))
4215 op00
= fold_convert (TREE_TYPE (expr
), op00
);
4221 case VIEW_CONVERT_EXPR
:
4222 /* Take the address of our operand and then convert it to the type of
4225 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
4226 all clear. The impact of this transformation is even less clear. */
4228 /* If the operand is a useless conversion, look through it. Doing so
4229 guarantees that the ADDR_EXPR and its operand will remain of the
4231 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0
, 0)))
4232 op0
= TREE_OPERAND (op0
, 0);
4234 *expr_p
= fold_convert (TREE_TYPE (expr
),
4235 build_fold_addr_expr (TREE_OPERAND (op0
, 0)));
4240 /* We use fb_either here because the C frontend sometimes takes
4241 the address of a call that returns a struct; see
4242 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
4243 the implied temporary explicit. */
4245 /* Mark the RHS addressable. */
4246 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, post_p
,
4247 is_gimple_addressable
, fb_either
);
4248 if (ret
!= GS_ERROR
)
4250 op0
= TREE_OPERAND (expr
, 0);
4252 /* For various reasons, the gimplification of the expression
4253 may have made a new INDIRECT_REF. */
4254 if (TREE_CODE (op0
) == INDIRECT_REF
)
4255 goto do_indirect_ref
;
4257 /* Make sure TREE_INVARIANT, TREE_CONSTANT, and TREE_SIDE_EFFECTS
4259 recompute_tree_invariant_for_addr_expr (expr
);
4261 mark_addressable (TREE_OPERAND (expr
, 0));
4269 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
4270 value; output operands should be a gimple lvalue. */
4272 static enum gimplify_status
4273 gimplify_asm_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
4275 tree expr
= *expr_p
;
4276 int noutputs
= list_length (ASM_OUTPUTS (expr
));
4277 const char **oconstraints
4278 = (const char **) alloca ((noutputs
) * sizeof (const char *));
4281 const char *constraint
;
4282 bool allows_mem
, allows_reg
, is_inout
;
4283 enum gimplify_status ret
, tret
;
4286 for (i
= 0, link
= ASM_OUTPUTS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
4288 size_t constraint_len
;
4289 oconstraints
[i
] = constraint
4290 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
4291 constraint_len
= strlen (constraint
);
4292 if (constraint_len
== 0)
4295 parse_output_constraint (&constraint
, i
, 0, 0,
4296 &allows_mem
, &allows_reg
, &is_inout
);
4298 if (!allows_reg
&& allows_mem
)
4299 mark_addressable (TREE_VALUE (link
));
4301 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
4302 is_inout
? is_gimple_min_lval
: is_gimple_lvalue
,
4303 fb_lvalue
| fb_mayfail
);
4304 if (tret
== GS_ERROR
)
4306 error ("invalid lvalue in asm output %d", i
);
4312 /* An input/output operand. To give the optimizers more
4313 flexibility, split it into separate input and output
4318 /* Turn the in/out constraint into an output constraint. */
4319 char *p
= xstrdup (constraint
);
4321 TREE_VALUE (TREE_PURPOSE (link
)) = build_string (constraint_len
, p
);
4323 /* And add a matching input constraint. */
4326 sprintf (buf
, "%d", i
);
4328 /* If there are multiple alternatives in the constraint,
4329 handle each of them individually. Those that allow register
4330 will be replaced with operand number, the others will stay
4332 if (strchr (p
, ',') != NULL
)
4334 size_t len
= 0, buflen
= strlen (buf
);
4335 char *beg
, *end
, *str
, *dst
;
4339 end
= strchr (beg
, ',');
4341 end
= strchr (beg
, '\0');
4342 if ((size_t) (end
- beg
) < buflen
)
4345 len
+= end
- beg
+ 1;
4352 str
= (char *) alloca (len
);
4353 for (beg
= p
+ 1, dst
= str
;;)
4356 bool mem_p
, reg_p
, inout_p
;
4358 end
= strchr (beg
, ',');
4363 parse_output_constraint (&tem
, i
, 0, 0,
4364 &mem_p
, ®_p
, &inout_p
);
4369 memcpy (dst
, buf
, buflen
);
4378 memcpy (dst
, beg
, len
);
4387 input
= build_string (dst
- str
, str
);
4390 input
= build_string (strlen (buf
), buf
);
4393 input
= build_string (constraint_len
- 1, constraint
+ 1);
4397 input
= build_tree_list (build_tree_list (NULL_TREE
, input
),
4398 unshare_expr (TREE_VALUE (link
)));
4399 ASM_INPUTS (expr
) = chainon (ASM_INPUTS (expr
), input
);
4403 for (link
= ASM_INPUTS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
4406 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
4407 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
4408 oconstraints
, &allows_mem
, &allows_reg
);
4410 /* If we can't make copies, we can only accept memory. */
4411 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (link
))))
4417 error ("impossible constraint in %<asm%>");
4418 error ("non-memory input %d must stay in memory", i
);
4423 /* If the operand is a memory input, it should be an lvalue. */
4424 if (!allows_reg
&& allows_mem
)
4426 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
4427 is_gimple_lvalue
, fb_lvalue
| fb_mayfail
);
4428 mark_addressable (TREE_VALUE (link
));
4429 if (tret
== GS_ERROR
)
4431 error ("memory input %d is not directly addressable", i
);
4437 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
4438 is_gimple_asm_val
, fb_rvalue
);
4439 if (tret
== GS_ERROR
)
4447 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
4448 WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
4449 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
4450 return to this function.
4452 FIXME should we complexify the prequeue handling instead? Or use flags
4453 for all the cleanups and let the optimizer tighten them up? The current
4454 code seems pretty fragile; it will break on a cleanup within any
4455 non-conditional nesting. But any such nesting would be broken, anyway;
4456 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
4457 and continues out of it. We can do that at the RTL level, though, so
4458 having an optimizer to tighten up try/finally regions would be a Good
4461 static enum gimplify_status
4462 gimplify_cleanup_point_expr (tree
*expr_p
, tree
*pre_p
)
4464 tree_stmt_iterator iter
;
4467 tree temp
= voidify_wrapper_expr (*expr_p
, NULL
);
4469 /* We only care about the number of conditions between the innermost
4470 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
4471 any cleanups collected outside the CLEANUP_POINT_EXPR. */
4472 int old_conds
= gimplify_ctxp
->conditions
;
4473 tree old_cleanups
= gimplify_ctxp
->conditional_cleanups
;
4474 gimplify_ctxp
->conditions
= 0;
4475 gimplify_ctxp
->conditional_cleanups
= NULL_TREE
;
4477 body
= TREE_OPERAND (*expr_p
, 0);
4478 gimplify_to_stmt_list (&body
);
4480 gimplify_ctxp
->conditions
= old_conds
;
4481 gimplify_ctxp
->conditional_cleanups
= old_cleanups
;
4483 for (iter
= tsi_start (body
); !tsi_end_p (iter
); )
4485 tree
*wce_p
= tsi_stmt_ptr (iter
);
4488 if (TREE_CODE (wce
) == WITH_CLEANUP_EXPR
)
4490 if (tsi_one_before_end_p (iter
))
4492 tsi_link_before (&iter
, TREE_OPERAND (wce
, 0), TSI_SAME_STMT
);
4499 enum tree_code code
;
4501 if (CLEANUP_EH_ONLY (wce
))
4502 code
= TRY_CATCH_EXPR
;
4504 code
= TRY_FINALLY_EXPR
;
4506 sl
= tsi_split_statement_list_after (&iter
);
4507 tfe
= build2 (code
, void_type_node
, sl
, NULL_TREE
);
4508 append_to_statement_list (TREE_OPERAND (wce
, 0),
4509 &TREE_OPERAND (tfe
, 1));
4511 iter
= tsi_start (sl
);
4521 append_to_statement_list (body
, pre_p
);
4531 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
4532 is the cleanup action required. */
4535 gimple_push_cleanup (tree var
, tree cleanup
, bool eh_only
, tree
*pre_p
)
4539 /* Errors can result in improperly nested cleanups. Which results in
4540 confusion when trying to resolve the WITH_CLEANUP_EXPR. */
4541 if (errorcount
|| sorrycount
)
4544 if (gimple_conditional_context ())
4546 /* If we're in a conditional context, this is more complex. We only
4547 want to run the cleanup if we actually ran the initialization that
4548 necessitates it, but we want to run it after the end of the
4549 conditional context. So we wrap the try/finally around the
4550 condition and use a flag to determine whether or not to actually
4551 run the destructor. Thus
4555 becomes (approximately)
4559 if (test) { A::A(temp); flag = 1; val = f(temp); }
4562 if (flag) A::~A(temp);
4567 tree flag
= create_tmp_var (boolean_type_node
, "cleanup");
4568 tree ffalse
= build_gimple_modify_stmt (flag
, boolean_false_node
);
4569 tree ftrue
= build_gimple_modify_stmt (flag
, boolean_true_node
);
4570 cleanup
= build3 (COND_EXPR
, void_type_node
, flag
, cleanup
, NULL
);
4571 wce
= build1 (WITH_CLEANUP_EXPR
, void_type_node
, cleanup
);
4572 append_to_statement_list (ffalse
, &gimplify_ctxp
->conditional_cleanups
);
4573 append_to_statement_list (wce
, &gimplify_ctxp
->conditional_cleanups
);
4574 append_to_statement_list (ftrue
, pre_p
);
4576 /* Because of this manipulation, and the EH edges that jump
4577 threading cannot redirect, the temporary (VAR) will appear
4578 to be used uninitialized. Don't warn. */
4579 TREE_NO_WARNING (var
) = 1;
4583 wce
= build1 (WITH_CLEANUP_EXPR
, void_type_node
, cleanup
);
4584 CLEANUP_EH_ONLY (wce
) = eh_only
;
4585 append_to_statement_list (wce
, pre_p
);
4588 gimplify_stmt (&TREE_OPERAND (wce
, 0));
4591 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
4593 static enum gimplify_status
4594 gimplify_target_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
4596 tree targ
= *expr_p
;
4597 tree temp
= TARGET_EXPR_SLOT (targ
);
4598 tree init
= TARGET_EXPR_INITIAL (targ
);
4599 enum gimplify_status ret
;
4603 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
4604 to the temps list. Handle also variable length TARGET_EXPRs. */
4605 if (TREE_CODE (DECL_SIZE (temp
)) != INTEGER_CST
)
4607 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (temp
)))
4608 gimplify_type_sizes (TREE_TYPE (temp
), pre_p
);
4609 gimplify_vla_decl (temp
, pre_p
);
4612 gimple_add_tmp_var (temp
);
4614 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
4615 expression is supposed to initialize the slot. */
4616 if (VOID_TYPE_P (TREE_TYPE (init
)))
4617 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
, fb_none
);
4620 init
= build2 (INIT_EXPR
, void_type_node
, temp
, init
);
4621 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
,
4624 if (ret
== GS_ERROR
)
4626 /* PR c++/28266 Make sure this is expanded only once. */
4627 TARGET_EXPR_INITIAL (targ
) = NULL_TREE
;
4630 append_to_statement_list (init
, pre_p
);
4632 /* If needed, push the cleanup for the temp. */
4633 if (TARGET_EXPR_CLEANUP (targ
))
4635 gimplify_stmt (&TARGET_EXPR_CLEANUP (targ
));
4636 gimple_push_cleanup (temp
, TARGET_EXPR_CLEANUP (targ
),
4637 CLEANUP_EH_ONLY (targ
), pre_p
);
4640 /* Only expand this once. */
4641 TREE_OPERAND (targ
, 3) = init
;
4642 TARGET_EXPR_INITIAL (targ
) = NULL_TREE
;
4645 /* We should have expanded this before. */
4646 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp
));
4652 /* Gimplification of expression trees. */
4654 /* Gimplify an expression which appears at statement context; usually, this
4655 means replacing it with a suitably gimple STATEMENT_LIST. */
4658 gimplify_stmt (tree
*stmt_p
)
4660 gimplify_expr (stmt_p
, NULL
, NULL
, is_gimple_stmt
, fb_none
);
4663 /* Similarly, but force the result to be a STATEMENT_LIST. */
4666 gimplify_to_stmt_list (tree
*stmt_p
)
4668 gimplify_stmt (stmt_p
);
4670 *stmt_p
= alloc_stmt_list ();
4671 else if (TREE_CODE (*stmt_p
) != STATEMENT_LIST
)
4674 *stmt_p
= alloc_stmt_list ();
4675 append_to_statement_list (t
, stmt_p
);
4680 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
4681 to CTX. If entries already exist, force them to be some flavor of private.
4682 If there is no enclosing parallel, do nothing. */
4685 omp_firstprivatize_variable (struct gimplify_omp_ctx
*ctx
, tree decl
)
4689 if (decl
== NULL
|| !DECL_P (decl
))
4694 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
4697 if (n
->value
& GOVD_SHARED
)
4698 n
->value
= GOVD_FIRSTPRIVATE
| (n
->value
& GOVD_SEEN
);
4702 else if (ctx
->is_parallel
)
4703 omp_add_variable (ctx
, decl
, GOVD_FIRSTPRIVATE
);
4705 ctx
= ctx
->outer_context
;
4710 /* Similarly for each of the type sizes of TYPE. */
4713 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx
*ctx
, tree type
)
4715 if (type
== NULL
|| type
== error_mark_node
)
4717 type
= TYPE_MAIN_VARIANT (type
);
4719 if (pointer_set_insert (ctx
->privatized_types
, type
))
4722 switch (TREE_CODE (type
))
4728 case FIXED_POINT_TYPE
:
4729 omp_firstprivatize_variable (ctx
, TYPE_MIN_VALUE (type
));
4730 omp_firstprivatize_variable (ctx
, TYPE_MAX_VALUE (type
));
4734 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
4735 omp_firstprivatize_type_sizes (ctx
, TYPE_DOMAIN (type
));
4740 case QUAL_UNION_TYPE
:
4743 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
4744 if (TREE_CODE (field
) == FIELD_DECL
)
4746 omp_firstprivatize_variable (ctx
, DECL_FIELD_OFFSET (field
));
4747 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (field
));
4753 case REFERENCE_TYPE
:
4754 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
4761 omp_firstprivatize_variable (ctx
, TYPE_SIZE (type
));
4762 omp_firstprivatize_variable (ctx
, TYPE_SIZE_UNIT (type
));
4763 lang_hooks
.types
.omp_firstprivatize_type_sizes (ctx
, type
);
4766 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
4769 omp_add_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, unsigned int flags
)
4772 unsigned int nflags
;
4775 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
4778 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
4779 there are constructors involved somewhere. */
4780 if (TREE_ADDRESSABLE (TREE_TYPE (decl
))
4781 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
4784 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
4787 /* We shouldn't be re-adding the decl with the same data
4789 gcc_assert ((n
->value
& GOVD_DATA_SHARE_CLASS
& flags
) == 0);
4790 /* The only combination of data sharing classes we should see is
4791 FIRSTPRIVATE and LASTPRIVATE. */
4792 nflags
= n
->value
| flags
;
4793 gcc_assert ((nflags
& GOVD_DATA_SHARE_CLASS
)
4794 == (GOVD_FIRSTPRIVATE
| GOVD_LASTPRIVATE
));
4799 /* When adding a variable-sized variable, we have to handle all sorts
4800 of additional bits of data: the pointer replacement variable, and
4801 the parameters of the type. */
4802 if (DECL_SIZE (decl
) && TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
4804 /* Add the pointer replacement variable as PRIVATE if the variable
4805 replacement is private, else FIRSTPRIVATE since we'll need the
4806 address of the original variable either for SHARED, or for the
4807 copy into or out of the context. */
4808 if (!(flags
& GOVD_LOCAL
))
4810 nflags
= flags
& GOVD_PRIVATE
? GOVD_PRIVATE
: GOVD_FIRSTPRIVATE
;
4811 nflags
|= flags
& GOVD_SEEN
;
4812 t
= DECL_VALUE_EXPR (decl
);
4813 gcc_assert (TREE_CODE (t
) == INDIRECT_REF
);
4814 t
= TREE_OPERAND (t
, 0);
4815 gcc_assert (DECL_P (t
));
4816 omp_add_variable (ctx
, t
, nflags
);
4819 /* Add all of the variable and type parameters (which should have
4820 been gimplified to a formal temporary) as FIRSTPRIVATE. */
4821 omp_firstprivatize_variable (ctx
, DECL_SIZE_UNIT (decl
));
4822 omp_firstprivatize_variable (ctx
, DECL_SIZE (decl
));
4823 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
4825 /* The variable-sized variable itself is never SHARED, only some form
4826 of PRIVATE. The sharing would take place via the pointer variable
4827 which we remapped above. */
4828 if (flags
& GOVD_SHARED
)
4829 flags
= GOVD_PRIVATE
| GOVD_DEBUG_PRIVATE
4830 | (flags
& (GOVD_SEEN
| GOVD_EXPLICIT
));
4832 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
4833 alloca statement we generate for the variable, so make sure it
4834 is available. This isn't automatically needed for the SHARED
4835 case, since we won't be allocating local storage then.
4836 For local variables TYPE_SIZE_UNIT might not be gimplified yet,
4837 in this case omp_notice_variable will be called later
4838 on when it is gimplified. */
4839 else if (! (flags
& GOVD_LOCAL
))
4840 omp_notice_variable (ctx
, TYPE_SIZE_UNIT (TREE_TYPE (decl
)), true);
4842 else if (lang_hooks
.decls
.omp_privatize_by_reference (decl
))
4844 gcc_assert ((flags
& GOVD_LOCAL
) == 0);
4845 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
4847 /* Similar to the direct variable sized case above, we'll need the
4848 size of references being privatized. */
4849 if ((flags
& GOVD_SHARED
) == 0)
4851 t
= TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl
)));
4852 if (TREE_CODE (t
) != INTEGER_CST
)
4853 omp_notice_variable (ctx
, t
, true);
4857 splay_tree_insert (ctx
->variables
, (splay_tree_key
)decl
, flags
);
4860 /* Record the fact that DECL was used within the OpenMP context CTX.
4861 IN_CODE is true when real code uses DECL, and false when we should
4862 merely emit default(none) errors. Return true if DECL is going to
4863 be remapped and thus DECL shouldn't be gimplified into its
4864 DECL_VALUE_EXPR (if any). */
4867 omp_notice_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, bool in_code
)
4870 unsigned flags
= in_code
? GOVD_SEEN
: 0;
4871 bool ret
= false, shared
;
4873 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
4876 /* Threadprivate variables are predetermined. */
4877 if (is_global_var (decl
))
4879 if (DECL_THREAD_LOCAL_P (decl
))
4882 if (DECL_HAS_VALUE_EXPR_P (decl
))
4884 tree value
= get_base_address (DECL_VALUE_EXPR (decl
));
4886 if (value
&& DECL_P (value
) && DECL_THREAD_LOCAL_P (value
))
4891 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
4894 enum omp_clause_default_kind default_kind
, kind
;
4896 if (!ctx
->is_parallel
)
4899 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
4900 remapped firstprivate instead of shared. To some extent this is
4901 addressed in omp_firstprivatize_type_sizes, but not effectively. */
4902 default_kind
= ctx
->default_kind
;
4903 kind
= lang_hooks
.decls
.omp_predetermined_sharing (decl
);
4904 if (kind
!= OMP_CLAUSE_DEFAULT_UNSPECIFIED
)
4905 default_kind
= kind
;
4907 switch (default_kind
)
4909 case OMP_CLAUSE_DEFAULT_NONE
:
4910 error ("%qs not specified in enclosing parallel",
4911 IDENTIFIER_POINTER (DECL_NAME (decl
)));
4912 error ("%Henclosing parallel", &ctx
->location
);
4914 case OMP_CLAUSE_DEFAULT_SHARED
:
4915 flags
|= GOVD_SHARED
;
4917 case OMP_CLAUSE_DEFAULT_PRIVATE
:
4918 flags
|= GOVD_PRIVATE
;
4924 omp_add_variable (ctx
, decl
, flags
);
4926 shared
= (flags
& GOVD_SHARED
) != 0;
4927 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
4931 shared
= ((flags
| n
->value
) & GOVD_SHARED
) != 0;
4932 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
4934 /* If nothing changed, there's nothing left to do. */
4935 if ((n
->value
& flags
) == flags
)
4941 /* If the variable is private in the current context, then we don't
4942 need to propagate anything to an outer context. */
4943 if (flags
& GOVD_PRIVATE
)
4945 if (ctx
->outer_context
4946 && omp_notice_variable (ctx
->outer_context
, decl
, in_code
))
4951 /* Verify that DECL is private within CTX. If there's specific information
4952 to the contrary in the innermost scope, generate an error. */
4955 omp_is_private (struct gimplify_omp_ctx
*ctx
, tree decl
)
4959 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
4962 if (n
->value
& GOVD_SHARED
)
4964 if (ctx
== gimplify_omp_ctxp
)
4966 error ("iteration variable %qs should be private",
4967 IDENTIFIER_POINTER (DECL_NAME (decl
)));
4968 n
->value
= GOVD_PRIVATE
;
4974 else if ((n
->value
& GOVD_EXPLICIT
) != 0
4975 && (ctx
== gimplify_omp_ctxp
4976 || (ctx
->is_combined_parallel
4977 && gimplify_omp_ctxp
->outer_context
== ctx
)))
4979 if ((n
->value
& GOVD_FIRSTPRIVATE
) != 0)
4980 error ("iteration variable %qs should not be firstprivate",
4981 IDENTIFIER_POINTER (DECL_NAME (decl
)));
4982 else if ((n
->value
& GOVD_REDUCTION
) != 0)
4983 error ("iteration variable %qs should not be reduction",
4984 IDENTIFIER_POINTER (DECL_NAME (decl
)));
4989 if (ctx
->is_parallel
)
4991 else if (ctx
->outer_context
)
4992 return omp_is_private (ctx
->outer_context
, decl
);
4994 return !is_global_var (decl
);
4997 /* Return true if DECL is private within a parallel region
4998 that binds to the current construct's context or in parallel
4999 region's REDUCTION clause. */
5002 omp_check_private (struct gimplify_omp_ctx
*ctx
, tree decl
)
5008 ctx
= ctx
->outer_context
;
5010 return !(is_global_var (decl
)
5011 /* References might be private, but might be shared too. */
5012 || lang_hooks
.decls
.omp_privatize_by_reference (decl
));
5014 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
5016 return (n
->value
& GOVD_SHARED
) == 0;
5018 while (!ctx
->is_parallel
);
5022 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
5023 and previous omp contexts. */
5026 gimplify_scan_omp_clauses (tree
*list_p
, tree
*pre_p
, bool in_parallel
,
5027 bool in_combined_parallel
)
5029 struct gimplify_omp_ctx
*ctx
, *outer_ctx
;
5032 ctx
= new_omp_context (in_parallel
, in_combined_parallel
);
5033 outer_ctx
= ctx
->outer_context
;
5035 while ((c
= *list_p
) != NULL
)
5037 enum gimplify_status gs
;
5038 bool remove
= false;
5039 bool notice_outer
= true;
5040 const char *check_non_private
= NULL
;
5044 switch (OMP_CLAUSE_CODE (c
))
5046 case OMP_CLAUSE_PRIVATE
:
5047 flags
= GOVD_PRIVATE
| GOVD_EXPLICIT
;
5048 notice_outer
= false;
5050 case OMP_CLAUSE_SHARED
:
5051 flags
= GOVD_SHARED
| GOVD_EXPLICIT
;
5053 case OMP_CLAUSE_FIRSTPRIVATE
:
5054 flags
= GOVD_FIRSTPRIVATE
| GOVD_EXPLICIT
;
5055 check_non_private
= "firstprivate";
5057 case OMP_CLAUSE_LASTPRIVATE
:
5058 flags
= GOVD_LASTPRIVATE
| GOVD_SEEN
| GOVD_EXPLICIT
;
5059 check_non_private
= "lastprivate";
5061 case OMP_CLAUSE_REDUCTION
:
5062 flags
= GOVD_REDUCTION
| GOVD_SEEN
| GOVD_EXPLICIT
;
5063 check_non_private
= "reduction";
5067 decl
= OMP_CLAUSE_DECL (c
);
5068 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
5073 omp_add_variable (ctx
, decl
, flags
);
5074 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
5075 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
))
5077 omp_add_variable (ctx
, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
),
5078 GOVD_LOCAL
| GOVD_SEEN
);
5079 gimplify_omp_ctxp
= ctx
;
5080 push_gimplify_context ();
5081 gimplify_stmt (&OMP_CLAUSE_REDUCTION_INIT (c
));
5082 pop_gimplify_context (OMP_CLAUSE_REDUCTION_INIT (c
));
5083 push_gimplify_context ();
5084 gimplify_stmt (&OMP_CLAUSE_REDUCTION_MERGE (c
));
5085 pop_gimplify_context (OMP_CLAUSE_REDUCTION_MERGE (c
));
5086 gimplify_omp_ctxp
= outer_ctx
;
5092 case OMP_CLAUSE_COPYIN
:
5093 case OMP_CLAUSE_COPYPRIVATE
:
5094 decl
= OMP_CLAUSE_DECL (c
);
5095 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
5102 omp_notice_variable (outer_ctx
, decl
, true);
5103 if (check_non_private
5105 && omp_check_private (ctx
, decl
))
5107 error ("%s variable %qs is private in outer context",
5108 check_non_private
, IDENTIFIER_POINTER (DECL_NAME (decl
)));
5114 OMP_CLAUSE_OPERAND (c
, 0)
5115 = gimple_boolify (OMP_CLAUSE_OPERAND (c
, 0));
5118 case OMP_CLAUSE_SCHEDULE
:
5119 case OMP_CLAUSE_NUM_THREADS
:
5120 gs
= gimplify_expr (&OMP_CLAUSE_OPERAND (c
, 0), pre_p
, NULL
,
5121 is_gimple_val
, fb_rvalue
);
5126 case OMP_CLAUSE_NOWAIT
:
5127 case OMP_CLAUSE_ORDERED
:
5130 case OMP_CLAUSE_DEFAULT
:
5131 ctx
->default_kind
= OMP_CLAUSE_DEFAULT_KIND (c
);
5139 *list_p
= OMP_CLAUSE_CHAIN (c
);
5141 list_p
= &OMP_CLAUSE_CHAIN (c
);
5144 gimplify_omp_ctxp
= ctx
;
5147 /* For all variables that were not actually used within the context,
5148 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
5151 gimplify_adjust_omp_clauses_1 (splay_tree_node n
, void *data
)
5153 tree
*list_p
= (tree
*) data
;
5154 tree decl
= (tree
) n
->key
;
5155 unsigned flags
= n
->value
;
5156 enum omp_clause_code code
;
5160 if (flags
& (GOVD_EXPLICIT
| GOVD_LOCAL
))
5162 if ((flags
& GOVD_SEEN
) == 0)
5164 if (flags
& GOVD_DEBUG_PRIVATE
)
5166 gcc_assert ((flags
& GOVD_DATA_SHARE_CLASS
) == GOVD_PRIVATE
);
5167 private_debug
= true;
5171 = lang_hooks
.decls
.omp_private_debug_clause (decl
,
5172 !!(flags
& GOVD_SHARED
));
5174 code
= OMP_CLAUSE_PRIVATE
;
5175 else if (flags
& GOVD_SHARED
)
5177 if (is_global_var (decl
))
5179 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
->outer_context
;
5183 = splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
5184 if (on
&& (on
->value
& (GOVD_FIRSTPRIVATE
| GOVD_LASTPRIVATE
5185 | GOVD_PRIVATE
| GOVD_REDUCTION
)) != 0)
5187 ctx
= ctx
->outer_context
;
5192 code
= OMP_CLAUSE_SHARED
;
5194 else if (flags
& GOVD_PRIVATE
)
5195 code
= OMP_CLAUSE_PRIVATE
;
5196 else if (flags
& GOVD_FIRSTPRIVATE
)
5197 code
= OMP_CLAUSE_FIRSTPRIVATE
;
5201 clause
= build_omp_clause (code
);
5202 OMP_CLAUSE_DECL (clause
) = decl
;
5203 OMP_CLAUSE_CHAIN (clause
) = *list_p
;
5205 OMP_CLAUSE_PRIVATE_DEBUG (clause
) = 1;
5212 gimplify_adjust_omp_clauses (tree
*list_p
)
5214 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
5217 while ((c
= *list_p
) != NULL
)
5220 bool remove
= false;
5222 switch (OMP_CLAUSE_CODE (c
))
5224 case OMP_CLAUSE_PRIVATE
:
5225 case OMP_CLAUSE_SHARED
:
5226 case OMP_CLAUSE_FIRSTPRIVATE
:
5227 decl
= OMP_CLAUSE_DECL (c
);
5228 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
5229 remove
= !(n
->value
& GOVD_SEEN
);
5232 bool shared
= OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_SHARED
;
5233 if ((n
->value
& GOVD_DEBUG_PRIVATE
)
5234 || lang_hooks
.decls
.omp_private_debug_clause (decl
, shared
))
5236 gcc_assert ((n
->value
& GOVD_DEBUG_PRIVATE
) == 0
5237 || ((n
->value
& GOVD_DATA_SHARE_CLASS
)
5239 OMP_CLAUSE_SET_CODE (c
, OMP_CLAUSE_PRIVATE
);
5240 OMP_CLAUSE_PRIVATE_DEBUG (c
) = 1;
5245 case OMP_CLAUSE_LASTPRIVATE
:
5246 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
5247 accurately reflect the presence of a FIRSTPRIVATE clause. */
5248 decl
= OMP_CLAUSE_DECL (c
);
5249 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
5250 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c
)
5251 = (n
->value
& GOVD_FIRSTPRIVATE
) != 0;
5254 case OMP_CLAUSE_REDUCTION
:
5255 case OMP_CLAUSE_COPYIN
:
5256 case OMP_CLAUSE_COPYPRIVATE
:
5258 case OMP_CLAUSE_NUM_THREADS
:
5259 case OMP_CLAUSE_SCHEDULE
:
5260 case OMP_CLAUSE_NOWAIT
:
5261 case OMP_CLAUSE_ORDERED
:
5262 case OMP_CLAUSE_DEFAULT
:
5270 *list_p
= OMP_CLAUSE_CHAIN (c
);
5272 list_p
= &OMP_CLAUSE_CHAIN (c
);
5275 /* Add in any implicit data sharing. */
5276 splay_tree_foreach (ctx
->variables
, gimplify_adjust_omp_clauses_1
, list_p
);
5278 gimplify_omp_ctxp
= ctx
->outer_context
;
5279 delete_omp_context (ctx
);
5282 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
5283 gimplification of the body, as well as scanning the body for used
5284 variables. We need to do this scan now, because variable-sized
5285 decls will be decomposed during gimplification. */
5287 static enum gimplify_status
5288 gimplify_omp_parallel (tree
*expr_p
, tree
*pre_p
)
5290 tree expr
= *expr_p
;
5292 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
), pre_p
, true,
5293 OMP_PARALLEL_COMBINED (expr
));
5295 push_gimplify_context ();
5297 gimplify_stmt (&OMP_PARALLEL_BODY (expr
));
5299 if (TREE_CODE (OMP_PARALLEL_BODY (expr
)) == BIND_EXPR
)
5300 pop_gimplify_context (OMP_PARALLEL_BODY (expr
));
5302 pop_gimplify_context (NULL_TREE
);
5304 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
));
5309 /* Gimplify the gross structure of an OMP_FOR statement. */
5311 static enum gimplify_status
5312 gimplify_omp_for (tree
*expr_p
, tree
*pre_p
)
5314 tree for_stmt
, decl
, var
, t
;
5315 enum gimplify_status ret
= GS_OK
;
5316 tree body
, init_decl
= NULL_TREE
;
5320 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
), pre_p
, false, false);
5322 t
= OMP_FOR_INIT (for_stmt
);
5323 gcc_assert (TREE_CODE (t
) == MODIFY_EXPR
5324 || TREE_CODE (t
) == GIMPLE_MODIFY_STMT
);
5325 decl
= GENERIC_TREE_OPERAND (t
, 0);
5326 gcc_assert (DECL_P (decl
));
5327 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl
)));
5329 /* Make sure the iteration variable is private. */
5330 if (omp_is_private (gimplify_omp_ctxp
, decl
))
5331 omp_notice_variable (gimplify_omp_ctxp
, decl
, true);
5333 omp_add_variable (gimplify_omp_ctxp
, decl
, GOVD_PRIVATE
| GOVD_SEEN
);
5335 /* If DECL is not a gimple register, create a temporary variable to act as an
5336 iteration counter. This is valid, since DECL cannot be modified in the
5337 body of the loop. */
5338 if (!is_gimple_reg (decl
))
5340 var
= create_tmp_var (TREE_TYPE (decl
), get_name (decl
));
5341 GENERIC_TREE_OPERAND (t
, 0) = var
;
5343 init_decl
= build_gimple_modify_stmt (decl
, var
);
5344 omp_add_variable (gimplify_omp_ctxp
, var
, GOVD_PRIVATE
| GOVD_SEEN
);
5349 /* If OMP_FOR is re-gimplified, ensure all variables in pre-body
5351 gimplify_stmt (&OMP_FOR_PRE_BODY (for_stmt
));
5353 ret
|= gimplify_expr (&GENERIC_TREE_OPERAND (t
, 1),
5354 &OMP_FOR_PRE_BODY (for_stmt
),
5355 NULL
, is_gimple_val
, fb_rvalue
);
5357 tree_to_gimple_tuple (&OMP_FOR_INIT (for_stmt
));
5359 t
= OMP_FOR_COND (for_stmt
);
5360 gcc_assert (COMPARISON_CLASS_P (t
));
5361 gcc_assert (GENERIC_TREE_OPERAND (t
, 0) == decl
);
5362 TREE_OPERAND (t
, 0) = var
;
5364 ret
|= gimplify_expr (&GENERIC_TREE_OPERAND (t
, 1),
5365 &OMP_FOR_PRE_BODY (for_stmt
),
5366 NULL
, is_gimple_val
, fb_rvalue
);
5368 tree_to_gimple_tuple (&OMP_FOR_INCR (for_stmt
));
5369 t
= OMP_FOR_INCR (for_stmt
);
5370 switch (TREE_CODE (t
))
5372 case PREINCREMENT_EXPR
:
5373 case POSTINCREMENT_EXPR
:
5374 t
= build_int_cst (TREE_TYPE (decl
), 1);
5375 t
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), var
, t
);
5376 t
= build_gimple_modify_stmt (var
, t
);
5377 OMP_FOR_INCR (for_stmt
) = t
;
5380 case PREDECREMENT_EXPR
:
5381 case POSTDECREMENT_EXPR
:
5382 t
= build_int_cst (TREE_TYPE (decl
), -1);
5383 t
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), var
, t
);
5384 t
= build_gimple_modify_stmt (var
, t
);
5385 OMP_FOR_INCR (for_stmt
) = t
;
5388 case GIMPLE_MODIFY_STMT
:
5389 gcc_assert (GIMPLE_STMT_OPERAND (t
, 0) == decl
);
5390 GIMPLE_STMT_OPERAND (t
, 0) = var
;
5392 t
= GIMPLE_STMT_OPERAND (t
, 1);
5393 switch (TREE_CODE (t
))
5396 if (TREE_OPERAND (t
, 1) == decl
)
5398 TREE_OPERAND (t
, 1) = TREE_OPERAND (t
, 0);
5399 TREE_OPERAND (t
, 0) = var
;
5405 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
5406 TREE_OPERAND (t
, 0) = var
;
5412 ret
|= gimplify_expr (&TREE_OPERAND (t
, 1), &OMP_FOR_PRE_BODY (for_stmt
),
5413 NULL
, is_gimple_val
, fb_rvalue
);
5420 body
= OMP_FOR_BODY (for_stmt
);
5421 gimplify_to_stmt_list (&body
);
5422 t
= alloc_stmt_list ();
5424 append_to_statement_list (init_decl
, &t
);
5425 append_to_statement_list (body
, &t
);
5426 OMP_FOR_BODY (for_stmt
) = t
;
5427 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
));
5429 return ret
== GS_ALL_DONE
? GS_ALL_DONE
: GS_ERROR
;
5432 /* Gimplify the gross structure of other OpenMP worksharing constructs.
5433 In particular, OMP_SECTIONS and OMP_SINGLE. */
5435 static enum gimplify_status
5436 gimplify_omp_workshare (tree
*expr_p
, tree
*pre_p
)
5438 tree stmt
= *expr_p
;
5440 gimplify_scan_omp_clauses (&OMP_CLAUSES (stmt
), pre_p
, false, false);
5441 gimplify_to_stmt_list (&OMP_BODY (stmt
));
5442 gimplify_adjust_omp_clauses (&OMP_CLAUSES (stmt
));
5447 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
5448 stabilized the lhs of the atomic operation as *ADDR. Return true if
5449 EXPR is this stabilized form. */
5452 goa_lhs_expr_p (tree expr
, tree addr
)
5454 /* Also include casts to other type variants. The C front end is fond
5455 of adding these for e.g. volatile variables. This is like
5456 STRIP_TYPE_NOPS but includes the main variant lookup. */
5457 while ((TREE_CODE (expr
) == NOP_EXPR
5458 || TREE_CODE (expr
) == CONVERT_EXPR
5459 || TREE_CODE (expr
) == NON_LVALUE_EXPR
)
5460 && TREE_OPERAND (expr
, 0) != error_mark_node
5461 && (TYPE_MAIN_VARIANT (TREE_TYPE (expr
))
5462 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (expr
, 0)))))
5463 expr
= TREE_OPERAND (expr
, 0);
5465 if (TREE_CODE (expr
) == INDIRECT_REF
)
5467 expr
= TREE_OPERAND (expr
, 0);
5469 && (TREE_CODE (expr
) == NOP_EXPR
5470 || TREE_CODE (expr
) == CONVERT_EXPR
5471 || TREE_CODE (expr
) == NON_LVALUE_EXPR
)
5472 && TREE_CODE (expr
) == TREE_CODE (addr
)
5473 && TYPE_MAIN_VARIANT (TREE_TYPE (expr
))
5474 == TYPE_MAIN_VARIANT (TREE_TYPE (addr
)))
5476 expr
= TREE_OPERAND (expr
, 0);
5477 addr
= TREE_OPERAND (addr
, 0);
5481 return (TREE_CODE (addr
) == ADDR_EXPR
5482 && TREE_CODE (expr
) == ADDR_EXPR
5483 && TREE_OPERAND (addr
, 0) == TREE_OPERAND (expr
, 0));
5485 if (TREE_CODE (addr
) == ADDR_EXPR
&& expr
== TREE_OPERAND (addr
, 0))
5490 /* Walk *EXPR_P and replace
5491 appearances of *LHS_ADDR with LHS_VAR. If an expression does not involve
5492 the lhs, evaluate it into a temporary. Return 1 if the lhs appeared as
5493 a subexpression, 0 if it did not, or -1 if an error was encountered. */
5496 goa_stabilize_expr (tree
*expr_p
, tree
*pre_p
, tree lhs_addr
, tree lhs_var
)
5498 tree expr
= *expr_p
;
5501 if (goa_lhs_expr_p (expr
, lhs_addr
))
5506 if (is_gimple_val (expr
))
5510 switch (TREE_CODE_CLASS (TREE_CODE (expr
)))
5513 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 1), pre_p
,
5516 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 0), pre_p
,
5525 enum gimplify_status gs
;
5526 gs
= gimplify_expr (expr_p
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
);
5527 if (gs
!= GS_ALL_DONE
)
5534 /* Gimplify an OMP_ATOMIC statement. */
5536 static enum gimplify_status
5537 gimplify_omp_atomic (tree
*expr_p
, tree
*pre_p
)
5539 tree addr
= TREE_OPERAND (*expr_p
, 0);
5540 tree rhs
= TREE_OPERAND (*expr_p
, 1);
5541 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr
)));
5542 tree tmp_load
, load
, store
;
5544 tmp_load
= create_tmp_var (type
, NULL
);
5545 if (goa_stabilize_expr (&rhs
, pre_p
, addr
, tmp_load
) < 0)
5548 if (gimplify_expr (&addr
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
)
5552 load
= build2 (OMP_ATOMIC_LOAD
, void_type_node
, tmp_load
, addr
);
5553 append_to_statement_list (load
, pre_p
);
5554 if (gimplify_expr (&rhs
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
)
5557 store
= build1 (OMP_ATOMIC_STORE
, void_type_node
, rhs
);
5564 /* Gimplifies the expression tree pointed to by EXPR_P. Return 0 if
5565 gimplification failed.
5567 PRE_P points to the list where side effects that must happen before
5568 EXPR should be stored.
5570 POST_P points to the list where side effects that must happen after
5571 EXPR should be stored, or NULL if there is no suitable list. In
5572 that case, we copy the result to a temporary, emit the
5573 post-effects, and then return the temporary.
5575 GIMPLE_TEST_F points to a function that takes a tree T and
5576 returns nonzero if T is in the GIMPLE form requested by the
5577 caller. The GIMPLE predicates are in tree-gimple.c.
5579 This test is used twice. Before gimplification, the test is
5580 invoked to determine whether *EXPR_P is already gimple enough. If
5581 that fails, *EXPR_P is gimplified according to its code and
5582 GIMPLE_TEST_F is called again. If the test still fails, then a new
5583 temporary variable is created and assigned the value of the
5584 gimplified expression.
5586 FALLBACK tells the function what sort of a temporary we want. If the 1
5587 bit is set, an rvalue is OK. If the 2 bit is set, an lvalue is OK.
5588 If both are set, either is OK, but an lvalue is preferable.
5590 The return value is either GS_ERROR or GS_ALL_DONE, since this function
5591 iterates until solution. */
5593 enum gimplify_status
5594 gimplify_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
,
5595 bool (* gimple_test_f
) (tree
), fallback_t fallback
)
5598 tree internal_pre
= NULL_TREE
;
5599 tree internal_post
= NULL_TREE
;
5601 int is_statement
= (pre_p
== NULL
);
5602 location_t saved_location
;
5603 enum gimplify_status ret
;
5605 save_expr
= *expr_p
;
5606 if (save_expr
== NULL_TREE
)
5609 /* We used to check the predicate here and return immediately if it
5610 succeeds. This is wrong; the design is for gimplification to be
5611 idempotent, and for the predicates to only test for valid forms, not
5612 whether they are fully simplified. */
5614 /* Set up our internal queues if needed. */
5616 pre_p
= &internal_pre
;
5618 post_p
= &internal_post
;
5620 saved_location
= input_location
;
5621 if (save_expr
!= error_mark_node
5622 && EXPR_HAS_LOCATION (*expr_p
))
5623 input_location
= EXPR_LOCATION (*expr_p
);
5625 /* Loop over the specific gimplifiers until the toplevel node
5626 remains the same. */
5629 /* Strip away as many useless type conversions as possible
5631 STRIP_USELESS_TYPE_CONVERSION (*expr_p
);
5633 /* Remember the expr. */
5634 save_expr
= *expr_p
;
5636 /* Die, die, die, my darling. */
5637 if (save_expr
== error_mark_node
5638 || (!GIMPLE_STMT_P (save_expr
)
5639 && TREE_TYPE (save_expr
)
5640 && TREE_TYPE (save_expr
) == error_mark_node
))
5646 /* Do any language-specific gimplification. */
5647 ret
= lang_hooks
.gimplify_expr (expr_p
, pre_p
, post_p
);
5650 if (*expr_p
== NULL_TREE
)
5652 if (*expr_p
!= save_expr
)
5655 else if (ret
!= GS_UNHANDLED
)
5659 switch (TREE_CODE (*expr_p
))
5661 /* First deal with the special cases. */
5663 case POSTINCREMENT_EXPR
:
5664 case POSTDECREMENT_EXPR
:
5665 case PREINCREMENT_EXPR
:
5666 case PREDECREMENT_EXPR
:
5667 ret
= gimplify_self_mod_expr (expr_p
, pre_p
, post_p
,
5668 fallback
!= fb_none
);
5672 case ARRAY_RANGE_REF
:
5676 case VIEW_CONVERT_EXPR
:
5677 ret
= gimplify_compound_lval (expr_p
, pre_p
, post_p
,
5678 fallback
? fallback
: fb_rvalue
);
5682 ret
= gimplify_cond_expr (expr_p
, pre_p
, fallback
);
5683 /* C99 code may assign to an array in a structure value of a
5684 conditional expression, and this has undefined behavior
5685 only on execution, so create a temporary if an lvalue is
5687 if (fallback
== fb_lvalue
)
5689 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
5690 mark_addressable (*expr_p
);
5695 ret
= gimplify_call_expr (expr_p
, pre_p
, fallback
!= fb_none
);
5696 /* C99 code may assign to an array in a structure returned
5697 from a function, and this has undefined behavior only on
5698 execution, so create a temporary if an lvalue is
5700 if (fallback
== fb_lvalue
)
5702 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
5703 mark_addressable (*expr_p
);
5711 ret
= gimplify_compound_expr (expr_p
, pre_p
, fallback
!= fb_none
);
5715 case GIMPLE_MODIFY_STMT
:
5717 ret
= gimplify_modify_expr (expr_p
, pre_p
, post_p
,
5718 fallback
!= fb_none
);
5722 /* The distinction between MODIFY_EXPR and INIT_EXPR is no longer
5724 if (TREE_CODE (*expr_p
) == INIT_EXPR
)
5725 TREE_SET_CODE (*expr_p
, MODIFY_EXPR
);
5727 /* Convert MODIFY_EXPR to GIMPLE_MODIFY_STMT. */
5728 if (TREE_CODE (*expr_p
) == MODIFY_EXPR
)
5729 tree_to_gimple_tuple (expr_p
);
5734 case TRUTH_ANDIF_EXPR
:
5735 case TRUTH_ORIF_EXPR
:
5736 ret
= gimplify_boolean_expr (expr_p
);
5739 case TRUTH_NOT_EXPR
:
5740 TREE_OPERAND (*expr_p
, 0)
5741 = gimple_boolify (TREE_OPERAND (*expr_p
, 0));
5742 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5743 is_gimple_val
, fb_rvalue
);
5744 recalculate_side_effects (*expr_p
);
5748 ret
= gimplify_addr_expr (expr_p
, pre_p
, post_p
);
5752 ret
= gimplify_va_arg_expr (expr_p
, pre_p
, post_p
);
5757 if (IS_EMPTY_STMT (*expr_p
))
5763 if (VOID_TYPE_P (TREE_TYPE (*expr_p
))
5764 || fallback
== fb_none
)
5766 /* Just strip a conversion to void (or in void context) and
5768 *expr_p
= TREE_OPERAND (*expr_p
, 0);
5772 ret
= gimplify_conversion (expr_p
);
5773 if (ret
== GS_ERROR
)
5775 if (*expr_p
!= save_expr
)
5779 case FIX_TRUNC_EXPR
:
5780 /* unary_expr: ... | '(' cast ')' val | ... */
5781 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5782 is_gimple_val
, fb_rvalue
);
5783 recalculate_side_effects (*expr_p
);
5787 *expr_p
= fold_indirect_ref (*expr_p
);
5788 if (*expr_p
!= save_expr
)
5790 /* else fall through. */
5791 case ALIGN_INDIRECT_REF
:
5792 case MISALIGNED_INDIRECT_REF
:
5793 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5794 is_gimple_reg
, fb_rvalue
);
5795 recalculate_side_effects (*expr_p
);
5798 /* Constants need not be gimplified. */
5809 /* If we require an lvalue, such as for ADDR_EXPR, retain the
5810 CONST_DECL node. Otherwise the decl is replaceable by its
5812 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
5813 if (fallback
& fb_lvalue
)
5816 *expr_p
= DECL_INITIAL (*expr_p
);
5820 ret
= gimplify_decl_expr (expr_p
);
5824 /* FIXME make this a decl. */
5829 ret
= gimplify_bind_expr (expr_p
, pre_p
);
5833 ret
= gimplify_loop_expr (expr_p
, pre_p
);
5837 ret
= gimplify_switch_expr (expr_p
, pre_p
);
5841 ret
= gimplify_exit_expr (expr_p
);
5845 /* If the target is not LABEL, then it is a computed jump
5846 and the target needs to be gimplified. */
5847 if (TREE_CODE (GOTO_DESTINATION (*expr_p
)) != LABEL_DECL
)
5848 ret
= gimplify_expr (&GOTO_DESTINATION (*expr_p
), pre_p
,
5849 NULL
, is_gimple_val
, fb_rvalue
);
5852 /* Predictions are always gimplified. */
5858 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p
))
5859 == current_function_decl
);
5862 case CASE_LABEL_EXPR
:
5863 ret
= gimplify_case_label_expr (expr_p
);
5867 ret
= gimplify_return_expr (*expr_p
, pre_p
);
5871 /* Don't reduce this in place; let gimplify_init_constructor work its
5872 magic. Buf if we're just elaborating this for side effects, just
5873 gimplify any element that has side-effects. */
5874 if (fallback
== fb_none
)
5876 unsigned HOST_WIDE_INT ix
;
5877 constructor_elt
*ce
;
5878 tree temp
= NULL_TREE
;
5880 VEC_iterate (constructor_elt
, CONSTRUCTOR_ELTS (*expr_p
),
5883 if (TREE_SIDE_EFFECTS (ce
->value
))
5884 append_to_statement_list (ce
->value
, &temp
);
5889 /* C99 code may assign to an array in a constructed
5890 structure or union, and this has undefined behavior only
5891 on execution, so create a temporary if an lvalue is
5893 else if (fallback
== fb_lvalue
)
5895 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
5896 mark_addressable (*expr_p
);
5902 /* The following are special cases that are not handled by the
5903 original GIMPLE grammar. */
5905 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
5908 ret
= gimplify_save_expr (expr_p
, pre_p
, post_p
);
5913 enum gimplify_status r0
, r1
, r2
;
5915 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5916 is_gimple_lvalue
, fb_either
);
5917 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
5918 is_gimple_val
, fb_rvalue
);
5919 r2
= gimplify_expr (&TREE_OPERAND (*expr_p
, 2), pre_p
, post_p
,
5920 is_gimple_val
, fb_rvalue
);
5921 recalculate_side_effects (*expr_p
);
5923 ret
= MIN (r0
, MIN (r1
, r2
));
5927 case NON_LVALUE_EXPR
:
5928 /* This should have been stripped above. */
5932 ret
= gimplify_asm_expr (expr_p
, pre_p
, post_p
);
5935 case TRY_FINALLY_EXPR
:
5936 case TRY_CATCH_EXPR
:
5937 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p
, 0));
5938 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p
, 1));
5942 case CLEANUP_POINT_EXPR
:
5943 ret
= gimplify_cleanup_point_expr (expr_p
, pre_p
);
5947 ret
= gimplify_target_expr (expr_p
, pre_p
, post_p
);
5951 gimplify_to_stmt_list (&CATCH_BODY (*expr_p
));
5955 case EH_FILTER_EXPR
:
5956 gimplify_to_stmt_list (&EH_FILTER_FAILURE (*expr_p
));
5960 case CHANGE_DYNAMIC_TYPE_EXPR
:
5961 ret
= gimplify_expr (&CHANGE_DYNAMIC_TYPE_LOCATION (*expr_p
),
5962 pre_p
, post_p
, is_gimple_reg
, fb_lvalue
);
5967 enum gimplify_status r0
, r1
;
5968 r0
= gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p
), pre_p
, post_p
,
5969 is_gimple_val
, fb_rvalue
);
5970 r1
= gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p
), pre_p
, post_p
,
5971 is_gimple_val
, fb_rvalue
);
5977 /* We get here when taking the address of a label. We mark
5978 the label as "forced"; meaning it can never be removed and
5979 it is a potential target for any computed goto. */
5980 FORCED_LABEL (*expr_p
) = 1;
5984 case STATEMENT_LIST
:
5985 ret
= gimplify_statement_list (expr_p
, pre_p
);
5988 case WITH_SIZE_EXPR
:
5990 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
5991 post_p
== &internal_post
? NULL
: post_p
,
5992 gimple_test_f
, fallback
);
5993 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
5994 is_gimple_val
, fb_rvalue
);
6000 ret
= gimplify_var_or_parm_decl (expr_p
);
6004 /* When within an OpenMP context, notice uses of variables. */
6005 if (gimplify_omp_ctxp
)
6006 omp_notice_variable (gimplify_omp_ctxp
, *expr_p
, true);
6011 /* Allow callbacks into the gimplifier during optimization. */
6016 ret
= gimplify_omp_parallel (expr_p
, pre_p
);
6020 ret
= gimplify_omp_for (expr_p
, pre_p
);
6025 ret
= gimplify_omp_workshare (expr_p
, pre_p
);
6032 gimplify_to_stmt_list (&OMP_BODY (*expr_p
));
6036 ret
= gimplify_omp_atomic (expr_p
, pre_p
);
6041 case OMP_ATOMIC_STORE
:
6045 case OMP_ATOMIC_LOAD
:
6046 if (gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, NULL
,
6047 is_gimple_val
, fb_rvalue
) != GS_ALL_DONE
)
6053 case POINTER_PLUS_EXPR
:
6054 /* Convert ((type *)A)+offset into &A->field_of_type_and_offset.
6055 The second is gimple immediate saving a need for extra statement.
6057 if (TREE_CODE (TREE_OPERAND (*expr_p
, 1)) == INTEGER_CST
6058 && (tmp
= maybe_fold_offset_to_reference
6059 (TREE_OPERAND (*expr_p
, 0), TREE_OPERAND (*expr_p
, 1),
6060 TREE_TYPE (TREE_TYPE (*expr_p
)))))
6062 tree ptr_type
= build_pointer_type (TREE_TYPE (tmp
));
6063 if (useless_type_conversion_p (TREE_TYPE (*expr_p
), ptr_type
))
6065 *expr_p
= build_fold_addr_expr_with_type (tmp
, ptr_type
);
6069 /* Convert (void *)&a + 4 into (void *)&a[1]. */
6070 if (TREE_CODE (TREE_OPERAND (*expr_p
, 0)) == NOP_EXPR
6071 && TREE_CODE (TREE_OPERAND (*expr_p
, 1)) == INTEGER_CST
6072 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p
,
6074 && (tmp
= maybe_fold_offset_to_reference
6075 (TREE_OPERAND (TREE_OPERAND (*expr_p
, 0), 0),
6076 TREE_OPERAND (*expr_p
, 1),
6077 TREE_TYPE (TREE_TYPE
6078 (TREE_OPERAND (TREE_OPERAND (*expr_p
, 0),
6081 tmp
= build_fold_addr_expr (tmp
);
6082 *expr_p
= fold_convert (TREE_TYPE (*expr_p
), tmp
);
6087 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p
)))
6089 case tcc_comparison
:
6090 /* Handle comparison of objects of non scalar mode aggregates
6091 with a call to memcmp. It would be nice to only have to do
6092 this for variable-sized objects, but then we'd have to allow
6093 the same nest of reference nodes we allow for MODIFY_EXPR and
6096 Compare scalar mode aggregates as scalar mode values. Using
6097 memcmp for them would be very inefficient at best, and is
6098 plain wrong if bitfields are involved. */
6101 tree type
= TREE_TYPE (TREE_OPERAND (*expr_p
, 1));
6103 if (!AGGREGATE_TYPE_P (type
))
6105 else if (TYPE_MODE (type
) != BLKmode
)
6106 ret
= gimplify_scalar_mode_aggregate_compare (expr_p
);
6108 ret
= gimplify_variable_sized_compare (expr_p
);
6113 /* If *EXPR_P does not need to be special-cased, handle it
6114 according to its class. */
6116 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
6117 post_p
, is_gimple_val
, fb_rvalue
);
6123 enum gimplify_status r0
, r1
;
6125 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
6126 post_p
, is_gimple_val
, fb_rvalue
);
6127 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
,
6128 post_p
, is_gimple_val
, fb_rvalue
);
6134 case tcc_declaration
:
6137 goto dont_recalculate
;
6140 gcc_assert (TREE_CODE (*expr_p
) == TRUTH_AND_EXPR
6141 || TREE_CODE (*expr_p
) == TRUTH_OR_EXPR
6142 || TREE_CODE (*expr_p
) == TRUTH_XOR_EXPR
);
6146 recalculate_side_effects (*expr_p
);
6151 /* If we replaced *expr_p, gimplify again. */
6152 if (ret
== GS_OK
&& (*expr_p
== NULL
|| *expr_p
== save_expr
))
6155 while (ret
== GS_OK
);
6157 /* If we encountered an error_mark somewhere nested inside, either
6158 stub out the statement or propagate the error back out. */
6159 if (ret
== GS_ERROR
)
6166 /* This was only valid as a return value from the langhook, which
6167 we handled. Make sure it doesn't escape from any other context. */
6168 gcc_assert (ret
!= GS_UNHANDLED
);
6170 if (fallback
== fb_none
&& *expr_p
&& !is_gimple_stmt (*expr_p
))
6172 /* We aren't looking for a value, and we don't have a valid
6173 statement. If it doesn't have side-effects, throw it away. */
6174 if (!TREE_SIDE_EFFECTS (*expr_p
))
6176 else if (!TREE_THIS_VOLATILE (*expr_p
))
6178 /* This is probably a _REF that contains something nested that
6179 has side effects. Recurse through the operands to find it. */
6180 enum tree_code code
= TREE_CODE (*expr_p
);
6187 case VIEW_CONVERT_EXPR
:
6188 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
6189 gimple_test_f
, fallback
);
6193 case ARRAY_RANGE_REF
:
6194 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
6195 gimple_test_f
, fallback
);
6196 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
6197 gimple_test_f
, fallback
);
6201 /* Anything else with side-effects must be converted to
6202 a valid statement before we get here. */
6208 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p
))
6209 && TYPE_MODE (TREE_TYPE (*expr_p
)) != BLKmode
)
6211 /* Historically, the compiler has treated a bare reference
6212 to a non-BLKmode volatile lvalue as forcing a load. */
6213 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p
));
6214 /* Normally, we do not want to create a temporary for a
6215 TREE_ADDRESSABLE type because such a type should not be
6216 copied by bitwise-assignment. However, we make an
6217 exception here, as all we are doing here is ensuring that
6218 we read the bytes that make up the type. We use
6219 create_tmp_var_raw because create_tmp_var will abort when
6220 given a TREE_ADDRESSABLE type. */
6221 tree tmp
= create_tmp_var_raw (type
, "vol");
6222 gimple_add_tmp_var (tmp
);
6223 *expr_p
= build_gimple_modify_stmt (tmp
, *expr_p
);
6226 /* We can't do anything useful with a volatile reference to
6227 an incomplete type, so just throw it away. Likewise for
6228 a BLKmode type, since any implicit inner load should
6229 already have been turned into an explicit one by the
6230 gimplification process. */
6234 /* If we are gimplifying at the statement level, we're done. Tack
6235 everything together and replace the original statement with the
6237 if (fallback
== fb_none
|| is_statement
)
6239 if (internal_pre
|| internal_post
)
6241 append_to_statement_list (*expr_p
, &internal_pre
);
6242 append_to_statement_list (internal_post
, &internal_pre
);
6243 annotate_all_with_locus (&internal_pre
, input_location
);
6244 *expr_p
= internal_pre
;
6248 else if (TREE_CODE (*expr_p
) == STATEMENT_LIST
)
6249 annotate_all_with_locus (expr_p
, input_location
);
6251 annotate_one_with_locus (*expr_p
, input_location
);
6255 /* Otherwise we're gimplifying a subexpression, so the resulting value is
6258 /* If it's sufficiently simple already, we're done. Unless we are
6259 handling some post-effects internally; if that's the case, we need to
6260 copy into a temp before adding the post-effects to the tree. */
6261 if (!internal_post
&& (*gimple_test_f
) (*expr_p
))
6264 /* Otherwise, we need to create a new temporary for the gimplified
6267 /* We can't return an lvalue if we have an internal postqueue. The
6268 object the lvalue refers to would (probably) be modified by the
6269 postqueue; we need to copy the value out first, which means an
6271 if ((fallback
& fb_lvalue
) && !internal_post
6272 && is_gimple_addressable (*expr_p
))
6274 /* An lvalue will do. Take the address of the expression, store it
6275 in a temporary, and replace the expression with an INDIRECT_REF of
6277 tmp
= build_fold_addr_expr (*expr_p
);
6278 gimplify_expr (&tmp
, pre_p
, post_p
, is_gimple_reg
, fb_rvalue
);
6279 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (tmp
)), tmp
);
6281 else if ((fallback
& fb_rvalue
) && is_gimple_formal_tmp_rhs (*expr_p
))
6283 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p
)));
6285 /* An rvalue will do. Assign the gimplified expression into a new
6286 temporary TMP and replace the original expression with TMP. */
6288 if (internal_post
|| (fallback
& fb_lvalue
))
6289 /* The postqueue might change the value of the expression between
6290 the initialization and use of the temporary, so we can't use a
6291 formal temp. FIXME do we care? */
6292 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
6294 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
6296 if (TREE_CODE (*expr_p
) != SSA_NAME
)
6297 DECL_GIMPLE_FORMAL_TEMP_P (*expr_p
) = 1;
6301 #ifdef ENABLE_CHECKING
6302 if (!(fallback
& fb_mayfail
))
6304 fprintf (stderr
, "gimplification failed:\n");
6305 print_generic_expr (stderr
, *expr_p
, 0);
6306 debug_tree (*expr_p
);
6307 internal_error ("gimplification failed");
6310 gcc_assert (fallback
& fb_mayfail
);
6311 /* If this is an asm statement, and the user asked for the
6312 impossible, don't die. Fail and let gimplify_asm_expr
6318 /* Make sure the temporary matches our predicate. */
6319 gcc_assert ((*gimple_test_f
) (*expr_p
));
6323 annotate_all_with_locus (&internal_post
, input_location
);
6324 append_to_statement_list (internal_post
, pre_p
);
6328 input_location
= saved_location
;
6332 /* Look through TYPE for variable-sized objects and gimplify each such
6333 size that we find. Add to LIST_P any statements generated. */
6336 gimplify_type_sizes (tree type
, tree
*list_p
)
6340 if (type
== NULL
|| type
== error_mark_node
)
6343 /* We first do the main variant, then copy into any other variants. */
6344 type
= TYPE_MAIN_VARIANT (type
);
6346 /* Avoid infinite recursion. */
6347 if (TYPE_SIZES_GIMPLIFIED (type
))
6350 TYPE_SIZES_GIMPLIFIED (type
) = 1;
6352 switch (TREE_CODE (type
))
6358 case FIXED_POINT_TYPE
:
6359 gimplify_one_sizepos (&TYPE_MIN_VALUE (type
), list_p
);
6360 gimplify_one_sizepos (&TYPE_MAX_VALUE (type
), list_p
);
6362 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6364 TYPE_MIN_VALUE (t
) = TYPE_MIN_VALUE (type
);
6365 TYPE_MAX_VALUE (t
) = TYPE_MAX_VALUE (type
);
6370 /* These types may not have declarations, so handle them here. */
6371 gimplify_type_sizes (TREE_TYPE (type
), list_p
);
6372 gimplify_type_sizes (TYPE_DOMAIN (type
), list_p
);
6377 case QUAL_UNION_TYPE
:
6378 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
6379 if (TREE_CODE (field
) == FIELD_DECL
)
6381 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field
), list_p
);
6382 gimplify_type_sizes (TREE_TYPE (field
), list_p
);
6387 case REFERENCE_TYPE
:
6388 /* We used to recurse on the pointed-to type here, which turned out to
6389 be incorrect because its definition might refer to variables not
6390 yet initialized at this point if a forward declaration is involved.
6392 It was actually useful for anonymous pointed-to types to ensure
6393 that the sizes evaluation dominates every possible later use of the
6394 values. Restricting to such types here would be safe since there
6395 is no possible forward declaration around, but would introduce an
6396 undesirable middle-end semantic to anonymity. We then defer to
6397 front-ends the responsibility of ensuring that the sizes are
6398 evaluated both early and late enough, e.g. by attaching artificial
6399 type declarations to the tree. */
6406 gimplify_one_sizepos (&TYPE_SIZE (type
), list_p
);
6407 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type
), list_p
);
6409 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6411 TYPE_SIZE (t
) = TYPE_SIZE (type
);
6412 TYPE_SIZE_UNIT (t
) = TYPE_SIZE_UNIT (type
);
6413 TYPE_SIZES_GIMPLIFIED (t
) = 1;
6417 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
6418 a size or position, has had all of its SAVE_EXPRs evaluated.
6419 We add any required statements to STMT_P. */
6422 gimplify_one_sizepos (tree
*expr_p
, tree
*stmt_p
)
6424 tree type
, expr
= *expr_p
;
6426 /* We don't do anything if the value isn't there, is constant, or contains
6427 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
6428 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
6429 will want to replace it with a new variable, but that will cause problems
6430 if this type is from outside the function. It's OK to have that here. */
6431 if (expr
== NULL_TREE
|| TREE_CONSTANT (expr
)
6432 || TREE_CODE (expr
) == VAR_DECL
6433 || CONTAINS_PLACEHOLDER_P (expr
))
6436 type
= TREE_TYPE (expr
);
6437 *expr_p
= unshare_expr (expr
);
6439 gimplify_expr (expr_p
, stmt_p
, NULL
, is_gimple_val
, fb_rvalue
);
6442 /* Verify that we've an exact type match with the original expression.
6443 In particular, we do not wish to drop a "sizetype" in favour of a
6444 type of similar dimensions. We don't want to pollute the generic
6445 type-stripping code with this knowledge because it doesn't matter
6446 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
6447 and friends retain their "sizetype-ness". */
6448 if (TREE_TYPE (expr
) != type
6449 && TREE_CODE (type
) == INTEGER_TYPE
6450 && TYPE_IS_SIZETYPE (type
))
6454 *expr_p
= create_tmp_var (type
, NULL
);
6455 tmp
= build1 (NOP_EXPR
, type
, expr
);
6456 tmp
= build_gimple_modify_stmt (*expr_p
, tmp
);
6457 if (EXPR_HAS_LOCATION (expr
))
6458 SET_EXPR_LOCUS (tmp
, EXPR_LOCUS (expr
));
6460 SET_EXPR_LOCATION (tmp
, input_location
);
6462 gimplify_and_add (tmp
, stmt_p
);
6467 /* Gimplify the body of statements pointed to by BODY_P. FNDECL is the
6468 function decl containing BODY. */
6471 gimplify_body (tree
*body_p
, tree fndecl
, bool do_parms
)
6473 location_t saved_location
= input_location
;
6474 tree body
, parm_stmts
;
6476 timevar_push (TV_TREE_GIMPLIFY
);
6478 gcc_assert (gimplify_ctxp
== NULL
);
6479 push_gimplify_context ();
6481 /* Unshare most shared trees in the body and in that of any nested functions.
6482 It would seem we don't have to do this for nested functions because
6483 they are supposed to be output and then the outer function gimplified
6484 first, but the g++ front end doesn't always do it that way. */
6485 unshare_body (body_p
, fndecl
);
6486 unvisit_body (body_p
, fndecl
);
6488 /* Make sure input_location isn't set to something wierd. */
6489 input_location
= DECL_SOURCE_LOCATION (fndecl
);
6491 /* Resolve callee-copies. This has to be done before processing
6492 the body so that DECL_VALUE_EXPR gets processed correctly. */
6493 parm_stmts
= do_parms
? gimplify_parameters () : NULL
;
6495 /* Gimplify the function's body. */
6496 gimplify_stmt (body_p
);
6500 body
= alloc_stmt_list ();
6501 else if (TREE_CODE (body
) == STATEMENT_LIST
)
6503 tree t
= expr_only (*body_p
);
6508 /* If there isn't an outer BIND_EXPR, add one. */
6509 if (TREE_CODE (body
) != BIND_EXPR
)
6511 tree b
= build3 (BIND_EXPR
, void_type_node
, NULL_TREE
,
6512 NULL_TREE
, NULL_TREE
);
6513 TREE_SIDE_EFFECTS (b
) = 1;
6514 append_to_statement_list_force (body
, &BIND_EXPR_BODY (b
));
6518 /* If we had callee-copies statements, insert them at the beginning
6522 append_to_statement_list_force (BIND_EXPR_BODY (body
), &parm_stmts
);
6523 BIND_EXPR_BODY (body
) = parm_stmts
;
6526 /* Unshare again, in case gimplification was sloppy. */
6527 unshare_all_trees (body
);
6531 pop_gimplify_context (body
);
6532 gcc_assert (gimplify_ctxp
== NULL
);
6534 #ifdef ENABLE_TYPES_CHECKING
6535 if (!errorcount
&& !sorrycount
)
6536 verify_gimple_1 (BIND_EXPR_BODY (*body_p
));
6539 timevar_pop (TV_TREE_GIMPLIFY
);
6540 input_location
= saved_location
;
6543 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
6544 node for the function we want to gimplify. */
6547 gimplify_function_tree (tree fndecl
)
6549 tree oldfn
, parm
, ret
;
6551 oldfn
= current_function_decl
;
6552 current_function_decl
= fndecl
;
6553 if (DECL_STRUCT_FUNCTION (fndecl
))
6554 push_cfun (DECL_STRUCT_FUNCTION (fndecl
));
6556 push_struct_function (fndecl
);
6558 for (parm
= DECL_ARGUMENTS (fndecl
); parm
; parm
= TREE_CHAIN (parm
))
6560 /* Preliminarily mark non-addressed complex variables as eligible
6561 for promotion to gimple registers. We'll transform their uses
6563 if ((TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
6564 || TREE_CODE (TREE_TYPE (parm
)) == VECTOR_TYPE
)
6565 && !TREE_THIS_VOLATILE (parm
)
6566 && !needs_to_live_in_memory (parm
))
6567 DECL_GIMPLE_REG_P (parm
) = 1;
6570 ret
= DECL_RESULT (fndecl
);
6571 if ((TREE_CODE (TREE_TYPE (ret
)) == COMPLEX_TYPE
6572 || TREE_CODE (TREE_TYPE (ret
)) == VECTOR_TYPE
)
6573 && !needs_to_live_in_memory (ret
))
6574 DECL_GIMPLE_REG_P (ret
) = 1;
6576 gimplify_body (&DECL_SAVED_TREE (fndecl
), fndecl
, true);
6578 /* If we're instrumenting function entry/exit, then prepend the call to
6579 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
6580 catch the exit hook. */
6581 /* ??? Add some way to ignore exceptions for this TFE. */
6582 if (flag_instrument_function_entry_exit
6583 && !DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl
)
6584 && !flag_instrument_functions_exclude_p (fndecl
))
6588 tf
= build2 (TRY_FINALLY_EXPR
, void_type_node
, NULL
, NULL
);
6589 TREE_SIDE_EFFECTS (tf
) = 1;
6590 x
= DECL_SAVED_TREE (fndecl
);
6591 append_to_statement_list (x
, &TREE_OPERAND (tf
, 0));
6592 x
= implicit_built_in_decls
[BUILT_IN_PROFILE_FUNC_EXIT
];
6593 x
= build_call_expr (x
, 0);
6594 append_to_statement_list (x
, &TREE_OPERAND (tf
, 1));
6596 bind
= build3 (BIND_EXPR
, void_type_node
, NULL
, NULL
, NULL
);
6597 TREE_SIDE_EFFECTS (bind
) = 1;
6598 x
= implicit_built_in_decls
[BUILT_IN_PROFILE_FUNC_ENTER
];
6599 x
= build_call_expr (x
, 0);
6600 append_to_statement_list (x
, &BIND_EXPR_BODY (bind
));
6601 append_to_statement_list (tf
, &BIND_EXPR_BODY (bind
));
6603 DECL_SAVED_TREE (fndecl
) = bind
;
6606 cfun
->gimplified
= true;
6607 current_function_decl
= oldfn
;
6611 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
6612 force the result to be either ssa_name or an invariant, otherwise
6613 just force it to be a rhs expression. If VAR is not NULL, make the
6614 base variable of the final destination be VAR if suitable. */
6617 force_gimple_operand (tree expr
, tree
*stmts
, bool simple
, tree var
)
6620 enum gimplify_status ret
;
6621 gimple_predicate gimple_test_f
;
6625 if (is_gimple_val (expr
))
6628 gimple_test_f
= simple
? is_gimple_val
: is_gimple_reg_rhs
;
6630 push_gimplify_context ();
6631 gimplify_ctxp
->into_ssa
= gimple_in_ssa_p (cfun
);
6632 gimplify_ctxp
->allow_rhs_cond_expr
= true;
6635 expr
= build_gimple_modify_stmt (var
, expr
);
6637 if (TREE_CODE (expr
) != GIMPLE_MODIFY_STMT
6638 && TREE_TYPE (expr
) == void_type_node
)
6640 gimplify_and_add (expr
, stmts
);
6645 ret
= gimplify_expr (&expr
, stmts
, NULL
,
6646 gimple_test_f
, fb_rvalue
);
6647 gcc_assert (ret
!= GS_ERROR
);
6650 if (gimple_referenced_vars (cfun
))
6652 for (t
= gimplify_ctxp
->temps
; t
; t
= TREE_CHAIN (t
))
6653 add_referenced_var (t
);
6656 pop_gimplify_context (NULL
);
6661 /* Invokes force_gimple_operand for EXPR with parameters SIMPLE_P and VAR. If
6662 some statements are produced, emits them at BSI. If BEFORE is true.
6663 the statements are appended before BSI, otherwise they are appended after
6664 it. M specifies the way BSI moves after insertion (BSI_SAME_STMT or
6665 BSI_CONTINUE_LINKING are the usual values). */
6668 force_gimple_operand_bsi (block_stmt_iterator
*bsi
, tree expr
,
6669 bool simple_p
, tree var
, bool before
,
6670 enum bsi_iterator_update m
)
6674 expr
= force_gimple_operand (expr
, &stmts
, simple_p
, var
);
6677 if (gimple_in_ssa_p (cfun
))
6679 tree_stmt_iterator tsi
;
6681 for (tsi
= tsi_start (stmts
); !tsi_end_p (tsi
); tsi_next (&tsi
))
6682 mark_symbols_for_renaming (tsi_stmt (tsi
));
6686 bsi_insert_before (bsi
, stmts
, m
);
6688 bsi_insert_after (bsi
, stmts
, m
);
6694 #include "gt-gimplify.h"