1 /* Tree lowering pass. This pass converts the GENERIC functions-as-trees
2 tree representation into the GIMPLE form.
3 Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
4 Free Software Foundation, Inc.
5 Major work done by Sebastian Pop <s.pop@laposte.net>,
6 Diego Novillo <dnovillo@redhat.com> and Jason Merrill <jason@redhat.com>.
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify it under
11 the terms of the GNU General Public License as published by the Free
12 Software Foundation; either version 3, or (at your option) any later
15 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
16 WARRANTY; without even the implied warranty of MERCHANTABILITY or
17 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
26 #include "coretypes.h"
32 #include "tree-iterator.h"
33 #include "tree-inline.h"
34 #include "diagnostic.h"
35 #include "langhooks.h"
36 #include "langhooks-def.h"
37 #include "tree-flow.h"
51 #include "pointer-set.h"
52 #include "splay-tree.h"
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
)
780 /* Same, but for a tree. */
783 tree_should_carry_location_p (const_tree stmt
)
785 /* Don't emit a line note for a label. We particularly don't want to
786 emit one for the break label, since it doesn't actually correspond
787 to the beginning of the loop/switch. */
788 if (TREE_CODE (stmt
) == LABEL_EXPR
)
791 /* Do not annotate empty statements, since it confuses gcov. */
792 if (!TREE_SIDE_EFFECTS (stmt
))
798 /* Return true if a location should not be emitted for this statement
799 by annotate_one_with_location. */
802 gimple_do_not_emit_location_p (gimple g
)
804 return gimple_plf (g
, GF_PLF_1
);
807 /* Mark statement G so a location will not be emitted by
808 annotate_one_with_location. */
811 gimple_set_do_not_emit_location (gimple g
)
813 /* The PLF flags are initialized to 0 when a new tuple is created,
814 so no need to initialize it anywhere. */
815 gimple_set_plf (g
, GF_PLF_1
, true);
818 /* Set the location for gimple statement GS to LOCATION. */
821 annotate_one_with_location (gimple gs
, location_t location
)
823 if (!gimple_has_location (gs
)
824 && !gimple_do_not_emit_location_p (gs
)
825 && should_carry_location_p (gs
))
826 gimple_set_location (gs
, location
);
829 /* Same, but for tree T. */
832 tree_annotate_one_with_location (tree t
, location_t location
)
834 if (CAN_HAVE_LOCATION_P (t
)
835 && ! EXPR_HAS_LOCATION (t
) && tree_should_carry_location_p (t
))
836 SET_EXPR_LOCATION (t
, location
);
840 /* Set LOCATION for all the statements after iterator GSI in sequence
841 SEQ. If GSI is pointing to the end of the sequence, start with the
842 first statement in SEQ. */
845 annotate_all_with_location_after (gimple_seq seq
, gimple_stmt_iterator gsi
,
849 gsi
= gsi_start (seq
);
853 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
854 annotate_one_with_location (gsi_stmt (gsi
), location
);
858 /* Set the location for all the statements in a sequence STMT_P to LOCATION. */
861 annotate_all_with_location (gimple_seq stmt_p
, location_t location
)
863 gimple_stmt_iterator i
;
865 if (gimple_seq_empty_p (stmt_p
))
868 for (i
= gsi_start (stmt_p
); !gsi_end_p (i
); gsi_next (&i
))
870 gimple gs
= gsi_stmt (i
);
871 annotate_one_with_location (gs
, location
);
875 /* Same, but for statement or statement list in *STMT_P. */
878 tree_annotate_all_with_location (tree
*stmt_p
, location_t location
)
880 tree_stmt_iterator i
;
885 for (i
= tsi_start (*stmt_p
); !tsi_end_p (i
); tsi_next (&i
))
887 tree t
= tsi_stmt (i
);
889 /* Assuming we've already been gimplified, we shouldn't
890 see nested chaining constructs anymore. */
891 gcc_assert (TREE_CODE (t
) != STATEMENT_LIST
892 && TREE_CODE (t
) != COMPOUND_EXPR
);
894 tree_annotate_one_with_location (t
, location
);
899 /* Similar to copy_tree_r() but do not copy SAVE_EXPR or TARGET_EXPR nodes.
900 These nodes model computations that should only be done once. If we
901 were to unshare something like SAVE_EXPR(i++), the gimplification
902 process would create wrong code. */
905 mostly_copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data
)
907 enum tree_code code
= TREE_CODE (*tp
);
908 /* Don't unshare types, decls, constants and SAVE_EXPR nodes. */
909 if (TREE_CODE_CLASS (code
) == tcc_type
910 || TREE_CODE_CLASS (code
) == tcc_declaration
911 || TREE_CODE_CLASS (code
) == tcc_constant
912 || code
== SAVE_EXPR
|| code
== TARGET_EXPR
913 /* We can't do anything sensible with a BLOCK used as an expression,
914 but we also can't just die when we see it because of non-expression
915 uses. So just avert our eyes and cross our fingers. Silly Java. */
920 gcc_assert (code
!= BIND_EXPR
);
921 copy_tree_r (tp
, walk_subtrees
, data
);
927 /* Callback for walk_tree to unshare most of the shared trees rooted at
928 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
929 then *TP is deep copied by calling copy_tree_r.
931 This unshares the same trees as copy_tree_r with the exception of
932 SAVE_EXPR nodes. These nodes model computations that should only be
933 done once. If we were to unshare something like SAVE_EXPR(i++), the
934 gimplification process would create wrong code. */
937 copy_if_shared_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
938 void *data ATTRIBUTE_UNUSED
)
941 enum tree_code code
= TREE_CODE (t
);
943 /* Skip types, decls, and constants. But we do want to look at their
944 types and the bounds of types. Mark them as visited so we properly
945 unmark their subtrees on the unmark pass. If we've already seen them,
946 don't look down further. */
947 if (TREE_CODE_CLASS (code
) == tcc_type
948 || TREE_CODE_CLASS (code
) == tcc_declaration
949 || TREE_CODE_CLASS (code
) == tcc_constant
)
951 if (TREE_VISITED (t
))
954 TREE_VISITED (t
) = 1;
957 /* If this node has been visited already, unshare it and don't look
959 else if (TREE_VISITED (t
))
961 walk_tree (tp
, mostly_copy_tree_r
, NULL
, NULL
);
965 /* Otherwise, mark the tree as visited and keep looking. */
967 TREE_VISITED (t
) = 1;
973 unmark_visited_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
974 void *data ATTRIBUTE_UNUSED
)
976 if (TREE_VISITED (*tp
))
977 TREE_VISITED (*tp
) = 0;
984 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
985 bodies of any nested functions if we are unsharing the entire body of
989 unshare_body (tree
*body_p
, tree fndecl
)
991 struct cgraph_node
*cgn
= cgraph_node (fndecl
);
993 walk_tree (body_p
, copy_if_shared_r
, NULL
, NULL
);
994 if (body_p
== &DECL_SAVED_TREE (fndecl
))
995 for (cgn
= cgn
->nested
; cgn
; cgn
= cgn
->next_nested
)
996 unshare_body (&DECL_SAVED_TREE (cgn
->decl
), cgn
->decl
);
999 /* Likewise, but mark all trees as not visited. */
1002 unvisit_body (tree
*body_p
, tree fndecl
)
1004 struct cgraph_node
*cgn
= cgraph_node (fndecl
);
1006 walk_tree (body_p
, unmark_visited_r
, NULL
, NULL
);
1007 if (body_p
== &DECL_SAVED_TREE (fndecl
))
1008 for (cgn
= cgn
->nested
; cgn
; cgn
= cgn
->next_nested
)
1009 unvisit_body (&DECL_SAVED_TREE (cgn
->decl
), cgn
->decl
);
1012 /* Unconditionally make an unshared copy of EXPR. This is used when using
1013 stored expressions which span multiple functions, such as BINFO_VTABLE,
1014 as the normal unsharing process can't tell that they're shared. */
1017 unshare_expr (tree expr
)
1019 walk_tree (&expr
, mostly_copy_tree_r
, NULL
, NULL
);
1023 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
1024 contain statements and have a value. Assign its value to a temporary
1025 and give it void_type_node. Returns the temporary, or NULL_TREE if
1026 WRAPPER was already void. */
1029 voidify_wrapper_expr (tree wrapper
, tree temp
)
1031 tree type
= TREE_TYPE (wrapper
);
1032 if (type
&& !VOID_TYPE_P (type
))
1036 /* Set p to point to the body of the wrapper. Loop until we find
1037 something that isn't a wrapper. */
1038 for (p
= &wrapper
; p
&& *p
; )
1040 switch (TREE_CODE (*p
))
1043 TREE_SIDE_EFFECTS (*p
) = 1;
1044 TREE_TYPE (*p
) = void_type_node
;
1045 /* For a BIND_EXPR, the body is operand 1. */
1046 p
= &BIND_EXPR_BODY (*p
);
1049 case CLEANUP_POINT_EXPR
:
1050 case TRY_FINALLY_EXPR
:
1051 case TRY_CATCH_EXPR
:
1052 TREE_SIDE_EFFECTS (*p
) = 1;
1053 TREE_TYPE (*p
) = void_type_node
;
1054 p
= &TREE_OPERAND (*p
, 0);
1057 case STATEMENT_LIST
:
1059 tree_stmt_iterator i
= tsi_last (*p
);
1060 TREE_SIDE_EFFECTS (*p
) = 1;
1061 TREE_TYPE (*p
) = void_type_node
;
1062 p
= tsi_end_p (i
) ? NULL
: tsi_stmt_ptr (i
);
1067 /* Advance to the last statement. Set all container types to void. */
1068 for (; TREE_CODE (*p
) == COMPOUND_EXPR
; p
= &TREE_OPERAND (*p
, 1))
1070 TREE_SIDE_EFFECTS (*p
) = 1;
1071 TREE_TYPE (*p
) = void_type_node
;
1081 if (p
== NULL
|| IS_EMPTY_STMT (*p
))
1085 /* The wrapper is on the RHS of an assignment that we're pushing
1087 gcc_assert (TREE_CODE (temp
) == INIT_EXPR
1088 || TREE_CODE (temp
) == MODIFY_EXPR
);
1089 TREE_OPERAND (temp
, 1) = *p
;
1094 temp
= create_tmp_var (type
, "retval");
1095 *p
= build2 (INIT_EXPR
, type
, temp
, *p
);
1104 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
1105 a temporary through which they communicate. */
1108 build_stack_save_restore (gimple
*save
, gimple
*restore
)
1112 *save
= gimple_build_call (implicit_built_in_decls
[BUILT_IN_STACK_SAVE
], 0);
1113 tmp_var
= create_tmp_var (ptr_type_node
, "saved_stack");
1114 gimple_call_set_lhs (*save
, tmp_var
);
1116 *restore
= gimple_build_call (implicit_built_in_decls
[BUILT_IN_STACK_RESTORE
],
1120 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
1122 static enum gimplify_status
1123 gimplify_bind_expr (tree
*expr_p
, gimple_seq
*pre_p
)
1125 tree bind_expr
= *expr_p
;
1126 bool old_save_stack
= gimplify_ctxp
->save_stack
;
1131 tree temp
= voidify_wrapper_expr (bind_expr
, NULL
);
1133 /* Mark variables seen in this bind expr. */
1134 for (t
= BIND_EXPR_VARS (bind_expr
); t
; t
= TREE_CHAIN (t
))
1136 if (TREE_CODE (t
) == VAR_DECL
)
1138 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
1140 /* Mark variable as local. */
1141 if (ctx
&& !is_global_var (t
)
1142 && (! DECL_SEEN_IN_BIND_EXPR_P (t
)
1143 || splay_tree_lookup (ctx
->variables
,
1144 (splay_tree_key
) t
) == NULL
))
1145 omp_add_variable (gimplify_omp_ctxp
, t
, GOVD_LOCAL
| GOVD_SEEN
);
1147 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
1149 if (DECL_HARD_REGISTER (t
) && !is_global_var (t
) && cfun
)
1150 cfun
->has_local_explicit_reg_vars
= true;
1153 /* Preliminarily mark non-addressed complex variables as eligible
1154 for promotion to gimple registers. We'll transform their uses
1156 We exclude complex types if not optimizing because they can be
1157 subject to partial stores in GNU C by means of the __real__ and
1158 __imag__ operators and we cannot promote them to total stores
1159 (see gimplify_modify_expr_complex_part). */
1161 && (TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
1162 || TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
1163 && !TREE_THIS_VOLATILE (t
)
1164 && (TREE_CODE (t
) == VAR_DECL
&& !DECL_HARD_REGISTER (t
))
1165 && !needs_to_live_in_memory (t
))
1166 DECL_GIMPLE_REG_P (t
) = 1;
1169 gimple_bind
= gimple_build_bind (BIND_EXPR_VARS (bind_expr
), NULL
,
1170 BIND_EXPR_BLOCK (bind_expr
));
1171 gimple_push_bind_expr (gimple_bind
);
1173 gimplify_ctxp
->save_stack
= false;
1175 /* Gimplify the body into the GIMPLE_BIND tuple's body. */
1177 gimplify_stmt (&BIND_EXPR_BODY (bind_expr
), &body
);
1178 gimple_bind_set_body (gimple_bind
, body
);
1180 if (gimplify_ctxp
->save_stack
)
1182 gimple stack_save
, stack_restore
, gs
;
1183 gimple_seq cleanup
, new_body
;
1185 /* Save stack on entry and restore it on exit. Add a try_finally
1186 block to achieve this. Note that mudflap depends on the
1187 format of the emitted code: see mx_register_decls(). */
1188 build_stack_save_restore (&stack_save
, &stack_restore
);
1190 cleanup
= new_body
= NULL
;
1191 gimplify_seq_add_stmt (&cleanup
, stack_restore
);
1192 gs
= gimple_build_try (gimple_bind_body (gimple_bind
), cleanup
,
1193 GIMPLE_TRY_FINALLY
);
1195 gimplify_seq_add_stmt (&new_body
, stack_save
);
1196 gimplify_seq_add_stmt (&new_body
, gs
);
1197 gimple_bind_set_body (gimple_bind
, new_body
);
1200 gimplify_ctxp
->save_stack
= old_save_stack
;
1201 gimple_pop_bind_expr ();
1203 gimplify_seq_add_stmt (pre_p
, gimple_bind
);
1211 *expr_p
= NULL_TREE
;
1215 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1216 GIMPLE value, it is assigned to a new temporary and the statement is
1217 re-written to return the temporary.
1219 PRE_P points to the sequence where side effects that must happen before
1220 STMT should be stored. */
1222 static enum gimplify_status
1223 gimplify_return_expr (tree stmt
, gimple_seq
*pre_p
)
1226 tree ret_expr
= TREE_OPERAND (stmt
, 0);
1227 tree result_decl
, result
;
1229 if (ret_expr
== error_mark_node
)
1233 || TREE_CODE (ret_expr
) == RESULT_DECL
1234 || ret_expr
== error_mark_node
)
1236 gimple ret
= gimple_build_return (ret_expr
);
1237 gimple_set_no_warning (ret
, TREE_NO_WARNING (stmt
));
1238 gimplify_seq_add_stmt (pre_p
, ret
);
1242 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
1243 result_decl
= NULL_TREE
;
1246 result_decl
= TREE_OPERAND (ret_expr
, 0);
1248 /* See through a return by reference. */
1249 if (TREE_CODE (result_decl
) == INDIRECT_REF
)
1250 result_decl
= TREE_OPERAND (result_decl
, 0);
1252 gcc_assert ((TREE_CODE (ret_expr
) == MODIFY_EXPR
1253 || TREE_CODE (ret_expr
) == INIT_EXPR
)
1254 && TREE_CODE (result_decl
) == RESULT_DECL
);
1257 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1258 Recall that aggregate_value_p is FALSE for any aggregate type that is
1259 returned in registers. If we're returning values in registers, then
1260 we don't want to extend the lifetime of the RESULT_DECL, particularly
1261 across another call. In addition, for those aggregates for which
1262 hard_function_value generates a PARALLEL, we'll die during normal
1263 expansion of structure assignments; there's special code in expand_return
1264 to handle this case that does not exist in expand_expr. */
1266 || aggregate_value_p (result_decl
, TREE_TYPE (current_function_decl
)))
1267 result
= result_decl
;
1268 else if (gimplify_ctxp
->return_temp
)
1269 result
= gimplify_ctxp
->return_temp
;
1272 result
= create_tmp_var (TREE_TYPE (result_decl
), NULL
);
1273 if (TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
1274 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
1275 DECL_GIMPLE_REG_P (result
) = 1;
1277 /* ??? With complex control flow (usually involving abnormal edges),
1278 we can wind up warning about an uninitialized value for this. Due
1279 to how this variable is constructed and initialized, this is never
1280 true. Give up and never warn. */
1281 TREE_NO_WARNING (result
) = 1;
1283 gimplify_ctxp
->return_temp
= result
;
1286 /* Smash the lhs of the MODIFY_EXPR to the temporary we plan to use.
1287 Then gimplify the whole thing. */
1288 if (result
!= result_decl
)
1289 TREE_OPERAND (ret_expr
, 0) = result
;
1291 gimplify_and_add (TREE_OPERAND (stmt
, 0), pre_p
);
1293 ret
= gimple_build_return (result
);
1294 gimple_set_no_warning (ret
, TREE_NO_WARNING (stmt
));
1295 gimplify_seq_add_stmt (pre_p
, ret
);
1301 gimplify_vla_decl (tree decl
, gimple_seq
*seq_p
)
1303 /* This is a variable-sized decl. Simplify its size and mark it
1304 for deferred expansion. Note that mudflap depends on the format
1305 of the emitted code: see mx_register_decls(). */
1306 tree t
, addr
, ptr_type
;
1308 gimplify_one_sizepos (&DECL_SIZE (decl
), seq_p
);
1309 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl
), seq_p
);
1311 /* All occurrences of this decl in final gimplified code will be
1312 replaced by indirection. Setting DECL_VALUE_EXPR does two
1313 things: First, it lets the rest of the gimplifier know what
1314 replacement to use. Second, it lets the debug info know
1315 where to find the value. */
1316 ptr_type
= build_pointer_type (TREE_TYPE (decl
));
1317 addr
= create_tmp_var (ptr_type
, get_name (decl
));
1318 DECL_IGNORED_P (addr
) = 0;
1319 t
= build_fold_indirect_ref (addr
);
1320 SET_DECL_VALUE_EXPR (decl
, t
);
1321 DECL_HAS_VALUE_EXPR_P (decl
) = 1;
1323 t
= built_in_decls
[BUILT_IN_ALLOCA
];
1324 t
= build_call_expr (t
, 1, DECL_SIZE_UNIT (decl
));
1325 t
= fold_convert (ptr_type
, t
);
1326 t
= build2 (MODIFY_EXPR
, TREE_TYPE (addr
), addr
, t
);
1328 gimplify_and_add (t
, seq_p
);
1330 /* Indicate that we need to restore the stack level when the
1331 enclosing BIND_EXPR is exited. */
1332 gimplify_ctxp
->save_stack
= true;
1336 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
1337 and initialization explicit. */
1339 static enum gimplify_status
1340 gimplify_decl_expr (tree
*stmt_p
, gimple_seq
*seq_p
)
1342 tree stmt
= *stmt_p
;
1343 tree decl
= DECL_EXPR_DECL (stmt
);
1345 *stmt_p
= NULL_TREE
;
1347 if (TREE_TYPE (decl
) == error_mark_node
)
1350 if ((TREE_CODE (decl
) == TYPE_DECL
1351 || TREE_CODE (decl
) == VAR_DECL
)
1352 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl
)))
1353 gimplify_type_sizes (TREE_TYPE (decl
), seq_p
);
1355 if (TREE_CODE (decl
) == VAR_DECL
&& !DECL_EXTERNAL (decl
))
1357 tree init
= DECL_INITIAL (decl
);
1359 if (TREE_CODE (DECL_SIZE_UNIT (decl
)) != INTEGER_CST
1360 || (!TREE_STATIC (decl
)
1361 && flag_stack_check
== GENERIC_STACK_CHECK
1362 && compare_tree_int (DECL_SIZE_UNIT (decl
),
1363 STACK_CHECK_MAX_VAR_SIZE
) > 0))
1364 gimplify_vla_decl (decl
, seq_p
);
1366 if (init
&& init
!= error_mark_node
)
1368 if (!TREE_STATIC (decl
))
1370 DECL_INITIAL (decl
) = NULL_TREE
;
1371 init
= build2 (INIT_EXPR
, void_type_node
, decl
, init
);
1372 gimplify_and_add (init
, seq_p
);
1376 /* We must still examine initializers for static variables
1377 as they may contain a label address. */
1378 walk_tree (&init
, force_labels_r
, NULL
, NULL
);
1381 /* Some front ends do not explicitly declare all anonymous
1382 artificial variables. We compensate here by declaring the
1383 variables, though it would be better if the front ends would
1384 explicitly declare them. */
1385 if (!DECL_SEEN_IN_BIND_EXPR_P (decl
)
1386 && DECL_ARTIFICIAL (decl
) && DECL_NAME (decl
) == NULL_TREE
)
1387 gimple_add_tmp_var (decl
);
1393 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1394 and replacing the LOOP_EXPR with goto, but if the loop contains an
1395 EXIT_EXPR, we need to append a label for it to jump to. */
1397 static enum gimplify_status
1398 gimplify_loop_expr (tree
*expr_p
, gimple_seq
*pre_p
)
1400 tree saved_label
= gimplify_ctxp
->exit_label
;
1401 tree start_label
= create_artificial_label (UNKNOWN_LOCATION
);
1403 gimplify_seq_add_stmt (pre_p
, gimple_build_label (start_label
));
1405 gimplify_ctxp
->exit_label
= NULL_TREE
;
1407 gimplify_and_add (LOOP_EXPR_BODY (*expr_p
), pre_p
);
1409 gimplify_seq_add_stmt (pre_p
, gimple_build_goto (start_label
));
1411 if (gimplify_ctxp
->exit_label
)
1412 gimplify_seq_add_stmt (pre_p
, gimple_build_label (gimplify_ctxp
->exit_label
));
1414 gimplify_ctxp
->exit_label
= saved_label
;
1420 /* Gimplifies a statement list onto a sequence. These may be created either
1421 by an enlightened front-end, or by shortcut_cond_expr. */
1423 static enum gimplify_status
1424 gimplify_statement_list (tree
*expr_p
, gimple_seq
*pre_p
)
1426 tree temp
= voidify_wrapper_expr (*expr_p
, NULL
);
1428 tree_stmt_iterator i
= tsi_start (*expr_p
);
1430 while (!tsi_end_p (i
))
1432 gimplify_stmt (tsi_stmt_ptr (i
), pre_p
);
1445 /* Compare two case labels. Because the front end should already have
1446 made sure that case ranges do not overlap, it is enough to only compare
1447 the CASE_LOW values of each case label. */
1450 compare_case_labels (const void *p1
, const void *p2
)
1452 const_tree
const case1
= *(const_tree
const*)p1
;
1453 const_tree
const case2
= *(const_tree
const*)p2
;
1455 /* The 'default' case label always goes first. */
1456 if (!CASE_LOW (case1
))
1458 else if (!CASE_LOW (case2
))
1461 return tree_int_cst_compare (CASE_LOW (case1
), CASE_LOW (case2
));
1465 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1468 sort_case_labels (VEC(tree
,heap
)* label_vec
)
1470 size_t len
= VEC_length (tree
, label_vec
);
1471 qsort (VEC_address (tree
, label_vec
), len
, sizeof (tree
),
1472 compare_case_labels
);
1476 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1479 static enum gimplify_status
1480 gimplify_switch_expr (tree
*expr_p
, gimple_seq
*pre_p
)
1482 tree switch_expr
= *expr_p
;
1483 gimple_seq switch_body_seq
= NULL
;
1484 enum gimplify_status ret
;
1486 ret
= gimplify_expr (&SWITCH_COND (switch_expr
), pre_p
, NULL
, is_gimple_val
,
1488 if (ret
== GS_ERROR
|| ret
== GS_UNHANDLED
)
1491 if (SWITCH_BODY (switch_expr
))
1493 VEC (tree
,heap
) *labels
;
1494 VEC (tree
,heap
) *saved_labels
;
1495 tree default_case
= NULL_TREE
;
1497 gimple gimple_switch
;
1499 /* If someone can be bothered to fill in the labels, they can
1500 be bothered to null out the body too. */
1501 gcc_assert (!SWITCH_LABELS (switch_expr
));
1503 /* save old labels, get new ones from body, then restore the old
1504 labels. Save all the things from the switch body to append after. */
1505 saved_labels
= gimplify_ctxp
->case_labels
;
1506 gimplify_ctxp
->case_labels
= VEC_alloc (tree
, heap
, 8);
1508 gimplify_stmt (&SWITCH_BODY (switch_expr
), &switch_body_seq
);
1509 labels
= gimplify_ctxp
->case_labels
;
1510 gimplify_ctxp
->case_labels
= saved_labels
;
1513 while (i
< VEC_length (tree
, labels
))
1515 tree elt
= VEC_index (tree
, labels
, i
);
1516 tree low
= CASE_LOW (elt
);
1517 bool remove_element
= FALSE
;
1521 /* Discard empty ranges. */
1522 tree high
= CASE_HIGH (elt
);
1523 if (high
&& tree_int_cst_lt (high
, low
))
1524 remove_element
= TRUE
;
1528 /* The default case must be the last label in the list. */
1529 gcc_assert (!default_case
);
1531 remove_element
= TRUE
;
1535 VEC_ordered_remove (tree
, labels
, i
);
1541 if (!VEC_empty (tree
, labels
))
1542 sort_case_labels (labels
);
1546 tree type
= TREE_TYPE (switch_expr
);
1548 /* If the switch has no default label, add one, so that we jump
1549 around the switch body. If the labels already cover the whole
1550 range of type, add the default label pointing to one of the
1552 if (type
== void_type_node
)
1553 type
= TREE_TYPE (SWITCH_COND (switch_expr
));
1555 && INTEGRAL_TYPE_P (type
)
1556 && TYPE_MIN_VALUE (type
)
1557 && TYPE_MAX_VALUE (type
)
1558 && tree_int_cst_equal (CASE_LOW (VEC_index (tree
, labels
, 0)),
1559 TYPE_MIN_VALUE (type
)))
1561 tree low
, high
= CASE_HIGH (VEC_index (tree
, labels
, len
- 1));
1563 high
= CASE_LOW (VEC_index (tree
, labels
, len
- 1));
1564 if (tree_int_cst_equal (high
, TYPE_MAX_VALUE (type
)))
1566 for (i
= 1; i
< len
; i
++)
1568 high
= CASE_LOW (VEC_index (tree
, labels
, i
));
1569 low
= CASE_HIGH (VEC_index (tree
, labels
, i
- 1));
1571 low
= CASE_LOW (VEC_index (tree
, labels
, i
- 1));
1572 if ((TREE_INT_CST_LOW (low
) + 1
1573 != TREE_INT_CST_LOW (high
))
1574 || (TREE_INT_CST_HIGH (low
)
1575 + (TREE_INT_CST_LOW (high
) == 0)
1576 != TREE_INT_CST_HIGH (high
)))
1580 default_case
= build3 (CASE_LABEL_EXPR
, void_type_node
,
1581 NULL_TREE
, NULL_TREE
,
1582 CASE_LABEL (VEC_index (tree
,
1592 = build3 (CASE_LABEL_EXPR
, void_type_node
,
1593 NULL_TREE
, NULL_TREE
,
1594 create_artificial_label (UNKNOWN_LOCATION
));
1595 new_default
= gimple_build_label (CASE_LABEL (default_case
));
1596 gimplify_seq_add_stmt (&switch_body_seq
, new_default
);
1600 gimple_switch
= gimple_build_switch_vec (SWITCH_COND (switch_expr
),
1601 default_case
, labels
);
1602 gimplify_seq_add_stmt (pre_p
, gimple_switch
);
1603 gimplify_seq_add_seq (pre_p
, switch_body_seq
);
1604 VEC_free(tree
, heap
, labels
);
1607 gcc_assert (SWITCH_LABELS (switch_expr
));
1613 static enum gimplify_status
1614 gimplify_case_label_expr (tree
*expr_p
, gimple_seq
*pre_p
)
1616 struct gimplify_ctx
*ctxp
;
1617 gimple gimple_label
;
1619 /* Invalid OpenMP programs can play Duff's Device type games with
1620 #pragma omp parallel. At least in the C front end, we don't
1621 detect such invalid branches until after gimplification. */
1622 for (ctxp
= gimplify_ctxp
; ; ctxp
= ctxp
->prev_context
)
1623 if (ctxp
->case_labels
)
1626 gimple_label
= gimple_build_label (CASE_LABEL (*expr_p
));
1627 VEC_safe_push (tree
, heap
, ctxp
->case_labels
, *expr_p
);
1628 gimplify_seq_add_stmt (pre_p
, gimple_label
);
1633 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1637 build_and_jump (tree
*label_p
)
1639 if (label_p
== NULL
)
1640 /* If there's nowhere to jump, just fall through. */
1643 if (*label_p
== NULL_TREE
)
1645 tree label
= create_artificial_label (UNKNOWN_LOCATION
);
1649 return build1 (GOTO_EXPR
, void_type_node
, *label_p
);
1652 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1653 This also involves building a label to jump to and communicating it to
1654 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1656 static enum gimplify_status
1657 gimplify_exit_expr (tree
*expr_p
)
1659 tree cond
= TREE_OPERAND (*expr_p
, 0);
1662 expr
= build_and_jump (&gimplify_ctxp
->exit_label
);
1663 expr
= build3 (COND_EXPR
, void_type_node
, cond
, expr
, NULL_TREE
);
1669 /* A helper function to be called via walk_tree. Mark all labels under *TP
1670 as being forced. To be called for DECL_INITIAL of static variables. */
1673 force_labels_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
1677 if (TREE_CODE (*tp
) == LABEL_DECL
)
1678 FORCED_LABEL (*tp
) = 1;
1683 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1684 different from its canonical type, wrap the whole thing inside a
1685 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1688 The canonical type of a COMPONENT_REF is the type of the field being
1689 referenced--unless the field is a bit-field which can be read directly
1690 in a smaller mode, in which case the canonical type is the
1691 sign-appropriate type corresponding to that mode. */
1694 canonicalize_component_ref (tree
*expr_p
)
1696 tree expr
= *expr_p
;
1699 gcc_assert (TREE_CODE (expr
) == COMPONENT_REF
);
1701 if (INTEGRAL_TYPE_P (TREE_TYPE (expr
)))
1702 type
= TREE_TYPE (get_unwidened (expr
, NULL_TREE
));
1704 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
1706 /* One could argue that all the stuff below is not necessary for
1707 the non-bitfield case and declare it a FE error if type
1708 adjustment would be needed. */
1709 if (TREE_TYPE (expr
) != type
)
1711 #ifdef ENABLE_TYPES_CHECKING
1712 tree old_type
= TREE_TYPE (expr
);
1716 /* We need to preserve qualifiers and propagate them from
1718 type_quals
= TYPE_QUALS (type
)
1719 | TYPE_QUALS (TREE_TYPE (TREE_OPERAND (expr
, 0)));
1720 if (TYPE_QUALS (type
) != type_quals
)
1721 type
= build_qualified_type (TYPE_MAIN_VARIANT (type
), type_quals
);
1723 /* Set the type of the COMPONENT_REF to the underlying type. */
1724 TREE_TYPE (expr
) = type
;
1726 #ifdef ENABLE_TYPES_CHECKING
1727 /* It is now a FE error, if the conversion from the canonical
1728 type to the original expression type is not useless. */
1729 gcc_assert (useless_type_conversion_p (old_type
, type
));
1734 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1735 to foo, embed that change in the ADDR_EXPR by converting
1740 where L is the lower bound. For simplicity, only do this for constant
1742 The constraint is that the type of &array[L] is trivially convertible
1746 canonicalize_addr_expr (tree
*expr_p
)
1748 tree expr
= *expr_p
;
1749 tree addr_expr
= TREE_OPERAND (expr
, 0);
1750 tree datype
, ddatype
, pddatype
;
1752 /* We simplify only conversions from an ADDR_EXPR to a pointer type. */
1753 if (!POINTER_TYPE_P (TREE_TYPE (expr
))
1754 || TREE_CODE (addr_expr
) != ADDR_EXPR
)
1757 /* The addr_expr type should be a pointer to an array. */
1758 datype
= TREE_TYPE (TREE_TYPE (addr_expr
));
1759 if (TREE_CODE (datype
) != ARRAY_TYPE
)
1762 /* The pointer to element type shall be trivially convertible to
1763 the expression pointer type. */
1764 ddatype
= TREE_TYPE (datype
);
1765 pddatype
= build_pointer_type (ddatype
);
1766 if (!useless_type_conversion_p (TYPE_MAIN_VARIANT (TREE_TYPE (expr
)),
1770 /* The lower bound and element sizes must be constant. */
1771 if (!TYPE_SIZE_UNIT (ddatype
)
1772 || TREE_CODE (TYPE_SIZE_UNIT (ddatype
)) != INTEGER_CST
1773 || !TYPE_DOMAIN (datype
) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))
1774 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))) != INTEGER_CST
)
1777 /* All checks succeeded. Build a new node to merge the cast. */
1778 *expr_p
= build4 (ARRAY_REF
, ddatype
, TREE_OPERAND (addr_expr
, 0),
1779 TYPE_MIN_VALUE (TYPE_DOMAIN (datype
)),
1780 NULL_TREE
, NULL_TREE
);
1781 *expr_p
= build1 (ADDR_EXPR
, pddatype
, *expr_p
);
1783 /* We can have stripped a required restrict qualifier above. */
1784 if (!useless_type_conversion_p (TREE_TYPE (expr
), TREE_TYPE (*expr_p
)))
1785 *expr_p
= fold_convert (TREE_TYPE (expr
), *expr_p
);
1788 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1789 underneath as appropriate. */
1791 static enum gimplify_status
1792 gimplify_conversion (tree
*expr_p
)
1795 location_t loc
= EXPR_LOCATION (*expr_p
);
1796 gcc_assert (CONVERT_EXPR_P (*expr_p
));
1798 /* Then strip away all but the outermost conversion. */
1799 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p
, 0));
1801 /* And remove the outermost conversion if it's useless. */
1802 if (tree_ssa_useless_type_conversion (*expr_p
))
1803 *expr_p
= TREE_OPERAND (*expr_p
, 0);
1805 /* Attempt to avoid NOP_EXPR by producing reference to a subtype.
1806 For example this fold (subclass *)&A into &A->subclass avoiding
1807 a need for statement. */
1808 if (CONVERT_EXPR_P (*expr_p
)
1809 && POINTER_TYPE_P (TREE_TYPE (*expr_p
))
1810 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p
, 0)))
1811 && (tem
= maybe_fold_offset_to_address
1812 (EXPR_LOCATION (*expr_p
), TREE_OPERAND (*expr_p
, 0),
1813 integer_zero_node
, TREE_TYPE (*expr_p
))) != NULL_TREE
)
1816 /* If we still have a conversion at the toplevel,
1817 then canonicalize some constructs. */
1818 if (CONVERT_EXPR_P (*expr_p
))
1820 tree sub
= TREE_OPERAND (*expr_p
, 0);
1822 /* If a NOP conversion is changing the type of a COMPONENT_REF
1823 expression, then canonicalize its type now in order to expose more
1824 redundant conversions. */
1825 if (TREE_CODE (sub
) == COMPONENT_REF
)
1826 canonicalize_component_ref (&TREE_OPERAND (*expr_p
, 0));
1828 /* If a NOP conversion is changing a pointer to array of foo
1829 to a pointer to foo, embed that change in the ADDR_EXPR. */
1830 else if (TREE_CODE (sub
) == ADDR_EXPR
)
1831 canonicalize_addr_expr (expr_p
);
1834 /* If we have a conversion to a non-register type force the
1835 use of a VIEW_CONVERT_EXPR instead. */
1836 if (CONVERT_EXPR_P (*expr_p
) && !is_gimple_reg_type (TREE_TYPE (*expr_p
)))
1837 *expr_p
= fold_build1_loc (loc
, VIEW_CONVERT_EXPR
, TREE_TYPE (*expr_p
),
1838 TREE_OPERAND (*expr_p
, 0));
1843 /* Nonlocal VLAs seen in the current function. */
1844 static struct pointer_set_t
*nonlocal_vlas
;
1846 /* Gimplify a VAR_DECL or PARM_DECL. Returns GS_OK if we expanded a
1847 DECL_VALUE_EXPR, and it's worth re-examining things. */
1849 static enum gimplify_status
1850 gimplify_var_or_parm_decl (tree
*expr_p
)
1852 tree decl
= *expr_p
;
1854 /* ??? If this is a local variable, and it has not been seen in any
1855 outer BIND_EXPR, then it's probably the result of a duplicate
1856 declaration, for which we've already issued an error. It would
1857 be really nice if the front end wouldn't leak these at all.
1858 Currently the only known culprit is C++ destructors, as seen
1859 in g++.old-deja/g++.jason/binding.C. */
1860 if (TREE_CODE (decl
) == VAR_DECL
1861 && !DECL_SEEN_IN_BIND_EXPR_P (decl
)
1862 && !TREE_STATIC (decl
) && !DECL_EXTERNAL (decl
)
1863 && decl_function_context (decl
) == current_function_decl
)
1865 gcc_assert (errorcount
|| sorrycount
);
1869 /* When within an OpenMP context, notice uses of variables. */
1870 if (gimplify_omp_ctxp
&& omp_notice_variable (gimplify_omp_ctxp
, decl
, true))
1873 /* If the decl is an alias for another expression, substitute it now. */
1874 if (DECL_HAS_VALUE_EXPR_P (decl
))
1876 tree value_expr
= DECL_VALUE_EXPR (decl
);
1878 /* For referenced nonlocal VLAs add a decl for debugging purposes
1879 to the current function. */
1880 if (TREE_CODE (decl
) == VAR_DECL
1881 && TREE_CODE (DECL_SIZE_UNIT (decl
)) != INTEGER_CST
1882 && nonlocal_vlas
!= NULL
1883 && TREE_CODE (value_expr
) == INDIRECT_REF
1884 && TREE_CODE (TREE_OPERAND (value_expr
, 0)) == VAR_DECL
1885 && decl_function_context (decl
) != current_function_decl
)
1887 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
1888 while (ctx
&& ctx
->region_type
== ORT_WORKSHARE
)
1889 ctx
= ctx
->outer_context
;
1890 if (!ctx
&& !pointer_set_insert (nonlocal_vlas
, decl
))
1892 tree copy
= copy_node (decl
), block
;
1894 lang_hooks
.dup_lang_specific_decl (copy
);
1895 SET_DECL_RTL (copy
, NULL_RTX
);
1896 TREE_USED (copy
) = 1;
1897 block
= DECL_INITIAL (current_function_decl
);
1898 TREE_CHAIN (copy
) = BLOCK_VARS (block
);
1899 BLOCK_VARS (block
) = copy
;
1900 SET_DECL_VALUE_EXPR (copy
, unshare_expr (value_expr
));
1901 DECL_HAS_VALUE_EXPR_P (copy
) = 1;
1905 *expr_p
= unshare_expr (value_expr
);
1913 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1917 : min_lval '[' val ']'
1919 | compound_lval '[' val ']'
1920 | compound_lval '.' ID
1922 This is not part of the original SIMPLE definition, which separates
1923 array and member references, but it seems reasonable to handle them
1924 together. Also, this way we don't run into problems with union
1925 aliasing; gcc requires that for accesses through a union to alias, the
1926 union reference must be explicit, which was not always the case when we
1927 were splitting up array and member refs.
1929 PRE_P points to the sequence where side effects that must happen before
1930 *EXPR_P should be stored.
1932 POST_P points to the sequence where side effects that must happen after
1933 *EXPR_P should be stored. */
1935 static enum gimplify_status
1936 gimplify_compound_lval (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
1937 fallback_t fallback
)
1940 VEC(tree
,heap
) *stack
;
1941 enum gimplify_status ret
= GS_OK
, tret
;
1943 location_t loc
= EXPR_LOCATION (*expr_p
);
1945 /* Create a stack of the subexpressions so later we can walk them in
1946 order from inner to outer. */
1947 stack
= VEC_alloc (tree
, heap
, 10);
1949 /* We can handle anything that get_inner_reference can deal with. */
1950 for (p
= expr_p
; ; p
= &TREE_OPERAND (*p
, 0))
1953 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1954 if (TREE_CODE (*p
) == INDIRECT_REF
)
1955 *p
= fold_indirect_ref_loc (loc
, *p
);
1957 if (handled_component_p (*p
))
1959 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
1960 additional COMPONENT_REFs. */
1961 else if ((TREE_CODE (*p
) == VAR_DECL
|| TREE_CODE (*p
) == PARM_DECL
)
1962 && gimplify_var_or_parm_decl (p
) == GS_OK
)
1967 VEC_safe_push (tree
, heap
, stack
, *p
);
1970 gcc_assert (VEC_length (tree
, stack
));
1972 /* Now STACK is a stack of pointers to all the refs we've walked through
1973 and P points to the innermost expression.
1975 Java requires that we elaborated nodes in source order. That
1976 means we must gimplify the inner expression followed by each of
1977 the indices, in order. But we can't gimplify the inner
1978 expression until we deal with any variable bounds, sizes, or
1979 positions in order to deal with PLACEHOLDER_EXPRs.
1981 So we do this in three steps. First we deal with the annotations
1982 for any variables in the components, then we gimplify the base,
1983 then we gimplify any indices, from left to right. */
1984 for (i
= VEC_length (tree
, stack
) - 1; i
>= 0; i
--)
1986 tree t
= VEC_index (tree
, stack
, i
);
1988 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
1990 /* Gimplify the low bound and element type size and put them into
1991 the ARRAY_REF. If these values are set, they have already been
1993 if (TREE_OPERAND (t
, 2) == NULL_TREE
)
1995 tree low
= unshare_expr (array_ref_low_bound (t
));
1996 if (!is_gimple_min_invariant (low
))
1998 TREE_OPERAND (t
, 2) = low
;
1999 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
,
2000 post_p
, is_gimple_reg
,
2002 ret
= MIN (ret
, tret
);
2006 if (!TREE_OPERAND (t
, 3))
2008 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (t
, 0)));
2009 tree elmt_size
= unshare_expr (array_ref_element_size (t
));
2010 tree factor
= size_int (TYPE_ALIGN_UNIT (elmt_type
));
2012 /* Divide the element size by the alignment of the element
2014 elmt_size
= size_binop_loc (loc
, EXACT_DIV_EXPR
, elmt_size
, factor
);
2016 if (!is_gimple_min_invariant (elmt_size
))
2018 TREE_OPERAND (t
, 3) = elmt_size
;
2019 tret
= gimplify_expr (&TREE_OPERAND (t
, 3), pre_p
,
2020 post_p
, is_gimple_reg
,
2022 ret
= MIN (ret
, tret
);
2026 else if (TREE_CODE (t
) == COMPONENT_REF
)
2028 /* Set the field offset into T and gimplify it. */
2029 if (!TREE_OPERAND (t
, 2))
2031 tree offset
= unshare_expr (component_ref_field_offset (t
));
2032 tree field
= TREE_OPERAND (t
, 1);
2034 = size_int (DECL_OFFSET_ALIGN (field
) / BITS_PER_UNIT
);
2036 /* Divide the offset by its alignment. */
2037 offset
= size_binop_loc (loc
, EXACT_DIV_EXPR
, offset
, factor
);
2039 if (!is_gimple_min_invariant (offset
))
2041 TREE_OPERAND (t
, 2) = offset
;
2042 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
,
2043 post_p
, is_gimple_reg
,
2045 ret
= MIN (ret
, tret
);
2051 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
2052 so as to match the min_lval predicate. Failure to do so may result
2053 in the creation of large aggregate temporaries. */
2054 tret
= gimplify_expr (p
, pre_p
, post_p
, is_gimple_min_lval
,
2055 fallback
| fb_lvalue
);
2056 ret
= MIN (ret
, tret
);
2058 /* And finally, the indices and operands to BIT_FIELD_REF. During this
2059 loop we also remove any useless conversions. */
2060 for (; VEC_length (tree
, stack
) > 0; )
2062 tree t
= VEC_pop (tree
, stack
);
2064 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
2066 /* Gimplify the dimension. */
2067 if (!is_gimple_min_invariant (TREE_OPERAND (t
, 1)))
2069 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), pre_p
, post_p
,
2070 is_gimple_val
, fb_rvalue
);
2071 ret
= MIN (ret
, tret
);
2074 else if (TREE_CODE (t
) == BIT_FIELD_REF
)
2076 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), pre_p
, post_p
,
2077 is_gimple_val
, fb_rvalue
);
2078 ret
= MIN (ret
, tret
);
2079 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
2080 is_gimple_val
, fb_rvalue
);
2081 ret
= MIN (ret
, tret
);
2084 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t
, 0));
2086 /* The innermost expression P may have originally had
2087 TREE_SIDE_EFFECTS set which would have caused all the outer
2088 expressions in *EXPR_P leading to P to also have had
2089 TREE_SIDE_EFFECTS set. */
2090 recalculate_side_effects (t
);
2093 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
2094 if ((fallback
& fb_rvalue
) && TREE_CODE (*expr_p
) == COMPONENT_REF
)
2096 canonicalize_component_ref (expr_p
);
2097 ret
= MIN (ret
, GS_OK
);
2100 VEC_free (tree
, heap
, stack
);
2105 /* Gimplify the self modifying expression pointed to by EXPR_P
2108 PRE_P points to the list where side effects that must happen before
2109 *EXPR_P should be stored.
2111 POST_P points to the list where side effects that must happen after
2112 *EXPR_P should be stored.
2114 WANT_VALUE is nonzero iff we want to use the value of this expression
2115 in another expression. */
2117 static enum gimplify_status
2118 gimplify_self_mod_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
2121 enum tree_code code
;
2122 tree lhs
, lvalue
, rhs
, t1
;
2123 gimple_seq post
= NULL
, *orig_post_p
= post_p
;
2125 enum tree_code arith_code
;
2126 enum gimplify_status ret
;
2127 location_t loc
= EXPR_LOCATION (*expr_p
);
2129 code
= TREE_CODE (*expr_p
);
2131 gcc_assert (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
2132 || code
== PREINCREMENT_EXPR
|| code
== PREDECREMENT_EXPR
);
2134 /* Prefix or postfix? */
2135 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
2136 /* Faster to treat as prefix if result is not used. */
2137 postfix
= want_value
;
2141 /* For postfix, make sure the inner expression's post side effects
2142 are executed after side effects from this expression. */
2146 /* Add or subtract? */
2147 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
2148 arith_code
= PLUS_EXPR
;
2150 arith_code
= MINUS_EXPR
;
2152 /* Gimplify the LHS into a GIMPLE lvalue. */
2153 lvalue
= TREE_OPERAND (*expr_p
, 0);
2154 ret
= gimplify_expr (&lvalue
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
2155 if (ret
== GS_ERROR
)
2158 /* Extract the operands to the arithmetic operation. */
2160 rhs
= TREE_OPERAND (*expr_p
, 1);
2162 /* For postfix operator, we evaluate the LHS to an rvalue and then use
2163 that as the result value and in the postqueue operation. We also
2164 make sure to make lvalue a minimal lval, see
2165 gcc.c-torture/execute/20040313-1.c for an example where this matters. */
2168 if (!is_gimple_min_lval (lvalue
))
2170 mark_addressable (lvalue
);
2171 lvalue
= build_fold_addr_expr_loc (input_location
, lvalue
);
2172 gimplify_expr (&lvalue
, pre_p
, post_p
, is_gimple_val
, fb_rvalue
);
2173 lvalue
= build_fold_indirect_ref_loc (input_location
, lvalue
);
2175 ret
= gimplify_expr (&lhs
, pre_p
, post_p
, is_gimple_val
, fb_rvalue
);
2176 if (ret
== GS_ERROR
)
2180 /* For POINTERs increment, use POINTER_PLUS_EXPR. */
2181 if (POINTER_TYPE_P (TREE_TYPE (lhs
)))
2183 rhs
= fold_convert_loc (loc
, sizetype
, rhs
);
2184 if (arith_code
== MINUS_EXPR
)
2185 rhs
= fold_build1_loc (loc
, NEGATE_EXPR
, TREE_TYPE (rhs
), rhs
);
2186 arith_code
= POINTER_PLUS_EXPR
;
2189 t1
= build2 (arith_code
, TREE_TYPE (*expr_p
), lhs
, rhs
);
2193 gimplify_assign (lvalue
, t1
, orig_post_p
);
2194 gimplify_seq_add_seq (orig_post_p
, post
);
2200 *expr_p
= build2 (MODIFY_EXPR
, TREE_TYPE (lvalue
), lvalue
, t1
);
2206 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
2209 maybe_with_size_expr (tree
*expr_p
)
2211 tree expr
= *expr_p
;
2212 tree type
= TREE_TYPE (expr
);
2215 /* If we've already wrapped this or the type is error_mark_node, we can't do
2217 if (TREE_CODE (expr
) == WITH_SIZE_EXPR
2218 || type
== error_mark_node
)
2221 /* If the size isn't known or is a constant, we have nothing to do. */
2222 size
= TYPE_SIZE_UNIT (type
);
2223 if (!size
|| TREE_CODE (size
) == INTEGER_CST
)
2226 /* Otherwise, make a WITH_SIZE_EXPR. */
2227 size
= unshare_expr (size
);
2228 size
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (size
, expr
);
2229 *expr_p
= build2 (WITH_SIZE_EXPR
, type
, expr
, size
);
2233 /* Helper for gimplify_call_expr. Gimplify a single argument *ARG_P
2234 Store any side-effects in PRE_P. CALL_LOCATION is the location of
2237 static enum gimplify_status
2238 gimplify_arg (tree
*arg_p
, gimple_seq
*pre_p
, location_t call_location
)
2240 bool (*test
) (tree
);
2243 /* In general, we allow lvalues for function arguments to avoid
2244 extra overhead of copying large aggregates out of even larger
2245 aggregates into temporaries only to copy the temporaries to
2246 the argument list. Make optimizers happy by pulling out to
2247 temporaries those types that fit in registers. */
2248 if (is_gimple_reg_type (TREE_TYPE (*arg_p
)))
2249 test
= is_gimple_val
, fb
= fb_rvalue
;
2251 test
= is_gimple_lvalue
, fb
= fb_either
;
2253 /* If this is a variable sized type, we must remember the size. */
2254 maybe_with_size_expr (arg_p
);
2256 /* FIXME diagnostics: This will mess up gcc.dg/Warray-bounds.c. */
2257 /* Make sure arguments have the same location as the function call
2259 protected_set_expr_location (*arg_p
, call_location
);
2261 /* There is a sequence point before a function call. Side effects in
2262 the argument list must occur before the actual call. So, when
2263 gimplifying arguments, force gimplify_expr to use an internal
2264 post queue which is then appended to the end of PRE_P. */
2265 return gimplify_expr (arg_p
, pre_p
, NULL
, test
, fb
);
2269 /* Gimplify the CALL_EXPR node *EXPR_P into the GIMPLE sequence PRE_P.
2270 WANT_VALUE is true if the result of the call is desired. */
2272 static enum gimplify_status
2273 gimplify_call_expr (tree
*expr_p
, gimple_seq
*pre_p
, bool want_value
)
2275 tree fndecl
, parms
, p
;
2276 enum gimplify_status ret
;
2279 bool builtin_va_start_p
= FALSE
;
2280 location_t loc
= EXPR_LOCATION (*expr_p
);
2282 gcc_assert (TREE_CODE (*expr_p
) == CALL_EXPR
);
2284 /* For reliable diagnostics during inlining, it is necessary that
2285 every call_expr be annotated with file and line. */
2286 if (! EXPR_HAS_LOCATION (*expr_p
))
2287 SET_EXPR_LOCATION (*expr_p
, input_location
);
2289 /* This may be a call to a builtin function.
2291 Builtin function calls may be transformed into different
2292 (and more efficient) builtin function calls under certain
2293 circumstances. Unfortunately, gimplification can muck things
2294 up enough that the builtin expanders are not aware that certain
2295 transformations are still valid.
2297 So we attempt transformation/gimplification of the call before
2298 we gimplify the CALL_EXPR. At this time we do not manage to
2299 transform all calls in the same manner as the expanders do, but
2300 we do transform most of them. */
2301 fndecl
= get_callee_fndecl (*expr_p
);
2302 if (fndecl
&& DECL_BUILT_IN (fndecl
))
2304 tree new_tree
= fold_call_expr (input_location
, *expr_p
, !want_value
);
2306 if (new_tree
&& new_tree
!= *expr_p
)
2308 /* There was a transformation of this call which computes the
2309 same value, but in a more efficient way. Return and try
2315 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
2316 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_VA_START
)
2318 builtin_va_start_p
= TRUE
;
2319 if (call_expr_nargs (*expr_p
) < 2)
2321 error ("too few arguments to function %<va_start%>");
2322 *expr_p
= build_empty_stmt (EXPR_LOCATION (*expr_p
));
2326 if (fold_builtin_next_arg (*expr_p
, true))
2328 *expr_p
= build_empty_stmt (EXPR_LOCATION (*expr_p
));
2334 /* There is a sequence point before the call, so any side effects in
2335 the calling expression must occur before the actual call. Force
2336 gimplify_expr to use an internal post queue. */
2337 ret
= gimplify_expr (&CALL_EXPR_FN (*expr_p
), pre_p
, NULL
,
2338 is_gimple_call_addr
, fb_rvalue
);
2340 nargs
= call_expr_nargs (*expr_p
);
2342 /* Get argument types for verification. */
2343 fndecl
= get_callee_fndecl (*expr_p
);
2346 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
2347 else if (POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_FN (*expr_p
))))
2348 parms
= TYPE_ARG_TYPES (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (*expr_p
))));
2350 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
2351 p
= DECL_ARGUMENTS (fndecl
);
2356 for (i
= 0; i
< nargs
&& p
; i
++, p
= TREE_CHAIN (p
))
2359 /* If the last argument is __builtin_va_arg_pack () and it is not
2360 passed as a named argument, decrease the number of CALL_EXPR
2361 arguments and set instead the CALL_EXPR_VA_ARG_PACK flag. */
2364 && TREE_CODE (CALL_EXPR_ARG (*expr_p
, nargs
- 1)) == CALL_EXPR
)
2366 tree last_arg
= CALL_EXPR_ARG (*expr_p
, nargs
- 1);
2367 tree last_arg_fndecl
= get_callee_fndecl (last_arg
);
2370 && TREE_CODE (last_arg_fndecl
) == FUNCTION_DECL
2371 && DECL_BUILT_IN_CLASS (last_arg_fndecl
) == BUILT_IN_NORMAL
2372 && DECL_FUNCTION_CODE (last_arg_fndecl
) == BUILT_IN_VA_ARG_PACK
)
2374 tree call
= *expr_p
;
2377 *expr_p
= build_call_array_loc (loc
, TREE_TYPE (call
),
2378 CALL_EXPR_FN (call
),
2379 nargs
, CALL_EXPR_ARGP (call
));
2381 /* Copy all CALL_EXPR flags, location and block, except
2382 CALL_EXPR_VA_ARG_PACK flag. */
2383 CALL_EXPR_STATIC_CHAIN (*expr_p
) = CALL_EXPR_STATIC_CHAIN (call
);
2384 CALL_EXPR_TAILCALL (*expr_p
) = CALL_EXPR_TAILCALL (call
);
2385 CALL_EXPR_RETURN_SLOT_OPT (*expr_p
)
2386 = CALL_EXPR_RETURN_SLOT_OPT (call
);
2387 CALL_FROM_THUNK_P (*expr_p
) = CALL_FROM_THUNK_P (call
);
2388 CALL_CANNOT_INLINE_P (*expr_p
) = CALL_CANNOT_INLINE_P (call
);
2389 SET_EXPR_LOCATION (*expr_p
, EXPR_LOCATION (call
));
2390 TREE_BLOCK (*expr_p
) = TREE_BLOCK (call
);
2392 /* Set CALL_EXPR_VA_ARG_PACK. */
2393 CALL_EXPR_VA_ARG_PACK (*expr_p
) = 1;
2397 /* Finally, gimplify the function arguments. */
2400 for (i
= (PUSH_ARGS_REVERSED
? nargs
- 1 : 0);
2401 PUSH_ARGS_REVERSED
? i
>= 0 : i
< nargs
;
2402 PUSH_ARGS_REVERSED
? i
-- : i
++)
2404 enum gimplify_status t
;
2406 /* Avoid gimplifying the second argument to va_start, which needs to
2407 be the plain PARM_DECL. */
2408 if ((i
!= 1) || !builtin_va_start_p
)
2410 t
= gimplify_arg (&CALL_EXPR_ARG (*expr_p
, i
), pre_p
,
2411 EXPR_LOCATION (*expr_p
));
2419 /* Verify the function result. */
2420 if (want_value
&& fndecl
2421 && VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fndecl
))))
2423 error_at (loc
, "using result of function returning %<void%>");
2427 /* Try this again in case gimplification exposed something. */
2428 if (ret
!= GS_ERROR
)
2430 tree new_tree
= fold_call_expr (input_location
, *expr_p
, !want_value
);
2432 if (new_tree
&& new_tree
!= *expr_p
)
2434 /* There was a transformation of this call which computes the
2435 same value, but in a more efficient way. Return and try
2443 *expr_p
= error_mark_node
;
2447 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2448 decl. This allows us to eliminate redundant or useless
2449 calls to "const" functions. */
2450 if (TREE_CODE (*expr_p
) == CALL_EXPR
)
2452 int flags
= call_expr_flags (*expr_p
);
2453 if (flags
& (ECF_CONST
| ECF_PURE
)
2454 /* An infinite loop is considered a side effect. */
2455 && !(flags
& (ECF_LOOPING_CONST_OR_PURE
)))
2456 TREE_SIDE_EFFECTS (*expr_p
) = 0;
2459 /* If the value is not needed by the caller, emit a new GIMPLE_CALL
2460 and clear *EXPR_P. Otherwise, leave *EXPR_P in its gimplified
2461 form and delegate the creation of a GIMPLE_CALL to
2462 gimplify_modify_expr. This is always possible because when
2463 WANT_VALUE is true, the caller wants the result of this call into
2464 a temporary, which means that we will emit an INIT_EXPR in
2465 internal_get_tmp_var which will then be handled by
2466 gimplify_modify_expr. */
2469 /* The CALL_EXPR in *EXPR_P is already in GIMPLE form, so all we
2470 have to do is replicate it as a GIMPLE_CALL tuple. */
2471 call
= gimple_build_call_from_tree (*expr_p
);
2472 gimplify_seq_add_stmt (pre_p
, call
);
2473 *expr_p
= NULL_TREE
;
2479 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2480 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2482 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2483 condition is true or false, respectively. If null, we should generate
2484 our own to skip over the evaluation of this specific expression.
2486 LOCUS is the source location of the COND_EXPR.
2488 This function is the tree equivalent of do_jump.
2490 shortcut_cond_r should only be called by shortcut_cond_expr. */
2493 shortcut_cond_r (tree pred
, tree
*true_label_p
, tree
*false_label_p
,
2496 tree local_label
= NULL_TREE
;
2497 tree t
, expr
= NULL
;
2499 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2500 retain the shortcut semantics. Just insert the gotos here;
2501 shortcut_cond_expr will append the real blocks later. */
2502 if (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2504 location_t new_locus
;
2506 /* Turn if (a && b) into
2508 if (a); else goto no;
2509 if (b) goto yes; else goto no;
2512 if (false_label_p
== NULL
)
2513 false_label_p
= &local_label
;
2515 /* Keep the original source location on the first 'if'. */
2516 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), NULL
, false_label_p
, locus
);
2517 append_to_statement_list (t
, &expr
);
2519 /* Set the source location of the && on the second 'if'. */
2520 new_locus
= EXPR_HAS_LOCATION (pred
) ? EXPR_LOCATION (pred
) : locus
;
2521 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
, false_label_p
,
2523 append_to_statement_list (t
, &expr
);
2525 else if (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2527 location_t new_locus
;
2529 /* Turn if (a || b) into
2532 if (b) goto yes; else goto no;
2535 if (true_label_p
== NULL
)
2536 true_label_p
= &local_label
;
2538 /* Keep the original source location on the first 'if'. */
2539 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), true_label_p
, NULL
, locus
);
2540 append_to_statement_list (t
, &expr
);
2542 /* Set the source location of the || on the second 'if'. */
2543 new_locus
= EXPR_HAS_LOCATION (pred
) ? EXPR_LOCATION (pred
) : locus
;
2544 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
, false_label_p
,
2546 append_to_statement_list (t
, &expr
);
2548 else if (TREE_CODE (pred
) == COND_EXPR
)
2550 location_t new_locus
;
2552 /* As long as we're messing with gotos, turn if (a ? b : c) into
2554 if (b) goto yes; else goto no;
2556 if (c) goto yes; else goto no; */
2558 /* Keep the original source location on the first 'if'. Set the source
2559 location of the ? on the second 'if'. */
2560 new_locus
= EXPR_HAS_LOCATION (pred
) ? EXPR_LOCATION (pred
) : locus
;
2561 expr
= build3 (COND_EXPR
, void_type_node
, TREE_OPERAND (pred
, 0),
2562 shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2563 false_label_p
, locus
),
2564 shortcut_cond_r (TREE_OPERAND (pred
, 2), true_label_p
,
2565 false_label_p
, new_locus
));
2569 expr
= build3 (COND_EXPR
, void_type_node
, pred
,
2570 build_and_jump (true_label_p
),
2571 build_and_jump (false_label_p
));
2572 SET_EXPR_LOCATION (expr
, locus
);
2577 t
= build1 (LABEL_EXPR
, void_type_node
, local_label
);
2578 append_to_statement_list (t
, &expr
);
2584 /* Given a conditional expression EXPR with short-circuit boolean
2585 predicates using TRUTH_ANDIF_EXPR or TRUTH_ORIF_EXPR, break the
2586 predicate appart into the equivalent sequence of conditionals. */
2589 shortcut_cond_expr (tree expr
)
2591 tree pred
= TREE_OPERAND (expr
, 0);
2592 tree then_
= TREE_OPERAND (expr
, 1);
2593 tree else_
= TREE_OPERAND (expr
, 2);
2594 tree true_label
, false_label
, end_label
, t
;
2596 tree
*false_label_p
;
2597 bool emit_end
, emit_false
, jump_over_else
;
2598 bool then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2599 bool else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2601 /* First do simple transformations. */
2604 /* If there is no 'else', turn
2607 if (a) if (b) then c. */
2608 while (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2610 /* Keep the original source location on the first 'if'. */
2611 location_t locus
= EXPR_HAS_LOCATION (expr
)
2612 ? EXPR_LOCATION (expr
) : input_location
;
2613 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2614 /* Set the source location of the && on the second 'if'. */
2615 if (EXPR_HAS_LOCATION (pred
))
2616 SET_EXPR_LOCATION (expr
, EXPR_LOCATION (pred
));
2617 then_
= shortcut_cond_expr (expr
);
2618 then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2619 pred
= TREE_OPERAND (pred
, 0);
2620 expr
= build3 (COND_EXPR
, void_type_node
, pred
, then_
, NULL_TREE
);
2621 SET_EXPR_LOCATION (expr
, locus
);
2627 /* If there is no 'then', turn
2630 if (a); else if (b); else d. */
2631 while (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2633 /* Keep the original source location on the first 'if'. */
2634 location_t locus
= EXPR_HAS_LOCATION (expr
)
2635 ? EXPR_LOCATION (expr
) : input_location
;
2636 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2637 /* Set the source location of the || on the second 'if'. */
2638 if (EXPR_HAS_LOCATION (pred
))
2639 SET_EXPR_LOCATION (expr
, EXPR_LOCATION (pred
));
2640 else_
= shortcut_cond_expr (expr
);
2641 else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2642 pred
= TREE_OPERAND (pred
, 0);
2643 expr
= build3 (COND_EXPR
, void_type_node
, pred
, NULL_TREE
, else_
);
2644 SET_EXPR_LOCATION (expr
, locus
);
2648 /* If we're done, great. */
2649 if (TREE_CODE (pred
) != TRUTH_ANDIF_EXPR
2650 && TREE_CODE (pred
) != TRUTH_ORIF_EXPR
)
2653 /* Otherwise we need to mess with gotos. Change
2656 if (a); else goto no;
2659 and recursively gimplify the condition. */
2661 true_label
= false_label
= end_label
= NULL_TREE
;
2663 /* If our arms just jump somewhere, hijack those labels so we don't
2664 generate jumps to jumps. */
2667 && TREE_CODE (then_
) == GOTO_EXPR
2668 && TREE_CODE (GOTO_DESTINATION (then_
)) == LABEL_DECL
)
2670 true_label
= GOTO_DESTINATION (then_
);
2676 && TREE_CODE (else_
) == GOTO_EXPR
2677 && TREE_CODE (GOTO_DESTINATION (else_
)) == LABEL_DECL
)
2679 false_label
= GOTO_DESTINATION (else_
);
2684 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2686 true_label_p
= &true_label
;
2688 true_label_p
= NULL
;
2690 /* The 'else' branch also needs a label if it contains interesting code. */
2691 if (false_label
|| else_se
)
2692 false_label_p
= &false_label
;
2694 false_label_p
= NULL
;
2696 /* If there was nothing else in our arms, just forward the label(s). */
2697 if (!then_se
&& !else_se
)
2698 return shortcut_cond_r (pred
, true_label_p
, false_label_p
,
2699 EXPR_HAS_LOCATION (expr
)
2700 ? EXPR_LOCATION (expr
) : input_location
);
2702 /* If our last subexpression already has a terminal label, reuse it. */
2704 t
= expr_last (else_
);
2706 t
= expr_last (then_
);
2709 if (t
&& TREE_CODE (t
) == LABEL_EXPR
)
2710 end_label
= LABEL_EXPR_LABEL (t
);
2712 /* If we don't care about jumping to the 'else' branch, jump to the end
2713 if the condition is false. */
2715 false_label_p
= &end_label
;
2717 /* We only want to emit these labels if we aren't hijacking them. */
2718 emit_end
= (end_label
== NULL_TREE
);
2719 emit_false
= (false_label
== NULL_TREE
);
2721 /* We only emit the jump over the else clause if we have to--if the
2722 then clause may fall through. Otherwise we can wind up with a
2723 useless jump and a useless label at the end of gimplified code,
2724 which will cause us to think that this conditional as a whole
2725 falls through even if it doesn't. If we then inline a function
2726 which ends with such a condition, that can cause us to issue an
2727 inappropriate warning about control reaching the end of a
2728 non-void function. */
2729 jump_over_else
= block_may_fallthru (then_
);
2731 pred
= shortcut_cond_r (pred
, true_label_p
, false_label_p
,
2732 EXPR_HAS_LOCATION (expr
)
2733 ? EXPR_LOCATION (expr
) : input_location
);
2736 append_to_statement_list (pred
, &expr
);
2738 append_to_statement_list (then_
, &expr
);
2743 tree last
= expr_last (expr
);
2744 t
= build_and_jump (&end_label
);
2745 if (EXPR_HAS_LOCATION (last
))
2746 SET_EXPR_LOCATION (t
, EXPR_LOCATION (last
));
2747 append_to_statement_list (t
, &expr
);
2751 t
= build1 (LABEL_EXPR
, void_type_node
, false_label
);
2752 append_to_statement_list (t
, &expr
);
2754 append_to_statement_list (else_
, &expr
);
2756 if (emit_end
&& end_label
)
2758 t
= build1 (LABEL_EXPR
, void_type_node
, end_label
);
2759 append_to_statement_list (t
, &expr
);
2765 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2768 gimple_boolify (tree expr
)
2770 tree type
= TREE_TYPE (expr
);
2771 location_t loc
= EXPR_LOCATION (expr
);
2773 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
2776 switch (TREE_CODE (expr
))
2778 case TRUTH_AND_EXPR
:
2780 case TRUTH_XOR_EXPR
:
2781 case TRUTH_ANDIF_EXPR
:
2782 case TRUTH_ORIF_EXPR
:
2783 /* Also boolify the arguments of truth exprs. */
2784 TREE_OPERAND (expr
, 1) = gimple_boolify (TREE_OPERAND (expr
, 1));
2787 case TRUTH_NOT_EXPR
:
2788 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
2791 case EQ_EXPR
: case NE_EXPR
:
2792 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
2793 /* These expressions always produce boolean results. */
2794 TREE_TYPE (expr
) = boolean_type_node
;
2798 /* Other expressions that get here must have boolean values, but
2799 might need to be converted to the appropriate mode. */
2800 return fold_convert_loc (loc
, boolean_type_node
, expr
);
2804 /* Given a conditional expression *EXPR_P without side effects, gimplify
2805 its operands. New statements are inserted to PRE_P. */
2807 static enum gimplify_status
2808 gimplify_pure_cond_expr (tree
*expr_p
, gimple_seq
*pre_p
)
2810 tree expr
= *expr_p
, cond
;
2811 enum gimplify_status ret
, tret
;
2812 enum tree_code code
;
2814 cond
= gimple_boolify (COND_EXPR_COND (expr
));
2816 /* We need to handle && and || specially, as their gimplification
2817 creates pure cond_expr, thus leading to an infinite cycle otherwise. */
2818 code
= TREE_CODE (cond
);
2819 if (code
== TRUTH_ANDIF_EXPR
)
2820 TREE_SET_CODE (cond
, TRUTH_AND_EXPR
);
2821 else if (code
== TRUTH_ORIF_EXPR
)
2822 TREE_SET_CODE (cond
, TRUTH_OR_EXPR
);
2823 ret
= gimplify_expr (&cond
, pre_p
, NULL
, is_gimple_condexpr
, fb_rvalue
);
2824 COND_EXPR_COND (*expr_p
) = cond
;
2826 tret
= gimplify_expr (&COND_EXPR_THEN (expr
), pre_p
, NULL
,
2827 is_gimple_val
, fb_rvalue
);
2828 ret
= MIN (ret
, tret
);
2829 tret
= gimplify_expr (&COND_EXPR_ELSE (expr
), pre_p
, NULL
,
2830 is_gimple_val
, fb_rvalue
);
2832 return MIN (ret
, tret
);
2835 /* Returns true if evaluating EXPR could trap.
2836 EXPR is GENERIC, while tree_could_trap_p can be called
2840 generic_expr_could_trap_p (tree expr
)
2844 if (!expr
|| is_gimple_val (expr
))
2847 if (!EXPR_P (expr
) || tree_could_trap_p (expr
))
2850 n
= TREE_OPERAND_LENGTH (expr
);
2851 for (i
= 0; i
< n
; i
++)
2852 if (generic_expr_could_trap_p (TREE_OPERAND (expr
, i
)))
2858 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2867 The second form is used when *EXPR_P is of type void.
2869 PRE_P points to the list where side effects that must happen before
2870 *EXPR_P should be stored. */
2872 static enum gimplify_status
2873 gimplify_cond_expr (tree
*expr_p
, gimple_seq
*pre_p
, fallback_t fallback
)
2875 tree expr
= *expr_p
;
2876 tree tmp
, type
, arm1
, arm2
;
2877 enum gimplify_status ret
;
2878 tree label_true
, label_false
, label_cont
;
2879 bool have_then_clause_p
, have_else_clause_p
;
2881 enum tree_code pred_code
;
2882 gimple_seq seq
= NULL
;
2883 location_t loc
= EXPR_LOCATION (*expr_p
);
2885 type
= TREE_TYPE (expr
);
2887 /* If this COND_EXPR has a value, copy the values into a temporary within
2889 if (! VOID_TYPE_P (type
))
2893 /* If an rvalue is ok or we do not require an lvalue, avoid creating
2894 an addressable temporary. */
2895 if (((fallback
& fb_rvalue
)
2896 || !(fallback
& fb_lvalue
))
2897 && !TREE_ADDRESSABLE (type
))
2899 if (gimplify_ctxp
->allow_rhs_cond_expr
2900 /* If either branch has side effects or could trap, it can't be
2901 evaluated unconditionally. */
2902 && !TREE_SIDE_EFFECTS (TREE_OPERAND (*expr_p
, 1))
2903 && !generic_expr_could_trap_p (TREE_OPERAND (*expr_p
, 1))
2904 && !TREE_SIDE_EFFECTS (TREE_OPERAND (*expr_p
, 2))
2905 && !generic_expr_could_trap_p (TREE_OPERAND (*expr_p
, 2)))
2906 return gimplify_pure_cond_expr (expr_p
, pre_p
);
2908 result
= tmp
= create_tmp_var (TREE_TYPE (expr
), "iftmp");
2913 tree type
= build_pointer_type (TREE_TYPE (expr
));
2915 if (TREE_TYPE (TREE_OPERAND (expr
, 1)) != void_type_node
)
2916 TREE_OPERAND (expr
, 1) =
2917 build_fold_addr_expr_loc (loc
, TREE_OPERAND (expr
, 1));
2919 if (TREE_TYPE (TREE_OPERAND (expr
, 2)) != void_type_node
)
2920 TREE_OPERAND (expr
, 2) =
2921 build_fold_addr_expr_loc (loc
, TREE_OPERAND (expr
, 2));
2923 tmp
= create_tmp_var (type
, "iftmp");
2925 expr
= build3 (COND_EXPR
, void_type_node
, TREE_OPERAND (expr
, 0),
2926 TREE_OPERAND (expr
, 1), TREE_OPERAND (expr
, 2));
2928 result
= build_fold_indirect_ref_loc (loc
, tmp
);
2931 /* Build the then clause, 't1 = a;'. But don't build an assignment
2932 if this branch is void; in C++ it can be, if it's a throw. */
2933 if (TREE_TYPE (TREE_OPERAND (expr
, 1)) != void_type_node
)
2934 TREE_OPERAND (expr
, 1)
2935 = build2 (MODIFY_EXPR
, TREE_TYPE (tmp
), tmp
, TREE_OPERAND (expr
, 1));
2937 /* Build the else clause, 't1 = b;'. */
2938 if (TREE_TYPE (TREE_OPERAND (expr
, 2)) != void_type_node
)
2939 TREE_OPERAND (expr
, 2)
2940 = build2 (MODIFY_EXPR
, TREE_TYPE (tmp
), tmp
, TREE_OPERAND (expr
, 2));
2942 TREE_TYPE (expr
) = void_type_node
;
2943 recalculate_side_effects (expr
);
2945 /* Move the COND_EXPR to the prequeue. */
2946 gimplify_stmt (&expr
, pre_p
);
2952 /* Make sure the condition has BOOLEAN_TYPE. */
2953 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
2955 /* Break apart && and || conditions. */
2956 if (TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ANDIF_EXPR
2957 || TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ORIF_EXPR
)
2959 expr
= shortcut_cond_expr (expr
);
2961 if (expr
!= *expr_p
)
2965 /* We can't rely on gimplify_expr to re-gimplify the expanded
2966 form properly, as cleanups might cause the target labels to be
2967 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2968 set up a conditional context. */
2969 gimple_push_condition ();
2970 gimplify_stmt (expr_p
, &seq
);
2971 gimple_pop_condition (pre_p
);
2972 gimple_seq_add_seq (pre_p
, seq
);
2978 /* Now do the normal gimplification. */
2980 /* Gimplify condition. */
2981 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, NULL
, is_gimple_condexpr
,
2983 if (ret
== GS_ERROR
)
2985 gcc_assert (TREE_OPERAND (expr
, 0) != NULL_TREE
);
2987 gimple_push_condition ();
2989 have_then_clause_p
= have_else_clause_p
= false;
2990 if (TREE_OPERAND (expr
, 1) != NULL
2991 && TREE_CODE (TREE_OPERAND (expr
, 1)) == GOTO_EXPR
2992 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr
, 1))) == LABEL_DECL
2993 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr
, 1)))
2994 == current_function_decl
)
2995 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
2996 have different locations, otherwise we end up with incorrect
2997 location information on the branches. */
2999 || !EXPR_HAS_LOCATION (expr
)
3000 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr
, 1))
3001 || EXPR_LOCATION (expr
) == EXPR_LOCATION (TREE_OPERAND (expr
, 1))))
3003 label_true
= GOTO_DESTINATION (TREE_OPERAND (expr
, 1));
3004 have_then_clause_p
= true;
3007 label_true
= create_artificial_label (UNKNOWN_LOCATION
);
3008 if (TREE_OPERAND (expr
, 2) != NULL
3009 && TREE_CODE (TREE_OPERAND (expr
, 2)) == GOTO_EXPR
3010 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr
, 2))) == LABEL_DECL
3011 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr
, 2)))
3012 == current_function_decl
)
3013 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
3014 have different locations, otherwise we end up with incorrect
3015 location information on the branches. */
3017 || !EXPR_HAS_LOCATION (expr
)
3018 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr
, 2))
3019 || EXPR_LOCATION (expr
) == EXPR_LOCATION (TREE_OPERAND (expr
, 2))))
3021 label_false
= GOTO_DESTINATION (TREE_OPERAND (expr
, 2));
3022 have_else_clause_p
= true;
3025 label_false
= create_artificial_label (UNKNOWN_LOCATION
);
3027 gimple_cond_get_ops_from_tree (COND_EXPR_COND (expr
), &pred_code
, &arm1
,
3030 gimple_cond
= gimple_build_cond (pred_code
, arm1
, arm2
, label_true
,
3033 gimplify_seq_add_stmt (&seq
, gimple_cond
);
3034 label_cont
= NULL_TREE
;
3035 if (!have_then_clause_p
)
3037 /* For if (...) {} else { code; } put label_true after
3039 if (TREE_OPERAND (expr
, 1) == NULL_TREE
3040 && !have_else_clause_p
3041 && TREE_OPERAND (expr
, 2) != NULL_TREE
)
3042 label_cont
= label_true
;
3045 gimplify_seq_add_stmt (&seq
, gimple_build_label (label_true
));
3046 have_then_clause_p
= gimplify_stmt (&TREE_OPERAND (expr
, 1), &seq
);
3047 /* For if (...) { code; } else {} or
3048 if (...) { code; } else goto label; or
3049 if (...) { code; return; } else { ... }
3050 label_cont isn't needed. */
3051 if (!have_else_clause_p
3052 && TREE_OPERAND (expr
, 2) != NULL_TREE
3053 && gimple_seq_may_fallthru (seq
))
3056 label_cont
= create_artificial_label (UNKNOWN_LOCATION
);
3058 g
= gimple_build_goto (label_cont
);
3060 /* GIMPLE_COND's are very low level; they have embedded
3061 gotos. This particular embedded goto should not be marked
3062 with the location of the original COND_EXPR, as it would
3063 correspond to the COND_EXPR's condition, not the ELSE or the
3064 THEN arms. To avoid marking it with the wrong location, flag
3065 it as "no location". */
3066 gimple_set_do_not_emit_location (g
);
3068 gimplify_seq_add_stmt (&seq
, g
);
3072 if (!have_else_clause_p
)
3074 gimplify_seq_add_stmt (&seq
, gimple_build_label (label_false
));
3075 have_else_clause_p
= gimplify_stmt (&TREE_OPERAND (expr
, 2), &seq
);
3078 gimplify_seq_add_stmt (&seq
, gimple_build_label (label_cont
));
3080 gimple_pop_condition (pre_p
);
3081 gimple_seq_add_seq (pre_p
, seq
);
3083 if (ret
== GS_ERROR
)
3085 else if (have_then_clause_p
|| have_else_clause_p
)
3089 /* Both arms are empty; replace the COND_EXPR with its predicate. */
3090 expr
= TREE_OPERAND (expr
, 0);
3091 gimplify_stmt (&expr
, pre_p
);
3098 /* Prepare the node pointed to by EXPR_P, an is_gimple_addressable expression,
3099 to be marked addressable.
3101 We cannot rely on such an expression being directly markable if a temporary
3102 has been created by the gimplification. In this case, we create another
3103 temporary and initialize it with a copy, which will become a store after we
3104 mark it addressable. This can happen if the front-end passed us something
3105 that it could not mark addressable yet, like a Fortran pass-by-reference
3106 parameter (int) floatvar. */
3109 prepare_gimple_addressable (tree
*expr_p
, gimple_seq
*seq_p
)
3111 while (handled_component_p (*expr_p
))
3112 expr_p
= &TREE_OPERAND (*expr_p
, 0);
3113 if (is_gimple_reg (*expr_p
))
3114 *expr_p
= get_initialized_tmp_var (*expr_p
, seq_p
, NULL
);
3117 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3118 a call to __builtin_memcpy. */
3120 static enum gimplify_status
3121 gimplify_modify_expr_to_memcpy (tree
*expr_p
, tree size
, bool want_value
,
3124 tree t
, to
, to_ptr
, from
, from_ptr
;
3126 location_t loc
= EXPR_LOCATION (*expr_p
);
3128 to
= TREE_OPERAND (*expr_p
, 0);
3129 from
= TREE_OPERAND (*expr_p
, 1);
3131 /* Mark the RHS addressable. Beware that it may not be possible to do so
3132 directly if a temporary has been created by the gimplification. */
3133 prepare_gimple_addressable (&from
, seq_p
);
3135 mark_addressable (from
);
3136 from_ptr
= build_fold_addr_expr_loc (loc
, from
);
3137 gimplify_arg (&from_ptr
, seq_p
, loc
);
3139 mark_addressable (to
);
3140 to_ptr
= build_fold_addr_expr_loc (loc
, to
);
3141 gimplify_arg (&to_ptr
, seq_p
, loc
);
3143 t
= implicit_built_in_decls
[BUILT_IN_MEMCPY
];
3145 gs
= gimple_build_call (t
, 3, to_ptr
, from_ptr
, size
);
3149 /* tmp = memcpy() */
3150 t
= create_tmp_var (TREE_TYPE (to_ptr
), NULL
);
3151 gimple_call_set_lhs (gs
, t
);
3152 gimplify_seq_add_stmt (seq_p
, gs
);
3154 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
3158 gimplify_seq_add_stmt (seq_p
, gs
);
3163 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3164 a call to __builtin_memset. In this case we know that the RHS is
3165 a CONSTRUCTOR with an empty element list. */
3167 static enum gimplify_status
3168 gimplify_modify_expr_to_memset (tree
*expr_p
, tree size
, bool want_value
,
3171 tree t
, from
, to
, to_ptr
;
3173 location_t loc
= EXPR_LOCATION (*expr_p
);
3175 /* Assert our assumptions, to abort instead of producing wrong code
3176 silently if they are not met. Beware that the RHS CONSTRUCTOR might
3177 not be immediately exposed. */
3178 from
= TREE_OPERAND (*expr_p
, 1);
3179 if (TREE_CODE (from
) == WITH_SIZE_EXPR
)
3180 from
= TREE_OPERAND (from
, 0);
3182 gcc_assert (TREE_CODE (from
) == CONSTRUCTOR
3183 && VEC_empty (constructor_elt
, CONSTRUCTOR_ELTS (from
)));
3186 to
= TREE_OPERAND (*expr_p
, 0);
3188 to_ptr
= build_fold_addr_expr_loc (loc
, to
);
3189 gimplify_arg (&to_ptr
, seq_p
, loc
);
3190 t
= implicit_built_in_decls
[BUILT_IN_MEMSET
];
3192 gs
= gimple_build_call (t
, 3, to_ptr
, integer_zero_node
, size
);
3196 /* tmp = memset() */
3197 t
= create_tmp_var (TREE_TYPE (to_ptr
), NULL
);
3198 gimple_call_set_lhs (gs
, t
);
3199 gimplify_seq_add_stmt (seq_p
, gs
);
3201 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
3205 gimplify_seq_add_stmt (seq_p
, gs
);
3210 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
3211 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
3212 assignment. Returns non-null if we detect a potential overlap. */
3214 struct gimplify_init_ctor_preeval_data
3216 /* The base decl of the lhs object. May be NULL, in which case we
3217 have to assume the lhs is indirect. */
3220 /* The alias set of the lhs object. */
3221 alias_set_type lhs_alias_set
;
3225 gimplify_init_ctor_preeval_1 (tree
*tp
, int *walk_subtrees
, void *xdata
)
3227 struct gimplify_init_ctor_preeval_data
*data
3228 = (struct gimplify_init_ctor_preeval_data
*) xdata
;
3231 /* If we find the base object, obviously we have overlap. */
3232 if (data
->lhs_base_decl
== t
)
3235 /* If the constructor component is indirect, determine if we have a
3236 potential overlap with the lhs. The only bits of information we
3237 have to go on at this point are addressability and alias sets. */
3238 if (TREE_CODE (t
) == INDIRECT_REF
3239 && (!data
->lhs_base_decl
|| TREE_ADDRESSABLE (data
->lhs_base_decl
))
3240 && alias_sets_conflict_p (data
->lhs_alias_set
, get_alias_set (t
)))
3243 /* If the constructor component is a call, determine if it can hide a
3244 potential overlap with the lhs through an INDIRECT_REF like above. */
3245 if (TREE_CODE (t
) == CALL_EXPR
)
3247 tree type
, fntype
= TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (t
)));
3249 for (type
= TYPE_ARG_TYPES (fntype
); type
; type
= TREE_CHAIN (type
))
3250 if (POINTER_TYPE_P (TREE_VALUE (type
))
3251 && (!data
->lhs_base_decl
|| TREE_ADDRESSABLE (data
->lhs_base_decl
))
3252 && alias_sets_conflict_p (data
->lhs_alias_set
,
3254 (TREE_TYPE (TREE_VALUE (type
)))))
3258 if (IS_TYPE_OR_DECL_P (t
))
3263 /* A subroutine of gimplify_init_constructor. Pre-evaluate EXPR,
3264 force values that overlap with the lhs (as described by *DATA)
3265 into temporaries. */
3268 gimplify_init_ctor_preeval (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
3269 struct gimplify_init_ctor_preeval_data
*data
)
3271 enum gimplify_status one
;
3273 /* If the value is constant, then there's nothing to pre-evaluate. */
3274 if (TREE_CONSTANT (*expr_p
))
3276 /* Ensure it does not have side effects, it might contain a reference to
3277 the object we're initializing. */
3278 gcc_assert (!TREE_SIDE_EFFECTS (*expr_p
));
3282 /* If the type has non-trivial constructors, we can't pre-evaluate. */
3283 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p
)))
3286 /* Recurse for nested constructors. */
3287 if (TREE_CODE (*expr_p
) == CONSTRUCTOR
)
3289 unsigned HOST_WIDE_INT ix
;
3290 constructor_elt
*ce
;
3291 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (*expr_p
);
3293 for (ix
= 0; VEC_iterate (constructor_elt
, v
, ix
, ce
); ix
++)
3294 gimplify_init_ctor_preeval (&ce
->value
, pre_p
, post_p
, data
);
3299 /* If this is a variable sized type, we must remember the size. */
3300 maybe_with_size_expr (expr_p
);
3302 /* Gimplify the constructor element to something appropriate for the rhs
3303 of a MODIFY_EXPR. Given that we know the LHS is an aggregate, we know
3304 the gimplifier will consider this a store to memory. Doing this
3305 gimplification now means that we won't have to deal with complicated
3306 language-specific trees, nor trees like SAVE_EXPR that can induce
3307 exponential search behavior. */
3308 one
= gimplify_expr (expr_p
, pre_p
, post_p
, is_gimple_mem_rhs
, fb_rvalue
);
3309 if (one
== GS_ERROR
)
3315 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
3316 with the lhs, since "a = { .x=a }" doesn't make sense. This will
3317 always be true for all scalars, since is_gimple_mem_rhs insists on a
3318 temporary variable for them. */
3319 if (DECL_P (*expr_p
))
3322 /* If this is of variable size, we have no choice but to assume it doesn't
3323 overlap since we can't make a temporary for it. */
3324 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (*expr_p
))) != INTEGER_CST
)
3327 /* Otherwise, we must search for overlap ... */
3328 if (!walk_tree (expr_p
, gimplify_init_ctor_preeval_1
, data
, NULL
))
3331 /* ... and if found, force the value into a temporary. */
3332 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
3335 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
3336 a RANGE_EXPR in a CONSTRUCTOR for an array.
3340 object[var] = value;
3347 We increment var _after_ the loop exit check because we might otherwise
3348 fail if upper == TYPE_MAX_VALUE (type for upper).
3350 Note that we never have to deal with SAVE_EXPRs here, because this has
3351 already been taken care of for us, in gimplify_init_ctor_preeval(). */
3353 static void gimplify_init_ctor_eval (tree
, VEC(constructor_elt
,gc
) *,
3354 gimple_seq
*, bool);
3357 gimplify_init_ctor_eval_range (tree object
, tree lower
, tree upper
,
3358 tree value
, tree array_elt_type
,
3359 gimple_seq
*pre_p
, bool cleared
)
3361 tree loop_entry_label
, loop_exit_label
, fall_thru_label
;
3362 tree var
, var_type
, cref
, tmp
;
3364 loop_entry_label
= create_artificial_label (UNKNOWN_LOCATION
);
3365 loop_exit_label
= create_artificial_label (UNKNOWN_LOCATION
);
3366 fall_thru_label
= create_artificial_label (UNKNOWN_LOCATION
);
3368 /* Create and initialize the index variable. */
3369 var_type
= TREE_TYPE (upper
);
3370 var
= create_tmp_var (var_type
, NULL
);
3371 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (var
, lower
));
3373 /* Add the loop entry label. */
3374 gimplify_seq_add_stmt (pre_p
, gimple_build_label (loop_entry_label
));
3376 /* Build the reference. */
3377 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
3378 var
, NULL_TREE
, NULL_TREE
);
3380 /* If we are a constructor, just call gimplify_init_ctor_eval to do
3381 the store. Otherwise just assign value to the reference. */
3383 if (TREE_CODE (value
) == CONSTRUCTOR
)
3384 /* NB we might have to call ourself recursively through
3385 gimplify_init_ctor_eval if the value is a constructor. */
3386 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
3389 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (cref
, value
));
3391 /* We exit the loop when the index var is equal to the upper bound. */
3392 gimplify_seq_add_stmt (pre_p
,
3393 gimple_build_cond (EQ_EXPR
, var
, upper
,
3394 loop_exit_label
, fall_thru_label
));
3396 gimplify_seq_add_stmt (pre_p
, gimple_build_label (fall_thru_label
));
3398 /* Otherwise, increment the index var... */
3399 tmp
= build2 (PLUS_EXPR
, var_type
, var
,
3400 fold_convert (var_type
, integer_one_node
));
3401 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (var
, tmp
));
3403 /* ...and jump back to the loop entry. */
3404 gimplify_seq_add_stmt (pre_p
, gimple_build_goto (loop_entry_label
));
3406 /* Add the loop exit label. */
3407 gimplify_seq_add_stmt (pre_p
, gimple_build_label (loop_exit_label
));
3410 /* Return true if FDECL is accessing a field that is zero sized. */
3413 zero_sized_field_decl (const_tree fdecl
)
3415 if (TREE_CODE (fdecl
) == FIELD_DECL
&& DECL_SIZE (fdecl
)
3416 && integer_zerop (DECL_SIZE (fdecl
)))
3421 /* Return true if TYPE is zero sized. */
3424 zero_sized_type (const_tree type
)
3426 if (AGGREGATE_TYPE_P (type
) && TYPE_SIZE (type
)
3427 && integer_zerop (TYPE_SIZE (type
)))
3432 /* A subroutine of gimplify_init_constructor. Generate individual
3433 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
3434 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
3435 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
3439 gimplify_init_ctor_eval (tree object
, VEC(constructor_elt
,gc
) *elts
,
3440 gimple_seq
*pre_p
, bool cleared
)
3442 tree array_elt_type
= NULL
;
3443 unsigned HOST_WIDE_INT ix
;
3444 tree purpose
, value
;
3446 if (TREE_CODE (TREE_TYPE (object
)) == ARRAY_TYPE
)
3447 array_elt_type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object
)));
3449 FOR_EACH_CONSTRUCTOR_ELT (elts
, ix
, purpose
, value
)
3453 /* NULL values are created above for gimplification errors. */
3457 if (cleared
&& initializer_zerop (value
))
3460 /* ??? Here's to hoping the front end fills in all of the indices,
3461 so we don't have to figure out what's missing ourselves. */
3462 gcc_assert (purpose
);
3464 /* Skip zero-sized fields, unless value has side-effects. This can
3465 happen with calls to functions returning a zero-sized type, which
3466 we shouldn't discard. As a number of downstream passes don't
3467 expect sets of zero-sized fields, we rely on the gimplification of
3468 the MODIFY_EXPR we make below to drop the assignment statement. */
3469 if (! TREE_SIDE_EFFECTS (value
) && zero_sized_field_decl (purpose
))
3472 /* If we have a RANGE_EXPR, we have to build a loop to assign the
3474 if (TREE_CODE (purpose
) == RANGE_EXPR
)
3476 tree lower
= TREE_OPERAND (purpose
, 0);
3477 tree upper
= TREE_OPERAND (purpose
, 1);
3479 /* If the lower bound is equal to upper, just treat it as if
3480 upper was the index. */
3481 if (simple_cst_equal (lower
, upper
))
3485 gimplify_init_ctor_eval_range (object
, lower
, upper
, value
,
3486 array_elt_type
, pre_p
, cleared
);
3493 /* Do not use bitsizetype for ARRAY_REF indices. */
3494 if (TYPE_DOMAIN (TREE_TYPE (object
)))
3495 purpose
= fold_convert (TREE_TYPE (TYPE_DOMAIN (TREE_TYPE (object
))),
3497 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
3498 purpose
, NULL_TREE
, NULL_TREE
);
3502 gcc_assert (TREE_CODE (purpose
) == FIELD_DECL
);
3503 cref
= build3 (COMPONENT_REF
, TREE_TYPE (purpose
),
3504 unshare_expr (object
), purpose
, NULL_TREE
);
3507 if (TREE_CODE (value
) == CONSTRUCTOR
3508 && TREE_CODE (TREE_TYPE (value
)) != VECTOR_TYPE
)
3509 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
3513 tree init
= build2 (INIT_EXPR
, TREE_TYPE (cref
), cref
, value
);
3514 gimplify_and_add (init
, pre_p
);
3521 /* Returns the appropriate RHS predicate for this LHS. */
3524 rhs_predicate_for (tree lhs
)
3526 if (is_gimple_reg (lhs
))
3527 return is_gimple_reg_rhs_or_call
;
3529 return is_gimple_mem_rhs_or_call
;
3532 /* Gimplify a C99 compound literal expression. This just means adding
3533 the DECL_EXPR before the current statement and using its anonymous
3536 static enum gimplify_status
3537 gimplify_compound_literal_expr (tree
*expr_p
, gimple_seq
*pre_p
)
3539 tree decl_s
= COMPOUND_LITERAL_EXPR_DECL_EXPR (*expr_p
);
3540 tree decl
= DECL_EXPR_DECL (decl_s
);
3541 /* Mark the decl as addressable if the compound literal
3542 expression is addressable now, otherwise it is marked too late
3543 after we gimplify the initialization expression. */
3544 if (TREE_ADDRESSABLE (*expr_p
))
3545 TREE_ADDRESSABLE (decl
) = 1;
3547 /* Preliminarily mark non-addressed complex variables as eligible
3548 for promotion to gimple registers. We'll transform their uses
3550 if ((TREE_CODE (TREE_TYPE (decl
)) == COMPLEX_TYPE
3551 || TREE_CODE (TREE_TYPE (decl
)) == VECTOR_TYPE
)
3552 && !TREE_THIS_VOLATILE (decl
)
3553 && !needs_to_live_in_memory (decl
))
3554 DECL_GIMPLE_REG_P (decl
) = 1;
3556 /* This decl isn't mentioned in the enclosing block, so add it to the
3557 list of temps. FIXME it seems a bit of a kludge to say that
3558 anonymous artificial vars aren't pushed, but everything else is. */
3559 if (DECL_NAME (decl
) == NULL_TREE
&& !DECL_SEEN_IN_BIND_EXPR_P (decl
))
3560 gimple_add_tmp_var (decl
);
3562 gimplify_and_add (decl_s
, pre_p
);
3567 /* Optimize embedded COMPOUND_LITERAL_EXPRs within a CONSTRUCTOR,
3568 return a new CONSTRUCTOR if something changed. */
3571 optimize_compound_literals_in_ctor (tree orig_ctor
)
3573 tree ctor
= orig_ctor
;
3574 VEC(constructor_elt
,gc
) *elts
= CONSTRUCTOR_ELTS (ctor
);
3575 unsigned int idx
, num
= VEC_length (constructor_elt
, elts
);
3577 for (idx
= 0; idx
< num
; idx
++)
3579 tree value
= VEC_index (constructor_elt
, elts
, idx
)->value
;
3580 tree newval
= value
;
3581 if (TREE_CODE (value
) == CONSTRUCTOR
)
3582 newval
= optimize_compound_literals_in_ctor (value
);
3583 else if (TREE_CODE (value
) == COMPOUND_LITERAL_EXPR
)
3585 tree decl_s
= COMPOUND_LITERAL_EXPR_DECL_EXPR (value
);
3586 tree decl
= DECL_EXPR_DECL (decl_s
);
3587 tree init
= DECL_INITIAL (decl
);
3589 if (!TREE_ADDRESSABLE (value
)
3590 && !TREE_ADDRESSABLE (decl
)
3592 newval
= optimize_compound_literals_in_ctor (init
);
3594 if (newval
== value
)
3597 if (ctor
== orig_ctor
)
3599 ctor
= copy_node (orig_ctor
);
3600 CONSTRUCTOR_ELTS (ctor
) = VEC_copy (constructor_elt
, gc
, elts
);
3601 elts
= CONSTRUCTOR_ELTS (ctor
);
3603 VEC_index (constructor_elt
, elts
, idx
)->value
= newval
;
3610 /* A subroutine of gimplify_modify_expr. Break out elements of a
3611 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
3613 Note that we still need to clear any elements that don't have explicit
3614 initializers, so if not all elements are initialized we keep the
3615 original MODIFY_EXPR, we just remove all of the constructor elements.
3617 If NOTIFY_TEMP_CREATION is true, do not gimplify, just return
3618 GS_ERROR if we would have to create a temporary when gimplifying
3619 this constructor. Otherwise, return GS_OK.
3621 If NOTIFY_TEMP_CREATION is false, just do the gimplification. */
3623 static enum gimplify_status
3624 gimplify_init_constructor (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
3625 bool want_value
, bool notify_temp_creation
)
3627 tree object
, ctor
, type
;
3628 enum gimplify_status ret
;
3629 VEC(constructor_elt
,gc
) *elts
;
3631 gcc_assert (TREE_CODE (TREE_OPERAND (*expr_p
, 1)) == CONSTRUCTOR
);
3633 if (!notify_temp_creation
)
3635 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
3636 is_gimple_lvalue
, fb_lvalue
);
3637 if (ret
== GS_ERROR
)
3641 object
= TREE_OPERAND (*expr_p
, 0);
3642 ctor
= TREE_OPERAND (*expr_p
, 1) =
3643 optimize_compound_literals_in_ctor (TREE_OPERAND (*expr_p
, 1));
3644 type
= TREE_TYPE (ctor
);
3645 elts
= CONSTRUCTOR_ELTS (ctor
);
3648 switch (TREE_CODE (type
))
3652 case QUAL_UNION_TYPE
:
3655 struct gimplify_init_ctor_preeval_data preeval_data
;
3656 HOST_WIDE_INT num_type_elements
, num_ctor_elements
;
3657 HOST_WIDE_INT num_nonzero_elements
;
3658 bool cleared
, valid_const_initializer
;
3660 /* Aggregate types must lower constructors to initialization of
3661 individual elements. The exception is that a CONSTRUCTOR node
3662 with no elements indicates zero-initialization of the whole. */
3663 if (VEC_empty (constructor_elt
, elts
))
3665 if (notify_temp_creation
)
3670 /* Fetch information about the constructor to direct later processing.
3671 We might want to make static versions of it in various cases, and
3672 can only do so if it known to be a valid constant initializer. */
3673 valid_const_initializer
3674 = categorize_ctor_elements (ctor
, &num_nonzero_elements
,
3675 &num_ctor_elements
, &cleared
);
3677 /* If a const aggregate variable is being initialized, then it
3678 should never be a lose to promote the variable to be static. */
3679 if (valid_const_initializer
3680 && num_nonzero_elements
> 1
3681 && TREE_READONLY (object
)
3682 && TREE_CODE (object
) == VAR_DECL
3683 && (flag_merge_constants
>= 2 || !TREE_ADDRESSABLE (object
)))
3685 if (notify_temp_creation
)
3687 DECL_INITIAL (object
) = ctor
;
3688 TREE_STATIC (object
) = 1;
3689 if (!DECL_NAME (object
))
3690 DECL_NAME (object
) = create_tmp_var_name ("C");
3691 walk_tree (&DECL_INITIAL (object
), force_labels_r
, NULL
, NULL
);
3693 /* ??? C++ doesn't automatically append a .<number> to the
3694 assembler name, and even when it does, it looks a FE private
3695 data structures to figure out what that number should be,
3696 which are not set for this variable. I suppose this is
3697 important for local statics for inline functions, which aren't
3698 "local" in the object file sense. So in order to get a unique
3699 TU-local symbol, we must invoke the lhd version now. */
3700 lhd_set_decl_assembler_name (object
);
3702 *expr_p
= NULL_TREE
;
3706 /* If there are "lots" of initialized elements, even discounting
3707 those that are not address constants (and thus *must* be
3708 computed at runtime), then partition the constructor into
3709 constant and non-constant parts. Block copy the constant
3710 parts in, then generate code for the non-constant parts. */
3711 /* TODO. There's code in cp/typeck.c to do this. */
3713 num_type_elements
= count_type_elements (type
, true);
3715 /* If count_type_elements could not determine number of type elements
3716 for a constant-sized object, assume clearing is needed.
3717 Don't do this for variable-sized objects, as store_constructor
3718 will ignore the clearing of variable-sized objects. */
3719 if (num_type_elements
< 0 && int_size_in_bytes (type
) >= 0)
3721 /* If there are "lots" of zeros, then block clear the object first. */
3722 else if (num_type_elements
- num_nonzero_elements
3723 > CLEAR_RATIO (optimize_function_for_speed_p (cfun
))
3724 && num_nonzero_elements
< num_type_elements
/4)
3726 /* ??? This bit ought not be needed. For any element not present
3727 in the initializer, we should simply set them to zero. Except
3728 we'd need to *find* the elements that are not present, and that
3729 requires trickery to avoid quadratic compile-time behavior in
3730 large cases or excessive memory use in small cases. */
3731 else if (num_ctor_elements
< num_type_elements
)
3734 /* If there are "lots" of initialized elements, and all of them
3735 are valid address constants, then the entire initializer can
3736 be dropped to memory, and then memcpy'd out. Don't do this
3737 for sparse arrays, though, as it's more efficient to follow
3738 the standard CONSTRUCTOR behavior of memset followed by
3739 individual element initialization. Also don't do this for small
3740 all-zero initializers (which aren't big enough to merit
3741 clearing), and don't try to make bitwise copies of
3742 TREE_ADDRESSABLE types. */
3743 if (valid_const_initializer
3744 && !(cleared
|| num_nonzero_elements
== 0)
3745 && !TREE_ADDRESSABLE (type
))
3747 HOST_WIDE_INT size
= int_size_in_bytes (type
);
3750 /* ??? We can still get unbounded array types, at least
3751 from the C++ front end. This seems wrong, but attempt
3752 to work around it for now. */
3755 size
= int_size_in_bytes (TREE_TYPE (object
));
3757 TREE_TYPE (ctor
) = type
= TREE_TYPE (object
);
3760 /* Find the maximum alignment we can assume for the object. */
3761 /* ??? Make use of DECL_OFFSET_ALIGN. */
3762 if (DECL_P (object
))
3763 align
= DECL_ALIGN (object
);
3765 align
= TYPE_ALIGN (type
);
3768 && num_nonzero_elements
> 1
3769 && !can_move_by_pieces (size
, align
))
3773 if (notify_temp_creation
)
3776 new_tree
= create_tmp_var_raw (type
, "C");
3778 gimple_add_tmp_var (new_tree
);
3779 TREE_STATIC (new_tree
) = 1;
3780 TREE_READONLY (new_tree
) = 1;
3781 DECL_INITIAL (new_tree
) = ctor
;
3782 if (align
> DECL_ALIGN (new_tree
))
3784 DECL_ALIGN (new_tree
) = align
;
3785 DECL_USER_ALIGN (new_tree
) = 1;
3787 walk_tree (&DECL_INITIAL (new_tree
), force_labels_r
, NULL
, NULL
);
3789 TREE_OPERAND (*expr_p
, 1) = new_tree
;
3791 /* This is no longer an assignment of a CONSTRUCTOR, but
3792 we still may have processing to do on the LHS. So
3793 pretend we didn't do anything here to let that happen. */
3794 return GS_UNHANDLED
;
3798 if (notify_temp_creation
)
3801 /* If there are nonzero elements, pre-evaluate to capture elements
3802 overlapping with the lhs into temporaries. We must do this before
3803 clearing to fetch the values before they are zeroed-out. */
3804 if (num_nonzero_elements
> 0)
3806 preeval_data
.lhs_base_decl
= get_base_address (object
);
3807 if (!DECL_P (preeval_data
.lhs_base_decl
))
3808 preeval_data
.lhs_base_decl
= NULL
;
3809 preeval_data
.lhs_alias_set
= get_alias_set (object
);
3811 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p
, 1),
3812 pre_p
, post_p
, &preeval_data
);
3817 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3818 Note that we still have to gimplify, in order to handle the
3819 case of variable sized types. Avoid shared tree structures. */
3820 CONSTRUCTOR_ELTS (ctor
) = NULL
;
3821 TREE_SIDE_EFFECTS (ctor
) = 0;
3822 object
= unshare_expr (object
);
3823 gimplify_stmt (expr_p
, pre_p
);
3826 /* If we have not block cleared the object, or if there are nonzero
3827 elements in the constructor, add assignments to the individual
3828 scalar fields of the object. */
3829 if (!cleared
|| num_nonzero_elements
> 0)
3830 gimplify_init_ctor_eval (object
, elts
, pre_p
, cleared
);
3832 *expr_p
= NULL_TREE
;
3840 if (notify_temp_creation
)
3843 /* Extract the real and imaginary parts out of the ctor. */
3844 gcc_assert (VEC_length (constructor_elt
, elts
) == 2);
3845 r
= VEC_index (constructor_elt
, elts
, 0)->value
;
3846 i
= VEC_index (constructor_elt
, elts
, 1)->value
;
3847 if (r
== NULL
|| i
== NULL
)
3849 tree zero
= fold_convert (TREE_TYPE (type
), integer_zero_node
);
3856 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3857 represent creation of a complex value. */
3858 if (TREE_CONSTANT (r
) && TREE_CONSTANT (i
))
3860 ctor
= build_complex (type
, r
, i
);
3861 TREE_OPERAND (*expr_p
, 1) = ctor
;
3865 ctor
= build2 (COMPLEX_EXPR
, type
, r
, i
);
3866 TREE_OPERAND (*expr_p
, 1) = ctor
;
3867 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1),
3870 rhs_predicate_for (TREE_OPERAND (*expr_p
, 0)),
3878 unsigned HOST_WIDE_INT ix
;
3879 constructor_elt
*ce
;
3881 if (notify_temp_creation
)
3884 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3885 if (TREE_CONSTANT (ctor
))
3887 bool constant_p
= true;
3890 /* Even when ctor is constant, it might contain non-*_CST
3891 elements, such as addresses or trapping values like
3892 1.0/0.0 - 1.0/0.0. Such expressions don't belong
3893 in VECTOR_CST nodes. */
3894 FOR_EACH_CONSTRUCTOR_VALUE (elts
, ix
, value
)
3895 if (!CONSTANT_CLASS_P (value
))
3903 TREE_OPERAND (*expr_p
, 1) = build_vector_from_ctor (type
, elts
);
3907 /* Don't reduce an initializer constant even if we can't
3908 make a VECTOR_CST. It won't do anything for us, and it'll
3909 prevent us from representing it as a single constant. */
3910 if (initializer_constant_valid_p (ctor
, type
))
3913 TREE_CONSTANT (ctor
) = 0;
3916 /* Vector types use CONSTRUCTOR all the way through gimple
3917 compilation as a general initializer. */
3918 for (ix
= 0; VEC_iterate (constructor_elt
, elts
, ix
, ce
); ix
++)
3920 enum gimplify_status tret
;
3921 tret
= gimplify_expr (&ce
->value
, pre_p
, post_p
, is_gimple_val
,
3923 if (tret
== GS_ERROR
)
3926 if (!is_gimple_reg (TREE_OPERAND (*expr_p
, 0)))
3927 TREE_OPERAND (*expr_p
, 1) = get_formal_tmp_var (ctor
, pre_p
);
3932 /* So how did we get a CONSTRUCTOR for a scalar type? */
3936 if (ret
== GS_ERROR
)
3938 else if (want_value
)
3945 /* If we have gimplified both sides of the initializer but have
3946 not emitted an assignment, do so now. */
3949 tree lhs
= TREE_OPERAND (*expr_p
, 0);
3950 tree rhs
= TREE_OPERAND (*expr_p
, 1);
3951 gimple init
= gimple_build_assign (lhs
, rhs
);
3952 gimplify_seq_add_stmt (pre_p
, init
);
3960 /* Given a pointer value OP0, return a simplified version of an
3961 indirection through OP0, or NULL_TREE if no simplification is
3962 possible. Note that the resulting type may be different from
3963 the type pointed to in the sense that it is still compatible
3964 from the langhooks point of view. */
3967 gimple_fold_indirect_ref (tree t
)
3969 tree type
= TREE_TYPE (TREE_TYPE (t
));
3973 STRIP_USELESS_TYPE_CONVERSION (sub
);
3974 subtype
= TREE_TYPE (sub
);
3975 if (!POINTER_TYPE_P (subtype
))
3978 if (TREE_CODE (sub
) == ADDR_EXPR
)
3980 tree op
= TREE_OPERAND (sub
, 0);
3981 tree optype
= TREE_TYPE (op
);
3983 if (useless_type_conversion_p (type
, optype
))
3986 /* *(foo *)&fooarray => fooarray[0] */
3987 if (TREE_CODE (optype
) == ARRAY_TYPE
3988 && useless_type_conversion_p (type
, TREE_TYPE (optype
)))
3990 tree type_domain
= TYPE_DOMAIN (optype
);
3991 tree min_val
= size_zero_node
;
3992 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
3993 min_val
= TYPE_MIN_VALUE (type_domain
);
3994 return build4 (ARRAY_REF
, type
, op
, min_val
, NULL_TREE
, NULL_TREE
);
3998 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
3999 if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
4000 && useless_type_conversion_p (type
, TREE_TYPE (TREE_TYPE (subtype
))))
4003 tree min_val
= size_zero_node
;
4005 sub
= gimple_fold_indirect_ref (sub
);
4007 sub
= build1 (INDIRECT_REF
, TREE_TYPE (subtype
), osub
);
4008 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
4009 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
4010 min_val
= TYPE_MIN_VALUE (type_domain
);
4011 return build4 (ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
, NULL_TREE
);
4017 /* Given a pointer value OP0, return a simplified version of an
4018 indirection through OP0, or NULL_TREE if no simplification is
4019 possible. This may only be applied to a rhs of an expression.
4020 Note that the resulting type may be different from the type pointed
4021 to in the sense that it is still compatible from the langhooks
4025 gimple_fold_indirect_ref_rhs (tree t
)
4027 return gimple_fold_indirect_ref (t
);
4030 /* Subroutine of gimplify_modify_expr to do simplifications of
4031 MODIFY_EXPRs based on the code of the RHS. We loop for as long as
4032 something changes. */
4034 static enum gimplify_status
4035 gimplify_modify_expr_rhs (tree
*expr_p
, tree
*from_p
, tree
*to_p
,
4036 gimple_seq
*pre_p
, gimple_seq
*post_p
,
4039 enum gimplify_status ret
= GS_OK
;
4041 while (ret
!= GS_UNHANDLED
)
4042 switch (TREE_CODE (*from_p
))
4045 /* If we're assigning from a read-only variable initialized with
4046 a constructor, do the direct assignment from the constructor,
4047 but only if neither source nor target are volatile since this
4048 latter assignment might end up being done on a per-field basis. */
4049 if (DECL_INITIAL (*from_p
)
4050 && TREE_READONLY (*from_p
)
4051 && !TREE_THIS_VOLATILE (*from_p
)
4052 && !TREE_THIS_VOLATILE (*to_p
)
4053 && TREE_CODE (DECL_INITIAL (*from_p
)) == CONSTRUCTOR
)
4055 tree old_from
= *from_p
;
4057 /* Move the constructor into the RHS. */
4058 *from_p
= unshare_expr (DECL_INITIAL (*from_p
));
4060 /* Let's see if gimplify_init_constructor will need to put
4061 it in memory. If so, revert the change. */
4062 ret
= gimplify_init_constructor (expr_p
, NULL
, NULL
, false, true);
4063 if (ret
== GS_ERROR
)
4078 /* If we have code like
4082 where the type of "x" is a (possibly cv-qualified variant
4083 of "A"), treat the entire expression as identical to "x".
4084 This kind of code arises in C++ when an object is bound
4085 to a const reference, and if "x" is a TARGET_EXPR we want
4086 to take advantage of the optimization below. */
4087 tree t
= gimple_fold_indirect_ref_rhs (TREE_OPERAND (*from_p
, 0));
4100 /* If we are initializing something from a TARGET_EXPR, strip the
4101 TARGET_EXPR and initialize it directly, if possible. This can't
4102 be done if the initializer is void, since that implies that the
4103 temporary is set in some non-trivial way.
4105 ??? What about code that pulls out the temp and uses it
4106 elsewhere? I think that such code never uses the TARGET_EXPR as
4107 an initializer. If I'm wrong, we'll die because the temp won't
4108 have any RTL. In that case, I guess we'll need to replace
4109 references somehow. */
4110 tree init
= TARGET_EXPR_INITIAL (*from_p
);
4113 && !VOID_TYPE_P (TREE_TYPE (init
)))
4124 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
4126 gimplify_compound_expr (from_p
, pre_p
, true);
4131 /* If we're initializing from a CONSTRUCTOR, break this into
4132 individual MODIFY_EXPRs. */
4133 return gimplify_init_constructor (expr_p
, pre_p
, post_p
, want_value
,
4137 /* If we're assigning to a non-register type, push the assignment
4138 down into the branches. This is mandatory for ADDRESSABLE types,
4139 since we cannot generate temporaries for such, but it saves a
4140 copy in other cases as well. */
4141 if (!is_gimple_reg_type (TREE_TYPE (*from_p
)))
4143 /* This code should mirror the code in gimplify_cond_expr. */
4144 enum tree_code code
= TREE_CODE (*expr_p
);
4145 tree cond
= *from_p
;
4146 tree result
= *to_p
;
4148 ret
= gimplify_expr (&result
, pre_p
, post_p
,
4149 is_gimple_lvalue
, fb_lvalue
);
4150 if (ret
!= GS_ERROR
)
4153 if (TREE_TYPE (TREE_OPERAND (cond
, 1)) != void_type_node
)
4154 TREE_OPERAND (cond
, 1)
4155 = build2 (code
, void_type_node
, result
,
4156 TREE_OPERAND (cond
, 1));
4157 if (TREE_TYPE (TREE_OPERAND (cond
, 2)) != void_type_node
)
4158 TREE_OPERAND (cond
, 2)
4159 = build2 (code
, void_type_node
, unshare_expr (result
),
4160 TREE_OPERAND (cond
, 2));
4162 TREE_TYPE (cond
) = void_type_node
;
4163 recalculate_side_effects (cond
);
4167 gimplify_and_add (cond
, pre_p
);
4168 *expr_p
= unshare_expr (result
);
4179 /* For calls that return in memory, give *to_p as the CALL_EXPR's
4180 return slot so that we don't generate a temporary. */
4181 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p
)
4182 && aggregate_value_p (*from_p
, *from_p
))
4186 if (!(rhs_predicate_for (*to_p
))(*from_p
))
4187 /* If we need a temporary, *to_p isn't accurate. */
4189 else if (TREE_CODE (*to_p
) == RESULT_DECL
4190 && DECL_NAME (*to_p
) == NULL_TREE
4191 && needs_to_live_in_memory (*to_p
))
4192 /* It's OK to use the return slot directly unless it's an NRV. */
4194 else if (is_gimple_reg_type (TREE_TYPE (*to_p
))
4195 || (DECL_P (*to_p
) && DECL_REGISTER (*to_p
)))
4196 /* Don't force regs into memory. */
4198 else if (TREE_CODE (*expr_p
) == INIT_EXPR
)
4199 /* It's OK to use the target directly if it's being
4202 else if (!is_gimple_non_addressable (*to_p
))
4203 /* Don't use the original target if it's already addressable;
4204 if its address escapes, and the called function uses the
4205 NRV optimization, a conforming program could see *to_p
4206 change before the called function returns; see c++/19317.
4207 When optimizing, the return_slot pass marks more functions
4208 as safe after we have escape info. */
4215 CALL_EXPR_RETURN_SLOT_OPT (*from_p
) = 1;
4216 mark_addressable (*to_p
);
4223 /* If we're initializing from a container, push the initialization
4225 case CLEANUP_POINT_EXPR
:
4227 case STATEMENT_LIST
:
4229 tree wrap
= *from_p
;
4232 ret
= gimplify_expr (to_p
, pre_p
, post_p
, is_gimple_min_lval
,
4234 if (ret
!= GS_ERROR
)
4237 t
= voidify_wrapper_expr (wrap
, *expr_p
);
4238 gcc_assert (t
== *expr_p
);
4242 gimplify_and_add (wrap
, pre_p
);
4243 *expr_p
= unshare_expr (*to_p
);
4250 case COMPOUND_LITERAL_EXPR
:
4252 tree complit
= TREE_OPERAND (*expr_p
, 1);
4253 tree decl_s
= COMPOUND_LITERAL_EXPR_DECL_EXPR (complit
);
4254 tree decl
= DECL_EXPR_DECL (decl_s
);
4255 tree init
= DECL_INITIAL (decl
);
4257 /* struct T x = (struct T) { 0, 1, 2 } can be optimized
4258 into struct T x = { 0, 1, 2 } if the address of the
4259 compound literal has never been taken. */
4260 if (!TREE_ADDRESSABLE (complit
)
4261 && !TREE_ADDRESSABLE (decl
)
4264 *expr_p
= copy_node (*expr_p
);
4265 TREE_OPERAND (*expr_p
, 1) = init
;
4279 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
4280 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
4281 DECL_GIMPLE_REG_P set.
4283 IMPORTANT NOTE: This promotion is performed by introducing a load of the
4284 other, unmodified part of the complex object just before the total store.
4285 As a consequence, if the object is still uninitialized, an undefined value
4286 will be loaded into a register, which may result in a spurious exception
4287 if the register is floating-point and the value happens to be a signaling
4288 NaN for example. Then the fully-fledged complex operations lowering pass
4289 followed by a DCE pass are necessary in order to fix things up. */
4291 static enum gimplify_status
4292 gimplify_modify_expr_complex_part (tree
*expr_p
, gimple_seq
*pre_p
,
4295 enum tree_code code
, ocode
;
4296 tree lhs
, rhs
, new_rhs
, other
, realpart
, imagpart
;
4298 lhs
= TREE_OPERAND (*expr_p
, 0);
4299 rhs
= TREE_OPERAND (*expr_p
, 1);
4300 code
= TREE_CODE (lhs
);
4301 lhs
= TREE_OPERAND (lhs
, 0);
4303 ocode
= code
== REALPART_EXPR
? IMAGPART_EXPR
: REALPART_EXPR
;
4304 other
= build1 (ocode
, TREE_TYPE (rhs
), lhs
);
4305 other
= get_formal_tmp_var (other
, pre_p
);
4307 realpart
= code
== REALPART_EXPR
? rhs
: other
;
4308 imagpart
= code
== REALPART_EXPR
? other
: rhs
;
4310 if (TREE_CONSTANT (realpart
) && TREE_CONSTANT (imagpart
))
4311 new_rhs
= build_complex (TREE_TYPE (lhs
), realpart
, imagpart
);
4313 new_rhs
= build2 (COMPLEX_EXPR
, TREE_TYPE (lhs
), realpart
, imagpart
);
4315 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (lhs
, new_rhs
));
4316 *expr_p
= (want_value
) ? rhs
: NULL_TREE
;
4322 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
4328 PRE_P points to the list where side effects that must happen before
4329 *EXPR_P should be stored.
4331 POST_P points to the list where side effects that must happen after
4332 *EXPR_P should be stored.
4334 WANT_VALUE is nonzero iff we want to use the value of this expression
4335 in another expression. */
4337 static enum gimplify_status
4338 gimplify_modify_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
4341 tree
*from_p
= &TREE_OPERAND (*expr_p
, 1);
4342 tree
*to_p
= &TREE_OPERAND (*expr_p
, 0);
4343 enum gimplify_status ret
= GS_UNHANDLED
;
4345 location_t loc
= EXPR_LOCATION (*expr_p
);
4347 gcc_assert (TREE_CODE (*expr_p
) == MODIFY_EXPR
4348 || TREE_CODE (*expr_p
) == INIT_EXPR
);
4350 /* Insert pointer conversions required by the middle-end that are not
4351 required by the frontend. This fixes middle-end type checking for
4352 for example gcc.dg/redecl-6.c. */
4353 if (POINTER_TYPE_P (TREE_TYPE (*to_p
)))
4355 STRIP_USELESS_TYPE_CONVERSION (*from_p
);
4356 if (!useless_type_conversion_p (TREE_TYPE (*to_p
), TREE_TYPE (*from_p
)))
4357 *from_p
= fold_convert_loc (loc
, TREE_TYPE (*to_p
), *from_p
);
4360 /* See if any simplifications can be done based on what the RHS is. */
4361 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
4363 if (ret
!= GS_UNHANDLED
)
4366 /* For zero sized types only gimplify the left hand side and right hand
4367 side as statements and throw away the assignment. Do this after
4368 gimplify_modify_expr_rhs so we handle TARGET_EXPRs of addressable
4370 if (zero_sized_type (TREE_TYPE (*from_p
)) && !want_value
)
4372 gimplify_stmt (from_p
, pre_p
);
4373 gimplify_stmt (to_p
, pre_p
);
4374 *expr_p
= NULL_TREE
;
4378 /* If the value being copied is of variable width, compute the length
4379 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
4380 before gimplifying any of the operands so that we can resolve any
4381 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
4382 the size of the expression to be copied, not of the destination, so
4383 that is what we must do here. */
4384 maybe_with_size_expr (from_p
);
4386 ret
= gimplify_expr (to_p
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
4387 if (ret
== GS_ERROR
)
4390 /* As a special case, we have to temporarily allow for assignments
4391 with a CALL_EXPR on the RHS. Since in GIMPLE a function call is
4392 a toplevel statement, when gimplifying the GENERIC expression
4393 MODIFY_EXPR <a, CALL_EXPR <foo>>, we cannot create the tuple
4394 GIMPLE_ASSIGN <a, GIMPLE_CALL <foo>>.
4396 Instead, we need to create the tuple GIMPLE_CALL <a, foo>. To
4397 prevent gimplify_expr from trying to create a new temporary for
4398 foo's LHS, we tell it that it should only gimplify until it
4399 reaches the CALL_EXPR. On return from gimplify_expr, the newly
4400 created GIMPLE_CALL <foo> will be the last statement in *PRE_P
4401 and all we need to do here is set 'a' to be its LHS. */
4402 ret
= gimplify_expr (from_p
, pre_p
, post_p
, rhs_predicate_for (*to_p
),
4404 if (ret
== GS_ERROR
)
4407 /* Now see if the above changed *from_p to something we handle specially. */
4408 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
4410 if (ret
!= GS_UNHANDLED
)
4413 /* If we've got a variable sized assignment between two lvalues (i.e. does
4414 not involve a call), then we can make things a bit more straightforward
4415 by converting the assignment to memcpy or memset. */
4416 if (TREE_CODE (*from_p
) == WITH_SIZE_EXPR
)
4418 tree from
= TREE_OPERAND (*from_p
, 0);
4419 tree size
= TREE_OPERAND (*from_p
, 1);
4421 if (TREE_CODE (from
) == CONSTRUCTOR
)
4422 return gimplify_modify_expr_to_memset (expr_p
, size
, want_value
, pre_p
);
4424 if (is_gimple_addressable (from
))
4427 return gimplify_modify_expr_to_memcpy (expr_p
, size
, want_value
,
4432 /* Transform partial stores to non-addressable complex variables into
4433 total stores. This allows us to use real instead of virtual operands
4434 for these variables, which improves optimization. */
4435 if ((TREE_CODE (*to_p
) == REALPART_EXPR
4436 || TREE_CODE (*to_p
) == IMAGPART_EXPR
)
4437 && is_gimple_reg (TREE_OPERAND (*to_p
, 0)))
4438 return gimplify_modify_expr_complex_part (expr_p
, pre_p
, want_value
);
4440 /* Try to alleviate the effects of the gimplification creating artificial
4441 temporaries (see for example is_gimple_reg_rhs) on the debug info. */
4442 if (!gimplify_ctxp
->into_ssa
4444 && DECL_IGNORED_P (*from_p
)
4446 && !DECL_IGNORED_P (*to_p
))
4448 if (!DECL_NAME (*from_p
) && DECL_NAME (*to_p
))
4450 = create_tmp_var_name (IDENTIFIER_POINTER (DECL_NAME (*to_p
)));
4451 DECL_DEBUG_EXPR_IS_FROM (*from_p
) = 1;
4452 SET_DECL_DEBUG_EXPR (*from_p
, *to_p
);
4455 if (TREE_CODE (*from_p
) == CALL_EXPR
)
4457 /* Since the RHS is a CALL_EXPR, we need to create a GIMPLE_CALL
4458 instead of a GIMPLE_ASSIGN. */
4459 assign
= gimple_build_call_from_tree (*from_p
);
4460 gimple_call_set_lhs (assign
, *to_p
);
4464 assign
= gimple_build_assign (*to_p
, *from_p
);
4465 gimple_set_location (assign
, EXPR_LOCATION (*expr_p
));
4468 gimplify_seq_add_stmt (pre_p
, assign
);
4470 if (gimplify_ctxp
->into_ssa
&& is_gimple_reg (*to_p
))
4472 /* If we've somehow already got an SSA_NAME on the LHS, then
4473 we've probably modified it twice. Not good. */
4474 gcc_assert (TREE_CODE (*to_p
) != SSA_NAME
);
4475 *to_p
= make_ssa_name (*to_p
, assign
);
4476 gimple_set_lhs (assign
, *to_p
);
4481 *expr_p
= unshare_expr (*to_p
);
4490 /* Gimplify a comparison between two variable-sized objects. Do this
4491 with a call to BUILT_IN_MEMCMP. */
4493 static enum gimplify_status
4494 gimplify_variable_sized_compare (tree
*expr_p
)
4496 tree op0
= TREE_OPERAND (*expr_p
, 0);
4497 tree op1
= TREE_OPERAND (*expr_p
, 1);
4498 tree t
, arg
, dest
, src
;
4499 location_t loc
= EXPR_LOCATION (*expr_p
);
4501 arg
= TYPE_SIZE_UNIT (TREE_TYPE (op0
));
4502 arg
= unshare_expr (arg
);
4503 arg
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (arg
, op0
);
4504 src
= build_fold_addr_expr_loc (loc
, op1
);
4505 dest
= build_fold_addr_expr_loc (loc
, op0
);
4506 t
= implicit_built_in_decls
[BUILT_IN_MEMCMP
];
4507 t
= build_call_expr_loc (loc
, t
, 3, dest
, src
, arg
);
4509 = build2 (TREE_CODE (*expr_p
), TREE_TYPE (*expr_p
), t
, integer_zero_node
);
4514 /* Gimplify a comparison between two aggregate objects of integral scalar
4515 mode as a comparison between the bitwise equivalent scalar values. */
4517 static enum gimplify_status
4518 gimplify_scalar_mode_aggregate_compare (tree
*expr_p
)
4520 location_t loc
= EXPR_LOCATION (*expr_p
);
4521 tree op0
= TREE_OPERAND (*expr_p
, 0);
4522 tree op1
= TREE_OPERAND (*expr_p
, 1);
4524 tree type
= TREE_TYPE (op0
);
4525 tree scalar_type
= lang_hooks
.types
.type_for_mode (TYPE_MODE (type
), 1);
4527 op0
= fold_build1_loc (loc
, VIEW_CONVERT_EXPR
, scalar_type
, op0
);
4528 op1
= fold_build1_loc (loc
, VIEW_CONVERT_EXPR
, scalar_type
, op1
);
4531 = fold_build2_loc (loc
, TREE_CODE (*expr_p
), TREE_TYPE (*expr_p
), op0
, op1
);
4536 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
4537 points to the expression to gimplify.
4539 Expressions of the form 'a && b' are gimplified to:
4541 a && b ? true : false
4543 LOCUS is the source location to be put on the generated COND_EXPR.
4544 gimplify_cond_expr will do the rest. */
4546 static enum gimplify_status
4547 gimplify_boolean_expr (tree
*expr_p
, location_t locus
)
4549 /* Preserve the original type of the expression. */
4550 tree type
= TREE_TYPE (*expr_p
);
4552 *expr_p
= build3 (COND_EXPR
, type
, *expr_p
,
4553 fold_convert_loc (locus
, type
, boolean_true_node
),
4554 fold_convert_loc (locus
, type
, boolean_false_node
));
4556 SET_EXPR_LOCATION (*expr_p
, locus
);
4561 /* Gimplifies an expression sequence. This function gimplifies each
4562 expression and re-writes the original expression with the last
4563 expression of the sequence in GIMPLE form.
4565 PRE_P points to the list where the side effects for all the
4566 expressions in the sequence will be emitted.
4568 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
4570 static enum gimplify_status
4571 gimplify_compound_expr (tree
*expr_p
, gimple_seq
*pre_p
, bool want_value
)
4577 tree
*sub_p
= &TREE_OPERAND (t
, 0);
4579 if (TREE_CODE (*sub_p
) == COMPOUND_EXPR
)
4580 gimplify_compound_expr (sub_p
, pre_p
, false);
4582 gimplify_stmt (sub_p
, pre_p
);
4584 t
= TREE_OPERAND (t
, 1);
4586 while (TREE_CODE (t
) == COMPOUND_EXPR
);
4593 gimplify_stmt (expr_p
, pre_p
);
4599 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
4600 gimplify. After gimplification, EXPR_P will point to a new temporary
4601 that holds the original value of the SAVE_EXPR node.
4603 PRE_P points to the list where side effects that must happen before
4604 *EXPR_P should be stored. */
4606 static enum gimplify_status
4607 gimplify_save_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
4609 enum gimplify_status ret
= GS_ALL_DONE
;
4612 gcc_assert (TREE_CODE (*expr_p
) == SAVE_EXPR
);
4613 val
= TREE_OPERAND (*expr_p
, 0);
4615 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
4616 if (!SAVE_EXPR_RESOLVED_P (*expr_p
))
4618 /* The operand may be a void-valued expression such as SAVE_EXPRs
4619 generated by the Java frontend for class initialization. It is
4620 being executed only for its side-effects. */
4621 if (TREE_TYPE (val
) == void_type_node
)
4623 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
4624 is_gimple_stmt
, fb_none
);
4628 val
= get_initialized_tmp_var (val
, pre_p
, post_p
);
4630 TREE_OPERAND (*expr_p
, 0) = val
;
4631 SAVE_EXPR_RESOLVED_P (*expr_p
) = 1;
4639 /* Re-write the ADDR_EXPR node pointed to by EXPR_P
4646 PRE_P points to the list where side effects that must happen before
4647 *EXPR_P should be stored.
4649 POST_P points to the list where side effects that must happen after
4650 *EXPR_P should be stored. */
4652 static enum gimplify_status
4653 gimplify_addr_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
4655 tree expr
= *expr_p
;
4656 tree op0
= TREE_OPERAND (expr
, 0);
4657 enum gimplify_status ret
;
4658 location_t loc
= EXPR_LOCATION (*expr_p
);
4660 switch (TREE_CODE (op0
))
4663 case MISALIGNED_INDIRECT_REF
:
4665 /* Check if we are dealing with an expression of the form '&*ptr'.
4666 While the front end folds away '&*ptr' into 'ptr', these
4667 expressions may be generated internally by the compiler (e.g.,
4668 builtins like __builtin_va_end). */
4669 /* Caution: the silent array decomposition semantics we allow for
4670 ADDR_EXPR means we can't always discard the pair. */
4671 /* Gimplification of the ADDR_EXPR operand may drop
4672 cv-qualification conversions, so make sure we add them if
4675 tree op00
= TREE_OPERAND (op0
, 0);
4676 tree t_expr
= TREE_TYPE (expr
);
4677 tree t_op00
= TREE_TYPE (op00
);
4679 if (!useless_type_conversion_p (t_expr
, t_op00
))
4680 op00
= fold_convert_loc (loc
, TREE_TYPE (expr
), op00
);
4686 case VIEW_CONVERT_EXPR
:
4687 /* Take the address of our operand and then convert it to the type of
4690 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
4691 all clear. The impact of this transformation is even less clear. */
4693 /* If the operand is a useless conversion, look through it. Doing so
4694 guarantees that the ADDR_EXPR and its operand will remain of the
4696 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0
, 0)))
4697 op0
= TREE_OPERAND (op0
, 0);
4699 *expr_p
= fold_convert_loc (loc
, TREE_TYPE (expr
),
4700 build_fold_addr_expr_loc (loc
,
4701 TREE_OPERAND (op0
, 0)));
4706 /* We use fb_either here because the C frontend sometimes takes
4707 the address of a call that returns a struct; see
4708 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
4709 the implied temporary explicit. */
4711 /* Make the operand addressable. */
4712 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, post_p
,
4713 is_gimple_addressable
, fb_either
);
4714 if (ret
== GS_ERROR
)
4717 /* Then mark it. Beware that it may not be possible to do so directly
4718 if a temporary has been created by the gimplification. */
4719 prepare_gimple_addressable (&TREE_OPERAND (expr
, 0), pre_p
);
4721 op0
= TREE_OPERAND (expr
, 0);
4723 /* For various reasons, the gimplification of the expression
4724 may have made a new INDIRECT_REF. */
4725 if (TREE_CODE (op0
) == INDIRECT_REF
)
4726 goto do_indirect_ref
;
4728 /* Make sure TREE_CONSTANT and TREE_SIDE_EFFECTS are set properly. */
4729 recompute_tree_invariant_for_addr_expr (expr
);
4731 mark_addressable (TREE_OPERAND (expr
, 0));
4738 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
4739 value; output operands should be a gimple lvalue. */
4741 static enum gimplify_status
4742 gimplify_asm_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
4746 const char **oconstraints
;
4749 const char *constraint
;
4750 bool allows_mem
, allows_reg
, is_inout
;
4751 enum gimplify_status ret
, tret
;
4753 VEC(tree
, gc
) *inputs
;
4754 VEC(tree
, gc
) *outputs
;
4755 VEC(tree
, gc
) *clobbers
;
4759 noutputs
= list_length (ASM_OUTPUTS (expr
));
4760 oconstraints
= (const char **) alloca ((noutputs
) * sizeof (const char *));
4762 inputs
= outputs
= clobbers
= NULL
;
4765 link_next
= NULL_TREE
;
4766 for (i
= 0, link
= ASM_OUTPUTS (expr
); link
; ++i
, link
= link_next
)
4769 size_t constraint_len
;
4771 link_next
= TREE_CHAIN (link
);
4775 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
4776 constraint_len
= strlen (constraint
);
4777 if (constraint_len
== 0)
4780 ok
= parse_output_constraint (&constraint
, i
, 0, 0,
4781 &allows_mem
, &allows_reg
, &is_inout
);
4788 if (!allows_reg
&& allows_mem
)
4789 mark_addressable (TREE_VALUE (link
));
4791 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
4792 is_inout
? is_gimple_min_lval
: is_gimple_lvalue
,
4793 fb_lvalue
| fb_mayfail
);
4794 if (tret
== GS_ERROR
)
4796 error ("invalid lvalue in asm output %d", i
);
4800 VEC_safe_push (tree
, gc
, outputs
, link
);
4801 TREE_CHAIN (link
) = NULL_TREE
;
4805 /* An input/output operand. To give the optimizers more
4806 flexibility, split it into separate input and output
4811 /* Turn the in/out constraint into an output constraint. */
4812 char *p
= xstrdup (constraint
);
4814 TREE_VALUE (TREE_PURPOSE (link
)) = build_string (constraint_len
, p
);
4816 /* And add a matching input constraint. */
4819 sprintf (buf
, "%d", i
);
4821 /* If there are multiple alternatives in the constraint,
4822 handle each of them individually. Those that allow register
4823 will be replaced with operand number, the others will stay
4825 if (strchr (p
, ',') != NULL
)
4827 size_t len
= 0, buflen
= strlen (buf
);
4828 char *beg
, *end
, *str
, *dst
;
4832 end
= strchr (beg
, ',');
4834 end
= strchr (beg
, '\0');
4835 if ((size_t) (end
- beg
) < buflen
)
4838 len
+= end
- beg
+ 1;
4845 str
= (char *) alloca (len
);
4846 for (beg
= p
+ 1, dst
= str
;;)
4849 bool mem_p
, reg_p
, inout_p
;
4851 end
= strchr (beg
, ',');
4856 parse_output_constraint (&tem
, i
, 0, 0,
4857 &mem_p
, ®_p
, &inout_p
);
4862 memcpy (dst
, buf
, buflen
);
4871 memcpy (dst
, beg
, len
);
4880 input
= build_string (dst
- str
, str
);
4883 input
= build_string (strlen (buf
), buf
);
4886 input
= build_string (constraint_len
- 1, constraint
+ 1);
4890 input
= build_tree_list (build_tree_list (NULL_TREE
, input
),
4891 unshare_expr (TREE_VALUE (link
)));
4892 ASM_INPUTS (expr
) = chainon (ASM_INPUTS (expr
), input
);
4896 link_next
= NULL_TREE
;
4897 for (link
= ASM_INPUTS (expr
); link
; ++i
, link
= link_next
)
4899 link_next
= TREE_CHAIN (link
);
4900 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
4901 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
4902 oconstraints
, &allows_mem
, &allows_reg
);
4904 /* If we can't make copies, we can only accept memory. */
4905 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (link
))))
4911 error ("impossible constraint in %<asm%>");
4912 error ("non-memory input %d must stay in memory", i
);
4917 /* If the operand is a memory input, it should be an lvalue. */
4918 if (!allows_reg
&& allows_mem
)
4920 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
4921 is_gimple_lvalue
, fb_lvalue
| fb_mayfail
);
4922 mark_addressable (TREE_VALUE (link
));
4923 if (tret
== GS_ERROR
)
4925 if (EXPR_HAS_LOCATION (TREE_VALUE (link
)))
4926 input_location
= EXPR_LOCATION (TREE_VALUE (link
));
4927 error ("memory input %d is not directly addressable", i
);
4933 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
4934 is_gimple_asm_val
, fb_rvalue
);
4935 if (tret
== GS_ERROR
)
4939 TREE_CHAIN (link
) = NULL_TREE
;
4940 VEC_safe_push (tree
, gc
, inputs
, link
);
4943 for (link
= ASM_CLOBBERS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
4944 VEC_safe_push (tree
, gc
, clobbers
, link
);
4946 /* Do not add ASMs with errors to the gimple IL stream. */
4947 if (ret
!= GS_ERROR
)
4949 stmt
= gimple_build_asm_vec (TREE_STRING_POINTER (ASM_STRING (expr
)),
4950 inputs
, outputs
, clobbers
);
4952 gimple_asm_set_volatile (stmt
, ASM_VOLATILE_P (expr
));
4953 gimple_asm_set_input (stmt
, ASM_INPUT_P (expr
));
4955 gimplify_seq_add_stmt (pre_p
, stmt
);
4961 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
4962 GIMPLE_WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
4963 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
4964 return to this function.
4966 FIXME should we complexify the prequeue handling instead? Or use flags
4967 for all the cleanups and let the optimizer tighten them up? The current
4968 code seems pretty fragile; it will break on a cleanup within any
4969 non-conditional nesting. But any such nesting would be broken, anyway;
4970 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
4971 and continues out of it. We can do that at the RTL level, though, so
4972 having an optimizer to tighten up try/finally regions would be a Good
4975 static enum gimplify_status
4976 gimplify_cleanup_point_expr (tree
*expr_p
, gimple_seq
*pre_p
)
4978 gimple_stmt_iterator iter
;
4979 gimple_seq body_sequence
= NULL
;
4981 tree temp
= voidify_wrapper_expr (*expr_p
, NULL
);
4983 /* We only care about the number of conditions between the innermost
4984 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
4985 any cleanups collected outside the CLEANUP_POINT_EXPR. */
4986 int old_conds
= gimplify_ctxp
->conditions
;
4987 gimple_seq old_cleanups
= gimplify_ctxp
->conditional_cleanups
;
4988 gimplify_ctxp
->conditions
= 0;
4989 gimplify_ctxp
->conditional_cleanups
= NULL
;
4991 gimplify_stmt (&TREE_OPERAND (*expr_p
, 0), &body_sequence
);
4993 gimplify_ctxp
->conditions
= old_conds
;
4994 gimplify_ctxp
->conditional_cleanups
= old_cleanups
;
4996 for (iter
= gsi_start (body_sequence
); !gsi_end_p (iter
); )
4998 gimple wce
= gsi_stmt (iter
);
5000 if (gimple_code (wce
) == GIMPLE_WITH_CLEANUP_EXPR
)
5002 if (gsi_one_before_end_p (iter
))
5004 /* Note that gsi_insert_seq_before and gsi_remove do not
5005 scan operands, unlike some other sequence mutators. */
5006 gsi_insert_seq_before_without_update (&iter
,
5007 gimple_wce_cleanup (wce
),
5009 gsi_remove (&iter
, true);
5016 enum gimple_try_flags kind
;
5018 if (gimple_wce_cleanup_eh_only (wce
))
5019 kind
= GIMPLE_TRY_CATCH
;
5021 kind
= GIMPLE_TRY_FINALLY
;
5022 seq
= gsi_split_seq_after (iter
);
5024 gtry
= gimple_build_try (seq
, gimple_wce_cleanup (wce
), kind
);
5025 /* Do not use gsi_replace here, as it may scan operands.
5026 We want to do a simple structural modification only. */
5027 *gsi_stmt_ptr (&iter
) = gtry
;
5028 iter
= gsi_start (seq
);
5035 gimplify_seq_add_seq (pre_p
, body_sequence
);
5048 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
5049 is the cleanup action required. EH_ONLY is true if the cleanup should
5050 only be executed if an exception is thrown, not on normal exit. */
5053 gimple_push_cleanup (tree var
, tree cleanup
, bool eh_only
, gimple_seq
*pre_p
)
5056 gimple_seq cleanup_stmts
= NULL
;
5058 /* Errors can result in improperly nested cleanups. Which results in
5059 confusion when trying to resolve the GIMPLE_WITH_CLEANUP_EXPR. */
5060 if (errorcount
|| sorrycount
)
5063 if (gimple_conditional_context ())
5065 /* If we're in a conditional context, this is more complex. We only
5066 want to run the cleanup if we actually ran the initialization that
5067 necessitates it, but we want to run it after the end of the
5068 conditional context. So we wrap the try/finally around the
5069 condition and use a flag to determine whether or not to actually
5070 run the destructor. Thus
5074 becomes (approximately)
5078 if (test) { A::A(temp); flag = 1; val = f(temp); }
5081 if (flag) A::~A(temp);
5085 tree flag
= create_tmp_var (boolean_type_node
, "cleanup");
5086 gimple ffalse
= gimple_build_assign (flag
, boolean_false_node
);
5087 gimple ftrue
= gimple_build_assign (flag
, boolean_true_node
);
5089 cleanup
= build3 (COND_EXPR
, void_type_node
, flag
, cleanup
, NULL
);
5090 gimplify_stmt (&cleanup
, &cleanup_stmts
);
5091 wce
= gimple_build_wce (cleanup_stmts
);
5093 gimplify_seq_add_stmt (&gimplify_ctxp
->conditional_cleanups
, ffalse
);
5094 gimplify_seq_add_stmt (&gimplify_ctxp
->conditional_cleanups
, wce
);
5095 gimplify_seq_add_stmt (pre_p
, ftrue
);
5097 /* Because of this manipulation, and the EH edges that jump
5098 threading cannot redirect, the temporary (VAR) will appear
5099 to be used uninitialized. Don't warn. */
5100 TREE_NO_WARNING (var
) = 1;
5104 gimplify_stmt (&cleanup
, &cleanup_stmts
);
5105 wce
= gimple_build_wce (cleanup_stmts
);
5106 gimple_wce_set_cleanup_eh_only (wce
, eh_only
);
5107 gimplify_seq_add_stmt (pre_p
, wce
);
5111 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
5113 static enum gimplify_status
5114 gimplify_target_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
5116 tree targ
= *expr_p
;
5117 tree temp
= TARGET_EXPR_SLOT (targ
);
5118 tree init
= TARGET_EXPR_INITIAL (targ
);
5119 enum gimplify_status ret
;
5123 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
5124 to the temps list. Handle also variable length TARGET_EXPRs. */
5125 if (TREE_CODE (DECL_SIZE (temp
)) != INTEGER_CST
)
5127 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (temp
)))
5128 gimplify_type_sizes (TREE_TYPE (temp
), pre_p
);
5129 gimplify_vla_decl (temp
, pre_p
);
5132 gimple_add_tmp_var (temp
);
5134 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
5135 expression is supposed to initialize the slot. */
5136 if (VOID_TYPE_P (TREE_TYPE (init
)))
5137 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
, fb_none
);
5140 tree init_expr
= build2 (INIT_EXPR
, void_type_node
, temp
, init
);
5142 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
, fb_none
);
5144 ggc_free (init_expr
);
5146 if (ret
== GS_ERROR
)
5148 /* PR c++/28266 Make sure this is expanded only once. */
5149 TARGET_EXPR_INITIAL (targ
) = NULL_TREE
;
5153 gimplify_and_add (init
, pre_p
);
5155 /* If needed, push the cleanup for the temp. */
5156 if (TARGET_EXPR_CLEANUP (targ
))
5157 gimple_push_cleanup (temp
, TARGET_EXPR_CLEANUP (targ
),
5158 CLEANUP_EH_ONLY (targ
), pre_p
);
5160 /* Only expand this once. */
5161 TREE_OPERAND (targ
, 3) = init
;
5162 TARGET_EXPR_INITIAL (targ
) = NULL_TREE
;
5165 /* We should have expanded this before. */
5166 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp
));
5172 /* Gimplification of expression trees. */
5174 /* Gimplify an expression which appears at statement context. The
5175 corresponding GIMPLE statements are added to *SEQ_P. If *SEQ_P is
5176 NULL, a new sequence is allocated.
5178 Return true if we actually added a statement to the queue. */
5181 gimplify_stmt (tree
*stmt_p
, gimple_seq
*seq_p
)
5183 gimple_seq_node last
;
5186 *seq_p
= gimple_seq_alloc ();
5188 last
= gimple_seq_last (*seq_p
);
5189 gimplify_expr (stmt_p
, seq_p
, NULL
, is_gimple_stmt
, fb_none
);
5190 return last
!= gimple_seq_last (*seq_p
);
5194 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
5195 to CTX. If entries already exist, force them to be some flavor of private.
5196 If there is no enclosing parallel, do nothing. */
5199 omp_firstprivatize_variable (struct gimplify_omp_ctx
*ctx
, tree decl
)
5203 if (decl
== NULL
|| !DECL_P (decl
))
5208 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5211 if (n
->value
& GOVD_SHARED
)
5212 n
->value
= GOVD_FIRSTPRIVATE
| (n
->value
& GOVD_SEEN
);
5216 else if (ctx
->region_type
!= ORT_WORKSHARE
)
5217 omp_add_variable (ctx
, decl
, GOVD_FIRSTPRIVATE
);
5219 ctx
= ctx
->outer_context
;
5224 /* Similarly for each of the type sizes of TYPE. */
5227 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx
*ctx
, tree type
)
5229 if (type
== NULL
|| type
== error_mark_node
)
5231 type
= TYPE_MAIN_VARIANT (type
);
5233 if (pointer_set_insert (ctx
->privatized_types
, type
))
5236 switch (TREE_CODE (type
))
5242 case FIXED_POINT_TYPE
:
5243 omp_firstprivatize_variable (ctx
, TYPE_MIN_VALUE (type
));
5244 omp_firstprivatize_variable (ctx
, TYPE_MAX_VALUE (type
));
5248 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
5249 omp_firstprivatize_type_sizes (ctx
, TYPE_DOMAIN (type
));
5254 case QUAL_UNION_TYPE
:
5257 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
5258 if (TREE_CODE (field
) == FIELD_DECL
)
5260 omp_firstprivatize_variable (ctx
, DECL_FIELD_OFFSET (field
));
5261 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (field
));
5267 case REFERENCE_TYPE
:
5268 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
5275 omp_firstprivatize_variable (ctx
, TYPE_SIZE (type
));
5276 omp_firstprivatize_variable (ctx
, TYPE_SIZE_UNIT (type
));
5277 lang_hooks
.types
.omp_firstprivatize_type_sizes (ctx
, type
);
5280 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
5283 omp_add_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, unsigned int flags
)
5286 unsigned int nflags
;
5289 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
5292 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
5293 there are constructors involved somewhere. */
5294 if (TREE_ADDRESSABLE (TREE_TYPE (decl
))
5295 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
5298 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5301 /* We shouldn't be re-adding the decl with the same data
5303 gcc_assert ((n
->value
& GOVD_DATA_SHARE_CLASS
& flags
) == 0);
5304 /* The only combination of data sharing classes we should see is
5305 FIRSTPRIVATE and LASTPRIVATE. */
5306 nflags
= n
->value
| flags
;
5307 gcc_assert ((nflags
& GOVD_DATA_SHARE_CLASS
)
5308 == (GOVD_FIRSTPRIVATE
| GOVD_LASTPRIVATE
));
5313 /* When adding a variable-sized variable, we have to handle all sorts
5314 of additional bits of data: the pointer replacement variable, and
5315 the parameters of the type. */
5316 if (DECL_SIZE (decl
) && TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
5318 /* Add the pointer replacement variable as PRIVATE if the variable
5319 replacement is private, else FIRSTPRIVATE since we'll need the
5320 address of the original variable either for SHARED, or for the
5321 copy into or out of the context. */
5322 if (!(flags
& GOVD_LOCAL
))
5324 nflags
= flags
& GOVD_PRIVATE
? GOVD_PRIVATE
: GOVD_FIRSTPRIVATE
;
5325 nflags
|= flags
& GOVD_SEEN
;
5326 t
= DECL_VALUE_EXPR (decl
);
5327 gcc_assert (TREE_CODE (t
) == INDIRECT_REF
);
5328 t
= TREE_OPERAND (t
, 0);
5329 gcc_assert (DECL_P (t
));
5330 omp_add_variable (ctx
, t
, nflags
);
5333 /* Add all of the variable and type parameters (which should have
5334 been gimplified to a formal temporary) as FIRSTPRIVATE. */
5335 omp_firstprivatize_variable (ctx
, DECL_SIZE_UNIT (decl
));
5336 omp_firstprivatize_variable (ctx
, DECL_SIZE (decl
));
5337 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
5339 /* The variable-sized variable itself is never SHARED, only some form
5340 of PRIVATE. The sharing would take place via the pointer variable
5341 which we remapped above. */
5342 if (flags
& GOVD_SHARED
)
5343 flags
= GOVD_PRIVATE
| GOVD_DEBUG_PRIVATE
5344 | (flags
& (GOVD_SEEN
| GOVD_EXPLICIT
));
5346 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
5347 alloca statement we generate for the variable, so make sure it
5348 is available. This isn't automatically needed for the SHARED
5349 case, since we won't be allocating local storage then.
5350 For local variables TYPE_SIZE_UNIT might not be gimplified yet,
5351 in this case omp_notice_variable will be called later
5352 on when it is gimplified. */
5353 else if (! (flags
& GOVD_LOCAL
))
5354 omp_notice_variable (ctx
, TYPE_SIZE_UNIT (TREE_TYPE (decl
)), true);
5356 else if (lang_hooks
.decls
.omp_privatize_by_reference (decl
))
5358 gcc_assert ((flags
& GOVD_LOCAL
) == 0);
5359 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
5361 /* Similar to the direct variable sized case above, we'll need the
5362 size of references being privatized. */
5363 if ((flags
& GOVD_SHARED
) == 0)
5365 t
= TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl
)));
5366 if (TREE_CODE (t
) != INTEGER_CST
)
5367 omp_notice_variable (ctx
, t
, true);
5371 splay_tree_insert (ctx
->variables
, (splay_tree_key
)decl
, flags
);
5374 /* Record the fact that DECL was used within the OpenMP context CTX.
5375 IN_CODE is true when real code uses DECL, and false when we should
5376 merely emit default(none) errors. Return true if DECL is going to
5377 be remapped and thus DECL shouldn't be gimplified into its
5378 DECL_VALUE_EXPR (if any). */
5381 omp_notice_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, bool in_code
)
5384 unsigned flags
= in_code
? GOVD_SEEN
: 0;
5385 bool ret
= false, shared
;
5387 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
5390 /* Threadprivate variables are predetermined. */
5391 if (is_global_var (decl
))
5393 if (DECL_THREAD_LOCAL_P (decl
))
5396 if (DECL_HAS_VALUE_EXPR_P (decl
))
5398 tree value
= get_base_address (DECL_VALUE_EXPR (decl
));
5400 if (value
&& DECL_P (value
) && DECL_THREAD_LOCAL_P (value
))
5405 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5408 enum omp_clause_default_kind default_kind
, kind
;
5409 struct gimplify_omp_ctx
*octx
;
5411 if (ctx
->region_type
== ORT_WORKSHARE
)
5414 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
5415 remapped firstprivate instead of shared. To some extent this is
5416 addressed in omp_firstprivatize_type_sizes, but not effectively. */
5417 default_kind
= ctx
->default_kind
;
5418 kind
= lang_hooks
.decls
.omp_predetermined_sharing (decl
);
5419 if (kind
!= OMP_CLAUSE_DEFAULT_UNSPECIFIED
)
5420 default_kind
= kind
;
5422 switch (default_kind
)
5424 case OMP_CLAUSE_DEFAULT_NONE
:
5425 error ("%qE not specified in enclosing parallel",
5427 error_at (ctx
->location
, "enclosing parallel");
5429 case OMP_CLAUSE_DEFAULT_SHARED
:
5430 flags
|= GOVD_SHARED
;
5432 case OMP_CLAUSE_DEFAULT_PRIVATE
:
5433 flags
|= GOVD_PRIVATE
;
5435 case OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
:
5436 flags
|= GOVD_FIRSTPRIVATE
;
5438 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
5439 /* decl will be either GOVD_FIRSTPRIVATE or GOVD_SHARED. */
5440 gcc_assert (ctx
->region_type
== ORT_TASK
);
5441 if (ctx
->outer_context
)
5442 omp_notice_variable (ctx
->outer_context
, decl
, in_code
);
5443 for (octx
= ctx
->outer_context
; octx
; octx
= octx
->outer_context
)
5447 n2
= splay_tree_lookup (octx
->variables
, (splay_tree_key
) decl
);
5448 if (n2
&& (n2
->value
& GOVD_DATA_SHARE_CLASS
) != GOVD_SHARED
)
5450 flags
|= GOVD_FIRSTPRIVATE
;
5453 if ((octx
->region_type
& ORT_PARALLEL
) != 0)
5456 if (flags
& GOVD_FIRSTPRIVATE
)
5459 && (TREE_CODE (decl
) == PARM_DECL
5460 || (!is_global_var (decl
)
5461 && DECL_CONTEXT (decl
) == current_function_decl
)))
5463 flags
|= GOVD_FIRSTPRIVATE
;
5466 flags
|= GOVD_SHARED
;
5472 if ((flags
& GOVD_PRIVATE
)
5473 && lang_hooks
.decls
.omp_private_outer_ref (decl
))
5474 flags
|= GOVD_PRIVATE_OUTER_REF
;
5476 omp_add_variable (ctx
, decl
, flags
);
5478 shared
= (flags
& GOVD_SHARED
) != 0;
5479 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
5483 if ((n
->value
& (GOVD_SEEN
| GOVD_LOCAL
)) == 0
5484 && (flags
& (GOVD_SEEN
| GOVD_LOCAL
)) == GOVD_SEEN
5486 && TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
5489 tree t
= DECL_VALUE_EXPR (decl
);
5490 gcc_assert (TREE_CODE (t
) == INDIRECT_REF
);
5491 t
= TREE_OPERAND (t
, 0);
5492 gcc_assert (DECL_P (t
));
5493 n2
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) t
);
5494 n2
->value
|= GOVD_SEEN
;
5497 shared
= ((flags
| n
->value
) & GOVD_SHARED
) != 0;
5498 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
5500 /* If nothing changed, there's nothing left to do. */
5501 if ((n
->value
& flags
) == flags
)
5507 /* If the variable is private in the current context, then we don't
5508 need to propagate anything to an outer context. */
5509 if ((flags
& GOVD_PRIVATE
) && !(flags
& GOVD_PRIVATE_OUTER_REF
))
5511 if (ctx
->outer_context
5512 && omp_notice_variable (ctx
->outer_context
, decl
, in_code
))
5517 /* Verify that DECL is private within CTX. If there's specific information
5518 to the contrary in the innermost scope, generate an error. */
5521 omp_is_private (struct gimplify_omp_ctx
*ctx
, tree decl
)
5525 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5528 if (n
->value
& GOVD_SHARED
)
5530 if (ctx
== gimplify_omp_ctxp
)
5532 error ("iteration variable %qE should be private",
5534 n
->value
= GOVD_PRIVATE
;
5540 else if ((n
->value
& GOVD_EXPLICIT
) != 0
5541 && (ctx
== gimplify_omp_ctxp
5542 || (ctx
->region_type
== ORT_COMBINED_PARALLEL
5543 && gimplify_omp_ctxp
->outer_context
== ctx
)))
5545 if ((n
->value
& GOVD_FIRSTPRIVATE
) != 0)
5546 error ("iteration variable %qE should not be firstprivate",
5548 else if ((n
->value
& GOVD_REDUCTION
) != 0)
5549 error ("iteration variable %qE should not be reduction",
5552 return (ctx
== gimplify_omp_ctxp
5553 || (ctx
->region_type
== ORT_COMBINED_PARALLEL
5554 && gimplify_omp_ctxp
->outer_context
== ctx
));
5557 if (ctx
->region_type
!= ORT_WORKSHARE
)
5559 else if (ctx
->outer_context
)
5560 return omp_is_private (ctx
->outer_context
, decl
);
5564 /* Return true if DECL is private within a parallel region
5565 that binds to the current construct's context or in parallel
5566 region's REDUCTION clause. */
5569 omp_check_private (struct gimplify_omp_ctx
*ctx
, tree decl
)
5575 ctx
= ctx
->outer_context
;
5577 return !(is_global_var (decl
)
5578 /* References might be private, but might be shared too. */
5579 || lang_hooks
.decls
.omp_privatize_by_reference (decl
));
5581 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
5583 return (n
->value
& GOVD_SHARED
) == 0;
5585 while (ctx
->region_type
== ORT_WORKSHARE
);
5589 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
5590 and previous omp contexts. */
5593 gimplify_scan_omp_clauses (tree
*list_p
, gimple_seq
*pre_p
,
5594 enum omp_region_type region_type
)
5596 struct gimplify_omp_ctx
*ctx
, *outer_ctx
;
5597 struct gimplify_ctx gctx
;
5600 ctx
= new_omp_context (region_type
);
5601 outer_ctx
= ctx
->outer_context
;
5603 while ((c
= *list_p
) != NULL
)
5605 bool remove
= false;
5606 bool notice_outer
= true;
5607 const char *check_non_private
= NULL
;
5611 switch (OMP_CLAUSE_CODE (c
))
5613 case OMP_CLAUSE_PRIVATE
:
5614 flags
= GOVD_PRIVATE
| GOVD_EXPLICIT
;
5615 if (lang_hooks
.decls
.omp_private_outer_ref (OMP_CLAUSE_DECL (c
)))
5617 flags
|= GOVD_PRIVATE_OUTER_REF
;
5618 OMP_CLAUSE_PRIVATE_OUTER_REF (c
) = 1;
5621 notice_outer
= false;
5623 case OMP_CLAUSE_SHARED
:
5624 flags
= GOVD_SHARED
| GOVD_EXPLICIT
;
5626 case OMP_CLAUSE_FIRSTPRIVATE
:
5627 flags
= GOVD_FIRSTPRIVATE
| GOVD_EXPLICIT
;
5628 check_non_private
= "firstprivate";
5630 case OMP_CLAUSE_LASTPRIVATE
:
5631 flags
= GOVD_LASTPRIVATE
| GOVD_SEEN
| GOVD_EXPLICIT
;
5632 check_non_private
= "lastprivate";
5634 case OMP_CLAUSE_REDUCTION
:
5635 flags
= GOVD_REDUCTION
| GOVD_SEEN
| GOVD_EXPLICIT
;
5636 check_non_private
= "reduction";
5640 decl
= OMP_CLAUSE_DECL (c
);
5641 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
5646 omp_add_variable (ctx
, decl
, flags
);
5647 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
5648 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
))
5650 omp_add_variable (ctx
, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
),
5651 GOVD_LOCAL
| GOVD_SEEN
);
5652 gimplify_omp_ctxp
= ctx
;
5653 push_gimplify_context (&gctx
);
5655 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c
) = gimple_seq_alloc ();
5656 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c
) = gimple_seq_alloc ();
5658 gimplify_and_add (OMP_CLAUSE_REDUCTION_INIT (c
),
5659 &OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c
));
5660 pop_gimplify_context
5661 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c
)));
5662 push_gimplify_context (&gctx
);
5663 gimplify_and_add (OMP_CLAUSE_REDUCTION_MERGE (c
),
5664 &OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c
));
5665 pop_gimplify_context
5666 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c
)));
5667 OMP_CLAUSE_REDUCTION_INIT (c
) = NULL_TREE
;
5668 OMP_CLAUSE_REDUCTION_MERGE (c
) = NULL_TREE
;
5670 gimplify_omp_ctxp
= outer_ctx
;
5672 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
5673 && OMP_CLAUSE_LASTPRIVATE_STMT (c
))
5675 gimplify_omp_ctxp
= ctx
;
5676 push_gimplify_context (&gctx
);
5677 if (TREE_CODE (OMP_CLAUSE_LASTPRIVATE_STMT (c
)) != BIND_EXPR
)
5679 tree bind
= build3 (BIND_EXPR
, void_type_node
, NULL
,
5681 TREE_SIDE_EFFECTS (bind
) = 1;
5682 BIND_EXPR_BODY (bind
) = OMP_CLAUSE_LASTPRIVATE_STMT (c
);
5683 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = bind
;
5685 gimplify_and_add (OMP_CLAUSE_LASTPRIVATE_STMT (c
),
5686 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
));
5687 pop_gimplify_context
5688 (gimple_seq_first_stmt (OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
)));
5689 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = NULL_TREE
;
5691 gimplify_omp_ctxp
= outer_ctx
;
5697 case OMP_CLAUSE_COPYIN
:
5698 case OMP_CLAUSE_COPYPRIVATE
:
5699 decl
= OMP_CLAUSE_DECL (c
);
5700 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
5707 omp_notice_variable (outer_ctx
, decl
, true);
5708 if (check_non_private
5709 && region_type
== ORT_WORKSHARE
5710 && omp_check_private (ctx
, decl
))
5712 error ("%s variable %qE is private in outer context",
5713 check_non_private
, DECL_NAME (decl
));
5719 OMP_CLAUSE_OPERAND (c
, 0)
5720 = gimple_boolify (OMP_CLAUSE_OPERAND (c
, 0));
5723 case OMP_CLAUSE_SCHEDULE
:
5724 case OMP_CLAUSE_NUM_THREADS
:
5725 if (gimplify_expr (&OMP_CLAUSE_OPERAND (c
, 0), pre_p
, NULL
,
5726 is_gimple_val
, fb_rvalue
) == GS_ERROR
)
5730 case OMP_CLAUSE_NOWAIT
:
5731 case OMP_CLAUSE_ORDERED
:
5732 case OMP_CLAUSE_UNTIED
:
5733 case OMP_CLAUSE_COLLAPSE
:
5736 case OMP_CLAUSE_DEFAULT
:
5737 ctx
->default_kind
= OMP_CLAUSE_DEFAULT_KIND (c
);
5745 *list_p
= OMP_CLAUSE_CHAIN (c
);
5747 list_p
= &OMP_CLAUSE_CHAIN (c
);
5750 gimplify_omp_ctxp
= ctx
;
5753 /* For all variables that were not actually used within the context,
5754 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
5757 gimplify_adjust_omp_clauses_1 (splay_tree_node n
, void *data
)
5759 tree
*list_p
= (tree
*) data
;
5760 tree decl
= (tree
) n
->key
;
5761 unsigned flags
= n
->value
;
5762 enum omp_clause_code code
;
5766 if (flags
& (GOVD_EXPLICIT
| GOVD_LOCAL
))
5768 if ((flags
& GOVD_SEEN
) == 0)
5770 if (flags
& GOVD_DEBUG_PRIVATE
)
5772 gcc_assert ((flags
& GOVD_DATA_SHARE_CLASS
) == GOVD_PRIVATE
);
5773 private_debug
= true;
5777 = lang_hooks
.decls
.omp_private_debug_clause (decl
,
5778 !!(flags
& GOVD_SHARED
));
5780 code
= OMP_CLAUSE_PRIVATE
;
5781 else if (flags
& GOVD_SHARED
)
5783 if (is_global_var (decl
))
5785 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
->outer_context
;
5789 = splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
5790 if (on
&& (on
->value
& (GOVD_FIRSTPRIVATE
| GOVD_LASTPRIVATE
5791 | GOVD_PRIVATE
| GOVD_REDUCTION
)) != 0)
5793 ctx
= ctx
->outer_context
;
5798 code
= OMP_CLAUSE_SHARED
;
5800 else if (flags
& GOVD_PRIVATE
)
5801 code
= OMP_CLAUSE_PRIVATE
;
5802 else if (flags
& GOVD_FIRSTPRIVATE
)
5803 code
= OMP_CLAUSE_FIRSTPRIVATE
;
5807 clause
= build_omp_clause (input_location
, code
);
5808 OMP_CLAUSE_DECL (clause
) = decl
;
5809 OMP_CLAUSE_CHAIN (clause
) = *list_p
;
5811 OMP_CLAUSE_PRIVATE_DEBUG (clause
) = 1;
5812 else if (code
== OMP_CLAUSE_PRIVATE
&& (flags
& GOVD_PRIVATE_OUTER_REF
))
5813 OMP_CLAUSE_PRIVATE_OUTER_REF (clause
) = 1;
5815 lang_hooks
.decls
.omp_finish_clause (clause
);
5821 gimplify_adjust_omp_clauses (tree
*list_p
)
5823 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
5826 while ((c
= *list_p
) != NULL
)
5829 bool remove
= false;
5831 switch (OMP_CLAUSE_CODE (c
))
5833 case OMP_CLAUSE_PRIVATE
:
5834 case OMP_CLAUSE_SHARED
:
5835 case OMP_CLAUSE_FIRSTPRIVATE
:
5836 decl
= OMP_CLAUSE_DECL (c
);
5837 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
5838 remove
= !(n
->value
& GOVD_SEEN
);
5841 bool shared
= OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_SHARED
;
5842 if ((n
->value
& GOVD_DEBUG_PRIVATE
)
5843 || lang_hooks
.decls
.omp_private_debug_clause (decl
, shared
))
5845 gcc_assert ((n
->value
& GOVD_DEBUG_PRIVATE
) == 0
5846 || ((n
->value
& GOVD_DATA_SHARE_CLASS
)
5848 OMP_CLAUSE_SET_CODE (c
, OMP_CLAUSE_PRIVATE
);
5849 OMP_CLAUSE_PRIVATE_DEBUG (c
) = 1;
5854 case OMP_CLAUSE_LASTPRIVATE
:
5855 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
5856 accurately reflect the presence of a FIRSTPRIVATE clause. */
5857 decl
= OMP_CLAUSE_DECL (c
);
5858 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
5859 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c
)
5860 = (n
->value
& GOVD_FIRSTPRIVATE
) != 0;
5863 case OMP_CLAUSE_REDUCTION
:
5864 case OMP_CLAUSE_COPYIN
:
5865 case OMP_CLAUSE_COPYPRIVATE
:
5867 case OMP_CLAUSE_NUM_THREADS
:
5868 case OMP_CLAUSE_SCHEDULE
:
5869 case OMP_CLAUSE_NOWAIT
:
5870 case OMP_CLAUSE_ORDERED
:
5871 case OMP_CLAUSE_DEFAULT
:
5872 case OMP_CLAUSE_UNTIED
:
5873 case OMP_CLAUSE_COLLAPSE
:
5881 *list_p
= OMP_CLAUSE_CHAIN (c
);
5883 list_p
= &OMP_CLAUSE_CHAIN (c
);
5886 /* Add in any implicit data sharing. */
5887 splay_tree_foreach (ctx
->variables
, gimplify_adjust_omp_clauses_1
, list_p
);
5889 gimplify_omp_ctxp
= ctx
->outer_context
;
5890 delete_omp_context (ctx
);
5893 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
5894 gimplification of the body, as well as scanning the body for used
5895 variables. We need to do this scan now, because variable-sized
5896 decls will be decomposed during gimplification. */
5899 gimplify_omp_parallel (tree
*expr_p
, gimple_seq
*pre_p
)
5901 tree expr
= *expr_p
;
5903 gimple_seq body
= NULL
;
5904 struct gimplify_ctx gctx
;
5906 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
), pre_p
,
5907 OMP_PARALLEL_COMBINED (expr
)
5908 ? ORT_COMBINED_PARALLEL
5911 push_gimplify_context (&gctx
);
5913 g
= gimplify_and_return_first (OMP_PARALLEL_BODY (expr
), &body
);
5914 if (gimple_code (g
) == GIMPLE_BIND
)
5915 pop_gimplify_context (g
);
5917 pop_gimplify_context (NULL
);
5919 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
));
5921 g
= gimple_build_omp_parallel (body
,
5922 OMP_PARALLEL_CLAUSES (expr
),
5923 NULL_TREE
, NULL_TREE
);
5924 if (OMP_PARALLEL_COMBINED (expr
))
5925 gimple_omp_set_subcode (g
, GF_OMP_PARALLEL_COMBINED
);
5926 gimplify_seq_add_stmt (pre_p
, g
);
5927 *expr_p
= NULL_TREE
;
5930 /* Gimplify the contents of an OMP_TASK statement. This involves
5931 gimplification of the body, as well as scanning the body for used
5932 variables. We need to do this scan now, because variable-sized
5933 decls will be decomposed during gimplification. */
5936 gimplify_omp_task (tree
*expr_p
, gimple_seq
*pre_p
)
5938 tree expr
= *expr_p
;
5940 gimple_seq body
= NULL
;
5941 struct gimplify_ctx gctx
;
5943 gimplify_scan_omp_clauses (&OMP_TASK_CLAUSES (expr
), pre_p
, ORT_TASK
);
5945 push_gimplify_context (&gctx
);
5947 g
= gimplify_and_return_first (OMP_TASK_BODY (expr
), &body
);
5948 if (gimple_code (g
) == GIMPLE_BIND
)
5949 pop_gimplify_context (g
);
5951 pop_gimplify_context (NULL
);
5953 gimplify_adjust_omp_clauses (&OMP_TASK_CLAUSES (expr
));
5955 g
= gimple_build_omp_task (body
,
5956 OMP_TASK_CLAUSES (expr
),
5957 NULL_TREE
, NULL_TREE
,
5958 NULL_TREE
, NULL_TREE
, NULL_TREE
);
5959 gimplify_seq_add_stmt (pre_p
, g
);
5960 *expr_p
= NULL_TREE
;
5963 /* Gimplify the gross structure of an OMP_FOR statement. */
5965 static enum gimplify_status
5966 gimplify_omp_for (tree
*expr_p
, gimple_seq
*pre_p
)
5968 tree for_stmt
, decl
, var
, t
;
5969 enum gimplify_status ret
= GS_ALL_DONE
;
5970 enum gimplify_status tret
;
5972 gimple_seq for_body
, for_pre_body
;
5977 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
), pre_p
,
5980 /* Handle OMP_FOR_INIT. */
5981 for_pre_body
= NULL
;
5982 gimplify_and_add (OMP_FOR_PRE_BODY (for_stmt
), &for_pre_body
);
5983 OMP_FOR_PRE_BODY (for_stmt
) = NULL_TREE
;
5985 for_body
= gimple_seq_alloc ();
5986 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
))
5987 == TREE_VEC_LENGTH (OMP_FOR_COND (for_stmt
)));
5988 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
))
5989 == TREE_VEC_LENGTH (OMP_FOR_INCR (for_stmt
)));
5990 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)); i
++)
5992 t
= TREE_VEC_ELT (OMP_FOR_INIT (for_stmt
), i
);
5993 gcc_assert (TREE_CODE (t
) == MODIFY_EXPR
);
5994 decl
= TREE_OPERAND (t
, 0);
5995 gcc_assert (DECL_P (decl
));
5996 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl
))
5997 || POINTER_TYPE_P (TREE_TYPE (decl
)));
5999 /* Make sure the iteration variable is private. */
6000 if (omp_is_private (gimplify_omp_ctxp
, decl
))
6001 omp_notice_variable (gimplify_omp_ctxp
, decl
, true);
6003 omp_add_variable (gimplify_omp_ctxp
, decl
, GOVD_PRIVATE
| GOVD_SEEN
);
6005 /* If DECL is not a gimple register, create a temporary variable to act
6006 as an iteration counter. This is valid, since DECL cannot be
6007 modified in the body of the loop. */
6008 if (!is_gimple_reg (decl
))
6010 var
= create_tmp_var (TREE_TYPE (decl
), get_name (decl
));
6011 TREE_OPERAND (t
, 0) = var
;
6013 gimplify_seq_add_stmt (&for_body
, gimple_build_assign (decl
, var
));
6015 omp_add_variable (gimplify_omp_ctxp
, var
, GOVD_PRIVATE
| GOVD_SEEN
);
6020 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), &for_pre_body
, NULL
,
6021 is_gimple_val
, fb_rvalue
);
6022 ret
= MIN (ret
, tret
);
6023 if (ret
== GS_ERROR
)
6026 /* Handle OMP_FOR_COND. */
6027 t
= TREE_VEC_ELT (OMP_FOR_COND (for_stmt
), i
);
6028 gcc_assert (COMPARISON_CLASS_P (t
));
6029 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
6031 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), &for_pre_body
, NULL
,
6032 is_gimple_val
, fb_rvalue
);
6033 ret
= MIN (ret
, tret
);
6035 /* Handle OMP_FOR_INCR. */
6036 t
= TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
);
6037 switch (TREE_CODE (t
))
6039 case PREINCREMENT_EXPR
:
6040 case POSTINCREMENT_EXPR
:
6041 t
= build_int_cst (TREE_TYPE (decl
), 1);
6042 t
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), var
, t
);
6043 t
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, t
);
6044 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
) = t
;
6047 case PREDECREMENT_EXPR
:
6048 case POSTDECREMENT_EXPR
:
6049 t
= build_int_cst (TREE_TYPE (decl
), -1);
6050 t
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), var
, t
);
6051 t
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, t
);
6052 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
) = t
;
6056 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
6057 TREE_OPERAND (t
, 0) = var
;
6059 t
= TREE_OPERAND (t
, 1);
6060 switch (TREE_CODE (t
))
6063 if (TREE_OPERAND (t
, 1) == decl
)
6065 TREE_OPERAND (t
, 1) = TREE_OPERAND (t
, 0);
6066 TREE_OPERAND (t
, 0) = var
;
6072 case POINTER_PLUS_EXPR
:
6073 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
6074 TREE_OPERAND (t
, 0) = var
;
6080 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), &for_pre_body
, NULL
,
6081 is_gimple_val
, fb_rvalue
);
6082 ret
= MIN (ret
, tret
);
6089 if (var
!= decl
|| TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)) > 1)
6092 for (c
= OMP_FOR_CLAUSES (for_stmt
); c
; c
= OMP_CLAUSE_CHAIN (c
))
6093 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
6094 && OMP_CLAUSE_DECL (c
) == decl
6095 && OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
) == NULL
)
6097 t
= TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
);
6098 gcc_assert (TREE_CODE (t
) == MODIFY_EXPR
);
6099 gcc_assert (TREE_OPERAND (t
, 0) == var
);
6100 t
= TREE_OPERAND (t
, 1);
6101 gcc_assert (TREE_CODE (t
) == PLUS_EXPR
6102 || TREE_CODE (t
) == MINUS_EXPR
6103 || TREE_CODE (t
) == POINTER_PLUS_EXPR
);
6104 gcc_assert (TREE_OPERAND (t
, 0) == var
);
6105 t
= build2 (TREE_CODE (t
), TREE_TYPE (decl
), decl
,
6106 TREE_OPERAND (t
, 1));
6107 gimplify_assign (decl
, t
,
6108 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
));
6113 gimplify_and_add (OMP_FOR_BODY (for_stmt
), &for_body
);
6115 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
));
6117 gfor
= gimple_build_omp_for (for_body
, OMP_FOR_CLAUSES (for_stmt
),
6118 TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)),
6121 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)); i
++)
6123 t
= TREE_VEC_ELT (OMP_FOR_INIT (for_stmt
), i
);
6124 gimple_omp_for_set_index (gfor
, i
, TREE_OPERAND (t
, 0));
6125 gimple_omp_for_set_initial (gfor
, i
, TREE_OPERAND (t
, 1));
6126 t
= TREE_VEC_ELT (OMP_FOR_COND (for_stmt
), i
);
6127 gimple_omp_for_set_cond (gfor
, i
, TREE_CODE (t
));
6128 gimple_omp_for_set_final (gfor
, i
, TREE_OPERAND (t
, 1));
6129 t
= TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
);
6130 gimple_omp_for_set_incr (gfor
, i
, TREE_OPERAND (t
, 1));
6133 gimplify_seq_add_stmt (pre_p
, gfor
);
6134 return ret
== GS_ALL_DONE
? GS_ALL_DONE
: GS_ERROR
;
6137 /* Gimplify the gross structure of other OpenMP worksharing constructs.
6138 In particular, OMP_SECTIONS and OMP_SINGLE. */
6141 gimplify_omp_workshare (tree
*expr_p
, gimple_seq
*pre_p
)
6143 tree expr
= *expr_p
;
6145 gimple_seq body
= NULL
;
6147 gimplify_scan_omp_clauses (&OMP_CLAUSES (expr
), pre_p
, ORT_WORKSHARE
);
6148 gimplify_and_add (OMP_BODY (expr
), &body
);
6149 gimplify_adjust_omp_clauses (&OMP_CLAUSES (expr
));
6151 if (TREE_CODE (expr
) == OMP_SECTIONS
)
6152 stmt
= gimple_build_omp_sections (body
, OMP_CLAUSES (expr
));
6153 else if (TREE_CODE (expr
) == OMP_SINGLE
)
6154 stmt
= gimple_build_omp_single (body
, OMP_CLAUSES (expr
));
6158 gimplify_seq_add_stmt (pre_p
, stmt
);
6161 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
6162 stabilized the lhs of the atomic operation as *ADDR. Return true if
6163 EXPR is this stabilized form. */
6166 goa_lhs_expr_p (tree expr
, tree addr
)
6168 /* Also include casts to other type variants. The C front end is fond
6169 of adding these for e.g. volatile variables. This is like
6170 STRIP_TYPE_NOPS but includes the main variant lookup. */
6171 STRIP_USELESS_TYPE_CONVERSION (expr
);
6173 if (TREE_CODE (expr
) == INDIRECT_REF
)
6175 expr
= TREE_OPERAND (expr
, 0);
6177 && (CONVERT_EXPR_P (expr
)
6178 || TREE_CODE (expr
) == NON_LVALUE_EXPR
)
6179 && TREE_CODE (expr
) == TREE_CODE (addr
)
6180 && types_compatible_p (TREE_TYPE (expr
), TREE_TYPE (addr
)))
6182 expr
= TREE_OPERAND (expr
, 0);
6183 addr
= TREE_OPERAND (addr
, 0);
6187 return (TREE_CODE (addr
) == ADDR_EXPR
6188 && TREE_CODE (expr
) == ADDR_EXPR
6189 && TREE_OPERAND (addr
, 0) == TREE_OPERAND (expr
, 0));
6191 if (TREE_CODE (addr
) == ADDR_EXPR
&& expr
== TREE_OPERAND (addr
, 0))
6196 /* Walk *EXPR_P and replace
6197 appearances of *LHS_ADDR with LHS_VAR. If an expression does not involve
6198 the lhs, evaluate it into a temporary. Return 1 if the lhs appeared as
6199 a subexpression, 0 if it did not, or -1 if an error was encountered. */
6202 goa_stabilize_expr (tree
*expr_p
, gimple_seq
*pre_p
, tree lhs_addr
,
6205 tree expr
= *expr_p
;
6208 if (goa_lhs_expr_p (expr
, lhs_addr
))
6213 if (is_gimple_val (expr
))
6217 switch (TREE_CODE_CLASS (TREE_CODE (expr
)))
6220 case tcc_comparison
:
6221 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 1), pre_p
, lhs_addr
,
6224 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 0), pre_p
, lhs_addr
,
6227 case tcc_expression
:
6228 switch (TREE_CODE (expr
))
6230 case TRUTH_ANDIF_EXPR
:
6231 case TRUTH_ORIF_EXPR
:
6232 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 1), pre_p
,
6234 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 0), pre_p
,
6247 enum gimplify_status gs
;
6248 gs
= gimplify_expr (expr_p
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
);
6249 if (gs
!= GS_ALL_DONE
)
6257 /* Gimplify an OMP_ATOMIC statement. */
6259 static enum gimplify_status
6260 gimplify_omp_atomic (tree
*expr_p
, gimple_seq
*pre_p
)
6262 tree addr
= TREE_OPERAND (*expr_p
, 0);
6263 tree rhs
= TREE_OPERAND (*expr_p
, 1);
6264 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr
)));
6267 tmp_load
= create_tmp_var (type
, NULL
);
6268 if (goa_stabilize_expr (&rhs
, pre_p
, addr
, tmp_load
) < 0)
6271 if (gimplify_expr (&addr
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
)
6275 gimplify_seq_add_stmt (pre_p
, gimple_build_omp_atomic_load (tmp_load
, addr
));
6276 if (gimplify_expr (&rhs
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
)
6279 gimplify_seq_add_stmt (pre_p
, gimple_build_omp_atomic_store (rhs
));
6286 /* Converts the GENERIC expression tree *EXPR_P to GIMPLE. If the
6287 expression produces a value to be used as an operand inside a GIMPLE
6288 statement, the value will be stored back in *EXPR_P. This value will
6289 be a tree of class tcc_declaration, tcc_constant, tcc_reference or
6290 an SSA_NAME. The corresponding sequence of GIMPLE statements is
6291 emitted in PRE_P and POST_P.
6293 Additionally, this process may overwrite parts of the input
6294 expression during gimplification. Ideally, it should be
6295 possible to do non-destructive gimplification.
6297 EXPR_P points to the GENERIC expression to convert to GIMPLE. If
6298 the expression needs to evaluate to a value to be used as
6299 an operand in a GIMPLE statement, this value will be stored in
6300 *EXPR_P on exit. This happens when the caller specifies one
6301 of fb_lvalue or fb_rvalue fallback flags.
6303 PRE_P will contain the sequence of GIMPLE statements corresponding
6304 to the evaluation of EXPR and all the side-effects that must
6305 be executed before the main expression. On exit, the last
6306 statement of PRE_P is the core statement being gimplified. For
6307 instance, when gimplifying 'if (++a)' the last statement in
6308 PRE_P will be 'if (t.1)' where t.1 is the result of
6309 pre-incrementing 'a'.
6311 POST_P will contain the sequence of GIMPLE statements corresponding
6312 to the evaluation of all the side-effects that must be executed
6313 after the main expression. If this is NULL, the post
6314 side-effects are stored at the end of PRE_P.
6316 The reason why the output is split in two is to handle post
6317 side-effects explicitly. In some cases, an expression may have
6318 inner and outer post side-effects which need to be emitted in
6319 an order different from the one given by the recursive
6320 traversal. For instance, for the expression (*p--)++ the post
6321 side-effects of '--' must actually occur *after* the post
6322 side-effects of '++'. However, gimplification will first visit
6323 the inner expression, so if a separate POST sequence was not
6324 used, the resulting sequence would be:
6331 However, the post-decrement operation in line #2 must not be
6332 evaluated until after the store to *p at line #4, so the
6333 correct sequence should be:
6340 So, by specifying a separate post queue, it is possible
6341 to emit the post side-effects in the correct order.
6342 If POST_P is NULL, an internal queue will be used. Before
6343 returning to the caller, the sequence POST_P is appended to
6344 the main output sequence PRE_P.
6346 GIMPLE_TEST_F points to a function that takes a tree T and
6347 returns nonzero if T is in the GIMPLE form requested by the
6348 caller. The GIMPLE predicates are in tree-gimple.c.
6350 FALLBACK tells the function what sort of a temporary we want if
6351 gimplification cannot produce an expression that complies with
6354 fb_none means that no temporary should be generated
6355 fb_rvalue means that an rvalue is OK to generate
6356 fb_lvalue means that an lvalue is OK to generate
6357 fb_either means that either is OK, but an lvalue is preferable.
6358 fb_mayfail means that gimplification may fail (in which case
6359 GS_ERROR will be returned)
6361 The return value is either GS_ERROR or GS_ALL_DONE, since this
6362 function iterates until EXPR is completely gimplified or an error
6365 enum gimplify_status
6366 gimplify_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
6367 bool (*gimple_test_f
) (tree
), fallback_t fallback
)
6370 gimple_seq internal_pre
= NULL
;
6371 gimple_seq internal_post
= NULL
;
6374 location_t saved_location
;
6375 enum gimplify_status ret
;
6376 gimple_stmt_iterator pre_last_gsi
, post_last_gsi
;
6378 save_expr
= *expr_p
;
6379 if (save_expr
== NULL_TREE
)
6382 /* If we are gimplifying a top-level statement, PRE_P must be valid. */
6383 is_statement
= gimple_test_f
== is_gimple_stmt
;
6387 /* Consistency checks. */
6388 if (gimple_test_f
== is_gimple_reg
)
6389 gcc_assert (fallback
& (fb_rvalue
| fb_lvalue
));
6390 else if (gimple_test_f
== is_gimple_val
6391 || gimple_test_f
== is_gimple_call_addr
6392 || gimple_test_f
== is_gimple_condexpr
6393 || gimple_test_f
== is_gimple_mem_rhs
6394 || gimple_test_f
== is_gimple_mem_rhs_or_call
6395 || gimple_test_f
== is_gimple_reg_rhs
6396 || gimple_test_f
== is_gimple_reg_rhs_or_call
6397 || gimple_test_f
== is_gimple_asm_val
)
6398 gcc_assert (fallback
& fb_rvalue
);
6399 else if (gimple_test_f
== is_gimple_min_lval
6400 || gimple_test_f
== is_gimple_lvalue
)
6401 gcc_assert (fallback
& fb_lvalue
);
6402 else if (gimple_test_f
== is_gimple_addressable
)
6403 gcc_assert (fallback
& fb_either
);
6404 else if (gimple_test_f
== is_gimple_stmt
)
6405 gcc_assert (fallback
== fb_none
);
6408 /* We should have recognized the GIMPLE_TEST_F predicate to
6409 know what kind of fallback to use in case a temporary is
6410 needed to hold the value or address of *EXPR_P. */
6414 /* We used to check the predicate here and return immediately if it
6415 succeeds. This is wrong; the design is for gimplification to be
6416 idempotent, and for the predicates to only test for valid forms, not
6417 whether they are fully simplified. */
6419 pre_p
= &internal_pre
;
6422 post_p
= &internal_post
;
6424 /* Remember the last statements added to PRE_P and POST_P. Every
6425 new statement added by the gimplification helpers needs to be
6426 annotated with location information. To centralize the
6427 responsibility, we remember the last statement that had been
6428 added to both queues before gimplifying *EXPR_P. If
6429 gimplification produces new statements in PRE_P and POST_P, those
6430 statements will be annotated with the same location information
6432 pre_last_gsi
= gsi_last (*pre_p
);
6433 post_last_gsi
= gsi_last (*post_p
);
6435 saved_location
= input_location
;
6436 if (save_expr
!= error_mark_node
6437 && EXPR_HAS_LOCATION (*expr_p
))
6438 input_location
= EXPR_LOCATION (*expr_p
);
6440 /* Loop over the specific gimplifiers until the toplevel node
6441 remains the same. */
6444 /* Strip away as many useless type conversions as possible
6446 STRIP_USELESS_TYPE_CONVERSION (*expr_p
);
6448 /* Remember the expr. */
6449 save_expr
= *expr_p
;
6451 /* Die, die, die, my darling. */
6452 if (save_expr
== error_mark_node
6453 || (TREE_TYPE (save_expr
)
6454 && TREE_TYPE (save_expr
) == error_mark_node
))
6460 /* Do any language-specific gimplification. */
6461 ret
= ((enum gimplify_status
)
6462 lang_hooks
.gimplify_expr (expr_p
, pre_p
, post_p
));
6465 if (*expr_p
== NULL_TREE
)
6467 if (*expr_p
!= save_expr
)
6470 else if (ret
!= GS_UNHANDLED
)
6474 switch (TREE_CODE (*expr_p
))
6476 /* First deal with the special cases. */
6478 case POSTINCREMENT_EXPR
:
6479 case POSTDECREMENT_EXPR
:
6480 case PREINCREMENT_EXPR
:
6481 case PREDECREMENT_EXPR
:
6482 ret
= gimplify_self_mod_expr (expr_p
, pre_p
, post_p
,
6483 fallback
!= fb_none
);
6487 case ARRAY_RANGE_REF
:
6491 case VIEW_CONVERT_EXPR
:
6492 ret
= gimplify_compound_lval (expr_p
, pre_p
, post_p
,
6493 fallback
? fallback
: fb_rvalue
);
6497 ret
= gimplify_cond_expr (expr_p
, pre_p
, fallback
);
6499 /* C99 code may assign to an array in a structure value of a
6500 conditional expression, and this has undefined behavior
6501 only on execution, so create a temporary if an lvalue is
6503 if (fallback
== fb_lvalue
)
6505 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
6506 mark_addressable (*expr_p
);
6511 ret
= gimplify_call_expr (expr_p
, pre_p
, fallback
!= fb_none
);
6513 /* C99 code may assign to an array in a structure returned
6514 from a function, and this has undefined behavior only on
6515 execution, so create a temporary if an lvalue is
6517 if (fallback
== fb_lvalue
)
6519 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
6520 mark_addressable (*expr_p
);
6528 ret
= gimplify_compound_expr (expr_p
, pre_p
, fallback
!= fb_none
);
6531 case COMPOUND_LITERAL_EXPR
:
6532 ret
= gimplify_compound_literal_expr (expr_p
, pre_p
);
6537 ret
= gimplify_modify_expr (expr_p
, pre_p
, post_p
,
6538 fallback
!= fb_none
);
6541 case TRUTH_ANDIF_EXPR
:
6542 case TRUTH_ORIF_EXPR
:
6543 /* Pass the source location of the outer expression. */
6544 ret
= gimplify_boolean_expr (expr_p
, saved_location
);
6547 case TRUTH_NOT_EXPR
:
6548 if (TREE_CODE (TREE_TYPE (*expr_p
)) != BOOLEAN_TYPE
)
6550 tree type
= TREE_TYPE (*expr_p
);
6551 *expr_p
= fold_convert (type
, gimple_boolify (*expr_p
));
6556 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
6557 is_gimple_val
, fb_rvalue
);
6558 recalculate_side_effects (*expr_p
);
6562 ret
= gimplify_addr_expr (expr_p
, pre_p
, post_p
);
6566 ret
= gimplify_va_arg_expr (expr_p
, pre_p
, post_p
);
6570 if (IS_EMPTY_STMT (*expr_p
))
6576 if (VOID_TYPE_P (TREE_TYPE (*expr_p
))
6577 || fallback
== fb_none
)
6579 /* Just strip a conversion to void (or in void context) and
6581 *expr_p
= TREE_OPERAND (*expr_p
, 0);
6585 ret
= gimplify_conversion (expr_p
);
6586 if (ret
== GS_ERROR
)
6588 if (*expr_p
!= save_expr
)
6592 case FIX_TRUNC_EXPR
:
6593 /* unary_expr: ... | '(' cast ')' val | ... */
6594 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
6595 is_gimple_val
, fb_rvalue
);
6596 recalculate_side_effects (*expr_p
);
6600 *expr_p
= fold_indirect_ref_loc (input_location
, *expr_p
);
6601 if (*expr_p
!= save_expr
)
6603 /* else fall through. */
6604 case ALIGN_INDIRECT_REF
:
6605 case MISALIGNED_INDIRECT_REF
:
6606 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
6607 is_gimple_reg
, fb_rvalue
);
6608 recalculate_side_effects (*expr_p
);
6611 /* Constants need not be gimplified. */
6622 /* If we require an lvalue, such as for ADDR_EXPR, retain the
6623 CONST_DECL node. Otherwise the decl is replaceable by its
6625 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
6626 if (fallback
& fb_lvalue
)
6629 *expr_p
= DECL_INITIAL (*expr_p
);
6633 ret
= gimplify_decl_expr (expr_p
, pre_p
);
6637 /* FIXME make this a decl. */
6642 ret
= gimplify_bind_expr (expr_p
, pre_p
);
6646 ret
= gimplify_loop_expr (expr_p
, pre_p
);
6650 ret
= gimplify_switch_expr (expr_p
, pre_p
);
6654 ret
= gimplify_exit_expr (expr_p
);
6658 /* If the target is not LABEL, then it is a computed jump
6659 and the target needs to be gimplified. */
6660 if (TREE_CODE (GOTO_DESTINATION (*expr_p
)) != LABEL_DECL
)
6662 ret
= gimplify_expr (&GOTO_DESTINATION (*expr_p
), pre_p
,
6663 NULL
, is_gimple_val
, fb_rvalue
);
6664 if (ret
== GS_ERROR
)
6667 gimplify_seq_add_stmt (pre_p
,
6668 gimple_build_goto (GOTO_DESTINATION (*expr_p
)));
6672 gimplify_seq_add_stmt (pre_p
,
6673 gimple_build_predict (PREDICT_EXPR_PREDICTOR (*expr_p
),
6674 PREDICT_EXPR_OUTCOME (*expr_p
)));
6680 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p
))
6681 == current_function_decl
);
6682 gimplify_seq_add_stmt (pre_p
,
6683 gimple_build_label (LABEL_EXPR_LABEL (*expr_p
)));
6686 case CASE_LABEL_EXPR
:
6687 ret
= gimplify_case_label_expr (expr_p
, pre_p
);
6691 ret
= gimplify_return_expr (*expr_p
, pre_p
);
6695 /* Don't reduce this in place; let gimplify_init_constructor work its
6696 magic. Buf if we're just elaborating this for side effects, just
6697 gimplify any element that has side-effects. */
6698 if (fallback
== fb_none
)
6700 unsigned HOST_WIDE_INT ix
;
6701 constructor_elt
*ce
;
6702 tree temp
= NULL_TREE
;
6704 VEC_iterate (constructor_elt
, CONSTRUCTOR_ELTS (*expr_p
),
6707 if (TREE_SIDE_EFFECTS (ce
->value
))
6708 append_to_statement_list (ce
->value
, &temp
);
6713 /* C99 code may assign to an array in a constructed
6714 structure or union, and this has undefined behavior only
6715 on execution, so create a temporary if an lvalue is
6717 else if (fallback
== fb_lvalue
)
6719 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
6720 mark_addressable (*expr_p
);
6726 /* The following are special cases that are not handled by the
6727 original GIMPLE grammar. */
6729 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
6732 ret
= gimplify_save_expr (expr_p
, pre_p
, post_p
);
6737 enum gimplify_status r0
, r1
, r2
;
6739 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
6740 post_p
, is_gimple_lvalue
, fb_either
);
6741 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
,
6742 post_p
, is_gimple_val
, fb_rvalue
);
6743 r2
= gimplify_expr (&TREE_OPERAND (*expr_p
, 2), pre_p
,
6744 post_p
, is_gimple_val
, fb_rvalue
);
6745 recalculate_side_effects (*expr_p
);
6747 ret
= MIN (r0
, MIN (r1
, r2
));
6751 case TARGET_MEM_REF
:
6753 enum gimplify_status r0
= GS_ALL_DONE
, r1
= GS_ALL_DONE
;
6755 if (TMR_SYMBOL (*expr_p
))
6756 r0
= gimplify_expr (&TMR_SYMBOL (*expr_p
), pre_p
,
6757 post_p
, is_gimple_lvalue
, fb_either
);
6758 else if (TMR_BASE (*expr_p
))
6759 r0
= gimplify_expr (&TMR_BASE (*expr_p
), pre_p
,
6760 post_p
, is_gimple_val
, fb_either
);
6761 if (TMR_INDEX (*expr_p
))
6762 r1
= gimplify_expr (&TMR_INDEX (*expr_p
), pre_p
,
6763 post_p
, is_gimple_val
, fb_rvalue
);
6764 /* TMR_STEP and TMR_OFFSET are always integer constants. */
6769 case NON_LVALUE_EXPR
:
6770 /* This should have been stripped above. */
6774 ret
= gimplify_asm_expr (expr_p
, pre_p
, post_p
);
6777 case TRY_FINALLY_EXPR
:
6778 case TRY_CATCH_EXPR
:
6780 gimple_seq eval
, cleanup
;
6783 eval
= cleanup
= NULL
;
6784 gimplify_and_add (TREE_OPERAND (*expr_p
, 0), &eval
);
6785 gimplify_and_add (TREE_OPERAND (*expr_p
, 1), &cleanup
);
6786 /* Don't create bogus GIMPLE_TRY with empty cleanup. */
6787 if (gimple_seq_empty_p (cleanup
))
6789 gimple_seq_add_seq (pre_p
, eval
);
6793 try_
= gimple_build_try (eval
, cleanup
,
6794 TREE_CODE (*expr_p
) == TRY_FINALLY_EXPR
6795 ? GIMPLE_TRY_FINALLY
6796 : GIMPLE_TRY_CATCH
);
6797 if (TREE_CODE (*expr_p
) == TRY_CATCH_EXPR
)
6798 gimple_try_set_catch_is_cleanup (try_
,
6799 TRY_CATCH_IS_CLEANUP (*expr_p
));
6800 gimplify_seq_add_stmt (pre_p
, try_
);
6805 case CLEANUP_POINT_EXPR
:
6806 ret
= gimplify_cleanup_point_expr (expr_p
, pre_p
);
6810 ret
= gimplify_target_expr (expr_p
, pre_p
, post_p
);
6816 gimple_seq handler
= NULL
;
6817 gimplify_and_add (CATCH_BODY (*expr_p
), &handler
);
6818 c
= gimple_build_catch (CATCH_TYPES (*expr_p
), handler
);
6819 gimplify_seq_add_stmt (pre_p
, c
);
6824 case EH_FILTER_EXPR
:
6827 gimple_seq failure
= NULL
;
6829 gimplify_and_add (EH_FILTER_FAILURE (*expr_p
), &failure
);
6830 ehf
= gimple_build_eh_filter (EH_FILTER_TYPES (*expr_p
), failure
);
6831 gimple_set_no_warning (ehf
, TREE_NO_WARNING (*expr_p
));
6832 gimple_eh_filter_set_must_not_throw
6833 (ehf
, EH_FILTER_MUST_NOT_THROW (*expr_p
));
6834 gimplify_seq_add_stmt (pre_p
, ehf
);
6841 enum gimplify_status r0
, r1
;
6842 r0
= gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p
), pre_p
,
6843 post_p
, is_gimple_val
, fb_rvalue
);
6844 r1
= gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p
), pre_p
,
6845 post_p
, is_gimple_val
, fb_rvalue
);
6846 TREE_SIDE_EFFECTS (*expr_p
) = 0;
6852 /* We get here when taking the address of a label. We mark
6853 the label as "forced"; meaning it can never be removed and
6854 it is a potential target for any computed goto. */
6855 FORCED_LABEL (*expr_p
) = 1;
6859 case STATEMENT_LIST
:
6860 ret
= gimplify_statement_list (expr_p
, pre_p
);
6863 case WITH_SIZE_EXPR
:
6865 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
6866 post_p
== &internal_post
? NULL
: post_p
,
6867 gimple_test_f
, fallback
);
6868 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
6869 is_gimple_val
, fb_rvalue
);
6875 ret
= gimplify_var_or_parm_decl (expr_p
);
6879 /* When within an OpenMP context, notice uses of variables. */
6880 if (gimplify_omp_ctxp
)
6881 omp_notice_variable (gimplify_omp_ctxp
, *expr_p
, true);
6886 /* Allow callbacks into the gimplifier during optimization. */
6891 gimplify_omp_parallel (expr_p
, pre_p
);
6896 gimplify_omp_task (expr_p
, pre_p
);
6901 ret
= gimplify_omp_for (expr_p
, pre_p
);
6906 gimplify_omp_workshare (expr_p
, pre_p
);
6915 gimple_seq body
= NULL
;
6918 gimplify_and_add (OMP_BODY (*expr_p
), &body
);
6919 switch (TREE_CODE (*expr_p
))
6922 g
= gimple_build_omp_section (body
);
6925 g
= gimple_build_omp_master (body
);
6928 g
= gimple_build_omp_ordered (body
);
6931 g
= gimple_build_omp_critical (body
,
6932 OMP_CRITICAL_NAME (*expr_p
));
6937 gimplify_seq_add_stmt (pre_p
, g
);
6943 ret
= gimplify_omp_atomic (expr_p
, pre_p
);
6946 case POINTER_PLUS_EXPR
:
6947 /* Convert ((type *)A)+offset into &A->field_of_type_and_offset.
6948 The second is gimple immediate saving a need for extra statement.
6950 if (TREE_CODE (TREE_OPERAND (*expr_p
, 1)) == INTEGER_CST
6951 && (tmp
= maybe_fold_offset_to_address
6952 (EXPR_LOCATION (*expr_p
),
6953 TREE_OPERAND (*expr_p
, 0), TREE_OPERAND (*expr_p
, 1),
6954 TREE_TYPE (*expr_p
))))
6959 /* Convert (void *)&a + 4 into (void *)&a[1]. */
6960 if (TREE_CODE (TREE_OPERAND (*expr_p
, 0)) == NOP_EXPR
6961 && TREE_CODE (TREE_OPERAND (*expr_p
, 1)) == INTEGER_CST
6962 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p
,
6964 && (tmp
= maybe_fold_offset_to_address
6965 (EXPR_LOCATION (*expr_p
),
6966 TREE_OPERAND (TREE_OPERAND (*expr_p
, 0), 0),
6967 TREE_OPERAND (*expr_p
, 1),
6968 TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p
, 0),
6971 *expr_p
= fold_convert (TREE_TYPE (*expr_p
), tmp
);
6977 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p
)))
6979 case tcc_comparison
:
6980 /* Handle comparison of objects of non scalar mode aggregates
6981 with a call to memcmp. It would be nice to only have to do
6982 this for variable-sized objects, but then we'd have to allow
6983 the same nest of reference nodes we allow for MODIFY_EXPR and
6986 Compare scalar mode aggregates as scalar mode values. Using
6987 memcmp for them would be very inefficient at best, and is
6988 plain wrong if bitfields are involved. */
6990 tree type
= TREE_TYPE (TREE_OPERAND (*expr_p
, 1));
6992 if (!AGGREGATE_TYPE_P (type
))
6994 else if (TYPE_MODE (type
) != BLKmode
)
6995 ret
= gimplify_scalar_mode_aggregate_compare (expr_p
);
6997 ret
= gimplify_variable_sized_compare (expr_p
);
7002 /* If *EXPR_P does not need to be special-cased, handle it
7003 according to its class. */
7005 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
7006 post_p
, is_gimple_val
, fb_rvalue
);
7012 enum gimplify_status r0
, r1
;
7014 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
7015 post_p
, is_gimple_val
, fb_rvalue
);
7016 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
,
7017 post_p
, is_gimple_val
, fb_rvalue
);
7023 case tcc_declaration
:
7026 goto dont_recalculate
;
7029 gcc_assert (TREE_CODE (*expr_p
) == TRUTH_AND_EXPR
7030 || TREE_CODE (*expr_p
) == TRUTH_OR_EXPR
7031 || TREE_CODE (*expr_p
) == TRUTH_XOR_EXPR
);
7035 recalculate_side_effects (*expr_p
);
7041 /* If we replaced *expr_p, gimplify again. */
7042 if (ret
== GS_OK
&& (*expr_p
== NULL
|| *expr_p
== save_expr
))
7045 while (ret
== GS_OK
);
7047 /* If we encountered an error_mark somewhere nested inside, either
7048 stub out the statement or propagate the error back out. */
7049 if (ret
== GS_ERROR
)
7056 /* This was only valid as a return value from the langhook, which
7057 we handled. Make sure it doesn't escape from any other context. */
7058 gcc_assert (ret
!= GS_UNHANDLED
);
7060 if (fallback
== fb_none
&& *expr_p
&& !is_gimple_stmt (*expr_p
))
7062 /* We aren't looking for a value, and we don't have a valid
7063 statement. If it doesn't have side-effects, throw it away. */
7064 if (!TREE_SIDE_EFFECTS (*expr_p
))
7066 else if (!TREE_THIS_VOLATILE (*expr_p
))
7068 /* This is probably a _REF that contains something nested that
7069 has side effects. Recurse through the operands to find it. */
7070 enum tree_code code
= TREE_CODE (*expr_p
);
7077 case VIEW_CONVERT_EXPR
:
7078 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
7079 gimple_test_f
, fallback
);
7083 case ARRAY_RANGE_REF
:
7084 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
7085 gimple_test_f
, fallback
);
7086 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
7087 gimple_test_f
, fallback
);
7091 /* Anything else with side-effects must be converted to
7092 a valid statement before we get here. */
7098 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p
))
7099 && TYPE_MODE (TREE_TYPE (*expr_p
)) != BLKmode
)
7101 /* Historically, the compiler has treated a bare reference
7102 to a non-BLKmode volatile lvalue as forcing a load. */
7103 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p
));
7105 /* Normally, we do not want to create a temporary for a
7106 TREE_ADDRESSABLE type because such a type should not be
7107 copied by bitwise-assignment. However, we make an
7108 exception here, as all we are doing here is ensuring that
7109 we read the bytes that make up the type. We use
7110 create_tmp_var_raw because create_tmp_var will abort when
7111 given a TREE_ADDRESSABLE type. */
7112 tree tmp
= create_tmp_var_raw (type
, "vol");
7113 gimple_add_tmp_var (tmp
);
7114 gimplify_assign (tmp
, *expr_p
, pre_p
);
7118 /* We can't do anything useful with a volatile reference to
7119 an incomplete type, so just throw it away. Likewise for
7120 a BLKmode type, since any implicit inner load should
7121 already have been turned into an explicit one by the
7122 gimplification process. */
7126 /* If we are gimplifying at the statement level, we're done. Tack
7127 everything together and return. */
7128 if (fallback
== fb_none
|| is_statement
)
7130 /* Since *EXPR_P has been converted into a GIMPLE tuple, clear
7131 it out for GC to reclaim it. */
7132 *expr_p
= NULL_TREE
;
7134 if (!gimple_seq_empty_p (internal_pre
)
7135 || !gimple_seq_empty_p (internal_post
))
7137 gimplify_seq_add_seq (&internal_pre
, internal_post
);
7138 gimplify_seq_add_seq (pre_p
, internal_pre
);
7141 /* The result of gimplifying *EXPR_P is going to be the last few
7142 statements in *PRE_P and *POST_P. Add location information
7143 to all the statements that were added by the gimplification
7145 if (!gimple_seq_empty_p (*pre_p
))
7146 annotate_all_with_location_after (*pre_p
, pre_last_gsi
, input_location
);
7148 if (!gimple_seq_empty_p (*post_p
))
7149 annotate_all_with_location_after (*post_p
, post_last_gsi
,
7155 #ifdef ENABLE_GIMPLE_CHECKING
7158 enum tree_code code
= TREE_CODE (*expr_p
);
7159 /* These expressions should already be in gimple IR form. */
7160 gcc_assert (code
!= MODIFY_EXPR
7162 && code
!= BIND_EXPR
7163 && code
!= CATCH_EXPR
7164 && (code
!= COND_EXPR
|| gimplify_ctxp
->allow_rhs_cond_expr
)
7165 && code
!= EH_FILTER_EXPR
7166 && code
!= GOTO_EXPR
7167 && code
!= LABEL_EXPR
7168 && code
!= LOOP_EXPR
7169 && code
!= RESX_EXPR
7170 && code
!= SWITCH_EXPR
7171 && code
!= TRY_FINALLY_EXPR
7172 && code
!= OMP_CRITICAL
7174 && code
!= OMP_MASTER
7175 && code
!= OMP_ORDERED
7176 && code
!= OMP_PARALLEL
7177 && code
!= OMP_SECTIONS
7178 && code
!= OMP_SECTION
7179 && code
!= OMP_SINGLE
);
7183 /* Otherwise we're gimplifying a subexpression, so the resulting
7184 value is interesting. If it's a valid operand that matches
7185 GIMPLE_TEST_F, we're done. Unless we are handling some
7186 post-effects internally; if that's the case, we need to copy into
7187 a temporary before adding the post-effects to POST_P. */
7188 if (gimple_seq_empty_p (internal_post
) && (*gimple_test_f
) (*expr_p
))
7191 /* Otherwise, we need to create a new temporary for the gimplified
7194 /* We can't return an lvalue if we have an internal postqueue. The
7195 object the lvalue refers to would (probably) be modified by the
7196 postqueue; we need to copy the value out first, which means an
7198 if ((fallback
& fb_lvalue
)
7199 && gimple_seq_empty_p (internal_post
)
7200 && is_gimple_addressable (*expr_p
))
7202 /* An lvalue will do. Take the address of the expression, store it
7203 in a temporary, and replace the expression with an INDIRECT_REF of
7205 tmp
= build_fold_addr_expr_loc (input_location
, *expr_p
);
7206 gimplify_expr (&tmp
, pre_p
, post_p
, is_gimple_reg
, fb_rvalue
);
7207 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (tmp
)), tmp
);
7209 else if ((fallback
& fb_rvalue
) && is_gimple_reg_rhs_or_call (*expr_p
))
7211 /* An rvalue will do. Assign the gimplified expression into a
7212 new temporary TMP and replace the original expression with
7213 TMP. First, make sure that the expression has a type so that
7214 it can be assigned into a temporary. */
7215 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p
)));
7217 if (!gimple_seq_empty_p (internal_post
) || (fallback
& fb_lvalue
))
7218 /* The postqueue might change the value of the expression between
7219 the initialization and use of the temporary, so we can't use a
7220 formal temp. FIXME do we care? */
7222 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
7223 if (TREE_CODE (TREE_TYPE (*expr_p
)) == COMPLEX_TYPE
7224 || TREE_CODE (TREE_TYPE (*expr_p
)) == VECTOR_TYPE
)
7225 DECL_GIMPLE_REG_P (*expr_p
) = 1;
7228 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
7232 #ifdef ENABLE_GIMPLE_CHECKING
7233 if (!(fallback
& fb_mayfail
))
7235 fprintf (stderr
, "gimplification failed:\n");
7236 print_generic_expr (stderr
, *expr_p
, 0);
7237 debug_tree (*expr_p
);
7238 internal_error ("gimplification failed");
7241 gcc_assert (fallback
& fb_mayfail
);
7243 /* If this is an asm statement, and the user asked for the
7244 impossible, don't die. Fail and let gimplify_asm_expr
7250 /* Make sure the temporary matches our predicate. */
7251 gcc_assert ((*gimple_test_f
) (*expr_p
));
7253 if (!gimple_seq_empty_p (internal_post
))
7255 annotate_all_with_location (internal_post
, input_location
);
7256 gimplify_seq_add_seq (pre_p
, internal_post
);
7260 input_location
= saved_location
;
7264 /* Look through TYPE for variable-sized objects and gimplify each such
7265 size that we find. Add to LIST_P any statements generated. */
7268 gimplify_type_sizes (tree type
, gimple_seq
*list_p
)
7272 if (type
== NULL
|| type
== error_mark_node
)
7275 /* We first do the main variant, then copy into any other variants. */
7276 type
= TYPE_MAIN_VARIANT (type
);
7278 /* Avoid infinite recursion. */
7279 if (TYPE_SIZES_GIMPLIFIED (type
))
7282 TYPE_SIZES_GIMPLIFIED (type
) = 1;
7284 switch (TREE_CODE (type
))
7290 case FIXED_POINT_TYPE
:
7291 gimplify_one_sizepos (&TYPE_MIN_VALUE (type
), list_p
);
7292 gimplify_one_sizepos (&TYPE_MAX_VALUE (type
), list_p
);
7294 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
7296 TYPE_MIN_VALUE (t
) = TYPE_MIN_VALUE (type
);
7297 TYPE_MAX_VALUE (t
) = TYPE_MAX_VALUE (type
);
7302 /* These types may not have declarations, so handle them here. */
7303 gimplify_type_sizes (TREE_TYPE (type
), list_p
);
7304 gimplify_type_sizes (TYPE_DOMAIN (type
), list_p
);
7305 /* When not optimizing, ensure VLA bounds aren't removed. */
7307 && TYPE_DOMAIN (type
)
7308 && INTEGRAL_TYPE_P (TYPE_DOMAIN (type
)))
7310 t
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
7311 if (t
&& TREE_CODE (t
) == VAR_DECL
&& DECL_ARTIFICIAL (t
))
7312 DECL_IGNORED_P (t
) = 0;
7313 t
= TYPE_MAX_VALUE (TYPE_DOMAIN (type
));
7314 if (t
&& TREE_CODE (t
) == VAR_DECL
&& DECL_ARTIFICIAL (t
))
7315 DECL_IGNORED_P (t
) = 0;
7321 case QUAL_UNION_TYPE
:
7322 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
7323 if (TREE_CODE (field
) == FIELD_DECL
)
7325 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field
), list_p
);
7326 gimplify_one_sizepos (&DECL_SIZE (field
), list_p
);
7327 gimplify_one_sizepos (&DECL_SIZE_UNIT (field
), list_p
);
7328 gimplify_type_sizes (TREE_TYPE (field
), list_p
);
7333 case REFERENCE_TYPE
:
7334 /* We used to recurse on the pointed-to type here, which turned out to
7335 be incorrect because its definition might refer to variables not
7336 yet initialized at this point if a forward declaration is involved.
7338 It was actually useful for anonymous pointed-to types to ensure
7339 that the sizes evaluation dominates every possible later use of the
7340 values. Restricting to such types here would be safe since there
7341 is no possible forward declaration around, but would introduce an
7342 undesirable middle-end semantic to anonymity. We then defer to
7343 front-ends the responsibility of ensuring that the sizes are
7344 evaluated both early and late enough, e.g. by attaching artificial
7345 type declarations to the tree. */
7352 gimplify_one_sizepos (&TYPE_SIZE (type
), list_p
);
7353 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type
), list_p
);
7355 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
7357 TYPE_SIZE (t
) = TYPE_SIZE (type
);
7358 TYPE_SIZE_UNIT (t
) = TYPE_SIZE_UNIT (type
);
7359 TYPE_SIZES_GIMPLIFIED (t
) = 1;
7363 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
7364 a size or position, has had all of its SAVE_EXPRs evaluated.
7365 We add any required statements to *STMT_P. */
7368 gimplify_one_sizepos (tree
*expr_p
, gimple_seq
*stmt_p
)
7370 tree type
, expr
= *expr_p
;
7372 /* We don't do anything if the value isn't there, is constant, or contains
7373 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
7374 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
7375 will want to replace it with a new variable, but that will cause problems
7376 if this type is from outside the function. It's OK to have that here. */
7377 if (expr
== NULL_TREE
|| TREE_CONSTANT (expr
)
7378 || TREE_CODE (expr
) == VAR_DECL
7379 || CONTAINS_PLACEHOLDER_P (expr
))
7382 type
= TREE_TYPE (expr
);
7383 *expr_p
= unshare_expr (expr
);
7385 gimplify_expr (expr_p
, stmt_p
, NULL
, is_gimple_val
, fb_rvalue
);
7388 /* Verify that we've an exact type match with the original expression.
7389 In particular, we do not wish to drop a "sizetype" in favour of a
7390 type of similar dimensions. We don't want to pollute the generic
7391 type-stripping code with this knowledge because it doesn't matter
7392 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
7393 and friends retain their "sizetype-ness". */
7394 if (TREE_TYPE (expr
) != type
7395 && TREE_CODE (type
) == INTEGER_TYPE
7396 && TYPE_IS_SIZETYPE (type
))
7401 *expr_p
= create_tmp_var (type
, NULL
);
7402 tmp
= build1 (NOP_EXPR
, type
, expr
);
7403 stmt
= gimplify_assign (*expr_p
, tmp
, stmt_p
);
7404 if (EXPR_HAS_LOCATION (expr
))
7405 gimple_set_location (stmt
, EXPR_LOCATION (expr
));
7407 gimple_set_location (stmt
, input_location
);
7412 /* Gimplify the body of statements pointed to by BODY_P and return a
7413 GIMPLE_BIND containing the sequence of GIMPLE statements
7414 corresponding to BODY_P. FNDECL is the function decl containing
7418 gimplify_body (tree
*body_p
, tree fndecl
, bool do_parms
)
7420 location_t saved_location
= input_location
;
7421 gimple_seq parm_stmts
, seq
;
7423 struct gimplify_ctx gctx
;
7425 timevar_push (TV_TREE_GIMPLIFY
);
7427 /* Initialize for optimize_insn_for_s{ize,peed}_p possibly called during
7429 default_rtl_profile ();
7431 gcc_assert (gimplify_ctxp
== NULL
);
7432 push_gimplify_context (&gctx
);
7434 /* Unshare most shared trees in the body and in that of any nested functions.
7435 It would seem we don't have to do this for nested functions because
7436 they are supposed to be output and then the outer function gimplified
7437 first, but the g++ front end doesn't always do it that way. */
7438 unshare_body (body_p
, fndecl
);
7439 unvisit_body (body_p
, fndecl
);
7441 if (cgraph_node (fndecl
)->origin
)
7442 nonlocal_vlas
= pointer_set_create ();
7444 /* Make sure input_location isn't set to something weird. */
7445 input_location
= DECL_SOURCE_LOCATION (fndecl
);
7447 /* Resolve callee-copies. This has to be done before processing
7448 the body so that DECL_VALUE_EXPR gets processed correctly. */
7449 parm_stmts
= (do_parms
) ? gimplify_parameters () : NULL
;
7451 /* Gimplify the function's body. */
7453 gimplify_stmt (body_p
, &seq
);
7454 outer_bind
= gimple_seq_first_stmt (seq
);
7457 outer_bind
= gimple_build_nop ();
7458 gimplify_seq_add_stmt (&seq
, outer_bind
);
7461 /* The body must contain exactly one statement, a GIMPLE_BIND. If this is
7462 not the case, wrap everything in a GIMPLE_BIND to make it so. */
7463 if (gimple_code (outer_bind
) == GIMPLE_BIND
7464 && gimple_seq_first (seq
) == gimple_seq_last (seq
))
7467 outer_bind
= gimple_build_bind (NULL_TREE
, seq
, NULL
);
7469 *body_p
= NULL_TREE
;
7471 /* If we had callee-copies statements, insert them at the beginning
7473 if (!gimple_seq_empty_p (parm_stmts
))
7475 gimplify_seq_add_seq (&parm_stmts
, gimple_bind_body (outer_bind
));
7476 gimple_bind_set_body (outer_bind
, parm_stmts
);
7481 pointer_set_destroy (nonlocal_vlas
);
7482 nonlocal_vlas
= NULL
;
7485 pop_gimplify_context (outer_bind
);
7486 gcc_assert (gimplify_ctxp
== NULL
);
7488 #ifdef ENABLE_TYPES_CHECKING
7489 if (!errorcount
&& !sorrycount
)
7490 verify_types_in_gimple_seq (gimple_bind_body (outer_bind
));
7493 timevar_pop (TV_TREE_GIMPLIFY
);
7494 input_location
= saved_location
;
7499 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
7500 node for the function we want to gimplify.
7502 Returns the sequence of GIMPLE statements corresponding to the body
7506 gimplify_function_tree (tree fndecl
)
7508 tree oldfn
, parm
, ret
;
7512 gcc_assert (!gimple_body (fndecl
));
7514 oldfn
= current_function_decl
;
7515 current_function_decl
= fndecl
;
7516 if (DECL_STRUCT_FUNCTION (fndecl
))
7517 push_cfun (DECL_STRUCT_FUNCTION (fndecl
));
7519 push_struct_function (fndecl
);
7521 for (parm
= DECL_ARGUMENTS (fndecl
); parm
; parm
= TREE_CHAIN (parm
))
7523 /* Preliminarily mark non-addressed complex variables as eligible
7524 for promotion to gimple registers. We'll transform their uses
7526 if ((TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
7527 || TREE_CODE (TREE_TYPE (parm
)) == VECTOR_TYPE
)
7528 && !TREE_THIS_VOLATILE (parm
)
7529 && !needs_to_live_in_memory (parm
))
7530 DECL_GIMPLE_REG_P (parm
) = 1;
7533 ret
= DECL_RESULT (fndecl
);
7534 if ((TREE_CODE (TREE_TYPE (ret
)) == COMPLEX_TYPE
7535 || TREE_CODE (TREE_TYPE (ret
)) == VECTOR_TYPE
)
7536 && !needs_to_live_in_memory (ret
))
7537 DECL_GIMPLE_REG_P (ret
) = 1;
7539 bind
= gimplify_body (&DECL_SAVED_TREE (fndecl
), fndecl
, true);
7541 /* The tree body of the function is no longer needed, replace it
7542 with the new GIMPLE body. */
7543 seq
= gimple_seq_alloc ();
7544 gimple_seq_add_stmt (&seq
, bind
);
7545 gimple_set_body (fndecl
, seq
);
7547 /* If we're instrumenting function entry/exit, then prepend the call to
7548 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
7549 catch the exit hook. */
7550 /* ??? Add some way to ignore exceptions for this TFE. */
7551 if (flag_instrument_function_entry_exit
7552 && !DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl
)
7553 && !flag_instrument_functions_exclude_p (fndecl
))
7558 gimple_seq cleanup
= NULL
, body
= NULL
;
7560 x
= implicit_built_in_decls
[BUILT_IN_PROFILE_FUNC_EXIT
];
7561 gimplify_seq_add_stmt (&cleanup
, gimple_build_call (x
, 0));
7562 tf
= gimple_build_try (seq
, cleanup
, GIMPLE_TRY_FINALLY
);
7564 x
= implicit_built_in_decls
[BUILT_IN_PROFILE_FUNC_ENTER
];
7565 gimplify_seq_add_stmt (&body
, gimple_build_call (x
, 0));
7566 gimplify_seq_add_stmt (&body
, tf
);
7567 new_bind
= gimple_build_bind (NULL
, body
, gimple_bind_block (bind
));
7568 /* Clear the block for BIND, since it is no longer directly inside
7569 the function, but within a try block. */
7570 gimple_bind_set_block (bind
, NULL
);
7572 /* Replace the current function body with the body
7573 wrapped in the try/finally TF. */
7574 seq
= gimple_seq_alloc ();
7575 gimple_seq_add_stmt (&seq
, new_bind
);
7576 gimple_set_body (fndecl
, seq
);
7579 DECL_SAVED_TREE (fndecl
) = NULL_TREE
;
7580 cfun
->curr_properties
= PROP_gimple_any
;
7582 current_function_decl
= oldfn
;
7587 /* Some transformations like inlining may invalidate the GIMPLE form
7588 for operands. This function traverses all the operands in STMT and
7589 gimplifies anything that is not a valid gimple operand. Any new
7590 GIMPLE statements are inserted before *GSI_P. */
7593 gimple_regimplify_operands (gimple stmt
, gimple_stmt_iterator
*gsi_p
)
7596 tree orig_lhs
= NULL_TREE
, lhs
, t
;
7597 gimple_seq pre
= NULL
;
7598 gimple post_stmt
= NULL
;
7599 struct gimplify_ctx gctx
;
7601 push_gimplify_context (&gctx
);
7602 gimplify_ctxp
->into_ssa
= gimple_in_ssa_p (cfun
);
7604 switch (gimple_code (stmt
))
7607 gimplify_expr (gimple_cond_lhs_ptr (stmt
), &pre
, NULL
,
7608 is_gimple_val
, fb_rvalue
);
7609 gimplify_expr (gimple_cond_rhs_ptr (stmt
), &pre
, NULL
,
7610 is_gimple_val
, fb_rvalue
);
7613 gimplify_expr (gimple_switch_index_ptr (stmt
), &pre
, NULL
,
7614 is_gimple_val
, fb_rvalue
);
7616 case GIMPLE_OMP_ATOMIC_LOAD
:
7617 gimplify_expr (gimple_omp_atomic_load_rhs_ptr (stmt
), &pre
, NULL
,
7618 is_gimple_val
, fb_rvalue
);
7622 size_t i
, noutputs
= gimple_asm_noutputs (stmt
);
7623 const char *constraint
, **oconstraints
;
7624 bool allows_mem
, allows_reg
, is_inout
;
7627 = (const char **) alloca ((noutputs
) * sizeof (const char *));
7628 for (i
= 0; i
< noutputs
; i
++)
7630 tree op
= gimple_asm_output_op (stmt
, i
);
7631 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op
)));
7632 oconstraints
[i
] = constraint
;
7633 parse_output_constraint (&constraint
, i
, 0, 0, &allows_mem
,
7634 &allows_reg
, &is_inout
);
7635 gimplify_expr (&TREE_VALUE (op
), &pre
, NULL
,
7636 is_inout
? is_gimple_min_lval
: is_gimple_lvalue
,
7637 fb_lvalue
| fb_mayfail
);
7639 for (i
= 0; i
< gimple_asm_ninputs (stmt
); i
++)
7641 tree op
= gimple_asm_input_op (stmt
, i
);
7642 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op
)));
7643 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
7644 oconstraints
, &allows_mem
, &allows_reg
);
7645 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (op
))) && allows_mem
)
7647 if (!allows_reg
&& allows_mem
)
7648 gimplify_expr (&TREE_VALUE (op
), &pre
, NULL
,
7649 is_gimple_lvalue
, fb_lvalue
| fb_mayfail
);
7651 gimplify_expr (&TREE_VALUE (op
), &pre
, NULL
,
7652 is_gimple_asm_val
, fb_rvalue
);
7657 /* NOTE: We start gimplifying operands from last to first to
7658 make sure that side-effects on the RHS of calls, assignments
7659 and ASMs are executed before the LHS. The ordering is not
7660 important for other statements. */
7661 num_ops
= gimple_num_ops (stmt
);
7662 orig_lhs
= gimple_get_lhs (stmt
);
7663 for (i
= num_ops
; i
> 0; i
--)
7665 tree op
= gimple_op (stmt
, i
- 1);
7666 if (op
== NULL_TREE
)
7668 if (i
== 1 && (is_gimple_call (stmt
) || is_gimple_assign (stmt
)))
7669 gimplify_expr (&op
, &pre
, NULL
, is_gimple_lvalue
, fb_lvalue
);
7671 && is_gimple_assign (stmt
)
7673 && get_gimple_rhs_class (gimple_expr_code (stmt
))
7674 == GIMPLE_SINGLE_RHS
)
7675 gimplify_expr (&op
, &pre
, NULL
,
7676 rhs_predicate_for (gimple_assign_lhs (stmt
)),
7678 else if (i
== 2 && is_gimple_call (stmt
))
7680 if (TREE_CODE (op
) == FUNCTION_DECL
)
7682 gimplify_expr (&op
, &pre
, NULL
, is_gimple_call_addr
, fb_rvalue
);
7685 gimplify_expr (&op
, &pre
, NULL
, is_gimple_val
, fb_rvalue
);
7686 gimple_set_op (stmt
, i
- 1, op
);
7689 lhs
= gimple_get_lhs (stmt
);
7690 /* If the LHS changed it in a way that requires a simple RHS,
7691 create temporary. */
7692 if (lhs
&& !is_gimple_reg (lhs
))
7694 bool need_temp
= false;
7696 if (is_gimple_assign (stmt
)
7698 && get_gimple_rhs_class (gimple_expr_code (stmt
))
7699 == GIMPLE_SINGLE_RHS
)
7700 gimplify_expr (gimple_assign_rhs1_ptr (stmt
), &pre
, NULL
,
7701 rhs_predicate_for (gimple_assign_lhs (stmt
)),
7703 else if (is_gimple_reg (lhs
))
7705 if (is_gimple_reg_type (TREE_TYPE (lhs
)))
7707 if (is_gimple_call (stmt
))
7709 i
= gimple_call_flags (stmt
);
7710 if ((i
& ECF_LOOPING_CONST_OR_PURE
)
7711 || !(i
& (ECF_CONST
| ECF_PURE
)))
7714 if (stmt_can_throw_internal (stmt
))
7720 if (is_gimple_reg_type (TREE_TYPE (lhs
)))
7722 else if (TYPE_MODE (TREE_TYPE (lhs
)) != BLKmode
)
7724 if (is_gimple_call (stmt
))
7726 tree fndecl
= gimple_call_fndecl (stmt
);
7728 if (!aggregate_value_p (TREE_TYPE (lhs
), fndecl
)
7729 && !(fndecl
&& DECL_RESULT (fndecl
)
7730 && DECL_BY_REFERENCE (DECL_RESULT (fndecl
))))
7739 tree temp
= create_tmp_var (TREE_TYPE (lhs
), NULL
);
7741 if (TREE_CODE (TREE_TYPE (lhs
)) == COMPLEX_TYPE
7742 || TREE_CODE (TREE_TYPE (lhs
)) == VECTOR_TYPE
)
7743 DECL_GIMPLE_REG_P (temp
) = 1;
7744 if (TREE_CODE (orig_lhs
) == SSA_NAME
)
7745 orig_lhs
= SSA_NAME_VAR (orig_lhs
);
7747 if (gimple_in_ssa_p (cfun
))
7748 temp
= make_ssa_name (temp
, NULL
);
7749 gimple_set_lhs (stmt
, temp
);
7750 post_stmt
= gimple_build_assign (lhs
, temp
);
7751 if (TREE_CODE (lhs
) == SSA_NAME
)
7752 SSA_NAME_DEF_STMT (lhs
) = post_stmt
;
7758 if (gimple_referenced_vars (cfun
))
7759 for (t
= gimplify_ctxp
->temps
; t
; t
= TREE_CHAIN (t
))
7760 add_referenced_var (t
);
7762 if (!gimple_seq_empty_p (pre
))
7764 if (gimple_in_ssa_p (cfun
))
7766 gimple_stmt_iterator i
;
7768 for (i
= gsi_start (pre
); !gsi_end_p (i
); gsi_next (&i
))
7769 mark_symbols_for_renaming (gsi_stmt (i
));
7771 gsi_insert_seq_before (gsi_p
, pre
, GSI_SAME_STMT
);
7774 gsi_insert_after (gsi_p
, post_stmt
, GSI_NEW_STMT
);
7776 pop_gimplify_context (NULL
);
7780 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
7781 force the result to be either ssa_name or an invariant, otherwise
7782 just force it to be a rhs expression. If VAR is not NULL, make the
7783 base variable of the final destination be VAR if suitable. */
7786 force_gimple_operand (tree expr
, gimple_seq
*stmts
, bool simple
, tree var
)
7789 enum gimplify_status ret
;
7790 gimple_predicate gimple_test_f
;
7791 struct gimplify_ctx gctx
;
7795 if (is_gimple_val (expr
))
7798 gimple_test_f
= simple
? is_gimple_val
: is_gimple_reg_rhs
;
7800 push_gimplify_context (&gctx
);
7801 gimplify_ctxp
->into_ssa
= gimple_in_ssa_p (cfun
);
7802 gimplify_ctxp
->allow_rhs_cond_expr
= true;
7805 expr
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, expr
);
7807 if (TREE_CODE (expr
) != MODIFY_EXPR
7808 && TREE_TYPE (expr
) == void_type_node
)
7810 gimplify_and_add (expr
, stmts
);
7815 ret
= gimplify_expr (&expr
, stmts
, NULL
, gimple_test_f
, fb_rvalue
);
7816 gcc_assert (ret
!= GS_ERROR
);
7819 if (gimple_referenced_vars (cfun
))
7820 for (t
= gimplify_ctxp
->temps
; t
; t
= TREE_CHAIN (t
))
7821 add_referenced_var (t
);
7823 pop_gimplify_context (NULL
);
7828 /* Invokes force_gimple_operand for EXPR with parameters SIMPLE_P and VAR. If
7829 some statements are produced, emits them at GSI. If BEFORE is true.
7830 the statements are appended before GSI, otherwise they are appended after
7831 it. M specifies the way GSI moves after insertion (GSI_SAME_STMT or
7832 GSI_CONTINUE_LINKING are the usual values). */
7835 force_gimple_operand_gsi (gimple_stmt_iterator
*gsi
, tree expr
,
7836 bool simple_p
, tree var
, bool before
,
7837 enum gsi_iterator_update m
)
7841 expr
= force_gimple_operand (expr
, &stmts
, simple_p
, var
);
7843 if (!gimple_seq_empty_p (stmts
))
7845 if (gimple_in_ssa_p (cfun
))
7847 gimple_stmt_iterator i
;
7849 for (i
= gsi_start (stmts
); !gsi_end_p (i
); gsi_next (&i
))
7850 mark_symbols_for_renaming (gsi_stmt (i
));
7854 gsi_insert_seq_before (gsi
, stmts
, m
);
7856 gsi_insert_seq_after (gsi
, stmts
, m
);
7862 #include "gt-gimplify.h"