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, 2009
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"
32 #include "tree-iterator.h"
33 #include "tree-inline.h"
34 #include "diagnostic.h"
35 #include "langhooks.h"
36 #include "langhooks-def.h"
37 #include "tree-flow.h"
51 #include "pointer-set.h"
52 #include "splay-tree.h"
57 enum gimplify_omp_var_data
63 GOVD_FIRSTPRIVATE
= 16,
64 GOVD_LASTPRIVATE
= 32,
67 GOVD_DEBUG_PRIVATE
= 256,
68 GOVD_PRIVATE_OUTER_REF
= 512,
69 GOVD_DATA_SHARE_CLASS
= (GOVD_SHARED
| GOVD_PRIVATE
| GOVD_FIRSTPRIVATE
70 | GOVD_LASTPRIVATE
| GOVD_REDUCTION
| GOVD_LOCAL
)
79 ORT_COMBINED_PARALLEL
= 3
82 struct gimplify_omp_ctx
84 struct gimplify_omp_ctx
*outer_context
;
86 struct pointer_set_t
*privatized_types
;
88 enum omp_clause_default_kind default_kind
;
89 enum omp_region_type region_type
;
92 static struct gimplify_ctx
*gimplify_ctxp
;
93 static struct gimplify_omp_ctx
*gimplify_omp_ctxp
;
96 /* Formal (expression) temporary table handling: Multiple occurrences of
97 the same scalar expression are evaluated into the same temporary. */
99 typedef struct gimple_temp_hash_elt
102 tree temp
; /* Value */
105 /* Forward declarations. */
106 static enum gimplify_status
gimplify_compound_expr (tree
*, gimple_seq
*, bool);
108 /* Mark X addressable. Unlike the langhook we expect X to be in gimple
109 form and we don't do any syntax checking. */
111 mark_addressable (tree x
)
113 while (handled_component_p (x
))
114 x
= TREE_OPERAND (x
, 0);
115 if (TREE_CODE (x
) != VAR_DECL
&& TREE_CODE (x
) != PARM_DECL
)
117 TREE_ADDRESSABLE (x
) = 1;
120 /* Return a hash value for a formal temporary table entry. */
123 gimple_tree_hash (const void *p
)
125 tree t
= ((const elt_t
*) p
)->val
;
126 return iterative_hash_expr (t
, 0);
129 /* Compare two formal temporary table entries. */
132 gimple_tree_eq (const void *p1
, const void *p2
)
134 tree t1
= ((const elt_t
*) p1
)->val
;
135 tree t2
= ((const elt_t
*) p2
)->val
;
136 enum tree_code code
= TREE_CODE (t1
);
138 if (TREE_CODE (t2
) != code
139 || TREE_TYPE (t1
) != TREE_TYPE (t2
))
142 if (!operand_equal_p (t1
, t2
, 0))
145 /* Only allow them to compare equal if they also hash equal; otherwise
146 results are nondeterminate, and we fail bootstrap comparison. */
147 gcc_assert (gimple_tree_hash (p1
) == gimple_tree_hash (p2
));
152 /* Link gimple statement GS to the end of the sequence *SEQ_P. If
153 *SEQ_P is NULL, a new sequence is allocated. This function is
154 similar to gimple_seq_add_stmt, but does not scan the operands.
155 During gimplification, we need to manipulate statement sequences
156 before the def/use vectors have been constructed. */
159 gimplify_seq_add_stmt (gimple_seq
*seq_p
, gimple gs
)
161 gimple_stmt_iterator si
;
167 *seq_p
= gimple_seq_alloc ();
169 si
= gsi_last (*seq_p
);
171 gsi_insert_after_without_update (&si
, gs
, GSI_NEW_STMT
);
174 /* Append sequence SRC to the end of sequence *DST_P. If *DST_P is
175 NULL, a new sequence is allocated. This function is
176 similar to gimple_seq_add_seq, but does not scan the operands.
177 During gimplification, we need to manipulate statement sequences
178 before the def/use vectors have been constructed. */
181 gimplify_seq_add_seq (gimple_seq
*dst_p
, gimple_seq src
)
183 gimple_stmt_iterator si
;
189 *dst_p
= gimple_seq_alloc ();
191 si
= gsi_last (*dst_p
);
192 gsi_insert_seq_after_without_update (&si
, src
, GSI_NEW_STMT
);
195 /* Set up a context for the gimplifier. */
198 push_gimplify_context (struct gimplify_ctx
*c
)
200 memset (c
, '\0', sizeof (*c
));
201 c
->prev_context
= gimplify_ctxp
;
205 /* Tear down a context for the gimplifier. If BODY is non-null, then
206 put the temporaries into the outer BIND_EXPR. Otherwise, put them
209 BODY is not a sequence, but the first tuple in a sequence. */
212 pop_gimplify_context (gimple body
)
214 struct gimplify_ctx
*c
= gimplify_ctxp
;
217 gcc_assert (c
&& (c
->bind_expr_stack
== NULL
218 || VEC_empty (gimple
, c
->bind_expr_stack
)));
219 VEC_free (gimple
, heap
, c
->bind_expr_stack
);
220 gimplify_ctxp
= c
->prev_context
;
222 for (t
= c
->temps
; t
; t
= TREE_CHAIN (t
))
223 DECL_GIMPLE_FORMAL_TEMP_P (t
) = 0;
226 declare_vars (c
->temps
, body
, false);
228 record_vars (c
->temps
);
231 htab_delete (c
->temp_htab
);
235 gimple_push_bind_expr (gimple gimple_bind
)
237 if (gimplify_ctxp
->bind_expr_stack
== NULL
)
238 gimplify_ctxp
->bind_expr_stack
= VEC_alloc (gimple
, heap
, 8);
239 VEC_safe_push (gimple
, heap
, gimplify_ctxp
->bind_expr_stack
, gimple_bind
);
243 gimple_pop_bind_expr (void)
245 VEC_pop (gimple
, gimplify_ctxp
->bind_expr_stack
);
249 gimple_current_bind_expr (void)
251 return VEC_last (gimple
, gimplify_ctxp
->bind_expr_stack
);
254 /* Return the stack GIMPLE_BINDs created during gimplification. */
257 gimple_bind_expr_stack (void)
259 return gimplify_ctxp
->bind_expr_stack
;
262 /* Returns true iff there is a COND_EXPR between us and the innermost
263 CLEANUP_POINT_EXPR. This info is used by gimple_push_cleanup. */
266 gimple_conditional_context (void)
268 return gimplify_ctxp
->conditions
> 0;
271 /* Note that we've entered a COND_EXPR. */
274 gimple_push_condition (void)
276 #ifdef ENABLE_GIMPLE_CHECKING
277 if (gimplify_ctxp
->conditions
== 0)
278 gcc_assert (gimple_seq_empty_p (gimplify_ctxp
->conditional_cleanups
));
280 ++(gimplify_ctxp
->conditions
);
283 /* Note that we've left a COND_EXPR. If we're back at unconditional scope
284 now, add any conditional cleanups we've seen to the prequeue. */
287 gimple_pop_condition (gimple_seq
*pre_p
)
289 int conds
= --(gimplify_ctxp
->conditions
);
291 gcc_assert (conds
>= 0);
294 gimplify_seq_add_seq (pre_p
, gimplify_ctxp
->conditional_cleanups
);
295 gimplify_ctxp
->conditional_cleanups
= NULL
;
299 /* A stable comparison routine for use with splay trees and DECLs. */
302 splay_tree_compare_decl_uid (splay_tree_key xa
, splay_tree_key xb
)
307 return DECL_UID (a
) - DECL_UID (b
);
310 /* Create a new omp construct that deals with variable remapping. */
312 static struct gimplify_omp_ctx
*
313 new_omp_context (enum omp_region_type region_type
)
315 struct gimplify_omp_ctx
*c
;
317 c
= XCNEW (struct gimplify_omp_ctx
);
318 c
->outer_context
= gimplify_omp_ctxp
;
319 c
->variables
= splay_tree_new (splay_tree_compare_decl_uid
, 0, 0);
320 c
->privatized_types
= pointer_set_create ();
321 c
->location
= input_location
;
322 c
->region_type
= region_type
;
323 if (region_type
!= ORT_TASK
)
324 c
->default_kind
= OMP_CLAUSE_DEFAULT_SHARED
;
326 c
->default_kind
= OMP_CLAUSE_DEFAULT_UNSPECIFIED
;
331 /* Destroy an omp construct that deals with variable remapping. */
334 delete_omp_context (struct gimplify_omp_ctx
*c
)
336 splay_tree_delete (c
->variables
);
337 pointer_set_destroy (c
->privatized_types
);
341 static void omp_add_variable (struct gimplify_omp_ctx
*, tree
, unsigned int);
342 static bool omp_notice_variable (struct gimplify_omp_ctx
*, tree
, bool);
344 /* A subroutine of append_to_statement_list{,_force}. T is not NULL. */
347 append_to_statement_list_1 (tree t
, tree
*list_p
)
350 tree_stmt_iterator i
;
354 if (t
&& TREE_CODE (t
) == STATEMENT_LIST
)
359 *list_p
= list
= alloc_stmt_list ();
363 tsi_link_after (&i
, t
, TSI_CONTINUE_LINKING
);
366 /* Add T to the end of the list container pointed to by LIST_P.
367 If T is an expression with no effects, it is ignored. */
370 append_to_statement_list (tree t
, tree
*list_p
)
372 if (t
&& TREE_SIDE_EFFECTS (t
))
373 append_to_statement_list_1 (t
, list_p
);
376 /* Similar, but the statement is always added, regardless of side effects. */
379 append_to_statement_list_force (tree t
, tree
*list_p
)
382 append_to_statement_list_1 (t
, list_p
);
385 /* Both gimplify the statement T and append it to *SEQ_P. This function
386 behaves exactly as gimplify_stmt, but you don't have to pass T as a
390 gimplify_and_add (tree t
, gimple_seq
*seq_p
)
392 gimplify_stmt (&t
, seq_p
);
395 /* Gimplify statement T into sequence *SEQ_P, and return the first
396 tuple in the sequence of generated tuples for this statement.
397 Return NULL if gimplifying T produced no tuples. */
400 gimplify_and_return_first (tree t
, gimple_seq
*seq_p
)
402 gimple_stmt_iterator last
= gsi_last (*seq_p
);
404 gimplify_and_add (t
, seq_p
);
406 if (!gsi_end_p (last
))
409 return gsi_stmt (last
);
412 return gimple_seq_first_stmt (*seq_p
);
415 /* Strip off a legitimate source ending from the input string NAME of
416 length LEN. Rather than having to know the names used by all of
417 our front ends, we strip off an ending of a period followed by
418 up to five characters. (Java uses ".class".) */
421 remove_suffix (char *name
, int len
)
425 for (i
= 2; i
< 8 && len
> i
; i
++)
427 if (name
[len
- i
] == '.')
429 name
[len
- i
] = '\0';
435 /* Subroutine for find_single_pointer_decl. */
438 find_single_pointer_decl_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
441 tree
*pdecl
= (tree
*) data
;
443 /* We are only looking for pointers at the same level as the
444 original tree; we must not look through any indirections.
445 Returning anything other than NULL_TREE will cause the caller to
447 if (REFERENCE_CLASS_P (*tp
))
450 if (DECL_P (*tp
) && POINTER_TYPE_P (TREE_TYPE (*tp
)))
454 /* We already found a pointer decl; return anything other
455 than NULL_TREE to unwind from walk_tree signalling that
456 we have a duplicate. */
465 /* Find the single DECL of pointer type in the tree T, used directly
466 rather than via an indirection, and return it. If there are zero
467 or more than one such DECLs, return NULL. */
470 find_single_pointer_decl (tree t
)
472 tree decl
= NULL_TREE
;
474 if (walk_tree (&t
, find_single_pointer_decl_1
, &decl
, NULL
))
476 /* find_single_pointer_decl_1 returns a nonzero value, causing
477 walk_tree to return a nonzero value, to indicate that it
478 found more than one pointer DECL or that it found an
486 /* Create a new temporary name with PREFIX. Returns an identifier. */
488 static GTY(()) unsigned int tmp_var_id_num
;
491 create_tmp_var_name (const char *prefix
)
497 char *preftmp
= ASTRDUP (prefix
);
499 remove_suffix (preftmp
, strlen (preftmp
));
503 ASM_FORMAT_PRIVATE_NAME (tmp_name
, prefix
? prefix
: "T", tmp_var_id_num
++);
504 return get_identifier (tmp_name
);
508 /* Create a new temporary variable declaration of type TYPE.
509 Does NOT push it into the current binding. */
512 create_tmp_var_raw (tree type
, const char *prefix
)
517 /* Make the type of the variable writable. */
518 new_type
= build_type_variant (type
, 0, 0);
519 TYPE_ATTRIBUTES (new_type
) = TYPE_ATTRIBUTES (type
);
521 tmp_var
= build_decl (VAR_DECL
, prefix
? create_tmp_var_name (prefix
) : NULL
,
524 /* The variable was declared by the compiler. */
525 DECL_ARTIFICIAL (tmp_var
) = 1;
526 /* And we don't want debug info for it. */
527 DECL_IGNORED_P (tmp_var
) = 1;
529 /* Make the variable writable. */
530 TREE_READONLY (tmp_var
) = 0;
532 DECL_EXTERNAL (tmp_var
) = 0;
533 TREE_STATIC (tmp_var
) = 0;
534 TREE_USED (tmp_var
) = 1;
539 /* Create a new temporary variable declaration of type TYPE. DOES push the
540 variable into the current binding. Further, assume that this is called
541 only from gimplification or optimization, at which point the creation of
542 certain types are bugs. */
545 create_tmp_var (tree type
, const char *prefix
)
549 /* We don't allow types that are addressable (meaning we can't make copies),
550 or incomplete. We also used to reject every variable size objects here,
551 but now support those for which a constant upper bound can be obtained.
552 The processing for variable sizes is performed in gimple_add_tmp_var,
553 point at which it really matters and possibly reached via paths not going
554 through this function, e.g. after direct calls to create_tmp_var_raw. */
555 gcc_assert (!TREE_ADDRESSABLE (type
) && COMPLETE_TYPE_P (type
));
557 tmp_var
= create_tmp_var_raw (type
, prefix
);
558 gimple_add_tmp_var (tmp_var
);
562 /* Create a temporary with a name derived from VAL. Subroutine of
563 lookup_tmp_var; nobody else should call this function. */
566 create_tmp_from_val (tree val
)
568 return create_tmp_var (TREE_TYPE (val
), get_name (val
));
571 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
572 an existing expression temporary. */
575 lookup_tmp_var (tree val
, bool is_formal
)
579 /* If not optimizing, never really reuse a temporary. local-alloc
580 won't allocate any variable that is used in more than one basic
581 block, which means it will go into memory, causing much extra
582 work in reload and final and poorer code generation, outweighing
583 the extra memory allocation here. */
584 if (!optimize
|| !is_formal
|| TREE_SIDE_EFFECTS (val
))
585 ret
= create_tmp_from_val (val
);
592 if (gimplify_ctxp
->temp_htab
== NULL
)
593 gimplify_ctxp
->temp_htab
594 = htab_create (1000, gimple_tree_hash
, gimple_tree_eq
, free
);
595 slot
= htab_find_slot (gimplify_ctxp
->temp_htab
, (void *)&elt
, INSERT
);
598 elt_p
= XNEW (elt_t
);
600 elt_p
->temp
= ret
= create_tmp_from_val (val
);
601 *slot
= (void *) elt_p
;
605 elt_p
= (elt_t
*) *slot
;
611 DECL_GIMPLE_FORMAL_TEMP_P (ret
) = 1;
617 /* Return true if T is a CALL_EXPR or an expression that can be
618 assignmed to a temporary. Note that this predicate should only be
619 used during gimplification. See the rationale for this in
620 gimplify_modify_expr. */
623 is_gimple_formal_tmp_or_call_rhs (tree t
)
625 return TREE_CODE (t
) == CALL_EXPR
|| is_gimple_formal_tmp_rhs (t
);
628 /* Returns true iff T is a valid RHS for an assignment to a renamed
629 user -- or front-end generated artificial -- variable. */
632 is_gimple_reg_or_call_rhs (tree t
)
634 /* If the RHS of the MODIFY_EXPR may throw or make a nonlocal goto
635 and the LHS is a user variable, then we need to introduce a formal
636 temporary. This way the optimizers can determine that the user
637 variable is only modified if evaluation of the RHS does not throw.
639 Don't force a temp of a non-renamable type; the copy could be
640 arbitrarily expensive. Instead we will generate a VDEF for
643 if (is_gimple_reg_type (TREE_TYPE (t
))
644 && ((TREE_CODE (t
) == CALL_EXPR
&& TREE_SIDE_EFFECTS (t
))
645 || tree_could_throw_p (t
)))
648 return is_gimple_formal_tmp_or_call_rhs (t
);
651 /* Return true if T is a valid memory RHS or a CALL_EXPR. Note that
652 this predicate should only be used during gimplification. See the
653 rationale for this in gimplify_modify_expr. */
656 is_gimple_mem_or_call_rhs (tree t
)
658 /* If we're dealing with a renamable type, either source or dest must be
659 a renamed variable. */
660 if (is_gimple_reg_type (TREE_TYPE (t
)))
661 return is_gimple_val (t
);
663 return is_gimple_formal_tmp_or_call_rhs (t
);
667 /* Returns a formal temporary variable initialized with VAL. PRE_P is as
668 in gimplify_expr. Only use this function if:
670 1) The value of the unfactored expression represented by VAL will not
671 change between the initialization and use of the temporary, and
672 2) The temporary will not be otherwise modified.
674 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
675 and #2 means it is inappropriate for && temps.
677 For other cases, use get_initialized_tmp_var instead. */
680 internal_get_tmp_var (tree val
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
685 /* Notice that we explicitly allow VAL to be a CALL_EXPR so that we
686 can create an INIT_EXPR and convert it into a GIMPLE_CALL below. */
687 gimplify_expr (&val
, pre_p
, post_p
, is_gimple_formal_tmp_or_call_rhs
,
690 t
= lookup_tmp_var (val
, is_formal
);
694 tree u
= find_single_pointer_decl (val
);
696 if (u
&& TREE_CODE (u
) == VAR_DECL
&& DECL_BASED_ON_RESTRICT_P (u
))
697 u
= DECL_GET_RESTRICT_BASE (u
);
698 if (u
&& TYPE_RESTRICT (TREE_TYPE (u
)))
700 if (DECL_BASED_ON_RESTRICT_P (t
))
701 gcc_assert (u
== DECL_GET_RESTRICT_BASE (t
));
704 DECL_BASED_ON_RESTRICT_P (t
) = 1;
705 SET_DECL_RESTRICT_BASE (t
, u
);
710 if (TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
711 || TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
712 DECL_GIMPLE_REG_P (t
) = 1;
714 mod
= build2 (INIT_EXPR
, TREE_TYPE (t
), t
, unshare_expr (val
));
716 if (EXPR_HAS_LOCATION (val
))
717 SET_EXPR_LOCUS (mod
, EXPR_LOCUS (val
));
719 SET_EXPR_LOCATION (mod
, input_location
);
721 /* gimplify_modify_expr might want to reduce this further. */
722 gimplify_and_add (mod
, pre_p
);
725 /* If we're gimplifying into ssa, gimplify_modify_expr will have
726 given our temporary an SSA name. Find and return it. */
727 if (gimplify_ctxp
->into_ssa
)
729 gimple last
= gimple_seq_last_stmt (*pre_p
);
730 t
= gimple_get_lhs (last
);
736 /* Returns a formal temporary variable initialized with VAL. PRE_P
737 points to a sequence where side-effects needed to compute VAL should be
741 get_formal_tmp_var (tree val
, gimple_seq
*pre_p
)
743 return internal_get_tmp_var (val
, pre_p
, NULL
, true);
746 /* Returns a temporary variable initialized with VAL. PRE_P and POST_P
747 are as in gimplify_expr. */
750 get_initialized_tmp_var (tree val
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
752 return internal_get_tmp_var (val
, pre_p
, post_p
, false);
755 /* Declares all the variables in VARS in SCOPE. If DEBUG_INFO is
756 true, generate debug info for them; otherwise don't. */
759 declare_vars (tree vars
, gimple scope
, bool debug_info
)
766 gcc_assert (gimple_code (scope
) == GIMPLE_BIND
);
768 temps
= nreverse (last
);
770 block
= gimple_bind_block (scope
);
771 gcc_assert (!block
|| TREE_CODE (block
) == BLOCK
);
772 if (!block
|| !debug_info
)
774 TREE_CHAIN (last
) = gimple_bind_vars (scope
);
775 gimple_bind_set_vars (scope
, temps
);
779 /* We need to attach the nodes both to the BIND_EXPR and to its
780 associated BLOCK for debugging purposes. The key point here
781 is that the BLOCK_VARS of the BIND_EXPR_BLOCK of a BIND_EXPR
782 is a subchain of the BIND_EXPR_VARS of the BIND_EXPR. */
783 if (BLOCK_VARS (block
))
784 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), temps
);
787 gimple_bind_set_vars (scope
,
788 chainon (gimple_bind_vars (scope
), temps
));
789 BLOCK_VARS (block
) = temps
;
795 /* For VAR a VAR_DECL of variable size, try to find a constant upper bound
796 for the size and adjust DECL_SIZE/DECL_SIZE_UNIT accordingly. Abort if
797 no such upper bound can be obtained. */
800 force_constant_size (tree var
)
802 /* The only attempt we make is by querying the maximum size of objects
803 of the variable's type. */
805 HOST_WIDE_INT max_size
;
807 gcc_assert (TREE_CODE (var
) == VAR_DECL
);
809 max_size
= max_int_size_in_bytes (TREE_TYPE (var
));
811 gcc_assert (max_size
>= 0);
814 = build_int_cst (TREE_TYPE (DECL_SIZE_UNIT (var
)), max_size
);
816 = build_int_cst (TREE_TYPE (DECL_SIZE (var
)), max_size
* BITS_PER_UNIT
);
820 gimple_add_tmp_var (tree tmp
)
822 gcc_assert (!TREE_CHAIN (tmp
) && !DECL_SEEN_IN_BIND_EXPR_P (tmp
));
824 /* Later processing assumes that the object size is constant, which might
825 not be true at this point. Force the use of a constant upper bound in
827 if (!host_integerp (DECL_SIZE_UNIT (tmp
), 1))
828 force_constant_size (tmp
);
830 DECL_CONTEXT (tmp
) = current_function_decl
;
831 DECL_SEEN_IN_BIND_EXPR_P (tmp
) = 1;
835 TREE_CHAIN (tmp
) = gimplify_ctxp
->temps
;
836 gimplify_ctxp
->temps
= tmp
;
838 /* Mark temporaries local within the nearest enclosing parallel. */
839 if (gimplify_omp_ctxp
)
841 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
842 while (ctx
&& ctx
->region_type
== ORT_WORKSHARE
)
843 ctx
= ctx
->outer_context
;
845 omp_add_variable (ctx
, tmp
, GOVD_LOCAL
| GOVD_SEEN
);
854 /* This case is for nested functions. We need to expose the locals
856 body_seq
= gimple_body (current_function_decl
);
857 declare_vars (tmp
, gimple_seq_first_stmt (body_seq
), false);
861 /* Determines whether to assign a location to the statement GS. */
864 should_carry_location_p (gimple gs
)
866 /* Don't emit a line note for a label. We particularly don't want to
867 emit one for the break label, since it doesn't actually correspond
868 to the beginning of the loop/switch. */
869 if (gimple_code (gs
) == GIMPLE_LABEL
)
875 /* Same, but for a tree. */
878 tree_should_carry_location_p (const_tree stmt
)
880 /* Don't emit a line note for a label. We particularly don't want to
881 emit one for the break label, since it doesn't actually correspond
882 to the beginning of the loop/switch. */
883 if (TREE_CODE (stmt
) == LABEL_EXPR
)
886 /* Do not annotate empty statements, since it confuses gcov. */
887 if (!TREE_SIDE_EFFECTS (stmt
))
893 /* Return true if a location should not be emitted for this statement
894 by annotate_one_with_location. */
897 gimple_do_not_emit_location_p (gimple g
)
899 return gimple_plf (g
, GF_PLF_1
);
902 /* Mark statement G so a location will not be emitted by
903 annotate_one_with_location. */
906 gimple_set_do_not_emit_location (gimple g
)
908 /* The PLF flags are initialized to 0 when a new tuple is created,
909 so no need to initialize it anywhere. */
910 gimple_set_plf (g
, GF_PLF_1
, true);
913 /* Set the location for gimple statement GS to LOCUS. */
916 annotate_one_with_location (gimple gs
, location_t location
)
918 if (!gimple_has_location (gs
)
919 && !gimple_do_not_emit_location_p (gs
)
920 && should_carry_location_p (gs
))
921 gimple_set_location (gs
, location
);
924 /* Same, but for tree T. */
927 tree_annotate_one_with_location (tree t
, location_t location
)
929 if (CAN_HAVE_LOCATION_P (t
)
930 && ! EXPR_HAS_LOCATION (t
) && tree_should_carry_location_p (t
))
931 SET_EXPR_LOCATION (t
, location
);
935 /* Set LOCATION for all the statements after iterator GSI in sequence
936 SEQ. If GSI is pointing to the end of the sequence, start with the
937 first statement in SEQ. */
940 annotate_all_with_location_after (gimple_seq seq
, gimple_stmt_iterator gsi
,
944 gsi
= gsi_start (seq
);
948 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
949 annotate_one_with_location (gsi_stmt (gsi
), location
);
953 /* Set the location for all the statements in a sequence STMT_P to LOCUS. */
956 annotate_all_with_location (gimple_seq stmt_p
, location_t location
)
958 gimple_stmt_iterator i
;
960 if (gimple_seq_empty_p (stmt_p
))
963 for (i
= gsi_start (stmt_p
); !gsi_end_p (i
); gsi_next (&i
))
965 gimple gs
= gsi_stmt (i
);
966 annotate_one_with_location (gs
, location
);
970 /* Same, but for statement or statement list in *STMT_P. */
973 tree_annotate_all_with_location (tree
*stmt_p
, location_t location
)
975 tree_stmt_iterator i
;
980 for (i
= tsi_start (*stmt_p
); !tsi_end_p (i
); tsi_next (&i
))
982 tree t
= tsi_stmt (i
);
984 /* Assuming we've already been gimplified, we shouldn't
985 see nested chaining constructs anymore. */
986 gcc_assert (TREE_CODE (t
) != STATEMENT_LIST
987 && TREE_CODE (t
) != COMPOUND_EXPR
);
989 tree_annotate_one_with_location (t
, location
);
994 /* Similar to copy_tree_r() but do not copy SAVE_EXPR or TARGET_EXPR nodes.
995 These nodes model computations that should only be done once. If we
996 were to unshare something like SAVE_EXPR(i++), the gimplification
997 process would create wrong code. */
1000 mostly_copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data
)
1002 enum tree_code code
= TREE_CODE (*tp
);
1003 /* Don't unshare types, decls, constants and SAVE_EXPR nodes. */
1004 if (TREE_CODE_CLASS (code
) == tcc_type
1005 || TREE_CODE_CLASS (code
) == tcc_declaration
1006 || TREE_CODE_CLASS (code
) == tcc_constant
1007 || code
== SAVE_EXPR
|| code
== TARGET_EXPR
1008 /* We can't do anything sensible with a BLOCK used as an expression,
1009 but we also can't just die when we see it because of non-expression
1010 uses. So just avert our eyes and cross our fingers. Silly Java. */
1015 gcc_assert (code
!= BIND_EXPR
);
1016 copy_tree_r (tp
, walk_subtrees
, data
);
1022 /* Callback for walk_tree to unshare most of the shared trees rooted at
1023 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
1024 then *TP is deep copied by calling copy_tree_r.
1026 This unshares the same trees as copy_tree_r with the exception of
1027 SAVE_EXPR nodes. These nodes model computations that should only be
1028 done once. If we were to unshare something like SAVE_EXPR(i++), the
1029 gimplification process would create wrong code. */
1032 copy_if_shared_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
1033 void *data ATTRIBUTE_UNUSED
)
1036 enum tree_code code
= TREE_CODE (t
);
1038 /* Skip types, decls, and constants. But we do want to look at their
1039 types and the bounds of types. Mark them as visited so we properly
1040 unmark their subtrees on the unmark pass. If we've already seen them,
1041 don't look down further. */
1042 if (TREE_CODE_CLASS (code
) == tcc_type
1043 || TREE_CODE_CLASS (code
) == tcc_declaration
1044 || TREE_CODE_CLASS (code
) == tcc_constant
)
1046 if (TREE_VISITED (t
))
1049 TREE_VISITED (t
) = 1;
1052 /* If this node has been visited already, unshare it and don't look
1054 else if (TREE_VISITED (t
))
1056 walk_tree (tp
, mostly_copy_tree_r
, NULL
, NULL
);
1060 /* Otherwise, mark the tree as visited and keep looking. */
1062 TREE_VISITED (t
) = 1;
1068 unmark_visited_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
1069 void *data ATTRIBUTE_UNUSED
)
1071 if (TREE_VISITED (*tp
))
1072 TREE_VISITED (*tp
) = 0;
1079 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
1080 bodies of any nested functions if we are unsharing the entire body of
1084 unshare_body (tree
*body_p
, tree fndecl
)
1086 struct cgraph_node
*cgn
= cgraph_node (fndecl
);
1088 walk_tree (body_p
, copy_if_shared_r
, NULL
, NULL
);
1089 if (body_p
== &DECL_SAVED_TREE (fndecl
))
1090 for (cgn
= cgn
->nested
; cgn
; cgn
= cgn
->next_nested
)
1091 unshare_body (&DECL_SAVED_TREE (cgn
->decl
), cgn
->decl
);
1094 /* Likewise, but mark all trees as not visited. */
1097 unvisit_body (tree
*body_p
, tree fndecl
)
1099 struct cgraph_node
*cgn
= cgraph_node (fndecl
);
1101 walk_tree (body_p
, unmark_visited_r
, NULL
, NULL
);
1102 if (body_p
== &DECL_SAVED_TREE (fndecl
))
1103 for (cgn
= cgn
->nested
; cgn
; cgn
= cgn
->next_nested
)
1104 unvisit_body (&DECL_SAVED_TREE (cgn
->decl
), cgn
->decl
);
1107 /* Unconditionally make an unshared copy of EXPR. This is used when using
1108 stored expressions which span multiple functions, such as BINFO_VTABLE,
1109 as the normal unsharing process can't tell that they're shared. */
1112 unshare_expr (tree expr
)
1114 walk_tree (&expr
, mostly_copy_tree_r
, NULL
, NULL
);
1118 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
1119 contain statements and have a value. Assign its value to a temporary
1120 and give it void_type_node. Returns the temporary, or NULL_TREE if
1121 WRAPPER was already void. */
1124 voidify_wrapper_expr (tree wrapper
, tree temp
)
1126 tree type
= TREE_TYPE (wrapper
);
1127 if (type
&& !VOID_TYPE_P (type
))
1131 /* Set p to point to the body of the wrapper. Loop until we find
1132 something that isn't a wrapper. */
1133 for (p
= &wrapper
; p
&& *p
; )
1135 switch (TREE_CODE (*p
))
1138 TREE_SIDE_EFFECTS (*p
) = 1;
1139 TREE_TYPE (*p
) = void_type_node
;
1140 /* For a BIND_EXPR, the body is operand 1. */
1141 p
= &BIND_EXPR_BODY (*p
);
1144 case CLEANUP_POINT_EXPR
:
1145 case TRY_FINALLY_EXPR
:
1146 case TRY_CATCH_EXPR
:
1147 TREE_SIDE_EFFECTS (*p
) = 1;
1148 TREE_TYPE (*p
) = void_type_node
;
1149 p
= &TREE_OPERAND (*p
, 0);
1152 case STATEMENT_LIST
:
1154 tree_stmt_iterator i
= tsi_last (*p
);
1155 TREE_SIDE_EFFECTS (*p
) = 1;
1156 TREE_TYPE (*p
) = void_type_node
;
1157 p
= tsi_end_p (i
) ? NULL
: tsi_stmt_ptr (i
);
1162 /* Advance to the last statement. Set all container types to void. */
1163 for (; TREE_CODE (*p
) == COMPOUND_EXPR
; p
= &TREE_OPERAND (*p
, 1))
1165 TREE_SIDE_EFFECTS (*p
) = 1;
1166 TREE_TYPE (*p
) = void_type_node
;
1176 if (p
== NULL
|| IS_EMPTY_STMT (*p
))
1180 /* The wrapper is on the RHS of an assignment that we're pushing
1182 gcc_assert (TREE_CODE (temp
) == INIT_EXPR
1183 || TREE_CODE (temp
) == MODIFY_EXPR
);
1184 TREE_OPERAND (temp
, 1) = *p
;
1189 temp
= create_tmp_var (type
, "retval");
1190 *p
= build2 (INIT_EXPR
, type
, temp
, *p
);
1199 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
1200 a temporary through which they communicate. */
1203 build_stack_save_restore (gimple
*save
, gimple
*restore
)
1207 *save
= gimple_build_call (implicit_built_in_decls
[BUILT_IN_STACK_SAVE
], 0);
1208 tmp_var
= create_tmp_var (ptr_type_node
, "saved_stack");
1209 gimple_call_set_lhs (*save
, tmp_var
);
1211 *restore
= gimple_build_call (implicit_built_in_decls
[BUILT_IN_STACK_RESTORE
],
1215 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
1217 static enum gimplify_status
1218 gimplify_bind_expr (tree
*expr_p
, gimple_seq
*pre_p
)
1220 tree bind_expr
= *expr_p
;
1221 bool old_save_stack
= gimplify_ctxp
->save_stack
;
1226 tree temp
= voidify_wrapper_expr (bind_expr
, NULL
);
1228 /* Mark variables seen in this bind expr. */
1229 for (t
= BIND_EXPR_VARS (bind_expr
); t
; t
= TREE_CHAIN (t
))
1231 if (TREE_CODE (t
) == VAR_DECL
)
1233 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
1235 /* Mark variable as local. */
1236 if (ctx
&& !is_global_var (t
)
1237 && (! DECL_SEEN_IN_BIND_EXPR_P (t
)
1238 || splay_tree_lookup (ctx
->variables
,
1239 (splay_tree_key
) t
) == NULL
))
1240 omp_add_variable (gimplify_omp_ctxp
, t
, GOVD_LOCAL
| GOVD_SEEN
);
1242 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
1244 if (DECL_HARD_REGISTER (t
) && !is_global_var (t
) && cfun
)
1245 cfun
->has_local_explicit_reg_vars
= true;
1248 /* Preliminarily mark non-addressed complex variables as eligible
1249 for promotion to gimple registers. We'll transform their uses
1251 if ((TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
1252 || TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
1253 && !TREE_THIS_VOLATILE (t
)
1254 && (TREE_CODE (t
) == VAR_DECL
&& !DECL_HARD_REGISTER (t
))
1255 && !needs_to_live_in_memory (t
))
1256 DECL_GIMPLE_REG_P (t
) = 1;
1259 gimple_bind
= gimple_build_bind (BIND_EXPR_VARS (bind_expr
), NULL
,
1260 BIND_EXPR_BLOCK (bind_expr
));
1261 gimple_push_bind_expr (gimple_bind
);
1263 gimplify_ctxp
->save_stack
= false;
1265 /* Gimplify the body into the GIMPLE_BIND tuple's body. */
1267 gimplify_stmt (&BIND_EXPR_BODY (bind_expr
), &body
);
1268 gimple_bind_set_body (gimple_bind
, body
);
1270 if (gimplify_ctxp
->save_stack
)
1272 gimple stack_save
, stack_restore
, gs
;
1273 gimple_seq cleanup
, new_body
;
1275 /* Save stack on entry and restore it on exit. Add a try_finally
1276 block to achieve this. Note that mudflap depends on the
1277 format of the emitted code: see mx_register_decls(). */
1278 build_stack_save_restore (&stack_save
, &stack_restore
);
1280 cleanup
= new_body
= NULL
;
1281 gimplify_seq_add_stmt (&cleanup
, stack_restore
);
1282 gs
= gimple_build_try (gimple_bind_body (gimple_bind
), cleanup
,
1283 GIMPLE_TRY_FINALLY
);
1285 gimplify_seq_add_stmt (&new_body
, stack_save
);
1286 gimplify_seq_add_stmt (&new_body
, gs
);
1287 gimple_bind_set_body (gimple_bind
, new_body
);
1290 gimplify_ctxp
->save_stack
= old_save_stack
;
1291 gimple_pop_bind_expr ();
1293 gimplify_seq_add_stmt (pre_p
, gimple_bind
);
1301 *expr_p
= NULL_TREE
;
1305 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1306 GIMPLE value, it is assigned to a new temporary and the statement is
1307 re-written to return the temporary.
1309 PRE_P points to the sequence where side effects that must happen before
1310 STMT should be stored. */
1312 static enum gimplify_status
1313 gimplify_return_expr (tree stmt
, gimple_seq
*pre_p
)
1316 tree ret_expr
= TREE_OPERAND (stmt
, 0);
1317 tree result_decl
, result
;
1319 if (ret_expr
== error_mark_node
)
1323 || TREE_CODE (ret_expr
) == RESULT_DECL
1324 || ret_expr
== error_mark_node
)
1326 gimple ret
= gimple_build_return (ret_expr
);
1327 gimple_set_no_warning (ret
, TREE_NO_WARNING (stmt
));
1328 gimplify_seq_add_stmt (pre_p
, ret
);
1332 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
1333 result_decl
= NULL_TREE
;
1336 result_decl
= TREE_OPERAND (ret_expr
, 0);
1338 /* See through a return by reference. */
1339 if (TREE_CODE (result_decl
) == INDIRECT_REF
)
1340 result_decl
= TREE_OPERAND (result_decl
, 0);
1342 gcc_assert ((TREE_CODE (ret_expr
) == MODIFY_EXPR
1343 || TREE_CODE (ret_expr
) == INIT_EXPR
)
1344 && TREE_CODE (result_decl
) == RESULT_DECL
);
1347 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1348 Recall that aggregate_value_p is FALSE for any aggregate type that is
1349 returned in registers. If we're returning values in registers, then
1350 we don't want to extend the lifetime of the RESULT_DECL, particularly
1351 across another call. In addition, for those aggregates for which
1352 hard_function_value generates a PARALLEL, we'll die during normal
1353 expansion of structure assignments; there's special code in expand_return
1354 to handle this case that does not exist in expand_expr. */
1356 || aggregate_value_p (result_decl
, TREE_TYPE (current_function_decl
)))
1357 result
= result_decl
;
1358 else if (gimplify_ctxp
->return_temp
)
1359 result
= gimplify_ctxp
->return_temp
;
1362 result
= create_tmp_var (TREE_TYPE (result_decl
), NULL
);
1363 if (TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
1364 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
1365 DECL_GIMPLE_REG_P (result
) = 1;
1367 /* ??? With complex control flow (usually involving abnormal edges),
1368 we can wind up warning about an uninitialized value for this. Due
1369 to how this variable is constructed and initialized, this is never
1370 true. Give up and never warn. */
1371 TREE_NO_WARNING (result
) = 1;
1373 gimplify_ctxp
->return_temp
= result
;
1376 /* Smash the lhs of the MODIFY_EXPR to the temporary we plan to use.
1377 Then gimplify the whole thing. */
1378 if (result
!= result_decl
)
1379 TREE_OPERAND (ret_expr
, 0) = result
;
1381 gimplify_and_add (TREE_OPERAND (stmt
, 0), pre_p
);
1383 ret
= gimple_build_return (result
);
1384 gimple_set_no_warning (ret
, TREE_NO_WARNING (stmt
));
1385 gimplify_seq_add_stmt (pre_p
, ret
);
1391 gimplify_vla_decl (tree decl
, gimple_seq
*seq_p
)
1393 /* This is a variable-sized decl. Simplify its size and mark it
1394 for deferred expansion. Note that mudflap depends on the format
1395 of the emitted code: see mx_register_decls(). */
1396 tree t
, addr
, ptr_type
;
1398 gimplify_one_sizepos (&DECL_SIZE (decl
), seq_p
);
1399 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl
), seq_p
);
1401 /* All occurrences of this decl in final gimplified code will be
1402 replaced by indirection. Setting DECL_VALUE_EXPR does two
1403 things: First, it lets the rest of the gimplifier know what
1404 replacement to use. Second, it lets the debug info know
1405 where to find the value. */
1406 ptr_type
= build_pointer_type (TREE_TYPE (decl
));
1407 addr
= create_tmp_var (ptr_type
, get_name (decl
));
1408 DECL_IGNORED_P (addr
) = 0;
1409 t
= build_fold_indirect_ref (addr
);
1410 SET_DECL_VALUE_EXPR (decl
, t
);
1411 DECL_HAS_VALUE_EXPR_P (decl
) = 1;
1413 t
= built_in_decls
[BUILT_IN_ALLOCA
];
1414 t
= build_call_expr (t
, 1, DECL_SIZE_UNIT (decl
));
1415 t
= fold_convert (ptr_type
, t
);
1416 t
= build2 (MODIFY_EXPR
, TREE_TYPE (addr
), addr
, t
);
1418 gimplify_and_add (t
, seq_p
);
1420 /* Indicate that we need to restore the stack level when the
1421 enclosing BIND_EXPR is exited. */
1422 gimplify_ctxp
->save_stack
= true;
1426 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
1427 and initialization explicit. */
1429 static enum gimplify_status
1430 gimplify_decl_expr (tree
*stmt_p
, gimple_seq
*seq_p
)
1432 tree stmt
= *stmt_p
;
1433 tree decl
= DECL_EXPR_DECL (stmt
);
1435 *stmt_p
= NULL_TREE
;
1437 if (TREE_TYPE (decl
) == error_mark_node
)
1440 if ((TREE_CODE (decl
) == TYPE_DECL
1441 || TREE_CODE (decl
) == VAR_DECL
)
1442 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl
)))
1443 gimplify_type_sizes (TREE_TYPE (decl
), seq_p
);
1445 if (TREE_CODE (decl
) == VAR_DECL
&& !DECL_EXTERNAL (decl
))
1447 tree init
= DECL_INITIAL (decl
);
1449 if (TREE_CODE (DECL_SIZE_UNIT (decl
)) != INTEGER_CST
1450 || (!TREE_STATIC (decl
)
1451 && flag_stack_check
== GENERIC_STACK_CHECK
1452 && compare_tree_int (DECL_SIZE_UNIT (decl
),
1453 STACK_CHECK_MAX_VAR_SIZE
) > 0))
1454 gimplify_vla_decl (decl
, seq_p
);
1456 if (init
&& init
!= error_mark_node
)
1458 if (!TREE_STATIC (decl
))
1460 DECL_INITIAL (decl
) = NULL_TREE
;
1461 init
= build2 (INIT_EXPR
, void_type_node
, decl
, init
);
1462 gimplify_and_add (init
, seq_p
);
1466 /* We must still examine initializers for static variables
1467 as they may contain a label address. */
1468 walk_tree (&init
, force_labels_r
, NULL
, NULL
);
1471 /* Some front ends do not explicitly declare all anonymous
1472 artificial variables. We compensate here by declaring the
1473 variables, though it would be better if the front ends would
1474 explicitly declare them. */
1475 if (!DECL_SEEN_IN_BIND_EXPR_P (decl
)
1476 && DECL_ARTIFICIAL (decl
) && DECL_NAME (decl
) == NULL_TREE
)
1477 gimple_add_tmp_var (decl
);
1483 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1484 and replacing the LOOP_EXPR with goto, but if the loop contains an
1485 EXIT_EXPR, we need to append a label for it to jump to. */
1487 static enum gimplify_status
1488 gimplify_loop_expr (tree
*expr_p
, gimple_seq
*pre_p
)
1490 tree saved_label
= gimplify_ctxp
->exit_label
;
1491 tree start_label
= create_artificial_label ();
1493 gimplify_seq_add_stmt (pre_p
, gimple_build_label (start_label
));
1495 gimplify_ctxp
->exit_label
= NULL_TREE
;
1497 gimplify_and_add (LOOP_EXPR_BODY (*expr_p
), pre_p
);
1499 gimplify_seq_add_stmt (pre_p
, gimple_build_goto (start_label
));
1501 if (gimplify_ctxp
->exit_label
)
1502 gimplify_seq_add_stmt (pre_p
, gimple_build_label (gimplify_ctxp
->exit_label
));
1504 gimplify_ctxp
->exit_label
= saved_label
;
1510 /* Gimplifies a statement list onto a sequence. These may be created either
1511 by an enlightened front-end, or by shortcut_cond_expr. */
1513 static enum gimplify_status
1514 gimplify_statement_list (tree
*expr_p
, gimple_seq
*pre_p
)
1516 tree temp
= voidify_wrapper_expr (*expr_p
, NULL
);
1518 tree_stmt_iterator i
= tsi_start (*expr_p
);
1520 while (!tsi_end_p (i
))
1522 gimplify_stmt (tsi_stmt_ptr (i
), pre_p
);
1535 /* Compare two case labels. Because the front end should already have
1536 made sure that case ranges do not overlap, it is enough to only compare
1537 the CASE_LOW values of each case label. */
1540 compare_case_labels (const void *p1
, const void *p2
)
1542 const_tree
const case1
= *(const_tree
const*)p1
;
1543 const_tree
const case2
= *(const_tree
const*)p2
;
1545 /* The 'default' case label always goes first. */
1546 if (!CASE_LOW (case1
))
1548 else if (!CASE_LOW (case2
))
1551 return tree_int_cst_compare (CASE_LOW (case1
), CASE_LOW (case2
));
1555 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1558 sort_case_labels (VEC(tree
,heap
)* label_vec
)
1560 size_t len
= VEC_length (tree
, label_vec
);
1561 qsort (VEC_address (tree
, label_vec
), len
, sizeof (tree
),
1562 compare_case_labels
);
1566 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1569 static enum gimplify_status
1570 gimplify_switch_expr (tree
*expr_p
, gimple_seq
*pre_p
)
1572 tree switch_expr
= *expr_p
;
1573 gimple_seq switch_body_seq
= NULL
;
1574 enum gimplify_status ret
;
1576 ret
= gimplify_expr (&SWITCH_COND (switch_expr
), pre_p
, NULL
, is_gimple_val
,
1578 if (ret
== GS_ERROR
|| ret
== GS_UNHANDLED
)
1581 if (SWITCH_BODY (switch_expr
))
1583 VEC (tree
,heap
) *labels
;
1584 VEC (tree
,heap
) *saved_labels
;
1585 tree default_case
= NULL_TREE
;
1587 gimple gimple_switch
;
1589 /* If someone can be bothered to fill in the labels, they can
1590 be bothered to null out the body too. */
1591 gcc_assert (!SWITCH_LABELS (switch_expr
));
1593 /* save old labels, get new ones from body, then restore the old
1594 labels. Save all the things from the switch body to append after. */
1595 saved_labels
= gimplify_ctxp
->case_labels
;
1596 gimplify_ctxp
->case_labels
= VEC_alloc (tree
, heap
, 8);
1598 gimplify_stmt (&SWITCH_BODY (switch_expr
), &switch_body_seq
);
1599 labels
= gimplify_ctxp
->case_labels
;
1600 gimplify_ctxp
->case_labels
= saved_labels
;
1603 while (i
< VEC_length (tree
, labels
))
1605 tree elt
= VEC_index (tree
, labels
, i
);
1606 tree low
= CASE_LOW (elt
);
1607 bool remove_element
= FALSE
;
1611 /* Discard empty ranges. */
1612 tree high
= CASE_HIGH (elt
);
1613 if (high
&& tree_int_cst_lt (high
, low
))
1614 remove_element
= TRUE
;
1618 /* The default case must be the last label in the list. */
1619 gcc_assert (!default_case
);
1621 remove_element
= TRUE
;
1625 VEC_ordered_remove (tree
, labels
, i
);
1631 if (!VEC_empty (tree
, labels
))
1632 sort_case_labels (labels
);
1636 tree type
= TREE_TYPE (switch_expr
);
1638 /* If the switch has no default label, add one, so that we jump
1639 around the switch body. If the labels already cover the whole
1640 range of type, add the default label pointing to one of the
1642 if (type
== void_type_node
)
1643 type
= TREE_TYPE (SWITCH_COND (switch_expr
));
1645 && INTEGRAL_TYPE_P (type
)
1646 && TYPE_MIN_VALUE (type
)
1647 && TYPE_MAX_VALUE (type
)
1648 && tree_int_cst_equal (CASE_LOW (VEC_index (tree
, labels
, 0)),
1649 TYPE_MIN_VALUE (type
)))
1651 tree low
, high
= CASE_HIGH (VEC_index (tree
, labels
, len
- 1));
1653 high
= CASE_LOW (VEC_index (tree
, labels
, len
- 1));
1654 if (tree_int_cst_equal (high
, TYPE_MAX_VALUE (type
)))
1656 for (i
= 1; i
< len
; i
++)
1658 high
= CASE_LOW (VEC_index (tree
, labels
, i
));
1659 low
= CASE_HIGH (VEC_index (tree
, labels
, i
- 1));
1661 low
= CASE_LOW (VEC_index (tree
, labels
, i
- 1));
1662 if ((TREE_INT_CST_LOW (low
) + 1
1663 != TREE_INT_CST_LOW (high
))
1664 || (TREE_INT_CST_HIGH (low
)
1665 + (TREE_INT_CST_LOW (high
) == 0)
1666 != TREE_INT_CST_HIGH (high
)))
1670 default_case
= build3 (CASE_LABEL_EXPR
, void_type_node
,
1671 NULL_TREE
, NULL_TREE
,
1672 CASE_LABEL (VEC_index (tree
,
1681 default_case
= build3 (CASE_LABEL_EXPR
, void_type_node
,
1682 NULL_TREE
, NULL_TREE
,
1683 create_artificial_label ());
1684 new_default
= gimple_build_label (CASE_LABEL (default_case
));
1685 gimplify_seq_add_stmt (&switch_body_seq
, new_default
);
1689 gimple_switch
= gimple_build_switch_vec (SWITCH_COND (switch_expr
),
1690 default_case
, labels
);
1691 gimplify_seq_add_stmt (pre_p
, gimple_switch
);
1692 gimplify_seq_add_seq (pre_p
, switch_body_seq
);
1693 VEC_free(tree
, heap
, labels
);
1696 gcc_assert (SWITCH_LABELS (switch_expr
));
1702 static enum gimplify_status
1703 gimplify_case_label_expr (tree
*expr_p
, gimple_seq
*pre_p
)
1705 struct gimplify_ctx
*ctxp
;
1706 gimple gimple_label
;
1708 /* Invalid OpenMP programs can play Duff's Device type games with
1709 #pragma omp parallel. At least in the C front end, we don't
1710 detect such invalid branches until after gimplification. */
1711 for (ctxp
= gimplify_ctxp
; ; ctxp
= ctxp
->prev_context
)
1712 if (ctxp
->case_labels
)
1715 gimple_label
= gimple_build_label (CASE_LABEL (*expr_p
));
1716 VEC_safe_push (tree
, heap
, ctxp
->case_labels
, *expr_p
);
1717 gimplify_seq_add_stmt (pre_p
, gimple_label
);
1722 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1726 build_and_jump (tree
*label_p
)
1728 if (label_p
== NULL
)
1729 /* If there's nowhere to jump, just fall through. */
1732 if (*label_p
== NULL_TREE
)
1734 tree label
= create_artificial_label ();
1738 return build1 (GOTO_EXPR
, void_type_node
, *label_p
);
1741 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1742 This also involves building a label to jump to and communicating it to
1743 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1745 static enum gimplify_status
1746 gimplify_exit_expr (tree
*expr_p
)
1748 tree cond
= TREE_OPERAND (*expr_p
, 0);
1751 expr
= build_and_jump (&gimplify_ctxp
->exit_label
);
1752 expr
= build3 (COND_EXPR
, void_type_node
, cond
, expr
, NULL_TREE
);
1758 /* A helper function to be called via walk_tree. Mark all labels under *TP
1759 as being forced. To be called for DECL_INITIAL of static variables. */
1762 force_labels_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
1766 if (TREE_CODE (*tp
) == LABEL_DECL
)
1767 FORCED_LABEL (*tp
) = 1;
1772 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1773 different from its canonical type, wrap the whole thing inside a
1774 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1777 The canonical type of a COMPONENT_REF is the type of the field being
1778 referenced--unless the field is a bit-field which can be read directly
1779 in a smaller mode, in which case the canonical type is the
1780 sign-appropriate type corresponding to that mode. */
1783 canonicalize_component_ref (tree
*expr_p
)
1785 tree expr
= *expr_p
;
1788 gcc_assert (TREE_CODE (expr
) == COMPONENT_REF
);
1790 if (INTEGRAL_TYPE_P (TREE_TYPE (expr
)))
1791 type
= TREE_TYPE (get_unwidened (expr
, NULL_TREE
));
1793 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
1795 /* One could argue that all the stuff below is not necessary for
1796 the non-bitfield case and declare it a FE error if type
1797 adjustment would be needed. */
1798 if (TREE_TYPE (expr
) != type
)
1800 #ifdef ENABLE_TYPES_CHECKING
1801 tree old_type
= TREE_TYPE (expr
);
1805 /* We need to preserve qualifiers and propagate them from
1807 type_quals
= TYPE_QUALS (type
)
1808 | TYPE_QUALS (TREE_TYPE (TREE_OPERAND (expr
, 0)));
1809 if (TYPE_QUALS (type
) != type_quals
)
1810 type
= build_qualified_type (TYPE_MAIN_VARIANT (type
), type_quals
);
1812 /* Set the type of the COMPONENT_REF to the underlying type. */
1813 TREE_TYPE (expr
) = type
;
1815 #ifdef ENABLE_TYPES_CHECKING
1816 /* It is now a FE error, if the conversion from the canonical
1817 type to the original expression type is not useless. */
1818 gcc_assert (useless_type_conversion_p (old_type
, type
));
1823 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1824 to foo, embed that change in the ADDR_EXPR by converting
1829 where L is the lower bound. For simplicity, only do this for constant
1831 The constraint is that the type of &array[L] is trivially convertible
1835 canonicalize_addr_expr (tree
*expr_p
)
1837 tree expr
= *expr_p
;
1838 tree addr_expr
= TREE_OPERAND (expr
, 0);
1839 tree datype
, ddatype
, pddatype
;
1841 /* We simplify only conversions from an ADDR_EXPR to a pointer type. */
1842 if (!POINTER_TYPE_P (TREE_TYPE (expr
))
1843 || TREE_CODE (addr_expr
) != ADDR_EXPR
)
1846 /* The addr_expr type should be a pointer to an array. */
1847 datype
= TREE_TYPE (TREE_TYPE (addr_expr
));
1848 if (TREE_CODE (datype
) != ARRAY_TYPE
)
1851 /* The pointer to element type shall be trivially convertible to
1852 the expression pointer type. */
1853 ddatype
= TREE_TYPE (datype
);
1854 pddatype
= build_pointer_type (ddatype
);
1855 if (!useless_type_conversion_p (pddatype
, ddatype
))
1858 /* The lower bound and element sizes must be constant. */
1859 if (!TYPE_SIZE_UNIT (ddatype
)
1860 || TREE_CODE (TYPE_SIZE_UNIT (ddatype
)) != INTEGER_CST
1861 || !TYPE_DOMAIN (datype
) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))
1862 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))) != INTEGER_CST
)
1865 /* All checks succeeded. Build a new node to merge the cast. */
1866 *expr_p
= build4 (ARRAY_REF
, ddatype
, TREE_OPERAND (addr_expr
, 0),
1867 TYPE_MIN_VALUE (TYPE_DOMAIN (datype
)),
1868 NULL_TREE
, NULL_TREE
);
1869 *expr_p
= build1 (ADDR_EXPR
, pddatype
, *expr_p
);
1872 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1873 underneath as appropriate. */
1875 static enum gimplify_status
1876 gimplify_conversion (tree
*expr_p
)
1879 gcc_assert (CONVERT_EXPR_P (*expr_p
));
1881 /* Then strip away all but the outermost conversion. */
1882 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p
, 0));
1884 /* And remove the outermost conversion if it's useless. */
1885 if (tree_ssa_useless_type_conversion (*expr_p
))
1886 *expr_p
= TREE_OPERAND (*expr_p
, 0);
1888 /* Attempt to avoid NOP_EXPR by producing reference to a subtype.
1889 For example this fold (subclass *)&A into &A->subclass avoiding
1890 a need for statement. */
1891 if (CONVERT_EXPR_P (*expr_p
)
1892 && POINTER_TYPE_P (TREE_TYPE (*expr_p
))
1893 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p
, 0)))
1894 && (tem
= maybe_fold_offset_to_address
1895 (TREE_OPERAND (*expr_p
, 0),
1896 integer_zero_node
, TREE_TYPE (*expr_p
))) != NULL_TREE
)
1899 /* If we still have a conversion at the toplevel,
1900 then canonicalize some constructs. */
1901 if (CONVERT_EXPR_P (*expr_p
))
1903 tree sub
= TREE_OPERAND (*expr_p
, 0);
1905 /* If a NOP conversion is changing the type of a COMPONENT_REF
1906 expression, then canonicalize its type now in order to expose more
1907 redundant conversions. */
1908 if (TREE_CODE (sub
) == COMPONENT_REF
)
1909 canonicalize_component_ref (&TREE_OPERAND (*expr_p
, 0));
1911 /* If a NOP conversion is changing a pointer to array of foo
1912 to a pointer to foo, embed that change in the ADDR_EXPR. */
1913 else if (TREE_CODE (sub
) == ADDR_EXPR
)
1914 canonicalize_addr_expr (expr_p
);
1917 /* If we have a conversion to a non-register type force the
1918 use of a VIEW_CONVERT_EXPR instead. */
1919 if (CONVERT_EXPR_P (*expr_p
) && !is_gimple_reg_type (TREE_TYPE (*expr_p
)))
1920 *expr_p
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (*expr_p
),
1921 TREE_OPERAND (*expr_p
, 0));
1926 /* Gimplify a VAR_DECL or PARM_DECL. Returns GS_OK if we expanded a
1927 DECL_VALUE_EXPR, and it's worth re-examining things. */
1929 static enum gimplify_status
1930 gimplify_var_or_parm_decl (tree
*expr_p
)
1932 tree decl
= *expr_p
;
1934 /* ??? If this is a local variable, and it has not been seen in any
1935 outer BIND_EXPR, then it's probably the result of a duplicate
1936 declaration, for which we've already issued an error. It would
1937 be really nice if the front end wouldn't leak these at all.
1938 Currently the only known culprit is C++ destructors, as seen
1939 in g++.old-deja/g++.jason/binding.C. */
1940 if (TREE_CODE (decl
) == VAR_DECL
1941 && !DECL_SEEN_IN_BIND_EXPR_P (decl
)
1942 && !TREE_STATIC (decl
) && !DECL_EXTERNAL (decl
)
1943 && decl_function_context (decl
) == current_function_decl
)
1945 gcc_assert (errorcount
|| sorrycount
);
1949 /* When within an OpenMP context, notice uses of variables. */
1950 if (gimplify_omp_ctxp
&& omp_notice_variable (gimplify_omp_ctxp
, decl
, true))
1953 /* If the decl is an alias for another expression, substitute it now. */
1954 if (DECL_HAS_VALUE_EXPR_P (decl
))
1956 *expr_p
= unshare_expr (DECL_VALUE_EXPR (decl
));
1964 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1968 : min_lval '[' val ']'
1970 | compound_lval '[' val ']'
1971 | compound_lval '.' ID
1973 This is not part of the original SIMPLE definition, which separates
1974 array and member references, but it seems reasonable to handle them
1975 together. Also, this way we don't run into problems with union
1976 aliasing; gcc requires that for accesses through a union to alias, the
1977 union reference must be explicit, which was not always the case when we
1978 were splitting up array and member refs.
1980 PRE_P points to the sequence where side effects that must happen before
1981 *EXPR_P should be stored.
1983 POST_P points to the sequence where side effects that must happen after
1984 *EXPR_P should be stored. */
1986 static enum gimplify_status
1987 gimplify_compound_lval (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
1988 fallback_t fallback
)
1991 VEC(tree
,heap
) *stack
;
1992 enum gimplify_status ret
= GS_OK
, tret
;
1995 /* Create a stack of the subexpressions so later we can walk them in
1996 order from inner to outer. */
1997 stack
= VEC_alloc (tree
, heap
, 10);
1999 /* We can handle anything that get_inner_reference can deal with. */
2000 for (p
= expr_p
; ; p
= &TREE_OPERAND (*p
, 0))
2003 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
2004 if (TREE_CODE (*p
) == INDIRECT_REF
)
2005 *p
= fold_indirect_ref (*p
);
2007 if (handled_component_p (*p
))
2009 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
2010 additional COMPONENT_REFs. */
2011 else if ((TREE_CODE (*p
) == VAR_DECL
|| TREE_CODE (*p
) == PARM_DECL
)
2012 && gimplify_var_or_parm_decl (p
) == GS_OK
)
2017 VEC_safe_push (tree
, heap
, stack
, *p
);
2020 gcc_assert (VEC_length (tree
, stack
));
2022 /* Now STACK is a stack of pointers to all the refs we've walked through
2023 and P points to the innermost expression.
2025 Java requires that we elaborated nodes in source order. That
2026 means we must gimplify the inner expression followed by each of
2027 the indices, in order. But we can't gimplify the inner
2028 expression until we deal with any variable bounds, sizes, or
2029 positions in order to deal with PLACEHOLDER_EXPRs.
2031 So we do this in three steps. First we deal with the annotations
2032 for any variables in the components, then we gimplify the base,
2033 then we gimplify any indices, from left to right. */
2034 for (i
= VEC_length (tree
, stack
) - 1; i
>= 0; i
--)
2036 tree t
= VEC_index (tree
, stack
, i
);
2038 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
2040 /* Gimplify the low bound and element type size and put them into
2041 the ARRAY_REF. If these values are set, they have already been
2043 if (TREE_OPERAND (t
, 2) == NULL_TREE
)
2045 tree low
= unshare_expr (array_ref_low_bound (t
));
2046 if (!is_gimple_min_invariant (low
))
2048 TREE_OPERAND (t
, 2) = low
;
2049 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
,
2050 post_p
, is_gimple_formal_tmp_reg
,
2052 ret
= MIN (ret
, tret
);
2056 if (!TREE_OPERAND (t
, 3))
2058 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (t
, 0)));
2059 tree elmt_size
= unshare_expr (array_ref_element_size (t
));
2060 tree factor
= size_int (TYPE_ALIGN_UNIT (elmt_type
));
2062 /* Divide the element size by the alignment of the element
2064 elmt_size
= size_binop (EXACT_DIV_EXPR
, elmt_size
, factor
);
2066 if (!is_gimple_min_invariant (elmt_size
))
2068 TREE_OPERAND (t
, 3) = elmt_size
;
2069 tret
= gimplify_expr (&TREE_OPERAND (t
, 3), pre_p
,
2070 post_p
, is_gimple_formal_tmp_reg
,
2072 ret
= MIN (ret
, tret
);
2076 else if (TREE_CODE (t
) == COMPONENT_REF
)
2078 /* Set the field offset into T and gimplify it. */
2079 if (!TREE_OPERAND (t
, 2))
2081 tree offset
= unshare_expr (component_ref_field_offset (t
));
2082 tree field
= TREE_OPERAND (t
, 1);
2084 = size_int (DECL_OFFSET_ALIGN (field
) / BITS_PER_UNIT
);
2086 /* Divide the offset by its alignment. */
2087 offset
= size_binop (EXACT_DIV_EXPR
, offset
, factor
);
2089 if (!is_gimple_min_invariant (offset
))
2091 TREE_OPERAND (t
, 2) = offset
;
2092 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
,
2093 post_p
, is_gimple_formal_tmp_reg
,
2095 ret
= MIN (ret
, tret
);
2101 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
2102 so as to match the min_lval predicate. Failure to do so may result
2103 in the creation of large aggregate temporaries. */
2104 tret
= gimplify_expr (p
, pre_p
, post_p
, is_gimple_min_lval
,
2105 fallback
| fb_lvalue
);
2106 ret
= MIN (ret
, tret
);
2108 /* And finally, the indices and operands to BIT_FIELD_REF. During this
2109 loop we also remove any useless conversions. */
2110 for (; VEC_length (tree
, stack
) > 0; )
2112 tree t
= VEC_pop (tree
, stack
);
2114 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
2116 /* Gimplify the dimension.
2117 Temporary fix for gcc.c-torture/execute/20040313-1.c.
2118 Gimplify non-constant array indices into a temporary
2120 FIXME - The real fix is to gimplify post-modify
2121 expressions into a minimal gimple lvalue. However, that
2122 exposes bugs in alias analysis. The alias analyzer does
2123 not handle &PTR->FIELD very well. Will fix after the
2124 branch is merged into mainline (dnovillo 2004-05-03). */
2125 if (!is_gimple_min_invariant (TREE_OPERAND (t
, 1)))
2127 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), pre_p
, post_p
,
2128 is_gimple_formal_tmp_reg
, fb_rvalue
);
2129 ret
= MIN (ret
, tret
);
2132 else if (TREE_CODE (t
) == BIT_FIELD_REF
)
2134 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), pre_p
, post_p
,
2135 is_gimple_val
, fb_rvalue
);
2136 ret
= MIN (ret
, tret
);
2137 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
2138 is_gimple_val
, fb_rvalue
);
2139 ret
= MIN (ret
, tret
);
2142 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t
, 0));
2144 /* The innermost expression P may have originally had
2145 TREE_SIDE_EFFECTS set which would have caused all the outer
2146 expressions in *EXPR_P leading to P to also have had
2147 TREE_SIDE_EFFECTS set. */
2148 recalculate_side_effects (t
);
2151 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
2152 if ((fallback
& fb_rvalue
) && TREE_CODE (*expr_p
) == COMPONENT_REF
)
2154 canonicalize_component_ref (expr_p
);
2155 ret
= MIN (ret
, GS_OK
);
2158 VEC_free (tree
, heap
, stack
);
2163 /* Gimplify the self modifying expression pointed to by EXPR_P
2166 PRE_P points to the list where side effects that must happen before
2167 *EXPR_P should be stored.
2169 POST_P points to the list where side effects that must happen after
2170 *EXPR_P should be stored.
2172 WANT_VALUE is nonzero iff we want to use the value of this expression
2173 in another expression. */
2175 static enum gimplify_status
2176 gimplify_self_mod_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
2179 enum tree_code code
;
2180 tree lhs
, lvalue
, rhs
, t1
;
2181 gimple_seq post
= NULL
, *orig_post_p
= post_p
;
2183 enum tree_code arith_code
;
2184 enum gimplify_status ret
;
2186 code
= TREE_CODE (*expr_p
);
2188 gcc_assert (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
2189 || code
== PREINCREMENT_EXPR
|| code
== PREDECREMENT_EXPR
);
2191 /* Prefix or postfix? */
2192 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
2193 /* Faster to treat as prefix if result is not used. */
2194 postfix
= want_value
;
2198 /* For postfix, make sure the inner expression's post side effects
2199 are executed after side effects from this expression. */
2203 /* Add or subtract? */
2204 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
2205 arith_code
= PLUS_EXPR
;
2207 arith_code
= MINUS_EXPR
;
2209 /* Gimplify the LHS into a GIMPLE lvalue. */
2210 lvalue
= TREE_OPERAND (*expr_p
, 0);
2211 ret
= gimplify_expr (&lvalue
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
2212 if (ret
== GS_ERROR
)
2215 /* Extract the operands to the arithmetic operation. */
2217 rhs
= TREE_OPERAND (*expr_p
, 1);
2219 /* For postfix operator, we evaluate the LHS to an rvalue and then use
2220 that as the result value and in the postqueue operation. */
2223 ret
= gimplify_expr (&lhs
, pre_p
, post_p
, is_gimple_val
, fb_rvalue
);
2224 if (ret
== GS_ERROR
)
2228 /* For POINTERs increment, use POINTER_PLUS_EXPR. */
2229 if (POINTER_TYPE_P (TREE_TYPE (lhs
)))
2231 rhs
= fold_convert (sizetype
, rhs
);
2232 if (arith_code
== MINUS_EXPR
)
2233 rhs
= fold_build1 (NEGATE_EXPR
, TREE_TYPE (rhs
), rhs
);
2234 arith_code
= POINTER_PLUS_EXPR
;
2237 t1
= build2 (arith_code
, TREE_TYPE (*expr_p
), lhs
, rhs
);
2241 gimplify_assign (lvalue
, t1
, orig_post_p
);
2242 gimplify_seq_add_seq (orig_post_p
, post
);
2248 *expr_p
= build2 (MODIFY_EXPR
, TREE_TYPE (lvalue
), lvalue
, t1
);
2254 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
2257 maybe_with_size_expr (tree
*expr_p
)
2259 tree expr
= *expr_p
;
2260 tree type
= TREE_TYPE (expr
);
2263 /* If we've already wrapped this or the type is error_mark_node, we can't do
2265 if (TREE_CODE (expr
) == WITH_SIZE_EXPR
2266 || type
== error_mark_node
)
2269 /* If the size isn't known or is a constant, we have nothing to do. */
2270 size
= TYPE_SIZE_UNIT (type
);
2271 if (!size
|| TREE_CODE (size
) == INTEGER_CST
)
2274 /* Otherwise, make a WITH_SIZE_EXPR. */
2275 size
= unshare_expr (size
);
2276 size
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (size
, expr
);
2277 *expr_p
= build2 (WITH_SIZE_EXPR
, type
, expr
, size
);
2281 /* Helper for gimplify_call_expr. Gimplify a single argument *ARG_P
2282 Store any side-effects in PRE_P. CALL_LOCATION is the location of
2285 static enum gimplify_status
2286 gimplify_arg (tree
*arg_p
, gimple_seq
*pre_p
, location_t call_location
)
2288 bool (*test
) (tree
);
2291 /* In general, we allow lvalues for function arguments to avoid
2292 extra overhead of copying large aggregates out of even larger
2293 aggregates into temporaries only to copy the temporaries to
2294 the argument list. Make optimizers happy by pulling out to
2295 temporaries those types that fit in registers. */
2296 if (is_gimple_reg_type (TREE_TYPE (*arg_p
)))
2297 test
= is_gimple_val
, fb
= fb_rvalue
;
2299 test
= is_gimple_lvalue
, fb
= fb_either
;
2301 /* If this is a variable sized type, we must remember the size. */
2302 maybe_with_size_expr (arg_p
);
2304 /* Make sure arguments have the same location as the function call
2306 protected_set_expr_location (*arg_p
, call_location
);
2308 /* There is a sequence point before a function call. Side effects in
2309 the argument list must occur before the actual call. So, when
2310 gimplifying arguments, force gimplify_expr to use an internal
2311 post queue which is then appended to the end of PRE_P. */
2312 return gimplify_expr (arg_p
, pre_p
, NULL
, test
, fb
);
2316 /* Gimplify the CALL_EXPR node *EXPR_P into the GIMPLE sequence PRE_P.
2317 WANT_VALUE is true if the result of the call is desired. */
2319 static enum gimplify_status
2320 gimplify_call_expr (tree
*expr_p
, gimple_seq
*pre_p
, bool want_value
)
2322 tree fndecl
, parms
, p
;
2323 enum gimplify_status ret
;
2326 bool builtin_va_start_p
= FALSE
;
2328 gcc_assert (TREE_CODE (*expr_p
) == CALL_EXPR
);
2330 /* For reliable diagnostics during inlining, it is necessary that
2331 every call_expr be annotated with file and line. */
2332 if (! EXPR_HAS_LOCATION (*expr_p
))
2333 SET_EXPR_LOCATION (*expr_p
, input_location
);
2335 /* This may be a call to a builtin function.
2337 Builtin function calls may be transformed into different
2338 (and more efficient) builtin function calls under certain
2339 circumstances. Unfortunately, gimplification can muck things
2340 up enough that the builtin expanders are not aware that certain
2341 transformations are still valid.
2343 So we attempt transformation/gimplification of the call before
2344 we gimplify the CALL_EXPR. At this time we do not manage to
2345 transform all calls in the same manner as the expanders do, but
2346 we do transform most of them. */
2347 fndecl
= get_callee_fndecl (*expr_p
);
2348 if (fndecl
&& DECL_BUILT_IN (fndecl
))
2350 tree new_tree
= fold_call_expr (*expr_p
, !want_value
);
2352 if (new_tree
&& new_tree
!= *expr_p
)
2354 /* There was a transformation of this call which computes the
2355 same value, but in a more efficient way. Return and try
2361 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
2362 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_VA_START
)
2364 builtin_va_start_p
= TRUE
;
2365 if (call_expr_nargs (*expr_p
) < 2)
2367 error ("too few arguments to function %<va_start%>");
2368 *expr_p
= build_empty_stmt ();
2372 if (fold_builtin_next_arg (*expr_p
, true))
2374 *expr_p
= build_empty_stmt ();
2380 /* There is a sequence point before the call, so any side effects in
2381 the calling expression must occur before the actual call. Force
2382 gimplify_expr to use an internal post queue. */
2383 ret
= gimplify_expr (&CALL_EXPR_FN (*expr_p
), pre_p
, NULL
,
2384 is_gimple_call_addr
, fb_rvalue
);
2386 nargs
= call_expr_nargs (*expr_p
);
2388 /* Get argument types for verification. */
2389 fndecl
= get_callee_fndecl (*expr_p
);
2392 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
2393 else if (POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_FN (*expr_p
))))
2394 parms
= TYPE_ARG_TYPES (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (*expr_p
))));
2396 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
2397 p
= DECL_ARGUMENTS (fndecl
);
2402 for (i
= 0; i
< nargs
&& p
; i
++, p
= TREE_CHAIN (p
))
2405 /* If the last argument is __builtin_va_arg_pack () and it is not
2406 passed as a named argument, decrease the number of CALL_EXPR
2407 arguments and set instead the CALL_EXPR_VA_ARG_PACK flag. */
2410 && TREE_CODE (CALL_EXPR_ARG (*expr_p
, nargs
- 1)) == CALL_EXPR
)
2412 tree last_arg
= CALL_EXPR_ARG (*expr_p
, nargs
- 1);
2413 tree last_arg_fndecl
= get_callee_fndecl (last_arg
);
2416 && TREE_CODE (last_arg_fndecl
) == FUNCTION_DECL
2417 && DECL_BUILT_IN_CLASS (last_arg_fndecl
) == BUILT_IN_NORMAL
2418 && DECL_FUNCTION_CODE (last_arg_fndecl
) == BUILT_IN_VA_ARG_PACK
)
2420 tree call
= *expr_p
;
2423 *expr_p
= build_call_array (TREE_TYPE (call
), CALL_EXPR_FN (call
),
2424 nargs
, CALL_EXPR_ARGP (call
));
2426 /* Copy all CALL_EXPR flags, location and block, except
2427 CALL_EXPR_VA_ARG_PACK flag. */
2428 CALL_EXPR_STATIC_CHAIN (*expr_p
) = CALL_EXPR_STATIC_CHAIN (call
);
2429 CALL_EXPR_TAILCALL (*expr_p
) = CALL_EXPR_TAILCALL (call
);
2430 CALL_EXPR_RETURN_SLOT_OPT (*expr_p
)
2431 = CALL_EXPR_RETURN_SLOT_OPT (call
);
2432 CALL_FROM_THUNK_P (*expr_p
) = CALL_FROM_THUNK_P (call
);
2433 CALL_CANNOT_INLINE_P (*expr_p
) = CALL_CANNOT_INLINE_P (call
);
2434 SET_EXPR_LOCUS (*expr_p
, EXPR_LOCUS (call
));
2435 TREE_BLOCK (*expr_p
) = TREE_BLOCK (call
);
2437 /* Set CALL_EXPR_VA_ARG_PACK. */
2438 CALL_EXPR_VA_ARG_PACK (*expr_p
) = 1;
2442 /* Finally, gimplify the function arguments. */
2445 for (i
= (PUSH_ARGS_REVERSED
? nargs
- 1 : 0);
2446 PUSH_ARGS_REVERSED
? i
>= 0 : i
< nargs
;
2447 PUSH_ARGS_REVERSED
? i
-- : i
++)
2449 enum gimplify_status t
;
2451 /* Avoid gimplifying the second argument to va_start, which needs to
2452 be the plain PARM_DECL. */
2453 if ((i
!= 1) || !builtin_va_start_p
)
2455 t
= gimplify_arg (&CALL_EXPR_ARG (*expr_p
, i
), pre_p
,
2456 EXPR_LOCATION (*expr_p
));
2464 /* Try this again in case gimplification exposed something. */
2465 if (ret
!= GS_ERROR
)
2467 tree new_tree
= fold_call_expr (*expr_p
, !want_value
);
2469 if (new_tree
&& new_tree
!= *expr_p
)
2471 /* There was a transformation of this call which computes the
2472 same value, but in a more efficient way. Return and try
2480 *expr_p
= error_mark_node
;
2484 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2485 decl. This allows us to eliminate redundant or useless
2486 calls to "const" functions. */
2487 if (TREE_CODE (*expr_p
) == CALL_EXPR
)
2489 int flags
= call_expr_flags (*expr_p
);
2490 if (flags
& (ECF_CONST
| ECF_PURE
)
2491 /* An infinite loop is considered a side effect. */
2492 && !(flags
& (ECF_LOOPING_CONST_OR_PURE
)))
2493 TREE_SIDE_EFFECTS (*expr_p
) = 0;
2496 /* If the value is not needed by the caller, emit a new GIMPLE_CALL
2497 and clear *EXPR_P. Otherwise, leave *EXPR_P in its gimplified
2498 form and delegate the creation of a GIMPLE_CALL to
2499 gimplify_modify_expr. This is always possible because when
2500 WANT_VALUE is true, the caller wants the result of this call into
2501 a temporary, which means that we will emit an INIT_EXPR in
2502 internal_get_tmp_var which will then be handled by
2503 gimplify_modify_expr. */
2506 /* The CALL_EXPR in *EXPR_P is already in GIMPLE form, so all we
2507 have to do is replicate it as a GIMPLE_CALL tuple. */
2508 call
= gimple_build_call_from_tree (*expr_p
);
2509 gimplify_seq_add_stmt (pre_p
, call
);
2510 *expr_p
= NULL_TREE
;
2516 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2517 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2519 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2520 condition is true or false, respectively. If null, we should generate
2521 our own to skip over the evaluation of this specific expression.
2523 This function is the tree equivalent of do_jump.
2525 shortcut_cond_r should only be called by shortcut_cond_expr. */
2528 shortcut_cond_r (tree pred
, tree
*true_label_p
, tree
*false_label_p
)
2530 tree local_label
= NULL_TREE
;
2531 tree t
, expr
= NULL
;
2533 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2534 retain the shortcut semantics. Just insert the gotos here;
2535 shortcut_cond_expr will append the real blocks later. */
2536 if (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2538 /* Turn if (a && b) into
2540 if (a); else goto no;
2541 if (b) goto yes; else goto no;
2544 if (false_label_p
== NULL
)
2545 false_label_p
= &local_label
;
2547 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), NULL
, false_label_p
);
2548 append_to_statement_list (t
, &expr
);
2550 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2552 append_to_statement_list (t
, &expr
);
2554 else if (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2556 /* Turn if (a || b) into
2559 if (b) goto yes; else goto no;
2562 if (true_label_p
== NULL
)
2563 true_label_p
= &local_label
;
2565 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), true_label_p
, NULL
);
2566 append_to_statement_list (t
, &expr
);
2568 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2570 append_to_statement_list (t
, &expr
);
2572 else if (TREE_CODE (pred
) == COND_EXPR
)
2574 /* As long as we're messing with gotos, turn if (a ? b : c) into
2576 if (b) goto yes; else goto no;
2578 if (c) goto yes; else goto no; */
2579 expr
= build3 (COND_EXPR
, void_type_node
, TREE_OPERAND (pred
, 0),
2580 shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2582 shortcut_cond_r (TREE_OPERAND (pred
, 2), true_label_p
,
2587 expr
= build3 (COND_EXPR
, void_type_node
, pred
,
2588 build_and_jump (true_label_p
),
2589 build_and_jump (false_label_p
));
2594 t
= build1 (LABEL_EXPR
, void_type_node
, local_label
);
2595 append_to_statement_list (t
, &expr
);
2601 /* Given a conditional expression EXPR with short-circuit boolean
2602 predicates using TRUTH_ANDIF_EXPR or TRUTH_ORIF_EXPR, break the
2603 predicate appart into the equivalent sequence of conditionals. */
2606 shortcut_cond_expr (tree expr
)
2608 tree pred
= TREE_OPERAND (expr
, 0);
2609 tree then_
= TREE_OPERAND (expr
, 1);
2610 tree else_
= TREE_OPERAND (expr
, 2);
2611 tree true_label
, false_label
, end_label
, t
;
2613 tree
*false_label_p
;
2614 bool emit_end
, emit_false
, jump_over_else
;
2615 bool then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2616 bool else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2618 /* First do simple transformations. */
2621 /* If there is no 'else', turn (a && b) into if (a) if (b). */
2622 while (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2624 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2625 then_
= shortcut_cond_expr (expr
);
2626 then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2627 pred
= TREE_OPERAND (pred
, 0);
2628 expr
= build3 (COND_EXPR
, void_type_node
, pred
, then_
, NULL_TREE
);
2634 /* If there is no 'then', turn
2637 if (a); else if (b); else d. */
2638 while (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2640 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2641 else_
= shortcut_cond_expr (expr
);
2642 else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2643 pred
= TREE_OPERAND (pred
, 0);
2644 expr
= build3 (COND_EXPR
, void_type_node
, pred
, NULL_TREE
, else_
);
2648 /* If we're done, great. */
2649 if (TREE_CODE (pred
) != TRUTH_ANDIF_EXPR
2650 && TREE_CODE (pred
) != TRUTH_ORIF_EXPR
)
2653 /* Otherwise we need to mess with gotos. Change
2656 if (a); else goto no;
2659 and recursively gimplify the condition. */
2661 true_label
= false_label
= end_label
= NULL_TREE
;
2663 /* If our arms just jump somewhere, hijack those labels so we don't
2664 generate jumps to jumps. */
2667 && TREE_CODE (then_
) == GOTO_EXPR
2668 && TREE_CODE (GOTO_DESTINATION (then_
)) == LABEL_DECL
)
2670 true_label
= GOTO_DESTINATION (then_
);
2676 && TREE_CODE (else_
) == GOTO_EXPR
2677 && TREE_CODE (GOTO_DESTINATION (else_
)) == LABEL_DECL
)
2679 false_label
= GOTO_DESTINATION (else_
);
2684 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2686 true_label_p
= &true_label
;
2688 true_label_p
= NULL
;
2690 /* The 'else' branch also needs a label if it contains interesting code. */
2691 if (false_label
|| else_se
)
2692 false_label_p
= &false_label
;
2694 false_label_p
= NULL
;
2696 /* If there was nothing else in our arms, just forward the label(s). */
2697 if (!then_se
&& !else_se
)
2698 return shortcut_cond_r (pred
, true_label_p
, false_label_p
);
2700 /* If our last subexpression already has a terminal label, reuse it. */
2702 expr
= expr_last (else_
);
2704 expr
= expr_last (then_
);
2707 if (expr
&& TREE_CODE (expr
) == LABEL_EXPR
)
2708 end_label
= LABEL_EXPR_LABEL (expr
);
2710 /* If we don't care about jumping to the 'else' branch, jump to the end
2711 if the condition is false. */
2713 false_label_p
= &end_label
;
2715 /* We only want to emit these labels if we aren't hijacking them. */
2716 emit_end
= (end_label
== NULL_TREE
);
2717 emit_false
= (false_label
== NULL_TREE
);
2719 /* We only emit the jump over the else clause if we have to--if the
2720 then clause may fall through. Otherwise we can wind up with a
2721 useless jump and a useless label at the end of gimplified code,
2722 which will cause us to think that this conditional as a whole
2723 falls through even if it doesn't. If we then inline a function
2724 which ends with such a condition, that can cause us to issue an
2725 inappropriate warning about control reaching the end of a
2726 non-void function. */
2727 jump_over_else
= block_may_fallthru (then_
);
2729 pred
= shortcut_cond_r (pred
, true_label_p
, false_label_p
);
2732 append_to_statement_list (pred
, &expr
);
2734 append_to_statement_list (then_
, &expr
);
2739 t
= build_and_jump (&end_label
);
2740 append_to_statement_list (t
, &expr
);
2744 t
= build1 (LABEL_EXPR
, void_type_node
, false_label
);
2745 append_to_statement_list (t
, &expr
);
2747 append_to_statement_list (else_
, &expr
);
2749 if (emit_end
&& end_label
)
2751 t
= build1 (LABEL_EXPR
, void_type_node
, end_label
);
2752 append_to_statement_list (t
, &expr
);
2758 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2761 gimple_boolify (tree expr
)
2763 tree type
= TREE_TYPE (expr
);
2765 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
2768 switch (TREE_CODE (expr
))
2770 case TRUTH_AND_EXPR
:
2772 case TRUTH_XOR_EXPR
:
2773 case TRUTH_ANDIF_EXPR
:
2774 case TRUTH_ORIF_EXPR
:
2775 /* Also boolify the arguments of truth exprs. */
2776 TREE_OPERAND (expr
, 1) = gimple_boolify (TREE_OPERAND (expr
, 1));
2779 case TRUTH_NOT_EXPR
:
2780 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
2783 case EQ_EXPR
: case NE_EXPR
:
2784 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
2785 /* These expressions always produce boolean results. */
2786 TREE_TYPE (expr
) = boolean_type_node
;
2790 /* Other expressions that get here must have boolean values, but
2791 might need to be converted to the appropriate mode. */
2792 return fold_convert (boolean_type_node
, expr
);
2796 /* Given a conditional expression *EXPR_P without side effects, gimplify
2797 its operands. New statements are inserted to PRE_P. */
2799 static enum gimplify_status
2800 gimplify_pure_cond_expr (tree
*expr_p
, gimple_seq
*pre_p
)
2802 tree expr
= *expr_p
, cond
;
2803 enum gimplify_status ret
, tret
;
2804 enum tree_code code
;
2806 cond
= gimple_boolify (COND_EXPR_COND (expr
));
2808 /* We need to handle && and || specially, as their gimplification
2809 creates pure cond_expr, thus leading to an infinite cycle otherwise. */
2810 code
= TREE_CODE (cond
);
2811 if (code
== TRUTH_ANDIF_EXPR
)
2812 TREE_SET_CODE (cond
, TRUTH_AND_EXPR
);
2813 else if (code
== TRUTH_ORIF_EXPR
)
2814 TREE_SET_CODE (cond
, TRUTH_OR_EXPR
);
2815 ret
= gimplify_expr (&cond
, pre_p
, NULL
, is_gimple_condexpr
, fb_rvalue
);
2816 COND_EXPR_COND (*expr_p
) = cond
;
2818 tret
= gimplify_expr (&COND_EXPR_THEN (expr
), pre_p
, NULL
,
2819 is_gimple_val
, fb_rvalue
);
2820 ret
= MIN (ret
, tret
);
2821 tret
= gimplify_expr (&COND_EXPR_ELSE (expr
), pre_p
, NULL
,
2822 is_gimple_val
, fb_rvalue
);
2824 return MIN (ret
, tret
);
2827 /* Returns true if evaluating EXPR could trap.
2828 EXPR is GENERIC, while tree_could_trap_p can be called
2832 generic_expr_could_trap_p (tree expr
)
2836 if (!expr
|| is_gimple_val (expr
))
2839 if (!EXPR_P (expr
) || tree_could_trap_p (expr
))
2842 n
= TREE_OPERAND_LENGTH (expr
);
2843 for (i
= 0; i
< n
; i
++)
2844 if (generic_expr_could_trap_p (TREE_OPERAND (expr
, i
)))
2850 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2859 The second form is used when *EXPR_P is of type void.
2861 PRE_P points to the list where side effects that must happen before
2862 *EXPR_P should be stored. */
2864 static enum gimplify_status
2865 gimplify_cond_expr (tree
*expr_p
, gimple_seq
*pre_p
, fallback_t fallback
)
2867 tree expr
= *expr_p
;
2868 tree tmp
, type
, arm1
, arm2
;
2869 enum gimplify_status ret
;
2870 tree label_true
, label_false
, label_cont
;
2871 bool have_then_clause_p
, have_else_clause_p
;
2873 enum tree_code pred_code
;
2874 gimple_seq seq
= NULL
;
2876 type
= TREE_TYPE (expr
);
2878 /* If this COND_EXPR has a value, copy the values into a temporary within
2880 if (! VOID_TYPE_P (type
))
2884 /* If an rvalue is ok or we do not require an lvalue, avoid creating
2885 an addressable temporary. */
2886 if (((fallback
& fb_rvalue
)
2887 || !(fallback
& fb_lvalue
))
2888 && !TREE_ADDRESSABLE (type
))
2890 if (gimplify_ctxp
->allow_rhs_cond_expr
2891 /* If either branch has side effects or could trap, it can't be
2892 evaluated unconditionally. */
2893 && !TREE_SIDE_EFFECTS (TREE_OPERAND (*expr_p
, 1))
2894 && !generic_expr_could_trap_p (TREE_OPERAND (*expr_p
, 1))
2895 && !TREE_SIDE_EFFECTS (TREE_OPERAND (*expr_p
, 2))
2896 && !generic_expr_could_trap_p (TREE_OPERAND (*expr_p
, 2)))
2897 return gimplify_pure_cond_expr (expr_p
, pre_p
);
2899 result
= tmp
= create_tmp_var (TREE_TYPE (expr
), "iftmp");
2904 tree type
= build_pointer_type (TREE_TYPE (expr
));
2906 if (TREE_TYPE (TREE_OPERAND (expr
, 1)) != void_type_node
)
2907 TREE_OPERAND (expr
, 1) =
2908 build_fold_addr_expr (TREE_OPERAND (expr
, 1));
2910 if (TREE_TYPE (TREE_OPERAND (expr
, 2)) != void_type_node
)
2911 TREE_OPERAND (expr
, 2) =
2912 build_fold_addr_expr (TREE_OPERAND (expr
, 2));
2914 tmp
= create_tmp_var (type
, "iftmp");
2916 expr
= build3 (COND_EXPR
, void_type_node
, TREE_OPERAND (expr
, 0),
2917 TREE_OPERAND (expr
, 1), TREE_OPERAND (expr
, 2));
2919 result
= build_fold_indirect_ref (tmp
);
2922 /* Build the then clause, 't1 = a;'. But don't build an assignment
2923 if this branch is void; in C++ it can be, if it's a throw. */
2924 if (TREE_TYPE (TREE_OPERAND (expr
, 1)) != void_type_node
)
2925 TREE_OPERAND (expr
, 1)
2926 = build2 (MODIFY_EXPR
, TREE_TYPE (tmp
), tmp
, TREE_OPERAND (expr
, 1));
2928 /* Build the else clause, 't1 = b;'. */
2929 if (TREE_TYPE (TREE_OPERAND (expr
, 2)) != void_type_node
)
2930 TREE_OPERAND (expr
, 2)
2931 = build2 (MODIFY_EXPR
, TREE_TYPE (tmp
), tmp
, TREE_OPERAND (expr
, 2));
2933 TREE_TYPE (expr
) = void_type_node
;
2934 recalculate_side_effects (expr
);
2936 /* Move the COND_EXPR to the prequeue. */
2937 gimplify_stmt (&expr
, pre_p
);
2943 /* Make sure the condition has BOOLEAN_TYPE. */
2944 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
2946 /* Break apart && and || conditions. */
2947 if (TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ANDIF_EXPR
2948 || TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ORIF_EXPR
)
2950 expr
= shortcut_cond_expr (expr
);
2952 if (expr
!= *expr_p
)
2956 /* We can't rely on gimplify_expr to re-gimplify the expanded
2957 form properly, as cleanups might cause the target labels to be
2958 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2959 set up a conditional context. */
2960 gimple_push_condition ();
2961 gimplify_stmt (expr_p
, &seq
);
2962 gimple_pop_condition (pre_p
);
2963 gimple_seq_add_seq (pre_p
, seq
);
2969 /* Now do the normal gimplification. */
2971 /* Gimplify condition. */
2972 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, NULL
, is_gimple_condexpr
,
2974 if (ret
== GS_ERROR
)
2976 gcc_assert (TREE_OPERAND (expr
, 0) != NULL_TREE
);
2978 gimple_push_condition ();
2980 have_then_clause_p
= have_else_clause_p
= false;
2981 if (TREE_OPERAND (expr
, 1) != NULL
2982 && TREE_CODE (TREE_OPERAND (expr
, 1)) == GOTO_EXPR
2983 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr
, 1))) == LABEL_DECL
2984 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr
, 1)))
2985 == current_function_decl
)
2986 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
2987 have different locations, otherwise we end up with incorrect
2988 location information on the branches. */
2990 || !EXPR_HAS_LOCATION (expr
)
2991 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr
, 1))
2992 || EXPR_LOCATION (expr
) == EXPR_LOCATION (TREE_OPERAND (expr
, 1))))
2994 label_true
= GOTO_DESTINATION (TREE_OPERAND (expr
, 1));
2995 have_then_clause_p
= true;
2998 label_true
= create_artificial_label ();
2999 if (TREE_OPERAND (expr
, 2) != NULL
3000 && TREE_CODE (TREE_OPERAND (expr
, 2)) == GOTO_EXPR
3001 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr
, 2))) == LABEL_DECL
3002 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr
, 2)))
3003 == current_function_decl
)
3004 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
3005 have different locations, otherwise we end up with incorrect
3006 location information on the branches. */
3008 || !EXPR_HAS_LOCATION (expr
)
3009 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr
, 2))
3010 || EXPR_LOCATION (expr
) == EXPR_LOCATION (TREE_OPERAND (expr
, 2))))
3012 label_false
= GOTO_DESTINATION (TREE_OPERAND (expr
, 2));
3013 have_else_clause_p
= true;
3016 label_false
= create_artificial_label ();
3018 gimple_cond_get_ops_from_tree (COND_EXPR_COND (expr
), &pred_code
, &arm1
,
3021 gimple_cond
= gimple_build_cond (pred_code
, arm1
, arm2
, label_true
,
3024 gimplify_seq_add_stmt (&seq
, gimple_cond
);
3025 label_cont
= NULL_TREE
;
3026 if (!have_then_clause_p
)
3028 /* For if (...) {} else { code; } put label_true after
3030 if (TREE_OPERAND (expr
, 1) == NULL_TREE
3031 && !have_else_clause_p
3032 && TREE_OPERAND (expr
, 2) != NULL_TREE
)
3033 label_cont
= label_true
;
3036 gimplify_seq_add_stmt (&seq
, gimple_build_label (label_true
));
3037 have_then_clause_p
= gimplify_stmt (&TREE_OPERAND (expr
, 1), &seq
);
3038 /* For if (...) { code; } else {} or
3039 if (...) { code; } else goto label; or
3040 if (...) { code; return; } else { ... }
3041 label_cont isn't needed. */
3042 if (!have_else_clause_p
3043 && TREE_OPERAND (expr
, 2) != NULL_TREE
3044 && gimple_seq_may_fallthru (seq
))
3047 label_cont
= create_artificial_label ();
3049 g
= gimple_build_goto (label_cont
);
3051 /* GIMPLE_COND's are very low level; they have embedded
3052 gotos. This particular embedded goto should not be marked
3053 with the location of the original COND_EXPR, as it would
3054 correspond to the COND_EXPR's condition, not the ELSE or the
3055 THEN arms. To avoid marking it with the wrong location, flag
3056 it as "no location". */
3057 gimple_set_do_not_emit_location (g
);
3059 gimplify_seq_add_stmt (&seq
, g
);
3063 if (!have_else_clause_p
)
3065 gimplify_seq_add_stmt (&seq
, gimple_build_label (label_false
));
3066 have_else_clause_p
= gimplify_stmt (&TREE_OPERAND (expr
, 2), &seq
);
3069 gimplify_seq_add_stmt (&seq
, gimple_build_label (label_cont
));
3071 gimple_pop_condition (pre_p
);
3072 gimple_seq_add_seq (pre_p
, seq
);
3074 if (ret
== GS_ERROR
)
3076 else if (have_then_clause_p
|| have_else_clause_p
)
3080 /* Both arms are empty; replace the COND_EXPR with its predicate. */
3081 expr
= TREE_OPERAND (expr
, 0);
3082 gimplify_stmt (&expr
, pre_p
);
3089 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3090 a call to __builtin_memcpy. */
3092 static enum gimplify_status
3093 gimplify_modify_expr_to_memcpy (tree
*expr_p
, tree size
, bool want_value
,
3096 tree t
, to
, to_ptr
, from
, from_ptr
;
3099 to
= TREE_OPERAND (*expr_p
, 0);
3100 from
= TREE_OPERAND (*expr_p
, 1);
3102 from_ptr
= build_fold_addr_expr (from
);
3103 gimplify_arg (&from_ptr
, seq_p
, EXPR_LOCATION (*expr_p
));
3105 to_ptr
= build_fold_addr_expr (to
);
3106 gimplify_arg (&to_ptr
, seq_p
, EXPR_LOCATION (*expr_p
));
3108 t
= implicit_built_in_decls
[BUILT_IN_MEMCPY
];
3110 gs
= gimple_build_call (t
, 3, to_ptr
, from_ptr
, size
);
3114 /* tmp = memcpy() */
3115 t
= create_tmp_var (TREE_TYPE (to_ptr
), NULL
);
3116 gimple_call_set_lhs (gs
, t
);
3117 gimplify_seq_add_stmt (seq_p
, gs
);
3119 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
3123 gimplify_seq_add_stmt (seq_p
, gs
);
3128 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3129 a call to __builtin_memset. In this case we know that the RHS is
3130 a CONSTRUCTOR with an empty element list. */
3132 static enum gimplify_status
3133 gimplify_modify_expr_to_memset (tree
*expr_p
, tree size
, bool want_value
,
3136 tree t
, from
, to
, to_ptr
;
3139 /* Assert our assumptions, to abort instead of producing wrong code
3140 silently if they are not met. Beware that the RHS CONSTRUCTOR might
3141 not be immediately exposed. */
3142 from
= TREE_OPERAND (*expr_p
, 1);
3143 if (TREE_CODE (from
) == WITH_SIZE_EXPR
)
3144 from
= TREE_OPERAND (from
, 0);
3146 gcc_assert (TREE_CODE (from
) == CONSTRUCTOR
3147 && VEC_empty (constructor_elt
, CONSTRUCTOR_ELTS (from
)));
3150 to
= TREE_OPERAND (*expr_p
, 0);
3152 to_ptr
= build_fold_addr_expr (to
);
3153 gimplify_arg (&to_ptr
, seq_p
, EXPR_LOCATION (*expr_p
));
3154 t
= implicit_built_in_decls
[BUILT_IN_MEMSET
];
3156 gs
= gimple_build_call (t
, 3, to_ptr
, integer_zero_node
, size
);
3160 /* tmp = memset() */
3161 t
= create_tmp_var (TREE_TYPE (to_ptr
), NULL
);
3162 gimple_call_set_lhs (gs
, t
);
3163 gimplify_seq_add_stmt (seq_p
, gs
);
3165 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
3169 gimplify_seq_add_stmt (seq_p
, gs
);
3174 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
3175 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
3176 assignment. Returns non-null if we detect a potential overlap. */
3178 struct gimplify_init_ctor_preeval_data
3180 /* The base decl of the lhs object. May be NULL, in which case we
3181 have to assume the lhs is indirect. */
3184 /* The alias set of the lhs object. */
3185 alias_set_type lhs_alias_set
;
3189 gimplify_init_ctor_preeval_1 (tree
*tp
, int *walk_subtrees
, void *xdata
)
3191 struct gimplify_init_ctor_preeval_data
*data
3192 = (struct gimplify_init_ctor_preeval_data
*) xdata
;
3195 /* If we find the base object, obviously we have overlap. */
3196 if (data
->lhs_base_decl
== t
)
3199 /* If the constructor component is indirect, determine if we have a
3200 potential overlap with the lhs. The only bits of information we
3201 have to go on at this point are addressability and alias sets. */
3202 if (TREE_CODE (t
) == INDIRECT_REF
3203 && (!data
->lhs_base_decl
|| TREE_ADDRESSABLE (data
->lhs_base_decl
))
3204 && alias_sets_conflict_p (data
->lhs_alias_set
, get_alias_set (t
)))
3207 /* If the constructor component is a call, determine if it can hide a
3208 potential overlap with the lhs through an INDIRECT_REF like above. */
3209 if (TREE_CODE (t
) == CALL_EXPR
)
3211 tree type
, fntype
= TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (t
)));
3213 for (type
= TYPE_ARG_TYPES (fntype
); type
; type
= TREE_CHAIN (type
))
3214 if (POINTER_TYPE_P (TREE_VALUE (type
))
3215 && (!data
->lhs_base_decl
|| TREE_ADDRESSABLE (data
->lhs_base_decl
))
3216 && alias_sets_conflict_p (data
->lhs_alias_set
,
3218 (TREE_TYPE (TREE_VALUE (type
)))))
3222 if (IS_TYPE_OR_DECL_P (t
))
3227 /* A subroutine of gimplify_init_constructor. Pre-evaluate EXPR,
3228 force values that overlap with the lhs (as described by *DATA)
3229 into temporaries. */
3232 gimplify_init_ctor_preeval (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
3233 struct gimplify_init_ctor_preeval_data
*data
)
3235 enum gimplify_status one
;
3237 /* If the value is constant, then there's nothing to pre-evaluate. */
3238 if (TREE_CONSTANT (*expr_p
))
3240 /* Ensure it does not have side effects, it might contain a reference to
3241 the object we're initializing. */
3242 gcc_assert (!TREE_SIDE_EFFECTS (*expr_p
));
3246 /* If the type has non-trivial constructors, we can't pre-evaluate. */
3247 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p
)))
3250 /* Recurse for nested constructors. */
3251 if (TREE_CODE (*expr_p
) == CONSTRUCTOR
)
3253 unsigned HOST_WIDE_INT ix
;
3254 constructor_elt
*ce
;
3255 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (*expr_p
);
3257 for (ix
= 0; VEC_iterate (constructor_elt
, v
, ix
, ce
); ix
++)
3258 gimplify_init_ctor_preeval (&ce
->value
, pre_p
, post_p
, data
);
3263 /* If this is a variable sized type, we must remember the size. */
3264 maybe_with_size_expr (expr_p
);
3266 /* Gimplify the constructor element to something appropriate for the rhs
3267 of a MODIFY_EXPR. Given that we know the LHS is an aggregate, we know
3268 the gimplifier will consider this a store to memory. Doing this
3269 gimplification now means that we won't have to deal with complicated
3270 language-specific trees, nor trees like SAVE_EXPR that can induce
3271 exponential search behavior. */
3272 one
= gimplify_expr (expr_p
, pre_p
, post_p
, is_gimple_mem_rhs
, fb_rvalue
);
3273 if (one
== GS_ERROR
)
3279 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
3280 with the lhs, since "a = { .x=a }" doesn't make sense. This will
3281 always be true for all scalars, since is_gimple_mem_rhs insists on a
3282 temporary variable for them. */
3283 if (DECL_P (*expr_p
))
3286 /* If this is of variable size, we have no choice but to assume it doesn't
3287 overlap since we can't make a temporary for it. */
3288 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (*expr_p
))) != INTEGER_CST
)
3291 /* Otherwise, we must search for overlap ... */
3292 if (!walk_tree (expr_p
, gimplify_init_ctor_preeval_1
, data
, NULL
))
3295 /* ... and if found, force the value into a temporary. */
3296 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
3299 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
3300 a RANGE_EXPR in a CONSTRUCTOR for an array.
3304 object[var] = value;
3311 We increment var _after_ the loop exit check because we might otherwise
3312 fail if upper == TYPE_MAX_VALUE (type for upper).
3314 Note that we never have to deal with SAVE_EXPRs here, because this has
3315 already been taken care of for us, in gimplify_init_ctor_preeval(). */
3317 static void gimplify_init_ctor_eval (tree
, VEC(constructor_elt
,gc
) *,
3318 gimple_seq
*, bool);
3321 gimplify_init_ctor_eval_range (tree object
, tree lower
, tree upper
,
3322 tree value
, tree array_elt_type
,
3323 gimple_seq
*pre_p
, bool cleared
)
3325 tree loop_entry_label
, loop_exit_label
, fall_thru_label
;
3326 tree var
, var_type
, cref
, tmp
;
3328 loop_entry_label
= create_artificial_label ();
3329 loop_exit_label
= create_artificial_label ();
3330 fall_thru_label
= create_artificial_label ();
3332 /* Create and initialize the index variable. */
3333 var_type
= TREE_TYPE (upper
);
3334 var
= create_tmp_var (var_type
, NULL
);
3335 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (var
, lower
));
3337 /* Add the loop entry label. */
3338 gimplify_seq_add_stmt (pre_p
, gimple_build_label (loop_entry_label
));
3340 /* Build the reference. */
3341 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
3342 var
, NULL_TREE
, NULL_TREE
);
3344 /* If we are a constructor, just call gimplify_init_ctor_eval to do
3345 the store. Otherwise just assign value to the reference. */
3347 if (TREE_CODE (value
) == CONSTRUCTOR
)
3348 /* NB we might have to call ourself recursively through
3349 gimplify_init_ctor_eval if the value is a constructor. */
3350 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
3353 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (cref
, value
));
3355 /* We exit the loop when the index var is equal to the upper bound. */
3356 gimplify_seq_add_stmt (pre_p
,
3357 gimple_build_cond (EQ_EXPR
, var
, upper
,
3358 loop_exit_label
, fall_thru_label
));
3360 gimplify_seq_add_stmt (pre_p
, gimple_build_label (fall_thru_label
));
3362 /* Otherwise, increment the index var... */
3363 tmp
= build2 (PLUS_EXPR
, var_type
, var
,
3364 fold_convert (var_type
, integer_one_node
));
3365 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (var
, tmp
));
3367 /* ...and jump back to the loop entry. */
3368 gimplify_seq_add_stmt (pre_p
, gimple_build_goto (loop_entry_label
));
3370 /* Add the loop exit label. */
3371 gimplify_seq_add_stmt (pre_p
, gimple_build_label (loop_exit_label
));
3374 /* Return true if FDECL is accessing a field that is zero sized. */
3377 zero_sized_field_decl (const_tree fdecl
)
3379 if (TREE_CODE (fdecl
) == FIELD_DECL
&& DECL_SIZE (fdecl
)
3380 && integer_zerop (DECL_SIZE (fdecl
)))
3385 /* Return true if TYPE is zero sized. */
3388 zero_sized_type (const_tree type
)
3390 if (AGGREGATE_TYPE_P (type
) && TYPE_SIZE (type
)
3391 && integer_zerop (TYPE_SIZE (type
)))
3396 /* A subroutine of gimplify_init_constructor. Generate individual
3397 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
3398 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
3399 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
3403 gimplify_init_ctor_eval (tree object
, VEC(constructor_elt
,gc
) *elts
,
3404 gimple_seq
*pre_p
, bool cleared
)
3406 tree array_elt_type
= NULL
;
3407 unsigned HOST_WIDE_INT ix
;
3408 tree purpose
, value
;
3410 if (TREE_CODE (TREE_TYPE (object
)) == ARRAY_TYPE
)
3411 array_elt_type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object
)));
3413 FOR_EACH_CONSTRUCTOR_ELT (elts
, ix
, purpose
, value
)
3417 /* NULL values are created above for gimplification errors. */
3421 if (cleared
&& initializer_zerop (value
))
3424 /* ??? Here's to hoping the front end fills in all of the indices,
3425 so we don't have to figure out what's missing ourselves. */
3426 gcc_assert (purpose
);
3428 /* Skip zero-sized fields, unless value has side-effects. This can
3429 happen with calls to functions returning a zero-sized type, which
3430 we shouldn't discard. As a number of downstream passes don't
3431 expect sets of zero-sized fields, we rely on the gimplification of
3432 the MODIFY_EXPR we make below to drop the assignment statement. */
3433 if (! TREE_SIDE_EFFECTS (value
) && zero_sized_field_decl (purpose
))
3436 /* If we have a RANGE_EXPR, we have to build a loop to assign the
3438 if (TREE_CODE (purpose
) == RANGE_EXPR
)
3440 tree lower
= TREE_OPERAND (purpose
, 0);
3441 tree upper
= TREE_OPERAND (purpose
, 1);
3443 /* If the lower bound is equal to upper, just treat it as if
3444 upper was the index. */
3445 if (simple_cst_equal (lower
, upper
))
3449 gimplify_init_ctor_eval_range (object
, lower
, upper
, value
,
3450 array_elt_type
, pre_p
, cleared
);
3457 /* Do not use bitsizetype for ARRAY_REF indices. */
3458 if (TYPE_DOMAIN (TREE_TYPE (object
)))
3459 purpose
= fold_convert (TREE_TYPE (TYPE_DOMAIN (TREE_TYPE (object
))),
3461 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
3462 purpose
, NULL_TREE
, NULL_TREE
);
3466 gcc_assert (TREE_CODE (purpose
) == FIELD_DECL
);
3467 cref
= build3 (COMPONENT_REF
, TREE_TYPE (purpose
),
3468 unshare_expr (object
), purpose
, NULL_TREE
);
3471 if (TREE_CODE (value
) == CONSTRUCTOR
3472 && TREE_CODE (TREE_TYPE (value
)) != VECTOR_TYPE
)
3473 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
3477 tree init
= build2 (INIT_EXPR
, TREE_TYPE (cref
), cref
, value
);
3478 gimplify_and_add (init
, pre_p
);
3485 /* Returns the appropriate RHS predicate for this LHS. */
3488 rhs_predicate_for (tree lhs
)
3490 if (is_gimple_formal_tmp_var (lhs
))
3491 return is_gimple_formal_tmp_or_call_rhs
;
3492 else if (is_gimple_reg (lhs
))
3493 return is_gimple_reg_or_call_rhs
;
3495 return is_gimple_mem_or_call_rhs
;
3499 /* A subroutine of gimplify_modify_expr. Break out elements of a
3500 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
3502 Note that we still need to clear any elements that don't have explicit
3503 initializers, so if not all elements are initialized we keep the
3504 original MODIFY_EXPR, we just remove all of the constructor elements.
3506 If NOTIFY_TEMP_CREATION is true, do not gimplify, just return
3507 GS_ERROR if we would have to create a temporary when gimplifying
3508 this constructor. Otherwise, return GS_OK.
3510 If NOTIFY_TEMP_CREATION is false, just do the gimplification. */
3512 static enum gimplify_status
3513 gimplify_init_constructor (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
3514 bool want_value
, bool notify_temp_creation
)
3517 tree ctor
= TREE_OPERAND (*expr_p
, 1);
3518 tree type
= TREE_TYPE (ctor
);
3519 enum gimplify_status ret
;
3520 VEC(constructor_elt
,gc
) *elts
;
3522 if (TREE_CODE (ctor
) != CONSTRUCTOR
)
3523 return GS_UNHANDLED
;
3525 if (!notify_temp_creation
)
3527 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
3528 is_gimple_lvalue
, fb_lvalue
);
3529 if (ret
== GS_ERROR
)
3533 object
= TREE_OPERAND (*expr_p
, 0);
3534 elts
= CONSTRUCTOR_ELTS (ctor
);
3537 switch (TREE_CODE (type
))
3541 case QUAL_UNION_TYPE
:
3544 struct gimplify_init_ctor_preeval_data preeval_data
;
3545 HOST_WIDE_INT num_type_elements
, num_ctor_elements
;
3546 HOST_WIDE_INT num_nonzero_elements
;
3547 bool cleared
, valid_const_initializer
;
3549 /* Aggregate types must lower constructors to initialization of
3550 individual elements. The exception is that a CONSTRUCTOR node
3551 with no elements indicates zero-initialization of the whole. */
3552 if (VEC_empty (constructor_elt
, elts
))
3554 if (notify_temp_creation
)
3559 /* Fetch information about the constructor to direct later processing.
3560 We might want to make static versions of it in various cases, and
3561 can only do so if it known to be a valid constant initializer. */
3562 valid_const_initializer
3563 = categorize_ctor_elements (ctor
, &num_nonzero_elements
,
3564 &num_ctor_elements
, &cleared
);
3566 /* If a const aggregate variable is being initialized, then it
3567 should never be a lose to promote the variable to be static. */
3568 if (valid_const_initializer
3569 && num_nonzero_elements
> 1
3570 && TREE_READONLY (object
)
3571 && TREE_CODE (object
) == VAR_DECL
3572 && (flag_merge_constants
>= 2 || !TREE_ADDRESSABLE (object
)))
3574 if (notify_temp_creation
)
3576 DECL_INITIAL (object
) = ctor
;
3577 TREE_STATIC (object
) = 1;
3578 if (!DECL_NAME (object
))
3579 DECL_NAME (object
) = create_tmp_var_name ("C");
3580 walk_tree (&DECL_INITIAL (object
), force_labels_r
, NULL
, NULL
);
3582 /* ??? C++ doesn't automatically append a .<number> to the
3583 assembler name, and even when it does, it looks a FE private
3584 data structures to figure out what that number should be,
3585 which are not set for this variable. I suppose this is
3586 important for local statics for inline functions, which aren't
3587 "local" in the object file sense. So in order to get a unique
3588 TU-local symbol, we must invoke the lhd version now. */
3589 lhd_set_decl_assembler_name (object
);
3591 *expr_p
= NULL_TREE
;
3595 /* If there are "lots" of initialized elements, even discounting
3596 those that are not address constants (and thus *must* be
3597 computed at runtime), then partition the constructor into
3598 constant and non-constant parts. Block copy the constant
3599 parts in, then generate code for the non-constant parts. */
3600 /* TODO. There's code in cp/typeck.c to do this. */
3602 num_type_elements
= count_type_elements (type
, true);
3604 /* If count_type_elements could not determine number of type elements
3605 for a constant-sized object, assume clearing is needed.
3606 Don't do this for variable-sized objects, as store_constructor
3607 will ignore the clearing of variable-sized objects. */
3608 if (num_type_elements
< 0 && int_size_in_bytes (type
) >= 0)
3610 /* If there are "lots" of zeros, then block clear the object first. */
3611 else if (num_type_elements
- num_nonzero_elements
3612 > CLEAR_RATIO (optimize_function_for_speed_p (cfun
))
3613 && num_nonzero_elements
< num_type_elements
/4)
3615 /* ??? This bit ought not be needed. For any element not present
3616 in the initializer, we should simply set them to zero. Except
3617 we'd need to *find* the elements that are not present, and that
3618 requires trickery to avoid quadratic compile-time behavior in
3619 large cases or excessive memory use in small cases. */
3620 else if (num_ctor_elements
< num_type_elements
)
3623 /* If there are "lots" of initialized elements, and all of them
3624 are valid address constants, then the entire initializer can
3625 be dropped to memory, and then memcpy'd out. Don't do this
3626 for sparse arrays, though, as it's more efficient to follow
3627 the standard CONSTRUCTOR behavior of memset followed by
3628 individual element initialization. Also don't do this for small
3629 all-zero initializers (which aren't big enough to merit
3630 clearing), and don't try to make bitwise copies of
3631 TREE_ADDRESSABLE types. */
3632 if (valid_const_initializer
3633 && !(cleared
|| num_nonzero_elements
== 0)
3634 && !TREE_ADDRESSABLE (type
))
3636 HOST_WIDE_INT size
= int_size_in_bytes (type
);
3639 /* ??? We can still get unbounded array types, at least
3640 from the C++ front end. This seems wrong, but attempt
3641 to work around it for now. */
3644 size
= int_size_in_bytes (TREE_TYPE (object
));
3646 TREE_TYPE (ctor
) = type
= TREE_TYPE (object
);
3649 /* Find the maximum alignment we can assume for the object. */
3650 /* ??? Make use of DECL_OFFSET_ALIGN. */
3651 if (DECL_P (object
))
3652 align
= DECL_ALIGN (object
);
3654 align
= TYPE_ALIGN (type
);
3657 && num_nonzero_elements
> 1
3658 && !can_move_by_pieces (size
, align
))
3662 if (notify_temp_creation
)
3665 new_tree
= create_tmp_var_raw (type
, "C");
3667 gimple_add_tmp_var (new_tree
);
3668 TREE_STATIC (new_tree
) = 1;
3669 TREE_READONLY (new_tree
) = 1;
3670 DECL_INITIAL (new_tree
) = ctor
;
3671 if (align
> DECL_ALIGN (new_tree
))
3673 DECL_ALIGN (new_tree
) = align
;
3674 DECL_USER_ALIGN (new_tree
) = 1;
3676 walk_tree (&DECL_INITIAL (new_tree
), force_labels_r
, NULL
, NULL
);
3678 TREE_OPERAND (*expr_p
, 1) = new_tree
;
3680 /* This is no longer an assignment of a CONSTRUCTOR, but
3681 we still may have processing to do on the LHS. So
3682 pretend we didn't do anything here to let that happen. */
3683 return GS_UNHANDLED
;
3687 if (notify_temp_creation
)
3690 /* If there are nonzero elements, pre-evaluate to capture elements
3691 overlapping with the lhs into temporaries. We must do this before
3692 clearing to fetch the values before they are zeroed-out. */
3693 if (num_nonzero_elements
> 0)
3695 preeval_data
.lhs_base_decl
= get_base_address (object
);
3696 if (!DECL_P (preeval_data
.lhs_base_decl
))
3697 preeval_data
.lhs_base_decl
= NULL
;
3698 preeval_data
.lhs_alias_set
= get_alias_set (object
);
3700 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p
, 1),
3701 pre_p
, post_p
, &preeval_data
);
3706 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3707 Note that we still have to gimplify, in order to handle the
3708 case of variable sized types. Avoid shared tree structures. */
3709 CONSTRUCTOR_ELTS (ctor
) = NULL
;
3710 TREE_SIDE_EFFECTS (ctor
) = 0;
3711 object
= unshare_expr (object
);
3712 gimplify_stmt (expr_p
, pre_p
);
3715 /* If we have not block cleared the object, or if there are nonzero
3716 elements in the constructor, add assignments to the individual
3717 scalar fields of the object. */
3718 if (!cleared
|| num_nonzero_elements
> 0)
3719 gimplify_init_ctor_eval (object
, elts
, pre_p
, cleared
);
3721 *expr_p
= NULL_TREE
;
3729 if (notify_temp_creation
)
3732 /* Extract the real and imaginary parts out of the ctor. */
3733 gcc_assert (VEC_length (constructor_elt
, elts
) == 2);
3734 r
= VEC_index (constructor_elt
, elts
, 0)->value
;
3735 i
= VEC_index (constructor_elt
, elts
, 1)->value
;
3736 if (r
== NULL
|| i
== NULL
)
3738 tree zero
= fold_convert (TREE_TYPE (type
), integer_zero_node
);
3745 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3746 represent creation of a complex value. */
3747 if (TREE_CONSTANT (r
) && TREE_CONSTANT (i
))
3749 ctor
= build_complex (type
, r
, i
);
3750 TREE_OPERAND (*expr_p
, 1) = ctor
;
3754 ctor
= build2 (COMPLEX_EXPR
, type
, r
, i
);
3755 TREE_OPERAND (*expr_p
, 1) = ctor
;
3756 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1),
3759 rhs_predicate_for (TREE_OPERAND (*expr_p
, 0)),
3767 unsigned HOST_WIDE_INT ix
;
3768 constructor_elt
*ce
;
3770 if (notify_temp_creation
)
3773 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3774 if (TREE_CONSTANT (ctor
))
3776 bool constant_p
= true;
3779 /* Even when ctor is constant, it might contain non-*_CST
3780 elements, such as addresses or trapping values like
3781 1.0/0.0 - 1.0/0.0. Such expressions don't belong
3782 in VECTOR_CST nodes. */
3783 FOR_EACH_CONSTRUCTOR_VALUE (elts
, ix
, value
)
3784 if (!CONSTANT_CLASS_P (value
))
3792 TREE_OPERAND (*expr_p
, 1) = build_vector_from_ctor (type
, elts
);
3796 /* Don't reduce an initializer constant even if we can't
3797 make a VECTOR_CST. It won't do anything for us, and it'll
3798 prevent us from representing it as a single constant. */
3799 if (initializer_constant_valid_p (ctor
, type
))
3802 TREE_CONSTANT (ctor
) = 0;
3805 /* Vector types use CONSTRUCTOR all the way through gimple
3806 compilation as a general initializer. */
3807 for (ix
= 0; VEC_iterate (constructor_elt
, elts
, ix
, ce
); ix
++)
3809 enum gimplify_status tret
;
3810 tret
= gimplify_expr (&ce
->value
, pre_p
, post_p
, is_gimple_val
,
3812 if (tret
== GS_ERROR
)
3815 if (!is_gimple_reg (TREE_OPERAND (*expr_p
, 0)))
3816 TREE_OPERAND (*expr_p
, 1) = get_formal_tmp_var (ctor
, pre_p
);
3821 /* So how did we get a CONSTRUCTOR for a scalar type? */
3825 if (ret
== GS_ERROR
)
3827 else if (want_value
)
3834 /* If we have gimplified both sides of the initializer but have
3835 not emitted an assignment, do so now. */
3838 tree lhs
= TREE_OPERAND (*expr_p
, 0);
3839 tree rhs
= TREE_OPERAND (*expr_p
, 1);
3840 gimple init
= gimple_build_assign (lhs
, rhs
);
3841 gimplify_seq_add_stmt (pre_p
, init
);
3849 /* Given a pointer value OP0, return a simplified version of an
3850 indirection through OP0, or NULL_TREE if no simplification is
3851 possible. Note that the resulting type may be different from
3852 the type pointed to in the sense that it is still compatible
3853 from the langhooks point of view. */
3856 gimple_fold_indirect_ref (tree t
)
3858 tree type
= TREE_TYPE (TREE_TYPE (t
));
3862 STRIP_USELESS_TYPE_CONVERSION (sub
);
3863 subtype
= TREE_TYPE (sub
);
3864 if (!POINTER_TYPE_P (subtype
))
3867 if (TREE_CODE (sub
) == ADDR_EXPR
)
3869 tree op
= TREE_OPERAND (sub
, 0);
3870 tree optype
= TREE_TYPE (op
);
3872 if (useless_type_conversion_p (type
, optype
))
3875 /* *(foo *)&fooarray => fooarray[0] */
3876 if (TREE_CODE (optype
) == ARRAY_TYPE
3877 && useless_type_conversion_p (type
, TREE_TYPE (optype
)))
3879 tree type_domain
= TYPE_DOMAIN (optype
);
3880 tree min_val
= size_zero_node
;
3881 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
3882 min_val
= TYPE_MIN_VALUE (type_domain
);
3883 return build4 (ARRAY_REF
, type
, op
, min_val
, NULL_TREE
, NULL_TREE
);
3887 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
3888 if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
3889 && useless_type_conversion_p (type
, TREE_TYPE (TREE_TYPE (subtype
))))
3892 tree min_val
= size_zero_node
;
3894 sub
= gimple_fold_indirect_ref (sub
);
3896 sub
= build1 (INDIRECT_REF
, TREE_TYPE (subtype
), osub
);
3897 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
3898 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
3899 min_val
= TYPE_MIN_VALUE (type_domain
);
3900 return build4 (ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
, NULL_TREE
);
3906 /* Given a pointer value OP0, return a simplified version of an
3907 indirection through OP0, or NULL_TREE if no simplification is
3908 possible. This may only be applied to a rhs of an expression.
3909 Note that the resulting type may be different from the type pointed
3910 to in the sense that it is still compatible from the langhooks
3914 gimple_fold_indirect_ref_rhs (tree t
)
3916 return gimple_fold_indirect_ref (t
);
3919 /* Subroutine of gimplify_modify_expr to do simplifications of
3920 MODIFY_EXPRs based on the code of the RHS. We loop for as long as
3921 something changes. */
3923 static enum gimplify_status
3924 gimplify_modify_expr_rhs (tree
*expr_p
, tree
*from_p
, tree
*to_p
,
3925 gimple_seq
*pre_p
, gimple_seq
*post_p
,
3928 enum gimplify_status ret
= GS_OK
;
3930 while (ret
!= GS_UNHANDLED
)
3931 switch (TREE_CODE (*from_p
))
3934 /* If we're assigning from a constant constructor, move the
3935 constructor expression to the RHS of the MODIFY_EXPR. */
3936 if (DECL_INITIAL (*from_p
)
3937 && TREE_READONLY (*from_p
)
3938 && !TREE_THIS_VOLATILE (*from_p
)
3939 && TREE_CODE (DECL_INITIAL (*from_p
)) == CONSTRUCTOR
)
3941 tree old_from
= *from_p
;
3943 /* Move the constructor into the RHS. */
3944 *from_p
= unshare_expr (DECL_INITIAL (*from_p
));
3946 /* Let's see if gimplify_init_constructor will need to put
3947 it in memory. If so, revert the change. */
3948 ret
= gimplify_init_constructor (expr_p
, NULL
, NULL
, false, true);
3949 if (ret
== GS_ERROR
)
3964 /* If we have code like
3968 where the type of "x" is a (possibly cv-qualified variant
3969 of "A"), treat the entire expression as identical to "x".
3970 This kind of code arises in C++ when an object is bound
3971 to a const reference, and if "x" is a TARGET_EXPR we want
3972 to take advantage of the optimization below. */
3973 tree t
= gimple_fold_indirect_ref_rhs (TREE_OPERAND (*from_p
, 0));
3986 /* If we are initializing something from a TARGET_EXPR, strip the
3987 TARGET_EXPR and initialize it directly, if possible. This can't
3988 be done if the initializer is void, since that implies that the
3989 temporary is set in some non-trivial way.
3991 ??? What about code that pulls out the temp and uses it
3992 elsewhere? I think that such code never uses the TARGET_EXPR as
3993 an initializer. If I'm wrong, we'll die because the temp won't
3994 have any RTL. In that case, I guess we'll need to replace
3995 references somehow. */
3996 tree init
= TARGET_EXPR_INITIAL (*from_p
);
3999 && !VOID_TYPE_P (TREE_TYPE (init
)))
4010 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
4012 gimplify_compound_expr (from_p
, pre_p
, true);
4017 /* If we're initializing from a CONSTRUCTOR, break this into
4018 individual MODIFY_EXPRs. */
4019 return gimplify_init_constructor (expr_p
, pre_p
, post_p
, want_value
,
4023 /* If we're assigning to a non-register type, push the assignment
4024 down into the branches. This is mandatory for ADDRESSABLE types,
4025 since we cannot generate temporaries for such, but it saves a
4026 copy in other cases as well. */
4027 if (!is_gimple_reg_type (TREE_TYPE (*from_p
)))
4029 /* This code should mirror the code in gimplify_cond_expr. */
4030 enum tree_code code
= TREE_CODE (*expr_p
);
4031 tree cond
= *from_p
;
4032 tree result
= *to_p
;
4034 ret
= gimplify_expr (&result
, pre_p
, post_p
,
4035 is_gimple_lvalue
, fb_lvalue
);
4036 if (ret
!= GS_ERROR
)
4039 if (TREE_TYPE (TREE_OPERAND (cond
, 1)) != void_type_node
)
4040 TREE_OPERAND (cond
, 1)
4041 = build2 (code
, void_type_node
, result
,
4042 TREE_OPERAND (cond
, 1));
4043 if (TREE_TYPE (TREE_OPERAND (cond
, 2)) != void_type_node
)
4044 TREE_OPERAND (cond
, 2)
4045 = build2 (code
, void_type_node
, unshare_expr (result
),
4046 TREE_OPERAND (cond
, 2));
4048 TREE_TYPE (cond
) = void_type_node
;
4049 recalculate_side_effects (cond
);
4053 gimplify_and_add (cond
, pre_p
);
4054 *expr_p
= unshare_expr (result
);
4065 /* For calls that return in memory, give *to_p as the CALL_EXPR's
4066 return slot so that we don't generate a temporary. */
4067 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p
)
4068 && aggregate_value_p (*from_p
, *from_p
))
4072 if (!(rhs_predicate_for (*to_p
))(*from_p
))
4073 /* If we need a temporary, *to_p isn't accurate. */
4075 else if (TREE_CODE (*to_p
) == RESULT_DECL
4076 && DECL_NAME (*to_p
) == NULL_TREE
4077 && needs_to_live_in_memory (*to_p
))
4078 /* It's OK to use the return slot directly unless it's an NRV. */
4080 else if (is_gimple_reg_type (TREE_TYPE (*to_p
))
4081 || (DECL_P (*to_p
) && DECL_REGISTER (*to_p
)))
4082 /* Don't force regs into memory. */
4084 else if (TREE_CODE (*to_p
) == VAR_DECL
4085 && DECL_GIMPLE_FORMAL_TEMP_P (*to_p
))
4086 /* Don't use the original target if it's a formal temp; we
4087 don't want to take their addresses. */
4089 else if (TREE_CODE (*expr_p
) == INIT_EXPR
)
4090 /* It's OK to use the target directly if it's being
4093 else if (!is_gimple_non_addressable (*to_p
))
4094 /* Don't use the original target if it's already addressable;
4095 if its address escapes, and the called function uses the
4096 NRV optimization, a conforming program could see *to_p
4097 change before the called function returns; see c++/19317.
4098 When optimizing, the return_slot pass marks more functions
4099 as safe after we have escape info. */
4106 CALL_EXPR_RETURN_SLOT_OPT (*from_p
) = 1;
4107 mark_addressable (*to_p
);
4114 /* If we're initializing from a container, push the initialization
4116 case CLEANUP_POINT_EXPR
:
4118 case STATEMENT_LIST
:
4120 tree wrap
= *from_p
;
4123 ret
= gimplify_expr (to_p
, pre_p
, post_p
, is_gimple_min_lval
,
4125 if (ret
!= GS_ERROR
)
4128 t
= voidify_wrapper_expr (wrap
, *expr_p
);
4129 gcc_assert (t
== *expr_p
);
4133 gimplify_and_add (wrap
, pre_p
);
4134 *expr_p
= unshare_expr (*to_p
);
4150 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
4151 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
4152 DECL_GIMPLE_REG_P set.
4154 IMPORTANT NOTE: This promotion is performed by introducing a load of the
4155 other, unmodified part of the complex object just before the total store.
4156 As a consequence, if the object is still uninitialized, an undefined value
4157 will be loaded into a register, which may result in a spurious exception
4158 if the register is floating-point and the value happens to be a signaling
4159 NaN for example. Then the fully-fledged complex operations lowering pass
4160 followed by a DCE pass are necessary in order to fix things up. */
4162 static enum gimplify_status
4163 gimplify_modify_expr_complex_part (tree
*expr_p
, gimple_seq
*pre_p
,
4166 enum tree_code code
, ocode
;
4167 tree lhs
, rhs
, new_rhs
, other
, realpart
, imagpart
;
4169 lhs
= TREE_OPERAND (*expr_p
, 0);
4170 rhs
= TREE_OPERAND (*expr_p
, 1);
4171 code
= TREE_CODE (lhs
);
4172 lhs
= TREE_OPERAND (lhs
, 0);
4174 ocode
= code
== REALPART_EXPR
? IMAGPART_EXPR
: REALPART_EXPR
;
4175 other
= build1 (ocode
, TREE_TYPE (rhs
), lhs
);
4176 other
= get_formal_tmp_var (other
, pre_p
);
4178 realpart
= code
== REALPART_EXPR
? rhs
: other
;
4179 imagpart
= code
== REALPART_EXPR
? other
: rhs
;
4181 if (TREE_CONSTANT (realpart
) && TREE_CONSTANT (imagpart
))
4182 new_rhs
= build_complex (TREE_TYPE (lhs
), realpart
, imagpart
);
4184 new_rhs
= build2 (COMPLEX_EXPR
, TREE_TYPE (lhs
), realpart
, imagpart
);
4186 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (lhs
, new_rhs
));
4187 *expr_p
= (want_value
) ? rhs
: NULL_TREE
;
4193 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
4199 PRE_P points to the list where side effects that must happen before
4200 *EXPR_P should be stored.
4202 POST_P points to the list where side effects that must happen after
4203 *EXPR_P should be stored.
4205 WANT_VALUE is nonzero iff we want to use the value of this expression
4206 in another expression. */
4208 static enum gimplify_status
4209 gimplify_modify_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
4212 tree
*from_p
= &TREE_OPERAND (*expr_p
, 1);
4213 tree
*to_p
= &TREE_OPERAND (*expr_p
, 0);
4214 enum gimplify_status ret
= GS_UNHANDLED
;
4217 gcc_assert (TREE_CODE (*expr_p
) == MODIFY_EXPR
4218 || TREE_CODE (*expr_p
) == INIT_EXPR
);
4220 /* Insert pointer conversions required by the middle-end that are not
4221 required by the frontend. This fixes middle-end type checking for
4222 for example gcc.dg/redecl-6.c. */
4223 if (POINTER_TYPE_P (TREE_TYPE (*to_p
))
4224 && lang_hooks
.types_compatible_p (TREE_TYPE (*to_p
), TREE_TYPE (*from_p
)))
4226 STRIP_USELESS_TYPE_CONVERSION (*from_p
);
4227 if (!useless_type_conversion_p (TREE_TYPE (*to_p
), TREE_TYPE (*from_p
)))
4228 *from_p
= fold_convert (TREE_TYPE (*to_p
), *from_p
);
4231 /* See if any simplifications can be done based on what the RHS is. */
4232 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
4234 if (ret
!= GS_UNHANDLED
)
4237 /* For zero sized types only gimplify the left hand side and right hand
4238 side as statements and throw away the assignment. Do this after
4239 gimplify_modify_expr_rhs so we handle TARGET_EXPRs of addressable
4241 if (zero_sized_type (TREE_TYPE (*from_p
)) && !want_value
)
4243 gimplify_stmt (from_p
, pre_p
);
4244 gimplify_stmt (to_p
, pre_p
);
4245 *expr_p
= NULL_TREE
;
4249 /* If the value being copied is of variable width, compute the length
4250 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
4251 before gimplifying any of the operands so that we can resolve any
4252 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
4253 the size of the expression to be copied, not of the destination, so
4254 that is what we must do here. */
4255 maybe_with_size_expr (from_p
);
4257 ret
= gimplify_expr (to_p
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
4258 if (ret
== GS_ERROR
)
4261 /* As a special case, we have to temporarily allow for assignments
4262 with a CALL_EXPR on the RHS. Since in GIMPLE a function call is
4263 a toplevel statement, when gimplifying the GENERIC expression
4264 MODIFY_EXPR <a, CALL_EXPR <foo>>, we cannot create the tuple
4265 GIMPLE_ASSIGN <a, GIMPLE_CALL <foo>>.
4267 Instead, we need to create the tuple GIMPLE_CALL <a, foo>. To
4268 prevent gimplify_expr from trying to create a new temporary for
4269 foo's LHS, we tell it that it should only gimplify until it
4270 reaches the CALL_EXPR. On return from gimplify_expr, the newly
4271 created GIMPLE_CALL <foo> will be the last statement in *PRE_P
4272 and all we need to do here is set 'a' to be its LHS. */
4273 ret
= gimplify_expr (from_p
, pre_p
, post_p
, rhs_predicate_for (*to_p
),
4275 if (ret
== GS_ERROR
)
4278 /* Now see if the above changed *from_p to something we handle specially. */
4279 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
4281 if (ret
!= GS_UNHANDLED
)
4284 /* If we've got a variable sized assignment between two lvalues (i.e. does
4285 not involve a call), then we can make things a bit more straightforward
4286 by converting the assignment to memcpy or memset. */
4287 if (TREE_CODE (*from_p
) == WITH_SIZE_EXPR
)
4289 tree from
= TREE_OPERAND (*from_p
, 0);
4290 tree size
= TREE_OPERAND (*from_p
, 1);
4292 if (TREE_CODE (from
) == CONSTRUCTOR
)
4293 return gimplify_modify_expr_to_memset (expr_p
, size
, want_value
, pre_p
);
4295 if (is_gimple_addressable (from
))
4298 return gimplify_modify_expr_to_memcpy (expr_p
, size
, want_value
,
4303 /* Transform partial stores to non-addressable complex variables into
4304 total stores. This allows us to use real instead of virtual operands
4305 for these variables, which improves optimization. */
4306 if ((TREE_CODE (*to_p
) == REALPART_EXPR
4307 || TREE_CODE (*to_p
) == IMAGPART_EXPR
)
4308 && is_gimple_reg (TREE_OPERAND (*to_p
, 0)))
4309 return gimplify_modify_expr_complex_part (expr_p
, pre_p
, want_value
);
4311 /* Try to alleviate the effects of the gimplification creating artificial
4312 temporaries (see for example is_gimple_reg_rhs) on the debug info. */
4313 if (!gimplify_ctxp
->into_ssa
4315 && DECL_IGNORED_P (*from_p
)
4317 && !DECL_IGNORED_P (*to_p
))
4319 if (!DECL_NAME (*from_p
) && DECL_NAME (*to_p
))
4321 = create_tmp_var_name (IDENTIFIER_POINTER (DECL_NAME (*to_p
)));
4322 DECL_DEBUG_EXPR_IS_FROM (*from_p
) = 1;
4323 SET_DECL_DEBUG_EXPR (*from_p
, *to_p
);
4326 if (TREE_CODE (*from_p
) == CALL_EXPR
)
4328 /* Since the RHS is a CALL_EXPR, we need to create a GIMPLE_CALL
4329 instead of a GIMPLE_ASSIGN. */
4330 assign
= gimple_build_call_from_tree (*from_p
);
4331 gimple_call_set_lhs (assign
, *to_p
);
4334 assign
= gimple_build_assign (*to_p
, *from_p
);
4336 gimplify_seq_add_stmt (pre_p
, assign
);
4338 if (gimplify_ctxp
->into_ssa
&& is_gimple_reg (*to_p
))
4340 /* If we've somehow already got an SSA_NAME on the LHS, then
4341 we've probably modified it twice. Not good. */
4342 gcc_assert (TREE_CODE (*to_p
) != SSA_NAME
);
4343 *to_p
= make_ssa_name (*to_p
, assign
);
4344 gimple_set_lhs (assign
, *to_p
);
4349 *expr_p
= unshare_expr (*to_p
);
4358 /* Gimplify a comparison between two variable-sized objects. Do this
4359 with a call to BUILT_IN_MEMCMP. */
4361 static enum gimplify_status
4362 gimplify_variable_sized_compare (tree
*expr_p
)
4364 tree op0
= TREE_OPERAND (*expr_p
, 0);
4365 tree op1
= TREE_OPERAND (*expr_p
, 1);
4366 tree t
, arg
, dest
, src
;
4368 arg
= TYPE_SIZE_UNIT (TREE_TYPE (op0
));
4369 arg
= unshare_expr (arg
);
4370 arg
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (arg
, op0
);
4371 src
= build_fold_addr_expr (op1
);
4372 dest
= build_fold_addr_expr (op0
);
4373 t
= implicit_built_in_decls
[BUILT_IN_MEMCMP
];
4374 t
= build_call_expr (t
, 3, dest
, src
, arg
);
4376 = build2 (TREE_CODE (*expr_p
), TREE_TYPE (*expr_p
), t
, integer_zero_node
);
4381 /* Gimplify a comparison between two aggregate objects of integral scalar
4382 mode as a comparison between the bitwise equivalent scalar values. */
4384 static enum gimplify_status
4385 gimplify_scalar_mode_aggregate_compare (tree
*expr_p
)
4387 tree op0
= TREE_OPERAND (*expr_p
, 0);
4388 tree op1
= TREE_OPERAND (*expr_p
, 1);
4390 tree type
= TREE_TYPE (op0
);
4391 tree scalar_type
= lang_hooks
.types
.type_for_mode (TYPE_MODE (type
), 1);
4393 op0
= fold_build1 (VIEW_CONVERT_EXPR
, scalar_type
, op0
);
4394 op1
= fold_build1 (VIEW_CONVERT_EXPR
, scalar_type
, op1
);
4397 = fold_build2 (TREE_CODE (*expr_p
), TREE_TYPE (*expr_p
), op0
, op1
);
4402 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
4403 points to the expression to gimplify.
4405 Expressions of the form 'a && b' are gimplified to:
4407 a && b ? true : false
4409 gimplify_cond_expr will do the rest.
4411 PRE_P points to the list where side effects that must happen before
4412 *EXPR_P should be stored. */
4414 static enum gimplify_status
4415 gimplify_boolean_expr (tree
*expr_p
)
4417 /* Preserve the original type of the expression. */
4418 tree type
= TREE_TYPE (*expr_p
);
4420 *expr_p
= build3 (COND_EXPR
, type
, *expr_p
,
4421 fold_convert (type
, boolean_true_node
),
4422 fold_convert (type
, boolean_false_node
));
4427 /* Gimplifies an expression sequence. This function gimplifies each
4428 expression and re-writes the original expression with the last
4429 expression of the sequence in GIMPLE form.
4431 PRE_P points to the list where the side effects for all the
4432 expressions in the sequence will be emitted.
4434 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
4436 static enum gimplify_status
4437 gimplify_compound_expr (tree
*expr_p
, gimple_seq
*pre_p
, bool want_value
)
4443 tree
*sub_p
= &TREE_OPERAND (t
, 0);
4445 if (TREE_CODE (*sub_p
) == COMPOUND_EXPR
)
4446 gimplify_compound_expr (sub_p
, pre_p
, false);
4448 gimplify_stmt (sub_p
, pre_p
);
4450 t
= TREE_OPERAND (t
, 1);
4452 while (TREE_CODE (t
) == COMPOUND_EXPR
);
4459 gimplify_stmt (expr_p
, pre_p
);
4465 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
4466 gimplify. After gimplification, EXPR_P will point to a new temporary
4467 that holds the original value of the SAVE_EXPR node.
4469 PRE_P points to the list where side effects that must happen before
4470 *EXPR_P should be stored. */
4472 static enum gimplify_status
4473 gimplify_save_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
4475 enum gimplify_status ret
= GS_ALL_DONE
;
4478 gcc_assert (TREE_CODE (*expr_p
) == SAVE_EXPR
);
4479 val
= TREE_OPERAND (*expr_p
, 0);
4481 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
4482 if (!SAVE_EXPR_RESOLVED_P (*expr_p
))
4484 /* The operand may be a void-valued expression such as SAVE_EXPRs
4485 generated by the Java frontend for class initialization. It is
4486 being executed only for its side-effects. */
4487 if (TREE_TYPE (val
) == void_type_node
)
4489 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
4490 is_gimple_stmt
, fb_none
);
4494 val
= get_initialized_tmp_var (val
, pre_p
, post_p
);
4496 TREE_OPERAND (*expr_p
, 0) = val
;
4497 SAVE_EXPR_RESOLVED_P (*expr_p
) = 1;
4505 /* Re-write the ADDR_EXPR node pointed to by EXPR_P
4512 PRE_P points to the list where side effects that must happen before
4513 *EXPR_P should be stored.
4515 POST_P points to the list where side effects that must happen after
4516 *EXPR_P should be stored. */
4518 static enum gimplify_status
4519 gimplify_addr_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
4521 tree expr
= *expr_p
;
4522 tree op0
= TREE_OPERAND (expr
, 0);
4523 enum gimplify_status ret
;
4525 switch (TREE_CODE (op0
))
4528 case MISALIGNED_INDIRECT_REF
:
4530 /* Check if we are dealing with an expression of the form '&*ptr'.
4531 While the front end folds away '&*ptr' into 'ptr', these
4532 expressions may be generated internally by the compiler (e.g.,
4533 builtins like __builtin_va_end). */
4534 /* Caution: the silent array decomposition semantics we allow for
4535 ADDR_EXPR means we can't always discard the pair. */
4536 /* Gimplification of the ADDR_EXPR operand may drop
4537 cv-qualification conversions, so make sure we add them if
4540 tree op00
= TREE_OPERAND (op0
, 0);
4541 tree t_expr
= TREE_TYPE (expr
);
4542 tree t_op00
= TREE_TYPE (op00
);
4544 if (!useless_type_conversion_p (t_expr
, t_op00
))
4545 op00
= fold_convert (TREE_TYPE (expr
), op00
);
4551 case VIEW_CONVERT_EXPR
:
4552 /* Take the address of our operand and then convert it to the type of
4555 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
4556 all clear. The impact of this transformation is even less clear. */
4558 /* If the operand is a useless conversion, look through it. Doing so
4559 guarantees that the ADDR_EXPR and its operand will remain of the
4561 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0
, 0)))
4562 op0
= TREE_OPERAND (op0
, 0);
4564 *expr_p
= fold_convert (TREE_TYPE (expr
),
4565 build_fold_addr_expr (TREE_OPERAND (op0
, 0)));
4570 /* We use fb_either here because the C frontend sometimes takes
4571 the address of a call that returns a struct; see
4572 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
4573 the implied temporary explicit. */
4575 /* Mark the RHS addressable. */
4576 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, post_p
,
4577 is_gimple_addressable
, fb_either
);
4578 if (ret
== GS_ERROR
)
4581 /* We cannot rely on making the RHS addressable if it is
4582 a temporary created by gimplification. In this case create a
4583 new temporary that is initialized by a copy (which will
4584 become a store after we mark it addressable).
4585 This mostly happens if the frontend passed us something that
4586 it could not mark addressable yet, like a fortran
4587 pass-by-reference parameter (int) floatvar. */
4588 if (is_gimple_formal_tmp_var (TREE_OPERAND (expr
, 0)))
4589 TREE_OPERAND (expr
, 0)
4590 = get_initialized_tmp_var (TREE_OPERAND (expr
, 0), pre_p
, post_p
);
4592 op0
= TREE_OPERAND (expr
, 0);
4594 /* For various reasons, the gimplification of the expression
4595 may have made a new INDIRECT_REF. */
4596 if (TREE_CODE (op0
) == INDIRECT_REF
)
4597 goto do_indirect_ref
;
4599 /* Make sure TREE_CONSTANT and TREE_SIDE_EFFECTS are set properly. */
4600 recompute_tree_invariant_for_addr_expr (expr
);
4602 mark_addressable (TREE_OPERAND (expr
, 0));
4609 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
4610 value; output operands should be a gimple lvalue. */
4612 static enum gimplify_status
4613 gimplify_asm_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
4617 const char **oconstraints
;
4620 const char *constraint
;
4621 bool allows_mem
, allows_reg
, is_inout
;
4622 enum gimplify_status ret
, tret
;
4624 VEC(tree
, gc
) *inputs
;
4625 VEC(tree
, gc
) *outputs
;
4626 VEC(tree
, gc
) *clobbers
;
4630 noutputs
= list_length (ASM_OUTPUTS (expr
));
4631 oconstraints
= (const char **) alloca ((noutputs
) * sizeof (const char *));
4633 inputs
= outputs
= clobbers
= NULL
;
4636 link_next
= NULL_TREE
;
4637 for (i
= 0, link
= ASM_OUTPUTS (expr
); link
; ++i
, link
= link_next
)
4640 size_t constraint_len
;
4642 link_next
= TREE_CHAIN (link
);
4646 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
4647 constraint_len
= strlen (constraint
);
4648 if (constraint_len
== 0)
4651 ok
= parse_output_constraint (&constraint
, i
, 0, 0,
4652 &allows_mem
, &allows_reg
, &is_inout
);
4659 if (!allows_reg
&& allows_mem
)
4660 mark_addressable (TREE_VALUE (link
));
4662 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
4663 is_inout
? is_gimple_min_lval
: is_gimple_lvalue
,
4664 fb_lvalue
| fb_mayfail
);
4665 if (tret
== GS_ERROR
)
4667 error ("invalid lvalue in asm output %d", i
);
4671 VEC_safe_push (tree
, gc
, outputs
, link
);
4672 TREE_CHAIN (link
) = NULL_TREE
;
4676 /* An input/output operand. To give the optimizers more
4677 flexibility, split it into separate input and output
4682 /* Turn the in/out constraint into an output constraint. */
4683 char *p
= xstrdup (constraint
);
4685 TREE_VALUE (TREE_PURPOSE (link
)) = build_string (constraint_len
, p
);
4687 /* And add a matching input constraint. */
4690 sprintf (buf
, "%d", i
);
4692 /* If there are multiple alternatives in the constraint,
4693 handle each of them individually. Those that allow register
4694 will be replaced with operand number, the others will stay
4696 if (strchr (p
, ',') != NULL
)
4698 size_t len
= 0, buflen
= strlen (buf
);
4699 char *beg
, *end
, *str
, *dst
;
4703 end
= strchr (beg
, ',');
4705 end
= strchr (beg
, '\0');
4706 if ((size_t) (end
- beg
) < buflen
)
4709 len
+= end
- beg
+ 1;
4716 str
= (char *) alloca (len
);
4717 for (beg
= p
+ 1, dst
= str
;;)
4720 bool mem_p
, reg_p
, inout_p
;
4722 end
= strchr (beg
, ',');
4727 parse_output_constraint (&tem
, i
, 0, 0,
4728 &mem_p
, ®_p
, &inout_p
);
4733 memcpy (dst
, buf
, buflen
);
4742 memcpy (dst
, beg
, len
);
4751 input
= build_string (dst
- str
, str
);
4754 input
= build_string (strlen (buf
), buf
);
4757 input
= build_string (constraint_len
- 1, constraint
+ 1);
4761 input
= build_tree_list (build_tree_list (NULL_TREE
, input
),
4762 unshare_expr (TREE_VALUE (link
)));
4763 ASM_INPUTS (expr
) = chainon (ASM_INPUTS (expr
), input
);
4767 link_next
= NULL_TREE
;
4768 for (link
= ASM_INPUTS (expr
); link
; ++i
, link
= link_next
)
4770 link_next
= TREE_CHAIN (link
);
4771 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
4772 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
4773 oconstraints
, &allows_mem
, &allows_reg
);
4775 /* If we can't make copies, we can only accept memory. */
4776 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (link
))))
4782 error ("impossible constraint in %<asm%>");
4783 error ("non-memory input %d must stay in memory", i
);
4788 /* If the operand is a memory input, it should be an lvalue. */
4789 if (!allows_reg
&& allows_mem
)
4791 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
4792 is_gimple_lvalue
, fb_lvalue
| fb_mayfail
);
4793 mark_addressable (TREE_VALUE (link
));
4794 if (tret
== GS_ERROR
)
4796 if (EXPR_HAS_LOCATION (TREE_VALUE (link
)))
4797 input_location
= EXPR_LOCATION (TREE_VALUE (link
));
4798 error ("memory input %d is not directly addressable", i
);
4804 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
4805 is_gimple_asm_val
, fb_rvalue
);
4806 if (tret
== GS_ERROR
)
4810 TREE_CHAIN (link
) = NULL_TREE
;
4811 VEC_safe_push (tree
, gc
, inputs
, link
);
4814 for (link
= ASM_CLOBBERS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
4815 VEC_safe_push (tree
, gc
, clobbers
, link
);
4817 stmt
= gimple_build_asm_vec (TREE_STRING_POINTER (ASM_STRING (expr
)),
4818 inputs
, outputs
, clobbers
);
4820 gimple_asm_set_volatile (stmt
, ASM_VOLATILE_P (expr
));
4821 gimple_asm_set_input (stmt
, ASM_INPUT_P (expr
));
4823 gimplify_seq_add_stmt (pre_p
, stmt
);
4828 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
4829 GIMPLE_WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
4830 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
4831 return to this function.
4833 FIXME should we complexify the prequeue handling instead? Or use flags
4834 for all the cleanups and let the optimizer tighten them up? The current
4835 code seems pretty fragile; it will break on a cleanup within any
4836 non-conditional nesting. But any such nesting would be broken, anyway;
4837 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
4838 and continues out of it. We can do that at the RTL level, though, so
4839 having an optimizer to tighten up try/finally regions would be a Good
4842 static enum gimplify_status
4843 gimplify_cleanup_point_expr (tree
*expr_p
, gimple_seq
*pre_p
)
4845 gimple_stmt_iterator iter
;
4846 gimple_seq body_sequence
= NULL
;
4848 tree temp
= voidify_wrapper_expr (*expr_p
, NULL
);
4850 /* We only care about the number of conditions between the innermost
4851 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
4852 any cleanups collected outside the CLEANUP_POINT_EXPR. */
4853 int old_conds
= gimplify_ctxp
->conditions
;
4854 gimple_seq old_cleanups
= gimplify_ctxp
->conditional_cleanups
;
4855 gimplify_ctxp
->conditions
= 0;
4856 gimplify_ctxp
->conditional_cleanups
= NULL
;
4858 gimplify_stmt (&TREE_OPERAND (*expr_p
, 0), &body_sequence
);
4860 gimplify_ctxp
->conditions
= old_conds
;
4861 gimplify_ctxp
->conditional_cleanups
= old_cleanups
;
4863 for (iter
= gsi_start (body_sequence
); !gsi_end_p (iter
); )
4865 gimple wce
= gsi_stmt (iter
);
4867 if (gimple_code (wce
) == GIMPLE_WITH_CLEANUP_EXPR
)
4869 if (gsi_one_before_end_p (iter
))
4871 /* Note that gsi_insert_seq_before and gsi_remove do not
4872 scan operands, unlike some other sequence mutators. */
4873 gsi_insert_seq_before_without_update (&iter
,
4874 gimple_wce_cleanup (wce
),
4876 gsi_remove (&iter
, true);
4883 enum gimple_try_flags kind
;
4885 if (gimple_wce_cleanup_eh_only (wce
))
4886 kind
= GIMPLE_TRY_CATCH
;
4888 kind
= GIMPLE_TRY_FINALLY
;
4889 seq
= gsi_split_seq_after (iter
);
4891 gtry
= gimple_build_try (seq
, gimple_wce_cleanup (wce
), kind
);
4892 /* Do not use gsi_replace here, as it may scan operands.
4893 We want to do a simple structural modification only. */
4894 *gsi_stmt_ptr (&iter
) = gtry
;
4895 iter
= gsi_start (seq
);
4902 gimplify_seq_add_seq (pre_p
, body_sequence
);
4915 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
4916 is the cleanup action required. EH_ONLY is true if the cleanup should
4917 only be executed if an exception is thrown, not on normal exit. */
4920 gimple_push_cleanup (tree var
, tree cleanup
, bool eh_only
, gimple_seq
*pre_p
)
4923 gimple_seq cleanup_stmts
= NULL
;
4925 /* Errors can result in improperly nested cleanups. Which results in
4926 confusion when trying to resolve the GIMPLE_WITH_CLEANUP_EXPR. */
4927 if (errorcount
|| sorrycount
)
4930 if (gimple_conditional_context ())
4932 /* If we're in a conditional context, this is more complex. We only
4933 want to run the cleanup if we actually ran the initialization that
4934 necessitates it, but we want to run it after the end of the
4935 conditional context. So we wrap the try/finally around the
4936 condition and use a flag to determine whether or not to actually
4937 run the destructor. Thus
4941 becomes (approximately)
4945 if (test) { A::A(temp); flag = 1; val = f(temp); }
4948 if (flag) A::~A(temp);
4952 tree flag
= create_tmp_var (boolean_type_node
, "cleanup");
4953 gimple ffalse
= gimple_build_assign (flag
, boolean_false_node
);
4954 gimple ftrue
= gimple_build_assign (flag
, boolean_true_node
);
4956 cleanup
= build3 (COND_EXPR
, void_type_node
, flag
, cleanup
, NULL
);
4957 gimplify_stmt (&cleanup
, &cleanup_stmts
);
4958 wce
= gimple_build_wce (cleanup_stmts
);
4960 gimplify_seq_add_stmt (&gimplify_ctxp
->conditional_cleanups
, ffalse
);
4961 gimplify_seq_add_stmt (&gimplify_ctxp
->conditional_cleanups
, wce
);
4962 gimplify_seq_add_stmt (pre_p
, ftrue
);
4964 /* Because of this manipulation, and the EH edges that jump
4965 threading cannot redirect, the temporary (VAR) will appear
4966 to be used uninitialized. Don't warn. */
4967 TREE_NO_WARNING (var
) = 1;
4971 gimplify_stmt (&cleanup
, &cleanup_stmts
);
4972 wce
= gimple_build_wce (cleanup_stmts
);
4973 gimple_wce_set_cleanup_eh_only (wce
, eh_only
);
4974 gimplify_seq_add_stmt (pre_p
, wce
);
4978 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
4980 static enum gimplify_status
4981 gimplify_target_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
4983 tree targ
= *expr_p
;
4984 tree temp
= TARGET_EXPR_SLOT (targ
);
4985 tree init
= TARGET_EXPR_INITIAL (targ
);
4986 enum gimplify_status ret
;
4990 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
4991 to the temps list. Handle also variable length TARGET_EXPRs. */
4992 if (TREE_CODE (DECL_SIZE (temp
)) != INTEGER_CST
)
4994 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (temp
)))
4995 gimplify_type_sizes (TREE_TYPE (temp
), pre_p
);
4996 gimplify_vla_decl (temp
, pre_p
);
4999 gimple_add_tmp_var (temp
);
5001 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
5002 expression is supposed to initialize the slot. */
5003 if (VOID_TYPE_P (TREE_TYPE (init
)))
5004 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
, fb_none
);
5007 tree init_expr
= build2 (INIT_EXPR
, void_type_node
, temp
, init
);
5009 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
, fb_none
);
5011 ggc_free (init_expr
);
5013 if (ret
== GS_ERROR
)
5015 /* PR c++/28266 Make sure this is expanded only once. */
5016 TARGET_EXPR_INITIAL (targ
) = NULL_TREE
;
5020 gimplify_and_add (init
, pre_p
);
5022 /* If needed, push the cleanup for the temp. */
5023 if (TARGET_EXPR_CLEANUP (targ
))
5024 gimple_push_cleanup (temp
, TARGET_EXPR_CLEANUP (targ
),
5025 CLEANUP_EH_ONLY (targ
), pre_p
);
5027 /* Only expand this once. */
5028 TREE_OPERAND (targ
, 3) = init
;
5029 TARGET_EXPR_INITIAL (targ
) = NULL_TREE
;
5032 /* We should have expanded this before. */
5033 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp
));
5039 /* Gimplification of expression trees. */
5041 /* Gimplify an expression which appears at statement context. The
5042 corresponding GIMPLE statements are added to *SEQ_P. If *SEQ_P is
5043 NULL, a new sequence is allocated.
5045 Return true if we actually added a statement to the queue. */
5048 gimplify_stmt (tree
*stmt_p
, gimple_seq
*seq_p
)
5050 gimple_seq_node last
;
5053 *seq_p
= gimple_seq_alloc ();
5055 last
= gimple_seq_last (*seq_p
);
5056 gimplify_expr (stmt_p
, seq_p
, NULL
, is_gimple_stmt
, fb_none
);
5057 return last
!= gimple_seq_last (*seq_p
);
5061 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
5062 to CTX. If entries already exist, force them to be some flavor of private.
5063 If there is no enclosing parallel, do nothing. */
5066 omp_firstprivatize_variable (struct gimplify_omp_ctx
*ctx
, tree decl
)
5070 if (decl
== NULL
|| !DECL_P (decl
))
5075 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5078 if (n
->value
& GOVD_SHARED
)
5079 n
->value
= GOVD_FIRSTPRIVATE
| (n
->value
& GOVD_SEEN
);
5083 else if (ctx
->region_type
!= ORT_WORKSHARE
)
5084 omp_add_variable (ctx
, decl
, GOVD_FIRSTPRIVATE
);
5086 ctx
= ctx
->outer_context
;
5091 /* Similarly for each of the type sizes of TYPE. */
5094 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx
*ctx
, tree type
)
5096 if (type
== NULL
|| type
== error_mark_node
)
5098 type
= TYPE_MAIN_VARIANT (type
);
5100 if (pointer_set_insert (ctx
->privatized_types
, type
))
5103 switch (TREE_CODE (type
))
5109 case FIXED_POINT_TYPE
:
5110 omp_firstprivatize_variable (ctx
, TYPE_MIN_VALUE (type
));
5111 omp_firstprivatize_variable (ctx
, TYPE_MAX_VALUE (type
));
5115 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
5116 omp_firstprivatize_type_sizes (ctx
, TYPE_DOMAIN (type
));
5121 case QUAL_UNION_TYPE
:
5124 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
5125 if (TREE_CODE (field
) == FIELD_DECL
)
5127 omp_firstprivatize_variable (ctx
, DECL_FIELD_OFFSET (field
));
5128 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (field
));
5134 case REFERENCE_TYPE
:
5135 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
5142 omp_firstprivatize_variable (ctx
, TYPE_SIZE (type
));
5143 omp_firstprivatize_variable (ctx
, TYPE_SIZE_UNIT (type
));
5144 lang_hooks
.types
.omp_firstprivatize_type_sizes (ctx
, type
);
5147 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
5150 omp_add_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, unsigned int flags
)
5153 unsigned int nflags
;
5156 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
5159 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
5160 there are constructors involved somewhere. */
5161 if (TREE_ADDRESSABLE (TREE_TYPE (decl
))
5162 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
5165 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5168 /* We shouldn't be re-adding the decl with the same data
5170 gcc_assert ((n
->value
& GOVD_DATA_SHARE_CLASS
& flags
) == 0);
5171 /* The only combination of data sharing classes we should see is
5172 FIRSTPRIVATE and LASTPRIVATE. */
5173 nflags
= n
->value
| flags
;
5174 gcc_assert ((nflags
& GOVD_DATA_SHARE_CLASS
)
5175 == (GOVD_FIRSTPRIVATE
| GOVD_LASTPRIVATE
));
5180 /* When adding a variable-sized variable, we have to handle all sorts
5181 of additional bits of data: the pointer replacement variable, and
5182 the parameters of the type. */
5183 if (DECL_SIZE (decl
) && TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
5185 /* Add the pointer replacement variable as PRIVATE if the variable
5186 replacement is private, else FIRSTPRIVATE since we'll need the
5187 address of the original variable either for SHARED, or for the
5188 copy into or out of the context. */
5189 if (!(flags
& GOVD_LOCAL
))
5191 nflags
= flags
& GOVD_PRIVATE
? GOVD_PRIVATE
: GOVD_FIRSTPRIVATE
;
5192 nflags
|= flags
& GOVD_SEEN
;
5193 t
= DECL_VALUE_EXPR (decl
);
5194 gcc_assert (TREE_CODE (t
) == INDIRECT_REF
);
5195 t
= TREE_OPERAND (t
, 0);
5196 gcc_assert (DECL_P (t
));
5197 omp_add_variable (ctx
, t
, nflags
);
5200 /* Add all of the variable and type parameters (which should have
5201 been gimplified to a formal temporary) as FIRSTPRIVATE. */
5202 omp_firstprivatize_variable (ctx
, DECL_SIZE_UNIT (decl
));
5203 omp_firstprivatize_variable (ctx
, DECL_SIZE (decl
));
5204 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
5206 /* The variable-sized variable itself is never SHARED, only some form
5207 of PRIVATE. The sharing would take place via the pointer variable
5208 which we remapped above. */
5209 if (flags
& GOVD_SHARED
)
5210 flags
= GOVD_PRIVATE
| GOVD_DEBUG_PRIVATE
5211 | (flags
& (GOVD_SEEN
| GOVD_EXPLICIT
));
5213 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
5214 alloca statement we generate for the variable, so make sure it
5215 is available. This isn't automatically needed for the SHARED
5216 case, since we won't be allocating local storage then.
5217 For local variables TYPE_SIZE_UNIT might not be gimplified yet,
5218 in this case omp_notice_variable will be called later
5219 on when it is gimplified. */
5220 else if (! (flags
& GOVD_LOCAL
))
5221 omp_notice_variable (ctx
, TYPE_SIZE_UNIT (TREE_TYPE (decl
)), true);
5223 else if (lang_hooks
.decls
.omp_privatize_by_reference (decl
))
5225 gcc_assert ((flags
& GOVD_LOCAL
) == 0);
5226 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
5228 /* Similar to the direct variable sized case above, we'll need the
5229 size of references being privatized. */
5230 if ((flags
& GOVD_SHARED
) == 0)
5232 t
= TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl
)));
5233 if (TREE_CODE (t
) != INTEGER_CST
)
5234 omp_notice_variable (ctx
, t
, true);
5238 splay_tree_insert (ctx
->variables
, (splay_tree_key
)decl
, flags
);
5241 /* Record the fact that DECL was used within the OpenMP context CTX.
5242 IN_CODE is true when real code uses DECL, and false when we should
5243 merely emit default(none) errors. Return true if DECL is going to
5244 be remapped and thus DECL shouldn't be gimplified into its
5245 DECL_VALUE_EXPR (if any). */
5248 omp_notice_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, bool in_code
)
5251 unsigned flags
= in_code
? GOVD_SEEN
: 0;
5252 bool ret
= false, shared
;
5254 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
5257 /* Threadprivate variables are predetermined. */
5258 if (is_global_var (decl
))
5260 if (DECL_THREAD_LOCAL_P (decl
))
5263 if (DECL_HAS_VALUE_EXPR_P (decl
))
5265 tree value
= get_base_address (DECL_VALUE_EXPR (decl
));
5267 if (value
&& DECL_P (value
) && DECL_THREAD_LOCAL_P (value
))
5272 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5275 enum omp_clause_default_kind default_kind
, kind
;
5276 struct gimplify_omp_ctx
*octx
;
5278 if (ctx
->region_type
== ORT_WORKSHARE
)
5281 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
5282 remapped firstprivate instead of shared. To some extent this is
5283 addressed in omp_firstprivatize_type_sizes, but not effectively. */
5284 default_kind
= ctx
->default_kind
;
5285 kind
= lang_hooks
.decls
.omp_predetermined_sharing (decl
);
5286 if (kind
!= OMP_CLAUSE_DEFAULT_UNSPECIFIED
)
5287 default_kind
= kind
;
5289 switch (default_kind
)
5291 case OMP_CLAUSE_DEFAULT_NONE
:
5292 error ("%qs not specified in enclosing parallel",
5293 IDENTIFIER_POINTER (DECL_NAME (decl
)));
5294 error ("%Henclosing parallel", &ctx
->location
);
5296 case OMP_CLAUSE_DEFAULT_SHARED
:
5297 flags
|= GOVD_SHARED
;
5299 case OMP_CLAUSE_DEFAULT_PRIVATE
:
5300 flags
|= GOVD_PRIVATE
;
5302 case OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
:
5303 flags
|= GOVD_FIRSTPRIVATE
;
5305 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
5306 /* decl will be either GOVD_FIRSTPRIVATE or GOVD_SHARED. */
5307 gcc_assert (ctx
->region_type
== ORT_TASK
);
5308 if (ctx
->outer_context
)
5309 omp_notice_variable (ctx
->outer_context
, decl
, in_code
);
5310 for (octx
= ctx
->outer_context
; octx
; octx
= octx
->outer_context
)
5314 n2
= splay_tree_lookup (octx
->variables
, (splay_tree_key
) decl
);
5315 if (n2
&& (n2
->value
& GOVD_DATA_SHARE_CLASS
) != GOVD_SHARED
)
5317 flags
|= GOVD_FIRSTPRIVATE
;
5320 if ((octx
->region_type
& ORT_PARALLEL
) != 0)
5323 if (flags
& GOVD_FIRSTPRIVATE
)
5326 && (TREE_CODE (decl
) == PARM_DECL
5327 || (!is_global_var (decl
)
5328 && DECL_CONTEXT (decl
) == current_function_decl
)))
5330 flags
|= GOVD_FIRSTPRIVATE
;
5333 flags
|= GOVD_SHARED
;
5339 if ((flags
& GOVD_PRIVATE
)
5340 && lang_hooks
.decls
.omp_private_outer_ref (decl
))
5341 flags
|= GOVD_PRIVATE_OUTER_REF
;
5343 omp_add_variable (ctx
, decl
, flags
);
5345 shared
= (flags
& GOVD_SHARED
) != 0;
5346 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
5350 if ((n
->value
& (GOVD_SEEN
| GOVD_LOCAL
)) == 0
5351 && (flags
& (GOVD_SEEN
| GOVD_LOCAL
)) == GOVD_SEEN
5353 && TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
5356 tree t
= DECL_VALUE_EXPR (decl
);
5357 gcc_assert (TREE_CODE (t
) == INDIRECT_REF
);
5358 t
= TREE_OPERAND (t
, 0);
5359 gcc_assert (DECL_P (t
));
5360 n2
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) t
);
5361 n2
->value
|= GOVD_SEEN
;
5364 shared
= ((flags
| n
->value
) & GOVD_SHARED
) != 0;
5365 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
5367 /* If nothing changed, there's nothing left to do. */
5368 if ((n
->value
& flags
) == flags
)
5374 /* If the variable is private in the current context, then we don't
5375 need to propagate anything to an outer context. */
5376 if ((flags
& GOVD_PRIVATE
) && !(flags
& GOVD_PRIVATE_OUTER_REF
))
5378 if (ctx
->outer_context
5379 && omp_notice_variable (ctx
->outer_context
, decl
, in_code
))
5384 /* Verify that DECL is private within CTX. If there's specific information
5385 to the contrary in the innermost scope, generate an error. */
5388 omp_is_private (struct gimplify_omp_ctx
*ctx
, tree decl
)
5392 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5395 if (n
->value
& GOVD_SHARED
)
5397 if (ctx
== gimplify_omp_ctxp
)
5399 error ("iteration variable %qs should be private",
5400 IDENTIFIER_POINTER (DECL_NAME (decl
)));
5401 n
->value
= GOVD_PRIVATE
;
5407 else if ((n
->value
& GOVD_EXPLICIT
) != 0
5408 && (ctx
== gimplify_omp_ctxp
5409 || (ctx
->region_type
== ORT_COMBINED_PARALLEL
5410 && gimplify_omp_ctxp
->outer_context
== ctx
)))
5412 if ((n
->value
& GOVD_FIRSTPRIVATE
) != 0)
5413 error ("iteration variable %qs should not be firstprivate",
5414 IDENTIFIER_POINTER (DECL_NAME (decl
)));
5415 else if ((n
->value
& GOVD_REDUCTION
) != 0)
5416 error ("iteration variable %qs should not be reduction",
5417 IDENTIFIER_POINTER (DECL_NAME (decl
)));
5419 return (ctx
== gimplify_omp_ctxp
5420 || (ctx
->region_type
== ORT_COMBINED_PARALLEL
5421 && gimplify_omp_ctxp
->outer_context
== ctx
));
5424 if (ctx
->region_type
!= ORT_WORKSHARE
)
5426 else if (ctx
->outer_context
)
5427 return omp_is_private (ctx
->outer_context
, decl
);
5431 /* Return true if DECL is private within a parallel region
5432 that binds to the current construct's context or in parallel
5433 region's REDUCTION clause. */
5436 omp_check_private (struct gimplify_omp_ctx
*ctx
, tree decl
)
5442 ctx
= ctx
->outer_context
;
5444 return !(is_global_var (decl
)
5445 /* References might be private, but might be shared too. */
5446 || lang_hooks
.decls
.omp_privatize_by_reference (decl
));
5448 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
5450 return (n
->value
& GOVD_SHARED
) == 0;
5452 while (ctx
->region_type
== ORT_WORKSHARE
);
5456 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
5457 and previous omp contexts. */
5460 gimplify_scan_omp_clauses (tree
*list_p
, gimple_seq
*pre_p
,
5461 enum omp_region_type region_type
)
5463 struct gimplify_omp_ctx
*ctx
, *outer_ctx
;
5464 struct gimplify_ctx gctx
;
5467 ctx
= new_omp_context (region_type
);
5468 outer_ctx
= ctx
->outer_context
;
5470 while ((c
= *list_p
) != NULL
)
5472 bool remove
= false;
5473 bool notice_outer
= true;
5474 const char *check_non_private
= NULL
;
5478 switch (OMP_CLAUSE_CODE (c
))
5480 case OMP_CLAUSE_PRIVATE
:
5481 flags
= GOVD_PRIVATE
| GOVD_EXPLICIT
;
5482 if (lang_hooks
.decls
.omp_private_outer_ref (OMP_CLAUSE_DECL (c
)))
5484 flags
|= GOVD_PRIVATE_OUTER_REF
;
5485 OMP_CLAUSE_PRIVATE_OUTER_REF (c
) = 1;
5488 notice_outer
= false;
5490 case OMP_CLAUSE_SHARED
:
5491 flags
= GOVD_SHARED
| GOVD_EXPLICIT
;
5493 case OMP_CLAUSE_FIRSTPRIVATE
:
5494 flags
= GOVD_FIRSTPRIVATE
| GOVD_EXPLICIT
;
5495 check_non_private
= "firstprivate";
5497 case OMP_CLAUSE_LASTPRIVATE
:
5498 flags
= GOVD_LASTPRIVATE
| GOVD_SEEN
| GOVD_EXPLICIT
;
5499 check_non_private
= "lastprivate";
5501 case OMP_CLAUSE_REDUCTION
:
5502 flags
= GOVD_REDUCTION
| GOVD_SEEN
| GOVD_EXPLICIT
;
5503 check_non_private
= "reduction";
5507 decl
= OMP_CLAUSE_DECL (c
);
5508 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
5513 omp_add_variable (ctx
, decl
, flags
);
5514 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
5515 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
))
5517 omp_add_variable (ctx
, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
),
5518 GOVD_LOCAL
| GOVD_SEEN
);
5519 gimplify_omp_ctxp
= ctx
;
5520 push_gimplify_context (&gctx
);
5522 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c
) = gimple_seq_alloc ();
5523 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c
) = gimple_seq_alloc ();
5525 gimplify_and_add (OMP_CLAUSE_REDUCTION_INIT (c
),
5526 &OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c
));
5527 pop_gimplify_context
5528 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c
)));
5529 push_gimplify_context (&gctx
);
5530 gimplify_and_add (OMP_CLAUSE_REDUCTION_MERGE (c
),
5531 &OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c
));
5532 pop_gimplify_context
5533 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c
)));
5534 OMP_CLAUSE_REDUCTION_INIT (c
) = NULL_TREE
;
5535 OMP_CLAUSE_REDUCTION_MERGE (c
) = NULL_TREE
;
5537 gimplify_omp_ctxp
= outer_ctx
;
5539 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
5540 && OMP_CLAUSE_LASTPRIVATE_STMT (c
))
5542 gimplify_omp_ctxp
= ctx
;
5543 push_gimplify_context (&gctx
);
5544 if (TREE_CODE (OMP_CLAUSE_LASTPRIVATE_STMT (c
)) != BIND_EXPR
)
5546 tree bind
= build3 (BIND_EXPR
, void_type_node
, NULL
,
5548 TREE_SIDE_EFFECTS (bind
) = 1;
5549 BIND_EXPR_BODY (bind
) = OMP_CLAUSE_LASTPRIVATE_STMT (c
);
5550 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = bind
;
5552 gimplify_and_add (OMP_CLAUSE_LASTPRIVATE_STMT (c
),
5553 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
));
5554 pop_gimplify_context
5555 (gimple_seq_first_stmt (OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
)));
5556 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = NULL_TREE
;
5558 gimplify_omp_ctxp
= outer_ctx
;
5564 case OMP_CLAUSE_COPYIN
:
5565 case OMP_CLAUSE_COPYPRIVATE
:
5566 decl
= OMP_CLAUSE_DECL (c
);
5567 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
5574 omp_notice_variable (outer_ctx
, decl
, true);
5575 if (check_non_private
5576 && region_type
== ORT_WORKSHARE
5577 && omp_check_private (ctx
, decl
))
5579 error ("%s variable %qs is private in outer context",
5580 check_non_private
, IDENTIFIER_POINTER (DECL_NAME (decl
)));
5586 OMP_CLAUSE_OPERAND (c
, 0)
5587 = gimple_boolify (OMP_CLAUSE_OPERAND (c
, 0));
5590 case OMP_CLAUSE_SCHEDULE
:
5591 case OMP_CLAUSE_NUM_THREADS
:
5592 if (gimplify_expr (&OMP_CLAUSE_OPERAND (c
, 0), pre_p
, NULL
,
5593 is_gimple_val
, fb_rvalue
) == GS_ERROR
)
5597 case OMP_CLAUSE_NOWAIT
:
5598 case OMP_CLAUSE_ORDERED
:
5599 case OMP_CLAUSE_UNTIED
:
5600 case OMP_CLAUSE_COLLAPSE
:
5603 case OMP_CLAUSE_DEFAULT
:
5604 ctx
->default_kind
= OMP_CLAUSE_DEFAULT_KIND (c
);
5612 *list_p
= OMP_CLAUSE_CHAIN (c
);
5614 list_p
= &OMP_CLAUSE_CHAIN (c
);
5617 gimplify_omp_ctxp
= ctx
;
5620 /* For all variables that were not actually used within the context,
5621 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
5624 gimplify_adjust_omp_clauses_1 (splay_tree_node n
, void *data
)
5626 tree
*list_p
= (tree
*) data
;
5627 tree decl
= (tree
) n
->key
;
5628 unsigned flags
= n
->value
;
5629 enum omp_clause_code code
;
5633 if (flags
& (GOVD_EXPLICIT
| GOVD_LOCAL
))
5635 if ((flags
& GOVD_SEEN
) == 0)
5637 if (flags
& GOVD_DEBUG_PRIVATE
)
5639 gcc_assert ((flags
& GOVD_DATA_SHARE_CLASS
) == GOVD_PRIVATE
);
5640 private_debug
= true;
5644 = lang_hooks
.decls
.omp_private_debug_clause (decl
,
5645 !!(flags
& GOVD_SHARED
));
5647 code
= OMP_CLAUSE_PRIVATE
;
5648 else if (flags
& GOVD_SHARED
)
5650 if (is_global_var (decl
))
5652 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
->outer_context
;
5656 = splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
5657 if (on
&& (on
->value
& (GOVD_FIRSTPRIVATE
| GOVD_LASTPRIVATE
5658 | GOVD_PRIVATE
| GOVD_REDUCTION
)) != 0)
5660 ctx
= ctx
->outer_context
;
5665 code
= OMP_CLAUSE_SHARED
;
5667 else if (flags
& GOVD_PRIVATE
)
5668 code
= OMP_CLAUSE_PRIVATE
;
5669 else if (flags
& GOVD_FIRSTPRIVATE
)
5670 code
= OMP_CLAUSE_FIRSTPRIVATE
;
5674 clause
= build_omp_clause (code
);
5675 OMP_CLAUSE_DECL (clause
) = decl
;
5676 OMP_CLAUSE_CHAIN (clause
) = *list_p
;
5678 OMP_CLAUSE_PRIVATE_DEBUG (clause
) = 1;
5679 else if (code
== OMP_CLAUSE_PRIVATE
&& (flags
& GOVD_PRIVATE_OUTER_REF
))
5680 OMP_CLAUSE_PRIVATE_OUTER_REF (clause
) = 1;
5682 lang_hooks
.decls
.omp_finish_clause (clause
);
5688 gimplify_adjust_omp_clauses (tree
*list_p
)
5690 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
5693 while ((c
= *list_p
) != NULL
)
5696 bool remove
= false;
5698 switch (OMP_CLAUSE_CODE (c
))
5700 case OMP_CLAUSE_PRIVATE
:
5701 case OMP_CLAUSE_SHARED
:
5702 case OMP_CLAUSE_FIRSTPRIVATE
:
5703 decl
= OMP_CLAUSE_DECL (c
);
5704 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
5705 remove
= !(n
->value
& GOVD_SEEN
);
5708 bool shared
= OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_SHARED
;
5709 if ((n
->value
& GOVD_DEBUG_PRIVATE
)
5710 || lang_hooks
.decls
.omp_private_debug_clause (decl
, shared
))
5712 gcc_assert ((n
->value
& GOVD_DEBUG_PRIVATE
) == 0
5713 || ((n
->value
& GOVD_DATA_SHARE_CLASS
)
5715 OMP_CLAUSE_SET_CODE (c
, OMP_CLAUSE_PRIVATE
);
5716 OMP_CLAUSE_PRIVATE_DEBUG (c
) = 1;
5721 case OMP_CLAUSE_LASTPRIVATE
:
5722 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
5723 accurately reflect the presence of a FIRSTPRIVATE clause. */
5724 decl
= OMP_CLAUSE_DECL (c
);
5725 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
5726 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c
)
5727 = (n
->value
& GOVD_FIRSTPRIVATE
) != 0;
5730 case OMP_CLAUSE_REDUCTION
:
5731 case OMP_CLAUSE_COPYIN
:
5732 case OMP_CLAUSE_COPYPRIVATE
:
5734 case OMP_CLAUSE_NUM_THREADS
:
5735 case OMP_CLAUSE_SCHEDULE
:
5736 case OMP_CLAUSE_NOWAIT
:
5737 case OMP_CLAUSE_ORDERED
:
5738 case OMP_CLAUSE_DEFAULT
:
5739 case OMP_CLAUSE_UNTIED
:
5740 case OMP_CLAUSE_COLLAPSE
:
5748 *list_p
= OMP_CLAUSE_CHAIN (c
);
5750 list_p
= &OMP_CLAUSE_CHAIN (c
);
5753 /* Add in any implicit data sharing. */
5754 splay_tree_foreach (ctx
->variables
, gimplify_adjust_omp_clauses_1
, list_p
);
5756 gimplify_omp_ctxp
= ctx
->outer_context
;
5757 delete_omp_context (ctx
);
5760 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
5761 gimplification of the body, as well as scanning the body for used
5762 variables. We need to do this scan now, because variable-sized
5763 decls will be decomposed during gimplification. */
5766 gimplify_omp_parallel (tree
*expr_p
, gimple_seq
*pre_p
)
5768 tree expr
= *expr_p
;
5770 gimple_seq body
= NULL
;
5771 struct gimplify_ctx gctx
;
5773 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
), pre_p
,
5774 OMP_PARALLEL_COMBINED (expr
)
5775 ? ORT_COMBINED_PARALLEL
5778 push_gimplify_context (&gctx
);
5780 g
= gimplify_and_return_first (OMP_PARALLEL_BODY (expr
), &body
);
5781 if (gimple_code (g
) == GIMPLE_BIND
)
5782 pop_gimplify_context (g
);
5784 pop_gimplify_context (NULL
);
5786 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
));
5788 g
= gimple_build_omp_parallel (body
,
5789 OMP_PARALLEL_CLAUSES (expr
),
5790 NULL_TREE
, NULL_TREE
);
5791 if (OMP_PARALLEL_COMBINED (expr
))
5792 gimple_omp_set_subcode (g
, GF_OMP_PARALLEL_COMBINED
);
5793 gimplify_seq_add_stmt (pre_p
, g
);
5794 *expr_p
= NULL_TREE
;
5797 /* Gimplify the contents of an OMP_TASK statement. This involves
5798 gimplification of the body, as well as scanning the body for used
5799 variables. We need to do this scan now, because variable-sized
5800 decls will be decomposed during gimplification. */
5803 gimplify_omp_task (tree
*expr_p
, gimple_seq
*pre_p
)
5805 tree expr
= *expr_p
;
5807 gimple_seq body
= NULL
;
5808 struct gimplify_ctx gctx
;
5810 gimplify_scan_omp_clauses (&OMP_TASK_CLAUSES (expr
), pre_p
, ORT_TASK
);
5812 push_gimplify_context (&gctx
);
5814 g
= gimplify_and_return_first (OMP_TASK_BODY (expr
), &body
);
5815 if (gimple_code (g
) == GIMPLE_BIND
)
5816 pop_gimplify_context (g
);
5818 pop_gimplify_context (NULL
);
5820 gimplify_adjust_omp_clauses (&OMP_TASK_CLAUSES (expr
));
5822 g
= gimple_build_omp_task (body
,
5823 OMP_TASK_CLAUSES (expr
),
5824 NULL_TREE
, NULL_TREE
,
5825 NULL_TREE
, NULL_TREE
, NULL_TREE
);
5826 gimplify_seq_add_stmt (pre_p
, g
);
5827 *expr_p
= NULL_TREE
;
5830 /* Gimplify the gross structure of an OMP_FOR statement. */
5832 static enum gimplify_status
5833 gimplify_omp_for (tree
*expr_p
, gimple_seq
*pre_p
)
5835 tree for_stmt
, decl
, var
, t
;
5836 enum gimplify_status ret
= GS_OK
;
5838 gimple_seq for_body
, for_pre_body
;
5843 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
), pre_p
,
5846 /* Handle OMP_FOR_INIT. */
5847 for_pre_body
= NULL
;
5848 gimplify_and_add (OMP_FOR_PRE_BODY (for_stmt
), &for_pre_body
);
5849 OMP_FOR_PRE_BODY (for_stmt
) = NULL_TREE
;
5851 for_body
= gimple_seq_alloc ();
5852 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
))
5853 == TREE_VEC_LENGTH (OMP_FOR_COND (for_stmt
)));
5854 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
))
5855 == TREE_VEC_LENGTH (OMP_FOR_INCR (for_stmt
)));
5856 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)); i
++)
5858 t
= TREE_VEC_ELT (OMP_FOR_INIT (for_stmt
), i
);
5859 gcc_assert (TREE_CODE (t
) == MODIFY_EXPR
);
5860 decl
= TREE_OPERAND (t
, 0);
5861 gcc_assert (DECL_P (decl
));
5862 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl
))
5863 || POINTER_TYPE_P (TREE_TYPE (decl
)));
5865 /* Make sure the iteration variable is private. */
5866 if (omp_is_private (gimplify_omp_ctxp
, decl
))
5867 omp_notice_variable (gimplify_omp_ctxp
, decl
, true);
5869 omp_add_variable (gimplify_omp_ctxp
, decl
, GOVD_PRIVATE
| GOVD_SEEN
);
5871 /* If DECL is not a gimple register, create a temporary variable to act
5872 as an iteration counter. This is valid, since DECL cannot be
5873 modified in the body of the loop. */
5874 if (!is_gimple_reg (decl
))
5876 var
= create_tmp_var (TREE_TYPE (decl
), get_name (decl
));
5877 TREE_OPERAND (t
, 0) = var
;
5879 gimplify_seq_add_stmt (&for_body
, gimple_build_assign (decl
, var
));
5881 omp_add_variable (gimplify_omp_ctxp
, var
, GOVD_PRIVATE
| GOVD_SEEN
);
5886 ret
|= gimplify_expr (&TREE_OPERAND (t
, 1), &for_pre_body
, NULL
,
5887 is_gimple_val
, fb_rvalue
);
5888 if (ret
== GS_ERROR
)
5891 /* Handle OMP_FOR_COND. */
5892 t
= TREE_VEC_ELT (OMP_FOR_COND (for_stmt
), i
);
5893 gcc_assert (COMPARISON_CLASS_P (t
));
5894 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
5896 ret
|= gimplify_expr (&TREE_OPERAND (t
, 1), &for_pre_body
, NULL
,
5897 is_gimple_val
, fb_rvalue
);
5899 /* Handle OMP_FOR_INCR. */
5900 t
= TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
);
5901 switch (TREE_CODE (t
))
5903 case PREINCREMENT_EXPR
:
5904 case POSTINCREMENT_EXPR
:
5905 t
= build_int_cst (TREE_TYPE (decl
), 1);
5906 t
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), var
, t
);
5907 t
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, t
);
5908 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
) = t
;
5911 case PREDECREMENT_EXPR
:
5912 case POSTDECREMENT_EXPR
:
5913 t
= build_int_cst (TREE_TYPE (decl
), -1);
5914 t
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), var
, t
);
5915 t
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, t
);
5916 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
) = t
;
5920 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
5921 TREE_OPERAND (t
, 0) = var
;
5923 t
= TREE_OPERAND (t
, 1);
5924 switch (TREE_CODE (t
))
5927 if (TREE_OPERAND (t
, 1) == decl
)
5929 TREE_OPERAND (t
, 1) = TREE_OPERAND (t
, 0);
5930 TREE_OPERAND (t
, 0) = var
;
5936 case POINTER_PLUS_EXPR
:
5937 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
5938 TREE_OPERAND (t
, 0) = var
;
5944 ret
|= gimplify_expr (&TREE_OPERAND (t
, 1), &for_pre_body
, NULL
,
5945 is_gimple_val
, fb_rvalue
);
5952 if (var
!= decl
|| TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)) > 1)
5955 for (c
= OMP_FOR_CLAUSES (for_stmt
); c
; c
= OMP_CLAUSE_CHAIN (c
))
5956 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
5957 && OMP_CLAUSE_DECL (c
) == decl
5958 && OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
) == NULL
)
5960 t
= TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
);
5961 gcc_assert (TREE_CODE (t
) == MODIFY_EXPR
);
5962 gcc_assert (TREE_OPERAND (t
, 0) == var
);
5963 t
= TREE_OPERAND (t
, 1);
5964 gcc_assert (TREE_CODE (t
) == PLUS_EXPR
5965 || TREE_CODE (t
) == MINUS_EXPR
5966 || TREE_CODE (t
) == POINTER_PLUS_EXPR
);
5967 gcc_assert (TREE_OPERAND (t
, 0) == var
);
5968 t
= build2 (TREE_CODE (t
), TREE_TYPE (decl
), decl
,
5969 TREE_OPERAND (t
, 1));
5970 gimplify_assign (decl
, t
,
5971 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
));
5976 gimplify_and_add (OMP_FOR_BODY (for_stmt
), &for_body
);
5978 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
));
5980 gfor
= gimple_build_omp_for (for_body
, OMP_FOR_CLAUSES (for_stmt
),
5981 TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)),
5984 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)); i
++)
5986 t
= TREE_VEC_ELT (OMP_FOR_INIT (for_stmt
), i
);
5987 gimple_omp_for_set_index (gfor
, i
, TREE_OPERAND (t
, 0));
5988 gimple_omp_for_set_initial (gfor
, i
, TREE_OPERAND (t
, 1));
5989 t
= TREE_VEC_ELT (OMP_FOR_COND (for_stmt
), i
);
5990 gimple_omp_for_set_cond (gfor
, i
, TREE_CODE (t
));
5991 gimple_omp_for_set_final (gfor
, i
, TREE_OPERAND (t
, 1));
5992 t
= TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
);
5993 gimple_omp_for_set_incr (gfor
, i
, TREE_OPERAND (t
, 1));
5996 gimplify_seq_add_stmt (pre_p
, gfor
);
5997 return ret
== GS_ALL_DONE
? GS_ALL_DONE
: GS_ERROR
;
6000 /* Gimplify the gross structure of other OpenMP worksharing constructs.
6001 In particular, OMP_SECTIONS and OMP_SINGLE. */
6004 gimplify_omp_workshare (tree
*expr_p
, gimple_seq
*pre_p
)
6006 tree expr
= *expr_p
;
6008 gimple_seq body
= NULL
;
6010 gimplify_scan_omp_clauses (&OMP_CLAUSES (expr
), pre_p
, ORT_WORKSHARE
);
6011 gimplify_and_add (OMP_BODY (expr
), &body
);
6012 gimplify_adjust_omp_clauses (&OMP_CLAUSES (expr
));
6014 if (TREE_CODE (expr
) == OMP_SECTIONS
)
6015 stmt
= gimple_build_omp_sections (body
, OMP_CLAUSES (expr
));
6016 else if (TREE_CODE (expr
) == OMP_SINGLE
)
6017 stmt
= gimple_build_omp_single (body
, OMP_CLAUSES (expr
));
6021 gimplify_seq_add_stmt (pre_p
, stmt
);
6024 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
6025 stabilized the lhs of the atomic operation as *ADDR. Return true if
6026 EXPR is this stabilized form. */
6029 goa_lhs_expr_p (tree expr
, tree addr
)
6031 /* Also include casts to other type variants. The C front end is fond
6032 of adding these for e.g. volatile variables. This is like
6033 STRIP_TYPE_NOPS but includes the main variant lookup. */
6034 while ((CONVERT_EXPR_P (expr
)
6035 || TREE_CODE (expr
) == NON_LVALUE_EXPR
)
6036 && TREE_OPERAND (expr
, 0) != error_mark_node
6037 && (TYPE_MAIN_VARIANT (TREE_TYPE (expr
))
6038 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (expr
, 0)))))
6039 expr
= TREE_OPERAND (expr
, 0);
6041 if (TREE_CODE (expr
) == INDIRECT_REF
)
6043 expr
= TREE_OPERAND (expr
, 0);
6045 && (CONVERT_EXPR_P (expr
)
6046 || TREE_CODE (expr
) == NON_LVALUE_EXPR
)
6047 && TREE_CODE (expr
) == TREE_CODE (addr
)
6048 && TYPE_MAIN_VARIANT (TREE_TYPE (expr
))
6049 == TYPE_MAIN_VARIANT (TREE_TYPE (addr
)))
6051 expr
= TREE_OPERAND (expr
, 0);
6052 addr
= TREE_OPERAND (addr
, 0);
6056 return (TREE_CODE (addr
) == ADDR_EXPR
6057 && TREE_CODE (expr
) == ADDR_EXPR
6058 && TREE_OPERAND (addr
, 0) == TREE_OPERAND (expr
, 0));
6060 if (TREE_CODE (addr
) == ADDR_EXPR
&& expr
== TREE_OPERAND (addr
, 0))
6065 /* Walk *EXPR_P and replace
6066 appearances of *LHS_ADDR with LHS_VAR. If an expression does not involve
6067 the lhs, evaluate it into a temporary. Return 1 if the lhs appeared as
6068 a subexpression, 0 if it did not, or -1 if an error was encountered. */
6071 goa_stabilize_expr (tree
*expr_p
, gimple_seq
*pre_p
, tree lhs_addr
,
6074 tree expr
= *expr_p
;
6077 if (goa_lhs_expr_p (expr
, lhs_addr
))
6082 if (is_gimple_val (expr
))
6086 switch (TREE_CODE_CLASS (TREE_CODE (expr
)))
6089 case tcc_comparison
:
6090 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 1), pre_p
, lhs_addr
,
6093 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 0), pre_p
, lhs_addr
,
6096 case tcc_expression
:
6097 switch (TREE_CODE (expr
))
6099 case TRUTH_ANDIF_EXPR
:
6100 case TRUTH_ORIF_EXPR
:
6101 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 1), pre_p
,
6103 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 0), pre_p
,
6116 enum gimplify_status gs
;
6117 gs
= gimplify_expr (expr_p
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
);
6118 if (gs
!= GS_ALL_DONE
)
6126 /* Gimplify an OMP_ATOMIC statement. */
6128 static enum gimplify_status
6129 gimplify_omp_atomic (tree
*expr_p
, gimple_seq
*pre_p
)
6131 tree addr
= TREE_OPERAND (*expr_p
, 0);
6132 tree rhs
= TREE_OPERAND (*expr_p
, 1);
6133 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr
)));
6136 tmp_load
= create_tmp_var (type
, NULL
);
6137 if (goa_stabilize_expr (&rhs
, pre_p
, addr
, tmp_load
) < 0)
6140 if (gimplify_expr (&addr
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
)
6144 gimplify_seq_add_stmt (pre_p
, gimple_build_omp_atomic_load (tmp_load
, addr
));
6145 if (gimplify_expr (&rhs
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
)
6148 gimplify_seq_add_stmt (pre_p
, gimple_build_omp_atomic_store (rhs
));
6155 /* Converts the GENERIC expression tree *EXPR_P to GIMPLE. If the
6156 expression produces a value to be used as an operand inside a GIMPLE
6157 statement, the value will be stored back in *EXPR_P. This value will
6158 be a tree of class tcc_declaration, tcc_constant, tcc_reference or
6159 an SSA_NAME. The corresponding sequence of GIMPLE statements is
6160 emitted in PRE_P and POST_P.
6162 Additionally, this process may overwrite parts of the input
6163 expression during gimplification. Ideally, it should be
6164 possible to do non-destructive gimplification.
6166 EXPR_P points to the GENERIC expression to convert to GIMPLE. If
6167 the expression needs to evaluate to a value to be used as
6168 an operand in a GIMPLE statement, this value will be stored in
6169 *EXPR_P on exit. This happens when the caller specifies one
6170 of fb_lvalue or fb_rvalue fallback flags.
6172 PRE_P will contain the sequence of GIMPLE statements corresponding
6173 to the evaluation of EXPR and all the side-effects that must
6174 be executed before the main expression. On exit, the last
6175 statement of PRE_P is the core statement being gimplified. For
6176 instance, when gimplifying 'if (++a)' the last statement in
6177 PRE_P will be 'if (t.1)' where t.1 is the result of
6178 pre-incrementing 'a'.
6180 POST_P will contain the sequence of GIMPLE statements corresponding
6181 to the evaluation of all the side-effects that must be executed
6182 after the main expression. If this is NULL, the post
6183 side-effects are stored at the end of PRE_P.
6185 The reason why the output is split in two is to handle post
6186 side-effects explicitly. In some cases, an expression may have
6187 inner and outer post side-effects which need to be emitted in
6188 an order different from the one given by the recursive
6189 traversal. For instance, for the expression (*p--)++ the post
6190 side-effects of '--' must actually occur *after* the post
6191 side-effects of '++'. However, gimplification will first visit
6192 the inner expression, so if a separate POST sequence was not
6193 used, the resulting sequence would be:
6200 However, the post-decrement operation in line #2 must not be
6201 evaluated until after the store to *p at line #4, so the
6202 correct sequence should be:
6209 So, by specifying a separate post queue, it is possible
6210 to emit the post side-effects in the correct order.
6211 If POST_P is NULL, an internal queue will be used. Before
6212 returning to the caller, the sequence POST_P is appended to
6213 the main output sequence PRE_P.
6215 GIMPLE_TEST_F points to a function that takes a tree T and
6216 returns nonzero if T is in the GIMPLE form requested by the
6217 caller. The GIMPLE predicates are in tree-gimple.c.
6219 FALLBACK tells the function what sort of a temporary we want if
6220 gimplification cannot produce an expression that complies with
6223 fb_none means that no temporary should be generated
6224 fb_rvalue means that an rvalue is OK to generate
6225 fb_lvalue means that an lvalue is OK to generate
6226 fb_either means that either is OK, but an lvalue is preferable.
6227 fb_mayfail means that gimplification may fail (in which case
6228 GS_ERROR will be returned)
6230 The return value is either GS_ERROR or GS_ALL_DONE, since this
6231 function iterates until EXPR is completely gimplified or an error
6234 enum gimplify_status
6235 gimplify_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
6236 bool (*gimple_test_f
) (tree
), fallback_t fallback
)
6239 gimple_seq internal_pre
= NULL
;
6240 gimple_seq internal_post
= NULL
;
6243 location_t saved_location
;
6244 enum gimplify_status ret
;
6245 gimple_stmt_iterator pre_last_gsi
, post_last_gsi
;
6247 save_expr
= *expr_p
;
6248 if (save_expr
== NULL_TREE
)
6251 /* If we are gimplifying a top-level statement, PRE_P must be valid. */
6252 is_statement
= gimple_test_f
== is_gimple_stmt
;
6256 /* Consistency checks. */
6257 if (gimple_test_f
== is_gimple_reg
)
6258 gcc_assert (fallback
& (fb_rvalue
| fb_lvalue
));
6259 else if (gimple_test_f
== is_gimple_val
6260 || gimple_test_f
== is_gimple_formal_tmp_rhs
6261 || gimple_test_f
== is_gimple_formal_tmp_or_call_rhs
6262 || gimple_test_f
== is_gimple_formal_tmp_reg
6263 || gimple_test_f
== is_gimple_formal_tmp_var
6264 || gimple_test_f
== is_gimple_call_addr
6265 || gimple_test_f
== is_gimple_condexpr
6266 || gimple_test_f
== is_gimple_mem_rhs
6267 || gimple_test_f
== is_gimple_mem_or_call_rhs
6268 || gimple_test_f
== is_gimple_reg_rhs
6269 || gimple_test_f
== is_gimple_reg_or_call_rhs
6270 || gimple_test_f
== is_gimple_asm_val
)
6271 gcc_assert (fallback
& fb_rvalue
);
6272 else if (gimple_test_f
== is_gimple_min_lval
6273 || gimple_test_f
== is_gimple_lvalue
)
6274 gcc_assert (fallback
& fb_lvalue
);
6275 else if (gimple_test_f
== is_gimple_addressable
)
6276 gcc_assert (fallback
& fb_either
);
6277 else if (gimple_test_f
== is_gimple_stmt
)
6278 gcc_assert (fallback
== fb_none
);
6281 /* We should have recognized the GIMPLE_TEST_F predicate to
6282 know what kind of fallback to use in case a temporary is
6283 needed to hold the value or address of *EXPR_P. */
6287 /* We used to check the predicate here and return immediately if it
6288 succeeds. This is wrong; the design is for gimplification to be
6289 idempotent, and for the predicates to only test for valid forms, not
6290 whether they are fully simplified. */
6292 pre_p
= &internal_pre
;
6295 post_p
= &internal_post
;
6297 /* Remember the last statements added to PRE_P and POST_P. Every
6298 new statement added by the gimplification helpers needs to be
6299 annotated with location information. To centralize the
6300 responsibility, we remember the last statement that had been
6301 added to both queues before gimplifying *EXPR_P. If
6302 gimplification produces new statements in PRE_P and POST_P, those
6303 statements will be annotated with the same location information
6305 pre_last_gsi
= gsi_last (*pre_p
);
6306 post_last_gsi
= gsi_last (*post_p
);
6308 saved_location
= input_location
;
6309 if (save_expr
!= error_mark_node
6310 && EXPR_HAS_LOCATION (*expr_p
))
6311 input_location
= EXPR_LOCATION (*expr_p
);
6313 /* Loop over the specific gimplifiers until the toplevel node
6314 remains the same. */
6317 /* Strip away as many useless type conversions as possible
6319 STRIP_USELESS_TYPE_CONVERSION (*expr_p
);
6321 /* Remember the expr. */
6322 save_expr
= *expr_p
;
6324 /* Die, die, die, my darling. */
6325 if (save_expr
== error_mark_node
6326 || (TREE_TYPE (save_expr
)
6327 && TREE_TYPE (save_expr
) == error_mark_node
))
6333 /* Do any language-specific gimplification. */
6334 ret
= lang_hooks
.gimplify_expr (expr_p
, pre_p
, post_p
);
6337 if (*expr_p
== NULL_TREE
)
6339 if (*expr_p
!= save_expr
)
6342 else if (ret
!= GS_UNHANDLED
)
6346 switch (TREE_CODE (*expr_p
))
6348 /* First deal with the special cases. */
6350 case POSTINCREMENT_EXPR
:
6351 case POSTDECREMENT_EXPR
:
6352 case PREINCREMENT_EXPR
:
6353 case PREDECREMENT_EXPR
:
6354 ret
= gimplify_self_mod_expr (expr_p
, pre_p
, post_p
,
6355 fallback
!= fb_none
);
6359 case ARRAY_RANGE_REF
:
6363 case VIEW_CONVERT_EXPR
:
6364 ret
= gimplify_compound_lval (expr_p
, pre_p
, post_p
,
6365 fallback
? fallback
: fb_rvalue
);
6369 ret
= gimplify_cond_expr (expr_p
, pre_p
, fallback
);
6371 /* C99 code may assign to an array in a structure value of a
6372 conditional expression, and this has undefined behavior
6373 only on execution, so create a temporary if an lvalue is
6375 if (fallback
== fb_lvalue
)
6377 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
6378 mark_addressable (*expr_p
);
6383 ret
= gimplify_call_expr (expr_p
, pre_p
, fallback
!= fb_none
);
6385 /* C99 code may assign to an array in a structure returned
6386 from a function, and this has undefined behavior only on
6387 execution, so create a temporary if an lvalue is
6389 if (fallback
== fb_lvalue
)
6391 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
6392 mark_addressable (*expr_p
);
6400 ret
= gimplify_compound_expr (expr_p
, pre_p
, fallback
!= fb_none
);
6405 ret
= gimplify_modify_expr (expr_p
, pre_p
, post_p
,
6406 fallback
!= fb_none
);
6409 case TRUTH_ANDIF_EXPR
:
6410 case TRUTH_ORIF_EXPR
:
6411 ret
= gimplify_boolean_expr (expr_p
);
6414 case TRUTH_NOT_EXPR
:
6415 if (TREE_CODE (TREE_TYPE (*expr_p
)) != BOOLEAN_TYPE
)
6417 tree type
= TREE_TYPE (*expr_p
);
6418 *expr_p
= fold_convert (type
, gimple_boolify (*expr_p
));
6423 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
6424 is_gimple_val
, fb_rvalue
);
6425 recalculate_side_effects (*expr_p
);
6429 ret
= gimplify_addr_expr (expr_p
, pre_p
, post_p
);
6433 ret
= gimplify_va_arg_expr (expr_p
, pre_p
, post_p
);
6437 if (IS_EMPTY_STMT (*expr_p
))
6443 if (VOID_TYPE_P (TREE_TYPE (*expr_p
))
6444 || fallback
== fb_none
)
6446 /* Just strip a conversion to void (or in void context) and
6448 *expr_p
= TREE_OPERAND (*expr_p
, 0);
6452 ret
= gimplify_conversion (expr_p
);
6453 if (ret
== GS_ERROR
)
6455 if (*expr_p
!= save_expr
)
6459 case FIX_TRUNC_EXPR
:
6460 /* unary_expr: ... | '(' cast ')' val | ... */
6461 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
6462 is_gimple_val
, fb_rvalue
);
6463 recalculate_side_effects (*expr_p
);
6467 *expr_p
= fold_indirect_ref (*expr_p
);
6468 if (*expr_p
!= save_expr
)
6470 /* else fall through. */
6471 case ALIGN_INDIRECT_REF
:
6472 case MISALIGNED_INDIRECT_REF
:
6473 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
6474 is_gimple_reg
, fb_rvalue
);
6475 recalculate_side_effects (*expr_p
);
6478 /* Constants need not be gimplified. */
6489 /* If we require an lvalue, such as for ADDR_EXPR, retain the
6490 CONST_DECL node. Otherwise the decl is replaceable by its
6492 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
6493 if (fallback
& fb_lvalue
)
6496 *expr_p
= DECL_INITIAL (*expr_p
);
6500 ret
= gimplify_decl_expr (expr_p
, pre_p
);
6504 /* FIXME make this a decl. */
6509 ret
= gimplify_bind_expr (expr_p
, pre_p
);
6513 ret
= gimplify_loop_expr (expr_p
, pre_p
);
6517 ret
= gimplify_switch_expr (expr_p
, pre_p
);
6521 ret
= gimplify_exit_expr (expr_p
);
6525 /* If the target is not LABEL, then it is a computed jump
6526 and the target needs to be gimplified. */
6527 if (TREE_CODE (GOTO_DESTINATION (*expr_p
)) != LABEL_DECL
)
6529 ret
= gimplify_expr (&GOTO_DESTINATION (*expr_p
), pre_p
,
6530 NULL
, is_gimple_val
, fb_rvalue
);
6531 if (ret
== GS_ERROR
)
6534 gimplify_seq_add_stmt (pre_p
,
6535 gimple_build_goto (GOTO_DESTINATION (*expr_p
)));
6539 gimplify_seq_add_stmt (pre_p
,
6540 gimple_build_predict (PREDICT_EXPR_PREDICTOR (*expr_p
),
6541 PREDICT_EXPR_OUTCOME (*expr_p
)));
6547 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p
))
6548 == current_function_decl
);
6549 gimplify_seq_add_stmt (pre_p
,
6550 gimple_build_label (LABEL_EXPR_LABEL (*expr_p
)));
6553 case CASE_LABEL_EXPR
:
6554 ret
= gimplify_case_label_expr (expr_p
, pre_p
);
6558 ret
= gimplify_return_expr (*expr_p
, pre_p
);
6562 /* Don't reduce this in place; let gimplify_init_constructor work its
6563 magic. Buf if we're just elaborating this for side effects, just
6564 gimplify any element that has side-effects. */
6565 if (fallback
== fb_none
)
6567 unsigned HOST_WIDE_INT ix
;
6568 constructor_elt
*ce
;
6569 tree temp
= NULL_TREE
;
6571 VEC_iterate (constructor_elt
, CONSTRUCTOR_ELTS (*expr_p
),
6574 if (TREE_SIDE_EFFECTS (ce
->value
))
6575 append_to_statement_list (ce
->value
, &temp
);
6580 /* C99 code may assign to an array in a constructed
6581 structure or union, and this has undefined behavior only
6582 on execution, so create a temporary if an lvalue is
6584 else if (fallback
== fb_lvalue
)
6586 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
6587 mark_addressable (*expr_p
);
6593 /* The following are special cases that are not handled by the
6594 original GIMPLE grammar. */
6596 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
6599 ret
= gimplify_save_expr (expr_p
, pre_p
, post_p
);
6604 enum gimplify_status r0
, r1
, r2
;
6606 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
6607 post_p
, is_gimple_lvalue
, fb_either
);
6608 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
,
6609 post_p
, is_gimple_val
, fb_rvalue
);
6610 r2
= gimplify_expr (&TREE_OPERAND (*expr_p
, 2), pre_p
,
6611 post_p
, is_gimple_val
, fb_rvalue
);
6612 recalculate_side_effects (*expr_p
);
6614 ret
= MIN (r0
, MIN (r1
, r2
));
6618 case NON_LVALUE_EXPR
:
6619 /* This should have been stripped above. */
6623 ret
= gimplify_asm_expr (expr_p
, pre_p
, post_p
);
6626 case TRY_FINALLY_EXPR
:
6627 case TRY_CATCH_EXPR
:
6629 gimple_seq eval
, cleanup
;
6632 eval
= cleanup
= NULL
;
6633 gimplify_and_add (TREE_OPERAND (*expr_p
, 0), &eval
);
6634 gimplify_and_add (TREE_OPERAND (*expr_p
, 1), &cleanup
);
6635 /* Don't create bogus GIMPLE_TRY with empty cleanup. */
6636 if (gimple_seq_empty_p (cleanup
))
6638 gimple_seq_add_seq (pre_p
, eval
);
6642 try_
= gimple_build_try (eval
, cleanup
,
6643 TREE_CODE (*expr_p
) == TRY_FINALLY_EXPR
6644 ? GIMPLE_TRY_FINALLY
6645 : GIMPLE_TRY_CATCH
);
6646 if (TREE_CODE (*expr_p
) == TRY_CATCH_EXPR
)
6647 gimple_try_set_catch_is_cleanup (try_
,
6648 TRY_CATCH_IS_CLEANUP (*expr_p
));
6649 gimplify_seq_add_stmt (pre_p
, try_
);
6654 case CLEANUP_POINT_EXPR
:
6655 ret
= gimplify_cleanup_point_expr (expr_p
, pre_p
);
6659 ret
= gimplify_target_expr (expr_p
, pre_p
, post_p
);
6665 gimple_seq handler
= NULL
;
6666 gimplify_and_add (CATCH_BODY (*expr_p
), &handler
);
6667 c
= gimple_build_catch (CATCH_TYPES (*expr_p
), handler
);
6668 gimplify_seq_add_stmt (pre_p
, c
);
6673 case EH_FILTER_EXPR
:
6676 gimple_seq failure
= NULL
;
6678 gimplify_and_add (EH_FILTER_FAILURE (*expr_p
), &failure
);
6679 ehf
= gimple_build_eh_filter (EH_FILTER_TYPES (*expr_p
), failure
);
6680 gimple_eh_filter_set_must_not_throw
6681 (ehf
, EH_FILTER_MUST_NOT_THROW (*expr_p
));
6682 gimplify_seq_add_stmt (pre_p
, ehf
);
6687 case CHANGE_DYNAMIC_TYPE_EXPR
:
6691 ret
= gimplify_expr (&CHANGE_DYNAMIC_TYPE_LOCATION (*expr_p
),
6692 pre_p
, post_p
, is_gimple_reg
, fb_lvalue
);
6693 cdt
= gimple_build_cdt (CHANGE_DYNAMIC_TYPE_NEW_TYPE (*expr_p
),
6694 CHANGE_DYNAMIC_TYPE_LOCATION (*expr_p
));
6695 gimplify_seq_add_stmt (pre_p
, cdt
);
6702 enum gimplify_status r0
, r1
;
6703 r0
= gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p
), pre_p
,
6704 post_p
, is_gimple_val
, fb_rvalue
);
6705 r1
= gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p
), pre_p
,
6706 post_p
, is_gimple_val
, fb_rvalue
);
6707 TREE_SIDE_EFFECTS (*expr_p
) = 0;
6713 /* We get here when taking the address of a label. We mark
6714 the label as "forced"; meaning it can never be removed and
6715 it is a potential target for any computed goto. */
6716 FORCED_LABEL (*expr_p
) = 1;
6720 case STATEMENT_LIST
:
6721 ret
= gimplify_statement_list (expr_p
, pre_p
);
6724 case WITH_SIZE_EXPR
:
6726 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
6727 post_p
== &internal_post
? NULL
: post_p
,
6728 gimple_test_f
, fallback
);
6729 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
6730 is_gimple_val
, fb_rvalue
);
6736 ret
= gimplify_var_or_parm_decl (expr_p
);
6740 /* When within an OpenMP context, notice uses of variables. */
6741 if (gimplify_omp_ctxp
)
6742 omp_notice_variable (gimplify_omp_ctxp
, *expr_p
, true);
6747 /* Allow callbacks into the gimplifier during optimization. */
6752 gimplify_omp_parallel (expr_p
, pre_p
);
6757 gimplify_omp_task (expr_p
, pre_p
);
6762 ret
= gimplify_omp_for (expr_p
, pre_p
);
6767 gimplify_omp_workshare (expr_p
, pre_p
);
6776 gimple_seq body
= NULL
;
6779 gimplify_and_add (OMP_BODY (*expr_p
), &body
);
6780 switch (TREE_CODE (*expr_p
))
6783 g
= gimple_build_omp_section (body
);
6786 g
= gimple_build_omp_master (body
);
6789 g
= gimple_build_omp_ordered (body
);
6792 g
= gimple_build_omp_critical (body
,
6793 OMP_CRITICAL_NAME (*expr_p
));
6798 gimplify_seq_add_stmt (pre_p
, g
);
6804 ret
= gimplify_omp_atomic (expr_p
, pre_p
);
6807 case POINTER_PLUS_EXPR
:
6808 /* Convert ((type *)A)+offset into &A->field_of_type_and_offset.
6809 The second is gimple immediate saving a need for extra statement.
6811 if (TREE_CODE (TREE_OPERAND (*expr_p
, 1)) == INTEGER_CST
6812 && (tmp
= maybe_fold_offset_to_address
6813 (TREE_OPERAND (*expr_p
, 0), TREE_OPERAND (*expr_p
, 1),
6814 TREE_TYPE (*expr_p
))))
6819 /* Convert (void *)&a + 4 into (void *)&a[1]. */
6820 if (TREE_CODE (TREE_OPERAND (*expr_p
, 0)) == NOP_EXPR
6821 && TREE_CODE (TREE_OPERAND (*expr_p
, 1)) == INTEGER_CST
6822 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p
,
6824 && (tmp
= maybe_fold_offset_to_address
6825 (TREE_OPERAND (TREE_OPERAND (*expr_p
, 0), 0),
6826 TREE_OPERAND (*expr_p
, 1),
6827 TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p
, 0),
6830 *expr_p
= fold_convert (TREE_TYPE (*expr_p
), tmp
);
6836 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p
)))
6838 case tcc_comparison
:
6839 /* Handle comparison of objects of non scalar mode aggregates
6840 with a call to memcmp. It would be nice to only have to do
6841 this for variable-sized objects, but then we'd have to allow
6842 the same nest of reference nodes we allow for MODIFY_EXPR and
6845 Compare scalar mode aggregates as scalar mode values. Using
6846 memcmp for them would be very inefficient at best, and is
6847 plain wrong if bitfields are involved. */
6849 tree type
= TREE_TYPE (TREE_OPERAND (*expr_p
, 1));
6851 if (!AGGREGATE_TYPE_P (type
))
6853 else if (TYPE_MODE (type
) != BLKmode
)
6854 ret
= gimplify_scalar_mode_aggregate_compare (expr_p
);
6856 ret
= gimplify_variable_sized_compare (expr_p
);
6861 /* If *EXPR_P does not need to be special-cased, handle it
6862 according to its class. */
6864 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
6865 post_p
, is_gimple_val
, fb_rvalue
);
6871 enum gimplify_status r0
, r1
;
6873 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
6874 post_p
, is_gimple_val
, fb_rvalue
);
6875 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
,
6876 post_p
, is_gimple_val
, fb_rvalue
);
6882 case tcc_declaration
:
6885 goto dont_recalculate
;
6888 gcc_assert (TREE_CODE (*expr_p
) == TRUTH_AND_EXPR
6889 || TREE_CODE (*expr_p
) == TRUTH_OR_EXPR
6890 || TREE_CODE (*expr_p
) == TRUTH_XOR_EXPR
);
6894 recalculate_side_effects (*expr_p
);
6900 /* If we replaced *expr_p, gimplify again. */
6901 if (ret
== GS_OK
&& (*expr_p
== NULL
|| *expr_p
== save_expr
))
6904 while (ret
== GS_OK
);
6906 /* If we encountered an error_mark somewhere nested inside, either
6907 stub out the statement or propagate the error back out. */
6908 if (ret
== GS_ERROR
)
6915 /* This was only valid as a return value from the langhook, which
6916 we handled. Make sure it doesn't escape from any other context. */
6917 gcc_assert (ret
!= GS_UNHANDLED
);
6919 if (fallback
== fb_none
&& *expr_p
&& !is_gimple_stmt (*expr_p
))
6921 /* We aren't looking for a value, and we don't have a valid
6922 statement. If it doesn't have side-effects, throw it away. */
6923 if (!TREE_SIDE_EFFECTS (*expr_p
))
6925 else if (!TREE_THIS_VOLATILE (*expr_p
))
6927 /* This is probably a _REF that contains something nested that
6928 has side effects. Recurse through the operands to find it. */
6929 enum tree_code code
= TREE_CODE (*expr_p
);
6936 case VIEW_CONVERT_EXPR
:
6937 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
6938 gimple_test_f
, fallback
);
6942 case ARRAY_RANGE_REF
:
6943 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
6944 gimple_test_f
, fallback
);
6945 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
6946 gimple_test_f
, fallback
);
6950 /* Anything else with side-effects must be converted to
6951 a valid statement before we get here. */
6957 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p
))
6958 && TYPE_MODE (TREE_TYPE (*expr_p
)) != BLKmode
)
6960 /* Historically, the compiler has treated a bare reference
6961 to a non-BLKmode volatile lvalue as forcing a load. */
6962 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p
));
6964 /* Normally, we do not want to create a temporary for a
6965 TREE_ADDRESSABLE type because such a type should not be
6966 copied by bitwise-assignment. However, we make an
6967 exception here, as all we are doing here is ensuring that
6968 we read the bytes that make up the type. We use
6969 create_tmp_var_raw because create_tmp_var will abort when
6970 given a TREE_ADDRESSABLE type. */
6971 tree tmp
= create_tmp_var_raw (type
, "vol");
6972 gimple_add_tmp_var (tmp
);
6973 gimplify_assign (tmp
, *expr_p
, pre_p
);
6977 /* We can't do anything useful with a volatile reference to
6978 an incomplete type, so just throw it away. Likewise for
6979 a BLKmode type, since any implicit inner load should
6980 already have been turned into an explicit one by the
6981 gimplification process. */
6985 /* If we are gimplifying at the statement level, we're done. Tack
6986 everything together and return. */
6987 if (fallback
== fb_none
|| is_statement
)
6989 /* Since *EXPR_P has been converted into a GIMPLE tuple, clear
6990 it out for GC to reclaim it. */
6991 *expr_p
= NULL_TREE
;
6993 if (!gimple_seq_empty_p (internal_pre
)
6994 || !gimple_seq_empty_p (internal_post
))
6996 gimplify_seq_add_seq (&internal_pre
, internal_post
);
6997 gimplify_seq_add_seq (pre_p
, internal_pre
);
7000 /* The result of gimplifying *EXPR_P is going to be the last few
7001 statements in *PRE_P and *POST_P. Add location information
7002 to all the statements that were added by the gimplification
7004 if (!gimple_seq_empty_p (*pre_p
))
7005 annotate_all_with_location_after (*pre_p
, pre_last_gsi
, input_location
);
7007 if (!gimple_seq_empty_p (*post_p
))
7008 annotate_all_with_location_after (*post_p
, post_last_gsi
,
7014 #ifdef ENABLE_GIMPLE_CHECKING
7017 enum tree_code code
= TREE_CODE (*expr_p
);
7018 /* These expressions should already be in gimple IR form. */
7019 gcc_assert (code
!= MODIFY_EXPR
7021 && code
!= BIND_EXPR
7022 && code
!= CATCH_EXPR
7023 && (code
!= COND_EXPR
|| gimplify_ctxp
->allow_rhs_cond_expr
)
7024 && code
!= EH_FILTER_EXPR
7025 && code
!= GOTO_EXPR
7026 && code
!= LABEL_EXPR
7027 && code
!= LOOP_EXPR
7028 && code
!= RESX_EXPR
7029 && code
!= SWITCH_EXPR
7030 && code
!= TRY_FINALLY_EXPR
7031 && code
!= OMP_CRITICAL
7033 && code
!= OMP_MASTER
7034 && code
!= OMP_ORDERED
7035 && code
!= OMP_PARALLEL
7036 && code
!= OMP_SECTIONS
7037 && code
!= OMP_SECTION
7038 && code
!= OMP_SINGLE
);
7042 /* Otherwise we're gimplifying a subexpression, so the resulting
7043 value is interesting. If it's a valid operand that matches
7044 GIMPLE_TEST_F, we're done. Unless we are handling some
7045 post-effects internally; if that's the case, we need to copy into
7046 a temporary before adding the post-effects to POST_P. */
7047 if (gimple_seq_empty_p (internal_post
) && (*gimple_test_f
) (*expr_p
))
7050 /* Otherwise, we need to create a new temporary for the gimplified
7053 /* We can't return an lvalue if we have an internal postqueue. The
7054 object the lvalue refers to would (probably) be modified by the
7055 postqueue; we need to copy the value out first, which means an
7057 if ((fallback
& fb_lvalue
)
7058 && gimple_seq_empty_p (internal_post
)
7059 && is_gimple_addressable (*expr_p
))
7061 /* An lvalue will do. Take the address of the expression, store it
7062 in a temporary, and replace the expression with an INDIRECT_REF of
7064 tmp
= build_fold_addr_expr (*expr_p
);
7065 gimplify_expr (&tmp
, pre_p
, post_p
, is_gimple_reg
, fb_rvalue
);
7066 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (tmp
)), tmp
);
7068 else if ((fallback
& fb_rvalue
) && is_gimple_formal_tmp_or_call_rhs (*expr_p
))
7070 /* An rvalue will do. Assign the gimplified expression into a
7071 new temporary TMP and replace the original expression with
7072 TMP. First, make sure that the expression has a type so that
7073 it can be assigned into a temporary. */
7074 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p
)));
7076 if (!gimple_seq_empty_p (internal_post
) || (fallback
& fb_lvalue
))
7077 /* The postqueue might change the value of the expression between
7078 the initialization and use of the temporary, so we can't use a
7079 formal temp. FIXME do we care? */
7080 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
7082 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
7084 if (TREE_CODE (*expr_p
) != SSA_NAME
)
7085 DECL_GIMPLE_FORMAL_TEMP_P (*expr_p
) = 1;
7089 #ifdef ENABLE_GIMPLE_CHECKING
7090 if (!(fallback
& fb_mayfail
))
7092 fprintf (stderr
, "gimplification failed:\n");
7093 print_generic_expr (stderr
, *expr_p
, 0);
7094 debug_tree (*expr_p
);
7095 internal_error ("gimplification failed");
7098 gcc_assert (fallback
& fb_mayfail
);
7100 /* If this is an asm statement, and the user asked for the
7101 impossible, don't die. Fail and let gimplify_asm_expr
7107 /* Make sure the temporary matches our predicate. */
7108 gcc_assert ((*gimple_test_f
) (*expr_p
));
7110 if (!gimple_seq_empty_p (internal_post
))
7112 annotate_all_with_location (internal_post
, input_location
);
7113 gimplify_seq_add_seq (pre_p
, internal_post
);
7117 input_location
= saved_location
;
7121 /* Look through TYPE for variable-sized objects and gimplify each such
7122 size that we find. Add to LIST_P any statements generated. */
7125 gimplify_type_sizes (tree type
, gimple_seq
*list_p
)
7129 if (type
== NULL
|| type
== error_mark_node
)
7132 /* We first do the main variant, then copy into any other variants. */
7133 type
= TYPE_MAIN_VARIANT (type
);
7135 /* Avoid infinite recursion. */
7136 if (TYPE_SIZES_GIMPLIFIED (type
))
7139 TYPE_SIZES_GIMPLIFIED (type
) = 1;
7141 switch (TREE_CODE (type
))
7147 case FIXED_POINT_TYPE
:
7148 gimplify_one_sizepos (&TYPE_MIN_VALUE (type
), list_p
);
7149 gimplify_one_sizepos (&TYPE_MAX_VALUE (type
), list_p
);
7151 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
7153 TYPE_MIN_VALUE (t
) = TYPE_MIN_VALUE (type
);
7154 TYPE_MAX_VALUE (t
) = TYPE_MAX_VALUE (type
);
7159 /* These types may not have declarations, so handle them here. */
7160 gimplify_type_sizes (TREE_TYPE (type
), list_p
);
7161 gimplify_type_sizes (TYPE_DOMAIN (type
), list_p
);
7162 /* When not optimizing, ensure VLA bounds aren't removed. */
7164 && TYPE_DOMAIN (type
)
7165 && INTEGRAL_TYPE_P (TYPE_DOMAIN (type
)))
7167 t
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
7168 if (t
&& TREE_CODE (t
) == VAR_DECL
&& DECL_ARTIFICIAL (t
))
7169 DECL_IGNORED_P (t
) = 0;
7170 t
= TYPE_MAX_VALUE (TYPE_DOMAIN (type
));
7171 if (t
&& TREE_CODE (t
) == VAR_DECL
&& DECL_ARTIFICIAL (t
))
7172 DECL_IGNORED_P (t
) = 0;
7178 case QUAL_UNION_TYPE
:
7179 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
7180 if (TREE_CODE (field
) == FIELD_DECL
)
7182 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field
), list_p
);
7183 gimplify_one_sizepos (&DECL_SIZE (field
), list_p
);
7184 gimplify_one_sizepos (&DECL_SIZE_UNIT (field
), list_p
);
7185 gimplify_type_sizes (TREE_TYPE (field
), list_p
);
7190 case REFERENCE_TYPE
:
7191 /* We used to recurse on the pointed-to type here, which turned out to
7192 be incorrect because its definition might refer to variables not
7193 yet initialized at this point if a forward declaration is involved.
7195 It was actually useful for anonymous pointed-to types to ensure
7196 that the sizes evaluation dominates every possible later use of the
7197 values. Restricting to such types here would be safe since there
7198 is no possible forward declaration around, but would introduce an
7199 undesirable middle-end semantic to anonymity. We then defer to
7200 front-ends the responsibility of ensuring that the sizes are
7201 evaluated both early and late enough, e.g. by attaching artificial
7202 type declarations to the tree. */
7209 gimplify_one_sizepos (&TYPE_SIZE (type
), list_p
);
7210 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type
), list_p
);
7212 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
7214 TYPE_SIZE (t
) = TYPE_SIZE (type
);
7215 TYPE_SIZE_UNIT (t
) = TYPE_SIZE_UNIT (type
);
7216 TYPE_SIZES_GIMPLIFIED (t
) = 1;
7220 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
7221 a size or position, has had all of its SAVE_EXPRs evaluated.
7222 We add any required statements to *STMT_P. */
7225 gimplify_one_sizepos (tree
*expr_p
, gimple_seq
*stmt_p
)
7227 tree type
, expr
= *expr_p
;
7229 /* We don't do anything if the value isn't there, is constant, or contains
7230 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
7231 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
7232 will want to replace it with a new variable, but that will cause problems
7233 if this type is from outside the function. It's OK to have that here. */
7234 if (expr
== NULL_TREE
|| TREE_CONSTANT (expr
)
7235 || TREE_CODE (expr
) == VAR_DECL
7236 || CONTAINS_PLACEHOLDER_P (expr
))
7239 type
= TREE_TYPE (expr
);
7240 *expr_p
= unshare_expr (expr
);
7242 gimplify_expr (expr_p
, stmt_p
, NULL
, is_gimple_val
, fb_rvalue
);
7245 /* Verify that we've an exact type match with the original expression.
7246 In particular, we do not wish to drop a "sizetype" in favour of a
7247 type of similar dimensions. We don't want to pollute the generic
7248 type-stripping code with this knowledge because it doesn't matter
7249 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
7250 and friends retain their "sizetype-ness". */
7251 if (TREE_TYPE (expr
) != type
7252 && TREE_CODE (type
) == INTEGER_TYPE
7253 && TYPE_IS_SIZETYPE (type
))
7258 *expr_p
= create_tmp_var (type
, NULL
);
7259 tmp
= build1 (NOP_EXPR
, type
, expr
);
7260 stmt
= gimplify_assign (*expr_p
, tmp
, stmt_p
);
7261 if (EXPR_HAS_LOCATION (expr
))
7262 gimple_set_location (stmt
, *EXPR_LOCUS (expr
));
7264 gimple_set_location (stmt
, input_location
);
7269 /* Gimplify the body of statements pointed to by BODY_P and return a
7270 GIMPLE_BIND containing the sequence of GIMPLE statements
7271 corresponding to BODY_P. FNDECL is the function decl containing
7275 gimplify_body (tree
*body_p
, tree fndecl
, bool do_parms
)
7277 location_t saved_location
= input_location
;
7278 gimple_seq parm_stmts
, seq
;
7280 struct gimplify_ctx gctx
;
7282 timevar_push (TV_TREE_GIMPLIFY
);
7284 /* Initialize for optimize_insn_for_s{ize,peed}_p possibly called during
7286 default_rtl_profile ();
7288 gcc_assert (gimplify_ctxp
== NULL
);
7289 push_gimplify_context (&gctx
);
7291 /* Unshare most shared trees in the body and in that of any nested functions.
7292 It would seem we don't have to do this for nested functions because
7293 they are supposed to be output and then the outer function gimplified
7294 first, but the g++ front end doesn't always do it that way. */
7295 unshare_body (body_p
, fndecl
);
7296 unvisit_body (body_p
, fndecl
);
7298 /* Make sure input_location isn't set to something weird. */
7299 input_location
= DECL_SOURCE_LOCATION (fndecl
);
7301 /* Resolve callee-copies. This has to be done before processing
7302 the body so that DECL_VALUE_EXPR gets processed correctly. */
7303 parm_stmts
= (do_parms
) ? gimplify_parameters () : NULL
;
7305 /* Gimplify the function's body. */
7307 gimplify_stmt (body_p
, &seq
);
7308 outer_bind
= gimple_seq_first_stmt (seq
);
7311 outer_bind
= gimple_build_nop ();
7312 gimplify_seq_add_stmt (&seq
, outer_bind
);
7315 /* The body must contain exactly one statement, a GIMPLE_BIND. If this is
7316 not the case, wrap everything in a GIMPLE_BIND to make it so. */
7317 if (gimple_code (outer_bind
) == GIMPLE_BIND
7318 && gimple_seq_first (seq
) == gimple_seq_last (seq
))
7321 outer_bind
= gimple_build_bind (NULL_TREE
, seq
, NULL
);
7323 *body_p
= NULL_TREE
;
7325 /* If we had callee-copies statements, insert them at the beginning
7327 if (!gimple_seq_empty_p (parm_stmts
))
7329 gimplify_seq_add_seq (&parm_stmts
, gimple_bind_body (outer_bind
));
7330 gimple_bind_set_body (outer_bind
, parm_stmts
);
7333 pop_gimplify_context (outer_bind
);
7334 gcc_assert (gimplify_ctxp
== NULL
);
7336 #ifdef ENABLE_TYPES_CHECKING
7337 if (!errorcount
&& !sorrycount
)
7338 verify_types_in_gimple_seq (gimple_bind_body (outer_bind
));
7341 timevar_pop (TV_TREE_GIMPLIFY
);
7342 input_location
= saved_location
;
7347 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
7348 node for the function we want to gimplify.
7350 Returns the sequence of GIMPLE statements corresponding to the body
7354 gimplify_function_tree (tree fndecl
)
7356 tree oldfn
, parm
, ret
;
7360 oldfn
= current_function_decl
;
7361 current_function_decl
= fndecl
;
7362 if (DECL_STRUCT_FUNCTION (fndecl
))
7363 push_cfun (DECL_STRUCT_FUNCTION (fndecl
));
7365 push_struct_function (fndecl
);
7367 for (parm
= DECL_ARGUMENTS (fndecl
); parm
; parm
= TREE_CHAIN (parm
))
7369 /* Preliminarily mark non-addressed complex variables as eligible
7370 for promotion to gimple registers. We'll transform their uses
7372 if ((TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
7373 || TREE_CODE (TREE_TYPE (parm
)) == VECTOR_TYPE
)
7374 && !TREE_THIS_VOLATILE (parm
)
7375 && !needs_to_live_in_memory (parm
))
7376 DECL_GIMPLE_REG_P (parm
) = 1;
7379 ret
= DECL_RESULT (fndecl
);
7380 if ((TREE_CODE (TREE_TYPE (ret
)) == COMPLEX_TYPE
7381 || TREE_CODE (TREE_TYPE (ret
)) == VECTOR_TYPE
)
7382 && !needs_to_live_in_memory (ret
))
7383 DECL_GIMPLE_REG_P (ret
) = 1;
7385 bind
= gimplify_body (&DECL_SAVED_TREE (fndecl
), fndecl
, true);
7387 /* The tree body of the function is no longer needed, replace it
7388 with the new GIMPLE body. */
7389 seq
= gimple_seq_alloc ();
7390 gimple_seq_add_stmt (&seq
, bind
);
7391 gimple_set_body (fndecl
, seq
);
7393 /* If we're instrumenting function entry/exit, then prepend the call to
7394 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
7395 catch the exit hook. */
7396 /* ??? Add some way to ignore exceptions for this TFE. */
7397 if (flag_instrument_function_entry_exit
7398 && !DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl
)
7399 && !flag_instrument_functions_exclude_p (fndecl
))
7404 gimple_seq cleanup
= NULL
, body
= NULL
;
7406 x
= implicit_built_in_decls
[BUILT_IN_PROFILE_FUNC_EXIT
];
7407 gimplify_seq_add_stmt (&cleanup
, gimple_build_call (x
, 0));
7408 tf
= gimple_build_try (seq
, cleanup
, GIMPLE_TRY_FINALLY
);
7410 x
= implicit_built_in_decls
[BUILT_IN_PROFILE_FUNC_ENTER
];
7411 gimplify_seq_add_stmt (&body
, gimple_build_call (x
, 0));
7412 gimplify_seq_add_stmt (&body
, tf
);
7413 new_bind
= gimple_build_bind (NULL
, body
, gimple_bind_block (bind
));
7414 /* Clear the block for BIND, since it is no longer directly inside
7415 the function, but within a try block. */
7416 gimple_bind_set_block (bind
, NULL
);
7418 /* Replace the current function body with the body
7419 wrapped in the try/finally TF. */
7420 seq
= gimple_seq_alloc ();
7421 gimple_seq_add_stmt (&seq
, new_bind
);
7422 gimple_set_body (fndecl
, seq
);
7425 DECL_SAVED_TREE (fndecl
) = NULL_TREE
;
7427 current_function_decl
= oldfn
;
7432 /* Some transformations like inlining may invalidate the GIMPLE form
7433 for operands. This function traverses all the operands in STMT and
7434 gimplifies anything that is not a valid gimple operand. Any new
7435 GIMPLE statements are inserted before *GSI_P. */
7438 gimple_regimplify_operands (gimple stmt
, gimple_stmt_iterator
*gsi_p
)
7441 tree orig_lhs
= NULL_TREE
, lhs
, t
;
7442 gimple_seq pre
= NULL
;
7443 gimple post_stmt
= NULL
;
7444 struct gimplify_ctx gctx
;
7446 push_gimplify_context (&gctx
);
7447 gimplify_ctxp
->into_ssa
= gimple_in_ssa_p (cfun
);
7449 switch (gimple_code (stmt
))
7452 gimplify_expr (gimple_cond_lhs_ptr (stmt
), &pre
, NULL
,
7453 is_gimple_val
, fb_rvalue
);
7454 gimplify_expr (gimple_cond_rhs_ptr (stmt
), &pre
, NULL
,
7455 is_gimple_val
, fb_rvalue
);
7458 gimplify_expr (gimple_switch_index_ptr (stmt
), &pre
, NULL
,
7459 is_gimple_val
, fb_rvalue
);
7461 case GIMPLE_OMP_ATOMIC_LOAD
:
7462 gimplify_expr (gimple_omp_atomic_load_rhs_ptr (stmt
), &pre
, NULL
,
7463 is_gimple_val
, fb_rvalue
);
7467 size_t i
, noutputs
= gimple_asm_noutputs (stmt
);
7468 const char *constraint
, **oconstraints
;
7469 bool allows_mem
, allows_reg
, is_inout
;
7472 = (const char **) alloca ((noutputs
) * sizeof (const char *));
7473 for (i
= 0; i
< noutputs
; i
++)
7475 tree op
= gimple_asm_output_op (stmt
, i
);
7476 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op
)));
7477 oconstraints
[i
] = constraint
;
7478 parse_output_constraint (&constraint
, i
, 0, 0, &allows_mem
,
7479 &allows_reg
, &is_inout
);
7480 gimplify_expr (&TREE_VALUE (op
), &pre
, NULL
,
7481 is_inout
? is_gimple_min_lval
: is_gimple_lvalue
,
7482 fb_lvalue
| fb_mayfail
);
7484 for (i
= 0; i
< gimple_asm_ninputs (stmt
); i
++)
7486 tree op
= gimple_asm_input_op (stmt
, i
);
7487 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op
)));
7488 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
7489 oconstraints
, &allows_mem
, &allows_reg
);
7490 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (op
))) && allows_mem
)
7492 if (!allows_reg
&& allows_mem
)
7493 gimplify_expr (&TREE_VALUE (op
), &pre
, NULL
,
7494 is_gimple_lvalue
, fb_lvalue
| fb_mayfail
);
7496 gimplify_expr (&TREE_VALUE (op
), &pre
, NULL
,
7497 is_gimple_asm_val
, fb_rvalue
);
7502 /* NOTE: We start gimplifying operands from last to first to
7503 make sure that side-effects on the RHS of calls, assignments
7504 and ASMs are executed before the LHS. The ordering is not
7505 important for other statements. */
7506 num_ops
= gimple_num_ops (stmt
);
7507 orig_lhs
= gimple_get_lhs (stmt
);
7508 for (i
= num_ops
; i
> 0; i
--)
7510 tree op
= gimple_op (stmt
, i
- 1);
7511 if (op
== NULL_TREE
)
7513 if (i
== 1 && (is_gimple_call (stmt
) || is_gimple_assign (stmt
)))
7514 gimplify_expr (&op
, &pre
, NULL
, is_gimple_lvalue
, fb_lvalue
);
7516 && is_gimple_assign (stmt
)
7518 && get_gimple_rhs_class (gimple_expr_code (stmt
))
7519 == GIMPLE_SINGLE_RHS
)
7520 gimplify_expr (&op
, &pre
, NULL
,
7521 rhs_predicate_for (gimple_assign_lhs (stmt
)),
7523 else if (i
== 2 && is_gimple_call (stmt
))
7525 if (TREE_CODE (op
) == FUNCTION_DECL
)
7527 gimplify_expr (&op
, &pre
, NULL
, is_gimple_call_addr
, fb_rvalue
);
7530 gimplify_expr (&op
, &pre
, NULL
, is_gimple_val
, fb_rvalue
);
7531 gimple_set_op (stmt
, i
- 1, op
);
7534 lhs
= gimple_get_lhs (stmt
);
7535 /* If the LHS changed it in a way that requires a simple RHS,
7536 create temporary. */
7537 if (lhs
&& !is_gimple_formal_tmp_var (lhs
))
7539 bool need_temp
= false;
7541 if (is_gimple_assign (stmt
)
7543 && get_gimple_rhs_class (gimple_expr_code (stmt
))
7544 == GIMPLE_SINGLE_RHS
)
7545 gimplify_expr (gimple_assign_rhs1_ptr (stmt
), &pre
, NULL
,
7546 rhs_predicate_for (gimple_assign_lhs (stmt
)),
7548 else if (is_gimple_reg (lhs
))
7550 if (is_gimple_reg_type (TREE_TYPE (lhs
)))
7552 if (is_gimple_call (stmt
))
7554 i
= gimple_call_flags (stmt
);
7555 if ((i
& ECF_LOOPING_CONST_OR_PURE
)
7556 || !(i
& (ECF_CONST
| ECF_PURE
)))
7559 if (stmt_can_throw_internal (stmt
))
7565 if (is_gimple_reg_type (TREE_TYPE (lhs
)))
7567 else if (TYPE_MODE (TREE_TYPE (lhs
)) != BLKmode
)
7569 if (is_gimple_call (stmt
))
7571 tree fndecl
= gimple_call_fndecl (stmt
);
7573 if (!aggregate_value_p (TREE_TYPE (lhs
), fndecl
)
7574 && !(fndecl
&& DECL_RESULT (fndecl
)
7575 && DECL_BY_REFERENCE (DECL_RESULT (fndecl
))))
7584 tree temp
= create_tmp_var (TREE_TYPE (lhs
), NULL
);
7586 DECL_GIMPLE_FORMAL_TEMP_P (temp
) = 1;
7587 if (TREE_CODE (TREE_TYPE (lhs
)) == COMPLEX_TYPE
7588 || TREE_CODE (TREE_TYPE (lhs
)) == VECTOR_TYPE
)
7589 DECL_GIMPLE_REG_P (temp
) = 1;
7590 if (TREE_CODE (orig_lhs
) == SSA_NAME
)
7591 orig_lhs
= SSA_NAME_VAR (orig_lhs
);
7592 if (TREE_CODE (orig_lhs
) == VAR_DECL
7593 && DECL_BASED_ON_RESTRICT_P (orig_lhs
))
7595 DECL_BASED_ON_RESTRICT_P (temp
) = 1;
7596 SET_DECL_RESTRICT_BASE (temp
,
7597 DECL_GET_RESTRICT_BASE (orig_lhs
));
7600 if (gimple_in_ssa_p (cfun
))
7601 temp
= make_ssa_name (temp
, NULL
);
7602 gimple_set_lhs (stmt
, temp
);
7603 post_stmt
= gimple_build_assign (lhs
, temp
);
7604 if (TREE_CODE (lhs
) == SSA_NAME
)
7605 SSA_NAME_DEF_STMT (lhs
) = post_stmt
;
7611 if (gimple_referenced_vars (cfun
))
7612 for (t
= gimplify_ctxp
->temps
; t
; t
= TREE_CHAIN (t
))
7613 add_referenced_var (t
);
7615 if (!gimple_seq_empty_p (pre
))
7617 if (gimple_in_ssa_p (cfun
))
7619 gimple_stmt_iterator i
;
7621 for (i
= gsi_start (pre
); !gsi_end_p (i
); gsi_next (&i
))
7622 mark_symbols_for_renaming (gsi_stmt (i
));
7624 gsi_insert_seq_before (gsi_p
, pre
, GSI_SAME_STMT
);
7627 gsi_insert_after (gsi_p
, post_stmt
, GSI_NEW_STMT
);
7629 pop_gimplify_context (NULL
);
7633 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
7634 force the result to be either ssa_name or an invariant, otherwise
7635 just force it to be a rhs expression. If VAR is not NULL, make the
7636 base variable of the final destination be VAR if suitable. */
7639 force_gimple_operand (tree expr
, gimple_seq
*stmts
, bool simple
, tree var
)
7642 enum gimplify_status ret
;
7643 gimple_predicate gimple_test_f
;
7644 struct gimplify_ctx gctx
;
7648 if (is_gimple_val (expr
))
7651 gimple_test_f
= simple
? is_gimple_val
: is_gimple_reg_rhs
;
7653 push_gimplify_context (&gctx
);
7654 gimplify_ctxp
->into_ssa
= gimple_in_ssa_p (cfun
);
7655 gimplify_ctxp
->allow_rhs_cond_expr
= true;
7658 expr
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, expr
);
7660 if (TREE_CODE (expr
) != MODIFY_EXPR
7661 && TREE_TYPE (expr
) == void_type_node
)
7663 gimplify_and_add (expr
, stmts
);
7668 ret
= gimplify_expr (&expr
, stmts
, NULL
, gimple_test_f
, fb_rvalue
);
7669 gcc_assert (ret
!= GS_ERROR
);
7672 if (gimple_referenced_vars (cfun
))
7673 for (t
= gimplify_ctxp
->temps
; t
; t
= TREE_CHAIN (t
))
7674 add_referenced_var (t
);
7676 pop_gimplify_context (NULL
);
7681 /* Invokes force_gimple_operand for EXPR with parameters SIMPLE_P and VAR. If
7682 some statements are produced, emits them at GSI. If BEFORE is true.
7683 the statements are appended before GSI, otherwise they are appended after
7684 it. M specifies the way GSI moves after insertion (GSI_SAME_STMT or
7685 GSI_CONTINUE_LINKING are the usual values). */
7688 force_gimple_operand_gsi (gimple_stmt_iterator
*gsi
, tree expr
,
7689 bool simple_p
, tree var
, bool before
,
7690 enum gsi_iterator_update m
)
7694 expr
= force_gimple_operand (expr
, &stmts
, simple_p
, var
);
7696 if (!gimple_seq_empty_p (stmts
))
7698 if (gimple_in_ssa_p (cfun
))
7700 gimple_stmt_iterator i
;
7702 for (i
= gsi_start (stmts
); !gsi_end_p (i
); gsi_next (&i
))
7703 mark_symbols_for_renaming (gsi_stmt (i
));
7707 gsi_insert_seq_before (gsi
, stmts
, m
);
7709 gsi_insert_seq_after (gsi
, stmts
, m
);
7715 #include "gt-gimplify.h"