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 /* Returns true iff T is a valid RHS for an assignment to a renamed
492 user -- or front-end generated artificial -- variable. */
495 is_gimple_reg_rhs (tree t
)
497 return get_gimple_rhs_class (TREE_CODE (t
)) != GIMPLE_INVALID_RHS
;
500 /* Returns true iff T is a valid RHS for an assignment to an un-renamed
501 LHS, or for a call argument. */
504 is_gimple_mem_rhs (tree t
)
506 /* If we're dealing with a renamable type, either source or dest must be
507 a renamed variable. */
508 if (is_gimple_reg_type (TREE_TYPE (t
)))
509 return is_gimple_val (t
);
511 return is_gimple_val (t
) || is_gimple_lvalue (t
);
514 /* Return true if T is a CALL_EXPR or an expression that can be
515 assigned to a temporary. Note that this predicate should only be
516 used during gimplification. See the rationale for this in
517 gimplify_modify_expr. */
520 is_gimple_reg_rhs_or_call (tree t
)
522 return (get_gimple_rhs_class (TREE_CODE (t
)) != GIMPLE_INVALID_RHS
523 || TREE_CODE (t
) == CALL_EXPR
);
526 /* Return true if T is a valid memory RHS or a CALL_EXPR. Note that
527 this predicate should only be used during gimplification. See the
528 rationale for this in gimplify_modify_expr. */
531 is_gimple_mem_rhs_or_call (tree t
)
533 /* If we're dealing with a renamable type, either source or dest must be
534 a renamed variable. */
535 if (is_gimple_reg_type (TREE_TYPE (t
)))
536 return is_gimple_val (t
);
538 return (is_gimple_val (t
) || is_gimple_lvalue (t
)
539 || TREE_CODE (t
) == CALL_EXPR
);
542 /* Create a temporary with a name derived from VAL. Subroutine of
543 lookup_tmp_var; nobody else should call this function. */
546 create_tmp_from_val (tree val
, bool is_formal
)
548 /* Drop all qualifiers and address-space information from the value type. */
549 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (val
));
550 tree var
= create_tmp_var (type
, get_name (val
));
552 && (TREE_CODE (TREE_TYPE (var
)) == COMPLEX_TYPE
553 || TREE_CODE (TREE_TYPE (var
)) == VECTOR_TYPE
))
554 DECL_GIMPLE_REG_P (var
) = 1;
558 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
559 an existing expression temporary. */
562 lookup_tmp_var (tree val
, bool is_formal
)
566 /* If not optimizing, never really reuse a temporary. local-alloc
567 won't allocate any variable that is used in more than one basic
568 block, which means it will go into memory, causing much extra
569 work in reload and final and poorer code generation, outweighing
570 the extra memory allocation here. */
571 if (!optimize
|| !is_formal
|| TREE_SIDE_EFFECTS (val
))
572 ret
= create_tmp_from_val (val
, is_formal
);
579 if (gimplify_ctxp
->temp_htab
== NULL
)
580 gimplify_ctxp
->temp_htab
581 = htab_create (1000, gimple_tree_hash
, gimple_tree_eq
, free
);
582 slot
= htab_find_slot (gimplify_ctxp
->temp_htab
, (void *)&elt
, INSERT
);
585 elt_p
= XNEW (elt_t
);
587 elt_p
->temp
= ret
= create_tmp_from_val (val
, is_formal
);
588 *slot
= (void *) elt_p
;
592 elt_p
= (elt_t
*) *slot
;
600 /* Helper for get_formal_tmp_var and get_initialized_tmp_var. */
603 internal_get_tmp_var (tree val
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
608 /* Notice that we explicitly allow VAL to be a CALL_EXPR so that we
609 can create an INIT_EXPR and convert it into a GIMPLE_CALL below. */
610 gimplify_expr (&val
, pre_p
, post_p
, is_gimple_reg_rhs_or_call
,
613 if (gimplify_ctxp
->into_ssa
614 && is_gimple_reg_type (TREE_TYPE (val
)))
615 t
= make_ssa_name (TYPE_MAIN_VARIANT (TREE_TYPE (val
)), NULL
);
617 t
= lookup_tmp_var (val
, is_formal
);
619 mod
= build2 (INIT_EXPR
, TREE_TYPE (t
), t
, unshare_expr (val
));
621 SET_EXPR_LOCATION (mod
, EXPR_LOC_OR_HERE (val
));
623 /* gimplify_modify_expr might want to reduce this further. */
624 gimplify_and_add (mod
, pre_p
);
630 /* Return a formal temporary variable initialized with VAL. PRE_P is as
631 in gimplify_expr. Only use this function if:
633 1) The value of the unfactored expression represented by VAL will not
634 change between the initialization and use of the temporary, and
635 2) The temporary will not be otherwise modified.
637 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
638 and #2 means it is inappropriate for && temps.
640 For other cases, use get_initialized_tmp_var instead. */
643 get_formal_tmp_var (tree val
, gimple_seq
*pre_p
)
645 return internal_get_tmp_var (val
, pre_p
, NULL
, true);
648 /* Return a temporary variable initialized with VAL. PRE_P and POST_P
649 are as in gimplify_expr. */
652 get_initialized_tmp_var (tree val
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
654 return internal_get_tmp_var (val
, pre_p
, post_p
, false);
657 /* Declare all the variables in VARS in SCOPE. If DEBUG_INFO is true,
658 generate debug info for them; otherwise don't. */
661 declare_vars (tree vars
, gimple scope
, bool debug_info
)
668 gcc_assert (gimple_code (scope
) == GIMPLE_BIND
);
670 temps
= nreverse (last
);
672 block
= gimple_bind_block (scope
);
673 gcc_assert (!block
|| TREE_CODE (block
) == BLOCK
);
674 if (!block
|| !debug_info
)
676 DECL_CHAIN (last
) = gimple_bind_vars (scope
);
677 gimple_bind_set_vars (scope
, temps
);
681 /* We need to attach the nodes both to the BIND_EXPR and to its
682 associated BLOCK for debugging purposes. The key point here
683 is that the BLOCK_VARS of the BIND_EXPR_BLOCK of a BIND_EXPR
684 is a subchain of the BIND_EXPR_VARS of the BIND_EXPR. */
685 if (BLOCK_VARS (block
))
686 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), temps
);
689 gimple_bind_set_vars (scope
,
690 chainon (gimple_bind_vars (scope
), temps
));
691 BLOCK_VARS (block
) = temps
;
697 /* For VAR a VAR_DECL of variable size, try to find a constant upper bound
698 for the size and adjust DECL_SIZE/DECL_SIZE_UNIT accordingly. Abort if
699 no such upper bound can be obtained. */
702 force_constant_size (tree var
)
704 /* The only attempt we make is by querying the maximum size of objects
705 of the variable's type. */
707 HOST_WIDE_INT max_size
;
709 gcc_assert (TREE_CODE (var
) == VAR_DECL
);
711 max_size
= max_int_size_in_bytes (TREE_TYPE (var
));
713 gcc_assert (max_size
>= 0);
716 = build_int_cst (TREE_TYPE (DECL_SIZE_UNIT (var
)), max_size
);
718 = build_int_cst (TREE_TYPE (DECL_SIZE (var
)), max_size
* BITS_PER_UNIT
);
721 /* Push the temporary variable TMP into the current binding. */
724 gimple_add_tmp_var (tree tmp
)
726 gcc_assert (!DECL_CHAIN (tmp
) && !DECL_SEEN_IN_BIND_EXPR_P (tmp
));
728 /* Later processing assumes that the object size is constant, which might
729 not be true at this point. Force the use of a constant upper bound in
731 if (!host_integerp (DECL_SIZE_UNIT (tmp
), 1))
732 force_constant_size (tmp
);
734 DECL_CONTEXT (tmp
) = current_function_decl
;
735 DECL_SEEN_IN_BIND_EXPR_P (tmp
) = 1;
739 DECL_CHAIN (tmp
) = gimplify_ctxp
->temps
;
740 gimplify_ctxp
->temps
= tmp
;
742 /* Mark temporaries local within the nearest enclosing parallel. */
743 if (gimplify_omp_ctxp
)
745 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
746 while (ctx
&& ctx
->region_type
== ORT_WORKSHARE
)
747 ctx
= ctx
->outer_context
;
749 omp_add_variable (ctx
, tmp
, GOVD_LOCAL
| GOVD_SEEN
);
758 /* This case is for nested functions. We need to expose the locals
760 body_seq
= gimple_body (current_function_decl
);
761 declare_vars (tmp
, gimple_seq_first_stmt (body_seq
), false);
765 /* Determine whether to assign a location to the statement GS. */
768 should_carry_location_p (gimple gs
)
770 /* Don't emit a line note for a label. We particularly don't want to
771 emit one for the break label, since it doesn't actually correspond
772 to the beginning of the loop/switch. */
773 if (gimple_code (gs
) == GIMPLE_LABEL
)
779 /* Return true if a location should not be emitted for this statement
780 by annotate_one_with_location. */
783 gimple_do_not_emit_location_p (gimple g
)
785 return gimple_plf (g
, GF_PLF_1
);
788 /* Mark statement G so a location will not be emitted by
789 annotate_one_with_location. */
792 gimple_set_do_not_emit_location (gimple g
)
794 /* The PLF flags are initialized to 0 when a new tuple is created,
795 so no need to initialize it anywhere. */
796 gimple_set_plf (g
, GF_PLF_1
, true);
799 /* Set the location for gimple statement GS to LOCATION. */
802 annotate_one_with_location (gimple gs
, location_t location
)
804 if (!gimple_has_location (gs
)
805 && !gimple_do_not_emit_location_p (gs
)
806 && should_carry_location_p (gs
))
807 gimple_set_location (gs
, location
);
810 /* Set LOCATION for all the statements after iterator GSI in sequence
811 SEQ. If GSI is pointing to the end of the sequence, start with the
812 first statement in SEQ. */
815 annotate_all_with_location_after (gimple_seq seq
, gimple_stmt_iterator gsi
,
819 gsi
= gsi_start (seq
);
823 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
824 annotate_one_with_location (gsi_stmt (gsi
), location
);
827 /* Set the location for all the statements in a sequence STMT_P to LOCATION. */
830 annotate_all_with_location (gimple_seq stmt_p
, location_t location
)
832 gimple_stmt_iterator i
;
834 if (gimple_seq_empty_p (stmt_p
))
837 for (i
= gsi_start (stmt_p
); !gsi_end_p (i
); gsi_next (&i
))
839 gimple gs
= gsi_stmt (i
);
840 annotate_one_with_location (gs
, location
);
844 /* This page contains routines to unshare tree nodes, i.e. to duplicate tree
845 nodes that are referenced more than once in GENERIC functions. This is
846 necessary because gimplification (translation into GIMPLE) is performed
847 by modifying tree nodes in-place, so gimplication of a shared node in a
848 first context could generate an invalid GIMPLE form in a second context.
850 This is achieved with a simple mark/copy/unmark algorithm that walks the
851 GENERIC representation top-down, marks nodes with TREE_VISITED the first
852 time it encounters them, duplicates them if they already have TREE_VISITED
853 set, and finally removes the TREE_VISITED marks it has set.
855 The algorithm works only at the function level, i.e. it generates a GENERIC
856 representation of a function with no nodes shared within the function when
857 passed a GENERIC function (except for nodes that are allowed to be shared).
859 At the global level, it is also necessary to unshare tree nodes that are
860 referenced in more than one function, for the same aforementioned reason.
861 This requires some cooperation from the front-end. There are 2 strategies:
863 1. Manual unsharing. The front-end needs to call unshare_expr on every
864 expression that might end up being shared across functions.
866 2. Deep unsharing. This is an extension of regular unsharing. Instead
867 of calling unshare_expr on expressions that might be shared across
868 functions, the front-end pre-marks them with TREE_VISITED. This will
869 ensure that they are unshared on the first reference within functions
870 when the regular unsharing algorithm runs. The counterpart is that
871 this algorithm must look deeper than for manual unsharing, which is
872 specified by LANG_HOOKS_DEEP_UNSHARING.
874 If there are only few specific cases of node sharing across functions, it is
875 probably easier for a front-end to unshare the expressions manually. On the
876 contrary, if the expressions generated at the global level are as widespread
877 as expressions generated within functions, deep unsharing is very likely the
880 /* Similar to copy_tree_r but do not copy SAVE_EXPR or TARGET_EXPR nodes.
881 These nodes model computations that must be done once. If we were to
882 unshare something like SAVE_EXPR(i++), the gimplification process would
883 create wrong code. However, if DATA is non-null, it must hold a pointer
884 set that is used to unshare the subtrees of these nodes. */
887 mostly_copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data
)
890 enum tree_code code
= TREE_CODE (t
);
892 /* Do not copy SAVE_EXPR, TARGET_EXPR or BIND_EXPR nodes themselves, but
893 copy their subtrees if we can make sure to do it only once. */
894 if (code
== SAVE_EXPR
|| code
== TARGET_EXPR
|| code
== BIND_EXPR
)
896 if (data
&& !pointer_set_insert ((struct pointer_set_t
*)data
, t
))
902 /* Stop at types, decls, constants like copy_tree_r. */
903 else if (TREE_CODE_CLASS (code
) == tcc_type
904 || TREE_CODE_CLASS (code
) == tcc_declaration
905 || TREE_CODE_CLASS (code
) == tcc_constant
906 /* We can't do anything sensible with a BLOCK used as an
907 expression, but we also can't just die when we see it
908 because of non-expression uses. So we avert our eyes
909 and cross our fingers. Silly Java. */
913 /* Cope with the statement expression extension. */
914 else if (code
== STATEMENT_LIST
)
917 /* Leave the bulk of the work to copy_tree_r itself. */
919 copy_tree_r (tp
, walk_subtrees
, NULL
);
924 /* Callback for walk_tree to unshare most of the shared trees rooted at *TP.
925 If *TP has been visited already, then *TP is deeply copied by calling
926 mostly_copy_tree_r. DATA is passed to mostly_copy_tree_r unmodified. */
929 copy_if_shared_r (tree
*tp
, int *walk_subtrees
, void *data
)
932 enum tree_code code
= TREE_CODE (t
);
934 /* Skip types, decls, and constants. But we do want to look at their
935 types and the bounds of types. Mark them as visited so we properly
936 unmark their subtrees on the unmark pass. If we've already seen them,
937 don't look down further. */
938 if (TREE_CODE_CLASS (code
) == tcc_type
939 || TREE_CODE_CLASS (code
) == tcc_declaration
940 || TREE_CODE_CLASS (code
) == tcc_constant
)
942 if (TREE_VISITED (t
))
945 TREE_VISITED (t
) = 1;
948 /* If this node has been visited already, unshare it and don't look
950 else if (TREE_VISITED (t
))
952 walk_tree (tp
, mostly_copy_tree_r
, data
, NULL
);
956 /* Otherwise, mark the node as visited and keep looking. */
958 TREE_VISITED (t
) = 1;
963 /* Unshare most of the shared trees rooted at *TP. DATA is passed to the
964 copy_if_shared_r callback unmodified. */
967 copy_if_shared (tree
*tp
, void *data
)
969 walk_tree (tp
, copy_if_shared_r
, data
, NULL
);
972 /* Unshare all the trees in the body of FNDECL, as well as in the bodies of
973 any nested functions. */
976 unshare_body (tree fndecl
)
978 struct cgraph_node
*cgn
= cgraph_get_node (fndecl
);
979 /* If the language requires deep unsharing, we need a pointer set to make
980 sure we don't repeatedly unshare subtrees of unshareable nodes. */
981 struct pointer_set_t
*visited
982 = lang_hooks
.deep_unsharing
? pointer_set_create () : NULL
;
984 copy_if_shared (&DECL_SAVED_TREE (fndecl
), visited
);
985 copy_if_shared (&DECL_SIZE (DECL_RESULT (fndecl
)), visited
);
986 copy_if_shared (&DECL_SIZE_UNIT (DECL_RESULT (fndecl
)), visited
);
989 pointer_set_destroy (visited
);
992 for (cgn
= cgn
->nested
; cgn
; cgn
= cgn
->next_nested
)
993 unshare_body (cgn
->symbol
.decl
);
996 /* Callback for walk_tree to unmark the visited trees rooted at *TP.
997 Subtrees are walked until the first unvisited node is encountered. */
1000 unmark_visited_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
1004 /* If this node has been visited, unmark it and keep looking. */
1005 if (TREE_VISITED (t
))
1006 TREE_VISITED (t
) = 0;
1008 /* Otherwise, don't look any deeper. */
1015 /* Unmark the visited trees rooted at *TP. */
1018 unmark_visited (tree
*tp
)
1020 walk_tree (tp
, unmark_visited_r
, NULL
, NULL
);
1023 /* Likewise, but mark all trees as not visited. */
1026 unvisit_body (tree fndecl
)
1028 struct cgraph_node
*cgn
= cgraph_get_node (fndecl
);
1030 unmark_visited (&DECL_SAVED_TREE (fndecl
));
1031 unmark_visited (&DECL_SIZE (DECL_RESULT (fndecl
)));
1032 unmark_visited (&DECL_SIZE_UNIT (DECL_RESULT (fndecl
)));
1035 for (cgn
= cgn
->nested
; cgn
; cgn
= cgn
->next_nested
)
1036 unvisit_body (cgn
->symbol
.decl
);
1039 /* Unconditionally make an unshared copy of EXPR. This is used when using
1040 stored expressions which span multiple functions, such as BINFO_VTABLE,
1041 as the normal unsharing process can't tell that they're shared. */
1044 unshare_expr (tree expr
)
1046 walk_tree (&expr
, mostly_copy_tree_r
, NULL
, NULL
);
1050 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
1051 contain statements and have a value. Assign its value to a temporary
1052 and give it void_type_node. Return the temporary, or NULL_TREE if
1053 WRAPPER was already void. */
1056 voidify_wrapper_expr (tree wrapper
, tree temp
)
1058 tree type
= TREE_TYPE (wrapper
);
1059 if (type
&& !VOID_TYPE_P (type
))
1063 /* Set p to point to the body of the wrapper. Loop until we find
1064 something that isn't a wrapper. */
1065 for (p
= &wrapper
; p
&& *p
; )
1067 switch (TREE_CODE (*p
))
1070 TREE_SIDE_EFFECTS (*p
) = 1;
1071 TREE_TYPE (*p
) = void_type_node
;
1072 /* For a BIND_EXPR, the body is operand 1. */
1073 p
= &BIND_EXPR_BODY (*p
);
1076 case CLEANUP_POINT_EXPR
:
1077 case TRY_FINALLY_EXPR
:
1078 case TRY_CATCH_EXPR
:
1079 TREE_SIDE_EFFECTS (*p
) = 1;
1080 TREE_TYPE (*p
) = void_type_node
;
1081 p
= &TREE_OPERAND (*p
, 0);
1084 case STATEMENT_LIST
:
1086 tree_stmt_iterator i
= tsi_last (*p
);
1087 TREE_SIDE_EFFECTS (*p
) = 1;
1088 TREE_TYPE (*p
) = void_type_node
;
1089 p
= tsi_end_p (i
) ? NULL
: tsi_stmt_ptr (i
);
1094 /* Advance to the last statement. Set all container types to
1096 for (; TREE_CODE (*p
) == COMPOUND_EXPR
; p
= &TREE_OPERAND (*p
, 1))
1098 TREE_SIDE_EFFECTS (*p
) = 1;
1099 TREE_TYPE (*p
) = void_type_node
;
1103 case TRANSACTION_EXPR
:
1104 TREE_SIDE_EFFECTS (*p
) = 1;
1105 TREE_TYPE (*p
) = void_type_node
;
1106 p
= &TRANSACTION_EXPR_BODY (*p
);
1110 /* Assume that any tree upon which voidify_wrapper_expr is
1111 directly called is a wrapper, and that its body is op0. */
1114 TREE_SIDE_EFFECTS (*p
) = 1;
1115 TREE_TYPE (*p
) = void_type_node
;
1116 p
= &TREE_OPERAND (*p
, 0);
1124 if (p
== NULL
|| IS_EMPTY_STMT (*p
))
1128 /* The wrapper is on the RHS of an assignment that we're pushing
1130 gcc_assert (TREE_CODE (temp
) == INIT_EXPR
1131 || TREE_CODE (temp
) == MODIFY_EXPR
);
1132 TREE_OPERAND (temp
, 1) = *p
;
1137 temp
= create_tmp_var (type
, "retval");
1138 *p
= build2 (INIT_EXPR
, type
, temp
, *p
);
1147 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
1148 a temporary through which they communicate. */
1151 build_stack_save_restore (gimple
*save
, gimple
*restore
)
1155 *save
= gimple_build_call (builtin_decl_implicit (BUILT_IN_STACK_SAVE
), 0);
1156 tmp_var
= create_tmp_var (ptr_type_node
, "saved_stack");
1157 gimple_call_set_lhs (*save
, tmp_var
);
1160 = gimple_build_call (builtin_decl_implicit (BUILT_IN_STACK_RESTORE
),
1164 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
1166 static enum gimplify_status
1167 gimplify_bind_expr (tree
*expr_p
, gimple_seq
*pre_p
)
1169 tree bind_expr
= *expr_p
;
1170 bool old_save_stack
= gimplify_ctxp
->save_stack
;
1173 gimple_seq body
, cleanup
;
1176 tree temp
= voidify_wrapper_expr (bind_expr
, NULL
);
1178 /* Mark variables seen in this bind expr. */
1179 for (t
= BIND_EXPR_VARS (bind_expr
); t
; t
= DECL_CHAIN (t
))
1181 if (TREE_CODE (t
) == VAR_DECL
)
1183 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
1185 /* Mark variable as local. */
1186 if (ctx
&& !DECL_EXTERNAL (t
)
1187 && (! DECL_SEEN_IN_BIND_EXPR_P (t
)
1188 || splay_tree_lookup (ctx
->variables
,
1189 (splay_tree_key
) t
) == NULL
))
1190 omp_add_variable (gimplify_omp_ctxp
, t
, GOVD_LOCAL
| GOVD_SEEN
);
1192 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
1194 if (DECL_HARD_REGISTER (t
) && !is_global_var (t
) && cfun
)
1195 cfun
->has_local_explicit_reg_vars
= true;
1198 /* Preliminarily mark non-addressed complex variables as eligible
1199 for promotion to gimple registers. We'll transform their uses
1201 if ((TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
1202 || TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
1203 && !TREE_THIS_VOLATILE (t
)
1204 && (TREE_CODE (t
) == VAR_DECL
&& !DECL_HARD_REGISTER (t
))
1205 && !needs_to_live_in_memory (t
))
1206 DECL_GIMPLE_REG_P (t
) = 1;
1209 gimple_bind
= gimple_build_bind (BIND_EXPR_VARS (bind_expr
), NULL
,
1210 BIND_EXPR_BLOCK (bind_expr
));
1211 gimple_push_bind_expr (gimple_bind
);
1213 gimplify_ctxp
->save_stack
= false;
1215 /* Gimplify the body into the GIMPLE_BIND tuple's body. */
1217 gimplify_stmt (&BIND_EXPR_BODY (bind_expr
), &body
);
1218 gimple_bind_set_body (gimple_bind
, body
);
1222 if (gimplify_ctxp
->save_stack
)
1224 gimple stack_restore
;
1226 /* Save stack on entry and restore it on exit. Add a try_finally
1227 block to achieve this. Note that mudflap depends on the
1228 format of the emitted code: see mx_register_decls(). */
1229 build_stack_save_restore (&stack_save
, &stack_restore
);
1231 gimplify_seq_add_stmt (&cleanup
, stack_restore
);
1234 /* Add clobbers for all variables that go out of scope. */
1235 for (t
= BIND_EXPR_VARS (bind_expr
); t
; t
= DECL_CHAIN (t
))
1237 if (TREE_CODE (t
) == VAR_DECL
1238 && !is_global_var (t
)
1239 && DECL_CONTEXT (t
) == current_function_decl
1240 && !DECL_HARD_REGISTER (t
)
1241 && !TREE_THIS_VOLATILE (t
)
1242 && !DECL_HAS_VALUE_EXPR_P (t
)
1243 /* Only care for variables that have to be in memory. Others
1244 will be rewritten into SSA names, hence moved to the top-level. */
1245 && !is_gimple_reg (t
)
1246 && flag_stack_reuse
!= SR_NONE
)
1248 tree clobber
= build_constructor (TREE_TYPE (t
), NULL
);
1249 TREE_THIS_VOLATILE (clobber
) = 1;
1250 gimplify_seq_add_stmt (&cleanup
, gimple_build_assign (t
, clobber
));
1257 gimple_seq new_body
;
1260 gs
= gimple_build_try (gimple_bind_body (gimple_bind
), cleanup
,
1261 GIMPLE_TRY_FINALLY
);
1264 gimplify_seq_add_stmt (&new_body
, stack_save
);
1265 gimplify_seq_add_stmt (&new_body
, gs
);
1266 gimple_bind_set_body (gimple_bind
, new_body
);
1269 gimplify_ctxp
->save_stack
= old_save_stack
;
1270 gimple_pop_bind_expr ();
1272 gimplify_seq_add_stmt (pre_p
, gimple_bind
);
1280 *expr_p
= NULL_TREE
;
1284 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1285 GIMPLE value, it is assigned to a new temporary and the statement is
1286 re-written to return the temporary.
1288 PRE_P points to the sequence where side effects that must happen before
1289 STMT should be stored. */
1291 static enum gimplify_status
1292 gimplify_return_expr (tree stmt
, gimple_seq
*pre_p
)
1295 tree ret_expr
= TREE_OPERAND (stmt
, 0);
1296 tree result_decl
, result
;
1298 if (ret_expr
== error_mark_node
)
1302 || TREE_CODE (ret_expr
) == RESULT_DECL
1303 || ret_expr
== error_mark_node
)
1305 gimple ret
= gimple_build_return (ret_expr
);
1306 gimple_set_no_warning (ret
, TREE_NO_WARNING (stmt
));
1307 gimplify_seq_add_stmt (pre_p
, ret
);
1311 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
1312 result_decl
= NULL_TREE
;
1315 result_decl
= TREE_OPERAND (ret_expr
, 0);
1317 /* See through a return by reference. */
1318 if (TREE_CODE (result_decl
) == INDIRECT_REF
)
1319 result_decl
= TREE_OPERAND (result_decl
, 0);
1321 gcc_assert ((TREE_CODE (ret_expr
) == MODIFY_EXPR
1322 || TREE_CODE (ret_expr
) == INIT_EXPR
)
1323 && TREE_CODE (result_decl
) == RESULT_DECL
);
1326 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1327 Recall that aggregate_value_p is FALSE for any aggregate type that is
1328 returned in registers. If we're returning values in registers, then
1329 we don't want to extend the lifetime of the RESULT_DECL, particularly
1330 across another call. In addition, for those aggregates for which
1331 hard_function_value generates a PARALLEL, we'll die during normal
1332 expansion of structure assignments; there's special code in expand_return
1333 to handle this case that does not exist in expand_expr. */
1336 else if (aggregate_value_p (result_decl
, TREE_TYPE (current_function_decl
)))
1338 if (TREE_CODE (DECL_SIZE (result_decl
)) != INTEGER_CST
)
1340 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (result_decl
)))
1341 gimplify_type_sizes (TREE_TYPE (result_decl
), pre_p
);
1342 /* Note that we don't use gimplify_vla_decl because the RESULT_DECL
1343 should be effectively allocated by the caller, i.e. all calls to
1344 this function must be subject to the Return Slot Optimization. */
1345 gimplify_one_sizepos (&DECL_SIZE (result_decl
), pre_p
);
1346 gimplify_one_sizepos (&DECL_SIZE_UNIT (result_decl
), pre_p
);
1348 result
= result_decl
;
1350 else if (gimplify_ctxp
->return_temp
)
1351 result
= gimplify_ctxp
->return_temp
;
1354 result
= create_tmp_reg (TREE_TYPE (result_decl
), NULL
);
1356 /* ??? With complex control flow (usually involving abnormal edges),
1357 we can wind up warning about an uninitialized value for this. Due
1358 to how this variable is constructed and initialized, this is never
1359 true. Give up and never warn. */
1360 TREE_NO_WARNING (result
) = 1;
1362 gimplify_ctxp
->return_temp
= result
;
1365 /* Smash the lhs of the MODIFY_EXPR to the temporary we plan to use.
1366 Then gimplify the whole thing. */
1367 if (result
!= result_decl
)
1368 TREE_OPERAND (ret_expr
, 0) = result
;
1370 gimplify_and_add (TREE_OPERAND (stmt
, 0), pre_p
);
1372 ret
= gimple_build_return (result
);
1373 gimple_set_no_warning (ret
, TREE_NO_WARNING (stmt
));
1374 gimplify_seq_add_stmt (pre_p
, ret
);
1379 /* Gimplify a variable-length array DECL. */
1382 gimplify_vla_decl (tree decl
, gimple_seq
*seq_p
)
1384 /* This is a variable-sized decl. Simplify its size and mark it
1385 for deferred expansion. Note that mudflap depends on the format
1386 of the emitted code: see mx_register_decls(). */
1387 tree t
, addr
, ptr_type
;
1389 gimplify_one_sizepos (&DECL_SIZE (decl
), seq_p
);
1390 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl
), seq_p
);
1392 /* All occurrences of this decl in final gimplified code will be
1393 replaced by indirection. Setting DECL_VALUE_EXPR does two
1394 things: First, it lets the rest of the gimplifier know what
1395 replacement to use. Second, it lets the debug info know
1396 where to find the value. */
1397 ptr_type
= build_pointer_type (TREE_TYPE (decl
));
1398 addr
= create_tmp_var (ptr_type
, get_name (decl
));
1399 DECL_IGNORED_P (addr
) = 0;
1400 t
= build_fold_indirect_ref (addr
);
1401 TREE_THIS_NOTRAP (t
) = 1;
1402 SET_DECL_VALUE_EXPR (decl
, t
);
1403 DECL_HAS_VALUE_EXPR_P (decl
) = 1;
1405 t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
);
1406 t
= build_call_expr (t
, 2, DECL_SIZE_UNIT (decl
),
1407 size_int (DECL_ALIGN (decl
)));
1408 /* The call has been built for a variable-sized object. */
1409 CALL_ALLOCA_FOR_VAR_P (t
) = 1;
1410 t
= fold_convert (ptr_type
, t
);
1411 t
= build2 (MODIFY_EXPR
, TREE_TYPE (addr
), addr
, t
);
1413 gimplify_and_add (t
, seq_p
);
1415 /* Indicate that we need to restore the stack level when the
1416 enclosing BIND_EXPR is exited. */
1417 gimplify_ctxp
->save_stack
= true;
1420 /* Gimplify a DECL_EXPR node *STMT_P by making any necessary allocation
1421 and initialization explicit. */
1423 static enum gimplify_status
1424 gimplify_decl_expr (tree
*stmt_p
, gimple_seq
*seq_p
)
1426 tree stmt
= *stmt_p
;
1427 tree decl
= DECL_EXPR_DECL (stmt
);
1429 *stmt_p
= NULL_TREE
;
1431 if (TREE_TYPE (decl
) == error_mark_node
)
1434 if ((TREE_CODE (decl
) == TYPE_DECL
1435 || TREE_CODE (decl
) == VAR_DECL
)
1436 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl
)))
1437 gimplify_type_sizes (TREE_TYPE (decl
), seq_p
);
1439 /* ??? DECL_ORIGINAL_TYPE is streamed for LTO so it needs to be gimplified
1440 in case its size expressions contain problematic nodes like CALL_EXPR. */
1441 if (TREE_CODE (decl
) == TYPE_DECL
1442 && DECL_ORIGINAL_TYPE (decl
)
1443 && !TYPE_SIZES_GIMPLIFIED (DECL_ORIGINAL_TYPE (decl
)))
1444 gimplify_type_sizes (DECL_ORIGINAL_TYPE (decl
), seq_p
);
1446 if (TREE_CODE (decl
) == VAR_DECL
&& !DECL_EXTERNAL (decl
))
1448 tree init
= DECL_INITIAL (decl
);
1450 if (TREE_CODE (DECL_SIZE_UNIT (decl
)) != INTEGER_CST
1451 || (!TREE_STATIC (decl
)
1452 && flag_stack_check
== GENERIC_STACK_CHECK
1453 && compare_tree_int (DECL_SIZE_UNIT (decl
),
1454 STACK_CHECK_MAX_VAR_SIZE
) > 0))
1455 gimplify_vla_decl (decl
, seq_p
);
1457 /* Some front ends do not explicitly declare all anonymous
1458 artificial variables. We compensate here by declaring the
1459 variables, though it would be better if the front ends would
1460 explicitly declare them. */
1461 if (!DECL_SEEN_IN_BIND_EXPR_P (decl
)
1462 && DECL_ARTIFICIAL (decl
) && DECL_NAME (decl
) == NULL_TREE
)
1463 gimple_add_tmp_var (decl
);
1465 if (init
&& init
!= error_mark_node
)
1467 if (!TREE_STATIC (decl
))
1469 DECL_INITIAL (decl
) = NULL_TREE
;
1470 init
= build2 (INIT_EXPR
, void_type_node
, decl
, init
);
1471 gimplify_and_add (init
, seq_p
);
1475 /* We must still examine initializers for static variables
1476 as they may contain a label address. */
1477 walk_tree (&init
, force_labels_r
, NULL
, NULL
);
1484 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1485 and replacing the LOOP_EXPR with goto, but if the loop contains an
1486 EXIT_EXPR, we need to append a label for it to jump to. */
1488 static enum gimplify_status
1489 gimplify_loop_expr (tree
*expr_p
, gimple_seq
*pre_p
)
1491 tree saved_label
= gimplify_ctxp
->exit_label
;
1492 tree start_label
= create_artificial_label (UNKNOWN_LOCATION
);
1494 gimplify_seq_add_stmt (pre_p
, gimple_build_label (start_label
));
1496 gimplify_ctxp
->exit_label
= NULL_TREE
;
1498 gimplify_and_add (LOOP_EXPR_BODY (*expr_p
), pre_p
);
1500 gimplify_seq_add_stmt (pre_p
, gimple_build_goto (start_label
));
1502 if (gimplify_ctxp
->exit_label
)
1503 gimplify_seq_add_stmt (pre_p
,
1504 gimple_build_label (gimplify_ctxp
->exit_label
));
1506 gimplify_ctxp
->exit_label
= saved_label
;
1512 /* Gimplify a statement list onto a sequence. These may be created either
1513 by an enlightened front-end, or by shortcut_cond_expr. */
1515 static enum gimplify_status
1516 gimplify_statement_list (tree
*expr_p
, gimple_seq
*pre_p
)
1518 tree temp
= voidify_wrapper_expr (*expr_p
, NULL
);
1520 tree_stmt_iterator i
= tsi_start (*expr_p
);
1522 while (!tsi_end_p (i
))
1524 gimplify_stmt (tsi_stmt_ptr (i
), pre_p
);
1537 /* Compare two case labels. Because the front end should already have
1538 made sure that case ranges do not overlap, it is enough to only compare
1539 the CASE_LOW values of each case label. */
1542 compare_case_labels (const void *p1
, const void *p2
)
1544 const_tree
const case1
= *(const_tree
const*)p1
;
1545 const_tree
const case2
= *(const_tree
const*)p2
;
1547 /* The 'default' case label always goes first. */
1548 if (!CASE_LOW (case1
))
1550 else if (!CASE_LOW (case2
))
1553 return tree_int_cst_compare (CASE_LOW (case1
), CASE_LOW (case2
));
1556 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1559 sort_case_labels (VEC(tree
,heap
)* label_vec
)
1561 VEC_qsort (tree
, label_vec
, compare_case_labels
);
1564 /* Prepare a vector of case labels to be used in a GIMPLE_SWITCH statement.
1566 LABELS is a vector that contains all case labels to look at.
1568 INDEX_TYPE is the type of the switch index expression. Case labels
1569 in LABELS are discarded if their values are not in the value range
1570 covered by INDEX_TYPE. The remaining case label values are folded
1573 If a default case exists in LABELS, it is removed from LABELS and
1574 returned in DEFAULT_CASEP. If no default case exists, but the
1575 case labels already cover the whole range of INDEX_TYPE, a default
1576 case is returned pointing to one of the existing case labels.
1577 Otherwise DEFAULT_CASEP is set to NULL_TREE.
1579 DEFAULT_CASEP may be NULL, in which case the above comment doesn't
1580 apply and no action is taken regardless of whether a default case is
1584 preprocess_case_label_vec_for_gimple (VEC(tree
,heap
) *labels
,
1586 tree
*default_casep
)
1588 tree min_value
, max_value
;
1589 tree default_case
= NULL_TREE
;
1593 min_value
= TYPE_MIN_VALUE (index_type
);
1594 max_value
= TYPE_MAX_VALUE (index_type
);
1595 while (i
< VEC_length (tree
, labels
))
1597 tree elt
= VEC_index (tree
, labels
, i
);
1598 tree low
= CASE_LOW (elt
);
1599 tree high
= CASE_HIGH (elt
);
1600 bool remove_element
= FALSE
;
1604 gcc_checking_assert (TREE_CODE (low
) == INTEGER_CST
);
1605 gcc_checking_assert (!high
|| TREE_CODE (high
) == INTEGER_CST
);
1607 /* This is a non-default case label, i.e. it has a value.
1609 See if the case label is reachable within the range of
1610 the index type. Remove out-of-range case values. Turn
1611 case ranges into a canonical form (high > low strictly)
1612 and convert the case label values to the index type.
1614 NB: The type of gimple_switch_index() may be the promoted
1615 type, but the case labels retain the original type. */
1619 /* This is a case range. Discard empty ranges.
1620 If the bounds or the range are equal, turn this
1621 into a simple (one-value) case. */
1622 int cmp
= tree_int_cst_compare (high
, low
);
1624 remove_element
= TRUE
;
1631 /* If the simple case value is unreachable, ignore it. */
1632 if ((TREE_CODE (min_value
) == INTEGER_CST
1633 && tree_int_cst_compare (low
, min_value
) < 0)
1634 || (TREE_CODE (max_value
) == INTEGER_CST
1635 && tree_int_cst_compare (low
, max_value
) > 0))
1636 remove_element
= TRUE
;
1638 low
= fold_convert (index_type
, low
);
1642 /* If the entire case range is unreachable, ignore it. */
1643 if ((TREE_CODE (min_value
) == INTEGER_CST
1644 && tree_int_cst_compare (high
, min_value
) < 0)
1645 || (TREE_CODE (max_value
) == INTEGER_CST
1646 && tree_int_cst_compare (low
, max_value
) > 0))
1647 remove_element
= TRUE
;
1650 /* If the lower bound is less than the index type's
1651 minimum value, truncate the range bounds. */
1652 if (TREE_CODE (min_value
) == INTEGER_CST
1653 && tree_int_cst_compare (low
, min_value
) < 0)
1655 low
= fold_convert (index_type
, low
);
1657 /* If the upper bound is greater than the index type's
1658 maximum value, truncate the range bounds. */
1659 if (TREE_CODE (max_value
) == INTEGER_CST
1660 && tree_int_cst_compare (high
, max_value
) > 0)
1662 high
= fold_convert (index_type
, high
);
1664 /* We may have folded a case range to a one-value case. */
1665 if (tree_int_cst_equal (low
, high
))
1670 CASE_LOW (elt
) = low
;
1671 CASE_HIGH (elt
) = high
;
1675 gcc_assert (!default_case
);
1677 /* The default case must be passed separately to the
1678 gimple_build_switch routine. But if DEFAULT_CASEP
1679 is NULL, we do not remove the default case (it would
1680 be completely lost). */
1682 remove_element
= TRUE
;
1686 VEC_ordered_remove (tree
, labels
, i
);
1692 if (!VEC_empty (tree
, labels
))
1693 sort_case_labels (labels
);
1695 if (default_casep
&& !default_case
)
1697 /* If the switch has no default label, add one, so that we jump
1698 around the switch body. If the labels already cover the whole
1699 range of the switch index_type, add the default label pointing
1700 to one of the existing labels. */
1702 && TYPE_MIN_VALUE (index_type
)
1703 && TYPE_MAX_VALUE (index_type
)
1704 && tree_int_cst_equal (CASE_LOW (VEC_index (tree
, labels
, 0)),
1705 TYPE_MIN_VALUE (index_type
)))
1707 tree low
, high
= CASE_HIGH (VEC_index (tree
, labels
, len
- 1));
1709 high
= CASE_LOW (VEC_index (tree
, labels
, len
- 1));
1710 if (tree_int_cst_equal (high
, TYPE_MAX_VALUE (index_type
)))
1712 for (i
= 1; i
< len
; i
++)
1714 high
= CASE_LOW (VEC_index (tree
, labels
, i
));
1715 low
= CASE_HIGH (VEC_index (tree
, labels
, i
- 1));
1717 low
= CASE_LOW (VEC_index (tree
, labels
, i
- 1));
1718 if ((TREE_INT_CST_LOW (low
) + 1
1719 != TREE_INT_CST_LOW (high
))
1720 || (TREE_INT_CST_HIGH (low
)
1721 + (TREE_INT_CST_LOW (high
) == 0)
1722 != TREE_INT_CST_HIGH (high
)))
1727 tree label
= CASE_LABEL (VEC_index (tree
, labels
, 0));
1728 default_case
= build_case_label (NULL_TREE
, NULL_TREE
,
1736 *default_casep
= default_case
;
1739 /* Gimplify a SWITCH_EXPR, and collect the vector of labels it can
1742 static enum gimplify_status
1743 gimplify_switch_expr (tree
*expr_p
, gimple_seq
*pre_p
)
1745 tree switch_expr
= *expr_p
;
1746 gimple_seq switch_body_seq
= NULL
;
1747 enum gimplify_status ret
;
1748 tree index_type
= TREE_TYPE (switch_expr
);
1749 if (index_type
== NULL_TREE
)
1750 index_type
= TREE_TYPE (SWITCH_COND (switch_expr
));
1752 ret
= gimplify_expr (&SWITCH_COND (switch_expr
), pre_p
, NULL
, is_gimple_val
,
1754 if (ret
== GS_ERROR
|| ret
== GS_UNHANDLED
)
1757 if (SWITCH_BODY (switch_expr
))
1759 VEC (tree
,heap
) *labels
;
1760 VEC (tree
,heap
) *saved_labels
;
1761 tree default_case
= NULL_TREE
;
1762 gimple gimple_switch
;
1764 /* If someone can be bothered to fill in the labels, they can
1765 be bothered to null out the body too. */
1766 gcc_assert (!SWITCH_LABELS (switch_expr
));
1768 /* Save old labels, get new ones from body, then restore the old
1769 labels. Save all the things from the switch body to append after. */
1770 saved_labels
= gimplify_ctxp
->case_labels
;
1771 gimplify_ctxp
->case_labels
= VEC_alloc (tree
, heap
, 8);
1773 gimplify_stmt (&SWITCH_BODY (switch_expr
), &switch_body_seq
);
1774 labels
= gimplify_ctxp
->case_labels
;
1775 gimplify_ctxp
->case_labels
= saved_labels
;
1777 preprocess_case_label_vec_for_gimple (labels
, index_type
,
1785 = build_case_label (NULL_TREE
, NULL_TREE
,
1786 create_artificial_label (UNKNOWN_LOCATION
));
1787 new_default
= gimple_build_label (CASE_LABEL (default_case
));
1788 gimplify_seq_add_stmt (&switch_body_seq
, new_default
);
1791 gimple_switch
= gimple_build_switch (SWITCH_COND (switch_expr
),
1792 default_case
, labels
);
1793 gimplify_seq_add_stmt (pre_p
, gimple_switch
);
1794 gimplify_seq_add_seq (pre_p
, switch_body_seq
);
1795 VEC_free(tree
, heap
, labels
);
1798 gcc_assert (SWITCH_LABELS (switch_expr
));
1803 /* Gimplify the CASE_LABEL_EXPR pointed to by EXPR_P. */
1805 static enum gimplify_status
1806 gimplify_case_label_expr (tree
*expr_p
, gimple_seq
*pre_p
)
1808 struct gimplify_ctx
*ctxp
;
1809 gimple gimple_label
;
1811 /* Invalid OpenMP programs can play Duff's Device type games with
1812 #pragma omp parallel. At least in the C front end, we don't
1813 detect such invalid branches until after gimplification. */
1814 for (ctxp
= gimplify_ctxp
; ; ctxp
= ctxp
->prev_context
)
1815 if (ctxp
->case_labels
)
1818 gimple_label
= gimple_build_label (CASE_LABEL (*expr_p
));
1819 VEC_safe_push (tree
, heap
, ctxp
->case_labels
, *expr_p
);
1820 gimplify_seq_add_stmt (pre_p
, gimple_label
);
1825 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1829 build_and_jump (tree
*label_p
)
1831 if (label_p
== NULL
)
1832 /* If there's nowhere to jump, just fall through. */
1835 if (*label_p
== NULL_TREE
)
1837 tree label
= create_artificial_label (UNKNOWN_LOCATION
);
1841 return build1 (GOTO_EXPR
, void_type_node
, *label_p
);
1844 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1845 This also involves building a label to jump to and communicating it to
1846 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1848 static enum gimplify_status
1849 gimplify_exit_expr (tree
*expr_p
)
1851 tree cond
= TREE_OPERAND (*expr_p
, 0);
1854 expr
= build_and_jump (&gimplify_ctxp
->exit_label
);
1855 expr
= build3 (COND_EXPR
, void_type_node
, cond
, expr
, NULL_TREE
);
1861 /* A helper function to be called via walk_tree. Mark all labels under *TP
1862 as being forced. To be called for DECL_INITIAL of static variables. */
1865 force_labels_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
1869 if (TREE_CODE (*tp
) == LABEL_DECL
)
1870 FORCED_LABEL (*tp
) = 1;
1875 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1876 different from its canonical type, wrap the whole thing inside a
1877 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1880 The canonical type of a COMPONENT_REF is the type of the field being
1881 referenced--unless the field is a bit-field which can be read directly
1882 in a smaller mode, in which case the canonical type is the
1883 sign-appropriate type corresponding to that mode. */
1886 canonicalize_component_ref (tree
*expr_p
)
1888 tree expr
= *expr_p
;
1891 gcc_assert (TREE_CODE (expr
) == COMPONENT_REF
);
1893 if (INTEGRAL_TYPE_P (TREE_TYPE (expr
)))
1894 type
= TREE_TYPE (get_unwidened (expr
, NULL_TREE
));
1896 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
1898 /* One could argue that all the stuff below is not necessary for
1899 the non-bitfield case and declare it a FE error if type
1900 adjustment would be needed. */
1901 if (TREE_TYPE (expr
) != type
)
1903 #ifdef ENABLE_TYPES_CHECKING
1904 tree old_type
= TREE_TYPE (expr
);
1908 /* We need to preserve qualifiers and propagate them from
1910 type_quals
= TYPE_QUALS (type
)
1911 | TYPE_QUALS (TREE_TYPE (TREE_OPERAND (expr
, 0)));
1912 if (TYPE_QUALS (type
) != type_quals
)
1913 type
= build_qualified_type (TYPE_MAIN_VARIANT (type
), type_quals
);
1915 /* Set the type of the COMPONENT_REF to the underlying type. */
1916 TREE_TYPE (expr
) = type
;
1918 #ifdef ENABLE_TYPES_CHECKING
1919 /* It is now a FE error, if the conversion from the canonical
1920 type to the original expression type is not useless. */
1921 gcc_assert (useless_type_conversion_p (old_type
, type
));
1926 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1927 to foo, embed that change in the ADDR_EXPR by converting
1932 where L is the lower bound. For simplicity, only do this for constant
1934 The constraint is that the type of &array[L] is trivially convertible
1938 canonicalize_addr_expr (tree
*expr_p
)
1940 tree expr
= *expr_p
;
1941 tree addr_expr
= TREE_OPERAND (expr
, 0);
1942 tree datype
, ddatype
, pddatype
;
1944 /* We simplify only conversions from an ADDR_EXPR to a pointer type. */
1945 if (!POINTER_TYPE_P (TREE_TYPE (expr
))
1946 || TREE_CODE (addr_expr
) != ADDR_EXPR
)
1949 /* The addr_expr type should be a pointer to an array. */
1950 datype
= TREE_TYPE (TREE_TYPE (addr_expr
));
1951 if (TREE_CODE (datype
) != ARRAY_TYPE
)
1954 /* The pointer to element type shall be trivially convertible to
1955 the expression pointer type. */
1956 ddatype
= TREE_TYPE (datype
);
1957 pddatype
= build_pointer_type (ddatype
);
1958 if (!useless_type_conversion_p (TYPE_MAIN_VARIANT (TREE_TYPE (expr
)),
1962 /* The lower bound and element sizes must be constant. */
1963 if (!TYPE_SIZE_UNIT (ddatype
)
1964 || TREE_CODE (TYPE_SIZE_UNIT (ddatype
)) != INTEGER_CST
1965 || !TYPE_DOMAIN (datype
) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))
1966 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))) != INTEGER_CST
)
1969 /* All checks succeeded. Build a new node to merge the cast. */
1970 *expr_p
= build4 (ARRAY_REF
, ddatype
, TREE_OPERAND (addr_expr
, 0),
1971 TYPE_MIN_VALUE (TYPE_DOMAIN (datype
)),
1972 NULL_TREE
, NULL_TREE
);
1973 *expr_p
= build1 (ADDR_EXPR
, pddatype
, *expr_p
);
1975 /* We can have stripped a required restrict qualifier above. */
1976 if (!useless_type_conversion_p (TREE_TYPE (expr
), TREE_TYPE (*expr_p
)))
1977 *expr_p
= fold_convert (TREE_TYPE (expr
), *expr_p
);
1980 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1981 underneath as appropriate. */
1983 static enum gimplify_status
1984 gimplify_conversion (tree
*expr_p
)
1986 location_t loc
= EXPR_LOCATION (*expr_p
);
1987 gcc_assert (CONVERT_EXPR_P (*expr_p
));
1989 /* Then strip away all but the outermost conversion. */
1990 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p
, 0));
1992 /* And remove the outermost conversion if it's useless. */
1993 if (tree_ssa_useless_type_conversion (*expr_p
))
1994 *expr_p
= TREE_OPERAND (*expr_p
, 0);
1996 /* If we still have a conversion at the toplevel,
1997 then canonicalize some constructs. */
1998 if (CONVERT_EXPR_P (*expr_p
))
2000 tree sub
= TREE_OPERAND (*expr_p
, 0);
2002 /* If a NOP conversion is changing the type of a COMPONENT_REF
2003 expression, then canonicalize its type now in order to expose more
2004 redundant conversions. */
2005 if (TREE_CODE (sub
) == COMPONENT_REF
)
2006 canonicalize_component_ref (&TREE_OPERAND (*expr_p
, 0));
2008 /* If a NOP conversion is changing a pointer to array of foo
2009 to a pointer to foo, embed that change in the ADDR_EXPR. */
2010 else if (TREE_CODE (sub
) == ADDR_EXPR
)
2011 canonicalize_addr_expr (expr_p
);
2014 /* If we have a conversion to a non-register type force the
2015 use of a VIEW_CONVERT_EXPR instead. */
2016 if (CONVERT_EXPR_P (*expr_p
) && !is_gimple_reg_type (TREE_TYPE (*expr_p
)))
2017 *expr_p
= fold_build1_loc (loc
, VIEW_CONVERT_EXPR
, TREE_TYPE (*expr_p
),
2018 TREE_OPERAND (*expr_p
, 0));
2023 /* Nonlocal VLAs seen in the current function. */
2024 static struct pointer_set_t
*nonlocal_vlas
;
2026 /* Gimplify a VAR_DECL or PARM_DECL. Return GS_OK if we expanded a
2027 DECL_VALUE_EXPR, and it's worth re-examining things. */
2029 static enum gimplify_status
2030 gimplify_var_or_parm_decl (tree
*expr_p
)
2032 tree decl
= *expr_p
;
2034 /* ??? If this is a local variable, and it has not been seen in any
2035 outer BIND_EXPR, then it's probably the result of a duplicate
2036 declaration, for which we've already issued an error. It would
2037 be really nice if the front end wouldn't leak these at all.
2038 Currently the only known culprit is C++ destructors, as seen
2039 in g++.old-deja/g++.jason/binding.C. */
2040 if (TREE_CODE (decl
) == VAR_DECL
2041 && !DECL_SEEN_IN_BIND_EXPR_P (decl
)
2042 && !TREE_STATIC (decl
) && !DECL_EXTERNAL (decl
)
2043 && decl_function_context (decl
) == current_function_decl
)
2045 gcc_assert (seen_error ());
2049 /* When within an OpenMP context, notice uses of variables. */
2050 if (gimplify_omp_ctxp
&& omp_notice_variable (gimplify_omp_ctxp
, decl
, true))
2053 /* If the decl is an alias for another expression, substitute it now. */
2054 if (DECL_HAS_VALUE_EXPR_P (decl
))
2056 tree value_expr
= DECL_VALUE_EXPR (decl
);
2058 /* For referenced nonlocal VLAs add a decl for debugging purposes
2059 to the current function. */
2060 if (TREE_CODE (decl
) == VAR_DECL
2061 && TREE_CODE (DECL_SIZE_UNIT (decl
)) != INTEGER_CST
2062 && nonlocal_vlas
!= NULL
2063 && TREE_CODE (value_expr
) == INDIRECT_REF
2064 && TREE_CODE (TREE_OPERAND (value_expr
, 0)) == VAR_DECL
2065 && decl_function_context (decl
) != current_function_decl
)
2067 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
2068 while (ctx
&& ctx
->region_type
== ORT_WORKSHARE
)
2069 ctx
= ctx
->outer_context
;
2070 if (!ctx
&& !pointer_set_insert (nonlocal_vlas
, decl
))
2072 tree copy
= copy_node (decl
), block
;
2074 lang_hooks
.dup_lang_specific_decl (copy
);
2075 SET_DECL_RTL (copy
, 0);
2076 TREE_USED (copy
) = 1;
2077 block
= DECL_INITIAL (current_function_decl
);
2078 DECL_CHAIN (copy
) = BLOCK_VARS (block
);
2079 BLOCK_VARS (block
) = copy
;
2080 SET_DECL_VALUE_EXPR (copy
, unshare_expr (value_expr
));
2081 DECL_HAS_VALUE_EXPR_P (copy
) = 1;
2085 *expr_p
= unshare_expr (value_expr
);
2092 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
2096 : min_lval '[' val ']'
2098 | compound_lval '[' val ']'
2099 | compound_lval '.' ID
2101 This is not part of the original SIMPLE definition, which separates
2102 array and member references, but it seems reasonable to handle them
2103 together. Also, this way we don't run into problems with union
2104 aliasing; gcc requires that for accesses through a union to alias, the
2105 union reference must be explicit, which was not always the case when we
2106 were splitting up array and member refs.
2108 PRE_P points to the sequence where side effects that must happen before
2109 *EXPR_P should be stored.
2111 POST_P points to the sequence where side effects that must happen after
2112 *EXPR_P should be stored. */
2114 static enum gimplify_status
2115 gimplify_compound_lval (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
2116 fallback_t fallback
)
2119 VEC(tree
,heap
) *expr_stack
;
2120 enum gimplify_status ret
= GS_ALL_DONE
, tret
;
2122 location_t loc
= EXPR_LOCATION (*expr_p
);
2123 tree expr
= *expr_p
;
2125 /* Create a stack of the subexpressions so later we can walk them in
2126 order from inner to outer. */
2127 expr_stack
= VEC_alloc (tree
, heap
, 10);
2129 /* We can handle anything that get_inner_reference can deal with. */
2130 for (p
= expr_p
; ; p
= &TREE_OPERAND (*p
, 0))
2133 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
2134 if (TREE_CODE (*p
) == INDIRECT_REF
)
2135 *p
= fold_indirect_ref_loc (loc
, *p
);
2137 if (handled_component_p (*p
))
2139 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
2140 additional COMPONENT_REFs. */
2141 else if ((TREE_CODE (*p
) == VAR_DECL
|| TREE_CODE (*p
) == PARM_DECL
)
2142 && gimplify_var_or_parm_decl (p
) == GS_OK
)
2147 VEC_safe_push (tree
, heap
, expr_stack
, *p
);
2150 gcc_assert (VEC_length (tree
, expr_stack
));
2152 /* Now EXPR_STACK is a stack of pointers to all the refs we've
2153 walked through and P points to the innermost expression.
2155 Java requires that we elaborated nodes in source order. That
2156 means we must gimplify the inner expression followed by each of
2157 the indices, in order. But we can't gimplify the inner
2158 expression until we deal with any variable bounds, sizes, or
2159 positions in order to deal with PLACEHOLDER_EXPRs.
2161 So we do this in three steps. First we deal with the annotations
2162 for any variables in the components, then we gimplify the base,
2163 then we gimplify any indices, from left to right. */
2164 for (i
= VEC_length (tree
, expr_stack
) - 1; i
>= 0; i
--)
2166 tree t
= VEC_index (tree
, expr_stack
, i
);
2168 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
2170 /* Gimplify the low bound and element type size and put them into
2171 the ARRAY_REF. If these values are set, they have already been
2173 if (TREE_OPERAND (t
, 2) == NULL_TREE
)
2175 tree low
= unshare_expr (array_ref_low_bound (t
));
2176 if (!is_gimple_min_invariant (low
))
2178 TREE_OPERAND (t
, 2) = low
;
2179 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
,
2180 post_p
, is_gimple_reg
,
2182 ret
= MIN (ret
, tret
);
2187 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
2188 is_gimple_reg
, fb_rvalue
);
2189 ret
= MIN (ret
, tret
);
2192 if (TREE_OPERAND (t
, 3) == NULL_TREE
)
2194 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (t
, 0)));
2195 tree elmt_size
= unshare_expr (array_ref_element_size (t
));
2196 tree factor
= size_int (TYPE_ALIGN_UNIT (elmt_type
));
2198 /* Divide the element size by the alignment of the element
2201 = size_binop_loc (loc
, EXACT_DIV_EXPR
, elmt_size
, factor
);
2203 if (!is_gimple_min_invariant (elmt_size
))
2205 TREE_OPERAND (t
, 3) = elmt_size
;
2206 tret
= gimplify_expr (&TREE_OPERAND (t
, 3), pre_p
,
2207 post_p
, is_gimple_reg
,
2209 ret
= MIN (ret
, tret
);
2214 tret
= gimplify_expr (&TREE_OPERAND (t
, 3), pre_p
, post_p
,
2215 is_gimple_reg
, fb_rvalue
);
2216 ret
= MIN (ret
, tret
);
2219 else if (TREE_CODE (t
) == COMPONENT_REF
)
2221 /* Set the field offset into T and gimplify it. */
2222 if (TREE_OPERAND (t
, 2) == NULL_TREE
)
2224 tree offset
= unshare_expr (component_ref_field_offset (t
));
2225 tree field
= TREE_OPERAND (t
, 1);
2227 = size_int (DECL_OFFSET_ALIGN (field
) / BITS_PER_UNIT
);
2229 /* Divide the offset by its alignment. */
2230 offset
= size_binop_loc (loc
, EXACT_DIV_EXPR
, offset
, factor
);
2232 if (!is_gimple_min_invariant (offset
))
2234 TREE_OPERAND (t
, 2) = offset
;
2235 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
,
2236 post_p
, is_gimple_reg
,
2238 ret
= MIN (ret
, tret
);
2243 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
2244 is_gimple_reg
, fb_rvalue
);
2245 ret
= MIN (ret
, tret
);
2250 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
2251 so as to match the min_lval predicate. Failure to do so may result
2252 in the creation of large aggregate temporaries. */
2253 tret
= gimplify_expr (p
, pre_p
, post_p
, is_gimple_min_lval
,
2254 fallback
| fb_lvalue
);
2255 ret
= MIN (ret
, tret
);
2257 /* And finally, the indices and operands of ARRAY_REF. During this
2258 loop we also remove any useless conversions. */
2259 for (; VEC_length (tree
, expr_stack
) > 0; )
2261 tree t
= VEC_pop (tree
, expr_stack
);
2263 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
2265 /* Gimplify the dimension. */
2266 if (!is_gimple_min_invariant (TREE_OPERAND (t
, 1)))
2268 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), pre_p
, post_p
,
2269 is_gimple_val
, fb_rvalue
);
2270 ret
= MIN (ret
, tret
);
2274 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t
, 0));
2276 /* The innermost expression P may have originally had
2277 TREE_SIDE_EFFECTS set which would have caused all the outer
2278 expressions in *EXPR_P leading to P to also have had
2279 TREE_SIDE_EFFECTS set. */
2280 recalculate_side_effects (t
);
2283 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
2284 if ((fallback
& fb_rvalue
) && TREE_CODE (*expr_p
) == COMPONENT_REF
)
2286 canonicalize_component_ref (expr_p
);
2289 VEC_free (tree
, heap
, expr_stack
);
2291 gcc_assert (*expr_p
== expr
|| ret
!= GS_ALL_DONE
);
2296 /* Gimplify the self modifying expression pointed to by EXPR_P
2299 PRE_P points to the list where side effects that must happen before
2300 *EXPR_P should be stored.
2302 POST_P points to the list where side effects that must happen after
2303 *EXPR_P should be stored.
2305 WANT_VALUE is nonzero iff we want to use the value of this expression
2306 in another expression. */
2308 static enum gimplify_status
2309 gimplify_self_mod_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
2312 enum tree_code code
;
2313 tree lhs
, lvalue
, rhs
, t1
;
2314 gimple_seq post
= NULL
, *orig_post_p
= post_p
;
2316 enum tree_code arith_code
;
2317 enum gimplify_status ret
;
2318 location_t loc
= EXPR_LOCATION (*expr_p
);
2320 code
= TREE_CODE (*expr_p
);
2322 gcc_assert (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
2323 || code
== PREINCREMENT_EXPR
|| code
== PREDECREMENT_EXPR
);
2325 /* Prefix or postfix? */
2326 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
2327 /* Faster to treat as prefix if result is not used. */
2328 postfix
= want_value
;
2332 /* For postfix, make sure the inner expression's post side effects
2333 are executed after side effects from this expression. */
2337 /* Add or subtract? */
2338 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
2339 arith_code
= PLUS_EXPR
;
2341 arith_code
= MINUS_EXPR
;
2343 /* Gimplify the LHS into a GIMPLE lvalue. */
2344 lvalue
= TREE_OPERAND (*expr_p
, 0);
2345 ret
= gimplify_expr (&lvalue
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
2346 if (ret
== GS_ERROR
)
2349 /* Extract the operands to the arithmetic operation. */
2351 rhs
= TREE_OPERAND (*expr_p
, 1);
2353 /* For postfix operator, we evaluate the LHS to an rvalue and then use
2354 that as the result value and in the postqueue operation. We also
2355 make sure to make lvalue a minimal lval, see
2356 gcc.c-torture/execute/20040313-1.c for an example where this matters. */
2359 if (!is_gimple_min_lval (lvalue
))
2361 mark_addressable (lvalue
);
2362 lvalue
= build_fold_addr_expr_loc (input_location
, lvalue
);
2363 gimplify_expr (&lvalue
, pre_p
, post_p
, is_gimple_val
, fb_rvalue
);
2364 lvalue
= build_fold_indirect_ref_loc (input_location
, lvalue
);
2366 ret
= gimplify_expr (&lhs
, pre_p
, post_p
, is_gimple_val
, fb_rvalue
);
2367 if (ret
== GS_ERROR
)
2371 /* For POINTERs increment, use POINTER_PLUS_EXPR. */
2372 if (POINTER_TYPE_P (TREE_TYPE (lhs
)))
2374 rhs
= convert_to_ptrofftype_loc (loc
, rhs
);
2375 if (arith_code
== MINUS_EXPR
)
2376 rhs
= fold_build1_loc (loc
, NEGATE_EXPR
, TREE_TYPE (rhs
), rhs
);
2377 arith_code
= POINTER_PLUS_EXPR
;
2382 tree t2
= get_initialized_tmp_var (lhs
, pre_p
, NULL
);
2383 t1
= build2 (arith_code
, TREE_TYPE (*expr_p
), t2
, rhs
);
2384 gimplify_assign (lvalue
, t1
, pre_p
);
2385 gimplify_seq_add_seq (orig_post_p
, post
);
2391 t1
= build2 (arith_code
, TREE_TYPE (*expr_p
), lhs
, rhs
);
2392 *expr_p
= build2 (MODIFY_EXPR
, TREE_TYPE (lvalue
), lvalue
, t1
);
2397 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
2400 maybe_with_size_expr (tree
*expr_p
)
2402 tree expr
= *expr_p
;
2403 tree type
= TREE_TYPE (expr
);
2406 /* If we've already wrapped this or the type is error_mark_node, we can't do
2408 if (TREE_CODE (expr
) == WITH_SIZE_EXPR
2409 || type
== error_mark_node
)
2412 /* If the size isn't known or is a constant, we have nothing to do. */
2413 size
= TYPE_SIZE_UNIT (type
);
2414 if (!size
|| TREE_CODE (size
) == INTEGER_CST
)
2417 /* Otherwise, make a WITH_SIZE_EXPR. */
2418 size
= unshare_expr (size
);
2419 size
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (size
, expr
);
2420 *expr_p
= build2 (WITH_SIZE_EXPR
, type
, expr
, size
);
2423 /* Helper for gimplify_call_expr. Gimplify a single argument *ARG_P
2424 Store any side-effects in PRE_P. CALL_LOCATION is the location of
2427 static enum gimplify_status
2428 gimplify_arg (tree
*arg_p
, gimple_seq
*pre_p
, location_t call_location
)
2430 bool (*test
) (tree
);
2433 /* In general, we allow lvalues for function arguments to avoid
2434 extra overhead of copying large aggregates out of even larger
2435 aggregates into temporaries only to copy the temporaries to
2436 the argument list. Make optimizers happy by pulling out to
2437 temporaries those types that fit in registers. */
2438 if (is_gimple_reg_type (TREE_TYPE (*arg_p
)))
2439 test
= is_gimple_val
, fb
= fb_rvalue
;
2442 test
= is_gimple_lvalue
, fb
= fb_either
;
2443 /* Also strip a TARGET_EXPR that would force an extra copy. */
2444 if (TREE_CODE (*arg_p
) == TARGET_EXPR
)
2446 tree init
= TARGET_EXPR_INITIAL (*arg_p
);
2448 && !VOID_TYPE_P (TREE_TYPE (init
)))
2453 /* If this is a variable sized type, we must remember the size. */
2454 maybe_with_size_expr (arg_p
);
2456 /* FIXME diagnostics: This will mess up gcc.dg/Warray-bounds.c. */
2457 /* Make sure arguments have the same location as the function call
2459 protected_set_expr_location (*arg_p
, call_location
);
2461 /* There is a sequence point before a function call. Side effects in
2462 the argument list must occur before the actual call. So, when
2463 gimplifying arguments, force gimplify_expr to use an internal
2464 post queue which is then appended to the end of PRE_P. */
2465 return gimplify_expr (arg_p
, pre_p
, NULL
, test
, fb
);
2468 /* Gimplify the CALL_EXPR node *EXPR_P into the GIMPLE sequence PRE_P.
2469 WANT_VALUE is true if the result of the call is desired. */
2471 static enum gimplify_status
2472 gimplify_call_expr (tree
*expr_p
, gimple_seq
*pre_p
, bool want_value
)
2474 tree fndecl
, parms
, p
, fnptrtype
;
2475 enum gimplify_status ret
;
2478 bool builtin_va_start_p
= FALSE
;
2479 location_t loc
= EXPR_LOCATION (*expr_p
);
2481 gcc_assert (TREE_CODE (*expr_p
) == CALL_EXPR
);
2483 /* For reliable diagnostics during inlining, it is necessary that
2484 every call_expr be annotated with file and line. */
2485 if (! EXPR_HAS_LOCATION (*expr_p
))
2486 SET_EXPR_LOCATION (*expr_p
, input_location
);
2488 /* This may be a call to a builtin function.
2490 Builtin function calls may be transformed into different
2491 (and more efficient) builtin function calls under certain
2492 circumstances. Unfortunately, gimplification can muck things
2493 up enough that the builtin expanders are not aware that certain
2494 transformations are still valid.
2496 So we attempt transformation/gimplification of the call before
2497 we gimplify the CALL_EXPR. At this time we do not manage to
2498 transform all calls in the same manner as the expanders do, but
2499 we do transform most of them. */
2500 fndecl
= get_callee_fndecl (*expr_p
);
2502 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
2503 switch (DECL_FUNCTION_CODE (fndecl
))
2505 case BUILT_IN_VA_START
:
2507 builtin_va_start_p
= TRUE
;
2508 if (call_expr_nargs (*expr_p
) < 2)
2510 error ("too few arguments to function %<va_start%>");
2511 *expr_p
= build_empty_stmt (EXPR_LOCATION (*expr_p
));
2515 if (fold_builtin_next_arg (*expr_p
, true))
2517 *expr_p
= build_empty_stmt (EXPR_LOCATION (*expr_p
));
2524 expanded_location loc
= expand_location (EXPR_LOCATION (*expr_p
));
2525 *expr_p
= build_int_cst (TREE_TYPE (*expr_p
), loc
.line
);
2530 expanded_location loc
= expand_location (EXPR_LOCATION (*expr_p
));
2531 *expr_p
= build_string_literal (strlen (loc
.file
) + 1, loc
.file
);
2534 case BUILT_IN_FUNCTION
:
2536 const char *function
;
2537 function
= IDENTIFIER_POINTER (DECL_NAME (current_function_decl
));
2538 *expr_p
= build_string_literal (strlen (function
) + 1, function
);
2544 if (fndecl
&& DECL_BUILT_IN (fndecl
))
2546 tree new_tree
= fold_call_expr (input_location
, *expr_p
, !want_value
);
2547 if (new_tree
&& new_tree
!= *expr_p
)
2549 /* There was a transformation of this call which computes the
2550 same value, but in a more efficient way. Return and try
2557 /* Remember the original function pointer type. */
2558 fnptrtype
= TREE_TYPE (CALL_EXPR_FN (*expr_p
));
2560 /* There is a sequence point before the call, so any side effects in
2561 the calling expression must occur before the actual call. Force
2562 gimplify_expr to use an internal post queue. */
2563 ret
= gimplify_expr (&CALL_EXPR_FN (*expr_p
), pre_p
, NULL
,
2564 is_gimple_call_addr
, fb_rvalue
);
2566 nargs
= call_expr_nargs (*expr_p
);
2568 /* Get argument types for verification. */
2569 fndecl
= get_callee_fndecl (*expr_p
);
2572 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
2573 else if (POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_FN (*expr_p
))))
2574 parms
= TYPE_ARG_TYPES (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (*expr_p
))));
2576 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
2577 p
= DECL_ARGUMENTS (fndecl
);
2582 for (i
= 0; i
< nargs
&& p
; i
++, p
= TREE_CHAIN (p
))
2585 /* If the last argument is __builtin_va_arg_pack () and it is not
2586 passed as a named argument, decrease the number of CALL_EXPR
2587 arguments and set instead the CALL_EXPR_VA_ARG_PACK flag. */
2590 && TREE_CODE (CALL_EXPR_ARG (*expr_p
, nargs
- 1)) == CALL_EXPR
)
2592 tree last_arg
= CALL_EXPR_ARG (*expr_p
, nargs
- 1);
2593 tree last_arg_fndecl
= get_callee_fndecl (last_arg
);
2596 && TREE_CODE (last_arg_fndecl
) == FUNCTION_DECL
2597 && DECL_BUILT_IN_CLASS (last_arg_fndecl
) == BUILT_IN_NORMAL
2598 && DECL_FUNCTION_CODE (last_arg_fndecl
) == BUILT_IN_VA_ARG_PACK
)
2600 tree call
= *expr_p
;
2603 *expr_p
= build_call_array_loc (loc
, TREE_TYPE (call
),
2604 CALL_EXPR_FN (call
),
2605 nargs
, CALL_EXPR_ARGP (call
));
2607 /* Copy all CALL_EXPR flags, location and block, except
2608 CALL_EXPR_VA_ARG_PACK flag. */
2609 CALL_EXPR_STATIC_CHAIN (*expr_p
) = CALL_EXPR_STATIC_CHAIN (call
);
2610 CALL_EXPR_TAILCALL (*expr_p
) = CALL_EXPR_TAILCALL (call
);
2611 CALL_EXPR_RETURN_SLOT_OPT (*expr_p
)
2612 = CALL_EXPR_RETURN_SLOT_OPT (call
);
2613 CALL_FROM_THUNK_P (*expr_p
) = CALL_FROM_THUNK_P (call
);
2614 SET_EXPR_LOCATION (*expr_p
, EXPR_LOCATION (call
));
2615 TREE_BLOCK (*expr_p
) = TREE_BLOCK (call
);
2617 /* Set CALL_EXPR_VA_ARG_PACK. */
2618 CALL_EXPR_VA_ARG_PACK (*expr_p
) = 1;
2622 /* Finally, gimplify the function arguments. */
2625 for (i
= (PUSH_ARGS_REVERSED
? nargs
- 1 : 0);
2626 PUSH_ARGS_REVERSED
? i
>= 0 : i
< nargs
;
2627 PUSH_ARGS_REVERSED
? i
-- : i
++)
2629 enum gimplify_status t
;
2631 /* Avoid gimplifying the second argument to va_start, which needs to
2632 be the plain PARM_DECL. */
2633 if ((i
!= 1) || !builtin_va_start_p
)
2635 t
= gimplify_arg (&CALL_EXPR_ARG (*expr_p
, i
), pre_p
,
2636 EXPR_LOCATION (*expr_p
));
2644 /* Verify the function result. */
2645 if (want_value
&& fndecl
2646 && VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fnptrtype
))))
2648 error_at (loc
, "using result of function returning %<void%>");
2652 /* Try this again in case gimplification exposed something. */
2653 if (ret
!= GS_ERROR
)
2655 tree new_tree
= fold_call_expr (input_location
, *expr_p
, !want_value
);
2657 if (new_tree
&& new_tree
!= *expr_p
)
2659 /* There was a transformation of this call which computes the
2660 same value, but in a more efficient way. Return and try
2668 *expr_p
= error_mark_node
;
2672 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2673 decl. This allows us to eliminate redundant or useless
2674 calls to "const" functions. */
2675 if (TREE_CODE (*expr_p
) == CALL_EXPR
)
2677 int flags
= call_expr_flags (*expr_p
);
2678 if (flags
& (ECF_CONST
| ECF_PURE
)
2679 /* An infinite loop is considered a side effect. */
2680 && !(flags
& (ECF_LOOPING_CONST_OR_PURE
)))
2681 TREE_SIDE_EFFECTS (*expr_p
) = 0;
2684 /* If the value is not needed by the caller, emit a new GIMPLE_CALL
2685 and clear *EXPR_P. Otherwise, leave *EXPR_P in its gimplified
2686 form and delegate the creation of a GIMPLE_CALL to
2687 gimplify_modify_expr. This is always possible because when
2688 WANT_VALUE is true, the caller wants the result of this call into
2689 a temporary, which means that we will emit an INIT_EXPR in
2690 internal_get_tmp_var which will then be handled by
2691 gimplify_modify_expr. */
2694 /* The CALL_EXPR in *EXPR_P is already in GIMPLE form, so all we
2695 have to do is replicate it as a GIMPLE_CALL tuple. */
2696 gimple_stmt_iterator gsi
;
2697 call
= gimple_build_call_from_tree (*expr_p
);
2698 gimple_call_set_fntype (call
, TREE_TYPE (fnptrtype
));
2699 gimplify_seq_add_stmt (pre_p
, call
);
2700 gsi
= gsi_last (*pre_p
);
2702 *expr_p
= NULL_TREE
;
2705 /* Remember the original function type. */
2706 CALL_EXPR_FN (*expr_p
) = build1 (NOP_EXPR
, fnptrtype
,
2707 CALL_EXPR_FN (*expr_p
));
2712 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2713 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2715 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2716 condition is true or false, respectively. If null, we should generate
2717 our own to skip over the evaluation of this specific expression.
2719 LOCUS is the source location of the COND_EXPR.
2721 This function is the tree equivalent of do_jump.
2723 shortcut_cond_r should only be called by shortcut_cond_expr. */
2726 shortcut_cond_r (tree pred
, tree
*true_label_p
, tree
*false_label_p
,
2729 tree local_label
= NULL_TREE
;
2730 tree t
, expr
= NULL
;
2732 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2733 retain the shortcut semantics. Just insert the gotos here;
2734 shortcut_cond_expr will append the real blocks later. */
2735 if (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2737 location_t new_locus
;
2739 /* Turn if (a && b) into
2741 if (a); else goto no;
2742 if (b) goto yes; else goto no;
2745 if (false_label_p
== NULL
)
2746 false_label_p
= &local_label
;
2748 /* Keep the original source location on the first 'if'. */
2749 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), NULL
, false_label_p
, locus
);
2750 append_to_statement_list (t
, &expr
);
2752 /* Set the source location of the && on the second 'if'. */
2753 new_locus
= EXPR_HAS_LOCATION (pred
) ? EXPR_LOCATION (pred
) : locus
;
2754 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
, false_label_p
,
2756 append_to_statement_list (t
, &expr
);
2758 else if (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2760 location_t new_locus
;
2762 /* Turn if (a || b) into
2765 if (b) goto yes; else goto no;
2768 if (true_label_p
== NULL
)
2769 true_label_p
= &local_label
;
2771 /* Keep the original source location on the first 'if'. */
2772 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), true_label_p
, NULL
, locus
);
2773 append_to_statement_list (t
, &expr
);
2775 /* Set the source location of the || on the second 'if'. */
2776 new_locus
= EXPR_HAS_LOCATION (pred
) ? EXPR_LOCATION (pred
) : locus
;
2777 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
, false_label_p
,
2779 append_to_statement_list (t
, &expr
);
2781 else if (TREE_CODE (pred
) == COND_EXPR
2782 && !VOID_TYPE_P (TREE_TYPE (TREE_OPERAND (pred
, 1)))
2783 && !VOID_TYPE_P (TREE_TYPE (TREE_OPERAND (pred
, 2))))
2785 location_t new_locus
;
2787 /* As long as we're messing with gotos, turn if (a ? b : c) into
2789 if (b) goto yes; else goto no;
2791 if (c) goto yes; else goto no;
2793 Don't do this if one of the arms has void type, which can happen
2794 in C++ when the arm is throw. */
2796 /* Keep the original source location on the first 'if'. Set the source
2797 location of the ? on the second 'if'. */
2798 new_locus
= EXPR_HAS_LOCATION (pred
) ? EXPR_LOCATION (pred
) : locus
;
2799 expr
= build3 (COND_EXPR
, void_type_node
, TREE_OPERAND (pred
, 0),
2800 shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2801 false_label_p
, locus
),
2802 shortcut_cond_r (TREE_OPERAND (pred
, 2), true_label_p
,
2803 false_label_p
, new_locus
));
2807 expr
= build3 (COND_EXPR
, void_type_node
, pred
,
2808 build_and_jump (true_label_p
),
2809 build_and_jump (false_label_p
));
2810 SET_EXPR_LOCATION (expr
, locus
);
2815 t
= build1 (LABEL_EXPR
, void_type_node
, local_label
);
2816 append_to_statement_list (t
, &expr
);
2822 /* Given a conditional expression EXPR with short-circuit boolean
2823 predicates using TRUTH_ANDIF_EXPR or TRUTH_ORIF_EXPR, break the
2824 predicate apart into the equivalent sequence of conditionals. */
2827 shortcut_cond_expr (tree expr
)
2829 tree pred
= TREE_OPERAND (expr
, 0);
2830 tree then_
= TREE_OPERAND (expr
, 1);
2831 tree else_
= TREE_OPERAND (expr
, 2);
2832 tree true_label
, false_label
, end_label
, t
;
2834 tree
*false_label_p
;
2835 bool emit_end
, emit_false
, jump_over_else
;
2836 bool then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2837 bool else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2839 /* First do simple transformations. */
2842 /* If there is no 'else', turn
2845 if (a) if (b) then c. */
2846 while (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2848 /* Keep the original source location on the first 'if'. */
2849 location_t locus
= EXPR_LOC_OR_HERE (expr
);
2850 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2851 /* Set the source location of the && on the second 'if'. */
2852 if (EXPR_HAS_LOCATION (pred
))
2853 SET_EXPR_LOCATION (expr
, EXPR_LOCATION (pred
));
2854 then_
= shortcut_cond_expr (expr
);
2855 then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2856 pred
= TREE_OPERAND (pred
, 0);
2857 expr
= build3 (COND_EXPR
, void_type_node
, pred
, then_
, NULL_TREE
);
2858 SET_EXPR_LOCATION (expr
, locus
);
2864 /* If there is no 'then', turn
2867 if (a); else if (b); else d. */
2868 while (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2870 /* Keep the original source location on the first 'if'. */
2871 location_t locus
= EXPR_LOC_OR_HERE (expr
);
2872 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2873 /* Set the source location of the || on the second 'if'. */
2874 if (EXPR_HAS_LOCATION (pred
))
2875 SET_EXPR_LOCATION (expr
, EXPR_LOCATION (pred
));
2876 else_
= shortcut_cond_expr (expr
);
2877 else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2878 pred
= TREE_OPERAND (pred
, 0);
2879 expr
= build3 (COND_EXPR
, void_type_node
, pred
, NULL_TREE
, else_
);
2880 SET_EXPR_LOCATION (expr
, locus
);
2884 /* If we're done, great. */
2885 if (TREE_CODE (pred
) != TRUTH_ANDIF_EXPR
2886 && TREE_CODE (pred
) != TRUTH_ORIF_EXPR
)
2889 /* Otherwise we need to mess with gotos. Change
2892 if (a); else goto no;
2895 and recursively gimplify the condition. */
2897 true_label
= false_label
= end_label
= NULL_TREE
;
2899 /* If our arms just jump somewhere, hijack those labels so we don't
2900 generate jumps to jumps. */
2903 && TREE_CODE (then_
) == GOTO_EXPR
2904 && TREE_CODE (GOTO_DESTINATION (then_
)) == LABEL_DECL
)
2906 true_label
= GOTO_DESTINATION (then_
);
2912 && TREE_CODE (else_
) == GOTO_EXPR
2913 && TREE_CODE (GOTO_DESTINATION (else_
)) == LABEL_DECL
)
2915 false_label
= GOTO_DESTINATION (else_
);
2920 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2922 true_label_p
= &true_label
;
2924 true_label_p
= NULL
;
2926 /* The 'else' branch also needs a label if it contains interesting code. */
2927 if (false_label
|| else_se
)
2928 false_label_p
= &false_label
;
2930 false_label_p
= NULL
;
2932 /* If there was nothing else in our arms, just forward the label(s). */
2933 if (!then_se
&& !else_se
)
2934 return shortcut_cond_r (pred
, true_label_p
, false_label_p
,
2935 EXPR_LOC_OR_HERE (expr
));
2937 /* If our last subexpression already has a terminal label, reuse it. */
2939 t
= expr_last (else_
);
2941 t
= expr_last (then_
);
2944 if (t
&& TREE_CODE (t
) == LABEL_EXPR
)
2945 end_label
= LABEL_EXPR_LABEL (t
);
2947 /* If we don't care about jumping to the 'else' branch, jump to the end
2948 if the condition is false. */
2950 false_label_p
= &end_label
;
2952 /* We only want to emit these labels if we aren't hijacking them. */
2953 emit_end
= (end_label
== NULL_TREE
);
2954 emit_false
= (false_label
== NULL_TREE
);
2956 /* We only emit the jump over the else clause if we have to--if the
2957 then clause may fall through. Otherwise we can wind up with a
2958 useless jump and a useless label at the end of gimplified code,
2959 which will cause us to think that this conditional as a whole
2960 falls through even if it doesn't. If we then inline a function
2961 which ends with such a condition, that can cause us to issue an
2962 inappropriate warning about control reaching the end of a
2963 non-void function. */
2964 jump_over_else
= block_may_fallthru (then_
);
2966 pred
= shortcut_cond_r (pred
, true_label_p
, false_label_p
,
2967 EXPR_LOC_OR_HERE (expr
));
2970 append_to_statement_list (pred
, &expr
);
2972 append_to_statement_list (then_
, &expr
);
2977 tree last
= expr_last (expr
);
2978 t
= build_and_jump (&end_label
);
2979 if (EXPR_HAS_LOCATION (last
))
2980 SET_EXPR_LOCATION (t
, EXPR_LOCATION (last
));
2981 append_to_statement_list (t
, &expr
);
2985 t
= build1 (LABEL_EXPR
, void_type_node
, false_label
);
2986 append_to_statement_list (t
, &expr
);
2988 append_to_statement_list (else_
, &expr
);
2990 if (emit_end
&& end_label
)
2992 t
= build1 (LABEL_EXPR
, void_type_node
, end_label
);
2993 append_to_statement_list (t
, &expr
);
2999 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
3002 gimple_boolify (tree expr
)
3004 tree type
= TREE_TYPE (expr
);
3005 location_t loc
= EXPR_LOCATION (expr
);
3007 if (TREE_CODE (expr
) == NE_EXPR
3008 && TREE_CODE (TREE_OPERAND (expr
, 0)) == CALL_EXPR
3009 && integer_zerop (TREE_OPERAND (expr
, 1)))
3011 tree call
= TREE_OPERAND (expr
, 0);
3012 tree fn
= get_callee_fndecl (call
);
3014 /* For __builtin_expect ((long) (x), y) recurse into x as well
3015 if x is truth_value_p. */
3017 && DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
3018 && DECL_FUNCTION_CODE (fn
) == BUILT_IN_EXPECT
3019 && call_expr_nargs (call
) == 2)
3021 tree arg
= CALL_EXPR_ARG (call
, 0);
3024 if (TREE_CODE (arg
) == NOP_EXPR
3025 && TREE_TYPE (arg
) == TREE_TYPE (call
))
3026 arg
= TREE_OPERAND (arg
, 0);
3027 if (truth_value_p (TREE_CODE (arg
)))
3029 arg
= gimple_boolify (arg
);
3030 CALL_EXPR_ARG (call
, 0)
3031 = fold_convert_loc (loc
, TREE_TYPE (call
), arg
);
3037 switch (TREE_CODE (expr
))
3039 case TRUTH_AND_EXPR
:
3041 case TRUTH_XOR_EXPR
:
3042 case TRUTH_ANDIF_EXPR
:
3043 case TRUTH_ORIF_EXPR
:
3044 /* Also boolify the arguments of truth exprs. */
3045 TREE_OPERAND (expr
, 1) = gimple_boolify (TREE_OPERAND (expr
, 1));
3048 case TRUTH_NOT_EXPR
:
3049 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
3051 /* These expressions always produce boolean results. */
3052 if (TREE_CODE (type
) != BOOLEAN_TYPE
)
3053 TREE_TYPE (expr
) = boolean_type_node
;
3057 if (COMPARISON_CLASS_P (expr
))
3059 /* There expressions always prduce boolean results. */
3060 if (TREE_CODE (type
) != BOOLEAN_TYPE
)
3061 TREE_TYPE (expr
) = boolean_type_node
;
3064 /* Other expressions that get here must have boolean values, but
3065 might need to be converted to the appropriate mode. */
3066 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
3068 return fold_convert_loc (loc
, boolean_type_node
, expr
);
3072 /* Given a conditional expression *EXPR_P without side effects, gimplify
3073 its operands. New statements are inserted to PRE_P. */
3075 static enum gimplify_status
3076 gimplify_pure_cond_expr (tree
*expr_p
, gimple_seq
*pre_p
)
3078 tree expr
= *expr_p
, cond
;
3079 enum gimplify_status ret
, tret
;
3080 enum tree_code code
;
3082 cond
= gimple_boolify (COND_EXPR_COND (expr
));
3084 /* We need to handle && and || specially, as their gimplification
3085 creates pure cond_expr, thus leading to an infinite cycle otherwise. */
3086 code
= TREE_CODE (cond
);
3087 if (code
== TRUTH_ANDIF_EXPR
)
3088 TREE_SET_CODE (cond
, TRUTH_AND_EXPR
);
3089 else if (code
== TRUTH_ORIF_EXPR
)
3090 TREE_SET_CODE (cond
, TRUTH_OR_EXPR
);
3091 ret
= gimplify_expr (&cond
, pre_p
, NULL
, is_gimple_condexpr
, fb_rvalue
);
3092 COND_EXPR_COND (*expr_p
) = cond
;
3094 tret
= gimplify_expr (&COND_EXPR_THEN (expr
), pre_p
, NULL
,
3095 is_gimple_val
, fb_rvalue
);
3096 ret
= MIN (ret
, tret
);
3097 tret
= gimplify_expr (&COND_EXPR_ELSE (expr
), pre_p
, NULL
,
3098 is_gimple_val
, fb_rvalue
);
3100 return MIN (ret
, tret
);
3103 /* Return true if evaluating EXPR could trap.
3104 EXPR is GENERIC, while tree_could_trap_p can be called
3108 generic_expr_could_trap_p (tree expr
)
3112 if (!expr
|| is_gimple_val (expr
))
3115 if (!EXPR_P (expr
) || tree_could_trap_p (expr
))
3118 n
= TREE_OPERAND_LENGTH (expr
);
3119 for (i
= 0; i
< n
; i
++)
3120 if (generic_expr_could_trap_p (TREE_OPERAND (expr
, i
)))
3126 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
3135 The second form is used when *EXPR_P is of type void.
3137 PRE_P points to the list where side effects that must happen before
3138 *EXPR_P should be stored. */
3140 static enum gimplify_status
3141 gimplify_cond_expr (tree
*expr_p
, gimple_seq
*pre_p
, fallback_t fallback
)
3143 tree expr
= *expr_p
;
3144 tree type
= TREE_TYPE (expr
);
3145 location_t loc
= EXPR_LOCATION (expr
);
3146 tree tmp
, arm1
, arm2
;
3147 enum gimplify_status ret
;
3148 tree label_true
, label_false
, label_cont
;
3149 bool have_then_clause_p
, have_else_clause_p
;
3151 enum tree_code pred_code
;
3152 gimple_seq seq
= NULL
;
3154 /* If this COND_EXPR has a value, copy the values into a temporary within
3156 if (!VOID_TYPE_P (type
))
3158 tree then_
= TREE_OPERAND (expr
, 1), else_
= TREE_OPERAND (expr
, 2);
3161 /* If either an rvalue is ok or we do not require an lvalue, create the
3162 temporary. But we cannot do that if the type is addressable. */
3163 if (((fallback
& fb_rvalue
) || !(fallback
& fb_lvalue
))
3164 && !TREE_ADDRESSABLE (type
))
3166 if (gimplify_ctxp
->allow_rhs_cond_expr
3167 /* If either branch has side effects or could trap, it can't be
3168 evaluated unconditionally. */
3169 && !TREE_SIDE_EFFECTS (then_
)
3170 && !generic_expr_could_trap_p (then_
)
3171 && !TREE_SIDE_EFFECTS (else_
)
3172 && !generic_expr_could_trap_p (else_
))
3173 return gimplify_pure_cond_expr (expr_p
, pre_p
);
3175 tmp
= create_tmp_var (type
, "iftmp");
3179 /* Otherwise, only create and copy references to the values. */
3182 type
= build_pointer_type (type
);
3184 if (!VOID_TYPE_P (TREE_TYPE (then_
)))
3185 then_
= build_fold_addr_expr_loc (loc
, then_
);
3187 if (!VOID_TYPE_P (TREE_TYPE (else_
)))
3188 else_
= build_fold_addr_expr_loc (loc
, else_
);
3191 = build3 (COND_EXPR
, type
, TREE_OPERAND (expr
, 0), then_
, else_
);
3193 tmp
= create_tmp_var (type
, "iftmp");
3194 result
= build_simple_mem_ref_loc (loc
, tmp
);
3197 /* Build the new then clause, `tmp = then_;'. But don't build the
3198 assignment if the value is void; in C++ it can be if it's a throw. */
3199 if (!VOID_TYPE_P (TREE_TYPE (then_
)))
3200 TREE_OPERAND (expr
, 1) = build2 (MODIFY_EXPR
, type
, tmp
, then_
);
3202 /* Similarly, build the new else clause, `tmp = else_;'. */
3203 if (!VOID_TYPE_P (TREE_TYPE (else_
)))
3204 TREE_OPERAND (expr
, 2) = build2 (MODIFY_EXPR
, type
, tmp
, else_
);
3206 TREE_TYPE (expr
) = void_type_node
;
3207 recalculate_side_effects (expr
);
3209 /* Move the COND_EXPR to the prequeue. */
3210 gimplify_stmt (&expr
, pre_p
);
3216 /* Remove any COMPOUND_EXPR so the following cases will be caught. */
3217 STRIP_TYPE_NOPS (TREE_OPERAND (expr
, 0));
3218 if (TREE_CODE (TREE_OPERAND (expr
, 0)) == COMPOUND_EXPR
)
3219 gimplify_compound_expr (&TREE_OPERAND (expr
, 0), pre_p
, true);
3221 /* Make sure the condition has BOOLEAN_TYPE. */
3222 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
3224 /* Break apart && and || conditions. */
3225 if (TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ANDIF_EXPR
3226 || TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ORIF_EXPR
)
3228 expr
= shortcut_cond_expr (expr
);
3230 if (expr
!= *expr_p
)
3234 /* We can't rely on gimplify_expr to re-gimplify the expanded
3235 form properly, as cleanups might cause the target labels to be
3236 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
3237 set up a conditional context. */
3238 gimple_push_condition ();
3239 gimplify_stmt (expr_p
, &seq
);
3240 gimple_pop_condition (pre_p
);
3241 gimple_seq_add_seq (pre_p
, seq
);
3247 /* Now do the normal gimplification. */
3249 /* Gimplify condition. */
3250 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, NULL
, is_gimple_condexpr
,
3252 if (ret
== GS_ERROR
)
3254 gcc_assert (TREE_OPERAND (expr
, 0) != NULL_TREE
);
3256 gimple_push_condition ();
3258 have_then_clause_p
= have_else_clause_p
= false;
3259 if (TREE_OPERAND (expr
, 1) != NULL
3260 && TREE_CODE (TREE_OPERAND (expr
, 1)) == GOTO_EXPR
3261 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr
, 1))) == LABEL_DECL
3262 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr
, 1)))
3263 == current_function_decl
)
3264 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
3265 have different locations, otherwise we end up with incorrect
3266 location information on the branches. */
3268 || !EXPR_HAS_LOCATION (expr
)
3269 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr
, 1))
3270 || EXPR_LOCATION (expr
) == EXPR_LOCATION (TREE_OPERAND (expr
, 1))))
3272 label_true
= GOTO_DESTINATION (TREE_OPERAND (expr
, 1));
3273 have_then_clause_p
= true;
3276 label_true
= create_artificial_label (UNKNOWN_LOCATION
);
3277 if (TREE_OPERAND (expr
, 2) != NULL
3278 && TREE_CODE (TREE_OPERAND (expr
, 2)) == GOTO_EXPR
3279 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr
, 2))) == LABEL_DECL
3280 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr
, 2)))
3281 == current_function_decl
)
3282 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
3283 have different locations, otherwise we end up with incorrect
3284 location information on the branches. */
3286 || !EXPR_HAS_LOCATION (expr
)
3287 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr
, 2))
3288 || EXPR_LOCATION (expr
) == EXPR_LOCATION (TREE_OPERAND (expr
, 2))))
3290 label_false
= GOTO_DESTINATION (TREE_OPERAND (expr
, 2));
3291 have_else_clause_p
= true;
3294 label_false
= create_artificial_label (UNKNOWN_LOCATION
);
3296 gimple_cond_get_ops_from_tree (COND_EXPR_COND (expr
), &pred_code
, &arm1
,
3299 gimple_cond
= gimple_build_cond (pred_code
, arm1
, arm2
, label_true
,
3302 gimplify_seq_add_stmt (&seq
, gimple_cond
);
3303 label_cont
= NULL_TREE
;
3304 if (!have_then_clause_p
)
3306 /* For if (...) {} else { code; } put label_true after
3308 if (TREE_OPERAND (expr
, 1) == NULL_TREE
3309 && !have_else_clause_p
3310 && TREE_OPERAND (expr
, 2) != NULL_TREE
)
3311 label_cont
= label_true
;
3314 gimplify_seq_add_stmt (&seq
, gimple_build_label (label_true
));
3315 have_then_clause_p
= gimplify_stmt (&TREE_OPERAND (expr
, 1), &seq
);
3316 /* For if (...) { code; } else {} or
3317 if (...) { code; } else goto label; or
3318 if (...) { code; return; } else { ... }
3319 label_cont isn't needed. */
3320 if (!have_else_clause_p
3321 && TREE_OPERAND (expr
, 2) != NULL_TREE
3322 && gimple_seq_may_fallthru (seq
))
3325 label_cont
= create_artificial_label (UNKNOWN_LOCATION
);
3327 g
= gimple_build_goto (label_cont
);
3329 /* GIMPLE_COND's are very low level; they have embedded
3330 gotos. This particular embedded goto should not be marked
3331 with the location of the original COND_EXPR, as it would
3332 correspond to the COND_EXPR's condition, not the ELSE or the
3333 THEN arms. To avoid marking it with the wrong location, flag
3334 it as "no location". */
3335 gimple_set_do_not_emit_location (g
);
3337 gimplify_seq_add_stmt (&seq
, g
);
3341 if (!have_else_clause_p
)
3343 gimplify_seq_add_stmt (&seq
, gimple_build_label (label_false
));
3344 have_else_clause_p
= gimplify_stmt (&TREE_OPERAND (expr
, 2), &seq
);
3347 gimplify_seq_add_stmt (&seq
, gimple_build_label (label_cont
));
3349 gimple_pop_condition (pre_p
);
3350 gimple_seq_add_seq (pre_p
, seq
);
3352 if (ret
== GS_ERROR
)
3354 else if (have_then_clause_p
|| have_else_clause_p
)
3358 /* Both arms are empty; replace the COND_EXPR with its predicate. */
3359 expr
= TREE_OPERAND (expr
, 0);
3360 gimplify_stmt (&expr
, pre_p
);
3367 /* Prepare the node pointed to by EXPR_P, an is_gimple_addressable expression,
3368 to be marked addressable.
3370 We cannot rely on such an expression being directly markable if a temporary
3371 has been created by the gimplification. In this case, we create another
3372 temporary and initialize it with a copy, which will become a store after we
3373 mark it addressable. This can happen if the front-end passed us something
3374 that it could not mark addressable yet, like a Fortran pass-by-reference
3375 parameter (int) floatvar. */
3378 prepare_gimple_addressable (tree
*expr_p
, gimple_seq
*seq_p
)
3380 while (handled_component_p (*expr_p
))
3381 expr_p
= &TREE_OPERAND (*expr_p
, 0);
3382 if (is_gimple_reg (*expr_p
))
3383 *expr_p
= get_initialized_tmp_var (*expr_p
, seq_p
, NULL
);
3386 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3387 a call to __builtin_memcpy. */
3389 static enum gimplify_status
3390 gimplify_modify_expr_to_memcpy (tree
*expr_p
, tree size
, bool want_value
,
3393 tree t
, to
, to_ptr
, from
, from_ptr
;
3395 location_t loc
= EXPR_LOCATION (*expr_p
);
3397 to
= TREE_OPERAND (*expr_p
, 0);
3398 from
= TREE_OPERAND (*expr_p
, 1);
3400 /* Mark the RHS addressable. Beware that it may not be possible to do so
3401 directly if a temporary has been created by the gimplification. */
3402 prepare_gimple_addressable (&from
, seq_p
);
3404 mark_addressable (from
);
3405 from_ptr
= build_fold_addr_expr_loc (loc
, from
);
3406 gimplify_arg (&from_ptr
, seq_p
, loc
);
3408 mark_addressable (to
);
3409 to_ptr
= build_fold_addr_expr_loc (loc
, to
);
3410 gimplify_arg (&to_ptr
, seq_p
, loc
);
3412 t
= builtin_decl_implicit (BUILT_IN_MEMCPY
);
3414 gs
= gimple_build_call (t
, 3, to_ptr
, from_ptr
, size
);
3418 /* tmp = memcpy() */
3419 t
= create_tmp_var (TREE_TYPE (to_ptr
), NULL
);
3420 gimple_call_set_lhs (gs
, t
);
3421 gimplify_seq_add_stmt (seq_p
, gs
);
3423 *expr_p
= build_simple_mem_ref (t
);
3427 gimplify_seq_add_stmt (seq_p
, gs
);
3432 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3433 a call to __builtin_memset. In this case we know that the RHS is
3434 a CONSTRUCTOR with an empty element list. */
3436 static enum gimplify_status
3437 gimplify_modify_expr_to_memset (tree
*expr_p
, tree size
, bool want_value
,
3440 tree t
, from
, to
, to_ptr
;
3442 location_t loc
= EXPR_LOCATION (*expr_p
);
3444 /* Assert our assumptions, to abort instead of producing wrong code
3445 silently if they are not met. Beware that the RHS CONSTRUCTOR might
3446 not be immediately exposed. */
3447 from
= TREE_OPERAND (*expr_p
, 1);
3448 if (TREE_CODE (from
) == WITH_SIZE_EXPR
)
3449 from
= TREE_OPERAND (from
, 0);
3451 gcc_assert (TREE_CODE (from
) == CONSTRUCTOR
3452 && VEC_empty (constructor_elt
, CONSTRUCTOR_ELTS (from
)));
3455 to
= TREE_OPERAND (*expr_p
, 0);
3457 to_ptr
= build_fold_addr_expr_loc (loc
, to
);
3458 gimplify_arg (&to_ptr
, seq_p
, loc
);
3459 t
= builtin_decl_implicit (BUILT_IN_MEMSET
);
3461 gs
= gimple_build_call (t
, 3, to_ptr
, integer_zero_node
, size
);
3465 /* tmp = memset() */
3466 t
= create_tmp_var (TREE_TYPE (to_ptr
), NULL
);
3467 gimple_call_set_lhs (gs
, t
);
3468 gimplify_seq_add_stmt (seq_p
, gs
);
3470 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
3474 gimplify_seq_add_stmt (seq_p
, gs
);
3479 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
3480 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
3481 assignment. Return non-null if we detect a potential overlap. */
3483 struct gimplify_init_ctor_preeval_data
3485 /* The base decl of the lhs object. May be NULL, in which case we
3486 have to assume the lhs is indirect. */
3489 /* The alias set of the lhs object. */
3490 alias_set_type lhs_alias_set
;
3494 gimplify_init_ctor_preeval_1 (tree
*tp
, int *walk_subtrees
, void *xdata
)
3496 struct gimplify_init_ctor_preeval_data
*data
3497 = (struct gimplify_init_ctor_preeval_data
*) xdata
;
3500 /* If we find the base object, obviously we have overlap. */
3501 if (data
->lhs_base_decl
== t
)
3504 /* If the constructor component is indirect, determine if we have a
3505 potential overlap with the lhs. The only bits of information we
3506 have to go on at this point are addressability and alias sets. */
3507 if ((INDIRECT_REF_P (t
)
3508 || TREE_CODE (t
) == MEM_REF
)
3509 && (!data
->lhs_base_decl
|| TREE_ADDRESSABLE (data
->lhs_base_decl
))
3510 && alias_sets_conflict_p (data
->lhs_alias_set
, get_alias_set (t
)))
3513 /* If the constructor component is a call, determine if it can hide a
3514 potential overlap with the lhs through an INDIRECT_REF like above.
3515 ??? Ugh - this is completely broken. In fact this whole analysis
3516 doesn't look conservative. */
3517 if (TREE_CODE (t
) == CALL_EXPR
)
3519 tree type
, fntype
= TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (t
)));
3521 for (type
= TYPE_ARG_TYPES (fntype
); type
; type
= TREE_CHAIN (type
))
3522 if (POINTER_TYPE_P (TREE_VALUE (type
))
3523 && (!data
->lhs_base_decl
|| TREE_ADDRESSABLE (data
->lhs_base_decl
))
3524 && alias_sets_conflict_p (data
->lhs_alias_set
,
3526 (TREE_TYPE (TREE_VALUE (type
)))))
3530 if (IS_TYPE_OR_DECL_P (t
))
3535 /* A subroutine of gimplify_init_constructor. Pre-evaluate EXPR,
3536 force values that overlap with the lhs (as described by *DATA)
3537 into temporaries. */
3540 gimplify_init_ctor_preeval (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
3541 struct gimplify_init_ctor_preeval_data
*data
)
3543 enum gimplify_status one
;
3545 /* If the value is constant, then there's nothing to pre-evaluate. */
3546 if (TREE_CONSTANT (*expr_p
))
3548 /* Ensure it does not have side effects, it might contain a reference to
3549 the object we're initializing. */
3550 gcc_assert (!TREE_SIDE_EFFECTS (*expr_p
));
3554 /* If the type has non-trivial constructors, we can't pre-evaluate. */
3555 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p
)))
3558 /* Recurse for nested constructors. */
3559 if (TREE_CODE (*expr_p
) == CONSTRUCTOR
)
3561 unsigned HOST_WIDE_INT ix
;
3562 constructor_elt
*ce
;
3563 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (*expr_p
);
3565 FOR_EACH_VEC_ELT (constructor_elt
, v
, ix
, ce
)
3566 gimplify_init_ctor_preeval (&ce
->value
, pre_p
, post_p
, data
);
3571 /* If this is a variable sized type, we must remember the size. */
3572 maybe_with_size_expr (expr_p
);
3574 /* Gimplify the constructor element to something appropriate for the rhs
3575 of a MODIFY_EXPR. Given that we know the LHS is an aggregate, we know
3576 the gimplifier will consider this a store to memory. Doing this
3577 gimplification now means that we won't have to deal with complicated
3578 language-specific trees, nor trees like SAVE_EXPR that can induce
3579 exponential search behavior. */
3580 one
= gimplify_expr (expr_p
, pre_p
, post_p
, is_gimple_mem_rhs
, fb_rvalue
);
3581 if (one
== GS_ERROR
)
3587 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
3588 with the lhs, since "a = { .x=a }" doesn't make sense. This will
3589 always be true for all scalars, since is_gimple_mem_rhs insists on a
3590 temporary variable for them. */
3591 if (DECL_P (*expr_p
))
3594 /* If this is of variable size, we have no choice but to assume it doesn't
3595 overlap since we can't make a temporary for it. */
3596 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (*expr_p
))) != INTEGER_CST
)
3599 /* Otherwise, we must search for overlap ... */
3600 if (!walk_tree (expr_p
, gimplify_init_ctor_preeval_1
, data
, NULL
))
3603 /* ... and if found, force the value into a temporary. */
3604 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
3607 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
3608 a RANGE_EXPR in a CONSTRUCTOR for an array.
3612 object[var] = value;
3619 We increment var _after_ the loop exit check because we might otherwise
3620 fail if upper == TYPE_MAX_VALUE (type for upper).
3622 Note that we never have to deal with SAVE_EXPRs here, because this has
3623 already been taken care of for us, in gimplify_init_ctor_preeval(). */
3625 static void gimplify_init_ctor_eval (tree
, VEC(constructor_elt
,gc
) *,
3626 gimple_seq
*, bool);
3629 gimplify_init_ctor_eval_range (tree object
, tree lower
, tree upper
,
3630 tree value
, tree array_elt_type
,
3631 gimple_seq
*pre_p
, bool cleared
)
3633 tree loop_entry_label
, loop_exit_label
, fall_thru_label
;
3634 tree var
, var_type
, cref
, tmp
;
3636 loop_entry_label
= create_artificial_label (UNKNOWN_LOCATION
);
3637 loop_exit_label
= create_artificial_label (UNKNOWN_LOCATION
);
3638 fall_thru_label
= create_artificial_label (UNKNOWN_LOCATION
);
3640 /* Create and initialize the index variable. */
3641 var_type
= TREE_TYPE (upper
);
3642 var
= create_tmp_var (var_type
, NULL
);
3643 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (var
, lower
));
3645 /* Add the loop entry label. */
3646 gimplify_seq_add_stmt (pre_p
, gimple_build_label (loop_entry_label
));
3648 /* Build the reference. */
3649 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
3650 var
, NULL_TREE
, NULL_TREE
);
3652 /* If we are a constructor, just call gimplify_init_ctor_eval to do
3653 the store. Otherwise just assign value to the reference. */
3655 if (TREE_CODE (value
) == CONSTRUCTOR
)
3656 /* NB we might have to call ourself recursively through
3657 gimplify_init_ctor_eval if the value is a constructor. */
3658 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
3661 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (cref
, value
));
3663 /* We exit the loop when the index var is equal to the upper bound. */
3664 gimplify_seq_add_stmt (pre_p
,
3665 gimple_build_cond (EQ_EXPR
, var
, upper
,
3666 loop_exit_label
, fall_thru_label
));
3668 gimplify_seq_add_stmt (pre_p
, gimple_build_label (fall_thru_label
));
3670 /* Otherwise, increment the index var... */
3671 tmp
= build2 (PLUS_EXPR
, var_type
, var
,
3672 fold_convert (var_type
, integer_one_node
));
3673 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (var
, tmp
));
3675 /* ...and jump back to the loop entry. */
3676 gimplify_seq_add_stmt (pre_p
, gimple_build_goto (loop_entry_label
));
3678 /* Add the loop exit label. */
3679 gimplify_seq_add_stmt (pre_p
, gimple_build_label (loop_exit_label
));
3682 /* Return true if FDECL is accessing a field that is zero sized. */
3685 zero_sized_field_decl (const_tree fdecl
)
3687 if (TREE_CODE (fdecl
) == FIELD_DECL
&& DECL_SIZE (fdecl
)
3688 && integer_zerop (DECL_SIZE (fdecl
)))
3693 /* Return true if TYPE is zero sized. */
3696 zero_sized_type (const_tree type
)
3698 if (AGGREGATE_TYPE_P (type
) && TYPE_SIZE (type
)
3699 && integer_zerop (TYPE_SIZE (type
)))
3704 /* A subroutine of gimplify_init_constructor. Generate individual
3705 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
3706 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
3707 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
3711 gimplify_init_ctor_eval (tree object
, VEC(constructor_elt
,gc
) *elts
,
3712 gimple_seq
*pre_p
, bool cleared
)
3714 tree array_elt_type
= NULL
;
3715 unsigned HOST_WIDE_INT ix
;
3716 tree purpose
, value
;
3718 if (TREE_CODE (TREE_TYPE (object
)) == ARRAY_TYPE
)
3719 array_elt_type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object
)));
3721 FOR_EACH_CONSTRUCTOR_ELT (elts
, ix
, purpose
, value
)
3725 /* NULL values are created above for gimplification errors. */
3729 if (cleared
&& initializer_zerop (value
))
3732 /* ??? Here's to hoping the front end fills in all of the indices,
3733 so we don't have to figure out what's missing ourselves. */
3734 gcc_assert (purpose
);
3736 /* Skip zero-sized fields, unless value has side-effects. This can
3737 happen with calls to functions returning a zero-sized type, which
3738 we shouldn't discard. As a number of downstream passes don't
3739 expect sets of zero-sized fields, we rely on the gimplification of
3740 the MODIFY_EXPR we make below to drop the assignment statement. */
3741 if (! TREE_SIDE_EFFECTS (value
) && zero_sized_field_decl (purpose
))
3744 /* If we have a RANGE_EXPR, we have to build a loop to assign the
3746 if (TREE_CODE (purpose
) == RANGE_EXPR
)
3748 tree lower
= TREE_OPERAND (purpose
, 0);
3749 tree upper
= TREE_OPERAND (purpose
, 1);
3751 /* If the lower bound is equal to upper, just treat it as if
3752 upper was the index. */
3753 if (simple_cst_equal (lower
, upper
))
3757 gimplify_init_ctor_eval_range (object
, lower
, upper
, value
,
3758 array_elt_type
, pre_p
, cleared
);
3765 /* Do not use bitsizetype for ARRAY_REF indices. */
3766 if (TYPE_DOMAIN (TREE_TYPE (object
)))
3768 = fold_convert (TREE_TYPE (TYPE_DOMAIN (TREE_TYPE (object
))),
3770 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
3771 purpose
, NULL_TREE
, NULL_TREE
);
3775 gcc_assert (TREE_CODE (purpose
) == FIELD_DECL
);
3776 cref
= build3 (COMPONENT_REF
, TREE_TYPE (purpose
),
3777 unshare_expr (object
), purpose
, NULL_TREE
);
3780 if (TREE_CODE (value
) == CONSTRUCTOR
3781 && TREE_CODE (TREE_TYPE (value
)) != VECTOR_TYPE
)
3782 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
3786 tree init
= build2 (INIT_EXPR
, TREE_TYPE (cref
), cref
, value
);
3787 gimplify_and_add (init
, pre_p
);
3793 /* Return the appropriate RHS predicate for this LHS. */
3796 rhs_predicate_for (tree lhs
)
3798 if (is_gimple_reg (lhs
))
3799 return is_gimple_reg_rhs_or_call
;
3801 return is_gimple_mem_rhs_or_call
;
3804 /* Gimplify a C99 compound literal expression. This just means adding
3805 the DECL_EXPR before the current statement and using its anonymous
3808 static enum gimplify_status
3809 gimplify_compound_literal_expr (tree
*expr_p
, gimple_seq
*pre_p
,
3810 bool (*gimple_test_f
) (tree
),
3811 fallback_t fallback
)
3813 tree decl_s
= COMPOUND_LITERAL_EXPR_DECL_EXPR (*expr_p
);
3814 tree decl
= DECL_EXPR_DECL (decl_s
);
3815 tree init
= DECL_INITIAL (decl
);
3816 /* Mark the decl as addressable if the compound literal
3817 expression is addressable now, otherwise it is marked too late
3818 after we gimplify the initialization expression. */
3819 if (TREE_ADDRESSABLE (*expr_p
))
3820 TREE_ADDRESSABLE (decl
) = 1;
3821 /* Otherwise, if we don't need an lvalue and have a literal directly
3822 substitute it. Check if it matches the gimple predicate, as
3823 otherwise we'd generate a new temporary, and we can as well just
3824 use the decl we already have. */
3825 else if (!TREE_ADDRESSABLE (decl
)
3827 && (fallback
& fb_lvalue
) == 0
3828 && gimple_test_f (init
))
3834 /* Preliminarily mark non-addressed complex variables as eligible
3835 for promotion to gimple registers. We'll transform their uses
3837 if ((TREE_CODE (TREE_TYPE (decl
)) == COMPLEX_TYPE
3838 || TREE_CODE (TREE_TYPE (decl
)) == VECTOR_TYPE
)
3839 && !TREE_THIS_VOLATILE (decl
)
3840 && !needs_to_live_in_memory (decl
))
3841 DECL_GIMPLE_REG_P (decl
) = 1;
3843 /* If the decl is not addressable, then it is being used in some
3844 expression or on the right hand side of a statement, and it can
3845 be put into a readonly data section. */
3846 if (!TREE_ADDRESSABLE (decl
) && (fallback
& fb_lvalue
) == 0)
3847 TREE_READONLY (decl
) = 1;
3849 /* This decl isn't mentioned in the enclosing block, so add it to the
3850 list of temps. FIXME it seems a bit of a kludge to say that
3851 anonymous artificial vars aren't pushed, but everything else is. */
3852 if (DECL_NAME (decl
) == NULL_TREE
&& !DECL_SEEN_IN_BIND_EXPR_P (decl
))
3853 gimple_add_tmp_var (decl
);
3855 gimplify_and_add (decl_s
, pre_p
);
3860 /* Optimize embedded COMPOUND_LITERAL_EXPRs within a CONSTRUCTOR,
3861 return a new CONSTRUCTOR if something changed. */
3864 optimize_compound_literals_in_ctor (tree orig_ctor
)
3866 tree ctor
= orig_ctor
;
3867 VEC(constructor_elt
,gc
) *elts
= CONSTRUCTOR_ELTS (ctor
);
3868 unsigned int idx
, num
= VEC_length (constructor_elt
, elts
);
3870 for (idx
= 0; idx
< num
; idx
++)
3872 tree value
= VEC_index (constructor_elt
, elts
, idx
).value
;
3873 tree newval
= value
;
3874 if (TREE_CODE (value
) == CONSTRUCTOR
)
3875 newval
= optimize_compound_literals_in_ctor (value
);
3876 else if (TREE_CODE (value
) == COMPOUND_LITERAL_EXPR
)
3878 tree decl_s
= COMPOUND_LITERAL_EXPR_DECL_EXPR (value
);
3879 tree decl
= DECL_EXPR_DECL (decl_s
);
3880 tree init
= DECL_INITIAL (decl
);
3882 if (!TREE_ADDRESSABLE (value
)
3883 && !TREE_ADDRESSABLE (decl
)
3885 && TREE_CODE (init
) == CONSTRUCTOR
)
3886 newval
= optimize_compound_literals_in_ctor (init
);
3888 if (newval
== value
)
3891 if (ctor
== orig_ctor
)
3893 ctor
= copy_node (orig_ctor
);
3894 CONSTRUCTOR_ELTS (ctor
) = VEC_copy (constructor_elt
, gc
, elts
);
3895 elts
= CONSTRUCTOR_ELTS (ctor
);
3897 VEC_index (constructor_elt
, elts
, idx
).value
= newval
;
3902 /* A subroutine of gimplify_modify_expr. Break out elements of a
3903 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
3905 Note that we still need to clear any elements that don't have explicit
3906 initializers, so if not all elements are initialized we keep the
3907 original MODIFY_EXPR, we just remove all of the constructor elements.
3909 If NOTIFY_TEMP_CREATION is true, do not gimplify, just return
3910 GS_ERROR if we would have to create a temporary when gimplifying
3911 this constructor. Otherwise, return GS_OK.
3913 If NOTIFY_TEMP_CREATION is false, just do the gimplification. */
3915 static enum gimplify_status
3916 gimplify_init_constructor (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
3917 bool want_value
, bool notify_temp_creation
)
3919 tree object
, ctor
, type
;
3920 enum gimplify_status ret
;
3921 VEC(constructor_elt
,gc
) *elts
;
3923 gcc_assert (TREE_CODE (TREE_OPERAND (*expr_p
, 1)) == CONSTRUCTOR
);
3925 if (!notify_temp_creation
)
3927 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
3928 is_gimple_lvalue
, fb_lvalue
);
3929 if (ret
== GS_ERROR
)
3933 object
= TREE_OPERAND (*expr_p
, 0);
3934 ctor
= TREE_OPERAND (*expr_p
, 1) =
3935 optimize_compound_literals_in_ctor (TREE_OPERAND (*expr_p
, 1));
3936 type
= TREE_TYPE (ctor
);
3937 elts
= CONSTRUCTOR_ELTS (ctor
);
3940 switch (TREE_CODE (type
))
3944 case QUAL_UNION_TYPE
:
3947 struct gimplify_init_ctor_preeval_data preeval_data
;
3948 HOST_WIDE_INT num_ctor_elements
, num_nonzero_elements
;
3949 bool cleared
, complete_p
, valid_const_initializer
;
3951 /* Aggregate types must lower constructors to initialization of
3952 individual elements. The exception is that a CONSTRUCTOR node
3953 with no elements indicates zero-initialization of the whole. */
3954 if (VEC_empty (constructor_elt
, elts
))
3956 if (notify_temp_creation
)
3961 /* Fetch information about the constructor to direct later processing.
3962 We might want to make static versions of it in various cases, and
3963 can only do so if it known to be a valid constant initializer. */
3964 valid_const_initializer
3965 = categorize_ctor_elements (ctor
, &num_nonzero_elements
,
3966 &num_ctor_elements
, &complete_p
);
3968 /* If a const aggregate variable is being initialized, then it
3969 should never be a lose to promote the variable to be static. */
3970 if (valid_const_initializer
3971 && num_nonzero_elements
> 1
3972 && TREE_READONLY (object
)
3973 && TREE_CODE (object
) == VAR_DECL
3974 && (flag_merge_constants
>= 2 || !TREE_ADDRESSABLE (object
)))
3976 if (notify_temp_creation
)
3978 DECL_INITIAL (object
) = ctor
;
3979 TREE_STATIC (object
) = 1;
3980 if (!DECL_NAME (object
))
3981 DECL_NAME (object
) = create_tmp_var_name ("C");
3982 walk_tree (&DECL_INITIAL (object
), force_labels_r
, NULL
, NULL
);
3984 /* ??? C++ doesn't automatically append a .<number> to the
3985 assembler name, and even when it does, it looks at FE private
3986 data structures to figure out what that number should be,
3987 which are not set for this variable. I suppose this is
3988 important for local statics for inline functions, which aren't
3989 "local" in the object file sense. So in order to get a unique
3990 TU-local symbol, we must invoke the lhd version now. */
3991 lhd_set_decl_assembler_name (object
);
3993 *expr_p
= NULL_TREE
;
3997 /* If there are "lots" of initialized elements, even discounting
3998 those that are not address constants (and thus *must* be
3999 computed at runtime), then partition the constructor into
4000 constant and non-constant parts. Block copy the constant
4001 parts in, then generate code for the non-constant parts. */
4002 /* TODO. There's code in cp/typeck.c to do this. */
4004 if (int_size_in_bytes (TREE_TYPE (ctor
)) < 0)
4005 /* store_constructor will ignore the clearing of variable-sized
4006 objects. Initializers for such objects must explicitly set
4007 every field that needs to be set. */
4009 else if (!complete_p
)
4010 /* If the constructor isn't complete, clear the whole object
4013 ??? This ought not to be needed. For any element not present
4014 in the initializer, we should simply set them to zero. Except
4015 we'd need to *find* the elements that are not present, and that
4016 requires trickery to avoid quadratic compile-time behavior in
4017 large cases or excessive memory use in small cases. */
4019 else if (num_ctor_elements
- num_nonzero_elements
4020 > CLEAR_RATIO (optimize_function_for_speed_p (cfun
))
4021 && num_nonzero_elements
< num_ctor_elements
/ 4)
4022 /* If there are "lots" of zeros, it's more efficient to clear
4023 the memory and then set the nonzero elements. */
4028 /* If there are "lots" of initialized elements, and all of them
4029 are valid address constants, then the entire initializer can
4030 be dropped to memory, and then memcpy'd out. Don't do this
4031 for sparse arrays, though, as it's more efficient to follow
4032 the standard CONSTRUCTOR behavior of memset followed by
4033 individual element initialization. Also don't do this for small
4034 all-zero initializers (which aren't big enough to merit
4035 clearing), and don't try to make bitwise copies of
4036 TREE_ADDRESSABLE types. */
4037 if (valid_const_initializer
4038 && !(cleared
|| num_nonzero_elements
== 0)
4039 && !TREE_ADDRESSABLE (type
))
4041 HOST_WIDE_INT size
= int_size_in_bytes (type
);
4044 /* ??? We can still get unbounded array types, at least
4045 from the C++ front end. This seems wrong, but attempt
4046 to work around it for now. */
4049 size
= int_size_in_bytes (TREE_TYPE (object
));
4051 TREE_TYPE (ctor
) = type
= TREE_TYPE (object
);
4054 /* Find the maximum alignment we can assume for the object. */
4055 /* ??? Make use of DECL_OFFSET_ALIGN. */
4056 if (DECL_P (object
))
4057 align
= DECL_ALIGN (object
);
4059 align
= TYPE_ALIGN (type
);
4061 /* Do a block move either if the size is so small as to make
4062 each individual move a sub-unit move on average, or if it
4063 is so large as to make individual moves inefficient. */
4065 && num_nonzero_elements
> 1
4066 && (size
< num_nonzero_elements
4067 || !can_move_by_pieces (size
, align
)))
4069 if (notify_temp_creation
)
4072 walk_tree (&ctor
, force_labels_r
, NULL
, NULL
);
4073 ctor
= tree_output_constant_def (ctor
);
4074 if (!useless_type_conversion_p (type
, TREE_TYPE (ctor
)))
4075 ctor
= build1 (VIEW_CONVERT_EXPR
, type
, ctor
);
4076 TREE_OPERAND (*expr_p
, 1) = ctor
;
4078 /* This is no longer an assignment of a CONSTRUCTOR, but
4079 we still may have processing to do on the LHS. So
4080 pretend we didn't do anything here to let that happen. */
4081 return GS_UNHANDLED
;
4085 /* If the target is volatile, we have non-zero elements and more than
4086 one field to assign, initialize the target from a temporary. */
4087 if (TREE_THIS_VOLATILE (object
)
4088 && !TREE_ADDRESSABLE (type
)
4089 && num_nonzero_elements
> 0
4090 && VEC_length (constructor_elt
, elts
) > 1)
4092 tree temp
= create_tmp_var (TYPE_MAIN_VARIANT (type
), NULL
);
4093 TREE_OPERAND (*expr_p
, 0) = temp
;
4094 *expr_p
= build2 (COMPOUND_EXPR
, TREE_TYPE (*expr_p
),
4096 build2 (MODIFY_EXPR
, void_type_node
,
4101 if (notify_temp_creation
)
4104 /* If there are nonzero elements and if needed, pre-evaluate to capture
4105 elements overlapping with the lhs into temporaries. We must do this
4106 before clearing to fetch the values before they are zeroed-out. */
4107 if (num_nonzero_elements
> 0 && TREE_CODE (*expr_p
) != INIT_EXPR
)
4109 preeval_data
.lhs_base_decl
= get_base_address (object
);
4110 if (!DECL_P (preeval_data
.lhs_base_decl
))
4111 preeval_data
.lhs_base_decl
= NULL
;
4112 preeval_data
.lhs_alias_set
= get_alias_set (object
);
4114 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p
, 1),
4115 pre_p
, post_p
, &preeval_data
);
4120 /* Zap the CONSTRUCTOR element list, which simplifies this case.
4121 Note that we still have to gimplify, in order to handle the
4122 case of variable sized types. Avoid shared tree structures. */
4123 CONSTRUCTOR_ELTS (ctor
) = NULL
;
4124 TREE_SIDE_EFFECTS (ctor
) = 0;
4125 object
= unshare_expr (object
);
4126 gimplify_stmt (expr_p
, pre_p
);
4129 /* If we have not block cleared the object, or if there are nonzero
4130 elements in the constructor, add assignments to the individual
4131 scalar fields of the object. */
4132 if (!cleared
|| num_nonzero_elements
> 0)
4133 gimplify_init_ctor_eval (object
, elts
, pre_p
, cleared
);
4135 *expr_p
= NULL_TREE
;
4143 if (notify_temp_creation
)
4146 /* Extract the real and imaginary parts out of the ctor. */
4147 gcc_assert (VEC_length (constructor_elt
, elts
) == 2);
4148 r
= VEC_index (constructor_elt
, elts
, 0).value
;
4149 i
= VEC_index (constructor_elt
, elts
, 1).value
;
4150 if (r
== NULL
|| i
== NULL
)
4152 tree zero
= build_zero_cst (TREE_TYPE (type
));
4159 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
4160 represent creation of a complex value. */
4161 if (TREE_CONSTANT (r
) && TREE_CONSTANT (i
))
4163 ctor
= build_complex (type
, r
, i
);
4164 TREE_OPERAND (*expr_p
, 1) = ctor
;
4168 ctor
= build2 (COMPLEX_EXPR
, type
, r
, i
);
4169 TREE_OPERAND (*expr_p
, 1) = ctor
;
4170 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1),
4173 rhs_predicate_for (TREE_OPERAND (*expr_p
, 0)),
4181 unsigned HOST_WIDE_INT ix
;
4182 constructor_elt
*ce
;
4184 if (notify_temp_creation
)
4187 /* Go ahead and simplify constant constructors to VECTOR_CST. */
4188 if (TREE_CONSTANT (ctor
))
4190 bool constant_p
= true;
4193 /* Even when ctor is constant, it might contain non-*_CST
4194 elements, such as addresses or trapping values like
4195 1.0/0.0 - 1.0/0.0. Such expressions don't belong
4196 in VECTOR_CST nodes. */
4197 FOR_EACH_CONSTRUCTOR_VALUE (elts
, ix
, value
)
4198 if (!CONSTANT_CLASS_P (value
))
4206 TREE_OPERAND (*expr_p
, 1) = build_vector_from_ctor (type
, elts
);
4210 /* Don't reduce an initializer constant even if we can't
4211 make a VECTOR_CST. It won't do anything for us, and it'll
4212 prevent us from representing it as a single constant. */
4213 if (initializer_constant_valid_p (ctor
, type
))
4216 TREE_CONSTANT (ctor
) = 0;
4219 /* Vector types use CONSTRUCTOR all the way through gimple
4220 compilation as a general initializer. */
4221 FOR_EACH_VEC_ELT (constructor_elt
, elts
, ix
, ce
)
4223 enum gimplify_status tret
;
4224 tret
= gimplify_expr (&ce
->value
, pre_p
, post_p
, is_gimple_val
,
4226 if (tret
== GS_ERROR
)
4229 if (!is_gimple_reg (TREE_OPERAND (*expr_p
, 0)))
4230 TREE_OPERAND (*expr_p
, 1) = get_formal_tmp_var (ctor
, pre_p
);
4235 /* So how did we get a CONSTRUCTOR for a scalar type? */
4239 if (ret
== GS_ERROR
)
4241 else if (want_value
)
4248 /* If we have gimplified both sides of the initializer but have
4249 not emitted an assignment, do so now. */
4252 tree lhs
= TREE_OPERAND (*expr_p
, 0);
4253 tree rhs
= TREE_OPERAND (*expr_p
, 1);
4254 gimple init
= gimple_build_assign (lhs
, rhs
);
4255 gimplify_seq_add_stmt (pre_p
, init
);
4263 /* Given a pointer value OP0, return a simplified version of an
4264 indirection through OP0, or NULL_TREE if no simplification is
4265 possible. Note that the resulting type may be different from
4266 the type pointed to in the sense that it is still compatible
4267 from the langhooks point of view. */
4270 gimple_fold_indirect_ref (tree t
)
4272 tree ptype
= TREE_TYPE (t
), type
= TREE_TYPE (ptype
);
4277 subtype
= TREE_TYPE (sub
);
4278 if (!POINTER_TYPE_P (subtype
))
4281 if (TREE_CODE (sub
) == ADDR_EXPR
)
4283 tree op
= TREE_OPERAND (sub
, 0);
4284 tree optype
= TREE_TYPE (op
);
4286 if (useless_type_conversion_p (type
, optype
))
4289 /* *(foo *)&fooarray => fooarray[0] */
4290 if (TREE_CODE (optype
) == ARRAY_TYPE
4291 && TREE_CODE (TYPE_SIZE (TREE_TYPE (optype
))) == INTEGER_CST
4292 && useless_type_conversion_p (type
, TREE_TYPE (optype
)))
4294 tree type_domain
= TYPE_DOMAIN (optype
);
4295 tree min_val
= size_zero_node
;
4296 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
4297 min_val
= TYPE_MIN_VALUE (type_domain
);
4298 if (TREE_CODE (min_val
) == INTEGER_CST
)
4299 return build4 (ARRAY_REF
, type
, op
, min_val
, NULL_TREE
, NULL_TREE
);
4301 /* *(foo *)&complexfoo => __real__ complexfoo */
4302 else if (TREE_CODE (optype
) == COMPLEX_TYPE
4303 && useless_type_conversion_p (type
, TREE_TYPE (optype
)))
4304 return fold_build1 (REALPART_EXPR
, type
, op
);
4305 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
4306 else if (TREE_CODE (optype
) == VECTOR_TYPE
4307 && useless_type_conversion_p (type
, TREE_TYPE (optype
)))
4309 tree part_width
= TYPE_SIZE (type
);
4310 tree index
= bitsize_int (0);
4311 return fold_build3 (BIT_FIELD_REF
, type
, op
, part_width
, index
);
4315 /* *(p + CST) -> ... */
4316 if (TREE_CODE (sub
) == POINTER_PLUS_EXPR
4317 && TREE_CODE (TREE_OPERAND (sub
, 1)) == INTEGER_CST
)
4319 tree addr
= TREE_OPERAND (sub
, 0);
4320 tree off
= TREE_OPERAND (sub
, 1);
4324 addrtype
= TREE_TYPE (addr
);
4326 /* ((foo*)&vectorfoo)[1] -> BIT_FIELD_REF<vectorfoo,...> */
4327 if (TREE_CODE (addr
) == ADDR_EXPR
4328 && TREE_CODE (TREE_TYPE (addrtype
)) == VECTOR_TYPE
4329 && useless_type_conversion_p (type
, TREE_TYPE (TREE_TYPE (addrtype
)))
4330 && host_integerp (off
, 1))
4332 unsigned HOST_WIDE_INT offset
= tree_low_cst (off
, 1);
4333 tree part_width
= TYPE_SIZE (type
);
4334 unsigned HOST_WIDE_INT part_widthi
4335 = tree_low_cst (part_width
, 0) / BITS_PER_UNIT
;
4336 unsigned HOST_WIDE_INT indexi
= offset
* BITS_PER_UNIT
;
4337 tree index
= bitsize_int (indexi
);
4338 if (offset
/ part_widthi
4339 <= TYPE_VECTOR_SUBPARTS (TREE_TYPE (addrtype
)))
4340 return fold_build3 (BIT_FIELD_REF
, type
, TREE_OPERAND (addr
, 0),
4344 /* ((foo*)&complexfoo)[1] -> __imag__ complexfoo */
4345 if (TREE_CODE (addr
) == ADDR_EXPR
4346 && TREE_CODE (TREE_TYPE (addrtype
)) == COMPLEX_TYPE
4347 && useless_type_conversion_p (type
, TREE_TYPE (TREE_TYPE (addrtype
))))
4349 tree size
= TYPE_SIZE_UNIT (type
);
4350 if (tree_int_cst_equal (size
, off
))
4351 return fold_build1 (IMAGPART_EXPR
, type
, TREE_OPERAND (addr
, 0));
4354 /* *(p + CST) -> MEM_REF <p, CST>. */
4355 if (TREE_CODE (addr
) != ADDR_EXPR
4356 || DECL_P (TREE_OPERAND (addr
, 0)))
4357 return fold_build2 (MEM_REF
, type
,
4359 build_int_cst_wide (ptype
,
4360 TREE_INT_CST_LOW (off
),
4361 TREE_INT_CST_HIGH (off
)));
4364 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
4365 if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
4366 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (subtype
)))) == INTEGER_CST
4367 && useless_type_conversion_p (type
, TREE_TYPE (TREE_TYPE (subtype
))))
4370 tree min_val
= size_zero_node
;
4372 sub
= gimple_fold_indirect_ref (sub
);
4374 sub
= build1 (INDIRECT_REF
, TREE_TYPE (subtype
), osub
);
4375 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
4376 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
4377 min_val
= TYPE_MIN_VALUE (type_domain
);
4378 if (TREE_CODE (min_val
) == INTEGER_CST
)
4379 return build4 (ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
, NULL_TREE
);
4385 /* Given a pointer value OP0, return a simplified version of an
4386 indirection through OP0, or NULL_TREE if no simplification is
4387 possible. This may only be applied to a rhs of an expression.
4388 Note that the resulting type may be different from the type pointed
4389 to in the sense that it is still compatible from the langhooks
4393 gimple_fold_indirect_ref_rhs (tree t
)
4395 return gimple_fold_indirect_ref (t
);
4398 /* Subroutine of gimplify_modify_expr to do simplifications of
4399 MODIFY_EXPRs based on the code of the RHS. We loop for as long as
4400 something changes. */
4402 static enum gimplify_status
4403 gimplify_modify_expr_rhs (tree
*expr_p
, tree
*from_p
, tree
*to_p
,
4404 gimple_seq
*pre_p
, gimple_seq
*post_p
,
4407 enum gimplify_status ret
= GS_UNHANDLED
;
4413 switch (TREE_CODE (*from_p
))
4416 /* If we're assigning from a read-only variable initialized with
4417 a constructor, do the direct assignment from the constructor,
4418 but only if neither source nor target are volatile since this
4419 latter assignment might end up being done on a per-field basis. */
4420 if (DECL_INITIAL (*from_p
)
4421 && TREE_READONLY (*from_p
)
4422 && !TREE_THIS_VOLATILE (*from_p
)
4423 && !TREE_THIS_VOLATILE (*to_p
)
4424 && TREE_CODE (DECL_INITIAL (*from_p
)) == CONSTRUCTOR
)
4426 tree old_from
= *from_p
;
4427 enum gimplify_status subret
;
4429 /* Move the constructor into the RHS. */
4430 *from_p
= unshare_expr (DECL_INITIAL (*from_p
));
4432 /* Let's see if gimplify_init_constructor will need to put
4434 subret
= gimplify_init_constructor (expr_p
, NULL
, NULL
,
4436 if (subret
== GS_ERROR
)
4438 /* If so, revert the change. */
4450 /* If we have code like
4454 where the type of "x" is a (possibly cv-qualified variant
4455 of "A"), treat the entire expression as identical to "x".
4456 This kind of code arises in C++ when an object is bound
4457 to a const reference, and if "x" is a TARGET_EXPR we want
4458 to take advantage of the optimization below. */
4459 bool volatile_p
= TREE_THIS_VOLATILE (*from_p
);
4460 tree t
= gimple_fold_indirect_ref_rhs (TREE_OPERAND (*from_p
, 0));
4463 if (TREE_THIS_VOLATILE (t
) != volatile_p
)
4465 if (TREE_CODE_CLASS (TREE_CODE (t
)) == tcc_declaration
)
4466 t
= build_simple_mem_ref_loc (EXPR_LOCATION (*from_p
),
4467 build_fold_addr_expr (t
));
4468 if (REFERENCE_CLASS_P (t
))
4469 TREE_THIS_VOLATILE (t
) = volatile_p
;
4480 /* If we are initializing something from a TARGET_EXPR, strip the
4481 TARGET_EXPR and initialize it directly, if possible. This can't
4482 be done if the initializer is void, since that implies that the
4483 temporary is set in some non-trivial way.
4485 ??? What about code that pulls out the temp and uses it
4486 elsewhere? I think that such code never uses the TARGET_EXPR as
4487 an initializer. If I'm wrong, we'll die because the temp won't
4488 have any RTL. In that case, I guess we'll need to replace
4489 references somehow. */
4490 tree init
= TARGET_EXPR_INITIAL (*from_p
);
4493 && !VOID_TYPE_P (TREE_TYPE (init
)))
4503 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
4505 gimplify_compound_expr (from_p
, pre_p
, true);
4511 /* If we already made some changes, let the front end have a
4512 crack at this before we break it down. */
4513 if (ret
!= GS_UNHANDLED
)
4515 /* If we're initializing from a CONSTRUCTOR, break this into
4516 individual MODIFY_EXPRs. */
4517 return gimplify_init_constructor (expr_p
, pre_p
, post_p
, want_value
,
4521 /* If we're assigning to a non-register type, push the assignment
4522 down into the branches. This is mandatory for ADDRESSABLE types,
4523 since we cannot generate temporaries for such, but it saves a
4524 copy in other cases as well. */
4525 if (!is_gimple_reg_type (TREE_TYPE (*from_p
)))
4527 /* This code should mirror the code in gimplify_cond_expr. */
4528 enum tree_code code
= TREE_CODE (*expr_p
);
4529 tree cond
= *from_p
;
4530 tree result
= *to_p
;
4532 ret
= gimplify_expr (&result
, pre_p
, post_p
,
4533 is_gimple_lvalue
, fb_lvalue
);
4534 if (ret
!= GS_ERROR
)
4537 if (TREE_TYPE (TREE_OPERAND (cond
, 1)) != void_type_node
)
4538 TREE_OPERAND (cond
, 1)
4539 = build2 (code
, void_type_node
, result
,
4540 TREE_OPERAND (cond
, 1));
4541 if (TREE_TYPE (TREE_OPERAND (cond
, 2)) != void_type_node
)
4542 TREE_OPERAND (cond
, 2)
4543 = build2 (code
, void_type_node
, unshare_expr (result
),
4544 TREE_OPERAND (cond
, 2));
4546 TREE_TYPE (cond
) = void_type_node
;
4547 recalculate_side_effects (cond
);
4551 gimplify_and_add (cond
, pre_p
);
4552 *expr_p
= unshare_expr (result
);
4561 /* For calls that return in memory, give *to_p as the CALL_EXPR's
4562 return slot so that we don't generate a temporary. */
4563 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p
)
4564 && aggregate_value_p (*from_p
, *from_p
))
4568 if (!(rhs_predicate_for (*to_p
))(*from_p
))
4569 /* If we need a temporary, *to_p isn't accurate. */
4571 /* It's OK to use the return slot directly unless it's an NRV. */
4572 else if (TREE_CODE (*to_p
) == RESULT_DECL
4573 && DECL_NAME (*to_p
) == NULL_TREE
4574 && needs_to_live_in_memory (*to_p
))
4576 else if (is_gimple_reg_type (TREE_TYPE (*to_p
))
4577 || (DECL_P (*to_p
) && DECL_REGISTER (*to_p
)))
4578 /* Don't force regs into memory. */
4580 else if (TREE_CODE (*expr_p
) == INIT_EXPR
)
4581 /* It's OK to use the target directly if it's being
4584 else if (variably_modified_type_p (TREE_TYPE (*to_p
), NULL_TREE
))
4585 /* Always use the target and thus RSO for variable-sized types.
4586 GIMPLE cannot deal with a variable-sized assignment
4587 embedded in a call statement. */
4589 else if (TREE_CODE (*to_p
) != SSA_NAME
4590 && (!is_gimple_variable (*to_p
)
4591 || needs_to_live_in_memory (*to_p
)))
4592 /* Don't use the original target if it's already addressable;
4593 if its address escapes, and the called function uses the
4594 NRV optimization, a conforming program could see *to_p
4595 change before the called function returns; see c++/19317.
4596 When optimizing, the return_slot pass marks more functions
4597 as safe after we have escape info. */
4604 CALL_EXPR_RETURN_SLOT_OPT (*from_p
) = 1;
4605 mark_addressable (*to_p
);
4610 case WITH_SIZE_EXPR
:
4611 /* Likewise for calls that return an aggregate of non-constant size,
4612 since we would not be able to generate a temporary at all. */
4613 if (TREE_CODE (TREE_OPERAND (*from_p
, 0)) == CALL_EXPR
)
4615 *from_p
= TREE_OPERAND (*from_p
, 0);
4616 /* We don't change ret in this case because the
4617 WITH_SIZE_EXPR might have been added in
4618 gimplify_modify_expr, so returning GS_OK would lead to an
4624 /* If we're initializing from a container, push the initialization
4626 case CLEANUP_POINT_EXPR
:
4628 case STATEMENT_LIST
:
4630 tree wrap
= *from_p
;
4633 ret
= gimplify_expr (to_p
, pre_p
, post_p
, is_gimple_min_lval
,
4635 if (ret
!= GS_ERROR
)
4638 t
= voidify_wrapper_expr (wrap
, *expr_p
);
4639 gcc_assert (t
== *expr_p
);
4643 gimplify_and_add (wrap
, pre_p
);
4644 *expr_p
= unshare_expr (*to_p
);
4651 case COMPOUND_LITERAL_EXPR
:
4653 tree complit
= TREE_OPERAND (*expr_p
, 1);
4654 tree decl_s
= COMPOUND_LITERAL_EXPR_DECL_EXPR (complit
);
4655 tree decl
= DECL_EXPR_DECL (decl_s
);
4656 tree init
= DECL_INITIAL (decl
);
4658 /* struct T x = (struct T) { 0, 1, 2 } can be optimized
4659 into struct T x = { 0, 1, 2 } if the address of the
4660 compound literal has never been taken. */
4661 if (!TREE_ADDRESSABLE (complit
)
4662 && !TREE_ADDRESSABLE (decl
)
4665 *expr_p
= copy_node (*expr_p
);
4666 TREE_OPERAND (*expr_p
, 1) = init
;
4681 /* Return true if T looks like a valid GIMPLE statement. */
4684 is_gimple_stmt (tree t
)
4686 const enum tree_code code
= TREE_CODE (t
);
4691 /* The only valid NOP_EXPR is the empty statement. */
4692 return IS_EMPTY_STMT (t
);
4696 /* These are only valid if they're void. */
4697 return TREE_TYPE (t
) == NULL
|| VOID_TYPE_P (TREE_TYPE (t
));
4703 case CASE_LABEL_EXPR
:
4704 case TRY_CATCH_EXPR
:
4705 case TRY_FINALLY_EXPR
:
4706 case EH_FILTER_EXPR
:
4709 case STATEMENT_LIST
:
4719 /* These are always void. */
4725 /* These are valid regardless of their type. */
4734 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
4735 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
4736 DECL_GIMPLE_REG_P set.
4738 IMPORTANT NOTE: This promotion is performed by introducing a load of the
4739 other, unmodified part of the complex object just before the total store.
4740 As a consequence, if the object is still uninitialized, an undefined value
4741 will be loaded into a register, which may result in a spurious exception
4742 if the register is floating-point and the value happens to be a signaling
4743 NaN for example. Then the fully-fledged complex operations lowering pass
4744 followed by a DCE pass are necessary in order to fix things up. */
4746 static enum gimplify_status
4747 gimplify_modify_expr_complex_part (tree
*expr_p
, gimple_seq
*pre_p
,
4750 enum tree_code code
, ocode
;
4751 tree lhs
, rhs
, new_rhs
, other
, realpart
, imagpart
;
4753 lhs
= TREE_OPERAND (*expr_p
, 0);
4754 rhs
= TREE_OPERAND (*expr_p
, 1);
4755 code
= TREE_CODE (lhs
);
4756 lhs
= TREE_OPERAND (lhs
, 0);
4758 ocode
= code
== REALPART_EXPR
? IMAGPART_EXPR
: REALPART_EXPR
;
4759 other
= build1 (ocode
, TREE_TYPE (rhs
), lhs
);
4760 TREE_NO_WARNING (other
) = 1;
4761 other
= get_formal_tmp_var (other
, pre_p
);
4763 realpart
= code
== REALPART_EXPR
? rhs
: other
;
4764 imagpart
= code
== REALPART_EXPR
? other
: rhs
;
4766 if (TREE_CONSTANT (realpart
) && TREE_CONSTANT (imagpart
))
4767 new_rhs
= build_complex (TREE_TYPE (lhs
), realpart
, imagpart
);
4769 new_rhs
= build2 (COMPLEX_EXPR
, TREE_TYPE (lhs
), realpart
, imagpart
);
4771 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (lhs
, new_rhs
));
4772 *expr_p
= (want_value
) ? rhs
: NULL_TREE
;
4777 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
4783 PRE_P points to the list where side effects that must happen before
4784 *EXPR_P should be stored.
4786 POST_P points to the list where side effects that must happen after
4787 *EXPR_P should be stored.
4789 WANT_VALUE is nonzero iff we want to use the value of this expression
4790 in another expression. */
4792 static enum gimplify_status
4793 gimplify_modify_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
4796 tree
*from_p
= &TREE_OPERAND (*expr_p
, 1);
4797 tree
*to_p
= &TREE_OPERAND (*expr_p
, 0);
4798 enum gimplify_status ret
= GS_UNHANDLED
;
4800 location_t loc
= EXPR_LOCATION (*expr_p
);
4801 gimple_stmt_iterator gsi
;
4803 gcc_assert (TREE_CODE (*expr_p
) == MODIFY_EXPR
4804 || TREE_CODE (*expr_p
) == INIT_EXPR
);
4806 /* Trying to simplify a clobber using normal logic doesn't work,
4807 so handle it here. */
4808 if (TREE_CLOBBER_P (*from_p
))
4810 gcc_assert (!want_value
&& TREE_CODE (*to_p
) == VAR_DECL
);
4811 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (*to_p
, *from_p
));
4816 /* Insert pointer conversions required by the middle-end that are not
4817 required by the frontend. This fixes middle-end type checking for
4818 for example gcc.dg/redecl-6.c. */
4819 if (POINTER_TYPE_P (TREE_TYPE (*to_p
)))
4821 STRIP_USELESS_TYPE_CONVERSION (*from_p
);
4822 if (!useless_type_conversion_p (TREE_TYPE (*to_p
), TREE_TYPE (*from_p
)))
4823 *from_p
= fold_convert_loc (loc
, TREE_TYPE (*to_p
), *from_p
);
4826 /* See if any simplifications can be done based on what the RHS is. */
4827 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
4829 if (ret
!= GS_UNHANDLED
)
4832 /* For zero sized types only gimplify the left hand side and right hand
4833 side as statements and throw away the assignment. Do this after
4834 gimplify_modify_expr_rhs so we handle TARGET_EXPRs of addressable
4836 if (zero_sized_type (TREE_TYPE (*from_p
)) && !want_value
)
4838 gimplify_stmt (from_p
, pre_p
);
4839 gimplify_stmt (to_p
, pre_p
);
4840 *expr_p
= NULL_TREE
;
4844 /* If the value being copied is of variable width, compute the length
4845 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
4846 before gimplifying any of the operands so that we can resolve any
4847 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
4848 the size of the expression to be copied, not of the destination, so
4849 that is what we must do here. */
4850 maybe_with_size_expr (from_p
);
4852 ret
= gimplify_expr (to_p
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
4853 if (ret
== GS_ERROR
)
4856 /* As a special case, we have to temporarily allow for assignments
4857 with a CALL_EXPR on the RHS. Since in GIMPLE a function call is
4858 a toplevel statement, when gimplifying the GENERIC expression
4859 MODIFY_EXPR <a, CALL_EXPR <foo>>, we cannot create the tuple
4860 GIMPLE_ASSIGN <a, GIMPLE_CALL <foo>>.
4862 Instead, we need to create the tuple GIMPLE_CALL <a, foo>. To
4863 prevent gimplify_expr from trying to create a new temporary for
4864 foo's LHS, we tell it that it should only gimplify until it
4865 reaches the CALL_EXPR. On return from gimplify_expr, the newly
4866 created GIMPLE_CALL <foo> will be the last statement in *PRE_P
4867 and all we need to do here is set 'a' to be its LHS. */
4868 ret
= gimplify_expr (from_p
, pre_p
, post_p
, rhs_predicate_for (*to_p
),
4870 if (ret
== GS_ERROR
)
4873 /* Now see if the above changed *from_p to something we handle specially. */
4874 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
4876 if (ret
!= GS_UNHANDLED
)
4879 /* If we've got a variable sized assignment between two lvalues (i.e. does
4880 not involve a call), then we can make things a bit more straightforward
4881 by converting the assignment to memcpy or memset. */
4882 if (TREE_CODE (*from_p
) == WITH_SIZE_EXPR
)
4884 tree from
= TREE_OPERAND (*from_p
, 0);
4885 tree size
= TREE_OPERAND (*from_p
, 1);
4887 if (TREE_CODE (from
) == CONSTRUCTOR
)
4888 return gimplify_modify_expr_to_memset (expr_p
, size
, want_value
, pre_p
);
4890 if (is_gimple_addressable (from
))
4893 return gimplify_modify_expr_to_memcpy (expr_p
, size
, want_value
,
4898 /* Transform partial stores to non-addressable complex variables into
4899 total stores. This allows us to use real instead of virtual operands
4900 for these variables, which improves optimization. */
4901 if ((TREE_CODE (*to_p
) == REALPART_EXPR
4902 || TREE_CODE (*to_p
) == IMAGPART_EXPR
)
4903 && is_gimple_reg (TREE_OPERAND (*to_p
, 0)))
4904 return gimplify_modify_expr_complex_part (expr_p
, pre_p
, want_value
);
4906 /* Try to alleviate the effects of the gimplification creating artificial
4907 temporaries (see for example is_gimple_reg_rhs) on the debug info. */
4908 if (!gimplify_ctxp
->into_ssa
4909 && TREE_CODE (*from_p
) == VAR_DECL
4910 && DECL_IGNORED_P (*from_p
)
4912 && !DECL_IGNORED_P (*to_p
))
4914 if (!DECL_NAME (*from_p
) && DECL_NAME (*to_p
))
4916 = create_tmp_var_name (IDENTIFIER_POINTER (DECL_NAME (*to_p
)));
4917 DECL_DEBUG_EXPR_IS_FROM (*from_p
) = 1;
4918 SET_DECL_DEBUG_EXPR (*from_p
, *to_p
);
4921 if (want_value
&& TREE_THIS_VOLATILE (*to_p
))
4922 *from_p
= get_initialized_tmp_var (*from_p
, pre_p
, post_p
);
4924 if (TREE_CODE (*from_p
) == CALL_EXPR
)
4926 /* Since the RHS is a CALL_EXPR, we need to create a GIMPLE_CALL
4927 instead of a GIMPLE_ASSIGN. */
4928 tree fnptrtype
= TREE_TYPE (CALL_EXPR_FN (*from_p
));
4929 CALL_EXPR_FN (*from_p
) = TREE_OPERAND (CALL_EXPR_FN (*from_p
), 0);
4930 STRIP_USELESS_TYPE_CONVERSION (CALL_EXPR_FN (*from_p
));
4931 assign
= gimple_build_call_from_tree (*from_p
);
4932 gimple_call_set_fntype (assign
, TREE_TYPE (fnptrtype
));
4933 if (!gimple_call_noreturn_p (assign
))
4934 gimple_call_set_lhs (assign
, *to_p
);
4938 assign
= gimple_build_assign (*to_p
, *from_p
);
4939 gimple_set_location (assign
, EXPR_LOCATION (*expr_p
));
4942 if (gimplify_ctxp
->into_ssa
&& is_gimple_reg (*to_p
))
4944 /* We should have got an SSA name from the start. */
4945 gcc_assert (TREE_CODE (*to_p
) == SSA_NAME
);
4948 gimplify_seq_add_stmt (pre_p
, assign
);
4949 gsi
= gsi_last (*pre_p
);
4954 *expr_p
= TREE_THIS_VOLATILE (*to_p
) ? *from_p
: unshare_expr (*to_p
);
4963 /* Gimplify a comparison between two variable-sized objects. Do this
4964 with a call to BUILT_IN_MEMCMP. */
4966 static enum gimplify_status
4967 gimplify_variable_sized_compare (tree
*expr_p
)
4969 location_t loc
= EXPR_LOCATION (*expr_p
);
4970 tree op0
= TREE_OPERAND (*expr_p
, 0);
4971 tree op1
= TREE_OPERAND (*expr_p
, 1);
4972 tree t
, arg
, dest
, src
, expr
;
4974 arg
= TYPE_SIZE_UNIT (TREE_TYPE (op0
));
4975 arg
= unshare_expr (arg
);
4976 arg
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (arg
, op0
);
4977 src
= build_fold_addr_expr_loc (loc
, op1
);
4978 dest
= build_fold_addr_expr_loc (loc
, op0
);
4979 t
= builtin_decl_implicit (BUILT_IN_MEMCMP
);
4980 t
= build_call_expr_loc (loc
, t
, 3, dest
, src
, arg
);
4983 = build2 (TREE_CODE (*expr_p
), TREE_TYPE (*expr_p
), t
, integer_zero_node
);
4984 SET_EXPR_LOCATION (expr
, loc
);
4990 /* Gimplify a comparison between two aggregate objects of integral scalar
4991 mode as a comparison between the bitwise equivalent scalar values. */
4993 static enum gimplify_status
4994 gimplify_scalar_mode_aggregate_compare (tree
*expr_p
)
4996 location_t loc
= EXPR_LOCATION (*expr_p
);
4997 tree op0
= TREE_OPERAND (*expr_p
, 0);
4998 tree op1
= TREE_OPERAND (*expr_p
, 1);
5000 tree type
= TREE_TYPE (op0
);
5001 tree scalar_type
= lang_hooks
.types
.type_for_mode (TYPE_MODE (type
), 1);
5003 op0
= fold_build1_loc (loc
, VIEW_CONVERT_EXPR
, scalar_type
, op0
);
5004 op1
= fold_build1_loc (loc
, VIEW_CONVERT_EXPR
, scalar_type
, op1
);
5007 = fold_build2_loc (loc
, TREE_CODE (*expr_p
), TREE_TYPE (*expr_p
), op0
, op1
);
5012 /* Gimplify an expression sequence. This function gimplifies each
5013 expression and rewrites the original expression with the last
5014 expression of the sequence in GIMPLE form.
5016 PRE_P points to the list where the side effects for all the
5017 expressions in the sequence will be emitted.
5019 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
5021 static enum gimplify_status
5022 gimplify_compound_expr (tree
*expr_p
, gimple_seq
*pre_p
, bool want_value
)
5028 tree
*sub_p
= &TREE_OPERAND (t
, 0);
5030 if (TREE_CODE (*sub_p
) == COMPOUND_EXPR
)
5031 gimplify_compound_expr (sub_p
, pre_p
, false);
5033 gimplify_stmt (sub_p
, pre_p
);
5035 t
= TREE_OPERAND (t
, 1);
5037 while (TREE_CODE (t
) == COMPOUND_EXPR
);
5044 gimplify_stmt (expr_p
, pre_p
);
5049 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
5050 gimplify. After gimplification, EXPR_P will point to a new temporary
5051 that holds the original value of the SAVE_EXPR node.
5053 PRE_P points to the list where side effects that must happen before
5054 *EXPR_P should be stored. */
5056 static enum gimplify_status
5057 gimplify_save_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
5059 enum gimplify_status ret
= GS_ALL_DONE
;
5062 gcc_assert (TREE_CODE (*expr_p
) == SAVE_EXPR
);
5063 val
= TREE_OPERAND (*expr_p
, 0);
5065 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
5066 if (!SAVE_EXPR_RESOLVED_P (*expr_p
))
5068 /* The operand may be a void-valued expression such as SAVE_EXPRs
5069 generated by the Java frontend for class initialization. It is
5070 being executed only for its side-effects. */
5071 if (TREE_TYPE (val
) == void_type_node
)
5073 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5074 is_gimple_stmt
, fb_none
);
5078 val
= get_initialized_tmp_var (val
, pre_p
, post_p
);
5080 TREE_OPERAND (*expr_p
, 0) = val
;
5081 SAVE_EXPR_RESOLVED_P (*expr_p
) = 1;
5089 /* Rewrite the ADDR_EXPR node pointed to by EXPR_P
5096 PRE_P points to the list where side effects that must happen before
5097 *EXPR_P should be stored.
5099 POST_P points to the list where side effects that must happen after
5100 *EXPR_P should be stored. */
5102 static enum gimplify_status
5103 gimplify_addr_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
5105 tree expr
= *expr_p
;
5106 tree op0
= TREE_OPERAND (expr
, 0);
5107 enum gimplify_status ret
;
5108 location_t loc
= EXPR_LOCATION (*expr_p
);
5110 switch (TREE_CODE (op0
))
5114 /* Check if we are dealing with an expression of the form '&*ptr'.
5115 While the front end folds away '&*ptr' into 'ptr', these
5116 expressions may be generated internally by the compiler (e.g.,
5117 builtins like __builtin_va_end). */
5118 /* Caution: the silent array decomposition semantics we allow for
5119 ADDR_EXPR means we can't always discard the pair. */
5120 /* Gimplification of the ADDR_EXPR operand may drop
5121 cv-qualification conversions, so make sure we add them if
5124 tree op00
= TREE_OPERAND (op0
, 0);
5125 tree t_expr
= TREE_TYPE (expr
);
5126 tree t_op00
= TREE_TYPE (op00
);
5128 if (!useless_type_conversion_p (t_expr
, t_op00
))
5129 op00
= fold_convert_loc (loc
, TREE_TYPE (expr
), op00
);
5135 case VIEW_CONVERT_EXPR
:
5136 /* Take the address of our operand and then convert it to the type of
5139 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
5140 all clear. The impact of this transformation is even less clear. */
5142 /* If the operand is a useless conversion, look through it. Doing so
5143 guarantees that the ADDR_EXPR and its operand will remain of the
5145 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0
, 0)))
5146 op0
= TREE_OPERAND (op0
, 0);
5148 *expr_p
= fold_convert_loc (loc
, TREE_TYPE (expr
),
5149 build_fold_addr_expr_loc (loc
,
5150 TREE_OPERAND (op0
, 0)));
5155 /* We use fb_either here because the C frontend sometimes takes
5156 the address of a call that returns a struct; see
5157 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
5158 the implied temporary explicit. */
5160 /* Make the operand addressable. */
5161 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, post_p
,
5162 is_gimple_addressable
, fb_either
);
5163 if (ret
== GS_ERROR
)
5166 /* Then mark it. Beware that it may not be possible to do so directly
5167 if a temporary has been created by the gimplification. */
5168 prepare_gimple_addressable (&TREE_OPERAND (expr
, 0), pre_p
);
5170 op0
= TREE_OPERAND (expr
, 0);
5172 /* For various reasons, the gimplification of the expression
5173 may have made a new INDIRECT_REF. */
5174 if (TREE_CODE (op0
) == INDIRECT_REF
)
5175 goto do_indirect_ref
;
5177 mark_addressable (TREE_OPERAND (expr
, 0));
5179 /* The FEs may end up building ADDR_EXPRs early on a decl with
5180 an incomplete type. Re-build ADDR_EXPRs in canonical form
5182 if (!types_compatible_p (TREE_TYPE (op0
), TREE_TYPE (TREE_TYPE (expr
))))
5183 *expr_p
= build_fold_addr_expr (op0
);
5185 /* Make sure TREE_CONSTANT and TREE_SIDE_EFFECTS are set properly. */
5186 recompute_tree_invariant_for_addr_expr (*expr_p
);
5188 /* If we re-built the ADDR_EXPR add a conversion to the original type
5190 if (!useless_type_conversion_p (TREE_TYPE (expr
), TREE_TYPE (*expr_p
)))
5191 *expr_p
= fold_convert (TREE_TYPE (expr
), *expr_p
);
5199 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
5200 value; output operands should be a gimple lvalue. */
5202 static enum gimplify_status
5203 gimplify_asm_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
5207 const char **oconstraints
;
5210 const char *constraint
;
5211 bool allows_mem
, allows_reg
, is_inout
;
5212 enum gimplify_status ret
, tret
;
5214 VEC(tree
, gc
) *inputs
;
5215 VEC(tree
, gc
) *outputs
;
5216 VEC(tree
, gc
) *clobbers
;
5217 VEC(tree
, gc
) *labels
;
5221 noutputs
= list_length (ASM_OUTPUTS (expr
));
5222 oconstraints
= (const char **) alloca ((noutputs
) * sizeof (const char *));
5224 inputs
= outputs
= clobbers
= labels
= NULL
;
5227 link_next
= NULL_TREE
;
5228 for (i
= 0, link
= ASM_OUTPUTS (expr
); link
; ++i
, link
= link_next
)
5231 size_t constraint_len
;
5233 link_next
= TREE_CHAIN (link
);
5237 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
5238 constraint_len
= strlen (constraint
);
5239 if (constraint_len
== 0)
5242 ok
= parse_output_constraint (&constraint
, i
, 0, 0,
5243 &allows_mem
, &allows_reg
, &is_inout
);
5250 if (!allows_reg
&& allows_mem
)
5251 mark_addressable (TREE_VALUE (link
));
5253 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
5254 is_inout
? is_gimple_min_lval
: is_gimple_lvalue
,
5255 fb_lvalue
| fb_mayfail
);
5256 if (tret
== GS_ERROR
)
5258 error ("invalid lvalue in asm output %d", i
);
5262 VEC_safe_push (tree
, gc
, outputs
, link
);
5263 TREE_CHAIN (link
) = NULL_TREE
;
5267 /* An input/output operand. To give the optimizers more
5268 flexibility, split it into separate input and output
5273 /* Turn the in/out constraint into an output constraint. */
5274 char *p
= xstrdup (constraint
);
5276 TREE_VALUE (TREE_PURPOSE (link
)) = build_string (constraint_len
, p
);
5278 /* And add a matching input constraint. */
5281 sprintf (buf
, "%d", i
);
5283 /* If there are multiple alternatives in the constraint,
5284 handle each of them individually. Those that allow register
5285 will be replaced with operand number, the others will stay
5287 if (strchr (p
, ',') != NULL
)
5289 size_t len
= 0, buflen
= strlen (buf
);
5290 char *beg
, *end
, *str
, *dst
;
5294 end
= strchr (beg
, ',');
5296 end
= strchr (beg
, '\0');
5297 if ((size_t) (end
- beg
) < buflen
)
5300 len
+= end
- beg
+ 1;
5307 str
= (char *) alloca (len
);
5308 for (beg
= p
+ 1, dst
= str
;;)
5311 bool mem_p
, reg_p
, inout_p
;
5313 end
= strchr (beg
, ',');
5318 parse_output_constraint (&tem
, i
, 0, 0,
5319 &mem_p
, ®_p
, &inout_p
);
5324 memcpy (dst
, buf
, buflen
);
5333 memcpy (dst
, beg
, len
);
5342 input
= build_string (dst
- str
, str
);
5345 input
= build_string (strlen (buf
), buf
);
5348 input
= build_string (constraint_len
- 1, constraint
+ 1);
5352 input
= build_tree_list (build_tree_list (NULL_TREE
, input
),
5353 unshare_expr (TREE_VALUE (link
)));
5354 ASM_INPUTS (expr
) = chainon (ASM_INPUTS (expr
), input
);
5358 link_next
= NULL_TREE
;
5359 for (link
= ASM_INPUTS (expr
); link
; ++i
, link
= link_next
)
5361 link_next
= TREE_CHAIN (link
);
5362 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
5363 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
5364 oconstraints
, &allows_mem
, &allows_reg
);
5366 /* If we can't make copies, we can only accept memory. */
5367 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (link
))))
5373 error ("impossible constraint in %<asm%>");
5374 error ("non-memory input %d must stay in memory", i
);
5379 /* If the operand is a memory input, it should be an lvalue. */
5380 if (!allows_reg
&& allows_mem
)
5382 tree inputv
= TREE_VALUE (link
);
5383 STRIP_NOPS (inputv
);
5384 if (TREE_CODE (inputv
) == PREDECREMENT_EXPR
5385 || TREE_CODE (inputv
) == PREINCREMENT_EXPR
5386 || TREE_CODE (inputv
) == POSTDECREMENT_EXPR
5387 || TREE_CODE (inputv
) == POSTINCREMENT_EXPR
)
5388 TREE_VALUE (link
) = error_mark_node
;
5389 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
5390 is_gimple_lvalue
, fb_lvalue
| fb_mayfail
);
5391 mark_addressable (TREE_VALUE (link
));
5392 if (tret
== GS_ERROR
)
5394 if (EXPR_HAS_LOCATION (TREE_VALUE (link
)))
5395 input_location
= EXPR_LOCATION (TREE_VALUE (link
));
5396 error ("memory input %d is not directly addressable", i
);
5402 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
5403 is_gimple_asm_val
, fb_rvalue
);
5404 if (tret
== GS_ERROR
)
5408 TREE_CHAIN (link
) = NULL_TREE
;
5409 VEC_safe_push (tree
, gc
, inputs
, link
);
5412 for (link
= ASM_CLOBBERS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
5413 VEC_safe_push (tree
, gc
, clobbers
, link
);
5415 for (link
= ASM_LABELS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
5416 VEC_safe_push (tree
, gc
, labels
, link
);
5418 /* Do not add ASMs with errors to the gimple IL stream. */
5419 if (ret
!= GS_ERROR
)
5421 stmt
= gimple_build_asm_vec (TREE_STRING_POINTER (ASM_STRING (expr
)),
5422 inputs
, outputs
, clobbers
, labels
);
5424 gimple_asm_set_volatile (stmt
, ASM_VOLATILE_P (expr
));
5425 gimple_asm_set_input (stmt
, ASM_INPUT_P (expr
));
5427 gimplify_seq_add_stmt (pre_p
, stmt
);
5433 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
5434 GIMPLE_WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
5435 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
5436 return to this function.
5438 FIXME should we complexify the prequeue handling instead? Or use flags
5439 for all the cleanups and let the optimizer tighten them up? The current
5440 code seems pretty fragile; it will break on a cleanup within any
5441 non-conditional nesting. But any such nesting would be broken, anyway;
5442 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
5443 and continues out of it. We can do that at the RTL level, though, so
5444 having an optimizer to tighten up try/finally regions would be a Good
5447 static enum gimplify_status
5448 gimplify_cleanup_point_expr (tree
*expr_p
, gimple_seq
*pre_p
)
5450 gimple_stmt_iterator iter
;
5451 gimple_seq body_sequence
= NULL
;
5453 tree temp
= voidify_wrapper_expr (*expr_p
, NULL
);
5455 /* We only care about the number of conditions between the innermost
5456 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
5457 any cleanups collected outside the CLEANUP_POINT_EXPR. */
5458 int old_conds
= gimplify_ctxp
->conditions
;
5459 gimple_seq old_cleanups
= gimplify_ctxp
->conditional_cleanups
;
5460 bool old_in_cleanup_point_expr
= gimplify_ctxp
->in_cleanup_point_expr
;
5461 gimplify_ctxp
->conditions
= 0;
5462 gimplify_ctxp
->conditional_cleanups
= NULL
;
5463 gimplify_ctxp
->in_cleanup_point_expr
= true;
5465 gimplify_stmt (&TREE_OPERAND (*expr_p
, 0), &body_sequence
);
5467 gimplify_ctxp
->conditions
= old_conds
;
5468 gimplify_ctxp
->conditional_cleanups
= old_cleanups
;
5469 gimplify_ctxp
->in_cleanup_point_expr
= old_in_cleanup_point_expr
;
5471 for (iter
= gsi_start (body_sequence
); !gsi_end_p (iter
); )
5473 gimple wce
= gsi_stmt (iter
);
5475 if (gimple_code (wce
) == GIMPLE_WITH_CLEANUP_EXPR
)
5477 if (gsi_one_before_end_p (iter
))
5479 /* Note that gsi_insert_seq_before and gsi_remove do not
5480 scan operands, unlike some other sequence mutators. */
5481 if (!gimple_wce_cleanup_eh_only (wce
))
5482 gsi_insert_seq_before_without_update (&iter
,
5483 gimple_wce_cleanup (wce
),
5485 gsi_remove (&iter
, true);
5492 enum gimple_try_flags kind
;
5494 if (gimple_wce_cleanup_eh_only (wce
))
5495 kind
= GIMPLE_TRY_CATCH
;
5497 kind
= GIMPLE_TRY_FINALLY
;
5498 seq
= gsi_split_seq_after (iter
);
5500 gtry
= gimple_build_try (seq
, gimple_wce_cleanup (wce
), kind
);
5501 /* Do not use gsi_replace here, as it may scan operands.
5502 We want to do a simple structural modification only. */
5503 gsi_set_stmt (&iter
, gtry
);
5504 iter
= gsi_start (gtry
->gimple_try
.eval
);
5511 gimplify_seq_add_seq (pre_p
, body_sequence
);
5524 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
5525 is the cleanup action required. EH_ONLY is true if the cleanup should
5526 only be executed if an exception is thrown, not on normal exit. */
5529 gimple_push_cleanup (tree var
, tree cleanup
, bool eh_only
, gimple_seq
*pre_p
)
5532 gimple_seq cleanup_stmts
= NULL
;
5534 /* Errors can result in improperly nested cleanups. Which results in
5535 confusion when trying to resolve the GIMPLE_WITH_CLEANUP_EXPR. */
5539 if (gimple_conditional_context ())
5541 /* If we're in a conditional context, this is more complex. We only
5542 want to run the cleanup if we actually ran the initialization that
5543 necessitates it, but we want to run it after the end of the
5544 conditional context. So we wrap the try/finally around the
5545 condition and use a flag to determine whether or not to actually
5546 run the destructor. Thus
5550 becomes (approximately)
5554 if (test) { A::A(temp); flag = 1; val = f(temp); }
5557 if (flag) A::~A(temp);
5561 tree flag
= create_tmp_var (boolean_type_node
, "cleanup");
5562 gimple ffalse
= gimple_build_assign (flag
, boolean_false_node
);
5563 gimple ftrue
= gimple_build_assign (flag
, boolean_true_node
);
5565 cleanup
= build3 (COND_EXPR
, void_type_node
, flag
, cleanup
, NULL
);
5566 gimplify_stmt (&cleanup
, &cleanup_stmts
);
5567 wce
= gimple_build_wce (cleanup_stmts
);
5569 gimplify_seq_add_stmt (&gimplify_ctxp
->conditional_cleanups
, ffalse
);
5570 gimplify_seq_add_stmt (&gimplify_ctxp
->conditional_cleanups
, wce
);
5571 gimplify_seq_add_stmt (pre_p
, ftrue
);
5573 /* Because of this manipulation, and the EH edges that jump
5574 threading cannot redirect, the temporary (VAR) will appear
5575 to be used uninitialized. Don't warn. */
5576 TREE_NO_WARNING (var
) = 1;
5580 gimplify_stmt (&cleanup
, &cleanup_stmts
);
5581 wce
= gimple_build_wce (cleanup_stmts
);
5582 gimple_wce_set_cleanup_eh_only (wce
, eh_only
);
5583 gimplify_seq_add_stmt (pre_p
, wce
);
5587 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
5589 static enum gimplify_status
5590 gimplify_target_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
5592 tree targ
= *expr_p
;
5593 tree temp
= TARGET_EXPR_SLOT (targ
);
5594 tree init
= TARGET_EXPR_INITIAL (targ
);
5595 enum gimplify_status ret
;
5599 tree cleanup
= NULL_TREE
;
5601 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
5602 to the temps list. Handle also variable length TARGET_EXPRs. */
5603 if (TREE_CODE (DECL_SIZE (temp
)) != INTEGER_CST
)
5605 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (temp
)))
5606 gimplify_type_sizes (TREE_TYPE (temp
), pre_p
);
5607 gimplify_vla_decl (temp
, pre_p
);
5610 gimple_add_tmp_var (temp
);
5612 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
5613 expression is supposed to initialize the slot. */
5614 if (VOID_TYPE_P (TREE_TYPE (init
)))
5615 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
, fb_none
);
5618 tree init_expr
= build2 (INIT_EXPR
, void_type_node
, temp
, init
);
5620 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
, fb_none
);
5622 ggc_free (init_expr
);
5624 if (ret
== GS_ERROR
)
5626 /* PR c++/28266 Make sure this is expanded only once. */
5627 TARGET_EXPR_INITIAL (targ
) = NULL_TREE
;
5631 gimplify_and_add (init
, pre_p
);
5633 /* If needed, push the cleanup for the temp. */
5634 if (TARGET_EXPR_CLEANUP (targ
))
5636 if (CLEANUP_EH_ONLY (targ
))
5637 gimple_push_cleanup (temp
, TARGET_EXPR_CLEANUP (targ
),
5638 CLEANUP_EH_ONLY (targ
), pre_p
);
5640 cleanup
= TARGET_EXPR_CLEANUP (targ
);
5643 /* Add a clobber for the temporary going out of scope, like
5644 gimplify_bind_expr. */
5645 if (gimplify_ctxp
->in_cleanup_point_expr
5646 && needs_to_live_in_memory (temp
)
5647 && flag_stack_reuse
== SR_ALL
)
5649 tree clobber
= build_constructor (TREE_TYPE (temp
), NULL
);
5650 TREE_THIS_VOLATILE (clobber
) = true;
5651 clobber
= build2 (MODIFY_EXPR
, TREE_TYPE (temp
), temp
, clobber
);
5653 cleanup
= build2 (COMPOUND_EXPR
, void_type_node
, cleanup
,
5660 gimple_push_cleanup (temp
, cleanup
, false, pre_p
);
5662 /* Only expand this once. */
5663 TREE_OPERAND (targ
, 3) = init
;
5664 TARGET_EXPR_INITIAL (targ
) = NULL_TREE
;
5667 /* We should have expanded this before. */
5668 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp
));
5674 /* Gimplification of expression trees. */
5676 /* Gimplify an expression which appears at statement context. The
5677 corresponding GIMPLE statements are added to *SEQ_P. If *SEQ_P is
5678 NULL, a new sequence is allocated.
5680 Return true if we actually added a statement to the queue. */
5683 gimplify_stmt (tree
*stmt_p
, gimple_seq
*seq_p
)
5685 gimple_seq_node last
;
5687 last
= gimple_seq_last (*seq_p
);
5688 gimplify_expr (stmt_p
, seq_p
, NULL
, is_gimple_stmt
, fb_none
);
5689 return last
!= gimple_seq_last (*seq_p
);
5692 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
5693 to CTX. If entries already exist, force them to be some flavor of private.
5694 If there is no enclosing parallel, do nothing. */
5697 omp_firstprivatize_variable (struct gimplify_omp_ctx
*ctx
, tree decl
)
5701 if (decl
== NULL
|| !DECL_P (decl
))
5706 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5709 if (n
->value
& GOVD_SHARED
)
5710 n
->value
= GOVD_FIRSTPRIVATE
| (n
->value
& GOVD_SEEN
);
5714 else if (ctx
->region_type
!= ORT_WORKSHARE
)
5715 omp_add_variable (ctx
, decl
, GOVD_FIRSTPRIVATE
);
5717 ctx
= ctx
->outer_context
;
5722 /* Similarly for each of the type sizes of TYPE. */
5725 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx
*ctx
, tree type
)
5727 if (type
== NULL
|| type
== error_mark_node
)
5729 type
= TYPE_MAIN_VARIANT (type
);
5731 if (pointer_set_insert (ctx
->privatized_types
, type
))
5734 switch (TREE_CODE (type
))
5740 case FIXED_POINT_TYPE
:
5741 omp_firstprivatize_variable (ctx
, TYPE_MIN_VALUE (type
));
5742 omp_firstprivatize_variable (ctx
, TYPE_MAX_VALUE (type
));
5746 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
5747 omp_firstprivatize_type_sizes (ctx
, TYPE_DOMAIN (type
));
5752 case QUAL_UNION_TYPE
:
5755 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
5756 if (TREE_CODE (field
) == FIELD_DECL
)
5758 omp_firstprivatize_variable (ctx
, DECL_FIELD_OFFSET (field
));
5759 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (field
));
5765 case REFERENCE_TYPE
:
5766 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
5773 omp_firstprivatize_variable (ctx
, TYPE_SIZE (type
));
5774 omp_firstprivatize_variable (ctx
, TYPE_SIZE_UNIT (type
));
5775 lang_hooks
.types
.omp_firstprivatize_type_sizes (ctx
, type
);
5778 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
5781 omp_add_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, unsigned int flags
)
5784 unsigned int nflags
;
5787 if (error_operand_p (decl
))
5790 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
5791 there are constructors involved somewhere. */
5792 if (TREE_ADDRESSABLE (TREE_TYPE (decl
))
5793 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
5796 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5799 /* We shouldn't be re-adding the decl with the same data
5801 gcc_assert ((n
->value
& GOVD_DATA_SHARE_CLASS
& flags
) == 0);
5802 /* The only combination of data sharing classes we should see is
5803 FIRSTPRIVATE and LASTPRIVATE. */
5804 nflags
= n
->value
| flags
;
5805 gcc_assert ((nflags
& GOVD_DATA_SHARE_CLASS
)
5806 == (GOVD_FIRSTPRIVATE
| GOVD_LASTPRIVATE
));
5811 /* When adding a variable-sized variable, we have to handle all sorts
5812 of additional bits of data: the pointer replacement variable, and
5813 the parameters of the type. */
5814 if (DECL_SIZE (decl
) && TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
5816 /* Add the pointer replacement variable as PRIVATE if the variable
5817 replacement is private, else FIRSTPRIVATE since we'll need the
5818 address of the original variable either for SHARED, or for the
5819 copy into or out of the context. */
5820 if (!(flags
& GOVD_LOCAL
))
5822 nflags
= flags
& GOVD_PRIVATE
? GOVD_PRIVATE
: GOVD_FIRSTPRIVATE
;
5823 nflags
|= flags
& GOVD_SEEN
;
5824 t
= DECL_VALUE_EXPR (decl
);
5825 gcc_assert (TREE_CODE (t
) == INDIRECT_REF
);
5826 t
= TREE_OPERAND (t
, 0);
5827 gcc_assert (DECL_P (t
));
5828 omp_add_variable (ctx
, t
, nflags
);
5831 /* Add all of the variable and type parameters (which should have
5832 been gimplified to a formal temporary) as FIRSTPRIVATE. */
5833 omp_firstprivatize_variable (ctx
, DECL_SIZE_UNIT (decl
));
5834 omp_firstprivatize_variable (ctx
, DECL_SIZE (decl
));
5835 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
5837 /* The variable-sized variable itself is never SHARED, only some form
5838 of PRIVATE. The sharing would take place via the pointer variable
5839 which we remapped above. */
5840 if (flags
& GOVD_SHARED
)
5841 flags
= GOVD_PRIVATE
| GOVD_DEBUG_PRIVATE
5842 | (flags
& (GOVD_SEEN
| GOVD_EXPLICIT
));
5844 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
5845 alloca statement we generate for the variable, so make sure it
5846 is available. This isn't automatically needed for the SHARED
5847 case, since we won't be allocating local storage then.
5848 For local variables TYPE_SIZE_UNIT might not be gimplified yet,
5849 in this case omp_notice_variable will be called later
5850 on when it is gimplified. */
5851 else if (! (flags
& GOVD_LOCAL
)
5852 && DECL_P (TYPE_SIZE_UNIT (TREE_TYPE (decl
))))
5853 omp_notice_variable (ctx
, TYPE_SIZE_UNIT (TREE_TYPE (decl
)), true);
5855 else if (lang_hooks
.decls
.omp_privatize_by_reference (decl
))
5857 gcc_assert ((flags
& GOVD_LOCAL
) == 0);
5858 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
5860 /* Similar to the direct variable sized case above, we'll need the
5861 size of references being privatized. */
5862 if ((flags
& GOVD_SHARED
) == 0)
5864 t
= TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl
)));
5865 if (TREE_CODE (t
) != INTEGER_CST
)
5866 omp_notice_variable (ctx
, t
, true);
5870 splay_tree_insert (ctx
->variables
, (splay_tree_key
)decl
, flags
);
5873 /* Notice a threadprivate variable DECL used in OpenMP context CTX.
5874 This just prints out diagnostics about threadprivate variable uses
5875 in untied tasks. If DECL2 is non-NULL, prevent this warning
5876 on that variable. */
5879 omp_notice_threadprivate_variable (struct gimplify_omp_ctx
*ctx
, tree decl
,
5884 if (ctx
->region_type
!= ORT_UNTIED_TASK
)
5886 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5889 error ("threadprivate variable %qE used in untied task",
5891 error_at (ctx
->location
, "enclosing task");
5892 splay_tree_insert (ctx
->variables
, (splay_tree_key
)decl
, 0);
5895 splay_tree_insert (ctx
->variables
, (splay_tree_key
)decl2
, 0);
5899 /* Record the fact that DECL was used within the OpenMP context CTX.
5900 IN_CODE is true when real code uses DECL, and false when we should
5901 merely emit default(none) errors. Return true if DECL is going to
5902 be remapped and thus DECL shouldn't be gimplified into its
5903 DECL_VALUE_EXPR (if any). */
5906 omp_notice_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, bool in_code
)
5909 unsigned flags
= in_code
? GOVD_SEEN
: 0;
5910 bool ret
= false, shared
;
5912 if (error_operand_p (decl
))
5915 /* Threadprivate variables are predetermined. */
5916 if (is_global_var (decl
))
5918 if (DECL_THREAD_LOCAL_P (decl
))
5919 return omp_notice_threadprivate_variable (ctx
, decl
, NULL_TREE
);
5921 if (DECL_HAS_VALUE_EXPR_P (decl
))
5923 tree value
= get_base_address (DECL_VALUE_EXPR (decl
));
5925 if (value
&& DECL_P (value
) && DECL_THREAD_LOCAL_P (value
))
5926 return omp_notice_threadprivate_variable (ctx
, decl
, value
);
5930 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5933 enum omp_clause_default_kind default_kind
, kind
;
5934 struct gimplify_omp_ctx
*octx
;
5936 if (ctx
->region_type
== ORT_WORKSHARE
)
5939 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
5940 remapped firstprivate instead of shared. To some extent this is
5941 addressed in omp_firstprivatize_type_sizes, but not effectively. */
5942 default_kind
= ctx
->default_kind
;
5943 kind
= lang_hooks
.decls
.omp_predetermined_sharing (decl
);
5944 if (kind
!= OMP_CLAUSE_DEFAULT_UNSPECIFIED
)
5945 default_kind
= kind
;
5947 switch (default_kind
)
5949 case OMP_CLAUSE_DEFAULT_NONE
:
5950 error ("%qE not specified in enclosing parallel",
5951 DECL_NAME (lang_hooks
.decls
.omp_report_decl (decl
)));
5952 if ((ctx
->region_type
& ORT_TASK
) != 0)
5953 error_at (ctx
->location
, "enclosing task");
5955 error_at (ctx
->location
, "enclosing parallel");
5957 case OMP_CLAUSE_DEFAULT_SHARED
:
5958 flags
|= GOVD_SHARED
;
5960 case OMP_CLAUSE_DEFAULT_PRIVATE
:
5961 flags
|= GOVD_PRIVATE
;
5963 case OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
:
5964 flags
|= GOVD_FIRSTPRIVATE
;
5966 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
5967 /* decl will be either GOVD_FIRSTPRIVATE or GOVD_SHARED. */
5968 gcc_assert ((ctx
->region_type
& ORT_TASK
) != 0);
5969 if (ctx
->outer_context
)
5970 omp_notice_variable (ctx
->outer_context
, decl
, in_code
);
5971 for (octx
= ctx
->outer_context
; octx
; octx
= octx
->outer_context
)
5975 n2
= splay_tree_lookup (octx
->variables
, (splay_tree_key
) decl
);
5976 if (n2
&& (n2
->value
& GOVD_DATA_SHARE_CLASS
) != GOVD_SHARED
)
5978 flags
|= GOVD_FIRSTPRIVATE
;
5981 if ((octx
->region_type
& ORT_PARALLEL
) != 0)
5984 if (flags
& GOVD_FIRSTPRIVATE
)
5987 && (TREE_CODE (decl
) == PARM_DECL
5988 || (!is_global_var (decl
)
5989 && DECL_CONTEXT (decl
) == current_function_decl
)))
5991 flags
|= GOVD_FIRSTPRIVATE
;
5994 flags
|= GOVD_SHARED
;
6000 if ((flags
& GOVD_PRIVATE
)
6001 && lang_hooks
.decls
.omp_private_outer_ref (decl
))
6002 flags
|= GOVD_PRIVATE_OUTER_REF
;
6004 omp_add_variable (ctx
, decl
, flags
);
6006 shared
= (flags
& GOVD_SHARED
) != 0;
6007 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
6011 if ((n
->value
& (GOVD_SEEN
| GOVD_LOCAL
)) == 0
6012 && (flags
& (GOVD_SEEN
| GOVD_LOCAL
)) == GOVD_SEEN
6014 && TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
6017 tree t
= DECL_VALUE_EXPR (decl
);
6018 gcc_assert (TREE_CODE (t
) == INDIRECT_REF
);
6019 t
= TREE_OPERAND (t
, 0);
6020 gcc_assert (DECL_P (t
));
6021 n2
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) t
);
6022 n2
->value
|= GOVD_SEEN
;
6025 shared
= ((flags
| n
->value
) & GOVD_SHARED
) != 0;
6026 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
6028 /* If nothing changed, there's nothing left to do. */
6029 if ((n
->value
& flags
) == flags
)
6035 /* If the variable is private in the current context, then we don't
6036 need to propagate anything to an outer context. */
6037 if ((flags
& GOVD_PRIVATE
) && !(flags
& GOVD_PRIVATE_OUTER_REF
))
6039 if (ctx
->outer_context
6040 && omp_notice_variable (ctx
->outer_context
, decl
, in_code
))
6045 /* Verify that DECL is private within CTX. If there's specific information
6046 to the contrary in the innermost scope, generate an error. */
6049 omp_is_private (struct gimplify_omp_ctx
*ctx
, tree decl
)
6053 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
6056 if (n
->value
& GOVD_SHARED
)
6058 if (ctx
== gimplify_omp_ctxp
)
6060 error ("iteration variable %qE should be private",
6062 n
->value
= GOVD_PRIVATE
;
6068 else if ((n
->value
& GOVD_EXPLICIT
) != 0
6069 && (ctx
== gimplify_omp_ctxp
6070 || (ctx
->region_type
== ORT_COMBINED_PARALLEL
6071 && gimplify_omp_ctxp
->outer_context
== ctx
)))
6073 if ((n
->value
& GOVD_FIRSTPRIVATE
) != 0)
6074 error ("iteration variable %qE should not be firstprivate",
6076 else if ((n
->value
& GOVD_REDUCTION
) != 0)
6077 error ("iteration variable %qE should not be reduction",
6080 return (ctx
== gimplify_omp_ctxp
6081 || (ctx
->region_type
== ORT_COMBINED_PARALLEL
6082 && gimplify_omp_ctxp
->outer_context
== ctx
));
6085 if (ctx
->region_type
!= ORT_WORKSHARE
)
6087 else if (ctx
->outer_context
)
6088 return omp_is_private (ctx
->outer_context
, decl
);
6092 /* Return true if DECL is private within a parallel region
6093 that binds to the current construct's context or in parallel
6094 region's REDUCTION clause. */
6097 omp_check_private (struct gimplify_omp_ctx
*ctx
, tree decl
)
6103 ctx
= ctx
->outer_context
;
6105 return !(is_global_var (decl
)
6106 /* References might be private, but might be shared too. */
6107 || lang_hooks
.decls
.omp_privatize_by_reference (decl
));
6109 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
6111 return (n
->value
& GOVD_SHARED
) == 0;
6113 while (ctx
->region_type
== ORT_WORKSHARE
);
6117 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
6118 and previous omp contexts. */
6121 gimplify_scan_omp_clauses (tree
*list_p
, gimple_seq
*pre_p
,
6122 enum omp_region_type region_type
)
6124 struct gimplify_omp_ctx
*ctx
, *outer_ctx
;
6125 struct gimplify_ctx gctx
;
6128 ctx
= new_omp_context (region_type
);
6129 outer_ctx
= ctx
->outer_context
;
6131 while ((c
= *list_p
) != NULL
)
6133 bool remove
= false;
6134 bool notice_outer
= true;
6135 const char *check_non_private
= NULL
;
6139 switch (OMP_CLAUSE_CODE (c
))
6141 case OMP_CLAUSE_PRIVATE
:
6142 flags
= GOVD_PRIVATE
| GOVD_EXPLICIT
;
6143 if (lang_hooks
.decls
.omp_private_outer_ref (OMP_CLAUSE_DECL (c
)))
6145 flags
|= GOVD_PRIVATE_OUTER_REF
;
6146 OMP_CLAUSE_PRIVATE_OUTER_REF (c
) = 1;
6149 notice_outer
= false;
6151 case OMP_CLAUSE_SHARED
:
6152 flags
= GOVD_SHARED
| GOVD_EXPLICIT
;
6154 case OMP_CLAUSE_FIRSTPRIVATE
:
6155 flags
= GOVD_FIRSTPRIVATE
| GOVD_EXPLICIT
;
6156 check_non_private
= "firstprivate";
6158 case OMP_CLAUSE_LASTPRIVATE
:
6159 flags
= GOVD_LASTPRIVATE
| GOVD_SEEN
| GOVD_EXPLICIT
;
6160 check_non_private
= "lastprivate";
6162 case OMP_CLAUSE_REDUCTION
:
6163 flags
= GOVD_REDUCTION
| GOVD_SEEN
| GOVD_EXPLICIT
;
6164 check_non_private
= "reduction";
6168 decl
= OMP_CLAUSE_DECL (c
);
6169 if (error_operand_p (decl
))
6174 omp_add_variable (ctx
, decl
, flags
);
6175 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
6176 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
))
6178 omp_add_variable (ctx
, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
),
6179 GOVD_LOCAL
| GOVD_SEEN
);
6180 gimplify_omp_ctxp
= ctx
;
6181 push_gimplify_context (&gctx
);
6183 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c
) = NULL
;
6184 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c
) = NULL
;
6186 gimplify_and_add (OMP_CLAUSE_REDUCTION_INIT (c
),
6187 &OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c
));
6188 pop_gimplify_context
6189 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c
)));
6190 push_gimplify_context (&gctx
);
6191 gimplify_and_add (OMP_CLAUSE_REDUCTION_MERGE (c
),
6192 &OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c
));
6193 pop_gimplify_context
6194 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c
)));
6195 OMP_CLAUSE_REDUCTION_INIT (c
) = NULL_TREE
;
6196 OMP_CLAUSE_REDUCTION_MERGE (c
) = NULL_TREE
;
6198 gimplify_omp_ctxp
= outer_ctx
;
6200 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
6201 && OMP_CLAUSE_LASTPRIVATE_STMT (c
))
6203 gimplify_omp_ctxp
= ctx
;
6204 push_gimplify_context (&gctx
);
6205 if (TREE_CODE (OMP_CLAUSE_LASTPRIVATE_STMT (c
)) != BIND_EXPR
)
6207 tree bind
= build3 (BIND_EXPR
, void_type_node
, NULL
,
6209 TREE_SIDE_EFFECTS (bind
) = 1;
6210 BIND_EXPR_BODY (bind
) = OMP_CLAUSE_LASTPRIVATE_STMT (c
);
6211 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = bind
;
6213 gimplify_and_add (OMP_CLAUSE_LASTPRIVATE_STMT (c
),
6214 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
));
6215 pop_gimplify_context
6216 (gimple_seq_first_stmt (OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
)));
6217 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = NULL_TREE
;
6219 gimplify_omp_ctxp
= outer_ctx
;
6225 case OMP_CLAUSE_COPYIN
:
6226 case OMP_CLAUSE_COPYPRIVATE
:
6227 decl
= OMP_CLAUSE_DECL (c
);
6228 if (error_operand_p (decl
))
6235 omp_notice_variable (outer_ctx
, decl
, true);
6236 if (check_non_private
6237 && region_type
== ORT_WORKSHARE
6238 && omp_check_private (ctx
, decl
))
6240 error ("%s variable %qE is private in outer context",
6241 check_non_private
, DECL_NAME (decl
));
6246 case OMP_CLAUSE_FINAL
:
6248 OMP_CLAUSE_OPERAND (c
, 0)
6249 = gimple_boolify (OMP_CLAUSE_OPERAND (c
, 0));
6252 case OMP_CLAUSE_SCHEDULE
:
6253 case OMP_CLAUSE_NUM_THREADS
:
6254 if (gimplify_expr (&OMP_CLAUSE_OPERAND (c
, 0), pre_p
, NULL
,
6255 is_gimple_val
, fb_rvalue
) == GS_ERROR
)
6259 case OMP_CLAUSE_NOWAIT
:
6260 case OMP_CLAUSE_ORDERED
:
6261 case OMP_CLAUSE_UNTIED
:
6262 case OMP_CLAUSE_COLLAPSE
:
6263 case OMP_CLAUSE_MERGEABLE
:
6266 case OMP_CLAUSE_DEFAULT
:
6267 ctx
->default_kind
= OMP_CLAUSE_DEFAULT_KIND (c
);
6275 *list_p
= OMP_CLAUSE_CHAIN (c
);
6277 list_p
= &OMP_CLAUSE_CHAIN (c
);
6280 gimplify_omp_ctxp
= ctx
;
6283 /* For all variables that were not actually used within the context,
6284 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
6287 gimplify_adjust_omp_clauses_1 (splay_tree_node n
, void *data
)
6289 tree
*list_p
= (tree
*) data
;
6290 tree decl
= (tree
) n
->key
;
6291 unsigned flags
= n
->value
;
6292 enum omp_clause_code code
;
6296 if (flags
& (GOVD_EXPLICIT
| GOVD_LOCAL
))
6298 if ((flags
& GOVD_SEEN
) == 0)
6300 if (flags
& GOVD_DEBUG_PRIVATE
)
6302 gcc_assert ((flags
& GOVD_DATA_SHARE_CLASS
) == GOVD_PRIVATE
);
6303 private_debug
= true;
6307 = lang_hooks
.decls
.omp_private_debug_clause (decl
,
6308 !!(flags
& GOVD_SHARED
));
6310 code
= OMP_CLAUSE_PRIVATE
;
6311 else if (flags
& GOVD_SHARED
)
6313 if (is_global_var (decl
))
6315 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
->outer_context
;
6319 = splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
6320 if (on
&& (on
->value
& (GOVD_FIRSTPRIVATE
| GOVD_LASTPRIVATE
6321 | GOVD_PRIVATE
| GOVD_REDUCTION
)) != 0)
6323 ctx
= ctx
->outer_context
;
6328 code
= OMP_CLAUSE_SHARED
;
6330 else if (flags
& GOVD_PRIVATE
)
6331 code
= OMP_CLAUSE_PRIVATE
;
6332 else if (flags
& GOVD_FIRSTPRIVATE
)
6333 code
= OMP_CLAUSE_FIRSTPRIVATE
;
6337 clause
= build_omp_clause (input_location
, code
);
6338 OMP_CLAUSE_DECL (clause
) = decl
;
6339 OMP_CLAUSE_CHAIN (clause
) = *list_p
;
6341 OMP_CLAUSE_PRIVATE_DEBUG (clause
) = 1;
6342 else if (code
== OMP_CLAUSE_PRIVATE
&& (flags
& GOVD_PRIVATE_OUTER_REF
))
6343 OMP_CLAUSE_PRIVATE_OUTER_REF (clause
) = 1;
6345 lang_hooks
.decls
.omp_finish_clause (clause
);
6351 gimplify_adjust_omp_clauses (tree
*list_p
)
6353 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
6356 while ((c
= *list_p
) != NULL
)
6359 bool remove
= false;
6361 switch (OMP_CLAUSE_CODE (c
))
6363 case OMP_CLAUSE_PRIVATE
:
6364 case OMP_CLAUSE_SHARED
:
6365 case OMP_CLAUSE_FIRSTPRIVATE
:
6366 decl
= OMP_CLAUSE_DECL (c
);
6367 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
6368 remove
= !(n
->value
& GOVD_SEEN
);
6371 bool shared
= OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_SHARED
;
6372 if ((n
->value
& GOVD_DEBUG_PRIVATE
)
6373 || lang_hooks
.decls
.omp_private_debug_clause (decl
, shared
))
6375 gcc_assert ((n
->value
& GOVD_DEBUG_PRIVATE
) == 0
6376 || ((n
->value
& GOVD_DATA_SHARE_CLASS
)
6378 OMP_CLAUSE_SET_CODE (c
, OMP_CLAUSE_PRIVATE
);
6379 OMP_CLAUSE_PRIVATE_DEBUG (c
) = 1;
6384 case OMP_CLAUSE_LASTPRIVATE
:
6385 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
6386 accurately reflect the presence of a FIRSTPRIVATE clause. */
6387 decl
= OMP_CLAUSE_DECL (c
);
6388 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
6389 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c
)
6390 = (n
->value
& GOVD_FIRSTPRIVATE
) != 0;
6393 case OMP_CLAUSE_REDUCTION
:
6394 case OMP_CLAUSE_COPYIN
:
6395 case OMP_CLAUSE_COPYPRIVATE
:
6397 case OMP_CLAUSE_NUM_THREADS
:
6398 case OMP_CLAUSE_SCHEDULE
:
6399 case OMP_CLAUSE_NOWAIT
:
6400 case OMP_CLAUSE_ORDERED
:
6401 case OMP_CLAUSE_DEFAULT
:
6402 case OMP_CLAUSE_UNTIED
:
6403 case OMP_CLAUSE_COLLAPSE
:
6404 case OMP_CLAUSE_FINAL
:
6405 case OMP_CLAUSE_MERGEABLE
:
6413 *list_p
= OMP_CLAUSE_CHAIN (c
);
6415 list_p
= &OMP_CLAUSE_CHAIN (c
);
6418 /* Add in any implicit data sharing. */
6419 splay_tree_foreach (ctx
->variables
, gimplify_adjust_omp_clauses_1
, list_p
);
6421 gimplify_omp_ctxp
= ctx
->outer_context
;
6422 delete_omp_context (ctx
);
6425 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
6426 gimplification of the body, as well as scanning the body for used
6427 variables. We need to do this scan now, because variable-sized
6428 decls will be decomposed during gimplification. */
6431 gimplify_omp_parallel (tree
*expr_p
, gimple_seq
*pre_p
)
6433 tree expr
= *expr_p
;
6435 gimple_seq body
= NULL
;
6436 struct gimplify_ctx gctx
;
6438 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
), pre_p
,
6439 OMP_PARALLEL_COMBINED (expr
)
6440 ? ORT_COMBINED_PARALLEL
6443 push_gimplify_context (&gctx
);
6445 g
= gimplify_and_return_first (OMP_PARALLEL_BODY (expr
), &body
);
6446 if (gimple_code (g
) == GIMPLE_BIND
)
6447 pop_gimplify_context (g
);
6449 pop_gimplify_context (NULL
);
6451 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
));
6453 g
= gimple_build_omp_parallel (body
,
6454 OMP_PARALLEL_CLAUSES (expr
),
6455 NULL_TREE
, NULL_TREE
);
6456 if (OMP_PARALLEL_COMBINED (expr
))
6457 gimple_omp_set_subcode (g
, GF_OMP_PARALLEL_COMBINED
);
6458 gimplify_seq_add_stmt (pre_p
, g
);
6459 *expr_p
= NULL_TREE
;
6462 /* Gimplify the contents of an OMP_TASK statement. This involves
6463 gimplification of the body, as well as scanning the body for used
6464 variables. We need to do this scan now, because variable-sized
6465 decls will be decomposed during gimplification. */
6468 gimplify_omp_task (tree
*expr_p
, gimple_seq
*pre_p
)
6470 tree expr
= *expr_p
;
6472 gimple_seq body
= NULL
;
6473 struct gimplify_ctx gctx
;
6475 gimplify_scan_omp_clauses (&OMP_TASK_CLAUSES (expr
), pre_p
,
6476 find_omp_clause (OMP_TASK_CLAUSES (expr
),
6478 ? ORT_UNTIED_TASK
: ORT_TASK
);
6480 push_gimplify_context (&gctx
);
6482 g
= gimplify_and_return_first (OMP_TASK_BODY (expr
), &body
);
6483 if (gimple_code (g
) == GIMPLE_BIND
)
6484 pop_gimplify_context (g
);
6486 pop_gimplify_context (NULL
);
6488 gimplify_adjust_omp_clauses (&OMP_TASK_CLAUSES (expr
));
6490 g
= gimple_build_omp_task (body
,
6491 OMP_TASK_CLAUSES (expr
),
6492 NULL_TREE
, NULL_TREE
,
6493 NULL_TREE
, NULL_TREE
, NULL_TREE
);
6494 gimplify_seq_add_stmt (pre_p
, g
);
6495 *expr_p
= NULL_TREE
;
6498 /* Gimplify the gross structure of an OMP_FOR statement. */
6500 static enum gimplify_status
6501 gimplify_omp_for (tree
*expr_p
, gimple_seq
*pre_p
)
6503 tree for_stmt
, decl
, var
, t
;
6504 enum gimplify_status ret
= GS_ALL_DONE
;
6505 enum gimplify_status tret
;
6507 gimple_seq for_body
, for_pre_body
;
6512 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
), pre_p
,
6515 /* Handle OMP_FOR_INIT. */
6516 for_pre_body
= NULL
;
6517 gimplify_and_add (OMP_FOR_PRE_BODY (for_stmt
), &for_pre_body
);
6518 OMP_FOR_PRE_BODY (for_stmt
) = NULL_TREE
;
6521 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
))
6522 == TREE_VEC_LENGTH (OMP_FOR_COND (for_stmt
)));
6523 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
))
6524 == TREE_VEC_LENGTH (OMP_FOR_INCR (for_stmt
)));
6525 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)); i
++)
6527 t
= TREE_VEC_ELT (OMP_FOR_INIT (for_stmt
), i
);
6528 gcc_assert (TREE_CODE (t
) == MODIFY_EXPR
);
6529 decl
= TREE_OPERAND (t
, 0);
6530 gcc_assert (DECL_P (decl
));
6531 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl
))
6532 || POINTER_TYPE_P (TREE_TYPE (decl
)));
6534 /* Make sure the iteration variable is private. */
6535 if (omp_is_private (gimplify_omp_ctxp
, decl
))
6536 omp_notice_variable (gimplify_omp_ctxp
, decl
, true);
6538 omp_add_variable (gimplify_omp_ctxp
, decl
, GOVD_PRIVATE
| GOVD_SEEN
);
6540 /* If DECL is not a gimple register, create a temporary variable to act
6541 as an iteration counter. This is valid, since DECL cannot be
6542 modified in the body of the loop. */
6543 if (!is_gimple_reg (decl
))
6545 var
= create_tmp_var (TREE_TYPE (decl
), get_name (decl
));
6546 TREE_OPERAND (t
, 0) = var
;
6548 gimplify_seq_add_stmt (&for_body
, gimple_build_assign (decl
, var
));
6550 omp_add_variable (gimplify_omp_ctxp
, var
, GOVD_PRIVATE
| GOVD_SEEN
);
6555 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), &for_pre_body
, NULL
,
6556 is_gimple_val
, fb_rvalue
);
6557 ret
= MIN (ret
, tret
);
6558 if (ret
== GS_ERROR
)
6561 /* Handle OMP_FOR_COND. */
6562 t
= TREE_VEC_ELT (OMP_FOR_COND (for_stmt
), i
);
6563 gcc_assert (COMPARISON_CLASS_P (t
));
6564 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
6566 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), &for_pre_body
, NULL
,
6567 is_gimple_val
, fb_rvalue
);
6568 ret
= MIN (ret
, tret
);
6570 /* Handle OMP_FOR_INCR. */
6571 t
= TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
);
6572 switch (TREE_CODE (t
))
6574 case PREINCREMENT_EXPR
:
6575 case POSTINCREMENT_EXPR
:
6576 t
= build_int_cst (TREE_TYPE (decl
), 1);
6577 t
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), var
, t
);
6578 t
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, t
);
6579 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
) = t
;
6582 case PREDECREMENT_EXPR
:
6583 case POSTDECREMENT_EXPR
:
6584 t
= build_int_cst (TREE_TYPE (decl
), -1);
6585 t
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), var
, t
);
6586 t
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, t
);
6587 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
) = t
;
6591 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
6592 TREE_OPERAND (t
, 0) = var
;
6594 t
= TREE_OPERAND (t
, 1);
6595 switch (TREE_CODE (t
))
6598 if (TREE_OPERAND (t
, 1) == decl
)
6600 TREE_OPERAND (t
, 1) = TREE_OPERAND (t
, 0);
6601 TREE_OPERAND (t
, 0) = var
;
6607 case POINTER_PLUS_EXPR
:
6608 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
6609 TREE_OPERAND (t
, 0) = var
;
6615 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), &for_pre_body
, NULL
,
6616 is_gimple_val
, fb_rvalue
);
6617 ret
= MIN (ret
, tret
);
6624 if (var
!= decl
|| TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)) > 1)
6627 for (c
= OMP_FOR_CLAUSES (for_stmt
); c
; c
= OMP_CLAUSE_CHAIN (c
))
6628 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
6629 && OMP_CLAUSE_DECL (c
) == decl
6630 && OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
) == NULL
)
6632 t
= TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
);
6633 gcc_assert (TREE_CODE (t
) == MODIFY_EXPR
);
6634 gcc_assert (TREE_OPERAND (t
, 0) == var
);
6635 t
= TREE_OPERAND (t
, 1);
6636 gcc_assert (TREE_CODE (t
) == PLUS_EXPR
6637 || TREE_CODE (t
) == MINUS_EXPR
6638 || TREE_CODE (t
) == POINTER_PLUS_EXPR
);
6639 gcc_assert (TREE_OPERAND (t
, 0) == var
);
6640 t
= build2 (TREE_CODE (t
), TREE_TYPE (decl
), decl
,
6641 TREE_OPERAND (t
, 1));
6642 gimplify_assign (decl
, t
,
6643 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
));
6648 gimplify_and_add (OMP_FOR_BODY (for_stmt
), &for_body
);
6650 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
));
6652 gfor
= gimple_build_omp_for (for_body
, OMP_FOR_CLAUSES (for_stmt
),
6653 TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)),
6656 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)); i
++)
6658 t
= TREE_VEC_ELT (OMP_FOR_INIT (for_stmt
), i
);
6659 gimple_omp_for_set_index (gfor
, i
, TREE_OPERAND (t
, 0));
6660 gimple_omp_for_set_initial (gfor
, i
, TREE_OPERAND (t
, 1));
6661 t
= TREE_VEC_ELT (OMP_FOR_COND (for_stmt
), i
);
6662 gimple_omp_for_set_cond (gfor
, i
, TREE_CODE (t
));
6663 gimple_omp_for_set_final (gfor
, i
, TREE_OPERAND (t
, 1));
6664 t
= TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
);
6665 gimple_omp_for_set_incr (gfor
, i
, TREE_OPERAND (t
, 1));
6668 gimplify_seq_add_stmt (pre_p
, gfor
);
6669 return ret
== GS_ALL_DONE
? GS_ALL_DONE
: GS_ERROR
;
6672 /* Gimplify the gross structure of other OpenMP worksharing constructs.
6673 In particular, OMP_SECTIONS and OMP_SINGLE. */
6676 gimplify_omp_workshare (tree
*expr_p
, gimple_seq
*pre_p
)
6678 tree expr
= *expr_p
;
6680 gimple_seq body
= NULL
;
6682 gimplify_scan_omp_clauses (&OMP_CLAUSES (expr
), pre_p
, ORT_WORKSHARE
);
6683 gimplify_and_add (OMP_BODY (expr
), &body
);
6684 gimplify_adjust_omp_clauses (&OMP_CLAUSES (expr
));
6686 if (TREE_CODE (expr
) == OMP_SECTIONS
)
6687 stmt
= gimple_build_omp_sections (body
, OMP_CLAUSES (expr
));
6688 else if (TREE_CODE (expr
) == OMP_SINGLE
)
6689 stmt
= gimple_build_omp_single (body
, OMP_CLAUSES (expr
));
6693 gimplify_seq_add_stmt (pre_p
, stmt
);
6696 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
6697 stabilized the lhs of the atomic operation as *ADDR. Return true if
6698 EXPR is this stabilized form. */
6701 goa_lhs_expr_p (tree expr
, tree addr
)
6703 /* Also include casts to other type variants. The C front end is fond
6704 of adding these for e.g. volatile variables. This is like
6705 STRIP_TYPE_NOPS but includes the main variant lookup. */
6706 STRIP_USELESS_TYPE_CONVERSION (expr
);
6708 if (TREE_CODE (expr
) == INDIRECT_REF
)
6710 expr
= TREE_OPERAND (expr
, 0);
6712 && (CONVERT_EXPR_P (expr
)
6713 || TREE_CODE (expr
) == NON_LVALUE_EXPR
)
6714 && TREE_CODE (expr
) == TREE_CODE (addr
)
6715 && types_compatible_p (TREE_TYPE (expr
), TREE_TYPE (addr
)))
6717 expr
= TREE_OPERAND (expr
, 0);
6718 addr
= TREE_OPERAND (addr
, 0);
6722 return (TREE_CODE (addr
) == ADDR_EXPR
6723 && TREE_CODE (expr
) == ADDR_EXPR
6724 && TREE_OPERAND (addr
, 0) == TREE_OPERAND (expr
, 0));
6726 if (TREE_CODE (addr
) == ADDR_EXPR
&& expr
== TREE_OPERAND (addr
, 0))
6731 /* Walk *EXPR_P and replace appearances of *LHS_ADDR with LHS_VAR. If an
6732 expression does not involve the lhs, evaluate it into a temporary.
6733 Return 1 if the lhs appeared as a subexpression, 0 if it did not,
6734 or -1 if an error was encountered. */
6737 goa_stabilize_expr (tree
*expr_p
, gimple_seq
*pre_p
, tree lhs_addr
,
6740 tree expr
= *expr_p
;
6743 if (goa_lhs_expr_p (expr
, lhs_addr
))
6748 if (is_gimple_val (expr
))
6752 switch (TREE_CODE_CLASS (TREE_CODE (expr
)))
6755 case tcc_comparison
:
6756 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 1), pre_p
, lhs_addr
,
6759 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 0), pre_p
, lhs_addr
,
6762 case tcc_expression
:
6763 switch (TREE_CODE (expr
))
6765 case TRUTH_ANDIF_EXPR
:
6766 case TRUTH_ORIF_EXPR
:
6767 case TRUTH_AND_EXPR
:
6769 case TRUTH_XOR_EXPR
:
6770 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 1), pre_p
,
6772 case TRUTH_NOT_EXPR
:
6773 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 0), pre_p
,
6777 /* Break out any preevaluations from cp_build_modify_expr. */
6778 for (; TREE_CODE (expr
) == COMPOUND_EXPR
;
6779 expr
= TREE_OPERAND (expr
, 1))
6780 gimplify_stmt (&TREE_OPERAND (expr
, 0), pre_p
);
6782 return goa_stabilize_expr (expr_p
, pre_p
, lhs_addr
, lhs_var
);
6793 enum gimplify_status gs
;
6794 gs
= gimplify_expr (expr_p
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
);
6795 if (gs
!= GS_ALL_DONE
)
6802 /* Gimplify an OMP_ATOMIC statement. */
6804 static enum gimplify_status
6805 gimplify_omp_atomic (tree
*expr_p
, gimple_seq
*pre_p
)
6807 tree addr
= TREE_OPERAND (*expr_p
, 0);
6808 tree rhs
= TREE_CODE (*expr_p
) == OMP_ATOMIC_READ
6809 ? NULL
: TREE_OPERAND (*expr_p
, 1);
6810 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr
)));
6812 gimple loadstmt
, storestmt
;
6814 tmp_load
= create_tmp_reg (type
, NULL
);
6815 if (rhs
&& goa_stabilize_expr (&rhs
, pre_p
, addr
, tmp_load
) < 0)
6818 if (gimplify_expr (&addr
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
)
6822 loadstmt
= gimple_build_omp_atomic_load (tmp_load
, addr
);
6823 gimplify_seq_add_stmt (pre_p
, loadstmt
);
6824 if (rhs
&& gimplify_expr (&rhs
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
)
6828 if (TREE_CODE (*expr_p
) == OMP_ATOMIC_READ
)
6830 storestmt
= gimple_build_omp_atomic_store (rhs
);
6831 gimplify_seq_add_stmt (pre_p
, storestmt
);
6832 switch (TREE_CODE (*expr_p
))
6834 case OMP_ATOMIC_READ
:
6835 case OMP_ATOMIC_CAPTURE_OLD
:
6837 gimple_omp_atomic_set_need_value (loadstmt
);
6839 case OMP_ATOMIC_CAPTURE_NEW
:
6841 gimple_omp_atomic_set_need_value (storestmt
);
6851 /* Gimplify a TRANSACTION_EXPR. This involves gimplification of the
6852 body, and adding some EH bits. */
6854 static enum gimplify_status
6855 gimplify_transaction (tree
*expr_p
, gimple_seq
*pre_p
)
6857 tree expr
= *expr_p
, temp
, tbody
= TRANSACTION_EXPR_BODY (expr
);
6859 gimple_seq body
= NULL
;
6860 struct gimplify_ctx gctx
;
6863 /* Wrap the transaction body in a BIND_EXPR so we have a context
6864 where to put decls for OpenMP. */
6865 if (TREE_CODE (tbody
) != BIND_EXPR
)
6867 tree bind
= build3 (BIND_EXPR
, void_type_node
, NULL
, tbody
, NULL
);
6868 TREE_SIDE_EFFECTS (bind
) = 1;
6869 SET_EXPR_LOCATION (bind
, EXPR_LOCATION (tbody
));
6870 TRANSACTION_EXPR_BODY (expr
) = bind
;
6873 push_gimplify_context (&gctx
);
6874 temp
= voidify_wrapper_expr (*expr_p
, NULL
);
6876 g
= gimplify_and_return_first (TRANSACTION_EXPR_BODY (expr
), &body
);
6877 pop_gimplify_context (g
);
6879 g
= gimple_build_transaction (body
, NULL
);
6880 if (TRANSACTION_EXPR_OUTER (expr
))
6881 subcode
= GTMA_IS_OUTER
;
6882 else if (TRANSACTION_EXPR_RELAXED (expr
))
6883 subcode
= GTMA_IS_RELAXED
;
6884 gimple_transaction_set_subcode (g
, subcode
);
6886 gimplify_seq_add_stmt (pre_p
, g
);
6894 *expr_p
= NULL_TREE
;
6898 /* Convert the GENERIC expression tree *EXPR_P to GIMPLE. If the
6899 expression produces a value to be used as an operand inside a GIMPLE
6900 statement, the value will be stored back in *EXPR_P. This value will
6901 be a tree of class tcc_declaration, tcc_constant, tcc_reference or
6902 an SSA_NAME. The corresponding sequence of GIMPLE statements is
6903 emitted in PRE_P and POST_P.
6905 Additionally, this process may overwrite parts of the input
6906 expression during gimplification. Ideally, it should be
6907 possible to do non-destructive gimplification.
6909 EXPR_P points to the GENERIC expression to convert to GIMPLE. If
6910 the expression needs to evaluate to a value to be used as
6911 an operand in a GIMPLE statement, this value will be stored in
6912 *EXPR_P on exit. This happens when the caller specifies one
6913 of fb_lvalue or fb_rvalue fallback flags.
6915 PRE_P will contain the sequence of GIMPLE statements corresponding
6916 to the evaluation of EXPR and all the side-effects that must
6917 be executed before the main expression. On exit, the last
6918 statement of PRE_P is the core statement being gimplified. For
6919 instance, when gimplifying 'if (++a)' the last statement in
6920 PRE_P will be 'if (t.1)' where t.1 is the result of
6921 pre-incrementing 'a'.
6923 POST_P will contain the sequence of GIMPLE statements corresponding
6924 to the evaluation of all the side-effects that must be executed
6925 after the main expression. If this is NULL, the post
6926 side-effects are stored at the end of PRE_P.
6928 The reason why the output is split in two is to handle post
6929 side-effects explicitly. In some cases, an expression may have
6930 inner and outer post side-effects which need to be emitted in
6931 an order different from the one given by the recursive
6932 traversal. For instance, for the expression (*p--)++ the post
6933 side-effects of '--' must actually occur *after* the post
6934 side-effects of '++'. However, gimplification will first visit
6935 the inner expression, so if a separate POST sequence was not
6936 used, the resulting sequence would be:
6943 However, the post-decrement operation in line #2 must not be
6944 evaluated until after the store to *p at line #4, so the
6945 correct sequence should be:
6952 So, by specifying a separate post queue, it is possible
6953 to emit the post side-effects in the correct order.
6954 If POST_P is NULL, an internal queue will be used. Before
6955 returning to the caller, the sequence POST_P is appended to
6956 the main output sequence PRE_P.
6958 GIMPLE_TEST_F points to a function that takes a tree T and
6959 returns nonzero if T is in the GIMPLE form requested by the
6960 caller. The GIMPLE predicates are in gimple.c.
6962 FALLBACK tells the function what sort of a temporary we want if
6963 gimplification cannot produce an expression that complies with
6966 fb_none means that no temporary should be generated
6967 fb_rvalue means that an rvalue is OK to generate
6968 fb_lvalue means that an lvalue is OK to generate
6969 fb_either means that either is OK, but an lvalue is preferable.
6970 fb_mayfail means that gimplification may fail (in which case
6971 GS_ERROR will be returned)
6973 The return value is either GS_ERROR or GS_ALL_DONE, since this
6974 function iterates until EXPR is completely gimplified or an error
6977 enum gimplify_status
6978 gimplify_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
6979 bool (*gimple_test_f
) (tree
), fallback_t fallback
)
6982 gimple_seq internal_pre
= NULL
;
6983 gimple_seq internal_post
= NULL
;
6986 location_t saved_location
;
6987 enum gimplify_status ret
;
6988 gimple_stmt_iterator pre_last_gsi
, post_last_gsi
;
6990 save_expr
= *expr_p
;
6991 if (save_expr
== NULL_TREE
)
6994 /* If we are gimplifying a top-level statement, PRE_P must be valid. */
6995 is_statement
= gimple_test_f
== is_gimple_stmt
;
6999 /* Consistency checks. */
7000 if (gimple_test_f
== is_gimple_reg
)
7001 gcc_assert (fallback
& (fb_rvalue
| fb_lvalue
));
7002 else if (gimple_test_f
== is_gimple_val
7003 || gimple_test_f
== is_gimple_call_addr
7004 || gimple_test_f
== is_gimple_condexpr
7005 || gimple_test_f
== is_gimple_mem_rhs
7006 || gimple_test_f
== is_gimple_mem_rhs_or_call
7007 || gimple_test_f
== is_gimple_reg_rhs
7008 || gimple_test_f
== is_gimple_reg_rhs_or_call
7009 || gimple_test_f
== is_gimple_asm_val
7010 || gimple_test_f
== is_gimple_mem_ref_addr
)
7011 gcc_assert (fallback
& fb_rvalue
);
7012 else if (gimple_test_f
== is_gimple_min_lval
7013 || gimple_test_f
== is_gimple_lvalue
)
7014 gcc_assert (fallback
& fb_lvalue
);
7015 else if (gimple_test_f
== is_gimple_addressable
)
7016 gcc_assert (fallback
& fb_either
);
7017 else if (gimple_test_f
== is_gimple_stmt
)
7018 gcc_assert (fallback
== fb_none
);
7021 /* We should have recognized the GIMPLE_TEST_F predicate to
7022 know what kind of fallback to use in case a temporary is
7023 needed to hold the value or address of *EXPR_P. */
7027 /* We used to check the predicate here and return immediately if it
7028 succeeds. This is wrong; the design is for gimplification to be
7029 idempotent, and for the predicates to only test for valid forms, not
7030 whether they are fully simplified. */
7032 pre_p
= &internal_pre
;
7035 post_p
= &internal_post
;
7037 /* Remember the last statements added to PRE_P and POST_P. Every
7038 new statement added by the gimplification helpers needs to be
7039 annotated with location information. To centralize the
7040 responsibility, we remember the last statement that had been
7041 added to both queues before gimplifying *EXPR_P. If
7042 gimplification produces new statements in PRE_P and POST_P, those
7043 statements will be annotated with the same location information
7045 pre_last_gsi
= gsi_last (*pre_p
);
7046 post_last_gsi
= gsi_last (*post_p
);
7048 saved_location
= input_location
;
7049 if (save_expr
!= error_mark_node
7050 && EXPR_HAS_LOCATION (*expr_p
))
7051 input_location
= EXPR_LOCATION (*expr_p
);
7053 /* Loop over the specific gimplifiers until the toplevel node
7054 remains the same. */
7057 /* Strip away as many useless type conversions as possible
7059 STRIP_USELESS_TYPE_CONVERSION (*expr_p
);
7061 /* Remember the expr. */
7062 save_expr
= *expr_p
;
7064 /* Die, die, die, my darling. */
7065 if (save_expr
== error_mark_node
7066 || (TREE_TYPE (save_expr
)
7067 && TREE_TYPE (save_expr
) == error_mark_node
))
7073 /* Do any language-specific gimplification. */
7074 ret
= ((enum gimplify_status
)
7075 lang_hooks
.gimplify_expr (expr_p
, pre_p
, post_p
));
7078 if (*expr_p
== NULL_TREE
)
7080 if (*expr_p
!= save_expr
)
7083 else if (ret
!= GS_UNHANDLED
)
7086 /* Make sure that all the cases set 'ret' appropriately. */
7088 switch (TREE_CODE (*expr_p
))
7090 /* First deal with the special cases. */
7092 case POSTINCREMENT_EXPR
:
7093 case POSTDECREMENT_EXPR
:
7094 case PREINCREMENT_EXPR
:
7095 case PREDECREMENT_EXPR
:
7096 ret
= gimplify_self_mod_expr (expr_p
, pre_p
, post_p
,
7097 fallback
!= fb_none
);
7101 case ARRAY_RANGE_REF
:
7105 case VIEW_CONVERT_EXPR
:
7106 ret
= gimplify_compound_lval (expr_p
, pre_p
, post_p
,
7107 fallback
? fallback
: fb_rvalue
);
7111 ret
= gimplify_cond_expr (expr_p
, pre_p
, fallback
);
7113 /* C99 code may assign to an array in a structure value of a
7114 conditional expression, and this has undefined behavior
7115 only on execution, so create a temporary if an lvalue is
7117 if (fallback
== fb_lvalue
)
7119 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
7120 mark_addressable (*expr_p
);
7126 ret
= gimplify_call_expr (expr_p
, pre_p
, fallback
!= fb_none
);
7128 /* C99 code may assign to an array in a structure returned
7129 from a function, and this has undefined behavior only on
7130 execution, so create a temporary if an lvalue is
7132 if (fallback
== fb_lvalue
)
7134 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
7135 mark_addressable (*expr_p
);
7144 ret
= gimplify_compound_expr (expr_p
, pre_p
, fallback
!= fb_none
);
7147 case COMPOUND_LITERAL_EXPR
:
7148 ret
= gimplify_compound_literal_expr (expr_p
, pre_p
,
7149 gimple_test_f
, fallback
);
7154 ret
= gimplify_modify_expr (expr_p
, pre_p
, post_p
,
7155 fallback
!= fb_none
);
7158 case TRUTH_ANDIF_EXPR
:
7159 case TRUTH_ORIF_EXPR
:
7161 /* Preserve the original type of the expression and the
7162 source location of the outer expression. */
7163 tree org_type
= TREE_TYPE (*expr_p
);
7164 *expr_p
= gimple_boolify (*expr_p
);
7165 *expr_p
= build3_loc (input_location
, COND_EXPR
,
7169 org_type
, boolean_true_node
),
7172 org_type
, boolean_false_node
));
7177 case TRUTH_NOT_EXPR
:
7179 tree type
= TREE_TYPE (*expr_p
);
7180 /* The parsers are careful to generate TRUTH_NOT_EXPR
7181 only with operands that are always zero or one.
7182 We do not fold here but handle the only interesting case
7183 manually, as fold may re-introduce the TRUTH_NOT_EXPR. */
7184 *expr_p
= gimple_boolify (*expr_p
);
7185 if (TYPE_PRECISION (TREE_TYPE (*expr_p
)) == 1)
7186 *expr_p
= build1_loc (input_location
, BIT_NOT_EXPR
,
7187 TREE_TYPE (*expr_p
),
7188 TREE_OPERAND (*expr_p
, 0));
7190 *expr_p
= build2_loc (input_location
, BIT_XOR_EXPR
,
7191 TREE_TYPE (*expr_p
),
7192 TREE_OPERAND (*expr_p
, 0),
7193 build_int_cst (TREE_TYPE (*expr_p
), 1));
7194 if (!useless_type_conversion_p (type
, TREE_TYPE (*expr_p
)))
7195 *expr_p
= fold_convert_loc (input_location
, type
, *expr_p
);
7201 ret
= gimplify_addr_expr (expr_p
, pre_p
, post_p
);
7205 ret
= gimplify_va_arg_expr (expr_p
, pre_p
, post_p
);
7209 if (IS_EMPTY_STMT (*expr_p
))
7215 if (VOID_TYPE_P (TREE_TYPE (*expr_p
))
7216 || fallback
== fb_none
)
7218 /* Just strip a conversion to void (or in void context) and
7220 *expr_p
= TREE_OPERAND (*expr_p
, 0);
7225 ret
= gimplify_conversion (expr_p
);
7226 if (ret
== GS_ERROR
)
7228 if (*expr_p
!= save_expr
)
7232 case FIX_TRUNC_EXPR
:
7233 /* unary_expr: ... | '(' cast ')' val | ... */
7234 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
7235 is_gimple_val
, fb_rvalue
);
7236 recalculate_side_effects (*expr_p
);
7241 bool volatilep
= TREE_THIS_VOLATILE (*expr_p
);
7242 bool notrap
= TREE_THIS_NOTRAP (*expr_p
);
7243 tree saved_ptr_type
= TREE_TYPE (TREE_OPERAND (*expr_p
, 0));
7245 *expr_p
= fold_indirect_ref_loc (input_location
, *expr_p
);
7246 if (*expr_p
!= save_expr
)
7252 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
7253 is_gimple_reg
, fb_rvalue
);
7254 if (ret
== GS_ERROR
)
7257 recalculate_side_effects (*expr_p
);
7258 *expr_p
= fold_build2_loc (input_location
, MEM_REF
,
7259 TREE_TYPE (*expr_p
),
7260 TREE_OPERAND (*expr_p
, 0),
7261 build_int_cst (saved_ptr_type
, 0));
7262 TREE_THIS_VOLATILE (*expr_p
) = volatilep
;
7263 TREE_THIS_NOTRAP (*expr_p
) = notrap
;
7268 /* We arrive here through the various re-gimplifcation paths. */
7270 /* First try re-folding the whole thing. */
7271 tmp
= fold_binary (MEM_REF
, TREE_TYPE (*expr_p
),
7272 TREE_OPERAND (*expr_p
, 0),
7273 TREE_OPERAND (*expr_p
, 1));
7277 recalculate_side_effects (*expr_p
);
7281 /* Avoid re-gimplifying the address operand if it is already
7282 in suitable form. Re-gimplifying would mark the address
7283 operand addressable. Always gimplify when not in SSA form
7284 as we still may have to gimplify decls with value-exprs. */
7285 if (!gimplify_ctxp
|| !gimplify_ctxp
->into_ssa
7286 || !is_gimple_mem_ref_addr (TREE_OPERAND (*expr_p
, 0)))
7288 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
7289 is_gimple_mem_ref_addr
, fb_rvalue
);
7290 if (ret
== GS_ERROR
)
7293 recalculate_side_effects (*expr_p
);
7297 /* Constants need not be gimplified. */
7308 /* If we require an lvalue, such as for ADDR_EXPR, retain the
7309 CONST_DECL node. Otherwise the decl is replaceable by its
7311 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
7312 if (fallback
& fb_lvalue
)
7316 *expr_p
= DECL_INITIAL (*expr_p
);
7322 ret
= gimplify_decl_expr (expr_p
, pre_p
);
7326 ret
= gimplify_bind_expr (expr_p
, pre_p
);
7330 ret
= gimplify_loop_expr (expr_p
, pre_p
);
7334 ret
= gimplify_switch_expr (expr_p
, pre_p
);
7338 ret
= gimplify_exit_expr (expr_p
);
7342 /* If the target is not LABEL, then it is a computed jump
7343 and the target needs to be gimplified. */
7344 if (TREE_CODE (GOTO_DESTINATION (*expr_p
)) != LABEL_DECL
)
7346 ret
= gimplify_expr (&GOTO_DESTINATION (*expr_p
), pre_p
,
7347 NULL
, is_gimple_val
, fb_rvalue
);
7348 if (ret
== GS_ERROR
)
7351 gimplify_seq_add_stmt (pre_p
,
7352 gimple_build_goto (GOTO_DESTINATION (*expr_p
)));
7357 gimplify_seq_add_stmt (pre_p
,
7358 gimple_build_predict (PREDICT_EXPR_PREDICTOR (*expr_p
),
7359 PREDICT_EXPR_OUTCOME (*expr_p
)));
7365 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p
))
7366 == current_function_decl
);
7367 gimplify_seq_add_stmt (pre_p
,
7368 gimple_build_label (LABEL_EXPR_LABEL (*expr_p
)));
7371 case CASE_LABEL_EXPR
:
7372 ret
= gimplify_case_label_expr (expr_p
, pre_p
);
7376 ret
= gimplify_return_expr (*expr_p
, pre_p
);
7380 /* Don't reduce this in place; let gimplify_init_constructor work its
7381 magic. Buf if we're just elaborating this for side effects, just
7382 gimplify any element that has side-effects. */
7383 if (fallback
== fb_none
)
7385 unsigned HOST_WIDE_INT ix
;
7387 tree temp
= NULL_TREE
;
7388 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (*expr_p
), ix
, val
)
7389 if (TREE_SIDE_EFFECTS (val
))
7390 append_to_statement_list (val
, &temp
);
7393 ret
= temp
? GS_OK
: GS_ALL_DONE
;
7395 /* C99 code may assign to an array in a constructed
7396 structure or union, and this has undefined behavior only
7397 on execution, so create a temporary if an lvalue is
7399 else if (fallback
== fb_lvalue
)
7401 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
7402 mark_addressable (*expr_p
);
7409 /* The following are special cases that are not handled by the
7410 original GIMPLE grammar. */
7412 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
7415 ret
= gimplify_save_expr (expr_p
, pre_p
, post_p
);
7419 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
7420 post_p
, is_gimple_lvalue
, fb_either
);
7421 recalculate_side_effects (*expr_p
);
7424 case TARGET_MEM_REF
:
7426 enum gimplify_status r0
= GS_ALL_DONE
, r1
= GS_ALL_DONE
;
7428 if (TMR_BASE (*expr_p
))
7429 r0
= gimplify_expr (&TMR_BASE (*expr_p
), pre_p
,
7430 post_p
, is_gimple_mem_ref_addr
, fb_either
);
7431 if (TMR_INDEX (*expr_p
))
7432 r1
= gimplify_expr (&TMR_INDEX (*expr_p
), pre_p
,
7433 post_p
, is_gimple_val
, fb_rvalue
);
7434 if (TMR_INDEX2 (*expr_p
))
7435 r1
= gimplify_expr (&TMR_INDEX2 (*expr_p
), pre_p
,
7436 post_p
, is_gimple_val
, fb_rvalue
);
7437 /* TMR_STEP and TMR_OFFSET are always integer constants. */
7442 case NON_LVALUE_EXPR
:
7443 /* This should have been stripped above. */
7447 ret
= gimplify_asm_expr (expr_p
, pre_p
, post_p
);
7450 case TRY_FINALLY_EXPR
:
7451 case TRY_CATCH_EXPR
:
7453 gimple_seq eval
, cleanup
;
7456 eval
= cleanup
= NULL
;
7457 gimplify_and_add (TREE_OPERAND (*expr_p
, 0), &eval
);
7458 gimplify_and_add (TREE_OPERAND (*expr_p
, 1), &cleanup
);
7459 /* Don't create bogus GIMPLE_TRY with empty cleanup. */
7460 if (gimple_seq_empty_p (cleanup
))
7462 gimple_seq_add_seq (pre_p
, eval
);
7466 try_
= gimple_build_try (eval
, cleanup
,
7467 TREE_CODE (*expr_p
) == TRY_FINALLY_EXPR
7468 ? GIMPLE_TRY_FINALLY
7469 : GIMPLE_TRY_CATCH
);
7470 if (TREE_CODE (*expr_p
) == TRY_CATCH_EXPR
)
7471 gimple_try_set_catch_is_cleanup (try_
,
7472 TRY_CATCH_IS_CLEANUP (*expr_p
));
7473 gimplify_seq_add_stmt (pre_p
, try_
);
7478 case CLEANUP_POINT_EXPR
:
7479 ret
= gimplify_cleanup_point_expr (expr_p
, pre_p
);
7483 ret
= gimplify_target_expr (expr_p
, pre_p
, post_p
);
7489 gimple_seq handler
= NULL
;
7490 gimplify_and_add (CATCH_BODY (*expr_p
), &handler
);
7491 c
= gimple_build_catch (CATCH_TYPES (*expr_p
), handler
);
7492 gimplify_seq_add_stmt (pre_p
, c
);
7497 case EH_FILTER_EXPR
:
7500 gimple_seq failure
= NULL
;
7502 gimplify_and_add (EH_FILTER_FAILURE (*expr_p
), &failure
);
7503 ehf
= gimple_build_eh_filter (EH_FILTER_TYPES (*expr_p
), failure
);
7504 gimple_set_no_warning (ehf
, TREE_NO_WARNING (*expr_p
));
7505 gimplify_seq_add_stmt (pre_p
, ehf
);
7512 enum gimplify_status r0
, r1
;
7513 r0
= gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p
), pre_p
,
7514 post_p
, is_gimple_val
, fb_rvalue
);
7515 r1
= gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p
), pre_p
,
7516 post_p
, is_gimple_val
, fb_rvalue
);
7517 TREE_SIDE_EFFECTS (*expr_p
) = 0;
7523 /* We get here when taking the address of a label. We mark
7524 the label as "forced"; meaning it can never be removed and
7525 it is a potential target for any computed goto. */
7526 FORCED_LABEL (*expr_p
) = 1;
7530 case STATEMENT_LIST
:
7531 ret
= gimplify_statement_list (expr_p
, pre_p
);
7534 case WITH_SIZE_EXPR
:
7536 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
7537 post_p
== &internal_post
? NULL
: post_p
,
7538 gimple_test_f
, fallback
);
7539 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
7540 is_gimple_val
, fb_rvalue
);
7547 ret
= gimplify_var_or_parm_decl (expr_p
);
7551 /* When within an OpenMP context, notice uses of variables. */
7552 if (gimplify_omp_ctxp
)
7553 omp_notice_variable (gimplify_omp_ctxp
, *expr_p
, true);
7558 /* Allow callbacks into the gimplifier during optimization. */
7563 gimplify_omp_parallel (expr_p
, pre_p
);
7568 gimplify_omp_task (expr_p
, pre_p
);
7573 ret
= gimplify_omp_for (expr_p
, pre_p
);
7578 gimplify_omp_workshare (expr_p
, pre_p
);
7587 gimple_seq body
= NULL
;
7590 gimplify_and_add (OMP_BODY (*expr_p
), &body
);
7591 switch (TREE_CODE (*expr_p
))
7594 g
= gimple_build_omp_section (body
);
7597 g
= gimple_build_omp_master (body
);
7600 g
= gimple_build_omp_ordered (body
);
7603 g
= gimple_build_omp_critical (body
,
7604 OMP_CRITICAL_NAME (*expr_p
));
7609 gimplify_seq_add_stmt (pre_p
, g
);
7615 case OMP_ATOMIC_READ
:
7616 case OMP_ATOMIC_CAPTURE_OLD
:
7617 case OMP_ATOMIC_CAPTURE_NEW
:
7618 ret
= gimplify_omp_atomic (expr_p
, pre_p
);
7621 case TRANSACTION_EXPR
:
7622 ret
= gimplify_transaction (expr_p
, pre_p
);
7625 case TRUTH_AND_EXPR
:
7627 case TRUTH_XOR_EXPR
:
7629 tree orig_type
= TREE_TYPE (*expr_p
);
7630 tree new_type
, xop0
, xop1
;
7631 *expr_p
= gimple_boolify (*expr_p
);
7632 new_type
= TREE_TYPE (*expr_p
);
7633 if (!useless_type_conversion_p (orig_type
, new_type
))
7635 *expr_p
= fold_convert_loc (input_location
, orig_type
, *expr_p
);
7640 /* Boolified binary truth expressions are semantically equivalent
7641 to bitwise binary expressions. Canonicalize them to the
7643 switch (TREE_CODE (*expr_p
))
7645 case TRUTH_AND_EXPR
:
7646 TREE_SET_CODE (*expr_p
, BIT_AND_EXPR
);
7649 TREE_SET_CODE (*expr_p
, BIT_IOR_EXPR
);
7651 case TRUTH_XOR_EXPR
:
7652 TREE_SET_CODE (*expr_p
, BIT_XOR_EXPR
);
7657 /* Now make sure that operands have compatible type to
7658 expression's new_type. */
7659 xop0
= TREE_OPERAND (*expr_p
, 0);
7660 xop1
= TREE_OPERAND (*expr_p
, 1);
7661 if (!useless_type_conversion_p (new_type
, TREE_TYPE (xop0
)))
7662 TREE_OPERAND (*expr_p
, 0) = fold_convert_loc (input_location
,
7665 if (!useless_type_conversion_p (new_type
, TREE_TYPE (xop1
)))
7666 TREE_OPERAND (*expr_p
, 1) = fold_convert_loc (input_location
,
7669 /* Continue classified as tcc_binary. */
7675 /* Classified as tcc_expression. */
7678 case POINTER_PLUS_EXPR
:
7680 enum gimplify_status r0
, r1
;
7681 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
7682 post_p
, is_gimple_val
, fb_rvalue
);
7683 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
,
7684 post_p
, is_gimple_val
, fb_rvalue
);
7685 recalculate_side_effects (*expr_p
);
7687 /* Convert &X + CST to invariant &MEM[&X, CST]. Do this
7688 after gimplifying operands - this is similar to how
7689 it would be folding all gimplified stmts on creation
7690 to have them canonicalized, which is what we eventually
7691 should do anyway. */
7692 if (TREE_CODE (TREE_OPERAND (*expr_p
, 1)) == INTEGER_CST
7693 && is_gimple_min_invariant (TREE_OPERAND (*expr_p
, 0)))
7695 *expr_p
= build_fold_addr_expr_with_type_loc
7697 fold_build2 (MEM_REF
, TREE_TYPE (TREE_TYPE (*expr_p
)),
7698 TREE_OPERAND (*expr_p
, 0),
7699 fold_convert (ptr_type_node
,
7700 TREE_OPERAND (*expr_p
, 1))),
7701 TREE_TYPE (*expr_p
));
7702 ret
= MIN (ret
, GS_OK
);
7708 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p
)))
7710 case tcc_comparison
:
7711 /* Handle comparison of objects of non scalar mode aggregates
7712 with a call to memcmp. It would be nice to only have to do
7713 this for variable-sized objects, but then we'd have to allow
7714 the same nest of reference nodes we allow for MODIFY_EXPR and
7717 Compare scalar mode aggregates as scalar mode values. Using
7718 memcmp for them would be very inefficient at best, and is
7719 plain wrong if bitfields are involved. */
7721 tree type
= TREE_TYPE (TREE_OPERAND (*expr_p
, 1));
7723 /* Vector comparisons need no boolification. */
7724 if (TREE_CODE (type
) == VECTOR_TYPE
)
7726 else if (!AGGREGATE_TYPE_P (type
))
7728 tree org_type
= TREE_TYPE (*expr_p
);
7729 *expr_p
= gimple_boolify (*expr_p
);
7730 if (!useless_type_conversion_p (org_type
,
7731 TREE_TYPE (*expr_p
)))
7733 *expr_p
= fold_convert_loc (input_location
,
7740 else if (TYPE_MODE (type
) != BLKmode
)
7741 ret
= gimplify_scalar_mode_aggregate_compare (expr_p
);
7743 ret
= gimplify_variable_sized_compare (expr_p
);
7748 /* If *EXPR_P does not need to be special-cased, handle it
7749 according to its class. */
7751 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
7752 post_p
, is_gimple_val
, fb_rvalue
);
7758 enum gimplify_status r0
, r1
;
7760 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
7761 post_p
, is_gimple_val
, fb_rvalue
);
7762 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
,
7763 post_p
, is_gimple_val
, fb_rvalue
);
7771 enum gimplify_status r0
, r1
, r2
;
7773 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
7774 post_p
, is_gimple_val
, fb_rvalue
);
7775 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
,
7776 post_p
, is_gimple_val
, fb_rvalue
);
7777 r2
= gimplify_expr (&TREE_OPERAND (*expr_p
, 2), pre_p
,
7778 post_p
, is_gimple_val
, fb_rvalue
);
7780 ret
= MIN (MIN (r0
, r1
), r2
);
7784 case tcc_declaration
:
7787 goto dont_recalculate
;
7793 recalculate_side_effects (*expr_p
);
7799 gcc_assert (*expr_p
|| ret
!= GS_OK
);
7801 while (ret
== GS_OK
);
7803 /* If we encountered an error_mark somewhere nested inside, either
7804 stub out the statement or propagate the error back out. */
7805 if (ret
== GS_ERROR
)
7812 /* This was only valid as a return value from the langhook, which
7813 we handled. Make sure it doesn't escape from any other context. */
7814 gcc_assert (ret
!= GS_UNHANDLED
);
7816 if (fallback
== fb_none
&& *expr_p
&& !is_gimple_stmt (*expr_p
))
7818 /* We aren't looking for a value, and we don't have a valid
7819 statement. If it doesn't have side-effects, throw it away. */
7820 if (!TREE_SIDE_EFFECTS (*expr_p
))
7822 else if (!TREE_THIS_VOLATILE (*expr_p
))
7824 /* This is probably a _REF that contains something nested that
7825 has side effects. Recurse through the operands to find it. */
7826 enum tree_code code
= TREE_CODE (*expr_p
);
7833 case VIEW_CONVERT_EXPR
:
7834 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
7835 gimple_test_f
, fallback
);
7839 case ARRAY_RANGE_REF
:
7840 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
7841 gimple_test_f
, fallback
);
7842 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
7843 gimple_test_f
, fallback
);
7847 /* Anything else with side-effects must be converted to
7848 a valid statement before we get here. */
7854 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p
))
7855 && TYPE_MODE (TREE_TYPE (*expr_p
)) != BLKmode
)
7857 /* Historically, the compiler has treated a bare reference
7858 to a non-BLKmode volatile lvalue as forcing a load. */
7859 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p
));
7861 /* Normally, we do not want to create a temporary for a
7862 TREE_ADDRESSABLE type because such a type should not be
7863 copied by bitwise-assignment. However, we make an
7864 exception here, as all we are doing here is ensuring that
7865 we read the bytes that make up the type. We use
7866 create_tmp_var_raw because create_tmp_var will abort when
7867 given a TREE_ADDRESSABLE type. */
7868 tree tmp
= create_tmp_var_raw (type
, "vol");
7869 gimple_add_tmp_var (tmp
);
7870 gimplify_assign (tmp
, *expr_p
, pre_p
);
7874 /* We can't do anything useful with a volatile reference to
7875 an incomplete type, so just throw it away. Likewise for
7876 a BLKmode type, since any implicit inner load should
7877 already have been turned into an explicit one by the
7878 gimplification process. */
7882 /* If we are gimplifying at the statement level, we're done. Tack
7883 everything together and return. */
7884 if (fallback
== fb_none
|| is_statement
)
7886 /* Since *EXPR_P has been converted into a GIMPLE tuple, clear
7887 it out for GC to reclaim it. */
7888 *expr_p
= NULL_TREE
;
7890 if (!gimple_seq_empty_p (internal_pre
)
7891 || !gimple_seq_empty_p (internal_post
))
7893 gimplify_seq_add_seq (&internal_pre
, internal_post
);
7894 gimplify_seq_add_seq (pre_p
, internal_pre
);
7897 /* The result of gimplifying *EXPR_P is going to be the last few
7898 statements in *PRE_P and *POST_P. Add location information
7899 to all the statements that were added by the gimplification
7901 if (!gimple_seq_empty_p (*pre_p
))
7902 annotate_all_with_location_after (*pre_p
, pre_last_gsi
, input_location
);
7904 if (!gimple_seq_empty_p (*post_p
))
7905 annotate_all_with_location_after (*post_p
, post_last_gsi
,
7911 #ifdef ENABLE_GIMPLE_CHECKING
7914 enum tree_code code
= TREE_CODE (*expr_p
);
7915 /* These expressions should already be in gimple IR form. */
7916 gcc_assert (code
!= MODIFY_EXPR
7918 && code
!= BIND_EXPR
7919 && code
!= CATCH_EXPR
7920 && (code
!= COND_EXPR
|| gimplify_ctxp
->allow_rhs_cond_expr
)
7921 && code
!= EH_FILTER_EXPR
7922 && code
!= GOTO_EXPR
7923 && code
!= LABEL_EXPR
7924 && code
!= LOOP_EXPR
7925 && code
!= SWITCH_EXPR
7926 && code
!= TRY_FINALLY_EXPR
7927 && code
!= OMP_CRITICAL
7929 && code
!= OMP_MASTER
7930 && code
!= OMP_ORDERED
7931 && code
!= OMP_PARALLEL
7932 && code
!= OMP_SECTIONS
7933 && code
!= OMP_SECTION
7934 && code
!= OMP_SINGLE
);
7938 /* Otherwise we're gimplifying a subexpression, so the resulting
7939 value is interesting. If it's a valid operand that matches
7940 GIMPLE_TEST_F, we're done. Unless we are handling some
7941 post-effects internally; if that's the case, we need to copy into
7942 a temporary before adding the post-effects to POST_P. */
7943 if (gimple_seq_empty_p (internal_post
) && (*gimple_test_f
) (*expr_p
))
7946 /* Otherwise, we need to create a new temporary for the gimplified
7949 /* We can't return an lvalue if we have an internal postqueue. The
7950 object the lvalue refers to would (probably) be modified by the
7951 postqueue; we need to copy the value out first, which means an
7953 if ((fallback
& fb_lvalue
)
7954 && gimple_seq_empty_p (internal_post
)
7955 && is_gimple_addressable (*expr_p
))
7957 /* An lvalue will do. Take the address of the expression, store it
7958 in a temporary, and replace the expression with an INDIRECT_REF of
7960 tmp
= build_fold_addr_expr_loc (input_location
, *expr_p
);
7961 gimplify_expr (&tmp
, pre_p
, post_p
, is_gimple_reg
, fb_rvalue
);
7962 *expr_p
= build_simple_mem_ref (tmp
);
7964 else if ((fallback
& fb_rvalue
) && is_gimple_reg_rhs_or_call (*expr_p
))
7966 /* An rvalue will do. Assign the gimplified expression into a
7967 new temporary TMP and replace the original expression with
7968 TMP. First, make sure that the expression has a type so that
7969 it can be assigned into a temporary. */
7970 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p
)));
7971 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
7975 #ifdef ENABLE_GIMPLE_CHECKING
7976 if (!(fallback
& fb_mayfail
))
7978 fprintf (stderr
, "gimplification failed:\n");
7979 print_generic_expr (stderr
, *expr_p
, 0);
7980 debug_tree (*expr_p
);
7981 internal_error ("gimplification failed");
7984 gcc_assert (fallback
& fb_mayfail
);
7986 /* If this is an asm statement, and the user asked for the
7987 impossible, don't die. Fail and let gimplify_asm_expr
7993 /* Make sure the temporary matches our predicate. */
7994 gcc_assert ((*gimple_test_f
) (*expr_p
));
7996 if (!gimple_seq_empty_p (internal_post
))
7998 annotate_all_with_location (internal_post
, input_location
);
7999 gimplify_seq_add_seq (pre_p
, internal_post
);
8003 input_location
= saved_location
;
8007 /* Look through TYPE for variable-sized objects and gimplify each such
8008 size that we find. Add to LIST_P any statements generated. */
8011 gimplify_type_sizes (tree type
, gimple_seq
*list_p
)
8015 if (type
== NULL
|| type
== error_mark_node
)
8018 /* We first do the main variant, then copy into any other variants. */
8019 type
= TYPE_MAIN_VARIANT (type
);
8021 /* Avoid infinite recursion. */
8022 if (TYPE_SIZES_GIMPLIFIED (type
))
8025 TYPE_SIZES_GIMPLIFIED (type
) = 1;
8027 switch (TREE_CODE (type
))
8033 case FIXED_POINT_TYPE
:
8034 gimplify_one_sizepos (&TYPE_MIN_VALUE (type
), list_p
);
8035 gimplify_one_sizepos (&TYPE_MAX_VALUE (type
), list_p
);
8037 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
8039 TYPE_MIN_VALUE (t
) = TYPE_MIN_VALUE (type
);
8040 TYPE_MAX_VALUE (t
) = TYPE_MAX_VALUE (type
);
8045 /* These types may not have declarations, so handle them here. */
8046 gimplify_type_sizes (TREE_TYPE (type
), list_p
);
8047 gimplify_type_sizes (TYPE_DOMAIN (type
), list_p
);
8048 /* Ensure VLA bounds aren't removed, for -O0 they should be variables
8049 with assigned stack slots, for -O1+ -g they should be tracked
8051 if (!(TYPE_NAME (type
)
8052 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
8053 && DECL_IGNORED_P (TYPE_NAME (type
)))
8054 && TYPE_DOMAIN (type
)
8055 && INTEGRAL_TYPE_P (TYPE_DOMAIN (type
)))
8057 t
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
8058 if (t
&& TREE_CODE (t
) == VAR_DECL
&& DECL_ARTIFICIAL (t
))
8059 DECL_IGNORED_P (t
) = 0;
8060 t
= TYPE_MAX_VALUE (TYPE_DOMAIN (type
));
8061 if (t
&& TREE_CODE (t
) == VAR_DECL
&& DECL_ARTIFICIAL (t
))
8062 DECL_IGNORED_P (t
) = 0;
8068 case QUAL_UNION_TYPE
:
8069 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
8070 if (TREE_CODE (field
) == FIELD_DECL
)
8072 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field
), list_p
);
8073 gimplify_one_sizepos (&DECL_SIZE (field
), list_p
);
8074 gimplify_one_sizepos (&DECL_SIZE_UNIT (field
), list_p
);
8075 gimplify_type_sizes (TREE_TYPE (field
), list_p
);
8080 case REFERENCE_TYPE
:
8081 /* We used to recurse on the pointed-to type here, which turned out to
8082 be incorrect because its definition might refer to variables not
8083 yet initialized at this point if a forward declaration is involved.
8085 It was actually useful for anonymous pointed-to types to ensure
8086 that the sizes evaluation dominates every possible later use of the
8087 values. Restricting to such types here would be safe since there
8088 is no possible forward declaration around, but would introduce an
8089 undesirable middle-end semantic to anonymity. We then defer to
8090 front-ends the responsibility of ensuring that the sizes are
8091 evaluated both early and late enough, e.g. by attaching artificial
8092 type declarations to the tree. */
8099 gimplify_one_sizepos (&TYPE_SIZE (type
), list_p
);
8100 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type
), list_p
);
8102 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
8104 TYPE_SIZE (t
) = TYPE_SIZE (type
);
8105 TYPE_SIZE_UNIT (t
) = TYPE_SIZE_UNIT (type
);
8106 TYPE_SIZES_GIMPLIFIED (t
) = 1;
8110 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
8111 a size or position, has had all of its SAVE_EXPRs evaluated.
8112 We add any required statements to *STMT_P. */
8115 gimplify_one_sizepos (tree
*expr_p
, gimple_seq
*stmt_p
)
8117 tree expr
= *expr_p
;
8119 /* We don't do anything if the value isn't there, is constant, or contains
8120 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
8121 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
8122 will want to replace it with a new variable, but that will cause problems
8123 if this type is from outside the function. It's OK to have that here. */
8124 if (expr
== NULL_TREE
|| TREE_CONSTANT (expr
)
8125 || TREE_CODE (expr
) == VAR_DECL
8126 || CONTAINS_PLACEHOLDER_P (expr
))
8129 *expr_p
= unshare_expr (expr
);
8131 gimplify_expr (expr_p
, stmt_p
, NULL
, is_gimple_val
, fb_rvalue
);
8135 /* Gimplify the body of statements of FNDECL and return a GIMPLE_BIND node
8136 containing the sequence of corresponding GIMPLE statements. If DO_PARMS
8137 is true, also gimplify the parameters. */
8140 gimplify_body (tree fndecl
, bool do_parms
)
8142 location_t saved_location
= input_location
;
8143 gimple_seq parm_stmts
, seq
;
8145 struct gimplify_ctx gctx
;
8146 struct cgraph_node
*cgn
;
8148 timevar_push (TV_TREE_GIMPLIFY
);
8150 /* Initialize for optimize_insn_for_s{ize,peed}_p possibly called during
8152 default_rtl_profile ();
8154 gcc_assert (gimplify_ctxp
== NULL
);
8155 push_gimplify_context (&gctx
);
8157 /* Unshare most shared trees in the body and in that of any nested functions.
8158 It would seem we don't have to do this for nested functions because
8159 they are supposed to be output and then the outer function gimplified
8160 first, but the g++ front end doesn't always do it that way. */
8161 unshare_body (fndecl
);
8162 unvisit_body (fndecl
);
8164 cgn
= cgraph_get_node (fndecl
);
8165 if (cgn
&& cgn
->origin
)
8166 nonlocal_vlas
= pointer_set_create ();
8168 /* Make sure input_location isn't set to something weird. */
8169 input_location
= DECL_SOURCE_LOCATION (fndecl
);
8171 /* Resolve callee-copies. This has to be done before processing
8172 the body so that DECL_VALUE_EXPR gets processed correctly. */
8173 parm_stmts
= do_parms
? gimplify_parameters () : NULL
;
8175 /* Gimplify the function's body. */
8177 gimplify_stmt (&DECL_SAVED_TREE (fndecl
), &seq
);
8178 outer_bind
= gimple_seq_first_stmt (seq
);
8181 outer_bind
= gimple_build_nop ();
8182 gimplify_seq_add_stmt (&seq
, outer_bind
);
8185 /* The body must contain exactly one statement, a GIMPLE_BIND. If this is
8186 not the case, wrap everything in a GIMPLE_BIND to make it so. */
8187 if (gimple_code (outer_bind
) == GIMPLE_BIND
8188 && gimple_seq_first (seq
) == gimple_seq_last (seq
))
8191 outer_bind
= gimple_build_bind (NULL_TREE
, seq
, NULL
);
8193 DECL_SAVED_TREE (fndecl
) = NULL_TREE
;
8195 /* If we had callee-copies statements, insert them at the beginning
8196 of the function and clear DECL_VALUE_EXPR_P on the parameters. */
8197 if (!gimple_seq_empty_p (parm_stmts
))
8201 gimplify_seq_add_seq (&parm_stmts
, gimple_bind_body (outer_bind
));
8202 gimple_bind_set_body (outer_bind
, parm_stmts
);
8204 for (parm
= DECL_ARGUMENTS (current_function_decl
);
8205 parm
; parm
= DECL_CHAIN (parm
))
8206 if (DECL_HAS_VALUE_EXPR_P (parm
))
8208 DECL_HAS_VALUE_EXPR_P (parm
) = 0;
8209 DECL_IGNORED_P (parm
) = 0;
8215 pointer_set_destroy (nonlocal_vlas
);
8216 nonlocal_vlas
= NULL
;
8219 pop_gimplify_context (outer_bind
);
8220 gcc_assert (gimplify_ctxp
== NULL
);
8222 #ifdef ENABLE_CHECKING
8224 verify_gimple_in_seq (gimple_bind_body (outer_bind
));
8227 timevar_pop (TV_TREE_GIMPLIFY
);
8228 input_location
= saved_location
;
8233 typedef char *char_p
; /* For DEF_VEC_P. */
8235 DEF_VEC_ALLOC_P(char_p
,heap
);
8237 /* Return whether we should exclude FNDECL from instrumentation. */
8240 flag_instrument_functions_exclude_p (tree fndecl
)
8242 VEC(char_p
,heap
) *vec
;
8244 vec
= (VEC(char_p
,heap
) *) flag_instrument_functions_exclude_functions
;
8245 if (VEC_length (char_p
, vec
) > 0)
8251 name
= lang_hooks
.decl_printable_name (fndecl
, 0);
8252 FOR_EACH_VEC_ELT (char_p
, vec
, i
, s
)
8253 if (strstr (name
, s
) != NULL
)
8257 vec
= (VEC(char_p
,heap
) *) flag_instrument_functions_exclude_files
;
8258 if (VEC_length (char_p
, vec
) > 0)
8264 name
= DECL_SOURCE_FILE (fndecl
);
8265 FOR_EACH_VEC_ELT (char_p
, vec
, i
, s
)
8266 if (strstr (name
, s
) != NULL
)
8273 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
8274 node for the function we want to gimplify.
8276 Return the sequence of GIMPLE statements corresponding to the body
8280 gimplify_function_tree (tree fndecl
)
8282 tree oldfn
, parm
, ret
;
8286 gcc_assert (!gimple_body (fndecl
));
8288 oldfn
= current_function_decl
;
8289 current_function_decl
= fndecl
;
8290 if (DECL_STRUCT_FUNCTION (fndecl
))
8291 push_cfun (DECL_STRUCT_FUNCTION (fndecl
));
8293 push_struct_function (fndecl
);
8295 for (parm
= DECL_ARGUMENTS (fndecl
); parm
; parm
= DECL_CHAIN (parm
))
8297 /* Preliminarily mark non-addressed complex variables as eligible
8298 for promotion to gimple registers. We'll transform their uses
8300 if ((TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
8301 || TREE_CODE (TREE_TYPE (parm
)) == VECTOR_TYPE
)
8302 && !TREE_THIS_VOLATILE (parm
)
8303 && !needs_to_live_in_memory (parm
))
8304 DECL_GIMPLE_REG_P (parm
) = 1;
8307 ret
= DECL_RESULT (fndecl
);
8308 if ((TREE_CODE (TREE_TYPE (ret
)) == COMPLEX_TYPE
8309 || TREE_CODE (TREE_TYPE (ret
)) == VECTOR_TYPE
)
8310 && !needs_to_live_in_memory (ret
))
8311 DECL_GIMPLE_REG_P (ret
) = 1;
8313 bind
= gimplify_body (fndecl
, true);
8315 /* The tree body of the function is no longer needed, replace it
8316 with the new GIMPLE body. */
8318 gimple_seq_add_stmt (&seq
, bind
);
8319 gimple_set_body (fndecl
, seq
);
8321 /* If we're instrumenting function entry/exit, then prepend the call to
8322 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
8323 catch the exit hook. */
8324 /* ??? Add some way to ignore exceptions for this TFE. */
8325 if (flag_instrument_function_entry_exit
8326 && !DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl
)
8327 && !flag_instrument_functions_exclude_p (fndecl
))
8332 gimple_seq cleanup
= NULL
, body
= NULL
;
8336 x
= builtin_decl_implicit (BUILT_IN_RETURN_ADDRESS
);
8337 call
= gimple_build_call (x
, 1, integer_zero_node
);
8338 tmp_var
= create_tmp_var (ptr_type_node
, "return_addr");
8339 gimple_call_set_lhs (call
, tmp_var
);
8340 gimplify_seq_add_stmt (&cleanup
, call
);
8341 x
= builtin_decl_implicit (BUILT_IN_PROFILE_FUNC_EXIT
);
8342 call
= gimple_build_call (x
, 2,
8343 build_fold_addr_expr (current_function_decl
),
8345 gimplify_seq_add_stmt (&cleanup
, call
);
8346 tf
= gimple_build_try (seq
, cleanup
, GIMPLE_TRY_FINALLY
);
8348 x
= builtin_decl_implicit (BUILT_IN_RETURN_ADDRESS
);
8349 call
= gimple_build_call (x
, 1, integer_zero_node
);
8350 tmp_var
= create_tmp_var (ptr_type_node
, "return_addr");
8351 gimple_call_set_lhs (call
, tmp_var
);
8352 gimplify_seq_add_stmt (&body
, call
);
8353 x
= builtin_decl_implicit (BUILT_IN_PROFILE_FUNC_ENTER
);
8354 call
= gimple_build_call (x
, 2,
8355 build_fold_addr_expr (current_function_decl
),
8357 gimplify_seq_add_stmt (&body
, call
);
8358 gimplify_seq_add_stmt (&body
, tf
);
8359 new_bind
= gimple_build_bind (NULL
, body
, gimple_bind_block (bind
));
8360 /* Clear the block for BIND, since it is no longer directly inside
8361 the function, but within a try block. */
8362 gimple_bind_set_block (bind
, NULL
);
8364 /* Replace the current function body with the body
8365 wrapped in the try/finally TF. */
8367 gimple_seq_add_stmt (&seq
, new_bind
);
8368 gimple_set_body (fndecl
, seq
);
8371 DECL_SAVED_TREE (fndecl
) = NULL_TREE
;
8372 cfun
->curr_properties
= PROP_gimple_any
;
8374 current_function_decl
= oldfn
;
8378 /* Some transformations like inlining may invalidate the GIMPLE form
8379 for operands. This function traverses all the operands in STMT and
8380 gimplifies anything that is not a valid gimple operand. Any new
8381 GIMPLE statements are inserted before *GSI_P. */
8384 gimple_regimplify_operands (gimple stmt
, gimple_stmt_iterator
*gsi_p
)
8388 gimple_seq pre
= NULL
;
8389 gimple post_stmt
= NULL
;
8390 struct gimplify_ctx gctx
;
8392 push_gimplify_context (&gctx
);
8393 gimplify_ctxp
->into_ssa
= gimple_in_ssa_p (cfun
);
8395 switch (gimple_code (stmt
))
8398 gimplify_expr (gimple_cond_lhs_ptr (stmt
), &pre
, NULL
,
8399 is_gimple_val
, fb_rvalue
);
8400 gimplify_expr (gimple_cond_rhs_ptr (stmt
), &pre
, NULL
,
8401 is_gimple_val
, fb_rvalue
);
8404 gimplify_expr (gimple_switch_index_ptr (stmt
), &pre
, NULL
,
8405 is_gimple_val
, fb_rvalue
);
8407 case GIMPLE_OMP_ATOMIC_LOAD
:
8408 gimplify_expr (gimple_omp_atomic_load_rhs_ptr (stmt
), &pre
, NULL
,
8409 is_gimple_val
, fb_rvalue
);
8413 size_t i
, noutputs
= gimple_asm_noutputs (stmt
);
8414 const char *constraint
, **oconstraints
;
8415 bool allows_mem
, allows_reg
, is_inout
;
8418 = (const char **) alloca ((noutputs
) * sizeof (const char *));
8419 for (i
= 0; i
< noutputs
; i
++)
8421 tree op
= gimple_asm_output_op (stmt
, i
);
8422 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op
)));
8423 oconstraints
[i
] = constraint
;
8424 parse_output_constraint (&constraint
, i
, 0, 0, &allows_mem
,
8425 &allows_reg
, &is_inout
);
8426 gimplify_expr (&TREE_VALUE (op
), &pre
, NULL
,
8427 is_inout
? is_gimple_min_lval
: is_gimple_lvalue
,
8428 fb_lvalue
| fb_mayfail
);
8430 for (i
= 0; i
< gimple_asm_ninputs (stmt
); i
++)
8432 tree op
= gimple_asm_input_op (stmt
, i
);
8433 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op
)));
8434 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
8435 oconstraints
, &allows_mem
, &allows_reg
);
8436 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (op
))) && allows_mem
)
8438 if (!allows_reg
&& allows_mem
)
8439 gimplify_expr (&TREE_VALUE (op
), &pre
, NULL
,
8440 is_gimple_lvalue
, fb_lvalue
| fb_mayfail
);
8442 gimplify_expr (&TREE_VALUE (op
), &pre
, NULL
,
8443 is_gimple_asm_val
, fb_rvalue
);
8448 /* NOTE: We start gimplifying operands from last to first to
8449 make sure that side-effects on the RHS of calls, assignments
8450 and ASMs are executed before the LHS. The ordering is not
8451 important for other statements. */
8452 num_ops
= gimple_num_ops (stmt
);
8453 for (i
= num_ops
; i
> 0; i
--)
8455 tree op
= gimple_op (stmt
, i
- 1);
8456 if (op
== NULL_TREE
)
8458 if (i
== 1 && (is_gimple_call (stmt
) || is_gimple_assign (stmt
)))
8459 gimplify_expr (&op
, &pre
, NULL
, is_gimple_lvalue
, fb_lvalue
);
8461 && is_gimple_assign (stmt
)
8463 && get_gimple_rhs_class (gimple_expr_code (stmt
))
8464 == GIMPLE_SINGLE_RHS
)
8465 gimplify_expr (&op
, &pre
, NULL
,
8466 rhs_predicate_for (gimple_assign_lhs (stmt
)),
8468 else if (i
== 2 && is_gimple_call (stmt
))
8470 if (TREE_CODE (op
) == FUNCTION_DECL
)
8472 gimplify_expr (&op
, &pre
, NULL
, is_gimple_call_addr
, fb_rvalue
);
8475 gimplify_expr (&op
, &pre
, NULL
, is_gimple_val
, fb_rvalue
);
8476 gimple_set_op (stmt
, i
- 1, op
);
8479 lhs
= gimple_get_lhs (stmt
);
8480 /* If the LHS changed it in a way that requires a simple RHS,
8481 create temporary. */
8482 if (lhs
&& !is_gimple_reg (lhs
))
8484 bool need_temp
= false;
8486 if (is_gimple_assign (stmt
)
8488 && get_gimple_rhs_class (gimple_expr_code (stmt
))
8489 == GIMPLE_SINGLE_RHS
)
8490 gimplify_expr (gimple_assign_rhs1_ptr (stmt
), &pre
, NULL
,
8491 rhs_predicate_for (gimple_assign_lhs (stmt
)),
8493 else if (is_gimple_reg (lhs
))
8495 if (is_gimple_reg_type (TREE_TYPE (lhs
)))
8497 if (is_gimple_call (stmt
))
8499 i
= gimple_call_flags (stmt
);
8500 if ((i
& ECF_LOOPING_CONST_OR_PURE
)
8501 || !(i
& (ECF_CONST
| ECF_PURE
)))
8504 if (stmt_can_throw_internal (stmt
))
8510 if (is_gimple_reg_type (TREE_TYPE (lhs
)))
8512 else if (TYPE_MODE (TREE_TYPE (lhs
)) != BLKmode
)
8514 if (is_gimple_call (stmt
))
8516 tree fndecl
= gimple_call_fndecl (stmt
);
8518 if (!aggregate_value_p (TREE_TYPE (lhs
), fndecl
)
8519 && !(fndecl
&& DECL_RESULT (fndecl
)
8520 && DECL_BY_REFERENCE (DECL_RESULT (fndecl
))))
8529 tree temp
= create_tmp_reg (TREE_TYPE (lhs
), NULL
);
8530 if (gimple_in_ssa_p (cfun
))
8531 temp
= make_ssa_name (temp
, NULL
);
8532 gimple_set_lhs (stmt
, temp
);
8533 post_stmt
= gimple_build_assign (lhs
, temp
);
8534 if (TREE_CODE (lhs
) == SSA_NAME
)
8535 SSA_NAME_DEF_STMT (lhs
) = post_stmt
;
8541 if (!gimple_seq_empty_p (pre
))
8542 gsi_insert_seq_before (gsi_p
, pre
, GSI_SAME_STMT
);
8544 gsi_insert_after (gsi_p
, post_stmt
, GSI_NEW_STMT
);
8546 pop_gimplify_context (NULL
);
8549 /* Expand EXPR to list of gimple statements STMTS. GIMPLE_TEST_F specifies
8550 the predicate that will hold for the result. If VAR is not NULL, make the
8551 base variable of the final destination be VAR if suitable. */
8554 force_gimple_operand_1 (tree expr
, gimple_seq
*stmts
,
8555 gimple_predicate gimple_test_f
, tree var
)
8557 enum gimplify_status ret
;
8558 struct gimplify_ctx gctx
;
8562 /* gimple_test_f might be more strict than is_gimple_val, make
8563 sure we pass both. Just checking gimple_test_f doesn't work
8564 because most gimple predicates do not work recursively. */
8565 if (is_gimple_val (expr
)
8566 && (*gimple_test_f
) (expr
))
8569 push_gimplify_context (&gctx
);
8570 gimplify_ctxp
->into_ssa
= gimple_in_ssa_p (cfun
);
8571 gimplify_ctxp
->allow_rhs_cond_expr
= true;
8575 if (gimplify_ctxp
->into_ssa
8576 && is_gimple_reg (var
))
8577 var
= make_ssa_name (var
, NULL
);
8578 expr
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, expr
);
8581 if (TREE_CODE (expr
) != MODIFY_EXPR
8582 && TREE_TYPE (expr
) == void_type_node
)
8584 gimplify_and_add (expr
, stmts
);
8589 ret
= gimplify_expr (&expr
, stmts
, NULL
, gimple_test_f
, fb_rvalue
);
8590 gcc_assert (ret
!= GS_ERROR
);
8593 pop_gimplify_context (NULL
);
8598 /* Expand EXPR to list of gimple statements STMTS. If SIMPLE is true,
8599 force the result to be either ssa_name or an invariant, otherwise
8600 just force it to be a rhs expression. If VAR is not NULL, make the
8601 base variable of the final destination be VAR if suitable. */
8604 force_gimple_operand (tree expr
, gimple_seq
*stmts
, bool simple
, tree var
)
8606 return force_gimple_operand_1 (expr
, stmts
,
8607 simple
? is_gimple_val
: is_gimple_reg_rhs
,
8611 /* Invoke force_gimple_operand_1 for EXPR with parameters GIMPLE_TEST_F
8612 and VAR. If some statements are produced, emits them at GSI.
8613 If BEFORE is true. the statements are appended before GSI, otherwise
8614 they are appended after it. M specifies the way GSI moves after
8615 insertion (GSI_SAME_STMT or GSI_CONTINUE_LINKING are the usual values). */
8618 force_gimple_operand_gsi_1 (gimple_stmt_iterator
*gsi
, tree expr
,
8619 gimple_predicate gimple_test_f
,
8620 tree var
, bool before
,
8621 enum gsi_iterator_update m
)
8625 expr
= force_gimple_operand_1 (expr
, &stmts
, gimple_test_f
, var
);
8627 if (!gimple_seq_empty_p (stmts
))
8630 gsi_insert_seq_before (gsi
, stmts
, m
);
8632 gsi_insert_seq_after (gsi
, stmts
, m
);
8638 /* Invoke force_gimple_operand_1 for EXPR with parameter VAR.
8639 If SIMPLE is true, force the result to be either ssa_name or an invariant,
8640 otherwise just force it to be a rhs expression. If some statements are
8641 produced, emits them at GSI. If BEFORE is true, the statements are
8642 appended before GSI, otherwise they are appended after it. M specifies
8643 the way GSI moves after insertion (GSI_SAME_STMT or GSI_CONTINUE_LINKING
8644 are the usual values). */
8647 force_gimple_operand_gsi (gimple_stmt_iterator
*gsi
, tree expr
,
8648 bool simple_p
, tree var
, bool before
,
8649 enum gsi_iterator_update m
)
8651 return force_gimple_operand_gsi_1 (gsi
, expr
,
8653 ? is_gimple_val
: is_gimple_reg_rhs
,
8658 #include "gt-gimplify.h"