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, 2010
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"
55 #include "tree-pass.h"
58 enum gimplify_omp_var_data
64 GOVD_FIRSTPRIVATE
= 16,
65 GOVD_LASTPRIVATE
= 32,
68 GOVD_DEBUG_PRIVATE
= 256,
69 GOVD_PRIVATE_OUTER_REF
= 512,
70 GOVD_DATA_SHARE_CLASS
= (GOVD_SHARED
| GOVD_PRIVATE
| GOVD_FIRSTPRIVATE
71 | GOVD_LASTPRIVATE
| GOVD_REDUCTION
| GOVD_LOCAL
)
80 ORT_COMBINED_PARALLEL
= 3
83 struct gimplify_omp_ctx
85 struct gimplify_omp_ctx
*outer_context
;
87 struct pointer_set_t
*privatized_types
;
89 enum omp_clause_default_kind default_kind
;
90 enum omp_region_type region_type
;
93 static struct gimplify_ctx
*gimplify_ctxp
;
94 static struct gimplify_omp_ctx
*gimplify_omp_ctxp
;
97 /* Formal (expression) temporary table handling: Multiple occurrences of
98 the same scalar expression are evaluated into the same temporary. */
100 typedef struct gimple_temp_hash_elt
103 tree temp
; /* Value */
106 /* Forward declarations. */
107 static enum gimplify_status
gimplify_compound_expr (tree
*, gimple_seq
*, bool);
109 /* Mark X addressable. Unlike the langhook we expect X to be in gimple
110 form and we don't do any syntax checking. */
112 mark_addressable (tree x
)
114 while (handled_component_p (x
))
115 x
= TREE_OPERAND (x
, 0);
116 if (TREE_CODE (x
) != VAR_DECL
117 && TREE_CODE (x
) != PARM_DECL
118 && TREE_CODE (x
) != RESULT_DECL
)
120 TREE_ADDRESSABLE (x
) = 1;
123 /* Return a hash value for a formal temporary table entry. */
126 gimple_tree_hash (const void *p
)
128 tree t
= ((const elt_t
*) p
)->val
;
129 return iterative_hash_expr (t
, 0);
132 /* Compare two formal temporary table entries. */
135 gimple_tree_eq (const void *p1
, const void *p2
)
137 tree t1
= ((const elt_t
*) p1
)->val
;
138 tree t2
= ((const elt_t
*) p2
)->val
;
139 enum tree_code code
= TREE_CODE (t1
);
141 if (TREE_CODE (t2
) != code
142 || TREE_TYPE (t1
) != TREE_TYPE (t2
))
145 if (!operand_equal_p (t1
, t2
, 0))
148 /* Only allow them to compare equal if they also hash equal; otherwise
149 results are nondeterminate, and we fail bootstrap comparison. */
150 gcc_assert (gimple_tree_hash (p1
) == gimple_tree_hash (p2
));
155 /* Link gimple statement GS to the end of the sequence *SEQ_P. If
156 *SEQ_P is NULL, a new sequence is allocated. This function is
157 similar to gimple_seq_add_stmt, but does not scan the operands.
158 During gimplification, we need to manipulate statement sequences
159 before the def/use vectors have been constructed. */
162 gimplify_seq_add_stmt (gimple_seq
*seq_p
, gimple gs
)
164 gimple_stmt_iterator si
;
170 *seq_p
= gimple_seq_alloc ();
172 si
= gsi_last (*seq_p
);
174 gsi_insert_after_without_update (&si
, gs
, GSI_NEW_STMT
);
177 /* Append sequence SRC to the end of sequence *DST_P. If *DST_P is
178 NULL, a new sequence is allocated. This function is
179 similar to gimple_seq_add_seq, but does not scan the operands.
180 During gimplification, we need to manipulate statement sequences
181 before the def/use vectors have been constructed. */
184 gimplify_seq_add_seq (gimple_seq
*dst_p
, gimple_seq src
)
186 gimple_stmt_iterator si
;
192 *dst_p
= gimple_seq_alloc ();
194 si
= gsi_last (*dst_p
);
195 gsi_insert_seq_after_without_update (&si
, src
, GSI_NEW_STMT
);
198 /* Set up a context for the gimplifier. */
201 push_gimplify_context (struct gimplify_ctx
*c
)
203 memset (c
, '\0', sizeof (*c
));
204 c
->prev_context
= gimplify_ctxp
;
208 /* Tear down a context for the gimplifier. If BODY is non-null, then
209 put the temporaries into the outer BIND_EXPR. Otherwise, put them
212 BODY is not a sequence, but the first tuple in a sequence. */
215 pop_gimplify_context (gimple body
)
217 struct gimplify_ctx
*c
= gimplify_ctxp
;
219 gcc_assert (c
&& (c
->bind_expr_stack
== NULL
220 || VEC_empty (gimple
, c
->bind_expr_stack
)));
221 VEC_free (gimple
, heap
, c
->bind_expr_stack
);
222 gimplify_ctxp
= c
->prev_context
;
225 declare_vars (c
->temps
, body
, false);
227 record_vars (c
->temps
);
230 htab_delete (c
->temp_htab
);
234 gimple_push_bind_expr (gimple gimple_bind
)
236 if (gimplify_ctxp
->bind_expr_stack
== NULL
)
237 gimplify_ctxp
->bind_expr_stack
= VEC_alloc (gimple
, heap
, 8);
238 VEC_safe_push (gimple
, heap
, gimplify_ctxp
->bind_expr_stack
, gimple_bind
);
242 gimple_pop_bind_expr (void)
244 VEC_pop (gimple
, gimplify_ctxp
->bind_expr_stack
);
248 gimple_current_bind_expr (void)
250 return VEC_last (gimple
, gimplify_ctxp
->bind_expr_stack
);
253 /* Return the stack GIMPLE_BINDs created during gimplification. */
256 gimple_bind_expr_stack (void)
258 return gimplify_ctxp
->bind_expr_stack
;
261 /* Returns true iff there is a COND_EXPR between us and the innermost
262 CLEANUP_POINT_EXPR. This info is used by gimple_push_cleanup. */
265 gimple_conditional_context (void)
267 return gimplify_ctxp
->conditions
> 0;
270 /* Note that we've entered a COND_EXPR. */
273 gimple_push_condition (void)
275 #ifdef ENABLE_GIMPLE_CHECKING
276 if (gimplify_ctxp
->conditions
== 0)
277 gcc_assert (gimple_seq_empty_p (gimplify_ctxp
->conditional_cleanups
));
279 ++(gimplify_ctxp
->conditions
);
282 /* Note that we've left a COND_EXPR. If we're back at unconditional scope
283 now, add any conditional cleanups we've seen to the prequeue. */
286 gimple_pop_condition (gimple_seq
*pre_p
)
288 int conds
= --(gimplify_ctxp
->conditions
);
290 gcc_assert (conds
>= 0);
293 gimplify_seq_add_seq (pre_p
, gimplify_ctxp
->conditional_cleanups
);
294 gimplify_ctxp
->conditional_cleanups
= NULL
;
298 /* A stable comparison routine for use with splay trees and DECLs. */
301 splay_tree_compare_decl_uid (splay_tree_key xa
, splay_tree_key xb
)
306 return DECL_UID (a
) - DECL_UID (b
);
309 /* Create a new omp construct that deals with variable remapping. */
311 static struct gimplify_omp_ctx
*
312 new_omp_context (enum omp_region_type region_type
)
314 struct gimplify_omp_ctx
*c
;
316 c
= XCNEW (struct gimplify_omp_ctx
);
317 c
->outer_context
= gimplify_omp_ctxp
;
318 c
->variables
= splay_tree_new (splay_tree_compare_decl_uid
, 0, 0);
319 c
->privatized_types
= pointer_set_create ();
320 c
->location
= input_location
;
321 c
->region_type
= region_type
;
322 if (region_type
!= ORT_TASK
)
323 c
->default_kind
= OMP_CLAUSE_DEFAULT_SHARED
;
325 c
->default_kind
= OMP_CLAUSE_DEFAULT_UNSPECIFIED
;
330 /* Destroy an omp construct that deals with variable remapping. */
333 delete_omp_context (struct gimplify_omp_ctx
*c
)
335 splay_tree_delete (c
->variables
);
336 pointer_set_destroy (c
->privatized_types
);
340 static void omp_add_variable (struct gimplify_omp_ctx
*, tree
, unsigned int);
341 static bool omp_notice_variable (struct gimplify_omp_ctx
*, tree
, bool);
343 /* A subroutine of append_to_statement_list{,_force}. T is not NULL. */
346 append_to_statement_list_1 (tree t
, tree
*list_p
)
349 tree_stmt_iterator i
;
353 if (t
&& TREE_CODE (t
) == STATEMENT_LIST
)
358 *list_p
= list
= alloc_stmt_list ();
362 tsi_link_after (&i
, t
, TSI_CONTINUE_LINKING
);
365 /* Add T to the end of the list container pointed to by LIST_P.
366 If T is an expression with no effects, it is ignored. */
369 append_to_statement_list (tree t
, tree
*list_p
)
371 if (t
&& TREE_SIDE_EFFECTS (t
))
372 append_to_statement_list_1 (t
, list_p
);
375 /* Similar, but the statement is always added, regardless of side effects. */
378 append_to_statement_list_force (tree t
, tree
*list_p
)
381 append_to_statement_list_1 (t
, list_p
);
384 /* Both gimplify the statement T and append it to *SEQ_P. This function
385 behaves exactly as gimplify_stmt, but you don't have to pass T as a
389 gimplify_and_add (tree t
, gimple_seq
*seq_p
)
391 gimplify_stmt (&t
, seq_p
);
394 /* Gimplify statement T into sequence *SEQ_P, and return the first
395 tuple in the sequence of generated tuples for this statement.
396 Return NULL if gimplifying T produced no tuples. */
399 gimplify_and_return_first (tree t
, gimple_seq
*seq_p
)
401 gimple_stmt_iterator last
= gsi_last (*seq_p
);
403 gimplify_and_add (t
, seq_p
);
405 if (!gsi_end_p (last
))
408 return gsi_stmt (last
);
411 return gimple_seq_first_stmt (*seq_p
);
414 /* Strip off a legitimate source ending from the input string NAME of
415 length LEN. Rather than having to know the names used by all of
416 our front ends, we strip off an ending of a period followed by
417 up to five characters. (Java uses ".class".) */
420 remove_suffix (char *name
, int len
)
424 for (i
= 2; i
< 8 && len
> i
; i
++)
426 if (name
[len
- i
] == '.')
428 name
[len
- i
] = '\0';
434 /* Create a new temporary name with PREFIX. Returns an identifier. */
436 static GTY(()) unsigned int tmp_var_id_num
;
439 create_tmp_var_name (const char *prefix
)
445 char *preftmp
= ASTRDUP (prefix
);
447 remove_suffix (preftmp
, strlen (preftmp
));
451 ASM_FORMAT_PRIVATE_NAME (tmp_name
, prefix
? prefix
: "T", tmp_var_id_num
++);
452 return get_identifier (tmp_name
);
456 /* Create a new temporary variable declaration of type TYPE.
457 Does NOT push it into the current binding. */
460 create_tmp_var_raw (tree type
, const char *prefix
)
465 /* Make the type of the variable writable. */
466 new_type
= build_type_variant (type
, 0, 0);
467 TYPE_ATTRIBUTES (new_type
) = TYPE_ATTRIBUTES (type
);
469 tmp_var
= build_decl (input_location
,
470 VAR_DECL
, prefix
? create_tmp_var_name (prefix
) : NULL
,
473 /* The variable was declared by the compiler. */
474 DECL_ARTIFICIAL (tmp_var
) = 1;
475 /* And we don't want debug info for it. */
476 DECL_IGNORED_P (tmp_var
) = 1;
478 /* Make the variable writable. */
479 TREE_READONLY (tmp_var
) = 0;
481 DECL_EXTERNAL (tmp_var
) = 0;
482 TREE_STATIC (tmp_var
) = 0;
483 TREE_USED (tmp_var
) = 1;
488 /* Create a new temporary variable declaration of type TYPE. DOES push the
489 variable into the current binding. Further, assume that this is called
490 only from gimplification or optimization, at which point the creation of
491 certain types are bugs. */
494 create_tmp_var (tree type
, const char *prefix
)
498 /* We don't allow types that are addressable (meaning we can't make copies),
499 or incomplete. We also used to reject every variable size objects here,
500 but now support those for which a constant upper bound can be obtained.
501 The processing for variable sizes is performed in gimple_add_tmp_var,
502 point at which it really matters and possibly reached via paths not going
503 through this function, e.g. after direct calls to create_tmp_var_raw. */
504 gcc_assert (!TREE_ADDRESSABLE (type
) && COMPLETE_TYPE_P (type
));
506 tmp_var
= create_tmp_var_raw (type
, prefix
);
507 gimple_add_tmp_var (tmp_var
);
511 /* Create a temporary with a name derived from VAL. Subroutine of
512 lookup_tmp_var; nobody else should call this function. */
515 create_tmp_from_val (tree val
)
517 return create_tmp_var (TREE_TYPE (val
), get_name (val
));
520 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
521 an existing expression temporary. */
524 lookup_tmp_var (tree val
, bool is_formal
)
528 /* If not optimizing, never really reuse a temporary. local-alloc
529 won't allocate any variable that is used in more than one basic
530 block, which means it will go into memory, causing much extra
531 work in reload and final and poorer code generation, outweighing
532 the extra memory allocation here. */
533 if (!optimize
|| !is_formal
|| TREE_SIDE_EFFECTS (val
))
534 ret
= create_tmp_from_val (val
);
541 if (gimplify_ctxp
->temp_htab
== NULL
)
542 gimplify_ctxp
->temp_htab
543 = htab_create (1000, gimple_tree_hash
, gimple_tree_eq
, free
);
544 slot
= htab_find_slot (gimplify_ctxp
->temp_htab
, (void *)&elt
, INSERT
);
547 elt_p
= XNEW (elt_t
);
549 elt_p
->temp
= ret
= create_tmp_from_val (val
);
550 *slot
= (void *) elt_p
;
554 elt_p
= (elt_t
*) *slot
;
563 /* Return true if T is a CALL_EXPR or an expression that can be
564 assignmed to a temporary. Note that this predicate should only be
565 used during gimplification. See the rationale for this in
566 gimplify_modify_expr. */
569 is_gimple_reg_rhs_or_call (tree t
)
571 return (get_gimple_rhs_class (TREE_CODE (t
)) != GIMPLE_INVALID_RHS
572 || TREE_CODE (t
) == CALL_EXPR
);
575 /* Return true if T is a valid memory RHS or a CALL_EXPR. Note that
576 this predicate should only be used during gimplification. See the
577 rationale for this in gimplify_modify_expr. */
580 is_gimple_mem_rhs_or_call (tree t
)
582 /* If we're dealing with a renamable type, either source or dest must be
583 a renamed variable. */
584 if (is_gimple_reg_type (TREE_TYPE (t
)))
585 return is_gimple_val (t
);
587 return (is_gimple_val (t
) || is_gimple_lvalue (t
)
588 || TREE_CODE (t
) == CALL_EXPR
);
591 /* Helper for get_formal_tmp_var and get_initialized_tmp_var. */
594 internal_get_tmp_var (tree val
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
599 /* Notice that we explicitly allow VAL to be a CALL_EXPR so that we
600 can create an INIT_EXPR and convert it into a GIMPLE_CALL below. */
601 gimplify_expr (&val
, pre_p
, post_p
, is_gimple_reg_rhs_or_call
,
604 t
= lookup_tmp_var (val
, is_formal
);
607 && (TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
608 || TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
))
609 DECL_GIMPLE_REG_P (t
) = 1;
611 mod
= build2 (INIT_EXPR
, TREE_TYPE (t
), t
, unshare_expr (val
));
613 if (EXPR_HAS_LOCATION (val
))
614 SET_EXPR_LOCATION (mod
, EXPR_LOCATION (val
));
616 SET_EXPR_LOCATION (mod
, input_location
);
618 /* gimplify_modify_expr might want to reduce this further. */
619 gimplify_and_add (mod
, pre_p
);
622 /* If we're gimplifying into ssa, gimplify_modify_expr will have
623 given our temporary an SSA name. Find and return it. */
624 if (gimplify_ctxp
->into_ssa
)
626 gimple last
= gimple_seq_last_stmt (*pre_p
);
627 t
= gimple_get_lhs (last
);
633 /* Returns a formal temporary variable initialized with VAL. PRE_P is as
634 in gimplify_expr. Only use this function if:
636 1) The value of the unfactored expression represented by VAL will not
637 change between the initialization and use of the temporary, and
638 2) The temporary will not be otherwise modified.
640 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
641 and #2 means it is inappropriate for && temps.
643 For other cases, use get_initialized_tmp_var instead. */
646 get_formal_tmp_var (tree val
, gimple_seq
*pre_p
)
648 return internal_get_tmp_var (val
, pre_p
, NULL
, true);
651 /* Returns a temporary variable initialized with VAL. PRE_P and POST_P
652 are as in gimplify_expr. */
655 get_initialized_tmp_var (tree val
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
657 return internal_get_tmp_var (val
, pre_p
, post_p
, false);
660 /* Declares all the variables in VARS in SCOPE. If DEBUG_INFO is
661 true, generate debug info for them; otherwise don't. */
664 declare_vars (tree vars
, gimple scope
, bool debug_info
)
671 gcc_assert (gimple_code (scope
) == GIMPLE_BIND
);
673 temps
= nreverse (last
);
675 block
= gimple_bind_block (scope
);
676 gcc_assert (!block
|| TREE_CODE (block
) == BLOCK
);
677 if (!block
|| !debug_info
)
679 TREE_CHAIN (last
) = gimple_bind_vars (scope
);
680 gimple_bind_set_vars (scope
, temps
);
684 /* We need to attach the nodes both to the BIND_EXPR and to its
685 associated BLOCK for debugging purposes. The key point here
686 is that the BLOCK_VARS of the BIND_EXPR_BLOCK of a BIND_EXPR
687 is a subchain of the BIND_EXPR_VARS of the BIND_EXPR. */
688 if (BLOCK_VARS (block
))
689 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), temps
);
692 gimple_bind_set_vars (scope
,
693 chainon (gimple_bind_vars (scope
), temps
));
694 BLOCK_VARS (block
) = temps
;
700 /* For VAR a VAR_DECL of variable size, try to find a constant upper bound
701 for the size and adjust DECL_SIZE/DECL_SIZE_UNIT accordingly. Abort if
702 no such upper bound can be obtained. */
705 force_constant_size (tree var
)
707 /* The only attempt we make is by querying the maximum size of objects
708 of the variable's type. */
710 HOST_WIDE_INT max_size
;
712 gcc_assert (TREE_CODE (var
) == VAR_DECL
);
714 max_size
= max_int_size_in_bytes (TREE_TYPE (var
));
716 gcc_assert (max_size
>= 0);
719 = build_int_cst (TREE_TYPE (DECL_SIZE_UNIT (var
)), max_size
);
721 = build_int_cst (TREE_TYPE (DECL_SIZE (var
)), max_size
* BITS_PER_UNIT
);
725 gimple_add_tmp_var (tree tmp
)
727 gcc_assert (!TREE_CHAIN (tmp
) && !DECL_SEEN_IN_BIND_EXPR_P (tmp
));
729 /* Later processing assumes that the object size is constant, which might
730 not be true at this point. Force the use of a constant upper bound in
732 if (!host_integerp (DECL_SIZE_UNIT (tmp
), 1))
733 force_constant_size (tmp
);
735 DECL_CONTEXT (tmp
) = current_function_decl
;
736 DECL_SEEN_IN_BIND_EXPR_P (tmp
) = 1;
740 TREE_CHAIN (tmp
) = gimplify_ctxp
->temps
;
741 gimplify_ctxp
->temps
= tmp
;
743 /* Mark temporaries local within the nearest enclosing parallel. */
744 if (gimplify_omp_ctxp
)
746 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
747 while (ctx
&& ctx
->region_type
== ORT_WORKSHARE
)
748 ctx
= ctx
->outer_context
;
750 omp_add_variable (ctx
, tmp
, GOVD_LOCAL
| GOVD_SEEN
);
759 /* This case is for nested functions. We need to expose the locals
761 body_seq
= gimple_body (current_function_decl
);
762 declare_vars (tmp
, gimple_seq_first_stmt (body_seq
), false);
766 /* Determines whether to assign a location to the statement GS. */
769 should_carry_location_p (gimple gs
)
771 /* Don't emit a line note for a label. We particularly don't want to
772 emit one for the break label, since it doesn't actually correspond
773 to the beginning of the loop/switch. */
774 if (gimple_code (gs
) == GIMPLE_LABEL
)
781 /* Return true if a location should not be emitted for this statement
782 by annotate_one_with_location. */
785 gimple_do_not_emit_location_p (gimple g
)
787 return gimple_plf (g
, GF_PLF_1
);
790 /* Mark statement G so a location will not be emitted by
791 annotate_one_with_location. */
794 gimple_set_do_not_emit_location (gimple g
)
796 /* The PLF flags are initialized to 0 when a new tuple is created,
797 so no need to initialize it anywhere. */
798 gimple_set_plf (g
, GF_PLF_1
, true);
801 /* Set the location for gimple statement GS to LOCATION. */
804 annotate_one_with_location (gimple gs
, location_t location
)
806 if (!gimple_has_location (gs
)
807 && !gimple_do_not_emit_location_p (gs
)
808 && should_carry_location_p (gs
))
809 gimple_set_location (gs
, location
);
813 /* Set LOCATION for all the statements after iterator GSI in sequence
814 SEQ. If GSI is pointing to the end of the sequence, start with the
815 first statement in SEQ. */
818 annotate_all_with_location_after (gimple_seq seq
, gimple_stmt_iterator gsi
,
822 gsi
= gsi_start (seq
);
826 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
827 annotate_one_with_location (gsi_stmt (gsi
), location
);
831 /* Set the location for all the statements in a sequence STMT_P to LOCATION. */
834 annotate_all_with_location (gimple_seq stmt_p
, location_t location
)
836 gimple_stmt_iterator i
;
838 if (gimple_seq_empty_p (stmt_p
))
841 for (i
= gsi_start (stmt_p
); !gsi_end_p (i
); gsi_next (&i
))
843 gimple gs
= gsi_stmt (i
);
844 annotate_one_with_location (gs
, location
);
849 /* Similar to copy_tree_r() but do not copy SAVE_EXPR or TARGET_EXPR nodes.
850 These nodes model computations that should only be done once. If we
851 were to unshare something like SAVE_EXPR(i++), the gimplification
852 process would create wrong code. */
855 mostly_copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data
)
857 enum tree_code code
= TREE_CODE (*tp
);
858 /* Don't unshare types, decls, constants and SAVE_EXPR nodes. */
859 if (TREE_CODE_CLASS (code
) == tcc_type
860 || TREE_CODE_CLASS (code
) == tcc_declaration
861 || TREE_CODE_CLASS (code
) == tcc_constant
862 || code
== SAVE_EXPR
|| code
== TARGET_EXPR
863 /* We can't do anything sensible with a BLOCK used as an expression,
864 but we also can't just die when we see it because of non-expression
865 uses. So just avert our eyes and cross our fingers. Silly Java. */
870 gcc_assert (code
!= BIND_EXPR
);
871 copy_tree_r (tp
, walk_subtrees
, data
);
877 /* Callback for walk_tree to unshare most of the shared trees rooted at
878 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
879 then *TP is deep copied by calling copy_tree_r.
881 This unshares the same trees as copy_tree_r with the exception of
882 SAVE_EXPR nodes. These nodes model computations that should only be
883 done once. If we were to unshare something like SAVE_EXPR(i++), the
884 gimplification process would create wrong code. */
887 copy_if_shared_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
888 void *data ATTRIBUTE_UNUSED
)
891 enum tree_code code
= TREE_CODE (t
);
893 /* Skip types, decls, and constants. But we do want to look at their
894 types and the bounds of types. Mark them as visited so we properly
895 unmark their subtrees on the unmark pass. If we've already seen them,
896 don't look down further. */
897 if (TREE_CODE_CLASS (code
) == tcc_type
898 || TREE_CODE_CLASS (code
) == tcc_declaration
899 || TREE_CODE_CLASS (code
) == tcc_constant
)
901 if (TREE_VISITED (t
))
904 TREE_VISITED (t
) = 1;
907 /* If this node has been visited already, unshare it and don't look
909 else if (TREE_VISITED (t
))
911 walk_tree (tp
, mostly_copy_tree_r
, NULL
, NULL
);
915 /* Otherwise, mark the tree as visited and keep looking. */
917 TREE_VISITED (t
) = 1;
923 unmark_visited_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
924 void *data ATTRIBUTE_UNUSED
)
926 if (TREE_VISITED (*tp
))
927 TREE_VISITED (*tp
) = 0;
934 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
935 bodies of any nested functions if we are unsharing the entire body of
939 unshare_body (tree
*body_p
, tree fndecl
)
941 struct cgraph_node
*cgn
= cgraph_node (fndecl
);
943 walk_tree (body_p
, copy_if_shared_r
, NULL
, NULL
);
944 if (body_p
== &DECL_SAVED_TREE (fndecl
))
945 for (cgn
= cgn
->nested
; cgn
; cgn
= cgn
->next_nested
)
946 unshare_body (&DECL_SAVED_TREE (cgn
->decl
), cgn
->decl
);
949 /* Likewise, but mark all trees as not visited. */
952 unvisit_body (tree
*body_p
, tree fndecl
)
954 struct cgraph_node
*cgn
= cgraph_node (fndecl
);
956 walk_tree (body_p
, unmark_visited_r
, NULL
, NULL
);
957 if (body_p
== &DECL_SAVED_TREE (fndecl
))
958 for (cgn
= cgn
->nested
; cgn
; cgn
= cgn
->next_nested
)
959 unvisit_body (&DECL_SAVED_TREE (cgn
->decl
), cgn
->decl
);
962 /* Unconditionally make an unshared copy of EXPR. This is used when using
963 stored expressions which span multiple functions, such as BINFO_VTABLE,
964 as the normal unsharing process can't tell that they're shared. */
967 unshare_expr (tree expr
)
969 walk_tree (&expr
, mostly_copy_tree_r
, NULL
, NULL
);
973 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
974 contain statements and have a value. Assign its value to a temporary
975 and give it void_type_node. Returns the temporary, or NULL_TREE if
976 WRAPPER was already void. */
979 voidify_wrapper_expr (tree wrapper
, tree temp
)
981 tree type
= TREE_TYPE (wrapper
);
982 if (type
&& !VOID_TYPE_P (type
))
986 /* Set p to point to the body of the wrapper. Loop until we find
987 something that isn't a wrapper. */
988 for (p
= &wrapper
; p
&& *p
; )
990 switch (TREE_CODE (*p
))
993 TREE_SIDE_EFFECTS (*p
) = 1;
994 TREE_TYPE (*p
) = void_type_node
;
995 /* For a BIND_EXPR, the body is operand 1. */
996 p
= &BIND_EXPR_BODY (*p
);
999 case CLEANUP_POINT_EXPR
:
1000 case TRY_FINALLY_EXPR
:
1001 case TRY_CATCH_EXPR
:
1002 TREE_SIDE_EFFECTS (*p
) = 1;
1003 TREE_TYPE (*p
) = void_type_node
;
1004 p
= &TREE_OPERAND (*p
, 0);
1007 case STATEMENT_LIST
:
1009 tree_stmt_iterator i
= tsi_last (*p
);
1010 TREE_SIDE_EFFECTS (*p
) = 1;
1011 TREE_TYPE (*p
) = void_type_node
;
1012 p
= tsi_end_p (i
) ? NULL
: tsi_stmt_ptr (i
);
1017 /* Advance to the last statement. Set all container types to void. */
1018 for (; TREE_CODE (*p
) == COMPOUND_EXPR
; p
= &TREE_OPERAND (*p
, 1))
1020 TREE_SIDE_EFFECTS (*p
) = 1;
1021 TREE_TYPE (*p
) = void_type_node
;
1031 if (p
== NULL
|| IS_EMPTY_STMT (*p
))
1035 /* The wrapper is on the RHS of an assignment that we're pushing
1037 gcc_assert (TREE_CODE (temp
) == INIT_EXPR
1038 || TREE_CODE (temp
) == MODIFY_EXPR
);
1039 TREE_OPERAND (temp
, 1) = *p
;
1044 temp
= create_tmp_var (type
, "retval");
1045 *p
= build2 (INIT_EXPR
, type
, temp
, *p
);
1054 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
1055 a temporary through which they communicate. */
1058 build_stack_save_restore (gimple
*save
, gimple
*restore
)
1062 *save
= gimple_build_call (implicit_built_in_decls
[BUILT_IN_STACK_SAVE
], 0);
1063 tmp_var
= create_tmp_var (ptr_type_node
, "saved_stack");
1064 gimple_call_set_lhs (*save
, tmp_var
);
1066 *restore
= gimple_build_call (implicit_built_in_decls
[BUILT_IN_STACK_RESTORE
],
1070 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
1072 static enum gimplify_status
1073 gimplify_bind_expr (tree
*expr_p
, gimple_seq
*pre_p
)
1075 tree bind_expr
= *expr_p
;
1076 bool old_save_stack
= gimplify_ctxp
->save_stack
;
1081 tree temp
= voidify_wrapper_expr (bind_expr
, NULL
);
1083 /* Mark variables seen in this bind expr. */
1084 for (t
= BIND_EXPR_VARS (bind_expr
); t
; t
= TREE_CHAIN (t
))
1086 if (TREE_CODE (t
) == VAR_DECL
)
1088 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
1090 /* Mark variable as local. */
1091 if (ctx
&& !is_global_var (t
)
1092 && (! DECL_SEEN_IN_BIND_EXPR_P (t
)
1093 || splay_tree_lookup (ctx
->variables
,
1094 (splay_tree_key
) t
) == NULL
))
1095 omp_add_variable (gimplify_omp_ctxp
, t
, GOVD_LOCAL
| GOVD_SEEN
);
1097 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
1099 if (DECL_HARD_REGISTER (t
) && !is_global_var (t
) && cfun
)
1100 cfun
->has_local_explicit_reg_vars
= true;
1103 /* Preliminarily mark non-addressed complex variables as eligible
1104 for promotion to gimple registers. We'll transform their uses
1106 We exclude complex types if not optimizing because they can be
1107 subject to partial stores in GNU C by means of the __real__ and
1108 __imag__ operators and we cannot promote them to total stores
1109 (see gimplify_modify_expr_complex_part). */
1111 && (TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
1112 || TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
1113 && !TREE_THIS_VOLATILE (t
)
1114 && (TREE_CODE (t
) == VAR_DECL
&& !DECL_HARD_REGISTER (t
))
1115 && !needs_to_live_in_memory (t
))
1116 DECL_GIMPLE_REG_P (t
) = 1;
1119 gimple_bind
= gimple_build_bind (BIND_EXPR_VARS (bind_expr
), NULL
,
1120 BIND_EXPR_BLOCK (bind_expr
));
1121 gimple_push_bind_expr (gimple_bind
);
1123 gimplify_ctxp
->save_stack
= false;
1125 /* Gimplify the body into the GIMPLE_BIND tuple's body. */
1127 gimplify_stmt (&BIND_EXPR_BODY (bind_expr
), &body
);
1128 gimple_bind_set_body (gimple_bind
, body
);
1130 if (gimplify_ctxp
->save_stack
)
1132 gimple stack_save
, stack_restore
, gs
;
1133 gimple_seq cleanup
, new_body
;
1135 /* Save stack on entry and restore it on exit. Add a try_finally
1136 block to achieve this. Note that mudflap depends on the
1137 format of the emitted code: see mx_register_decls(). */
1138 build_stack_save_restore (&stack_save
, &stack_restore
);
1140 cleanup
= new_body
= NULL
;
1141 gimplify_seq_add_stmt (&cleanup
, stack_restore
);
1142 gs
= gimple_build_try (gimple_bind_body (gimple_bind
), cleanup
,
1143 GIMPLE_TRY_FINALLY
);
1145 gimplify_seq_add_stmt (&new_body
, stack_save
);
1146 gimplify_seq_add_stmt (&new_body
, gs
);
1147 gimple_bind_set_body (gimple_bind
, new_body
);
1150 gimplify_ctxp
->save_stack
= old_save_stack
;
1151 gimple_pop_bind_expr ();
1153 gimplify_seq_add_stmt (pre_p
, gimple_bind
);
1161 *expr_p
= NULL_TREE
;
1165 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1166 GIMPLE value, it is assigned to a new temporary and the statement is
1167 re-written to return the temporary.
1169 PRE_P points to the sequence where side effects that must happen before
1170 STMT should be stored. */
1172 static enum gimplify_status
1173 gimplify_return_expr (tree stmt
, gimple_seq
*pre_p
)
1176 tree ret_expr
= TREE_OPERAND (stmt
, 0);
1177 tree result_decl
, result
;
1179 if (ret_expr
== error_mark_node
)
1183 || TREE_CODE (ret_expr
) == RESULT_DECL
1184 || ret_expr
== error_mark_node
)
1186 gimple ret
= gimple_build_return (ret_expr
);
1187 gimple_set_no_warning (ret
, TREE_NO_WARNING (stmt
));
1188 gimplify_seq_add_stmt (pre_p
, ret
);
1192 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
1193 result_decl
= NULL_TREE
;
1196 result_decl
= TREE_OPERAND (ret_expr
, 0);
1198 /* See through a return by reference. */
1199 if (TREE_CODE (result_decl
) == INDIRECT_REF
)
1200 result_decl
= TREE_OPERAND (result_decl
, 0);
1202 gcc_assert ((TREE_CODE (ret_expr
) == MODIFY_EXPR
1203 || TREE_CODE (ret_expr
) == INIT_EXPR
)
1204 && TREE_CODE (result_decl
) == RESULT_DECL
);
1207 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1208 Recall that aggregate_value_p is FALSE for any aggregate type that is
1209 returned in registers. If we're returning values in registers, then
1210 we don't want to extend the lifetime of the RESULT_DECL, particularly
1211 across another call. In addition, for those aggregates for which
1212 hard_function_value generates a PARALLEL, we'll die during normal
1213 expansion of structure assignments; there's special code in expand_return
1214 to handle this case that does not exist in expand_expr. */
1216 || aggregate_value_p (result_decl
, TREE_TYPE (current_function_decl
)))
1217 result
= result_decl
;
1218 else if (gimplify_ctxp
->return_temp
)
1219 result
= gimplify_ctxp
->return_temp
;
1222 result
= create_tmp_var (TREE_TYPE (result_decl
), NULL
);
1223 if (TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
1224 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
1225 DECL_GIMPLE_REG_P (result
) = 1;
1227 /* ??? With complex control flow (usually involving abnormal edges),
1228 we can wind up warning about an uninitialized value for this. Due
1229 to how this variable is constructed and initialized, this is never
1230 true. Give up and never warn. */
1231 TREE_NO_WARNING (result
) = 1;
1233 gimplify_ctxp
->return_temp
= result
;
1236 /* Smash the lhs of the MODIFY_EXPR to the temporary we plan to use.
1237 Then gimplify the whole thing. */
1238 if (result
!= result_decl
)
1239 TREE_OPERAND (ret_expr
, 0) = result
;
1241 gimplify_and_add (TREE_OPERAND (stmt
, 0), pre_p
);
1243 ret
= gimple_build_return (result
);
1244 gimple_set_no_warning (ret
, TREE_NO_WARNING (stmt
));
1245 gimplify_seq_add_stmt (pre_p
, ret
);
1251 gimplify_vla_decl (tree decl
, gimple_seq
*seq_p
)
1253 /* This is a variable-sized decl. Simplify its size and mark it
1254 for deferred expansion. Note that mudflap depends on the format
1255 of the emitted code: see mx_register_decls(). */
1256 tree t
, addr
, ptr_type
;
1258 gimplify_one_sizepos (&DECL_SIZE (decl
), seq_p
);
1259 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl
), seq_p
);
1261 /* All occurrences of this decl in final gimplified code will be
1262 replaced by indirection. Setting DECL_VALUE_EXPR does two
1263 things: First, it lets the rest of the gimplifier know what
1264 replacement to use. Second, it lets the debug info know
1265 where to find the value. */
1266 ptr_type
= build_pointer_type (TREE_TYPE (decl
));
1267 addr
= create_tmp_var (ptr_type
, get_name (decl
));
1268 DECL_IGNORED_P (addr
) = 0;
1269 t
= build_fold_indirect_ref (addr
);
1270 SET_DECL_VALUE_EXPR (decl
, t
);
1271 DECL_HAS_VALUE_EXPR_P (decl
) = 1;
1273 t
= built_in_decls
[BUILT_IN_ALLOCA
];
1274 t
= build_call_expr (t
, 1, DECL_SIZE_UNIT (decl
));
1275 t
= fold_convert (ptr_type
, t
);
1276 t
= build2 (MODIFY_EXPR
, TREE_TYPE (addr
), addr
, t
);
1278 gimplify_and_add (t
, seq_p
);
1280 /* Indicate that we need to restore the stack level when the
1281 enclosing BIND_EXPR is exited. */
1282 gimplify_ctxp
->save_stack
= true;
1286 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
1287 and initialization explicit. */
1289 static enum gimplify_status
1290 gimplify_decl_expr (tree
*stmt_p
, gimple_seq
*seq_p
)
1292 tree stmt
= *stmt_p
;
1293 tree decl
= DECL_EXPR_DECL (stmt
);
1295 *stmt_p
= NULL_TREE
;
1297 if (TREE_TYPE (decl
) == error_mark_node
)
1300 if ((TREE_CODE (decl
) == TYPE_DECL
1301 || TREE_CODE (decl
) == VAR_DECL
)
1302 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl
)))
1303 gimplify_type_sizes (TREE_TYPE (decl
), seq_p
);
1305 if (TREE_CODE (decl
) == VAR_DECL
&& !DECL_EXTERNAL (decl
))
1307 tree init
= DECL_INITIAL (decl
);
1309 if (TREE_CODE (DECL_SIZE_UNIT (decl
)) != INTEGER_CST
1310 || (!TREE_STATIC (decl
)
1311 && flag_stack_check
== GENERIC_STACK_CHECK
1312 && compare_tree_int (DECL_SIZE_UNIT (decl
),
1313 STACK_CHECK_MAX_VAR_SIZE
) > 0))
1314 gimplify_vla_decl (decl
, seq_p
);
1316 if (init
&& init
!= error_mark_node
)
1318 if (!TREE_STATIC (decl
))
1320 DECL_INITIAL (decl
) = NULL_TREE
;
1321 init
= build2 (INIT_EXPR
, void_type_node
, decl
, init
);
1322 gimplify_and_add (init
, seq_p
);
1326 /* We must still examine initializers for static variables
1327 as they may contain a label address. */
1328 walk_tree (&init
, force_labels_r
, NULL
, NULL
);
1331 /* Some front ends do not explicitly declare all anonymous
1332 artificial variables. We compensate here by declaring the
1333 variables, though it would be better if the front ends would
1334 explicitly declare them. */
1335 if (!DECL_SEEN_IN_BIND_EXPR_P (decl
)
1336 && DECL_ARTIFICIAL (decl
) && DECL_NAME (decl
) == NULL_TREE
)
1337 gimple_add_tmp_var (decl
);
1343 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1344 and replacing the LOOP_EXPR with goto, but if the loop contains an
1345 EXIT_EXPR, we need to append a label for it to jump to. */
1347 static enum gimplify_status
1348 gimplify_loop_expr (tree
*expr_p
, gimple_seq
*pre_p
)
1350 tree saved_label
= gimplify_ctxp
->exit_label
;
1351 tree start_label
= create_artificial_label (UNKNOWN_LOCATION
);
1353 gimplify_seq_add_stmt (pre_p
, gimple_build_label (start_label
));
1355 gimplify_ctxp
->exit_label
= NULL_TREE
;
1357 gimplify_and_add (LOOP_EXPR_BODY (*expr_p
), pre_p
);
1359 gimplify_seq_add_stmt (pre_p
, gimple_build_goto (start_label
));
1361 if (gimplify_ctxp
->exit_label
)
1362 gimplify_seq_add_stmt (pre_p
, gimple_build_label (gimplify_ctxp
->exit_label
));
1364 gimplify_ctxp
->exit_label
= saved_label
;
1370 /* Gimplifies a statement list onto a sequence. These may be created either
1371 by an enlightened front-end, or by shortcut_cond_expr. */
1373 static enum gimplify_status
1374 gimplify_statement_list (tree
*expr_p
, gimple_seq
*pre_p
)
1376 tree temp
= voidify_wrapper_expr (*expr_p
, NULL
);
1378 tree_stmt_iterator i
= tsi_start (*expr_p
);
1380 while (!tsi_end_p (i
))
1382 gimplify_stmt (tsi_stmt_ptr (i
), pre_p
);
1395 /* Compare two case labels. Because the front end should already have
1396 made sure that case ranges do not overlap, it is enough to only compare
1397 the CASE_LOW values of each case label. */
1400 compare_case_labels (const void *p1
, const void *p2
)
1402 const_tree
const case1
= *(const_tree
const*)p1
;
1403 const_tree
const case2
= *(const_tree
const*)p2
;
1405 /* The 'default' case label always goes first. */
1406 if (!CASE_LOW (case1
))
1408 else if (!CASE_LOW (case2
))
1411 return tree_int_cst_compare (CASE_LOW (case1
), CASE_LOW (case2
));
1415 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1418 sort_case_labels (VEC(tree
,heap
)* label_vec
)
1420 size_t len
= VEC_length (tree
, label_vec
);
1421 qsort (VEC_address (tree
, label_vec
), len
, sizeof (tree
),
1422 compare_case_labels
);
1426 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1429 static enum gimplify_status
1430 gimplify_switch_expr (tree
*expr_p
, gimple_seq
*pre_p
)
1432 tree switch_expr
= *expr_p
;
1433 gimple_seq switch_body_seq
= NULL
;
1434 enum gimplify_status ret
;
1436 ret
= gimplify_expr (&SWITCH_COND (switch_expr
), pre_p
, NULL
, is_gimple_val
,
1438 if (ret
== GS_ERROR
|| ret
== GS_UNHANDLED
)
1441 if (SWITCH_BODY (switch_expr
))
1443 VEC (tree
,heap
) *labels
;
1444 VEC (tree
,heap
) *saved_labels
;
1445 tree default_case
= NULL_TREE
;
1447 gimple gimple_switch
;
1449 /* If someone can be bothered to fill in the labels, they can
1450 be bothered to null out the body too. */
1451 gcc_assert (!SWITCH_LABELS (switch_expr
));
1453 /* save old labels, get new ones from body, then restore the old
1454 labels. Save all the things from the switch body to append after. */
1455 saved_labels
= gimplify_ctxp
->case_labels
;
1456 gimplify_ctxp
->case_labels
= VEC_alloc (tree
, heap
, 8);
1458 gimplify_stmt (&SWITCH_BODY (switch_expr
), &switch_body_seq
);
1459 labels
= gimplify_ctxp
->case_labels
;
1460 gimplify_ctxp
->case_labels
= saved_labels
;
1463 while (i
< VEC_length (tree
, labels
))
1465 tree elt
= VEC_index (tree
, labels
, i
);
1466 tree low
= CASE_LOW (elt
);
1467 bool remove_element
= FALSE
;
1471 /* Discard empty ranges. */
1472 tree high
= CASE_HIGH (elt
);
1473 if (high
&& tree_int_cst_lt (high
, low
))
1474 remove_element
= TRUE
;
1478 /* The default case must be the last label in the list. */
1479 gcc_assert (!default_case
);
1481 remove_element
= TRUE
;
1485 VEC_ordered_remove (tree
, labels
, i
);
1491 if (!VEC_empty (tree
, labels
))
1492 sort_case_labels (labels
);
1496 tree type
= TREE_TYPE (switch_expr
);
1498 /* If the switch has no default label, add one, so that we jump
1499 around the switch body. If the labels already cover the whole
1500 range of type, add the default label pointing to one of the
1502 if (type
== void_type_node
)
1503 type
= TREE_TYPE (SWITCH_COND (switch_expr
));
1505 && INTEGRAL_TYPE_P (type
)
1506 && TYPE_MIN_VALUE (type
)
1507 && TYPE_MAX_VALUE (type
)
1508 && tree_int_cst_equal (CASE_LOW (VEC_index (tree
, labels
, 0)),
1509 TYPE_MIN_VALUE (type
)))
1511 tree low
, high
= CASE_HIGH (VEC_index (tree
, labels
, len
- 1));
1513 high
= CASE_LOW (VEC_index (tree
, labels
, len
- 1));
1514 if (tree_int_cst_equal (high
, TYPE_MAX_VALUE (type
)))
1516 for (i
= 1; i
< len
; i
++)
1518 high
= CASE_LOW (VEC_index (tree
, labels
, i
));
1519 low
= CASE_HIGH (VEC_index (tree
, labels
, i
- 1));
1521 low
= CASE_LOW (VEC_index (tree
, labels
, i
- 1));
1522 if ((TREE_INT_CST_LOW (low
) + 1
1523 != TREE_INT_CST_LOW (high
))
1524 || (TREE_INT_CST_HIGH (low
)
1525 + (TREE_INT_CST_LOW (high
) == 0)
1526 != TREE_INT_CST_HIGH (high
)))
1530 default_case
= build3 (CASE_LABEL_EXPR
, void_type_node
,
1531 NULL_TREE
, NULL_TREE
,
1532 CASE_LABEL (VEC_index (tree
,
1542 = build3 (CASE_LABEL_EXPR
, void_type_node
,
1543 NULL_TREE
, NULL_TREE
,
1544 create_artificial_label (UNKNOWN_LOCATION
));
1545 new_default
= gimple_build_label (CASE_LABEL (default_case
));
1546 gimplify_seq_add_stmt (&switch_body_seq
, new_default
);
1550 gimple_switch
= gimple_build_switch_vec (SWITCH_COND (switch_expr
),
1551 default_case
, labels
);
1552 gimplify_seq_add_stmt (pre_p
, gimple_switch
);
1553 gimplify_seq_add_seq (pre_p
, switch_body_seq
);
1554 VEC_free(tree
, heap
, labels
);
1557 gcc_assert (SWITCH_LABELS (switch_expr
));
1563 static enum gimplify_status
1564 gimplify_case_label_expr (tree
*expr_p
, gimple_seq
*pre_p
)
1566 struct gimplify_ctx
*ctxp
;
1567 gimple gimple_label
;
1569 /* Invalid OpenMP programs can play Duff's Device type games with
1570 #pragma omp parallel. At least in the C front end, we don't
1571 detect such invalid branches until after gimplification. */
1572 for (ctxp
= gimplify_ctxp
; ; ctxp
= ctxp
->prev_context
)
1573 if (ctxp
->case_labels
)
1576 gimple_label
= gimple_build_label (CASE_LABEL (*expr_p
));
1577 VEC_safe_push (tree
, heap
, ctxp
->case_labels
, *expr_p
);
1578 gimplify_seq_add_stmt (pre_p
, gimple_label
);
1583 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1587 build_and_jump (tree
*label_p
)
1589 if (label_p
== NULL
)
1590 /* If there's nowhere to jump, just fall through. */
1593 if (*label_p
== NULL_TREE
)
1595 tree label
= create_artificial_label (UNKNOWN_LOCATION
);
1599 return build1 (GOTO_EXPR
, void_type_node
, *label_p
);
1602 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1603 This also involves building a label to jump to and communicating it to
1604 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1606 static enum gimplify_status
1607 gimplify_exit_expr (tree
*expr_p
)
1609 tree cond
= TREE_OPERAND (*expr_p
, 0);
1612 expr
= build_and_jump (&gimplify_ctxp
->exit_label
);
1613 expr
= build3 (COND_EXPR
, void_type_node
, cond
, expr
, NULL_TREE
);
1619 /* A helper function to be called via walk_tree. Mark all labels under *TP
1620 as being forced. To be called for DECL_INITIAL of static variables. */
1623 force_labels_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
1627 if (TREE_CODE (*tp
) == LABEL_DECL
)
1628 FORCED_LABEL (*tp
) = 1;
1633 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1634 different from its canonical type, wrap the whole thing inside a
1635 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1638 The canonical type of a COMPONENT_REF is the type of the field being
1639 referenced--unless the field is a bit-field which can be read directly
1640 in a smaller mode, in which case the canonical type is the
1641 sign-appropriate type corresponding to that mode. */
1644 canonicalize_component_ref (tree
*expr_p
)
1646 tree expr
= *expr_p
;
1649 gcc_assert (TREE_CODE (expr
) == COMPONENT_REF
);
1651 if (INTEGRAL_TYPE_P (TREE_TYPE (expr
)))
1652 type
= TREE_TYPE (get_unwidened (expr
, NULL_TREE
));
1654 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
1656 /* One could argue that all the stuff below is not necessary for
1657 the non-bitfield case and declare it a FE error if type
1658 adjustment would be needed. */
1659 if (TREE_TYPE (expr
) != type
)
1661 #ifdef ENABLE_TYPES_CHECKING
1662 tree old_type
= TREE_TYPE (expr
);
1666 /* We need to preserve qualifiers and propagate them from
1668 type_quals
= TYPE_QUALS (type
)
1669 | TYPE_QUALS (TREE_TYPE (TREE_OPERAND (expr
, 0)));
1670 if (TYPE_QUALS (type
) != type_quals
)
1671 type
= build_qualified_type (TYPE_MAIN_VARIANT (type
), type_quals
);
1673 /* Set the type of the COMPONENT_REF to the underlying type. */
1674 TREE_TYPE (expr
) = type
;
1676 #ifdef ENABLE_TYPES_CHECKING
1677 /* It is now a FE error, if the conversion from the canonical
1678 type to the original expression type is not useless. */
1679 gcc_assert (useless_type_conversion_p (old_type
, type
));
1684 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1685 to foo, embed that change in the ADDR_EXPR by converting
1690 where L is the lower bound. For simplicity, only do this for constant
1692 The constraint is that the type of &array[L] is trivially convertible
1696 canonicalize_addr_expr (tree
*expr_p
)
1698 tree expr
= *expr_p
;
1699 tree addr_expr
= TREE_OPERAND (expr
, 0);
1700 tree datype
, ddatype
, pddatype
;
1702 /* We simplify only conversions from an ADDR_EXPR to a pointer type. */
1703 if (!POINTER_TYPE_P (TREE_TYPE (expr
))
1704 || TREE_CODE (addr_expr
) != ADDR_EXPR
)
1707 /* The addr_expr type should be a pointer to an array. */
1708 datype
= TREE_TYPE (TREE_TYPE (addr_expr
));
1709 if (TREE_CODE (datype
) != ARRAY_TYPE
)
1712 /* The pointer to element type shall be trivially convertible to
1713 the expression pointer type. */
1714 ddatype
= TREE_TYPE (datype
);
1715 pddatype
= build_pointer_type (ddatype
);
1716 if (!useless_type_conversion_p (TYPE_MAIN_VARIANT (TREE_TYPE (expr
)),
1720 /* The lower bound and element sizes must be constant. */
1721 if (!TYPE_SIZE_UNIT (ddatype
)
1722 || TREE_CODE (TYPE_SIZE_UNIT (ddatype
)) != INTEGER_CST
1723 || !TYPE_DOMAIN (datype
) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))
1724 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))) != INTEGER_CST
)
1727 /* All checks succeeded. Build a new node to merge the cast. */
1728 *expr_p
= build4 (ARRAY_REF
, ddatype
, TREE_OPERAND (addr_expr
, 0),
1729 TYPE_MIN_VALUE (TYPE_DOMAIN (datype
)),
1730 NULL_TREE
, NULL_TREE
);
1731 *expr_p
= build1 (ADDR_EXPR
, pddatype
, *expr_p
);
1733 /* We can have stripped a required restrict qualifier above. */
1734 if (!useless_type_conversion_p (TREE_TYPE (expr
), TREE_TYPE (*expr_p
)))
1735 *expr_p
= fold_convert (TREE_TYPE (expr
), *expr_p
);
1738 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1739 underneath as appropriate. */
1741 static enum gimplify_status
1742 gimplify_conversion (tree
*expr_p
)
1745 location_t loc
= EXPR_LOCATION (*expr_p
);
1746 gcc_assert (CONVERT_EXPR_P (*expr_p
));
1748 /* Then strip away all but the outermost conversion. */
1749 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p
, 0));
1751 /* And remove the outermost conversion if it's useless. */
1752 if (tree_ssa_useless_type_conversion (*expr_p
))
1753 *expr_p
= TREE_OPERAND (*expr_p
, 0);
1755 /* Attempt to avoid NOP_EXPR by producing reference to a subtype.
1756 For example this fold (subclass *)&A into &A->subclass avoiding
1757 a need for statement. */
1758 if (CONVERT_EXPR_P (*expr_p
)
1759 && POINTER_TYPE_P (TREE_TYPE (*expr_p
))
1760 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p
, 0)))
1761 && (tem
= maybe_fold_offset_to_address
1762 (EXPR_LOCATION (*expr_p
), TREE_OPERAND (*expr_p
, 0),
1763 integer_zero_node
, TREE_TYPE (*expr_p
))) != NULL_TREE
)
1766 /* If we still have a conversion at the toplevel,
1767 then canonicalize some constructs. */
1768 if (CONVERT_EXPR_P (*expr_p
))
1770 tree sub
= TREE_OPERAND (*expr_p
, 0);
1772 /* If a NOP conversion is changing the type of a COMPONENT_REF
1773 expression, then canonicalize its type now in order to expose more
1774 redundant conversions. */
1775 if (TREE_CODE (sub
) == COMPONENT_REF
)
1776 canonicalize_component_ref (&TREE_OPERAND (*expr_p
, 0));
1778 /* If a NOP conversion is changing a pointer to array of foo
1779 to a pointer to foo, embed that change in the ADDR_EXPR. */
1780 else if (TREE_CODE (sub
) == ADDR_EXPR
)
1781 canonicalize_addr_expr (expr_p
);
1784 /* If we have a conversion to a non-register type force the
1785 use of a VIEW_CONVERT_EXPR instead. */
1786 if (CONVERT_EXPR_P (*expr_p
) && !is_gimple_reg_type (TREE_TYPE (*expr_p
)))
1787 *expr_p
= fold_build1_loc (loc
, VIEW_CONVERT_EXPR
, TREE_TYPE (*expr_p
),
1788 TREE_OPERAND (*expr_p
, 0));
1793 /* Nonlocal VLAs seen in the current function. */
1794 static struct pointer_set_t
*nonlocal_vlas
;
1796 /* Gimplify a VAR_DECL or PARM_DECL. Returns GS_OK if we expanded a
1797 DECL_VALUE_EXPR, and it's worth re-examining things. */
1799 static enum gimplify_status
1800 gimplify_var_or_parm_decl (tree
*expr_p
)
1802 tree decl
= *expr_p
;
1804 /* ??? If this is a local variable, and it has not been seen in any
1805 outer BIND_EXPR, then it's probably the result of a duplicate
1806 declaration, for which we've already issued an error. It would
1807 be really nice if the front end wouldn't leak these at all.
1808 Currently the only known culprit is C++ destructors, as seen
1809 in g++.old-deja/g++.jason/binding.C. */
1810 if (TREE_CODE (decl
) == VAR_DECL
1811 && !DECL_SEEN_IN_BIND_EXPR_P (decl
)
1812 && !TREE_STATIC (decl
) && !DECL_EXTERNAL (decl
)
1813 && decl_function_context (decl
) == current_function_decl
)
1815 gcc_assert (errorcount
|| sorrycount
);
1819 /* When within an OpenMP context, notice uses of variables. */
1820 if (gimplify_omp_ctxp
&& omp_notice_variable (gimplify_omp_ctxp
, decl
, true))
1823 /* If the decl is an alias for another expression, substitute it now. */
1824 if (DECL_HAS_VALUE_EXPR_P (decl
))
1826 tree value_expr
= DECL_VALUE_EXPR (decl
);
1828 /* For referenced nonlocal VLAs add a decl for debugging purposes
1829 to the current function. */
1830 if (TREE_CODE (decl
) == VAR_DECL
1831 && TREE_CODE (DECL_SIZE_UNIT (decl
)) != INTEGER_CST
1832 && nonlocal_vlas
!= NULL
1833 && TREE_CODE (value_expr
) == INDIRECT_REF
1834 && TREE_CODE (TREE_OPERAND (value_expr
, 0)) == VAR_DECL
1835 && decl_function_context (decl
) != current_function_decl
)
1837 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
1838 while (ctx
&& ctx
->region_type
== ORT_WORKSHARE
)
1839 ctx
= ctx
->outer_context
;
1840 if (!ctx
&& !pointer_set_insert (nonlocal_vlas
, decl
))
1842 tree copy
= copy_node (decl
), block
;
1844 lang_hooks
.dup_lang_specific_decl (copy
);
1845 SET_DECL_RTL (copy
, NULL_RTX
);
1846 TREE_USED (copy
) = 1;
1847 block
= DECL_INITIAL (current_function_decl
);
1848 TREE_CHAIN (copy
) = BLOCK_VARS (block
);
1849 BLOCK_VARS (block
) = copy
;
1850 SET_DECL_VALUE_EXPR (copy
, unshare_expr (value_expr
));
1851 DECL_HAS_VALUE_EXPR_P (copy
) = 1;
1855 *expr_p
= unshare_expr (value_expr
);
1863 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1867 : min_lval '[' val ']'
1869 | compound_lval '[' val ']'
1870 | compound_lval '.' ID
1872 This is not part of the original SIMPLE definition, which separates
1873 array and member references, but it seems reasonable to handle them
1874 together. Also, this way we don't run into problems with union
1875 aliasing; gcc requires that for accesses through a union to alias, the
1876 union reference must be explicit, which was not always the case when we
1877 were splitting up array and member refs.
1879 PRE_P points to the sequence where side effects that must happen before
1880 *EXPR_P should be stored.
1882 POST_P points to the sequence where side effects that must happen after
1883 *EXPR_P should be stored. */
1885 static enum gimplify_status
1886 gimplify_compound_lval (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
1887 fallback_t fallback
)
1890 VEC(tree
,heap
) *stack
;
1891 enum gimplify_status ret
= GS_OK
, tret
;
1893 location_t loc
= EXPR_LOCATION (*expr_p
);
1895 /* Create a stack of the subexpressions so later we can walk them in
1896 order from inner to outer. */
1897 stack
= VEC_alloc (tree
, heap
, 10);
1899 /* We can handle anything that get_inner_reference can deal with. */
1900 for (p
= expr_p
; ; p
= &TREE_OPERAND (*p
, 0))
1903 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1904 if (TREE_CODE (*p
) == INDIRECT_REF
)
1905 *p
= fold_indirect_ref_loc (loc
, *p
);
1907 if (handled_component_p (*p
))
1909 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
1910 additional COMPONENT_REFs. */
1911 else if ((TREE_CODE (*p
) == VAR_DECL
|| TREE_CODE (*p
) == PARM_DECL
)
1912 && gimplify_var_or_parm_decl (p
) == GS_OK
)
1917 VEC_safe_push (tree
, heap
, stack
, *p
);
1920 gcc_assert (VEC_length (tree
, stack
));
1922 /* Now STACK is a stack of pointers to all the refs we've walked through
1923 and P points to the innermost expression.
1925 Java requires that we elaborated nodes in source order. That
1926 means we must gimplify the inner expression followed by each of
1927 the indices, in order. But we can't gimplify the inner
1928 expression until we deal with any variable bounds, sizes, or
1929 positions in order to deal with PLACEHOLDER_EXPRs.
1931 So we do this in three steps. First we deal with the annotations
1932 for any variables in the components, then we gimplify the base,
1933 then we gimplify any indices, from left to right. */
1934 for (i
= VEC_length (tree
, stack
) - 1; i
>= 0; i
--)
1936 tree t
= VEC_index (tree
, stack
, i
);
1938 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
1940 /* Gimplify the low bound and element type size and put them into
1941 the ARRAY_REF. If these values are set, they have already been
1943 if (TREE_OPERAND (t
, 2) == NULL_TREE
)
1945 tree low
= unshare_expr (array_ref_low_bound (t
));
1946 if (!is_gimple_min_invariant (low
))
1948 TREE_OPERAND (t
, 2) = low
;
1949 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
,
1950 post_p
, is_gimple_reg
,
1952 ret
= MIN (ret
, tret
);
1956 if (!TREE_OPERAND (t
, 3))
1958 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (t
, 0)));
1959 tree elmt_size
= unshare_expr (array_ref_element_size (t
));
1960 tree factor
= size_int (TYPE_ALIGN_UNIT (elmt_type
));
1962 /* Divide the element size by the alignment of the element
1964 elmt_size
= size_binop_loc (loc
, EXACT_DIV_EXPR
, elmt_size
, factor
);
1966 if (!is_gimple_min_invariant (elmt_size
))
1968 TREE_OPERAND (t
, 3) = elmt_size
;
1969 tret
= gimplify_expr (&TREE_OPERAND (t
, 3), pre_p
,
1970 post_p
, is_gimple_reg
,
1972 ret
= MIN (ret
, tret
);
1976 else if (TREE_CODE (t
) == COMPONENT_REF
)
1978 /* Set the field offset into T and gimplify it. */
1979 if (!TREE_OPERAND (t
, 2))
1981 tree offset
= unshare_expr (component_ref_field_offset (t
));
1982 tree field
= TREE_OPERAND (t
, 1);
1984 = size_int (DECL_OFFSET_ALIGN (field
) / BITS_PER_UNIT
);
1986 /* Divide the offset by its alignment. */
1987 offset
= size_binop_loc (loc
, EXACT_DIV_EXPR
, offset
, factor
);
1989 if (!is_gimple_min_invariant (offset
))
1991 TREE_OPERAND (t
, 2) = offset
;
1992 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
,
1993 post_p
, is_gimple_reg
,
1995 ret
= MIN (ret
, tret
);
2001 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
2002 so as to match the min_lval predicate. Failure to do so may result
2003 in the creation of large aggregate temporaries. */
2004 tret
= gimplify_expr (p
, pre_p
, post_p
, is_gimple_min_lval
,
2005 fallback
| fb_lvalue
);
2006 ret
= MIN (ret
, tret
);
2008 /* And finally, the indices and operands to BIT_FIELD_REF. During this
2009 loop we also remove any useless conversions. */
2010 for (; VEC_length (tree
, stack
) > 0; )
2012 tree t
= VEC_pop (tree
, stack
);
2014 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
2016 /* Gimplify the dimension. */
2017 if (!is_gimple_min_invariant (TREE_OPERAND (t
, 1)))
2019 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), pre_p
, post_p
,
2020 is_gimple_val
, fb_rvalue
);
2021 ret
= MIN (ret
, tret
);
2024 else if (TREE_CODE (t
) == BIT_FIELD_REF
)
2026 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), pre_p
, post_p
,
2027 is_gimple_val
, fb_rvalue
);
2028 ret
= MIN (ret
, tret
);
2029 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
2030 is_gimple_val
, fb_rvalue
);
2031 ret
= MIN (ret
, tret
);
2034 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t
, 0));
2036 /* The innermost expression P may have originally had
2037 TREE_SIDE_EFFECTS set which would have caused all the outer
2038 expressions in *EXPR_P leading to P to also have had
2039 TREE_SIDE_EFFECTS set. */
2040 recalculate_side_effects (t
);
2043 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
2044 if ((fallback
& fb_rvalue
) && TREE_CODE (*expr_p
) == COMPONENT_REF
)
2046 canonicalize_component_ref (expr_p
);
2047 ret
= MIN (ret
, GS_OK
);
2050 VEC_free (tree
, heap
, stack
);
2055 /* Gimplify the self modifying expression pointed to by EXPR_P
2058 PRE_P points to the list where side effects that must happen before
2059 *EXPR_P should be stored.
2061 POST_P points to the list where side effects that must happen after
2062 *EXPR_P should be stored.
2064 WANT_VALUE is nonzero iff we want to use the value of this expression
2065 in another expression. */
2067 static enum gimplify_status
2068 gimplify_self_mod_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
2071 enum tree_code code
;
2072 tree lhs
, lvalue
, rhs
, t1
;
2073 gimple_seq post
= NULL
, *orig_post_p
= post_p
;
2075 enum tree_code arith_code
;
2076 enum gimplify_status ret
;
2077 location_t loc
= EXPR_LOCATION (*expr_p
);
2079 code
= TREE_CODE (*expr_p
);
2081 gcc_assert (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
2082 || code
== PREINCREMENT_EXPR
|| code
== PREDECREMENT_EXPR
);
2084 /* Prefix or postfix? */
2085 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
2086 /* Faster to treat as prefix if result is not used. */
2087 postfix
= want_value
;
2091 /* For postfix, make sure the inner expression's post side effects
2092 are executed after side effects from this expression. */
2096 /* Add or subtract? */
2097 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
2098 arith_code
= PLUS_EXPR
;
2100 arith_code
= MINUS_EXPR
;
2102 /* Gimplify the LHS into a GIMPLE lvalue. */
2103 lvalue
= TREE_OPERAND (*expr_p
, 0);
2104 ret
= gimplify_expr (&lvalue
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
2105 if (ret
== GS_ERROR
)
2108 /* Extract the operands to the arithmetic operation. */
2110 rhs
= TREE_OPERAND (*expr_p
, 1);
2112 /* For postfix operator, we evaluate the LHS to an rvalue and then use
2113 that as the result value and in the postqueue operation. We also
2114 make sure to make lvalue a minimal lval, see
2115 gcc.c-torture/execute/20040313-1.c for an example where this matters. */
2118 if (!is_gimple_min_lval (lvalue
))
2120 mark_addressable (lvalue
);
2121 lvalue
= build_fold_addr_expr_loc (input_location
, lvalue
);
2122 gimplify_expr (&lvalue
, pre_p
, post_p
, is_gimple_val
, fb_rvalue
);
2123 lvalue
= build_fold_indirect_ref_loc (input_location
, lvalue
);
2125 ret
= gimplify_expr (&lhs
, pre_p
, post_p
, is_gimple_val
, fb_rvalue
);
2126 if (ret
== GS_ERROR
)
2130 /* For POINTERs increment, use POINTER_PLUS_EXPR. */
2131 if (POINTER_TYPE_P (TREE_TYPE (lhs
)))
2133 rhs
= fold_convert_loc (loc
, sizetype
, rhs
);
2134 if (arith_code
== MINUS_EXPR
)
2135 rhs
= fold_build1_loc (loc
, NEGATE_EXPR
, TREE_TYPE (rhs
), rhs
);
2136 arith_code
= POINTER_PLUS_EXPR
;
2139 t1
= build2 (arith_code
, TREE_TYPE (*expr_p
), lhs
, rhs
);
2143 gimplify_assign (lvalue
, t1
, orig_post_p
);
2144 gimplify_seq_add_seq (orig_post_p
, post
);
2150 *expr_p
= build2 (MODIFY_EXPR
, TREE_TYPE (lvalue
), lvalue
, t1
);
2156 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
2159 maybe_with_size_expr (tree
*expr_p
)
2161 tree expr
= *expr_p
;
2162 tree type
= TREE_TYPE (expr
);
2165 /* If we've already wrapped this or the type is error_mark_node, we can't do
2167 if (TREE_CODE (expr
) == WITH_SIZE_EXPR
2168 || type
== error_mark_node
)
2171 /* If the size isn't known or is a constant, we have nothing to do. */
2172 size
= TYPE_SIZE_UNIT (type
);
2173 if (!size
|| TREE_CODE (size
) == INTEGER_CST
)
2176 /* Otherwise, make a WITH_SIZE_EXPR. */
2177 size
= unshare_expr (size
);
2178 size
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (size
, expr
);
2179 *expr_p
= build2 (WITH_SIZE_EXPR
, type
, expr
, size
);
2183 /* Helper for gimplify_call_expr. Gimplify a single argument *ARG_P
2184 Store any side-effects in PRE_P. CALL_LOCATION is the location of
2187 static enum gimplify_status
2188 gimplify_arg (tree
*arg_p
, gimple_seq
*pre_p
, location_t call_location
)
2190 bool (*test
) (tree
);
2193 /* In general, we allow lvalues for function arguments to avoid
2194 extra overhead of copying large aggregates out of even larger
2195 aggregates into temporaries only to copy the temporaries to
2196 the argument list. Make optimizers happy by pulling out to
2197 temporaries those types that fit in registers. */
2198 if (is_gimple_reg_type (TREE_TYPE (*arg_p
)))
2199 test
= is_gimple_val
, fb
= fb_rvalue
;
2201 test
= is_gimple_lvalue
, fb
= fb_either
;
2203 /* If this is a variable sized type, we must remember the size. */
2204 maybe_with_size_expr (arg_p
);
2206 /* FIXME diagnostics: This will mess up gcc.dg/Warray-bounds.c. */
2207 /* Make sure arguments have the same location as the function call
2209 protected_set_expr_location (*arg_p
, call_location
);
2211 /* There is a sequence point before a function call. Side effects in
2212 the argument list must occur before the actual call. So, when
2213 gimplifying arguments, force gimplify_expr to use an internal
2214 post queue which is then appended to the end of PRE_P. */
2215 return gimplify_expr (arg_p
, pre_p
, NULL
, test
, fb
);
2219 /* Gimplify the CALL_EXPR node *EXPR_P into the GIMPLE sequence PRE_P.
2220 WANT_VALUE is true if the result of the call is desired. */
2222 static enum gimplify_status
2223 gimplify_call_expr (tree
*expr_p
, gimple_seq
*pre_p
, bool want_value
)
2225 tree fndecl
, parms
, p
;
2226 enum gimplify_status ret
;
2229 bool builtin_va_start_p
= FALSE
;
2230 location_t loc
= EXPR_LOCATION (*expr_p
);
2232 gcc_assert (TREE_CODE (*expr_p
) == CALL_EXPR
);
2234 /* For reliable diagnostics during inlining, it is necessary that
2235 every call_expr be annotated with file and line. */
2236 if (! EXPR_HAS_LOCATION (*expr_p
))
2237 SET_EXPR_LOCATION (*expr_p
, input_location
);
2239 /* This may be a call to a builtin function.
2241 Builtin function calls may be transformed into different
2242 (and more efficient) builtin function calls under certain
2243 circumstances. Unfortunately, gimplification can muck things
2244 up enough that the builtin expanders are not aware that certain
2245 transformations are still valid.
2247 So we attempt transformation/gimplification of the call before
2248 we gimplify the CALL_EXPR. At this time we do not manage to
2249 transform all calls in the same manner as the expanders do, but
2250 we do transform most of them. */
2251 fndecl
= get_callee_fndecl (*expr_p
);
2252 if (fndecl
&& DECL_BUILT_IN (fndecl
))
2254 tree new_tree
= fold_call_expr (input_location
, *expr_p
, !want_value
);
2256 if (new_tree
&& new_tree
!= *expr_p
)
2258 /* There was a transformation of this call which computes the
2259 same value, but in a more efficient way. Return and try
2265 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
2266 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_VA_START
)
2268 builtin_va_start_p
= TRUE
;
2269 if (call_expr_nargs (*expr_p
) < 2)
2271 error ("too few arguments to function %<va_start%>");
2272 *expr_p
= build_empty_stmt (EXPR_LOCATION (*expr_p
));
2276 if (fold_builtin_next_arg (*expr_p
, true))
2278 *expr_p
= build_empty_stmt (EXPR_LOCATION (*expr_p
));
2284 /* There is a sequence point before the call, so any side effects in
2285 the calling expression must occur before the actual call. Force
2286 gimplify_expr to use an internal post queue. */
2287 ret
= gimplify_expr (&CALL_EXPR_FN (*expr_p
), pre_p
, NULL
,
2288 is_gimple_call_addr
, fb_rvalue
);
2290 nargs
= call_expr_nargs (*expr_p
);
2292 /* Get argument types for verification. */
2293 fndecl
= get_callee_fndecl (*expr_p
);
2296 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
2297 else if (POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_FN (*expr_p
))))
2298 parms
= TYPE_ARG_TYPES (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (*expr_p
))));
2300 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
2301 p
= DECL_ARGUMENTS (fndecl
);
2306 for (i
= 0; i
< nargs
&& p
; i
++, p
= TREE_CHAIN (p
))
2309 /* If the last argument is __builtin_va_arg_pack () and it is not
2310 passed as a named argument, decrease the number of CALL_EXPR
2311 arguments and set instead the CALL_EXPR_VA_ARG_PACK flag. */
2314 && TREE_CODE (CALL_EXPR_ARG (*expr_p
, nargs
- 1)) == CALL_EXPR
)
2316 tree last_arg
= CALL_EXPR_ARG (*expr_p
, nargs
- 1);
2317 tree last_arg_fndecl
= get_callee_fndecl (last_arg
);
2320 && TREE_CODE (last_arg_fndecl
) == FUNCTION_DECL
2321 && DECL_BUILT_IN_CLASS (last_arg_fndecl
) == BUILT_IN_NORMAL
2322 && DECL_FUNCTION_CODE (last_arg_fndecl
) == BUILT_IN_VA_ARG_PACK
)
2324 tree call
= *expr_p
;
2327 *expr_p
= build_call_array_loc (loc
, TREE_TYPE (call
),
2328 CALL_EXPR_FN (call
),
2329 nargs
, CALL_EXPR_ARGP (call
));
2331 /* Copy all CALL_EXPR flags, location and block, except
2332 CALL_EXPR_VA_ARG_PACK flag. */
2333 CALL_EXPR_STATIC_CHAIN (*expr_p
) = CALL_EXPR_STATIC_CHAIN (call
);
2334 CALL_EXPR_TAILCALL (*expr_p
) = CALL_EXPR_TAILCALL (call
);
2335 CALL_EXPR_RETURN_SLOT_OPT (*expr_p
)
2336 = CALL_EXPR_RETURN_SLOT_OPT (call
);
2337 CALL_FROM_THUNK_P (*expr_p
) = CALL_FROM_THUNK_P (call
);
2338 CALL_CANNOT_INLINE_P (*expr_p
) = CALL_CANNOT_INLINE_P (call
);
2339 SET_EXPR_LOCATION (*expr_p
, EXPR_LOCATION (call
));
2340 TREE_BLOCK (*expr_p
) = TREE_BLOCK (call
);
2342 /* Set CALL_EXPR_VA_ARG_PACK. */
2343 CALL_EXPR_VA_ARG_PACK (*expr_p
) = 1;
2347 /* Finally, gimplify the function arguments. */
2350 for (i
= (PUSH_ARGS_REVERSED
? nargs
- 1 : 0);
2351 PUSH_ARGS_REVERSED
? i
>= 0 : i
< nargs
;
2352 PUSH_ARGS_REVERSED
? i
-- : i
++)
2354 enum gimplify_status t
;
2356 /* Avoid gimplifying the second argument to va_start, which needs to
2357 be the plain PARM_DECL. */
2358 if ((i
!= 1) || !builtin_va_start_p
)
2360 t
= gimplify_arg (&CALL_EXPR_ARG (*expr_p
, i
), pre_p
,
2361 EXPR_LOCATION (*expr_p
));
2369 /* Verify the function result. */
2370 if (want_value
&& fndecl
2371 && VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fndecl
))))
2373 error_at (loc
, "using result of function returning %<void%>");
2377 /* Try this again in case gimplification exposed something. */
2378 if (ret
!= GS_ERROR
)
2380 tree new_tree
= fold_call_expr (input_location
, *expr_p
, !want_value
);
2382 if (new_tree
&& new_tree
!= *expr_p
)
2384 /* There was a transformation of this call which computes the
2385 same value, but in a more efficient way. Return and try
2393 *expr_p
= error_mark_node
;
2397 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2398 decl. This allows us to eliminate redundant or useless
2399 calls to "const" functions. */
2400 if (TREE_CODE (*expr_p
) == CALL_EXPR
)
2402 int flags
= call_expr_flags (*expr_p
);
2403 if (flags
& (ECF_CONST
| ECF_PURE
)
2404 /* An infinite loop is considered a side effect. */
2405 && !(flags
& (ECF_LOOPING_CONST_OR_PURE
)))
2406 TREE_SIDE_EFFECTS (*expr_p
) = 0;
2409 /* If the value is not needed by the caller, emit a new GIMPLE_CALL
2410 and clear *EXPR_P. Otherwise, leave *EXPR_P in its gimplified
2411 form and delegate the creation of a GIMPLE_CALL to
2412 gimplify_modify_expr. This is always possible because when
2413 WANT_VALUE is true, the caller wants the result of this call into
2414 a temporary, which means that we will emit an INIT_EXPR in
2415 internal_get_tmp_var which will then be handled by
2416 gimplify_modify_expr. */
2419 /* The CALL_EXPR in *EXPR_P is already in GIMPLE form, so all we
2420 have to do is replicate it as a GIMPLE_CALL tuple. */
2421 call
= gimple_build_call_from_tree (*expr_p
);
2422 gimplify_seq_add_stmt (pre_p
, call
);
2423 *expr_p
= NULL_TREE
;
2429 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2430 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2432 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2433 condition is true or false, respectively. If null, we should generate
2434 our own to skip over the evaluation of this specific expression.
2436 LOCUS is the source location of the COND_EXPR.
2438 This function is the tree equivalent of do_jump.
2440 shortcut_cond_r should only be called by shortcut_cond_expr. */
2443 shortcut_cond_r (tree pred
, tree
*true_label_p
, tree
*false_label_p
,
2446 tree local_label
= NULL_TREE
;
2447 tree t
, expr
= NULL
;
2449 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2450 retain the shortcut semantics. Just insert the gotos here;
2451 shortcut_cond_expr will append the real blocks later. */
2452 if (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2454 location_t new_locus
;
2456 /* Turn if (a && b) into
2458 if (a); else goto no;
2459 if (b) goto yes; else goto no;
2462 if (false_label_p
== NULL
)
2463 false_label_p
= &local_label
;
2465 /* Keep the original source location on the first 'if'. */
2466 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), NULL
, false_label_p
, locus
);
2467 append_to_statement_list (t
, &expr
);
2469 /* Set the source location of the && on the second 'if'. */
2470 new_locus
= EXPR_HAS_LOCATION (pred
) ? EXPR_LOCATION (pred
) : locus
;
2471 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
, false_label_p
,
2473 append_to_statement_list (t
, &expr
);
2475 else if (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2477 location_t new_locus
;
2479 /* Turn if (a || b) into
2482 if (b) goto yes; else goto no;
2485 if (true_label_p
== NULL
)
2486 true_label_p
= &local_label
;
2488 /* Keep the original source location on the first 'if'. */
2489 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), true_label_p
, NULL
, locus
);
2490 append_to_statement_list (t
, &expr
);
2492 /* Set the source location of the || on the second 'if'. */
2493 new_locus
= EXPR_HAS_LOCATION (pred
) ? EXPR_LOCATION (pred
) : locus
;
2494 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
, false_label_p
,
2496 append_to_statement_list (t
, &expr
);
2498 else if (TREE_CODE (pred
) == COND_EXPR
)
2500 location_t new_locus
;
2502 /* As long as we're messing with gotos, turn if (a ? b : c) into
2504 if (b) goto yes; else goto no;
2506 if (c) goto yes; else goto no; */
2508 /* Keep the original source location on the first 'if'. Set the source
2509 location of the ? on the second 'if'. */
2510 new_locus
= EXPR_HAS_LOCATION (pred
) ? EXPR_LOCATION (pred
) : locus
;
2511 expr
= build3 (COND_EXPR
, void_type_node
, TREE_OPERAND (pred
, 0),
2512 shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2513 false_label_p
, locus
),
2514 shortcut_cond_r (TREE_OPERAND (pred
, 2), true_label_p
,
2515 false_label_p
, new_locus
));
2519 expr
= build3 (COND_EXPR
, void_type_node
, pred
,
2520 build_and_jump (true_label_p
),
2521 build_and_jump (false_label_p
));
2522 SET_EXPR_LOCATION (expr
, locus
);
2527 t
= build1 (LABEL_EXPR
, void_type_node
, local_label
);
2528 append_to_statement_list (t
, &expr
);
2534 /* Given a conditional expression EXPR with short-circuit boolean
2535 predicates using TRUTH_ANDIF_EXPR or TRUTH_ORIF_EXPR, break the
2536 predicate appart into the equivalent sequence of conditionals. */
2539 shortcut_cond_expr (tree expr
)
2541 tree pred
= TREE_OPERAND (expr
, 0);
2542 tree then_
= TREE_OPERAND (expr
, 1);
2543 tree else_
= TREE_OPERAND (expr
, 2);
2544 tree true_label
, false_label
, end_label
, t
;
2546 tree
*false_label_p
;
2547 bool emit_end
, emit_false
, jump_over_else
;
2548 bool then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2549 bool else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2551 /* First do simple transformations. */
2554 /* If there is no 'else', turn
2557 if (a) if (b) then c. */
2558 while (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2560 /* Keep the original source location on the first 'if'. */
2561 location_t locus
= EXPR_HAS_LOCATION (expr
)
2562 ? EXPR_LOCATION (expr
) : input_location
;
2563 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2564 /* Set the source location of the && on the second 'if'. */
2565 if (EXPR_HAS_LOCATION (pred
))
2566 SET_EXPR_LOCATION (expr
, EXPR_LOCATION (pred
));
2567 then_
= shortcut_cond_expr (expr
);
2568 then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2569 pred
= TREE_OPERAND (pred
, 0);
2570 expr
= build3 (COND_EXPR
, void_type_node
, pred
, then_
, NULL_TREE
);
2571 SET_EXPR_LOCATION (expr
, locus
);
2577 /* If there is no 'then', turn
2580 if (a); else if (b); else d. */
2581 while (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2583 /* Keep the original source location on the first 'if'. */
2584 location_t locus
= EXPR_HAS_LOCATION (expr
)
2585 ? EXPR_LOCATION (expr
) : input_location
;
2586 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2587 /* Set the source location of the || on the second 'if'. */
2588 if (EXPR_HAS_LOCATION (pred
))
2589 SET_EXPR_LOCATION (expr
, EXPR_LOCATION (pred
));
2590 else_
= shortcut_cond_expr (expr
);
2591 else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2592 pred
= TREE_OPERAND (pred
, 0);
2593 expr
= build3 (COND_EXPR
, void_type_node
, pred
, NULL_TREE
, else_
);
2594 SET_EXPR_LOCATION (expr
, locus
);
2598 /* If we're done, great. */
2599 if (TREE_CODE (pred
) != TRUTH_ANDIF_EXPR
2600 && TREE_CODE (pred
) != TRUTH_ORIF_EXPR
)
2603 /* Otherwise we need to mess with gotos. Change
2606 if (a); else goto no;
2609 and recursively gimplify the condition. */
2611 true_label
= false_label
= end_label
= NULL_TREE
;
2613 /* If our arms just jump somewhere, hijack those labels so we don't
2614 generate jumps to jumps. */
2617 && TREE_CODE (then_
) == GOTO_EXPR
2618 && TREE_CODE (GOTO_DESTINATION (then_
)) == LABEL_DECL
)
2620 true_label
= GOTO_DESTINATION (then_
);
2626 && TREE_CODE (else_
) == GOTO_EXPR
2627 && TREE_CODE (GOTO_DESTINATION (else_
)) == LABEL_DECL
)
2629 false_label
= GOTO_DESTINATION (else_
);
2634 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2636 true_label_p
= &true_label
;
2638 true_label_p
= NULL
;
2640 /* The 'else' branch also needs a label if it contains interesting code. */
2641 if (false_label
|| else_se
)
2642 false_label_p
= &false_label
;
2644 false_label_p
= NULL
;
2646 /* If there was nothing else in our arms, just forward the label(s). */
2647 if (!then_se
&& !else_se
)
2648 return shortcut_cond_r (pred
, true_label_p
, false_label_p
,
2649 EXPR_HAS_LOCATION (expr
)
2650 ? EXPR_LOCATION (expr
) : input_location
);
2652 /* If our last subexpression already has a terminal label, reuse it. */
2654 t
= expr_last (else_
);
2656 t
= expr_last (then_
);
2659 if (t
&& TREE_CODE (t
) == LABEL_EXPR
)
2660 end_label
= LABEL_EXPR_LABEL (t
);
2662 /* If we don't care about jumping to the 'else' branch, jump to the end
2663 if the condition is false. */
2665 false_label_p
= &end_label
;
2667 /* We only want to emit these labels if we aren't hijacking them. */
2668 emit_end
= (end_label
== NULL_TREE
);
2669 emit_false
= (false_label
== NULL_TREE
);
2671 /* We only emit the jump over the else clause if we have to--if the
2672 then clause may fall through. Otherwise we can wind up with a
2673 useless jump and a useless label at the end of gimplified code,
2674 which will cause us to think that this conditional as a whole
2675 falls through even if it doesn't. If we then inline a function
2676 which ends with such a condition, that can cause us to issue an
2677 inappropriate warning about control reaching the end of a
2678 non-void function. */
2679 jump_over_else
= block_may_fallthru (then_
);
2681 pred
= shortcut_cond_r (pred
, true_label_p
, false_label_p
,
2682 EXPR_HAS_LOCATION (expr
)
2683 ? EXPR_LOCATION (expr
) : input_location
);
2686 append_to_statement_list (pred
, &expr
);
2688 append_to_statement_list (then_
, &expr
);
2693 tree last
= expr_last (expr
);
2694 t
= build_and_jump (&end_label
);
2695 if (EXPR_HAS_LOCATION (last
))
2696 SET_EXPR_LOCATION (t
, EXPR_LOCATION (last
));
2697 append_to_statement_list (t
, &expr
);
2701 t
= build1 (LABEL_EXPR
, void_type_node
, false_label
);
2702 append_to_statement_list (t
, &expr
);
2704 append_to_statement_list (else_
, &expr
);
2706 if (emit_end
&& end_label
)
2708 t
= build1 (LABEL_EXPR
, void_type_node
, end_label
);
2709 append_to_statement_list (t
, &expr
);
2715 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2718 gimple_boolify (tree expr
)
2720 tree type
= TREE_TYPE (expr
);
2721 location_t loc
= EXPR_LOCATION (expr
);
2723 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
2726 switch (TREE_CODE (expr
))
2728 case TRUTH_AND_EXPR
:
2730 case TRUTH_XOR_EXPR
:
2731 case TRUTH_ANDIF_EXPR
:
2732 case TRUTH_ORIF_EXPR
:
2733 /* Also boolify the arguments of truth exprs. */
2734 TREE_OPERAND (expr
, 1) = gimple_boolify (TREE_OPERAND (expr
, 1));
2737 case TRUTH_NOT_EXPR
:
2738 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
2741 case EQ_EXPR
: case NE_EXPR
:
2742 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
2743 /* These expressions always produce boolean results. */
2744 TREE_TYPE (expr
) = boolean_type_node
;
2748 /* Other expressions that get here must have boolean values, but
2749 might need to be converted to the appropriate mode. */
2750 return fold_convert_loc (loc
, boolean_type_node
, expr
);
2754 /* Given a conditional expression *EXPR_P without side effects, gimplify
2755 its operands. New statements are inserted to PRE_P. */
2757 static enum gimplify_status
2758 gimplify_pure_cond_expr (tree
*expr_p
, gimple_seq
*pre_p
)
2760 tree expr
= *expr_p
, cond
;
2761 enum gimplify_status ret
, tret
;
2762 enum tree_code code
;
2764 cond
= gimple_boolify (COND_EXPR_COND (expr
));
2766 /* We need to handle && and || specially, as their gimplification
2767 creates pure cond_expr, thus leading to an infinite cycle otherwise. */
2768 code
= TREE_CODE (cond
);
2769 if (code
== TRUTH_ANDIF_EXPR
)
2770 TREE_SET_CODE (cond
, TRUTH_AND_EXPR
);
2771 else if (code
== TRUTH_ORIF_EXPR
)
2772 TREE_SET_CODE (cond
, TRUTH_OR_EXPR
);
2773 ret
= gimplify_expr (&cond
, pre_p
, NULL
, is_gimple_condexpr
, fb_rvalue
);
2774 COND_EXPR_COND (*expr_p
) = cond
;
2776 tret
= gimplify_expr (&COND_EXPR_THEN (expr
), pre_p
, NULL
,
2777 is_gimple_val
, fb_rvalue
);
2778 ret
= MIN (ret
, tret
);
2779 tret
= gimplify_expr (&COND_EXPR_ELSE (expr
), pre_p
, NULL
,
2780 is_gimple_val
, fb_rvalue
);
2782 return MIN (ret
, tret
);
2785 /* Returns true if evaluating EXPR could trap.
2786 EXPR is GENERIC, while tree_could_trap_p can be called
2790 generic_expr_could_trap_p (tree expr
)
2794 if (!expr
|| is_gimple_val (expr
))
2797 if (!EXPR_P (expr
) || tree_could_trap_p (expr
))
2800 n
= TREE_OPERAND_LENGTH (expr
);
2801 for (i
= 0; i
< n
; i
++)
2802 if (generic_expr_could_trap_p (TREE_OPERAND (expr
, i
)))
2808 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2817 The second form is used when *EXPR_P is of type void.
2819 PRE_P points to the list where side effects that must happen before
2820 *EXPR_P should be stored. */
2822 static enum gimplify_status
2823 gimplify_cond_expr (tree
*expr_p
, gimple_seq
*pre_p
, fallback_t fallback
)
2825 tree expr
= *expr_p
;
2826 tree tmp
, type
, arm1
, arm2
;
2827 enum gimplify_status ret
;
2828 tree label_true
, label_false
, label_cont
;
2829 bool have_then_clause_p
, have_else_clause_p
;
2831 enum tree_code pred_code
;
2832 gimple_seq seq
= NULL
;
2833 location_t loc
= EXPR_LOCATION (*expr_p
);
2835 type
= TREE_TYPE (expr
);
2837 /* If this COND_EXPR has a value, copy the values into a temporary within
2839 if (! VOID_TYPE_P (type
))
2843 /* If an rvalue is ok or we do not require an lvalue, avoid creating
2844 an addressable temporary. */
2845 if (((fallback
& fb_rvalue
)
2846 || !(fallback
& fb_lvalue
))
2847 && !TREE_ADDRESSABLE (type
))
2849 if (gimplify_ctxp
->allow_rhs_cond_expr
2850 /* If either branch has side effects or could trap, it can't be
2851 evaluated unconditionally. */
2852 && !TREE_SIDE_EFFECTS (TREE_OPERAND (*expr_p
, 1))
2853 && !generic_expr_could_trap_p (TREE_OPERAND (*expr_p
, 1))
2854 && !TREE_SIDE_EFFECTS (TREE_OPERAND (*expr_p
, 2))
2855 && !generic_expr_could_trap_p (TREE_OPERAND (*expr_p
, 2)))
2856 return gimplify_pure_cond_expr (expr_p
, pre_p
);
2858 result
= tmp
= create_tmp_var (TREE_TYPE (expr
), "iftmp");
2863 tree type
= build_pointer_type (TREE_TYPE (expr
));
2865 if (TREE_TYPE (TREE_OPERAND (expr
, 1)) != void_type_node
)
2866 TREE_OPERAND (expr
, 1) =
2867 build_fold_addr_expr_loc (loc
, TREE_OPERAND (expr
, 1));
2869 if (TREE_TYPE (TREE_OPERAND (expr
, 2)) != void_type_node
)
2870 TREE_OPERAND (expr
, 2) =
2871 build_fold_addr_expr_loc (loc
, TREE_OPERAND (expr
, 2));
2873 tmp
= create_tmp_var (type
, "iftmp");
2875 expr
= build3 (COND_EXPR
, void_type_node
, TREE_OPERAND (expr
, 0),
2876 TREE_OPERAND (expr
, 1), TREE_OPERAND (expr
, 2));
2878 result
= build_fold_indirect_ref_loc (loc
, tmp
);
2881 /* Build the then clause, 't1 = a;'. But don't build an assignment
2882 if this branch is void; in C++ it can be, if it's a throw. */
2883 if (TREE_TYPE (TREE_OPERAND (expr
, 1)) != void_type_node
)
2884 TREE_OPERAND (expr
, 1)
2885 = build2 (MODIFY_EXPR
, TREE_TYPE (tmp
), tmp
, TREE_OPERAND (expr
, 1));
2887 /* Build the else clause, 't1 = b;'. */
2888 if (TREE_TYPE (TREE_OPERAND (expr
, 2)) != void_type_node
)
2889 TREE_OPERAND (expr
, 2)
2890 = build2 (MODIFY_EXPR
, TREE_TYPE (tmp
), tmp
, TREE_OPERAND (expr
, 2));
2892 TREE_TYPE (expr
) = void_type_node
;
2893 recalculate_side_effects (expr
);
2895 /* Move the COND_EXPR to the prequeue. */
2896 gimplify_stmt (&expr
, pre_p
);
2902 /* Make sure the condition has BOOLEAN_TYPE. */
2903 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
2905 /* Break apart && and || conditions. */
2906 if (TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ANDIF_EXPR
2907 || TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ORIF_EXPR
)
2909 expr
= shortcut_cond_expr (expr
);
2911 if (expr
!= *expr_p
)
2915 /* We can't rely on gimplify_expr to re-gimplify the expanded
2916 form properly, as cleanups might cause the target labels to be
2917 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2918 set up a conditional context. */
2919 gimple_push_condition ();
2920 gimplify_stmt (expr_p
, &seq
);
2921 gimple_pop_condition (pre_p
);
2922 gimple_seq_add_seq (pre_p
, seq
);
2928 /* Now do the normal gimplification. */
2930 /* Gimplify condition. */
2931 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, NULL
, is_gimple_condexpr
,
2933 if (ret
== GS_ERROR
)
2935 gcc_assert (TREE_OPERAND (expr
, 0) != NULL_TREE
);
2937 gimple_push_condition ();
2939 have_then_clause_p
= have_else_clause_p
= false;
2940 if (TREE_OPERAND (expr
, 1) != NULL
2941 && TREE_CODE (TREE_OPERAND (expr
, 1)) == GOTO_EXPR
2942 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr
, 1))) == LABEL_DECL
2943 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr
, 1)))
2944 == current_function_decl
)
2945 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
2946 have different locations, otherwise we end up with incorrect
2947 location information on the branches. */
2949 || !EXPR_HAS_LOCATION (expr
)
2950 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr
, 1))
2951 || EXPR_LOCATION (expr
) == EXPR_LOCATION (TREE_OPERAND (expr
, 1))))
2953 label_true
= GOTO_DESTINATION (TREE_OPERAND (expr
, 1));
2954 have_then_clause_p
= true;
2957 label_true
= create_artificial_label (UNKNOWN_LOCATION
);
2958 if (TREE_OPERAND (expr
, 2) != NULL
2959 && TREE_CODE (TREE_OPERAND (expr
, 2)) == GOTO_EXPR
2960 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr
, 2))) == LABEL_DECL
2961 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr
, 2)))
2962 == current_function_decl
)
2963 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
2964 have different locations, otherwise we end up with incorrect
2965 location information on the branches. */
2967 || !EXPR_HAS_LOCATION (expr
)
2968 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr
, 2))
2969 || EXPR_LOCATION (expr
) == EXPR_LOCATION (TREE_OPERAND (expr
, 2))))
2971 label_false
= GOTO_DESTINATION (TREE_OPERAND (expr
, 2));
2972 have_else_clause_p
= true;
2975 label_false
= create_artificial_label (UNKNOWN_LOCATION
);
2977 gimple_cond_get_ops_from_tree (COND_EXPR_COND (expr
), &pred_code
, &arm1
,
2980 gimple_cond
= gimple_build_cond (pred_code
, arm1
, arm2
, label_true
,
2983 gimplify_seq_add_stmt (&seq
, gimple_cond
);
2984 label_cont
= NULL_TREE
;
2985 if (!have_then_clause_p
)
2987 /* For if (...) {} else { code; } put label_true after
2989 if (TREE_OPERAND (expr
, 1) == NULL_TREE
2990 && !have_else_clause_p
2991 && TREE_OPERAND (expr
, 2) != NULL_TREE
)
2992 label_cont
= label_true
;
2995 gimplify_seq_add_stmt (&seq
, gimple_build_label (label_true
));
2996 have_then_clause_p
= gimplify_stmt (&TREE_OPERAND (expr
, 1), &seq
);
2997 /* For if (...) { code; } else {} or
2998 if (...) { code; } else goto label; or
2999 if (...) { code; return; } else { ... }
3000 label_cont isn't needed. */
3001 if (!have_else_clause_p
3002 && TREE_OPERAND (expr
, 2) != NULL_TREE
3003 && gimple_seq_may_fallthru (seq
))
3006 label_cont
= create_artificial_label (UNKNOWN_LOCATION
);
3008 g
= gimple_build_goto (label_cont
);
3010 /* GIMPLE_COND's are very low level; they have embedded
3011 gotos. This particular embedded goto should not be marked
3012 with the location of the original COND_EXPR, as it would
3013 correspond to the COND_EXPR's condition, not the ELSE or the
3014 THEN arms. To avoid marking it with the wrong location, flag
3015 it as "no location". */
3016 gimple_set_do_not_emit_location (g
);
3018 gimplify_seq_add_stmt (&seq
, g
);
3022 if (!have_else_clause_p
)
3024 gimplify_seq_add_stmt (&seq
, gimple_build_label (label_false
));
3025 have_else_clause_p
= gimplify_stmt (&TREE_OPERAND (expr
, 2), &seq
);
3028 gimplify_seq_add_stmt (&seq
, gimple_build_label (label_cont
));
3030 gimple_pop_condition (pre_p
);
3031 gimple_seq_add_seq (pre_p
, seq
);
3033 if (ret
== GS_ERROR
)
3035 else if (have_then_clause_p
|| have_else_clause_p
)
3039 /* Both arms are empty; replace the COND_EXPR with its predicate. */
3040 expr
= TREE_OPERAND (expr
, 0);
3041 gimplify_stmt (&expr
, pre_p
);
3048 /* Prepare the node pointed to by EXPR_P, an is_gimple_addressable expression,
3049 to be marked addressable.
3051 We cannot rely on such an expression being directly markable if a temporary
3052 has been created by the gimplification. In this case, we create another
3053 temporary and initialize it with a copy, which will become a store after we
3054 mark it addressable. This can happen if the front-end passed us something
3055 that it could not mark addressable yet, like a Fortran pass-by-reference
3056 parameter (int) floatvar. */
3059 prepare_gimple_addressable (tree
*expr_p
, gimple_seq
*seq_p
)
3061 while (handled_component_p (*expr_p
))
3062 expr_p
= &TREE_OPERAND (*expr_p
, 0);
3063 if (is_gimple_reg (*expr_p
))
3064 *expr_p
= get_initialized_tmp_var (*expr_p
, seq_p
, NULL
);
3067 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3068 a call to __builtin_memcpy. */
3070 static enum gimplify_status
3071 gimplify_modify_expr_to_memcpy (tree
*expr_p
, tree size
, bool want_value
,
3074 tree t
, to
, to_ptr
, from
, from_ptr
;
3076 location_t loc
= EXPR_LOCATION (*expr_p
);
3078 to
= TREE_OPERAND (*expr_p
, 0);
3079 from
= TREE_OPERAND (*expr_p
, 1);
3081 /* Mark the RHS addressable. Beware that it may not be possible to do so
3082 directly if a temporary has been created by the gimplification. */
3083 prepare_gimple_addressable (&from
, seq_p
);
3085 mark_addressable (from
);
3086 from_ptr
= build_fold_addr_expr_loc (loc
, from
);
3087 gimplify_arg (&from_ptr
, seq_p
, loc
);
3089 mark_addressable (to
);
3090 to_ptr
= build_fold_addr_expr_loc (loc
, to
);
3091 gimplify_arg (&to_ptr
, seq_p
, loc
);
3093 t
= implicit_built_in_decls
[BUILT_IN_MEMCPY
];
3095 gs
= gimple_build_call (t
, 3, to_ptr
, from_ptr
, size
);
3099 /* tmp = memcpy() */
3100 t
= create_tmp_var (TREE_TYPE (to_ptr
), NULL
);
3101 gimple_call_set_lhs (gs
, t
);
3102 gimplify_seq_add_stmt (seq_p
, gs
);
3104 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
3108 gimplify_seq_add_stmt (seq_p
, gs
);
3113 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3114 a call to __builtin_memset. In this case we know that the RHS is
3115 a CONSTRUCTOR with an empty element list. */
3117 static enum gimplify_status
3118 gimplify_modify_expr_to_memset (tree
*expr_p
, tree size
, bool want_value
,
3121 tree t
, from
, to
, to_ptr
;
3123 location_t loc
= EXPR_LOCATION (*expr_p
);
3125 /* Assert our assumptions, to abort instead of producing wrong code
3126 silently if they are not met. Beware that the RHS CONSTRUCTOR might
3127 not be immediately exposed. */
3128 from
= TREE_OPERAND (*expr_p
, 1);
3129 if (TREE_CODE (from
) == WITH_SIZE_EXPR
)
3130 from
= TREE_OPERAND (from
, 0);
3132 gcc_assert (TREE_CODE (from
) == CONSTRUCTOR
3133 && VEC_empty (constructor_elt
, CONSTRUCTOR_ELTS (from
)));
3136 to
= TREE_OPERAND (*expr_p
, 0);
3138 to_ptr
= build_fold_addr_expr_loc (loc
, to
);
3139 gimplify_arg (&to_ptr
, seq_p
, loc
);
3140 t
= implicit_built_in_decls
[BUILT_IN_MEMSET
];
3142 gs
= gimple_build_call (t
, 3, to_ptr
, integer_zero_node
, size
);
3146 /* tmp = memset() */
3147 t
= create_tmp_var (TREE_TYPE (to_ptr
), NULL
);
3148 gimple_call_set_lhs (gs
, t
);
3149 gimplify_seq_add_stmt (seq_p
, gs
);
3151 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
3155 gimplify_seq_add_stmt (seq_p
, gs
);
3160 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
3161 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
3162 assignment. Returns non-null if we detect a potential overlap. */
3164 struct gimplify_init_ctor_preeval_data
3166 /* The base decl of the lhs object. May be NULL, in which case we
3167 have to assume the lhs is indirect. */
3170 /* The alias set of the lhs object. */
3171 alias_set_type lhs_alias_set
;
3175 gimplify_init_ctor_preeval_1 (tree
*tp
, int *walk_subtrees
, void *xdata
)
3177 struct gimplify_init_ctor_preeval_data
*data
3178 = (struct gimplify_init_ctor_preeval_data
*) xdata
;
3181 /* If we find the base object, obviously we have overlap. */
3182 if (data
->lhs_base_decl
== t
)
3185 /* If the constructor component is indirect, determine if we have a
3186 potential overlap with the lhs. The only bits of information we
3187 have to go on at this point are addressability and alias sets. */
3188 if (TREE_CODE (t
) == INDIRECT_REF
3189 && (!data
->lhs_base_decl
|| TREE_ADDRESSABLE (data
->lhs_base_decl
))
3190 && alias_sets_conflict_p (data
->lhs_alias_set
, get_alias_set (t
)))
3193 /* If the constructor component is a call, determine if it can hide a
3194 potential overlap with the lhs through an INDIRECT_REF like above. */
3195 if (TREE_CODE (t
) == CALL_EXPR
)
3197 tree type
, fntype
= TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (t
)));
3199 for (type
= TYPE_ARG_TYPES (fntype
); type
; type
= TREE_CHAIN (type
))
3200 if (POINTER_TYPE_P (TREE_VALUE (type
))
3201 && (!data
->lhs_base_decl
|| TREE_ADDRESSABLE (data
->lhs_base_decl
))
3202 && alias_sets_conflict_p (data
->lhs_alias_set
,
3204 (TREE_TYPE (TREE_VALUE (type
)))))
3208 if (IS_TYPE_OR_DECL_P (t
))
3213 /* A subroutine of gimplify_init_constructor. Pre-evaluate EXPR,
3214 force values that overlap with the lhs (as described by *DATA)
3215 into temporaries. */
3218 gimplify_init_ctor_preeval (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
3219 struct gimplify_init_ctor_preeval_data
*data
)
3221 enum gimplify_status one
;
3223 /* If the value is constant, then there's nothing to pre-evaluate. */
3224 if (TREE_CONSTANT (*expr_p
))
3226 /* Ensure it does not have side effects, it might contain a reference to
3227 the object we're initializing. */
3228 gcc_assert (!TREE_SIDE_EFFECTS (*expr_p
));
3232 /* If the type has non-trivial constructors, we can't pre-evaluate. */
3233 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p
)))
3236 /* Recurse for nested constructors. */
3237 if (TREE_CODE (*expr_p
) == CONSTRUCTOR
)
3239 unsigned HOST_WIDE_INT ix
;
3240 constructor_elt
*ce
;
3241 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (*expr_p
);
3243 for (ix
= 0; VEC_iterate (constructor_elt
, v
, ix
, ce
); ix
++)
3244 gimplify_init_ctor_preeval (&ce
->value
, pre_p
, post_p
, data
);
3249 /* If this is a variable sized type, we must remember the size. */
3250 maybe_with_size_expr (expr_p
);
3252 /* Gimplify the constructor element to something appropriate for the rhs
3253 of a MODIFY_EXPR. Given that we know the LHS is an aggregate, we know
3254 the gimplifier will consider this a store to memory. Doing this
3255 gimplification now means that we won't have to deal with complicated
3256 language-specific trees, nor trees like SAVE_EXPR that can induce
3257 exponential search behavior. */
3258 one
= gimplify_expr (expr_p
, pre_p
, post_p
, is_gimple_mem_rhs
, fb_rvalue
);
3259 if (one
== GS_ERROR
)
3265 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
3266 with the lhs, since "a = { .x=a }" doesn't make sense. This will
3267 always be true for all scalars, since is_gimple_mem_rhs insists on a
3268 temporary variable for them. */
3269 if (DECL_P (*expr_p
))
3272 /* If this is of variable size, we have no choice but to assume it doesn't
3273 overlap since we can't make a temporary for it. */
3274 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (*expr_p
))) != INTEGER_CST
)
3277 /* Otherwise, we must search for overlap ... */
3278 if (!walk_tree (expr_p
, gimplify_init_ctor_preeval_1
, data
, NULL
))
3281 /* ... and if found, force the value into a temporary. */
3282 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
3285 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
3286 a RANGE_EXPR in a CONSTRUCTOR for an array.
3290 object[var] = value;
3297 We increment var _after_ the loop exit check because we might otherwise
3298 fail if upper == TYPE_MAX_VALUE (type for upper).
3300 Note that we never have to deal with SAVE_EXPRs here, because this has
3301 already been taken care of for us, in gimplify_init_ctor_preeval(). */
3303 static void gimplify_init_ctor_eval (tree
, VEC(constructor_elt
,gc
) *,
3304 gimple_seq
*, bool);
3307 gimplify_init_ctor_eval_range (tree object
, tree lower
, tree upper
,
3308 tree value
, tree array_elt_type
,
3309 gimple_seq
*pre_p
, bool cleared
)
3311 tree loop_entry_label
, loop_exit_label
, fall_thru_label
;
3312 tree var
, var_type
, cref
, tmp
;
3314 loop_entry_label
= create_artificial_label (UNKNOWN_LOCATION
);
3315 loop_exit_label
= create_artificial_label (UNKNOWN_LOCATION
);
3316 fall_thru_label
= create_artificial_label (UNKNOWN_LOCATION
);
3318 /* Create and initialize the index variable. */
3319 var_type
= TREE_TYPE (upper
);
3320 var
= create_tmp_var (var_type
, NULL
);
3321 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (var
, lower
));
3323 /* Add the loop entry label. */
3324 gimplify_seq_add_stmt (pre_p
, gimple_build_label (loop_entry_label
));
3326 /* Build the reference. */
3327 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
3328 var
, NULL_TREE
, NULL_TREE
);
3330 /* If we are a constructor, just call gimplify_init_ctor_eval to do
3331 the store. Otherwise just assign value to the reference. */
3333 if (TREE_CODE (value
) == CONSTRUCTOR
)
3334 /* NB we might have to call ourself recursively through
3335 gimplify_init_ctor_eval if the value is a constructor. */
3336 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
3339 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (cref
, value
));
3341 /* We exit the loop when the index var is equal to the upper bound. */
3342 gimplify_seq_add_stmt (pre_p
,
3343 gimple_build_cond (EQ_EXPR
, var
, upper
,
3344 loop_exit_label
, fall_thru_label
));
3346 gimplify_seq_add_stmt (pre_p
, gimple_build_label (fall_thru_label
));
3348 /* Otherwise, increment the index var... */
3349 tmp
= build2 (PLUS_EXPR
, var_type
, var
,
3350 fold_convert (var_type
, integer_one_node
));
3351 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (var
, tmp
));
3353 /* ...and jump back to the loop entry. */
3354 gimplify_seq_add_stmt (pre_p
, gimple_build_goto (loop_entry_label
));
3356 /* Add the loop exit label. */
3357 gimplify_seq_add_stmt (pre_p
, gimple_build_label (loop_exit_label
));
3360 /* Return true if FDECL is accessing a field that is zero sized. */
3363 zero_sized_field_decl (const_tree fdecl
)
3365 if (TREE_CODE (fdecl
) == FIELD_DECL
&& DECL_SIZE (fdecl
)
3366 && integer_zerop (DECL_SIZE (fdecl
)))
3371 /* Return true if TYPE is zero sized. */
3374 zero_sized_type (const_tree type
)
3376 if (AGGREGATE_TYPE_P (type
) && TYPE_SIZE (type
)
3377 && integer_zerop (TYPE_SIZE (type
)))
3382 /* A subroutine of gimplify_init_constructor. Generate individual
3383 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
3384 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
3385 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
3389 gimplify_init_ctor_eval (tree object
, VEC(constructor_elt
,gc
) *elts
,
3390 gimple_seq
*pre_p
, bool cleared
)
3392 tree array_elt_type
= NULL
;
3393 unsigned HOST_WIDE_INT ix
;
3394 tree purpose
, value
;
3396 if (TREE_CODE (TREE_TYPE (object
)) == ARRAY_TYPE
)
3397 array_elt_type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object
)));
3399 FOR_EACH_CONSTRUCTOR_ELT (elts
, ix
, purpose
, value
)
3403 /* NULL values are created above for gimplification errors. */
3407 if (cleared
&& initializer_zerop (value
))
3410 /* ??? Here's to hoping the front end fills in all of the indices,
3411 so we don't have to figure out what's missing ourselves. */
3412 gcc_assert (purpose
);
3414 /* Skip zero-sized fields, unless value has side-effects. This can
3415 happen with calls to functions returning a zero-sized type, which
3416 we shouldn't discard. As a number of downstream passes don't
3417 expect sets of zero-sized fields, we rely on the gimplification of
3418 the MODIFY_EXPR we make below to drop the assignment statement. */
3419 if (! TREE_SIDE_EFFECTS (value
) && zero_sized_field_decl (purpose
))
3422 /* If we have a RANGE_EXPR, we have to build a loop to assign the
3424 if (TREE_CODE (purpose
) == RANGE_EXPR
)
3426 tree lower
= TREE_OPERAND (purpose
, 0);
3427 tree upper
= TREE_OPERAND (purpose
, 1);
3429 /* If the lower bound is equal to upper, just treat it as if
3430 upper was the index. */
3431 if (simple_cst_equal (lower
, upper
))
3435 gimplify_init_ctor_eval_range (object
, lower
, upper
, value
,
3436 array_elt_type
, pre_p
, cleared
);
3443 /* Do not use bitsizetype for ARRAY_REF indices. */
3444 if (TYPE_DOMAIN (TREE_TYPE (object
)))
3445 purpose
= fold_convert (TREE_TYPE (TYPE_DOMAIN (TREE_TYPE (object
))),
3447 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
3448 purpose
, NULL_TREE
, NULL_TREE
);
3452 gcc_assert (TREE_CODE (purpose
) == FIELD_DECL
);
3453 cref
= build3 (COMPONENT_REF
, TREE_TYPE (purpose
),
3454 unshare_expr (object
), purpose
, NULL_TREE
);
3457 if (TREE_CODE (value
) == CONSTRUCTOR
3458 && TREE_CODE (TREE_TYPE (value
)) != VECTOR_TYPE
)
3459 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
3463 tree init
= build2 (INIT_EXPR
, TREE_TYPE (cref
), cref
, value
);
3464 gimplify_and_add (init
, pre_p
);
3471 /* Returns the appropriate RHS predicate for this LHS. */
3474 rhs_predicate_for (tree lhs
)
3476 if (is_gimple_reg (lhs
))
3477 return is_gimple_reg_rhs_or_call
;
3479 return is_gimple_mem_rhs_or_call
;
3482 /* Gimplify a C99 compound literal expression. This just means adding
3483 the DECL_EXPR before the current statement and using its anonymous
3486 static enum gimplify_status
3487 gimplify_compound_literal_expr (tree
*expr_p
, gimple_seq
*pre_p
)
3489 tree decl_s
= COMPOUND_LITERAL_EXPR_DECL_EXPR (*expr_p
);
3490 tree decl
= DECL_EXPR_DECL (decl_s
);
3491 /* Mark the decl as addressable if the compound literal
3492 expression is addressable now, otherwise it is marked too late
3493 after we gimplify the initialization expression. */
3494 if (TREE_ADDRESSABLE (*expr_p
))
3495 TREE_ADDRESSABLE (decl
) = 1;
3497 /* Preliminarily mark non-addressed complex variables as eligible
3498 for promotion to gimple registers. We'll transform their uses
3500 if ((TREE_CODE (TREE_TYPE (decl
)) == COMPLEX_TYPE
3501 || TREE_CODE (TREE_TYPE (decl
)) == VECTOR_TYPE
)
3502 && !TREE_THIS_VOLATILE (decl
)
3503 && !needs_to_live_in_memory (decl
))
3504 DECL_GIMPLE_REG_P (decl
) = 1;
3506 /* This decl isn't mentioned in the enclosing block, so add it to the
3507 list of temps. FIXME it seems a bit of a kludge to say that
3508 anonymous artificial vars aren't pushed, but everything else is. */
3509 if (DECL_NAME (decl
) == NULL_TREE
&& !DECL_SEEN_IN_BIND_EXPR_P (decl
))
3510 gimple_add_tmp_var (decl
);
3512 gimplify_and_add (decl_s
, pre_p
);
3517 /* Optimize embedded COMPOUND_LITERAL_EXPRs within a CONSTRUCTOR,
3518 return a new CONSTRUCTOR if something changed. */
3521 optimize_compound_literals_in_ctor (tree orig_ctor
)
3523 tree ctor
= orig_ctor
;
3524 VEC(constructor_elt
,gc
) *elts
= CONSTRUCTOR_ELTS (ctor
);
3525 unsigned int idx
, num
= VEC_length (constructor_elt
, elts
);
3527 for (idx
= 0; idx
< num
; idx
++)
3529 tree value
= VEC_index (constructor_elt
, elts
, idx
)->value
;
3530 tree newval
= value
;
3531 if (TREE_CODE (value
) == CONSTRUCTOR
)
3532 newval
= optimize_compound_literals_in_ctor (value
);
3533 else if (TREE_CODE (value
) == COMPOUND_LITERAL_EXPR
)
3535 tree decl_s
= COMPOUND_LITERAL_EXPR_DECL_EXPR (value
);
3536 tree decl
= DECL_EXPR_DECL (decl_s
);
3537 tree init
= DECL_INITIAL (decl
);
3539 if (!TREE_ADDRESSABLE (value
)
3540 && !TREE_ADDRESSABLE (decl
)
3542 newval
= optimize_compound_literals_in_ctor (init
);
3544 if (newval
== value
)
3547 if (ctor
== orig_ctor
)
3549 ctor
= copy_node (orig_ctor
);
3550 CONSTRUCTOR_ELTS (ctor
) = VEC_copy (constructor_elt
, gc
, elts
);
3551 elts
= CONSTRUCTOR_ELTS (ctor
);
3553 VEC_index (constructor_elt
, elts
, idx
)->value
= newval
;
3560 /* A subroutine of gimplify_modify_expr. Break out elements of a
3561 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
3563 Note that we still need to clear any elements that don't have explicit
3564 initializers, so if not all elements are initialized we keep the
3565 original MODIFY_EXPR, we just remove all of the constructor elements.
3567 If NOTIFY_TEMP_CREATION is true, do not gimplify, just return
3568 GS_ERROR if we would have to create a temporary when gimplifying
3569 this constructor. Otherwise, return GS_OK.
3571 If NOTIFY_TEMP_CREATION is false, just do the gimplification. */
3573 static enum gimplify_status
3574 gimplify_init_constructor (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
3575 bool want_value
, bool notify_temp_creation
)
3577 tree object
, ctor
, type
;
3578 enum gimplify_status ret
;
3579 VEC(constructor_elt
,gc
) *elts
;
3581 gcc_assert (TREE_CODE (TREE_OPERAND (*expr_p
, 1)) == CONSTRUCTOR
);
3583 if (!notify_temp_creation
)
3585 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
3586 is_gimple_lvalue
, fb_lvalue
);
3587 if (ret
== GS_ERROR
)
3591 object
= TREE_OPERAND (*expr_p
, 0);
3592 ctor
= TREE_OPERAND (*expr_p
, 1) =
3593 optimize_compound_literals_in_ctor (TREE_OPERAND (*expr_p
, 1));
3594 type
= TREE_TYPE (ctor
);
3595 elts
= CONSTRUCTOR_ELTS (ctor
);
3598 switch (TREE_CODE (type
))
3602 case QUAL_UNION_TYPE
:
3605 struct gimplify_init_ctor_preeval_data preeval_data
;
3606 HOST_WIDE_INT num_type_elements
, num_ctor_elements
;
3607 HOST_WIDE_INT num_nonzero_elements
;
3608 bool cleared
, valid_const_initializer
;
3610 /* Aggregate types must lower constructors to initialization of
3611 individual elements. The exception is that a CONSTRUCTOR node
3612 with no elements indicates zero-initialization of the whole. */
3613 if (VEC_empty (constructor_elt
, elts
))
3615 if (notify_temp_creation
)
3620 /* Fetch information about the constructor to direct later processing.
3621 We might want to make static versions of it in various cases, and
3622 can only do so if it known to be a valid constant initializer. */
3623 valid_const_initializer
3624 = categorize_ctor_elements (ctor
, &num_nonzero_elements
,
3625 &num_ctor_elements
, &cleared
);
3627 /* If a const aggregate variable is being initialized, then it
3628 should never be a lose to promote the variable to be static. */
3629 if (valid_const_initializer
3630 && num_nonzero_elements
> 1
3631 && TREE_READONLY (object
)
3632 && TREE_CODE (object
) == VAR_DECL
3633 && (flag_merge_constants
>= 2 || !TREE_ADDRESSABLE (object
)))
3635 if (notify_temp_creation
)
3637 DECL_INITIAL (object
) = ctor
;
3638 TREE_STATIC (object
) = 1;
3639 if (!DECL_NAME (object
))
3640 DECL_NAME (object
) = create_tmp_var_name ("C");
3641 walk_tree (&DECL_INITIAL (object
), force_labels_r
, NULL
, NULL
);
3643 /* ??? C++ doesn't automatically append a .<number> to the
3644 assembler name, and even when it does, it looks a FE private
3645 data structures to figure out what that number should be,
3646 which are not set for this variable. I suppose this is
3647 important for local statics for inline functions, which aren't
3648 "local" in the object file sense. So in order to get a unique
3649 TU-local symbol, we must invoke the lhd version now. */
3650 lhd_set_decl_assembler_name (object
);
3652 *expr_p
= NULL_TREE
;
3656 /* If there are "lots" of initialized elements, even discounting
3657 those that are not address constants (and thus *must* be
3658 computed at runtime), then partition the constructor into
3659 constant and non-constant parts. Block copy the constant
3660 parts in, then generate code for the non-constant parts. */
3661 /* TODO. There's code in cp/typeck.c to do this. */
3663 num_type_elements
= count_type_elements (type
, true);
3665 /* If count_type_elements could not determine number of type elements
3666 for a constant-sized object, assume clearing is needed.
3667 Don't do this for variable-sized objects, as store_constructor
3668 will ignore the clearing of variable-sized objects. */
3669 if (num_type_elements
< 0 && int_size_in_bytes (type
) >= 0)
3671 /* If there are "lots" of zeros, then block clear the object first. */
3672 else if (num_type_elements
- num_nonzero_elements
3673 > CLEAR_RATIO (optimize_function_for_speed_p (cfun
))
3674 && num_nonzero_elements
< num_type_elements
/4)
3676 /* ??? This bit ought not be needed. For any element not present
3677 in the initializer, we should simply set them to zero. Except
3678 we'd need to *find* the elements that are not present, and that
3679 requires trickery to avoid quadratic compile-time behavior in
3680 large cases or excessive memory use in small cases. */
3681 else if (num_ctor_elements
< num_type_elements
)
3684 /* If there are "lots" of initialized elements, and all of them
3685 are valid address constants, then the entire initializer can
3686 be dropped to memory, and then memcpy'd out. Don't do this
3687 for sparse arrays, though, as it's more efficient to follow
3688 the standard CONSTRUCTOR behavior of memset followed by
3689 individual element initialization. Also don't do this for small
3690 all-zero initializers (which aren't big enough to merit
3691 clearing), and don't try to make bitwise copies of
3692 TREE_ADDRESSABLE types. */
3693 if (valid_const_initializer
3694 && !(cleared
|| num_nonzero_elements
== 0)
3695 && !TREE_ADDRESSABLE (type
))
3697 HOST_WIDE_INT size
= int_size_in_bytes (type
);
3700 /* ??? We can still get unbounded array types, at least
3701 from the C++ front end. This seems wrong, but attempt
3702 to work around it for now. */
3705 size
= int_size_in_bytes (TREE_TYPE (object
));
3707 TREE_TYPE (ctor
) = type
= TREE_TYPE (object
);
3710 /* Find the maximum alignment we can assume for the object. */
3711 /* ??? Make use of DECL_OFFSET_ALIGN. */
3712 if (DECL_P (object
))
3713 align
= DECL_ALIGN (object
);
3715 align
= TYPE_ALIGN (type
);
3718 && num_nonzero_elements
> 1
3719 && !can_move_by_pieces (size
, align
))
3723 if (notify_temp_creation
)
3726 new_tree
= create_tmp_var_raw (type
, "C");
3728 gimple_add_tmp_var (new_tree
);
3729 TREE_STATIC (new_tree
) = 1;
3730 TREE_READONLY (new_tree
) = 1;
3731 DECL_INITIAL (new_tree
) = ctor
;
3732 if (align
> DECL_ALIGN (new_tree
))
3734 DECL_ALIGN (new_tree
) = align
;
3735 DECL_USER_ALIGN (new_tree
) = 1;
3737 walk_tree (&DECL_INITIAL (new_tree
), force_labels_r
, NULL
, NULL
);
3739 TREE_OPERAND (*expr_p
, 1) = new_tree
;
3741 /* This is no longer an assignment of a CONSTRUCTOR, but
3742 we still may have processing to do on the LHS. So
3743 pretend we didn't do anything here to let that happen. */
3744 return GS_UNHANDLED
;
3748 /* If the target is volatile and we have non-zero elements
3749 initialize the target from a temporary. */
3750 if (TREE_THIS_VOLATILE (object
)
3751 && !TREE_ADDRESSABLE (type
)
3752 && num_nonzero_elements
> 0)
3754 tree temp
= create_tmp_var (TYPE_MAIN_VARIANT (type
), NULL
);
3755 TREE_OPERAND (*expr_p
, 0) = temp
;
3756 *expr_p
= build2 (COMPOUND_EXPR
, TREE_TYPE (*expr_p
),
3758 build2 (MODIFY_EXPR
, void_type_node
,
3763 if (notify_temp_creation
)
3766 /* If there are nonzero elements, pre-evaluate to capture elements
3767 overlapping with the lhs into temporaries. We must do this before
3768 clearing to fetch the values before they are zeroed-out. */
3769 if (num_nonzero_elements
> 0)
3771 preeval_data
.lhs_base_decl
= get_base_address (object
);
3772 if (!DECL_P (preeval_data
.lhs_base_decl
))
3773 preeval_data
.lhs_base_decl
= NULL
;
3774 preeval_data
.lhs_alias_set
= get_alias_set (object
);
3776 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p
, 1),
3777 pre_p
, post_p
, &preeval_data
);
3782 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3783 Note that we still have to gimplify, in order to handle the
3784 case of variable sized types. Avoid shared tree structures. */
3785 CONSTRUCTOR_ELTS (ctor
) = NULL
;
3786 TREE_SIDE_EFFECTS (ctor
) = 0;
3787 object
= unshare_expr (object
);
3788 gimplify_stmt (expr_p
, pre_p
);
3791 /* If we have not block cleared the object, or if there are nonzero
3792 elements in the constructor, add assignments to the individual
3793 scalar fields of the object. */
3794 if (!cleared
|| num_nonzero_elements
> 0)
3795 gimplify_init_ctor_eval (object
, elts
, pre_p
, cleared
);
3797 *expr_p
= NULL_TREE
;
3805 if (notify_temp_creation
)
3808 /* Extract the real and imaginary parts out of the ctor. */
3809 gcc_assert (VEC_length (constructor_elt
, elts
) == 2);
3810 r
= VEC_index (constructor_elt
, elts
, 0)->value
;
3811 i
= VEC_index (constructor_elt
, elts
, 1)->value
;
3812 if (r
== NULL
|| i
== NULL
)
3814 tree zero
= fold_convert (TREE_TYPE (type
), integer_zero_node
);
3821 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3822 represent creation of a complex value. */
3823 if (TREE_CONSTANT (r
) && TREE_CONSTANT (i
))
3825 ctor
= build_complex (type
, r
, i
);
3826 TREE_OPERAND (*expr_p
, 1) = ctor
;
3830 ctor
= build2 (COMPLEX_EXPR
, type
, r
, i
);
3831 TREE_OPERAND (*expr_p
, 1) = ctor
;
3832 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1),
3835 rhs_predicate_for (TREE_OPERAND (*expr_p
, 0)),
3843 unsigned HOST_WIDE_INT ix
;
3844 constructor_elt
*ce
;
3846 if (notify_temp_creation
)
3849 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3850 if (TREE_CONSTANT (ctor
))
3852 bool constant_p
= true;
3855 /* Even when ctor is constant, it might contain non-*_CST
3856 elements, such as addresses or trapping values like
3857 1.0/0.0 - 1.0/0.0. Such expressions don't belong
3858 in VECTOR_CST nodes. */
3859 FOR_EACH_CONSTRUCTOR_VALUE (elts
, ix
, value
)
3860 if (!CONSTANT_CLASS_P (value
))
3868 TREE_OPERAND (*expr_p
, 1) = build_vector_from_ctor (type
, elts
);
3872 /* Don't reduce an initializer constant even if we can't
3873 make a VECTOR_CST. It won't do anything for us, and it'll
3874 prevent us from representing it as a single constant. */
3875 if (initializer_constant_valid_p (ctor
, type
))
3878 TREE_CONSTANT (ctor
) = 0;
3881 /* Vector types use CONSTRUCTOR all the way through gimple
3882 compilation as a general initializer. */
3883 for (ix
= 0; VEC_iterate (constructor_elt
, elts
, ix
, ce
); ix
++)
3885 enum gimplify_status tret
;
3886 tret
= gimplify_expr (&ce
->value
, pre_p
, post_p
, is_gimple_val
,
3888 if (tret
== GS_ERROR
)
3891 if (!is_gimple_reg (TREE_OPERAND (*expr_p
, 0)))
3892 TREE_OPERAND (*expr_p
, 1) = get_formal_tmp_var (ctor
, pre_p
);
3897 /* So how did we get a CONSTRUCTOR for a scalar type? */
3901 if (ret
== GS_ERROR
)
3903 else if (want_value
)
3910 /* If we have gimplified both sides of the initializer but have
3911 not emitted an assignment, do so now. */
3914 tree lhs
= TREE_OPERAND (*expr_p
, 0);
3915 tree rhs
= TREE_OPERAND (*expr_p
, 1);
3916 gimple init
= gimple_build_assign (lhs
, rhs
);
3917 gimplify_seq_add_stmt (pre_p
, init
);
3925 /* Given a pointer value OP0, return a simplified version of an
3926 indirection through OP0, or NULL_TREE if no simplification is
3927 possible. Note that the resulting type may be different from
3928 the type pointed to in the sense that it is still compatible
3929 from the langhooks point of view. */
3932 gimple_fold_indirect_ref (tree t
)
3934 tree type
= TREE_TYPE (TREE_TYPE (t
));
3938 STRIP_USELESS_TYPE_CONVERSION (sub
);
3939 subtype
= TREE_TYPE (sub
);
3940 if (!POINTER_TYPE_P (subtype
))
3943 if (TREE_CODE (sub
) == ADDR_EXPR
)
3945 tree op
= TREE_OPERAND (sub
, 0);
3946 tree optype
= TREE_TYPE (op
);
3948 if (useless_type_conversion_p (type
, optype
))
3951 /* *(foo *)&fooarray => fooarray[0] */
3952 if (TREE_CODE (optype
) == ARRAY_TYPE
3953 && useless_type_conversion_p (type
, TREE_TYPE (optype
)))
3955 tree type_domain
= TYPE_DOMAIN (optype
);
3956 tree min_val
= size_zero_node
;
3957 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
3958 min_val
= TYPE_MIN_VALUE (type_domain
);
3959 return build4 (ARRAY_REF
, type
, op
, min_val
, NULL_TREE
, NULL_TREE
);
3963 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
3964 if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
3965 && useless_type_conversion_p (type
, TREE_TYPE (TREE_TYPE (subtype
))))
3968 tree min_val
= size_zero_node
;
3970 sub
= gimple_fold_indirect_ref (sub
);
3972 sub
= build1 (INDIRECT_REF
, TREE_TYPE (subtype
), osub
);
3973 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
3974 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
3975 min_val
= TYPE_MIN_VALUE (type_domain
);
3976 return build4 (ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
, NULL_TREE
);
3982 /* Given a pointer value OP0, return a simplified version of an
3983 indirection through OP0, or NULL_TREE if no simplification is
3984 possible. This may only be applied to a rhs of an expression.
3985 Note that the resulting type may be different from the type pointed
3986 to in the sense that it is still compatible from the langhooks
3990 gimple_fold_indirect_ref_rhs (tree t
)
3992 return gimple_fold_indirect_ref (t
);
3995 /* Subroutine of gimplify_modify_expr to do simplifications of
3996 MODIFY_EXPRs based on the code of the RHS. We loop for as long as
3997 something changes. */
3999 static enum gimplify_status
4000 gimplify_modify_expr_rhs (tree
*expr_p
, tree
*from_p
, tree
*to_p
,
4001 gimple_seq
*pre_p
, gimple_seq
*post_p
,
4004 enum gimplify_status ret
= GS_OK
;
4006 while (ret
!= GS_UNHANDLED
)
4007 switch (TREE_CODE (*from_p
))
4010 /* If we're assigning from a read-only variable initialized with
4011 a constructor, do the direct assignment from the constructor,
4012 but only if neither source nor target are volatile since this
4013 latter assignment might end up being done on a per-field basis. */
4014 if (DECL_INITIAL (*from_p
)
4015 && TREE_READONLY (*from_p
)
4016 && !TREE_THIS_VOLATILE (*from_p
)
4017 && !TREE_THIS_VOLATILE (*to_p
)
4018 && TREE_CODE (DECL_INITIAL (*from_p
)) == CONSTRUCTOR
)
4020 tree old_from
= *from_p
;
4022 /* Move the constructor into the RHS. */
4023 *from_p
= unshare_expr (DECL_INITIAL (*from_p
));
4025 /* Let's see if gimplify_init_constructor will need to put
4026 it in memory. If so, revert the change. */
4027 ret
= gimplify_init_constructor (expr_p
, NULL
, NULL
, false, true);
4028 if (ret
== GS_ERROR
)
4043 /* If we have code like
4047 where the type of "x" is a (possibly cv-qualified variant
4048 of "A"), treat the entire expression as identical to "x".
4049 This kind of code arises in C++ when an object is bound
4050 to a const reference, and if "x" is a TARGET_EXPR we want
4051 to take advantage of the optimization below. */
4052 tree t
= gimple_fold_indirect_ref_rhs (TREE_OPERAND (*from_p
, 0));
4065 /* If we are initializing something from a TARGET_EXPR, strip the
4066 TARGET_EXPR and initialize it directly, if possible. This can't
4067 be done if the initializer is void, since that implies that the
4068 temporary is set in some non-trivial way.
4070 ??? What about code that pulls out the temp and uses it
4071 elsewhere? I think that such code never uses the TARGET_EXPR as
4072 an initializer. If I'm wrong, we'll die because the temp won't
4073 have any RTL. In that case, I guess we'll need to replace
4074 references somehow. */
4075 tree init
= TARGET_EXPR_INITIAL (*from_p
);
4078 && !VOID_TYPE_P (TREE_TYPE (init
)))
4089 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
4091 gimplify_compound_expr (from_p
, pre_p
, true);
4096 /* If we're initializing from a CONSTRUCTOR, break this into
4097 individual MODIFY_EXPRs. */
4098 return gimplify_init_constructor (expr_p
, pre_p
, post_p
, want_value
,
4102 /* If we're assigning to a non-register type, push the assignment
4103 down into the branches. This is mandatory for ADDRESSABLE types,
4104 since we cannot generate temporaries for such, but it saves a
4105 copy in other cases as well. */
4106 if (!is_gimple_reg_type (TREE_TYPE (*from_p
)))
4108 /* This code should mirror the code in gimplify_cond_expr. */
4109 enum tree_code code
= TREE_CODE (*expr_p
);
4110 tree cond
= *from_p
;
4111 tree result
= *to_p
;
4113 ret
= gimplify_expr (&result
, pre_p
, post_p
,
4114 is_gimple_lvalue
, fb_lvalue
);
4115 if (ret
!= GS_ERROR
)
4118 if (TREE_TYPE (TREE_OPERAND (cond
, 1)) != void_type_node
)
4119 TREE_OPERAND (cond
, 1)
4120 = build2 (code
, void_type_node
, result
,
4121 TREE_OPERAND (cond
, 1));
4122 if (TREE_TYPE (TREE_OPERAND (cond
, 2)) != void_type_node
)
4123 TREE_OPERAND (cond
, 2)
4124 = build2 (code
, void_type_node
, unshare_expr (result
),
4125 TREE_OPERAND (cond
, 2));
4127 TREE_TYPE (cond
) = void_type_node
;
4128 recalculate_side_effects (cond
);
4132 gimplify_and_add (cond
, pre_p
);
4133 *expr_p
= unshare_expr (result
);
4144 /* For calls that return in memory, give *to_p as the CALL_EXPR's
4145 return slot so that we don't generate a temporary. */
4146 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p
)
4147 && aggregate_value_p (*from_p
, *from_p
))
4151 if (!(rhs_predicate_for (*to_p
))(*from_p
))
4152 /* If we need a temporary, *to_p isn't accurate. */
4154 else if (TREE_CODE (*to_p
) == RESULT_DECL
4155 && DECL_NAME (*to_p
) == NULL_TREE
4156 && needs_to_live_in_memory (*to_p
))
4157 /* It's OK to use the return slot directly unless it's an NRV. */
4159 else if (is_gimple_reg_type (TREE_TYPE (*to_p
))
4160 || (DECL_P (*to_p
) && DECL_REGISTER (*to_p
)))
4161 /* Don't force regs into memory. */
4163 else if (TREE_CODE (*expr_p
) == INIT_EXPR
)
4164 /* It's OK to use the target directly if it's being
4167 else if (!is_gimple_non_addressable (*to_p
))
4168 /* Don't use the original target if it's already addressable;
4169 if its address escapes, and the called function uses the
4170 NRV optimization, a conforming program could see *to_p
4171 change before the called function returns; see c++/19317.
4172 When optimizing, the return_slot pass marks more functions
4173 as safe after we have escape info. */
4180 CALL_EXPR_RETURN_SLOT_OPT (*from_p
) = 1;
4181 mark_addressable (*to_p
);
4188 /* If we're initializing from a container, push the initialization
4190 case CLEANUP_POINT_EXPR
:
4192 case STATEMENT_LIST
:
4194 tree wrap
= *from_p
;
4197 ret
= gimplify_expr (to_p
, pre_p
, post_p
, is_gimple_min_lval
,
4199 if (ret
!= GS_ERROR
)
4202 t
= voidify_wrapper_expr (wrap
, *expr_p
);
4203 gcc_assert (t
== *expr_p
);
4207 gimplify_and_add (wrap
, pre_p
);
4208 *expr_p
= unshare_expr (*to_p
);
4215 case COMPOUND_LITERAL_EXPR
:
4217 tree complit
= TREE_OPERAND (*expr_p
, 1);
4218 tree decl_s
= COMPOUND_LITERAL_EXPR_DECL_EXPR (complit
);
4219 tree decl
= DECL_EXPR_DECL (decl_s
);
4220 tree init
= DECL_INITIAL (decl
);
4222 /* struct T x = (struct T) { 0, 1, 2 } can be optimized
4223 into struct T x = { 0, 1, 2 } if the address of the
4224 compound literal has never been taken. */
4225 if (!TREE_ADDRESSABLE (complit
)
4226 && !TREE_ADDRESSABLE (decl
)
4229 *expr_p
= copy_node (*expr_p
);
4230 TREE_OPERAND (*expr_p
, 1) = init
;
4244 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
4245 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
4246 DECL_GIMPLE_REG_P set.
4248 IMPORTANT NOTE: This promotion is performed by introducing a load of the
4249 other, unmodified part of the complex object just before the total store.
4250 As a consequence, if the object is still uninitialized, an undefined value
4251 will be loaded into a register, which may result in a spurious exception
4252 if the register is floating-point and the value happens to be a signaling
4253 NaN for example. Then the fully-fledged complex operations lowering pass
4254 followed by a DCE pass are necessary in order to fix things up. */
4256 static enum gimplify_status
4257 gimplify_modify_expr_complex_part (tree
*expr_p
, gimple_seq
*pre_p
,
4260 enum tree_code code
, ocode
;
4261 tree lhs
, rhs
, new_rhs
, other
, realpart
, imagpart
;
4263 lhs
= TREE_OPERAND (*expr_p
, 0);
4264 rhs
= TREE_OPERAND (*expr_p
, 1);
4265 code
= TREE_CODE (lhs
);
4266 lhs
= TREE_OPERAND (lhs
, 0);
4268 ocode
= code
== REALPART_EXPR
? IMAGPART_EXPR
: REALPART_EXPR
;
4269 other
= build1 (ocode
, TREE_TYPE (rhs
), lhs
);
4270 other
= get_formal_tmp_var (other
, pre_p
);
4272 realpart
= code
== REALPART_EXPR
? rhs
: other
;
4273 imagpart
= code
== REALPART_EXPR
? other
: rhs
;
4275 if (TREE_CONSTANT (realpart
) && TREE_CONSTANT (imagpart
))
4276 new_rhs
= build_complex (TREE_TYPE (lhs
), realpart
, imagpart
);
4278 new_rhs
= build2 (COMPLEX_EXPR
, TREE_TYPE (lhs
), realpart
, imagpart
);
4280 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (lhs
, new_rhs
));
4281 *expr_p
= (want_value
) ? rhs
: NULL_TREE
;
4287 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
4293 PRE_P points to the list where side effects that must happen before
4294 *EXPR_P should be stored.
4296 POST_P points to the list where side effects that must happen after
4297 *EXPR_P should be stored.
4299 WANT_VALUE is nonzero iff we want to use the value of this expression
4300 in another expression. */
4302 static enum gimplify_status
4303 gimplify_modify_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
4306 tree
*from_p
= &TREE_OPERAND (*expr_p
, 1);
4307 tree
*to_p
= &TREE_OPERAND (*expr_p
, 0);
4308 enum gimplify_status ret
= GS_UNHANDLED
;
4310 location_t loc
= EXPR_LOCATION (*expr_p
);
4312 gcc_assert (TREE_CODE (*expr_p
) == MODIFY_EXPR
4313 || TREE_CODE (*expr_p
) == INIT_EXPR
);
4315 /* Insert pointer conversions required by the middle-end that are not
4316 required by the frontend. This fixes middle-end type checking for
4317 for example gcc.dg/redecl-6.c. */
4318 if (POINTER_TYPE_P (TREE_TYPE (*to_p
)))
4320 STRIP_USELESS_TYPE_CONVERSION (*from_p
);
4321 if (!useless_type_conversion_p (TREE_TYPE (*to_p
), TREE_TYPE (*from_p
)))
4322 *from_p
= fold_convert_loc (loc
, TREE_TYPE (*to_p
), *from_p
);
4325 /* See if any simplifications can be done based on what the RHS is. */
4326 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
4328 if (ret
!= GS_UNHANDLED
)
4331 /* For zero sized types only gimplify the left hand side and right hand
4332 side as statements and throw away the assignment. Do this after
4333 gimplify_modify_expr_rhs so we handle TARGET_EXPRs of addressable
4335 if (zero_sized_type (TREE_TYPE (*from_p
)) && !want_value
)
4337 gimplify_stmt (from_p
, pre_p
);
4338 gimplify_stmt (to_p
, pre_p
);
4339 *expr_p
= NULL_TREE
;
4343 /* If the value being copied is of variable width, compute the length
4344 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
4345 before gimplifying any of the operands so that we can resolve any
4346 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
4347 the size of the expression to be copied, not of the destination, so
4348 that is what we must do here. */
4349 maybe_with_size_expr (from_p
);
4351 ret
= gimplify_expr (to_p
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
4352 if (ret
== GS_ERROR
)
4355 /* As a special case, we have to temporarily allow for assignments
4356 with a CALL_EXPR on the RHS. Since in GIMPLE a function call is
4357 a toplevel statement, when gimplifying the GENERIC expression
4358 MODIFY_EXPR <a, CALL_EXPR <foo>>, we cannot create the tuple
4359 GIMPLE_ASSIGN <a, GIMPLE_CALL <foo>>.
4361 Instead, we need to create the tuple GIMPLE_CALL <a, foo>. To
4362 prevent gimplify_expr from trying to create a new temporary for
4363 foo's LHS, we tell it that it should only gimplify until it
4364 reaches the CALL_EXPR. On return from gimplify_expr, the newly
4365 created GIMPLE_CALL <foo> will be the last statement in *PRE_P
4366 and all we need to do here is set 'a' to be its LHS. */
4367 ret
= gimplify_expr (from_p
, pre_p
, post_p
, rhs_predicate_for (*to_p
),
4369 if (ret
== GS_ERROR
)
4372 /* Now see if the above changed *from_p to something we handle specially. */
4373 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
4375 if (ret
!= GS_UNHANDLED
)
4378 /* If we've got a variable sized assignment between two lvalues (i.e. does
4379 not involve a call), then we can make things a bit more straightforward
4380 by converting the assignment to memcpy or memset. */
4381 if (TREE_CODE (*from_p
) == WITH_SIZE_EXPR
)
4383 tree from
= TREE_OPERAND (*from_p
, 0);
4384 tree size
= TREE_OPERAND (*from_p
, 1);
4386 if (TREE_CODE (from
) == CONSTRUCTOR
)
4387 return gimplify_modify_expr_to_memset (expr_p
, size
, want_value
, pre_p
);
4389 if (is_gimple_addressable (from
))
4392 return gimplify_modify_expr_to_memcpy (expr_p
, size
, want_value
,
4397 /* Transform partial stores to non-addressable complex variables into
4398 total stores. This allows us to use real instead of virtual operands
4399 for these variables, which improves optimization. */
4400 if ((TREE_CODE (*to_p
) == REALPART_EXPR
4401 || TREE_CODE (*to_p
) == IMAGPART_EXPR
)
4402 && is_gimple_reg (TREE_OPERAND (*to_p
, 0)))
4403 return gimplify_modify_expr_complex_part (expr_p
, pre_p
, want_value
);
4405 /* Try to alleviate the effects of the gimplification creating artificial
4406 temporaries (see for example is_gimple_reg_rhs) on the debug info. */
4407 if (!gimplify_ctxp
->into_ssa
4409 && DECL_IGNORED_P (*from_p
)
4411 && !DECL_IGNORED_P (*to_p
))
4413 if (!DECL_NAME (*from_p
) && DECL_NAME (*to_p
))
4415 = create_tmp_var_name (IDENTIFIER_POINTER (DECL_NAME (*to_p
)));
4416 DECL_DEBUG_EXPR_IS_FROM (*from_p
) = 1;
4417 SET_DECL_DEBUG_EXPR (*from_p
, *to_p
);
4420 if (TREE_CODE (*from_p
) == CALL_EXPR
)
4422 /* Since the RHS is a CALL_EXPR, we need to create a GIMPLE_CALL
4423 instead of a GIMPLE_ASSIGN. */
4424 assign
= gimple_build_call_from_tree (*from_p
);
4425 if (!gimple_call_noreturn_p (assign
))
4426 gimple_call_set_lhs (assign
, *to_p
);
4430 assign
= gimple_build_assign (*to_p
, *from_p
);
4431 gimple_set_location (assign
, EXPR_LOCATION (*expr_p
));
4434 gimplify_seq_add_stmt (pre_p
, assign
);
4436 if (gimplify_ctxp
->into_ssa
&& is_gimple_reg (*to_p
))
4438 /* If we've somehow already got an SSA_NAME on the LHS, then
4439 we've probably modified it twice. Not good. */
4440 gcc_assert (TREE_CODE (*to_p
) != SSA_NAME
);
4441 *to_p
= make_ssa_name (*to_p
, assign
);
4442 gimple_set_lhs (assign
, *to_p
);
4447 *expr_p
= unshare_expr (*to_p
);
4456 /* Gimplify a comparison between two variable-sized objects. Do this
4457 with a call to BUILT_IN_MEMCMP. */
4459 static enum gimplify_status
4460 gimplify_variable_sized_compare (tree
*expr_p
)
4462 tree op0
= TREE_OPERAND (*expr_p
, 0);
4463 tree op1
= TREE_OPERAND (*expr_p
, 1);
4464 tree t
, arg
, dest
, src
;
4465 location_t loc
= EXPR_LOCATION (*expr_p
);
4467 arg
= TYPE_SIZE_UNIT (TREE_TYPE (op0
));
4468 arg
= unshare_expr (arg
);
4469 arg
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (arg
, op0
);
4470 src
= build_fold_addr_expr_loc (loc
, op1
);
4471 dest
= build_fold_addr_expr_loc (loc
, op0
);
4472 t
= implicit_built_in_decls
[BUILT_IN_MEMCMP
];
4473 t
= build_call_expr_loc (loc
, t
, 3, dest
, src
, arg
);
4475 = build2 (TREE_CODE (*expr_p
), TREE_TYPE (*expr_p
), t
, integer_zero_node
);
4480 /* Gimplify a comparison between two aggregate objects of integral scalar
4481 mode as a comparison between the bitwise equivalent scalar values. */
4483 static enum gimplify_status
4484 gimplify_scalar_mode_aggregate_compare (tree
*expr_p
)
4486 location_t loc
= EXPR_LOCATION (*expr_p
);
4487 tree op0
= TREE_OPERAND (*expr_p
, 0);
4488 tree op1
= TREE_OPERAND (*expr_p
, 1);
4490 tree type
= TREE_TYPE (op0
);
4491 tree scalar_type
= lang_hooks
.types
.type_for_mode (TYPE_MODE (type
), 1);
4493 op0
= fold_build1_loc (loc
, VIEW_CONVERT_EXPR
, scalar_type
, op0
);
4494 op1
= fold_build1_loc (loc
, VIEW_CONVERT_EXPR
, scalar_type
, op1
);
4497 = fold_build2_loc (loc
, TREE_CODE (*expr_p
), TREE_TYPE (*expr_p
), op0
, op1
);
4502 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
4503 points to the expression to gimplify.
4505 Expressions of the form 'a && b' are gimplified to:
4507 a && b ? true : false
4509 LOCUS is the source location to be put on the generated COND_EXPR.
4510 gimplify_cond_expr will do the rest. */
4512 static enum gimplify_status
4513 gimplify_boolean_expr (tree
*expr_p
, location_t locus
)
4515 /* Preserve the original type of the expression. */
4516 tree type
= TREE_TYPE (*expr_p
);
4518 *expr_p
= build3 (COND_EXPR
, type
, *expr_p
,
4519 fold_convert_loc (locus
, type
, boolean_true_node
),
4520 fold_convert_loc (locus
, type
, boolean_false_node
));
4522 SET_EXPR_LOCATION (*expr_p
, locus
);
4527 /* Gimplifies an expression sequence. This function gimplifies each
4528 expression and re-writes the original expression with the last
4529 expression of the sequence in GIMPLE form.
4531 PRE_P points to the list where the side effects for all the
4532 expressions in the sequence will be emitted.
4534 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
4536 static enum gimplify_status
4537 gimplify_compound_expr (tree
*expr_p
, gimple_seq
*pre_p
, bool want_value
)
4543 tree
*sub_p
= &TREE_OPERAND (t
, 0);
4545 if (TREE_CODE (*sub_p
) == COMPOUND_EXPR
)
4546 gimplify_compound_expr (sub_p
, pre_p
, false);
4548 gimplify_stmt (sub_p
, pre_p
);
4550 t
= TREE_OPERAND (t
, 1);
4552 while (TREE_CODE (t
) == COMPOUND_EXPR
);
4559 gimplify_stmt (expr_p
, pre_p
);
4565 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
4566 gimplify. After gimplification, EXPR_P will point to a new temporary
4567 that holds the original value of the SAVE_EXPR node.
4569 PRE_P points to the list where side effects that must happen before
4570 *EXPR_P should be stored. */
4572 static enum gimplify_status
4573 gimplify_save_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
4575 enum gimplify_status ret
= GS_ALL_DONE
;
4578 gcc_assert (TREE_CODE (*expr_p
) == SAVE_EXPR
);
4579 val
= TREE_OPERAND (*expr_p
, 0);
4581 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
4582 if (!SAVE_EXPR_RESOLVED_P (*expr_p
))
4584 /* The operand may be a void-valued expression such as SAVE_EXPRs
4585 generated by the Java frontend for class initialization. It is
4586 being executed only for its side-effects. */
4587 if (TREE_TYPE (val
) == void_type_node
)
4589 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
4590 is_gimple_stmt
, fb_none
);
4594 val
= get_initialized_tmp_var (val
, pre_p
, post_p
);
4596 TREE_OPERAND (*expr_p
, 0) = val
;
4597 SAVE_EXPR_RESOLVED_P (*expr_p
) = 1;
4605 /* Re-write the ADDR_EXPR node pointed to by EXPR_P
4612 PRE_P points to the list where side effects that must happen before
4613 *EXPR_P should be stored.
4615 POST_P points to the list where side effects that must happen after
4616 *EXPR_P should be stored. */
4618 static enum gimplify_status
4619 gimplify_addr_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
4621 tree expr
= *expr_p
;
4622 tree op0
= TREE_OPERAND (expr
, 0);
4623 enum gimplify_status ret
;
4624 location_t loc
= EXPR_LOCATION (*expr_p
);
4626 switch (TREE_CODE (op0
))
4629 case MISALIGNED_INDIRECT_REF
:
4631 /* Check if we are dealing with an expression of the form '&*ptr'.
4632 While the front end folds away '&*ptr' into 'ptr', these
4633 expressions may be generated internally by the compiler (e.g.,
4634 builtins like __builtin_va_end). */
4635 /* Caution: the silent array decomposition semantics we allow for
4636 ADDR_EXPR means we can't always discard the pair. */
4637 /* Gimplification of the ADDR_EXPR operand may drop
4638 cv-qualification conversions, so make sure we add them if
4641 tree op00
= TREE_OPERAND (op0
, 0);
4642 tree t_expr
= TREE_TYPE (expr
);
4643 tree t_op00
= TREE_TYPE (op00
);
4645 if (!useless_type_conversion_p (t_expr
, t_op00
))
4646 op00
= fold_convert_loc (loc
, TREE_TYPE (expr
), op00
);
4652 case VIEW_CONVERT_EXPR
:
4653 /* Take the address of our operand and then convert it to the type of
4656 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
4657 all clear. The impact of this transformation is even less clear. */
4659 /* If the operand is a useless conversion, look through it. Doing so
4660 guarantees that the ADDR_EXPR and its operand will remain of the
4662 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0
, 0)))
4663 op0
= TREE_OPERAND (op0
, 0);
4665 *expr_p
= fold_convert_loc (loc
, TREE_TYPE (expr
),
4666 build_fold_addr_expr_loc (loc
,
4667 TREE_OPERAND (op0
, 0)));
4672 /* We use fb_either here because the C frontend sometimes takes
4673 the address of a call that returns a struct; see
4674 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
4675 the implied temporary explicit. */
4677 /* Make the operand addressable. */
4678 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, post_p
,
4679 is_gimple_addressable
, fb_either
);
4680 if (ret
== GS_ERROR
)
4683 /* Then mark it. Beware that it may not be possible to do so directly
4684 if a temporary has been created by the gimplification. */
4685 prepare_gimple_addressable (&TREE_OPERAND (expr
, 0), pre_p
);
4687 op0
= TREE_OPERAND (expr
, 0);
4689 /* For various reasons, the gimplification of the expression
4690 may have made a new INDIRECT_REF. */
4691 if (TREE_CODE (op0
) == INDIRECT_REF
)
4692 goto do_indirect_ref
;
4694 mark_addressable (TREE_OPERAND (expr
, 0));
4696 /* The FEs may end up building ADDR_EXPRs early on a decl with
4697 an incomplete type. Re-build ADDR_EXPRs in canonical form
4699 if (!types_compatible_p (TREE_TYPE (op0
), TREE_TYPE (TREE_TYPE (expr
))))
4700 *expr_p
= build_fold_addr_expr (op0
);
4702 /* Make sure TREE_CONSTANT and TREE_SIDE_EFFECTS are set properly. */
4703 recompute_tree_invariant_for_addr_expr (*expr_p
);
4705 /* If we re-built the ADDR_EXPR add a conversion to the original type
4707 if (!useless_type_conversion_p (TREE_TYPE (expr
), TREE_TYPE (*expr_p
)))
4708 *expr_p
= fold_convert (TREE_TYPE (expr
), *expr_p
);
4716 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
4717 value; output operands should be a gimple lvalue. */
4719 static enum gimplify_status
4720 gimplify_asm_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
4724 const char **oconstraints
;
4727 const char *constraint
;
4728 bool allows_mem
, allows_reg
, is_inout
;
4729 enum gimplify_status ret
, tret
;
4731 VEC(tree
, gc
) *inputs
;
4732 VEC(tree
, gc
) *outputs
;
4733 VEC(tree
, gc
) *clobbers
;
4734 VEC(tree
, gc
) *labels
;
4738 noutputs
= list_length (ASM_OUTPUTS (expr
));
4739 oconstraints
= (const char **) alloca ((noutputs
) * sizeof (const char *));
4741 inputs
= outputs
= clobbers
= labels
= NULL
;
4744 link_next
= NULL_TREE
;
4745 for (i
= 0, link
= ASM_OUTPUTS (expr
); link
; ++i
, link
= link_next
)
4748 size_t constraint_len
;
4750 link_next
= TREE_CHAIN (link
);
4754 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
4755 constraint_len
= strlen (constraint
);
4756 if (constraint_len
== 0)
4759 ok
= parse_output_constraint (&constraint
, i
, 0, 0,
4760 &allows_mem
, &allows_reg
, &is_inout
);
4767 if (!allows_reg
&& allows_mem
)
4768 mark_addressable (TREE_VALUE (link
));
4770 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
4771 is_inout
? is_gimple_min_lval
: is_gimple_lvalue
,
4772 fb_lvalue
| fb_mayfail
);
4773 if (tret
== GS_ERROR
)
4775 error ("invalid lvalue in asm output %d", i
);
4779 VEC_safe_push (tree
, gc
, outputs
, link
);
4780 TREE_CHAIN (link
) = NULL_TREE
;
4784 /* An input/output operand. To give the optimizers more
4785 flexibility, split it into separate input and output
4790 /* Turn the in/out constraint into an output constraint. */
4791 char *p
= xstrdup (constraint
);
4793 TREE_VALUE (TREE_PURPOSE (link
)) = build_string (constraint_len
, p
);
4795 /* And add a matching input constraint. */
4798 sprintf (buf
, "%d", i
);
4800 /* If there are multiple alternatives in the constraint,
4801 handle each of them individually. Those that allow register
4802 will be replaced with operand number, the others will stay
4804 if (strchr (p
, ',') != NULL
)
4806 size_t len
= 0, buflen
= strlen (buf
);
4807 char *beg
, *end
, *str
, *dst
;
4811 end
= strchr (beg
, ',');
4813 end
= strchr (beg
, '\0');
4814 if ((size_t) (end
- beg
) < buflen
)
4817 len
+= end
- beg
+ 1;
4824 str
= (char *) alloca (len
);
4825 for (beg
= p
+ 1, dst
= str
;;)
4828 bool mem_p
, reg_p
, inout_p
;
4830 end
= strchr (beg
, ',');
4835 parse_output_constraint (&tem
, i
, 0, 0,
4836 &mem_p
, ®_p
, &inout_p
);
4841 memcpy (dst
, buf
, buflen
);
4850 memcpy (dst
, beg
, len
);
4859 input
= build_string (dst
- str
, str
);
4862 input
= build_string (strlen (buf
), buf
);
4865 input
= build_string (constraint_len
- 1, constraint
+ 1);
4869 input
= build_tree_list (build_tree_list (NULL_TREE
, input
),
4870 unshare_expr (TREE_VALUE (link
)));
4871 ASM_INPUTS (expr
) = chainon (ASM_INPUTS (expr
), input
);
4875 link_next
= NULL_TREE
;
4876 for (link
= ASM_INPUTS (expr
); link
; ++i
, link
= link_next
)
4878 link_next
= TREE_CHAIN (link
);
4879 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
4880 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
4881 oconstraints
, &allows_mem
, &allows_reg
);
4883 /* If we can't make copies, we can only accept memory. */
4884 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (link
))))
4890 error ("impossible constraint in %<asm%>");
4891 error ("non-memory input %d must stay in memory", i
);
4896 /* If the operand is a memory input, it should be an lvalue. */
4897 if (!allows_reg
&& allows_mem
)
4899 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
4900 is_gimple_lvalue
, fb_lvalue
| fb_mayfail
);
4901 mark_addressable (TREE_VALUE (link
));
4902 if (tret
== GS_ERROR
)
4904 if (EXPR_HAS_LOCATION (TREE_VALUE (link
)))
4905 input_location
= EXPR_LOCATION (TREE_VALUE (link
));
4906 error ("memory input %d is not directly addressable", i
);
4912 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
4913 is_gimple_asm_val
, fb_rvalue
);
4914 if (tret
== GS_ERROR
)
4918 TREE_CHAIN (link
) = NULL_TREE
;
4919 VEC_safe_push (tree
, gc
, inputs
, link
);
4922 for (link
= ASM_CLOBBERS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
4923 VEC_safe_push (tree
, gc
, clobbers
, link
);
4925 for (link
= ASM_LABELS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
4926 VEC_safe_push (tree
, gc
, labels
, link
);
4928 /* Do not add ASMs with errors to the gimple IL stream. */
4929 if (ret
!= GS_ERROR
)
4931 stmt
= gimple_build_asm_vec (TREE_STRING_POINTER (ASM_STRING (expr
)),
4932 inputs
, outputs
, clobbers
, labels
);
4934 gimple_asm_set_volatile (stmt
, ASM_VOLATILE_P (expr
));
4935 gimple_asm_set_input (stmt
, ASM_INPUT_P (expr
));
4937 gimplify_seq_add_stmt (pre_p
, stmt
);
4943 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
4944 GIMPLE_WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
4945 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
4946 return to this function.
4948 FIXME should we complexify the prequeue handling instead? Or use flags
4949 for all the cleanups and let the optimizer tighten them up? The current
4950 code seems pretty fragile; it will break on a cleanup within any
4951 non-conditional nesting. But any such nesting would be broken, anyway;
4952 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
4953 and continues out of it. We can do that at the RTL level, though, so
4954 having an optimizer to tighten up try/finally regions would be a Good
4957 static enum gimplify_status
4958 gimplify_cleanup_point_expr (tree
*expr_p
, gimple_seq
*pre_p
)
4960 gimple_stmt_iterator iter
;
4961 gimple_seq body_sequence
= NULL
;
4963 tree temp
= voidify_wrapper_expr (*expr_p
, NULL
);
4965 /* We only care about the number of conditions between the innermost
4966 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
4967 any cleanups collected outside the CLEANUP_POINT_EXPR. */
4968 int old_conds
= gimplify_ctxp
->conditions
;
4969 gimple_seq old_cleanups
= gimplify_ctxp
->conditional_cleanups
;
4970 gimplify_ctxp
->conditions
= 0;
4971 gimplify_ctxp
->conditional_cleanups
= NULL
;
4973 gimplify_stmt (&TREE_OPERAND (*expr_p
, 0), &body_sequence
);
4975 gimplify_ctxp
->conditions
= old_conds
;
4976 gimplify_ctxp
->conditional_cleanups
= old_cleanups
;
4978 for (iter
= gsi_start (body_sequence
); !gsi_end_p (iter
); )
4980 gimple wce
= gsi_stmt (iter
);
4982 if (gimple_code (wce
) == GIMPLE_WITH_CLEANUP_EXPR
)
4984 if (gsi_one_before_end_p (iter
))
4986 /* Note that gsi_insert_seq_before and gsi_remove do not
4987 scan operands, unlike some other sequence mutators. */
4988 gsi_insert_seq_before_without_update (&iter
,
4989 gimple_wce_cleanup (wce
),
4991 gsi_remove (&iter
, true);
4998 enum gimple_try_flags kind
;
5000 if (gimple_wce_cleanup_eh_only (wce
))
5001 kind
= GIMPLE_TRY_CATCH
;
5003 kind
= GIMPLE_TRY_FINALLY
;
5004 seq
= gsi_split_seq_after (iter
);
5006 gtry
= gimple_build_try (seq
, gimple_wce_cleanup (wce
), kind
);
5007 /* Do not use gsi_replace here, as it may scan operands.
5008 We want to do a simple structural modification only. */
5009 *gsi_stmt_ptr (&iter
) = gtry
;
5010 iter
= gsi_start (seq
);
5017 gimplify_seq_add_seq (pre_p
, body_sequence
);
5030 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
5031 is the cleanup action required. EH_ONLY is true if the cleanup should
5032 only be executed if an exception is thrown, not on normal exit. */
5035 gimple_push_cleanup (tree var
, tree cleanup
, bool eh_only
, gimple_seq
*pre_p
)
5038 gimple_seq cleanup_stmts
= NULL
;
5040 /* Errors can result in improperly nested cleanups. Which results in
5041 confusion when trying to resolve the GIMPLE_WITH_CLEANUP_EXPR. */
5042 if (errorcount
|| sorrycount
)
5045 if (gimple_conditional_context ())
5047 /* If we're in a conditional context, this is more complex. We only
5048 want to run the cleanup if we actually ran the initialization that
5049 necessitates it, but we want to run it after the end of the
5050 conditional context. So we wrap the try/finally around the
5051 condition and use a flag to determine whether or not to actually
5052 run the destructor. Thus
5056 becomes (approximately)
5060 if (test) { A::A(temp); flag = 1; val = f(temp); }
5063 if (flag) A::~A(temp);
5067 tree flag
= create_tmp_var (boolean_type_node
, "cleanup");
5068 gimple ffalse
= gimple_build_assign (flag
, boolean_false_node
);
5069 gimple ftrue
= gimple_build_assign (flag
, boolean_true_node
);
5071 cleanup
= build3 (COND_EXPR
, void_type_node
, flag
, cleanup
, NULL
);
5072 gimplify_stmt (&cleanup
, &cleanup_stmts
);
5073 wce
= gimple_build_wce (cleanup_stmts
);
5075 gimplify_seq_add_stmt (&gimplify_ctxp
->conditional_cleanups
, ffalse
);
5076 gimplify_seq_add_stmt (&gimplify_ctxp
->conditional_cleanups
, wce
);
5077 gimplify_seq_add_stmt (pre_p
, ftrue
);
5079 /* Because of this manipulation, and the EH edges that jump
5080 threading cannot redirect, the temporary (VAR) will appear
5081 to be used uninitialized. Don't warn. */
5082 TREE_NO_WARNING (var
) = 1;
5086 gimplify_stmt (&cleanup
, &cleanup_stmts
);
5087 wce
= gimple_build_wce (cleanup_stmts
);
5088 gimple_wce_set_cleanup_eh_only (wce
, eh_only
);
5089 gimplify_seq_add_stmt (pre_p
, wce
);
5093 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
5095 static enum gimplify_status
5096 gimplify_target_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
5098 tree targ
= *expr_p
;
5099 tree temp
= TARGET_EXPR_SLOT (targ
);
5100 tree init
= TARGET_EXPR_INITIAL (targ
);
5101 enum gimplify_status ret
;
5105 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
5106 to the temps list. Handle also variable length TARGET_EXPRs. */
5107 if (TREE_CODE (DECL_SIZE (temp
)) != INTEGER_CST
)
5109 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (temp
)))
5110 gimplify_type_sizes (TREE_TYPE (temp
), pre_p
);
5111 gimplify_vla_decl (temp
, pre_p
);
5114 gimple_add_tmp_var (temp
);
5116 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
5117 expression is supposed to initialize the slot. */
5118 if (VOID_TYPE_P (TREE_TYPE (init
)))
5119 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
, fb_none
);
5122 tree init_expr
= build2 (INIT_EXPR
, void_type_node
, temp
, init
);
5124 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
, fb_none
);
5126 ggc_free (init_expr
);
5128 if (ret
== GS_ERROR
)
5130 /* PR c++/28266 Make sure this is expanded only once. */
5131 TARGET_EXPR_INITIAL (targ
) = NULL_TREE
;
5135 gimplify_and_add (init
, pre_p
);
5137 /* If needed, push the cleanup for the temp. */
5138 if (TARGET_EXPR_CLEANUP (targ
))
5139 gimple_push_cleanup (temp
, TARGET_EXPR_CLEANUP (targ
),
5140 CLEANUP_EH_ONLY (targ
), pre_p
);
5142 /* Only expand this once. */
5143 TREE_OPERAND (targ
, 3) = init
;
5144 TARGET_EXPR_INITIAL (targ
) = NULL_TREE
;
5147 /* We should have expanded this before. */
5148 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp
));
5154 /* Gimplification of expression trees. */
5156 /* Gimplify an expression which appears at statement context. The
5157 corresponding GIMPLE statements are added to *SEQ_P. If *SEQ_P is
5158 NULL, a new sequence is allocated.
5160 Return true if we actually added a statement to the queue. */
5163 gimplify_stmt (tree
*stmt_p
, gimple_seq
*seq_p
)
5165 gimple_seq_node last
;
5168 *seq_p
= gimple_seq_alloc ();
5170 last
= gimple_seq_last (*seq_p
);
5171 gimplify_expr (stmt_p
, seq_p
, NULL
, is_gimple_stmt
, fb_none
);
5172 return last
!= gimple_seq_last (*seq_p
);
5176 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
5177 to CTX. If entries already exist, force them to be some flavor of private.
5178 If there is no enclosing parallel, do nothing. */
5181 omp_firstprivatize_variable (struct gimplify_omp_ctx
*ctx
, tree decl
)
5185 if (decl
== NULL
|| !DECL_P (decl
))
5190 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5193 if (n
->value
& GOVD_SHARED
)
5194 n
->value
= GOVD_FIRSTPRIVATE
| (n
->value
& GOVD_SEEN
);
5198 else if (ctx
->region_type
!= ORT_WORKSHARE
)
5199 omp_add_variable (ctx
, decl
, GOVD_FIRSTPRIVATE
);
5201 ctx
= ctx
->outer_context
;
5206 /* Similarly for each of the type sizes of TYPE. */
5209 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx
*ctx
, tree type
)
5211 if (type
== NULL
|| type
== error_mark_node
)
5213 type
= TYPE_MAIN_VARIANT (type
);
5215 if (pointer_set_insert (ctx
->privatized_types
, type
))
5218 switch (TREE_CODE (type
))
5224 case FIXED_POINT_TYPE
:
5225 omp_firstprivatize_variable (ctx
, TYPE_MIN_VALUE (type
));
5226 omp_firstprivatize_variable (ctx
, TYPE_MAX_VALUE (type
));
5230 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
5231 omp_firstprivatize_type_sizes (ctx
, TYPE_DOMAIN (type
));
5236 case QUAL_UNION_TYPE
:
5239 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
5240 if (TREE_CODE (field
) == FIELD_DECL
)
5242 omp_firstprivatize_variable (ctx
, DECL_FIELD_OFFSET (field
));
5243 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (field
));
5249 case REFERENCE_TYPE
:
5250 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
5257 omp_firstprivatize_variable (ctx
, TYPE_SIZE (type
));
5258 omp_firstprivatize_variable (ctx
, TYPE_SIZE_UNIT (type
));
5259 lang_hooks
.types
.omp_firstprivatize_type_sizes (ctx
, type
);
5262 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
5265 omp_add_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, unsigned int flags
)
5268 unsigned int nflags
;
5271 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
5274 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
5275 there are constructors involved somewhere. */
5276 if (TREE_ADDRESSABLE (TREE_TYPE (decl
))
5277 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
5280 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5283 /* We shouldn't be re-adding the decl with the same data
5285 gcc_assert ((n
->value
& GOVD_DATA_SHARE_CLASS
& flags
) == 0);
5286 /* The only combination of data sharing classes we should see is
5287 FIRSTPRIVATE and LASTPRIVATE. */
5288 nflags
= n
->value
| flags
;
5289 gcc_assert ((nflags
& GOVD_DATA_SHARE_CLASS
)
5290 == (GOVD_FIRSTPRIVATE
| GOVD_LASTPRIVATE
));
5295 /* When adding a variable-sized variable, we have to handle all sorts
5296 of additional bits of data: the pointer replacement variable, and
5297 the parameters of the type. */
5298 if (DECL_SIZE (decl
) && TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
5300 /* Add the pointer replacement variable as PRIVATE if the variable
5301 replacement is private, else FIRSTPRIVATE since we'll need the
5302 address of the original variable either for SHARED, or for the
5303 copy into or out of the context. */
5304 if (!(flags
& GOVD_LOCAL
))
5306 nflags
= flags
& GOVD_PRIVATE
? GOVD_PRIVATE
: GOVD_FIRSTPRIVATE
;
5307 nflags
|= flags
& GOVD_SEEN
;
5308 t
= DECL_VALUE_EXPR (decl
);
5309 gcc_assert (TREE_CODE (t
) == INDIRECT_REF
);
5310 t
= TREE_OPERAND (t
, 0);
5311 gcc_assert (DECL_P (t
));
5312 omp_add_variable (ctx
, t
, nflags
);
5315 /* Add all of the variable and type parameters (which should have
5316 been gimplified to a formal temporary) as FIRSTPRIVATE. */
5317 omp_firstprivatize_variable (ctx
, DECL_SIZE_UNIT (decl
));
5318 omp_firstprivatize_variable (ctx
, DECL_SIZE (decl
));
5319 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
5321 /* The variable-sized variable itself is never SHARED, only some form
5322 of PRIVATE. The sharing would take place via the pointer variable
5323 which we remapped above. */
5324 if (flags
& GOVD_SHARED
)
5325 flags
= GOVD_PRIVATE
| GOVD_DEBUG_PRIVATE
5326 | (flags
& (GOVD_SEEN
| GOVD_EXPLICIT
));
5328 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
5329 alloca statement we generate for the variable, so make sure it
5330 is available. This isn't automatically needed for the SHARED
5331 case, since we won't be allocating local storage then.
5332 For local variables TYPE_SIZE_UNIT might not be gimplified yet,
5333 in this case omp_notice_variable will be called later
5334 on when it is gimplified. */
5335 else if (! (flags
& GOVD_LOCAL
))
5336 omp_notice_variable (ctx
, TYPE_SIZE_UNIT (TREE_TYPE (decl
)), true);
5338 else if (lang_hooks
.decls
.omp_privatize_by_reference (decl
))
5340 gcc_assert ((flags
& GOVD_LOCAL
) == 0);
5341 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
5343 /* Similar to the direct variable sized case above, we'll need the
5344 size of references being privatized. */
5345 if ((flags
& GOVD_SHARED
) == 0)
5347 t
= TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl
)));
5348 if (TREE_CODE (t
) != INTEGER_CST
)
5349 omp_notice_variable (ctx
, t
, true);
5353 splay_tree_insert (ctx
->variables
, (splay_tree_key
)decl
, flags
);
5356 /* Record the fact that DECL was used within the OpenMP context CTX.
5357 IN_CODE is true when real code uses DECL, and false when we should
5358 merely emit default(none) errors. Return true if DECL is going to
5359 be remapped and thus DECL shouldn't be gimplified into its
5360 DECL_VALUE_EXPR (if any). */
5363 omp_notice_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, bool in_code
)
5366 unsigned flags
= in_code
? GOVD_SEEN
: 0;
5367 bool ret
= false, shared
;
5369 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
5372 /* Threadprivate variables are predetermined. */
5373 if (is_global_var (decl
))
5375 if (DECL_THREAD_LOCAL_P (decl
))
5378 if (DECL_HAS_VALUE_EXPR_P (decl
))
5380 tree value
= get_base_address (DECL_VALUE_EXPR (decl
));
5382 if (value
&& DECL_P (value
) && DECL_THREAD_LOCAL_P (value
))
5387 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5390 enum omp_clause_default_kind default_kind
, kind
;
5391 struct gimplify_omp_ctx
*octx
;
5393 if (ctx
->region_type
== ORT_WORKSHARE
)
5396 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
5397 remapped firstprivate instead of shared. To some extent this is
5398 addressed in omp_firstprivatize_type_sizes, but not effectively. */
5399 default_kind
= ctx
->default_kind
;
5400 kind
= lang_hooks
.decls
.omp_predetermined_sharing (decl
);
5401 if (kind
!= OMP_CLAUSE_DEFAULT_UNSPECIFIED
)
5402 default_kind
= kind
;
5404 switch (default_kind
)
5406 case OMP_CLAUSE_DEFAULT_NONE
:
5407 error ("%qE not specified in enclosing parallel",
5409 error_at (ctx
->location
, "enclosing parallel");
5411 case OMP_CLAUSE_DEFAULT_SHARED
:
5412 flags
|= GOVD_SHARED
;
5414 case OMP_CLAUSE_DEFAULT_PRIVATE
:
5415 flags
|= GOVD_PRIVATE
;
5417 case OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
:
5418 flags
|= GOVD_FIRSTPRIVATE
;
5420 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
5421 /* decl will be either GOVD_FIRSTPRIVATE or GOVD_SHARED. */
5422 gcc_assert (ctx
->region_type
== ORT_TASK
);
5423 if (ctx
->outer_context
)
5424 omp_notice_variable (ctx
->outer_context
, decl
, in_code
);
5425 for (octx
= ctx
->outer_context
; octx
; octx
= octx
->outer_context
)
5429 n2
= splay_tree_lookup (octx
->variables
, (splay_tree_key
) decl
);
5430 if (n2
&& (n2
->value
& GOVD_DATA_SHARE_CLASS
) != GOVD_SHARED
)
5432 flags
|= GOVD_FIRSTPRIVATE
;
5435 if ((octx
->region_type
& ORT_PARALLEL
) != 0)
5438 if (flags
& GOVD_FIRSTPRIVATE
)
5441 && (TREE_CODE (decl
) == PARM_DECL
5442 || (!is_global_var (decl
)
5443 && DECL_CONTEXT (decl
) == current_function_decl
)))
5445 flags
|= GOVD_FIRSTPRIVATE
;
5448 flags
|= GOVD_SHARED
;
5454 if ((flags
& GOVD_PRIVATE
)
5455 && lang_hooks
.decls
.omp_private_outer_ref (decl
))
5456 flags
|= GOVD_PRIVATE_OUTER_REF
;
5458 omp_add_variable (ctx
, decl
, flags
);
5460 shared
= (flags
& GOVD_SHARED
) != 0;
5461 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
5465 if ((n
->value
& (GOVD_SEEN
| GOVD_LOCAL
)) == 0
5466 && (flags
& (GOVD_SEEN
| GOVD_LOCAL
)) == GOVD_SEEN
5468 && TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
5471 tree t
= DECL_VALUE_EXPR (decl
);
5472 gcc_assert (TREE_CODE (t
) == INDIRECT_REF
);
5473 t
= TREE_OPERAND (t
, 0);
5474 gcc_assert (DECL_P (t
));
5475 n2
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) t
);
5476 n2
->value
|= GOVD_SEEN
;
5479 shared
= ((flags
| n
->value
) & GOVD_SHARED
) != 0;
5480 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
5482 /* If nothing changed, there's nothing left to do. */
5483 if ((n
->value
& flags
) == flags
)
5489 /* If the variable is private in the current context, then we don't
5490 need to propagate anything to an outer context. */
5491 if ((flags
& GOVD_PRIVATE
) && !(flags
& GOVD_PRIVATE_OUTER_REF
))
5493 if (ctx
->outer_context
5494 && omp_notice_variable (ctx
->outer_context
, decl
, in_code
))
5499 /* Verify that DECL is private within CTX. If there's specific information
5500 to the contrary in the innermost scope, generate an error. */
5503 omp_is_private (struct gimplify_omp_ctx
*ctx
, tree decl
)
5507 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5510 if (n
->value
& GOVD_SHARED
)
5512 if (ctx
== gimplify_omp_ctxp
)
5514 error ("iteration variable %qE should be private",
5516 n
->value
= GOVD_PRIVATE
;
5522 else if ((n
->value
& GOVD_EXPLICIT
) != 0
5523 && (ctx
== gimplify_omp_ctxp
5524 || (ctx
->region_type
== ORT_COMBINED_PARALLEL
5525 && gimplify_omp_ctxp
->outer_context
== ctx
)))
5527 if ((n
->value
& GOVD_FIRSTPRIVATE
) != 0)
5528 error ("iteration variable %qE should not be firstprivate",
5530 else if ((n
->value
& GOVD_REDUCTION
) != 0)
5531 error ("iteration variable %qE should not be reduction",
5534 return (ctx
== gimplify_omp_ctxp
5535 || (ctx
->region_type
== ORT_COMBINED_PARALLEL
5536 && gimplify_omp_ctxp
->outer_context
== ctx
));
5539 if (ctx
->region_type
!= ORT_WORKSHARE
)
5541 else if (ctx
->outer_context
)
5542 return omp_is_private (ctx
->outer_context
, decl
);
5546 /* Return true if DECL is private within a parallel region
5547 that binds to the current construct's context or in parallel
5548 region's REDUCTION clause. */
5551 omp_check_private (struct gimplify_omp_ctx
*ctx
, tree decl
)
5557 ctx
= ctx
->outer_context
;
5559 return !(is_global_var (decl
)
5560 /* References might be private, but might be shared too. */
5561 || lang_hooks
.decls
.omp_privatize_by_reference (decl
));
5563 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
5565 return (n
->value
& GOVD_SHARED
) == 0;
5567 while (ctx
->region_type
== ORT_WORKSHARE
);
5571 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
5572 and previous omp contexts. */
5575 gimplify_scan_omp_clauses (tree
*list_p
, gimple_seq
*pre_p
,
5576 enum omp_region_type region_type
)
5578 struct gimplify_omp_ctx
*ctx
, *outer_ctx
;
5579 struct gimplify_ctx gctx
;
5582 ctx
= new_omp_context (region_type
);
5583 outer_ctx
= ctx
->outer_context
;
5585 while ((c
= *list_p
) != NULL
)
5587 bool remove
= false;
5588 bool notice_outer
= true;
5589 const char *check_non_private
= NULL
;
5593 switch (OMP_CLAUSE_CODE (c
))
5595 case OMP_CLAUSE_PRIVATE
:
5596 flags
= GOVD_PRIVATE
| GOVD_EXPLICIT
;
5597 if (lang_hooks
.decls
.omp_private_outer_ref (OMP_CLAUSE_DECL (c
)))
5599 flags
|= GOVD_PRIVATE_OUTER_REF
;
5600 OMP_CLAUSE_PRIVATE_OUTER_REF (c
) = 1;
5603 notice_outer
= false;
5605 case OMP_CLAUSE_SHARED
:
5606 flags
= GOVD_SHARED
| GOVD_EXPLICIT
;
5608 case OMP_CLAUSE_FIRSTPRIVATE
:
5609 flags
= GOVD_FIRSTPRIVATE
| GOVD_EXPLICIT
;
5610 check_non_private
= "firstprivate";
5612 case OMP_CLAUSE_LASTPRIVATE
:
5613 flags
= GOVD_LASTPRIVATE
| GOVD_SEEN
| GOVD_EXPLICIT
;
5614 check_non_private
= "lastprivate";
5616 case OMP_CLAUSE_REDUCTION
:
5617 flags
= GOVD_REDUCTION
| GOVD_SEEN
| GOVD_EXPLICIT
;
5618 check_non_private
= "reduction";
5622 decl
= OMP_CLAUSE_DECL (c
);
5623 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
5628 omp_add_variable (ctx
, decl
, flags
);
5629 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
5630 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
))
5632 omp_add_variable (ctx
, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
),
5633 GOVD_LOCAL
| GOVD_SEEN
);
5634 gimplify_omp_ctxp
= ctx
;
5635 push_gimplify_context (&gctx
);
5637 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c
) = gimple_seq_alloc ();
5638 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c
) = gimple_seq_alloc ();
5640 gimplify_and_add (OMP_CLAUSE_REDUCTION_INIT (c
),
5641 &OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c
));
5642 pop_gimplify_context
5643 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c
)));
5644 push_gimplify_context (&gctx
);
5645 gimplify_and_add (OMP_CLAUSE_REDUCTION_MERGE (c
),
5646 &OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c
));
5647 pop_gimplify_context
5648 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c
)));
5649 OMP_CLAUSE_REDUCTION_INIT (c
) = NULL_TREE
;
5650 OMP_CLAUSE_REDUCTION_MERGE (c
) = NULL_TREE
;
5652 gimplify_omp_ctxp
= outer_ctx
;
5654 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
5655 && OMP_CLAUSE_LASTPRIVATE_STMT (c
))
5657 gimplify_omp_ctxp
= ctx
;
5658 push_gimplify_context (&gctx
);
5659 if (TREE_CODE (OMP_CLAUSE_LASTPRIVATE_STMT (c
)) != BIND_EXPR
)
5661 tree bind
= build3 (BIND_EXPR
, void_type_node
, NULL
,
5663 TREE_SIDE_EFFECTS (bind
) = 1;
5664 BIND_EXPR_BODY (bind
) = OMP_CLAUSE_LASTPRIVATE_STMT (c
);
5665 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = bind
;
5667 gimplify_and_add (OMP_CLAUSE_LASTPRIVATE_STMT (c
),
5668 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
));
5669 pop_gimplify_context
5670 (gimple_seq_first_stmt (OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
)));
5671 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = NULL_TREE
;
5673 gimplify_omp_ctxp
= outer_ctx
;
5679 case OMP_CLAUSE_COPYIN
:
5680 case OMP_CLAUSE_COPYPRIVATE
:
5681 decl
= OMP_CLAUSE_DECL (c
);
5682 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
5689 omp_notice_variable (outer_ctx
, decl
, true);
5690 if (check_non_private
5691 && region_type
== ORT_WORKSHARE
5692 && omp_check_private (ctx
, decl
))
5694 error ("%s variable %qE is private in outer context",
5695 check_non_private
, DECL_NAME (decl
));
5701 OMP_CLAUSE_OPERAND (c
, 0)
5702 = gimple_boolify (OMP_CLAUSE_OPERAND (c
, 0));
5705 case OMP_CLAUSE_SCHEDULE
:
5706 case OMP_CLAUSE_NUM_THREADS
:
5707 if (gimplify_expr (&OMP_CLAUSE_OPERAND (c
, 0), pre_p
, NULL
,
5708 is_gimple_val
, fb_rvalue
) == GS_ERROR
)
5712 case OMP_CLAUSE_NOWAIT
:
5713 case OMP_CLAUSE_ORDERED
:
5714 case OMP_CLAUSE_UNTIED
:
5715 case OMP_CLAUSE_COLLAPSE
:
5718 case OMP_CLAUSE_DEFAULT
:
5719 ctx
->default_kind
= OMP_CLAUSE_DEFAULT_KIND (c
);
5727 *list_p
= OMP_CLAUSE_CHAIN (c
);
5729 list_p
= &OMP_CLAUSE_CHAIN (c
);
5732 gimplify_omp_ctxp
= ctx
;
5735 /* For all variables that were not actually used within the context,
5736 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
5739 gimplify_adjust_omp_clauses_1 (splay_tree_node n
, void *data
)
5741 tree
*list_p
= (tree
*) data
;
5742 tree decl
= (tree
) n
->key
;
5743 unsigned flags
= n
->value
;
5744 enum omp_clause_code code
;
5748 if (flags
& (GOVD_EXPLICIT
| GOVD_LOCAL
))
5750 if ((flags
& GOVD_SEEN
) == 0)
5752 if (flags
& GOVD_DEBUG_PRIVATE
)
5754 gcc_assert ((flags
& GOVD_DATA_SHARE_CLASS
) == GOVD_PRIVATE
);
5755 private_debug
= true;
5759 = lang_hooks
.decls
.omp_private_debug_clause (decl
,
5760 !!(flags
& GOVD_SHARED
));
5762 code
= OMP_CLAUSE_PRIVATE
;
5763 else if (flags
& GOVD_SHARED
)
5765 if (is_global_var (decl
))
5767 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
->outer_context
;
5771 = splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
5772 if (on
&& (on
->value
& (GOVD_FIRSTPRIVATE
| GOVD_LASTPRIVATE
5773 | GOVD_PRIVATE
| GOVD_REDUCTION
)) != 0)
5775 ctx
= ctx
->outer_context
;
5780 code
= OMP_CLAUSE_SHARED
;
5782 else if (flags
& GOVD_PRIVATE
)
5783 code
= OMP_CLAUSE_PRIVATE
;
5784 else if (flags
& GOVD_FIRSTPRIVATE
)
5785 code
= OMP_CLAUSE_FIRSTPRIVATE
;
5789 clause
= build_omp_clause (input_location
, code
);
5790 OMP_CLAUSE_DECL (clause
) = decl
;
5791 OMP_CLAUSE_CHAIN (clause
) = *list_p
;
5793 OMP_CLAUSE_PRIVATE_DEBUG (clause
) = 1;
5794 else if (code
== OMP_CLAUSE_PRIVATE
&& (flags
& GOVD_PRIVATE_OUTER_REF
))
5795 OMP_CLAUSE_PRIVATE_OUTER_REF (clause
) = 1;
5797 lang_hooks
.decls
.omp_finish_clause (clause
);
5803 gimplify_adjust_omp_clauses (tree
*list_p
)
5805 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
5808 while ((c
= *list_p
) != NULL
)
5811 bool remove
= false;
5813 switch (OMP_CLAUSE_CODE (c
))
5815 case OMP_CLAUSE_PRIVATE
:
5816 case OMP_CLAUSE_SHARED
:
5817 case OMP_CLAUSE_FIRSTPRIVATE
:
5818 decl
= OMP_CLAUSE_DECL (c
);
5819 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
5820 remove
= !(n
->value
& GOVD_SEEN
);
5823 bool shared
= OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_SHARED
;
5824 if ((n
->value
& GOVD_DEBUG_PRIVATE
)
5825 || lang_hooks
.decls
.omp_private_debug_clause (decl
, shared
))
5827 gcc_assert ((n
->value
& GOVD_DEBUG_PRIVATE
) == 0
5828 || ((n
->value
& GOVD_DATA_SHARE_CLASS
)
5830 OMP_CLAUSE_SET_CODE (c
, OMP_CLAUSE_PRIVATE
);
5831 OMP_CLAUSE_PRIVATE_DEBUG (c
) = 1;
5836 case OMP_CLAUSE_LASTPRIVATE
:
5837 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
5838 accurately reflect the presence of a FIRSTPRIVATE clause. */
5839 decl
= OMP_CLAUSE_DECL (c
);
5840 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
5841 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c
)
5842 = (n
->value
& GOVD_FIRSTPRIVATE
) != 0;
5845 case OMP_CLAUSE_REDUCTION
:
5846 case OMP_CLAUSE_COPYIN
:
5847 case OMP_CLAUSE_COPYPRIVATE
:
5849 case OMP_CLAUSE_NUM_THREADS
:
5850 case OMP_CLAUSE_SCHEDULE
:
5851 case OMP_CLAUSE_NOWAIT
:
5852 case OMP_CLAUSE_ORDERED
:
5853 case OMP_CLAUSE_DEFAULT
:
5854 case OMP_CLAUSE_UNTIED
:
5855 case OMP_CLAUSE_COLLAPSE
:
5863 *list_p
= OMP_CLAUSE_CHAIN (c
);
5865 list_p
= &OMP_CLAUSE_CHAIN (c
);
5868 /* Add in any implicit data sharing. */
5869 splay_tree_foreach (ctx
->variables
, gimplify_adjust_omp_clauses_1
, list_p
);
5871 gimplify_omp_ctxp
= ctx
->outer_context
;
5872 delete_omp_context (ctx
);
5875 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
5876 gimplification of the body, as well as scanning the body for used
5877 variables. We need to do this scan now, because variable-sized
5878 decls will be decomposed during gimplification. */
5881 gimplify_omp_parallel (tree
*expr_p
, gimple_seq
*pre_p
)
5883 tree expr
= *expr_p
;
5885 gimple_seq body
= NULL
;
5886 struct gimplify_ctx gctx
;
5888 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
), pre_p
,
5889 OMP_PARALLEL_COMBINED (expr
)
5890 ? ORT_COMBINED_PARALLEL
5893 push_gimplify_context (&gctx
);
5895 g
= gimplify_and_return_first (OMP_PARALLEL_BODY (expr
), &body
);
5896 if (gimple_code (g
) == GIMPLE_BIND
)
5897 pop_gimplify_context (g
);
5899 pop_gimplify_context (NULL
);
5901 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
));
5903 g
= gimple_build_omp_parallel (body
,
5904 OMP_PARALLEL_CLAUSES (expr
),
5905 NULL_TREE
, NULL_TREE
);
5906 if (OMP_PARALLEL_COMBINED (expr
))
5907 gimple_omp_set_subcode (g
, GF_OMP_PARALLEL_COMBINED
);
5908 gimplify_seq_add_stmt (pre_p
, g
);
5909 *expr_p
= NULL_TREE
;
5912 /* Gimplify the contents of an OMP_TASK statement. This involves
5913 gimplification of the body, as well as scanning the body for used
5914 variables. We need to do this scan now, because variable-sized
5915 decls will be decomposed during gimplification. */
5918 gimplify_omp_task (tree
*expr_p
, gimple_seq
*pre_p
)
5920 tree expr
= *expr_p
;
5922 gimple_seq body
= NULL
;
5923 struct gimplify_ctx gctx
;
5925 gimplify_scan_omp_clauses (&OMP_TASK_CLAUSES (expr
), pre_p
, ORT_TASK
);
5927 push_gimplify_context (&gctx
);
5929 g
= gimplify_and_return_first (OMP_TASK_BODY (expr
), &body
);
5930 if (gimple_code (g
) == GIMPLE_BIND
)
5931 pop_gimplify_context (g
);
5933 pop_gimplify_context (NULL
);
5935 gimplify_adjust_omp_clauses (&OMP_TASK_CLAUSES (expr
));
5937 g
= gimple_build_omp_task (body
,
5938 OMP_TASK_CLAUSES (expr
),
5939 NULL_TREE
, NULL_TREE
,
5940 NULL_TREE
, NULL_TREE
, NULL_TREE
);
5941 gimplify_seq_add_stmt (pre_p
, g
);
5942 *expr_p
= NULL_TREE
;
5945 /* Gimplify the gross structure of an OMP_FOR statement. */
5947 static enum gimplify_status
5948 gimplify_omp_for (tree
*expr_p
, gimple_seq
*pre_p
)
5950 tree for_stmt
, decl
, var
, t
;
5951 enum gimplify_status ret
= GS_ALL_DONE
;
5952 enum gimplify_status tret
;
5954 gimple_seq for_body
, for_pre_body
;
5959 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
), pre_p
,
5962 /* Handle OMP_FOR_INIT. */
5963 for_pre_body
= NULL
;
5964 gimplify_and_add (OMP_FOR_PRE_BODY (for_stmt
), &for_pre_body
);
5965 OMP_FOR_PRE_BODY (for_stmt
) = NULL_TREE
;
5967 for_body
= gimple_seq_alloc ();
5968 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
))
5969 == TREE_VEC_LENGTH (OMP_FOR_COND (for_stmt
)));
5970 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
))
5971 == TREE_VEC_LENGTH (OMP_FOR_INCR (for_stmt
)));
5972 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)); i
++)
5974 t
= TREE_VEC_ELT (OMP_FOR_INIT (for_stmt
), i
);
5975 gcc_assert (TREE_CODE (t
) == MODIFY_EXPR
);
5976 decl
= TREE_OPERAND (t
, 0);
5977 gcc_assert (DECL_P (decl
));
5978 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl
))
5979 || POINTER_TYPE_P (TREE_TYPE (decl
)));
5981 /* Make sure the iteration variable is private. */
5982 if (omp_is_private (gimplify_omp_ctxp
, decl
))
5983 omp_notice_variable (gimplify_omp_ctxp
, decl
, true);
5985 omp_add_variable (gimplify_omp_ctxp
, decl
, GOVD_PRIVATE
| GOVD_SEEN
);
5987 /* If DECL is not a gimple register, create a temporary variable to act
5988 as an iteration counter. This is valid, since DECL cannot be
5989 modified in the body of the loop. */
5990 if (!is_gimple_reg (decl
))
5992 var
= create_tmp_var (TREE_TYPE (decl
), get_name (decl
));
5993 TREE_OPERAND (t
, 0) = var
;
5995 gimplify_seq_add_stmt (&for_body
, gimple_build_assign (decl
, var
));
5997 omp_add_variable (gimplify_omp_ctxp
, var
, GOVD_PRIVATE
| GOVD_SEEN
);
6002 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), &for_pre_body
, NULL
,
6003 is_gimple_val
, fb_rvalue
);
6004 ret
= MIN (ret
, tret
);
6005 if (ret
== GS_ERROR
)
6008 /* Handle OMP_FOR_COND. */
6009 t
= TREE_VEC_ELT (OMP_FOR_COND (for_stmt
), i
);
6010 gcc_assert (COMPARISON_CLASS_P (t
));
6011 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
6013 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), &for_pre_body
, NULL
,
6014 is_gimple_val
, fb_rvalue
);
6015 ret
= MIN (ret
, tret
);
6017 /* Handle OMP_FOR_INCR. */
6018 t
= TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
);
6019 switch (TREE_CODE (t
))
6021 case PREINCREMENT_EXPR
:
6022 case POSTINCREMENT_EXPR
:
6023 t
= build_int_cst (TREE_TYPE (decl
), 1);
6024 t
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), var
, t
);
6025 t
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, t
);
6026 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
) = t
;
6029 case PREDECREMENT_EXPR
:
6030 case POSTDECREMENT_EXPR
:
6031 t
= build_int_cst (TREE_TYPE (decl
), -1);
6032 t
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), var
, t
);
6033 t
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, t
);
6034 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
) = t
;
6038 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
6039 TREE_OPERAND (t
, 0) = var
;
6041 t
= TREE_OPERAND (t
, 1);
6042 switch (TREE_CODE (t
))
6045 if (TREE_OPERAND (t
, 1) == decl
)
6047 TREE_OPERAND (t
, 1) = TREE_OPERAND (t
, 0);
6048 TREE_OPERAND (t
, 0) = var
;
6054 case POINTER_PLUS_EXPR
:
6055 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
6056 TREE_OPERAND (t
, 0) = var
;
6062 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), &for_pre_body
, NULL
,
6063 is_gimple_val
, fb_rvalue
);
6064 ret
= MIN (ret
, tret
);
6071 if (var
!= decl
|| TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)) > 1)
6074 for (c
= OMP_FOR_CLAUSES (for_stmt
); c
; c
= OMP_CLAUSE_CHAIN (c
))
6075 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
6076 && OMP_CLAUSE_DECL (c
) == decl
6077 && OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
) == NULL
)
6079 t
= TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
);
6080 gcc_assert (TREE_CODE (t
) == MODIFY_EXPR
);
6081 gcc_assert (TREE_OPERAND (t
, 0) == var
);
6082 t
= TREE_OPERAND (t
, 1);
6083 gcc_assert (TREE_CODE (t
) == PLUS_EXPR
6084 || TREE_CODE (t
) == MINUS_EXPR
6085 || TREE_CODE (t
) == POINTER_PLUS_EXPR
);
6086 gcc_assert (TREE_OPERAND (t
, 0) == var
);
6087 t
= build2 (TREE_CODE (t
), TREE_TYPE (decl
), decl
,
6088 TREE_OPERAND (t
, 1));
6089 gimplify_assign (decl
, t
,
6090 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
));
6095 gimplify_and_add (OMP_FOR_BODY (for_stmt
), &for_body
);
6097 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
));
6099 gfor
= gimple_build_omp_for (for_body
, OMP_FOR_CLAUSES (for_stmt
),
6100 TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)),
6103 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)); i
++)
6105 t
= TREE_VEC_ELT (OMP_FOR_INIT (for_stmt
), i
);
6106 gimple_omp_for_set_index (gfor
, i
, TREE_OPERAND (t
, 0));
6107 gimple_omp_for_set_initial (gfor
, i
, TREE_OPERAND (t
, 1));
6108 t
= TREE_VEC_ELT (OMP_FOR_COND (for_stmt
), i
);
6109 gimple_omp_for_set_cond (gfor
, i
, TREE_CODE (t
));
6110 gimple_omp_for_set_final (gfor
, i
, TREE_OPERAND (t
, 1));
6111 t
= TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
);
6112 gimple_omp_for_set_incr (gfor
, i
, TREE_OPERAND (t
, 1));
6115 gimplify_seq_add_stmt (pre_p
, gfor
);
6116 return ret
== GS_ALL_DONE
? GS_ALL_DONE
: GS_ERROR
;
6119 /* Gimplify the gross structure of other OpenMP worksharing constructs.
6120 In particular, OMP_SECTIONS and OMP_SINGLE. */
6123 gimplify_omp_workshare (tree
*expr_p
, gimple_seq
*pre_p
)
6125 tree expr
= *expr_p
;
6127 gimple_seq body
= NULL
;
6129 gimplify_scan_omp_clauses (&OMP_CLAUSES (expr
), pre_p
, ORT_WORKSHARE
);
6130 gimplify_and_add (OMP_BODY (expr
), &body
);
6131 gimplify_adjust_omp_clauses (&OMP_CLAUSES (expr
));
6133 if (TREE_CODE (expr
) == OMP_SECTIONS
)
6134 stmt
= gimple_build_omp_sections (body
, OMP_CLAUSES (expr
));
6135 else if (TREE_CODE (expr
) == OMP_SINGLE
)
6136 stmt
= gimple_build_omp_single (body
, OMP_CLAUSES (expr
));
6140 gimplify_seq_add_stmt (pre_p
, stmt
);
6143 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
6144 stabilized the lhs of the atomic operation as *ADDR. Return true if
6145 EXPR is this stabilized form. */
6148 goa_lhs_expr_p (tree expr
, tree addr
)
6150 /* Also include casts to other type variants. The C front end is fond
6151 of adding these for e.g. volatile variables. This is like
6152 STRIP_TYPE_NOPS but includes the main variant lookup. */
6153 STRIP_USELESS_TYPE_CONVERSION (expr
);
6155 if (TREE_CODE (expr
) == INDIRECT_REF
)
6157 expr
= TREE_OPERAND (expr
, 0);
6159 && (CONVERT_EXPR_P (expr
)
6160 || TREE_CODE (expr
) == NON_LVALUE_EXPR
)
6161 && TREE_CODE (expr
) == TREE_CODE (addr
)
6162 && types_compatible_p (TREE_TYPE (expr
), TREE_TYPE (addr
)))
6164 expr
= TREE_OPERAND (expr
, 0);
6165 addr
= TREE_OPERAND (addr
, 0);
6169 return (TREE_CODE (addr
) == ADDR_EXPR
6170 && TREE_CODE (expr
) == ADDR_EXPR
6171 && TREE_OPERAND (addr
, 0) == TREE_OPERAND (expr
, 0));
6173 if (TREE_CODE (addr
) == ADDR_EXPR
&& expr
== TREE_OPERAND (addr
, 0))
6178 /* Walk *EXPR_P and replace
6179 appearances of *LHS_ADDR with LHS_VAR. If an expression does not involve
6180 the lhs, evaluate it into a temporary. Return 1 if the lhs appeared as
6181 a subexpression, 0 if it did not, or -1 if an error was encountered. */
6184 goa_stabilize_expr (tree
*expr_p
, gimple_seq
*pre_p
, tree lhs_addr
,
6187 tree expr
= *expr_p
;
6190 if (goa_lhs_expr_p (expr
, lhs_addr
))
6195 if (is_gimple_val (expr
))
6199 switch (TREE_CODE_CLASS (TREE_CODE (expr
)))
6202 case tcc_comparison
:
6203 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 1), pre_p
, lhs_addr
,
6206 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 0), pre_p
, lhs_addr
,
6209 case tcc_expression
:
6210 switch (TREE_CODE (expr
))
6212 case TRUTH_ANDIF_EXPR
:
6213 case TRUTH_ORIF_EXPR
:
6214 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 1), pre_p
,
6216 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 0), pre_p
,
6229 enum gimplify_status gs
;
6230 gs
= gimplify_expr (expr_p
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
);
6231 if (gs
!= GS_ALL_DONE
)
6239 /* Gimplify an OMP_ATOMIC statement. */
6241 static enum gimplify_status
6242 gimplify_omp_atomic (tree
*expr_p
, gimple_seq
*pre_p
)
6244 tree addr
= TREE_OPERAND (*expr_p
, 0);
6245 tree rhs
= TREE_OPERAND (*expr_p
, 1);
6246 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr
)));
6249 tmp_load
= create_tmp_var (type
, NULL
);
6250 if (TREE_CODE (type
) == COMPLEX_TYPE
|| TREE_CODE (type
) == VECTOR_TYPE
)
6251 DECL_GIMPLE_REG_P (tmp_load
) = 1;
6252 if (goa_stabilize_expr (&rhs
, pre_p
, addr
, tmp_load
) < 0)
6255 if (gimplify_expr (&addr
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
)
6259 gimplify_seq_add_stmt (pre_p
, gimple_build_omp_atomic_load (tmp_load
, addr
));
6260 if (gimplify_expr (&rhs
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
)
6263 gimplify_seq_add_stmt (pre_p
, gimple_build_omp_atomic_store (rhs
));
6270 /* Converts the GENERIC expression tree *EXPR_P to GIMPLE. If the
6271 expression produces a value to be used as an operand inside a GIMPLE
6272 statement, the value will be stored back in *EXPR_P. This value will
6273 be a tree of class tcc_declaration, tcc_constant, tcc_reference or
6274 an SSA_NAME. The corresponding sequence of GIMPLE statements is
6275 emitted in PRE_P and POST_P.
6277 Additionally, this process may overwrite parts of the input
6278 expression during gimplification. Ideally, it should be
6279 possible to do non-destructive gimplification.
6281 EXPR_P points to the GENERIC expression to convert to GIMPLE. If
6282 the expression needs to evaluate to a value to be used as
6283 an operand in a GIMPLE statement, this value will be stored in
6284 *EXPR_P on exit. This happens when the caller specifies one
6285 of fb_lvalue or fb_rvalue fallback flags.
6287 PRE_P will contain the sequence of GIMPLE statements corresponding
6288 to the evaluation of EXPR and all the side-effects that must
6289 be executed before the main expression. On exit, the last
6290 statement of PRE_P is the core statement being gimplified. For
6291 instance, when gimplifying 'if (++a)' the last statement in
6292 PRE_P will be 'if (t.1)' where t.1 is the result of
6293 pre-incrementing 'a'.
6295 POST_P will contain the sequence of GIMPLE statements corresponding
6296 to the evaluation of all the side-effects that must be executed
6297 after the main expression. If this is NULL, the post
6298 side-effects are stored at the end of PRE_P.
6300 The reason why the output is split in two is to handle post
6301 side-effects explicitly. In some cases, an expression may have
6302 inner and outer post side-effects which need to be emitted in
6303 an order different from the one given by the recursive
6304 traversal. For instance, for the expression (*p--)++ the post
6305 side-effects of '--' must actually occur *after* the post
6306 side-effects of '++'. However, gimplification will first visit
6307 the inner expression, so if a separate POST sequence was not
6308 used, the resulting sequence would be:
6315 However, the post-decrement operation in line #2 must not be
6316 evaluated until after the store to *p at line #4, so the
6317 correct sequence should be:
6324 So, by specifying a separate post queue, it is possible
6325 to emit the post side-effects in the correct order.
6326 If POST_P is NULL, an internal queue will be used. Before
6327 returning to the caller, the sequence POST_P is appended to
6328 the main output sequence PRE_P.
6330 GIMPLE_TEST_F points to a function that takes a tree T and
6331 returns nonzero if T is in the GIMPLE form requested by the
6332 caller. The GIMPLE predicates are in tree-gimple.c.
6334 FALLBACK tells the function what sort of a temporary we want if
6335 gimplification cannot produce an expression that complies with
6338 fb_none means that no temporary should be generated
6339 fb_rvalue means that an rvalue is OK to generate
6340 fb_lvalue means that an lvalue is OK to generate
6341 fb_either means that either is OK, but an lvalue is preferable.
6342 fb_mayfail means that gimplification may fail (in which case
6343 GS_ERROR will be returned)
6345 The return value is either GS_ERROR or GS_ALL_DONE, since this
6346 function iterates until EXPR is completely gimplified or an error
6349 enum gimplify_status
6350 gimplify_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
6351 bool (*gimple_test_f
) (tree
), fallback_t fallback
)
6354 gimple_seq internal_pre
= NULL
;
6355 gimple_seq internal_post
= NULL
;
6358 location_t saved_location
;
6359 enum gimplify_status ret
;
6360 gimple_stmt_iterator pre_last_gsi
, post_last_gsi
;
6362 save_expr
= *expr_p
;
6363 if (save_expr
== NULL_TREE
)
6366 /* If we are gimplifying a top-level statement, PRE_P must be valid. */
6367 is_statement
= gimple_test_f
== is_gimple_stmt
;
6371 /* Consistency checks. */
6372 if (gimple_test_f
== is_gimple_reg
)
6373 gcc_assert (fallback
& (fb_rvalue
| fb_lvalue
));
6374 else if (gimple_test_f
== is_gimple_val
6375 || gimple_test_f
== is_gimple_call_addr
6376 || gimple_test_f
== is_gimple_condexpr
6377 || gimple_test_f
== is_gimple_mem_rhs
6378 || gimple_test_f
== is_gimple_mem_rhs_or_call
6379 || gimple_test_f
== is_gimple_reg_rhs
6380 || gimple_test_f
== is_gimple_reg_rhs_or_call
6381 || gimple_test_f
== is_gimple_asm_val
)
6382 gcc_assert (fallback
& fb_rvalue
);
6383 else if (gimple_test_f
== is_gimple_min_lval
6384 || gimple_test_f
== is_gimple_lvalue
)
6385 gcc_assert (fallback
& fb_lvalue
);
6386 else if (gimple_test_f
== is_gimple_addressable
)
6387 gcc_assert (fallback
& fb_either
);
6388 else if (gimple_test_f
== is_gimple_stmt
)
6389 gcc_assert (fallback
== fb_none
);
6392 /* We should have recognized the GIMPLE_TEST_F predicate to
6393 know what kind of fallback to use in case a temporary is
6394 needed to hold the value or address of *EXPR_P. */
6398 /* We used to check the predicate here and return immediately if it
6399 succeeds. This is wrong; the design is for gimplification to be
6400 idempotent, and for the predicates to only test for valid forms, not
6401 whether they are fully simplified. */
6403 pre_p
= &internal_pre
;
6406 post_p
= &internal_post
;
6408 /* Remember the last statements added to PRE_P and POST_P. Every
6409 new statement added by the gimplification helpers needs to be
6410 annotated with location information. To centralize the
6411 responsibility, we remember the last statement that had been
6412 added to both queues before gimplifying *EXPR_P. If
6413 gimplification produces new statements in PRE_P and POST_P, those
6414 statements will be annotated with the same location information
6416 pre_last_gsi
= gsi_last (*pre_p
);
6417 post_last_gsi
= gsi_last (*post_p
);
6419 saved_location
= input_location
;
6420 if (save_expr
!= error_mark_node
6421 && EXPR_HAS_LOCATION (*expr_p
))
6422 input_location
= EXPR_LOCATION (*expr_p
);
6424 /* Loop over the specific gimplifiers until the toplevel node
6425 remains the same. */
6428 /* Strip away as many useless type conversions as possible
6430 STRIP_USELESS_TYPE_CONVERSION (*expr_p
);
6432 /* Remember the expr. */
6433 save_expr
= *expr_p
;
6435 /* Die, die, die, my darling. */
6436 if (save_expr
== error_mark_node
6437 || (TREE_TYPE (save_expr
)
6438 && TREE_TYPE (save_expr
) == error_mark_node
))
6444 /* Do any language-specific gimplification. */
6445 ret
= ((enum gimplify_status
)
6446 lang_hooks
.gimplify_expr (expr_p
, pre_p
, post_p
));
6449 if (*expr_p
== NULL_TREE
)
6451 if (*expr_p
!= save_expr
)
6454 else if (ret
!= GS_UNHANDLED
)
6458 switch (TREE_CODE (*expr_p
))
6460 /* First deal with the special cases. */
6462 case POSTINCREMENT_EXPR
:
6463 case POSTDECREMENT_EXPR
:
6464 case PREINCREMENT_EXPR
:
6465 case PREDECREMENT_EXPR
:
6466 ret
= gimplify_self_mod_expr (expr_p
, pre_p
, post_p
,
6467 fallback
!= fb_none
);
6471 case ARRAY_RANGE_REF
:
6475 case VIEW_CONVERT_EXPR
:
6476 ret
= gimplify_compound_lval (expr_p
, pre_p
, post_p
,
6477 fallback
? fallback
: fb_rvalue
);
6481 ret
= gimplify_cond_expr (expr_p
, pre_p
, fallback
);
6483 /* C99 code may assign to an array in a structure value of a
6484 conditional expression, and this has undefined behavior
6485 only on execution, so create a temporary if an lvalue is
6487 if (fallback
== fb_lvalue
)
6489 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
6490 mark_addressable (*expr_p
);
6495 ret
= gimplify_call_expr (expr_p
, pre_p
, fallback
!= fb_none
);
6497 /* C99 code may assign to an array in a structure returned
6498 from a function, and this has undefined behavior only on
6499 execution, so create a temporary if an lvalue is
6501 if (fallback
== fb_lvalue
)
6503 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
6504 mark_addressable (*expr_p
);
6512 ret
= gimplify_compound_expr (expr_p
, pre_p
, fallback
!= fb_none
);
6515 case COMPOUND_LITERAL_EXPR
:
6516 ret
= gimplify_compound_literal_expr (expr_p
, pre_p
);
6521 ret
= gimplify_modify_expr (expr_p
, pre_p
, post_p
,
6522 fallback
!= fb_none
);
6525 case TRUTH_ANDIF_EXPR
:
6526 case TRUTH_ORIF_EXPR
:
6527 /* Pass the source location of the outer expression. */
6528 ret
= gimplify_boolean_expr (expr_p
, saved_location
);
6531 case TRUTH_NOT_EXPR
:
6532 if (TREE_CODE (TREE_TYPE (*expr_p
)) != BOOLEAN_TYPE
)
6534 tree type
= TREE_TYPE (*expr_p
);
6535 *expr_p
= fold_convert (type
, gimple_boolify (*expr_p
));
6540 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
6541 is_gimple_val
, fb_rvalue
);
6542 recalculate_side_effects (*expr_p
);
6546 ret
= gimplify_addr_expr (expr_p
, pre_p
, post_p
);
6550 ret
= gimplify_va_arg_expr (expr_p
, pre_p
, post_p
);
6554 if (IS_EMPTY_STMT (*expr_p
))
6560 if (VOID_TYPE_P (TREE_TYPE (*expr_p
))
6561 || fallback
== fb_none
)
6563 /* Just strip a conversion to void (or in void context) and
6565 *expr_p
= TREE_OPERAND (*expr_p
, 0);
6569 ret
= gimplify_conversion (expr_p
);
6570 if (ret
== GS_ERROR
)
6572 if (*expr_p
!= save_expr
)
6576 case FIX_TRUNC_EXPR
:
6577 /* unary_expr: ... | '(' cast ')' val | ... */
6578 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
6579 is_gimple_val
, fb_rvalue
);
6580 recalculate_side_effects (*expr_p
);
6584 *expr_p
= fold_indirect_ref_loc (input_location
, *expr_p
);
6585 if (*expr_p
!= save_expr
)
6587 /* else fall through. */
6588 case ALIGN_INDIRECT_REF
:
6589 case MISALIGNED_INDIRECT_REF
:
6590 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
6591 is_gimple_reg
, fb_rvalue
);
6592 recalculate_side_effects (*expr_p
);
6595 /* Constants need not be gimplified. */
6606 /* If we require an lvalue, such as for ADDR_EXPR, retain the
6607 CONST_DECL node. Otherwise the decl is replaceable by its
6609 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
6610 if (fallback
& fb_lvalue
)
6613 *expr_p
= DECL_INITIAL (*expr_p
);
6617 ret
= gimplify_decl_expr (expr_p
, pre_p
);
6621 ret
= gimplify_bind_expr (expr_p
, pre_p
);
6625 ret
= gimplify_loop_expr (expr_p
, pre_p
);
6629 ret
= gimplify_switch_expr (expr_p
, pre_p
);
6633 ret
= gimplify_exit_expr (expr_p
);
6637 /* If the target is not LABEL, then it is a computed jump
6638 and the target needs to be gimplified. */
6639 if (TREE_CODE (GOTO_DESTINATION (*expr_p
)) != LABEL_DECL
)
6641 ret
= gimplify_expr (&GOTO_DESTINATION (*expr_p
), pre_p
,
6642 NULL
, is_gimple_val
, fb_rvalue
);
6643 if (ret
== GS_ERROR
)
6646 gimplify_seq_add_stmt (pre_p
,
6647 gimple_build_goto (GOTO_DESTINATION (*expr_p
)));
6651 gimplify_seq_add_stmt (pre_p
,
6652 gimple_build_predict (PREDICT_EXPR_PREDICTOR (*expr_p
),
6653 PREDICT_EXPR_OUTCOME (*expr_p
)));
6659 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p
))
6660 == current_function_decl
);
6661 gimplify_seq_add_stmt (pre_p
,
6662 gimple_build_label (LABEL_EXPR_LABEL (*expr_p
)));
6665 case CASE_LABEL_EXPR
:
6666 ret
= gimplify_case_label_expr (expr_p
, pre_p
);
6670 ret
= gimplify_return_expr (*expr_p
, pre_p
);
6674 /* Don't reduce this in place; let gimplify_init_constructor work its
6675 magic. Buf if we're just elaborating this for side effects, just
6676 gimplify any element that has side-effects. */
6677 if (fallback
== fb_none
)
6679 unsigned HOST_WIDE_INT ix
;
6680 constructor_elt
*ce
;
6681 tree temp
= NULL_TREE
;
6683 VEC_iterate (constructor_elt
, CONSTRUCTOR_ELTS (*expr_p
),
6686 if (TREE_SIDE_EFFECTS (ce
->value
))
6687 append_to_statement_list (ce
->value
, &temp
);
6692 /* C99 code may assign to an array in a constructed
6693 structure or union, and this has undefined behavior only
6694 on execution, so create a temporary if an lvalue is
6696 else if (fallback
== fb_lvalue
)
6698 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
6699 mark_addressable (*expr_p
);
6705 /* The following are special cases that are not handled by the
6706 original GIMPLE grammar. */
6708 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
6711 ret
= gimplify_save_expr (expr_p
, pre_p
, post_p
);
6716 enum gimplify_status r0
, r1
, r2
;
6718 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
6719 post_p
, is_gimple_lvalue
, fb_either
);
6720 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
,
6721 post_p
, is_gimple_val
, fb_rvalue
);
6722 r2
= gimplify_expr (&TREE_OPERAND (*expr_p
, 2), pre_p
,
6723 post_p
, is_gimple_val
, fb_rvalue
);
6724 recalculate_side_effects (*expr_p
);
6726 ret
= MIN (r0
, MIN (r1
, r2
));
6730 case TARGET_MEM_REF
:
6732 enum gimplify_status r0
= GS_ALL_DONE
, r1
= GS_ALL_DONE
;
6734 if (TMR_SYMBOL (*expr_p
))
6735 r0
= gimplify_expr (&TMR_SYMBOL (*expr_p
), pre_p
,
6736 post_p
, is_gimple_lvalue
, fb_either
);
6737 else if (TMR_BASE (*expr_p
))
6738 r0
= gimplify_expr (&TMR_BASE (*expr_p
), pre_p
,
6739 post_p
, is_gimple_val
, fb_either
);
6740 if (TMR_INDEX (*expr_p
))
6741 r1
= gimplify_expr (&TMR_INDEX (*expr_p
), pre_p
,
6742 post_p
, is_gimple_val
, fb_rvalue
);
6743 /* TMR_STEP and TMR_OFFSET are always integer constants. */
6748 case NON_LVALUE_EXPR
:
6749 /* This should have been stripped above. */
6753 ret
= gimplify_asm_expr (expr_p
, pre_p
, post_p
);
6756 case TRY_FINALLY_EXPR
:
6757 case TRY_CATCH_EXPR
:
6759 gimple_seq eval
, cleanup
;
6762 eval
= cleanup
= NULL
;
6763 gimplify_and_add (TREE_OPERAND (*expr_p
, 0), &eval
);
6764 gimplify_and_add (TREE_OPERAND (*expr_p
, 1), &cleanup
);
6765 /* Don't create bogus GIMPLE_TRY with empty cleanup. */
6766 if (gimple_seq_empty_p (cleanup
))
6768 gimple_seq_add_seq (pre_p
, eval
);
6772 try_
= gimple_build_try (eval
, cleanup
,
6773 TREE_CODE (*expr_p
) == TRY_FINALLY_EXPR
6774 ? GIMPLE_TRY_FINALLY
6775 : GIMPLE_TRY_CATCH
);
6776 if (TREE_CODE (*expr_p
) == TRY_CATCH_EXPR
)
6777 gimple_try_set_catch_is_cleanup (try_
,
6778 TRY_CATCH_IS_CLEANUP (*expr_p
));
6779 gimplify_seq_add_stmt (pre_p
, try_
);
6784 case CLEANUP_POINT_EXPR
:
6785 ret
= gimplify_cleanup_point_expr (expr_p
, pre_p
);
6789 ret
= gimplify_target_expr (expr_p
, pre_p
, post_p
);
6795 gimple_seq handler
= NULL
;
6796 gimplify_and_add (CATCH_BODY (*expr_p
), &handler
);
6797 c
= gimple_build_catch (CATCH_TYPES (*expr_p
), handler
);
6798 gimplify_seq_add_stmt (pre_p
, c
);
6803 case EH_FILTER_EXPR
:
6806 gimple_seq failure
= NULL
;
6808 gimplify_and_add (EH_FILTER_FAILURE (*expr_p
), &failure
);
6809 ehf
= gimple_build_eh_filter (EH_FILTER_TYPES (*expr_p
), failure
);
6810 gimple_set_no_warning (ehf
, TREE_NO_WARNING (*expr_p
));
6811 gimplify_seq_add_stmt (pre_p
, ehf
);
6818 enum gimplify_status r0
, r1
;
6819 r0
= gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p
), pre_p
,
6820 post_p
, is_gimple_val
, fb_rvalue
);
6821 r1
= gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p
), pre_p
,
6822 post_p
, is_gimple_val
, fb_rvalue
);
6823 TREE_SIDE_EFFECTS (*expr_p
) = 0;
6829 /* We get here when taking the address of a label. We mark
6830 the label as "forced"; meaning it can never be removed and
6831 it is a potential target for any computed goto. */
6832 FORCED_LABEL (*expr_p
) = 1;
6836 case STATEMENT_LIST
:
6837 ret
= gimplify_statement_list (expr_p
, pre_p
);
6840 case WITH_SIZE_EXPR
:
6842 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
6843 post_p
== &internal_post
? NULL
: post_p
,
6844 gimple_test_f
, fallback
);
6845 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
6846 is_gimple_val
, fb_rvalue
);
6852 ret
= gimplify_var_or_parm_decl (expr_p
);
6856 /* When within an OpenMP context, notice uses of variables. */
6857 if (gimplify_omp_ctxp
)
6858 omp_notice_variable (gimplify_omp_ctxp
, *expr_p
, true);
6863 /* Allow callbacks into the gimplifier during optimization. */
6868 gimplify_omp_parallel (expr_p
, pre_p
);
6873 gimplify_omp_task (expr_p
, pre_p
);
6878 ret
= gimplify_omp_for (expr_p
, pre_p
);
6883 gimplify_omp_workshare (expr_p
, pre_p
);
6892 gimple_seq body
= NULL
;
6895 gimplify_and_add (OMP_BODY (*expr_p
), &body
);
6896 switch (TREE_CODE (*expr_p
))
6899 g
= gimple_build_omp_section (body
);
6902 g
= gimple_build_omp_master (body
);
6905 g
= gimple_build_omp_ordered (body
);
6908 g
= gimple_build_omp_critical (body
,
6909 OMP_CRITICAL_NAME (*expr_p
));
6914 gimplify_seq_add_stmt (pre_p
, g
);
6920 ret
= gimplify_omp_atomic (expr_p
, pre_p
);
6923 case POINTER_PLUS_EXPR
:
6924 /* Convert ((type *)A)+offset into &A->field_of_type_and_offset.
6925 The second is gimple immediate saving a need for extra statement.
6927 if (TREE_CODE (TREE_OPERAND (*expr_p
, 1)) == INTEGER_CST
6928 && (tmp
= maybe_fold_offset_to_address
6929 (EXPR_LOCATION (*expr_p
),
6930 TREE_OPERAND (*expr_p
, 0), TREE_OPERAND (*expr_p
, 1),
6931 TREE_TYPE (*expr_p
))))
6936 /* Convert (void *)&a + 4 into (void *)&a[1]. */
6937 if (TREE_CODE (TREE_OPERAND (*expr_p
, 0)) == NOP_EXPR
6938 && TREE_CODE (TREE_OPERAND (*expr_p
, 1)) == INTEGER_CST
6939 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p
,
6941 && (tmp
= maybe_fold_offset_to_address
6942 (EXPR_LOCATION (*expr_p
),
6943 TREE_OPERAND (TREE_OPERAND (*expr_p
, 0), 0),
6944 TREE_OPERAND (*expr_p
, 1),
6945 TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p
, 0),
6948 *expr_p
= fold_convert (TREE_TYPE (*expr_p
), tmp
);
6954 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p
)))
6956 case tcc_comparison
:
6957 /* Handle comparison of objects of non scalar mode aggregates
6958 with a call to memcmp. It would be nice to only have to do
6959 this for variable-sized objects, but then we'd have to allow
6960 the same nest of reference nodes we allow for MODIFY_EXPR and
6963 Compare scalar mode aggregates as scalar mode values. Using
6964 memcmp for them would be very inefficient at best, and is
6965 plain wrong if bitfields are involved. */
6967 tree type
= TREE_TYPE (TREE_OPERAND (*expr_p
, 1));
6969 if (!AGGREGATE_TYPE_P (type
))
6971 else if (TYPE_MODE (type
) != BLKmode
)
6972 ret
= gimplify_scalar_mode_aggregate_compare (expr_p
);
6974 ret
= gimplify_variable_sized_compare (expr_p
);
6979 /* If *EXPR_P does not need to be special-cased, handle it
6980 according to its class. */
6982 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
6983 post_p
, is_gimple_val
, fb_rvalue
);
6989 enum gimplify_status r0
, r1
;
6991 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
6992 post_p
, is_gimple_val
, fb_rvalue
);
6993 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
,
6994 post_p
, is_gimple_val
, fb_rvalue
);
7000 case tcc_declaration
:
7003 goto dont_recalculate
;
7006 gcc_assert (TREE_CODE (*expr_p
) == TRUTH_AND_EXPR
7007 || TREE_CODE (*expr_p
) == TRUTH_OR_EXPR
7008 || TREE_CODE (*expr_p
) == TRUTH_XOR_EXPR
);
7012 recalculate_side_effects (*expr_p
);
7018 /* If we replaced *expr_p, gimplify again. */
7019 if (ret
== GS_OK
&& (*expr_p
== NULL
|| *expr_p
== save_expr
))
7022 while (ret
== GS_OK
);
7024 /* If we encountered an error_mark somewhere nested inside, either
7025 stub out the statement or propagate the error back out. */
7026 if (ret
== GS_ERROR
)
7033 /* This was only valid as a return value from the langhook, which
7034 we handled. Make sure it doesn't escape from any other context. */
7035 gcc_assert (ret
!= GS_UNHANDLED
);
7037 if (fallback
== fb_none
&& *expr_p
&& !is_gimple_stmt (*expr_p
))
7039 /* We aren't looking for a value, and we don't have a valid
7040 statement. If it doesn't have side-effects, throw it away. */
7041 if (!TREE_SIDE_EFFECTS (*expr_p
))
7043 else if (!TREE_THIS_VOLATILE (*expr_p
))
7045 /* This is probably a _REF that contains something nested that
7046 has side effects. Recurse through the operands to find it. */
7047 enum tree_code code
= TREE_CODE (*expr_p
);
7054 case VIEW_CONVERT_EXPR
:
7055 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
7056 gimple_test_f
, fallback
);
7060 case ARRAY_RANGE_REF
:
7061 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
7062 gimple_test_f
, fallback
);
7063 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
7064 gimple_test_f
, fallback
);
7068 /* Anything else with side-effects must be converted to
7069 a valid statement before we get here. */
7075 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p
))
7076 && TYPE_MODE (TREE_TYPE (*expr_p
)) != BLKmode
)
7078 /* Historically, the compiler has treated a bare reference
7079 to a non-BLKmode volatile lvalue as forcing a load. */
7080 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p
));
7082 /* Normally, we do not want to create a temporary for a
7083 TREE_ADDRESSABLE type because such a type should not be
7084 copied by bitwise-assignment. However, we make an
7085 exception here, as all we are doing here is ensuring that
7086 we read the bytes that make up the type. We use
7087 create_tmp_var_raw because create_tmp_var will abort when
7088 given a TREE_ADDRESSABLE type. */
7089 tree tmp
= create_tmp_var_raw (type
, "vol");
7090 gimple_add_tmp_var (tmp
);
7091 gimplify_assign (tmp
, *expr_p
, pre_p
);
7095 /* We can't do anything useful with a volatile reference to
7096 an incomplete type, so just throw it away. Likewise for
7097 a BLKmode type, since any implicit inner load should
7098 already have been turned into an explicit one by the
7099 gimplification process. */
7103 /* If we are gimplifying at the statement level, we're done. Tack
7104 everything together and return. */
7105 if (fallback
== fb_none
|| is_statement
)
7107 /* Since *EXPR_P has been converted into a GIMPLE tuple, clear
7108 it out for GC to reclaim it. */
7109 *expr_p
= NULL_TREE
;
7111 if (!gimple_seq_empty_p (internal_pre
)
7112 || !gimple_seq_empty_p (internal_post
))
7114 gimplify_seq_add_seq (&internal_pre
, internal_post
);
7115 gimplify_seq_add_seq (pre_p
, internal_pre
);
7118 /* The result of gimplifying *EXPR_P is going to be the last few
7119 statements in *PRE_P and *POST_P. Add location information
7120 to all the statements that were added by the gimplification
7122 if (!gimple_seq_empty_p (*pre_p
))
7123 annotate_all_with_location_after (*pre_p
, pre_last_gsi
, input_location
);
7125 if (!gimple_seq_empty_p (*post_p
))
7126 annotate_all_with_location_after (*post_p
, post_last_gsi
,
7132 #ifdef ENABLE_GIMPLE_CHECKING
7135 enum tree_code code
= TREE_CODE (*expr_p
);
7136 /* These expressions should already be in gimple IR form. */
7137 gcc_assert (code
!= MODIFY_EXPR
7139 && code
!= BIND_EXPR
7140 && code
!= CATCH_EXPR
7141 && (code
!= COND_EXPR
|| gimplify_ctxp
->allow_rhs_cond_expr
)
7142 && code
!= EH_FILTER_EXPR
7143 && code
!= GOTO_EXPR
7144 && code
!= LABEL_EXPR
7145 && code
!= LOOP_EXPR
7146 && code
!= SWITCH_EXPR
7147 && code
!= TRY_FINALLY_EXPR
7148 && code
!= OMP_CRITICAL
7150 && code
!= OMP_MASTER
7151 && code
!= OMP_ORDERED
7152 && code
!= OMP_PARALLEL
7153 && code
!= OMP_SECTIONS
7154 && code
!= OMP_SECTION
7155 && code
!= OMP_SINGLE
);
7159 /* Otherwise we're gimplifying a subexpression, so the resulting
7160 value is interesting. If it's a valid operand that matches
7161 GIMPLE_TEST_F, we're done. Unless we are handling some
7162 post-effects internally; if that's the case, we need to copy into
7163 a temporary before adding the post-effects to POST_P. */
7164 if (gimple_seq_empty_p (internal_post
) && (*gimple_test_f
) (*expr_p
))
7167 /* Otherwise, we need to create a new temporary for the gimplified
7170 /* We can't return an lvalue if we have an internal postqueue. The
7171 object the lvalue refers to would (probably) be modified by the
7172 postqueue; we need to copy the value out first, which means an
7174 if ((fallback
& fb_lvalue
)
7175 && gimple_seq_empty_p (internal_post
)
7176 && is_gimple_addressable (*expr_p
))
7178 /* An lvalue will do. Take the address of the expression, store it
7179 in a temporary, and replace the expression with an INDIRECT_REF of
7181 tmp
= build_fold_addr_expr_loc (input_location
, *expr_p
);
7182 gimplify_expr (&tmp
, pre_p
, post_p
, is_gimple_reg
, fb_rvalue
);
7183 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (tmp
)), tmp
);
7185 else if ((fallback
& fb_rvalue
) && is_gimple_reg_rhs_or_call (*expr_p
))
7187 /* An rvalue will do. Assign the gimplified expression into a
7188 new temporary TMP and replace the original expression with
7189 TMP. First, make sure that the expression has a type so that
7190 it can be assigned into a temporary. */
7191 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p
)));
7193 if (!gimple_seq_empty_p (internal_post
) || (fallback
& fb_lvalue
))
7194 /* The postqueue might change the value of the expression between
7195 the initialization and use of the temporary, so we can't use a
7196 formal temp. FIXME do we care? */
7198 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
7199 if (TREE_CODE (TREE_TYPE (*expr_p
)) == COMPLEX_TYPE
7200 || TREE_CODE (TREE_TYPE (*expr_p
)) == VECTOR_TYPE
)
7201 DECL_GIMPLE_REG_P (*expr_p
) = 1;
7204 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
7208 #ifdef ENABLE_GIMPLE_CHECKING
7209 if (!(fallback
& fb_mayfail
))
7211 fprintf (stderr
, "gimplification failed:\n");
7212 print_generic_expr (stderr
, *expr_p
, 0);
7213 debug_tree (*expr_p
);
7214 internal_error ("gimplification failed");
7217 gcc_assert (fallback
& fb_mayfail
);
7219 /* If this is an asm statement, and the user asked for the
7220 impossible, don't die. Fail and let gimplify_asm_expr
7226 /* Make sure the temporary matches our predicate. */
7227 gcc_assert ((*gimple_test_f
) (*expr_p
));
7229 if (!gimple_seq_empty_p (internal_post
))
7231 annotate_all_with_location (internal_post
, input_location
);
7232 gimplify_seq_add_seq (pre_p
, internal_post
);
7236 input_location
= saved_location
;
7240 /* Look through TYPE for variable-sized objects and gimplify each such
7241 size that we find. Add to LIST_P any statements generated. */
7244 gimplify_type_sizes (tree type
, gimple_seq
*list_p
)
7248 if (type
== NULL
|| type
== error_mark_node
)
7251 /* We first do the main variant, then copy into any other variants. */
7252 type
= TYPE_MAIN_VARIANT (type
);
7254 /* Avoid infinite recursion. */
7255 if (TYPE_SIZES_GIMPLIFIED (type
))
7258 TYPE_SIZES_GIMPLIFIED (type
) = 1;
7260 switch (TREE_CODE (type
))
7266 case FIXED_POINT_TYPE
:
7267 gimplify_one_sizepos (&TYPE_MIN_VALUE (type
), list_p
);
7268 gimplify_one_sizepos (&TYPE_MAX_VALUE (type
), list_p
);
7270 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
7272 TYPE_MIN_VALUE (t
) = TYPE_MIN_VALUE (type
);
7273 TYPE_MAX_VALUE (t
) = TYPE_MAX_VALUE (type
);
7278 /* These types may not have declarations, so handle them here. */
7279 gimplify_type_sizes (TREE_TYPE (type
), list_p
);
7280 gimplify_type_sizes (TYPE_DOMAIN (type
), list_p
);
7281 /* When not optimizing, ensure VLA bounds aren't removed. */
7283 && TYPE_DOMAIN (type
)
7284 && INTEGRAL_TYPE_P (TYPE_DOMAIN (type
)))
7286 t
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
7287 if (t
&& TREE_CODE (t
) == VAR_DECL
&& DECL_ARTIFICIAL (t
))
7288 DECL_IGNORED_P (t
) = 0;
7289 t
= TYPE_MAX_VALUE (TYPE_DOMAIN (type
));
7290 if (t
&& TREE_CODE (t
) == VAR_DECL
&& DECL_ARTIFICIAL (t
))
7291 DECL_IGNORED_P (t
) = 0;
7297 case QUAL_UNION_TYPE
:
7298 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
7299 if (TREE_CODE (field
) == FIELD_DECL
)
7301 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field
), list_p
);
7302 gimplify_one_sizepos (&DECL_SIZE (field
), list_p
);
7303 gimplify_one_sizepos (&DECL_SIZE_UNIT (field
), list_p
);
7304 gimplify_type_sizes (TREE_TYPE (field
), list_p
);
7309 case REFERENCE_TYPE
:
7310 /* We used to recurse on the pointed-to type here, which turned out to
7311 be incorrect because its definition might refer to variables not
7312 yet initialized at this point if a forward declaration is involved.
7314 It was actually useful for anonymous pointed-to types to ensure
7315 that the sizes evaluation dominates every possible later use of the
7316 values. Restricting to such types here would be safe since there
7317 is no possible forward declaration around, but would introduce an
7318 undesirable middle-end semantic to anonymity. We then defer to
7319 front-ends the responsibility of ensuring that the sizes are
7320 evaluated both early and late enough, e.g. by attaching artificial
7321 type declarations to the tree. */
7328 gimplify_one_sizepos (&TYPE_SIZE (type
), list_p
);
7329 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type
), list_p
);
7331 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
7333 TYPE_SIZE (t
) = TYPE_SIZE (type
);
7334 TYPE_SIZE_UNIT (t
) = TYPE_SIZE_UNIT (type
);
7335 TYPE_SIZES_GIMPLIFIED (t
) = 1;
7339 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
7340 a size or position, has had all of its SAVE_EXPRs evaluated.
7341 We add any required statements to *STMT_P. */
7344 gimplify_one_sizepos (tree
*expr_p
, gimple_seq
*stmt_p
)
7346 tree type
, expr
= *expr_p
;
7348 /* We don't do anything if the value isn't there, is constant, or contains
7349 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
7350 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
7351 will want to replace it with a new variable, but that will cause problems
7352 if this type is from outside the function. It's OK to have that here. */
7353 if (expr
== NULL_TREE
|| TREE_CONSTANT (expr
)
7354 || TREE_CODE (expr
) == VAR_DECL
7355 || CONTAINS_PLACEHOLDER_P (expr
))
7358 type
= TREE_TYPE (expr
);
7359 *expr_p
= unshare_expr (expr
);
7361 gimplify_expr (expr_p
, stmt_p
, NULL
, is_gimple_val
, fb_rvalue
);
7364 /* Verify that we've an exact type match with the original expression.
7365 In particular, we do not wish to drop a "sizetype" in favour of a
7366 type of similar dimensions. We don't want to pollute the generic
7367 type-stripping code with this knowledge because it doesn't matter
7368 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
7369 and friends retain their "sizetype-ness". */
7370 if (TREE_TYPE (expr
) != type
7371 && TREE_CODE (type
) == INTEGER_TYPE
7372 && TYPE_IS_SIZETYPE (type
))
7377 *expr_p
= create_tmp_var (type
, NULL
);
7378 tmp
= build1 (NOP_EXPR
, type
, expr
);
7379 stmt
= gimplify_assign (*expr_p
, tmp
, stmt_p
);
7380 if (EXPR_HAS_LOCATION (expr
))
7381 gimple_set_location (stmt
, EXPR_LOCATION (expr
));
7383 gimple_set_location (stmt
, input_location
);
7388 /* Gimplify the body of statements pointed to by BODY_P and return a
7389 GIMPLE_BIND containing the sequence of GIMPLE statements
7390 corresponding to BODY_P. FNDECL is the function decl containing
7394 gimplify_body (tree
*body_p
, tree fndecl
, bool do_parms
)
7396 location_t saved_location
= input_location
;
7397 gimple_seq parm_stmts
, seq
;
7399 struct gimplify_ctx gctx
;
7401 timevar_push (TV_TREE_GIMPLIFY
);
7403 /* Initialize for optimize_insn_for_s{ize,peed}_p possibly called during
7405 default_rtl_profile ();
7407 gcc_assert (gimplify_ctxp
== NULL
);
7408 push_gimplify_context (&gctx
);
7410 /* Unshare most shared trees in the body and in that of any nested functions.
7411 It would seem we don't have to do this for nested functions because
7412 they are supposed to be output and then the outer function gimplified
7413 first, but the g++ front end doesn't always do it that way. */
7414 unshare_body (body_p
, fndecl
);
7415 unvisit_body (body_p
, fndecl
);
7417 if (cgraph_node (fndecl
)->origin
)
7418 nonlocal_vlas
= pointer_set_create ();
7420 /* Make sure input_location isn't set to something weird. */
7421 input_location
= DECL_SOURCE_LOCATION (fndecl
);
7423 /* Resolve callee-copies. This has to be done before processing
7424 the body so that DECL_VALUE_EXPR gets processed correctly. */
7425 parm_stmts
= (do_parms
) ? gimplify_parameters () : NULL
;
7427 /* Gimplify the function's body. */
7429 gimplify_stmt (body_p
, &seq
);
7430 outer_bind
= gimple_seq_first_stmt (seq
);
7433 outer_bind
= gimple_build_nop ();
7434 gimplify_seq_add_stmt (&seq
, outer_bind
);
7437 /* The body must contain exactly one statement, a GIMPLE_BIND. If this is
7438 not the case, wrap everything in a GIMPLE_BIND to make it so. */
7439 if (gimple_code (outer_bind
) == GIMPLE_BIND
7440 && gimple_seq_first (seq
) == gimple_seq_last (seq
))
7443 outer_bind
= gimple_build_bind (NULL_TREE
, seq
, NULL
);
7445 *body_p
= NULL_TREE
;
7447 /* If we had callee-copies statements, insert them at the beginning
7449 if (!gimple_seq_empty_p (parm_stmts
))
7451 gimplify_seq_add_seq (&parm_stmts
, gimple_bind_body (outer_bind
));
7452 gimple_bind_set_body (outer_bind
, parm_stmts
);
7457 pointer_set_destroy (nonlocal_vlas
);
7458 nonlocal_vlas
= NULL
;
7461 pop_gimplify_context (outer_bind
);
7462 gcc_assert (gimplify_ctxp
== NULL
);
7464 #ifdef ENABLE_TYPES_CHECKING
7465 if (!errorcount
&& !sorrycount
)
7466 verify_types_in_gimple_seq (gimple_bind_body (outer_bind
));
7469 timevar_pop (TV_TREE_GIMPLIFY
);
7470 input_location
= saved_location
;
7475 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
7476 node for the function we want to gimplify.
7478 Returns the sequence of GIMPLE statements corresponding to the body
7482 gimplify_function_tree (tree fndecl
)
7484 tree oldfn
, parm
, ret
;
7488 gcc_assert (!gimple_body (fndecl
));
7490 oldfn
= current_function_decl
;
7491 current_function_decl
= fndecl
;
7492 if (DECL_STRUCT_FUNCTION (fndecl
))
7493 push_cfun (DECL_STRUCT_FUNCTION (fndecl
));
7495 push_struct_function (fndecl
);
7497 for (parm
= DECL_ARGUMENTS (fndecl
); parm
; parm
= TREE_CHAIN (parm
))
7499 /* Preliminarily mark non-addressed complex variables as eligible
7500 for promotion to gimple registers. We'll transform their uses
7502 if ((TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
7503 || TREE_CODE (TREE_TYPE (parm
)) == VECTOR_TYPE
)
7504 && !TREE_THIS_VOLATILE (parm
)
7505 && !needs_to_live_in_memory (parm
))
7506 DECL_GIMPLE_REG_P (parm
) = 1;
7509 ret
= DECL_RESULT (fndecl
);
7510 if ((TREE_CODE (TREE_TYPE (ret
)) == COMPLEX_TYPE
7511 || TREE_CODE (TREE_TYPE (ret
)) == VECTOR_TYPE
)
7512 && !needs_to_live_in_memory (ret
))
7513 DECL_GIMPLE_REG_P (ret
) = 1;
7515 bind
= gimplify_body (&DECL_SAVED_TREE (fndecl
), fndecl
, true);
7517 /* The tree body of the function is no longer needed, replace it
7518 with the new GIMPLE body. */
7519 seq
= gimple_seq_alloc ();
7520 gimple_seq_add_stmt (&seq
, bind
);
7521 gimple_set_body (fndecl
, seq
);
7523 /* If we're instrumenting function entry/exit, then prepend the call to
7524 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
7525 catch the exit hook. */
7526 /* ??? Add some way to ignore exceptions for this TFE. */
7527 if (flag_instrument_function_entry_exit
7528 && !DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl
)
7529 && !flag_instrument_functions_exclude_p (fndecl
))
7534 gimple_seq cleanup
= NULL
, body
= NULL
;
7536 x
= implicit_built_in_decls
[BUILT_IN_PROFILE_FUNC_EXIT
];
7537 gimplify_seq_add_stmt (&cleanup
, gimple_build_call (x
, 0));
7538 tf
= gimple_build_try (seq
, cleanup
, GIMPLE_TRY_FINALLY
);
7540 x
= implicit_built_in_decls
[BUILT_IN_PROFILE_FUNC_ENTER
];
7541 gimplify_seq_add_stmt (&body
, gimple_build_call (x
, 0));
7542 gimplify_seq_add_stmt (&body
, tf
);
7543 new_bind
= gimple_build_bind (NULL
, body
, gimple_bind_block (bind
));
7544 /* Clear the block for BIND, since it is no longer directly inside
7545 the function, but within a try block. */
7546 gimple_bind_set_block (bind
, NULL
);
7548 /* Replace the current function body with the body
7549 wrapped in the try/finally TF. */
7550 seq
= gimple_seq_alloc ();
7551 gimple_seq_add_stmt (&seq
, new_bind
);
7552 gimple_set_body (fndecl
, seq
);
7555 DECL_SAVED_TREE (fndecl
) = NULL_TREE
;
7556 cfun
->curr_properties
= PROP_gimple_any
;
7558 current_function_decl
= oldfn
;
7563 /* Some transformations like inlining may invalidate the GIMPLE form
7564 for operands. This function traverses all the operands in STMT and
7565 gimplifies anything that is not a valid gimple operand. Any new
7566 GIMPLE statements are inserted before *GSI_P. */
7569 gimple_regimplify_operands (gimple stmt
, gimple_stmt_iterator
*gsi_p
)
7572 tree orig_lhs
= NULL_TREE
, lhs
, t
;
7573 gimple_seq pre
= NULL
;
7574 gimple post_stmt
= NULL
;
7575 struct gimplify_ctx gctx
;
7577 push_gimplify_context (&gctx
);
7578 gimplify_ctxp
->into_ssa
= gimple_in_ssa_p (cfun
);
7580 switch (gimple_code (stmt
))
7583 gimplify_expr (gimple_cond_lhs_ptr (stmt
), &pre
, NULL
,
7584 is_gimple_val
, fb_rvalue
);
7585 gimplify_expr (gimple_cond_rhs_ptr (stmt
), &pre
, NULL
,
7586 is_gimple_val
, fb_rvalue
);
7589 gimplify_expr (gimple_switch_index_ptr (stmt
), &pre
, NULL
,
7590 is_gimple_val
, fb_rvalue
);
7592 case GIMPLE_OMP_ATOMIC_LOAD
:
7593 gimplify_expr (gimple_omp_atomic_load_rhs_ptr (stmt
), &pre
, NULL
,
7594 is_gimple_val
, fb_rvalue
);
7598 size_t i
, noutputs
= gimple_asm_noutputs (stmt
);
7599 const char *constraint
, **oconstraints
;
7600 bool allows_mem
, allows_reg
, is_inout
;
7603 = (const char **) alloca ((noutputs
) * sizeof (const char *));
7604 for (i
= 0; i
< noutputs
; i
++)
7606 tree op
= gimple_asm_output_op (stmt
, i
);
7607 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op
)));
7608 oconstraints
[i
] = constraint
;
7609 parse_output_constraint (&constraint
, i
, 0, 0, &allows_mem
,
7610 &allows_reg
, &is_inout
);
7611 gimplify_expr (&TREE_VALUE (op
), &pre
, NULL
,
7612 is_inout
? is_gimple_min_lval
: is_gimple_lvalue
,
7613 fb_lvalue
| fb_mayfail
);
7615 for (i
= 0; i
< gimple_asm_ninputs (stmt
); i
++)
7617 tree op
= gimple_asm_input_op (stmt
, i
);
7618 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op
)));
7619 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
7620 oconstraints
, &allows_mem
, &allows_reg
);
7621 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (op
))) && allows_mem
)
7623 if (!allows_reg
&& allows_mem
)
7624 gimplify_expr (&TREE_VALUE (op
), &pre
, NULL
,
7625 is_gimple_lvalue
, fb_lvalue
| fb_mayfail
);
7627 gimplify_expr (&TREE_VALUE (op
), &pre
, NULL
,
7628 is_gimple_asm_val
, fb_rvalue
);
7633 /* NOTE: We start gimplifying operands from last to first to
7634 make sure that side-effects on the RHS of calls, assignments
7635 and ASMs are executed before the LHS. The ordering is not
7636 important for other statements. */
7637 num_ops
= gimple_num_ops (stmt
);
7638 orig_lhs
= gimple_get_lhs (stmt
);
7639 for (i
= num_ops
; i
> 0; i
--)
7641 tree op
= gimple_op (stmt
, i
- 1);
7642 if (op
== NULL_TREE
)
7644 if (i
== 1 && (is_gimple_call (stmt
) || is_gimple_assign (stmt
)))
7645 gimplify_expr (&op
, &pre
, NULL
, is_gimple_lvalue
, fb_lvalue
);
7647 && is_gimple_assign (stmt
)
7649 && get_gimple_rhs_class (gimple_expr_code (stmt
))
7650 == GIMPLE_SINGLE_RHS
)
7651 gimplify_expr (&op
, &pre
, NULL
,
7652 rhs_predicate_for (gimple_assign_lhs (stmt
)),
7654 else if (i
== 2 && is_gimple_call (stmt
))
7656 if (TREE_CODE (op
) == FUNCTION_DECL
)
7658 gimplify_expr (&op
, &pre
, NULL
, is_gimple_call_addr
, fb_rvalue
);
7661 gimplify_expr (&op
, &pre
, NULL
, is_gimple_val
, fb_rvalue
);
7662 gimple_set_op (stmt
, i
- 1, op
);
7665 lhs
= gimple_get_lhs (stmt
);
7666 /* If the LHS changed it in a way that requires a simple RHS,
7667 create temporary. */
7668 if (lhs
&& !is_gimple_reg (lhs
))
7670 bool need_temp
= false;
7672 if (is_gimple_assign (stmt
)
7674 && get_gimple_rhs_class (gimple_expr_code (stmt
))
7675 == GIMPLE_SINGLE_RHS
)
7676 gimplify_expr (gimple_assign_rhs1_ptr (stmt
), &pre
, NULL
,
7677 rhs_predicate_for (gimple_assign_lhs (stmt
)),
7679 else if (is_gimple_reg (lhs
))
7681 if (is_gimple_reg_type (TREE_TYPE (lhs
)))
7683 if (is_gimple_call (stmt
))
7685 i
= gimple_call_flags (stmt
);
7686 if ((i
& ECF_LOOPING_CONST_OR_PURE
)
7687 || !(i
& (ECF_CONST
| ECF_PURE
)))
7690 if (stmt_can_throw_internal (stmt
))
7696 if (is_gimple_reg_type (TREE_TYPE (lhs
)))
7698 else if (TYPE_MODE (TREE_TYPE (lhs
)) != BLKmode
)
7700 if (is_gimple_call (stmt
))
7702 tree fndecl
= gimple_call_fndecl (stmt
);
7704 if (!aggregate_value_p (TREE_TYPE (lhs
), fndecl
)
7705 && !(fndecl
&& DECL_RESULT (fndecl
)
7706 && DECL_BY_REFERENCE (DECL_RESULT (fndecl
))))
7715 tree temp
= create_tmp_var (TREE_TYPE (lhs
), NULL
);
7717 if (TREE_CODE (TREE_TYPE (lhs
)) == COMPLEX_TYPE
7718 || TREE_CODE (TREE_TYPE (lhs
)) == VECTOR_TYPE
)
7719 DECL_GIMPLE_REG_P (temp
) = 1;
7720 if (TREE_CODE (orig_lhs
) == SSA_NAME
)
7721 orig_lhs
= SSA_NAME_VAR (orig_lhs
);
7723 if (gimple_in_ssa_p (cfun
))
7724 temp
= make_ssa_name (temp
, NULL
);
7725 gimple_set_lhs (stmt
, temp
);
7726 post_stmt
= gimple_build_assign (lhs
, temp
);
7727 if (TREE_CODE (lhs
) == SSA_NAME
)
7728 SSA_NAME_DEF_STMT (lhs
) = post_stmt
;
7734 if (gimple_referenced_vars (cfun
))
7735 for (t
= gimplify_ctxp
->temps
; t
; t
= TREE_CHAIN (t
))
7736 add_referenced_var (t
);
7738 if (!gimple_seq_empty_p (pre
))
7740 if (gimple_in_ssa_p (cfun
))
7742 gimple_stmt_iterator i
;
7744 for (i
= gsi_start (pre
); !gsi_end_p (i
); gsi_next (&i
))
7745 mark_symbols_for_renaming (gsi_stmt (i
));
7747 gsi_insert_seq_before (gsi_p
, pre
, GSI_SAME_STMT
);
7750 gsi_insert_after (gsi_p
, post_stmt
, GSI_NEW_STMT
);
7752 pop_gimplify_context (NULL
);
7756 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
7757 force the result to be either ssa_name or an invariant, otherwise
7758 just force it to be a rhs expression. If VAR is not NULL, make the
7759 base variable of the final destination be VAR if suitable. */
7762 force_gimple_operand (tree expr
, gimple_seq
*stmts
, bool simple
, tree var
)
7765 enum gimplify_status ret
;
7766 gimple_predicate gimple_test_f
;
7767 struct gimplify_ctx gctx
;
7771 if (is_gimple_val (expr
))
7774 gimple_test_f
= simple
? is_gimple_val
: is_gimple_reg_rhs
;
7776 push_gimplify_context (&gctx
);
7777 gimplify_ctxp
->into_ssa
= gimple_in_ssa_p (cfun
);
7778 gimplify_ctxp
->allow_rhs_cond_expr
= true;
7781 expr
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, expr
);
7783 if (TREE_CODE (expr
) != MODIFY_EXPR
7784 && TREE_TYPE (expr
) == void_type_node
)
7786 gimplify_and_add (expr
, stmts
);
7791 ret
= gimplify_expr (&expr
, stmts
, NULL
, gimple_test_f
, fb_rvalue
);
7792 gcc_assert (ret
!= GS_ERROR
);
7795 if (gimple_referenced_vars (cfun
))
7796 for (t
= gimplify_ctxp
->temps
; t
; t
= TREE_CHAIN (t
))
7797 add_referenced_var (t
);
7799 pop_gimplify_context (NULL
);
7804 /* Invokes force_gimple_operand for EXPR with parameters SIMPLE_P and VAR. If
7805 some statements are produced, emits them at GSI. If BEFORE is true.
7806 the statements are appended before GSI, otherwise they are appended after
7807 it. M specifies the way GSI moves after insertion (GSI_SAME_STMT or
7808 GSI_CONTINUE_LINKING are the usual values). */
7811 force_gimple_operand_gsi (gimple_stmt_iterator
*gsi
, tree expr
,
7812 bool simple_p
, tree var
, bool before
,
7813 enum gsi_iterator_update m
)
7817 expr
= force_gimple_operand (expr
, &stmts
, simple_p
, var
);
7819 if (!gimple_seq_empty_p (stmts
))
7821 if (gimple_in_ssa_p (cfun
))
7823 gimple_stmt_iterator i
;
7825 for (i
= gsi_start (stmts
); !gsi_end_p (i
); gsi_next (&i
))
7826 mark_symbols_for_renaming (gsi_stmt (i
));
7830 gsi_insert_seq_before (gsi
, stmts
, m
);
7832 gsi_insert_seq_after (gsi
, stmts
, m
);
7838 #include "gt-gimplify.h"