1 /* Tree lowering pass. This pass converts the GENERIC functions-as-trees
2 tree representation into the GIMPLE form.
3 Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
4 Free Software Foundation, Inc.
5 Major work done by Sebastian Pop <s.pop@laposte.net>,
6 Diego Novillo <dnovillo@redhat.com> and Jason Merrill <jason@redhat.com>.
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify it under
11 the terms of the GNU General Public License as published by the Free
12 Software Foundation; either version 3, or (at your option) any later
15 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
16 WARRANTY; without even the implied warranty of MERCHANTABILITY or
17 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
26 #include "coretypes.h"
32 #include "tree-iterator.h"
33 #include "tree-inline.h"
34 #include "diagnostic.h"
35 #include "langhooks.h"
36 #include "langhooks-def.h"
37 #include "tree-flow.h"
51 #include "pointer-set.h"
52 #include "splay-tree.h"
57 enum gimplify_omp_var_data
63 GOVD_FIRSTPRIVATE
= 16,
64 GOVD_LASTPRIVATE
= 32,
67 GOVD_DEBUG_PRIVATE
= 256,
68 GOVD_PRIVATE_OUTER_REF
= 512,
69 GOVD_DATA_SHARE_CLASS
= (GOVD_SHARED
| GOVD_PRIVATE
| GOVD_FIRSTPRIVATE
70 | GOVD_LASTPRIVATE
| GOVD_REDUCTION
| GOVD_LOCAL
)
79 ORT_COMBINED_PARALLEL
= 3
82 struct gimplify_omp_ctx
84 struct gimplify_omp_ctx
*outer_context
;
86 struct pointer_set_t
*privatized_types
;
88 enum omp_clause_default_kind default_kind
;
89 enum omp_region_type region_type
;
92 static struct gimplify_ctx
*gimplify_ctxp
;
93 static struct gimplify_omp_ctx
*gimplify_omp_ctxp
;
96 /* Formal (expression) temporary table handling: Multiple occurrences of
97 the same scalar expression are evaluated into the same temporary. */
99 typedef struct gimple_temp_hash_elt
102 tree temp
; /* Value */
105 /* Forward declarations. */
106 static enum gimplify_status
gimplify_compound_expr (tree
*, gimple_seq
*, bool);
108 /* Mark X addressable. Unlike the langhook we expect X to be in gimple
109 form and we don't do any syntax checking. */
111 mark_addressable (tree x
)
113 while (handled_component_p (x
))
114 x
= TREE_OPERAND (x
, 0);
115 if (TREE_CODE (x
) != VAR_DECL
116 && TREE_CODE (x
) != PARM_DECL
117 && TREE_CODE (x
) != RESULT_DECL
)
119 TREE_ADDRESSABLE (x
) = 1;
122 /* Return a hash value for a formal temporary table entry. */
125 gimple_tree_hash (const void *p
)
127 tree t
= ((const elt_t
*) p
)->val
;
128 return iterative_hash_expr (t
, 0);
131 /* Compare two formal temporary table entries. */
134 gimple_tree_eq (const void *p1
, const void *p2
)
136 tree t1
= ((const elt_t
*) p1
)->val
;
137 tree t2
= ((const elt_t
*) p2
)->val
;
138 enum tree_code code
= TREE_CODE (t1
);
140 if (TREE_CODE (t2
) != code
141 || TREE_TYPE (t1
) != TREE_TYPE (t2
))
144 if (!operand_equal_p (t1
, t2
, 0))
147 /* Only allow them to compare equal if they also hash equal; otherwise
148 results are nondeterminate, and we fail bootstrap comparison. */
149 gcc_assert (gimple_tree_hash (p1
) == gimple_tree_hash (p2
));
154 /* Link gimple statement GS to the end of the sequence *SEQ_P. If
155 *SEQ_P is NULL, a new sequence is allocated. This function is
156 similar to gimple_seq_add_stmt, but does not scan the operands.
157 During gimplification, we need to manipulate statement sequences
158 before the def/use vectors have been constructed. */
161 gimplify_seq_add_stmt (gimple_seq
*seq_p
, gimple gs
)
163 gimple_stmt_iterator si
;
169 *seq_p
= gimple_seq_alloc ();
171 si
= gsi_last (*seq_p
);
173 gsi_insert_after_without_update (&si
, gs
, GSI_NEW_STMT
);
176 /* Append sequence SRC to the end of sequence *DST_P. If *DST_P is
177 NULL, a new sequence is allocated. This function is
178 similar to gimple_seq_add_seq, but does not scan the operands.
179 During gimplification, we need to manipulate statement sequences
180 before the def/use vectors have been constructed. */
183 gimplify_seq_add_seq (gimple_seq
*dst_p
, gimple_seq src
)
185 gimple_stmt_iterator si
;
191 *dst_p
= gimple_seq_alloc ();
193 si
= gsi_last (*dst_p
);
194 gsi_insert_seq_after_without_update (&si
, src
, GSI_NEW_STMT
);
197 /* Set up a context for the gimplifier. */
200 push_gimplify_context (struct gimplify_ctx
*c
)
202 memset (c
, '\0', sizeof (*c
));
203 c
->prev_context
= gimplify_ctxp
;
207 /* Tear down a context for the gimplifier. If BODY is non-null, then
208 put the temporaries into the outer BIND_EXPR. Otherwise, put them
211 BODY is not a sequence, but the first tuple in a sequence. */
214 pop_gimplify_context (gimple body
)
216 struct gimplify_ctx
*c
= gimplify_ctxp
;
218 gcc_assert (c
&& (c
->bind_expr_stack
== NULL
219 || VEC_empty (gimple
, c
->bind_expr_stack
)));
220 VEC_free (gimple
, heap
, c
->bind_expr_stack
);
221 gimplify_ctxp
= c
->prev_context
;
224 declare_vars (c
->temps
, body
, false);
226 record_vars (c
->temps
);
229 htab_delete (c
->temp_htab
);
233 gimple_push_bind_expr (gimple gimple_bind
)
235 if (gimplify_ctxp
->bind_expr_stack
== NULL
)
236 gimplify_ctxp
->bind_expr_stack
= VEC_alloc (gimple
, heap
, 8);
237 VEC_safe_push (gimple
, heap
, gimplify_ctxp
->bind_expr_stack
, gimple_bind
);
241 gimple_pop_bind_expr (void)
243 VEC_pop (gimple
, gimplify_ctxp
->bind_expr_stack
);
247 gimple_current_bind_expr (void)
249 return VEC_last (gimple
, gimplify_ctxp
->bind_expr_stack
);
252 /* Return the stack GIMPLE_BINDs created during gimplification. */
255 gimple_bind_expr_stack (void)
257 return gimplify_ctxp
->bind_expr_stack
;
260 /* Returns true iff there is a COND_EXPR between us and the innermost
261 CLEANUP_POINT_EXPR. This info is used by gimple_push_cleanup. */
264 gimple_conditional_context (void)
266 return gimplify_ctxp
->conditions
> 0;
269 /* Note that we've entered a COND_EXPR. */
272 gimple_push_condition (void)
274 #ifdef ENABLE_GIMPLE_CHECKING
275 if (gimplify_ctxp
->conditions
== 0)
276 gcc_assert (gimple_seq_empty_p (gimplify_ctxp
->conditional_cleanups
));
278 ++(gimplify_ctxp
->conditions
);
281 /* Note that we've left a COND_EXPR. If we're back at unconditional scope
282 now, add any conditional cleanups we've seen to the prequeue. */
285 gimple_pop_condition (gimple_seq
*pre_p
)
287 int conds
= --(gimplify_ctxp
->conditions
);
289 gcc_assert (conds
>= 0);
292 gimplify_seq_add_seq (pre_p
, gimplify_ctxp
->conditional_cleanups
);
293 gimplify_ctxp
->conditional_cleanups
= NULL
;
297 /* A stable comparison routine for use with splay trees and DECLs. */
300 splay_tree_compare_decl_uid (splay_tree_key xa
, splay_tree_key xb
)
305 return DECL_UID (a
) - DECL_UID (b
);
308 /* Create a new omp construct that deals with variable remapping. */
310 static struct gimplify_omp_ctx
*
311 new_omp_context (enum omp_region_type region_type
)
313 struct gimplify_omp_ctx
*c
;
315 c
= XCNEW (struct gimplify_omp_ctx
);
316 c
->outer_context
= gimplify_omp_ctxp
;
317 c
->variables
= splay_tree_new (splay_tree_compare_decl_uid
, 0, 0);
318 c
->privatized_types
= pointer_set_create ();
319 c
->location
= input_location
;
320 c
->region_type
= region_type
;
321 if (region_type
!= ORT_TASK
)
322 c
->default_kind
= OMP_CLAUSE_DEFAULT_SHARED
;
324 c
->default_kind
= OMP_CLAUSE_DEFAULT_UNSPECIFIED
;
329 /* Destroy an omp construct that deals with variable remapping. */
332 delete_omp_context (struct gimplify_omp_ctx
*c
)
334 splay_tree_delete (c
->variables
);
335 pointer_set_destroy (c
->privatized_types
);
339 static void omp_add_variable (struct gimplify_omp_ctx
*, tree
, unsigned int);
340 static bool omp_notice_variable (struct gimplify_omp_ctx
*, tree
, bool);
342 /* A subroutine of append_to_statement_list{,_force}. T is not NULL. */
345 append_to_statement_list_1 (tree t
, tree
*list_p
)
348 tree_stmt_iterator i
;
352 if (t
&& TREE_CODE (t
) == STATEMENT_LIST
)
357 *list_p
= list
= alloc_stmt_list ();
361 tsi_link_after (&i
, t
, TSI_CONTINUE_LINKING
);
364 /* Add T to the end of the list container pointed to by LIST_P.
365 If T is an expression with no effects, it is ignored. */
368 append_to_statement_list (tree t
, tree
*list_p
)
370 if (t
&& TREE_SIDE_EFFECTS (t
))
371 append_to_statement_list_1 (t
, list_p
);
374 /* Similar, but the statement is always added, regardless of side effects. */
377 append_to_statement_list_force (tree t
, tree
*list_p
)
380 append_to_statement_list_1 (t
, list_p
);
383 /* Both gimplify the statement T and append it to *SEQ_P. This function
384 behaves exactly as gimplify_stmt, but you don't have to pass T as a
388 gimplify_and_add (tree t
, gimple_seq
*seq_p
)
390 gimplify_stmt (&t
, seq_p
);
393 /* Gimplify statement T into sequence *SEQ_P, and return the first
394 tuple in the sequence of generated tuples for this statement.
395 Return NULL if gimplifying T produced no tuples. */
398 gimplify_and_return_first (tree t
, gimple_seq
*seq_p
)
400 gimple_stmt_iterator last
= gsi_last (*seq_p
);
402 gimplify_and_add (t
, seq_p
);
404 if (!gsi_end_p (last
))
407 return gsi_stmt (last
);
410 return gimple_seq_first_stmt (*seq_p
);
413 /* Strip off a legitimate source ending from the input string NAME of
414 length LEN. Rather than having to know the names used by all of
415 our front ends, we strip off an ending of a period followed by
416 up to five characters. (Java uses ".class".) */
419 remove_suffix (char *name
, int len
)
423 for (i
= 2; i
< 8 && len
> i
; i
++)
425 if (name
[len
- i
] == '.')
427 name
[len
- i
] = '\0';
433 /* Subroutine for find_single_pointer_decl. */
436 find_single_pointer_decl_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
439 tree
*pdecl
= (tree
*) data
;
441 /* We are only looking for pointers at the same level as the
442 original tree; we must not look through any indirections.
443 Returning anything other than NULL_TREE will cause the caller to
445 if (REFERENCE_CLASS_P (*tp
))
448 if (DECL_P (*tp
) && POINTER_TYPE_P (TREE_TYPE (*tp
)))
452 /* We already found a pointer decl; return anything other
453 than NULL_TREE to unwind from walk_tree signalling that
454 we have a duplicate. */
463 /* Find the single DECL of pointer type in the tree T, used directly
464 rather than via an indirection, and return it. If there are zero
465 or more than one such DECLs, return NULL. */
468 find_single_pointer_decl (tree t
)
470 tree decl
= NULL_TREE
;
472 if (walk_tree (&t
, find_single_pointer_decl_1
, &decl
, NULL
))
474 /* find_single_pointer_decl_1 returns a nonzero value, causing
475 walk_tree to return a nonzero value, to indicate that it
476 found more than one pointer DECL or that it found an
484 /* Create a new temporary name with PREFIX. Returns an identifier. */
486 static GTY(()) unsigned int tmp_var_id_num
;
489 create_tmp_var_name (const char *prefix
)
495 char *preftmp
= ASTRDUP (prefix
);
497 remove_suffix (preftmp
, strlen (preftmp
));
501 ASM_FORMAT_PRIVATE_NAME (tmp_name
, prefix
? prefix
: "T", tmp_var_id_num
++);
502 return get_identifier (tmp_name
);
506 /* Create a new temporary variable declaration of type TYPE.
507 Does NOT push it into the current binding. */
510 create_tmp_var_raw (tree type
, const char *prefix
)
515 /* Make the type of the variable writable. */
516 new_type
= build_type_variant (type
, 0, 0);
517 TYPE_ATTRIBUTES (new_type
) = TYPE_ATTRIBUTES (type
);
519 tmp_var
= build_decl (VAR_DECL
, prefix
? create_tmp_var_name (prefix
) : NULL
,
522 /* The variable was declared by the compiler. */
523 DECL_ARTIFICIAL (tmp_var
) = 1;
524 /* And we don't want debug info for it. */
525 DECL_IGNORED_P (tmp_var
) = 1;
527 /* Make the variable writable. */
528 TREE_READONLY (tmp_var
) = 0;
530 DECL_EXTERNAL (tmp_var
) = 0;
531 TREE_STATIC (tmp_var
) = 0;
532 TREE_USED (tmp_var
) = 1;
537 /* Create a new temporary variable declaration of type TYPE. DOES push the
538 variable into the current binding. Further, assume that this is called
539 only from gimplification or optimization, at which point the creation of
540 certain types are bugs. */
543 create_tmp_var (tree type
, const char *prefix
)
547 /* We don't allow types that are addressable (meaning we can't make copies),
548 or incomplete. We also used to reject every variable size objects here,
549 but now support those for which a constant upper bound can be obtained.
550 The processing for variable sizes is performed in gimple_add_tmp_var,
551 point at which it really matters and possibly reached via paths not going
552 through this function, e.g. after direct calls to create_tmp_var_raw. */
553 gcc_assert (!TREE_ADDRESSABLE (type
) && COMPLETE_TYPE_P (type
));
555 tmp_var
= create_tmp_var_raw (type
, prefix
);
556 gimple_add_tmp_var (tmp_var
);
560 /* Create a temporary with a name derived from VAL. Subroutine of
561 lookup_tmp_var; nobody else should call this function. */
564 create_tmp_from_val (tree val
)
566 return create_tmp_var (TREE_TYPE (val
), get_name (val
));
569 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
570 an existing expression temporary. */
573 lookup_tmp_var (tree val
, bool is_formal
)
577 /* If not optimizing, never really reuse a temporary. local-alloc
578 won't allocate any variable that is used in more than one basic
579 block, which means it will go into memory, causing much extra
580 work in reload and final and poorer code generation, outweighing
581 the extra memory allocation here. */
582 if (!optimize
|| !is_formal
|| TREE_SIDE_EFFECTS (val
))
583 ret
= create_tmp_from_val (val
);
590 if (gimplify_ctxp
->temp_htab
== NULL
)
591 gimplify_ctxp
->temp_htab
592 = htab_create (1000, gimple_tree_hash
, gimple_tree_eq
, free
);
593 slot
= htab_find_slot (gimplify_ctxp
->temp_htab
, (void *)&elt
, INSERT
);
596 elt_p
= XNEW (elt_t
);
598 elt_p
->temp
= ret
= create_tmp_from_val (val
);
599 *slot
= (void *) elt_p
;
603 elt_p
= (elt_t
*) *slot
;
612 /* Return true if T is a CALL_EXPR or an expression that can be
613 assignmed to a temporary. Note that this predicate should only be
614 used during gimplification. See the rationale for this in
615 gimplify_modify_expr. */
618 is_gimple_reg_rhs_or_call (tree t
)
620 return (get_gimple_rhs_class (TREE_CODE (t
)) != GIMPLE_INVALID_RHS
621 || TREE_CODE (t
) == CALL_EXPR
);
624 /* Return true if T is a valid memory RHS or a CALL_EXPR. Note that
625 this predicate should only be used during gimplification. See the
626 rationale for this in gimplify_modify_expr. */
629 is_gimple_mem_rhs_or_call (tree t
)
631 /* If we're dealing with a renamable type, either source or dest must be
632 a renamed variable. */
633 if (is_gimple_reg_type (TREE_TYPE (t
)))
634 return is_gimple_val (t
);
636 return (is_gimple_val (t
) || is_gimple_lvalue (t
)
637 || TREE_CODE (t
) == CALL_EXPR
);
640 /* Helper for get_formal_tmp_var and get_initialized_tmp_var. */
643 internal_get_tmp_var (tree val
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
648 /* Notice that we explicitly allow VAL to be a CALL_EXPR so that we
649 can create an INIT_EXPR and convert it into a GIMPLE_CALL below. */
650 gimplify_expr (&val
, pre_p
, post_p
, is_gimple_reg_rhs_or_call
,
653 t
= lookup_tmp_var (val
, is_formal
);
657 tree u
= find_single_pointer_decl (val
);
659 if (u
&& TREE_CODE (u
) == VAR_DECL
&& DECL_BASED_ON_RESTRICT_P (u
))
660 u
= DECL_GET_RESTRICT_BASE (u
);
661 if (u
&& TYPE_RESTRICT (TREE_TYPE (u
)))
663 if (DECL_BASED_ON_RESTRICT_P (t
))
664 gcc_assert (u
== DECL_GET_RESTRICT_BASE (t
));
667 DECL_BASED_ON_RESTRICT_P (t
) = 1;
668 SET_DECL_RESTRICT_BASE (t
, u
);
672 if (TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
673 || TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
674 DECL_GIMPLE_REG_P (t
) = 1;
677 mod
= build2 (INIT_EXPR
, TREE_TYPE (t
), t
, unshare_expr (val
));
679 if (EXPR_HAS_LOCATION (val
))
680 SET_EXPR_LOCUS (mod
, EXPR_LOCUS (val
));
682 SET_EXPR_LOCATION (mod
, input_location
);
684 /* gimplify_modify_expr might want to reduce this further. */
685 gimplify_and_add (mod
, pre_p
);
688 /* If we're gimplifying into ssa, gimplify_modify_expr will have
689 given our temporary an SSA name. Find and return it. */
690 if (gimplify_ctxp
->into_ssa
)
692 gimple last
= gimple_seq_last_stmt (*pre_p
);
693 t
= gimple_get_lhs (last
);
699 /* Returns a formal temporary variable initialized with VAL. PRE_P is as
700 in gimplify_expr. Only use this function if:
702 1) The value of the unfactored expression represented by VAL will not
703 change between the initialization and use of the temporary, and
704 2) The temporary will not be otherwise modified.
706 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
707 and #2 means it is inappropriate for && temps.
709 For other cases, use get_initialized_tmp_var instead. */
712 get_formal_tmp_var (tree val
, gimple_seq
*pre_p
)
714 return internal_get_tmp_var (val
, pre_p
, NULL
, true);
717 /* Returns a temporary variable initialized with VAL. PRE_P and POST_P
718 are as in gimplify_expr. */
721 get_initialized_tmp_var (tree val
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
723 return internal_get_tmp_var (val
, pre_p
, post_p
, false);
726 /* Declares all the variables in VARS in SCOPE. If DEBUG_INFO is
727 true, generate debug info for them; otherwise don't. */
730 declare_vars (tree vars
, gimple scope
, bool debug_info
)
737 gcc_assert (gimple_code (scope
) == GIMPLE_BIND
);
739 temps
= nreverse (last
);
741 block
= gimple_bind_block (scope
);
742 gcc_assert (!block
|| TREE_CODE (block
) == BLOCK
);
743 if (!block
|| !debug_info
)
745 TREE_CHAIN (last
) = gimple_bind_vars (scope
);
746 gimple_bind_set_vars (scope
, temps
);
750 /* We need to attach the nodes both to the BIND_EXPR and to its
751 associated BLOCK for debugging purposes. The key point here
752 is that the BLOCK_VARS of the BIND_EXPR_BLOCK of a BIND_EXPR
753 is a subchain of the BIND_EXPR_VARS of the BIND_EXPR. */
754 if (BLOCK_VARS (block
))
755 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), temps
);
758 gimple_bind_set_vars (scope
,
759 chainon (gimple_bind_vars (scope
), temps
));
760 BLOCK_VARS (block
) = temps
;
766 /* For VAR a VAR_DECL of variable size, try to find a constant upper bound
767 for the size and adjust DECL_SIZE/DECL_SIZE_UNIT accordingly. Abort if
768 no such upper bound can be obtained. */
771 force_constant_size (tree var
)
773 /* The only attempt we make is by querying the maximum size of objects
774 of the variable's type. */
776 HOST_WIDE_INT max_size
;
778 gcc_assert (TREE_CODE (var
) == VAR_DECL
);
780 max_size
= max_int_size_in_bytes (TREE_TYPE (var
));
782 gcc_assert (max_size
>= 0);
785 = build_int_cst (TREE_TYPE (DECL_SIZE_UNIT (var
)), max_size
);
787 = build_int_cst (TREE_TYPE (DECL_SIZE (var
)), max_size
* BITS_PER_UNIT
);
791 gimple_add_tmp_var (tree tmp
)
793 gcc_assert (!TREE_CHAIN (tmp
) && !DECL_SEEN_IN_BIND_EXPR_P (tmp
));
795 /* Later processing assumes that the object size is constant, which might
796 not be true at this point. Force the use of a constant upper bound in
798 if (!host_integerp (DECL_SIZE_UNIT (tmp
), 1))
799 force_constant_size (tmp
);
801 DECL_CONTEXT (tmp
) = current_function_decl
;
802 DECL_SEEN_IN_BIND_EXPR_P (tmp
) = 1;
806 TREE_CHAIN (tmp
) = gimplify_ctxp
->temps
;
807 gimplify_ctxp
->temps
= tmp
;
809 /* Mark temporaries local within the nearest enclosing parallel. */
810 if (gimplify_omp_ctxp
)
812 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
813 while (ctx
&& ctx
->region_type
== ORT_WORKSHARE
)
814 ctx
= ctx
->outer_context
;
816 omp_add_variable (ctx
, tmp
, GOVD_LOCAL
| GOVD_SEEN
);
825 /* This case is for nested functions. We need to expose the locals
827 body_seq
= gimple_body (current_function_decl
);
828 declare_vars (tmp
, gimple_seq_first_stmt (body_seq
), false);
832 /* Determines whether to assign a location to the statement GS. */
835 should_carry_location_p (gimple gs
)
837 /* Don't emit a line note for a label. We particularly don't want to
838 emit one for the break label, since it doesn't actually correspond
839 to the beginning of the loop/switch. */
840 if (gimple_code (gs
) == GIMPLE_LABEL
)
846 /* Same, but for a tree. */
849 tree_should_carry_location_p (const_tree stmt
)
851 /* Don't emit a line note for a label. We particularly don't want to
852 emit one for the break label, since it doesn't actually correspond
853 to the beginning of the loop/switch. */
854 if (TREE_CODE (stmt
) == LABEL_EXPR
)
857 /* Do not annotate empty statements, since it confuses gcov. */
858 if (!TREE_SIDE_EFFECTS (stmt
))
864 /* Return true if a location should not be emitted for this statement
865 by annotate_one_with_location. */
868 gimple_do_not_emit_location_p (gimple g
)
870 return gimple_plf (g
, GF_PLF_1
);
873 /* Mark statement G so a location will not be emitted by
874 annotate_one_with_location. */
877 gimple_set_do_not_emit_location (gimple g
)
879 /* The PLF flags are initialized to 0 when a new tuple is created,
880 so no need to initialize it anywhere. */
881 gimple_set_plf (g
, GF_PLF_1
, true);
884 /* Set the location for gimple statement GS to LOCUS. */
887 annotate_one_with_location (gimple gs
, location_t location
)
889 if (!gimple_has_location (gs
)
890 && !gimple_do_not_emit_location_p (gs
)
891 && should_carry_location_p (gs
))
892 gimple_set_location (gs
, location
);
895 /* Same, but for tree T. */
898 tree_annotate_one_with_location (tree t
, location_t location
)
900 if (CAN_HAVE_LOCATION_P (t
)
901 && ! EXPR_HAS_LOCATION (t
) && tree_should_carry_location_p (t
))
902 SET_EXPR_LOCATION (t
, location
);
906 /* Set LOCATION for all the statements after iterator GSI in sequence
907 SEQ. If GSI is pointing to the end of the sequence, start with the
908 first statement in SEQ. */
911 annotate_all_with_location_after (gimple_seq seq
, gimple_stmt_iterator gsi
,
915 gsi
= gsi_start (seq
);
919 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
920 annotate_one_with_location (gsi_stmt (gsi
), location
);
924 /* Set the location for all the statements in a sequence STMT_P to LOCUS. */
927 annotate_all_with_location (gimple_seq stmt_p
, location_t location
)
929 gimple_stmt_iterator i
;
931 if (gimple_seq_empty_p (stmt_p
))
934 for (i
= gsi_start (stmt_p
); !gsi_end_p (i
); gsi_next (&i
))
936 gimple gs
= gsi_stmt (i
);
937 annotate_one_with_location (gs
, location
);
941 /* Same, but for statement or statement list in *STMT_P. */
944 tree_annotate_all_with_location (tree
*stmt_p
, location_t location
)
946 tree_stmt_iterator i
;
951 for (i
= tsi_start (*stmt_p
); !tsi_end_p (i
); tsi_next (&i
))
953 tree t
= tsi_stmt (i
);
955 /* Assuming we've already been gimplified, we shouldn't
956 see nested chaining constructs anymore. */
957 gcc_assert (TREE_CODE (t
) != STATEMENT_LIST
958 && TREE_CODE (t
) != COMPOUND_EXPR
);
960 tree_annotate_one_with_location (t
, location
);
965 /* Similar to copy_tree_r() but do not copy SAVE_EXPR or TARGET_EXPR nodes.
966 These nodes model computations that should only be done once. If we
967 were to unshare something like SAVE_EXPR(i++), the gimplification
968 process would create wrong code. */
971 mostly_copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data
)
973 enum tree_code code
= TREE_CODE (*tp
);
974 /* Don't unshare types, decls, constants and SAVE_EXPR nodes. */
975 if (TREE_CODE_CLASS (code
) == tcc_type
976 || TREE_CODE_CLASS (code
) == tcc_declaration
977 || TREE_CODE_CLASS (code
) == tcc_constant
978 || code
== SAVE_EXPR
|| code
== TARGET_EXPR
979 /* We can't do anything sensible with a BLOCK used as an expression,
980 but we also can't just die when we see it because of non-expression
981 uses. So just avert our eyes and cross our fingers. Silly Java. */
986 gcc_assert (code
!= BIND_EXPR
);
987 copy_tree_r (tp
, walk_subtrees
, data
);
993 /* Callback for walk_tree to unshare most of the shared trees rooted at
994 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
995 then *TP is deep copied by calling copy_tree_r.
997 This unshares the same trees as copy_tree_r with the exception of
998 SAVE_EXPR nodes. These nodes model computations that should only be
999 done once. If we were to unshare something like SAVE_EXPR(i++), the
1000 gimplification process would create wrong code. */
1003 copy_if_shared_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
1004 void *data ATTRIBUTE_UNUSED
)
1007 enum tree_code code
= TREE_CODE (t
);
1009 /* Skip types, decls, and constants. But we do want to look at their
1010 types and the bounds of types. Mark them as visited so we properly
1011 unmark their subtrees on the unmark pass. If we've already seen them,
1012 don't look down further. */
1013 if (TREE_CODE_CLASS (code
) == tcc_type
1014 || TREE_CODE_CLASS (code
) == tcc_declaration
1015 || TREE_CODE_CLASS (code
) == tcc_constant
)
1017 if (TREE_VISITED (t
))
1020 TREE_VISITED (t
) = 1;
1023 /* If this node has been visited already, unshare it and don't look
1025 else if (TREE_VISITED (t
))
1027 walk_tree (tp
, mostly_copy_tree_r
, NULL
, NULL
);
1031 /* Otherwise, mark the tree as visited and keep looking. */
1033 TREE_VISITED (t
) = 1;
1039 unmark_visited_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
1040 void *data ATTRIBUTE_UNUSED
)
1042 if (TREE_VISITED (*tp
))
1043 TREE_VISITED (*tp
) = 0;
1050 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
1051 bodies of any nested functions if we are unsharing the entire body of
1055 unshare_body (tree
*body_p
, tree fndecl
)
1057 struct cgraph_node
*cgn
= cgraph_node (fndecl
);
1059 walk_tree (body_p
, copy_if_shared_r
, NULL
, NULL
);
1060 if (body_p
== &DECL_SAVED_TREE (fndecl
))
1061 for (cgn
= cgn
->nested
; cgn
; cgn
= cgn
->next_nested
)
1062 unshare_body (&DECL_SAVED_TREE (cgn
->decl
), cgn
->decl
);
1065 /* Likewise, but mark all trees as not visited. */
1068 unvisit_body (tree
*body_p
, tree fndecl
)
1070 struct cgraph_node
*cgn
= cgraph_node (fndecl
);
1072 walk_tree (body_p
, unmark_visited_r
, NULL
, NULL
);
1073 if (body_p
== &DECL_SAVED_TREE (fndecl
))
1074 for (cgn
= cgn
->nested
; cgn
; cgn
= cgn
->next_nested
)
1075 unvisit_body (&DECL_SAVED_TREE (cgn
->decl
), cgn
->decl
);
1078 /* Unconditionally make an unshared copy of EXPR. This is used when using
1079 stored expressions which span multiple functions, such as BINFO_VTABLE,
1080 as the normal unsharing process can't tell that they're shared. */
1083 unshare_expr (tree expr
)
1085 walk_tree (&expr
, mostly_copy_tree_r
, NULL
, NULL
);
1089 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
1090 contain statements and have a value. Assign its value to a temporary
1091 and give it void_type_node. Returns the temporary, or NULL_TREE if
1092 WRAPPER was already void. */
1095 voidify_wrapper_expr (tree wrapper
, tree temp
)
1097 tree type
= TREE_TYPE (wrapper
);
1098 if (type
&& !VOID_TYPE_P (type
))
1102 /* Set p to point to the body of the wrapper. Loop until we find
1103 something that isn't a wrapper. */
1104 for (p
= &wrapper
; p
&& *p
; )
1106 switch (TREE_CODE (*p
))
1109 TREE_SIDE_EFFECTS (*p
) = 1;
1110 TREE_TYPE (*p
) = void_type_node
;
1111 /* For a BIND_EXPR, the body is operand 1. */
1112 p
= &BIND_EXPR_BODY (*p
);
1115 case CLEANUP_POINT_EXPR
:
1116 case TRY_FINALLY_EXPR
:
1117 case TRY_CATCH_EXPR
:
1118 TREE_SIDE_EFFECTS (*p
) = 1;
1119 TREE_TYPE (*p
) = void_type_node
;
1120 p
= &TREE_OPERAND (*p
, 0);
1123 case STATEMENT_LIST
:
1125 tree_stmt_iterator i
= tsi_last (*p
);
1126 TREE_SIDE_EFFECTS (*p
) = 1;
1127 TREE_TYPE (*p
) = void_type_node
;
1128 p
= tsi_end_p (i
) ? NULL
: tsi_stmt_ptr (i
);
1133 /* Advance to the last statement. Set all container types to void. */
1134 for (; TREE_CODE (*p
) == COMPOUND_EXPR
; p
= &TREE_OPERAND (*p
, 1))
1136 TREE_SIDE_EFFECTS (*p
) = 1;
1137 TREE_TYPE (*p
) = void_type_node
;
1147 if (p
== NULL
|| IS_EMPTY_STMT (*p
))
1151 /* The wrapper is on the RHS of an assignment that we're pushing
1153 gcc_assert (TREE_CODE (temp
) == INIT_EXPR
1154 || TREE_CODE (temp
) == MODIFY_EXPR
);
1155 TREE_OPERAND (temp
, 1) = *p
;
1160 temp
= create_tmp_var (type
, "retval");
1161 *p
= build2 (INIT_EXPR
, type
, temp
, *p
);
1170 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
1171 a temporary through which they communicate. */
1174 build_stack_save_restore (gimple
*save
, gimple
*restore
)
1178 *save
= gimple_build_call (implicit_built_in_decls
[BUILT_IN_STACK_SAVE
], 0);
1179 tmp_var
= create_tmp_var (ptr_type_node
, "saved_stack");
1180 gimple_call_set_lhs (*save
, tmp_var
);
1182 *restore
= gimple_build_call (implicit_built_in_decls
[BUILT_IN_STACK_RESTORE
],
1186 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
1188 static enum gimplify_status
1189 gimplify_bind_expr (tree
*expr_p
, gimple_seq
*pre_p
)
1191 tree bind_expr
= *expr_p
;
1192 bool old_save_stack
= gimplify_ctxp
->save_stack
;
1197 tree temp
= voidify_wrapper_expr (bind_expr
, NULL
);
1199 /* Mark variables seen in this bind expr. */
1200 for (t
= BIND_EXPR_VARS (bind_expr
); t
; t
= TREE_CHAIN (t
))
1202 if (TREE_CODE (t
) == VAR_DECL
)
1204 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
1206 /* Mark variable as local. */
1207 if (ctx
&& !is_global_var (t
)
1208 && (! DECL_SEEN_IN_BIND_EXPR_P (t
)
1209 || splay_tree_lookup (ctx
->variables
,
1210 (splay_tree_key
) t
) == NULL
))
1211 omp_add_variable (gimplify_omp_ctxp
, t
, GOVD_LOCAL
| GOVD_SEEN
);
1213 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
1215 if (DECL_HARD_REGISTER (t
) && !is_global_var (t
) && cfun
)
1216 cfun
->has_local_explicit_reg_vars
= true;
1219 /* Preliminarily mark non-addressed complex variables as eligible
1220 for promotion to gimple registers. We'll transform their uses
1222 if ((TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
1223 || TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
1224 && !TREE_THIS_VOLATILE (t
)
1225 && (TREE_CODE (t
) == VAR_DECL
&& !DECL_HARD_REGISTER (t
))
1226 && !needs_to_live_in_memory (t
))
1227 DECL_GIMPLE_REG_P (t
) = 1;
1230 gimple_bind
= gimple_build_bind (BIND_EXPR_VARS (bind_expr
), NULL
,
1231 BIND_EXPR_BLOCK (bind_expr
));
1232 gimple_push_bind_expr (gimple_bind
);
1234 gimplify_ctxp
->save_stack
= false;
1236 /* Gimplify the body into the GIMPLE_BIND tuple's body. */
1238 gimplify_stmt (&BIND_EXPR_BODY (bind_expr
), &body
);
1239 gimple_bind_set_body (gimple_bind
, body
);
1241 if (gimplify_ctxp
->save_stack
)
1243 gimple stack_save
, stack_restore
, gs
;
1244 gimple_seq cleanup
, new_body
;
1246 /* Save stack on entry and restore it on exit. Add a try_finally
1247 block to achieve this. Note that mudflap depends on the
1248 format of the emitted code: see mx_register_decls(). */
1249 build_stack_save_restore (&stack_save
, &stack_restore
);
1251 cleanup
= new_body
= NULL
;
1252 gimplify_seq_add_stmt (&cleanup
, stack_restore
);
1253 gs
= gimple_build_try (gimple_bind_body (gimple_bind
), cleanup
,
1254 GIMPLE_TRY_FINALLY
);
1256 gimplify_seq_add_stmt (&new_body
, stack_save
);
1257 gimplify_seq_add_stmt (&new_body
, gs
);
1258 gimple_bind_set_body (gimple_bind
, new_body
);
1261 gimplify_ctxp
->save_stack
= old_save_stack
;
1262 gimple_pop_bind_expr ();
1264 gimplify_seq_add_stmt (pre_p
, gimple_bind
);
1272 *expr_p
= NULL_TREE
;
1276 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1277 GIMPLE value, it is assigned to a new temporary and the statement is
1278 re-written to return the temporary.
1280 PRE_P points to the sequence where side effects that must happen before
1281 STMT should be stored. */
1283 static enum gimplify_status
1284 gimplify_return_expr (tree stmt
, gimple_seq
*pre_p
)
1287 tree ret_expr
= TREE_OPERAND (stmt
, 0);
1288 tree result_decl
, result
;
1290 if (ret_expr
== error_mark_node
)
1294 || TREE_CODE (ret_expr
) == RESULT_DECL
1295 || ret_expr
== error_mark_node
)
1297 gimple ret
= gimple_build_return (ret_expr
);
1298 gimple_set_no_warning (ret
, TREE_NO_WARNING (stmt
));
1299 gimplify_seq_add_stmt (pre_p
, ret
);
1303 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
1304 result_decl
= NULL_TREE
;
1307 result_decl
= TREE_OPERAND (ret_expr
, 0);
1309 /* See through a return by reference. */
1310 if (TREE_CODE (result_decl
) == INDIRECT_REF
)
1311 result_decl
= TREE_OPERAND (result_decl
, 0);
1313 gcc_assert ((TREE_CODE (ret_expr
) == MODIFY_EXPR
1314 || TREE_CODE (ret_expr
) == INIT_EXPR
)
1315 && TREE_CODE (result_decl
) == RESULT_DECL
);
1318 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1319 Recall that aggregate_value_p is FALSE for any aggregate type that is
1320 returned in registers. If we're returning values in registers, then
1321 we don't want to extend the lifetime of the RESULT_DECL, particularly
1322 across another call. In addition, for those aggregates for which
1323 hard_function_value generates a PARALLEL, we'll die during normal
1324 expansion of structure assignments; there's special code in expand_return
1325 to handle this case that does not exist in expand_expr. */
1327 || aggregate_value_p (result_decl
, TREE_TYPE (current_function_decl
)))
1328 result
= result_decl
;
1329 else if (gimplify_ctxp
->return_temp
)
1330 result
= gimplify_ctxp
->return_temp
;
1333 result
= create_tmp_var (TREE_TYPE (result_decl
), NULL
);
1334 if (TREE_CODE (TREE_TYPE (result
)) == COMPLEX_TYPE
1335 || TREE_CODE (TREE_TYPE (result
)) == VECTOR_TYPE
)
1336 DECL_GIMPLE_REG_P (result
) = 1;
1338 /* ??? With complex control flow (usually involving abnormal edges),
1339 we can wind up warning about an uninitialized value for this. Due
1340 to how this variable is constructed and initialized, this is never
1341 true. Give up and never warn. */
1342 TREE_NO_WARNING (result
) = 1;
1344 gimplify_ctxp
->return_temp
= result
;
1347 /* Smash the lhs of the MODIFY_EXPR to the temporary we plan to use.
1348 Then gimplify the whole thing. */
1349 if (result
!= result_decl
)
1350 TREE_OPERAND (ret_expr
, 0) = result
;
1352 gimplify_and_add (TREE_OPERAND (stmt
, 0), pre_p
);
1354 ret
= gimple_build_return (result
);
1355 gimple_set_no_warning (ret
, TREE_NO_WARNING (stmt
));
1356 gimplify_seq_add_stmt (pre_p
, ret
);
1362 gimplify_vla_decl (tree decl
, gimple_seq
*seq_p
)
1364 /* This is a variable-sized decl. Simplify its size and mark it
1365 for deferred expansion. Note that mudflap depends on the format
1366 of the emitted code: see mx_register_decls(). */
1367 tree t
, addr
, ptr_type
;
1369 gimplify_one_sizepos (&DECL_SIZE (decl
), seq_p
);
1370 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl
), seq_p
);
1372 /* All occurrences of this decl in final gimplified code will be
1373 replaced by indirection. Setting DECL_VALUE_EXPR does two
1374 things: First, it lets the rest of the gimplifier know what
1375 replacement to use. Second, it lets the debug info know
1376 where to find the value. */
1377 ptr_type
= build_pointer_type (TREE_TYPE (decl
));
1378 addr
= create_tmp_var (ptr_type
, get_name (decl
));
1379 DECL_IGNORED_P (addr
) = 0;
1380 t
= build_fold_indirect_ref (addr
);
1381 SET_DECL_VALUE_EXPR (decl
, t
);
1382 DECL_HAS_VALUE_EXPR_P (decl
) = 1;
1384 t
= built_in_decls
[BUILT_IN_ALLOCA
];
1385 t
= build_call_expr (t
, 1, DECL_SIZE_UNIT (decl
));
1386 t
= fold_convert (ptr_type
, t
);
1387 t
= build2 (MODIFY_EXPR
, TREE_TYPE (addr
), addr
, t
);
1389 gimplify_and_add (t
, seq_p
);
1391 /* Indicate that we need to restore the stack level when the
1392 enclosing BIND_EXPR is exited. */
1393 gimplify_ctxp
->save_stack
= true;
1397 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
1398 and initialization explicit. */
1400 static enum gimplify_status
1401 gimplify_decl_expr (tree
*stmt_p
, gimple_seq
*seq_p
)
1403 tree stmt
= *stmt_p
;
1404 tree decl
= DECL_EXPR_DECL (stmt
);
1406 *stmt_p
= NULL_TREE
;
1408 if (TREE_TYPE (decl
) == error_mark_node
)
1411 if ((TREE_CODE (decl
) == TYPE_DECL
1412 || TREE_CODE (decl
) == VAR_DECL
)
1413 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl
)))
1414 gimplify_type_sizes (TREE_TYPE (decl
), seq_p
);
1416 if (TREE_CODE (decl
) == VAR_DECL
&& !DECL_EXTERNAL (decl
))
1418 tree init
= DECL_INITIAL (decl
);
1420 if (TREE_CODE (DECL_SIZE_UNIT (decl
)) != INTEGER_CST
1421 || (!TREE_STATIC (decl
)
1422 && flag_stack_check
== GENERIC_STACK_CHECK
1423 && compare_tree_int (DECL_SIZE_UNIT (decl
),
1424 STACK_CHECK_MAX_VAR_SIZE
) > 0))
1425 gimplify_vla_decl (decl
, seq_p
);
1427 if (init
&& init
!= error_mark_node
)
1429 if (!TREE_STATIC (decl
))
1431 DECL_INITIAL (decl
) = NULL_TREE
;
1432 init
= build2 (INIT_EXPR
, void_type_node
, decl
, init
);
1433 gimplify_and_add (init
, seq_p
);
1437 /* We must still examine initializers for static variables
1438 as they may contain a label address. */
1439 walk_tree (&init
, force_labels_r
, NULL
, NULL
);
1442 /* Some front ends do not explicitly declare all anonymous
1443 artificial variables. We compensate here by declaring the
1444 variables, though it would be better if the front ends would
1445 explicitly declare them. */
1446 if (!DECL_SEEN_IN_BIND_EXPR_P (decl
)
1447 && DECL_ARTIFICIAL (decl
) && DECL_NAME (decl
) == NULL_TREE
)
1448 gimple_add_tmp_var (decl
);
1454 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1455 and replacing the LOOP_EXPR with goto, but if the loop contains an
1456 EXIT_EXPR, we need to append a label for it to jump to. */
1458 static enum gimplify_status
1459 gimplify_loop_expr (tree
*expr_p
, gimple_seq
*pre_p
)
1461 tree saved_label
= gimplify_ctxp
->exit_label
;
1462 tree start_label
= create_artificial_label ();
1464 gimplify_seq_add_stmt (pre_p
, gimple_build_label (start_label
));
1466 gimplify_ctxp
->exit_label
= NULL_TREE
;
1468 gimplify_and_add (LOOP_EXPR_BODY (*expr_p
), pre_p
);
1470 gimplify_seq_add_stmt (pre_p
, gimple_build_goto (start_label
));
1472 if (gimplify_ctxp
->exit_label
)
1473 gimplify_seq_add_stmt (pre_p
, gimple_build_label (gimplify_ctxp
->exit_label
));
1475 gimplify_ctxp
->exit_label
= saved_label
;
1481 /* Gimplifies a statement list onto a sequence. These may be created either
1482 by an enlightened front-end, or by shortcut_cond_expr. */
1484 static enum gimplify_status
1485 gimplify_statement_list (tree
*expr_p
, gimple_seq
*pre_p
)
1487 tree temp
= voidify_wrapper_expr (*expr_p
, NULL
);
1489 tree_stmt_iterator i
= tsi_start (*expr_p
);
1491 while (!tsi_end_p (i
))
1493 gimplify_stmt (tsi_stmt_ptr (i
), pre_p
);
1506 /* Compare two case labels. Because the front end should already have
1507 made sure that case ranges do not overlap, it is enough to only compare
1508 the CASE_LOW values of each case label. */
1511 compare_case_labels (const void *p1
, const void *p2
)
1513 const_tree
const case1
= *(const_tree
const*)p1
;
1514 const_tree
const case2
= *(const_tree
const*)p2
;
1516 /* The 'default' case label always goes first. */
1517 if (!CASE_LOW (case1
))
1519 else if (!CASE_LOW (case2
))
1522 return tree_int_cst_compare (CASE_LOW (case1
), CASE_LOW (case2
));
1526 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1529 sort_case_labels (VEC(tree
,heap
)* label_vec
)
1531 size_t len
= VEC_length (tree
, label_vec
);
1532 qsort (VEC_address (tree
, label_vec
), len
, sizeof (tree
),
1533 compare_case_labels
);
1537 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1540 static enum gimplify_status
1541 gimplify_switch_expr (tree
*expr_p
, gimple_seq
*pre_p
)
1543 tree switch_expr
= *expr_p
;
1544 gimple_seq switch_body_seq
= NULL
;
1545 enum gimplify_status ret
;
1547 ret
= gimplify_expr (&SWITCH_COND (switch_expr
), pre_p
, NULL
, is_gimple_val
,
1549 if (ret
== GS_ERROR
|| ret
== GS_UNHANDLED
)
1552 if (SWITCH_BODY (switch_expr
))
1554 VEC (tree
,heap
) *labels
;
1555 VEC (tree
,heap
) *saved_labels
;
1556 tree default_case
= NULL_TREE
;
1558 gimple gimple_switch
;
1560 /* If someone can be bothered to fill in the labels, they can
1561 be bothered to null out the body too. */
1562 gcc_assert (!SWITCH_LABELS (switch_expr
));
1564 /* save old labels, get new ones from body, then restore the old
1565 labels. Save all the things from the switch body to append after. */
1566 saved_labels
= gimplify_ctxp
->case_labels
;
1567 gimplify_ctxp
->case_labels
= VEC_alloc (tree
, heap
, 8);
1569 gimplify_stmt (&SWITCH_BODY (switch_expr
), &switch_body_seq
);
1570 labels
= gimplify_ctxp
->case_labels
;
1571 gimplify_ctxp
->case_labels
= saved_labels
;
1574 while (i
< VEC_length (tree
, labels
))
1576 tree elt
= VEC_index (tree
, labels
, i
);
1577 tree low
= CASE_LOW (elt
);
1578 bool remove_element
= FALSE
;
1582 /* Discard empty ranges. */
1583 tree high
= CASE_HIGH (elt
);
1584 if (high
&& tree_int_cst_lt (high
, low
))
1585 remove_element
= TRUE
;
1589 /* The default case must be the last label in the list. */
1590 gcc_assert (!default_case
);
1592 remove_element
= TRUE
;
1596 VEC_ordered_remove (tree
, labels
, i
);
1606 /* If the switch has no default label, add one, so that we jump
1607 around the switch body. */
1608 default_case
= build3 (CASE_LABEL_EXPR
, void_type_node
, NULL_TREE
,
1609 NULL_TREE
, create_artificial_label ());
1610 new_default
= gimple_build_label (CASE_LABEL (default_case
));
1611 gimplify_seq_add_stmt (&switch_body_seq
, new_default
);
1614 if (!VEC_empty (tree
, labels
))
1615 sort_case_labels (labels
);
1617 gimple_switch
= gimple_build_switch_vec (SWITCH_COND (switch_expr
),
1618 default_case
, labels
);
1619 gimplify_seq_add_stmt (pre_p
, gimple_switch
);
1620 gimplify_seq_add_seq (pre_p
, switch_body_seq
);
1621 VEC_free(tree
, heap
, labels
);
1624 gcc_assert (SWITCH_LABELS (switch_expr
));
1630 static enum gimplify_status
1631 gimplify_case_label_expr (tree
*expr_p
, gimple_seq
*pre_p
)
1633 struct gimplify_ctx
*ctxp
;
1634 gimple gimple_label
;
1636 /* Invalid OpenMP programs can play Duff's Device type games with
1637 #pragma omp parallel. At least in the C front end, we don't
1638 detect such invalid branches until after gimplification. */
1639 for (ctxp
= gimplify_ctxp
; ; ctxp
= ctxp
->prev_context
)
1640 if (ctxp
->case_labels
)
1643 gimple_label
= gimple_build_label (CASE_LABEL (*expr_p
));
1644 VEC_safe_push (tree
, heap
, ctxp
->case_labels
, *expr_p
);
1645 gimplify_seq_add_stmt (pre_p
, gimple_label
);
1650 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1654 build_and_jump (tree
*label_p
)
1656 if (label_p
== NULL
)
1657 /* If there's nowhere to jump, just fall through. */
1660 if (*label_p
== NULL_TREE
)
1662 tree label
= create_artificial_label ();
1666 return build1 (GOTO_EXPR
, void_type_node
, *label_p
);
1669 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1670 This also involves building a label to jump to and communicating it to
1671 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1673 static enum gimplify_status
1674 gimplify_exit_expr (tree
*expr_p
)
1676 tree cond
= TREE_OPERAND (*expr_p
, 0);
1679 expr
= build_and_jump (&gimplify_ctxp
->exit_label
);
1680 expr
= build3 (COND_EXPR
, void_type_node
, cond
, expr
, NULL_TREE
);
1686 /* A helper function to be called via walk_tree. Mark all labels under *TP
1687 as being forced. To be called for DECL_INITIAL of static variables. */
1690 force_labels_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
1694 if (TREE_CODE (*tp
) == LABEL_DECL
)
1695 FORCED_LABEL (*tp
) = 1;
1700 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1701 different from its canonical type, wrap the whole thing inside a
1702 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1705 The canonical type of a COMPONENT_REF is the type of the field being
1706 referenced--unless the field is a bit-field which can be read directly
1707 in a smaller mode, in which case the canonical type is the
1708 sign-appropriate type corresponding to that mode. */
1711 canonicalize_component_ref (tree
*expr_p
)
1713 tree expr
= *expr_p
;
1716 gcc_assert (TREE_CODE (expr
) == COMPONENT_REF
);
1718 if (INTEGRAL_TYPE_P (TREE_TYPE (expr
)))
1719 type
= TREE_TYPE (get_unwidened (expr
, NULL_TREE
));
1721 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
1723 /* One could argue that all the stuff below is not necessary for
1724 the non-bitfield case and declare it a FE error if type
1725 adjustment would be needed. */
1726 if (TREE_TYPE (expr
) != type
)
1728 #ifdef ENABLE_TYPES_CHECKING
1729 tree old_type
= TREE_TYPE (expr
);
1733 /* We need to preserve qualifiers and propagate them from
1735 type_quals
= TYPE_QUALS (type
)
1736 | TYPE_QUALS (TREE_TYPE (TREE_OPERAND (expr
, 0)));
1737 if (TYPE_QUALS (type
) != type_quals
)
1738 type
= build_qualified_type (TYPE_MAIN_VARIANT (type
), type_quals
);
1740 /* Set the type of the COMPONENT_REF to the underlying type. */
1741 TREE_TYPE (expr
) = type
;
1743 #ifdef ENABLE_TYPES_CHECKING
1744 /* It is now a FE error, if the conversion from the canonical
1745 type to the original expression type is not useless. */
1746 gcc_assert (useless_type_conversion_p (old_type
, type
));
1751 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1752 to foo, embed that change in the ADDR_EXPR by converting
1757 where L is the lower bound. For simplicity, only do this for constant
1759 The constraint is that the type of &array[L] is trivially convertible
1763 canonicalize_addr_expr (tree
*expr_p
)
1765 tree expr
= *expr_p
;
1766 tree addr_expr
= TREE_OPERAND (expr
, 0);
1767 tree datype
, ddatype
, pddatype
;
1769 /* We simplify only conversions from an ADDR_EXPR to a pointer type. */
1770 if (!POINTER_TYPE_P (TREE_TYPE (expr
))
1771 || TREE_CODE (addr_expr
) != ADDR_EXPR
)
1774 /* The addr_expr type should be a pointer to an array. */
1775 datype
= TREE_TYPE (TREE_TYPE (addr_expr
));
1776 if (TREE_CODE (datype
) != ARRAY_TYPE
)
1779 /* The pointer to element type shall be trivially convertible to
1780 the expression pointer type. */
1781 ddatype
= TREE_TYPE (datype
);
1782 pddatype
= build_pointer_type (ddatype
);
1783 if (!useless_type_conversion_p (pddatype
, ddatype
))
1786 /* The lower bound and element sizes must be constant. */
1787 if (!TYPE_SIZE_UNIT (ddatype
)
1788 || TREE_CODE (TYPE_SIZE_UNIT (ddatype
)) != INTEGER_CST
1789 || !TYPE_DOMAIN (datype
) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))
1790 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))) != INTEGER_CST
)
1793 /* All checks succeeded. Build a new node to merge the cast. */
1794 *expr_p
= build4 (ARRAY_REF
, ddatype
, TREE_OPERAND (addr_expr
, 0),
1795 TYPE_MIN_VALUE (TYPE_DOMAIN (datype
)),
1796 NULL_TREE
, NULL_TREE
);
1797 *expr_p
= build1 (ADDR_EXPR
, pddatype
, *expr_p
);
1800 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1801 underneath as appropriate. */
1803 static enum gimplify_status
1804 gimplify_conversion (tree
*expr_p
)
1807 gcc_assert (CONVERT_EXPR_P (*expr_p
));
1809 /* Then strip away all but the outermost conversion. */
1810 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p
, 0));
1812 /* And remove the outermost conversion if it's useless. */
1813 if (tree_ssa_useless_type_conversion (*expr_p
))
1814 *expr_p
= TREE_OPERAND (*expr_p
, 0);
1816 /* Attempt to avoid NOP_EXPR by producing reference to a subtype.
1817 For example this fold (subclass *)&A into &A->subclass avoiding
1818 a need for statement. */
1819 if (CONVERT_EXPR_P (*expr_p
)
1820 && POINTER_TYPE_P (TREE_TYPE (*expr_p
))
1821 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p
, 0)))
1822 && (tem
= maybe_fold_offset_to_address
1823 (TREE_OPERAND (*expr_p
, 0),
1824 integer_zero_node
, TREE_TYPE (*expr_p
))) != NULL_TREE
)
1827 /* If we still have a conversion at the toplevel,
1828 then canonicalize some constructs. */
1829 if (CONVERT_EXPR_P (*expr_p
))
1831 tree sub
= TREE_OPERAND (*expr_p
, 0);
1833 /* If a NOP conversion is changing the type of a COMPONENT_REF
1834 expression, then canonicalize its type now in order to expose more
1835 redundant conversions. */
1836 if (TREE_CODE (sub
) == COMPONENT_REF
)
1837 canonicalize_component_ref (&TREE_OPERAND (*expr_p
, 0));
1839 /* If a NOP conversion is changing a pointer to array of foo
1840 to a pointer to foo, embed that change in the ADDR_EXPR. */
1841 else if (TREE_CODE (sub
) == ADDR_EXPR
)
1842 canonicalize_addr_expr (expr_p
);
1845 /* If we have a conversion to a non-register type force the
1846 use of a VIEW_CONVERT_EXPR instead. */
1847 if (!is_gimple_reg_type (TREE_TYPE (*expr_p
)))
1848 *expr_p
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (*expr_p
),
1849 TREE_OPERAND (*expr_p
, 0));
1854 /* Gimplify a VAR_DECL or PARM_DECL. Returns GS_OK if we expanded a
1855 DECL_VALUE_EXPR, and it's worth re-examining things. */
1857 static enum gimplify_status
1858 gimplify_var_or_parm_decl (tree
*expr_p
)
1860 tree decl
= *expr_p
;
1862 /* ??? If this is a local variable, and it has not been seen in any
1863 outer BIND_EXPR, then it's probably the result of a duplicate
1864 declaration, for which we've already issued an error. It would
1865 be really nice if the front end wouldn't leak these at all.
1866 Currently the only known culprit is C++ destructors, as seen
1867 in g++.old-deja/g++.jason/binding.C. */
1868 if (TREE_CODE (decl
) == VAR_DECL
1869 && !DECL_SEEN_IN_BIND_EXPR_P (decl
)
1870 && !TREE_STATIC (decl
) && !DECL_EXTERNAL (decl
)
1871 && decl_function_context (decl
) == current_function_decl
)
1873 gcc_assert (errorcount
|| sorrycount
);
1877 /* When within an OpenMP context, notice uses of variables. */
1878 if (gimplify_omp_ctxp
&& omp_notice_variable (gimplify_omp_ctxp
, decl
, true))
1881 /* If the decl is an alias for another expression, substitute it now. */
1882 if (DECL_HAS_VALUE_EXPR_P (decl
))
1884 *expr_p
= unshare_expr (DECL_VALUE_EXPR (decl
));
1892 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1896 : min_lval '[' val ']'
1898 | compound_lval '[' val ']'
1899 | compound_lval '.' ID
1901 This is not part of the original SIMPLE definition, which separates
1902 array and member references, but it seems reasonable to handle them
1903 together. Also, this way we don't run into problems with union
1904 aliasing; gcc requires that for accesses through a union to alias, the
1905 union reference must be explicit, which was not always the case when we
1906 were splitting up array and member refs.
1908 PRE_P points to the sequence where side effects that must happen before
1909 *EXPR_P should be stored.
1911 POST_P points to the sequence where side effects that must happen after
1912 *EXPR_P should be stored. */
1914 static enum gimplify_status
1915 gimplify_compound_lval (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
1916 fallback_t fallback
)
1919 VEC(tree
,heap
) *stack
;
1920 enum gimplify_status ret
= GS_OK
, tret
;
1923 /* Create a stack of the subexpressions so later we can walk them in
1924 order from inner to outer. */
1925 stack
= VEC_alloc (tree
, heap
, 10);
1927 /* We can handle anything that get_inner_reference can deal with. */
1928 for (p
= expr_p
; ; p
= &TREE_OPERAND (*p
, 0))
1931 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1932 if (TREE_CODE (*p
) == INDIRECT_REF
)
1933 *p
= fold_indirect_ref (*p
);
1935 if (handled_component_p (*p
))
1937 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
1938 additional COMPONENT_REFs. */
1939 else if ((TREE_CODE (*p
) == VAR_DECL
|| TREE_CODE (*p
) == PARM_DECL
)
1940 && gimplify_var_or_parm_decl (p
) == GS_OK
)
1945 VEC_safe_push (tree
, heap
, stack
, *p
);
1948 gcc_assert (VEC_length (tree
, stack
));
1950 /* Now STACK is a stack of pointers to all the refs we've walked through
1951 and P points to the innermost expression.
1953 Java requires that we elaborated nodes in source order. That
1954 means we must gimplify the inner expression followed by each of
1955 the indices, in order. But we can't gimplify the inner
1956 expression until we deal with any variable bounds, sizes, or
1957 positions in order to deal with PLACEHOLDER_EXPRs.
1959 So we do this in three steps. First we deal with the annotations
1960 for any variables in the components, then we gimplify the base,
1961 then we gimplify any indices, from left to right. */
1962 for (i
= VEC_length (tree
, stack
) - 1; i
>= 0; i
--)
1964 tree t
= VEC_index (tree
, stack
, i
);
1966 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
1968 /* Gimplify the low bound and element type size and put them into
1969 the ARRAY_REF. If these values are set, they have already been
1971 if (TREE_OPERAND (t
, 2) == NULL_TREE
)
1973 tree low
= unshare_expr (array_ref_low_bound (t
));
1974 if (!is_gimple_min_invariant (low
))
1976 TREE_OPERAND (t
, 2) = low
;
1977 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
,
1978 post_p
, is_gimple_reg
,
1980 ret
= MIN (ret
, tret
);
1984 if (!TREE_OPERAND (t
, 3))
1986 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (t
, 0)));
1987 tree elmt_size
= unshare_expr (array_ref_element_size (t
));
1988 tree factor
= size_int (TYPE_ALIGN_UNIT (elmt_type
));
1990 /* Divide the element size by the alignment of the element
1992 elmt_size
= size_binop (EXACT_DIV_EXPR
, elmt_size
, factor
);
1994 if (!is_gimple_min_invariant (elmt_size
))
1996 TREE_OPERAND (t
, 3) = elmt_size
;
1997 tret
= gimplify_expr (&TREE_OPERAND (t
, 3), pre_p
,
1998 post_p
, is_gimple_reg
,
2000 ret
= MIN (ret
, tret
);
2004 else if (TREE_CODE (t
) == COMPONENT_REF
)
2006 /* Set the field offset into T and gimplify it. */
2007 if (!TREE_OPERAND (t
, 2))
2009 tree offset
= unshare_expr (component_ref_field_offset (t
));
2010 tree field
= TREE_OPERAND (t
, 1);
2012 = size_int (DECL_OFFSET_ALIGN (field
) / BITS_PER_UNIT
);
2014 /* Divide the offset by its alignment. */
2015 offset
= size_binop (EXACT_DIV_EXPR
, offset
, factor
);
2017 if (!is_gimple_min_invariant (offset
))
2019 TREE_OPERAND (t
, 2) = offset
;
2020 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
,
2021 post_p
, is_gimple_reg
,
2023 ret
= MIN (ret
, tret
);
2029 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
2030 so as to match the min_lval predicate. Failure to do so may result
2031 in the creation of large aggregate temporaries. */
2032 tret
= gimplify_expr (p
, pre_p
, post_p
, is_gimple_min_lval
,
2033 fallback
| fb_lvalue
);
2034 ret
= MIN (ret
, tret
);
2036 /* And finally, the indices and operands to BIT_FIELD_REF. During this
2037 loop we also remove any useless conversions. */
2038 for (; VEC_length (tree
, stack
) > 0; )
2040 tree t
= VEC_pop (tree
, stack
);
2042 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
2044 /* Gimplify the dimension. */
2045 if (!is_gimple_min_invariant (TREE_OPERAND (t
, 1)))
2047 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), pre_p
, post_p
,
2048 is_gimple_val
, fb_rvalue
);
2049 ret
= MIN (ret
, tret
);
2052 else if (TREE_CODE (t
) == BIT_FIELD_REF
)
2054 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), pre_p
, post_p
,
2055 is_gimple_val
, fb_rvalue
);
2056 ret
= MIN (ret
, tret
);
2057 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
2058 is_gimple_val
, fb_rvalue
);
2059 ret
= MIN (ret
, tret
);
2062 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t
, 0));
2064 /* The innermost expression P may have originally had
2065 TREE_SIDE_EFFECTS set which would have caused all the outer
2066 expressions in *EXPR_P leading to P to also have had
2067 TREE_SIDE_EFFECTS set. */
2068 recalculate_side_effects (t
);
2071 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
2072 if ((fallback
& fb_rvalue
) && TREE_CODE (*expr_p
) == COMPONENT_REF
)
2074 canonicalize_component_ref (expr_p
);
2075 ret
= MIN (ret
, GS_OK
);
2078 VEC_free (tree
, heap
, stack
);
2083 /* Gimplify the self modifying expression pointed to by EXPR_P
2086 PRE_P points to the list where side effects that must happen before
2087 *EXPR_P should be stored.
2089 POST_P points to the list where side effects that must happen after
2090 *EXPR_P should be stored.
2092 WANT_VALUE is nonzero iff we want to use the value of this expression
2093 in another expression. */
2095 static enum gimplify_status
2096 gimplify_self_mod_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
2099 enum tree_code code
;
2100 tree lhs
, lvalue
, rhs
, t1
;
2101 gimple_seq post
= NULL
, *orig_post_p
= post_p
;
2103 enum tree_code arith_code
;
2104 enum gimplify_status ret
;
2106 code
= TREE_CODE (*expr_p
);
2108 gcc_assert (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
2109 || code
== PREINCREMENT_EXPR
|| code
== PREDECREMENT_EXPR
);
2111 /* Prefix or postfix? */
2112 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
2113 /* Faster to treat as prefix if result is not used. */
2114 postfix
= want_value
;
2118 /* For postfix, make sure the inner expression's post side effects
2119 are executed after side effects from this expression. */
2123 /* Add or subtract? */
2124 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
2125 arith_code
= PLUS_EXPR
;
2127 arith_code
= MINUS_EXPR
;
2129 /* Gimplify the LHS into a GIMPLE lvalue. */
2130 lvalue
= TREE_OPERAND (*expr_p
, 0);
2131 ret
= gimplify_expr (&lvalue
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
2132 if (ret
== GS_ERROR
)
2135 /* Extract the operands to the arithmetic operation. */
2137 rhs
= TREE_OPERAND (*expr_p
, 1);
2139 /* For postfix operator, we evaluate the LHS to an rvalue and then use
2140 that as the result value and in the postqueue operation. We also
2141 make sure to make lvalue a minimal lval, see
2142 gcc.c-torture/execute/20040313-1.c for an example where this matters. */
2145 if (!is_gimple_min_lval (lvalue
))
2147 mark_addressable (lvalue
);
2148 lvalue
= build_fold_addr_expr (lvalue
);
2149 gimplify_expr (&lvalue
, pre_p
, post_p
, is_gimple_val
, fb_rvalue
);
2150 lvalue
= build_fold_indirect_ref (lvalue
);
2152 ret
= gimplify_expr (&lhs
, pre_p
, post_p
, is_gimple_val
, fb_rvalue
);
2153 if (ret
== GS_ERROR
)
2157 /* For POINTERs increment, use POINTER_PLUS_EXPR. */
2158 if (POINTER_TYPE_P (TREE_TYPE (lhs
)))
2160 rhs
= fold_convert (sizetype
, rhs
);
2161 if (arith_code
== MINUS_EXPR
)
2162 rhs
= fold_build1 (NEGATE_EXPR
, TREE_TYPE (rhs
), rhs
);
2163 arith_code
= POINTER_PLUS_EXPR
;
2166 t1
= build2 (arith_code
, TREE_TYPE (*expr_p
), lhs
, rhs
);
2170 gimplify_assign (lvalue
, t1
, orig_post_p
);
2171 gimplify_seq_add_seq (orig_post_p
, post
);
2177 *expr_p
= build2 (MODIFY_EXPR
, TREE_TYPE (lvalue
), lvalue
, t1
);
2183 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
2186 maybe_with_size_expr (tree
*expr_p
)
2188 tree expr
= *expr_p
;
2189 tree type
= TREE_TYPE (expr
);
2192 /* If we've already wrapped this or the type is error_mark_node, we can't do
2194 if (TREE_CODE (expr
) == WITH_SIZE_EXPR
2195 || type
== error_mark_node
)
2198 /* If the size isn't known or is a constant, we have nothing to do. */
2199 size
= TYPE_SIZE_UNIT (type
);
2200 if (!size
|| TREE_CODE (size
) == INTEGER_CST
)
2203 /* Otherwise, make a WITH_SIZE_EXPR. */
2204 size
= unshare_expr (size
);
2205 size
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (size
, expr
);
2206 *expr_p
= build2 (WITH_SIZE_EXPR
, type
, expr
, size
);
2210 /* Helper for gimplify_call_expr. Gimplify a single argument *ARG_P
2211 Store any side-effects in PRE_P. CALL_LOCATION is the location of
2214 static enum gimplify_status
2215 gimplify_arg (tree
*arg_p
, gimple_seq
*pre_p
, location_t call_location
)
2217 bool (*test
) (tree
);
2220 /* In general, we allow lvalues for function arguments to avoid
2221 extra overhead of copying large aggregates out of even larger
2222 aggregates into temporaries only to copy the temporaries to
2223 the argument list. Make optimizers happy by pulling out to
2224 temporaries those types that fit in registers. */
2225 if (is_gimple_reg_type (TREE_TYPE (*arg_p
)))
2226 test
= is_gimple_val
, fb
= fb_rvalue
;
2228 test
= is_gimple_lvalue
, fb
= fb_either
;
2230 /* If this is a variable sized type, we must remember the size. */
2231 maybe_with_size_expr (arg_p
);
2233 /* Make sure arguments have the same location as the function call
2235 protected_set_expr_location (*arg_p
, call_location
);
2237 /* There is a sequence point before a function call. Side effects in
2238 the argument list must occur before the actual call. So, when
2239 gimplifying arguments, force gimplify_expr to use an internal
2240 post queue which is then appended to the end of PRE_P. */
2241 return gimplify_expr (arg_p
, pre_p
, NULL
, test
, fb
);
2245 /* Gimplify the CALL_EXPR node *EXPR_P into the GIMPLE sequence PRE_P.
2246 WANT_VALUE is true if the result of the call is desired. */
2248 static enum gimplify_status
2249 gimplify_call_expr (tree
*expr_p
, gimple_seq
*pre_p
, bool want_value
)
2251 tree fndecl
, parms
, p
;
2252 enum gimplify_status ret
;
2255 bool builtin_va_start_p
= FALSE
;
2257 gcc_assert (TREE_CODE (*expr_p
) == CALL_EXPR
);
2259 /* For reliable diagnostics during inlining, it is necessary that
2260 every call_expr be annotated with file and line. */
2261 if (! EXPR_HAS_LOCATION (*expr_p
))
2262 SET_EXPR_LOCATION (*expr_p
, input_location
);
2264 /* This may be a call to a builtin function.
2266 Builtin function calls may be transformed into different
2267 (and more efficient) builtin function calls under certain
2268 circumstances. Unfortunately, gimplification can muck things
2269 up enough that the builtin expanders are not aware that certain
2270 transformations are still valid.
2272 So we attempt transformation/gimplification of the call before
2273 we gimplify the CALL_EXPR. At this time we do not manage to
2274 transform all calls in the same manner as the expanders do, but
2275 we do transform most of them. */
2276 fndecl
= get_callee_fndecl (*expr_p
);
2277 if (fndecl
&& DECL_BUILT_IN (fndecl
))
2279 tree new_tree
= fold_call_expr (*expr_p
, !want_value
);
2281 if (new_tree
&& new_tree
!= *expr_p
)
2283 /* There was a transformation of this call which computes the
2284 same value, but in a more efficient way. Return and try
2290 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
2291 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_VA_START
)
2293 builtin_va_start_p
= TRUE
;
2294 if (call_expr_nargs (*expr_p
) < 2)
2296 error ("too few arguments to function %<va_start%>");
2297 *expr_p
= build_empty_stmt ();
2301 if (fold_builtin_next_arg (*expr_p
, true))
2303 *expr_p
= build_empty_stmt ();
2309 /* There is a sequence point before the call, so any side effects in
2310 the calling expression must occur before the actual call. Force
2311 gimplify_expr to use an internal post queue. */
2312 ret
= gimplify_expr (&CALL_EXPR_FN (*expr_p
), pre_p
, NULL
,
2313 is_gimple_call_addr
, fb_rvalue
);
2315 nargs
= call_expr_nargs (*expr_p
);
2317 /* Get argument types for verification. */
2318 fndecl
= get_callee_fndecl (*expr_p
);
2321 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
2322 else if (POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_FN (*expr_p
))))
2323 parms
= TYPE_ARG_TYPES (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (*expr_p
))));
2325 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
2326 p
= DECL_ARGUMENTS (fndecl
);
2331 for (i
= 0; i
< nargs
&& p
; i
++, p
= TREE_CHAIN (p
))
2334 /* If the last argument is __builtin_va_arg_pack () and it is not
2335 passed as a named argument, decrease the number of CALL_EXPR
2336 arguments and set instead the CALL_EXPR_VA_ARG_PACK flag. */
2339 && TREE_CODE (CALL_EXPR_ARG (*expr_p
, nargs
- 1)) == CALL_EXPR
)
2341 tree last_arg
= CALL_EXPR_ARG (*expr_p
, nargs
- 1);
2342 tree last_arg_fndecl
= get_callee_fndecl (last_arg
);
2345 && TREE_CODE (last_arg_fndecl
) == FUNCTION_DECL
2346 && DECL_BUILT_IN_CLASS (last_arg_fndecl
) == BUILT_IN_NORMAL
2347 && DECL_FUNCTION_CODE (last_arg_fndecl
) == BUILT_IN_VA_ARG_PACK
)
2349 tree call
= *expr_p
;
2352 *expr_p
= build_call_array (TREE_TYPE (call
), CALL_EXPR_FN (call
),
2353 nargs
, CALL_EXPR_ARGP (call
));
2355 /* Copy all CALL_EXPR flags, location and block, except
2356 CALL_EXPR_VA_ARG_PACK flag. */
2357 CALL_EXPR_STATIC_CHAIN (*expr_p
) = CALL_EXPR_STATIC_CHAIN (call
);
2358 CALL_EXPR_TAILCALL (*expr_p
) = CALL_EXPR_TAILCALL (call
);
2359 CALL_EXPR_RETURN_SLOT_OPT (*expr_p
)
2360 = CALL_EXPR_RETURN_SLOT_OPT (call
);
2361 CALL_FROM_THUNK_P (*expr_p
) = CALL_FROM_THUNK_P (call
);
2362 CALL_CANNOT_INLINE_P (*expr_p
) = CALL_CANNOT_INLINE_P (call
);
2363 SET_EXPR_LOCUS (*expr_p
, EXPR_LOCUS (call
));
2364 TREE_BLOCK (*expr_p
) = TREE_BLOCK (call
);
2366 /* Set CALL_EXPR_VA_ARG_PACK. */
2367 CALL_EXPR_VA_ARG_PACK (*expr_p
) = 1;
2371 /* Finally, gimplify the function arguments. */
2374 for (i
= (PUSH_ARGS_REVERSED
? nargs
- 1 : 0);
2375 PUSH_ARGS_REVERSED
? i
>= 0 : i
< nargs
;
2376 PUSH_ARGS_REVERSED
? i
-- : i
++)
2378 enum gimplify_status t
;
2380 /* Avoid gimplifying the second argument to va_start, which needs to
2381 be the plain PARM_DECL. */
2382 if ((i
!= 1) || !builtin_va_start_p
)
2384 t
= gimplify_arg (&CALL_EXPR_ARG (*expr_p
, i
), pre_p
,
2385 EXPR_LOCATION (*expr_p
));
2393 /* Try this again in case gimplification exposed something. */
2394 if (ret
!= GS_ERROR
)
2396 tree new_tree
= fold_call_expr (*expr_p
, !want_value
);
2398 if (new_tree
&& new_tree
!= *expr_p
)
2400 /* There was a transformation of this call which computes the
2401 same value, but in a more efficient way. Return and try
2409 *expr_p
= error_mark_node
;
2413 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2414 decl. This allows us to eliminate redundant or useless
2415 calls to "const" functions. */
2416 if (TREE_CODE (*expr_p
) == CALL_EXPR
)
2418 int flags
= call_expr_flags (*expr_p
);
2419 if (flags
& (ECF_CONST
| ECF_PURE
)
2420 /* An infinite loop is considered a side effect. */
2421 && !(flags
& (ECF_LOOPING_CONST_OR_PURE
)))
2422 TREE_SIDE_EFFECTS (*expr_p
) = 0;
2425 /* If the value is not needed by the caller, emit a new GIMPLE_CALL
2426 and clear *EXPR_P. Otherwise, leave *EXPR_P in its gimplified
2427 form and delegate the creation of a GIMPLE_CALL to
2428 gimplify_modify_expr. This is always possible because when
2429 WANT_VALUE is true, the caller wants the result of this call into
2430 a temporary, which means that we will emit an INIT_EXPR in
2431 internal_get_tmp_var which will then be handled by
2432 gimplify_modify_expr. */
2435 /* The CALL_EXPR in *EXPR_P is already in GIMPLE form, so all we
2436 have to do is replicate it as a GIMPLE_CALL tuple. */
2437 call
= gimple_build_call_from_tree (*expr_p
);
2438 gimplify_seq_add_stmt (pre_p
, call
);
2439 *expr_p
= NULL_TREE
;
2445 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2446 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2448 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2449 condition is true or false, respectively. If null, we should generate
2450 our own to skip over the evaluation of this specific expression.
2452 LOCUS is the source location of the COND_EXPR.
2454 This function is the tree equivalent of do_jump.
2456 shortcut_cond_r should only be called by shortcut_cond_expr. */
2459 shortcut_cond_r (tree pred
, tree
*true_label_p
, tree
*false_label_p
,
2462 tree local_label
= NULL_TREE
;
2463 tree t
, expr
= NULL
;
2465 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2466 retain the shortcut semantics. Just insert the gotos here;
2467 shortcut_cond_expr will append the real blocks later. */
2468 if (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2470 location_t new_locus
;
2472 /* Turn if (a && b) into
2474 if (a); else goto no;
2475 if (b) goto yes; else goto no;
2478 if (false_label_p
== NULL
)
2479 false_label_p
= &local_label
;
2481 /* Keep the original source location on the first 'if'. */
2482 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), NULL
, false_label_p
, locus
);
2483 append_to_statement_list (t
, &expr
);
2485 /* Set the source location of the && on the second 'if'. */
2486 new_locus
= EXPR_HAS_LOCATION (pred
) ? EXPR_LOCATION (pred
) : locus
;
2487 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
, false_label_p
,
2489 append_to_statement_list (t
, &expr
);
2491 else if (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2493 location_t new_locus
;
2495 /* Turn if (a || b) into
2498 if (b) goto yes; else goto no;
2501 if (true_label_p
== NULL
)
2502 true_label_p
= &local_label
;
2504 /* Keep the original source location on the first 'if'. */
2505 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), true_label_p
, NULL
, locus
);
2506 append_to_statement_list (t
, &expr
);
2508 /* Set the source location of the || on the second 'if'. */
2509 new_locus
= EXPR_HAS_LOCATION (pred
) ? EXPR_LOCATION (pred
) : locus
;
2510 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
, false_label_p
,
2512 append_to_statement_list (t
, &expr
);
2514 else if (TREE_CODE (pred
) == COND_EXPR
)
2516 location_t new_locus
;
2518 /* As long as we're messing with gotos, turn if (a ? b : c) into
2520 if (b) goto yes; else goto no;
2522 if (c) goto yes; else goto no; */
2524 /* Keep the original source location on the first 'if'. Set the source
2525 location of the ? on the second 'if'. */
2526 new_locus
= EXPR_HAS_LOCATION (pred
) ? EXPR_LOCATION (pred
) : locus
;
2527 expr
= build3 (COND_EXPR
, void_type_node
, TREE_OPERAND (pred
, 0),
2528 shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2529 false_label_p
, locus
),
2530 shortcut_cond_r (TREE_OPERAND (pred
, 2), true_label_p
,
2531 false_label_p
, new_locus
));
2535 expr
= build3 (COND_EXPR
, void_type_node
, pred
,
2536 build_and_jump (true_label_p
),
2537 build_and_jump (false_label_p
));
2538 SET_EXPR_LOCATION (expr
, locus
);
2543 t
= build1 (LABEL_EXPR
, void_type_node
, local_label
);
2544 append_to_statement_list (t
, &expr
);
2550 /* Given a conditional expression EXPR with short-circuit boolean
2551 predicates using TRUTH_ANDIF_EXPR or TRUTH_ORIF_EXPR, break the
2552 predicate appart into the equivalent sequence of conditionals. */
2555 shortcut_cond_expr (tree expr
)
2557 tree pred
= TREE_OPERAND (expr
, 0);
2558 tree then_
= TREE_OPERAND (expr
, 1);
2559 tree else_
= TREE_OPERAND (expr
, 2);
2560 tree true_label
, false_label
, end_label
, t
;
2562 tree
*false_label_p
;
2563 bool emit_end
, emit_false
, jump_over_else
;
2564 bool then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2565 bool else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2567 /* First do simple transformations. */
2570 /* If there is no 'else', turn
2573 if (a) if (b) then c. */
2574 while (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2576 /* Keep the original source location on the first 'if'. */
2577 location_t locus
= EXPR_HAS_LOCATION (expr
)
2578 ? EXPR_LOCATION (expr
) : input_location
;
2579 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2580 /* Set the source location of the && on the second 'if'. */
2581 if (EXPR_HAS_LOCATION (pred
))
2582 SET_EXPR_LOCATION (expr
, EXPR_LOCATION (pred
));
2583 then_
= shortcut_cond_expr (expr
);
2584 then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2585 pred
= TREE_OPERAND (pred
, 0);
2586 expr
= build3 (COND_EXPR
, void_type_node
, pred
, then_
, NULL_TREE
);
2587 SET_EXPR_LOCATION (expr
, locus
);
2593 /* If there is no 'then', turn
2596 if (a); else if (b); else d. */
2597 while (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2599 /* Keep the original source location on the first 'if'. */
2600 location_t locus
= EXPR_HAS_LOCATION (expr
)
2601 ? EXPR_LOCATION (expr
) : input_location
;
2602 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2603 /* Set the source location of the || on the second 'if'. */
2604 if (EXPR_HAS_LOCATION (pred
))
2605 SET_EXPR_LOCATION (expr
, EXPR_LOCATION (pred
));
2606 else_
= shortcut_cond_expr (expr
);
2607 else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2608 pred
= TREE_OPERAND (pred
, 0);
2609 expr
= build3 (COND_EXPR
, void_type_node
, pred
, NULL_TREE
, else_
);
2610 SET_EXPR_LOCATION (expr
, locus
);
2614 /* If we're done, great. */
2615 if (TREE_CODE (pred
) != TRUTH_ANDIF_EXPR
2616 && TREE_CODE (pred
) != TRUTH_ORIF_EXPR
)
2619 /* Otherwise we need to mess with gotos. Change
2622 if (a); else goto no;
2625 and recursively gimplify the condition. */
2627 true_label
= false_label
= end_label
= NULL_TREE
;
2629 /* If our arms just jump somewhere, hijack those labels so we don't
2630 generate jumps to jumps. */
2633 && TREE_CODE (then_
) == GOTO_EXPR
2634 && TREE_CODE (GOTO_DESTINATION (then_
)) == LABEL_DECL
)
2636 true_label
= GOTO_DESTINATION (then_
);
2642 && TREE_CODE (else_
) == GOTO_EXPR
2643 && TREE_CODE (GOTO_DESTINATION (else_
)) == LABEL_DECL
)
2645 false_label
= GOTO_DESTINATION (else_
);
2650 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2652 true_label_p
= &true_label
;
2654 true_label_p
= NULL
;
2656 /* The 'else' branch also needs a label if it contains interesting code. */
2657 if (false_label
|| else_se
)
2658 false_label_p
= &false_label
;
2660 false_label_p
= NULL
;
2662 /* If there was nothing else in our arms, just forward the label(s). */
2663 if (!then_se
&& !else_se
)
2664 return shortcut_cond_r (pred
, true_label_p
, false_label_p
,
2665 EXPR_HAS_LOCATION (expr
)
2666 ? EXPR_LOCATION (expr
) : input_location
);
2668 /* If our last subexpression already has a terminal label, reuse it. */
2670 t
= expr_last (else_
);
2672 t
= expr_last (then_
);
2675 if (t
&& TREE_CODE (t
) == LABEL_EXPR
)
2676 end_label
= LABEL_EXPR_LABEL (t
);
2678 /* If we don't care about jumping to the 'else' branch, jump to the end
2679 if the condition is false. */
2681 false_label_p
= &end_label
;
2683 /* We only want to emit these labels if we aren't hijacking them. */
2684 emit_end
= (end_label
== NULL_TREE
);
2685 emit_false
= (false_label
== NULL_TREE
);
2687 /* We only emit the jump over the else clause if we have to--if the
2688 then clause may fall through. Otherwise we can wind up with a
2689 useless jump and a useless label at the end of gimplified code,
2690 which will cause us to think that this conditional as a whole
2691 falls through even if it doesn't. If we then inline a function
2692 which ends with such a condition, that can cause us to issue an
2693 inappropriate warning about control reaching the end of a
2694 non-void function. */
2695 jump_over_else
= block_may_fallthru (then_
);
2697 pred
= shortcut_cond_r (pred
, true_label_p
, false_label_p
,
2698 EXPR_HAS_LOCATION (expr
)
2699 ? EXPR_LOCATION (expr
) : input_location
);
2702 append_to_statement_list (pred
, &expr
);
2704 append_to_statement_list (then_
, &expr
);
2709 tree last
= expr_last (expr
);
2710 t
= build_and_jump (&end_label
);
2711 if (EXPR_HAS_LOCATION (last
))
2712 SET_EXPR_LOCATION (t
, EXPR_LOCATION (last
));
2713 append_to_statement_list (t
, &expr
);
2717 t
= build1 (LABEL_EXPR
, void_type_node
, false_label
);
2718 append_to_statement_list (t
, &expr
);
2720 append_to_statement_list (else_
, &expr
);
2722 if (emit_end
&& end_label
)
2724 t
= build1 (LABEL_EXPR
, void_type_node
, end_label
);
2725 append_to_statement_list (t
, &expr
);
2731 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2734 gimple_boolify (tree expr
)
2736 tree type
= TREE_TYPE (expr
);
2738 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
2741 switch (TREE_CODE (expr
))
2743 case TRUTH_AND_EXPR
:
2745 case TRUTH_XOR_EXPR
:
2746 case TRUTH_ANDIF_EXPR
:
2747 case TRUTH_ORIF_EXPR
:
2748 /* Also boolify the arguments of truth exprs. */
2749 TREE_OPERAND (expr
, 1) = gimple_boolify (TREE_OPERAND (expr
, 1));
2752 case TRUTH_NOT_EXPR
:
2753 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
2756 case EQ_EXPR
: case NE_EXPR
:
2757 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
2758 /* These expressions always produce boolean results. */
2759 TREE_TYPE (expr
) = boolean_type_node
;
2763 /* Other expressions that get here must have boolean values, but
2764 might need to be converted to the appropriate mode. */
2765 return fold_convert (boolean_type_node
, expr
);
2769 /* Given a conditional expression *EXPR_P without side effects, gimplify
2770 its operands. New statements are inserted to PRE_P. */
2772 static enum gimplify_status
2773 gimplify_pure_cond_expr (tree
*expr_p
, gimple_seq
*pre_p
)
2775 tree expr
= *expr_p
, cond
;
2776 enum gimplify_status ret
, tret
;
2777 enum tree_code code
;
2779 cond
= gimple_boolify (COND_EXPR_COND (expr
));
2781 /* We need to handle && and || specially, as their gimplification
2782 creates pure cond_expr, thus leading to an infinite cycle otherwise. */
2783 code
= TREE_CODE (cond
);
2784 if (code
== TRUTH_ANDIF_EXPR
)
2785 TREE_SET_CODE (cond
, TRUTH_AND_EXPR
);
2786 else if (code
== TRUTH_ORIF_EXPR
)
2787 TREE_SET_CODE (cond
, TRUTH_OR_EXPR
);
2788 ret
= gimplify_expr (&cond
, pre_p
, NULL
, is_gimple_condexpr
, fb_rvalue
);
2789 COND_EXPR_COND (*expr_p
) = cond
;
2791 tret
= gimplify_expr (&COND_EXPR_THEN (expr
), pre_p
, NULL
,
2792 is_gimple_val
, fb_rvalue
);
2793 ret
= MIN (ret
, tret
);
2794 tret
= gimplify_expr (&COND_EXPR_ELSE (expr
), pre_p
, NULL
,
2795 is_gimple_val
, fb_rvalue
);
2797 return MIN (ret
, tret
);
2800 /* Returns true if evaluating EXPR could trap.
2801 EXPR is GENERIC, while tree_could_trap_p can be called
2805 generic_expr_could_trap_p (tree expr
)
2809 if (!expr
|| is_gimple_val (expr
))
2812 if (!EXPR_P (expr
) || tree_could_trap_p (expr
))
2815 n
= TREE_OPERAND_LENGTH (expr
);
2816 for (i
= 0; i
< n
; i
++)
2817 if (generic_expr_could_trap_p (TREE_OPERAND (expr
, i
)))
2823 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2832 The second form is used when *EXPR_P is of type void.
2834 PRE_P points to the list where side effects that must happen before
2835 *EXPR_P should be stored. */
2837 static enum gimplify_status
2838 gimplify_cond_expr (tree
*expr_p
, gimple_seq
*pre_p
, fallback_t fallback
)
2840 tree expr
= *expr_p
;
2841 tree tmp
, type
, arm1
, arm2
;
2842 enum gimplify_status ret
;
2843 tree label_true
, label_false
, label_cont
;
2844 bool have_then_clause_p
, have_else_clause_p
;
2846 enum tree_code pred_code
;
2847 gimple_seq seq
= NULL
;
2849 type
= TREE_TYPE (expr
);
2851 /* If this COND_EXPR has a value, copy the values into a temporary within
2853 if (! VOID_TYPE_P (type
))
2857 /* If an rvalue is ok or we do not require an lvalue, avoid creating
2858 an addressable temporary. */
2859 if (((fallback
& fb_rvalue
)
2860 || !(fallback
& fb_lvalue
))
2861 && !TREE_ADDRESSABLE (type
))
2863 if (gimplify_ctxp
->allow_rhs_cond_expr
2864 /* If either branch has side effects or could trap, it can't be
2865 evaluated unconditionally. */
2866 && !TREE_SIDE_EFFECTS (TREE_OPERAND (*expr_p
, 1))
2867 && !generic_expr_could_trap_p (TREE_OPERAND (*expr_p
, 1))
2868 && !TREE_SIDE_EFFECTS (TREE_OPERAND (*expr_p
, 2))
2869 && !generic_expr_could_trap_p (TREE_OPERAND (*expr_p
, 2)))
2870 return gimplify_pure_cond_expr (expr_p
, pre_p
);
2872 result
= tmp
= create_tmp_var (TREE_TYPE (expr
), "iftmp");
2877 tree type
= build_pointer_type (TREE_TYPE (expr
));
2879 if (TREE_TYPE (TREE_OPERAND (expr
, 1)) != void_type_node
)
2880 TREE_OPERAND (expr
, 1) =
2881 build_fold_addr_expr (TREE_OPERAND (expr
, 1));
2883 if (TREE_TYPE (TREE_OPERAND (expr
, 2)) != void_type_node
)
2884 TREE_OPERAND (expr
, 2) =
2885 build_fold_addr_expr (TREE_OPERAND (expr
, 2));
2887 tmp
= create_tmp_var (type
, "iftmp");
2889 expr
= build3 (COND_EXPR
, void_type_node
, TREE_OPERAND (expr
, 0),
2890 TREE_OPERAND (expr
, 1), TREE_OPERAND (expr
, 2));
2892 result
= build_fold_indirect_ref (tmp
);
2895 /* Build the then clause, 't1 = a;'. But don't build an assignment
2896 if this branch is void; in C++ it can be, if it's a throw. */
2897 if (TREE_TYPE (TREE_OPERAND (expr
, 1)) != void_type_node
)
2898 TREE_OPERAND (expr
, 1)
2899 = build2 (MODIFY_EXPR
, TREE_TYPE (tmp
), tmp
, TREE_OPERAND (expr
, 1));
2901 /* Build the else clause, 't1 = b;'. */
2902 if (TREE_TYPE (TREE_OPERAND (expr
, 2)) != void_type_node
)
2903 TREE_OPERAND (expr
, 2)
2904 = build2 (MODIFY_EXPR
, TREE_TYPE (tmp
), tmp
, TREE_OPERAND (expr
, 2));
2906 TREE_TYPE (expr
) = void_type_node
;
2907 recalculate_side_effects (expr
);
2909 /* Move the COND_EXPR to the prequeue. */
2910 gimplify_stmt (&expr
, pre_p
);
2916 /* Make sure the condition has BOOLEAN_TYPE. */
2917 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
2919 /* Break apart && and || conditions. */
2920 if (TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ANDIF_EXPR
2921 || TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ORIF_EXPR
)
2923 expr
= shortcut_cond_expr (expr
);
2925 if (expr
!= *expr_p
)
2929 /* We can't rely on gimplify_expr to re-gimplify the expanded
2930 form properly, as cleanups might cause the target labels to be
2931 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2932 set up a conditional context. */
2933 gimple_push_condition ();
2934 gimplify_stmt (expr_p
, &seq
);
2935 gimple_pop_condition (pre_p
);
2936 gimple_seq_add_seq (pre_p
, seq
);
2942 /* Now do the normal gimplification. */
2944 /* Gimplify condition. */
2945 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, NULL
, is_gimple_condexpr
,
2947 if (ret
== GS_ERROR
)
2949 gcc_assert (TREE_OPERAND (expr
, 0) != NULL_TREE
);
2951 gimple_push_condition ();
2953 have_then_clause_p
= have_else_clause_p
= false;
2954 if (TREE_OPERAND (expr
, 1) != NULL
2955 && TREE_CODE (TREE_OPERAND (expr
, 1)) == GOTO_EXPR
2956 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr
, 1))) == LABEL_DECL
2957 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr
, 1)))
2958 == current_function_decl
)
2959 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
2960 have different locations, otherwise we end up with incorrect
2961 location information on the branches. */
2963 || !EXPR_HAS_LOCATION (expr
)
2964 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr
, 1))
2965 || EXPR_LOCATION (expr
) == EXPR_LOCATION (TREE_OPERAND (expr
, 1))))
2967 label_true
= GOTO_DESTINATION (TREE_OPERAND (expr
, 1));
2968 have_then_clause_p
= true;
2971 label_true
= create_artificial_label ();
2972 if (TREE_OPERAND (expr
, 2) != NULL
2973 && TREE_CODE (TREE_OPERAND (expr
, 2)) == GOTO_EXPR
2974 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr
, 2))) == LABEL_DECL
2975 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr
, 2)))
2976 == current_function_decl
)
2977 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
2978 have different locations, otherwise we end up with incorrect
2979 location information on the branches. */
2981 || !EXPR_HAS_LOCATION (expr
)
2982 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr
, 2))
2983 || EXPR_LOCATION (expr
) == EXPR_LOCATION (TREE_OPERAND (expr
, 2))))
2985 label_false
= GOTO_DESTINATION (TREE_OPERAND (expr
, 2));
2986 have_else_clause_p
= true;
2989 label_false
= create_artificial_label ();
2991 gimple_cond_get_ops_from_tree (COND_EXPR_COND (expr
), &pred_code
, &arm1
,
2994 gimple_cond
= gimple_build_cond (pred_code
, arm1
, arm2
, label_true
,
2997 gimplify_seq_add_stmt (&seq
, gimple_cond
);
2998 label_cont
= NULL_TREE
;
2999 if (!have_then_clause_p
)
3001 /* For if (...) {} else { code; } put label_true after
3003 if (TREE_OPERAND (expr
, 1) == NULL_TREE
3004 && !have_else_clause_p
3005 && TREE_OPERAND (expr
, 2) != NULL_TREE
)
3006 label_cont
= label_true
;
3009 gimplify_seq_add_stmt (&seq
, gimple_build_label (label_true
));
3010 have_then_clause_p
= gimplify_stmt (&TREE_OPERAND (expr
, 1), &seq
);
3011 /* For if (...) { code; } else {} or
3012 if (...) { code; } else goto label; or
3013 if (...) { code; return; } else { ... }
3014 label_cont isn't needed. */
3015 if (!have_else_clause_p
3016 && TREE_OPERAND (expr
, 2) != NULL_TREE
3017 && gimple_seq_may_fallthru (seq
))
3020 label_cont
= create_artificial_label ();
3022 g
= gimple_build_goto (label_cont
);
3024 /* GIMPLE_COND's are very low level; they have embedded
3025 gotos. This particular embedded goto should not be marked
3026 with the location of the original COND_EXPR, as it would
3027 correspond to the COND_EXPR's condition, not the ELSE or the
3028 THEN arms. To avoid marking it with the wrong location, flag
3029 it as "no location". */
3030 gimple_set_do_not_emit_location (g
);
3032 gimplify_seq_add_stmt (&seq
, g
);
3036 if (!have_else_clause_p
)
3038 gimplify_seq_add_stmt (&seq
, gimple_build_label (label_false
));
3039 have_else_clause_p
= gimplify_stmt (&TREE_OPERAND (expr
, 2), &seq
);
3042 gimplify_seq_add_stmt (&seq
, gimple_build_label (label_cont
));
3044 gimple_pop_condition (pre_p
);
3045 gimple_seq_add_seq (pre_p
, seq
);
3047 if (ret
== GS_ERROR
)
3049 else if (have_then_clause_p
|| have_else_clause_p
)
3053 /* Both arms are empty; replace the COND_EXPR with its predicate. */
3054 expr
= TREE_OPERAND (expr
, 0);
3055 gimplify_stmt (&expr
, pre_p
);
3062 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3063 a call to __builtin_memcpy. */
3065 static enum gimplify_status
3066 gimplify_modify_expr_to_memcpy (tree
*expr_p
, tree size
, bool want_value
,
3069 tree t
, to
, to_ptr
, from
, from_ptr
;
3072 to
= TREE_OPERAND (*expr_p
, 0);
3073 from
= TREE_OPERAND (*expr_p
, 1);
3075 mark_addressable (from
);
3076 from_ptr
= build_fold_addr_expr (from
);
3077 gimplify_arg (&from_ptr
, seq_p
, EXPR_LOCATION (*expr_p
));
3079 mark_addressable (to
);
3080 to_ptr
= build_fold_addr_expr (to
);
3081 gimplify_arg (&to_ptr
, seq_p
, EXPR_LOCATION (*expr_p
));
3083 t
= implicit_built_in_decls
[BUILT_IN_MEMCPY
];
3085 gs
= gimple_build_call (t
, 3, to_ptr
, from_ptr
, size
);
3089 /* tmp = memcpy() */
3090 t
= create_tmp_var (TREE_TYPE (to_ptr
), NULL
);
3091 gimple_call_set_lhs (gs
, t
);
3092 gimplify_seq_add_stmt (seq_p
, gs
);
3094 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
3098 gimplify_seq_add_stmt (seq_p
, gs
);
3103 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3104 a call to __builtin_memset. In this case we know that the RHS is
3105 a CONSTRUCTOR with an empty element list. */
3107 static enum gimplify_status
3108 gimplify_modify_expr_to_memset (tree
*expr_p
, tree size
, bool want_value
,
3111 tree t
, from
, to
, to_ptr
;
3114 /* Assert our assumptions, to abort instead of producing wrong code
3115 silently if they are not met. Beware that the RHS CONSTRUCTOR might
3116 not be immediately exposed. */
3117 from
= TREE_OPERAND (*expr_p
, 1);
3118 if (TREE_CODE (from
) == WITH_SIZE_EXPR
)
3119 from
= TREE_OPERAND (from
, 0);
3121 gcc_assert (TREE_CODE (from
) == CONSTRUCTOR
3122 && VEC_empty (constructor_elt
, CONSTRUCTOR_ELTS (from
)));
3125 to
= TREE_OPERAND (*expr_p
, 0);
3127 to_ptr
= build_fold_addr_expr (to
);
3128 gimplify_arg (&to_ptr
, seq_p
, EXPR_LOCATION (*expr_p
));
3129 t
= implicit_built_in_decls
[BUILT_IN_MEMSET
];
3131 gs
= gimple_build_call (t
, 3, to_ptr
, integer_zero_node
, size
);
3135 /* tmp = memset() */
3136 t
= create_tmp_var (TREE_TYPE (to_ptr
), NULL
);
3137 gimple_call_set_lhs (gs
, t
);
3138 gimplify_seq_add_stmt (seq_p
, gs
);
3140 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
3144 gimplify_seq_add_stmt (seq_p
, gs
);
3149 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
3150 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
3151 assignment. Returns non-null if we detect a potential overlap. */
3153 struct gimplify_init_ctor_preeval_data
3155 /* The base decl of the lhs object. May be NULL, in which case we
3156 have to assume the lhs is indirect. */
3159 /* The alias set of the lhs object. */
3160 alias_set_type lhs_alias_set
;
3164 gimplify_init_ctor_preeval_1 (tree
*tp
, int *walk_subtrees
, void *xdata
)
3166 struct gimplify_init_ctor_preeval_data
*data
3167 = (struct gimplify_init_ctor_preeval_data
*) xdata
;
3170 /* If we find the base object, obviously we have overlap. */
3171 if (data
->lhs_base_decl
== t
)
3174 /* If the constructor component is indirect, determine if we have a
3175 potential overlap with the lhs. The only bits of information we
3176 have to go on at this point are addressability and alias sets. */
3177 if (TREE_CODE (t
) == INDIRECT_REF
3178 && (!data
->lhs_base_decl
|| TREE_ADDRESSABLE (data
->lhs_base_decl
))
3179 && alias_sets_conflict_p (data
->lhs_alias_set
, get_alias_set (t
)))
3182 /* If the constructor component is a call, determine if it can hide a
3183 potential overlap with the lhs through an INDIRECT_REF like above. */
3184 if (TREE_CODE (t
) == CALL_EXPR
)
3186 tree type
, fntype
= TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (t
)));
3188 for (type
= TYPE_ARG_TYPES (fntype
); type
; type
= TREE_CHAIN (type
))
3189 if (POINTER_TYPE_P (TREE_VALUE (type
))
3190 && (!data
->lhs_base_decl
|| TREE_ADDRESSABLE (data
->lhs_base_decl
))
3191 && alias_sets_conflict_p (data
->lhs_alias_set
,
3193 (TREE_TYPE (TREE_VALUE (type
)))))
3197 if (IS_TYPE_OR_DECL_P (t
))
3202 /* A subroutine of gimplify_init_constructor. Pre-evaluate EXPR,
3203 force values that overlap with the lhs (as described by *DATA)
3204 into temporaries. */
3207 gimplify_init_ctor_preeval (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
3208 struct gimplify_init_ctor_preeval_data
*data
)
3210 enum gimplify_status one
;
3212 /* If the value is constant, then there's nothing to pre-evaluate. */
3213 if (TREE_CONSTANT (*expr_p
))
3215 /* Ensure it does not have side effects, it might contain a reference to
3216 the object we're initializing. */
3217 gcc_assert (!TREE_SIDE_EFFECTS (*expr_p
));
3221 /* If the type has non-trivial constructors, we can't pre-evaluate. */
3222 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p
)))
3225 /* Recurse for nested constructors. */
3226 if (TREE_CODE (*expr_p
) == CONSTRUCTOR
)
3228 unsigned HOST_WIDE_INT ix
;
3229 constructor_elt
*ce
;
3230 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (*expr_p
);
3232 for (ix
= 0; VEC_iterate (constructor_elt
, v
, ix
, ce
); ix
++)
3233 gimplify_init_ctor_preeval (&ce
->value
, pre_p
, post_p
, data
);
3238 /* If this is a variable sized type, we must remember the size. */
3239 maybe_with_size_expr (expr_p
);
3241 /* Gimplify the constructor element to something appropriate for the rhs
3242 of a MODIFY_EXPR. Given that we know the LHS is an aggregate, we know
3243 the gimplifier will consider this a store to memory. Doing this
3244 gimplification now means that we won't have to deal with complicated
3245 language-specific trees, nor trees like SAVE_EXPR that can induce
3246 exponential search behavior. */
3247 one
= gimplify_expr (expr_p
, pre_p
, post_p
, is_gimple_mem_rhs
, fb_rvalue
);
3248 if (one
== GS_ERROR
)
3254 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
3255 with the lhs, since "a = { .x=a }" doesn't make sense. This will
3256 always be true for all scalars, since is_gimple_mem_rhs insists on a
3257 temporary variable for them. */
3258 if (DECL_P (*expr_p
))
3261 /* If this is of variable size, we have no choice but to assume it doesn't
3262 overlap since we can't make a temporary for it. */
3263 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (*expr_p
))) != INTEGER_CST
)
3266 /* Otherwise, we must search for overlap ... */
3267 if (!walk_tree (expr_p
, gimplify_init_ctor_preeval_1
, data
, NULL
))
3270 /* ... and if found, force the value into a temporary. */
3271 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
3274 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
3275 a RANGE_EXPR in a CONSTRUCTOR for an array.
3279 object[var] = value;
3286 We increment var _after_ the loop exit check because we might otherwise
3287 fail if upper == TYPE_MAX_VALUE (type for upper).
3289 Note that we never have to deal with SAVE_EXPRs here, because this has
3290 already been taken care of for us, in gimplify_init_ctor_preeval(). */
3292 static void gimplify_init_ctor_eval (tree
, VEC(constructor_elt
,gc
) *,
3293 gimple_seq
*, bool);
3296 gimplify_init_ctor_eval_range (tree object
, tree lower
, tree upper
,
3297 tree value
, tree array_elt_type
,
3298 gimple_seq
*pre_p
, bool cleared
)
3300 tree loop_entry_label
, loop_exit_label
, fall_thru_label
;
3301 tree var
, var_type
, cref
, tmp
;
3303 loop_entry_label
= create_artificial_label ();
3304 loop_exit_label
= create_artificial_label ();
3305 fall_thru_label
= create_artificial_label ();
3307 /* Create and initialize the index variable. */
3308 var_type
= TREE_TYPE (upper
);
3309 var
= create_tmp_var (var_type
, NULL
);
3310 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (var
, lower
));
3312 /* Add the loop entry label. */
3313 gimplify_seq_add_stmt (pre_p
, gimple_build_label (loop_entry_label
));
3315 /* Build the reference. */
3316 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
3317 var
, NULL_TREE
, NULL_TREE
);
3319 /* If we are a constructor, just call gimplify_init_ctor_eval to do
3320 the store. Otherwise just assign value to the reference. */
3322 if (TREE_CODE (value
) == CONSTRUCTOR
)
3323 /* NB we might have to call ourself recursively through
3324 gimplify_init_ctor_eval if the value is a constructor. */
3325 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
3328 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (cref
, value
));
3330 /* We exit the loop when the index var is equal to the upper bound. */
3331 gimplify_seq_add_stmt (pre_p
,
3332 gimple_build_cond (EQ_EXPR
, var
, upper
,
3333 loop_exit_label
, fall_thru_label
));
3335 gimplify_seq_add_stmt (pre_p
, gimple_build_label (fall_thru_label
));
3337 /* Otherwise, increment the index var... */
3338 tmp
= build2 (PLUS_EXPR
, var_type
, var
,
3339 fold_convert (var_type
, integer_one_node
));
3340 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (var
, tmp
));
3342 /* ...and jump back to the loop entry. */
3343 gimplify_seq_add_stmt (pre_p
, gimple_build_goto (loop_entry_label
));
3345 /* Add the loop exit label. */
3346 gimplify_seq_add_stmt (pre_p
, gimple_build_label (loop_exit_label
));
3349 /* Return true if FDECL is accessing a field that is zero sized. */
3352 zero_sized_field_decl (const_tree fdecl
)
3354 if (TREE_CODE (fdecl
) == FIELD_DECL
&& DECL_SIZE (fdecl
)
3355 && integer_zerop (DECL_SIZE (fdecl
)))
3360 /* Return true if TYPE is zero sized. */
3363 zero_sized_type (const_tree type
)
3365 if (AGGREGATE_TYPE_P (type
) && TYPE_SIZE (type
)
3366 && integer_zerop (TYPE_SIZE (type
)))
3371 /* A subroutine of gimplify_init_constructor. Generate individual
3372 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
3373 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
3374 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
3378 gimplify_init_ctor_eval (tree object
, VEC(constructor_elt
,gc
) *elts
,
3379 gimple_seq
*pre_p
, bool cleared
)
3381 tree array_elt_type
= NULL
;
3382 unsigned HOST_WIDE_INT ix
;
3383 tree purpose
, value
;
3385 if (TREE_CODE (TREE_TYPE (object
)) == ARRAY_TYPE
)
3386 array_elt_type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object
)));
3388 FOR_EACH_CONSTRUCTOR_ELT (elts
, ix
, purpose
, value
)
3392 /* NULL values are created above for gimplification errors. */
3396 if (cleared
&& initializer_zerop (value
))
3399 /* ??? Here's to hoping the front end fills in all of the indices,
3400 so we don't have to figure out what's missing ourselves. */
3401 gcc_assert (purpose
);
3403 /* Skip zero-sized fields, unless value has side-effects. This can
3404 happen with calls to functions returning a zero-sized type, which
3405 we shouldn't discard. As a number of downstream passes don't
3406 expect sets of zero-sized fields, we rely on the gimplification of
3407 the MODIFY_EXPR we make below to drop the assignment statement. */
3408 if (! TREE_SIDE_EFFECTS (value
) && zero_sized_field_decl (purpose
))
3411 /* If we have a RANGE_EXPR, we have to build a loop to assign the
3413 if (TREE_CODE (purpose
) == RANGE_EXPR
)
3415 tree lower
= TREE_OPERAND (purpose
, 0);
3416 tree upper
= TREE_OPERAND (purpose
, 1);
3418 /* If the lower bound is equal to upper, just treat it as if
3419 upper was the index. */
3420 if (simple_cst_equal (lower
, upper
))
3424 gimplify_init_ctor_eval_range (object
, lower
, upper
, value
,
3425 array_elt_type
, pre_p
, cleared
);
3432 /* Do not use bitsizetype for ARRAY_REF indices. */
3433 if (TYPE_DOMAIN (TREE_TYPE (object
)))
3434 purpose
= fold_convert (TREE_TYPE (TYPE_DOMAIN (TREE_TYPE (object
))),
3436 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
3437 purpose
, NULL_TREE
, NULL_TREE
);
3441 gcc_assert (TREE_CODE (purpose
) == FIELD_DECL
);
3442 cref
= build3 (COMPONENT_REF
, TREE_TYPE (purpose
),
3443 unshare_expr (object
), purpose
, NULL_TREE
);
3446 if (TREE_CODE (value
) == CONSTRUCTOR
3447 && TREE_CODE (TREE_TYPE (value
)) != VECTOR_TYPE
)
3448 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
3452 tree init
= build2 (INIT_EXPR
, TREE_TYPE (cref
), cref
, value
);
3453 gimplify_and_add (init
, pre_p
);
3460 /* Returns the appropriate RHS predicate for this LHS. */
3463 rhs_predicate_for (tree lhs
)
3465 if (is_gimple_reg (lhs
))
3466 return is_gimple_reg_rhs_or_call
;
3468 return is_gimple_mem_rhs_or_call
;
3471 /* Gimplify a C99 compound literal expression. This just means adding
3472 the DECL_EXPR before the current statement and using its anonymous
3475 static enum gimplify_status
3476 gimplify_compound_literal_expr (tree
*expr_p
, gimple_seq
*pre_p
)
3478 tree decl_s
= COMPOUND_LITERAL_EXPR_DECL_EXPR (*expr_p
);
3479 tree decl
= DECL_EXPR_DECL (decl_s
);
3480 /* Mark the decl as addressable if the compound literal
3481 expression is addressable now, otherwise it is marked too late
3482 after we gimplify the initialization expression. */
3483 if (TREE_ADDRESSABLE (*expr_p
))
3484 TREE_ADDRESSABLE (decl
) = 1;
3486 /* Preliminarily mark non-addressed complex variables as eligible
3487 for promotion to gimple registers. We'll transform their uses
3489 if ((TREE_CODE (TREE_TYPE (decl
)) == COMPLEX_TYPE
3490 || TREE_CODE (TREE_TYPE (decl
)) == VECTOR_TYPE
)
3491 && !TREE_THIS_VOLATILE (decl
)
3492 && !needs_to_live_in_memory (decl
))
3493 DECL_GIMPLE_REG_P (decl
) = 1;
3495 /* This decl isn't mentioned in the enclosing block, so add it to the
3496 list of temps. FIXME it seems a bit of a kludge to say that
3497 anonymous artificial vars aren't pushed, but everything else is. */
3498 if (DECL_NAME (decl
) == NULL_TREE
&& !DECL_SEEN_IN_BIND_EXPR_P (decl
))
3499 gimple_add_tmp_var (decl
);
3501 gimplify_and_add (decl_s
, pre_p
);
3506 /* Optimize embedded COMPOUND_LITERAL_EXPRs within a CONSTRUCTOR,
3507 return a new CONSTRUCTOR if something changed. */
3510 optimize_compound_literals_in_ctor (tree orig_ctor
)
3512 tree ctor
= orig_ctor
;
3513 VEC(constructor_elt
,gc
) *elts
= CONSTRUCTOR_ELTS (ctor
);
3514 unsigned int idx
, num
= VEC_length (constructor_elt
, elts
);
3516 for (idx
= 0; idx
< num
; idx
++)
3518 tree value
= VEC_index (constructor_elt
, elts
, idx
)->value
;
3519 tree newval
= value
;
3520 if (TREE_CODE (value
) == CONSTRUCTOR
)
3521 newval
= optimize_compound_literals_in_ctor (value
);
3522 else if (TREE_CODE (value
) == COMPOUND_LITERAL_EXPR
)
3524 tree decl_s
= COMPOUND_LITERAL_EXPR_DECL_EXPR (value
);
3525 tree decl
= DECL_EXPR_DECL (decl_s
);
3526 tree init
= DECL_INITIAL (decl
);
3528 if (!TREE_ADDRESSABLE (value
)
3529 && !TREE_ADDRESSABLE (decl
)
3531 newval
= optimize_compound_literals_in_ctor (init
);
3533 if (newval
== value
)
3536 if (ctor
== orig_ctor
)
3538 ctor
= copy_node (orig_ctor
);
3539 CONSTRUCTOR_ELTS (ctor
) = VEC_copy (constructor_elt
, gc
, elts
);
3540 elts
= CONSTRUCTOR_ELTS (ctor
);
3542 VEC_index (constructor_elt
, elts
, idx
)->value
= newval
;
3549 /* A subroutine of gimplify_modify_expr. Break out elements of a
3550 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
3552 Note that we still need to clear any elements that don't have explicit
3553 initializers, so if not all elements are initialized we keep the
3554 original MODIFY_EXPR, we just remove all of the constructor elements.
3556 If NOTIFY_TEMP_CREATION is true, do not gimplify, just return
3557 GS_ERROR if we would have to create a temporary when gimplifying
3558 this constructor. Otherwise, return GS_OK.
3560 If NOTIFY_TEMP_CREATION is false, just do the gimplification. */
3562 static enum gimplify_status
3563 gimplify_init_constructor (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
3564 bool want_value
, bool notify_temp_creation
)
3566 tree object
, new_ctor
;
3567 tree ctor
= TREE_OPERAND (*expr_p
, 1);
3568 tree type
= TREE_TYPE (ctor
);
3569 enum gimplify_status ret
;
3570 VEC(constructor_elt
,gc
) *elts
;
3572 if (TREE_CODE (ctor
) != CONSTRUCTOR
)
3573 return GS_UNHANDLED
;
3575 if (!notify_temp_creation
)
3577 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
3578 is_gimple_lvalue
, fb_lvalue
);
3579 if (ret
== GS_ERROR
)
3583 object
= TREE_OPERAND (*expr_p
, 0);
3584 new_ctor
= optimize_compound_literals_in_ctor (ctor
);
3585 elts
= CONSTRUCTOR_ELTS (new_ctor
);
3588 switch (TREE_CODE (type
))
3592 case QUAL_UNION_TYPE
:
3595 struct gimplify_init_ctor_preeval_data preeval_data
;
3596 HOST_WIDE_INT num_type_elements
, num_ctor_elements
;
3597 HOST_WIDE_INT num_nonzero_elements
;
3598 bool cleared
, valid_const_initializer
;
3600 /* Aggregate types must lower constructors to initialization of
3601 individual elements. The exception is that a CONSTRUCTOR node
3602 with no elements indicates zero-initialization of the whole. */
3603 if (VEC_empty (constructor_elt
, elts
))
3605 if (notify_temp_creation
)
3610 /* Fetch information about the constructor to direct later processing.
3611 We might want to make static versions of it in various cases, and
3612 can only do so if it known to be a valid constant initializer. */
3613 valid_const_initializer
3614 = categorize_ctor_elements (ctor
, &num_nonzero_elements
,
3615 &num_ctor_elements
, &cleared
);
3617 /* If a const aggregate variable is being initialized, then it
3618 should never be a lose to promote the variable to be static. */
3619 if (valid_const_initializer
3620 && num_nonzero_elements
> 1
3621 && TREE_READONLY (object
)
3622 && TREE_CODE (object
) == VAR_DECL
3623 && (flag_merge_constants
>= 2 || !TREE_ADDRESSABLE (object
)))
3625 if (notify_temp_creation
)
3627 DECL_INITIAL (object
) = ctor
;
3628 TREE_STATIC (object
) = 1;
3629 if (!DECL_NAME (object
))
3630 DECL_NAME (object
) = create_tmp_var_name ("C");
3631 walk_tree (&DECL_INITIAL (object
), force_labels_r
, NULL
, NULL
);
3633 /* ??? C++ doesn't automatically append a .<number> to the
3634 assembler name, and even when it does, it looks a FE private
3635 data structures to figure out what that number should be,
3636 which are not set for this variable. I suppose this is
3637 important for local statics for inline functions, which aren't
3638 "local" in the object file sense. So in order to get a unique
3639 TU-local symbol, we must invoke the lhd version now. */
3640 lhd_set_decl_assembler_name (object
);
3642 *expr_p
= NULL_TREE
;
3646 /* If there are "lots" of initialized elements, even discounting
3647 those that are not address constants (and thus *must* be
3648 computed at runtime), then partition the constructor into
3649 constant and non-constant parts. Block copy the constant
3650 parts in, then generate code for the non-constant parts. */
3651 /* TODO. There's code in cp/typeck.c to do this. */
3653 num_type_elements
= count_type_elements (type
, true);
3655 /* If count_type_elements could not determine number of type elements
3656 for a constant-sized object, assume clearing is needed.
3657 Don't do this for variable-sized objects, as store_constructor
3658 will ignore the clearing of variable-sized objects. */
3659 if (num_type_elements
< 0 && int_size_in_bytes (type
) >= 0)
3661 /* If there are "lots" of zeros, then block clear the object first. */
3662 else if (num_type_elements
- num_nonzero_elements
3663 > CLEAR_RATIO (optimize_function_for_speed_p (cfun
))
3664 && num_nonzero_elements
< num_type_elements
/4)
3666 /* ??? This bit ought not be needed. For any element not present
3667 in the initializer, we should simply set them to zero. Except
3668 we'd need to *find* the elements that are not present, and that
3669 requires trickery to avoid quadratic compile-time behavior in
3670 large cases or excessive memory use in small cases. */
3671 else if (num_ctor_elements
< num_type_elements
)
3674 /* If there are "lots" of initialized elements, and all of them
3675 are valid address constants, then the entire initializer can
3676 be dropped to memory, and then memcpy'd out. Don't do this
3677 for sparse arrays, though, as it's more efficient to follow
3678 the standard CONSTRUCTOR behavior of memset followed by
3679 individual element initialization. Also don't do this for small
3680 all-zero initializers (which aren't big enough to merit
3681 clearing), and don't try to make bitwise copies of
3682 TREE_ADDRESSABLE types. */
3683 if (valid_const_initializer
3684 && !(cleared
|| num_nonzero_elements
== 0)
3685 && !TREE_ADDRESSABLE (type
))
3687 HOST_WIDE_INT size
= int_size_in_bytes (type
);
3690 /* ??? We can still get unbounded array types, at least
3691 from the C++ front end. This seems wrong, but attempt
3692 to work around it for now. */
3695 size
= int_size_in_bytes (TREE_TYPE (object
));
3697 TREE_TYPE (ctor
) = type
= TREE_TYPE (object
);
3700 /* Find the maximum alignment we can assume for the object. */
3701 /* ??? Make use of DECL_OFFSET_ALIGN. */
3702 if (DECL_P (object
))
3703 align
= DECL_ALIGN (object
);
3705 align
= TYPE_ALIGN (type
);
3708 && num_nonzero_elements
> 1
3709 && !can_move_by_pieces (size
, align
))
3713 if (notify_temp_creation
)
3716 new_tree
= create_tmp_var_raw (type
, "C");
3718 gimple_add_tmp_var (new_tree
);
3719 TREE_STATIC (new_tree
) = 1;
3720 TREE_READONLY (new_tree
) = 1;
3721 DECL_INITIAL (new_tree
) = ctor
;
3722 if (align
> DECL_ALIGN (new_tree
))
3724 DECL_ALIGN (new_tree
) = align
;
3725 DECL_USER_ALIGN (new_tree
) = 1;
3727 walk_tree (&DECL_INITIAL (new_tree
), force_labels_r
, NULL
, NULL
);
3729 TREE_OPERAND (*expr_p
, 1) = new_tree
;
3731 /* This is no longer an assignment of a CONSTRUCTOR, but
3732 we still may have processing to do on the LHS. So
3733 pretend we didn't do anything here to let that happen. */
3734 return GS_UNHANDLED
;
3738 if (notify_temp_creation
)
3741 /* If there are nonzero elements, pre-evaluate to capture elements
3742 overlapping with the lhs into temporaries. We must do this before
3743 clearing to fetch the values before they are zeroed-out. */
3744 if (num_nonzero_elements
> 0)
3746 preeval_data
.lhs_base_decl
= get_base_address (object
);
3747 if (!DECL_P (preeval_data
.lhs_base_decl
))
3748 preeval_data
.lhs_base_decl
= NULL
;
3749 preeval_data
.lhs_alias_set
= get_alias_set (object
);
3751 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p
, 1),
3752 pre_p
, post_p
, &preeval_data
);
3757 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3758 Note that we still have to gimplify, in order to handle the
3759 case of variable sized types. Avoid shared tree structures. */
3760 CONSTRUCTOR_ELTS (ctor
) = NULL
;
3761 TREE_SIDE_EFFECTS (ctor
) = 0;
3762 object
= unshare_expr (object
);
3763 gimplify_stmt (expr_p
, pre_p
);
3766 /* If we have not block cleared the object, or if there are nonzero
3767 elements in the constructor, add assignments to the individual
3768 scalar fields of the object. */
3769 if (!cleared
|| num_nonzero_elements
> 0)
3770 gimplify_init_ctor_eval (object
, elts
, pre_p
, cleared
);
3772 *expr_p
= NULL_TREE
;
3780 if (notify_temp_creation
)
3783 /* Extract the real and imaginary parts out of the ctor. */
3784 gcc_assert (VEC_length (constructor_elt
, elts
) == 2);
3785 r
= VEC_index (constructor_elt
, elts
, 0)->value
;
3786 i
= VEC_index (constructor_elt
, elts
, 1)->value
;
3787 if (r
== NULL
|| i
== NULL
)
3789 tree zero
= fold_convert (TREE_TYPE (type
), integer_zero_node
);
3796 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3797 represent creation of a complex value. */
3798 if (TREE_CONSTANT (r
) && TREE_CONSTANT (i
))
3800 ctor
= build_complex (type
, r
, i
);
3801 TREE_OPERAND (*expr_p
, 1) = ctor
;
3805 ctor
= build2 (COMPLEX_EXPR
, type
, r
, i
);
3806 TREE_OPERAND (*expr_p
, 1) = ctor
;
3807 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1),
3810 rhs_predicate_for (TREE_OPERAND (*expr_p
, 0)),
3818 unsigned HOST_WIDE_INT ix
;
3819 constructor_elt
*ce
;
3821 if (notify_temp_creation
)
3824 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3825 if (TREE_CONSTANT (ctor
))
3827 bool constant_p
= true;
3830 /* Even when ctor is constant, it might contain non-*_CST
3831 elements, such as addresses or trapping values like
3832 1.0/0.0 - 1.0/0.0. Such expressions don't belong
3833 in VECTOR_CST nodes. */
3834 FOR_EACH_CONSTRUCTOR_VALUE (elts
, ix
, value
)
3835 if (!CONSTANT_CLASS_P (value
))
3843 TREE_OPERAND (*expr_p
, 1) = build_vector_from_ctor (type
, elts
);
3847 /* Don't reduce an initializer constant even if we can't
3848 make a VECTOR_CST. It won't do anything for us, and it'll
3849 prevent us from representing it as a single constant. */
3850 if (initializer_constant_valid_p (ctor
, type
))
3853 TREE_CONSTANT (ctor
) = 0;
3856 /* Vector types use CONSTRUCTOR all the way through gimple
3857 compilation as a general initializer. */
3858 for (ix
= 0; VEC_iterate (constructor_elt
, elts
, ix
, ce
); ix
++)
3860 enum gimplify_status tret
;
3861 tret
= gimplify_expr (&ce
->value
, pre_p
, post_p
, is_gimple_val
,
3863 if (tret
== GS_ERROR
)
3866 if (!is_gimple_reg (TREE_OPERAND (*expr_p
, 0)))
3867 TREE_OPERAND (*expr_p
, 1) = get_formal_tmp_var (ctor
, pre_p
);
3872 /* So how did we get a CONSTRUCTOR for a scalar type? */
3876 if (ret
== GS_ERROR
)
3878 else if (want_value
)
3885 /* If we have gimplified both sides of the initializer but have
3886 not emitted an assignment, do so now. */
3889 tree lhs
= TREE_OPERAND (*expr_p
, 0);
3890 tree rhs
= TREE_OPERAND (*expr_p
, 1);
3891 gimple init
= gimple_build_assign (lhs
, rhs
);
3892 gimplify_seq_add_stmt (pre_p
, init
);
3900 /* Given a pointer value OP0, return a simplified version of an
3901 indirection through OP0, or NULL_TREE if no simplification is
3902 possible. Note that the resulting type may be different from
3903 the type pointed to in the sense that it is still compatible
3904 from the langhooks point of view. */
3907 gimple_fold_indirect_ref (tree t
)
3909 tree type
= TREE_TYPE (TREE_TYPE (t
));
3913 STRIP_USELESS_TYPE_CONVERSION (sub
);
3914 subtype
= TREE_TYPE (sub
);
3915 if (!POINTER_TYPE_P (subtype
))
3918 if (TREE_CODE (sub
) == ADDR_EXPR
)
3920 tree op
= TREE_OPERAND (sub
, 0);
3921 tree optype
= TREE_TYPE (op
);
3923 if (useless_type_conversion_p (type
, optype
))
3926 /* *(foo *)&fooarray => fooarray[0] */
3927 if (TREE_CODE (optype
) == ARRAY_TYPE
3928 && useless_type_conversion_p (type
, TREE_TYPE (optype
)))
3930 tree type_domain
= TYPE_DOMAIN (optype
);
3931 tree min_val
= size_zero_node
;
3932 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
3933 min_val
= TYPE_MIN_VALUE (type_domain
);
3934 return build4 (ARRAY_REF
, type
, op
, min_val
, NULL_TREE
, NULL_TREE
);
3938 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
3939 if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
3940 && useless_type_conversion_p (type
, TREE_TYPE (TREE_TYPE (subtype
))))
3943 tree min_val
= size_zero_node
;
3945 sub
= gimple_fold_indirect_ref (sub
);
3947 sub
= build1 (INDIRECT_REF
, TREE_TYPE (subtype
), osub
);
3948 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
3949 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
3950 min_val
= TYPE_MIN_VALUE (type_domain
);
3951 return build4 (ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
, NULL_TREE
);
3957 /* Given a pointer value OP0, return a simplified version of an
3958 indirection through OP0, or NULL_TREE if no simplification is
3959 possible. This may only be applied to a rhs of an expression.
3960 Note that the resulting type may be different from the type pointed
3961 to in the sense that it is still compatible from the langhooks
3965 gimple_fold_indirect_ref_rhs (tree t
)
3967 return gimple_fold_indirect_ref (t
);
3970 /* Subroutine of gimplify_modify_expr to do simplifications of
3971 MODIFY_EXPRs based on the code of the RHS. We loop for as long as
3972 something changes. */
3974 static enum gimplify_status
3975 gimplify_modify_expr_rhs (tree
*expr_p
, tree
*from_p
, tree
*to_p
,
3976 gimple_seq
*pre_p
, gimple_seq
*post_p
,
3979 enum gimplify_status ret
= GS_OK
;
3981 while (ret
!= GS_UNHANDLED
)
3982 switch (TREE_CODE (*from_p
))
3985 /* If we're assigning from a read-only variable initialized with
3986 a constructor, do the direct assignment from the constructor,
3987 but only if neither source nor target are volatile since this
3988 latter assignment might end up being done on a per-field basis. */
3989 if (DECL_INITIAL (*from_p
)
3990 && TREE_READONLY (*from_p
)
3991 && !TREE_THIS_VOLATILE (*from_p
)
3992 && !TREE_THIS_VOLATILE (*to_p
)
3993 && TREE_CODE (DECL_INITIAL (*from_p
)) == CONSTRUCTOR
)
3995 tree old_from
= *from_p
;
3997 /* Move the constructor into the RHS. */
3998 *from_p
= unshare_expr (DECL_INITIAL (*from_p
));
4000 /* Let's see if gimplify_init_constructor will need to put
4001 it in memory. If so, revert the change. */
4002 ret
= gimplify_init_constructor (expr_p
, NULL
, NULL
, false, true);
4003 if (ret
== GS_ERROR
)
4018 /* If we have code like
4022 where the type of "x" is a (possibly cv-qualified variant
4023 of "A"), treat the entire expression as identical to "x".
4024 This kind of code arises in C++ when an object is bound
4025 to a const reference, and if "x" is a TARGET_EXPR we want
4026 to take advantage of the optimization below. */
4027 tree t
= gimple_fold_indirect_ref_rhs (TREE_OPERAND (*from_p
, 0));
4040 /* If we are initializing something from a TARGET_EXPR, strip the
4041 TARGET_EXPR and initialize it directly, if possible. This can't
4042 be done if the initializer is void, since that implies that the
4043 temporary is set in some non-trivial way.
4045 ??? What about code that pulls out the temp and uses it
4046 elsewhere? I think that such code never uses the TARGET_EXPR as
4047 an initializer. If I'm wrong, we'll die because the temp won't
4048 have any RTL. In that case, I guess we'll need to replace
4049 references somehow. */
4050 tree init
= TARGET_EXPR_INITIAL (*from_p
);
4053 && !VOID_TYPE_P (TREE_TYPE (init
)))
4064 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
4066 gimplify_compound_expr (from_p
, pre_p
, true);
4071 /* If we're initializing from a CONSTRUCTOR, break this into
4072 individual MODIFY_EXPRs. */
4073 return gimplify_init_constructor (expr_p
, pre_p
, post_p
, want_value
,
4077 /* If we're assigning to a non-register type, push the assignment
4078 down into the branches. This is mandatory for ADDRESSABLE types,
4079 since we cannot generate temporaries for such, but it saves a
4080 copy in other cases as well. */
4081 if (!is_gimple_reg_type (TREE_TYPE (*from_p
)))
4083 /* This code should mirror the code in gimplify_cond_expr. */
4084 enum tree_code code
= TREE_CODE (*expr_p
);
4085 tree cond
= *from_p
;
4086 tree result
= *to_p
;
4088 ret
= gimplify_expr (&result
, pre_p
, post_p
,
4089 is_gimple_lvalue
, fb_lvalue
);
4090 if (ret
!= GS_ERROR
)
4093 if (TREE_TYPE (TREE_OPERAND (cond
, 1)) != void_type_node
)
4094 TREE_OPERAND (cond
, 1)
4095 = build2 (code
, void_type_node
, result
,
4096 TREE_OPERAND (cond
, 1));
4097 if (TREE_TYPE (TREE_OPERAND (cond
, 2)) != void_type_node
)
4098 TREE_OPERAND (cond
, 2)
4099 = build2 (code
, void_type_node
, unshare_expr (result
),
4100 TREE_OPERAND (cond
, 2));
4102 TREE_TYPE (cond
) = void_type_node
;
4103 recalculate_side_effects (cond
);
4107 gimplify_and_add (cond
, pre_p
);
4108 *expr_p
= unshare_expr (result
);
4119 /* For calls that return in memory, give *to_p as the CALL_EXPR's
4120 return slot so that we don't generate a temporary. */
4121 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p
)
4122 && aggregate_value_p (*from_p
, *from_p
))
4126 if (!(rhs_predicate_for (*to_p
))(*from_p
))
4127 /* If we need a temporary, *to_p isn't accurate. */
4129 else if (TREE_CODE (*to_p
) == RESULT_DECL
4130 && DECL_NAME (*to_p
) == NULL_TREE
4131 && needs_to_live_in_memory (*to_p
))
4132 /* It's OK to use the return slot directly unless it's an NRV. */
4134 else if (is_gimple_reg_type (TREE_TYPE (*to_p
))
4135 || (DECL_P (*to_p
) && DECL_REGISTER (*to_p
)))
4136 /* Don't force regs into memory. */
4138 else if (TREE_CODE (*expr_p
) == INIT_EXPR
)
4139 /* It's OK to use the target directly if it's being
4142 else if (!is_gimple_non_addressable (*to_p
))
4143 /* Don't use the original target if it's already addressable;
4144 if its address escapes, and the called function uses the
4145 NRV optimization, a conforming program could see *to_p
4146 change before the called function returns; see c++/19317.
4147 When optimizing, the return_slot pass marks more functions
4148 as safe after we have escape info. */
4155 CALL_EXPR_RETURN_SLOT_OPT (*from_p
) = 1;
4156 mark_addressable (*to_p
);
4163 /* If we're initializing from a container, push the initialization
4165 case CLEANUP_POINT_EXPR
:
4167 case STATEMENT_LIST
:
4169 tree wrap
= *from_p
;
4172 ret
= gimplify_expr (to_p
, pre_p
, post_p
, is_gimple_min_lval
,
4174 if (ret
!= GS_ERROR
)
4177 t
= voidify_wrapper_expr (wrap
, *expr_p
);
4178 gcc_assert (t
== *expr_p
);
4182 gimplify_and_add (wrap
, pre_p
);
4183 *expr_p
= unshare_expr (*to_p
);
4190 case COMPOUND_LITERAL_EXPR
:
4192 tree complit
= TREE_OPERAND (*expr_p
, 1);
4193 tree decl_s
= COMPOUND_LITERAL_EXPR_DECL_EXPR (complit
);
4194 tree decl
= DECL_EXPR_DECL (decl_s
);
4195 tree init
= DECL_INITIAL (decl
);
4197 /* struct T x = (struct T) { 0, 1, 2 } can be optimized
4198 into struct T x = { 0, 1, 2 } if the address of the
4199 compound literal has never been taken. */
4200 if (!TREE_ADDRESSABLE (complit
)
4201 && !TREE_ADDRESSABLE (decl
)
4204 *expr_p
= copy_node (*expr_p
);
4205 TREE_OPERAND (*expr_p
, 1) = init
;
4219 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
4220 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
4221 DECL_GIMPLE_REG_P set.
4223 IMPORTANT NOTE: This promotion is performed by introducing a load of the
4224 other, unmodified part of the complex object just before the total store.
4225 As a consequence, if the object is still uninitialized, an undefined value
4226 will be loaded into a register, which may result in a spurious exception
4227 if the register is floating-point and the value happens to be a signaling
4228 NaN for example. Then the fully-fledged complex operations lowering pass
4229 followed by a DCE pass are necessary in order to fix things up. */
4231 static enum gimplify_status
4232 gimplify_modify_expr_complex_part (tree
*expr_p
, gimple_seq
*pre_p
,
4235 enum tree_code code
, ocode
;
4236 tree lhs
, rhs
, new_rhs
, other
, realpart
, imagpart
;
4238 lhs
= TREE_OPERAND (*expr_p
, 0);
4239 rhs
= TREE_OPERAND (*expr_p
, 1);
4240 code
= TREE_CODE (lhs
);
4241 lhs
= TREE_OPERAND (lhs
, 0);
4243 ocode
= code
== REALPART_EXPR
? IMAGPART_EXPR
: REALPART_EXPR
;
4244 other
= build1 (ocode
, TREE_TYPE (rhs
), lhs
);
4245 other
= get_formal_tmp_var (other
, pre_p
);
4247 realpart
= code
== REALPART_EXPR
? rhs
: other
;
4248 imagpart
= code
== REALPART_EXPR
? other
: rhs
;
4250 if (TREE_CONSTANT (realpart
) && TREE_CONSTANT (imagpart
))
4251 new_rhs
= build_complex (TREE_TYPE (lhs
), realpart
, imagpart
);
4253 new_rhs
= build2 (COMPLEX_EXPR
, TREE_TYPE (lhs
), realpart
, imagpart
);
4255 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (lhs
, new_rhs
));
4256 *expr_p
= (want_value
) ? rhs
: NULL_TREE
;
4262 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
4268 PRE_P points to the list where side effects that must happen before
4269 *EXPR_P should be stored.
4271 POST_P points to the list where side effects that must happen after
4272 *EXPR_P should be stored.
4274 WANT_VALUE is nonzero iff we want to use the value of this expression
4275 in another expression. */
4277 static enum gimplify_status
4278 gimplify_modify_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
4281 tree
*from_p
= &TREE_OPERAND (*expr_p
, 1);
4282 tree
*to_p
= &TREE_OPERAND (*expr_p
, 0);
4283 enum gimplify_status ret
= GS_UNHANDLED
;
4286 gcc_assert (TREE_CODE (*expr_p
) == MODIFY_EXPR
4287 || TREE_CODE (*expr_p
) == INIT_EXPR
);
4289 /* Insert pointer conversions required by the middle-end that are not
4290 required by the frontend. This fixes middle-end type checking for
4291 for example gcc.dg/redecl-6.c. */
4292 if (POINTER_TYPE_P (TREE_TYPE (*to_p
))
4293 && lang_hooks
.types_compatible_p (TREE_TYPE (*to_p
), TREE_TYPE (*from_p
)))
4295 STRIP_USELESS_TYPE_CONVERSION (*from_p
);
4296 if (!useless_type_conversion_p (TREE_TYPE (*to_p
), TREE_TYPE (*from_p
)))
4297 *from_p
= fold_convert (TREE_TYPE (*to_p
), *from_p
);
4300 /* See if any simplifications can be done based on what the RHS is. */
4301 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
4303 if (ret
!= GS_UNHANDLED
)
4306 /* For zero sized types only gimplify the left hand side and right hand
4307 side as statements and throw away the assignment. Do this after
4308 gimplify_modify_expr_rhs so we handle TARGET_EXPRs of addressable
4310 if (zero_sized_type (TREE_TYPE (*from_p
)) && !want_value
)
4312 gimplify_stmt (from_p
, pre_p
);
4313 gimplify_stmt (to_p
, pre_p
);
4314 *expr_p
= NULL_TREE
;
4318 /* If the value being copied is of variable width, compute the length
4319 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
4320 before gimplifying any of the operands so that we can resolve any
4321 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
4322 the size of the expression to be copied, not of the destination, so
4323 that is what we must do here. */
4324 maybe_with_size_expr (from_p
);
4326 ret
= gimplify_expr (to_p
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
4327 if (ret
== GS_ERROR
)
4330 /* As a special case, we have to temporarily allow for assignments
4331 with a CALL_EXPR on the RHS. Since in GIMPLE a function call is
4332 a toplevel statement, when gimplifying the GENERIC expression
4333 MODIFY_EXPR <a, CALL_EXPR <foo>>, we cannot create the tuple
4334 GIMPLE_ASSIGN <a, GIMPLE_CALL <foo>>.
4336 Instead, we need to create the tuple GIMPLE_CALL <a, foo>. To
4337 prevent gimplify_expr from trying to create a new temporary for
4338 foo's LHS, we tell it that it should only gimplify until it
4339 reaches the CALL_EXPR. On return from gimplify_expr, the newly
4340 created GIMPLE_CALL <foo> will be the last statement in *PRE_P
4341 and all we need to do here is set 'a' to be its LHS. */
4342 ret
= gimplify_expr (from_p
, pre_p
, post_p
, rhs_predicate_for (*to_p
),
4344 if (ret
== GS_ERROR
)
4347 /* Now see if the above changed *from_p to something we handle specially. */
4348 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
4350 if (ret
!= GS_UNHANDLED
)
4353 /* If we've got a variable sized assignment between two lvalues (i.e. does
4354 not involve a call), then we can make things a bit more straightforward
4355 by converting the assignment to memcpy or memset. */
4356 if (TREE_CODE (*from_p
) == WITH_SIZE_EXPR
)
4358 tree from
= TREE_OPERAND (*from_p
, 0);
4359 tree size
= TREE_OPERAND (*from_p
, 1);
4361 if (TREE_CODE (from
) == CONSTRUCTOR
)
4362 return gimplify_modify_expr_to_memset (expr_p
, size
, want_value
, pre_p
);
4364 if (is_gimple_addressable (from
))
4367 return gimplify_modify_expr_to_memcpy (expr_p
, size
, want_value
,
4372 /* Transform partial stores to non-addressable complex variables into
4373 total stores. This allows us to use real instead of virtual operands
4374 for these variables, which improves optimization. */
4375 if ((TREE_CODE (*to_p
) == REALPART_EXPR
4376 || TREE_CODE (*to_p
) == IMAGPART_EXPR
)
4377 && is_gimple_reg (TREE_OPERAND (*to_p
, 0)))
4378 return gimplify_modify_expr_complex_part (expr_p
, pre_p
, want_value
);
4380 /* Try to alleviate the effects of the gimplification creating artificial
4381 temporaries (see for example is_gimple_reg_rhs) on the debug info. */
4382 if (!gimplify_ctxp
->into_ssa
4384 && DECL_IGNORED_P (*from_p
)
4386 && !DECL_IGNORED_P (*to_p
))
4388 if (!DECL_NAME (*from_p
) && DECL_NAME (*to_p
))
4390 = create_tmp_var_name (IDENTIFIER_POINTER (DECL_NAME (*to_p
)));
4391 DECL_DEBUG_EXPR_IS_FROM (*from_p
) = 1;
4392 SET_DECL_DEBUG_EXPR (*from_p
, *to_p
);
4395 if (TREE_CODE (*from_p
) == CALL_EXPR
)
4397 /* Since the RHS is a CALL_EXPR, we need to create a GIMPLE_CALL
4398 instead of a GIMPLE_ASSIGN. */
4399 assign
= gimple_build_call_from_tree (*from_p
);
4400 gimple_call_set_lhs (assign
, *to_p
);
4403 assign
= gimple_build_assign (*to_p
, *from_p
);
4405 gimplify_seq_add_stmt (pre_p
, assign
);
4407 if (gimplify_ctxp
->into_ssa
&& is_gimple_reg (*to_p
))
4409 /* If we've somehow already got an SSA_NAME on the LHS, then
4410 we've probably modified it twice. Not good. */
4411 gcc_assert (TREE_CODE (*to_p
) != SSA_NAME
);
4412 *to_p
= make_ssa_name (*to_p
, assign
);
4413 gimple_set_lhs (assign
, *to_p
);
4418 *expr_p
= unshare_expr (*to_p
);
4427 /* Gimplify a comparison between two variable-sized objects. Do this
4428 with a call to BUILT_IN_MEMCMP. */
4430 static enum gimplify_status
4431 gimplify_variable_sized_compare (tree
*expr_p
)
4433 tree op0
= TREE_OPERAND (*expr_p
, 0);
4434 tree op1
= TREE_OPERAND (*expr_p
, 1);
4435 tree t
, arg
, dest
, src
;
4437 arg
= TYPE_SIZE_UNIT (TREE_TYPE (op0
));
4438 arg
= unshare_expr (arg
);
4439 arg
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (arg
, op0
);
4440 src
= build_fold_addr_expr (op1
);
4441 dest
= build_fold_addr_expr (op0
);
4442 t
= implicit_built_in_decls
[BUILT_IN_MEMCMP
];
4443 t
= build_call_expr (t
, 3, dest
, src
, arg
);
4445 = build2 (TREE_CODE (*expr_p
), TREE_TYPE (*expr_p
), t
, integer_zero_node
);
4450 /* Gimplify a comparison between two aggregate objects of integral scalar
4451 mode as a comparison between the bitwise equivalent scalar values. */
4453 static enum gimplify_status
4454 gimplify_scalar_mode_aggregate_compare (tree
*expr_p
)
4456 tree op0
= TREE_OPERAND (*expr_p
, 0);
4457 tree op1
= TREE_OPERAND (*expr_p
, 1);
4459 tree type
= TREE_TYPE (op0
);
4460 tree scalar_type
= lang_hooks
.types
.type_for_mode (TYPE_MODE (type
), 1);
4462 op0
= fold_build1 (VIEW_CONVERT_EXPR
, scalar_type
, op0
);
4463 op1
= fold_build1 (VIEW_CONVERT_EXPR
, scalar_type
, op1
);
4466 = fold_build2 (TREE_CODE (*expr_p
), TREE_TYPE (*expr_p
), op0
, op1
);
4471 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
4472 points to the expression to gimplify.
4474 Expressions of the form 'a && b' are gimplified to:
4476 a && b ? true : false
4478 LOCUS is the source location to be put on the generated COND_EXPR.
4479 gimplify_cond_expr will do the rest. */
4481 static enum gimplify_status
4482 gimplify_boolean_expr (tree
*expr_p
, location_t locus
)
4484 /* Preserve the original type of the expression. */
4485 tree type
= TREE_TYPE (*expr_p
);
4487 *expr_p
= build3 (COND_EXPR
, type
, *expr_p
,
4488 fold_convert (type
, boolean_true_node
),
4489 fold_convert (type
, boolean_false_node
));
4491 SET_EXPR_LOCATION (*expr_p
, locus
);
4496 /* Gimplifies an expression sequence. This function gimplifies each
4497 expression and re-writes the original expression with the last
4498 expression of the sequence in GIMPLE form.
4500 PRE_P points to the list where the side effects for all the
4501 expressions in the sequence will be emitted.
4503 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
4505 static enum gimplify_status
4506 gimplify_compound_expr (tree
*expr_p
, gimple_seq
*pre_p
, bool want_value
)
4512 tree
*sub_p
= &TREE_OPERAND (t
, 0);
4514 if (TREE_CODE (*sub_p
) == COMPOUND_EXPR
)
4515 gimplify_compound_expr (sub_p
, pre_p
, false);
4517 gimplify_stmt (sub_p
, pre_p
);
4519 t
= TREE_OPERAND (t
, 1);
4521 while (TREE_CODE (t
) == COMPOUND_EXPR
);
4528 gimplify_stmt (expr_p
, pre_p
);
4534 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
4535 gimplify. After gimplification, EXPR_P will point to a new temporary
4536 that holds the original value of the SAVE_EXPR node.
4538 PRE_P points to the list where side effects that must happen before
4539 *EXPR_P should be stored. */
4541 static enum gimplify_status
4542 gimplify_save_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
4544 enum gimplify_status ret
= GS_ALL_DONE
;
4547 gcc_assert (TREE_CODE (*expr_p
) == SAVE_EXPR
);
4548 val
= TREE_OPERAND (*expr_p
, 0);
4550 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
4551 if (!SAVE_EXPR_RESOLVED_P (*expr_p
))
4553 /* The operand may be a void-valued expression such as SAVE_EXPRs
4554 generated by the Java frontend for class initialization. It is
4555 being executed only for its side-effects. */
4556 if (TREE_TYPE (val
) == void_type_node
)
4558 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
4559 is_gimple_stmt
, fb_none
);
4563 val
= get_initialized_tmp_var (val
, pre_p
, post_p
);
4565 TREE_OPERAND (*expr_p
, 0) = val
;
4566 SAVE_EXPR_RESOLVED_P (*expr_p
) = 1;
4574 /* Re-write the ADDR_EXPR node pointed to by EXPR_P
4581 PRE_P points to the list where side effects that must happen before
4582 *EXPR_P should be stored.
4584 POST_P points to the list where side effects that must happen after
4585 *EXPR_P should be stored. */
4587 static enum gimplify_status
4588 gimplify_addr_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
4590 tree expr
= *expr_p
;
4591 tree op0
= TREE_OPERAND (expr
, 0);
4592 enum gimplify_status ret
;
4594 switch (TREE_CODE (op0
))
4597 case MISALIGNED_INDIRECT_REF
:
4599 /* Check if we are dealing with an expression of the form '&*ptr'.
4600 While the front end folds away '&*ptr' into 'ptr', these
4601 expressions may be generated internally by the compiler (e.g.,
4602 builtins like __builtin_va_end). */
4603 /* Caution: the silent array decomposition semantics we allow for
4604 ADDR_EXPR means we can't always discard the pair. */
4605 /* Gimplification of the ADDR_EXPR operand may drop
4606 cv-qualification conversions, so make sure we add them if
4609 tree op00
= TREE_OPERAND (op0
, 0);
4610 tree t_expr
= TREE_TYPE (expr
);
4611 tree t_op00
= TREE_TYPE (op00
);
4613 if (!useless_type_conversion_p (t_expr
, t_op00
))
4614 op00
= fold_convert (TREE_TYPE (expr
), op00
);
4620 case VIEW_CONVERT_EXPR
:
4621 /* Take the address of our operand and then convert it to the type of
4624 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
4625 all clear. The impact of this transformation is even less clear. */
4627 /* If the operand is a useless conversion, look through it. Doing so
4628 guarantees that the ADDR_EXPR and its operand will remain of the
4630 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0
, 0)))
4631 op0
= TREE_OPERAND (op0
, 0);
4633 *expr_p
= fold_convert (TREE_TYPE (expr
),
4634 build_fold_addr_expr (TREE_OPERAND (op0
, 0)));
4639 /* We use fb_either here because the C frontend sometimes takes
4640 the address of a call that returns a struct; see
4641 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
4642 the implied temporary explicit. */
4644 /* Mark the RHS addressable. */
4645 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, post_p
,
4646 is_gimple_addressable
, fb_either
);
4647 if (ret
== GS_ERROR
)
4650 /* We cannot rely on making the RHS addressable if it is
4651 a temporary created by gimplification. In this case create a
4652 new temporary that is initialized by a copy (which will
4653 become a store after we mark it addressable).
4654 This mostly happens if the frontend passed us something that
4655 it could not mark addressable yet, like a fortran
4656 pass-by-reference parameter (int) floatvar. */
4657 if (is_gimple_reg (TREE_OPERAND (expr
, 0)))
4658 TREE_OPERAND (expr
, 0)
4659 = get_initialized_tmp_var (TREE_OPERAND (expr
, 0), pre_p
, post_p
);
4661 op0
= TREE_OPERAND (expr
, 0);
4663 /* For various reasons, the gimplification of the expression
4664 may have made a new INDIRECT_REF. */
4665 if (TREE_CODE (op0
) == INDIRECT_REF
)
4666 goto do_indirect_ref
;
4668 /* Make sure TREE_CONSTANT and TREE_SIDE_EFFECTS are set properly. */
4669 recompute_tree_invariant_for_addr_expr (expr
);
4671 mark_addressable (TREE_OPERAND (expr
, 0));
4678 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
4679 value; output operands should be a gimple lvalue. */
4681 static enum gimplify_status
4682 gimplify_asm_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
4686 const char **oconstraints
;
4689 const char *constraint
;
4690 bool allows_mem
, allows_reg
, is_inout
;
4691 enum gimplify_status ret
, tret
;
4693 VEC(tree
, gc
) *inputs
;
4694 VEC(tree
, gc
) *outputs
;
4695 VEC(tree
, gc
) *clobbers
;
4699 noutputs
= list_length (ASM_OUTPUTS (expr
));
4700 oconstraints
= (const char **) alloca ((noutputs
) * sizeof (const char *));
4702 inputs
= outputs
= clobbers
= NULL
;
4705 link_next
= NULL_TREE
;
4706 for (i
= 0, link
= ASM_OUTPUTS (expr
); link
; ++i
, link
= link_next
)
4709 size_t constraint_len
;
4711 link_next
= TREE_CHAIN (link
);
4715 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
4716 constraint_len
= strlen (constraint
);
4717 if (constraint_len
== 0)
4720 ok
= parse_output_constraint (&constraint
, i
, 0, 0,
4721 &allows_mem
, &allows_reg
, &is_inout
);
4728 if (!allows_reg
&& allows_mem
)
4729 mark_addressable (TREE_VALUE (link
));
4731 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
4732 is_inout
? is_gimple_min_lval
: is_gimple_lvalue
,
4733 fb_lvalue
| fb_mayfail
);
4734 if (tret
== GS_ERROR
)
4736 error ("invalid lvalue in asm output %d", i
);
4740 VEC_safe_push (tree
, gc
, outputs
, link
);
4741 TREE_CHAIN (link
) = NULL_TREE
;
4745 /* An input/output operand. To give the optimizers more
4746 flexibility, split it into separate input and output
4751 /* Turn the in/out constraint into an output constraint. */
4752 char *p
= xstrdup (constraint
);
4754 TREE_VALUE (TREE_PURPOSE (link
)) = build_string (constraint_len
, p
);
4756 /* And add a matching input constraint. */
4759 sprintf (buf
, "%d", i
);
4761 /* If there are multiple alternatives in the constraint,
4762 handle each of them individually. Those that allow register
4763 will be replaced with operand number, the others will stay
4765 if (strchr (p
, ',') != NULL
)
4767 size_t len
= 0, buflen
= strlen (buf
);
4768 char *beg
, *end
, *str
, *dst
;
4772 end
= strchr (beg
, ',');
4774 end
= strchr (beg
, '\0');
4775 if ((size_t) (end
- beg
) < buflen
)
4778 len
+= end
- beg
+ 1;
4785 str
= (char *) alloca (len
);
4786 for (beg
= p
+ 1, dst
= str
;;)
4789 bool mem_p
, reg_p
, inout_p
;
4791 end
= strchr (beg
, ',');
4796 parse_output_constraint (&tem
, i
, 0, 0,
4797 &mem_p
, ®_p
, &inout_p
);
4802 memcpy (dst
, buf
, buflen
);
4811 memcpy (dst
, beg
, len
);
4820 input
= build_string (dst
- str
, str
);
4823 input
= build_string (strlen (buf
), buf
);
4826 input
= build_string (constraint_len
- 1, constraint
+ 1);
4830 input
= build_tree_list (build_tree_list (NULL_TREE
, input
),
4831 unshare_expr (TREE_VALUE (link
)));
4832 ASM_INPUTS (expr
) = chainon (ASM_INPUTS (expr
), input
);
4836 link_next
= NULL_TREE
;
4837 for (link
= ASM_INPUTS (expr
); link
; ++i
, link
= link_next
)
4839 link_next
= TREE_CHAIN (link
);
4840 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
4841 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
4842 oconstraints
, &allows_mem
, &allows_reg
);
4844 /* If we can't make copies, we can only accept memory. */
4845 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (link
))))
4851 error ("impossible constraint in %<asm%>");
4852 error ("non-memory input %d must stay in memory", i
);
4857 /* If the operand is a memory input, it should be an lvalue. */
4858 if (!allows_reg
&& allows_mem
)
4860 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
4861 is_gimple_lvalue
, fb_lvalue
| fb_mayfail
);
4862 mark_addressable (TREE_VALUE (link
));
4863 if (tret
== GS_ERROR
)
4865 if (EXPR_HAS_LOCATION (TREE_VALUE (link
)))
4866 input_location
= EXPR_LOCATION (TREE_VALUE (link
));
4867 error ("memory input %d is not directly addressable", i
);
4873 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
4874 is_gimple_asm_val
, fb_rvalue
);
4875 if (tret
== GS_ERROR
)
4879 TREE_CHAIN (link
) = NULL_TREE
;
4880 VEC_safe_push (tree
, gc
, inputs
, link
);
4883 for (link
= ASM_CLOBBERS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
4884 VEC_safe_push (tree
, gc
, clobbers
, link
);
4886 stmt
= gimple_build_asm_vec (TREE_STRING_POINTER (ASM_STRING (expr
)),
4887 inputs
, outputs
, clobbers
);
4889 gimple_asm_set_volatile (stmt
, ASM_VOLATILE_P (expr
));
4890 gimple_asm_set_input (stmt
, ASM_INPUT_P (expr
));
4892 gimplify_seq_add_stmt (pre_p
, stmt
);
4897 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
4898 GIMPLE_WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
4899 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
4900 return to this function.
4902 FIXME should we complexify the prequeue handling instead? Or use flags
4903 for all the cleanups and let the optimizer tighten them up? The current
4904 code seems pretty fragile; it will break on a cleanup within any
4905 non-conditional nesting. But any such nesting would be broken, anyway;
4906 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
4907 and continues out of it. We can do that at the RTL level, though, so
4908 having an optimizer to tighten up try/finally regions would be a Good
4911 static enum gimplify_status
4912 gimplify_cleanup_point_expr (tree
*expr_p
, gimple_seq
*pre_p
)
4914 gimple_stmt_iterator iter
;
4915 gimple_seq body_sequence
= NULL
;
4917 tree temp
= voidify_wrapper_expr (*expr_p
, NULL
);
4919 /* We only care about the number of conditions between the innermost
4920 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
4921 any cleanups collected outside the CLEANUP_POINT_EXPR. */
4922 int old_conds
= gimplify_ctxp
->conditions
;
4923 gimple_seq old_cleanups
= gimplify_ctxp
->conditional_cleanups
;
4924 gimplify_ctxp
->conditions
= 0;
4925 gimplify_ctxp
->conditional_cleanups
= NULL
;
4927 gimplify_stmt (&TREE_OPERAND (*expr_p
, 0), &body_sequence
);
4929 gimplify_ctxp
->conditions
= old_conds
;
4930 gimplify_ctxp
->conditional_cleanups
= old_cleanups
;
4932 for (iter
= gsi_start (body_sequence
); !gsi_end_p (iter
); )
4934 gimple wce
= gsi_stmt (iter
);
4936 if (gimple_code (wce
) == GIMPLE_WITH_CLEANUP_EXPR
)
4938 if (gsi_one_before_end_p (iter
))
4940 /* Note that gsi_insert_seq_before and gsi_remove do not
4941 scan operands, unlike some other sequence mutators. */
4942 gsi_insert_seq_before_without_update (&iter
,
4943 gimple_wce_cleanup (wce
),
4945 gsi_remove (&iter
, true);
4952 enum gimple_try_flags kind
;
4954 if (gimple_wce_cleanup_eh_only (wce
))
4955 kind
= GIMPLE_TRY_CATCH
;
4957 kind
= GIMPLE_TRY_FINALLY
;
4958 seq
= gsi_split_seq_after (iter
);
4960 gtry
= gimple_build_try (seq
, gimple_wce_cleanup (wce
), kind
);
4961 /* Do not use gsi_replace here, as it may scan operands.
4962 We want to do a simple structural modification only. */
4963 *gsi_stmt_ptr (&iter
) = gtry
;
4964 iter
= gsi_start (seq
);
4971 gimplify_seq_add_seq (pre_p
, body_sequence
);
4984 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
4985 is the cleanup action required. EH_ONLY is true if the cleanup should
4986 only be executed if an exception is thrown, not on normal exit. */
4989 gimple_push_cleanup (tree var
, tree cleanup
, bool eh_only
, gimple_seq
*pre_p
)
4992 gimple_seq cleanup_stmts
= NULL
;
4994 /* Errors can result in improperly nested cleanups. Which results in
4995 confusion when trying to resolve the GIMPLE_WITH_CLEANUP_EXPR. */
4996 if (errorcount
|| sorrycount
)
4999 if (gimple_conditional_context ())
5001 /* If we're in a conditional context, this is more complex. We only
5002 want to run the cleanup if we actually ran the initialization that
5003 necessitates it, but we want to run it after the end of the
5004 conditional context. So we wrap the try/finally around the
5005 condition and use a flag to determine whether or not to actually
5006 run the destructor. Thus
5010 becomes (approximately)
5014 if (test) { A::A(temp); flag = 1; val = f(temp); }
5017 if (flag) A::~A(temp);
5021 tree flag
= create_tmp_var (boolean_type_node
, "cleanup");
5022 gimple ffalse
= gimple_build_assign (flag
, boolean_false_node
);
5023 gimple ftrue
= gimple_build_assign (flag
, boolean_true_node
);
5025 cleanup
= build3 (COND_EXPR
, void_type_node
, flag
, cleanup
, NULL
);
5026 gimplify_stmt (&cleanup
, &cleanup_stmts
);
5027 wce
= gimple_build_wce (cleanup_stmts
);
5029 gimplify_seq_add_stmt (&gimplify_ctxp
->conditional_cleanups
, ffalse
);
5030 gimplify_seq_add_stmt (&gimplify_ctxp
->conditional_cleanups
, wce
);
5031 gimplify_seq_add_stmt (pre_p
, ftrue
);
5033 /* Because of this manipulation, and the EH edges that jump
5034 threading cannot redirect, the temporary (VAR) will appear
5035 to be used uninitialized. Don't warn. */
5036 TREE_NO_WARNING (var
) = 1;
5040 gimplify_stmt (&cleanup
, &cleanup_stmts
);
5041 wce
= gimple_build_wce (cleanup_stmts
);
5042 gimple_wce_set_cleanup_eh_only (wce
, eh_only
);
5043 gimplify_seq_add_stmt (pre_p
, wce
);
5047 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
5049 static enum gimplify_status
5050 gimplify_target_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
5052 tree targ
= *expr_p
;
5053 tree temp
= TARGET_EXPR_SLOT (targ
);
5054 tree init
= TARGET_EXPR_INITIAL (targ
);
5055 enum gimplify_status ret
;
5059 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
5060 to the temps list. Handle also variable length TARGET_EXPRs. */
5061 if (TREE_CODE (DECL_SIZE (temp
)) != INTEGER_CST
)
5063 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (temp
)))
5064 gimplify_type_sizes (TREE_TYPE (temp
), pre_p
);
5065 gimplify_vla_decl (temp
, pre_p
);
5068 gimple_add_tmp_var (temp
);
5070 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
5071 expression is supposed to initialize the slot. */
5072 if (VOID_TYPE_P (TREE_TYPE (init
)))
5073 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
, fb_none
);
5076 tree init_expr
= build2 (INIT_EXPR
, void_type_node
, temp
, init
);
5078 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
, fb_none
);
5080 ggc_free (init_expr
);
5082 if (ret
== GS_ERROR
)
5084 /* PR c++/28266 Make sure this is expanded only once. */
5085 TARGET_EXPR_INITIAL (targ
) = NULL_TREE
;
5089 gimplify_and_add (init
, pre_p
);
5091 /* If needed, push the cleanup for the temp. */
5092 if (TARGET_EXPR_CLEANUP (targ
))
5093 gimple_push_cleanup (temp
, TARGET_EXPR_CLEANUP (targ
),
5094 CLEANUP_EH_ONLY (targ
), pre_p
);
5096 /* Only expand this once. */
5097 TREE_OPERAND (targ
, 3) = init
;
5098 TARGET_EXPR_INITIAL (targ
) = NULL_TREE
;
5101 /* We should have expanded this before. */
5102 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp
));
5108 /* Gimplification of expression trees. */
5110 /* Gimplify an expression which appears at statement context. The
5111 corresponding GIMPLE statements are added to *SEQ_P. If *SEQ_P is
5112 NULL, a new sequence is allocated.
5114 Return true if we actually added a statement to the queue. */
5117 gimplify_stmt (tree
*stmt_p
, gimple_seq
*seq_p
)
5119 gimple_seq_node last
;
5122 *seq_p
= gimple_seq_alloc ();
5124 last
= gimple_seq_last (*seq_p
);
5125 gimplify_expr (stmt_p
, seq_p
, NULL
, is_gimple_stmt
, fb_none
);
5126 return last
!= gimple_seq_last (*seq_p
);
5130 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
5131 to CTX. If entries already exist, force them to be some flavor of private.
5132 If there is no enclosing parallel, do nothing. */
5135 omp_firstprivatize_variable (struct gimplify_omp_ctx
*ctx
, tree decl
)
5139 if (decl
== NULL
|| !DECL_P (decl
))
5144 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5147 if (n
->value
& GOVD_SHARED
)
5148 n
->value
= GOVD_FIRSTPRIVATE
| (n
->value
& GOVD_SEEN
);
5152 else if (ctx
->region_type
!= ORT_WORKSHARE
)
5153 omp_add_variable (ctx
, decl
, GOVD_FIRSTPRIVATE
);
5155 ctx
= ctx
->outer_context
;
5160 /* Similarly for each of the type sizes of TYPE. */
5163 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx
*ctx
, tree type
)
5165 if (type
== NULL
|| type
== error_mark_node
)
5167 type
= TYPE_MAIN_VARIANT (type
);
5169 if (pointer_set_insert (ctx
->privatized_types
, type
))
5172 switch (TREE_CODE (type
))
5178 case FIXED_POINT_TYPE
:
5179 omp_firstprivatize_variable (ctx
, TYPE_MIN_VALUE (type
));
5180 omp_firstprivatize_variable (ctx
, TYPE_MAX_VALUE (type
));
5184 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
5185 omp_firstprivatize_type_sizes (ctx
, TYPE_DOMAIN (type
));
5190 case QUAL_UNION_TYPE
:
5193 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
5194 if (TREE_CODE (field
) == FIELD_DECL
)
5196 omp_firstprivatize_variable (ctx
, DECL_FIELD_OFFSET (field
));
5197 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (field
));
5203 case REFERENCE_TYPE
:
5204 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
5211 omp_firstprivatize_variable (ctx
, TYPE_SIZE (type
));
5212 omp_firstprivatize_variable (ctx
, TYPE_SIZE_UNIT (type
));
5213 lang_hooks
.types
.omp_firstprivatize_type_sizes (ctx
, type
);
5216 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
5219 omp_add_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, unsigned int flags
)
5222 unsigned int nflags
;
5225 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
5228 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
5229 there are constructors involved somewhere. */
5230 if (TREE_ADDRESSABLE (TREE_TYPE (decl
))
5231 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
5234 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5237 /* We shouldn't be re-adding the decl with the same data
5239 gcc_assert ((n
->value
& GOVD_DATA_SHARE_CLASS
& flags
) == 0);
5240 /* The only combination of data sharing classes we should see is
5241 FIRSTPRIVATE and LASTPRIVATE. */
5242 nflags
= n
->value
| flags
;
5243 gcc_assert ((nflags
& GOVD_DATA_SHARE_CLASS
)
5244 == (GOVD_FIRSTPRIVATE
| GOVD_LASTPRIVATE
));
5249 /* When adding a variable-sized variable, we have to handle all sorts
5250 of additional bits of data: the pointer replacement variable, and
5251 the parameters of the type. */
5252 if (DECL_SIZE (decl
) && TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
5254 /* Add the pointer replacement variable as PRIVATE if the variable
5255 replacement is private, else FIRSTPRIVATE since we'll need the
5256 address of the original variable either for SHARED, or for the
5257 copy into or out of the context. */
5258 if (!(flags
& GOVD_LOCAL
))
5260 nflags
= flags
& GOVD_PRIVATE
? GOVD_PRIVATE
: GOVD_FIRSTPRIVATE
;
5261 nflags
|= flags
& GOVD_SEEN
;
5262 t
= DECL_VALUE_EXPR (decl
);
5263 gcc_assert (TREE_CODE (t
) == INDIRECT_REF
);
5264 t
= TREE_OPERAND (t
, 0);
5265 gcc_assert (DECL_P (t
));
5266 omp_add_variable (ctx
, t
, nflags
);
5269 /* Add all of the variable and type parameters (which should have
5270 been gimplified to a formal temporary) as FIRSTPRIVATE. */
5271 omp_firstprivatize_variable (ctx
, DECL_SIZE_UNIT (decl
));
5272 omp_firstprivatize_variable (ctx
, DECL_SIZE (decl
));
5273 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
5275 /* The variable-sized variable itself is never SHARED, only some form
5276 of PRIVATE. The sharing would take place via the pointer variable
5277 which we remapped above. */
5278 if (flags
& GOVD_SHARED
)
5279 flags
= GOVD_PRIVATE
| GOVD_DEBUG_PRIVATE
5280 | (flags
& (GOVD_SEEN
| GOVD_EXPLICIT
));
5282 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
5283 alloca statement we generate for the variable, so make sure it
5284 is available. This isn't automatically needed for the SHARED
5285 case, since we won't be allocating local storage then.
5286 For local variables TYPE_SIZE_UNIT might not be gimplified yet,
5287 in this case omp_notice_variable will be called later
5288 on when it is gimplified. */
5289 else if (! (flags
& GOVD_LOCAL
))
5290 omp_notice_variable (ctx
, TYPE_SIZE_UNIT (TREE_TYPE (decl
)), true);
5292 else if (lang_hooks
.decls
.omp_privatize_by_reference (decl
))
5294 gcc_assert ((flags
& GOVD_LOCAL
) == 0);
5295 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
5297 /* Similar to the direct variable sized case above, we'll need the
5298 size of references being privatized. */
5299 if ((flags
& GOVD_SHARED
) == 0)
5301 t
= TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl
)));
5302 if (TREE_CODE (t
) != INTEGER_CST
)
5303 omp_notice_variable (ctx
, t
, true);
5307 splay_tree_insert (ctx
->variables
, (splay_tree_key
)decl
, flags
);
5310 /* Record the fact that DECL was used within the OpenMP context CTX.
5311 IN_CODE is true when real code uses DECL, and false when we should
5312 merely emit default(none) errors. Return true if DECL is going to
5313 be remapped and thus DECL shouldn't be gimplified into its
5314 DECL_VALUE_EXPR (if any). */
5317 omp_notice_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, bool in_code
)
5320 unsigned flags
= in_code
? GOVD_SEEN
: 0;
5321 bool ret
= false, shared
;
5323 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
5326 /* Threadprivate variables are predetermined. */
5327 if (is_global_var (decl
))
5329 if (DECL_THREAD_LOCAL_P (decl
))
5332 if (DECL_HAS_VALUE_EXPR_P (decl
))
5334 tree value
= get_base_address (DECL_VALUE_EXPR (decl
));
5336 if (value
&& DECL_P (value
) && DECL_THREAD_LOCAL_P (value
))
5341 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5344 enum omp_clause_default_kind default_kind
, kind
;
5345 struct gimplify_omp_ctx
*octx
;
5347 if (ctx
->region_type
== ORT_WORKSHARE
)
5350 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
5351 remapped firstprivate instead of shared. To some extent this is
5352 addressed in omp_firstprivatize_type_sizes, but not effectively. */
5353 default_kind
= ctx
->default_kind
;
5354 kind
= lang_hooks
.decls
.omp_predetermined_sharing (decl
);
5355 if (kind
!= OMP_CLAUSE_DEFAULT_UNSPECIFIED
)
5356 default_kind
= kind
;
5358 switch (default_kind
)
5360 case OMP_CLAUSE_DEFAULT_NONE
:
5361 error ("%qs not specified in enclosing parallel",
5362 IDENTIFIER_POINTER (DECL_NAME (decl
)));
5363 error ("%Henclosing parallel", &ctx
->location
);
5365 case OMP_CLAUSE_DEFAULT_SHARED
:
5366 flags
|= GOVD_SHARED
;
5368 case OMP_CLAUSE_DEFAULT_PRIVATE
:
5369 flags
|= GOVD_PRIVATE
;
5371 case OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
:
5372 flags
|= GOVD_FIRSTPRIVATE
;
5374 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
5375 /* decl will be either GOVD_FIRSTPRIVATE or GOVD_SHARED. */
5376 gcc_assert (ctx
->region_type
== ORT_TASK
);
5377 if (ctx
->outer_context
)
5378 omp_notice_variable (ctx
->outer_context
, decl
, in_code
);
5379 for (octx
= ctx
->outer_context
; octx
; octx
= octx
->outer_context
)
5383 n2
= splay_tree_lookup (octx
->variables
, (splay_tree_key
) decl
);
5384 if (n2
&& (n2
->value
& GOVD_DATA_SHARE_CLASS
) != GOVD_SHARED
)
5386 flags
|= GOVD_FIRSTPRIVATE
;
5389 if ((octx
->region_type
& ORT_PARALLEL
) != 0)
5392 if (flags
& GOVD_FIRSTPRIVATE
)
5395 && (TREE_CODE (decl
) == PARM_DECL
5396 || (!is_global_var (decl
)
5397 && DECL_CONTEXT (decl
) == current_function_decl
)))
5399 flags
|= GOVD_FIRSTPRIVATE
;
5402 flags
|= GOVD_SHARED
;
5408 if ((flags
& GOVD_PRIVATE
)
5409 && lang_hooks
.decls
.omp_private_outer_ref (decl
))
5410 flags
|= GOVD_PRIVATE_OUTER_REF
;
5412 omp_add_variable (ctx
, decl
, flags
);
5414 shared
= (flags
& GOVD_SHARED
) != 0;
5415 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
5419 if ((n
->value
& (GOVD_SEEN
| GOVD_LOCAL
)) == 0
5420 && (flags
& (GOVD_SEEN
| GOVD_LOCAL
)) == GOVD_SEEN
5422 && TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
5425 tree t
= DECL_VALUE_EXPR (decl
);
5426 gcc_assert (TREE_CODE (t
) == INDIRECT_REF
);
5427 t
= TREE_OPERAND (t
, 0);
5428 gcc_assert (DECL_P (t
));
5429 n2
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) t
);
5430 n2
->value
|= GOVD_SEEN
;
5433 shared
= ((flags
| n
->value
) & GOVD_SHARED
) != 0;
5434 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
5436 /* If nothing changed, there's nothing left to do. */
5437 if ((n
->value
& flags
) == flags
)
5443 /* If the variable is private in the current context, then we don't
5444 need to propagate anything to an outer context. */
5445 if ((flags
& GOVD_PRIVATE
) && !(flags
& GOVD_PRIVATE_OUTER_REF
))
5447 if (ctx
->outer_context
5448 && omp_notice_variable (ctx
->outer_context
, decl
, in_code
))
5453 /* Verify that DECL is private within CTX. If there's specific information
5454 to the contrary in the innermost scope, generate an error. */
5457 omp_is_private (struct gimplify_omp_ctx
*ctx
, tree decl
)
5461 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5464 if (n
->value
& GOVD_SHARED
)
5466 if (ctx
== gimplify_omp_ctxp
)
5468 error ("iteration variable %qs should be private",
5469 IDENTIFIER_POINTER (DECL_NAME (decl
)));
5470 n
->value
= GOVD_PRIVATE
;
5476 else if ((n
->value
& GOVD_EXPLICIT
) != 0
5477 && (ctx
== gimplify_omp_ctxp
5478 || (ctx
->region_type
== ORT_COMBINED_PARALLEL
5479 && gimplify_omp_ctxp
->outer_context
== ctx
)))
5481 if ((n
->value
& GOVD_FIRSTPRIVATE
) != 0)
5482 error ("iteration variable %qs should not be firstprivate",
5483 IDENTIFIER_POINTER (DECL_NAME (decl
)));
5484 else if ((n
->value
& GOVD_REDUCTION
) != 0)
5485 error ("iteration variable %qs should not be reduction",
5486 IDENTIFIER_POINTER (DECL_NAME (decl
)));
5488 return (ctx
== gimplify_omp_ctxp
5489 || (ctx
->region_type
== ORT_COMBINED_PARALLEL
5490 && gimplify_omp_ctxp
->outer_context
== ctx
));
5493 if (ctx
->region_type
!= ORT_WORKSHARE
)
5495 else if (ctx
->outer_context
)
5496 return omp_is_private (ctx
->outer_context
, decl
);
5500 /* Return true if DECL is private within a parallel region
5501 that binds to the current construct's context or in parallel
5502 region's REDUCTION clause. */
5505 omp_check_private (struct gimplify_omp_ctx
*ctx
, tree decl
)
5511 ctx
= ctx
->outer_context
;
5513 return !(is_global_var (decl
)
5514 /* References might be private, but might be shared too. */
5515 || lang_hooks
.decls
.omp_privatize_by_reference (decl
));
5517 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
5519 return (n
->value
& GOVD_SHARED
) == 0;
5521 while (ctx
->region_type
== ORT_WORKSHARE
);
5525 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
5526 and previous omp contexts. */
5529 gimplify_scan_omp_clauses (tree
*list_p
, gimple_seq
*pre_p
,
5530 enum omp_region_type region_type
)
5532 struct gimplify_omp_ctx
*ctx
, *outer_ctx
;
5533 struct gimplify_ctx gctx
;
5536 ctx
= new_omp_context (region_type
);
5537 outer_ctx
= ctx
->outer_context
;
5539 while ((c
= *list_p
) != NULL
)
5541 bool remove
= false;
5542 bool notice_outer
= true;
5543 const char *check_non_private
= NULL
;
5547 switch (OMP_CLAUSE_CODE (c
))
5549 case OMP_CLAUSE_PRIVATE
:
5550 flags
= GOVD_PRIVATE
| GOVD_EXPLICIT
;
5551 if (lang_hooks
.decls
.omp_private_outer_ref (OMP_CLAUSE_DECL (c
)))
5553 flags
|= GOVD_PRIVATE_OUTER_REF
;
5554 OMP_CLAUSE_PRIVATE_OUTER_REF (c
) = 1;
5557 notice_outer
= false;
5559 case OMP_CLAUSE_SHARED
:
5560 flags
= GOVD_SHARED
| GOVD_EXPLICIT
;
5562 case OMP_CLAUSE_FIRSTPRIVATE
:
5563 flags
= GOVD_FIRSTPRIVATE
| GOVD_EXPLICIT
;
5564 check_non_private
= "firstprivate";
5566 case OMP_CLAUSE_LASTPRIVATE
:
5567 flags
= GOVD_LASTPRIVATE
| GOVD_SEEN
| GOVD_EXPLICIT
;
5568 check_non_private
= "lastprivate";
5570 case OMP_CLAUSE_REDUCTION
:
5571 flags
= GOVD_REDUCTION
| GOVD_SEEN
| GOVD_EXPLICIT
;
5572 check_non_private
= "reduction";
5576 decl
= OMP_CLAUSE_DECL (c
);
5577 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
5582 omp_add_variable (ctx
, decl
, flags
);
5583 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
5584 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
))
5586 omp_add_variable (ctx
, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
),
5587 GOVD_LOCAL
| GOVD_SEEN
);
5588 gimplify_omp_ctxp
= ctx
;
5589 push_gimplify_context (&gctx
);
5591 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c
) = gimple_seq_alloc ();
5592 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c
) = gimple_seq_alloc ();
5594 gimplify_and_add (OMP_CLAUSE_REDUCTION_INIT (c
),
5595 &OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c
));
5596 pop_gimplify_context
5597 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c
)));
5598 push_gimplify_context (&gctx
);
5599 gimplify_and_add (OMP_CLAUSE_REDUCTION_MERGE (c
),
5600 &OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c
));
5601 pop_gimplify_context
5602 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c
)));
5603 OMP_CLAUSE_REDUCTION_INIT (c
) = NULL_TREE
;
5604 OMP_CLAUSE_REDUCTION_MERGE (c
) = NULL_TREE
;
5606 gimplify_omp_ctxp
= outer_ctx
;
5608 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
5609 && OMP_CLAUSE_LASTPRIVATE_STMT (c
))
5611 gimplify_omp_ctxp
= ctx
;
5612 push_gimplify_context (&gctx
);
5613 if (TREE_CODE (OMP_CLAUSE_LASTPRIVATE_STMT (c
)) != BIND_EXPR
)
5615 tree bind
= build3 (BIND_EXPR
, void_type_node
, NULL
,
5617 TREE_SIDE_EFFECTS (bind
) = 1;
5618 BIND_EXPR_BODY (bind
) = OMP_CLAUSE_LASTPRIVATE_STMT (c
);
5619 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = bind
;
5621 gimplify_and_add (OMP_CLAUSE_LASTPRIVATE_STMT (c
),
5622 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
));
5623 pop_gimplify_context
5624 (gimple_seq_first_stmt (OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
)));
5625 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = NULL_TREE
;
5627 gimplify_omp_ctxp
= outer_ctx
;
5633 case OMP_CLAUSE_COPYIN
:
5634 case OMP_CLAUSE_COPYPRIVATE
:
5635 decl
= OMP_CLAUSE_DECL (c
);
5636 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
5643 omp_notice_variable (outer_ctx
, decl
, true);
5644 if (check_non_private
5645 && region_type
== ORT_WORKSHARE
5646 && omp_check_private (ctx
, decl
))
5648 error ("%s variable %qs is private in outer context",
5649 check_non_private
, IDENTIFIER_POINTER (DECL_NAME (decl
)));
5655 OMP_CLAUSE_OPERAND (c
, 0)
5656 = gimple_boolify (OMP_CLAUSE_OPERAND (c
, 0));
5659 case OMP_CLAUSE_SCHEDULE
:
5660 case OMP_CLAUSE_NUM_THREADS
:
5661 if (gimplify_expr (&OMP_CLAUSE_OPERAND (c
, 0), pre_p
, NULL
,
5662 is_gimple_val
, fb_rvalue
) == GS_ERROR
)
5666 case OMP_CLAUSE_NOWAIT
:
5667 case OMP_CLAUSE_ORDERED
:
5668 case OMP_CLAUSE_UNTIED
:
5669 case OMP_CLAUSE_COLLAPSE
:
5672 case OMP_CLAUSE_DEFAULT
:
5673 ctx
->default_kind
= OMP_CLAUSE_DEFAULT_KIND (c
);
5681 *list_p
= OMP_CLAUSE_CHAIN (c
);
5683 list_p
= &OMP_CLAUSE_CHAIN (c
);
5686 gimplify_omp_ctxp
= ctx
;
5689 /* For all variables that were not actually used within the context,
5690 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
5693 gimplify_adjust_omp_clauses_1 (splay_tree_node n
, void *data
)
5695 tree
*list_p
= (tree
*) data
;
5696 tree decl
= (tree
) n
->key
;
5697 unsigned flags
= n
->value
;
5698 enum omp_clause_code code
;
5702 if (flags
& (GOVD_EXPLICIT
| GOVD_LOCAL
))
5704 if ((flags
& GOVD_SEEN
) == 0)
5706 if (flags
& GOVD_DEBUG_PRIVATE
)
5708 gcc_assert ((flags
& GOVD_DATA_SHARE_CLASS
) == GOVD_PRIVATE
);
5709 private_debug
= true;
5713 = lang_hooks
.decls
.omp_private_debug_clause (decl
,
5714 !!(flags
& GOVD_SHARED
));
5716 code
= OMP_CLAUSE_PRIVATE
;
5717 else if (flags
& GOVD_SHARED
)
5719 if (is_global_var (decl
))
5721 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
->outer_context
;
5725 = splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
5726 if (on
&& (on
->value
& (GOVD_FIRSTPRIVATE
| GOVD_LASTPRIVATE
5727 | GOVD_PRIVATE
| GOVD_REDUCTION
)) != 0)
5729 ctx
= ctx
->outer_context
;
5734 code
= OMP_CLAUSE_SHARED
;
5736 else if (flags
& GOVD_PRIVATE
)
5737 code
= OMP_CLAUSE_PRIVATE
;
5738 else if (flags
& GOVD_FIRSTPRIVATE
)
5739 code
= OMP_CLAUSE_FIRSTPRIVATE
;
5743 clause
= build_omp_clause (code
);
5744 OMP_CLAUSE_DECL (clause
) = decl
;
5745 OMP_CLAUSE_CHAIN (clause
) = *list_p
;
5747 OMP_CLAUSE_PRIVATE_DEBUG (clause
) = 1;
5748 else if (code
== OMP_CLAUSE_PRIVATE
&& (flags
& GOVD_PRIVATE_OUTER_REF
))
5749 OMP_CLAUSE_PRIVATE_OUTER_REF (clause
) = 1;
5751 lang_hooks
.decls
.omp_finish_clause (clause
);
5757 gimplify_adjust_omp_clauses (tree
*list_p
)
5759 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
5762 while ((c
= *list_p
) != NULL
)
5765 bool remove
= false;
5767 switch (OMP_CLAUSE_CODE (c
))
5769 case OMP_CLAUSE_PRIVATE
:
5770 case OMP_CLAUSE_SHARED
:
5771 case OMP_CLAUSE_FIRSTPRIVATE
:
5772 decl
= OMP_CLAUSE_DECL (c
);
5773 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
5774 remove
= !(n
->value
& GOVD_SEEN
);
5777 bool shared
= OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_SHARED
;
5778 if ((n
->value
& GOVD_DEBUG_PRIVATE
)
5779 || lang_hooks
.decls
.omp_private_debug_clause (decl
, shared
))
5781 gcc_assert ((n
->value
& GOVD_DEBUG_PRIVATE
) == 0
5782 || ((n
->value
& GOVD_DATA_SHARE_CLASS
)
5784 OMP_CLAUSE_SET_CODE (c
, OMP_CLAUSE_PRIVATE
);
5785 OMP_CLAUSE_PRIVATE_DEBUG (c
) = 1;
5790 case OMP_CLAUSE_LASTPRIVATE
:
5791 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
5792 accurately reflect the presence of a FIRSTPRIVATE clause. */
5793 decl
= OMP_CLAUSE_DECL (c
);
5794 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
5795 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c
)
5796 = (n
->value
& GOVD_FIRSTPRIVATE
) != 0;
5799 case OMP_CLAUSE_REDUCTION
:
5800 case OMP_CLAUSE_COPYIN
:
5801 case OMP_CLAUSE_COPYPRIVATE
:
5803 case OMP_CLAUSE_NUM_THREADS
:
5804 case OMP_CLAUSE_SCHEDULE
:
5805 case OMP_CLAUSE_NOWAIT
:
5806 case OMP_CLAUSE_ORDERED
:
5807 case OMP_CLAUSE_DEFAULT
:
5808 case OMP_CLAUSE_UNTIED
:
5809 case OMP_CLAUSE_COLLAPSE
:
5817 *list_p
= OMP_CLAUSE_CHAIN (c
);
5819 list_p
= &OMP_CLAUSE_CHAIN (c
);
5822 /* Add in any implicit data sharing. */
5823 splay_tree_foreach (ctx
->variables
, gimplify_adjust_omp_clauses_1
, list_p
);
5825 gimplify_omp_ctxp
= ctx
->outer_context
;
5826 delete_omp_context (ctx
);
5829 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
5830 gimplification of the body, as well as scanning the body for used
5831 variables. We need to do this scan now, because variable-sized
5832 decls will be decomposed during gimplification. */
5835 gimplify_omp_parallel (tree
*expr_p
, gimple_seq
*pre_p
)
5837 tree expr
= *expr_p
;
5839 gimple_seq body
= NULL
;
5840 struct gimplify_ctx gctx
;
5842 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
), pre_p
,
5843 OMP_PARALLEL_COMBINED (expr
)
5844 ? ORT_COMBINED_PARALLEL
5847 push_gimplify_context (&gctx
);
5849 g
= gimplify_and_return_first (OMP_PARALLEL_BODY (expr
), &body
);
5850 if (gimple_code (g
) == GIMPLE_BIND
)
5851 pop_gimplify_context (g
);
5853 pop_gimplify_context (NULL
);
5855 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
));
5857 g
= gimple_build_omp_parallel (body
,
5858 OMP_PARALLEL_CLAUSES (expr
),
5859 NULL_TREE
, NULL_TREE
);
5860 if (OMP_PARALLEL_COMBINED (expr
))
5861 gimple_omp_set_subcode (g
, GF_OMP_PARALLEL_COMBINED
);
5862 gimplify_seq_add_stmt (pre_p
, g
);
5863 *expr_p
= NULL_TREE
;
5866 /* Gimplify the contents of an OMP_TASK statement. This involves
5867 gimplification of the body, as well as scanning the body for used
5868 variables. We need to do this scan now, because variable-sized
5869 decls will be decomposed during gimplification. */
5872 gimplify_omp_task (tree
*expr_p
, gimple_seq
*pre_p
)
5874 tree expr
= *expr_p
;
5876 gimple_seq body
= NULL
;
5877 struct gimplify_ctx gctx
;
5879 gimplify_scan_omp_clauses (&OMP_TASK_CLAUSES (expr
), pre_p
, ORT_TASK
);
5881 push_gimplify_context (&gctx
);
5883 g
= gimplify_and_return_first (OMP_TASK_BODY (expr
), &body
);
5884 if (gimple_code (g
) == GIMPLE_BIND
)
5885 pop_gimplify_context (g
);
5887 pop_gimplify_context (NULL
);
5889 gimplify_adjust_omp_clauses (&OMP_TASK_CLAUSES (expr
));
5891 g
= gimple_build_omp_task (body
,
5892 OMP_TASK_CLAUSES (expr
),
5893 NULL_TREE
, NULL_TREE
,
5894 NULL_TREE
, NULL_TREE
, NULL_TREE
);
5895 gimplify_seq_add_stmt (pre_p
, g
);
5896 *expr_p
= NULL_TREE
;
5899 /* Gimplify the gross structure of an OMP_FOR statement. */
5901 static enum gimplify_status
5902 gimplify_omp_for (tree
*expr_p
, gimple_seq
*pre_p
)
5904 tree for_stmt
, decl
, var
, t
;
5905 enum gimplify_status ret
= GS_ALL_DONE
;
5906 enum gimplify_status tret
;
5908 gimple_seq for_body
, for_pre_body
;
5913 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
), pre_p
,
5916 /* Handle OMP_FOR_INIT. */
5917 for_pre_body
= NULL
;
5918 gimplify_and_add (OMP_FOR_PRE_BODY (for_stmt
), &for_pre_body
);
5919 OMP_FOR_PRE_BODY (for_stmt
) = NULL_TREE
;
5921 for_body
= gimple_seq_alloc ();
5922 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
))
5923 == TREE_VEC_LENGTH (OMP_FOR_COND (for_stmt
)));
5924 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
))
5925 == TREE_VEC_LENGTH (OMP_FOR_INCR (for_stmt
)));
5926 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)); i
++)
5928 t
= TREE_VEC_ELT (OMP_FOR_INIT (for_stmt
), i
);
5929 gcc_assert (TREE_CODE (t
) == MODIFY_EXPR
);
5930 decl
= TREE_OPERAND (t
, 0);
5931 gcc_assert (DECL_P (decl
));
5932 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl
))
5933 || POINTER_TYPE_P (TREE_TYPE (decl
)));
5935 /* Make sure the iteration variable is private. */
5936 if (omp_is_private (gimplify_omp_ctxp
, decl
))
5937 omp_notice_variable (gimplify_omp_ctxp
, decl
, true);
5939 omp_add_variable (gimplify_omp_ctxp
, decl
, GOVD_PRIVATE
| GOVD_SEEN
);
5941 /* If DECL is not a gimple register, create a temporary variable to act
5942 as an iteration counter. This is valid, since DECL cannot be
5943 modified in the body of the loop. */
5944 if (!is_gimple_reg (decl
))
5946 var
= create_tmp_var (TREE_TYPE (decl
), get_name (decl
));
5947 TREE_OPERAND (t
, 0) = var
;
5949 gimplify_seq_add_stmt (&for_body
, gimple_build_assign (decl
, var
));
5951 omp_add_variable (gimplify_omp_ctxp
, var
, GOVD_PRIVATE
| GOVD_SEEN
);
5956 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), &for_pre_body
, NULL
,
5957 is_gimple_val
, fb_rvalue
);
5958 ret
= MIN (ret
, tret
);
5959 if (ret
== GS_ERROR
)
5962 /* Handle OMP_FOR_COND. */
5963 t
= TREE_VEC_ELT (OMP_FOR_COND (for_stmt
), i
);
5964 gcc_assert (COMPARISON_CLASS_P (t
));
5965 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
5967 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), &for_pre_body
, NULL
,
5968 is_gimple_val
, fb_rvalue
);
5969 ret
= MIN (ret
, tret
);
5971 /* Handle OMP_FOR_INCR. */
5972 t
= TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
);
5973 switch (TREE_CODE (t
))
5975 case PREINCREMENT_EXPR
:
5976 case POSTINCREMENT_EXPR
:
5977 t
= build_int_cst (TREE_TYPE (decl
), 1);
5978 t
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), var
, t
);
5979 t
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, t
);
5980 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
) = t
;
5983 case PREDECREMENT_EXPR
:
5984 case POSTDECREMENT_EXPR
:
5985 t
= build_int_cst (TREE_TYPE (decl
), -1);
5986 t
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), var
, t
);
5987 t
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, t
);
5988 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
) = t
;
5992 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
5993 TREE_OPERAND (t
, 0) = var
;
5995 t
= TREE_OPERAND (t
, 1);
5996 switch (TREE_CODE (t
))
5999 if (TREE_OPERAND (t
, 1) == decl
)
6001 TREE_OPERAND (t
, 1) = TREE_OPERAND (t
, 0);
6002 TREE_OPERAND (t
, 0) = var
;
6008 case POINTER_PLUS_EXPR
:
6009 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
6010 TREE_OPERAND (t
, 0) = var
;
6016 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), &for_pre_body
, NULL
,
6017 is_gimple_val
, fb_rvalue
);
6018 ret
= MIN (ret
, tret
);
6025 if (var
!= decl
|| TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)) > 1)
6028 for (c
= OMP_FOR_CLAUSES (for_stmt
); c
; c
= OMP_CLAUSE_CHAIN (c
))
6029 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
6030 && OMP_CLAUSE_DECL (c
) == decl
6031 && OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
) == NULL
)
6033 t
= TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
);
6034 gcc_assert (TREE_CODE (t
) == MODIFY_EXPR
);
6035 gcc_assert (TREE_OPERAND (t
, 0) == var
);
6036 t
= TREE_OPERAND (t
, 1);
6037 gcc_assert (TREE_CODE (t
) == PLUS_EXPR
6038 || TREE_CODE (t
) == MINUS_EXPR
6039 || TREE_CODE (t
) == POINTER_PLUS_EXPR
);
6040 gcc_assert (TREE_OPERAND (t
, 0) == var
);
6041 t
= build2 (TREE_CODE (t
), TREE_TYPE (decl
), decl
,
6042 TREE_OPERAND (t
, 1));
6043 gimplify_assign (decl
, t
,
6044 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
));
6049 gimplify_and_add (OMP_FOR_BODY (for_stmt
), &for_body
);
6051 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
));
6053 gfor
= gimple_build_omp_for (for_body
, OMP_FOR_CLAUSES (for_stmt
),
6054 TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)),
6057 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)); i
++)
6059 t
= TREE_VEC_ELT (OMP_FOR_INIT (for_stmt
), i
);
6060 gimple_omp_for_set_index (gfor
, i
, TREE_OPERAND (t
, 0));
6061 gimple_omp_for_set_initial (gfor
, i
, TREE_OPERAND (t
, 1));
6062 t
= TREE_VEC_ELT (OMP_FOR_COND (for_stmt
), i
);
6063 gimple_omp_for_set_cond (gfor
, i
, TREE_CODE (t
));
6064 gimple_omp_for_set_final (gfor
, i
, TREE_OPERAND (t
, 1));
6065 t
= TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
);
6066 gimple_omp_for_set_incr (gfor
, i
, TREE_OPERAND (t
, 1));
6069 gimplify_seq_add_stmt (pre_p
, gfor
);
6070 return ret
== GS_ALL_DONE
? GS_ALL_DONE
: GS_ERROR
;
6073 /* Gimplify the gross structure of other OpenMP worksharing constructs.
6074 In particular, OMP_SECTIONS and OMP_SINGLE. */
6077 gimplify_omp_workshare (tree
*expr_p
, gimple_seq
*pre_p
)
6079 tree expr
= *expr_p
;
6081 gimple_seq body
= NULL
;
6083 gimplify_scan_omp_clauses (&OMP_CLAUSES (expr
), pre_p
, ORT_WORKSHARE
);
6084 gimplify_and_add (OMP_BODY (expr
), &body
);
6085 gimplify_adjust_omp_clauses (&OMP_CLAUSES (expr
));
6087 if (TREE_CODE (expr
) == OMP_SECTIONS
)
6088 stmt
= gimple_build_omp_sections (body
, OMP_CLAUSES (expr
));
6089 else if (TREE_CODE (expr
) == OMP_SINGLE
)
6090 stmt
= gimple_build_omp_single (body
, OMP_CLAUSES (expr
));
6094 gimplify_seq_add_stmt (pre_p
, stmt
);
6097 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
6098 stabilized the lhs of the atomic operation as *ADDR. Return true if
6099 EXPR is this stabilized form. */
6102 goa_lhs_expr_p (tree expr
, tree addr
)
6104 /* Also include casts to other type variants. The C front end is fond
6105 of adding these for e.g. volatile variables. This is like
6106 STRIP_TYPE_NOPS but includes the main variant lookup. */
6107 while ((CONVERT_EXPR_P (expr
)
6108 || TREE_CODE (expr
) == NON_LVALUE_EXPR
)
6109 && TREE_OPERAND (expr
, 0) != error_mark_node
6110 && (TYPE_MAIN_VARIANT (TREE_TYPE (expr
))
6111 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (expr
, 0)))))
6112 expr
= TREE_OPERAND (expr
, 0);
6114 if (TREE_CODE (expr
) == INDIRECT_REF
)
6116 expr
= TREE_OPERAND (expr
, 0);
6118 && (CONVERT_EXPR_P (expr
)
6119 || TREE_CODE (expr
) == NON_LVALUE_EXPR
)
6120 && TREE_CODE (expr
) == TREE_CODE (addr
)
6121 && TYPE_MAIN_VARIANT (TREE_TYPE (expr
))
6122 == TYPE_MAIN_VARIANT (TREE_TYPE (addr
)))
6124 expr
= TREE_OPERAND (expr
, 0);
6125 addr
= TREE_OPERAND (addr
, 0);
6129 return (TREE_CODE (addr
) == ADDR_EXPR
6130 && TREE_CODE (expr
) == ADDR_EXPR
6131 && TREE_OPERAND (addr
, 0) == TREE_OPERAND (expr
, 0));
6133 if (TREE_CODE (addr
) == ADDR_EXPR
&& expr
== TREE_OPERAND (addr
, 0))
6138 /* Walk *EXPR_P and replace
6139 appearances of *LHS_ADDR with LHS_VAR. If an expression does not involve
6140 the lhs, evaluate it into a temporary. Return 1 if the lhs appeared as
6141 a subexpression, 0 if it did not, or -1 if an error was encountered. */
6144 goa_stabilize_expr (tree
*expr_p
, gimple_seq
*pre_p
, tree lhs_addr
,
6147 tree expr
= *expr_p
;
6150 if (goa_lhs_expr_p (expr
, lhs_addr
))
6155 if (is_gimple_val (expr
))
6159 switch (TREE_CODE_CLASS (TREE_CODE (expr
)))
6162 case tcc_comparison
:
6163 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 1), pre_p
, lhs_addr
,
6166 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 0), pre_p
, lhs_addr
,
6169 case tcc_expression
:
6170 switch (TREE_CODE (expr
))
6172 case TRUTH_ANDIF_EXPR
:
6173 case TRUTH_ORIF_EXPR
:
6174 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 1), pre_p
,
6176 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 0), pre_p
,
6189 enum gimplify_status gs
;
6190 gs
= gimplify_expr (expr_p
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
);
6191 if (gs
!= GS_ALL_DONE
)
6199 /* Gimplify an OMP_ATOMIC statement. */
6201 static enum gimplify_status
6202 gimplify_omp_atomic (tree
*expr_p
, gimple_seq
*pre_p
)
6204 tree addr
= TREE_OPERAND (*expr_p
, 0);
6205 tree rhs
= TREE_OPERAND (*expr_p
, 1);
6206 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr
)));
6209 tmp_load
= create_tmp_var (type
, NULL
);
6210 if (goa_stabilize_expr (&rhs
, pre_p
, addr
, tmp_load
) < 0)
6213 if (gimplify_expr (&addr
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
)
6217 gimplify_seq_add_stmt (pre_p
, gimple_build_omp_atomic_load (tmp_load
, addr
));
6218 if (gimplify_expr (&rhs
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
)
6221 gimplify_seq_add_stmt (pre_p
, gimple_build_omp_atomic_store (rhs
));
6228 /* Converts the GENERIC expression tree *EXPR_P to GIMPLE. If the
6229 expression produces a value to be used as an operand inside a GIMPLE
6230 statement, the value will be stored back in *EXPR_P. This value will
6231 be a tree of class tcc_declaration, tcc_constant, tcc_reference or
6232 an SSA_NAME. The corresponding sequence of GIMPLE statements is
6233 emitted in PRE_P and POST_P.
6235 Additionally, this process may overwrite parts of the input
6236 expression during gimplification. Ideally, it should be
6237 possible to do non-destructive gimplification.
6239 EXPR_P points to the GENERIC expression to convert to GIMPLE. If
6240 the expression needs to evaluate to a value to be used as
6241 an operand in a GIMPLE statement, this value will be stored in
6242 *EXPR_P on exit. This happens when the caller specifies one
6243 of fb_lvalue or fb_rvalue fallback flags.
6245 PRE_P will contain the sequence of GIMPLE statements corresponding
6246 to the evaluation of EXPR and all the side-effects that must
6247 be executed before the main expression. On exit, the last
6248 statement of PRE_P is the core statement being gimplified. For
6249 instance, when gimplifying 'if (++a)' the last statement in
6250 PRE_P will be 'if (t.1)' where t.1 is the result of
6251 pre-incrementing 'a'.
6253 POST_P will contain the sequence of GIMPLE statements corresponding
6254 to the evaluation of all the side-effects that must be executed
6255 after the main expression. If this is NULL, the post
6256 side-effects are stored at the end of PRE_P.
6258 The reason why the output is split in two is to handle post
6259 side-effects explicitly. In some cases, an expression may have
6260 inner and outer post side-effects which need to be emitted in
6261 an order different from the one given by the recursive
6262 traversal. For instance, for the expression (*p--)++ the post
6263 side-effects of '--' must actually occur *after* the post
6264 side-effects of '++'. However, gimplification will first visit
6265 the inner expression, so if a separate POST sequence was not
6266 used, the resulting sequence would be:
6273 However, the post-decrement operation in line #2 must not be
6274 evaluated until after the store to *p at line #4, so the
6275 correct sequence should be:
6282 So, by specifying a separate post queue, it is possible
6283 to emit the post side-effects in the correct order.
6284 If POST_P is NULL, an internal queue will be used. Before
6285 returning to the caller, the sequence POST_P is appended to
6286 the main output sequence PRE_P.
6288 GIMPLE_TEST_F points to a function that takes a tree T and
6289 returns nonzero if T is in the GIMPLE form requested by the
6290 caller. The GIMPLE predicates are in tree-gimple.c.
6292 FALLBACK tells the function what sort of a temporary we want if
6293 gimplification cannot produce an expression that complies with
6296 fb_none means that no temporary should be generated
6297 fb_rvalue means that an rvalue is OK to generate
6298 fb_lvalue means that an lvalue is OK to generate
6299 fb_either means that either is OK, but an lvalue is preferable.
6300 fb_mayfail means that gimplification may fail (in which case
6301 GS_ERROR will be returned)
6303 The return value is either GS_ERROR or GS_ALL_DONE, since this
6304 function iterates until EXPR is completely gimplified or an error
6307 enum gimplify_status
6308 gimplify_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
6309 bool (*gimple_test_f
) (tree
), fallback_t fallback
)
6312 gimple_seq internal_pre
= NULL
;
6313 gimple_seq internal_post
= NULL
;
6316 location_t saved_location
;
6317 enum gimplify_status ret
;
6318 gimple_stmt_iterator pre_last_gsi
, post_last_gsi
;
6320 save_expr
= *expr_p
;
6321 if (save_expr
== NULL_TREE
)
6324 /* If we are gimplifying a top-level statement, PRE_P must be valid. */
6325 is_statement
= gimple_test_f
== is_gimple_stmt
;
6329 /* Consistency checks. */
6330 if (gimple_test_f
== is_gimple_reg
)
6331 gcc_assert (fallback
& (fb_rvalue
| fb_lvalue
));
6332 else if (gimple_test_f
== is_gimple_val
6333 || gimple_test_f
== is_gimple_call_addr
6334 || gimple_test_f
== is_gimple_condexpr
6335 || gimple_test_f
== is_gimple_mem_rhs
6336 || gimple_test_f
== is_gimple_mem_rhs_or_call
6337 || gimple_test_f
== is_gimple_reg_rhs
6338 || gimple_test_f
== is_gimple_reg_rhs_or_call
6339 || gimple_test_f
== is_gimple_asm_val
)
6340 gcc_assert (fallback
& fb_rvalue
);
6341 else if (gimple_test_f
== is_gimple_min_lval
6342 || gimple_test_f
== is_gimple_lvalue
)
6343 gcc_assert (fallback
& fb_lvalue
);
6344 else if (gimple_test_f
== is_gimple_addressable
)
6345 gcc_assert (fallback
& fb_either
);
6346 else if (gimple_test_f
== is_gimple_stmt
)
6347 gcc_assert (fallback
== fb_none
);
6350 /* We should have recognized the GIMPLE_TEST_F predicate to
6351 know what kind of fallback to use in case a temporary is
6352 needed to hold the value or address of *EXPR_P. */
6356 /* We used to check the predicate here and return immediately if it
6357 succeeds. This is wrong; the design is for gimplification to be
6358 idempotent, and for the predicates to only test for valid forms, not
6359 whether they are fully simplified. */
6361 pre_p
= &internal_pre
;
6364 post_p
= &internal_post
;
6366 /* Remember the last statements added to PRE_P and POST_P. Every
6367 new statement added by the gimplification helpers needs to be
6368 annotated with location information. To centralize the
6369 responsibility, we remember the last statement that had been
6370 added to both queues before gimplifying *EXPR_P. If
6371 gimplification produces new statements in PRE_P and POST_P, those
6372 statements will be annotated with the same location information
6374 pre_last_gsi
= gsi_last (*pre_p
);
6375 post_last_gsi
= gsi_last (*post_p
);
6377 saved_location
= input_location
;
6378 if (save_expr
!= error_mark_node
6379 && EXPR_HAS_LOCATION (*expr_p
))
6380 input_location
= EXPR_LOCATION (*expr_p
);
6382 /* Loop over the specific gimplifiers until the toplevel node
6383 remains the same. */
6386 /* Strip away as many useless type conversions as possible
6388 STRIP_USELESS_TYPE_CONVERSION (*expr_p
);
6390 /* Remember the expr. */
6391 save_expr
= *expr_p
;
6393 /* Die, die, die, my darling. */
6394 if (save_expr
== error_mark_node
6395 || (TREE_TYPE (save_expr
)
6396 && TREE_TYPE (save_expr
) == error_mark_node
))
6402 /* Do any language-specific gimplification. */
6403 ret
= ((enum gimplify_status
)
6404 lang_hooks
.gimplify_expr (expr_p
, pre_p
, post_p
));
6407 if (*expr_p
== NULL_TREE
)
6409 if (*expr_p
!= save_expr
)
6412 else if (ret
!= GS_UNHANDLED
)
6416 switch (TREE_CODE (*expr_p
))
6418 /* First deal with the special cases. */
6420 case POSTINCREMENT_EXPR
:
6421 case POSTDECREMENT_EXPR
:
6422 case PREINCREMENT_EXPR
:
6423 case PREDECREMENT_EXPR
:
6424 ret
= gimplify_self_mod_expr (expr_p
, pre_p
, post_p
,
6425 fallback
!= fb_none
);
6429 case ARRAY_RANGE_REF
:
6433 case VIEW_CONVERT_EXPR
:
6434 ret
= gimplify_compound_lval (expr_p
, pre_p
, post_p
,
6435 fallback
? fallback
: fb_rvalue
);
6439 ret
= gimplify_cond_expr (expr_p
, pre_p
, fallback
);
6441 /* C99 code may assign to an array in a structure value of a
6442 conditional expression, and this has undefined behavior
6443 only on execution, so create a temporary if an lvalue is
6445 if (fallback
== fb_lvalue
)
6447 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
6448 mark_addressable (*expr_p
);
6453 ret
= gimplify_call_expr (expr_p
, pre_p
, fallback
!= fb_none
);
6455 /* C99 code may assign to an array in a structure returned
6456 from a function, and this has undefined behavior only on
6457 execution, so create a temporary if an lvalue is
6459 if (fallback
== fb_lvalue
)
6461 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
6462 mark_addressable (*expr_p
);
6470 ret
= gimplify_compound_expr (expr_p
, pre_p
, fallback
!= fb_none
);
6473 case COMPOUND_LITERAL_EXPR
:
6474 ret
= gimplify_compound_literal_expr (expr_p
, pre_p
);
6479 ret
= gimplify_modify_expr (expr_p
, pre_p
, post_p
,
6480 fallback
!= fb_none
);
6483 case TRUTH_ANDIF_EXPR
:
6484 case TRUTH_ORIF_EXPR
:
6485 /* Pass the source location of the outer expression. */
6486 ret
= gimplify_boolean_expr (expr_p
, saved_location
);
6489 case TRUTH_NOT_EXPR
:
6490 if (TREE_CODE (TREE_TYPE (*expr_p
)) != BOOLEAN_TYPE
)
6492 tree type
= TREE_TYPE (*expr_p
);
6493 *expr_p
= fold_convert (type
, gimple_boolify (*expr_p
));
6498 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
6499 is_gimple_val
, fb_rvalue
);
6500 recalculate_side_effects (*expr_p
);
6504 ret
= gimplify_addr_expr (expr_p
, pre_p
, post_p
);
6508 ret
= gimplify_va_arg_expr (expr_p
, pre_p
, post_p
);
6512 if (IS_EMPTY_STMT (*expr_p
))
6518 if (VOID_TYPE_P (TREE_TYPE (*expr_p
))
6519 || fallback
== fb_none
)
6521 /* Just strip a conversion to void (or in void context) and
6523 *expr_p
= TREE_OPERAND (*expr_p
, 0);
6527 ret
= gimplify_conversion (expr_p
);
6528 if (ret
== GS_ERROR
)
6530 if (*expr_p
!= save_expr
)
6534 case FIX_TRUNC_EXPR
:
6535 /* unary_expr: ... | '(' cast ')' val | ... */
6536 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
6537 is_gimple_val
, fb_rvalue
);
6538 recalculate_side_effects (*expr_p
);
6542 *expr_p
= fold_indirect_ref (*expr_p
);
6543 if (*expr_p
!= save_expr
)
6545 /* else fall through. */
6546 case ALIGN_INDIRECT_REF
:
6547 case MISALIGNED_INDIRECT_REF
:
6548 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
6549 is_gimple_reg
, fb_rvalue
);
6550 recalculate_side_effects (*expr_p
);
6553 /* Constants need not be gimplified. */
6564 /* If we require an lvalue, such as for ADDR_EXPR, retain the
6565 CONST_DECL node. Otherwise the decl is replaceable by its
6567 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
6568 if (fallback
& fb_lvalue
)
6571 *expr_p
= DECL_INITIAL (*expr_p
);
6575 ret
= gimplify_decl_expr (expr_p
, pre_p
);
6579 /* FIXME make this a decl. */
6584 ret
= gimplify_bind_expr (expr_p
, pre_p
);
6588 ret
= gimplify_loop_expr (expr_p
, pre_p
);
6592 ret
= gimplify_switch_expr (expr_p
, pre_p
);
6596 ret
= gimplify_exit_expr (expr_p
);
6600 /* If the target is not LABEL, then it is a computed jump
6601 and the target needs to be gimplified. */
6602 if (TREE_CODE (GOTO_DESTINATION (*expr_p
)) != LABEL_DECL
)
6604 ret
= gimplify_expr (&GOTO_DESTINATION (*expr_p
), pre_p
,
6605 NULL
, is_gimple_val
, fb_rvalue
);
6606 if (ret
== GS_ERROR
)
6609 gimplify_seq_add_stmt (pre_p
,
6610 gimple_build_goto (GOTO_DESTINATION (*expr_p
)));
6614 gimplify_seq_add_stmt (pre_p
,
6615 gimple_build_predict (PREDICT_EXPR_PREDICTOR (*expr_p
),
6616 PREDICT_EXPR_OUTCOME (*expr_p
)));
6622 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p
))
6623 == current_function_decl
);
6624 gimplify_seq_add_stmt (pre_p
,
6625 gimple_build_label (LABEL_EXPR_LABEL (*expr_p
)));
6628 case CASE_LABEL_EXPR
:
6629 ret
= gimplify_case_label_expr (expr_p
, pre_p
);
6633 ret
= gimplify_return_expr (*expr_p
, pre_p
);
6637 /* Don't reduce this in place; let gimplify_init_constructor work its
6638 magic. Buf if we're just elaborating this for side effects, just
6639 gimplify any element that has side-effects. */
6640 if (fallback
== fb_none
)
6642 unsigned HOST_WIDE_INT ix
;
6643 constructor_elt
*ce
;
6644 tree temp
= NULL_TREE
;
6646 VEC_iterate (constructor_elt
, CONSTRUCTOR_ELTS (*expr_p
),
6649 if (TREE_SIDE_EFFECTS (ce
->value
))
6650 append_to_statement_list (ce
->value
, &temp
);
6655 /* C99 code may assign to an array in a constructed
6656 structure or union, and this has undefined behavior only
6657 on execution, so create a temporary if an lvalue is
6659 else if (fallback
== fb_lvalue
)
6661 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
6662 mark_addressable (*expr_p
);
6668 /* The following are special cases that are not handled by the
6669 original GIMPLE grammar. */
6671 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
6674 ret
= gimplify_save_expr (expr_p
, pre_p
, post_p
);
6679 enum gimplify_status r0
, r1
, r2
;
6681 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
6682 post_p
, is_gimple_lvalue
, fb_either
);
6683 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
,
6684 post_p
, is_gimple_val
, fb_rvalue
);
6685 r2
= gimplify_expr (&TREE_OPERAND (*expr_p
, 2), pre_p
,
6686 post_p
, is_gimple_val
, fb_rvalue
);
6687 recalculate_side_effects (*expr_p
);
6689 ret
= MIN (r0
, MIN (r1
, r2
));
6693 case NON_LVALUE_EXPR
:
6694 /* This should have been stripped above. */
6698 ret
= gimplify_asm_expr (expr_p
, pre_p
, post_p
);
6701 case TRY_FINALLY_EXPR
:
6702 case TRY_CATCH_EXPR
:
6704 gimple_seq eval
, cleanup
;
6707 eval
= cleanup
= NULL
;
6708 gimplify_and_add (TREE_OPERAND (*expr_p
, 0), &eval
);
6709 gimplify_and_add (TREE_OPERAND (*expr_p
, 1), &cleanup
);
6710 /* Don't create bogus GIMPLE_TRY with empty cleanup. */
6711 if (gimple_seq_empty_p (cleanup
))
6713 gimple_seq_add_seq (pre_p
, eval
);
6717 try_
= gimple_build_try (eval
, cleanup
,
6718 TREE_CODE (*expr_p
) == TRY_FINALLY_EXPR
6719 ? GIMPLE_TRY_FINALLY
6720 : GIMPLE_TRY_CATCH
);
6721 if (TREE_CODE (*expr_p
) == TRY_CATCH_EXPR
)
6722 gimple_try_set_catch_is_cleanup (try_
,
6723 TRY_CATCH_IS_CLEANUP (*expr_p
));
6724 gimplify_seq_add_stmt (pre_p
, try_
);
6729 case CLEANUP_POINT_EXPR
:
6730 ret
= gimplify_cleanup_point_expr (expr_p
, pre_p
);
6734 ret
= gimplify_target_expr (expr_p
, pre_p
, post_p
);
6740 gimple_seq handler
= NULL
;
6741 gimplify_and_add (CATCH_BODY (*expr_p
), &handler
);
6742 c
= gimple_build_catch (CATCH_TYPES (*expr_p
), handler
);
6743 gimplify_seq_add_stmt (pre_p
, c
);
6748 case EH_FILTER_EXPR
:
6751 gimple_seq failure
= NULL
;
6753 gimplify_and_add (EH_FILTER_FAILURE (*expr_p
), &failure
);
6754 ehf
= gimple_build_eh_filter (EH_FILTER_TYPES (*expr_p
), failure
);
6755 gimple_eh_filter_set_must_not_throw
6756 (ehf
, EH_FILTER_MUST_NOT_THROW (*expr_p
));
6757 gimplify_seq_add_stmt (pre_p
, ehf
);
6762 case CHANGE_DYNAMIC_TYPE_EXPR
:
6766 ret
= gimplify_expr (&CHANGE_DYNAMIC_TYPE_LOCATION (*expr_p
),
6767 pre_p
, post_p
, is_gimple_reg
, fb_lvalue
);
6768 cdt
= gimple_build_cdt (CHANGE_DYNAMIC_TYPE_NEW_TYPE (*expr_p
),
6769 CHANGE_DYNAMIC_TYPE_LOCATION (*expr_p
));
6770 gimplify_seq_add_stmt (pre_p
, cdt
);
6777 enum gimplify_status r0
, r1
;
6778 r0
= gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p
), pre_p
,
6779 post_p
, is_gimple_val
, fb_rvalue
);
6780 r1
= gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p
), pre_p
,
6781 post_p
, is_gimple_val
, fb_rvalue
);
6782 TREE_SIDE_EFFECTS (*expr_p
) = 0;
6788 /* We get here when taking the address of a label. We mark
6789 the label as "forced"; meaning it can never be removed and
6790 it is a potential target for any computed goto. */
6791 FORCED_LABEL (*expr_p
) = 1;
6795 case STATEMENT_LIST
:
6796 ret
= gimplify_statement_list (expr_p
, pre_p
);
6799 case WITH_SIZE_EXPR
:
6801 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
6802 post_p
== &internal_post
? NULL
: post_p
,
6803 gimple_test_f
, fallback
);
6804 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
6805 is_gimple_val
, fb_rvalue
);
6811 ret
= gimplify_var_or_parm_decl (expr_p
);
6815 /* When within an OpenMP context, notice uses of variables. */
6816 if (gimplify_omp_ctxp
)
6817 omp_notice_variable (gimplify_omp_ctxp
, *expr_p
, true);
6822 /* Allow callbacks into the gimplifier during optimization. */
6827 gimplify_omp_parallel (expr_p
, pre_p
);
6832 gimplify_omp_task (expr_p
, pre_p
);
6837 ret
= gimplify_omp_for (expr_p
, pre_p
);
6842 gimplify_omp_workshare (expr_p
, pre_p
);
6851 gimple_seq body
= NULL
;
6854 gimplify_and_add (OMP_BODY (*expr_p
), &body
);
6855 switch (TREE_CODE (*expr_p
))
6858 g
= gimple_build_omp_section (body
);
6861 g
= gimple_build_omp_master (body
);
6864 g
= gimple_build_omp_ordered (body
);
6867 g
= gimple_build_omp_critical (body
,
6868 OMP_CRITICAL_NAME (*expr_p
));
6873 gimplify_seq_add_stmt (pre_p
, g
);
6879 ret
= gimplify_omp_atomic (expr_p
, pre_p
);
6882 case POINTER_PLUS_EXPR
:
6883 /* Convert ((type *)A)+offset into &A->field_of_type_and_offset.
6884 The second is gimple immediate saving a need for extra statement.
6886 if (TREE_CODE (TREE_OPERAND (*expr_p
, 1)) == INTEGER_CST
6887 && (tmp
= maybe_fold_offset_to_address
6888 (TREE_OPERAND (*expr_p
, 0), TREE_OPERAND (*expr_p
, 1),
6889 TREE_TYPE (*expr_p
))))
6894 /* Convert (void *)&a + 4 into (void *)&a[1]. */
6895 if (TREE_CODE (TREE_OPERAND (*expr_p
, 0)) == NOP_EXPR
6896 && TREE_CODE (TREE_OPERAND (*expr_p
, 1)) == INTEGER_CST
6897 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p
,
6899 && (tmp
= maybe_fold_offset_to_address
6900 (TREE_OPERAND (TREE_OPERAND (*expr_p
, 0), 0),
6901 TREE_OPERAND (*expr_p
, 1),
6902 TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*expr_p
, 0),
6905 *expr_p
= fold_convert (TREE_TYPE (*expr_p
), tmp
);
6911 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p
)))
6913 case tcc_comparison
:
6914 /* Handle comparison of objects of non scalar mode aggregates
6915 with a call to memcmp. It would be nice to only have to do
6916 this for variable-sized objects, but then we'd have to allow
6917 the same nest of reference nodes we allow for MODIFY_EXPR and
6920 Compare scalar mode aggregates as scalar mode values. Using
6921 memcmp for them would be very inefficient at best, and is
6922 plain wrong if bitfields are involved. */
6924 tree type
= TREE_TYPE (TREE_OPERAND (*expr_p
, 1));
6926 if (!AGGREGATE_TYPE_P (type
))
6928 else if (TYPE_MODE (type
) != BLKmode
)
6929 ret
= gimplify_scalar_mode_aggregate_compare (expr_p
);
6931 ret
= gimplify_variable_sized_compare (expr_p
);
6936 /* If *EXPR_P does not need to be special-cased, handle it
6937 according to its class. */
6939 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
6940 post_p
, is_gimple_val
, fb_rvalue
);
6946 enum gimplify_status r0
, r1
;
6948 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
6949 post_p
, is_gimple_val
, fb_rvalue
);
6950 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
,
6951 post_p
, is_gimple_val
, fb_rvalue
);
6957 case tcc_declaration
:
6960 goto dont_recalculate
;
6963 gcc_assert (TREE_CODE (*expr_p
) == TRUTH_AND_EXPR
6964 || TREE_CODE (*expr_p
) == TRUTH_OR_EXPR
6965 || TREE_CODE (*expr_p
) == TRUTH_XOR_EXPR
);
6969 recalculate_side_effects (*expr_p
);
6975 /* If we replaced *expr_p, gimplify again. */
6976 if (ret
== GS_OK
&& (*expr_p
== NULL
|| *expr_p
== save_expr
))
6979 while (ret
== GS_OK
);
6981 /* If we encountered an error_mark somewhere nested inside, either
6982 stub out the statement or propagate the error back out. */
6983 if (ret
== GS_ERROR
)
6990 /* This was only valid as a return value from the langhook, which
6991 we handled. Make sure it doesn't escape from any other context. */
6992 gcc_assert (ret
!= GS_UNHANDLED
);
6994 if (fallback
== fb_none
&& *expr_p
&& !is_gimple_stmt (*expr_p
))
6996 /* We aren't looking for a value, and we don't have a valid
6997 statement. If it doesn't have side-effects, throw it away. */
6998 if (!TREE_SIDE_EFFECTS (*expr_p
))
7000 else if (!TREE_THIS_VOLATILE (*expr_p
))
7002 /* This is probably a _REF that contains something nested that
7003 has side effects. Recurse through the operands to find it. */
7004 enum tree_code code
= TREE_CODE (*expr_p
);
7011 case VIEW_CONVERT_EXPR
:
7012 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
7013 gimple_test_f
, fallback
);
7017 case ARRAY_RANGE_REF
:
7018 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
7019 gimple_test_f
, fallback
);
7020 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
7021 gimple_test_f
, fallback
);
7025 /* Anything else with side-effects must be converted to
7026 a valid statement before we get here. */
7032 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p
))
7033 && TYPE_MODE (TREE_TYPE (*expr_p
)) != BLKmode
)
7035 /* Historically, the compiler has treated a bare reference
7036 to a non-BLKmode volatile lvalue as forcing a load. */
7037 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p
));
7039 /* Normally, we do not want to create a temporary for a
7040 TREE_ADDRESSABLE type because such a type should not be
7041 copied by bitwise-assignment. However, we make an
7042 exception here, as all we are doing here is ensuring that
7043 we read the bytes that make up the type. We use
7044 create_tmp_var_raw because create_tmp_var will abort when
7045 given a TREE_ADDRESSABLE type. */
7046 tree tmp
= create_tmp_var_raw (type
, "vol");
7047 gimple_add_tmp_var (tmp
);
7048 gimplify_assign (tmp
, *expr_p
, pre_p
);
7052 /* We can't do anything useful with a volatile reference to
7053 an incomplete type, so just throw it away. Likewise for
7054 a BLKmode type, since any implicit inner load should
7055 already have been turned into an explicit one by the
7056 gimplification process. */
7060 /* If we are gimplifying at the statement level, we're done. Tack
7061 everything together and return. */
7062 if (fallback
== fb_none
|| is_statement
)
7064 /* Since *EXPR_P has been converted into a GIMPLE tuple, clear
7065 it out for GC to reclaim it. */
7066 *expr_p
= NULL_TREE
;
7068 if (!gimple_seq_empty_p (internal_pre
)
7069 || !gimple_seq_empty_p (internal_post
))
7071 gimplify_seq_add_seq (&internal_pre
, internal_post
);
7072 gimplify_seq_add_seq (pre_p
, internal_pre
);
7075 /* The result of gimplifying *EXPR_P is going to be the last few
7076 statements in *PRE_P and *POST_P. Add location information
7077 to all the statements that were added by the gimplification
7079 if (!gimple_seq_empty_p (*pre_p
))
7080 annotate_all_with_location_after (*pre_p
, pre_last_gsi
, input_location
);
7082 if (!gimple_seq_empty_p (*post_p
))
7083 annotate_all_with_location_after (*post_p
, post_last_gsi
,
7089 #ifdef ENABLE_GIMPLE_CHECKING
7092 enum tree_code code
= TREE_CODE (*expr_p
);
7093 /* These expressions should already be in gimple IR form. */
7094 gcc_assert (code
!= MODIFY_EXPR
7096 && code
!= BIND_EXPR
7097 && code
!= CATCH_EXPR
7098 && (code
!= COND_EXPR
|| gimplify_ctxp
->allow_rhs_cond_expr
)
7099 && code
!= EH_FILTER_EXPR
7100 && code
!= GOTO_EXPR
7101 && code
!= LABEL_EXPR
7102 && code
!= LOOP_EXPR
7103 && code
!= RESX_EXPR
7104 && code
!= SWITCH_EXPR
7105 && code
!= TRY_FINALLY_EXPR
7106 && code
!= OMP_CRITICAL
7108 && code
!= OMP_MASTER
7109 && code
!= OMP_ORDERED
7110 && code
!= OMP_PARALLEL
7111 && code
!= OMP_SECTIONS
7112 && code
!= OMP_SECTION
7113 && code
!= OMP_SINGLE
);
7117 /* Otherwise we're gimplifying a subexpression, so the resulting
7118 value is interesting. If it's a valid operand that matches
7119 GIMPLE_TEST_F, we're done. Unless we are handling some
7120 post-effects internally; if that's the case, we need to copy into
7121 a temporary before adding the post-effects to POST_P. */
7122 if (gimple_seq_empty_p (internal_post
) && (*gimple_test_f
) (*expr_p
))
7125 /* Otherwise, we need to create a new temporary for the gimplified
7128 /* We can't return an lvalue if we have an internal postqueue. The
7129 object the lvalue refers to would (probably) be modified by the
7130 postqueue; we need to copy the value out first, which means an
7132 if ((fallback
& fb_lvalue
)
7133 && gimple_seq_empty_p (internal_post
)
7134 && is_gimple_addressable (*expr_p
))
7136 /* An lvalue will do. Take the address of the expression, store it
7137 in a temporary, and replace the expression with an INDIRECT_REF of
7139 tmp
= build_fold_addr_expr (*expr_p
);
7140 gimplify_expr (&tmp
, pre_p
, post_p
, is_gimple_reg
, fb_rvalue
);
7141 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (tmp
)), tmp
);
7143 else if ((fallback
& fb_rvalue
) && is_gimple_reg_rhs_or_call (*expr_p
))
7145 /* An rvalue will do. Assign the gimplified expression into a
7146 new temporary TMP and replace the original expression with
7147 TMP. First, make sure that the expression has a type so that
7148 it can be assigned into a temporary. */
7149 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p
)));
7151 if (!gimple_seq_empty_p (internal_post
) || (fallback
& fb_lvalue
))
7152 /* The postqueue might change the value of the expression between
7153 the initialization and use of the temporary, so we can't use a
7154 formal temp. FIXME do we care? */
7155 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
7157 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
7161 #ifdef ENABLE_GIMPLE_CHECKING
7162 if (!(fallback
& fb_mayfail
))
7164 fprintf (stderr
, "gimplification failed:\n");
7165 print_generic_expr (stderr
, *expr_p
, 0);
7166 debug_tree (*expr_p
);
7167 internal_error ("gimplification failed");
7170 gcc_assert (fallback
& fb_mayfail
);
7172 /* If this is an asm statement, and the user asked for the
7173 impossible, don't die. Fail and let gimplify_asm_expr
7179 /* Make sure the temporary matches our predicate. */
7180 gcc_assert ((*gimple_test_f
) (*expr_p
));
7182 if (!gimple_seq_empty_p (internal_post
))
7184 annotate_all_with_location (internal_post
, input_location
);
7185 gimplify_seq_add_seq (pre_p
, internal_post
);
7189 input_location
= saved_location
;
7193 /* Look through TYPE for variable-sized objects and gimplify each such
7194 size that we find. Add to LIST_P any statements generated. */
7197 gimplify_type_sizes (tree type
, gimple_seq
*list_p
)
7201 if (type
== NULL
|| type
== error_mark_node
)
7204 /* We first do the main variant, then copy into any other variants. */
7205 type
= TYPE_MAIN_VARIANT (type
);
7207 /* Avoid infinite recursion. */
7208 if (TYPE_SIZES_GIMPLIFIED (type
))
7211 TYPE_SIZES_GIMPLIFIED (type
) = 1;
7213 switch (TREE_CODE (type
))
7219 case FIXED_POINT_TYPE
:
7220 gimplify_one_sizepos (&TYPE_MIN_VALUE (type
), list_p
);
7221 gimplify_one_sizepos (&TYPE_MAX_VALUE (type
), list_p
);
7223 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
7225 TYPE_MIN_VALUE (t
) = TYPE_MIN_VALUE (type
);
7226 TYPE_MAX_VALUE (t
) = TYPE_MAX_VALUE (type
);
7231 /* These types may not have declarations, so handle them here. */
7232 gimplify_type_sizes (TREE_TYPE (type
), list_p
);
7233 gimplify_type_sizes (TYPE_DOMAIN (type
), list_p
);
7234 /* When not optimizing, ensure VLA bounds aren't removed. */
7236 && TYPE_DOMAIN (type
)
7237 && INTEGRAL_TYPE_P (TYPE_DOMAIN (type
)))
7239 t
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
7240 if (t
&& TREE_CODE (t
) == VAR_DECL
&& DECL_ARTIFICIAL (t
))
7241 DECL_IGNORED_P (t
) = 0;
7242 t
= TYPE_MAX_VALUE (TYPE_DOMAIN (type
));
7243 if (t
&& TREE_CODE (t
) == VAR_DECL
&& DECL_ARTIFICIAL (t
))
7244 DECL_IGNORED_P (t
) = 0;
7250 case QUAL_UNION_TYPE
:
7251 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
7252 if (TREE_CODE (field
) == FIELD_DECL
)
7254 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field
), list_p
);
7255 gimplify_one_sizepos (&DECL_SIZE (field
), list_p
);
7256 gimplify_one_sizepos (&DECL_SIZE_UNIT (field
), list_p
);
7257 gimplify_type_sizes (TREE_TYPE (field
), list_p
);
7262 case REFERENCE_TYPE
:
7263 /* We used to recurse on the pointed-to type here, which turned out to
7264 be incorrect because its definition might refer to variables not
7265 yet initialized at this point if a forward declaration is involved.
7267 It was actually useful for anonymous pointed-to types to ensure
7268 that the sizes evaluation dominates every possible later use of the
7269 values. Restricting to such types here would be safe since there
7270 is no possible forward declaration around, but would introduce an
7271 undesirable middle-end semantic to anonymity. We then defer to
7272 front-ends the responsibility of ensuring that the sizes are
7273 evaluated both early and late enough, e.g. by attaching artificial
7274 type declarations to the tree. */
7281 gimplify_one_sizepos (&TYPE_SIZE (type
), list_p
);
7282 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type
), list_p
);
7284 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
7286 TYPE_SIZE (t
) = TYPE_SIZE (type
);
7287 TYPE_SIZE_UNIT (t
) = TYPE_SIZE_UNIT (type
);
7288 TYPE_SIZES_GIMPLIFIED (t
) = 1;
7292 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
7293 a size or position, has had all of its SAVE_EXPRs evaluated.
7294 We add any required statements to *STMT_P. */
7297 gimplify_one_sizepos (tree
*expr_p
, gimple_seq
*stmt_p
)
7299 tree type
, expr
= *expr_p
;
7301 /* We don't do anything if the value isn't there, is constant, or contains
7302 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
7303 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
7304 will want to replace it with a new variable, but that will cause problems
7305 if this type is from outside the function. It's OK to have that here. */
7306 if (expr
== NULL_TREE
|| TREE_CONSTANT (expr
)
7307 || TREE_CODE (expr
) == VAR_DECL
7308 || CONTAINS_PLACEHOLDER_P (expr
))
7311 type
= TREE_TYPE (expr
);
7312 *expr_p
= unshare_expr (expr
);
7314 gimplify_expr (expr_p
, stmt_p
, NULL
, is_gimple_val
, fb_rvalue
);
7317 /* Verify that we've an exact type match with the original expression.
7318 In particular, we do not wish to drop a "sizetype" in favour of a
7319 type of similar dimensions. We don't want to pollute the generic
7320 type-stripping code with this knowledge because it doesn't matter
7321 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
7322 and friends retain their "sizetype-ness". */
7323 if (TREE_TYPE (expr
) != type
7324 && TREE_CODE (type
) == INTEGER_TYPE
7325 && TYPE_IS_SIZETYPE (type
))
7330 *expr_p
= create_tmp_var (type
, NULL
);
7331 tmp
= build1 (NOP_EXPR
, type
, expr
);
7332 stmt
= gimplify_assign (*expr_p
, tmp
, stmt_p
);
7333 if (EXPR_HAS_LOCATION (expr
))
7334 gimple_set_location (stmt
, *EXPR_LOCUS (expr
));
7336 gimple_set_location (stmt
, input_location
);
7341 /* Gimplify the body of statements pointed to by BODY_P and return a
7342 GIMPLE_BIND containing the sequence of GIMPLE statements
7343 corresponding to BODY_P. FNDECL is the function decl containing
7347 gimplify_body (tree
*body_p
, tree fndecl
, bool do_parms
)
7349 location_t saved_location
= input_location
;
7350 gimple_seq parm_stmts
, seq
;
7352 struct gimplify_ctx gctx
;
7354 timevar_push (TV_TREE_GIMPLIFY
);
7356 /* Initialize for optimize_insn_for_s{ize,peed}_p possibly called during
7358 default_rtl_profile ();
7360 gcc_assert (gimplify_ctxp
== NULL
);
7361 push_gimplify_context (&gctx
);
7363 /* Unshare most shared trees in the body and in that of any nested functions.
7364 It would seem we don't have to do this for nested functions because
7365 they are supposed to be output and then the outer function gimplified
7366 first, but the g++ front end doesn't always do it that way. */
7367 unshare_body (body_p
, fndecl
);
7368 unvisit_body (body_p
, fndecl
);
7370 /* Make sure input_location isn't set to something weird. */
7371 input_location
= DECL_SOURCE_LOCATION (fndecl
);
7373 /* Resolve callee-copies. This has to be done before processing
7374 the body so that DECL_VALUE_EXPR gets processed correctly. */
7375 parm_stmts
= (do_parms
) ? gimplify_parameters () : NULL
;
7377 /* Gimplify the function's body. */
7379 gimplify_stmt (body_p
, &seq
);
7380 outer_bind
= gimple_seq_first_stmt (seq
);
7383 outer_bind
= gimple_build_nop ();
7384 gimplify_seq_add_stmt (&seq
, outer_bind
);
7387 /* The body must contain exactly one statement, a GIMPLE_BIND. If this is
7388 not the case, wrap everything in a GIMPLE_BIND to make it so. */
7389 if (gimple_code (outer_bind
) == GIMPLE_BIND
7390 && gimple_seq_first (seq
) == gimple_seq_last (seq
))
7393 outer_bind
= gimple_build_bind (NULL_TREE
, seq
, NULL
);
7395 *body_p
= NULL_TREE
;
7397 /* If we had callee-copies statements, insert them at the beginning
7399 if (!gimple_seq_empty_p (parm_stmts
))
7401 gimplify_seq_add_seq (&parm_stmts
, gimple_bind_body (outer_bind
));
7402 gimple_bind_set_body (outer_bind
, parm_stmts
);
7405 pop_gimplify_context (outer_bind
);
7406 gcc_assert (gimplify_ctxp
== NULL
);
7408 #ifdef ENABLE_TYPES_CHECKING
7409 if (!errorcount
&& !sorrycount
)
7410 verify_types_in_gimple_seq (gimple_bind_body (outer_bind
));
7413 timevar_pop (TV_TREE_GIMPLIFY
);
7414 input_location
= saved_location
;
7419 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
7420 node for the function we want to gimplify.
7422 Returns the sequence of GIMPLE statements corresponding to the body
7426 gimplify_function_tree (tree fndecl
)
7428 tree oldfn
, parm
, ret
;
7432 oldfn
= current_function_decl
;
7433 current_function_decl
= fndecl
;
7434 if (DECL_STRUCT_FUNCTION (fndecl
))
7435 push_cfun (DECL_STRUCT_FUNCTION (fndecl
));
7437 push_struct_function (fndecl
);
7439 for (parm
= DECL_ARGUMENTS (fndecl
); parm
; parm
= TREE_CHAIN (parm
))
7441 /* Preliminarily mark non-addressed complex variables as eligible
7442 for promotion to gimple registers. We'll transform their uses
7444 if ((TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
7445 || TREE_CODE (TREE_TYPE (parm
)) == VECTOR_TYPE
)
7446 && !TREE_THIS_VOLATILE (parm
)
7447 && !needs_to_live_in_memory (parm
))
7448 DECL_GIMPLE_REG_P (parm
) = 1;
7451 ret
= DECL_RESULT (fndecl
);
7452 if ((TREE_CODE (TREE_TYPE (ret
)) == COMPLEX_TYPE
7453 || TREE_CODE (TREE_TYPE (ret
)) == VECTOR_TYPE
)
7454 && !needs_to_live_in_memory (ret
))
7455 DECL_GIMPLE_REG_P (ret
) = 1;
7457 bind
= gimplify_body (&DECL_SAVED_TREE (fndecl
), fndecl
, true);
7459 /* The tree body of the function is no longer needed, replace it
7460 with the new GIMPLE body. */
7461 seq
= gimple_seq_alloc ();
7462 gimple_seq_add_stmt (&seq
, bind
);
7463 gimple_set_body (fndecl
, seq
);
7465 /* If we're instrumenting function entry/exit, then prepend the call to
7466 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
7467 catch the exit hook. */
7468 /* ??? Add some way to ignore exceptions for this TFE. */
7469 if (flag_instrument_function_entry_exit
7470 && !DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl
)
7471 && !flag_instrument_functions_exclude_p (fndecl
))
7476 gimple_seq cleanup
= NULL
, body
= NULL
;
7478 x
= implicit_built_in_decls
[BUILT_IN_PROFILE_FUNC_EXIT
];
7479 gimplify_seq_add_stmt (&cleanup
, gimple_build_call (x
, 0));
7480 tf
= gimple_build_try (seq
, cleanup
, GIMPLE_TRY_FINALLY
);
7482 x
= implicit_built_in_decls
[BUILT_IN_PROFILE_FUNC_ENTER
];
7483 gimplify_seq_add_stmt (&body
, gimple_build_call (x
, 0));
7484 gimplify_seq_add_stmt (&body
, tf
);
7485 new_bind
= gimple_build_bind (NULL
, body
, gimple_bind_block (bind
));
7486 /* Clear the block for BIND, since it is no longer directly inside
7487 the function, but within a try block. */
7488 gimple_bind_set_block (bind
, NULL
);
7490 /* Replace the current function body with the body
7491 wrapped in the try/finally TF. */
7492 seq
= gimple_seq_alloc ();
7493 gimple_seq_add_stmt (&seq
, new_bind
);
7494 gimple_set_body (fndecl
, seq
);
7497 DECL_SAVED_TREE (fndecl
) = NULL_TREE
;
7499 current_function_decl
= oldfn
;
7504 /* Some transformations like inlining may invalidate the GIMPLE form
7505 for operands. This function traverses all the operands in STMT and
7506 gimplifies anything that is not a valid gimple operand. Any new
7507 GIMPLE statements are inserted before *GSI_P. */
7510 gimple_regimplify_operands (gimple stmt
, gimple_stmt_iterator
*gsi_p
)
7513 tree orig_lhs
= NULL_TREE
, lhs
, t
;
7514 gimple_seq pre
= NULL
;
7515 gimple post_stmt
= NULL
;
7516 struct gimplify_ctx gctx
;
7518 push_gimplify_context (&gctx
);
7519 gimplify_ctxp
->into_ssa
= gimple_in_ssa_p (cfun
);
7521 switch (gimple_code (stmt
))
7524 gimplify_expr (gimple_cond_lhs_ptr (stmt
), &pre
, NULL
,
7525 is_gimple_val
, fb_rvalue
);
7526 gimplify_expr (gimple_cond_rhs_ptr (stmt
), &pre
, NULL
,
7527 is_gimple_val
, fb_rvalue
);
7530 gimplify_expr (gimple_switch_index_ptr (stmt
), &pre
, NULL
,
7531 is_gimple_val
, fb_rvalue
);
7533 case GIMPLE_OMP_ATOMIC_LOAD
:
7534 gimplify_expr (gimple_omp_atomic_load_rhs_ptr (stmt
), &pre
, NULL
,
7535 is_gimple_val
, fb_rvalue
);
7539 size_t i
, noutputs
= gimple_asm_noutputs (stmt
);
7540 const char *constraint
, **oconstraints
;
7541 bool allows_mem
, allows_reg
, is_inout
;
7544 = (const char **) alloca ((noutputs
) * sizeof (const char *));
7545 for (i
= 0; i
< noutputs
; i
++)
7547 tree op
= gimple_asm_output_op (stmt
, i
);
7548 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op
)));
7549 oconstraints
[i
] = constraint
;
7550 parse_output_constraint (&constraint
, i
, 0, 0, &allows_mem
,
7551 &allows_reg
, &is_inout
);
7552 gimplify_expr (&TREE_VALUE (op
), &pre
, NULL
,
7553 is_inout
? is_gimple_min_lval
: is_gimple_lvalue
,
7554 fb_lvalue
| fb_mayfail
);
7556 for (i
= 0; i
< gimple_asm_ninputs (stmt
); i
++)
7558 tree op
= gimple_asm_input_op (stmt
, i
);
7559 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op
)));
7560 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
7561 oconstraints
, &allows_mem
, &allows_reg
);
7562 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (op
))) && allows_mem
)
7564 if (!allows_reg
&& allows_mem
)
7565 gimplify_expr (&TREE_VALUE (op
), &pre
, NULL
,
7566 is_gimple_lvalue
, fb_lvalue
| fb_mayfail
);
7568 gimplify_expr (&TREE_VALUE (op
), &pre
, NULL
,
7569 is_gimple_asm_val
, fb_rvalue
);
7574 /* NOTE: We start gimplifying operands from last to first to
7575 make sure that side-effects on the RHS of calls, assignments
7576 and ASMs are executed before the LHS. The ordering is not
7577 important for other statements. */
7578 num_ops
= gimple_num_ops (stmt
);
7579 orig_lhs
= gimple_get_lhs (stmt
);
7580 for (i
= num_ops
; i
> 0; i
--)
7582 tree op
= gimple_op (stmt
, i
- 1);
7583 if (op
== NULL_TREE
)
7585 if (i
== 1 && (is_gimple_call (stmt
) || is_gimple_assign (stmt
)))
7586 gimplify_expr (&op
, &pre
, NULL
, is_gimple_lvalue
, fb_lvalue
);
7588 && is_gimple_assign (stmt
)
7590 && get_gimple_rhs_class (gimple_expr_code (stmt
))
7591 == GIMPLE_SINGLE_RHS
)
7592 gimplify_expr (&op
, &pre
, NULL
,
7593 rhs_predicate_for (gimple_assign_lhs (stmt
)),
7595 else if (i
== 2 && is_gimple_call (stmt
))
7597 if (TREE_CODE (op
) == FUNCTION_DECL
)
7599 gimplify_expr (&op
, &pre
, NULL
, is_gimple_call_addr
, fb_rvalue
);
7602 gimplify_expr (&op
, &pre
, NULL
, is_gimple_val
, fb_rvalue
);
7603 gimple_set_op (stmt
, i
- 1, op
);
7606 lhs
= gimple_get_lhs (stmt
);
7607 /* If the LHS changed it in a way that requires a simple RHS,
7608 create temporary. */
7609 if (lhs
&& !is_gimple_reg (lhs
))
7611 bool need_temp
= false;
7613 if (is_gimple_assign (stmt
)
7615 && get_gimple_rhs_class (gimple_expr_code (stmt
))
7616 == GIMPLE_SINGLE_RHS
)
7617 gimplify_expr (gimple_assign_rhs1_ptr (stmt
), &pre
, NULL
,
7618 rhs_predicate_for (gimple_assign_lhs (stmt
)),
7620 else if (is_gimple_reg (lhs
))
7622 if (is_gimple_reg_type (TREE_TYPE (lhs
)))
7624 if (is_gimple_call (stmt
))
7626 i
= gimple_call_flags (stmt
);
7627 if ((i
& ECF_LOOPING_CONST_OR_PURE
)
7628 || !(i
& (ECF_CONST
| ECF_PURE
)))
7631 if (stmt_can_throw_internal (stmt
))
7637 if (is_gimple_reg_type (TREE_TYPE (lhs
)))
7639 else if (TYPE_MODE (TREE_TYPE (lhs
)) != BLKmode
)
7641 if (is_gimple_call (stmt
))
7643 tree fndecl
= gimple_call_fndecl (stmt
);
7645 if (!aggregate_value_p (TREE_TYPE (lhs
), fndecl
)
7646 && !(fndecl
&& DECL_RESULT (fndecl
)
7647 && DECL_BY_REFERENCE (DECL_RESULT (fndecl
))))
7656 tree temp
= create_tmp_var (TREE_TYPE (lhs
), NULL
);
7658 if (TREE_CODE (TREE_TYPE (lhs
)) == COMPLEX_TYPE
7659 || TREE_CODE (TREE_TYPE (lhs
)) == VECTOR_TYPE
)
7660 DECL_GIMPLE_REG_P (temp
) = 1;
7661 if (TREE_CODE (orig_lhs
) == SSA_NAME
)
7662 orig_lhs
= SSA_NAME_VAR (orig_lhs
);
7663 if (TREE_CODE (orig_lhs
) == VAR_DECL
7664 && DECL_BASED_ON_RESTRICT_P (orig_lhs
))
7666 DECL_BASED_ON_RESTRICT_P (temp
) = 1;
7667 SET_DECL_RESTRICT_BASE (temp
,
7668 DECL_GET_RESTRICT_BASE (orig_lhs
));
7671 if (gimple_in_ssa_p (cfun
))
7672 temp
= make_ssa_name (temp
, NULL
);
7673 gimple_set_lhs (stmt
, temp
);
7674 post_stmt
= gimple_build_assign (lhs
, temp
);
7675 if (TREE_CODE (lhs
) == SSA_NAME
)
7676 SSA_NAME_DEF_STMT (lhs
) = post_stmt
;
7682 if (gimple_referenced_vars (cfun
))
7683 for (t
= gimplify_ctxp
->temps
; t
; t
= TREE_CHAIN (t
))
7684 add_referenced_var (t
);
7686 if (!gimple_seq_empty_p (pre
))
7688 if (gimple_in_ssa_p (cfun
))
7690 gimple_stmt_iterator i
;
7692 for (i
= gsi_start (pre
); !gsi_end_p (i
); gsi_next (&i
))
7693 mark_symbols_for_renaming (gsi_stmt (i
));
7695 gsi_insert_seq_before (gsi_p
, pre
, GSI_SAME_STMT
);
7698 gsi_insert_after (gsi_p
, post_stmt
, GSI_NEW_STMT
);
7700 pop_gimplify_context (NULL
);
7704 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
7705 force the result to be either ssa_name or an invariant, otherwise
7706 just force it to be a rhs expression. If VAR is not NULL, make the
7707 base variable of the final destination be VAR if suitable. */
7710 force_gimple_operand (tree expr
, gimple_seq
*stmts
, bool simple
, tree var
)
7713 enum gimplify_status ret
;
7714 gimple_predicate gimple_test_f
;
7715 struct gimplify_ctx gctx
;
7719 if (is_gimple_val (expr
))
7722 gimple_test_f
= simple
? is_gimple_val
: is_gimple_reg_rhs
;
7724 push_gimplify_context (&gctx
);
7725 gimplify_ctxp
->into_ssa
= gimple_in_ssa_p (cfun
);
7726 gimplify_ctxp
->allow_rhs_cond_expr
= true;
7729 expr
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, expr
);
7731 if (TREE_CODE (expr
) != MODIFY_EXPR
7732 && TREE_TYPE (expr
) == void_type_node
)
7734 gimplify_and_add (expr
, stmts
);
7739 ret
= gimplify_expr (&expr
, stmts
, NULL
, gimple_test_f
, fb_rvalue
);
7740 gcc_assert (ret
!= GS_ERROR
);
7743 if (gimple_referenced_vars (cfun
))
7744 for (t
= gimplify_ctxp
->temps
; t
; t
= TREE_CHAIN (t
))
7745 add_referenced_var (t
);
7747 pop_gimplify_context (NULL
);
7752 /* Invokes force_gimple_operand for EXPR with parameters SIMPLE_P and VAR. If
7753 some statements are produced, emits them at GSI. If BEFORE is true.
7754 the statements are appended before GSI, otherwise they are appended after
7755 it. M specifies the way GSI moves after insertion (GSI_SAME_STMT or
7756 GSI_CONTINUE_LINKING are the usual values). */
7759 force_gimple_operand_gsi (gimple_stmt_iterator
*gsi
, tree expr
,
7760 bool simple_p
, tree var
, bool before
,
7761 enum gsi_iterator_update m
)
7765 expr
= force_gimple_operand (expr
, &stmts
, simple_p
, var
);
7767 if (!gimple_seq_empty_p (stmts
))
7769 if (gimple_in_ssa_p (cfun
))
7771 gimple_stmt_iterator i
;
7773 for (i
= gsi_start (stmts
); !gsi_end_p (i
); gsi_next (&i
))
7774 mark_symbols_for_renaming (gsi_stmt (i
));
7778 gsi_insert_seq_before (gsi
, stmts
, m
);
7780 gsi_insert_seq_after (gsi
, stmts
, m
);
7786 #include "gt-gimplify.h"