1 /* Tree lowering pass. This pass converts the GENERIC functions-as-trees
2 tree representation into the GIMPLE form.
3 Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011,
4 2012 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"
30 #include "tree-iterator.h"
31 #include "tree-inline.h"
32 #include "tree-pretty-print.h"
33 #include "langhooks.h"
34 #include "tree-flow.h"
41 #include "diagnostic-core.h"
43 #include "pointer-set.h"
44 #include "splay-tree.h"
48 #include "langhooks-def.h" /* FIXME: for lhd_set_decl_assembler_name */
49 #include "tree-pass.h" /* FIXME: only for PROP_gimple_any */
51 enum gimplify_omp_var_data
57 GOVD_FIRSTPRIVATE
= 16,
58 GOVD_LASTPRIVATE
= 32,
61 GOVD_DEBUG_PRIVATE
= 256,
62 GOVD_PRIVATE_OUTER_REF
= 512,
63 GOVD_DATA_SHARE_CLASS
= (GOVD_SHARED
| GOVD_PRIVATE
| GOVD_FIRSTPRIVATE
64 | GOVD_LASTPRIVATE
| GOVD_REDUCTION
| GOVD_LOCAL
)
72 ORT_COMBINED_PARALLEL
= 3,
77 struct gimplify_omp_ctx
79 struct gimplify_omp_ctx
*outer_context
;
81 struct pointer_set_t
*privatized_types
;
83 enum omp_clause_default_kind default_kind
;
84 enum omp_region_type region_type
;
87 static struct gimplify_ctx
*gimplify_ctxp
;
88 static struct gimplify_omp_ctx
*gimplify_omp_ctxp
;
91 /* Formal (expression) temporary table handling: multiple occurrences of
92 the same scalar expression are evaluated into the same temporary. */
94 typedef struct gimple_temp_hash_elt
97 tree temp
; /* Value */
100 /* Forward declaration. */
101 static enum gimplify_status
gimplify_compound_expr (tree
*, gimple_seq
*, bool);
103 /* Mark X addressable. Unlike the langhook we expect X to be in gimple
104 form and we don't do any syntax checking. */
107 mark_addressable (tree x
)
109 while (handled_component_p (x
))
110 x
= TREE_OPERAND (x
, 0);
111 if (TREE_CODE (x
) == MEM_REF
112 && TREE_CODE (TREE_OPERAND (x
, 0)) == ADDR_EXPR
)
113 x
= TREE_OPERAND (TREE_OPERAND (x
, 0), 0);
114 if (TREE_CODE (x
) != VAR_DECL
115 && TREE_CODE (x
) != PARM_DECL
116 && TREE_CODE (x
) != RESULT_DECL
)
118 TREE_ADDRESSABLE (x
) = 1;
121 /* Return a hash value for a formal temporary table entry. */
124 gimple_tree_hash (const void *p
)
126 tree t
= ((const elt_t
*) p
)->val
;
127 return iterative_hash_expr (t
, 0);
130 /* Compare two formal temporary table entries. */
133 gimple_tree_eq (const void *p1
, const void *p2
)
135 tree t1
= ((const elt_t
*) p1
)->val
;
136 tree t2
= ((const elt_t
*) p2
)->val
;
137 enum tree_code code
= TREE_CODE (t1
);
139 if (TREE_CODE (t2
) != code
140 || TREE_TYPE (t1
) != TREE_TYPE (t2
))
143 if (!operand_equal_p (t1
, t2
, 0))
146 #ifdef ENABLE_CHECKING
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
));
155 /* Link gimple statement GS to the end of the sequence *SEQ_P. If
156 *SEQ_P is NULL, a new sequence is allocated. This function is
157 similar to gimple_seq_add_stmt, but does not scan the operands.
158 During gimplification, we need to manipulate statement sequences
159 before the def/use vectors have been constructed. */
162 gimple_seq_add_stmt_without_update (gimple_seq
*seq_p
, gimple gs
)
164 gimple_stmt_iterator si
;
169 si
= gsi_last (*seq_p
);
170 gsi_insert_after_without_update (&si
, gs
, GSI_NEW_STMT
);
173 /* Shorter alias name for the above function for use in gimplify.c
177 gimplify_seq_add_stmt (gimple_seq
*seq_p
, gimple gs
)
179 gimple_seq_add_stmt_without_update (seq_p
, gs
);
182 /* Append sequence SRC to the end of sequence *DST_P. If *DST_P is
183 NULL, a new sequence is allocated. This function is
184 similar to gimple_seq_add_seq, but does not scan the operands.
185 During gimplification, we need to manipulate statement sequences
186 before the def/use vectors have been constructed. */
189 gimplify_seq_add_seq (gimple_seq
*dst_p
, gimple_seq src
)
191 gimple_stmt_iterator si
;
196 si
= gsi_last (*dst_p
);
197 gsi_insert_seq_after_without_update (&si
, src
, GSI_NEW_STMT
);
200 /* Set up a context for the gimplifier. */
203 push_gimplify_context (struct gimplify_ctx
*c
)
205 memset (c
, '\0', sizeof (*c
));
206 c
->prev_context
= gimplify_ctxp
;
210 /* Tear down a context for the gimplifier. If BODY is non-null, then
211 put the temporaries into the outer BIND_EXPR. Otherwise, put them
214 BODY is not a sequence, but the first tuple in a sequence. */
217 pop_gimplify_context (gimple body
)
219 struct gimplify_ctx
*c
= gimplify_ctxp
;
221 gcc_assert (c
&& (c
->bind_expr_stack
== NULL
222 || VEC_empty (gimple
, c
->bind_expr_stack
)));
223 VEC_free (gimple
, heap
, c
->bind_expr_stack
);
224 gimplify_ctxp
= c
->prev_context
;
227 declare_vars (c
->temps
, body
, false);
229 record_vars (c
->temps
);
232 htab_delete (c
->temp_htab
);
235 /* Push a GIMPLE_BIND tuple onto the stack of bindings. */
238 gimple_push_bind_expr (gimple gimple_bind
)
240 if (gimplify_ctxp
->bind_expr_stack
== NULL
)
241 gimplify_ctxp
->bind_expr_stack
= VEC_alloc (gimple
, heap
, 8);
242 VEC_safe_push (gimple
, heap
, gimplify_ctxp
->bind_expr_stack
, gimple_bind
);
245 /* Pop the first element off the stack of bindings. */
248 gimple_pop_bind_expr (void)
250 VEC_pop (gimple
, gimplify_ctxp
->bind_expr_stack
);
253 /* Return the first element of the stack of bindings. */
256 gimple_current_bind_expr (void)
258 return VEC_last (gimple
, gimplify_ctxp
->bind_expr_stack
);
261 /* Return the stack of bindings created during gimplification. */
264 gimple_bind_expr_stack (void)
266 return gimplify_ctxp
->bind_expr_stack
;
269 /* Return true iff there is a COND_EXPR between us and the innermost
270 CLEANUP_POINT_EXPR. This info is used by gimple_push_cleanup. */
273 gimple_conditional_context (void)
275 return gimplify_ctxp
->conditions
> 0;
278 /* Note that we've entered a COND_EXPR. */
281 gimple_push_condition (void)
283 #ifdef ENABLE_GIMPLE_CHECKING
284 if (gimplify_ctxp
->conditions
== 0)
285 gcc_assert (gimple_seq_empty_p (gimplify_ctxp
->conditional_cleanups
));
287 ++(gimplify_ctxp
->conditions
);
290 /* Note that we've left a COND_EXPR. If we're back at unconditional scope
291 now, add any conditional cleanups we've seen to the prequeue. */
294 gimple_pop_condition (gimple_seq
*pre_p
)
296 int conds
= --(gimplify_ctxp
->conditions
);
298 gcc_assert (conds
>= 0);
301 gimplify_seq_add_seq (pre_p
, gimplify_ctxp
->conditional_cleanups
);
302 gimplify_ctxp
->conditional_cleanups
= NULL
;
306 /* A stable comparison routine for use with splay trees and DECLs. */
309 splay_tree_compare_decl_uid (splay_tree_key xa
, splay_tree_key xb
)
314 return DECL_UID (a
) - DECL_UID (b
);
317 /* Create a new omp construct that deals with variable remapping. */
319 static struct gimplify_omp_ctx
*
320 new_omp_context (enum omp_region_type region_type
)
322 struct gimplify_omp_ctx
*c
;
324 c
= XCNEW (struct gimplify_omp_ctx
);
325 c
->outer_context
= gimplify_omp_ctxp
;
326 c
->variables
= splay_tree_new (splay_tree_compare_decl_uid
, 0, 0);
327 c
->privatized_types
= pointer_set_create ();
328 c
->location
= input_location
;
329 c
->region_type
= region_type
;
330 if ((region_type
& ORT_TASK
) == 0)
331 c
->default_kind
= OMP_CLAUSE_DEFAULT_SHARED
;
333 c
->default_kind
= OMP_CLAUSE_DEFAULT_UNSPECIFIED
;
338 /* Destroy an omp construct that deals with variable remapping. */
341 delete_omp_context (struct gimplify_omp_ctx
*c
)
343 splay_tree_delete (c
->variables
);
344 pointer_set_destroy (c
->privatized_types
);
348 static void omp_add_variable (struct gimplify_omp_ctx
*, tree
, unsigned int);
349 static bool omp_notice_variable (struct gimplify_omp_ctx
*, tree
, bool);
351 /* Both gimplify the statement T and append it to *SEQ_P. This function
352 behaves exactly as gimplify_stmt, but you don't have to pass T as a
356 gimplify_and_add (tree t
, gimple_seq
*seq_p
)
358 gimplify_stmt (&t
, seq_p
);
361 /* Gimplify statement T into sequence *SEQ_P, and return the first
362 tuple in the sequence of generated tuples for this statement.
363 Return NULL if gimplifying T produced no tuples. */
366 gimplify_and_return_first (tree t
, gimple_seq
*seq_p
)
368 gimple_stmt_iterator last
= gsi_last (*seq_p
);
370 gimplify_and_add (t
, seq_p
);
372 if (!gsi_end_p (last
))
375 return gsi_stmt (last
);
378 return gimple_seq_first_stmt (*seq_p
);
381 /* Strip off a legitimate source ending from the input string NAME of
382 length LEN. Rather than having to know the names used by all of
383 our front ends, we strip off an ending of a period followed by
384 up to five characters. (Java uses ".class".) */
387 remove_suffix (char *name
, int len
)
391 for (i
= 2; i
< 8 && len
> i
; i
++)
393 if (name
[len
- i
] == '.')
395 name
[len
- i
] = '\0';
401 /* Create a new temporary name with PREFIX. Return an identifier. */
403 static GTY(()) unsigned int tmp_var_id_num
;
406 create_tmp_var_name (const char *prefix
)
412 char *preftmp
= ASTRDUP (prefix
);
414 remove_suffix (preftmp
, strlen (preftmp
));
415 clean_symbol_name (preftmp
);
420 ASM_FORMAT_PRIVATE_NAME (tmp_name
, prefix
? prefix
: "T", tmp_var_id_num
++);
421 return get_identifier (tmp_name
);
424 /* Create a new temporary variable declaration of type TYPE.
425 Do NOT push it into the current binding. */
428 create_tmp_var_raw (tree type
, const char *prefix
)
432 tmp_var
= build_decl (input_location
,
433 VAR_DECL
, prefix
? create_tmp_var_name (prefix
) : NULL
,
436 /* The variable was declared by the compiler. */
437 DECL_ARTIFICIAL (tmp_var
) = 1;
438 /* And we don't want debug info for it. */
439 DECL_IGNORED_P (tmp_var
) = 1;
441 /* Make the variable writable. */
442 TREE_READONLY (tmp_var
) = 0;
444 DECL_EXTERNAL (tmp_var
) = 0;
445 TREE_STATIC (tmp_var
) = 0;
446 TREE_USED (tmp_var
) = 1;
451 /* Create a new temporary variable declaration of type TYPE. DO push the
452 variable into the current binding. Further, assume that this is called
453 only from gimplification or optimization, at which point the creation of
454 certain types are bugs. */
457 create_tmp_var (tree type
, const char *prefix
)
461 /* We don't allow types that are addressable (meaning we can't make copies),
462 or incomplete. We also used to reject every variable size objects here,
463 but now support those for which a constant upper bound can be obtained.
464 The processing for variable sizes is performed in gimple_add_tmp_var,
465 point at which it really matters and possibly reached via paths not going
466 through this function, e.g. after direct calls to create_tmp_var_raw. */
467 gcc_assert (!TREE_ADDRESSABLE (type
) && COMPLETE_TYPE_P (type
));
469 tmp_var
= create_tmp_var_raw (type
, prefix
);
470 gimple_add_tmp_var (tmp_var
);
474 /* Create a new temporary variable declaration of type TYPE by calling
475 create_tmp_var and if TYPE is a vector or a complex number, mark the new
476 temporary as gimple register. */
479 create_tmp_reg (tree type
, const char *prefix
)
483 tmp
= create_tmp_var (type
, prefix
);
484 if (TREE_CODE (type
) == COMPLEX_TYPE
485 || TREE_CODE (type
) == VECTOR_TYPE
)
486 DECL_GIMPLE_REG_P (tmp
) = 1;
491 /* Create a temporary with a name derived from VAL. Subroutine of
492 lookup_tmp_var; nobody else should call this function. */
495 create_tmp_from_val (tree val
)
497 /* Drop all qualifiers and address-space information from the value type. */
498 return create_tmp_var (TYPE_MAIN_VARIANT (TREE_TYPE (val
)), get_name (val
));
501 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
502 an existing expression temporary. */
505 lookup_tmp_var (tree val
, bool is_formal
)
509 /* If not optimizing, never really reuse a temporary. local-alloc
510 won't allocate any variable that is used in more than one basic
511 block, which means it will go into memory, causing much extra
512 work in reload and final and poorer code generation, outweighing
513 the extra memory allocation here. */
514 if (!optimize
|| !is_formal
|| TREE_SIDE_EFFECTS (val
))
515 ret
= create_tmp_from_val (val
);
522 if (gimplify_ctxp
->temp_htab
== NULL
)
523 gimplify_ctxp
->temp_htab
524 = htab_create (1000, gimple_tree_hash
, gimple_tree_eq
, free
);
525 slot
= htab_find_slot (gimplify_ctxp
->temp_htab
, (void *)&elt
, INSERT
);
528 elt_p
= XNEW (elt_t
);
530 elt_p
->temp
= ret
= create_tmp_from_val (val
);
531 *slot
= (void *) elt_p
;
535 elt_p
= (elt_t
*) *slot
;
543 /* Returns true iff T is a valid RHS for an assignment to a renamed
544 user -- or front-end generated artificial -- variable. */
547 is_gimple_reg_rhs (tree t
)
549 return get_gimple_rhs_class (TREE_CODE (t
)) != GIMPLE_INVALID_RHS
;
552 /* Returns true iff T is a valid RHS for an assignment to an un-renamed
553 LHS, or for a call argument. */
556 is_gimple_mem_rhs (tree t
)
558 /* If we're dealing with a renamable type, either source or dest must be
559 a renamed variable. */
560 if (is_gimple_reg_type (TREE_TYPE (t
)))
561 return is_gimple_val (t
);
563 return is_gimple_val (t
) || is_gimple_lvalue (t
);
566 /* Return true if T is a CALL_EXPR or an expression that can be
567 assigned to a temporary. Note that this predicate should only be
568 used during gimplification. See the rationale for this in
569 gimplify_modify_expr. */
572 is_gimple_reg_rhs_or_call (tree t
)
574 return (get_gimple_rhs_class (TREE_CODE (t
)) != GIMPLE_INVALID_RHS
575 || TREE_CODE (t
) == CALL_EXPR
);
578 /* Return true if T is a valid memory RHS or a CALL_EXPR. Note that
579 this predicate should only be used during gimplification. See the
580 rationale for this in gimplify_modify_expr. */
583 is_gimple_mem_rhs_or_call (tree t
)
585 /* If we're dealing with a renamable type, either source or dest must be
586 a renamed variable. */
587 if (is_gimple_reg_type (TREE_TYPE (t
)))
588 return is_gimple_val (t
);
590 return (is_gimple_val (t
) || is_gimple_lvalue (t
)
591 || TREE_CODE (t
) == CALL_EXPR
);
594 /* Helper for get_formal_tmp_var and get_initialized_tmp_var. */
597 internal_get_tmp_var (tree val
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
602 /* Notice that we explicitly allow VAL to be a CALL_EXPR so that we
603 can create an INIT_EXPR and convert it into a GIMPLE_CALL below. */
604 gimplify_expr (&val
, pre_p
, post_p
, is_gimple_reg_rhs_or_call
,
607 t
= lookup_tmp_var (val
, is_formal
);
610 && (TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
611 || TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
))
612 DECL_GIMPLE_REG_P (t
) = 1;
614 mod
= build2 (INIT_EXPR
, TREE_TYPE (t
), t
, unshare_expr (val
));
616 SET_EXPR_LOCATION (mod
, EXPR_LOC_OR_HERE (val
));
618 /* gimplify_modify_expr might want to reduce this further. */
619 gimplify_and_add (mod
, pre_p
);
622 /* If we're gimplifying into ssa, gimplify_modify_expr will have
623 given our temporary an SSA name. Find and return it. */
624 if (gimplify_ctxp
->into_ssa
)
626 gimple last
= gimple_seq_last_stmt (*pre_p
);
627 t
= gimple_get_lhs (last
);
633 /* Return a formal temporary variable initialized with VAL. PRE_P is as
634 in gimplify_expr. Only use this function if:
636 1) The value of the unfactored expression represented by VAL will not
637 change between the initialization and use of the temporary, and
638 2) The temporary will not be otherwise modified.
640 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
641 and #2 means it is inappropriate for && temps.
643 For other cases, use get_initialized_tmp_var instead. */
646 get_formal_tmp_var (tree val
, gimple_seq
*pre_p
)
648 return internal_get_tmp_var (val
, pre_p
, NULL
, true);
651 /* Return a temporary variable initialized with VAL. PRE_P and POST_P
652 are as in gimplify_expr. */
655 get_initialized_tmp_var (tree val
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
657 return internal_get_tmp_var (val
, pre_p
, post_p
, false);
660 /* Declare all the variables in VARS in SCOPE. If DEBUG_INFO is true,
661 generate debug info for them; otherwise don't. */
664 declare_vars (tree vars
, gimple scope
, bool debug_info
)
671 gcc_assert (gimple_code (scope
) == GIMPLE_BIND
);
673 temps
= nreverse (last
);
675 block
= gimple_bind_block (scope
);
676 gcc_assert (!block
|| TREE_CODE (block
) == BLOCK
);
677 if (!block
|| !debug_info
)
679 DECL_CHAIN (last
) = gimple_bind_vars (scope
);
680 gimple_bind_set_vars (scope
, temps
);
684 /* We need to attach the nodes both to the BIND_EXPR and to its
685 associated BLOCK for debugging purposes. The key point here
686 is that the BLOCK_VARS of the BIND_EXPR_BLOCK of a BIND_EXPR
687 is a subchain of the BIND_EXPR_VARS of the BIND_EXPR. */
688 if (BLOCK_VARS (block
))
689 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), temps
);
692 gimple_bind_set_vars (scope
,
693 chainon (gimple_bind_vars (scope
), temps
));
694 BLOCK_VARS (block
) = temps
;
700 /* For VAR a VAR_DECL of variable size, try to find a constant upper bound
701 for the size and adjust DECL_SIZE/DECL_SIZE_UNIT accordingly. Abort if
702 no such upper bound can be obtained. */
705 force_constant_size (tree var
)
707 /* The only attempt we make is by querying the maximum size of objects
708 of the variable's type. */
710 HOST_WIDE_INT max_size
;
712 gcc_assert (TREE_CODE (var
) == VAR_DECL
);
714 max_size
= max_int_size_in_bytes (TREE_TYPE (var
));
716 gcc_assert (max_size
>= 0);
719 = build_int_cst (TREE_TYPE (DECL_SIZE_UNIT (var
)), max_size
);
721 = build_int_cst (TREE_TYPE (DECL_SIZE (var
)), max_size
* BITS_PER_UNIT
);
724 /* Push the temporary variable TMP into the current binding. */
727 gimple_add_tmp_var (tree tmp
)
729 gcc_assert (!DECL_CHAIN (tmp
) && !DECL_SEEN_IN_BIND_EXPR_P (tmp
));
731 /* Later processing assumes that the object size is constant, which might
732 not be true at this point. Force the use of a constant upper bound in
734 if (!host_integerp (DECL_SIZE_UNIT (tmp
), 1))
735 force_constant_size (tmp
);
737 DECL_CONTEXT (tmp
) = current_function_decl
;
738 DECL_SEEN_IN_BIND_EXPR_P (tmp
) = 1;
742 DECL_CHAIN (tmp
) = gimplify_ctxp
->temps
;
743 gimplify_ctxp
->temps
= tmp
;
745 /* Mark temporaries local within the nearest enclosing parallel. */
746 if (gimplify_omp_ctxp
)
748 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
749 while (ctx
&& ctx
->region_type
== ORT_WORKSHARE
)
750 ctx
= ctx
->outer_context
;
752 omp_add_variable (ctx
, tmp
, GOVD_LOCAL
| GOVD_SEEN
);
761 /* This case is for nested functions. We need to expose the locals
763 body_seq
= gimple_body (current_function_decl
);
764 declare_vars (tmp
, gimple_seq_first_stmt (body_seq
), false);
768 /* Determine whether to assign a location to the statement GS. */
771 should_carry_location_p (gimple gs
)
773 /* Don't emit a line note for a label. We particularly don't want to
774 emit one for the break label, since it doesn't actually correspond
775 to the beginning of the loop/switch. */
776 if (gimple_code (gs
) == GIMPLE_LABEL
)
782 /* Return true if a location should not be emitted for this statement
783 by annotate_one_with_location. */
786 gimple_do_not_emit_location_p (gimple g
)
788 return gimple_plf (g
, GF_PLF_1
);
791 /* Mark statement G so a location will not be emitted by
792 annotate_one_with_location. */
795 gimple_set_do_not_emit_location (gimple g
)
797 /* The PLF flags are initialized to 0 when a new tuple is created,
798 so no need to initialize it anywhere. */
799 gimple_set_plf (g
, GF_PLF_1
, true);
802 /* Set the location for gimple statement GS to LOCATION. */
805 annotate_one_with_location (gimple gs
, location_t location
)
807 if (!gimple_has_location (gs
)
808 && !gimple_do_not_emit_location_p (gs
)
809 && should_carry_location_p (gs
))
810 gimple_set_location (gs
, location
);
813 /* Set LOCATION for all the statements after iterator GSI in sequence
814 SEQ. If GSI is pointing to the end of the sequence, start with the
815 first statement in SEQ. */
818 annotate_all_with_location_after (gimple_seq seq
, gimple_stmt_iterator gsi
,
822 gsi
= gsi_start (seq
);
826 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
827 annotate_one_with_location (gsi_stmt (gsi
), location
);
830 /* Set the location for all the statements in a sequence STMT_P to LOCATION. */
833 annotate_all_with_location (gimple_seq stmt_p
, location_t location
)
835 gimple_stmt_iterator i
;
837 if (gimple_seq_empty_p (stmt_p
))
840 for (i
= gsi_start (stmt_p
); !gsi_end_p (i
); gsi_next (&i
))
842 gimple gs
= gsi_stmt (i
);
843 annotate_one_with_location (gs
, location
);
847 /* This page contains routines to unshare tree nodes, i.e. to duplicate tree
848 nodes that are referenced more than once in GENERIC functions. This is
849 necessary because gimplification (translation into GIMPLE) is performed
850 by modifying tree nodes in-place, so gimplication of a shared node in a
851 first context could generate an invalid GIMPLE form in a second context.
853 This is achieved with a simple mark/copy/unmark algorithm that walks the
854 GENERIC representation top-down, marks nodes with TREE_VISITED the first
855 time it encounters them, duplicates them if they already have TREE_VISITED
856 set, and finally removes the TREE_VISITED marks it has set.
858 The algorithm works only at the function level, i.e. it generates a GENERIC
859 representation of a function with no nodes shared within the function when
860 passed a GENERIC function (except for nodes that are allowed to be shared).
862 At the global level, it is also necessary to unshare tree nodes that are
863 referenced in more than one function, for the same aforementioned reason.
864 This requires some cooperation from the front-end. There are 2 strategies:
866 1. Manual unsharing. The front-end needs to call unshare_expr on every
867 expression that might end up being shared across functions.
869 2. Deep unsharing. This is an extension of regular unsharing. Instead
870 of calling unshare_expr on expressions that might be shared across
871 functions, the front-end pre-marks them with TREE_VISITED. This will
872 ensure that they are unshared on the first reference within functions
873 when the regular unsharing algorithm runs. The counterpart is that
874 this algorithm must look deeper than for manual unsharing, which is
875 specified by LANG_HOOKS_DEEP_UNSHARING.
877 If there are only few specific cases of node sharing across functions, it is
878 probably easier for a front-end to unshare the expressions manually. On the
879 contrary, if the expressions generated at the global level are as widespread
880 as expressions generated within functions, deep unsharing is very likely the
883 /* Similar to copy_tree_r but do not copy SAVE_EXPR or TARGET_EXPR nodes.
884 These nodes model computations that must be done once. If we were to
885 unshare something like SAVE_EXPR(i++), the gimplification process would
886 create wrong code. However, if DATA is non-null, it must hold a pointer
887 set that is used to unshare the subtrees of these nodes. */
890 mostly_copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data
)
893 enum tree_code code
= TREE_CODE (t
);
895 /* Do not copy SAVE_EXPR, TARGET_EXPR or BIND_EXPR nodes themselves, but
896 copy their subtrees if we can make sure to do it only once. */
897 if (code
== SAVE_EXPR
|| code
== TARGET_EXPR
|| code
== BIND_EXPR
)
899 if (data
&& !pointer_set_insert ((struct pointer_set_t
*)data
, t
))
905 /* Stop at types, decls, constants like copy_tree_r. */
906 else if (TREE_CODE_CLASS (code
) == tcc_type
907 || TREE_CODE_CLASS (code
) == tcc_declaration
908 || TREE_CODE_CLASS (code
) == tcc_constant
909 /* We can't do anything sensible with a BLOCK used as an
910 expression, but we also can't just die when we see it
911 because of non-expression uses. So we avert our eyes
912 and cross our fingers. Silly Java. */
916 /* Cope with the statement expression extension. */
917 else if (code
== STATEMENT_LIST
)
920 /* Leave the bulk of the work to copy_tree_r itself. */
922 copy_tree_r (tp
, walk_subtrees
, NULL
);
927 /* Callback for walk_tree to unshare most of the shared trees rooted at *TP.
928 If *TP has been visited already, then *TP is deeply copied by calling
929 mostly_copy_tree_r. DATA is passed to mostly_copy_tree_r unmodified. */
932 copy_if_shared_r (tree
*tp
, int *walk_subtrees
, void *data
)
935 enum tree_code code
= TREE_CODE (t
);
937 /* Skip types, decls, and constants. But we do want to look at their
938 types and the bounds of types. Mark them as visited so we properly
939 unmark their subtrees on the unmark pass. If we've already seen them,
940 don't look down further. */
941 if (TREE_CODE_CLASS (code
) == tcc_type
942 || TREE_CODE_CLASS (code
) == tcc_declaration
943 || TREE_CODE_CLASS (code
) == tcc_constant
)
945 if (TREE_VISITED (t
))
948 TREE_VISITED (t
) = 1;
951 /* If this node has been visited already, unshare it and don't look
953 else if (TREE_VISITED (t
))
955 walk_tree (tp
, mostly_copy_tree_r
, data
, NULL
);
959 /* Otherwise, mark the node as visited and keep looking. */
961 TREE_VISITED (t
) = 1;
966 /* Unshare most of the shared trees rooted at *TP. DATA is passed to the
967 copy_if_shared_r callback unmodified. */
970 copy_if_shared (tree
*tp
, void *data
)
972 walk_tree (tp
, copy_if_shared_r
, data
, NULL
);
975 /* Unshare all the trees in the body of FNDECL, as well as in the bodies of
976 any nested functions. */
979 unshare_body (tree fndecl
)
981 struct cgraph_node
*cgn
= cgraph_get_node (fndecl
);
982 /* If the language requires deep unsharing, we need a pointer set to make
983 sure we don't repeatedly unshare subtrees of unshareable nodes. */
984 struct pointer_set_t
*visited
985 = lang_hooks
.deep_unsharing
? pointer_set_create () : NULL
;
987 copy_if_shared (&DECL_SAVED_TREE (fndecl
), visited
);
988 copy_if_shared (&DECL_SIZE (DECL_RESULT (fndecl
)), visited
);
989 copy_if_shared (&DECL_SIZE_UNIT (DECL_RESULT (fndecl
)), visited
);
992 pointer_set_destroy (visited
);
995 for (cgn
= cgn
->nested
; cgn
; cgn
= cgn
->next_nested
)
996 unshare_body (cgn
->symbol
.decl
);
999 /* Callback for walk_tree to unmark the visited trees rooted at *TP.
1000 Subtrees are walked until the first unvisited node is encountered. */
1003 unmark_visited_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
1007 /* If this node has been visited, unmark it and keep looking. */
1008 if (TREE_VISITED (t
))
1009 TREE_VISITED (t
) = 0;
1011 /* Otherwise, don't look any deeper. */
1018 /* Unmark the visited trees rooted at *TP. */
1021 unmark_visited (tree
*tp
)
1023 walk_tree (tp
, unmark_visited_r
, NULL
, NULL
);
1026 /* Likewise, but mark all trees as not visited. */
1029 unvisit_body (tree fndecl
)
1031 struct cgraph_node
*cgn
= cgraph_get_node (fndecl
);
1033 unmark_visited (&DECL_SAVED_TREE (fndecl
));
1034 unmark_visited (&DECL_SIZE (DECL_RESULT (fndecl
)));
1035 unmark_visited (&DECL_SIZE_UNIT (DECL_RESULT (fndecl
)));
1038 for (cgn
= cgn
->nested
; cgn
; cgn
= cgn
->next_nested
)
1039 unvisit_body (cgn
->symbol
.decl
);
1042 /* Unconditionally make an unshared copy of EXPR. This is used when using
1043 stored expressions which span multiple functions, such as BINFO_VTABLE,
1044 as the normal unsharing process can't tell that they're shared. */
1047 unshare_expr (tree expr
)
1049 walk_tree (&expr
, mostly_copy_tree_r
, NULL
, NULL
);
1053 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
1054 contain statements and have a value. Assign its value to a temporary
1055 and give it void_type_node. Return the temporary, or NULL_TREE if
1056 WRAPPER was already void. */
1059 voidify_wrapper_expr (tree wrapper
, tree temp
)
1061 tree type
= TREE_TYPE (wrapper
);
1062 if (type
&& !VOID_TYPE_P (type
))
1066 /* Set p to point to the body of the wrapper. Loop until we find
1067 something that isn't a wrapper. */
1068 for (p
= &wrapper
; p
&& *p
; )
1070 switch (TREE_CODE (*p
))
1073 TREE_SIDE_EFFECTS (*p
) = 1;
1074 TREE_TYPE (*p
) = void_type_node
;
1075 /* For a BIND_EXPR, the body is operand 1. */
1076 p
= &BIND_EXPR_BODY (*p
);
1079 case CLEANUP_POINT_EXPR
:
1080 case TRY_FINALLY_EXPR
:
1081 case TRY_CATCH_EXPR
:
1082 TREE_SIDE_EFFECTS (*p
) = 1;
1083 TREE_TYPE (*p
) = void_type_node
;
1084 p
= &TREE_OPERAND (*p
, 0);
1087 case STATEMENT_LIST
:
1089 tree_stmt_iterator i
= tsi_last (*p
);
1090 TREE_SIDE_EFFECTS (*p
) = 1;
1091 TREE_TYPE (*p
) = void_type_node
;
1092 p
= tsi_end_p (i
) ? NULL
: tsi_stmt_ptr (i
);
1097 /* Advance to the last statement. Set all container types to
1099 for (; TREE_CODE (*p
) == COMPOUND_EXPR
; p
= &TREE_OPERAND (*p
, 1))
1101 TREE_SIDE_EFFECTS (*p
) = 1;
1102 TREE_TYPE (*p
) = void_type_node
;
1106 case TRANSACTION_EXPR
:
1107 TREE_SIDE_EFFECTS (*p
) = 1;
1108 TREE_TYPE (*p
) = void_type_node
;
1109 p
= &TRANSACTION_EXPR_BODY (*p
);
1113 /* Assume that any tree upon which voidify_wrapper_expr is
1114 directly called is a wrapper, and that its body is op0. */
1117 TREE_SIDE_EFFECTS (*p
) = 1;
1118 TREE_TYPE (*p
) = void_type_node
;
1119 p
= &TREE_OPERAND (*p
, 0);
1127 if (p
== NULL
|| IS_EMPTY_STMT (*p
))
1131 /* The wrapper is on the RHS of an assignment that we're pushing
1133 gcc_assert (TREE_CODE (temp
) == INIT_EXPR
1134 || TREE_CODE (temp
) == MODIFY_EXPR
);
1135 TREE_OPERAND (temp
, 1) = *p
;
1140 temp
= create_tmp_var (type
, "retval");
1141 *p
= build2 (INIT_EXPR
, type
, temp
, *p
);
1150 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
1151 a temporary through which they communicate. */
1154 build_stack_save_restore (gimple
*save
, gimple
*restore
)
1158 *save
= gimple_build_call (builtin_decl_implicit (BUILT_IN_STACK_SAVE
), 0);
1159 tmp_var
= create_tmp_var (ptr_type_node
, "saved_stack");
1160 gimple_call_set_lhs (*save
, tmp_var
);
1163 = gimple_build_call (builtin_decl_implicit (BUILT_IN_STACK_RESTORE
),
1167 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
1169 static enum gimplify_status
1170 gimplify_bind_expr (tree
*expr_p
, gimple_seq
*pre_p
)
1172 tree bind_expr
= *expr_p
;
1173 bool old_save_stack
= gimplify_ctxp
->save_stack
;
1176 gimple_seq body
, cleanup
;
1179 tree temp
= voidify_wrapper_expr (bind_expr
, NULL
);
1181 /* Mark variables seen in this bind expr. */
1182 for (t
= BIND_EXPR_VARS (bind_expr
); t
; t
= DECL_CHAIN (t
))
1184 if (TREE_CODE (t
) == VAR_DECL
)
1186 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
1188 /* Mark variable as local. */
1189 if (ctx
&& !DECL_EXTERNAL (t
)
1190 && (! DECL_SEEN_IN_BIND_EXPR_P (t
)
1191 || splay_tree_lookup (ctx
->variables
,
1192 (splay_tree_key
) t
) == NULL
))
1193 omp_add_variable (gimplify_omp_ctxp
, t
, GOVD_LOCAL
| GOVD_SEEN
);
1195 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
1197 if (DECL_HARD_REGISTER (t
) && !is_global_var (t
) && cfun
)
1198 cfun
->has_local_explicit_reg_vars
= true;
1201 /* Preliminarily mark non-addressed complex variables as eligible
1202 for promotion to gimple registers. We'll transform their uses
1204 if ((TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
1205 || TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
1206 && !TREE_THIS_VOLATILE (t
)
1207 && (TREE_CODE (t
) == VAR_DECL
&& !DECL_HARD_REGISTER (t
))
1208 && !needs_to_live_in_memory (t
))
1209 DECL_GIMPLE_REG_P (t
) = 1;
1212 gimple_bind
= gimple_build_bind (BIND_EXPR_VARS (bind_expr
), NULL
,
1213 BIND_EXPR_BLOCK (bind_expr
));
1214 gimple_push_bind_expr (gimple_bind
);
1216 gimplify_ctxp
->save_stack
= false;
1218 /* Gimplify the body into the GIMPLE_BIND tuple's body. */
1220 gimplify_stmt (&BIND_EXPR_BODY (bind_expr
), &body
);
1221 gimple_bind_set_body (gimple_bind
, body
);
1225 if (gimplify_ctxp
->save_stack
)
1227 gimple stack_restore
;
1229 /* Save stack on entry and restore it on exit. Add a try_finally
1230 block to achieve this. Note that mudflap depends on the
1231 format of the emitted code: see mx_register_decls(). */
1232 build_stack_save_restore (&stack_save
, &stack_restore
);
1234 gimplify_seq_add_stmt (&cleanup
, stack_restore
);
1237 /* Add clobbers for all variables that go out of scope. */
1238 for (t
= BIND_EXPR_VARS (bind_expr
); t
; t
= DECL_CHAIN (t
))
1240 if (TREE_CODE (t
) == VAR_DECL
1241 && !is_global_var (t
)
1242 && DECL_CONTEXT (t
) == current_function_decl
1243 && !DECL_HARD_REGISTER (t
)
1244 && !TREE_THIS_VOLATILE (t
)
1245 && !DECL_HAS_VALUE_EXPR_P (t
)
1246 /* Only care for variables that have to be in memory. Others
1247 will be rewritten into SSA names, hence moved to the top-level. */
1248 && !is_gimple_reg (t
)
1249 && flag_stack_reuse
!= SR_NONE
)
1251 tree clobber
= build_constructor (TREE_TYPE (t
), NULL
);
1252 TREE_THIS_VOLATILE (clobber
) = 1;
1253 gimplify_seq_add_stmt (&cleanup
, gimple_build_assign (t
, clobber
));
1260 gimple_seq new_body
;
1263 gs
= gimple_build_try (gimple_bind_body (gimple_bind
), cleanup
,
1264 GIMPLE_TRY_FINALLY
);
1267 gimplify_seq_add_stmt (&new_body
, stack_save
);
1268 gimplify_seq_add_stmt (&new_body
, gs
);
1269 gimple_bind_set_body (gimple_bind
, new_body
);
1272 gimplify_ctxp
->save_stack
= old_save_stack
;
1273 gimple_pop_bind_expr ();
1275 gimplify_seq_add_stmt (pre_p
, gimple_bind
);
1283 *expr_p
= NULL_TREE
;
1287 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1288 GIMPLE value, it is assigned to a new temporary and the statement is
1289 re-written to return the temporary.
1291 PRE_P points to the sequence where side effects that must happen before
1292 STMT should be stored. */
1294 static enum gimplify_status
1295 gimplify_return_expr (tree stmt
, gimple_seq
*pre_p
)
1298 tree ret_expr
= TREE_OPERAND (stmt
, 0);
1299 tree result_decl
, result
;
1301 if (ret_expr
== error_mark_node
)
1305 || TREE_CODE (ret_expr
) == RESULT_DECL
1306 || ret_expr
== error_mark_node
)
1308 gimple ret
= gimple_build_return (ret_expr
);
1309 gimple_set_no_warning (ret
, TREE_NO_WARNING (stmt
));
1310 gimplify_seq_add_stmt (pre_p
, ret
);
1314 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
1315 result_decl
= NULL_TREE
;
1318 result_decl
= TREE_OPERAND (ret_expr
, 0);
1320 /* See through a return by reference. */
1321 if (TREE_CODE (result_decl
) == INDIRECT_REF
)
1322 result_decl
= TREE_OPERAND (result_decl
, 0);
1324 gcc_assert ((TREE_CODE (ret_expr
) == MODIFY_EXPR
1325 || TREE_CODE (ret_expr
) == INIT_EXPR
)
1326 && TREE_CODE (result_decl
) == RESULT_DECL
);
1329 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1330 Recall that aggregate_value_p is FALSE for any aggregate type that is
1331 returned in registers. If we're returning values in registers, then
1332 we don't want to extend the lifetime of the RESULT_DECL, particularly
1333 across another call. In addition, for those aggregates for which
1334 hard_function_value generates a PARALLEL, we'll die during normal
1335 expansion of structure assignments; there's special code in expand_return
1336 to handle this case that does not exist in expand_expr. */
1339 else if (aggregate_value_p (result_decl
, TREE_TYPE (current_function_decl
)))
1341 if (TREE_CODE (DECL_SIZE (result_decl
)) != INTEGER_CST
)
1343 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (result_decl
)))
1344 gimplify_type_sizes (TREE_TYPE (result_decl
), pre_p
);
1345 /* Note that we don't use gimplify_vla_decl because the RESULT_DECL
1346 should be effectively allocated by the caller, i.e. all calls to
1347 this function must be subject to the Return Slot Optimization. */
1348 gimplify_one_sizepos (&DECL_SIZE (result_decl
), pre_p
);
1349 gimplify_one_sizepos (&DECL_SIZE_UNIT (result_decl
), pre_p
);
1351 result
= result_decl
;
1353 else if (gimplify_ctxp
->return_temp
)
1354 result
= gimplify_ctxp
->return_temp
;
1357 result
= create_tmp_reg (TREE_TYPE (result_decl
), NULL
);
1359 /* ??? With complex control flow (usually involving abnormal edges),
1360 we can wind up warning about an uninitialized value for this. Due
1361 to how this variable is constructed and initialized, this is never
1362 true. Give up and never warn. */
1363 TREE_NO_WARNING (result
) = 1;
1365 gimplify_ctxp
->return_temp
= result
;
1368 /* Smash the lhs of the MODIFY_EXPR to the temporary we plan to use.
1369 Then gimplify the whole thing. */
1370 if (result
!= result_decl
)
1371 TREE_OPERAND (ret_expr
, 0) = result
;
1373 gimplify_and_add (TREE_OPERAND (stmt
, 0), pre_p
);
1375 ret
= gimple_build_return (result
);
1376 gimple_set_no_warning (ret
, TREE_NO_WARNING (stmt
));
1377 gimplify_seq_add_stmt (pre_p
, ret
);
1382 /* Gimplify a variable-length array DECL. */
1385 gimplify_vla_decl (tree decl
, gimple_seq
*seq_p
)
1387 /* This is a variable-sized decl. Simplify its size and mark it
1388 for deferred expansion. Note that mudflap depends on the format
1389 of the emitted code: see mx_register_decls(). */
1390 tree t
, addr
, ptr_type
;
1392 gimplify_one_sizepos (&DECL_SIZE (decl
), seq_p
);
1393 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl
), seq_p
);
1395 /* All occurrences of this decl in final gimplified code will be
1396 replaced by indirection. Setting DECL_VALUE_EXPR does two
1397 things: First, it lets the rest of the gimplifier know what
1398 replacement to use. Second, it lets the debug info know
1399 where to find the value. */
1400 ptr_type
= build_pointer_type (TREE_TYPE (decl
));
1401 addr
= create_tmp_var (ptr_type
, get_name (decl
));
1402 DECL_IGNORED_P (addr
) = 0;
1403 t
= build_fold_indirect_ref (addr
);
1404 TREE_THIS_NOTRAP (t
) = 1;
1405 SET_DECL_VALUE_EXPR (decl
, t
);
1406 DECL_HAS_VALUE_EXPR_P (decl
) = 1;
1408 t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
);
1409 t
= build_call_expr (t
, 2, DECL_SIZE_UNIT (decl
),
1410 size_int (DECL_ALIGN (decl
)));
1411 /* The call has been built for a variable-sized object. */
1412 CALL_ALLOCA_FOR_VAR_P (t
) = 1;
1413 t
= fold_convert (ptr_type
, t
);
1414 t
= build2 (MODIFY_EXPR
, TREE_TYPE (addr
), addr
, t
);
1416 gimplify_and_add (t
, seq_p
);
1418 /* Indicate that we need to restore the stack level when the
1419 enclosing BIND_EXPR is exited. */
1420 gimplify_ctxp
->save_stack
= true;
1423 /* Gimplify a DECL_EXPR node *STMT_P by making any necessary allocation
1424 and initialization explicit. */
1426 static enum gimplify_status
1427 gimplify_decl_expr (tree
*stmt_p
, gimple_seq
*seq_p
)
1429 tree stmt
= *stmt_p
;
1430 tree decl
= DECL_EXPR_DECL (stmt
);
1432 *stmt_p
= NULL_TREE
;
1434 if (TREE_TYPE (decl
) == error_mark_node
)
1437 if ((TREE_CODE (decl
) == TYPE_DECL
1438 || TREE_CODE (decl
) == VAR_DECL
)
1439 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl
)))
1440 gimplify_type_sizes (TREE_TYPE (decl
), seq_p
);
1442 /* ??? DECL_ORIGINAL_TYPE is streamed for LTO so it needs to be gimplified
1443 in case its size expressions contain problematic nodes like CALL_EXPR. */
1444 if (TREE_CODE (decl
) == TYPE_DECL
1445 && DECL_ORIGINAL_TYPE (decl
)
1446 && !TYPE_SIZES_GIMPLIFIED (DECL_ORIGINAL_TYPE (decl
)))
1447 gimplify_type_sizes (DECL_ORIGINAL_TYPE (decl
), seq_p
);
1449 if (TREE_CODE (decl
) == VAR_DECL
&& !DECL_EXTERNAL (decl
))
1451 tree init
= DECL_INITIAL (decl
);
1453 if (TREE_CODE (DECL_SIZE_UNIT (decl
)) != INTEGER_CST
1454 || (!TREE_STATIC (decl
)
1455 && flag_stack_check
== GENERIC_STACK_CHECK
1456 && compare_tree_int (DECL_SIZE_UNIT (decl
),
1457 STACK_CHECK_MAX_VAR_SIZE
) > 0))
1458 gimplify_vla_decl (decl
, seq_p
);
1460 /* Some front ends do not explicitly declare all anonymous
1461 artificial variables. We compensate here by declaring the
1462 variables, though it would be better if the front ends would
1463 explicitly declare them. */
1464 if (!DECL_SEEN_IN_BIND_EXPR_P (decl
)
1465 && DECL_ARTIFICIAL (decl
) && DECL_NAME (decl
) == NULL_TREE
)
1466 gimple_add_tmp_var (decl
);
1468 if (init
&& init
!= error_mark_node
)
1470 if (!TREE_STATIC (decl
))
1472 DECL_INITIAL (decl
) = NULL_TREE
;
1473 init
= build2 (INIT_EXPR
, void_type_node
, decl
, init
);
1474 gimplify_and_add (init
, seq_p
);
1478 /* We must still examine initializers for static variables
1479 as they may contain a label address. */
1480 walk_tree (&init
, force_labels_r
, NULL
, NULL
);
1487 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1488 and replacing the LOOP_EXPR with goto, but if the loop contains an
1489 EXIT_EXPR, we need to append a label for it to jump to. */
1491 static enum gimplify_status
1492 gimplify_loop_expr (tree
*expr_p
, gimple_seq
*pre_p
)
1494 tree saved_label
= gimplify_ctxp
->exit_label
;
1495 tree start_label
= create_artificial_label (UNKNOWN_LOCATION
);
1497 gimplify_seq_add_stmt (pre_p
, gimple_build_label (start_label
));
1499 gimplify_ctxp
->exit_label
= NULL_TREE
;
1501 gimplify_and_add (LOOP_EXPR_BODY (*expr_p
), pre_p
);
1503 gimplify_seq_add_stmt (pre_p
, gimple_build_goto (start_label
));
1505 if (gimplify_ctxp
->exit_label
)
1506 gimplify_seq_add_stmt (pre_p
,
1507 gimple_build_label (gimplify_ctxp
->exit_label
));
1509 gimplify_ctxp
->exit_label
= saved_label
;
1515 /* Gimplify a statement list onto a sequence. These may be created either
1516 by an enlightened front-end, or by shortcut_cond_expr. */
1518 static enum gimplify_status
1519 gimplify_statement_list (tree
*expr_p
, gimple_seq
*pre_p
)
1521 tree temp
= voidify_wrapper_expr (*expr_p
, NULL
);
1523 tree_stmt_iterator i
= tsi_start (*expr_p
);
1525 while (!tsi_end_p (i
))
1527 gimplify_stmt (tsi_stmt_ptr (i
), pre_p
);
1540 /* Compare two case labels. Because the front end should already have
1541 made sure that case ranges do not overlap, it is enough to only compare
1542 the CASE_LOW values of each case label. */
1545 compare_case_labels (const void *p1
, const void *p2
)
1547 const_tree
const case1
= *(const_tree
const*)p1
;
1548 const_tree
const case2
= *(const_tree
const*)p2
;
1550 /* The 'default' case label always goes first. */
1551 if (!CASE_LOW (case1
))
1553 else if (!CASE_LOW (case2
))
1556 return tree_int_cst_compare (CASE_LOW (case1
), CASE_LOW (case2
));
1559 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1562 sort_case_labels (VEC(tree
,heap
)* label_vec
)
1564 VEC_qsort (tree
, label_vec
, compare_case_labels
);
1567 /* Prepare a vector of case labels to be used in a GIMPLE_SWITCH statement.
1569 LABELS is a vector that contains all case labels to look at.
1571 INDEX_TYPE is the type of the switch index expression. Case labels
1572 in LABELS are discarded if their values are not in the value range
1573 covered by INDEX_TYPE. The remaining case label values are folded
1576 If a default case exists in LABELS, it is removed from LABELS and
1577 returned in DEFAULT_CASEP. If no default case exists, but the
1578 case labels already cover the whole range of INDEX_TYPE, a default
1579 case is returned pointing to one of the existing case labels.
1580 Otherwise DEFAULT_CASEP is set to NULL_TREE.
1582 DEFAULT_CASEP may be NULL, in which case the above comment doesn't
1583 apply and no action is taken regardless of whether a default case is
1587 preprocess_case_label_vec_for_gimple (VEC(tree
,heap
) *labels
,
1589 tree
*default_casep
)
1591 tree min_value
, max_value
;
1592 tree default_case
= NULL_TREE
;
1596 min_value
= TYPE_MIN_VALUE (index_type
);
1597 max_value
= TYPE_MAX_VALUE (index_type
);
1598 while (i
< VEC_length (tree
, labels
))
1600 tree elt
= VEC_index (tree
, labels
, i
);
1601 tree low
= CASE_LOW (elt
);
1602 tree high
= CASE_HIGH (elt
);
1603 bool remove_element
= FALSE
;
1607 gcc_checking_assert (TREE_CODE (low
) == INTEGER_CST
);
1608 gcc_checking_assert (!high
|| TREE_CODE (high
) == INTEGER_CST
);
1610 /* This is a non-default case label, i.e. it has a value.
1612 See if the case label is reachable within the range of
1613 the index type. Remove out-of-range case values. Turn
1614 case ranges into a canonical form (high > low strictly)
1615 and convert the case label values to the index type.
1617 NB: The type of gimple_switch_index() may be the promoted
1618 type, but the case labels retain the original type. */
1622 /* This is a case range. Discard empty ranges.
1623 If the bounds or the range are equal, turn this
1624 into a simple (one-value) case. */
1625 int cmp
= tree_int_cst_compare (high
, low
);
1627 remove_element
= TRUE
;
1634 /* If the simple case value is unreachable, ignore it. */
1635 if ((TREE_CODE (min_value
) == INTEGER_CST
1636 && tree_int_cst_compare (low
, min_value
) < 0)
1637 || (TREE_CODE (max_value
) == INTEGER_CST
1638 && tree_int_cst_compare (low
, max_value
) > 0))
1639 remove_element
= TRUE
;
1641 low
= fold_convert (index_type
, low
);
1645 /* If the entire case range is unreachable, ignore it. */
1646 if ((TREE_CODE (min_value
) == INTEGER_CST
1647 && tree_int_cst_compare (high
, min_value
) < 0)
1648 || (TREE_CODE (max_value
) == INTEGER_CST
1649 && tree_int_cst_compare (low
, max_value
) > 0))
1650 remove_element
= TRUE
;
1653 /* If the lower bound is less than the index type's
1654 minimum value, truncate the range bounds. */
1655 if (TREE_CODE (min_value
) == INTEGER_CST
1656 && tree_int_cst_compare (low
, min_value
) < 0)
1658 low
= fold_convert (index_type
, low
);
1660 /* If the upper bound is greater than the index type's
1661 maximum value, truncate the range bounds. */
1662 if (TREE_CODE (max_value
) == INTEGER_CST
1663 && tree_int_cst_compare (high
, max_value
) > 0)
1665 high
= fold_convert (index_type
, high
);
1667 /* We may have folded a case range to a one-value case. */
1668 if (tree_int_cst_equal (low
, high
))
1673 CASE_LOW (elt
) = low
;
1674 CASE_HIGH (elt
) = high
;
1678 gcc_assert (!default_case
);
1680 /* The default case must be passed separately to the
1681 gimple_build_switch routines. But if DEFAULT_CASEP
1682 is NULL, we do not remove the default case (it would
1683 be completely lost). */
1685 remove_element
= TRUE
;
1689 VEC_ordered_remove (tree
, labels
, i
);
1695 if (!VEC_empty (tree
, labels
))
1696 sort_case_labels (labels
);
1698 if (default_casep
&& !default_case
)
1700 /* If the switch has no default label, add one, so that we jump
1701 around the switch body. If the labels already cover the whole
1702 range of the switch index_type, add the default label pointing
1703 to one of the existing labels. */
1705 && TYPE_MIN_VALUE (index_type
)
1706 && TYPE_MAX_VALUE (index_type
)
1707 && tree_int_cst_equal (CASE_LOW (VEC_index (tree
, labels
, 0)),
1708 TYPE_MIN_VALUE (index_type
)))
1710 tree low
, high
= CASE_HIGH (VEC_index (tree
, labels
, len
- 1));
1712 high
= CASE_LOW (VEC_index (tree
, labels
, len
- 1));
1713 if (tree_int_cst_equal (high
, TYPE_MAX_VALUE (index_type
)))
1715 for (i
= 1; i
< len
; i
++)
1717 high
= CASE_LOW (VEC_index (tree
, labels
, i
));
1718 low
= CASE_HIGH (VEC_index (tree
, labels
, i
- 1));
1720 low
= CASE_LOW (VEC_index (tree
, labels
, i
- 1));
1721 if ((TREE_INT_CST_LOW (low
) + 1
1722 != TREE_INT_CST_LOW (high
))
1723 || (TREE_INT_CST_HIGH (low
)
1724 + (TREE_INT_CST_LOW (high
) == 0)
1725 != TREE_INT_CST_HIGH (high
)))
1730 tree label
= CASE_LABEL (VEC_index (tree
, labels
, 0));
1731 default_case
= build_case_label (NULL_TREE
, NULL_TREE
,
1739 *default_casep
= default_case
;
1742 /* Gimplify a SWITCH_EXPR, and collect the vector of labels it can
1745 static enum gimplify_status
1746 gimplify_switch_expr (tree
*expr_p
, gimple_seq
*pre_p
)
1748 tree switch_expr
= *expr_p
;
1749 gimple_seq switch_body_seq
= NULL
;
1750 enum gimplify_status ret
;
1751 tree index_type
= TREE_TYPE (switch_expr
);
1752 if (index_type
== NULL_TREE
)
1753 index_type
= TREE_TYPE (SWITCH_COND (switch_expr
));
1755 ret
= gimplify_expr (&SWITCH_COND (switch_expr
), pre_p
, NULL
, is_gimple_val
,
1757 if (ret
== GS_ERROR
|| ret
== GS_UNHANDLED
)
1760 if (SWITCH_BODY (switch_expr
))
1762 VEC (tree
,heap
) *labels
;
1763 VEC (tree
,heap
) *saved_labels
;
1764 tree default_case
= NULL_TREE
;
1765 gimple gimple_switch
;
1767 /* If someone can be bothered to fill in the labels, they can
1768 be bothered to null out the body too. */
1769 gcc_assert (!SWITCH_LABELS (switch_expr
));
1771 /* Save old labels, get new ones from body, then restore the old
1772 labels. Save all the things from the switch body to append after. */
1773 saved_labels
= gimplify_ctxp
->case_labels
;
1774 gimplify_ctxp
->case_labels
= VEC_alloc (tree
, heap
, 8);
1776 gimplify_stmt (&SWITCH_BODY (switch_expr
), &switch_body_seq
);
1777 labels
= gimplify_ctxp
->case_labels
;
1778 gimplify_ctxp
->case_labels
= saved_labels
;
1780 preprocess_case_label_vec_for_gimple (labels
, index_type
,
1788 = build_case_label (NULL_TREE
, NULL_TREE
,
1789 create_artificial_label (UNKNOWN_LOCATION
));
1790 new_default
= gimple_build_label (CASE_LABEL (default_case
));
1791 gimplify_seq_add_stmt (&switch_body_seq
, new_default
);
1794 gimple_switch
= gimple_build_switch_vec (SWITCH_COND (switch_expr
),
1795 default_case
, labels
);
1796 gimplify_seq_add_stmt (pre_p
, gimple_switch
);
1797 gimplify_seq_add_seq (pre_p
, switch_body_seq
);
1798 VEC_free(tree
, heap
, labels
);
1801 gcc_assert (SWITCH_LABELS (switch_expr
));
1806 /* Gimplify the CASE_LABEL_EXPR pointed to by EXPR_P. */
1808 static enum gimplify_status
1809 gimplify_case_label_expr (tree
*expr_p
, gimple_seq
*pre_p
)
1811 struct gimplify_ctx
*ctxp
;
1812 gimple gimple_label
;
1814 /* Invalid OpenMP programs can play Duff's Device type games with
1815 #pragma omp parallel. At least in the C front end, we don't
1816 detect such invalid branches until after gimplification. */
1817 for (ctxp
= gimplify_ctxp
; ; ctxp
= ctxp
->prev_context
)
1818 if (ctxp
->case_labels
)
1821 gimple_label
= gimple_build_label (CASE_LABEL (*expr_p
));
1822 VEC_safe_push (tree
, heap
, ctxp
->case_labels
, *expr_p
);
1823 gimplify_seq_add_stmt (pre_p
, gimple_label
);
1828 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1832 build_and_jump (tree
*label_p
)
1834 if (label_p
== NULL
)
1835 /* If there's nowhere to jump, just fall through. */
1838 if (*label_p
== NULL_TREE
)
1840 tree label
= create_artificial_label (UNKNOWN_LOCATION
);
1844 return build1 (GOTO_EXPR
, void_type_node
, *label_p
);
1847 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1848 This also involves building a label to jump to and communicating it to
1849 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1851 static enum gimplify_status
1852 gimplify_exit_expr (tree
*expr_p
)
1854 tree cond
= TREE_OPERAND (*expr_p
, 0);
1857 expr
= build_and_jump (&gimplify_ctxp
->exit_label
);
1858 expr
= build3 (COND_EXPR
, void_type_node
, cond
, expr
, NULL_TREE
);
1864 /* A helper function to be called via walk_tree. Mark all labels under *TP
1865 as being forced. To be called for DECL_INITIAL of static variables. */
1868 force_labels_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
1872 if (TREE_CODE (*tp
) == LABEL_DECL
)
1873 FORCED_LABEL (*tp
) = 1;
1878 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1879 different from its canonical type, wrap the whole thing inside a
1880 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1883 The canonical type of a COMPONENT_REF is the type of the field being
1884 referenced--unless the field is a bit-field which can be read directly
1885 in a smaller mode, in which case the canonical type is the
1886 sign-appropriate type corresponding to that mode. */
1889 canonicalize_component_ref (tree
*expr_p
)
1891 tree expr
= *expr_p
;
1894 gcc_assert (TREE_CODE (expr
) == COMPONENT_REF
);
1896 if (INTEGRAL_TYPE_P (TREE_TYPE (expr
)))
1897 type
= TREE_TYPE (get_unwidened (expr
, NULL_TREE
));
1899 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
1901 /* One could argue that all the stuff below is not necessary for
1902 the non-bitfield case and declare it a FE error if type
1903 adjustment would be needed. */
1904 if (TREE_TYPE (expr
) != type
)
1906 #ifdef ENABLE_TYPES_CHECKING
1907 tree old_type
= TREE_TYPE (expr
);
1911 /* We need to preserve qualifiers and propagate them from
1913 type_quals
= TYPE_QUALS (type
)
1914 | TYPE_QUALS (TREE_TYPE (TREE_OPERAND (expr
, 0)));
1915 if (TYPE_QUALS (type
) != type_quals
)
1916 type
= build_qualified_type (TYPE_MAIN_VARIANT (type
), type_quals
);
1918 /* Set the type of the COMPONENT_REF to the underlying type. */
1919 TREE_TYPE (expr
) = type
;
1921 #ifdef ENABLE_TYPES_CHECKING
1922 /* It is now a FE error, if the conversion from the canonical
1923 type to the original expression type is not useless. */
1924 gcc_assert (useless_type_conversion_p (old_type
, type
));
1929 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1930 to foo, embed that change in the ADDR_EXPR by converting
1935 where L is the lower bound. For simplicity, only do this for constant
1937 The constraint is that the type of &array[L] is trivially convertible
1941 canonicalize_addr_expr (tree
*expr_p
)
1943 tree expr
= *expr_p
;
1944 tree addr_expr
= TREE_OPERAND (expr
, 0);
1945 tree datype
, ddatype
, pddatype
;
1947 /* We simplify only conversions from an ADDR_EXPR to a pointer type. */
1948 if (!POINTER_TYPE_P (TREE_TYPE (expr
))
1949 || TREE_CODE (addr_expr
) != ADDR_EXPR
)
1952 /* The addr_expr type should be a pointer to an array. */
1953 datype
= TREE_TYPE (TREE_TYPE (addr_expr
));
1954 if (TREE_CODE (datype
) != ARRAY_TYPE
)
1957 /* The pointer to element type shall be trivially convertible to
1958 the expression pointer type. */
1959 ddatype
= TREE_TYPE (datype
);
1960 pddatype
= build_pointer_type (ddatype
);
1961 if (!useless_type_conversion_p (TYPE_MAIN_VARIANT (TREE_TYPE (expr
)),
1965 /* The lower bound and element sizes must be constant. */
1966 if (!TYPE_SIZE_UNIT (ddatype
)
1967 || TREE_CODE (TYPE_SIZE_UNIT (ddatype
)) != INTEGER_CST
1968 || !TYPE_DOMAIN (datype
) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))
1969 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))) != INTEGER_CST
)
1972 /* All checks succeeded. Build a new node to merge the cast. */
1973 *expr_p
= build4 (ARRAY_REF
, ddatype
, TREE_OPERAND (addr_expr
, 0),
1974 TYPE_MIN_VALUE (TYPE_DOMAIN (datype
)),
1975 NULL_TREE
, NULL_TREE
);
1976 *expr_p
= build1 (ADDR_EXPR
, pddatype
, *expr_p
);
1978 /* We can have stripped a required restrict qualifier above. */
1979 if (!useless_type_conversion_p (TREE_TYPE (expr
), TREE_TYPE (*expr_p
)))
1980 *expr_p
= fold_convert (TREE_TYPE (expr
), *expr_p
);
1983 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1984 underneath as appropriate. */
1986 static enum gimplify_status
1987 gimplify_conversion (tree
*expr_p
)
1989 location_t loc
= EXPR_LOCATION (*expr_p
);
1990 gcc_assert (CONVERT_EXPR_P (*expr_p
));
1992 /* Then strip away all but the outermost conversion. */
1993 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p
, 0));
1995 /* And remove the outermost conversion if it's useless. */
1996 if (tree_ssa_useless_type_conversion (*expr_p
))
1997 *expr_p
= TREE_OPERAND (*expr_p
, 0);
1999 /* If we still have a conversion at the toplevel,
2000 then canonicalize some constructs. */
2001 if (CONVERT_EXPR_P (*expr_p
))
2003 tree sub
= TREE_OPERAND (*expr_p
, 0);
2005 /* If a NOP conversion is changing the type of a COMPONENT_REF
2006 expression, then canonicalize its type now in order to expose more
2007 redundant conversions. */
2008 if (TREE_CODE (sub
) == COMPONENT_REF
)
2009 canonicalize_component_ref (&TREE_OPERAND (*expr_p
, 0));
2011 /* If a NOP conversion is changing a pointer to array of foo
2012 to a pointer to foo, embed that change in the ADDR_EXPR. */
2013 else if (TREE_CODE (sub
) == ADDR_EXPR
)
2014 canonicalize_addr_expr (expr_p
);
2017 /* If we have a conversion to a non-register type force the
2018 use of a VIEW_CONVERT_EXPR instead. */
2019 if (CONVERT_EXPR_P (*expr_p
) && !is_gimple_reg_type (TREE_TYPE (*expr_p
)))
2020 *expr_p
= fold_build1_loc (loc
, VIEW_CONVERT_EXPR
, TREE_TYPE (*expr_p
),
2021 TREE_OPERAND (*expr_p
, 0));
2026 /* Nonlocal VLAs seen in the current function. */
2027 static struct pointer_set_t
*nonlocal_vlas
;
2029 /* Gimplify a VAR_DECL or PARM_DECL. Return GS_OK if we expanded a
2030 DECL_VALUE_EXPR, and it's worth re-examining things. */
2032 static enum gimplify_status
2033 gimplify_var_or_parm_decl (tree
*expr_p
)
2035 tree decl
= *expr_p
;
2037 /* ??? If this is a local variable, and it has not been seen in any
2038 outer BIND_EXPR, then it's probably the result of a duplicate
2039 declaration, for which we've already issued an error. It would
2040 be really nice if the front end wouldn't leak these at all.
2041 Currently the only known culprit is C++ destructors, as seen
2042 in g++.old-deja/g++.jason/binding.C. */
2043 if (TREE_CODE (decl
) == VAR_DECL
2044 && !DECL_SEEN_IN_BIND_EXPR_P (decl
)
2045 && !TREE_STATIC (decl
) && !DECL_EXTERNAL (decl
)
2046 && decl_function_context (decl
) == current_function_decl
)
2048 gcc_assert (seen_error ());
2052 /* When within an OpenMP context, notice uses of variables. */
2053 if (gimplify_omp_ctxp
&& omp_notice_variable (gimplify_omp_ctxp
, decl
, true))
2056 /* If the decl is an alias for another expression, substitute it now. */
2057 if (DECL_HAS_VALUE_EXPR_P (decl
))
2059 tree value_expr
= DECL_VALUE_EXPR (decl
);
2061 /* For referenced nonlocal VLAs add a decl for debugging purposes
2062 to the current function. */
2063 if (TREE_CODE (decl
) == VAR_DECL
2064 && TREE_CODE (DECL_SIZE_UNIT (decl
)) != INTEGER_CST
2065 && nonlocal_vlas
!= NULL
2066 && TREE_CODE (value_expr
) == INDIRECT_REF
2067 && TREE_CODE (TREE_OPERAND (value_expr
, 0)) == VAR_DECL
2068 && decl_function_context (decl
) != current_function_decl
)
2070 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
2071 while (ctx
&& ctx
->region_type
== ORT_WORKSHARE
)
2072 ctx
= ctx
->outer_context
;
2073 if (!ctx
&& !pointer_set_insert (nonlocal_vlas
, decl
))
2075 tree copy
= copy_node (decl
), block
;
2077 lang_hooks
.dup_lang_specific_decl (copy
);
2078 SET_DECL_RTL (copy
, 0);
2079 TREE_USED (copy
) = 1;
2080 block
= DECL_INITIAL (current_function_decl
);
2081 DECL_CHAIN (copy
) = BLOCK_VARS (block
);
2082 BLOCK_VARS (block
) = copy
;
2083 SET_DECL_VALUE_EXPR (copy
, unshare_expr (value_expr
));
2084 DECL_HAS_VALUE_EXPR_P (copy
) = 1;
2088 *expr_p
= unshare_expr (value_expr
);
2095 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
2099 : min_lval '[' val ']'
2101 | compound_lval '[' val ']'
2102 | compound_lval '.' ID
2104 This is not part of the original SIMPLE definition, which separates
2105 array and member references, but it seems reasonable to handle them
2106 together. Also, this way we don't run into problems with union
2107 aliasing; gcc requires that for accesses through a union to alias, the
2108 union reference must be explicit, which was not always the case when we
2109 were splitting up array and member refs.
2111 PRE_P points to the sequence where side effects that must happen before
2112 *EXPR_P should be stored.
2114 POST_P points to the sequence where side effects that must happen after
2115 *EXPR_P should be stored. */
2117 static enum gimplify_status
2118 gimplify_compound_lval (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
2119 fallback_t fallback
)
2122 VEC(tree
,heap
) *stack
;
2123 enum gimplify_status ret
= GS_ALL_DONE
, tret
;
2125 location_t loc
= EXPR_LOCATION (*expr_p
);
2126 tree expr
= *expr_p
;
2128 /* Create a stack of the subexpressions so later we can walk them in
2129 order from inner to outer. */
2130 stack
= VEC_alloc (tree
, heap
, 10);
2132 /* We can handle anything that get_inner_reference can deal with. */
2133 for (p
= expr_p
; ; p
= &TREE_OPERAND (*p
, 0))
2136 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
2137 if (TREE_CODE (*p
) == INDIRECT_REF
)
2138 *p
= fold_indirect_ref_loc (loc
, *p
);
2140 if (handled_component_p (*p
))
2142 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
2143 additional COMPONENT_REFs. */
2144 else if ((TREE_CODE (*p
) == VAR_DECL
|| TREE_CODE (*p
) == PARM_DECL
)
2145 && gimplify_var_or_parm_decl (p
) == GS_OK
)
2150 VEC_safe_push (tree
, heap
, stack
, *p
);
2153 gcc_assert (VEC_length (tree
, stack
));
2155 /* Now STACK is a stack of pointers to all the refs we've walked through
2156 and P points to the innermost expression.
2158 Java requires that we elaborated nodes in source order. That
2159 means we must gimplify the inner expression followed by each of
2160 the indices, in order. But we can't gimplify the inner
2161 expression until we deal with any variable bounds, sizes, or
2162 positions in order to deal with PLACEHOLDER_EXPRs.
2164 So we do this in three steps. First we deal with the annotations
2165 for any variables in the components, then we gimplify the base,
2166 then we gimplify any indices, from left to right. */
2167 for (i
= VEC_length (tree
, stack
) - 1; i
>= 0; i
--)
2169 tree t
= VEC_index (tree
, stack
, i
);
2171 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
2173 /* Gimplify the low bound and element type size and put them into
2174 the ARRAY_REF. If these values are set, they have already been
2176 if (TREE_OPERAND (t
, 2) == NULL_TREE
)
2178 tree low
= unshare_expr (array_ref_low_bound (t
));
2179 if (!is_gimple_min_invariant (low
))
2181 TREE_OPERAND (t
, 2) = low
;
2182 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
,
2183 post_p
, is_gimple_reg
,
2185 ret
= MIN (ret
, tret
);
2190 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
2191 is_gimple_reg
, fb_rvalue
);
2192 ret
= MIN (ret
, tret
);
2195 if (TREE_OPERAND (t
, 3) == NULL_TREE
)
2197 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (t
, 0)));
2198 tree elmt_size
= unshare_expr (array_ref_element_size (t
));
2199 tree factor
= size_int (TYPE_ALIGN_UNIT (elmt_type
));
2201 /* Divide the element size by the alignment of the element
2204 = size_binop_loc (loc
, EXACT_DIV_EXPR
, elmt_size
, factor
);
2206 if (!is_gimple_min_invariant (elmt_size
))
2208 TREE_OPERAND (t
, 3) = elmt_size
;
2209 tret
= gimplify_expr (&TREE_OPERAND (t
, 3), pre_p
,
2210 post_p
, is_gimple_reg
,
2212 ret
= MIN (ret
, tret
);
2217 tret
= gimplify_expr (&TREE_OPERAND (t
, 3), pre_p
, post_p
,
2218 is_gimple_reg
, fb_rvalue
);
2219 ret
= MIN (ret
, tret
);
2222 else if (TREE_CODE (t
) == COMPONENT_REF
)
2224 /* Set the field offset into T and gimplify it. */
2225 if (TREE_OPERAND (t
, 2) == NULL_TREE
)
2227 tree offset
= unshare_expr (component_ref_field_offset (t
));
2228 tree field
= TREE_OPERAND (t
, 1);
2230 = size_int (DECL_OFFSET_ALIGN (field
) / BITS_PER_UNIT
);
2232 /* Divide the offset by its alignment. */
2233 offset
= size_binop_loc (loc
, EXACT_DIV_EXPR
, offset
, factor
);
2235 if (!is_gimple_min_invariant (offset
))
2237 TREE_OPERAND (t
, 2) = offset
;
2238 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
,
2239 post_p
, is_gimple_reg
,
2241 ret
= MIN (ret
, tret
);
2246 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
2247 is_gimple_reg
, fb_rvalue
);
2248 ret
= MIN (ret
, tret
);
2253 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
2254 so as to match the min_lval predicate. Failure to do so may result
2255 in the creation of large aggregate temporaries. */
2256 tret
= gimplify_expr (p
, pre_p
, post_p
, is_gimple_min_lval
,
2257 fallback
| fb_lvalue
);
2258 ret
= MIN (ret
, tret
);
2260 /* And finally, the indices and operands of ARRAY_REF. During this
2261 loop we also remove any useless conversions. */
2262 for (; VEC_length (tree
, stack
) > 0; )
2264 tree t
= VEC_pop (tree
, stack
);
2266 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
2268 /* Gimplify the dimension. */
2269 if (!is_gimple_min_invariant (TREE_OPERAND (t
, 1)))
2271 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), pre_p
, post_p
,
2272 is_gimple_val
, fb_rvalue
);
2273 ret
= MIN (ret
, tret
);
2277 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t
, 0));
2279 /* The innermost expression P may have originally had
2280 TREE_SIDE_EFFECTS set which would have caused all the outer
2281 expressions in *EXPR_P leading to P to also have had
2282 TREE_SIDE_EFFECTS set. */
2283 recalculate_side_effects (t
);
2286 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
2287 if ((fallback
& fb_rvalue
) && TREE_CODE (*expr_p
) == COMPONENT_REF
)
2289 canonicalize_component_ref (expr_p
);
2292 VEC_free (tree
, heap
, stack
);
2294 gcc_assert (*expr_p
== expr
|| ret
!= GS_ALL_DONE
);
2299 /* Gimplify the self modifying expression pointed to by EXPR_P
2302 PRE_P points to the list where side effects that must happen before
2303 *EXPR_P should be stored.
2305 POST_P points to the list where side effects that must happen after
2306 *EXPR_P should be stored.
2308 WANT_VALUE is nonzero iff we want to use the value of this expression
2309 in another expression. */
2311 static enum gimplify_status
2312 gimplify_self_mod_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
2315 enum tree_code code
;
2316 tree lhs
, lvalue
, rhs
, t1
;
2317 gimple_seq post
= NULL
, *orig_post_p
= post_p
;
2319 enum tree_code arith_code
;
2320 enum gimplify_status ret
;
2321 location_t loc
= EXPR_LOCATION (*expr_p
);
2323 code
= TREE_CODE (*expr_p
);
2325 gcc_assert (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
2326 || code
== PREINCREMENT_EXPR
|| code
== PREDECREMENT_EXPR
);
2328 /* Prefix or postfix? */
2329 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
2330 /* Faster to treat as prefix if result is not used. */
2331 postfix
= want_value
;
2335 /* For postfix, make sure the inner expression's post side effects
2336 are executed after side effects from this expression. */
2340 /* Add or subtract? */
2341 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
2342 arith_code
= PLUS_EXPR
;
2344 arith_code
= MINUS_EXPR
;
2346 /* Gimplify the LHS into a GIMPLE lvalue. */
2347 lvalue
= TREE_OPERAND (*expr_p
, 0);
2348 ret
= gimplify_expr (&lvalue
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
2349 if (ret
== GS_ERROR
)
2352 /* Extract the operands to the arithmetic operation. */
2354 rhs
= TREE_OPERAND (*expr_p
, 1);
2356 /* For postfix operator, we evaluate the LHS to an rvalue and then use
2357 that as the result value and in the postqueue operation. We also
2358 make sure to make lvalue a minimal lval, see
2359 gcc.c-torture/execute/20040313-1.c for an example where this matters. */
2362 if (!is_gimple_min_lval (lvalue
))
2364 mark_addressable (lvalue
);
2365 lvalue
= build_fold_addr_expr_loc (input_location
, lvalue
);
2366 gimplify_expr (&lvalue
, pre_p
, post_p
, is_gimple_val
, fb_rvalue
);
2367 lvalue
= build_fold_indirect_ref_loc (input_location
, lvalue
);
2369 ret
= gimplify_expr (&lhs
, pre_p
, post_p
, is_gimple_val
, fb_rvalue
);
2370 if (ret
== GS_ERROR
)
2374 /* For POINTERs increment, use POINTER_PLUS_EXPR. */
2375 if (POINTER_TYPE_P (TREE_TYPE (lhs
)))
2377 rhs
= convert_to_ptrofftype_loc (loc
, rhs
);
2378 if (arith_code
== MINUS_EXPR
)
2379 rhs
= fold_build1_loc (loc
, NEGATE_EXPR
, TREE_TYPE (rhs
), rhs
);
2380 arith_code
= POINTER_PLUS_EXPR
;
2385 tree t2
= get_initialized_tmp_var (lhs
, pre_p
, NULL
);
2386 t1
= build2 (arith_code
, TREE_TYPE (*expr_p
), t2
, rhs
);
2387 gimplify_assign (lvalue
, t1
, pre_p
);
2388 gimplify_seq_add_seq (orig_post_p
, post
);
2394 t1
= build2 (arith_code
, TREE_TYPE (*expr_p
), lhs
, rhs
);
2395 *expr_p
= build2 (MODIFY_EXPR
, TREE_TYPE (lvalue
), lvalue
, t1
);
2400 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
2403 maybe_with_size_expr (tree
*expr_p
)
2405 tree expr
= *expr_p
;
2406 tree type
= TREE_TYPE (expr
);
2409 /* If we've already wrapped this or the type is error_mark_node, we can't do
2411 if (TREE_CODE (expr
) == WITH_SIZE_EXPR
2412 || type
== error_mark_node
)
2415 /* If the size isn't known or is a constant, we have nothing to do. */
2416 size
= TYPE_SIZE_UNIT (type
);
2417 if (!size
|| TREE_CODE (size
) == INTEGER_CST
)
2420 /* Otherwise, make a WITH_SIZE_EXPR. */
2421 size
= unshare_expr (size
);
2422 size
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (size
, expr
);
2423 *expr_p
= build2 (WITH_SIZE_EXPR
, type
, expr
, size
);
2426 /* Helper for gimplify_call_expr. Gimplify a single argument *ARG_P
2427 Store any side-effects in PRE_P. CALL_LOCATION is the location of
2430 static enum gimplify_status
2431 gimplify_arg (tree
*arg_p
, gimple_seq
*pre_p
, location_t call_location
)
2433 bool (*test
) (tree
);
2436 /* In general, we allow lvalues for function arguments to avoid
2437 extra overhead of copying large aggregates out of even larger
2438 aggregates into temporaries only to copy the temporaries to
2439 the argument list. Make optimizers happy by pulling out to
2440 temporaries those types that fit in registers. */
2441 if (is_gimple_reg_type (TREE_TYPE (*arg_p
)))
2442 test
= is_gimple_val
, fb
= fb_rvalue
;
2445 test
= is_gimple_lvalue
, fb
= fb_either
;
2446 /* Also strip a TARGET_EXPR that would force an extra copy. */
2447 if (TREE_CODE (*arg_p
) == TARGET_EXPR
)
2449 tree init
= TARGET_EXPR_INITIAL (*arg_p
);
2451 && !VOID_TYPE_P (TREE_TYPE (init
)))
2456 /* If this is a variable sized type, we must remember the size. */
2457 maybe_with_size_expr (arg_p
);
2459 /* FIXME diagnostics: This will mess up gcc.dg/Warray-bounds.c. */
2460 /* Make sure arguments have the same location as the function call
2462 protected_set_expr_location (*arg_p
, call_location
);
2464 /* There is a sequence point before a function call. Side effects in
2465 the argument list must occur before the actual call. So, when
2466 gimplifying arguments, force gimplify_expr to use an internal
2467 post queue which is then appended to the end of PRE_P. */
2468 return gimplify_expr (arg_p
, pre_p
, NULL
, test
, fb
);
2471 /* Gimplify the CALL_EXPR node *EXPR_P into the GIMPLE sequence PRE_P.
2472 WANT_VALUE is true if the result of the call is desired. */
2474 static enum gimplify_status
2475 gimplify_call_expr (tree
*expr_p
, gimple_seq
*pre_p
, bool want_value
)
2477 tree fndecl
, parms
, p
, fnptrtype
;
2478 enum gimplify_status ret
;
2481 bool builtin_va_start_p
= FALSE
;
2482 location_t loc
= EXPR_LOCATION (*expr_p
);
2484 gcc_assert (TREE_CODE (*expr_p
) == CALL_EXPR
);
2486 /* For reliable diagnostics during inlining, it is necessary that
2487 every call_expr be annotated with file and line. */
2488 if (! EXPR_HAS_LOCATION (*expr_p
))
2489 SET_EXPR_LOCATION (*expr_p
, input_location
);
2491 /* This may be a call to a builtin function.
2493 Builtin function calls may be transformed into different
2494 (and more efficient) builtin function calls under certain
2495 circumstances. Unfortunately, gimplification can muck things
2496 up enough that the builtin expanders are not aware that certain
2497 transformations are still valid.
2499 So we attempt transformation/gimplification of the call before
2500 we gimplify the CALL_EXPR. At this time we do not manage to
2501 transform all calls in the same manner as the expanders do, but
2502 we do transform most of them. */
2503 fndecl
= get_callee_fndecl (*expr_p
);
2504 if (fndecl
&& DECL_BUILT_IN (fndecl
))
2506 tree new_tree
= fold_call_expr (input_location
, *expr_p
, !want_value
);
2508 if (new_tree
&& new_tree
!= *expr_p
)
2510 /* There was a transformation of this call which computes the
2511 same value, but in a more efficient way. Return and try
2517 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
2518 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_VA_START
)
2520 builtin_va_start_p
= TRUE
;
2521 if (call_expr_nargs (*expr_p
) < 2)
2523 error ("too few arguments to function %<va_start%>");
2524 *expr_p
= build_empty_stmt (EXPR_LOCATION (*expr_p
));
2528 if (fold_builtin_next_arg (*expr_p
, true))
2530 *expr_p
= build_empty_stmt (EXPR_LOCATION (*expr_p
));
2536 /* Remember the original function pointer type. */
2537 fnptrtype
= TREE_TYPE (CALL_EXPR_FN (*expr_p
));
2539 /* There is a sequence point before the call, so any side effects in
2540 the calling expression must occur before the actual call. Force
2541 gimplify_expr to use an internal post queue. */
2542 ret
= gimplify_expr (&CALL_EXPR_FN (*expr_p
), pre_p
, NULL
,
2543 is_gimple_call_addr
, fb_rvalue
);
2545 nargs
= call_expr_nargs (*expr_p
);
2547 /* Get argument types for verification. */
2548 fndecl
= get_callee_fndecl (*expr_p
);
2551 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
2552 else if (POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_FN (*expr_p
))))
2553 parms
= TYPE_ARG_TYPES (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (*expr_p
))));
2555 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
2556 p
= DECL_ARGUMENTS (fndecl
);
2561 for (i
= 0; i
< nargs
&& p
; i
++, p
= TREE_CHAIN (p
))
2564 /* If the last argument is __builtin_va_arg_pack () and it is not
2565 passed as a named argument, decrease the number of CALL_EXPR
2566 arguments and set instead the CALL_EXPR_VA_ARG_PACK flag. */
2569 && TREE_CODE (CALL_EXPR_ARG (*expr_p
, nargs
- 1)) == CALL_EXPR
)
2571 tree last_arg
= CALL_EXPR_ARG (*expr_p
, nargs
- 1);
2572 tree last_arg_fndecl
= get_callee_fndecl (last_arg
);
2575 && TREE_CODE (last_arg_fndecl
) == FUNCTION_DECL
2576 && DECL_BUILT_IN_CLASS (last_arg_fndecl
) == BUILT_IN_NORMAL
2577 && DECL_FUNCTION_CODE (last_arg_fndecl
) == BUILT_IN_VA_ARG_PACK
)
2579 tree call
= *expr_p
;
2582 *expr_p
= build_call_array_loc (loc
, TREE_TYPE (call
),
2583 CALL_EXPR_FN (call
),
2584 nargs
, CALL_EXPR_ARGP (call
));
2586 /* Copy all CALL_EXPR flags, location and block, except
2587 CALL_EXPR_VA_ARG_PACK flag. */
2588 CALL_EXPR_STATIC_CHAIN (*expr_p
) = CALL_EXPR_STATIC_CHAIN (call
);
2589 CALL_EXPR_TAILCALL (*expr_p
) = CALL_EXPR_TAILCALL (call
);
2590 CALL_EXPR_RETURN_SLOT_OPT (*expr_p
)
2591 = CALL_EXPR_RETURN_SLOT_OPT (call
);
2592 CALL_FROM_THUNK_P (*expr_p
) = CALL_FROM_THUNK_P (call
);
2593 SET_EXPR_LOCATION (*expr_p
, EXPR_LOCATION (call
));
2594 TREE_BLOCK (*expr_p
) = TREE_BLOCK (call
);
2596 /* Set CALL_EXPR_VA_ARG_PACK. */
2597 CALL_EXPR_VA_ARG_PACK (*expr_p
) = 1;
2601 /* Finally, gimplify the function arguments. */
2604 for (i
= (PUSH_ARGS_REVERSED
? nargs
- 1 : 0);
2605 PUSH_ARGS_REVERSED
? i
>= 0 : i
< nargs
;
2606 PUSH_ARGS_REVERSED
? i
-- : i
++)
2608 enum gimplify_status t
;
2610 /* Avoid gimplifying the second argument to va_start, which needs to
2611 be the plain PARM_DECL. */
2612 if ((i
!= 1) || !builtin_va_start_p
)
2614 t
= gimplify_arg (&CALL_EXPR_ARG (*expr_p
, i
), pre_p
,
2615 EXPR_LOCATION (*expr_p
));
2623 /* Verify the function result. */
2624 if (want_value
&& fndecl
2625 && VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fnptrtype
))))
2627 error_at (loc
, "using result of function returning %<void%>");
2631 /* Try this again in case gimplification exposed something. */
2632 if (ret
!= GS_ERROR
)
2634 tree new_tree
= fold_call_expr (input_location
, *expr_p
, !want_value
);
2636 if (new_tree
&& new_tree
!= *expr_p
)
2638 /* There was a transformation of this call which computes the
2639 same value, but in a more efficient way. Return and try
2647 *expr_p
= error_mark_node
;
2651 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2652 decl. This allows us to eliminate redundant or useless
2653 calls to "const" functions. */
2654 if (TREE_CODE (*expr_p
) == CALL_EXPR
)
2656 int flags
= call_expr_flags (*expr_p
);
2657 if (flags
& (ECF_CONST
| ECF_PURE
)
2658 /* An infinite loop is considered a side effect. */
2659 && !(flags
& (ECF_LOOPING_CONST_OR_PURE
)))
2660 TREE_SIDE_EFFECTS (*expr_p
) = 0;
2663 /* If the value is not needed by the caller, emit a new GIMPLE_CALL
2664 and clear *EXPR_P. Otherwise, leave *EXPR_P in its gimplified
2665 form and delegate the creation of a GIMPLE_CALL to
2666 gimplify_modify_expr. This is always possible because when
2667 WANT_VALUE is true, the caller wants the result of this call into
2668 a temporary, which means that we will emit an INIT_EXPR in
2669 internal_get_tmp_var which will then be handled by
2670 gimplify_modify_expr. */
2673 /* The CALL_EXPR in *EXPR_P is already in GIMPLE form, so all we
2674 have to do is replicate it as a GIMPLE_CALL tuple. */
2675 gimple_stmt_iterator gsi
;
2676 call
= gimple_build_call_from_tree (*expr_p
);
2677 gimple_call_set_fntype (call
, TREE_TYPE (fnptrtype
));
2678 gimplify_seq_add_stmt (pre_p
, call
);
2679 gsi
= gsi_last (*pre_p
);
2681 *expr_p
= NULL_TREE
;
2684 /* Remember the original function type. */
2685 CALL_EXPR_FN (*expr_p
) = build1 (NOP_EXPR
, fnptrtype
,
2686 CALL_EXPR_FN (*expr_p
));
2691 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2692 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2694 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2695 condition is true or false, respectively. If null, we should generate
2696 our own to skip over the evaluation of this specific expression.
2698 LOCUS is the source location of the COND_EXPR.
2700 This function is the tree equivalent of do_jump.
2702 shortcut_cond_r should only be called by shortcut_cond_expr. */
2705 shortcut_cond_r (tree pred
, tree
*true_label_p
, tree
*false_label_p
,
2708 tree local_label
= NULL_TREE
;
2709 tree t
, expr
= NULL
;
2711 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2712 retain the shortcut semantics. Just insert the gotos here;
2713 shortcut_cond_expr will append the real blocks later. */
2714 if (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2716 location_t new_locus
;
2718 /* Turn if (a && b) into
2720 if (a); else goto no;
2721 if (b) goto yes; else goto no;
2724 if (false_label_p
== NULL
)
2725 false_label_p
= &local_label
;
2727 /* Keep the original source location on the first 'if'. */
2728 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), NULL
, false_label_p
, locus
);
2729 append_to_statement_list (t
, &expr
);
2731 /* Set the source location of the && on the second 'if'. */
2732 new_locus
= EXPR_HAS_LOCATION (pred
) ? EXPR_LOCATION (pred
) : locus
;
2733 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
, false_label_p
,
2735 append_to_statement_list (t
, &expr
);
2737 else if (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2739 location_t new_locus
;
2741 /* Turn if (a || b) into
2744 if (b) goto yes; else goto no;
2747 if (true_label_p
== NULL
)
2748 true_label_p
= &local_label
;
2750 /* Keep the original source location on the first 'if'. */
2751 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), true_label_p
, NULL
, locus
);
2752 append_to_statement_list (t
, &expr
);
2754 /* Set the source location of the || on the second 'if'. */
2755 new_locus
= EXPR_HAS_LOCATION (pred
) ? EXPR_LOCATION (pred
) : locus
;
2756 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
, false_label_p
,
2758 append_to_statement_list (t
, &expr
);
2760 else if (TREE_CODE (pred
) == COND_EXPR
2761 && !VOID_TYPE_P (TREE_TYPE (TREE_OPERAND (pred
, 1)))
2762 && !VOID_TYPE_P (TREE_TYPE (TREE_OPERAND (pred
, 2))))
2764 location_t new_locus
;
2766 /* As long as we're messing with gotos, turn if (a ? b : c) into
2768 if (b) goto yes; else goto no;
2770 if (c) goto yes; else goto no;
2772 Don't do this if one of the arms has void type, which can happen
2773 in C++ when the arm is throw. */
2775 /* Keep the original source location on the first 'if'. Set the source
2776 location of the ? on the second 'if'. */
2777 new_locus
= EXPR_HAS_LOCATION (pred
) ? EXPR_LOCATION (pred
) : locus
;
2778 expr
= build3 (COND_EXPR
, void_type_node
, TREE_OPERAND (pred
, 0),
2779 shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2780 false_label_p
, locus
),
2781 shortcut_cond_r (TREE_OPERAND (pred
, 2), true_label_p
,
2782 false_label_p
, new_locus
));
2786 expr
= build3 (COND_EXPR
, void_type_node
, pred
,
2787 build_and_jump (true_label_p
),
2788 build_and_jump (false_label_p
));
2789 SET_EXPR_LOCATION (expr
, locus
);
2794 t
= build1 (LABEL_EXPR
, void_type_node
, local_label
);
2795 append_to_statement_list (t
, &expr
);
2801 /* Given a conditional expression EXPR with short-circuit boolean
2802 predicates using TRUTH_ANDIF_EXPR or TRUTH_ORIF_EXPR, break the
2803 predicate apart into the equivalent sequence of conditionals. */
2806 shortcut_cond_expr (tree expr
)
2808 tree pred
= TREE_OPERAND (expr
, 0);
2809 tree then_
= TREE_OPERAND (expr
, 1);
2810 tree else_
= TREE_OPERAND (expr
, 2);
2811 tree true_label
, false_label
, end_label
, t
;
2813 tree
*false_label_p
;
2814 bool emit_end
, emit_false
, jump_over_else
;
2815 bool then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2816 bool else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2818 /* First do simple transformations. */
2821 /* If there is no 'else', turn
2824 if (a) if (b) then c. */
2825 while (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2827 /* Keep the original source location on the first 'if'. */
2828 location_t locus
= EXPR_LOC_OR_HERE (expr
);
2829 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2830 /* Set the source location of the && on the second 'if'. */
2831 if (EXPR_HAS_LOCATION (pred
))
2832 SET_EXPR_LOCATION (expr
, EXPR_LOCATION (pred
));
2833 then_
= shortcut_cond_expr (expr
);
2834 then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2835 pred
= TREE_OPERAND (pred
, 0);
2836 expr
= build3 (COND_EXPR
, void_type_node
, pred
, then_
, NULL_TREE
);
2837 SET_EXPR_LOCATION (expr
, locus
);
2843 /* If there is no 'then', turn
2846 if (a); else if (b); else d. */
2847 while (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2849 /* Keep the original source location on the first 'if'. */
2850 location_t locus
= EXPR_LOC_OR_HERE (expr
);
2851 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2852 /* Set the source location of the || on the second 'if'. */
2853 if (EXPR_HAS_LOCATION (pred
))
2854 SET_EXPR_LOCATION (expr
, EXPR_LOCATION (pred
));
2855 else_
= shortcut_cond_expr (expr
);
2856 else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2857 pred
= TREE_OPERAND (pred
, 0);
2858 expr
= build3 (COND_EXPR
, void_type_node
, pred
, NULL_TREE
, else_
);
2859 SET_EXPR_LOCATION (expr
, locus
);
2863 /* If we're done, great. */
2864 if (TREE_CODE (pred
) != TRUTH_ANDIF_EXPR
2865 && TREE_CODE (pred
) != TRUTH_ORIF_EXPR
)
2868 /* Otherwise we need to mess with gotos. Change
2871 if (a); else goto no;
2874 and recursively gimplify the condition. */
2876 true_label
= false_label
= end_label
= NULL_TREE
;
2878 /* If our arms just jump somewhere, hijack those labels so we don't
2879 generate jumps to jumps. */
2882 && TREE_CODE (then_
) == GOTO_EXPR
2883 && TREE_CODE (GOTO_DESTINATION (then_
)) == LABEL_DECL
)
2885 true_label
= GOTO_DESTINATION (then_
);
2891 && TREE_CODE (else_
) == GOTO_EXPR
2892 && TREE_CODE (GOTO_DESTINATION (else_
)) == LABEL_DECL
)
2894 false_label
= GOTO_DESTINATION (else_
);
2899 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2901 true_label_p
= &true_label
;
2903 true_label_p
= NULL
;
2905 /* The 'else' branch also needs a label if it contains interesting code. */
2906 if (false_label
|| else_se
)
2907 false_label_p
= &false_label
;
2909 false_label_p
= NULL
;
2911 /* If there was nothing else in our arms, just forward the label(s). */
2912 if (!then_se
&& !else_se
)
2913 return shortcut_cond_r (pred
, true_label_p
, false_label_p
,
2914 EXPR_LOC_OR_HERE (expr
));
2916 /* If our last subexpression already has a terminal label, reuse it. */
2918 t
= expr_last (else_
);
2920 t
= expr_last (then_
);
2923 if (t
&& TREE_CODE (t
) == LABEL_EXPR
)
2924 end_label
= LABEL_EXPR_LABEL (t
);
2926 /* If we don't care about jumping to the 'else' branch, jump to the end
2927 if the condition is false. */
2929 false_label_p
= &end_label
;
2931 /* We only want to emit these labels if we aren't hijacking them. */
2932 emit_end
= (end_label
== NULL_TREE
);
2933 emit_false
= (false_label
== NULL_TREE
);
2935 /* We only emit the jump over the else clause if we have to--if the
2936 then clause may fall through. Otherwise we can wind up with a
2937 useless jump and a useless label at the end of gimplified code,
2938 which will cause us to think that this conditional as a whole
2939 falls through even if it doesn't. If we then inline a function
2940 which ends with such a condition, that can cause us to issue an
2941 inappropriate warning about control reaching the end of a
2942 non-void function. */
2943 jump_over_else
= block_may_fallthru (then_
);
2945 pred
= shortcut_cond_r (pred
, true_label_p
, false_label_p
,
2946 EXPR_LOC_OR_HERE (expr
));
2949 append_to_statement_list (pred
, &expr
);
2951 append_to_statement_list (then_
, &expr
);
2956 tree last
= expr_last (expr
);
2957 t
= build_and_jump (&end_label
);
2958 if (EXPR_HAS_LOCATION (last
))
2959 SET_EXPR_LOCATION (t
, EXPR_LOCATION (last
));
2960 append_to_statement_list (t
, &expr
);
2964 t
= build1 (LABEL_EXPR
, void_type_node
, false_label
);
2965 append_to_statement_list (t
, &expr
);
2967 append_to_statement_list (else_
, &expr
);
2969 if (emit_end
&& end_label
)
2971 t
= build1 (LABEL_EXPR
, void_type_node
, end_label
);
2972 append_to_statement_list (t
, &expr
);
2978 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2981 gimple_boolify (tree expr
)
2983 tree type
= TREE_TYPE (expr
);
2984 location_t loc
= EXPR_LOCATION (expr
);
2986 if (TREE_CODE (expr
) == NE_EXPR
2987 && TREE_CODE (TREE_OPERAND (expr
, 0)) == CALL_EXPR
2988 && integer_zerop (TREE_OPERAND (expr
, 1)))
2990 tree call
= TREE_OPERAND (expr
, 0);
2991 tree fn
= get_callee_fndecl (call
);
2993 /* For __builtin_expect ((long) (x), y) recurse into x as well
2994 if x is truth_value_p. */
2996 && DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
2997 && DECL_FUNCTION_CODE (fn
) == BUILT_IN_EXPECT
2998 && call_expr_nargs (call
) == 2)
3000 tree arg
= CALL_EXPR_ARG (call
, 0);
3003 if (TREE_CODE (arg
) == NOP_EXPR
3004 && TREE_TYPE (arg
) == TREE_TYPE (call
))
3005 arg
= TREE_OPERAND (arg
, 0);
3006 if (truth_value_p (TREE_CODE (arg
)))
3008 arg
= gimple_boolify (arg
);
3009 CALL_EXPR_ARG (call
, 0)
3010 = fold_convert_loc (loc
, TREE_TYPE (call
), arg
);
3016 switch (TREE_CODE (expr
))
3018 case TRUTH_AND_EXPR
:
3020 case TRUTH_XOR_EXPR
:
3021 case TRUTH_ANDIF_EXPR
:
3022 case TRUTH_ORIF_EXPR
:
3023 /* Also boolify the arguments of truth exprs. */
3024 TREE_OPERAND (expr
, 1) = gimple_boolify (TREE_OPERAND (expr
, 1));
3027 case TRUTH_NOT_EXPR
:
3028 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
3030 /* These expressions always produce boolean results. */
3031 if (TREE_CODE (type
) != BOOLEAN_TYPE
)
3032 TREE_TYPE (expr
) = boolean_type_node
;
3036 if (COMPARISON_CLASS_P (expr
))
3038 /* There expressions always prduce boolean results. */
3039 if (TREE_CODE (type
) != BOOLEAN_TYPE
)
3040 TREE_TYPE (expr
) = boolean_type_node
;
3043 /* Other expressions that get here must have boolean values, but
3044 might need to be converted to the appropriate mode. */
3045 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
3047 return fold_convert_loc (loc
, boolean_type_node
, expr
);
3051 /* Given a conditional expression *EXPR_P without side effects, gimplify
3052 its operands. New statements are inserted to PRE_P. */
3054 static enum gimplify_status
3055 gimplify_pure_cond_expr (tree
*expr_p
, gimple_seq
*pre_p
)
3057 tree expr
= *expr_p
, cond
;
3058 enum gimplify_status ret
, tret
;
3059 enum tree_code code
;
3061 cond
= gimple_boolify (COND_EXPR_COND (expr
));
3063 /* We need to handle && and || specially, as their gimplification
3064 creates pure cond_expr, thus leading to an infinite cycle otherwise. */
3065 code
= TREE_CODE (cond
);
3066 if (code
== TRUTH_ANDIF_EXPR
)
3067 TREE_SET_CODE (cond
, TRUTH_AND_EXPR
);
3068 else if (code
== TRUTH_ORIF_EXPR
)
3069 TREE_SET_CODE (cond
, TRUTH_OR_EXPR
);
3070 ret
= gimplify_expr (&cond
, pre_p
, NULL
, is_gimple_condexpr
, fb_rvalue
);
3071 COND_EXPR_COND (*expr_p
) = cond
;
3073 tret
= gimplify_expr (&COND_EXPR_THEN (expr
), pre_p
, NULL
,
3074 is_gimple_val
, fb_rvalue
);
3075 ret
= MIN (ret
, tret
);
3076 tret
= gimplify_expr (&COND_EXPR_ELSE (expr
), pre_p
, NULL
,
3077 is_gimple_val
, fb_rvalue
);
3079 return MIN (ret
, tret
);
3082 /* Return true if evaluating EXPR could trap.
3083 EXPR is GENERIC, while tree_could_trap_p can be called
3087 generic_expr_could_trap_p (tree expr
)
3091 if (!expr
|| is_gimple_val (expr
))
3094 if (!EXPR_P (expr
) || tree_could_trap_p (expr
))
3097 n
= TREE_OPERAND_LENGTH (expr
);
3098 for (i
= 0; i
< n
; i
++)
3099 if (generic_expr_could_trap_p (TREE_OPERAND (expr
, i
)))
3105 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
3114 The second form is used when *EXPR_P is of type void.
3116 PRE_P points to the list where side effects that must happen before
3117 *EXPR_P should be stored. */
3119 static enum gimplify_status
3120 gimplify_cond_expr (tree
*expr_p
, gimple_seq
*pre_p
, fallback_t fallback
)
3122 tree expr
= *expr_p
;
3123 tree type
= TREE_TYPE (expr
);
3124 location_t loc
= EXPR_LOCATION (expr
);
3125 tree tmp
, arm1
, arm2
;
3126 enum gimplify_status ret
;
3127 tree label_true
, label_false
, label_cont
;
3128 bool have_then_clause_p
, have_else_clause_p
;
3130 enum tree_code pred_code
;
3131 gimple_seq seq
= NULL
;
3133 /* If this COND_EXPR has a value, copy the values into a temporary within
3135 if (!VOID_TYPE_P (type
))
3137 tree then_
= TREE_OPERAND (expr
, 1), else_
= TREE_OPERAND (expr
, 2);
3140 /* If either an rvalue is ok or we do not require an lvalue, create the
3141 temporary. But we cannot do that if the type is addressable. */
3142 if (((fallback
& fb_rvalue
) || !(fallback
& fb_lvalue
))
3143 && !TREE_ADDRESSABLE (type
))
3145 if (gimplify_ctxp
->allow_rhs_cond_expr
3146 /* If either branch has side effects or could trap, it can't be
3147 evaluated unconditionally. */
3148 && !TREE_SIDE_EFFECTS (then_
)
3149 && !generic_expr_could_trap_p (then_
)
3150 && !TREE_SIDE_EFFECTS (else_
)
3151 && !generic_expr_could_trap_p (else_
))
3152 return gimplify_pure_cond_expr (expr_p
, pre_p
);
3154 tmp
= create_tmp_var (type
, "iftmp");
3158 /* Otherwise, only create and copy references to the values. */
3161 type
= build_pointer_type (type
);
3163 if (!VOID_TYPE_P (TREE_TYPE (then_
)))
3164 then_
= build_fold_addr_expr_loc (loc
, then_
);
3166 if (!VOID_TYPE_P (TREE_TYPE (else_
)))
3167 else_
= build_fold_addr_expr_loc (loc
, else_
);
3170 = build3 (COND_EXPR
, type
, TREE_OPERAND (expr
, 0), then_
, else_
);
3172 tmp
= create_tmp_var (type
, "iftmp");
3173 result
= build_simple_mem_ref_loc (loc
, tmp
);
3176 /* Build the new then clause, `tmp = then_;'. But don't build the
3177 assignment if the value is void; in C++ it can be if it's a throw. */
3178 if (!VOID_TYPE_P (TREE_TYPE (then_
)))
3179 TREE_OPERAND (expr
, 1) = build2 (MODIFY_EXPR
, type
, tmp
, then_
);
3181 /* Similarly, build the new else clause, `tmp = else_;'. */
3182 if (!VOID_TYPE_P (TREE_TYPE (else_
)))
3183 TREE_OPERAND (expr
, 2) = build2 (MODIFY_EXPR
, type
, tmp
, else_
);
3185 TREE_TYPE (expr
) = void_type_node
;
3186 recalculate_side_effects (expr
);
3188 /* Move the COND_EXPR to the prequeue. */
3189 gimplify_stmt (&expr
, pre_p
);
3195 /* Remove any COMPOUND_EXPR so the following cases will be caught. */
3196 STRIP_TYPE_NOPS (TREE_OPERAND (expr
, 0));
3197 if (TREE_CODE (TREE_OPERAND (expr
, 0)) == COMPOUND_EXPR
)
3198 gimplify_compound_expr (&TREE_OPERAND (expr
, 0), pre_p
, true);
3200 /* Make sure the condition has BOOLEAN_TYPE. */
3201 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
3203 /* Break apart && and || conditions. */
3204 if (TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ANDIF_EXPR
3205 || TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ORIF_EXPR
)
3207 expr
= shortcut_cond_expr (expr
);
3209 if (expr
!= *expr_p
)
3213 /* We can't rely on gimplify_expr to re-gimplify the expanded
3214 form properly, as cleanups might cause the target labels to be
3215 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
3216 set up a conditional context. */
3217 gimple_push_condition ();
3218 gimplify_stmt (expr_p
, &seq
);
3219 gimple_pop_condition (pre_p
);
3220 gimple_seq_add_seq (pre_p
, seq
);
3226 /* Now do the normal gimplification. */
3228 /* Gimplify condition. */
3229 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, NULL
, is_gimple_condexpr
,
3231 if (ret
== GS_ERROR
)
3233 gcc_assert (TREE_OPERAND (expr
, 0) != NULL_TREE
);
3235 gimple_push_condition ();
3237 have_then_clause_p
= have_else_clause_p
= false;
3238 if (TREE_OPERAND (expr
, 1) != NULL
3239 && TREE_CODE (TREE_OPERAND (expr
, 1)) == GOTO_EXPR
3240 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr
, 1))) == LABEL_DECL
3241 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr
, 1)))
3242 == current_function_decl
)
3243 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
3244 have different locations, otherwise we end up with incorrect
3245 location information on the branches. */
3247 || !EXPR_HAS_LOCATION (expr
)
3248 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr
, 1))
3249 || EXPR_LOCATION (expr
) == EXPR_LOCATION (TREE_OPERAND (expr
, 1))))
3251 label_true
= GOTO_DESTINATION (TREE_OPERAND (expr
, 1));
3252 have_then_clause_p
= true;
3255 label_true
= create_artificial_label (UNKNOWN_LOCATION
);
3256 if (TREE_OPERAND (expr
, 2) != NULL
3257 && TREE_CODE (TREE_OPERAND (expr
, 2)) == GOTO_EXPR
3258 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr
, 2))) == LABEL_DECL
3259 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr
, 2)))
3260 == current_function_decl
)
3261 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
3262 have different locations, otherwise we end up with incorrect
3263 location information on the branches. */
3265 || !EXPR_HAS_LOCATION (expr
)
3266 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr
, 2))
3267 || EXPR_LOCATION (expr
) == EXPR_LOCATION (TREE_OPERAND (expr
, 2))))
3269 label_false
= GOTO_DESTINATION (TREE_OPERAND (expr
, 2));
3270 have_else_clause_p
= true;
3273 label_false
= create_artificial_label (UNKNOWN_LOCATION
);
3275 gimple_cond_get_ops_from_tree (COND_EXPR_COND (expr
), &pred_code
, &arm1
,
3278 gimple_cond
= gimple_build_cond (pred_code
, arm1
, arm2
, label_true
,
3281 gimplify_seq_add_stmt (&seq
, gimple_cond
);
3282 label_cont
= NULL_TREE
;
3283 if (!have_then_clause_p
)
3285 /* For if (...) {} else { code; } put label_true after
3287 if (TREE_OPERAND (expr
, 1) == NULL_TREE
3288 && !have_else_clause_p
3289 && TREE_OPERAND (expr
, 2) != NULL_TREE
)
3290 label_cont
= label_true
;
3293 gimplify_seq_add_stmt (&seq
, gimple_build_label (label_true
));
3294 have_then_clause_p
= gimplify_stmt (&TREE_OPERAND (expr
, 1), &seq
);
3295 /* For if (...) { code; } else {} or
3296 if (...) { code; } else goto label; or
3297 if (...) { code; return; } else { ... }
3298 label_cont isn't needed. */
3299 if (!have_else_clause_p
3300 && TREE_OPERAND (expr
, 2) != NULL_TREE
3301 && gimple_seq_may_fallthru (seq
))
3304 label_cont
= create_artificial_label (UNKNOWN_LOCATION
);
3306 g
= gimple_build_goto (label_cont
);
3308 /* GIMPLE_COND's are very low level; they have embedded
3309 gotos. This particular embedded goto should not be marked
3310 with the location of the original COND_EXPR, as it would
3311 correspond to the COND_EXPR's condition, not the ELSE or the
3312 THEN arms. To avoid marking it with the wrong location, flag
3313 it as "no location". */
3314 gimple_set_do_not_emit_location (g
);
3316 gimplify_seq_add_stmt (&seq
, g
);
3320 if (!have_else_clause_p
)
3322 gimplify_seq_add_stmt (&seq
, gimple_build_label (label_false
));
3323 have_else_clause_p
= gimplify_stmt (&TREE_OPERAND (expr
, 2), &seq
);
3326 gimplify_seq_add_stmt (&seq
, gimple_build_label (label_cont
));
3328 gimple_pop_condition (pre_p
);
3329 gimple_seq_add_seq (pre_p
, seq
);
3331 if (ret
== GS_ERROR
)
3333 else if (have_then_clause_p
|| have_else_clause_p
)
3337 /* Both arms are empty; replace the COND_EXPR with its predicate. */
3338 expr
= TREE_OPERAND (expr
, 0);
3339 gimplify_stmt (&expr
, pre_p
);
3346 /* Prepare the node pointed to by EXPR_P, an is_gimple_addressable expression,
3347 to be marked addressable.
3349 We cannot rely on such an expression being directly markable if a temporary
3350 has been created by the gimplification. In this case, we create another
3351 temporary and initialize it with a copy, which will become a store after we
3352 mark it addressable. This can happen if the front-end passed us something
3353 that it could not mark addressable yet, like a Fortran pass-by-reference
3354 parameter (int) floatvar. */
3357 prepare_gimple_addressable (tree
*expr_p
, gimple_seq
*seq_p
)
3359 while (handled_component_p (*expr_p
))
3360 expr_p
= &TREE_OPERAND (*expr_p
, 0);
3361 if (is_gimple_reg (*expr_p
))
3362 *expr_p
= get_initialized_tmp_var (*expr_p
, seq_p
, NULL
);
3365 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3366 a call to __builtin_memcpy. */
3368 static enum gimplify_status
3369 gimplify_modify_expr_to_memcpy (tree
*expr_p
, tree size
, bool want_value
,
3372 tree t
, to
, to_ptr
, from
, from_ptr
;
3374 location_t loc
= EXPR_LOCATION (*expr_p
);
3376 to
= TREE_OPERAND (*expr_p
, 0);
3377 from
= TREE_OPERAND (*expr_p
, 1);
3379 /* Mark the RHS addressable. Beware that it may not be possible to do so
3380 directly if a temporary has been created by the gimplification. */
3381 prepare_gimple_addressable (&from
, seq_p
);
3383 mark_addressable (from
);
3384 from_ptr
= build_fold_addr_expr_loc (loc
, from
);
3385 gimplify_arg (&from_ptr
, seq_p
, loc
);
3387 mark_addressable (to
);
3388 to_ptr
= build_fold_addr_expr_loc (loc
, to
);
3389 gimplify_arg (&to_ptr
, seq_p
, loc
);
3391 t
= builtin_decl_implicit (BUILT_IN_MEMCPY
);
3393 gs
= gimple_build_call (t
, 3, to_ptr
, from_ptr
, size
);
3397 /* tmp = memcpy() */
3398 t
= create_tmp_var (TREE_TYPE (to_ptr
), NULL
);
3399 gimple_call_set_lhs (gs
, t
);
3400 gimplify_seq_add_stmt (seq_p
, gs
);
3402 *expr_p
= build_simple_mem_ref (t
);
3406 gimplify_seq_add_stmt (seq_p
, gs
);
3411 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3412 a call to __builtin_memset. In this case we know that the RHS is
3413 a CONSTRUCTOR with an empty element list. */
3415 static enum gimplify_status
3416 gimplify_modify_expr_to_memset (tree
*expr_p
, tree size
, bool want_value
,
3419 tree t
, from
, to
, to_ptr
;
3421 location_t loc
= EXPR_LOCATION (*expr_p
);
3423 /* Assert our assumptions, to abort instead of producing wrong code
3424 silently if they are not met. Beware that the RHS CONSTRUCTOR might
3425 not be immediately exposed. */
3426 from
= TREE_OPERAND (*expr_p
, 1);
3427 if (TREE_CODE (from
) == WITH_SIZE_EXPR
)
3428 from
= TREE_OPERAND (from
, 0);
3430 gcc_assert (TREE_CODE (from
) == CONSTRUCTOR
3431 && VEC_empty (constructor_elt
, CONSTRUCTOR_ELTS (from
)));
3434 to
= TREE_OPERAND (*expr_p
, 0);
3436 to_ptr
= build_fold_addr_expr_loc (loc
, to
);
3437 gimplify_arg (&to_ptr
, seq_p
, loc
);
3438 t
= builtin_decl_implicit (BUILT_IN_MEMSET
);
3440 gs
= gimple_build_call (t
, 3, to_ptr
, integer_zero_node
, size
);
3444 /* tmp = memset() */
3445 t
= create_tmp_var (TREE_TYPE (to_ptr
), NULL
);
3446 gimple_call_set_lhs (gs
, t
);
3447 gimplify_seq_add_stmt (seq_p
, gs
);
3449 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
3453 gimplify_seq_add_stmt (seq_p
, gs
);
3458 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
3459 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
3460 assignment. Return non-null if we detect a potential overlap. */
3462 struct gimplify_init_ctor_preeval_data
3464 /* The base decl of the lhs object. May be NULL, in which case we
3465 have to assume the lhs is indirect. */
3468 /* The alias set of the lhs object. */
3469 alias_set_type lhs_alias_set
;
3473 gimplify_init_ctor_preeval_1 (tree
*tp
, int *walk_subtrees
, void *xdata
)
3475 struct gimplify_init_ctor_preeval_data
*data
3476 = (struct gimplify_init_ctor_preeval_data
*) xdata
;
3479 /* If we find the base object, obviously we have overlap. */
3480 if (data
->lhs_base_decl
== t
)
3483 /* If the constructor component is indirect, determine if we have a
3484 potential overlap with the lhs. The only bits of information we
3485 have to go on at this point are addressability and alias sets. */
3486 if ((INDIRECT_REF_P (t
)
3487 || TREE_CODE (t
) == MEM_REF
)
3488 && (!data
->lhs_base_decl
|| TREE_ADDRESSABLE (data
->lhs_base_decl
))
3489 && alias_sets_conflict_p (data
->lhs_alias_set
, get_alias_set (t
)))
3492 /* If the constructor component is a call, determine if it can hide a
3493 potential overlap with the lhs through an INDIRECT_REF like above.
3494 ??? Ugh - this is completely broken. In fact this whole analysis
3495 doesn't look conservative. */
3496 if (TREE_CODE (t
) == CALL_EXPR
)
3498 tree type
, fntype
= TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (t
)));
3500 for (type
= TYPE_ARG_TYPES (fntype
); type
; type
= TREE_CHAIN (type
))
3501 if (POINTER_TYPE_P (TREE_VALUE (type
))
3502 && (!data
->lhs_base_decl
|| TREE_ADDRESSABLE (data
->lhs_base_decl
))
3503 && alias_sets_conflict_p (data
->lhs_alias_set
,
3505 (TREE_TYPE (TREE_VALUE (type
)))))
3509 if (IS_TYPE_OR_DECL_P (t
))
3514 /* A subroutine of gimplify_init_constructor. Pre-evaluate EXPR,
3515 force values that overlap with the lhs (as described by *DATA)
3516 into temporaries. */
3519 gimplify_init_ctor_preeval (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
3520 struct gimplify_init_ctor_preeval_data
*data
)
3522 enum gimplify_status one
;
3524 /* If the value is constant, then there's nothing to pre-evaluate. */
3525 if (TREE_CONSTANT (*expr_p
))
3527 /* Ensure it does not have side effects, it might contain a reference to
3528 the object we're initializing. */
3529 gcc_assert (!TREE_SIDE_EFFECTS (*expr_p
));
3533 /* If the type has non-trivial constructors, we can't pre-evaluate. */
3534 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p
)))
3537 /* Recurse for nested constructors. */
3538 if (TREE_CODE (*expr_p
) == CONSTRUCTOR
)
3540 unsigned HOST_WIDE_INT ix
;
3541 constructor_elt
*ce
;
3542 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (*expr_p
);
3544 FOR_EACH_VEC_ELT (constructor_elt
, v
, ix
, ce
)
3545 gimplify_init_ctor_preeval (&ce
->value
, pre_p
, post_p
, data
);
3550 /* If this is a variable sized type, we must remember the size. */
3551 maybe_with_size_expr (expr_p
);
3553 /* Gimplify the constructor element to something appropriate for the rhs
3554 of a MODIFY_EXPR. Given that we know the LHS is an aggregate, we know
3555 the gimplifier will consider this a store to memory. Doing this
3556 gimplification now means that we won't have to deal with complicated
3557 language-specific trees, nor trees like SAVE_EXPR that can induce
3558 exponential search behavior. */
3559 one
= gimplify_expr (expr_p
, pre_p
, post_p
, is_gimple_mem_rhs
, fb_rvalue
);
3560 if (one
== GS_ERROR
)
3566 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
3567 with the lhs, since "a = { .x=a }" doesn't make sense. This will
3568 always be true for all scalars, since is_gimple_mem_rhs insists on a
3569 temporary variable for them. */
3570 if (DECL_P (*expr_p
))
3573 /* If this is of variable size, we have no choice but to assume it doesn't
3574 overlap since we can't make a temporary for it. */
3575 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (*expr_p
))) != INTEGER_CST
)
3578 /* Otherwise, we must search for overlap ... */
3579 if (!walk_tree (expr_p
, gimplify_init_ctor_preeval_1
, data
, NULL
))
3582 /* ... and if found, force the value into a temporary. */
3583 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
3586 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
3587 a RANGE_EXPR in a CONSTRUCTOR for an array.
3591 object[var] = value;
3598 We increment var _after_ the loop exit check because we might otherwise
3599 fail if upper == TYPE_MAX_VALUE (type for upper).
3601 Note that we never have to deal with SAVE_EXPRs here, because this has
3602 already been taken care of for us, in gimplify_init_ctor_preeval(). */
3604 static void gimplify_init_ctor_eval (tree
, VEC(constructor_elt
,gc
) *,
3605 gimple_seq
*, bool);
3608 gimplify_init_ctor_eval_range (tree object
, tree lower
, tree upper
,
3609 tree value
, tree array_elt_type
,
3610 gimple_seq
*pre_p
, bool cleared
)
3612 tree loop_entry_label
, loop_exit_label
, fall_thru_label
;
3613 tree var
, var_type
, cref
, tmp
;
3615 loop_entry_label
= create_artificial_label (UNKNOWN_LOCATION
);
3616 loop_exit_label
= create_artificial_label (UNKNOWN_LOCATION
);
3617 fall_thru_label
= create_artificial_label (UNKNOWN_LOCATION
);
3619 /* Create and initialize the index variable. */
3620 var_type
= TREE_TYPE (upper
);
3621 var
= create_tmp_var (var_type
, NULL
);
3622 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (var
, lower
));
3624 /* Add the loop entry label. */
3625 gimplify_seq_add_stmt (pre_p
, gimple_build_label (loop_entry_label
));
3627 /* Build the reference. */
3628 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
3629 var
, NULL_TREE
, NULL_TREE
);
3631 /* If we are a constructor, just call gimplify_init_ctor_eval to do
3632 the store. Otherwise just assign value to the reference. */
3634 if (TREE_CODE (value
) == CONSTRUCTOR
)
3635 /* NB we might have to call ourself recursively through
3636 gimplify_init_ctor_eval if the value is a constructor. */
3637 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
3640 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (cref
, value
));
3642 /* We exit the loop when the index var is equal to the upper bound. */
3643 gimplify_seq_add_stmt (pre_p
,
3644 gimple_build_cond (EQ_EXPR
, var
, upper
,
3645 loop_exit_label
, fall_thru_label
));
3647 gimplify_seq_add_stmt (pre_p
, gimple_build_label (fall_thru_label
));
3649 /* Otherwise, increment the index var... */
3650 tmp
= build2 (PLUS_EXPR
, var_type
, var
,
3651 fold_convert (var_type
, integer_one_node
));
3652 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (var
, tmp
));
3654 /* ...and jump back to the loop entry. */
3655 gimplify_seq_add_stmt (pre_p
, gimple_build_goto (loop_entry_label
));
3657 /* Add the loop exit label. */
3658 gimplify_seq_add_stmt (pre_p
, gimple_build_label (loop_exit_label
));
3661 /* Return true if FDECL is accessing a field that is zero sized. */
3664 zero_sized_field_decl (const_tree fdecl
)
3666 if (TREE_CODE (fdecl
) == FIELD_DECL
&& DECL_SIZE (fdecl
)
3667 && integer_zerop (DECL_SIZE (fdecl
)))
3672 /* Return true if TYPE is zero sized. */
3675 zero_sized_type (const_tree type
)
3677 if (AGGREGATE_TYPE_P (type
) && TYPE_SIZE (type
)
3678 && integer_zerop (TYPE_SIZE (type
)))
3683 /* A subroutine of gimplify_init_constructor. Generate individual
3684 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
3685 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
3686 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
3690 gimplify_init_ctor_eval (tree object
, VEC(constructor_elt
,gc
) *elts
,
3691 gimple_seq
*pre_p
, bool cleared
)
3693 tree array_elt_type
= NULL
;
3694 unsigned HOST_WIDE_INT ix
;
3695 tree purpose
, value
;
3697 if (TREE_CODE (TREE_TYPE (object
)) == ARRAY_TYPE
)
3698 array_elt_type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object
)));
3700 FOR_EACH_CONSTRUCTOR_ELT (elts
, ix
, purpose
, value
)
3704 /* NULL values are created above for gimplification errors. */
3708 if (cleared
&& initializer_zerop (value
))
3711 /* ??? Here's to hoping the front end fills in all of the indices,
3712 so we don't have to figure out what's missing ourselves. */
3713 gcc_assert (purpose
);
3715 /* Skip zero-sized fields, unless value has side-effects. This can
3716 happen with calls to functions returning a zero-sized type, which
3717 we shouldn't discard. As a number of downstream passes don't
3718 expect sets of zero-sized fields, we rely on the gimplification of
3719 the MODIFY_EXPR we make below to drop the assignment statement. */
3720 if (! TREE_SIDE_EFFECTS (value
) && zero_sized_field_decl (purpose
))
3723 /* If we have a RANGE_EXPR, we have to build a loop to assign the
3725 if (TREE_CODE (purpose
) == RANGE_EXPR
)
3727 tree lower
= TREE_OPERAND (purpose
, 0);
3728 tree upper
= TREE_OPERAND (purpose
, 1);
3730 /* If the lower bound is equal to upper, just treat it as if
3731 upper was the index. */
3732 if (simple_cst_equal (lower
, upper
))
3736 gimplify_init_ctor_eval_range (object
, lower
, upper
, value
,
3737 array_elt_type
, pre_p
, cleared
);
3744 /* Do not use bitsizetype for ARRAY_REF indices. */
3745 if (TYPE_DOMAIN (TREE_TYPE (object
)))
3747 = fold_convert (TREE_TYPE (TYPE_DOMAIN (TREE_TYPE (object
))),
3749 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
3750 purpose
, NULL_TREE
, NULL_TREE
);
3754 gcc_assert (TREE_CODE (purpose
) == FIELD_DECL
);
3755 cref
= build3 (COMPONENT_REF
, TREE_TYPE (purpose
),
3756 unshare_expr (object
), purpose
, NULL_TREE
);
3759 if (TREE_CODE (value
) == CONSTRUCTOR
3760 && TREE_CODE (TREE_TYPE (value
)) != VECTOR_TYPE
)
3761 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
3765 tree init
= build2 (INIT_EXPR
, TREE_TYPE (cref
), cref
, value
);
3766 gimplify_and_add (init
, pre_p
);
3772 /* Return the appropriate RHS predicate for this LHS. */
3775 rhs_predicate_for (tree lhs
)
3777 if (is_gimple_reg (lhs
))
3778 return is_gimple_reg_rhs_or_call
;
3780 return is_gimple_mem_rhs_or_call
;
3783 /* Gimplify a C99 compound literal expression. This just means adding
3784 the DECL_EXPR before the current statement and using its anonymous
3787 static enum gimplify_status
3788 gimplify_compound_literal_expr (tree
*expr_p
, gimple_seq
*pre_p
,
3789 bool (*gimple_test_f
) (tree
),
3790 fallback_t fallback
)
3792 tree decl_s
= COMPOUND_LITERAL_EXPR_DECL_EXPR (*expr_p
);
3793 tree decl
= DECL_EXPR_DECL (decl_s
);
3794 tree init
= DECL_INITIAL (decl
);
3795 /* Mark the decl as addressable if the compound literal
3796 expression is addressable now, otherwise it is marked too late
3797 after we gimplify the initialization expression. */
3798 if (TREE_ADDRESSABLE (*expr_p
))
3799 TREE_ADDRESSABLE (decl
) = 1;
3800 /* Otherwise, if we don't need an lvalue and have a literal directly
3801 substitute it. Check if it matches the gimple predicate, as
3802 otherwise we'd generate a new temporary, and we can as well just
3803 use the decl we already have. */
3804 else if (!TREE_ADDRESSABLE (decl
)
3806 && (fallback
& fb_lvalue
) == 0
3807 && gimple_test_f (init
))
3813 /* Preliminarily mark non-addressed complex variables as eligible
3814 for promotion to gimple registers. We'll transform their uses
3816 if ((TREE_CODE (TREE_TYPE (decl
)) == COMPLEX_TYPE
3817 || TREE_CODE (TREE_TYPE (decl
)) == VECTOR_TYPE
)
3818 && !TREE_THIS_VOLATILE (decl
)
3819 && !needs_to_live_in_memory (decl
))
3820 DECL_GIMPLE_REG_P (decl
) = 1;
3822 /* If the decl is not addressable, then it is being used in some
3823 expression or on the right hand side of a statement, and it can
3824 be put into a readonly data section. */
3825 if (!TREE_ADDRESSABLE (decl
) && (fallback
& fb_lvalue
) == 0)
3826 TREE_READONLY (decl
) = 1;
3828 /* This decl isn't mentioned in the enclosing block, so add it to the
3829 list of temps. FIXME it seems a bit of a kludge to say that
3830 anonymous artificial vars aren't pushed, but everything else is. */
3831 if (DECL_NAME (decl
) == NULL_TREE
&& !DECL_SEEN_IN_BIND_EXPR_P (decl
))
3832 gimple_add_tmp_var (decl
);
3834 gimplify_and_add (decl_s
, pre_p
);
3839 /* Optimize embedded COMPOUND_LITERAL_EXPRs within a CONSTRUCTOR,
3840 return a new CONSTRUCTOR if something changed. */
3843 optimize_compound_literals_in_ctor (tree orig_ctor
)
3845 tree ctor
= orig_ctor
;
3846 VEC(constructor_elt
,gc
) *elts
= CONSTRUCTOR_ELTS (ctor
);
3847 unsigned int idx
, num
= VEC_length (constructor_elt
, elts
);
3849 for (idx
= 0; idx
< num
; idx
++)
3851 tree value
= VEC_index (constructor_elt
, elts
, idx
)->value
;
3852 tree newval
= value
;
3853 if (TREE_CODE (value
) == CONSTRUCTOR
)
3854 newval
= optimize_compound_literals_in_ctor (value
);
3855 else if (TREE_CODE (value
) == COMPOUND_LITERAL_EXPR
)
3857 tree decl_s
= COMPOUND_LITERAL_EXPR_DECL_EXPR (value
);
3858 tree decl
= DECL_EXPR_DECL (decl_s
);
3859 tree init
= DECL_INITIAL (decl
);
3861 if (!TREE_ADDRESSABLE (value
)
3862 && !TREE_ADDRESSABLE (decl
)
3864 newval
= optimize_compound_literals_in_ctor (init
);
3866 if (newval
== value
)
3869 if (ctor
== orig_ctor
)
3871 ctor
= copy_node (orig_ctor
);
3872 CONSTRUCTOR_ELTS (ctor
) = VEC_copy (constructor_elt
, gc
, elts
);
3873 elts
= CONSTRUCTOR_ELTS (ctor
);
3875 VEC_index (constructor_elt
, elts
, idx
)->value
= newval
;
3880 /* A subroutine of gimplify_modify_expr. Break out elements of a
3881 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
3883 Note that we still need to clear any elements that don't have explicit
3884 initializers, so if not all elements are initialized we keep the
3885 original MODIFY_EXPR, we just remove all of the constructor elements.
3887 If NOTIFY_TEMP_CREATION is true, do not gimplify, just return
3888 GS_ERROR if we would have to create a temporary when gimplifying
3889 this constructor. Otherwise, return GS_OK.
3891 If NOTIFY_TEMP_CREATION is false, just do the gimplification. */
3893 static enum gimplify_status
3894 gimplify_init_constructor (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
3895 bool want_value
, bool notify_temp_creation
)
3897 tree object
, ctor
, type
;
3898 enum gimplify_status ret
;
3899 VEC(constructor_elt
,gc
) *elts
;
3901 gcc_assert (TREE_CODE (TREE_OPERAND (*expr_p
, 1)) == CONSTRUCTOR
);
3903 if (!notify_temp_creation
)
3905 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
3906 is_gimple_lvalue
, fb_lvalue
);
3907 if (ret
== GS_ERROR
)
3911 object
= TREE_OPERAND (*expr_p
, 0);
3912 ctor
= TREE_OPERAND (*expr_p
, 1) =
3913 optimize_compound_literals_in_ctor (TREE_OPERAND (*expr_p
, 1));
3914 type
= TREE_TYPE (ctor
);
3915 elts
= CONSTRUCTOR_ELTS (ctor
);
3918 switch (TREE_CODE (type
))
3922 case QUAL_UNION_TYPE
:
3925 struct gimplify_init_ctor_preeval_data preeval_data
;
3926 HOST_WIDE_INT num_ctor_elements
, num_nonzero_elements
;
3927 bool cleared
, complete_p
, valid_const_initializer
;
3929 /* Aggregate types must lower constructors to initialization of
3930 individual elements. The exception is that a CONSTRUCTOR node
3931 with no elements indicates zero-initialization of the whole. */
3932 if (VEC_empty (constructor_elt
, elts
))
3934 if (notify_temp_creation
)
3939 /* Fetch information about the constructor to direct later processing.
3940 We might want to make static versions of it in various cases, and
3941 can only do so if it known to be a valid constant initializer. */
3942 valid_const_initializer
3943 = categorize_ctor_elements (ctor
, &num_nonzero_elements
,
3944 &num_ctor_elements
, &complete_p
);
3946 /* If a const aggregate variable is being initialized, then it
3947 should never be a lose to promote the variable to be static. */
3948 if (valid_const_initializer
3949 && num_nonzero_elements
> 1
3950 && TREE_READONLY (object
)
3951 && TREE_CODE (object
) == VAR_DECL
3952 && (flag_merge_constants
>= 2 || !TREE_ADDRESSABLE (object
)))
3954 if (notify_temp_creation
)
3956 DECL_INITIAL (object
) = ctor
;
3957 TREE_STATIC (object
) = 1;
3958 if (!DECL_NAME (object
))
3959 DECL_NAME (object
) = create_tmp_var_name ("C");
3960 walk_tree (&DECL_INITIAL (object
), force_labels_r
, NULL
, NULL
);
3962 /* ??? C++ doesn't automatically append a .<number> to the
3963 assembler name, and even when it does, it looks at FE private
3964 data structures to figure out what that number should be,
3965 which are not set for this variable. I suppose this is
3966 important for local statics for inline functions, which aren't
3967 "local" in the object file sense. So in order to get a unique
3968 TU-local symbol, we must invoke the lhd version now. */
3969 lhd_set_decl_assembler_name (object
);
3971 *expr_p
= NULL_TREE
;
3975 /* If there are "lots" of initialized elements, even discounting
3976 those that are not address constants (and thus *must* be
3977 computed at runtime), then partition the constructor into
3978 constant and non-constant parts. Block copy the constant
3979 parts in, then generate code for the non-constant parts. */
3980 /* TODO. There's code in cp/typeck.c to do this. */
3982 if (int_size_in_bytes (TREE_TYPE (ctor
)) < 0)
3983 /* store_constructor will ignore the clearing of variable-sized
3984 objects. Initializers for such objects must explicitly set
3985 every field that needs to be set. */
3987 else if (!complete_p
)
3988 /* If the constructor isn't complete, clear the whole object
3991 ??? This ought not to be needed. For any element not present
3992 in the initializer, we should simply set them to zero. Except
3993 we'd need to *find* the elements that are not present, and that
3994 requires trickery to avoid quadratic compile-time behavior in
3995 large cases or excessive memory use in small cases. */
3997 else if (num_ctor_elements
- num_nonzero_elements
3998 > CLEAR_RATIO (optimize_function_for_speed_p (cfun
))
3999 && num_nonzero_elements
< num_ctor_elements
/ 4)
4000 /* If there are "lots" of zeros, it's more efficient to clear
4001 the memory and then set the nonzero elements. */
4006 /* If there are "lots" of initialized elements, and all of them
4007 are valid address constants, then the entire initializer can
4008 be dropped to memory, and then memcpy'd out. Don't do this
4009 for sparse arrays, though, as it's more efficient to follow
4010 the standard CONSTRUCTOR behavior of memset followed by
4011 individual element initialization. Also don't do this for small
4012 all-zero initializers (which aren't big enough to merit
4013 clearing), and don't try to make bitwise copies of
4014 TREE_ADDRESSABLE types. */
4015 if (valid_const_initializer
4016 && !(cleared
|| num_nonzero_elements
== 0)
4017 && !TREE_ADDRESSABLE (type
))
4019 HOST_WIDE_INT size
= int_size_in_bytes (type
);
4022 /* ??? We can still get unbounded array types, at least
4023 from the C++ front end. This seems wrong, but attempt
4024 to work around it for now. */
4027 size
= int_size_in_bytes (TREE_TYPE (object
));
4029 TREE_TYPE (ctor
) = type
= TREE_TYPE (object
);
4032 /* Find the maximum alignment we can assume for the object. */
4033 /* ??? Make use of DECL_OFFSET_ALIGN. */
4034 if (DECL_P (object
))
4035 align
= DECL_ALIGN (object
);
4037 align
= TYPE_ALIGN (type
);
4039 /* Do a block move either if the size is so small as to make
4040 each individual move a sub-unit move on average, or if it
4041 is so large as to make individual moves inefficient. */
4043 && num_nonzero_elements
> 1
4044 && (size
< num_nonzero_elements
4045 || !can_move_by_pieces (size
, align
)))
4047 if (notify_temp_creation
)
4050 walk_tree (&ctor
, force_labels_r
, NULL
, NULL
);
4051 ctor
= tree_output_constant_def (ctor
);
4052 if (!useless_type_conversion_p (type
, TREE_TYPE (ctor
)))
4053 ctor
= build1 (VIEW_CONVERT_EXPR
, type
, ctor
);
4054 TREE_OPERAND (*expr_p
, 1) = ctor
;
4056 /* This is no longer an assignment of a CONSTRUCTOR, but
4057 we still may have processing to do on the LHS. So
4058 pretend we didn't do anything here to let that happen. */
4059 return GS_UNHANDLED
;
4063 /* If the target is volatile, we have non-zero elements and more than
4064 one field to assign, initialize the target from a temporary. */
4065 if (TREE_THIS_VOLATILE (object
)
4066 && !TREE_ADDRESSABLE (type
)
4067 && num_nonzero_elements
> 0
4068 && VEC_length (constructor_elt
, elts
) > 1)
4070 tree temp
= create_tmp_var (TYPE_MAIN_VARIANT (type
), NULL
);
4071 TREE_OPERAND (*expr_p
, 0) = temp
;
4072 *expr_p
= build2 (COMPOUND_EXPR
, TREE_TYPE (*expr_p
),
4074 build2 (MODIFY_EXPR
, void_type_node
,
4079 if (notify_temp_creation
)
4082 /* If there are nonzero elements and if needed, pre-evaluate to capture
4083 elements overlapping with the lhs into temporaries. We must do this
4084 before clearing to fetch the values before they are zeroed-out. */
4085 if (num_nonzero_elements
> 0 && TREE_CODE (*expr_p
) != INIT_EXPR
)
4087 preeval_data
.lhs_base_decl
= get_base_address (object
);
4088 if (!DECL_P (preeval_data
.lhs_base_decl
))
4089 preeval_data
.lhs_base_decl
= NULL
;
4090 preeval_data
.lhs_alias_set
= get_alias_set (object
);
4092 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p
, 1),
4093 pre_p
, post_p
, &preeval_data
);
4098 /* Zap the CONSTRUCTOR element list, which simplifies this case.
4099 Note that we still have to gimplify, in order to handle the
4100 case of variable sized types. Avoid shared tree structures. */
4101 CONSTRUCTOR_ELTS (ctor
) = NULL
;
4102 TREE_SIDE_EFFECTS (ctor
) = 0;
4103 object
= unshare_expr (object
);
4104 gimplify_stmt (expr_p
, pre_p
);
4107 /* If we have not block cleared the object, or if there are nonzero
4108 elements in the constructor, add assignments to the individual
4109 scalar fields of the object. */
4110 if (!cleared
|| num_nonzero_elements
> 0)
4111 gimplify_init_ctor_eval (object
, elts
, pre_p
, cleared
);
4113 *expr_p
= NULL_TREE
;
4121 if (notify_temp_creation
)
4124 /* Extract the real and imaginary parts out of the ctor. */
4125 gcc_assert (VEC_length (constructor_elt
, elts
) == 2);
4126 r
= VEC_index (constructor_elt
, elts
, 0)->value
;
4127 i
= VEC_index (constructor_elt
, elts
, 1)->value
;
4128 if (r
== NULL
|| i
== NULL
)
4130 tree zero
= build_zero_cst (TREE_TYPE (type
));
4137 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
4138 represent creation of a complex value. */
4139 if (TREE_CONSTANT (r
) && TREE_CONSTANT (i
))
4141 ctor
= build_complex (type
, r
, i
);
4142 TREE_OPERAND (*expr_p
, 1) = ctor
;
4146 ctor
= build2 (COMPLEX_EXPR
, type
, r
, i
);
4147 TREE_OPERAND (*expr_p
, 1) = ctor
;
4148 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1),
4151 rhs_predicate_for (TREE_OPERAND (*expr_p
, 0)),
4159 unsigned HOST_WIDE_INT ix
;
4160 constructor_elt
*ce
;
4162 if (notify_temp_creation
)
4165 /* Go ahead and simplify constant constructors to VECTOR_CST. */
4166 if (TREE_CONSTANT (ctor
))
4168 bool constant_p
= true;
4171 /* Even when ctor is constant, it might contain non-*_CST
4172 elements, such as addresses or trapping values like
4173 1.0/0.0 - 1.0/0.0. Such expressions don't belong
4174 in VECTOR_CST nodes. */
4175 FOR_EACH_CONSTRUCTOR_VALUE (elts
, ix
, value
)
4176 if (!CONSTANT_CLASS_P (value
))
4184 TREE_OPERAND (*expr_p
, 1) = build_vector_from_ctor (type
, elts
);
4188 /* Don't reduce an initializer constant even if we can't
4189 make a VECTOR_CST. It won't do anything for us, and it'll
4190 prevent us from representing it as a single constant. */
4191 if (initializer_constant_valid_p (ctor
, type
))
4194 TREE_CONSTANT (ctor
) = 0;
4197 /* Vector types use CONSTRUCTOR all the way through gimple
4198 compilation as a general initializer. */
4199 FOR_EACH_VEC_ELT (constructor_elt
, elts
, ix
, ce
)
4201 enum gimplify_status tret
;
4202 tret
= gimplify_expr (&ce
->value
, pre_p
, post_p
, is_gimple_val
,
4204 if (tret
== GS_ERROR
)
4207 if (!is_gimple_reg (TREE_OPERAND (*expr_p
, 0)))
4208 TREE_OPERAND (*expr_p
, 1) = get_formal_tmp_var (ctor
, pre_p
);
4213 /* So how did we get a CONSTRUCTOR for a scalar type? */
4217 if (ret
== GS_ERROR
)
4219 else if (want_value
)
4226 /* If we have gimplified both sides of the initializer but have
4227 not emitted an assignment, do so now. */
4230 tree lhs
= TREE_OPERAND (*expr_p
, 0);
4231 tree rhs
= TREE_OPERAND (*expr_p
, 1);
4232 gimple init
= gimple_build_assign (lhs
, rhs
);
4233 gimplify_seq_add_stmt (pre_p
, init
);
4241 /* Given a pointer value OP0, return a simplified version of an
4242 indirection through OP0, or NULL_TREE if no simplification is
4243 possible. Note that the resulting type may be different from
4244 the type pointed to in the sense that it is still compatible
4245 from the langhooks point of view. */
4248 gimple_fold_indirect_ref (tree t
)
4250 tree ptype
= TREE_TYPE (t
), type
= TREE_TYPE (ptype
);
4255 subtype
= TREE_TYPE (sub
);
4256 if (!POINTER_TYPE_P (subtype
))
4259 if (TREE_CODE (sub
) == ADDR_EXPR
)
4261 tree op
= TREE_OPERAND (sub
, 0);
4262 tree optype
= TREE_TYPE (op
);
4264 if (useless_type_conversion_p (type
, optype
))
4267 /* *(foo *)&fooarray => fooarray[0] */
4268 if (TREE_CODE (optype
) == ARRAY_TYPE
4269 && TREE_CODE (TYPE_SIZE (TREE_TYPE (optype
))) == INTEGER_CST
4270 && useless_type_conversion_p (type
, TREE_TYPE (optype
)))
4272 tree type_domain
= TYPE_DOMAIN (optype
);
4273 tree min_val
= size_zero_node
;
4274 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
4275 min_val
= TYPE_MIN_VALUE (type_domain
);
4276 if (TREE_CODE (min_val
) == INTEGER_CST
)
4277 return build4 (ARRAY_REF
, type
, op
, min_val
, NULL_TREE
, NULL_TREE
);
4279 /* *(foo *)&complexfoo => __real__ complexfoo */
4280 else if (TREE_CODE (optype
) == COMPLEX_TYPE
4281 && useless_type_conversion_p (type
, TREE_TYPE (optype
)))
4282 return fold_build1 (REALPART_EXPR
, type
, op
);
4283 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
4284 else if (TREE_CODE (optype
) == VECTOR_TYPE
4285 && useless_type_conversion_p (type
, TREE_TYPE (optype
)))
4287 tree part_width
= TYPE_SIZE (type
);
4288 tree index
= bitsize_int (0);
4289 return fold_build3 (BIT_FIELD_REF
, type
, op
, part_width
, index
);
4293 /* *(p + CST) -> ... */
4294 if (TREE_CODE (sub
) == POINTER_PLUS_EXPR
4295 && TREE_CODE (TREE_OPERAND (sub
, 1)) == INTEGER_CST
)
4297 tree addr
= TREE_OPERAND (sub
, 0);
4298 tree off
= TREE_OPERAND (sub
, 1);
4302 addrtype
= TREE_TYPE (addr
);
4304 /* ((foo*)&vectorfoo)[1] -> BIT_FIELD_REF<vectorfoo,...> */
4305 if (TREE_CODE (addr
) == ADDR_EXPR
4306 && TREE_CODE (TREE_TYPE (addrtype
)) == VECTOR_TYPE
4307 && useless_type_conversion_p (type
, TREE_TYPE (TREE_TYPE (addrtype
)))
4308 && host_integerp (off
, 1))
4310 unsigned HOST_WIDE_INT offset
= tree_low_cst (off
, 1);
4311 tree part_width
= TYPE_SIZE (type
);
4312 unsigned HOST_WIDE_INT part_widthi
4313 = tree_low_cst (part_width
, 0) / BITS_PER_UNIT
;
4314 unsigned HOST_WIDE_INT indexi
= offset
* BITS_PER_UNIT
;
4315 tree index
= bitsize_int (indexi
);
4316 if (offset
/ part_widthi
4317 <= TYPE_VECTOR_SUBPARTS (TREE_TYPE (addrtype
)))
4318 return fold_build3 (BIT_FIELD_REF
, type
, TREE_OPERAND (addr
, 0),
4322 /* ((foo*)&complexfoo)[1] -> __imag__ complexfoo */
4323 if (TREE_CODE (addr
) == ADDR_EXPR
4324 && TREE_CODE (TREE_TYPE (addrtype
)) == COMPLEX_TYPE
4325 && useless_type_conversion_p (type
, TREE_TYPE (TREE_TYPE (addrtype
))))
4327 tree size
= TYPE_SIZE_UNIT (type
);
4328 if (tree_int_cst_equal (size
, off
))
4329 return fold_build1 (IMAGPART_EXPR
, type
, TREE_OPERAND (addr
, 0));
4332 /* *(p + CST) -> MEM_REF <p, CST>. */
4333 if (TREE_CODE (addr
) != ADDR_EXPR
4334 || DECL_P (TREE_OPERAND (addr
, 0)))
4335 return fold_build2 (MEM_REF
, type
,
4337 build_int_cst_wide (ptype
,
4338 TREE_INT_CST_LOW (off
),
4339 TREE_INT_CST_HIGH (off
)));
4342 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
4343 if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
4344 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (subtype
)))) == INTEGER_CST
4345 && useless_type_conversion_p (type
, TREE_TYPE (TREE_TYPE (subtype
))))
4348 tree min_val
= size_zero_node
;
4350 sub
= gimple_fold_indirect_ref (sub
);
4352 sub
= build1 (INDIRECT_REF
, TREE_TYPE (subtype
), osub
);
4353 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
4354 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
4355 min_val
= TYPE_MIN_VALUE (type_domain
);
4356 if (TREE_CODE (min_val
) == INTEGER_CST
)
4357 return build4 (ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
, NULL_TREE
);
4363 /* Given a pointer value OP0, return a simplified version of an
4364 indirection through OP0, or NULL_TREE if no simplification is
4365 possible. This may only be applied to a rhs of an expression.
4366 Note that the resulting type may be different from the type pointed
4367 to in the sense that it is still compatible from the langhooks
4371 gimple_fold_indirect_ref_rhs (tree t
)
4373 return gimple_fold_indirect_ref (t
);
4376 /* Subroutine of gimplify_modify_expr to do simplifications of
4377 MODIFY_EXPRs based on the code of the RHS. We loop for as long as
4378 something changes. */
4380 static enum gimplify_status
4381 gimplify_modify_expr_rhs (tree
*expr_p
, tree
*from_p
, tree
*to_p
,
4382 gimple_seq
*pre_p
, gimple_seq
*post_p
,
4385 enum gimplify_status ret
= GS_UNHANDLED
;
4391 switch (TREE_CODE (*from_p
))
4394 /* If we're assigning from a read-only variable initialized with
4395 a constructor, do the direct assignment from the constructor,
4396 but only if neither source nor target are volatile since this
4397 latter assignment might end up being done on a per-field basis. */
4398 if (DECL_INITIAL (*from_p
)
4399 && TREE_READONLY (*from_p
)
4400 && !TREE_THIS_VOLATILE (*from_p
)
4401 && !TREE_THIS_VOLATILE (*to_p
)
4402 && TREE_CODE (DECL_INITIAL (*from_p
)) == CONSTRUCTOR
)
4404 tree old_from
= *from_p
;
4405 enum gimplify_status subret
;
4407 /* Move the constructor into the RHS. */
4408 *from_p
= unshare_expr (DECL_INITIAL (*from_p
));
4410 /* Let's see if gimplify_init_constructor will need to put
4412 subret
= gimplify_init_constructor (expr_p
, NULL
, NULL
,
4414 if (subret
== GS_ERROR
)
4416 /* If so, revert the change. */
4428 /* If we have code like
4432 where the type of "x" is a (possibly cv-qualified variant
4433 of "A"), treat the entire expression as identical to "x".
4434 This kind of code arises in C++ when an object is bound
4435 to a const reference, and if "x" is a TARGET_EXPR we want
4436 to take advantage of the optimization below. */
4437 bool volatile_p
= TREE_THIS_VOLATILE (*from_p
);
4438 tree t
= gimple_fold_indirect_ref_rhs (TREE_OPERAND (*from_p
, 0));
4441 if (TREE_THIS_VOLATILE (t
) != volatile_p
)
4443 if (TREE_CODE_CLASS (TREE_CODE (t
)) == tcc_declaration
)
4444 t
= build_simple_mem_ref_loc (EXPR_LOCATION (*from_p
),
4445 build_fold_addr_expr (t
));
4446 if (REFERENCE_CLASS_P (t
))
4447 TREE_THIS_VOLATILE (t
) = volatile_p
;
4458 /* If we are initializing something from a TARGET_EXPR, strip the
4459 TARGET_EXPR and initialize it directly, if possible. This can't
4460 be done if the initializer is void, since that implies that the
4461 temporary is set in some non-trivial way.
4463 ??? What about code that pulls out the temp and uses it
4464 elsewhere? I think that such code never uses the TARGET_EXPR as
4465 an initializer. If I'm wrong, we'll die because the temp won't
4466 have any RTL. In that case, I guess we'll need to replace
4467 references somehow. */
4468 tree init
= TARGET_EXPR_INITIAL (*from_p
);
4471 && !VOID_TYPE_P (TREE_TYPE (init
)))
4481 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
4483 gimplify_compound_expr (from_p
, pre_p
, true);
4489 /* If we already made some changes, let the front end have a
4490 crack at this before we break it down. */
4491 if (ret
!= GS_UNHANDLED
)
4493 /* If we're initializing from a CONSTRUCTOR, break this into
4494 individual MODIFY_EXPRs. */
4495 return gimplify_init_constructor (expr_p
, pre_p
, post_p
, want_value
,
4499 /* If we're assigning to a non-register type, push the assignment
4500 down into the branches. This is mandatory for ADDRESSABLE types,
4501 since we cannot generate temporaries for such, but it saves a
4502 copy in other cases as well. */
4503 if (!is_gimple_reg_type (TREE_TYPE (*from_p
)))
4505 /* This code should mirror the code in gimplify_cond_expr. */
4506 enum tree_code code
= TREE_CODE (*expr_p
);
4507 tree cond
= *from_p
;
4508 tree result
= *to_p
;
4510 ret
= gimplify_expr (&result
, pre_p
, post_p
,
4511 is_gimple_lvalue
, fb_lvalue
);
4512 if (ret
!= GS_ERROR
)
4515 if (TREE_TYPE (TREE_OPERAND (cond
, 1)) != void_type_node
)
4516 TREE_OPERAND (cond
, 1)
4517 = build2 (code
, void_type_node
, result
,
4518 TREE_OPERAND (cond
, 1));
4519 if (TREE_TYPE (TREE_OPERAND (cond
, 2)) != void_type_node
)
4520 TREE_OPERAND (cond
, 2)
4521 = build2 (code
, void_type_node
, unshare_expr (result
),
4522 TREE_OPERAND (cond
, 2));
4524 TREE_TYPE (cond
) = void_type_node
;
4525 recalculate_side_effects (cond
);
4529 gimplify_and_add (cond
, pre_p
);
4530 *expr_p
= unshare_expr (result
);
4539 /* For calls that return in memory, give *to_p as the CALL_EXPR's
4540 return slot so that we don't generate a temporary. */
4541 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p
)
4542 && aggregate_value_p (*from_p
, *from_p
))
4546 if (!(rhs_predicate_for (*to_p
))(*from_p
))
4547 /* If we need a temporary, *to_p isn't accurate. */
4549 /* It's OK to use the return slot directly unless it's an NRV. */
4550 else if (TREE_CODE (*to_p
) == RESULT_DECL
4551 && DECL_NAME (*to_p
) == NULL_TREE
4552 && needs_to_live_in_memory (*to_p
))
4554 else if (is_gimple_reg_type (TREE_TYPE (*to_p
))
4555 || (DECL_P (*to_p
) && DECL_REGISTER (*to_p
)))
4556 /* Don't force regs into memory. */
4558 else if (TREE_CODE (*expr_p
) == INIT_EXPR
)
4559 /* It's OK to use the target directly if it's being
4562 else if (variably_modified_type_p (TREE_TYPE (*to_p
), NULL_TREE
))
4563 /* Always use the target and thus RSO for variable-sized types.
4564 GIMPLE cannot deal with a variable-sized assignment
4565 embedded in a call statement. */
4567 else if (TREE_CODE (*to_p
) != SSA_NAME
4568 && (!is_gimple_variable (*to_p
)
4569 || needs_to_live_in_memory (*to_p
)))
4570 /* Don't use the original target if it's already addressable;
4571 if its address escapes, and the called function uses the
4572 NRV optimization, a conforming program could see *to_p
4573 change before the called function returns; see c++/19317.
4574 When optimizing, the return_slot pass marks more functions
4575 as safe after we have escape info. */
4582 CALL_EXPR_RETURN_SLOT_OPT (*from_p
) = 1;
4583 mark_addressable (*to_p
);
4588 case WITH_SIZE_EXPR
:
4589 /* Likewise for calls that return an aggregate of non-constant size,
4590 since we would not be able to generate a temporary at all. */
4591 if (TREE_CODE (TREE_OPERAND (*from_p
, 0)) == CALL_EXPR
)
4593 *from_p
= TREE_OPERAND (*from_p
, 0);
4594 /* We don't change ret in this case because the
4595 WITH_SIZE_EXPR might have been added in
4596 gimplify_modify_expr, so returning GS_OK would lead to an
4602 /* If we're initializing from a container, push the initialization
4604 case CLEANUP_POINT_EXPR
:
4606 case STATEMENT_LIST
:
4608 tree wrap
= *from_p
;
4611 ret
= gimplify_expr (to_p
, pre_p
, post_p
, is_gimple_min_lval
,
4613 if (ret
!= GS_ERROR
)
4616 t
= voidify_wrapper_expr (wrap
, *expr_p
);
4617 gcc_assert (t
== *expr_p
);
4621 gimplify_and_add (wrap
, pre_p
);
4622 *expr_p
= unshare_expr (*to_p
);
4629 case COMPOUND_LITERAL_EXPR
:
4631 tree complit
= TREE_OPERAND (*expr_p
, 1);
4632 tree decl_s
= COMPOUND_LITERAL_EXPR_DECL_EXPR (complit
);
4633 tree decl
= DECL_EXPR_DECL (decl_s
);
4634 tree init
= DECL_INITIAL (decl
);
4636 /* struct T x = (struct T) { 0, 1, 2 } can be optimized
4637 into struct T x = { 0, 1, 2 } if the address of the
4638 compound literal has never been taken. */
4639 if (!TREE_ADDRESSABLE (complit
)
4640 && !TREE_ADDRESSABLE (decl
)
4643 *expr_p
= copy_node (*expr_p
);
4644 TREE_OPERAND (*expr_p
, 1) = init
;
4659 /* Return true if T looks like a valid GIMPLE statement. */
4662 is_gimple_stmt (tree t
)
4664 const enum tree_code code
= TREE_CODE (t
);
4669 /* The only valid NOP_EXPR is the empty statement. */
4670 return IS_EMPTY_STMT (t
);
4674 /* These are only valid if they're void. */
4675 return TREE_TYPE (t
) == NULL
|| VOID_TYPE_P (TREE_TYPE (t
));
4681 case CASE_LABEL_EXPR
:
4682 case TRY_CATCH_EXPR
:
4683 case TRY_FINALLY_EXPR
:
4684 case EH_FILTER_EXPR
:
4687 case STATEMENT_LIST
:
4697 /* These are always void. */
4703 /* These are valid regardless of their type. */
4712 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
4713 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
4714 DECL_GIMPLE_REG_P set.
4716 IMPORTANT NOTE: This promotion is performed by introducing a load of the
4717 other, unmodified part of the complex object just before the total store.
4718 As a consequence, if the object is still uninitialized, an undefined value
4719 will be loaded into a register, which may result in a spurious exception
4720 if the register is floating-point and the value happens to be a signaling
4721 NaN for example. Then the fully-fledged complex operations lowering pass
4722 followed by a DCE pass are necessary in order to fix things up. */
4724 static enum gimplify_status
4725 gimplify_modify_expr_complex_part (tree
*expr_p
, gimple_seq
*pre_p
,
4728 enum tree_code code
, ocode
;
4729 tree lhs
, rhs
, new_rhs
, other
, realpart
, imagpart
;
4731 lhs
= TREE_OPERAND (*expr_p
, 0);
4732 rhs
= TREE_OPERAND (*expr_p
, 1);
4733 code
= TREE_CODE (lhs
);
4734 lhs
= TREE_OPERAND (lhs
, 0);
4736 ocode
= code
== REALPART_EXPR
? IMAGPART_EXPR
: REALPART_EXPR
;
4737 other
= build1 (ocode
, TREE_TYPE (rhs
), lhs
);
4738 TREE_NO_WARNING (other
) = 1;
4739 other
= get_formal_tmp_var (other
, pre_p
);
4741 realpart
= code
== REALPART_EXPR
? rhs
: other
;
4742 imagpart
= code
== REALPART_EXPR
? other
: rhs
;
4744 if (TREE_CONSTANT (realpart
) && TREE_CONSTANT (imagpart
))
4745 new_rhs
= build_complex (TREE_TYPE (lhs
), realpart
, imagpart
);
4747 new_rhs
= build2 (COMPLEX_EXPR
, TREE_TYPE (lhs
), realpart
, imagpart
);
4749 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (lhs
, new_rhs
));
4750 *expr_p
= (want_value
) ? rhs
: NULL_TREE
;
4755 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
4761 PRE_P points to the list where side effects that must happen before
4762 *EXPR_P should be stored.
4764 POST_P points to the list where side effects that must happen after
4765 *EXPR_P should be stored.
4767 WANT_VALUE is nonzero iff we want to use the value of this expression
4768 in another expression. */
4770 static enum gimplify_status
4771 gimplify_modify_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
4774 tree
*from_p
= &TREE_OPERAND (*expr_p
, 1);
4775 tree
*to_p
= &TREE_OPERAND (*expr_p
, 0);
4776 enum gimplify_status ret
= GS_UNHANDLED
;
4778 location_t loc
= EXPR_LOCATION (*expr_p
);
4779 gimple_stmt_iterator gsi
;
4781 gcc_assert (TREE_CODE (*expr_p
) == MODIFY_EXPR
4782 || TREE_CODE (*expr_p
) == INIT_EXPR
);
4784 /* Trying to simplify a clobber using normal logic doesn't work,
4785 so handle it here. */
4786 if (TREE_CLOBBER_P (*from_p
))
4788 gcc_assert (!want_value
&& TREE_CODE (*to_p
) == VAR_DECL
);
4789 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (*to_p
, *from_p
));
4794 /* Insert pointer conversions required by the middle-end that are not
4795 required by the frontend. This fixes middle-end type checking for
4796 for example gcc.dg/redecl-6.c. */
4797 if (POINTER_TYPE_P (TREE_TYPE (*to_p
)))
4799 STRIP_USELESS_TYPE_CONVERSION (*from_p
);
4800 if (!useless_type_conversion_p (TREE_TYPE (*to_p
), TREE_TYPE (*from_p
)))
4801 *from_p
= fold_convert_loc (loc
, TREE_TYPE (*to_p
), *from_p
);
4804 /* See if any simplifications can be done based on what the RHS is. */
4805 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
4807 if (ret
!= GS_UNHANDLED
)
4810 /* For zero sized types only gimplify the left hand side and right hand
4811 side as statements and throw away the assignment. Do this after
4812 gimplify_modify_expr_rhs so we handle TARGET_EXPRs of addressable
4814 if (zero_sized_type (TREE_TYPE (*from_p
)) && !want_value
)
4816 gimplify_stmt (from_p
, pre_p
);
4817 gimplify_stmt (to_p
, pre_p
);
4818 *expr_p
= NULL_TREE
;
4822 /* If the value being copied is of variable width, compute the length
4823 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
4824 before gimplifying any of the operands so that we can resolve any
4825 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
4826 the size of the expression to be copied, not of the destination, so
4827 that is what we must do here. */
4828 maybe_with_size_expr (from_p
);
4830 ret
= gimplify_expr (to_p
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
4831 if (ret
== GS_ERROR
)
4834 /* As a special case, we have to temporarily allow for assignments
4835 with a CALL_EXPR on the RHS. Since in GIMPLE a function call is
4836 a toplevel statement, when gimplifying the GENERIC expression
4837 MODIFY_EXPR <a, CALL_EXPR <foo>>, we cannot create the tuple
4838 GIMPLE_ASSIGN <a, GIMPLE_CALL <foo>>.
4840 Instead, we need to create the tuple GIMPLE_CALL <a, foo>. To
4841 prevent gimplify_expr from trying to create a new temporary for
4842 foo's LHS, we tell it that it should only gimplify until it
4843 reaches the CALL_EXPR. On return from gimplify_expr, the newly
4844 created GIMPLE_CALL <foo> will be the last statement in *PRE_P
4845 and all we need to do here is set 'a' to be its LHS. */
4846 ret
= gimplify_expr (from_p
, pre_p
, post_p
, rhs_predicate_for (*to_p
),
4848 if (ret
== GS_ERROR
)
4851 /* Now see if the above changed *from_p to something we handle specially. */
4852 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
4854 if (ret
!= GS_UNHANDLED
)
4857 /* If we've got a variable sized assignment between two lvalues (i.e. does
4858 not involve a call), then we can make things a bit more straightforward
4859 by converting the assignment to memcpy or memset. */
4860 if (TREE_CODE (*from_p
) == WITH_SIZE_EXPR
)
4862 tree from
= TREE_OPERAND (*from_p
, 0);
4863 tree size
= TREE_OPERAND (*from_p
, 1);
4865 if (TREE_CODE (from
) == CONSTRUCTOR
)
4866 return gimplify_modify_expr_to_memset (expr_p
, size
, want_value
, pre_p
);
4868 if (is_gimple_addressable (from
))
4871 return gimplify_modify_expr_to_memcpy (expr_p
, size
, want_value
,
4876 /* Transform partial stores to non-addressable complex variables into
4877 total stores. This allows us to use real instead of virtual operands
4878 for these variables, which improves optimization. */
4879 if ((TREE_CODE (*to_p
) == REALPART_EXPR
4880 || TREE_CODE (*to_p
) == IMAGPART_EXPR
)
4881 && is_gimple_reg (TREE_OPERAND (*to_p
, 0)))
4882 return gimplify_modify_expr_complex_part (expr_p
, pre_p
, want_value
);
4884 /* Try to alleviate the effects of the gimplification creating artificial
4885 temporaries (see for example is_gimple_reg_rhs) on the debug info. */
4886 if (!gimplify_ctxp
->into_ssa
4887 && TREE_CODE (*from_p
) == VAR_DECL
4888 && DECL_IGNORED_P (*from_p
)
4890 && !DECL_IGNORED_P (*to_p
))
4892 if (!DECL_NAME (*from_p
) && DECL_NAME (*to_p
))
4894 = create_tmp_var_name (IDENTIFIER_POINTER (DECL_NAME (*to_p
)));
4895 DECL_DEBUG_EXPR_IS_FROM (*from_p
) = 1;
4896 SET_DECL_DEBUG_EXPR (*from_p
, *to_p
);
4899 if (want_value
&& TREE_THIS_VOLATILE (*to_p
))
4900 *from_p
= get_initialized_tmp_var (*from_p
, pre_p
, post_p
);
4902 if (TREE_CODE (*from_p
) == CALL_EXPR
)
4904 /* Since the RHS is a CALL_EXPR, we need to create a GIMPLE_CALL
4905 instead of a GIMPLE_ASSIGN. */
4906 tree fnptrtype
= TREE_TYPE (CALL_EXPR_FN (*from_p
));
4907 CALL_EXPR_FN (*from_p
) = TREE_OPERAND (CALL_EXPR_FN (*from_p
), 0);
4908 STRIP_USELESS_TYPE_CONVERSION (CALL_EXPR_FN (*from_p
));
4909 assign
= gimple_build_call_from_tree (*from_p
);
4910 gimple_call_set_fntype (assign
, TREE_TYPE (fnptrtype
));
4911 if (!gimple_call_noreturn_p (assign
))
4912 gimple_call_set_lhs (assign
, *to_p
);
4916 assign
= gimple_build_assign (*to_p
, *from_p
);
4917 gimple_set_location (assign
, EXPR_LOCATION (*expr_p
));
4920 if (gimplify_ctxp
->into_ssa
&& is_gimple_reg (*to_p
))
4922 /* If we've somehow already got an SSA_NAME on the LHS, then
4923 we've probably modified it twice. Not good. */
4924 gcc_assert (TREE_CODE (*to_p
) != SSA_NAME
);
4925 *to_p
= make_ssa_name (*to_p
, assign
);
4926 gimple_set_lhs (assign
, *to_p
);
4929 gimplify_seq_add_stmt (pre_p
, assign
);
4930 gsi
= gsi_last (*pre_p
);
4935 *expr_p
= TREE_THIS_VOLATILE (*to_p
) ? *from_p
: unshare_expr (*to_p
);
4944 /* Gimplify a comparison between two variable-sized objects. Do this
4945 with a call to BUILT_IN_MEMCMP. */
4947 static enum gimplify_status
4948 gimplify_variable_sized_compare (tree
*expr_p
)
4950 location_t loc
= EXPR_LOCATION (*expr_p
);
4951 tree op0
= TREE_OPERAND (*expr_p
, 0);
4952 tree op1
= TREE_OPERAND (*expr_p
, 1);
4953 tree t
, arg
, dest
, src
, expr
;
4955 arg
= TYPE_SIZE_UNIT (TREE_TYPE (op0
));
4956 arg
= unshare_expr (arg
);
4957 arg
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (arg
, op0
);
4958 src
= build_fold_addr_expr_loc (loc
, op1
);
4959 dest
= build_fold_addr_expr_loc (loc
, op0
);
4960 t
= builtin_decl_implicit (BUILT_IN_MEMCMP
);
4961 t
= build_call_expr_loc (loc
, t
, 3, dest
, src
, arg
);
4964 = build2 (TREE_CODE (*expr_p
), TREE_TYPE (*expr_p
), t
, integer_zero_node
);
4965 SET_EXPR_LOCATION (expr
, loc
);
4971 /* Gimplify a comparison between two aggregate objects of integral scalar
4972 mode as a comparison between the bitwise equivalent scalar values. */
4974 static enum gimplify_status
4975 gimplify_scalar_mode_aggregate_compare (tree
*expr_p
)
4977 location_t loc
= EXPR_LOCATION (*expr_p
);
4978 tree op0
= TREE_OPERAND (*expr_p
, 0);
4979 tree op1
= TREE_OPERAND (*expr_p
, 1);
4981 tree type
= TREE_TYPE (op0
);
4982 tree scalar_type
= lang_hooks
.types
.type_for_mode (TYPE_MODE (type
), 1);
4984 op0
= fold_build1_loc (loc
, VIEW_CONVERT_EXPR
, scalar_type
, op0
);
4985 op1
= fold_build1_loc (loc
, VIEW_CONVERT_EXPR
, scalar_type
, op1
);
4988 = fold_build2_loc (loc
, TREE_CODE (*expr_p
), TREE_TYPE (*expr_p
), op0
, op1
);
4993 /* Gimplify an expression sequence. This function gimplifies each
4994 expression and rewrites the original expression with the last
4995 expression of the sequence in GIMPLE form.
4997 PRE_P points to the list where the side effects for all the
4998 expressions in the sequence will be emitted.
5000 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
5002 static enum gimplify_status
5003 gimplify_compound_expr (tree
*expr_p
, gimple_seq
*pre_p
, bool want_value
)
5009 tree
*sub_p
= &TREE_OPERAND (t
, 0);
5011 if (TREE_CODE (*sub_p
) == COMPOUND_EXPR
)
5012 gimplify_compound_expr (sub_p
, pre_p
, false);
5014 gimplify_stmt (sub_p
, pre_p
);
5016 t
= TREE_OPERAND (t
, 1);
5018 while (TREE_CODE (t
) == COMPOUND_EXPR
);
5025 gimplify_stmt (expr_p
, pre_p
);
5030 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
5031 gimplify. After gimplification, EXPR_P will point to a new temporary
5032 that holds the original value of the SAVE_EXPR node.
5034 PRE_P points to the list where side effects that must happen before
5035 *EXPR_P should be stored. */
5037 static enum gimplify_status
5038 gimplify_save_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
5040 enum gimplify_status ret
= GS_ALL_DONE
;
5043 gcc_assert (TREE_CODE (*expr_p
) == SAVE_EXPR
);
5044 val
= TREE_OPERAND (*expr_p
, 0);
5046 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
5047 if (!SAVE_EXPR_RESOLVED_P (*expr_p
))
5049 /* The operand may be a void-valued expression such as SAVE_EXPRs
5050 generated by the Java frontend for class initialization. It is
5051 being executed only for its side-effects. */
5052 if (TREE_TYPE (val
) == void_type_node
)
5054 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5055 is_gimple_stmt
, fb_none
);
5059 val
= get_initialized_tmp_var (val
, pre_p
, post_p
);
5061 TREE_OPERAND (*expr_p
, 0) = val
;
5062 SAVE_EXPR_RESOLVED_P (*expr_p
) = 1;
5070 /* Rewrite the ADDR_EXPR node pointed to by EXPR_P
5077 PRE_P points to the list where side effects that must happen before
5078 *EXPR_P should be stored.
5080 POST_P points to the list where side effects that must happen after
5081 *EXPR_P should be stored. */
5083 static enum gimplify_status
5084 gimplify_addr_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
5086 tree expr
= *expr_p
;
5087 tree op0
= TREE_OPERAND (expr
, 0);
5088 enum gimplify_status ret
;
5089 location_t loc
= EXPR_LOCATION (*expr_p
);
5091 switch (TREE_CODE (op0
))
5095 /* Check if we are dealing with an expression of the form '&*ptr'.
5096 While the front end folds away '&*ptr' into 'ptr', these
5097 expressions may be generated internally by the compiler (e.g.,
5098 builtins like __builtin_va_end). */
5099 /* Caution: the silent array decomposition semantics we allow for
5100 ADDR_EXPR means we can't always discard the pair. */
5101 /* Gimplification of the ADDR_EXPR operand may drop
5102 cv-qualification conversions, so make sure we add them if
5105 tree op00
= TREE_OPERAND (op0
, 0);
5106 tree t_expr
= TREE_TYPE (expr
);
5107 tree t_op00
= TREE_TYPE (op00
);
5109 if (!useless_type_conversion_p (t_expr
, t_op00
))
5110 op00
= fold_convert_loc (loc
, TREE_TYPE (expr
), op00
);
5116 case VIEW_CONVERT_EXPR
:
5117 /* Take the address of our operand and then convert it to the type of
5120 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
5121 all clear. The impact of this transformation is even less clear. */
5123 /* If the operand is a useless conversion, look through it. Doing so
5124 guarantees that the ADDR_EXPR and its operand will remain of the
5126 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0
, 0)))
5127 op0
= TREE_OPERAND (op0
, 0);
5129 *expr_p
= fold_convert_loc (loc
, TREE_TYPE (expr
),
5130 build_fold_addr_expr_loc (loc
,
5131 TREE_OPERAND (op0
, 0)));
5136 /* We use fb_either here because the C frontend sometimes takes
5137 the address of a call that returns a struct; see
5138 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
5139 the implied temporary explicit. */
5141 /* Make the operand addressable. */
5142 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, post_p
,
5143 is_gimple_addressable
, fb_either
);
5144 if (ret
== GS_ERROR
)
5147 /* Then mark it. Beware that it may not be possible to do so directly
5148 if a temporary has been created by the gimplification. */
5149 prepare_gimple_addressable (&TREE_OPERAND (expr
, 0), pre_p
);
5151 op0
= TREE_OPERAND (expr
, 0);
5153 /* For various reasons, the gimplification of the expression
5154 may have made a new INDIRECT_REF. */
5155 if (TREE_CODE (op0
) == INDIRECT_REF
)
5156 goto do_indirect_ref
;
5158 mark_addressable (TREE_OPERAND (expr
, 0));
5160 /* The FEs may end up building ADDR_EXPRs early on a decl with
5161 an incomplete type. Re-build ADDR_EXPRs in canonical form
5163 if (!types_compatible_p (TREE_TYPE (op0
), TREE_TYPE (TREE_TYPE (expr
))))
5164 *expr_p
= build_fold_addr_expr (op0
);
5166 /* Make sure TREE_CONSTANT and TREE_SIDE_EFFECTS are set properly. */
5167 recompute_tree_invariant_for_addr_expr (*expr_p
);
5169 /* If we re-built the ADDR_EXPR add a conversion to the original type
5171 if (!useless_type_conversion_p (TREE_TYPE (expr
), TREE_TYPE (*expr_p
)))
5172 *expr_p
= fold_convert (TREE_TYPE (expr
), *expr_p
);
5180 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
5181 value; output operands should be a gimple lvalue. */
5183 static enum gimplify_status
5184 gimplify_asm_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
5188 const char **oconstraints
;
5191 const char *constraint
;
5192 bool allows_mem
, allows_reg
, is_inout
;
5193 enum gimplify_status ret
, tret
;
5195 VEC(tree
, gc
) *inputs
;
5196 VEC(tree
, gc
) *outputs
;
5197 VEC(tree
, gc
) *clobbers
;
5198 VEC(tree
, gc
) *labels
;
5202 noutputs
= list_length (ASM_OUTPUTS (expr
));
5203 oconstraints
= (const char **) alloca ((noutputs
) * sizeof (const char *));
5205 inputs
= outputs
= clobbers
= labels
= NULL
;
5208 link_next
= NULL_TREE
;
5209 for (i
= 0, link
= ASM_OUTPUTS (expr
); link
; ++i
, link
= link_next
)
5212 size_t constraint_len
;
5214 link_next
= TREE_CHAIN (link
);
5218 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
5219 constraint_len
= strlen (constraint
);
5220 if (constraint_len
== 0)
5223 ok
= parse_output_constraint (&constraint
, i
, 0, 0,
5224 &allows_mem
, &allows_reg
, &is_inout
);
5231 if (!allows_reg
&& allows_mem
)
5232 mark_addressable (TREE_VALUE (link
));
5234 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
5235 is_inout
? is_gimple_min_lval
: is_gimple_lvalue
,
5236 fb_lvalue
| fb_mayfail
);
5237 if (tret
== GS_ERROR
)
5239 error ("invalid lvalue in asm output %d", i
);
5243 VEC_safe_push (tree
, gc
, outputs
, link
);
5244 TREE_CHAIN (link
) = NULL_TREE
;
5248 /* An input/output operand. To give the optimizers more
5249 flexibility, split it into separate input and output
5254 /* Turn the in/out constraint into an output constraint. */
5255 char *p
= xstrdup (constraint
);
5257 TREE_VALUE (TREE_PURPOSE (link
)) = build_string (constraint_len
, p
);
5259 /* And add a matching input constraint. */
5262 sprintf (buf
, "%d", i
);
5264 /* If there are multiple alternatives in the constraint,
5265 handle each of them individually. Those that allow register
5266 will be replaced with operand number, the others will stay
5268 if (strchr (p
, ',') != NULL
)
5270 size_t len
= 0, buflen
= strlen (buf
);
5271 char *beg
, *end
, *str
, *dst
;
5275 end
= strchr (beg
, ',');
5277 end
= strchr (beg
, '\0');
5278 if ((size_t) (end
- beg
) < buflen
)
5281 len
+= end
- beg
+ 1;
5288 str
= (char *) alloca (len
);
5289 for (beg
= p
+ 1, dst
= str
;;)
5292 bool mem_p
, reg_p
, inout_p
;
5294 end
= strchr (beg
, ',');
5299 parse_output_constraint (&tem
, i
, 0, 0,
5300 &mem_p
, ®_p
, &inout_p
);
5305 memcpy (dst
, buf
, buflen
);
5314 memcpy (dst
, beg
, len
);
5323 input
= build_string (dst
- str
, str
);
5326 input
= build_string (strlen (buf
), buf
);
5329 input
= build_string (constraint_len
- 1, constraint
+ 1);
5333 input
= build_tree_list (build_tree_list (NULL_TREE
, input
),
5334 unshare_expr (TREE_VALUE (link
)));
5335 ASM_INPUTS (expr
) = chainon (ASM_INPUTS (expr
), input
);
5339 link_next
= NULL_TREE
;
5340 for (link
= ASM_INPUTS (expr
); link
; ++i
, link
= link_next
)
5342 link_next
= TREE_CHAIN (link
);
5343 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
5344 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
5345 oconstraints
, &allows_mem
, &allows_reg
);
5347 /* If we can't make copies, we can only accept memory. */
5348 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (link
))))
5354 error ("impossible constraint in %<asm%>");
5355 error ("non-memory input %d must stay in memory", i
);
5360 /* If the operand is a memory input, it should be an lvalue. */
5361 if (!allows_reg
&& allows_mem
)
5363 tree inputv
= TREE_VALUE (link
);
5364 STRIP_NOPS (inputv
);
5365 if (TREE_CODE (inputv
) == PREDECREMENT_EXPR
5366 || TREE_CODE (inputv
) == PREINCREMENT_EXPR
5367 || TREE_CODE (inputv
) == POSTDECREMENT_EXPR
5368 || TREE_CODE (inputv
) == POSTINCREMENT_EXPR
)
5369 TREE_VALUE (link
) = error_mark_node
;
5370 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
5371 is_gimple_lvalue
, fb_lvalue
| fb_mayfail
);
5372 mark_addressable (TREE_VALUE (link
));
5373 if (tret
== GS_ERROR
)
5375 if (EXPR_HAS_LOCATION (TREE_VALUE (link
)))
5376 input_location
= EXPR_LOCATION (TREE_VALUE (link
));
5377 error ("memory input %d is not directly addressable", i
);
5383 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
5384 is_gimple_asm_val
, fb_rvalue
);
5385 if (tret
== GS_ERROR
)
5389 TREE_CHAIN (link
) = NULL_TREE
;
5390 VEC_safe_push (tree
, gc
, inputs
, link
);
5393 for (link
= ASM_CLOBBERS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
5394 VEC_safe_push (tree
, gc
, clobbers
, link
);
5396 for (link
= ASM_LABELS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
5397 VEC_safe_push (tree
, gc
, labels
, link
);
5399 /* Do not add ASMs with errors to the gimple IL stream. */
5400 if (ret
!= GS_ERROR
)
5402 stmt
= gimple_build_asm_vec (TREE_STRING_POINTER (ASM_STRING (expr
)),
5403 inputs
, outputs
, clobbers
, labels
);
5405 gimple_asm_set_volatile (stmt
, ASM_VOLATILE_P (expr
));
5406 gimple_asm_set_input (stmt
, ASM_INPUT_P (expr
));
5408 gimplify_seq_add_stmt (pre_p
, stmt
);
5414 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
5415 GIMPLE_WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
5416 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
5417 return to this function.
5419 FIXME should we complexify the prequeue handling instead? Or use flags
5420 for all the cleanups and let the optimizer tighten them up? The current
5421 code seems pretty fragile; it will break on a cleanup within any
5422 non-conditional nesting. But any such nesting would be broken, anyway;
5423 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
5424 and continues out of it. We can do that at the RTL level, though, so
5425 having an optimizer to tighten up try/finally regions would be a Good
5428 static enum gimplify_status
5429 gimplify_cleanup_point_expr (tree
*expr_p
, gimple_seq
*pre_p
)
5431 gimple_stmt_iterator iter
;
5432 gimple_seq body_sequence
= NULL
;
5434 tree temp
= voidify_wrapper_expr (*expr_p
, NULL
);
5436 /* We only care about the number of conditions between the innermost
5437 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
5438 any cleanups collected outside the CLEANUP_POINT_EXPR. */
5439 int old_conds
= gimplify_ctxp
->conditions
;
5440 gimple_seq old_cleanups
= gimplify_ctxp
->conditional_cleanups
;
5441 bool old_in_cleanup_point_expr
= gimplify_ctxp
->in_cleanup_point_expr
;
5442 gimplify_ctxp
->conditions
= 0;
5443 gimplify_ctxp
->conditional_cleanups
= NULL
;
5444 gimplify_ctxp
->in_cleanup_point_expr
= true;
5446 gimplify_stmt (&TREE_OPERAND (*expr_p
, 0), &body_sequence
);
5448 gimplify_ctxp
->conditions
= old_conds
;
5449 gimplify_ctxp
->conditional_cleanups
= old_cleanups
;
5450 gimplify_ctxp
->in_cleanup_point_expr
= old_in_cleanup_point_expr
;
5452 for (iter
= gsi_start (body_sequence
); !gsi_end_p (iter
); )
5454 gimple wce
= gsi_stmt (iter
);
5456 if (gimple_code (wce
) == GIMPLE_WITH_CLEANUP_EXPR
)
5458 if (gsi_one_before_end_p (iter
))
5460 /* Note that gsi_insert_seq_before and gsi_remove do not
5461 scan operands, unlike some other sequence mutators. */
5462 if (!gimple_wce_cleanup_eh_only (wce
))
5463 gsi_insert_seq_before_without_update (&iter
,
5464 gimple_wce_cleanup (wce
),
5466 gsi_remove (&iter
, true);
5473 enum gimple_try_flags kind
;
5475 if (gimple_wce_cleanup_eh_only (wce
))
5476 kind
= GIMPLE_TRY_CATCH
;
5478 kind
= GIMPLE_TRY_FINALLY
;
5479 seq
= gsi_split_seq_after (iter
);
5481 gtry
= gimple_build_try (seq
, gimple_wce_cleanup (wce
), kind
);
5482 /* Do not use gsi_replace here, as it may scan operands.
5483 We want to do a simple structural modification only. */
5484 gsi_set_stmt (&iter
, gtry
);
5485 iter
= gsi_start (gtry
->gimple_try
.eval
);
5492 gimplify_seq_add_seq (pre_p
, body_sequence
);
5505 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
5506 is the cleanup action required. EH_ONLY is true if the cleanup should
5507 only be executed if an exception is thrown, not on normal exit. */
5510 gimple_push_cleanup (tree var
, tree cleanup
, bool eh_only
, gimple_seq
*pre_p
)
5513 gimple_seq cleanup_stmts
= NULL
;
5515 /* Errors can result in improperly nested cleanups. Which results in
5516 confusion when trying to resolve the GIMPLE_WITH_CLEANUP_EXPR. */
5520 if (gimple_conditional_context ())
5522 /* If we're in a conditional context, this is more complex. We only
5523 want to run the cleanup if we actually ran the initialization that
5524 necessitates it, but we want to run it after the end of the
5525 conditional context. So we wrap the try/finally around the
5526 condition and use a flag to determine whether or not to actually
5527 run the destructor. Thus
5531 becomes (approximately)
5535 if (test) { A::A(temp); flag = 1; val = f(temp); }
5538 if (flag) A::~A(temp);
5542 tree flag
= create_tmp_var (boolean_type_node
, "cleanup");
5543 gimple ffalse
= gimple_build_assign (flag
, boolean_false_node
);
5544 gimple ftrue
= gimple_build_assign (flag
, boolean_true_node
);
5546 cleanup
= build3 (COND_EXPR
, void_type_node
, flag
, cleanup
, NULL
);
5547 gimplify_stmt (&cleanup
, &cleanup_stmts
);
5548 wce
= gimple_build_wce (cleanup_stmts
);
5550 gimplify_seq_add_stmt (&gimplify_ctxp
->conditional_cleanups
, ffalse
);
5551 gimplify_seq_add_stmt (&gimplify_ctxp
->conditional_cleanups
, wce
);
5552 gimplify_seq_add_stmt (pre_p
, ftrue
);
5554 /* Because of this manipulation, and the EH edges that jump
5555 threading cannot redirect, the temporary (VAR) will appear
5556 to be used uninitialized. Don't warn. */
5557 TREE_NO_WARNING (var
) = 1;
5561 gimplify_stmt (&cleanup
, &cleanup_stmts
);
5562 wce
= gimple_build_wce (cleanup_stmts
);
5563 gimple_wce_set_cleanup_eh_only (wce
, eh_only
);
5564 gimplify_seq_add_stmt (pre_p
, wce
);
5568 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
5570 static enum gimplify_status
5571 gimplify_target_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
5573 tree targ
= *expr_p
;
5574 tree temp
= TARGET_EXPR_SLOT (targ
);
5575 tree init
= TARGET_EXPR_INITIAL (targ
);
5576 enum gimplify_status ret
;
5580 tree cleanup
= NULL_TREE
;
5582 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
5583 to the temps list. Handle also variable length TARGET_EXPRs. */
5584 if (TREE_CODE (DECL_SIZE (temp
)) != INTEGER_CST
)
5586 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (temp
)))
5587 gimplify_type_sizes (TREE_TYPE (temp
), pre_p
);
5588 gimplify_vla_decl (temp
, pre_p
);
5591 gimple_add_tmp_var (temp
);
5593 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
5594 expression is supposed to initialize the slot. */
5595 if (VOID_TYPE_P (TREE_TYPE (init
)))
5596 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
, fb_none
);
5599 tree init_expr
= build2 (INIT_EXPR
, void_type_node
, temp
, init
);
5601 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
, fb_none
);
5603 ggc_free (init_expr
);
5605 if (ret
== GS_ERROR
)
5607 /* PR c++/28266 Make sure this is expanded only once. */
5608 TARGET_EXPR_INITIAL (targ
) = NULL_TREE
;
5612 gimplify_and_add (init
, pre_p
);
5614 /* If needed, push the cleanup for the temp. */
5615 if (TARGET_EXPR_CLEANUP (targ
))
5617 if (CLEANUP_EH_ONLY (targ
))
5618 gimple_push_cleanup (temp
, TARGET_EXPR_CLEANUP (targ
),
5619 CLEANUP_EH_ONLY (targ
), pre_p
);
5621 cleanup
= TARGET_EXPR_CLEANUP (targ
);
5624 /* Add a clobber for the temporary going out of scope, like
5625 gimplify_bind_expr. */
5626 if (gimplify_ctxp
->in_cleanup_point_expr
5627 && needs_to_live_in_memory (temp
)
5628 && flag_stack_reuse
== SR_ALL
)
5630 tree clobber
= build_constructor (TREE_TYPE (temp
), NULL
);
5631 TREE_THIS_VOLATILE (clobber
) = true;
5632 clobber
= build2 (MODIFY_EXPR
, TREE_TYPE (temp
), temp
, clobber
);
5634 cleanup
= build2 (COMPOUND_EXPR
, void_type_node
, cleanup
,
5641 gimple_push_cleanup (temp
, cleanup
, false, pre_p
);
5643 /* Only expand this once. */
5644 TREE_OPERAND (targ
, 3) = init
;
5645 TARGET_EXPR_INITIAL (targ
) = NULL_TREE
;
5648 /* We should have expanded this before. */
5649 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp
));
5655 /* Gimplification of expression trees. */
5657 /* Gimplify an expression which appears at statement context. The
5658 corresponding GIMPLE statements are added to *SEQ_P. If *SEQ_P is
5659 NULL, a new sequence is allocated.
5661 Return true if we actually added a statement to the queue. */
5664 gimplify_stmt (tree
*stmt_p
, gimple_seq
*seq_p
)
5666 gimple_seq_node last
;
5668 last
= gimple_seq_last (*seq_p
);
5669 gimplify_expr (stmt_p
, seq_p
, NULL
, is_gimple_stmt
, fb_none
);
5670 return last
!= gimple_seq_last (*seq_p
);
5673 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
5674 to CTX. If entries already exist, force them to be some flavor of private.
5675 If there is no enclosing parallel, do nothing. */
5678 omp_firstprivatize_variable (struct gimplify_omp_ctx
*ctx
, tree decl
)
5682 if (decl
== NULL
|| !DECL_P (decl
))
5687 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5690 if (n
->value
& GOVD_SHARED
)
5691 n
->value
= GOVD_FIRSTPRIVATE
| (n
->value
& GOVD_SEEN
);
5695 else if (ctx
->region_type
!= ORT_WORKSHARE
)
5696 omp_add_variable (ctx
, decl
, GOVD_FIRSTPRIVATE
);
5698 ctx
= ctx
->outer_context
;
5703 /* Similarly for each of the type sizes of TYPE. */
5706 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx
*ctx
, tree type
)
5708 if (type
== NULL
|| type
== error_mark_node
)
5710 type
= TYPE_MAIN_VARIANT (type
);
5712 if (pointer_set_insert (ctx
->privatized_types
, type
))
5715 switch (TREE_CODE (type
))
5721 case FIXED_POINT_TYPE
:
5722 omp_firstprivatize_variable (ctx
, TYPE_MIN_VALUE (type
));
5723 omp_firstprivatize_variable (ctx
, TYPE_MAX_VALUE (type
));
5727 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
5728 omp_firstprivatize_type_sizes (ctx
, TYPE_DOMAIN (type
));
5733 case QUAL_UNION_TYPE
:
5736 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
5737 if (TREE_CODE (field
) == FIELD_DECL
)
5739 omp_firstprivatize_variable (ctx
, DECL_FIELD_OFFSET (field
));
5740 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (field
));
5746 case REFERENCE_TYPE
:
5747 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
5754 omp_firstprivatize_variable (ctx
, TYPE_SIZE (type
));
5755 omp_firstprivatize_variable (ctx
, TYPE_SIZE_UNIT (type
));
5756 lang_hooks
.types
.omp_firstprivatize_type_sizes (ctx
, type
);
5759 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
5762 omp_add_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, unsigned int flags
)
5765 unsigned int nflags
;
5768 if (error_operand_p (decl
))
5771 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
5772 there are constructors involved somewhere. */
5773 if (TREE_ADDRESSABLE (TREE_TYPE (decl
))
5774 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
5777 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5780 /* We shouldn't be re-adding the decl with the same data
5782 gcc_assert ((n
->value
& GOVD_DATA_SHARE_CLASS
& flags
) == 0);
5783 /* The only combination of data sharing classes we should see is
5784 FIRSTPRIVATE and LASTPRIVATE. */
5785 nflags
= n
->value
| flags
;
5786 gcc_assert ((nflags
& GOVD_DATA_SHARE_CLASS
)
5787 == (GOVD_FIRSTPRIVATE
| GOVD_LASTPRIVATE
));
5792 /* When adding a variable-sized variable, we have to handle all sorts
5793 of additional bits of data: the pointer replacement variable, and
5794 the parameters of the type. */
5795 if (DECL_SIZE (decl
) && TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
5797 /* Add the pointer replacement variable as PRIVATE if the variable
5798 replacement is private, else FIRSTPRIVATE since we'll need the
5799 address of the original variable either for SHARED, or for the
5800 copy into or out of the context. */
5801 if (!(flags
& GOVD_LOCAL
))
5803 nflags
= flags
& GOVD_PRIVATE
? GOVD_PRIVATE
: GOVD_FIRSTPRIVATE
;
5804 nflags
|= flags
& GOVD_SEEN
;
5805 t
= DECL_VALUE_EXPR (decl
);
5806 gcc_assert (TREE_CODE (t
) == INDIRECT_REF
);
5807 t
= TREE_OPERAND (t
, 0);
5808 gcc_assert (DECL_P (t
));
5809 omp_add_variable (ctx
, t
, nflags
);
5812 /* Add all of the variable and type parameters (which should have
5813 been gimplified to a formal temporary) as FIRSTPRIVATE. */
5814 omp_firstprivatize_variable (ctx
, DECL_SIZE_UNIT (decl
));
5815 omp_firstprivatize_variable (ctx
, DECL_SIZE (decl
));
5816 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
5818 /* The variable-sized variable itself is never SHARED, only some form
5819 of PRIVATE. The sharing would take place via the pointer variable
5820 which we remapped above. */
5821 if (flags
& GOVD_SHARED
)
5822 flags
= GOVD_PRIVATE
| GOVD_DEBUG_PRIVATE
5823 | (flags
& (GOVD_SEEN
| GOVD_EXPLICIT
));
5825 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
5826 alloca statement we generate for the variable, so make sure it
5827 is available. This isn't automatically needed for the SHARED
5828 case, since we won't be allocating local storage then.
5829 For local variables TYPE_SIZE_UNIT might not be gimplified yet,
5830 in this case omp_notice_variable will be called later
5831 on when it is gimplified. */
5832 else if (! (flags
& GOVD_LOCAL
)
5833 && DECL_P (TYPE_SIZE_UNIT (TREE_TYPE (decl
))))
5834 omp_notice_variable (ctx
, TYPE_SIZE_UNIT (TREE_TYPE (decl
)), true);
5836 else if (lang_hooks
.decls
.omp_privatize_by_reference (decl
))
5838 gcc_assert ((flags
& GOVD_LOCAL
) == 0);
5839 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
5841 /* Similar to the direct variable sized case above, we'll need the
5842 size of references being privatized. */
5843 if ((flags
& GOVD_SHARED
) == 0)
5845 t
= TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl
)));
5846 if (TREE_CODE (t
) != INTEGER_CST
)
5847 omp_notice_variable (ctx
, t
, true);
5851 splay_tree_insert (ctx
->variables
, (splay_tree_key
)decl
, flags
);
5854 /* Notice a threadprivate variable DECL used in OpenMP context CTX.
5855 This just prints out diagnostics about threadprivate variable uses
5856 in untied tasks. If DECL2 is non-NULL, prevent this warning
5857 on that variable. */
5860 omp_notice_threadprivate_variable (struct gimplify_omp_ctx
*ctx
, tree decl
,
5865 if (ctx
->region_type
!= ORT_UNTIED_TASK
)
5867 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5870 error ("threadprivate variable %qE used in untied task",
5872 error_at (ctx
->location
, "enclosing task");
5873 splay_tree_insert (ctx
->variables
, (splay_tree_key
)decl
, 0);
5876 splay_tree_insert (ctx
->variables
, (splay_tree_key
)decl2
, 0);
5880 /* Record the fact that DECL was used within the OpenMP context CTX.
5881 IN_CODE is true when real code uses DECL, and false when we should
5882 merely emit default(none) errors. Return true if DECL is going to
5883 be remapped and thus DECL shouldn't be gimplified into its
5884 DECL_VALUE_EXPR (if any). */
5887 omp_notice_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, bool in_code
)
5890 unsigned flags
= in_code
? GOVD_SEEN
: 0;
5891 bool ret
= false, shared
;
5893 if (error_operand_p (decl
))
5896 /* Threadprivate variables are predetermined. */
5897 if (is_global_var (decl
))
5899 if (DECL_THREAD_LOCAL_P (decl
))
5900 return omp_notice_threadprivate_variable (ctx
, decl
, NULL_TREE
);
5902 if (DECL_HAS_VALUE_EXPR_P (decl
))
5904 tree value
= get_base_address (DECL_VALUE_EXPR (decl
));
5906 if (value
&& DECL_P (value
) && DECL_THREAD_LOCAL_P (value
))
5907 return omp_notice_threadprivate_variable (ctx
, decl
, value
);
5911 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5914 enum omp_clause_default_kind default_kind
, kind
;
5915 struct gimplify_omp_ctx
*octx
;
5917 if (ctx
->region_type
== ORT_WORKSHARE
)
5920 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
5921 remapped firstprivate instead of shared. To some extent this is
5922 addressed in omp_firstprivatize_type_sizes, but not effectively. */
5923 default_kind
= ctx
->default_kind
;
5924 kind
= lang_hooks
.decls
.omp_predetermined_sharing (decl
);
5925 if (kind
!= OMP_CLAUSE_DEFAULT_UNSPECIFIED
)
5926 default_kind
= kind
;
5928 switch (default_kind
)
5930 case OMP_CLAUSE_DEFAULT_NONE
:
5931 error ("%qE not specified in enclosing parallel",
5932 DECL_NAME (lang_hooks
.decls
.omp_report_decl (decl
)));
5933 if ((ctx
->region_type
& ORT_TASK
) != 0)
5934 error_at (ctx
->location
, "enclosing task");
5936 error_at (ctx
->location
, "enclosing parallel");
5938 case OMP_CLAUSE_DEFAULT_SHARED
:
5939 flags
|= GOVD_SHARED
;
5941 case OMP_CLAUSE_DEFAULT_PRIVATE
:
5942 flags
|= GOVD_PRIVATE
;
5944 case OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
:
5945 flags
|= GOVD_FIRSTPRIVATE
;
5947 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
5948 /* decl will be either GOVD_FIRSTPRIVATE or GOVD_SHARED. */
5949 gcc_assert ((ctx
->region_type
& ORT_TASK
) != 0);
5950 if (ctx
->outer_context
)
5951 omp_notice_variable (ctx
->outer_context
, decl
, in_code
);
5952 for (octx
= ctx
->outer_context
; octx
; octx
= octx
->outer_context
)
5956 n2
= splay_tree_lookup (octx
->variables
, (splay_tree_key
) decl
);
5957 if (n2
&& (n2
->value
& GOVD_DATA_SHARE_CLASS
) != GOVD_SHARED
)
5959 flags
|= GOVD_FIRSTPRIVATE
;
5962 if ((octx
->region_type
& ORT_PARALLEL
) != 0)
5965 if (flags
& GOVD_FIRSTPRIVATE
)
5968 && (TREE_CODE (decl
) == PARM_DECL
5969 || (!is_global_var (decl
)
5970 && DECL_CONTEXT (decl
) == current_function_decl
)))
5972 flags
|= GOVD_FIRSTPRIVATE
;
5975 flags
|= GOVD_SHARED
;
5981 if ((flags
& GOVD_PRIVATE
)
5982 && lang_hooks
.decls
.omp_private_outer_ref (decl
))
5983 flags
|= GOVD_PRIVATE_OUTER_REF
;
5985 omp_add_variable (ctx
, decl
, flags
);
5987 shared
= (flags
& GOVD_SHARED
) != 0;
5988 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
5992 if ((n
->value
& (GOVD_SEEN
| GOVD_LOCAL
)) == 0
5993 && (flags
& (GOVD_SEEN
| GOVD_LOCAL
)) == GOVD_SEEN
5995 && TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
5998 tree t
= DECL_VALUE_EXPR (decl
);
5999 gcc_assert (TREE_CODE (t
) == INDIRECT_REF
);
6000 t
= TREE_OPERAND (t
, 0);
6001 gcc_assert (DECL_P (t
));
6002 n2
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) t
);
6003 n2
->value
|= GOVD_SEEN
;
6006 shared
= ((flags
| n
->value
) & GOVD_SHARED
) != 0;
6007 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
6009 /* If nothing changed, there's nothing left to do. */
6010 if ((n
->value
& flags
) == flags
)
6016 /* If the variable is private in the current context, then we don't
6017 need to propagate anything to an outer context. */
6018 if ((flags
& GOVD_PRIVATE
) && !(flags
& GOVD_PRIVATE_OUTER_REF
))
6020 if (ctx
->outer_context
6021 && omp_notice_variable (ctx
->outer_context
, decl
, in_code
))
6026 /* Verify that DECL is private within CTX. If there's specific information
6027 to the contrary in the innermost scope, generate an error. */
6030 omp_is_private (struct gimplify_omp_ctx
*ctx
, tree decl
)
6034 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
6037 if (n
->value
& GOVD_SHARED
)
6039 if (ctx
== gimplify_omp_ctxp
)
6041 error ("iteration variable %qE should be private",
6043 n
->value
= GOVD_PRIVATE
;
6049 else if ((n
->value
& GOVD_EXPLICIT
) != 0
6050 && (ctx
== gimplify_omp_ctxp
6051 || (ctx
->region_type
== ORT_COMBINED_PARALLEL
6052 && gimplify_omp_ctxp
->outer_context
== ctx
)))
6054 if ((n
->value
& GOVD_FIRSTPRIVATE
) != 0)
6055 error ("iteration variable %qE should not be firstprivate",
6057 else if ((n
->value
& GOVD_REDUCTION
) != 0)
6058 error ("iteration variable %qE should not be reduction",
6061 return (ctx
== gimplify_omp_ctxp
6062 || (ctx
->region_type
== ORT_COMBINED_PARALLEL
6063 && gimplify_omp_ctxp
->outer_context
== ctx
));
6066 if (ctx
->region_type
!= ORT_WORKSHARE
)
6068 else if (ctx
->outer_context
)
6069 return omp_is_private (ctx
->outer_context
, decl
);
6073 /* Return true if DECL is private within a parallel region
6074 that binds to the current construct's context or in parallel
6075 region's REDUCTION clause. */
6078 omp_check_private (struct gimplify_omp_ctx
*ctx
, tree decl
)
6084 ctx
= ctx
->outer_context
;
6086 return !(is_global_var (decl
)
6087 /* References might be private, but might be shared too. */
6088 || lang_hooks
.decls
.omp_privatize_by_reference (decl
));
6090 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
6092 return (n
->value
& GOVD_SHARED
) == 0;
6094 while (ctx
->region_type
== ORT_WORKSHARE
);
6098 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
6099 and previous omp contexts. */
6102 gimplify_scan_omp_clauses (tree
*list_p
, gimple_seq
*pre_p
,
6103 enum omp_region_type region_type
)
6105 struct gimplify_omp_ctx
*ctx
, *outer_ctx
;
6106 struct gimplify_ctx gctx
;
6109 ctx
= new_omp_context (region_type
);
6110 outer_ctx
= ctx
->outer_context
;
6112 while ((c
= *list_p
) != NULL
)
6114 bool remove
= false;
6115 bool notice_outer
= true;
6116 const char *check_non_private
= NULL
;
6120 switch (OMP_CLAUSE_CODE (c
))
6122 case OMP_CLAUSE_PRIVATE
:
6123 flags
= GOVD_PRIVATE
| GOVD_EXPLICIT
;
6124 if (lang_hooks
.decls
.omp_private_outer_ref (OMP_CLAUSE_DECL (c
)))
6126 flags
|= GOVD_PRIVATE_OUTER_REF
;
6127 OMP_CLAUSE_PRIVATE_OUTER_REF (c
) = 1;
6130 notice_outer
= false;
6132 case OMP_CLAUSE_SHARED
:
6133 flags
= GOVD_SHARED
| GOVD_EXPLICIT
;
6135 case OMP_CLAUSE_FIRSTPRIVATE
:
6136 flags
= GOVD_FIRSTPRIVATE
| GOVD_EXPLICIT
;
6137 check_non_private
= "firstprivate";
6139 case OMP_CLAUSE_LASTPRIVATE
:
6140 flags
= GOVD_LASTPRIVATE
| GOVD_SEEN
| GOVD_EXPLICIT
;
6141 check_non_private
= "lastprivate";
6143 case OMP_CLAUSE_REDUCTION
:
6144 flags
= GOVD_REDUCTION
| GOVD_SEEN
| GOVD_EXPLICIT
;
6145 check_non_private
= "reduction";
6149 decl
= OMP_CLAUSE_DECL (c
);
6150 if (error_operand_p (decl
))
6155 omp_add_variable (ctx
, decl
, flags
);
6156 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
6157 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
))
6159 omp_add_variable (ctx
, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
),
6160 GOVD_LOCAL
| GOVD_SEEN
);
6161 gimplify_omp_ctxp
= ctx
;
6162 push_gimplify_context (&gctx
);
6164 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c
) = NULL
;
6165 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c
) = NULL
;
6167 gimplify_and_add (OMP_CLAUSE_REDUCTION_INIT (c
),
6168 &OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c
));
6169 pop_gimplify_context
6170 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c
)));
6171 push_gimplify_context (&gctx
);
6172 gimplify_and_add (OMP_CLAUSE_REDUCTION_MERGE (c
),
6173 &OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c
));
6174 pop_gimplify_context
6175 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c
)));
6176 OMP_CLAUSE_REDUCTION_INIT (c
) = NULL_TREE
;
6177 OMP_CLAUSE_REDUCTION_MERGE (c
) = NULL_TREE
;
6179 gimplify_omp_ctxp
= outer_ctx
;
6181 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
6182 && OMP_CLAUSE_LASTPRIVATE_STMT (c
))
6184 gimplify_omp_ctxp
= ctx
;
6185 push_gimplify_context (&gctx
);
6186 if (TREE_CODE (OMP_CLAUSE_LASTPRIVATE_STMT (c
)) != BIND_EXPR
)
6188 tree bind
= build3 (BIND_EXPR
, void_type_node
, NULL
,
6190 TREE_SIDE_EFFECTS (bind
) = 1;
6191 BIND_EXPR_BODY (bind
) = OMP_CLAUSE_LASTPRIVATE_STMT (c
);
6192 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = bind
;
6194 gimplify_and_add (OMP_CLAUSE_LASTPRIVATE_STMT (c
),
6195 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
));
6196 pop_gimplify_context
6197 (gimple_seq_first_stmt (OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
)));
6198 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = NULL_TREE
;
6200 gimplify_omp_ctxp
= outer_ctx
;
6206 case OMP_CLAUSE_COPYIN
:
6207 case OMP_CLAUSE_COPYPRIVATE
:
6208 decl
= OMP_CLAUSE_DECL (c
);
6209 if (error_operand_p (decl
))
6216 omp_notice_variable (outer_ctx
, decl
, true);
6217 if (check_non_private
6218 && region_type
== ORT_WORKSHARE
6219 && omp_check_private (ctx
, decl
))
6221 error ("%s variable %qE is private in outer context",
6222 check_non_private
, DECL_NAME (decl
));
6227 case OMP_CLAUSE_FINAL
:
6229 OMP_CLAUSE_OPERAND (c
, 0)
6230 = gimple_boolify (OMP_CLAUSE_OPERAND (c
, 0));
6233 case OMP_CLAUSE_SCHEDULE
:
6234 case OMP_CLAUSE_NUM_THREADS
:
6235 if (gimplify_expr (&OMP_CLAUSE_OPERAND (c
, 0), pre_p
, NULL
,
6236 is_gimple_val
, fb_rvalue
) == GS_ERROR
)
6240 case OMP_CLAUSE_NOWAIT
:
6241 case OMP_CLAUSE_ORDERED
:
6242 case OMP_CLAUSE_UNTIED
:
6243 case OMP_CLAUSE_COLLAPSE
:
6244 case OMP_CLAUSE_MERGEABLE
:
6247 case OMP_CLAUSE_DEFAULT
:
6248 ctx
->default_kind
= OMP_CLAUSE_DEFAULT_KIND (c
);
6256 *list_p
= OMP_CLAUSE_CHAIN (c
);
6258 list_p
= &OMP_CLAUSE_CHAIN (c
);
6261 gimplify_omp_ctxp
= ctx
;
6264 /* For all variables that were not actually used within the context,
6265 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
6268 gimplify_adjust_omp_clauses_1 (splay_tree_node n
, void *data
)
6270 tree
*list_p
= (tree
*) data
;
6271 tree decl
= (tree
) n
->key
;
6272 unsigned flags
= n
->value
;
6273 enum omp_clause_code code
;
6277 if (flags
& (GOVD_EXPLICIT
| GOVD_LOCAL
))
6279 if ((flags
& GOVD_SEEN
) == 0)
6281 if (flags
& GOVD_DEBUG_PRIVATE
)
6283 gcc_assert ((flags
& GOVD_DATA_SHARE_CLASS
) == GOVD_PRIVATE
);
6284 private_debug
= true;
6288 = lang_hooks
.decls
.omp_private_debug_clause (decl
,
6289 !!(flags
& GOVD_SHARED
));
6291 code
= OMP_CLAUSE_PRIVATE
;
6292 else if (flags
& GOVD_SHARED
)
6294 if (is_global_var (decl
))
6296 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
->outer_context
;
6300 = splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
6301 if (on
&& (on
->value
& (GOVD_FIRSTPRIVATE
| GOVD_LASTPRIVATE
6302 | GOVD_PRIVATE
| GOVD_REDUCTION
)) != 0)
6304 ctx
= ctx
->outer_context
;
6309 code
= OMP_CLAUSE_SHARED
;
6311 else if (flags
& GOVD_PRIVATE
)
6312 code
= OMP_CLAUSE_PRIVATE
;
6313 else if (flags
& GOVD_FIRSTPRIVATE
)
6314 code
= OMP_CLAUSE_FIRSTPRIVATE
;
6318 clause
= build_omp_clause (input_location
, code
);
6319 OMP_CLAUSE_DECL (clause
) = decl
;
6320 OMP_CLAUSE_CHAIN (clause
) = *list_p
;
6322 OMP_CLAUSE_PRIVATE_DEBUG (clause
) = 1;
6323 else if (code
== OMP_CLAUSE_PRIVATE
&& (flags
& GOVD_PRIVATE_OUTER_REF
))
6324 OMP_CLAUSE_PRIVATE_OUTER_REF (clause
) = 1;
6326 lang_hooks
.decls
.omp_finish_clause (clause
);
6332 gimplify_adjust_omp_clauses (tree
*list_p
)
6334 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
6337 while ((c
= *list_p
) != NULL
)
6340 bool remove
= false;
6342 switch (OMP_CLAUSE_CODE (c
))
6344 case OMP_CLAUSE_PRIVATE
:
6345 case OMP_CLAUSE_SHARED
:
6346 case OMP_CLAUSE_FIRSTPRIVATE
:
6347 decl
= OMP_CLAUSE_DECL (c
);
6348 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
6349 remove
= !(n
->value
& GOVD_SEEN
);
6352 bool shared
= OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_SHARED
;
6353 if ((n
->value
& GOVD_DEBUG_PRIVATE
)
6354 || lang_hooks
.decls
.omp_private_debug_clause (decl
, shared
))
6356 gcc_assert ((n
->value
& GOVD_DEBUG_PRIVATE
) == 0
6357 || ((n
->value
& GOVD_DATA_SHARE_CLASS
)
6359 OMP_CLAUSE_SET_CODE (c
, OMP_CLAUSE_PRIVATE
);
6360 OMP_CLAUSE_PRIVATE_DEBUG (c
) = 1;
6365 case OMP_CLAUSE_LASTPRIVATE
:
6366 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
6367 accurately reflect the presence of a FIRSTPRIVATE clause. */
6368 decl
= OMP_CLAUSE_DECL (c
);
6369 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
6370 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c
)
6371 = (n
->value
& GOVD_FIRSTPRIVATE
) != 0;
6374 case OMP_CLAUSE_REDUCTION
:
6375 case OMP_CLAUSE_COPYIN
:
6376 case OMP_CLAUSE_COPYPRIVATE
:
6378 case OMP_CLAUSE_NUM_THREADS
:
6379 case OMP_CLAUSE_SCHEDULE
:
6380 case OMP_CLAUSE_NOWAIT
:
6381 case OMP_CLAUSE_ORDERED
:
6382 case OMP_CLAUSE_DEFAULT
:
6383 case OMP_CLAUSE_UNTIED
:
6384 case OMP_CLAUSE_COLLAPSE
:
6385 case OMP_CLAUSE_FINAL
:
6386 case OMP_CLAUSE_MERGEABLE
:
6394 *list_p
= OMP_CLAUSE_CHAIN (c
);
6396 list_p
= &OMP_CLAUSE_CHAIN (c
);
6399 /* Add in any implicit data sharing. */
6400 splay_tree_foreach (ctx
->variables
, gimplify_adjust_omp_clauses_1
, list_p
);
6402 gimplify_omp_ctxp
= ctx
->outer_context
;
6403 delete_omp_context (ctx
);
6406 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
6407 gimplification of the body, as well as scanning the body for used
6408 variables. We need to do this scan now, because variable-sized
6409 decls will be decomposed during gimplification. */
6412 gimplify_omp_parallel (tree
*expr_p
, gimple_seq
*pre_p
)
6414 tree expr
= *expr_p
;
6416 gimple_seq body
= NULL
;
6417 struct gimplify_ctx gctx
;
6419 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
), pre_p
,
6420 OMP_PARALLEL_COMBINED (expr
)
6421 ? ORT_COMBINED_PARALLEL
6424 push_gimplify_context (&gctx
);
6426 g
= gimplify_and_return_first (OMP_PARALLEL_BODY (expr
), &body
);
6427 if (gimple_code (g
) == GIMPLE_BIND
)
6428 pop_gimplify_context (g
);
6430 pop_gimplify_context (NULL
);
6432 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
));
6434 g
= gimple_build_omp_parallel (body
,
6435 OMP_PARALLEL_CLAUSES (expr
),
6436 NULL_TREE
, NULL_TREE
);
6437 if (OMP_PARALLEL_COMBINED (expr
))
6438 gimple_omp_set_subcode (g
, GF_OMP_PARALLEL_COMBINED
);
6439 gimplify_seq_add_stmt (pre_p
, g
);
6440 *expr_p
= NULL_TREE
;
6443 /* Gimplify the contents of an OMP_TASK statement. This involves
6444 gimplification of the body, as well as scanning the body for used
6445 variables. We need to do this scan now, because variable-sized
6446 decls will be decomposed during gimplification. */
6449 gimplify_omp_task (tree
*expr_p
, gimple_seq
*pre_p
)
6451 tree expr
= *expr_p
;
6453 gimple_seq body
= NULL
;
6454 struct gimplify_ctx gctx
;
6456 gimplify_scan_omp_clauses (&OMP_TASK_CLAUSES (expr
), pre_p
,
6457 find_omp_clause (OMP_TASK_CLAUSES (expr
),
6459 ? ORT_UNTIED_TASK
: ORT_TASK
);
6461 push_gimplify_context (&gctx
);
6463 g
= gimplify_and_return_first (OMP_TASK_BODY (expr
), &body
);
6464 if (gimple_code (g
) == GIMPLE_BIND
)
6465 pop_gimplify_context (g
);
6467 pop_gimplify_context (NULL
);
6469 gimplify_adjust_omp_clauses (&OMP_TASK_CLAUSES (expr
));
6471 g
= gimple_build_omp_task (body
,
6472 OMP_TASK_CLAUSES (expr
),
6473 NULL_TREE
, NULL_TREE
,
6474 NULL_TREE
, NULL_TREE
, NULL_TREE
);
6475 gimplify_seq_add_stmt (pre_p
, g
);
6476 *expr_p
= NULL_TREE
;
6479 /* Gimplify the gross structure of an OMP_FOR statement. */
6481 static enum gimplify_status
6482 gimplify_omp_for (tree
*expr_p
, gimple_seq
*pre_p
)
6484 tree for_stmt
, decl
, var
, t
;
6485 enum gimplify_status ret
= GS_ALL_DONE
;
6486 enum gimplify_status tret
;
6488 gimple_seq for_body
, for_pre_body
;
6493 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
), pre_p
,
6496 /* Handle OMP_FOR_INIT. */
6497 for_pre_body
= NULL
;
6498 gimplify_and_add (OMP_FOR_PRE_BODY (for_stmt
), &for_pre_body
);
6499 OMP_FOR_PRE_BODY (for_stmt
) = NULL_TREE
;
6502 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
))
6503 == TREE_VEC_LENGTH (OMP_FOR_COND (for_stmt
)));
6504 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
))
6505 == TREE_VEC_LENGTH (OMP_FOR_INCR (for_stmt
)));
6506 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)); i
++)
6508 t
= TREE_VEC_ELT (OMP_FOR_INIT (for_stmt
), i
);
6509 gcc_assert (TREE_CODE (t
) == MODIFY_EXPR
);
6510 decl
= TREE_OPERAND (t
, 0);
6511 gcc_assert (DECL_P (decl
));
6512 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl
))
6513 || POINTER_TYPE_P (TREE_TYPE (decl
)));
6515 /* Make sure the iteration variable is private. */
6516 if (omp_is_private (gimplify_omp_ctxp
, decl
))
6517 omp_notice_variable (gimplify_omp_ctxp
, decl
, true);
6519 omp_add_variable (gimplify_omp_ctxp
, decl
, GOVD_PRIVATE
| GOVD_SEEN
);
6521 /* If DECL is not a gimple register, create a temporary variable to act
6522 as an iteration counter. This is valid, since DECL cannot be
6523 modified in the body of the loop. */
6524 if (!is_gimple_reg (decl
))
6526 var
= create_tmp_var (TREE_TYPE (decl
), get_name (decl
));
6527 TREE_OPERAND (t
, 0) = var
;
6529 gimplify_seq_add_stmt (&for_body
, gimple_build_assign (decl
, var
));
6531 omp_add_variable (gimplify_omp_ctxp
, var
, GOVD_PRIVATE
| GOVD_SEEN
);
6536 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), &for_pre_body
, NULL
,
6537 is_gimple_val
, fb_rvalue
);
6538 ret
= MIN (ret
, tret
);
6539 if (ret
== GS_ERROR
)
6542 /* Handle OMP_FOR_COND. */
6543 t
= TREE_VEC_ELT (OMP_FOR_COND (for_stmt
), i
);
6544 gcc_assert (COMPARISON_CLASS_P (t
));
6545 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
6547 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), &for_pre_body
, NULL
,
6548 is_gimple_val
, fb_rvalue
);
6549 ret
= MIN (ret
, tret
);
6551 /* Handle OMP_FOR_INCR. */
6552 t
= TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
);
6553 switch (TREE_CODE (t
))
6555 case PREINCREMENT_EXPR
:
6556 case POSTINCREMENT_EXPR
:
6557 t
= build_int_cst (TREE_TYPE (decl
), 1);
6558 t
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), var
, t
);
6559 t
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, t
);
6560 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
) = t
;
6563 case PREDECREMENT_EXPR
:
6564 case POSTDECREMENT_EXPR
:
6565 t
= build_int_cst (TREE_TYPE (decl
), -1);
6566 t
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), var
, t
);
6567 t
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, t
);
6568 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
) = t
;
6572 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
6573 TREE_OPERAND (t
, 0) = var
;
6575 t
= TREE_OPERAND (t
, 1);
6576 switch (TREE_CODE (t
))
6579 if (TREE_OPERAND (t
, 1) == decl
)
6581 TREE_OPERAND (t
, 1) = TREE_OPERAND (t
, 0);
6582 TREE_OPERAND (t
, 0) = var
;
6588 case POINTER_PLUS_EXPR
:
6589 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
6590 TREE_OPERAND (t
, 0) = var
;
6596 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), &for_pre_body
, NULL
,
6597 is_gimple_val
, fb_rvalue
);
6598 ret
= MIN (ret
, tret
);
6605 if (var
!= decl
|| TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)) > 1)
6608 for (c
= OMP_FOR_CLAUSES (for_stmt
); c
; c
= OMP_CLAUSE_CHAIN (c
))
6609 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
6610 && OMP_CLAUSE_DECL (c
) == decl
6611 && OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
) == NULL
)
6613 t
= TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
);
6614 gcc_assert (TREE_CODE (t
) == MODIFY_EXPR
);
6615 gcc_assert (TREE_OPERAND (t
, 0) == var
);
6616 t
= TREE_OPERAND (t
, 1);
6617 gcc_assert (TREE_CODE (t
) == PLUS_EXPR
6618 || TREE_CODE (t
) == MINUS_EXPR
6619 || TREE_CODE (t
) == POINTER_PLUS_EXPR
);
6620 gcc_assert (TREE_OPERAND (t
, 0) == var
);
6621 t
= build2 (TREE_CODE (t
), TREE_TYPE (decl
), decl
,
6622 TREE_OPERAND (t
, 1));
6623 gimplify_assign (decl
, t
,
6624 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
));
6629 gimplify_and_add (OMP_FOR_BODY (for_stmt
), &for_body
);
6631 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
));
6633 gfor
= gimple_build_omp_for (for_body
, OMP_FOR_CLAUSES (for_stmt
),
6634 TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)),
6637 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)); i
++)
6639 t
= TREE_VEC_ELT (OMP_FOR_INIT (for_stmt
), i
);
6640 gimple_omp_for_set_index (gfor
, i
, TREE_OPERAND (t
, 0));
6641 gimple_omp_for_set_initial (gfor
, i
, TREE_OPERAND (t
, 1));
6642 t
= TREE_VEC_ELT (OMP_FOR_COND (for_stmt
), i
);
6643 gimple_omp_for_set_cond (gfor
, i
, TREE_CODE (t
));
6644 gimple_omp_for_set_final (gfor
, i
, TREE_OPERAND (t
, 1));
6645 t
= TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
);
6646 gimple_omp_for_set_incr (gfor
, i
, TREE_OPERAND (t
, 1));
6649 gimplify_seq_add_stmt (pre_p
, gfor
);
6650 return ret
== GS_ALL_DONE
? GS_ALL_DONE
: GS_ERROR
;
6653 /* Gimplify the gross structure of other OpenMP worksharing constructs.
6654 In particular, OMP_SECTIONS and OMP_SINGLE. */
6657 gimplify_omp_workshare (tree
*expr_p
, gimple_seq
*pre_p
)
6659 tree expr
= *expr_p
;
6661 gimple_seq body
= NULL
;
6663 gimplify_scan_omp_clauses (&OMP_CLAUSES (expr
), pre_p
, ORT_WORKSHARE
);
6664 gimplify_and_add (OMP_BODY (expr
), &body
);
6665 gimplify_adjust_omp_clauses (&OMP_CLAUSES (expr
));
6667 if (TREE_CODE (expr
) == OMP_SECTIONS
)
6668 stmt
= gimple_build_omp_sections (body
, OMP_CLAUSES (expr
));
6669 else if (TREE_CODE (expr
) == OMP_SINGLE
)
6670 stmt
= gimple_build_omp_single (body
, OMP_CLAUSES (expr
));
6674 gimplify_seq_add_stmt (pre_p
, stmt
);
6677 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
6678 stabilized the lhs of the atomic operation as *ADDR. Return true if
6679 EXPR is this stabilized form. */
6682 goa_lhs_expr_p (tree expr
, tree addr
)
6684 /* Also include casts to other type variants. The C front end is fond
6685 of adding these for e.g. volatile variables. This is like
6686 STRIP_TYPE_NOPS but includes the main variant lookup. */
6687 STRIP_USELESS_TYPE_CONVERSION (expr
);
6689 if (TREE_CODE (expr
) == INDIRECT_REF
)
6691 expr
= TREE_OPERAND (expr
, 0);
6693 && (CONVERT_EXPR_P (expr
)
6694 || TREE_CODE (expr
) == NON_LVALUE_EXPR
)
6695 && TREE_CODE (expr
) == TREE_CODE (addr
)
6696 && types_compatible_p (TREE_TYPE (expr
), TREE_TYPE (addr
)))
6698 expr
= TREE_OPERAND (expr
, 0);
6699 addr
= TREE_OPERAND (addr
, 0);
6703 return (TREE_CODE (addr
) == ADDR_EXPR
6704 && TREE_CODE (expr
) == ADDR_EXPR
6705 && TREE_OPERAND (addr
, 0) == TREE_OPERAND (expr
, 0));
6707 if (TREE_CODE (addr
) == ADDR_EXPR
&& expr
== TREE_OPERAND (addr
, 0))
6712 /* Walk *EXPR_P and replace appearances of *LHS_ADDR with LHS_VAR. If an
6713 expression does not involve the lhs, evaluate it into a temporary.
6714 Return 1 if the lhs appeared as a subexpression, 0 if it did not,
6715 or -1 if an error was encountered. */
6718 goa_stabilize_expr (tree
*expr_p
, gimple_seq
*pre_p
, tree lhs_addr
,
6721 tree expr
= *expr_p
;
6724 if (goa_lhs_expr_p (expr
, lhs_addr
))
6729 if (is_gimple_val (expr
))
6733 switch (TREE_CODE_CLASS (TREE_CODE (expr
)))
6736 case tcc_comparison
:
6737 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 1), pre_p
, lhs_addr
,
6740 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 0), pre_p
, lhs_addr
,
6743 case tcc_expression
:
6744 switch (TREE_CODE (expr
))
6746 case TRUTH_ANDIF_EXPR
:
6747 case TRUTH_ORIF_EXPR
:
6748 case TRUTH_AND_EXPR
:
6750 case TRUTH_XOR_EXPR
:
6751 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 1), pre_p
,
6753 case TRUTH_NOT_EXPR
:
6754 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 0), pre_p
,
6758 /* Break out any preevaluations from cp_build_modify_expr. */
6759 for (; TREE_CODE (expr
) == COMPOUND_EXPR
;
6760 expr
= TREE_OPERAND (expr
, 1))
6761 gimplify_stmt (&TREE_OPERAND (expr
, 0), pre_p
);
6763 return goa_stabilize_expr (expr_p
, pre_p
, lhs_addr
, lhs_var
);
6774 enum gimplify_status gs
;
6775 gs
= gimplify_expr (expr_p
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
);
6776 if (gs
!= GS_ALL_DONE
)
6783 /* Gimplify an OMP_ATOMIC statement. */
6785 static enum gimplify_status
6786 gimplify_omp_atomic (tree
*expr_p
, gimple_seq
*pre_p
)
6788 tree addr
= TREE_OPERAND (*expr_p
, 0);
6789 tree rhs
= TREE_CODE (*expr_p
) == OMP_ATOMIC_READ
6790 ? NULL
: TREE_OPERAND (*expr_p
, 1);
6791 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr
)));
6793 gimple loadstmt
, storestmt
;
6795 tmp_load
= create_tmp_reg (type
, NULL
);
6796 if (rhs
&& goa_stabilize_expr (&rhs
, pre_p
, addr
, tmp_load
) < 0)
6799 if (gimplify_expr (&addr
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
)
6803 loadstmt
= gimple_build_omp_atomic_load (tmp_load
, addr
);
6804 gimplify_seq_add_stmt (pre_p
, loadstmt
);
6805 if (rhs
&& gimplify_expr (&rhs
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
)
6809 if (TREE_CODE (*expr_p
) == OMP_ATOMIC_READ
)
6811 storestmt
= gimple_build_omp_atomic_store (rhs
);
6812 gimplify_seq_add_stmt (pre_p
, storestmt
);
6813 switch (TREE_CODE (*expr_p
))
6815 case OMP_ATOMIC_READ
:
6816 case OMP_ATOMIC_CAPTURE_OLD
:
6818 gimple_omp_atomic_set_need_value (loadstmt
);
6820 case OMP_ATOMIC_CAPTURE_NEW
:
6822 gimple_omp_atomic_set_need_value (storestmt
);
6832 /* Gimplify a TRANSACTION_EXPR. This involves gimplification of the
6833 body, and adding some EH bits. */
6835 static enum gimplify_status
6836 gimplify_transaction (tree
*expr_p
, gimple_seq
*pre_p
)
6838 tree expr
= *expr_p
, temp
, tbody
= TRANSACTION_EXPR_BODY (expr
);
6840 gimple_seq body
= NULL
;
6841 struct gimplify_ctx gctx
;
6844 /* Wrap the transaction body in a BIND_EXPR so we have a context
6845 where to put decls for OpenMP. */
6846 if (TREE_CODE (tbody
) != BIND_EXPR
)
6848 tree bind
= build3 (BIND_EXPR
, void_type_node
, NULL
, tbody
, NULL
);
6849 TREE_SIDE_EFFECTS (bind
) = 1;
6850 SET_EXPR_LOCATION (bind
, EXPR_LOCATION (tbody
));
6851 TRANSACTION_EXPR_BODY (expr
) = bind
;
6854 push_gimplify_context (&gctx
);
6855 temp
= voidify_wrapper_expr (*expr_p
, NULL
);
6857 g
= gimplify_and_return_first (TRANSACTION_EXPR_BODY (expr
), &body
);
6858 pop_gimplify_context (g
);
6860 g
= gimple_build_transaction (body
, NULL
);
6861 if (TRANSACTION_EXPR_OUTER (expr
))
6862 subcode
= GTMA_IS_OUTER
;
6863 else if (TRANSACTION_EXPR_RELAXED (expr
))
6864 subcode
= GTMA_IS_RELAXED
;
6865 gimple_transaction_set_subcode (g
, subcode
);
6867 gimplify_seq_add_stmt (pre_p
, g
);
6875 *expr_p
= NULL_TREE
;
6879 /* Convert the GENERIC expression tree *EXPR_P to GIMPLE. If the
6880 expression produces a value to be used as an operand inside a GIMPLE
6881 statement, the value will be stored back in *EXPR_P. This value will
6882 be a tree of class tcc_declaration, tcc_constant, tcc_reference or
6883 an SSA_NAME. The corresponding sequence of GIMPLE statements is
6884 emitted in PRE_P and POST_P.
6886 Additionally, this process may overwrite parts of the input
6887 expression during gimplification. Ideally, it should be
6888 possible to do non-destructive gimplification.
6890 EXPR_P points to the GENERIC expression to convert to GIMPLE. If
6891 the expression needs to evaluate to a value to be used as
6892 an operand in a GIMPLE statement, this value will be stored in
6893 *EXPR_P on exit. This happens when the caller specifies one
6894 of fb_lvalue or fb_rvalue fallback flags.
6896 PRE_P will contain the sequence of GIMPLE statements corresponding
6897 to the evaluation of EXPR and all the side-effects that must
6898 be executed before the main expression. On exit, the last
6899 statement of PRE_P is the core statement being gimplified. For
6900 instance, when gimplifying 'if (++a)' the last statement in
6901 PRE_P will be 'if (t.1)' where t.1 is the result of
6902 pre-incrementing 'a'.
6904 POST_P will contain the sequence of GIMPLE statements corresponding
6905 to the evaluation of all the side-effects that must be executed
6906 after the main expression. If this is NULL, the post
6907 side-effects are stored at the end of PRE_P.
6909 The reason why the output is split in two is to handle post
6910 side-effects explicitly. In some cases, an expression may have
6911 inner and outer post side-effects which need to be emitted in
6912 an order different from the one given by the recursive
6913 traversal. For instance, for the expression (*p--)++ the post
6914 side-effects of '--' must actually occur *after* the post
6915 side-effects of '++'. However, gimplification will first visit
6916 the inner expression, so if a separate POST sequence was not
6917 used, the resulting sequence would be:
6924 However, the post-decrement operation in line #2 must not be
6925 evaluated until after the store to *p at line #4, so the
6926 correct sequence should be:
6933 So, by specifying a separate post queue, it is possible
6934 to emit the post side-effects in the correct order.
6935 If POST_P is NULL, an internal queue will be used. Before
6936 returning to the caller, the sequence POST_P is appended to
6937 the main output sequence PRE_P.
6939 GIMPLE_TEST_F points to a function that takes a tree T and
6940 returns nonzero if T is in the GIMPLE form requested by the
6941 caller. The GIMPLE predicates are in gimple.c.
6943 FALLBACK tells the function what sort of a temporary we want if
6944 gimplification cannot produce an expression that complies with
6947 fb_none means that no temporary should be generated
6948 fb_rvalue means that an rvalue is OK to generate
6949 fb_lvalue means that an lvalue is OK to generate
6950 fb_either means that either is OK, but an lvalue is preferable.
6951 fb_mayfail means that gimplification may fail (in which case
6952 GS_ERROR will be returned)
6954 The return value is either GS_ERROR or GS_ALL_DONE, since this
6955 function iterates until EXPR is completely gimplified or an error
6958 enum gimplify_status
6959 gimplify_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
6960 bool (*gimple_test_f
) (tree
), fallback_t fallback
)
6963 gimple_seq internal_pre
= NULL
;
6964 gimple_seq internal_post
= NULL
;
6967 location_t saved_location
;
6968 enum gimplify_status ret
;
6969 gimple_stmt_iterator pre_last_gsi
, post_last_gsi
;
6971 save_expr
= *expr_p
;
6972 if (save_expr
== NULL_TREE
)
6975 /* If we are gimplifying a top-level statement, PRE_P must be valid. */
6976 is_statement
= gimple_test_f
== is_gimple_stmt
;
6980 /* Consistency checks. */
6981 if (gimple_test_f
== is_gimple_reg
)
6982 gcc_assert (fallback
& (fb_rvalue
| fb_lvalue
));
6983 else if (gimple_test_f
== is_gimple_val
6984 || gimple_test_f
== is_gimple_call_addr
6985 || gimple_test_f
== is_gimple_condexpr
6986 || gimple_test_f
== is_gimple_mem_rhs
6987 || gimple_test_f
== is_gimple_mem_rhs_or_call
6988 || gimple_test_f
== is_gimple_reg_rhs
6989 || gimple_test_f
== is_gimple_reg_rhs_or_call
6990 || gimple_test_f
== is_gimple_asm_val
6991 || gimple_test_f
== is_gimple_mem_ref_addr
)
6992 gcc_assert (fallback
& fb_rvalue
);
6993 else if (gimple_test_f
== is_gimple_min_lval
6994 || gimple_test_f
== is_gimple_lvalue
)
6995 gcc_assert (fallback
& fb_lvalue
);
6996 else if (gimple_test_f
== is_gimple_addressable
)
6997 gcc_assert (fallback
& fb_either
);
6998 else if (gimple_test_f
== is_gimple_stmt
)
6999 gcc_assert (fallback
== fb_none
);
7002 /* We should have recognized the GIMPLE_TEST_F predicate to
7003 know what kind of fallback to use in case a temporary is
7004 needed to hold the value or address of *EXPR_P. */
7008 /* We used to check the predicate here and return immediately if it
7009 succeeds. This is wrong; the design is for gimplification to be
7010 idempotent, and for the predicates to only test for valid forms, not
7011 whether they are fully simplified. */
7013 pre_p
= &internal_pre
;
7016 post_p
= &internal_post
;
7018 /* Remember the last statements added to PRE_P and POST_P. Every
7019 new statement added by the gimplification helpers needs to be
7020 annotated with location information. To centralize the
7021 responsibility, we remember the last statement that had been
7022 added to both queues before gimplifying *EXPR_P. If
7023 gimplification produces new statements in PRE_P and POST_P, those
7024 statements will be annotated with the same location information
7026 pre_last_gsi
= gsi_last (*pre_p
);
7027 post_last_gsi
= gsi_last (*post_p
);
7029 saved_location
= input_location
;
7030 if (save_expr
!= error_mark_node
7031 && EXPR_HAS_LOCATION (*expr_p
))
7032 input_location
= EXPR_LOCATION (*expr_p
);
7034 /* Loop over the specific gimplifiers until the toplevel node
7035 remains the same. */
7038 /* Strip away as many useless type conversions as possible
7040 STRIP_USELESS_TYPE_CONVERSION (*expr_p
);
7042 /* Remember the expr. */
7043 save_expr
= *expr_p
;
7045 /* Die, die, die, my darling. */
7046 if (save_expr
== error_mark_node
7047 || (TREE_TYPE (save_expr
)
7048 && TREE_TYPE (save_expr
) == error_mark_node
))
7054 /* Do any language-specific gimplification. */
7055 ret
= ((enum gimplify_status
)
7056 lang_hooks
.gimplify_expr (expr_p
, pre_p
, post_p
));
7059 if (*expr_p
== NULL_TREE
)
7061 if (*expr_p
!= save_expr
)
7064 else if (ret
!= GS_UNHANDLED
)
7067 /* Make sure that all the cases set 'ret' appropriately. */
7069 switch (TREE_CODE (*expr_p
))
7071 /* First deal with the special cases. */
7073 case POSTINCREMENT_EXPR
:
7074 case POSTDECREMENT_EXPR
:
7075 case PREINCREMENT_EXPR
:
7076 case PREDECREMENT_EXPR
:
7077 ret
= gimplify_self_mod_expr (expr_p
, pre_p
, post_p
,
7078 fallback
!= fb_none
);
7082 case ARRAY_RANGE_REF
:
7086 case VIEW_CONVERT_EXPR
:
7087 ret
= gimplify_compound_lval (expr_p
, pre_p
, post_p
,
7088 fallback
? fallback
: fb_rvalue
);
7092 ret
= gimplify_cond_expr (expr_p
, pre_p
, fallback
);
7094 /* C99 code may assign to an array in a structure value of a
7095 conditional expression, and this has undefined behavior
7096 only on execution, so create a temporary if an lvalue is
7098 if (fallback
== fb_lvalue
)
7100 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
7101 mark_addressable (*expr_p
);
7107 ret
= gimplify_call_expr (expr_p
, pre_p
, fallback
!= fb_none
);
7109 /* C99 code may assign to an array in a structure returned
7110 from a function, and this has undefined behavior only on
7111 execution, so create a temporary if an lvalue is
7113 if (fallback
== fb_lvalue
)
7115 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
7116 mark_addressable (*expr_p
);
7125 ret
= gimplify_compound_expr (expr_p
, pre_p
, fallback
!= fb_none
);
7128 case COMPOUND_LITERAL_EXPR
:
7129 ret
= gimplify_compound_literal_expr (expr_p
, pre_p
,
7130 gimple_test_f
, fallback
);
7135 ret
= gimplify_modify_expr (expr_p
, pre_p
, post_p
,
7136 fallback
!= fb_none
);
7139 case TRUTH_ANDIF_EXPR
:
7140 case TRUTH_ORIF_EXPR
:
7142 /* Preserve the original type of the expression and the
7143 source location of the outer expression. */
7144 tree org_type
= TREE_TYPE (*expr_p
);
7145 *expr_p
= gimple_boolify (*expr_p
);
7146 *expr_p
= build3_loc (input_location
, COND_EXPR
,
7150 org_type
, boolean_true_node
),
7153 org_type
, boolean_false_node
));
7158 case TRUTH_NOT_EXPR
:
7160 tree type
= TREE_TYPE (*expr_p
);
7161 /* The parsers are careful to generate TRUTH_NOT_EXPR
7162 only with operands that are always zero or one.
7163 We do not fold here but handle the only interesting case
7164 manually, as fold may re-introduce the TRUTH_NOT_EXPR. */
7165 *expr_p
= gimple_boolify (*expr_p
);
7166 if (TYPE_PRECISION (TREE_TYPE (*expr_p
)) == 1)
7167 *expr_p
= build1_loc (input_location
, BIT_NOT_EXPR
,
7168 TREE_TYPE (*expr_p
),
7169 TREE_OPERAND (*expr_p
, 0));
7171 *expr_p
= build2_loc (input_location
, BIT_XOR_EXPR
,
7172 TREE_TYPE (*expr_p
),
7173 TREE_OPERAND (*expr_p
, 0),
7174 build_int_cst (TREE_TYPE (*expr_p
), 1));
7175 if (!useless_type_conversion_p (type
, TREE_TYPE (*expr_p
)))
7176 *expr_p
= fold_convert_loc (input_location
, type
, *expr_p
);
7182 ret
= gimplify_addr_expr (expr_p
, pre_p
, post_p
);
7186 ret
= gimplify_va_arg_expr (expr_p
, pre_p
, post_p
);
7190 if (IS_EMPTY_STMT (*expr_p
))
7196 if (VOID_TYPE_P (TREE_TYPE (*expr_p
))
7197 || fallback
== fb_none
)
7199 /* Just strip a conversion to void (or in void context) and
7201 *expr_p
= TREE_OPERAND (*expr_p
, 0);
7206 ret
= gimplify_conversion (expr_p
);
7207 if (ret
== GS_ERROR
)
7209 if (*expr_p
!= save_expr
)
7213 case FIX_TRUNC_EXPR
:
7214 /* unary_expr: ... | '(' cast ')' val | ... */
7215 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
7216 is_gimple_val
, fb_rvalue
);
7217 recalculate_side_effects (*expr_p
);
7222 bool volatilep
= TREE_THIS_VOLATILE (*expr_p
);
7223 bool notrap
= TREE_THIS_NOTRAP (*expr_p
);
7224 tree saved_ptr_type
= TREE_TYPE (TREE_OPERAND (*expr_p
, 0));
7226 *expr_p
= fold_indirect_ref_loc (input_location
, *expr_p
);
7227 if (*expr_p
!= save_expr
)
7233 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
7234 is_gimple_reg
, fb_rvalue
);
7235 if (ret
== GS_ERROR
)
7238 recalculate_side_effects (*expr_p
);
7239 *expr_p
= fold_build2_loc (input_location
, MEM_REF
,
7240 TREE_TYPE (*expr_p
),
7241 TREE_OPERAND (*expr_p
, 0),
7242 build_int_cst (saved_ptr_type
, 0));
7243 TREE_THIS_VOLATILE (*expr_p
) = volatilep
;
7244 TREE_THIS_NOTRAP (*expr_p
) = notrap
;
7249 /* We arrive here through the various re-gimplifcation paths. */
7251 /* First try re-folding the whole thing. */
7252 tmp
= fold_binary (MEM_REF
, TREE_TYPE (*expr_p
),
7253 TREE_OPERAND (*expr_p
, 0),
7254 TREE_OPERAND (*expr_p
, 1));
7258 recalculate_side_effects (*expr_p
);
7262 /* Avoid re-gimplifying the address operand if it is already
7263 in suitable form. Re-gimplifying would mark the address
7264 operand addressable. Always gimplify when not in SSA form
7265 as we still may have to gimplify decls with value-exprs. */
7266 if (!gimplify_ctxp
|| !gimplify_ctxp
->into_ssa
7267 || !is_gimple_mem_ref_addr (TREE_OPERAND (*expr_p
, 0)))
7269 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
7270 is_gimple_mem_ref_addr
, fb_rvalue
);
7271 if (ret
== GS_ERROR
)
7274 recalculate_side_effects (*expr_p
);
7278 /* Constants need not be gimplified. */
7289 /* If we require an lvalue, such as for ADDR_EXPR, retain the
7290 CONST_DECL node. Otherwise the decl is replaceable by its
7292 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
7293 if (fallback
& fb_lvalue
)
7297 *expr_p
= DECL_INITIAL (*expr_p
);
7303 ret
= gimplify_decl_expr (expr_p
, pre_p
);
7307 ret
= gimplify_bind_expr (expr_p
, pre_p
);
7311 ret
= gimplify_loop_expr (expr_p
, pre_p
);
7315 ret
= gimplify_switch_expr (expr_p
, pre_p
);
7319 ret
= gimplify_exit_expr (expr_p
);
7323 /* If the target is not LABEL, then it is a computed jump
7324 and the target needs to be gimplified. */
7325 if (TREE_CODE (GOTO_DESTINATION (*expr_p
)) != LABEL_DECL
)
7327 ret
= gimplify_expr (&GOTO_DESTINATION (*expr_p
), pre_p
,
7328 NULL
, is_gimple_val
, fb_rvalue
);
7329 if (ret
== GS_ERROR
)
7332 gimplify_seq_add_stmt (pre_p
,
7333 gimple_build_goto (GOTO_DESTINATION (*expr_p
)));
7338 gimplify_seq_add_stmt (pre_p
,
7339 gimple_build_predict (PREDICT_EXPR_PREDICTOR (*expr_p
),
7340 PREDICT_EXPR_OUTCOME (*expr_p
)));
7346 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p
))
7347 == current_function_decl
);
7348 gimplify_seq_add_stmt (pre_p
,
7349 gimple_build_label (LABEL_EXPR_LABEL (*expr_p
)));
7352 case CASE_LABEL_EXPR
:
7353 ret
= gimplify_case_label_expr (expr_p
, pre_p
);
7357 ret
= gimplify_return_expr (*expr_p
, pre_p
);
7361 /* Don't reduce this in place; let gimplify_init_constructor work its
7362 magic. Buf if we're just elaborating this for side effects, just
7363 gimplify any element that has side-effects. */
7364 if (fallback
== fb_none
)
7366 unsigned HOST_WIDE_INT ix
;
7368 tree temp
= NULL_TREE
;
7369 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (*expr_p
), ix
, val
)
7370 if (TREE_SIDE_EFFECTS (val
))
7371 append_to_statement_list (val
, &temp
);
7374 ret
= temp
? GS_OK
: GS_ALL_DONE
;
7376 /* C99 code may assign to an array in a constructed
7377 structure or union, and this has undefined behavior only
7378 on execution, so create a temporary if an lvalue is
7380 else if (fallback
== fb_lvalue
)
7382 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
7383 mark_addressable (*expr_p
);
7390 /* The following are special cases that are not handled by the
7391 original GIMPLE grammar. */
7393 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
7396 ret
= gimplify_save_expr (expr_p
, pre_p
, post_p
);
7400 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
7401 post_p
, is_gimple_lvalue
, fb_either
);
7402 recalculate_side_effects (*expr_p
);
7405 case TARGET_MEM_REF
:
7407 enum gimplify_status r0
= GS_ALL_DONE
, r1
= GS_ALL_DONE
;
7409 if (TMR_BASE (*expr_p
))
7410 r0
= gimplify_expr (&TMR_BASE (*expr_p
), pre_p
,
7411 post_p
, is_gimple_mem_ref_addr
, fb_either
);
7412 if (TMR_INDEX (*expr_p
))
7413 r1
= gimplify_expr (&TMR_INDEX (*expr_p
), pre_p
,
7414 post_p
, is_gimple_val
, fb_rvalue
);
7415 if (TMR_INDEX2 (*expr_p
))
7416 r1
= gimplify_expr (&TMR_INDEX2 (*expr_p
), pre_p
,
7417 post_p
, is_gimple_val
, fb_rvalue
);
7418 /* TMR_STEP and TMR_OFFSET are always integer constants. */
7423 case NON_LVALUE_EXPR
:
7424 /* This should have been stripped above. */
7428 ret
= gimplify_asm_expr (expr_p
, pre_p
, post_p
);
7431 case TRY_FINALLY_EXPR
:
7432 case TRY_CATCH_EXPR
:
7434 gimple_seq eval
, cleanup
;
7437 eval
= cleanup
= NULL
;
7438 gimplify_and_add (TREE_OPERAND (*expr_p
, 0), &eval
);
7439 gimplify_and_add (TREE_OPERAND (*expr_p
, 1), &cleanup
);
7440 /* Don't create bogus GIMPLE_TRY with empty cleanup. */
7441 if (gimple_seq_empty_p (cleanup
))
7443 gimple_seq_add_seq (pre_p
, eval
);
7447 try_
= gimple_build_try (eval
, cleanup
,
7448 TREE_CODE (*expr_p
) == TRY_FINALLY_EXPR
7449 ? GIMPLE_TRY_FINALLY
7450 : GIMPLE_TRY_CATCH
);
7451 if (TREE_CODE (*expr_p
) == TRY_CATCH_EXPR
)
7452 gimple_try_set_catch_is_cleanup (try_
,
7453 TRY_CATCH_IS_CLEANUP (*expr_p
));
7454 gimplify_seq_add_stmt (pre_p
, try_
);
7459 case CLEANUP_POINT_EXPR
:
7460 ret
= gimplify_cleanup_point_expr (expr_p
, pre_p
);
7464 ret
= gimplify_target_expr (expr_p
, pre_p
, post_p
);
7470 gimple_seq handler
= NULL
;
7471 gimplify_and_add (CATCH_BODY (*expr_p
), &handler
);
7472 c
= gimple_build_catch (CATCH_TYPES (*expr_p
), handler
);
7473 gimplify_seq_add_stmt (pre_p
, c
);
7478 case EH_FILTER_EXPR
:
7481 gimple_seq failure
= NULL
;
7483 gimplify_and_add (EH_FILTER_FAILURE (*expr_p
), &failure
);
7484 ehf
= gimple_build_eh_filter (EH_FILTER_TYPES (*expr_p
), failure
);
7485 gimple_set_no_warning (ehf
, TREE_NO_WARNING (*expr_p
));
7486 gimplify_seq_add_stmt (pre_p
, ehf
);
7493 enum gimplify_status r0
, r1
;
7494 r0
= gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p
), pre_p
,
7495 post_p
, is_gimple_val
, fb_rvalue
);
7496 r1
= gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p
), pre_p
,
7497 post_p
, is_gimple_val
, fb_rvalue
);
7498 TREE_SIDE_EFFECTS (*expr_p
) = 0;
7504 /* We get here when taking the address of a label. We mark
7505 the label as "forced"; meaning it can never be removed and
7506 it is a potential target for any computed goto. */
7507 FORCED_LABEL (*expr_p
) = 1;
7511 case STATEMENT_LIST
:
7512 ret
= gimplify_statement_list (expr_p
, pre_p
);
7515 case WITH_SIZE_EXPR
:
7517 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
7518 post_p
== &internal_post
? NULL
: post_p
,
7519 gimple_test_f
, fallback
);
7520 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
7521 is_gimple_val
, fb_rvalue
);
7528 ret
= gimplify_var_or_parm_decl (expr_p
);
7532 /* When within an OpenMP context, notice uses of variables. */
7533 if (gimplify_omp_ctxp
)
7534 omp_notice_variable (gimplify_omp_ctxp
, *expr_p
, true);
7539 /* Allow callbacks into the gimplifier during optimization. */
7544 gimplify_omp_parallel (expr_p
, pre_p
);
7549 gimplify_omp_task (expr_p
, pre_p
);
7554 ret
= gimplify_omp_for (expr_p
, pre_p
);
7559 gimplify_omp_workshare (expr_p
, pre_p
);
7568 gimple_seq body
= NULL
;
7571 gimplify_and_add (OMP_BODY (*expr_p
), &body
);
7572 switch (TREE_CODE (*expr_p
))
7575 g
= gimple_build_omp_section (body
);
7578 g
= gimple_build_omp_master (body
);
7581 g
= gimple_build_omp_ordered (body
);
7584 g
= gimple_build_omp_critical (body
,
7585 OMP_CRITICAL_NAME (*expr_p
));
7590 gimplify_seq_add_stmt (pre_p
, g
);
7596 case OMP_ATOMIC_READ
:
7597 case OMP_ATOMIC_CAPTURE_OLD
:
7598 case OMP_ATOMIC_CAPTURE_NEW
:
7599 ret
= gimplify_omp_atomic (expr_p
, pre_p
);
7602 case TRANSACTION_EXPR
:
7603 ret
= gimplify_transaction (expr_p
, pre_p
);
7606 case TRUTH_AND_EXPR
:
7608 case TRUTH_XOR_EXPR
:
7610 tree orig_type
= TREE_TYPE (*expr_p
);
7611 tree new_type
, xop0
, xop1
;
7612 *expr_p
= gimple_boolify (*expr_p
);
7613 new_type
= TREE_TYPE (*expr_p
);
7614 if (!useless_type_conversion_p (orig_type
, new_type
))
7616 *expr_p
= fold_convert_loc (input_location
, orig_type
, *expr_p
);
7621 /* Boolified binary truth expressions are semantically equivalent
7622 to bitwise binary expressions. Canonicalize them to the
7624 switch (TREE_CODE (*expr_p
))
7626 case TRUTH_AND_EXPR
:
7627 TREE_SET_CODE (*expr_p
, BIT_AND_EXPR
);
7630 TREE_SET_CODE (*expr_p
, BIT_IOR_EXPR
);
7632 case TRUTH_XOR_EXPR
:
7633 TREE_SET_CODE (*expr_p
, BIT_XOR_EXPR
);
7638 /* Now make sure that operands have compatible type to
7639 expression's new_type. */
7640 xop0
= TREE_OPERAND (*expr_p
, 0);
7641 xop1
= TREE_OPERAND (*expr_p
, 1);
7642 if (!useless_type_conversion_p (new_type
, TREE_TYPE (xop0
)))
7643 TREE_OPERAND (*expr_p
, 0) = fold_convert_loc (input_location
,
7646 if (!useless_type_conversion_p (new_type
, TREE_TYPE (xop1
)))
7647 TREE_OPERAND (*expr_p
, 1) = fold_convert_loc (input_location
,
7650 /* Continue classified as tcc_binary. */
7656 /* Classified as tcc_expression. */
7659 case POINTER_PLUS_EXPR
:
7661 enum gimplify_status r0
, r1
;
7662 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
7663 post_p
, is_gimple_val
, fb_rvalue
);
7664 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
,
7665 post_p
, is_gimple_val
, fb_rvalue
);
7666 recalculate_side_effects (*expr_p
);
7668 /* Convert &X + CST to invariant &MEM[&X, CST]. Do this
7669 after gimplifying operands - this is similar to how
7670 it would be folding all gimplified stmts on creation
7671 to have them canonicalized, which is what we eventually
7672 should do anyway. */
7673 if (TREE_CODE (TREE_OPERAND (*expr_p
, 1)) == INTEGER_CST
7674 && is_gimple_min_invariant (TREE_OPERAND (*expr_p
, 0)))
7676 *expr_p
= build_fold_addr_expr_with_type_loc
7678 fold_build2 (MEM_REF
, TREE_TYPE (TREE_TYPE (*expr_p
)),
7679 TREE_OPERAND (*expr_p
, 0),
7680 fold_convert (ptr_type_node
,
7681 TREE_OPERAND (*expr_p
, 1))),
7682 TREE_TYPE (*expr_p
));
7683 ret
= MIN (ret
, GS_OK
);
7689 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p
)))
7691 case tcc_comparison
:
7692 /* Handle comparison of objects of non scalar mode aggregates
7693 with a call to memcmp. It would be nice to only have to do
7694 this for variable-sized objects, but then we'd have to allow
7695 the same nest of reference nodes we allow for MODIFY_EXPR and
7698 Compare scalar mode aggregates as scalar mode values. Using
7699 memcmp for them would be very inefficient at best, and is
7700 plain wrong if bitfields are involved. */
7702 tree type
= TREE_TYPE (TREE_OPERAND (*expr_p
, 1));
7704 /* Vector comparisons need no boolification. */
7705 if (TREE_CODE (type
) == VECTOR_TYPE
)
7707 else if (!AGGREGATE_TYPE_P (type
))
7709 tree org_type
= TREE_TYPE (*expr_p
);
7710 *expr_p
= gimple_boolify (*expr_p
);
7711 if (!useless_type_conversion_p (org_type
,
7712 TREE_TYPE (*expr_p
)))
7714 *expr_p
= fold_convert_loc (input_location
,
7721 else if (TYPE_MODE (type
) != BLKmode
)
7722 ret
= gimplify_scalar_mode_aggregate_compare (expr_p
);
7724 ret
= gimplify_variable_sized_compare (expr_p
);
7729 /* If *EXPR_P does not need to be special-cased, handle it
7730 according to its class. */
7732 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
7733 post_p
, is_gimple_val
, fb_rvalue
);
7739 enum gimplify_status r0
, r1
;
7741 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
7742 post_p
, is_gimple_val
, fb_rvalue
);
7743 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
,
7744 post_p
, is_gimple_val
, fb_rvalue
);
7752 enum gimplify_status r0
, r1
, r2
;
7754 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
7755 post_p
, is_gimple_val
, fb_rvalue
);
7756 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
,
7757 post_p
, is_gimple_val
, fb_rvalue
);
7758 r2
= gimplify_expr (&TREE_OPERAND (*expr_p
, 2), pre_p
,
7759 post_p
, is_gimple_val
, fb_rvalue
);
7761 ret
= MIN (MIN (r0
, r1
), r2
);
7765 case tcc_declaration
:
7768 goto dont_recalculate
;
7774 recalculate_side_effects (*expr_p
);
7780 gcc_assert (*expr_p
|| ret
!= GS_OK
);
7782 while (ret
== GS_OK
);
7784 /* If we encountered an error_mark somewhere nested inside, either
7785 stub out the statement or propagate the error back out. */
7786 if (ret
== GS_ERROR
)
7793 /* This was only valid as a return value from the langhook, which
7794 we handled. Make sure it doesn't escape from any other context. */
7795 gcc_assert (ret
!= GS_UNHANDLED
);
7797 if (fallback
== fb_none
&& *expr_p
&& !is_gimple_stmt (*expr_p
))
7799 /* We aren't looking for a value, and we don't have a valid
7800 statement. If it doesn't have side-effects, throw it away. */
7801 if (!TREE_SIDE_EFFECTS (*expr_p
))
7803 else if (!TREE_THIS_VOLATILE (*expr_p
))
7805 /* This is probably a _REF that contains something nested that
7806 has side effects. Recurse through the operands to find it. */
7807 enum tree_code code
= TREE_CODE (*expr_p
);
7814 case VIEW_CONVERT_EXPR
:
7815 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
7816 gimple_test_f
, fallback
);
7820 case ARRAY_RANGE_REF
:
7821 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
7822 gimple_test_f
, fallback
);
7823 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
7824 gimple_test_f
, fallback
);
7828 /* Anything else with side-effects must be converted to
7829 a valid statement before we get here. */
7835 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p
))
7836 && TYPE_MODE (TREE_TYPE (*expr_p
)) != BLKmode
)
7838 /* Historically, the compiler has treated a bare reference
7839 to a non-BLKmode volatile lvalue as forcing a load. */
7840 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p
));
7842 /* Normally, we do not want to create a temporary for a
7843 TREE_ADDRESSABLE type because such a type should not be
7844 copied by bitwise-assignment. However, we make an
7845 exception here, as all we are doing here is ensuring that
7846 we read the bytes that make up the type. We use
7847 create_tmp_var_raw because create_tmp_var will abort when
7848 given a TREE_ADDRESSABLE type. */
7849 tree tmp
= create_tmp_var_raw (type
, "vol");
7850 gimple_add_tmp_var (tmp
);
7851 gimplify_assign (tmp
, *expr_p
, pre_p
);
7855 /* We can't do anything useful with a volatile reference to
7856 an incomplete type, so just throw it away. Likewise for
7857 a BLKmode type, since any implicit inner load should
7858 already have been turned into an explicit one by the
7859 gimplification process. */
7863 /* If we are gimplifying at the statement level, we're done. Tack
7864 everything together and return. */
7865 if (fallback
== fb_none
|| is_statement
)
7867 /* Since *EXPR_P has been converted into a GIMPLE tuple, clear
7868 it out for GC to reclaim it. */
7869 *expr_p
= NULL_TREE
;
7871 if (!gimple_seq_empty_p (internal_pre
)
7872 || !gimple_seq_empty_p (internal_post
))
7874 gimplify_seq_add_seq (&internal_pre
, internal_post
);
7875 gimplify_seq_add_seq (pre_p
, internal_pre
);
7878 /* The result of gimplifying *EXPR_P is going to be the last few
7879 statements in *PRE_P and *POST_P. Add location information
7880 to all the statements that were added by the gimplification
7882 if (!gimple_seq_empty_p (*pre_p
))
7883 annotate_all_with_location_after (*pre_p
, pre_last_gsi
, input_location
);
7885 if (!gimple_seq_empty_p (*post_p
))
7886 annotate_all_with_location_after (*post_p
, post_last_gsi
,
7892 #ifdef ENABLE_GIMPLE_CHECKING
7895 enum tree_code code
= TREE_CODE (*expr_p
);
7896 /* These expressions should already be in gimple IR form. */
7897 gcc_assert (code
!= MODIFY_EXPR
7899 && code
!= BIND_EXPR
7900 && code
!= CATCH_EXPR
7901 && (code
!= COND_EXPR
|| gimplify_ctxp
->allow_rhs_cond_expr
)
7902 && code
!= EH_FILTER_EXPR
7903 && code
!= GOTO_EXPR
7904 && code
!= LABEL_EXPR
7905 && code
!= LOOP_EXPR
7906 && code
!= SWITCH_EXPR
7907 && code
!= TRY_FINALLY_EXPR
7908 && code
!= OMP_CRITICAL
7910 && code
!= OMP_MASTER
7911 && code
!= OMP_ORDERED
7912 && code
!= OMP_PARALLEL
7913 && code
!= OMP_SECTIONS
7914 && code
!= OMP_SECTION
7915 && code
!= OMP_SINGLE
);
7919 /* Otherwise we're gimplifying a subexpression, so the resulting
7920 value is interesting. If it's a valid operand that matches
7921 GIMPLE_TEST_F, we're done. Unless we are handling some
7922 post-effects internally; if that's the case, we need to copy into
7923 a temporary before adding the post-effects to POST_P. */
7924 if (gimple_seq_empty_p (internal_post
) && (*gimple_test_f
) (*expr_p
))
7927 /* Otherwise, we need to create a new temporary for the gimplified
7930 /* We can't return an lvalue if we have an internal postqueue. The
7931 object the lvalue refers to would (probably) be modified by the
7932 postqueue; we need to copy the value out first, which means an
7934 if ((fallback
& fb_lvalue
)
7935 && gimple_seq_empty_p (internal_post
)
7936 && is_gimple_addressable (*expr_p
))
7938 /* An lvalue will do. Take the address of the expression, store it
7939 in a temporary, and replace the expression with an INDIRECT_REF of
7941 tmp
= build_fold_addr_expr_loc (input_location
, *expr_p
);
7942 gimplify_expr (&tmp
, pre_p
, post_p
, is_gimple_reg
, fb_rvalue
);
7943 *expr_p
= build_simple_mem_ref (tmp
);
7945 else if ((fallback
& fb_rvalue
) && is_gimple_reg_rhs_or_call (*expr_p
))
7947 /* An rvalue will do. Assign the gimplified expression into a
7948 new temporary TMP and replace the original expression with
7949 TMP. First, make sure that the expression has a type so that
7950 it can be assigned into a temporary. */
7951 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p
)));
7952 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
7956 #ifdef ENABLE_GIMPLE_CHECKING
7957 if (!(fallback
& fb_mayfail
))
7959 fprintf (stderr
, "gimplification failed:\n");
7960 print_generic_expr (stderr
, *expr_p
, 0);
7961 debug_tree (*expr_p
);
7962 internal_error ("gimplification failed");
7965 gcc_assert (fallback
& fb_mayfail
);
7967 /* If this is an asm statement, and the user asked for the
7968 impossible, don't die. Fail and let gimplify_asm_expr
7974 /* Make sure the temporary matches our predicate. */
7975 gcc_assert ((*gimple_test_f
) (*expr_p
));
7977 if (!gimple_seq_empty_p (internal_post
))
7979 annotate_all_with_location (internal_post
, input_location
);
7980 gimplify_seq_add_seq (pre_p
, internal_post
);
7984 input_location
= saved_location
;
7988 /* Look through TYPE for variable-sized objects and gimplify each such
7989 size that we find. Add to LIST_P any statements generated. */
7992 gimplify_type_sizes (tree type
, gimple_seq
*list_p
)
7996 if (type
== NULL
|| type
== error_mark_node
)
7999 /* We first do the main variant, then copy into any other variants. */
8000 type
= TYPE_MAIN_VARIANT (type
);
8002 /* Avoid infinite recursion. */
8003 if (TYPE_SIZES_GIMPLIFIED (type
))
8006 TYPE_SIZES_GIMPLIFIED (type
) = 1;
8008 switch (TREE_CODE (type
))
8014 case FIXED_POINT_TYPE
:
8015 gimplify_one_sizepos (&TYPE_MIN_VALUE (type
), list_p
);
8016 gimplify_one_sizepos (&TYPE_MAX_VALUE (type
), list_p
);
8018 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
8020 TYPE_MIN_VALUE (t
) = TYPE_MIN_VALUE (type
);
8021 TYPE_MAX_VALUE (t
) = TYPE_MAX_VALUE (type
);
8026 /* These types may not have declarations, so handle them here. */
8027 gimplify_type_sizes (TREE_TYPE (type
), list_p
);
8028 gimplify_type_sizes (TYPE_DOMAIN (type
), list_p
);
8029 /* Ensure VLA bounds aren't removed, for -O0 they should be variables
8030 with assigned stack slots, for -O1+ -g they should be tracked
8032 if (!(TYPE_NAME (type
)
8033 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
8034 && DECL_IGNORED_P (TYPE_NAME (type
)))
8035 && TYPE_DOMAIN (type
)
8036 && INTEGRAL_TYPE_P (TYPE_DOMAIN (type
)))
8038 t
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
8039 if (t
&& TREE_CODE (t
) == VAR_DECL
&& DECL_ARTIFICIAL (t
))
8040 DECL_IGNORED_P (t
) = 0;
8041 t
= TYPE_MAX_VALUE (TYPE_DOMAIN (type
));
8042 if (t
&& TREE_CODE (t
) == VAR_DECL
&& DECL_ARTIFICIAL (t
))
8043 DECL_IGNORED_P (t
) = 0;
8049 case QUAL_UNION_TYPE
:
8050 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
8051 if (TREE_CODE (field
) == FIELD_DECL
)
8053 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field
), list_p
);
8054 gimplify_one_sizepos (&DECL_SIZE (field
), list_p
);
8055 gimplify_one_sizepos (&DECL_SIZE_UNIT (field
), list_p
);
8056 gimplify_type_sizes (TREE_TYPE (field
), list_p
);
8061 case REFERENCE_TYPE
:
8062 /* We used to recurse on the pointed-to type here, which turned out to
8063 be incorrect because its definition might refer to variables not
8064 yet initialized at this point if a forward declaration is involved.
8066 It was actually useful for anonymous pointed-to types to ensure
8067 that the sizes evaluation dominates every possible later use of the
8068 values. Restricting to such types here would be safe since there
8069 is no possible forward declaration around, but would introduce an
8070 undesirable middle-end semantic to anonymity. We then defer to
8071 front-ends the responsibility of ensuring that the sizes are
8072 evaluated both early and late enough, e.g. by attaching artificial
8073 type declarations to the tree. */
8080 gimplify_one_sizepos (&TYPE_SIZE (type
), list_p
);
8081 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type
), list_p
);
8083 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
8085 TYPE_SIZE (t
) = TYPE_SIZE (type
);
8086 TYPE_SIZE_UNIT (t
) = TYPE_SIZE_UNIT (type
);
8087 TYPE_SIZES_GIMPLIFIED (t
) = 1;
8091 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
8092 a size or position, has had all of its SAVE_EXPRs evaluated.
8093 We add any required statements to *STMT_P. */
8096 gimplify_one_sizepos (tree
*expr_p
, gimple_seq
*stmt_p
)
8098 tree expr
= *expr_p
;
8100 /* We don't do anything if the value isn't there, is constant, or contains
8101 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
8102 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
8103 will want to replace it with a new variable, but that will cause problems
8104 if this type is from outside the function. It's OK to have that here. */
8105 if (expr
== NULL_TREE
|| TREE_CONSTANT (expr
)
8106 || TREE_CODE (expr
) == VAR_DECL
8107 || CONTAINS_PLACEHOLDER_P (expr
))
8110 *expr_p
= unshare_expr (expr
);
8112 gimplify_expr (expr_p
, stmt_p
, NULL
, is_gimple_val
, fb_rvalue
);
8116 /* Gimplify the body of statements of FNDECL and return a GIMPLE_BIND node
8117 containing the sequence of corresponding GIMPLE statements. If DO_PARMS
8118 is true, also gimplify the parameters. */
8121 gimplify_body (tree fndecl
, bool do_parms
)
8123 location_t saved_location
= input_location
;
8124 gimple_seq parm_stmts
, seq
;
8126 struct gimplify_ctx gctx
;
8127 struct cgraph_node
*cgn
;
8129 timevar_push (TV_TREE_GIMPLIFY
);
8131 /* Initialize for optimize_insn_for_s{ize,peed}_p possibly called during
8133 default_rtl_profile ();
8135 gcc_assert (gimplify_ctxp
== NULL
);
8136 push_gimplify_context (&gctx
);
8138 /* Unshare most shared trees in the body and in that of any nested functions.
8139 It would seem we don't have to do this for nested functions because
8140 they are supposed to be output and then the outer function gimplified
8141 first, but the g++ front end doesn't always do it that way. */
8142 unshare_body (fndecl
);
8143 unvisit_body (fndecl
);
8145 cgn
= cgraph_get_node (fndecl
);
8146 if (cgn
&& cgn
->origin
)
8147 nonlocal_vlas
= pointer_set_create ();
8149 /* Make sure input_location isn't set to something weird. */
8150 input_location
= DECL_SOURCE_LOCATION (fndecl
);
8152 /* Resolve callee-copies. This has to be done before processing
8153 the body so that DECL_VALUE_EXPR gets processed correctly. */
8154 parm_stmts
= do_parms
? gimplify_parameters () : NULL
;
8156 /* Gimplify the function's body. */
8158 gimplify_stmt (&DECL_SAVED_TREE (fndecl
), &seq
);
8159 outer_bind
= gimple_seq_first_stmt (seq
);
8162 outer_bind
= gimple_build_nop ();
8163 gimplify_seq_add_stmt (&seq
, outer_bind
);
8166 /* The body must contain exactly one statement, a GIMPLE_BIND. If this is
8167 not the case, wrap everything in a GIMPLE_BIND to make it so. */
8168 if (gimple_code (outer_bind
) == GIMPLE_BIND
8169 && gimple_seq_first (seq
) == gimple_seq_last (seq
))
8172 outer_bind
= gimple_build_bind (NULL_TREE
, seq
, NULL
);
8174 DECL_SAVED_TREE (fndecl
) = NULL_TREE
;
8176 /* If we had callee-copies statements, insert them at the beginning
8177 of the function and clear DECL_VALUE_EXPR_P on the parameters. */
8178 if (!gimple_seq_empty_p (parm_stmts
))
8182 gimplify_seq_add_seq (&parm_stmts
, gimple_bind_body (outer_bind
));
8183 gimple_bind_set_body (outer_bind
, parm_stmts
);
8185 for (parm
= DECL_ARGUMENTS (current_function_decl
);
8186 parm
; parm
= DECL_CHAIN (parm
))
8187 if (DECL_HAS_VALUE_EXPR_P (parm
))
8189 DECL_HAS_VALUE_EXPR_P (parm
) = 0;
8190 DECL_IGNORED_P (parm
) = 0;
8196 pointer_set_destroy (nonlocal_vlas
);
8197 nonlocal_vlas
= NULL
;
8200 pop_gimplify_context (outer_bind
);
8201 gcc_assert (gimplify_ctxp
== NULL
);
8204 verify_gimple_in_seq (gimple_bind_body (outer_bind
));
8206 timevar_pop (TV_TREE_GIMPLIFY
);
8207 input_location
= saved_location
;
8212 typedef char *char_p
; /* For DEF_VEC_P. */
8214 DEF_VEC_ALLOC_P(char_p
,heap
);
8216 /* Return whether we should exclude FNDECL from instrumentation. */
8219 flag_instrument_functions_exclude_p (tree fndecl
)
8221 VEC(char_p
,heap
) *vec
;
8223 vec
= (VEC(char_p
,heap
) *) flag_instrument_functions_exclude_functions
;
8224 if (VEC_length (char_p
, vec
) > 0)
8230 name
= lang_hooks
.decl_printable_name (fndecl
, 0);
8231 FOR_EACH_VEC_ELT (char_p
, vec
, i
, s
)
8232 if (strstr (name
, s
) != NULL
)
8236 vec
= (VEC(char_p
,heap
) *) flag_instrument_functions_exclude_files
;
8237 if (VEC_length (char_p
, vec
) > 0)
8243 name
= DECL_SOURCE_FILE (fndecl
);
8244 FOR_EACH_VEC_ELT (char_p
, vec
, i
, s
)
8245 if (strstr (name
, s
) != NULL
)
8252 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
8253 node for the function we want to gimplify.
8255 Return the sequence of GIMPLE statements corresponding to the body
8259 gimplify_function_tree (tree fndecl
)
8261 tree oldfn
, parm
, ret
;
8265 gcc_assert (!gimple_body (fndecl
));
8267 oldfn
= current_function_decl
;
8268 current_function_decl
= fndecl
;
8269 if (DECL_STRUCT_FUNCTION (fndecl
))
8270 push_cfun (DECL_STRUCT_FUNCTION (fndecl
));
8272 push_struct_function (fndecl
);
8274 for (parm
= DECL_ARGUMENTS (fndecl
); parm
; parm
= DECL_CHAIN (parm
))
8276 /* Preliminarily mark non-addressed complex variables as eligible
8277 for promotion to gimple registers. We'll transform their uses
8279 if ((TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
8280 || TREE_CODE (TREE_TYPE (parm
)) == VECTOR_TYPE
)
8281 && !TREE_THIS_VOLATILE (parm
)
8282 && !needs_to_live_in_memory (parm
))
8283 DECL_GIMPLE_REG_P (parm
) = 1;
8286 ret
= DECL_RESULT (fndecl
);
8287 if ((TREE_CODE (TREE_TYPE (ret
)) == COMPLEX_TYPE
8288 || TREE_CODE (TREE_TYPE (ret
)) == VECTOR_TYPE
)
8289 && !needs_to_live_in_memory (ret
))
8290 DECL_GIMPLE_REG_P (ret
) = 1;
8292 bind
= gimplify_body (fndecl
, true);
8294 /* The tree body of the function is no longer needed, replace it
8295 with the new GIMPLE body. */
8297 gimple_seq_add_stmt (&seq
, bind
);
8298 gimple_set_body (fndecl
, seq
);
8300 /* If we're instrumenting function entry/exit, then prepend the call to
8301 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
8302 catch the exit hook. */
8303 /* ??? Add some way to ignore exceptions for this TFE. */
8304 if (flag_instrument_function_entry_exit
8305 && !DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl
)
8306 && !flag_instrument_functions_exclude_p (fndecl
))
8311 gimple_seq cleanup
= NULL
, body
= NULL
;
8315 x
= builtin_decl_implicit (BUILT_IN_RETURN_ADDRESS
);
8316 call
= gimple_build_call (x
, 1, integer_zero_node
);
8317 tmp_var
= create_tmp_var (ptr_type_node
, "return_addr");
8318 gimple_call_set_lhs (call
, tmp_var
);
8319 gimplify_seq_add_stmt (&cleanup
, call
);
8320 x
= builtin_decl_implicit (BUILT_IN_PROFILE_FUNC_EXIT
);
8321 call
= gimple_build_call (x
, 2,
8322 build_fold_addr_expr (current_function_decl
),
8324 gimplify_seq_add_stmt (&cleanup
, call
);
8325 tf
= gimple_build_try (seq
, cleanup
, GIMPLE_TRY_FINALLY
);
8327 x
= builtin_decl_implicit (BUILT_IN_RETURN_ADDRESS
);
8328 call
= gimple_build_call (x
, 1, integer_zero_node
);
8329 tmp_var
= create_tmp_var (ptr_type_node
, "return_addr");
8330 gimple_call_set_lhs (call
, tmp_var
);
8331 gimplify_seq_add_stmt (&body
, call
);
8332 x
= builtin_decl_implicit (BUILT_IN_PROFILE_FUNC_ENTER
);
8333 call
= gimple_build_call (x
, 2,
8334 build_fold_addr_expr (current_function_decl
),
8336 gimplify_seq_add_stmt (&body
, call
);
8337 gimplify_seq_add_stmt (&body
, tf
);
8338 new_bind
= gimple_build_bind (NULL
, body
, gimple_bind_block (bind
));
8339 /* Clear the block for BIND, since it is no longer directly inside
8340 the function, but within a try block. */
8341 gimple_bind_set_block (bind
, NULL
);
8343 /* Replace the current function body with the body
8344 wrapped in the try/finally TF. */
8346 gimple_seq_add_stmt (&seq
, new_bind
);
8347 gimple_set_body (fndecl
, seq
);
8350 DECL_SAVED_TREE (fndecl
) = NULL_TREE
;
8351 cfun
->curr_properties
= PROP_gimple_any
;
8353 current_function_decl
= oldfn
;
8357 /* Some transformations like inlining may invalidate the GIMPLE form
8358 for operands. This function traverses all the operands in STMT and
8359 gimplifies anything that is not a valid gimple operand. Any new
8360 GIMPLE statements are inserted before *GSI_P. */
8363 gimple_regimplify_operands (gimple stmt
, gimple_stmt_iterator
*gsi_p
)
8366 tree orig_lhs
= NULL_TREE
, lhs
, t
;
8367 gimple_seq pre
= NULL
;
8368 gimple post_stmt
= NULL
;
8369 struct gimplify_ctx gctx
;
8371 push_gimplify_context (&gctx
);
8372 gimplify_ctxp
->into_ssa
= gimple_in_ssa_p (cfun
);
8374 switch (gimple_code (stmt
))
8377 gimplify_expr (gimple_cond_lhs_ptr (stmt
), &pre
, NULL
,
8378 is_gimple_val
, fb_rvalue
);
8379 gimplify_expr (gimple_cond_rhs_ptr (stmt
), &pre
, NULL
,
8380 is_gimple_val
, fb_rvalue
);
8383 gimplify_expr (gimple_switch_index_ptr (stmt
), &pre
, NULL
,
8384 is_gimple_val
, fb_rvalue
);
8386 case GIMPLE_OMP_ATOMIC_LOAD
:
8387 gimplify_expr (gimple_omp_atomic_load_rhs_ptr (stmt
), &pre
, NULL
,
8388 is_gimple_val
, fb_rvalue
);
8392 size_t i
, noutputs
= gimple_asm_noutputs (stmt
);
8393 const char *constraint
, **oconstraints
;
8394 bool allows_mem
, allows_reg
, is_inout
;
8397 = (const char **) alloca ((noutputs
) * sizeof (const char *));
8398 for (i
= 0; i
< noutputs
; i
++)
8400 tree op
= gimple_asm_output_op (stmt
, i
);
8401 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op
)));
8402 oconstraints
[i
] = constraint
;
8403 parse_output_constraint (&constraint
, i
, 0, 0, &allows_mem
,
8404 &allows_reg
, &is_inout
);
8405 gimplify_expr (&TREE_VALUE (op
), &pre
, NULL
,
8406 is_inout
? is_gimple_min_lval
: is_gimple_lvalue
,
8407 fb_lvalue
| fb_mayfail
);
8409 for (i
= 0; i
< gimple_asm_ninputs (stmt
); i
++)
8411 tree op
= gimple_asm_input_op (stmt
, i
);
8412 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op
)));
8413 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
8414 oconstraints
, &allows_mem
, &allows_reg
);
8415 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (op
))) && allows_mem
)
8417 if (!allows_reg
&& allows_mem
)
8418 gimplify_expr (&TREE_VALUE (op
), &pre
, NULL
,
8419 is_gimple_lvalue
, fb_lvalue
| fb_mayfail
);
8421 gimplify_expr (&TREE_VALUE (op
), &pre
, NULL
,
8422 is_gimple_asm_val
, fb_rvalue
);
8427 /* NOTE: We start gimplifying operands from last to first to
8428 make sure that side-effects on the RHS of calls, assignments
8429 and ASMs are executed before the LHS. The ordering is not
8430 important for other statements. */
8431 num_ops
= gimple_num_ops (stmt
);
8432 orig_lhs
= gimple_get_lhs (stmt
);
8433 for (i
= num_ops
; i
> 0; i
--)
8435 tree op
= gimple_op (stmt
, i
- 1);
8436 if (op
== NULL_TREE
)
8438 if (i
== 1 && (is_gimple_call (stmt
) || is_gimple_assign (stmt
)))
8439 gimplify_expr (&op
, &pre
, NULL
, is_gimple_lvalue
, fb_lvalue
);
8441 && is_gimple_assign (stmt
)
8443 && get_gimple_rhs_class (gimple_expr_code (stmt
))
8444 == GIMPLE_SINGLE_RHS
)
8445 gimplify_expr (&op
, &pre
, NULL
,
8446 rhs_predicate_for (gimple_assign_lhs (stmt
)),
8448 else if (i
== 2 && is_gimple_call (stmt
))
8450 if (TREE_CODE (op
) == FUNCTION_DECL
)
8452 gimplify_expr (&op
, &pre
, NULL
, is_gimple_call_addr
, fb_rvalue
);
8455 gimplify_expr (&op
, &pre
, NULL
, is_gimple_val
, fb_rvalue
);
8456 gimple_set_op (stmt
, i
- 1, op
);
8459 lhs
= gimple_get_lhs (stmt
);
8460 /* If the LHS changed it in a way that requires a simple RHS,
8461 create temporary. */
8462 if (lhs
&& !is_gimple_reg (lhs
))
8464 bool need_temp
= false;
8466 if (is_gimple_assign (stmt
)
8468 && get_gimple_rhs_class (gimple_expr_code (stmt
))
8469 == GIMPLE_SINGLE_RHS
)
8470 gimplify_expr (gimple_assign_rhs1_ptr (stmt
), &pre
, NULL
,
8471 rhs_predicate_for (gimple_assign_lhs (stmt
)),
8473 else if (is_gimple_reg (lhs
))
8475 if (is_gimple_reg_type (TREE_TYPE (lhs
)))
8477 if (is_gimple_call (stmt
))
8479 i
= gimple_call_flags (stmt
);
8480 if ((i
& ECF_LOOPING_CONST_OR_PURE
)
8481 || !(i
& (ECF_CONST
| ECF_PURE
)))
8484 if (stmt_can_throw_internal (stmt
))
8490 if (is_gimple_reg_type (TREE_TYPE (lhs
)))
8492 else if (TYPE_MODE (TREE_TYPE (lhs
)) != BLKmode
)
8494 if (is_gimple_call (stmt
))
8496 tree fndecl
= gimple_call_fndecl (stmt
);
8498 if (!aggregate_value_p (TREE_TYPE (lhs
), fndecl
)
8499 && !(fndecl
&& DECL_RESULT (fndecl
)
8500 && DECL_BY_REFERENCE (DECL_RESULT (fndecl
))))
8509 tree temp
= create_tmp_reg (TREE_TYPE (lhs
), NULL
);
8511 if (TREE_CODE (orig_lhs
) == SSA_NAME
)
8512 orig_lhs
= SSA_NAME_VAR (orig_lhs
);
8514 if (gimple_in_ssa_p (cfun
))
8515 temp
= make_ssa_name (temp
, NULL
);
8516 gimple_set_lhs (stmt
, temp
);
8517 post_stmt
= gimple_build_assign (lhs
, temp
);
8518 if (TREE_CODE (lhs
) == SSA_NAME
)
8519 SSA_NAME_DEF_STMT (lhs
) = post_stmt
;
8525 if (gimple_referenced_vars (cfun
))
8526 for (t
= gimplify_ctxp
->temps
; t
; t
= TREE_CHAIN (t
))
8527 add_referenced_var (t
);
8529 if (!gimple_seq_empty_p (pre
))
8531 if (gimple_in_ssa_p (cfun
))
8533 gimple_stmt_iterator i
;
8535 for (i
= gsi_start (pre
); !gsi_end_p (i
); gsi_next (&i
))
8537 tree lhs
= gimple_get_lhs (gsi_stmt (i
));
8539 && TREE_CODE (lhs
) != SSA_NAME
8540 && is_gimple_reg (lhs
))
8541 mark_sym_for_renaming (lhs
);
8544 gsi_insert_seq_before (gsi_p
, pre
, GSI_SAME_STMT
);
8547 gsi_insert_after (gsi_p
, post_stmt
, GSI_NEW_STMT
);
8549 pop_gimplify_context (NULL
);
8552 /* Expand EXPR to list of gimple statements STMTS. GIMPLE_TEST_F specifies
8553 the predicate that will hold for the result. If VAR is not NULL, make the
8554 base variable of the final destination be VAR if suitable. */
8557 force_gimple_operand_1 (tree expr
, gimple_seq
*stmts
,
8558 gimple_predicate gimple_test_f
, tree var
)
8561 enum gimplify_status ret
;
8562 struct gimplify_ctx gctx
;
8566 /* gimple_test_f might be more strict than is_gimple_val, make
8567 sure we pass both. Just checking gimple_test_f doesn't work
8568 because most gimple predicates do not work recursively. */
8569 if (is_gimple_val (expr
)
8570 && (*gimple_test_f
) (expr
))
8573 push_gimplify_context (&gctx
);
8574 gimplify_ctxp
->into_ssa
= gimple_in_ssa_p (cfun
);
8575 gimplify_ctxp
->allow_rhs_cond_expr
= true;
8578 expr
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, expr
);
8580 if (TREE_CODE (expr
) != MODIFY_EXPR
8581 && TREE_TYPE (expr
) == void_type_node
)
8583 gimplify_and_add (expr
, stmts
);
8588 ret
= gimplify_expr (&expr
, stmts
, NULL
, gimple_test_f
, fb_rvalue
);
8589 gcc_assert (ret
!= GS_ERROR
);
8592 if (gimple_referenced_vars (cfun
))
8593 for (t
= gimplify_ctxp
->temps
; t
; t
= DECL_CHAIN (t
))
8594 add_referenced_var (t
);
8596 if (!gimple_seq_empty_p (*stmts
)
8597 && gimplify_ctxp
->into_ssa
)
8599 gimple_stmt_iterator i
;
8601 for (i
= gsi_start (*stmts
); !gsi_end_p (i
); gsi_next (&i
))
8603 tree lhs
= gimple_get_lhs (gsi_stmt (i
));
8605 && TREE_CODE (lhs
) != SSA_NAME
8606 && is_gimple_reg (lhs
))
8607 mark_sym_for_renaming (lhs
);
8611 pop_gimplify_context (NULL
);
8616 /* Expand EXPR to list of gimple statements STMTS. If SIMPLE is true,
8617 force the result to be either ssa_name or an invariant, otherwise
8618 just force it to be a rhs expression. If VAR is not NULL, make the
8619 base variable of the final destination be VAR if suitable. */
8622 force_gimple_operand (tree expr
, gimple_seq
*stmts
, bool simple
, tree var
)
8624 return force_gimple_operand_1 (expr
, stmts
,
8625 simple
? is_gimple_val
: is_gimple_reg_rhs
,
8629 /* Invoke force_gimple_operand_1 for EXPR with parameters GIMPLE_TEST_F
8630 and VAR. If some statements are produced, emits them at GSI.
8631 If BEFORE is true. the statements are appended before GSI, otherwise
8632 they are appended after it. M specifies the way GSI moves after
8633 insertion (GSI_SAME_STMT or GSI_CONTINUE_LINKING are the usual values). */
8636 force_gimple_operand_gsi_1 (gimple_stmt_iterator
*gsi
, tree expr
,
8637 gimple_predicate gimple_test_f
,
8638 tree var
, bool before
,
8639 enum gsi_iterator_update m
)
8643 expr
= force_gimple_operand_1 (expr
, &stmts
, gimple_test_f
, var
);
8645 if (!gimple_seq_empty_p (stmts
))
8648 gsi_insert_seq_before (gsi
, stmts
, m
);
8650 gsi_insert_seq_after (gsi
, stmts
, m
);
8656 /* Invoke force_gimple_operand_1 for EXPR with parameter VAR.
8657 If SIMPLE is true, force the result to be either ssa_name or an invariant,
8658 otherwise just force it to be a rhs expression. If some statements are
8659 produced, emits them at GSI. If BEFORE is true, the statements are
8660 appended before GSI, otherwise they are appended after it. M specifies
8661 the way GSI moves after insertion (GSI_SAME_STMT or GSI_CONTINUE_LINKING
8662 are the usual values). */
8665 force_gimple_operand_gsi (gimple_stmt_iterator
*gsi
, tree expr
,
8666 bool simple_p
, tree var
, bool before
,
8667 enum gsi_iterator_update m
)
8669 return force_gimple_operand_gsi_1 (gsi
, expr
,
8671 ? is_gimple_val
: is_gimple_reg_rhs
,
8676 #include "gt-gimplify.h"