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 routines. 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_vec (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
);
2501 if (fndecl
&& DECL_BUILT_IN (fndecl
))
2503 tree new_tree
= fold_call_expr (input_location
, *expr_p
, !want_value
);
2505 if (new_tree
&& new_tree
!= *expr_p
)
2507 /* There was a transformation of this call which computes the
2508 same value, but in a more efficient way. Return and try
2514 if (DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
2515 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_VA_START
)
2517 builtin_va_start_p
= TRUE
;
2518 if (call_expr_nargs (*expr_p
) < 2)
2520 error ("too few arguments to function %<va_start%>");
2521 *expr_p
= build_empty_stmt (EXPR_LOCATION (*expr_p
));
2525 if (fold_builtin_next_arg (*expr_p
, true))
2527 *expr_p
= build_empty_stmt (EXPR_LOCATION (*expr_p
));
2533 /* Remember the original function pointer type. */
2534 fnptrtype
= TREE_TYPE (CALL_EXPR_FN (*expr_p
));
2536 /* There is a sequence point before the call, so any side effects in
2537 the calling expression must occur before the actual call. Force
2538 gimplify_expr to use an internal post queue. */
2539 ret
= gimplify_expr (&CALL_EXPR_FN (*expr_p
), pre_p
, NULL
,
2540 is_gimple_call_addr
, fb_rvalue
);
2542 nargs
= call_expr_nargs (*expr_p
);
2544 /* Get argument types for verification. */
2545 fndecl
= get_callee_fndecl (*expr_p
);
2548 parms
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
2549 else if (POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_FN (*expr_p
))))
2550 parms
= TYPE_ARG_TYPES (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (*expr_p
))));
2552 if (fndecl
&& DECL_ARGUMENTS (fndecl
))
2553 p
= DECL_ARGUMENTS (fndecl
);
2558 for (i
= 0; i
< nargs
&& p
; i
++, p
= TREE_CHAIN (p
))
2561 /* If the last argument is __builtin_va_arg_pack () and it is not
2562 passed as a named argument, decrease the number of CALL_EXPR
2563 arguments and set instead the CALL_EXPR_VA_ARG_PACK flag. */
2566 && TREE_CODE (CALL_EXPR_ARG (*expr_p
, nargs
- 1)) == CALL_EXPR
)
2568 tree last_arg
= CALL_EXPR_ARG (*expr_p
, nargs
- 1);
2569 tree last_arg_fndecl
= get_callee_fndecl (last_arg
);
2572 && TREE_CODE (last_arg_fndecl
) == FUNCTION_DECL
2573 && DECL_BUILT_IN_CLASS (last_arg_fndecl
) == BUILT_IN_NORMAL
2574 && DECL_FUNCTION_CODE (last_arg_fndecl
) == BUILT_IN_VA_ARG_PACK
)
2576 tree call
= *expr_p
;
2579 *expr_p
= build_call_array_loc (loc
, TREE_TYPE (call
),
2580 CALL_EXPR_FN (call
),
2581 nargs
, CALL_EXPR_ARGP (call
));
2583 /* Copy all CALL_EXPR flags, location and block, except
2584 CALL_EXPR_VA_ARG_PACK flag. */
2585 CALL_EXPR_STATIC_CHAIN (*expr_p
) = CALL_EXPR_STATIC_CHAIN (call
);
2586 CALL_EXPR_TAILCALL (*expr_p
) = CALL_EXPR_TAILCALL (call
);
2587 CALL_EXPR_RETURN_SLOT_OPT (*expr_p
)
2588 = CALL_EXPR_RETURN_SLOT_OPT (call
);
2589 CALL_FROM_THUNK_P (*expr_p
) = CALL_FROM_THUNK_P (call
);
2590 SET_EXPR_LOCATION (*expr_p
, EXPR_LOCATION (call
));
2591 TREE_BLOCK (*expr_p
) = TREE_BLOCK (call
);
2593 /* Set CALL_EXPR_VA_ARG_PACK. */
2594 CALL_EXPR_VA_ARG_PACK (*expr_p
) = 1;
2598 /* Finally, gimplify the function arguments. */
2601 for (i
= (PUSH_ARGS_REVERSED
? nargs
- 1 : 0);
2602 PUSH_ARGS_REVERSED
? i
>= 0 : i
< nargs
;
2603 PUSH_ARGS_REVERSED
? i
-- : i
++)
2605 enum gimplify_status t
;
2607 /* Avoid gimplifying the second argument to va_start, which needs to
2608 be the plain PARM_DECL. */
2609 if ((i
!= 1) || !builtin_va_start_p
)
2611 t
= gimplify_arg (&CALL_EXPR_ARG (*expr_p
, i
), pre_p
,
2612 EXPR_LOCATION (*expr_p
));
2620 /* Verify the function result. */
2621 if (want_value
&& fndecl
2622 && VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fnptrtype
))))
2624 error_at (loc
, "using result of function returning %<void%>");
2628 /* Try this again in case gimplification exposed something. */
2629 if (ret
!= GS_ERROR
)
2631 tree new_tree
= fold_call_expr (input_location
, *expr_p
, !want_value
);
2633 if (new_tree
&& new_tree
!= *expr_p
)
2635 /* There was a transformation of this call which computes the
2636 same value, but in a more efficient way. Return and try
2644 *expr_p
= error_mark_node
;
2648 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2649 decl. This allows us to eliminate redundant or useless
2650 calls to "const" functions. */
2651 if (TREE_CODE (*expr_p
) == CALL_EXPR
)
2653 int flags
= call_expr_flags (*expr_p
);
2654 if (flags
& (ECF_CONST
| ECF_PURE
)
2655 /* An infinite loop is considered a side effect. */
2656 && !(flags
& (ECF_LOOPING_CONST_OR_PURE
)))
2657 TREE_SIDE_EFFECTS (*expr_p
) = 0;
2660 /* If the value is not needed by the caller, emit a new GIMPLE_CALL
2661 and clear *EXPR_P. Otherwise, leave *EXPR_P in its gimplified
2662 form and delegate the creation of a GIMPLE_CALL to
2663 gimplify_modify_expr. This is always possible because when
2664 WANT_VALUE is true, the caller wants the result of this call into
2665 a temporary, which means that we will emit an INIT_EXPR in
2666 internal_get_tmp_var which will then be handled by
2667 gimplify_modify_expr. */
2670 /* The CALL_EXPR in *EXPR_P is already in GIMPLE form, so all we
2671 have to do is replicate it as a GIMPLE_CALL tuple. */
2672 gimple_stmt_iterator gsi
;
2673 call
= gimple_build_call_from_tree (*expr_p
);
2674 gimple_call_set_fntype (call
, TREE_TYPE (fnptrtype
));
2675 gimplify_seq_add_stmt (pre_p
, call
);
2676 gsi
= gsi_last (*pre_p
);
2678 *expr_p
= NULL_TREE
;
2681 /* Remember the original function type. */
2682 CALL_EXPR_FN (*expr_p
) = build1 (NOP_EXPR
, fnptrtype
,
2683 CALL_EXPR_FN (*expr_p
));
2688 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2689 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2691 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2692 condition is true or false, respectively. If null, we should generate
2693 our own to skip over the evaluation of this specific expression.
2695 LOCUS is the source location of the COND_EXPR.
2697 This function is the tree equivalent of do_jump.
2699 shortcut_cond_r should only be called by shortcut_cond_expr. */
2702 shortcut_cond_r (tree pred
, tree
*true_label_p
, tree
*false_label_p
,
2705 tree local_label
= NULL_TREE
;
2706 tree t
, expr
= NULL
;
2708 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2709 retain the shortcut semantics. Just insert the gotos here;
2710 shortcut_cond_expr will append the real blocks later. */
2711 if (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2713 location_t new_locus
;
2715 /* Turn if (a && b) into
2717 if (a); else goto no;
2718 if (b) goto yes; else goto no;
2721 if (false_label_p
== NULL
)
2722 false_label_p
= &local_label
;
2724 /* Keep the original source location on the first 'if'. */
2725 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), NULL
, false_label_p
, locus
);
2726 append_to_statement_list (t
, &expr
);
2728 /* Set the source location of the && on the second 'if'. */
2729 new_locus
= EXPR_HAS_LOCATION (pred
) ? EXPR_LOCATION (pred
) : locus
;
2730 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
, false_label_p
,
2732 append_to_statement_list (t
, &expr
);
2734 else if (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2736 location_t new_locus
;
2738 /* Turn if (a || b) into
2741 if (b) goto yes; else goto no;
2744 if (true_label_p
== NULL
)
2745 true_label_p
= &local_label
;
2747 /* Keep the original source location on the first 'if'. */
2748 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), true_label_p
, NULL
, locus
);
2749 append_to_statement_list (t
, &expr
);
2751 /* Set the source location of the || on the second 'if'. */
2752 new_locus
= EXPR_HAS_LOCATION (pred
) ? EXPR_LOCATION (pred
) : locus
;
2753 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
, false_label_p
,
2755 append_to_statement_list (t
, &expr
);
2757 else if (TREE_CODE (pred
) == COND_EXPR
2758 && !VOID_TYPE_P (TREE_TYPE (TREE_OPERAND (pred
, 1)))
2759 && !VOID_TYPE_P (TREE_TYPE (TREE_OPERAND (pred
, 2))))
2761 location_t new_locus
;
2763 /* As long as we're messing with gotos, turn if (a ? b : c) into
2765 if (b) goto yes; else goto no;
2767 if (c) goto yes; else goto no;
2769 Don't do this if one of the arms has void type, which can happen
2770 in C++ when the arm is throw. */
2772 /* Keep the original source location on the first 'if'. Set the source
2773 location of the ? on the second 'if'. */
2774 new_locus
= EXPR_HAS_LOCATION (pred
) ? EXPR_LOCATION (pred
) : locus
;
2775 expr
= build3 (COND_EXPR
, void_type_node
, TREE_OPERAND (pred
, 0),
2776 shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2777 false_label_p
, locus
),
2778 shortcut_cond_r (TREE_OPERAND (pred
, 2), true_label_p
,
2779 false_label_p
, new_locus
));
2783 expr
= build3 (COND_EXPR
, void_type_node
, pred
,
2784 build_and_jump (true_label_p
),
2785 build_and_jump (false_label_p
));
2786 SET_EXPR_LOCATION (expr
, locus
);
2791 t
= build1 (LABEL_EXPR
, void_type_node
, local_label
);
2792 append_to_statement_list (t
, &expr
);
2798 /* Given a conditional expression EXPR with short-circuit boolean
2799 predicates using TRUTH_ANDIF_EXPR or TRUTH_ORIF_EXPR, break the
2800 predicate apart into the equivalent sequence of conditionals. */
2803 shortcut_cond_expr (tree expr
)
2805 tree pred
= TREE_OPERAND (expr
, 0);
2806 tree then_
= TREE_OPERAND (expr
, 1);
2807 tree else_
= TREE_OPERAND (expr
, 2);
2808 tree true_label
, false_label
, end_label
, t
;
2810 tree
*false_label_p
;
2811 bool emit_end
, emit_false
, jump_over_else
;
2812 bool then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2813 bool else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2815 /* First do simple transformations. */
2818 /* If there is no 'else', turn
2821 if (a) if (b) then c. */
2822 while (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2824 /* Keep the original source location on the first 'if'. */
2825 location_t locus
= EXPR_LOC_OR_HERE (expr
);
2826 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2827 /* Set the source location of the && on the second 'if'. */
2828 if (EXPR_HAS_LOCATION (pred
))
2829 SET_EXPR_LOCATION (expr
, EXPR_LOCATION (pred
));
2830 then_
= shortcut_cond_expr (expr
);
2831 then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2832 pred
= TREE_OPERAND (pred
, 0);
2833 expr
= build3 (COND_EXPR
, void_type_node
, pred
, then_
, NULL_TREE
);
2834 SET_EXPR_LOCATION (expr
, locus
);
2840 /* If there is no 'then', turn
2843 if (a); else if (b); else d. */
2844 while (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2846 /* Keep the original source location on the first 'if'. */
2847 location_t locus
= EXPR_LOC_OR_HERE (expr
);
2848 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2849 /* Set the source location of the || on the second 'if'. */
2850 if (EXPR_HAS_LOCATION (pred
))
2851 SET_EXPR_LOCATION (expr
, EXPR_LOCATION (pred
));
2852 else_
= shortcut_cond_expr (expr
);
2853 else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2854 pred
= TREE_OPERAND (pred
, 0);
2855 expr
= build3 (COND_EXPR
, void_type_node
, pred
, NULL_TREE
, else_
);
2856 SET_EXPR_LOCATION (expr
, locus
);
2860 /* If we're done, great. */
2861 if (TREE_CODE (pred
) != TRUTH_ANDIF_EXPR
2862 && TREE_CODE (pred
) != TRUTH_ORIF_EXPR
)
2865 /* Otherwise we need to mess with gotos. Change
2868 if (a); else goto no;
2871 and recursively gimplify the condition. */
2873 true_label
= false_label
= end_label
= NULL_TREE
;
2875 /* If our arms just jump somewhere, hijack those labels so we don't
2876 generate jumps to jumps. */
2879 && TREE_CODE (then_
) == GOTO_EXPR
2880 && TREE_CODE (GOTO_DESTINATION (then_
)) == LABEL_DECL
)
2882 true_label
= GOTO_DESTINATION (then_
);
2888 && TREE_CODE (else_
) == GOTO_EXPR
2889 && TREE_CODE (GOTO_DESTINATION (else_
)) == LABEL_DECL
)
2891 false_label
= GOTO_DESTINATION (else_
);
2896 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2898 true_label_p
= &true_label
;
2900 true_label_p
= NULL
;
2902 /* The 'else' branch also needs a label if it contains interesting code. */
2903 if (false_label
|| else_se
)
2904 false_label_p
= &false_label
;
2906 false_label_p
= NULL
;
2908 /* If there was nothing else in our arms, just forward the label(s). */
2909 if (!then_se
&& !else_se
)
2910 return shortcut_cond_r (pred
, true_label_p
, false_label_p
,
2911 EXPR_LOC_OR_HERE (expr
));
2913 /* If our last subexpression already has a terminal label, reuse it. */
2915 t
= expr_last (else_
);
2917 t
= expr_last (then_
);
2920 if (t
&& TREE_CODE (t
) == LABEL_EXPR
)
2921 end_label
= LABEL_EXPR_LABEL (t
);
2923 /* If we don't care about jumping to the 'else' branch, jump to the end
2924 if the condition is false. */
2926 false_label_p
= &end_label
;
2928 /* We only want to emit these labels if we aren't hijacking them. */
2929 emit_end
= (end_label
== NULL_TREE
);
2930 emit_false
= (false_label
== NULL_TREE
);
2932 /* We only emit the jump over the else clause if we have to--if the
2933 then clause may fall through. Otherwise we can wind up with a
2934 useless jump and a useless label at the end of gimplified code,
2935 which will cause us to think that this conditional as a whole
2936 falls through even if it doesn't. If we then inline a function
2937 which ends with such a condition, that can cause us to issue an
2938 inappropriate warning about control reaching the end of a
2939 non-void function. */
2940 jump_over_else
= block_may_fallthru (then_
);
2942 pred
= shortcut_cond_r (pred
, true_label_p
, false_label_p
,
2943 EXPR_LOC_OR_HERE (expr
));
2946 append_to_statement_list (pred
, &expr
);
2948 append_to_statement_list (then_
, &expr
);
2953 tree last
= expr_last (expr
);
2954 t
= build_and_jump (&end_label
);
2955 if (EXPR_HAS_LOCATION (last
))
2956 SET_EXPR_LOCATION (t
, EXPR_LOCATION (last
));
2957 append_to_statement_list (t
, &expr
);
2961 t
= build1 (LABEL_EXPR
, void_type_node
, false_label
);
2962 append_to_statement_list (t
, &expr
);
2964 append_to_statement_list (else_
, &expr
);
2966 if (emit_end
&& end_label
)
2968 t
= build1 (LABEL_EXPR
, void_type_node
, end_label
);
2969 append_to_statement_list (t
, &expr
);
2975 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2978 gimple_boolify (tree expr
)
2980 tree type
= TREE_TYPE (expr
);
2981 location_t loc
= EXPR_LOCATION (expr
);
2983 if (TREE_CODE (expr
) == NE_EXPR
2984 && TREE_CODE (TREE_OPERAND (expr
, 0)) == CALL_EXPR
2985 && integer_zerop (TREE_OPERAND (expr
, 1)))
2987 tree call
= TREE_OPERAND (expr
, 0);
2988 tree fn
= get_callee_fndecl (call
);
2990 /* For __builtin_expect ((long) (x), y) recurse into x as well
2991 if x is truth_value_p. */
2993 && DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
2994 && DECL_FUNCTION_CODE (fn
) == BUILT_IN_EXPECT
2995 && call_expr_nargs (call
) == 2)
2997 tree arg
= CALL_EXPR_ARG (call
, 0);
3000 if (TREE_CODE (arg
) == NOP_EXPR
3001 && TREE_TYPE (arg
) == TREE_TYPE (call
))
3002 arg
= TREE_OPERAND (arg
, 0);
3003 if (truth_value_p (TREE_CODE (arg
)))
3005 arg
= gimple_boolify (arg
);
3006 CALL_EXPR_ARG (call
, 0)
3007 = fold_convert_loc (loc
, TREE_TYPE (call
), arg
);
3013 switch (TREE_CODE (expr
))
3015 case TRUTH_AND_EXPR
:
3017 case TRUTH_XOR_EXPR
:
3018 case TRUTH_ANDIF_EXPR
:
3019 case TRUTH_ORIF_EXPR
:
3020 /* Also boolify the arguments of truth exprs. */
3021 TREE_OPERAND (expr
, 1) = gimple_boolify (TREE_OPERAND (expr
, 1));
3024 case TRUTH_NOT_EXPR
:
3025 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
3027 /* These expressions always produce boolean results. */
3028 if (TREE_CODE (type
) != BOOLEAN_TYPE
)
3029 TREE_TYPE (expr
) = boolean_type_node
;
3033 if (COMPARISON_CLASS_P (expr
))
3035 /* There expressions always prduce boolean results. */
3036 if (TREE_CODE (type
) != BOOLEAN_TYPE
)
3037 TREE_TYPE (expr
) = boolean_type_node
;
3040 /* Other expressions that get here must have boolean values, but
3041 might need to be converted to the appropriate mode. */
3042 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
3044 return fold_convert_loc (loc
, boolean_type_node
, expr
);
3048 /* Given a conditional expression *EXPR_P without side effects, gimplify
3049 its operands. New statements are inserted to PRE_P. */
3051 static enum gimplify_status
3052 gimplify_pure_cond_expr (tree
*expr_p
, gimple_seq
*pre_p
)
3054 tree expr
= *expr_p
, cond
;
3055 enum gimplify_status ret
, tret
;
3056 enum tree_code code
;
3058 cond
= gimple_boolify (COND_EXPR_COND (expr
));
3060 /* We need to handle && and || specially, as their gimplification
3061 creates pure cond_expr, thus leading to an infinite cycle otherwise. */
3062 code
= TREE_CODE (cond
);
3063 if (code
== TRUTH_ANDIF_EXPR
)
3064 TREE_SET_CODE (cond
, TRUTH_AND_EXPR
);
3065 else if (code
== TRUTH_ORIF_EXPR
)
3066 TREE_SET_CODE (cond
, TRUTH_OR_EXPR
);
3067 ret
= gimplify_expr (&cond
, pre_p
, NULL
, is_gimple_condexpr
, fb_rvalue
);
3068 COND_EXPR_COND (*expr_p
) = cond
;
3070 tret
= gimplify_expr (&COND_EXPR_THEN (expr
), pre_p
, NULL
,
3071 is_gimple_val
, fb_rvalue
);
3072 ret
= MIN (ret
, tret
);
3073 tret
= gimplify_expr (&COND_EXPR_ELSE (expr
), pre_p
, NULL
,
3074 is_gimple_val
, fb_rvalue
);
3076 return MIN (ret
, tret
);
3079 /* Return true if evaluating EXPR could trap.
3080 EXPR is GENERIC, while tree_could_trap_p can be called
3084 generic_expr_could_trap_p (tree expr
)
3088 if (!expr
|| is_gimple_val (expr
))
3091 if (!EXPR_P (expr
) || tree_could_trap_p (expr
))
3094 n
= TREE_OPERAND_LENGTH (expr
);
3095 for (i
= 0; i
< n
; i
++)
3096 if (generic_expr_could_trap_p (TREE_OPERAND (expr
, i
)))
3102 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
3111 The second form is used when *EXPR_P is of type void.
3113 PRE_P points to the list where side effects that must happen before
3114 *EXPR_P should be stored. */
3116 static enum gimplify_status
3117 gimplify_cond_expr (tree
*expr_p
, gimple_seq
*pre_p
, fallback_t fallback
)
3119 tree expr
= *expr_p
;
3120 tree type
= TREE_TYPE (expr
);
3121 location_t loc
= EXPR_LOCATION (expr
);
3122 tree tmp
, arm1
, arm2
;
3123 enum gimplify_status ret
;
3124 tree label_true
, label_false
, label_cont
;
3125 bool have_then_clause_p
, have_else_clause_p
;
3127 enum tree_code pred_code
;
3128 gimple_seq seq
= NULL
;
3130 /* If this COND_EXPR has a value, copy the values into a temporary within
3132 if (!VOID_TYPE_P (type
))
3134 tree then_
= TREE_OPERAND (expr
, 1), else_
= TREE_OPERAND (expr
, 2);
3137 /* If either an rvalue is ok or we do not require an lvalue, create the
3138 temporary. But we cannot do that if the type is addressable. */
3139 if (((fallback
& fb_rvalue
) || !(fallback
& fb_lvalue
))
3140 && !TREE_ADDRESSABLE (type
))
3142 if (gimplify_ctxp
->allow_rhs_cond_expr
3143 /* If either branch has side effects or could trap, it can't be
3144 evaluated unconditionally. */
3145 && !TREE_SIDE_EFFECTS (then_
)
3146 && !generic_expr_could_trap_p (then_
)
3147 && !TREE_SIDE_EFFECTS (else_
)
3148 && !generic_expr_could_trap_p (else_
))
3149 return gimplify_pure_cond_expr (expr_p
, pre_p
);
3151 tmp
= create_tmp_var (type
, "iftmp");
3155 /* Otherwise, only create and copy references to the values. */
3158 type
= build_pointer_type (type
);
3160 if (!VOID_TYPE_P (TREE_TYPE (then_
)))
3161 then_
= build_fold_addr_expr_loc (loc
, then_
);
3163 if (!VOID_TYPE_P (TREE_TYPE (else_
)))
3164 else_
= build_fold_addr_expr_loc (loc
, else_
);
3167 = build3 (COND_EXPR
, type
, TREE_OPERAND (expr
, 0), then_
, else_
);
3169 tmp
= create_tmp_var (type
, "iftmp");
3170 result
= build_simple_mem_ref_loc (loc
, tmp
);
3173 /* Build the new then clause, `tmp = then_;'. But don't build the
3174 assignment if the value is void; in C++ it can be if it's a throw. */
3175 if (!VOID_TYPE_P (TREE_TYPE (then_
)))
3176 TREE_OPERAND (expr
, 1) = build2 (MODIFY_EXPR
, type
, tmp
, then_
);
3178 /* Similarly, build the new else clause, `tmp = else_;'. */
3179 if (!VOID_TYPE_P (TREE_TYPE (else_
)))
3180 TREE_OPERAND (expr
, 2) = build2 (MODIFY_EXPR
, type
, tmp
, else_
);
3182 TREE_TYPE (expr
) = void_type_node
;
3183 recalculate_side_effects (expr
);
3185 /* Move the COND_EXPR to the prequeue. */
3186 gimplify_stmt (&expr
, pre_p
);
3192 /* Remove any COMPOUND_EXPR so the following cases will be caught. */
3193 STRIP_TYPE_NOPS (TREE_OPERAND (expr
, 0));
3194 if (TREE_CODE (TREE_OPERAND (expr
, 0)) == COMPOUND_EXPR
)
3195 gimplify_compound_expr (&TREE_OPERAND (expr
, 0), pre_p
, true);
3197 /* Make sure the condition has BOOLEAN_TYPE. */
3198 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
3200 /* Break apart && and || conditions. */
3201 if (TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ANDIF_EXPR
3202 || TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ORIF_EXPR
)
3204 expr
= shortcut_cond_expr (expr
);
3206 if (expr
!= *expr_p
)
3210 /* We can't rely on gimplify_expr to re-gimplify the expanded
3211 form properly, as cleanups might cause the target labels to be
3212 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
3213 set up a conditional context. */
3214 gimple_push_condition ();
3215 gimplify_stmt (expr_p
, &seq
);
3216 gimple_pop_condition (pre_p
);
3217 gimple_seq_add_seq (pre_p
, seq
);
3223 /* Now do the normal gimplification. */
3225 /* Gimplify condition. */
3226 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, NULL
, is_gimple_condexpr
,
3228 if (ret
== GS_ERROR
)
3230 gcc_assert (TREE_OPERAND (expr
, 0) != NULL_TREE
);
3232 gimple_push_condition ();
3234 have_then_clause_p
= have_else_clause_p
= false;
3235 if (TREE_OPERAND (expr
, 1) != NULL
3236 && TREE_CODE (TREE_OPERAND (expr
, 1)) == GOTO_EXPR
3237 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr
, 1))) == LABEL_DECL
3238 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr
, 1)))
3239 == current_function_decl
)
3240 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
3241 have different locations, otherwise we end up with incorrect
3242 location information on the branches. */
3244 || !EXPR_HAS_LOCATION (expr
)
3245 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr
, 1))
3246 || EXPR_LOCATION (expr
) == EXPR_LOCATION (TREE_OPERAND (expr
, 1))))
3248 label_true
= GOTO_DESTINATION (TREE_OPERAND (expr
, 1));
3249 have_then_clause_p
= true;
3252 label_true
= create_artificial_label (UNKNOWN_LOCATION
);
3253 if (TREE_OPERAND (expr
, 2) != NULL
3254 && TREE_CODE (TREE_OPERAND (expr
, 2)) == GOTO_EXPR
3255 && TREE_CODE (GOTO_DESTINATION (TREE_OPERAND (expr
, 2))) == LABEL_DECL
3256 && (DECL_CONTEXT (GOTO_DESTINATION (TREE_OPERAND (expr
, 2)))
3257 == current_function_decl
)
3258 /* For -O0 avoid this optimization if the COND_EXPR and GOTO_EXPR
3259 have different locations, otherwise we end up with incorrect
3260 location information on the branches. */
3262 || !EXPR_HAS_LOCATION (expr
)
3263 || !EXPR_HAS_LOCATION (TREE_OPERAND (expr
, 2))
3264 || EXPR_LOCATION (expr
) == EXPR_LOCATION (TREE_OPERAND (expr
, 2))))
3266 label_false
= GOTO_DESTINATION (TREE_OPERAND (expr
, 2));
3267 have_else_clause_p
= true;
3270 label_false
= create_artificial_label (UNKNOWN_LOCATION
);
3272 gimple_cond_get_ops_from_tree (COND_EXPR_COND (expr
), &pred_code
, &arm1
,
3275 gimple_cond
= gimple_build_cond (pred_code
, arm1
, arm2
, label_true
,
3278 gimplify_seq_add_stmt (&seq
, gimple_cond
);
3279 label_cont
= NULL_TREE
;
3280 if (!have_then_clause_p
)
3282 /* For if (...) {} else { code; } put label_true after
3284 if (TREE_OPERAND (expr
, 1) == NULL_TREE
3285 && !have_else_clause_p
3286 && TREE_OPERAND (expr
, 2) != NULL_TREE
)
3287 label_cont
= label_true
;
3290 gimplify_seq_add_stmt (&seq
, gimple_build_label (label_true
));
3291 have_then_clause_p
= gimplify_stmt (&TREE_OPERAND (expr
, 1), &seq
);
3292 /* For if (...) { code; } else {} or
3293 if (...) { code; } else goto label; or
3294 if (...) { code; return; } else { ... }
3295 label_cont isn't needed. */
3296 if (!have_else_clause_p
3297 && TREE_OPERAND (expr
, 2) != NULL_TREE
3298 && gimple_seq_may_fallthru (seq
))
3301 label_cont
= create_artificial_label (UNKNOWN_LOCATION
);
3303 g
= gimple_build_goto (label_cont
);
3305 /* GIMPLE_COND's are very low level; they have embedded
3306 gotos. This particular embedded goto should not be marked
3307 with the location of the original COND_EXPR, as it would
3308 correspond to the COND_EXPR's condition, not the ELSE or the
3309 THEN arms. To avoid marking it with the wrong location, flag
3310 it as "no location". */
3311 gimple_set_do_not_emit_location (g
);
3313 gimplify_seq_add_stmt (&seq
, g
);
3317 if (!have_else_clause_p
)
3319 gimplify_seq_add_stmt (&seq
, gimple_build_label (label_false
));
3320 have_else_clause_p
= gimplify_stmt (&TREE_OPERAND (expr
, 2), &seq
);
3323 gimplify_seq_add_stmt (&seq
, gimple_build_label (label_cont
));
3325 gimple_pop_condition (pre_p
);
3326 gimple_seq_add_seq (pre_p
, seq
);
3328 if (ret
== GS_ERROR
)
3330 else if (have_then_clause_p
|| have_else_clause_p
)
3334 /* Both arms are empty; replace the COND_EXPR with its predicate. */
3335 expr
= TREE_OPERAND (expr
, 0);
3336 gimplify_stmt (&expr
, pre_p
);
3343 /* Prepare the node pointed to by EXPR_P, an is_gimple_addressable expression,
3344 to be marked addressable.
3346 We cannot rely on such an expression being directly markable if a temporary
3347 has been created by the gimplification. In this case, we create another
3348 temporary and initialize it with a copy, which will become a store after we
3349 mark it addressable. This can happen if the front-end passed us something
3350 that it could not mark addressable yet, like a Fortran pass-by-reference
3351 parameter (int) floatvar. */
3354 prepare_gimple_addressable (tree
*expr_p
, gimple_seq
*seq_p
)
3356 while (handled_component_p (*expr_p
))
3357 expr_p
= &TREE_OPERAND (*expr_p
, 0);
3358 if (is_gimple_reg (*expr_p
))
3359 *expr_p
= get_initialized_tmp_var (*expr_p
, seq_p
, NULL
);
3362 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3363 a call to __builtin_memcpy. */
3365 static enum gimplify_status
3366 gimplify_modify_expr_to_memcpy (tree
*expr_p
, tree size
, bool want_value
,
3369 tree t
, to
, to_ptr
, from
, from_ptr
;
3371 location_t loc
= EXPR_LOCATION (*expr_p
);
3373 to
= TREE_OPERAND (*expr_p
, 0);
3374 from
= TREE_OPERAND (*expr_p
, 1);
3376 /* Mark the RHS addressable. Beware that it may not be possible to do so
3377 directly if a temporary has been created by the gimplification. */
3378 prepare_gimple_addressable (&from
, seq_p
);
3380 mark_addressable (from
);
3381 from_ptr
= build_fold_addr_expr_loc (loc
, from
);
3382 gimplify_arg (&from_ptr
, seq_p
, loc
);
3384 mark_addressable (to
);
3385 to_ptr
= build_fold_addr_expr_loc (loc
, to
);
3386 gimplify_arg (&to_ptr
, seq_p
, loc
);
3388 t
= builtin_decl_implicit (BUILT_IN_MEMCPY
);
3390 gs
= gimple_build_call (t
, 3, to_ptr
, from_ptr
, size
);
3394 /* tmp = memcpy() */
3395 t
= create_tmp_var (TREE_TYPE (to_ptr
), NULL
);
3396 gimple_call_set_lhs (gs
, t
);
3397 gimplify_seq_add_stmt (seq_p
, gs
);
3399 *expr_p
= build_simple_mem_ref (t
);
3403 gimplify_seq_add_stmt (seq_p
, gs
);
3408 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
3409 a call to __builtin_memset. In this case we know that the RHS is
3410 a CONSTRUCTOR with an empty element list. */
3412 static enum gimplify_status
3413 gimplify_modify_expr_to_memset (tree
*expr_p
, tree size
, bool want_value
,
3416 tree t
, from
, to
, to_ptr
;
3418 location_t loc
= EXPR_LOCATION (*expr_p
);
3420 /* Assert our assumptions, to abort instead of producing wrong code
3421 silently if they are not met. Beware that the RHS CONSTRUCTOR might
3422 not be immediately exposed. */
3423 from
= TREE_OPERAND (*expr_p
, 1);
3424 if (TREE_CODE (from
) == WITH_SIZE_EXPR
)
3425 from
= TREE_OPERAND (from
, 0);
3427 gcc_assert (TREE_CODE (from
) == CONSTRUCTOR
3428 && VEC_empty (constructor_elt
, CONSTRUCTOR_ELTS (from
)));
3431 to
= TREE_OPERAND (*expr_p
, 0);
3433 to_ptr
= build_fold_addr_expr_loc (loc
, to
);
3434 gimplify_arg (&to_ptr
, seq_p
, loc
);
3435 t
= builtin_decl_implicit (BUILT_IN_MEMSET
);
3437 gs
= gimple_build_call (t
, 3, to_ptr
, integer_zero_node
, size
);
3441 /* tmp = memset() */
3442 t
= create_tmp_var (TREE_TYPE (to_ptr
), NULL
);
3443 gimple_call_set_lhs (gs
, t
);
3444 gimplify_seq_add_stmt (seq_p
, gs
);
3446 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
3450 gimplify_seq_add_stmt (seq_p
, gs
);
3455 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
3456 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
3457 assignment. Return non-null if we detect a potential overlap. */
3459 struct gimplify_init_ctor_preeval_data
3461 /* The base decl of the lhs object. May be NULL, in which case we
3462 have to assume the lhs is indirect. */
3465 /* The alias set of the lhs object. */
3466 alias_set_type lhs_alias_set
;
3470 gimplify_init_ctor_preeval_1 (tree
*tp
, int *walk_subtrees
, void *xdata
)
3472 struct gimplify_init_ctor_preeval_data
*data
3473 = (struct gimplify_init_ctor_preeval_data
*) xdata
;
3476 /* If we find the base object, obviously we have overlap. */
3477 if (data
->lhs_base_decl
== t
)
3480 /* If the constructor component is indirect, determine if we have a
3481 potential overlap with the lhs. The only bits of information we
3482 have to go on at this point are addressability and alias sets. */
3483 if ((INDIRECT_REF_P (t
)
3484 || TREE_CODE (t
) == MEM_REF
)
3485 && (!data
->lhs_base_decl
|| TREE_ADDRESSABLE (data
->lhs_base_decl
))
3486 && alias_sets_conflict_p (data
->lhs_alias_set
, get_alias_set (t
)))
3489 /* If the constructor component is a call, determine if it can hide a
3490 potential overlap with the lhs through an INDIRECT_REF like above.
3491 ??? Ugh - this is completely broken. In fact this whole analysis
3492 doesn't look conservative. */
3493 if (TREE_CODE (t
) == CALL_EXPR
)
3495 tree type
, fntype
= TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (t
)));
3497 for (type
= TYPE_ARG_TYPES (fntype
); type
; type
= TREE_CHAIN (type
))
3498 if (POINTER_TYPE_P (TREE_VALUE (type
))
3499 && (!data
->lhs_base_decl
|| TREE_ADDRESSABLE (data
->lhs_base_decl
))
3500 && alias_sets_conflict_p (data
->lhs_alias_set
,
3502 (TREE_TYPE (TREE_VALUE (type
)))))
3506 if (IS_TYPE_OR_DECL_P (t
))
3511 /* A subroutine of gimplify_init_constructor. Pre-evaluate EXPR,
3512 force values that overlap with the lhs (as described by *DATA)
3513 into temporaries. */
3516 gimplify_init_ctor_preeval (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
3517 struct gimplify_init_ctor_preeval_data
*data
)
3519 enum gimplify_status one
;
3521 /* If the value is constant, then there's nothing to pre-evaluate. */
3522 if (TREE_CONSTANT (*expr_p
))
3524 /* Ensure it does not have side effects, it might contain a reference to
3525 the object we're initializing. */
3526 gcc_assert (!TREE_SIDE_EFFECTS (*expr_p
));
3530 /* If the type has non-trivial constructors, we can't pre-evaluate. */
3531 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p
)))
3534 /* Recurse for nested constructors. */
3535 if (TREE_CODE (*expr_p
) == CONSTRUCTOR
)
3537 unsigned HOST_WIDE_INT ix
;
3538 constructor_elt
*ce
;
3539 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (*expr_p
);
3541 FOR_EACH_VEC_ELT (constructor_elt
, v
, ix
, ce
)
3542 gimplify_init_ctor_preeval (&ce
->value
, pre_p
, post_p
, data
);
3547 /* If this is a variable sized type, we must remember the size. */
3548 maybe_with_size_expr (expr_p
);
3550 /* Gimplify the constructor element to something appropriate for the rhs
3551 of a MODIFY_EXPR. Given that we know the LHS is an aggregate, we know
3552 the gimplifier will consider this a store to memory. Doing this
3553 gimplification now means that we won't have to deal with complicated
3554 language-specific trees, nor trees like SAVE_EXPR that can induce
3555 exponential search behavior. */
3556 one
= gimplify_expr (expr_p
, pre_p
, post_p
, is_gimple_mem_rhs
, fb_rvalue
);
3557 if (one
== GS_ERROR
)
3563 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
3564 with the lhs, since "a = { .x=a }" doesn't make sense. This will
3565 always be true for all scalars, since is_gimple_mem_rhs insists on a
3566 temporary variable for them. */
3567 if (DECL_P (*expr_p
))
3570 /* If this is of variable size, we have no choice but to assume it doesn't
3571 overlap since we can't make a temporary for it. */
3572 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (*expr_p
))) != INTEGER_CST
)
3575 /* Otherwise, we must search for overlap ... */
3576 if (!walk_tree (expr_p
, gimplify_init_ctor_preeval_1
, data
, NULL
))
3579 /* ... and if found, force the value into a temporary. */
3580 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
3583 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
3584 a RANGE_EXPR in a CONSTRUCTOR for an array.
3588 object[var] = value;
3595 We increment var _after_ the loop exit check because we might otherwise
3596 fail if upper == TYPE_MAX_VALUE (type for upper).
3598 Note that we never have to deal with SAVE_EXPRs here, because this has
3599 already been taken care of for us, in gimplify_init_ctor_preeval(). */
3601 static void gimplify_init_ctor_eval (tree
, VEC(constructor_elt
,gc
) *,
3602 gimple_seq
*, bool);
3605 gimplify_init_ctor_eval_range (tree object
, tree lower
, tree upper
,
3606 tree value
, tree array_elt_type
,
3607 gimple_seq
*pre_p
, bool cleared
)
3609 tree loop_entry_label
, loop_exit_label
, fall_thru_label
;
3610 tree var
, var_type
, cref
, tmp
;
3612 loop_entry_label
= create_artificial_label (UNKNOWN_LOCATION
);
3613 loop_exit_label
= create_artificial_label (UNKNOWN_LOCATION
);
3614 fall_thru_label
= create_artificial_label (UNKNOWN_LOCATION
);
3616 /* Create and initialize the index variable. */
3617 var_type
= TREE_TYPE (upper
);
3618 var
= create_tmp_var (var_type
, NULL
);
3619 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (var
, lower
));
3621 /* Add the loop entry label. */
3622 gimplify_seq_add_stmt (pre_p
, gimple_build_label (loop_entry_label
));
3624 /* Build the reference. */
3625 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
3626 var
, NULL_TREE
, NULL_TREE
);
3628 /* If we are a constructor, just call gimplify_init_ctor_eval to do
3629 the store. Otherwise just assign value to the reference. */
3631 if (TREE_CODE (value
) == CONSTRUCTOR
)
3632 /* NB we might have to call ourself recursively through
3633 gimplify_init_ctor_eval if the value is a constructor. */
3634 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
3637 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (cref
, value
));
3639 /* We exit the loop when the index var is equal to the upper bound. */
3640 gimplify_seq_add_stmt (pre_p
,
3641 gimple_build_cond (EQ_EXPR
, var
, upper
,
3642 loop_exit_label
, fall_thru_label
));
3644 gimplify_seq_add_stmt (pre_p
, gimple_build_label (fall_thru_label
));
3646 /* Otherwise, increment the index var... */
3647 tmp
= build2 (PLUS_EXPR
, var_type
, var
,
3648 fold_convert (var_type
, integer_one_node
));
3649 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (var
, tmp
));
3651 /* ...and jump back to the loop entry. */
3652 gimplify_seq_add_stmt (pre_p
, gimple_build_goto (loop_entry_label
));
3654 /* Add the loop exit label. */
3655 gimplify_seq_add_stmt (pre_p
, gimple_build_label (loop_exit_label
));
3658 /* Return true if FDECL is accessing a field that is zero sized. */
3661 zero_sized_field_decl (const_tree fdecl
)
3663 if (TREE_CODE (fdecl
) == FIELD_DECL
&& DECL_SIZE (fdecl
)
3664 && integer_zerop (DECL_SIZE (fdecl
)))
3669 /* Return true if TYPE is zero sized. */
3672 zero_sized_type (const_tree type
)
3674 if (AGGREGATE_TYPE_P (type
) && TYPE_SIZE (type
)
3675 && integer_zerop (TYPE_SIZE (type
)))
3680 /* A subroutine of gimplify_init_constructor. Generate individual
3681 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
3682 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
3683 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
3687 gimplify_init_ctor_eval (tree object
, VEC(constructor_elt
,gc
) *elts
,
3688 gimple_seq
*pre_p
, bool cleared
)
3690 tree array_elt_type
= NULL
;
3691 unsigned HOST_WIDE_INT ix
;
3692 tree purpose
, value
;
3694 if (TREE_CODE (TREE_TYPE (object
)) == ARRAY_TYPE
)
3695 array_elt_type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object
)));
3697 FOR_EACH_CONSTRUCTOR_ELT (elts
, ix
, purpose
, value
)
3701 /* NULL values are created above for gimplification errors. */
3705 if (cleared
&& initializer_zerop (value
))
3708 /* ??? Here's to hoping the front end fills in all of the indices,
3709 so we don't have to figure out what's missing ourselves. */
3710 gcc_assert (purpose
);
3712 /* Skip zero-sized fields, unless value has side-effects. This can
3713 happen with calls to functions returning a zero-sized type, which
3714 we shouldn't discard. As a number of downstream passes don't
3715 expect sets of zero-sized fields, we rely on the gimplification of
3716 the MODIFY_EXPR we make below to drop the assignment statement. */
3717 if (! TREE_SIDE_EFFECTS (value
) && zero_sized_field_decl (purpose
))
3720 /* If we have a RANGE_EXPR, we have to build a loop to assign the
3722 if (TREE_CODE (purpose
) == RANGE_EXPR
)
3724 tree lower
= TREE_OPERAND (purpose
, 0);
3725 tree upper
= TREE_OPERAND (purpose
, 1);
3727 /* If the lower bound is equal to upper, just treat it as if
3728 upper was the index. */
3729 if (simple_cst_equal (lower
, upper
))
3733 gimplify_init_ctor_eval_range (object
, lower
, upper
, value
,
3734 array_elt_type
, pre_p
, cleared
);
3741 /* Do not use bitsizetype for ARRAY_REF indices. */
3742 if (TYPE_DOMAIN (TREE_TYPE (object
)))
3744 = fold_convert (TREE_TYPE (TYPE_DOMAIN (TREE_TYPE (object
))),
3746 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
3747 purpose
, NULL_TREE
, NULL_TREE
);
3751 gcc_assert (TREE_CODE (purpose
) == FIELD_DECL
);
3752 cref
= build3 (COMPONENT_REF
, TREE_TYPE (purpose
),
3753 unshare_expr (object
), purpose
, NULL_TREE
);
3756 if (TREE_CODE (value
) == CONSTRUCTOR
3757 && TREE_CODE (TREE_TYPE (value
)) != VECTOR_TYPE
)
3758 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
3762 tree init
= build2 (INIT_EXPR
, TREE_TYPE (cref
), cref
, value
);
3763 gimplify_and_add (init
, pre_p
);
3769 /* Return the appropriate RHS predicate for this LHS. */
3772 rhs_predicate_for (tree lhs
)
3774 if (is_gimple_reg (lhs
))
3775 return is_gimple_reg_rhs_or_call
;
3777 return is_gimple_mem_rhs_or_call
;
3780 /* Gimplify a C99 compound literal expression. This just means adding
3781 the DECL_EXPR before the current statement and using its anonymous
3784 static enum gimplify_status
3785 gimplify_compound_literal_expr (tree
*expr_p
, gimple_seq
*pre_p
,
3786 bool (*gimple_test_f
) (tree
),
3787 fallback_t fallback
)
3789 tree decl_s
= COMPOUND_LITERAL_EXPR_DECL_EXPR (*expr_p
);
3790 tree decl
= DECL_EXPR_DECL (decl_s
);
3791 tree init
= DECL_INITIAL (decl
);
3792 /* Mark the decl as addressable if the compound literal
3793 expression is addressable now, otherwise it is marked too late
3794 after we gimplify the initialization expression. */
3795 if (TREE_ADDRESSABLE (*expr_p
))
3796 TREE_ADDRESSABLE (decl
) = 1;
3797 /* Otherwise, if we don't need an lvalue and have a literal directly
3798 substitute it. Check if it matches the gimple predicate, as
3799 otherwise we'd generate a new temporary, and we can as well just
3800 use the decl we already have. */
3801 else if (!TREE_ADDRESSABLE (decl
)
3803 && (fallback
& fb_lvalue
) == 0
3804 && gimple_test_f (init
))
3810 /* Preliminarily mark non-addressed complex variables as eligible
3811 for promotion to gimple registers. We'll transform their uses
3813 if ((TREE_CODE (TREE_TYPE (decl
)) == COMPLEX_TYPE
3814 || TREE_CODE (TREE_TYPE (decl
)) == VECTOR_TYPE
)
3815 && !TREE_THIS_VOLATILE (decl
)
3816 && !needs_to_live_in_memory (decl
))
3817 DECL_GIMPLE_REG_P (decl
) = 1;
3819 /* If the decl is not addressable, then it is being used in some
3820 expression or on the right hand side of a statement, and it can
3821 be put into a readonly data section. */
3822 if (!TREE_ADDRESSABLE (decl
) && (fallback
& fb_lvalue
) == 0)
3823 TREE_READONLY (decl
) = 1;
3825 /* This decl isn't mentioned in the enclosing block, so add it to the
3826 list of temps. FIXME it seems a bit of a kludge to say that
3827 anonymous artificial vars aren't pushed, but everything else is. */
3828 if (DECL_NAME (decl
) == NULL_TREE
&& !DECL_SEEN_IN_BIND_EXPR_P (decl
))
3829 gimple_add_tmp_var (decl
);
3831 gimplify_and_add (decl_s
, pre_p
);
3836 /* Optimize embedded COMPOUND_LITERAL_EXPRs within a CONSTRUCTOR,
3837 return a new CONSTRUCTOR if something changed. */
3840 optimize_compound_literals_in_ctor (tree orig_ctor
)
3842 tree ctor
= orig_ctor
;
3843 VEC(constructor_elt
,gc
) *elts
= CONSTRUCTOR_ELTS (ctor
);
3844 unsigned int idx
, num
= VEC_length (constructor_elt
, elts
);
3846 for (idx
= 0; idx
< num
; idx
++)
3848 tree value
= VEC_index (constructor_elt
, elts
, idx
).value
;
3849 tree newval
= value
;
3850 if (TREE_CODE (value
) == CONSTRUCTOR
)
3851 newval
= optimize_compound_literals_in_ctor (value
);
3852 else if (TREE_CODE (value
) == COMPOUND_LITERAL_EXPR
)
3854 tree decl_s
= COMPOUND_LITERAL_EXPR_DECL_EXPR (value
);
3855 tree decl
= DECL_EXPR_DECL (decl_s
);
3856 tree init
= DECL_INITIAL (decl
);
3858 if (!TREE_ADDRESSABLE (value
)
3859 && !TREE_ADDRESSABLE (decl
)
3861 && TREE_CODE (init
) == CONSTRUCTOR
)
3862 newval
= optimize_compound_literals_in_ctor (init
);
3864 if (newval
== value
)
3867 if (ctor
== orig_ctor
)
3869 ctor
= copy_node (orig_ctor
);
3870 CONSTRUCTOR_ELTS (ctor
) = VEC_copy (constructor_elt
, gc
, elts
);
3871 elts
= CONSTRUCTOR_ELTS (ctor
);
3873 VEC_index (constructor_elt
, elts
, idx
).value
= newval
;
3878 /* A subroutine of gimplify_modify_expr. Break out elements of a
3879 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
3881 Note that we still need to clear any elements that don't have explicit
3882 initializers, so if not all elements are initialized we keep the
3883 original MODIFY_EXPR, we just remove all of the constructor elements.
3885 If NOTIFY_TEMP_CREATION is true, do not gimplify, just return
3886 GS_ERROR if we would have to create a temporary when gimplifying
3887 this constructor. Otherwise, return GS_OK.
3889 If NOTIFY_TEMP_CREATION is false, just do the gimplification. */
3891 static enum gimplify_status
3892 gimplify_init_constructor (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
3893 bool want_value
, bool notify_temp_creation
)
3895 tree object
, ctor
, type
;
3896 enum gimplify_status ret
;
3897 VEC(constructor_elt
,gc
) *elts
;
3899 gcc_assert (TREE_CODE (TREE_OPERAND (*expr_p
, 1)) == CONSTRUCTOR
);
3901 if (!notify_temp_creation
)
3903 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
3904 is_gimple_lvalue
, fb_lvalue
);
3905 if (ret
== GS_ERROR
)
3909 object
= TREE_OPERAND (*expr_p
, 0);
3910 ctor
= TREE_OPERAND (*expr_p
, 1) =
3911 optimize_compound_literals_in_ctor (TREE_OPERAND (*expr_p
, 1));
3912 type
= TREE_TYPE (ctor
);
3913 elts
= CONSTRUCTOR_ELTS (ctor
);
3916 switch (TREE_CODE (type
))
3920 case QUAL_UNION_TYPE
:
3923 struct gimplify_init_ctor_preeval_data preeval_data
;
3924 HOST_WIDE_INT num_ctor_elements
, num_nonzero_elements
;
3925 bool cleared
, complete_p
, valid_const_initializer
;
3927 /* Aggregate types must lower constructors to initialization of
3928 individual elements. The exception is that a CONSTRUCTOR node
3929 with no elements indicates zero-initialization of the whole. */
3930 if (VEC_empty (constructor_elt
, elts
))
3932 if (notify_temp_creation
)
3937 /* Fetch information about the constructor to direct later processing.
3938 We might want to make static versions of it in various cases, and
3939 can only do so if it known to be a valid constant initializer. */
3940 valid_const_initializer
3941 = categorize_ctor_elements (ctor
, &num_nonzero_elements
,
3942 &num_ctor_elements
, &complete_p
);
3944 /* If a const aggregate variable is being initialized, then it
3945 should never be a lose to promote the variable to be static. */
3946 if (valid_const_initializer
3947 && num_nonzero_elements
> 1
3948 && TREE_READONLY (object
)
3949 && TREE_CODE (object
) == VAR_DECL
3950 && (flag_merge_constants
>= 2 || !TREE_ADDRESSABLE (object
)))
3952 if (notify_temp_creation
)
3954 DECL_INITIAL (object
) = ctor
;
3955 TREE_STATIC (object
) = 1;
3956 if (!DECL_NAME (object
))
3957 DECL_NAME (object
) = create_tmp_var_name ("C");
3958 walk_tree (&DECL_INITIAL (object
), force_labels_r
, NULL
, NULL
);
3960 /* ??? C++ doesn't automatically append a .<number> to the
3961 assembler name, and even when it does, it looks at FE private
3962 data structures to figure out what that number should be,
3963 which are not set for this variable. I suppose this is
3964 important for local statics for inline functions, which aren't
3965 "local" in the object file sense. So in order to get a unique
3966 TU-local symbol, we must invoke the lhd version now. */
3967 lhd_set_decl_assembler_name (object
);
3969 *expr_p
= NULL_TREE
;
3973 /* If there are "lots" of initialized elements, even discounting
3974 those that are not address constants (and thus *must* be
3975 computed at runtime), then partition the constructor into
3976 constant and non-constant parts. Block copy the constant
3977 parts in, then generate code for the non-constant parts. */
3978 /* TODO. There's code in cp/typeck.c to do this. */
3980 if (int_size_in_bytes (TREE_TYPE (ctor
)) < 0)
3981 /* store_constructor will ignore the clearing of variable-sized
3982 objects. Initializers for such objects must explicitly set
3983 every field that needs to be set. */
3985 else if (!complete_p
)
3986 /* If the constructor isn't complete, clear the whole object
3989 ??? This ought not to be needed. For any element not present
3990 in the initializer, we should simply set them to zero. Except
3991 we'd need to *find* the elements that are not present, and that
3992 requires trickery to avoid quadratic compile-time behavior in
3993 large cases or excessive memory use in small cases. */
3995 else if (num_ctor_elements
- num_nonzero_elements
3996 > CLEAR_RATIO (optimize_function_for_speed_p (cfun
))
3997 && num_nonzero_elements
< num_ctor_elements
/ 4)
3998 /* If there are "lots" of zeros, it's more efficient to clear
3999 the memory and then set the nonzero elements. */
4004 /* If there are "lots" of initialized elements, and all of them
4005 are valid address constants, then the entire initializer can
4006 be dropped to memory, and then memcpy'd out. Don't do this
4007 for sparse arrays, though, as it's more efficient to follow
4008 the standard CONSTRUCTOR behavior of memset followed by
4009 individual element initialization. Also don't do this for small
4010 all-zero initializers (which aren't big enough to merit
4011 clearing), and don't try to make bitwise copies of
4012 TREE_ADDRESSABLE types. */
4013 if (valid_const_initializer
4014 && !(cleared
|| num_nonzero_elements
== 0)
4015 && !TREE_ADDRESSABLE (type
))
4017 HOST_WIDE_INT size
= int_size_in_bytes (type
);
4020 /* ??? We can still get unbounded array types, at least
4021 from the C++ front end. This seems wrong, but attempt
4022 to work around it for now. */
4025 size
= int_size_in_bytes (TREE_TYPE (object
));
4027 TREE_TYPE (ctor
) = type
= TREE_TYPE (object
);
4030 /* Find the maximum alignment we can assume for the object. */
4031 /* ??? Make use of DECL_OFFSET_ALIGN. */
4032 if (DECL_P (object
))
4033 align
= DECL_ALIGN (object
);
4035 align
= TYPE_ALIGN (type
);
4037 /* Do a block move either if the size is so small as to make
4038 each individual move a sub-unit move on average, or if it
4039 is so large as to make individual moves inefficient. */
4041 && num_nonzero_elements
> 1
4042 && (size
< num_nonzero_elements
4043 || !can_move_by_pieces (size
, align
)))
4045 if (notify_temp_creation
)
4048 walk_tree (&ctor
, force_labels_r
, NULL
, NULL
);
4049 ctor
= tree_output_constant_def (ctor
);
4050 if (!useless_type_conversion_p (type
, TREE_TYPE (ctor
)))
4051 ctor
= build1 (VIEW_CONVERT_EXPR
, type
, ctor
);
4052 TREE_OPERAND (*expr_p
, 1) = ctor
;
4054 /* This is no longer an assignment of a CONSTRUCTOR, but
4055 we still may have processing to do on the LHS. So
4056 pretend we didn't do anything here to let that happen. */
4057 return GS_UNHANDLED
;
4061 /* If the target is volatile, we have non-zero elements and more than
4062 one field to assign, initialize the target from a temporary. */
4063 if (TREE_THIS_VOLATILE (object
)
4064 && !TREE_ADDRESSABLE (type
)
4065 && num_nonzero_elements
> 0
4066 && VEC_length (constructor_elt
, elts
) > 1)
4068 tree temp
= create_tmp_var (TYPE_MAIN_VARIANT (type
), NULL
);
4069 TREE_OPERAND (*expr_p
, 0) = temp
;
4070 *expr_p
= build2 (COMPOUND_EXPR
, TREE_TYPE (*expr_p
),
4072 build2 (MODIFY_EXPR
, void_type_node
,
4077 if (notify_temp_creation
)
4080 /* If there are nonzero elements and if needed, pre-evaluate to capture
4081 elements overlapping with the lhs into temporaries. We must do this
4082 before clearing to fetch the values before they are zeroed-out. */
4083 if (num_nonzero_elements
> 0 && TREE_CODE (*expr_p
) != INIT_EXPR
)
4085 preeval_data
.lhs_base_decl
= get_base_address (object
);
4086 if (!DECL_P (preeval_data
.lhs_base_decl
))
4087 preeval_data
.lhs_base_decl
= NULL
;
4088 preeval_data
.lhs_alias_set
= get_alias_set (object
);
4090 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p
, 1),
4091 pre_p
, post_p
, &preeval_data
);
4096 /* Zap the CONSTRUCTOR element list, which simplifies this case.
4097 Note that we still have to gimplify, in order to handle the
4098 case of variable sized types. Avoid shared tree structures. */
4099 CONSTRUCTOR_ELTS (ctor
) = NULL
;
4100 TREE_SIDE_EFFECTS (ctor
) = 0;
4101 object
= unshare_expr (object
);
4102 gimplify_stmt (expr_p
, pre_p
);
4105 /* If we have not block cleared the object, or if there are nonzero
4106 elements in the constructor, add assignments to the individual
4107 scalar fields of the object. */
4108 if (!cleared
|| num_nonzero_elements
> 0)
4109 gimplify_init_ctor_eval (object
, elts
, pre_p
, cleared
);
4111 *expr_p
= NULL_TREE
;
4119 if (notify_temp_creation
)
4122 /* Extract the real and imaginary parts out of the ctor. */
4123 gcc_assert (VEC_length (constructor_elt
, elts
) == 2);
4124 r
= VEC_index (constructor_elt
, elts
, 0).value
;
4125 i
= VEC_index (constructor_elt
, elts
, 1).value
;
4126 if (r
== NULL
|| i
== NULL
)
4128 tree zero
= build_zero_cst (TREE_TYPE (type
));
4135 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
4136 represent creation of a complex value. */
4137 if (TREE_CONSTANT (r
) && TREE_CONSTANT (i
))
4139 ctor
= build_complex (type
, r
, i
);
4140 TREE_OPERAND (*expr_p
, 1) = ctor
;
4144 ctor
= build2 (COMPLEX_EXPR
, type
, r
, i
);
4145 TREE_OPERAND (*expr_p
, 1) = ctor
;
4146 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1),
4149 rhs_predicate_for (TREE_OPERAND (*expr_p
, 0)),
4157 unsigned HOST_WIDE_INT ix
;
4158 constructor_elt
*ce
;
4160 if (notify_temp_creation
)
4163 /* Go ahead and simplify constant constructors to VECTOR_CST. */
4164 if (TREE_CONSTANT (ctor
))
4166 bool constant_p
= true;
4169 /* Even when ctor is constant, it might contain non-*_CST
4170 elements, such as addresses or trapping values like
4171 1.0/0.0 - 1.0/0.0. Such expressions don't belong
4172 in VECTOR_CST nodes. */
4173 FOR_EACH_CONSTRUCTOR_VALUE (elts
, ix
, value
)
4174 if (!CONSTANT_CLASS_P (value
))
4182 TREE_OPERAND (*expr_p
, 1) = build_vector_from_ctor (type
, elts
);
4186 /* Don't reduce an initializer constant even if we can't
4187 make a VECTOR_CST. It won't do anything for us, and it'll
4188 prevent us from representing it as a single constant. */
4189 if (initializer_constant_valid_p (ctor
, type
))
4192 TREE_CONSTANT (ctor
) = 0;
4195 /* Vector types use CONSTRUCTOR all the way through gimple
4196 compilation as a general initializer. */
4197 FOR_EACH_VEC_ELT (constructor_elt
, elts
, ix
, ce
)
4199 enum gimplify_status tret
;
4200 tret
= gimplify_expr (&ce
->value
, pre_p
, post_p
, is_gimple_val
,
4202 if (tret
== GS_ERROR
)
4205 if (!is_gimple_reg (TREE_OPERAND (*expr_p
, 0)))
4206 TREE_OPERAND (*expr_p
, 1) = get_formal_tmp_var (ctor
, pre_p
);
4211 /* So how did we get a CONSTRUCTOR for a scalar type? */
4215 if (ret
== GS_ERROR
)
4217 else if (want_value
)
4224 /* If we have gimplified both sides of the initializer but have
4225 not emitted an assignment, do so now. */
4228 tree lhs
= TREE_OPERAND (*expr_p
, 0);
4229 tree rhs
= TREE_OPERAND (*expr_p
, 1);
4230 gimple init
= gimple_build_assign (lhs
, rhs
);
4231 gimplify_seq_add_stmt (pre_p
, init
);
4239 /* Given a pointer value OP0, return a simplified version of an
4240 indirection through OP0, or NULL_TREE if no simplification is
4241 possible. Note that the resulting type may be different from
4242 the type pointed to in the sense that it is still compatible
4243 from the langhooks point of view. */
4246 gimple_fold_indirect_ref (tree t
)
4248 tree ptype
= TREE_TYPE (t
), type
= TREE_TYPE (ptype
);
4253 subtype
= TREE_TYPE (sub
);
4254 if (!POINTER_TYPE_P (subtype
))
4257 if (TREE_CODE (sub
) == ADDR_EXPR
)
4259 tree op
= TREE_OPERAND (sub
, 0);
4260 tree optype
= TREE_TYPE (op
);
4262 if (useless_type_conversion_p (type
, optype
))
4265 /* *(foo *)&fooarray => fooarray[0] */
4266 if (TREE_CODE (optype
) == ARRAY_TYPE
4267 && TREE_CODE (TYPE_SIZE (TREE_TYPE (optype
))) == INTEGER_CST
4268 && useless_type_conversion_p (type
, TREE_TYPE (optype
)))
4270 tree type_domain
= TYPE_DOMAIN (optype
);
4271 tree min_val
= size_zero_node
;
4272 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
4273 min_val
= TYPE_MIN_VALUE (type_domain
);
4274 if (TREE_CODE (min_val
) == INTEGER_CST
)
4275 return build4 (ARRAY_REF
, type
, op
, min_val
, NULL_TREE
, NULL_TREE
);
4277 /* *(foo *)&complexfoo => __real__ complexfoo */
4278 else if (TREE_CODE (optype
) == COMPLEX_TYPE
4279 && useless_type_conversion_p (type
, TREE_TYPE (optype
)))
4280 return fold_build1 (REALPART_EXPR
, type
, op
);
4281 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
4282 else if (TREE_CODE (optype
) == VECTOR_TYPE
4283 && useless_type_conversion_p (type
, TREE_TYPE (optype
)))
4285 tree part_width
= TYPE_SIZE (type
);
4286 tree index
= bitsize_int (0);
4287 return fold_build3 (BIT_FIELD_REF
, type
, op
, part_width
, index
);
4291 /* *(p + CST) -> ... */
4292 if (TREE_CODE (sub
) == POINTER_PLUS_EXPR
4293 && TREE_CODE (TREE_OPERAND (sub
, 1)) == INTEGER_CST
)
4295 tree addr
= TREE_OPERAND (sub
, 0);
4296 tree off
= TREE_OPERAND (sub
, 1);
4300 addrtype
= TREE_TYPE (addr
);
4302 /* ((foo*)&vectorfoo)[1] -> BIT_FIELD_REF<vectorfoo,...> */
4303 if (TREE_CODE (addr
) == ADDR_EXPR
4304 && TREE_CODE (TREE_TYPE (addrtype
)) == VECTOR_TYPE
4305 && useless_type_conversion_p (type
, TREE_TYPE (TREE_TYPE (addrtype
)))
4306 && host_integerp (off
, 1))
4308 unsigned HOST_WIDE_INT offset
= tree_low_cst (off
, 1);
4309 tree part_width
= TYPE_SIZE (type
);
4310 unsigned HOST_WIDE_INT part_widthi
4311 = tree_low_cst (part_width
, 0) / BITS_PER_UNIT
;
4312 unsigned HOST_WIDE_INT indexi
= offset
* BITS_PER_UNIT
;
4313 tree index
= bitsize_int (indexi
);
4314 if (offset
/ part_widthi
4315 <= TYPE_VECTOR_SUBPARTS (TREE_TYPE (addrtype
)))
4316 return fold_build3 (BIT_FIELD_REF
, type
, TREE_OPERAND (addr
, 0),
4320 /* ((foo*)&complexfoo)[1] -> __imag__ complexfoo */
4321 if (TREE_CODE (addr
) == ADDR_EXPR
4322 && TREE_CODE (TREE_TYPE (addrtype
)) == COMPLEX_TYPE
4323 && useless_type_conversion_p (type
, TREE_TYPE (TREE_TYPE (addrtype
))))
4325 tree size
= TYPE_SIZE_UNIT (type
);
4326 if (tree_int_cst_equal (size
, off
))
4327 return fold_build1 (IMAGPART_EXPR
, type
, TREE_OPERAND (addr
, 0));
4330 /* *(p + CST) -> MEM_REF <p, CST>. */
4331 if (TREE_CODE (addr
) != ADDR_EXPR
4332 || DECL_P (TREE_OPERAND (addr
, 0)))
4333 return fold_build2 (MEM_REF
, type
,
4335 build_int_cst_wide (ptype
,
4336 TREE_INT_CST_LOW (off
),
4337 TREE_INT_CST_HIGH (off
)));
4340 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
4341 if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
4342 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (subtype
)))) == INTEGER_CST
4343 && useless_type_conversion_p (type
, TREE_TYPE (TREE_TYPE (subtype
))))
4346 tree min_val
= size_zero_node
;
4348 sub
= gimple_fold_indirect_ref (sub
);
4350 sub
= build1 (INDIRECT_REF
, TREE_TYPE (subtype
), osub
);
4351 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
4352 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
4353 min_val
= TYPE_MIN_VALUE (type_domain
);
4354 if (TREE_CODE (min_val
) == INTEGER_CST
)
4355 return build4 (ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
, NULL_TREE
);
4361 /* Given a pointer value OP0, return a simplified version of an
4362 indirection through OP0, or NULL_TREE if no simplification is
4363 possible. This may only be applied to a rhs of an expression.
4364 Note that the resulting type may be different from the type pointed
4365 to in the sense that it is still compatible from the langhooks
4369 gimple_fold_indirect_ref_rhs (tree t
)
4371 return gimple_fold_indirect_ref (t
);
4374 /* Subroutine of gimplify_modify_expr to do simplifications of
4375 MODIFY_EXPRs based on the code of the RHS. We loop for as long as
4376 something changes. */
4378 static enum gimplify_status
4379 gimplify_modify_expr_rhs (tree
*expr_p
, tree
*from_p
, tree
*to_p
,
4380 gimple_seq
*pre_p
, gimple_seq
*post_p
,
4383 enum gimplify_status ret
= GS_UNHANDLED
;
4389 switch (TREE_CODE (*from_p
))
4392 /* If we're assigning from a read-only variable initialized with
4393 a constructor, do the direct assignment from the constructor,
4394 but only if neither source nor target are volatile since this
4395 latter assignment might end up being done on a per-field basis. */
4396 if (DECL_INITIAL (*from_p
)
4397 && TREE_READONLY (*from_p
)
4398 && !TREE_THIS_VOLATILE (*from_p
)
4399 && !TREE_THIS_VOLATILE (*to_p
)
4400 && TREE_CODE (DECL_INITIAL (*from_p
)) == CONSTRUCTOR
)
4402 tree old_from
= *from_p
;
4403 enum gimplify_status subret
;
4405 /* Move the constructor into the RHS. */
4406 *from_p
= unshare_expr (DECL_INITIAL (*from_p
));
4408 /* Let's see if gimplify_init_constructor will need to put
4410 subret
= gimplify_init_constructor (expr_p
, NULL
, NULL
,
4412 if (subret
== GS_ERROR
)
4414 /* If so, revert the change. */
4426 /* If we have code like
4430 where the type of "x" is a (possibly cv-qualified variant
4431 of "A"), treat the entire expression as identical to "x".
4432 This kind of code arises in C++ when an object is bound
4433 to a const reference, and if "x" is a TARGET_EXPR we want
4434 to take advantage of the optimization below. */
4435 bool volatile_p
= TREE_THIS_VOLATILE (*from_p
);
4436 tree t
= gimple_fold_indirect_ref_rhs (TREE_OPERAND (*from_p
, 0));
4439 if (TREE_THIS_VOLATILE (t
) != volatile_p
)
4441 if (TREE_CODE_CLASS (TREE_CODE (t
)) == tcc_declaration
)
4442 t
= build_simple_mem_ref_loc (EXPR_LOCATION (*from_p
),
4443 build_fold_addr_expr (t
));
4444 if (REFERENCE_CLASS_P (t
))
4445 TREE_THIS_VOLATILE (t
) = volatile_p
;
4456 /* If we are initializing something from a TARGET_EXPR, strip the
4457 TARGET_EXPR and initialize it directly, if possible. This can't
4458 be done if the initializer is void, since that implies that the
4459 temporary is set in some non-trivial way.
4461 ??? What about code that pulls out the temp and uses it
4462 elsewhere? I think that such code never uses the TARGET_EXPR as
4463 an initializer. If I'm wrong, we'll die because the temp won't
4464 have any RTL. In that case, I guess we'll need to replace
4465 references somehow. */
4466 tree init
= TARGET_EXPR_INITIAL (*from_p
);
4469 && !VOID_TYPE_P (TREE_TYPE (init
)))
4479 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
4481 gimplify_compound_expr (from_p
, pre_p
, true);
4487 /* If we already made some changes, let the front end have a
4488 crack at this before we break it down. */
4489 if (ret
!= GS_UNHANDLED
)
4491 /* If we're initializing from a CONSTRUCTOR, break this into
4492 individual MODIFY_EXPRs. */
4493 return gimplify_init_constructor (expr_p
, pre_p
, post_p
, want_value
,
4497 /* If we're assigning to a non-register type, push the assignment
4498 down into the branches. This is mandatory for ADDRESSABLE types,
4499 since we cannot generate temporaries for such, but it saves a
4500 copy in other cases as well. */
4501 if (!is_gimple_reg_type (TREE_TYPE (*from_p
)))
4503 /* This code should mirror the code in gimplify_cond_expr. */
4504 enum tree_code code
= TREE_CODE (*expr_p
);
4505 tree cond
= *from_p
;
4506 tree result
= *to_p
;
4508 ret
= gimplify_expr (&result
, pre_p
, post_p
,
4509 is_gimple_lvalue
, fb_lvalue
);
4510 if (ret
!= GS_ERROR
)
4513 if (TREE_TYPE (TREE_OPERAND (cond
, 1)) != void_type_node
)
4514 TREE_OPERAND (cond
, 1)
4515 = build2 (code
, void_type_node
, result
,
4516 TREE_OPERAND (cond
, 1));
4517 if (TREE_TYPE (TREE_OPERAND (cond
, 2)) != void_type_node
)
4518 TREE_OPERAND (cond
, 2)
4519 = build2 (code
, void_type_node
, unshare_expr (result
),
4520 TREE_OPERAND (cond
, 2));
4522 TREE_TYPE (cond
) = void_type_node
;
4523 recalculate_side_effects (cond
);
4527 gimplify_and_add (cond
, pre_p
);
4528 *expr_p
= unshare_expr (result
);
4537 /* For calls that return in memory, give *to_p as the CALL_EXPR's
4538 return slot so that we don't generate a temporary. */
4539 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p
)
4540 && aggregate_value_p (*from_p
, *from_p
))
4544 if (!(rhs_predicate_for (*to_p
))(*from_p
))
4545 /* If we need a temporary, *to_p isn't accurate. */
4547 /* It's OK to use the return slot directly unless it's an NRV. */
4548 else if (TREE_CODE (*to_p
) == RESULT_DECL
4549 && DECL_NAME (*to_p
) == NULL_TREE
4550 && needs_to_live_in_memory (*to_p
))
4552 else if (is_gimple_reg_type (TREE_TYPE (*to_p
))
4553 || (DECL_P (*to_p
) && DECL_REGISTER (*to_p
)))
4554 /* Don't force regs into memory. */
4556 else if (TREE_CODE (*expr_p
) == INIT_EXPR
)
4557 /* It's OK to use the target directly if it's being
4560 else if (variably_modified_type_p (TREE_TYPE (*to_p
), NULL_TREE
))
4561 /* Always use the target and thus RSO for variable-sized types.
4562 GIMPLE cannot deal with a variable-sized assignment
4563 embedded in a call statement. */
4565 else if (TREE_CODE (*to_p
) != SSA_NAME
4566 && (!is_gimple_variable (*to_p
)
4567 || needs_to_live_in_memory (*to_p
)))
4568 /* Don't use the original target if it's already addressable;
4569 if its address escapes, and the called function uses the
4570 NRV optimization, a conforming program could see *to_p
4571 change before the called function returns; see c++/19317.
4572 When optimizing, the return_slot pass marks more functions
4573 as safe after we have escape info. */
4580 CALL_EXPR_RETURN_SLOT_OPT (*from_p
) = 1;
4581 mark_addressable (*to_p
);
4586 case WITH_SIZE_EXPR
:
4587 /* Likewise for calls that return an aggregate of non-constant size,
4588 since we would not be able to generate a temporary at all. */
4589 if (TREE_CODE (TREE_OPERAND (*from_p
, 0)) == CALL_EXPR
)
4591 *from_p
= TREE_OPERAND (*from_p
, 0);
4592 /* We don't change ret in this case because the
4593 WITH_SIZE_EXPR might have been added in
4594 gimplify_modify_expr, so returning GS_OK would lead to an
4600 /* If we're initializing from a container, push the initialization
4602 case CLEANUP_POINT_EXPR
:
4604 case STATEMENT_LIST
:
4606 tree wrap
= *from_p
;
4609 ret
= gimplify_expr (to_p
, pre_p
, post_p
, is_gimple_min_lval
,
4611 if (ret
!= GS_ERROR
)
4614 t
= voidify_wrapper_expr (wrap
, *expr_p
);
4615 gcc_assert (t
== *expr_p
);
4619 gimplify_and_add (wrap
, pre_p
);
4620 *expr_p
= unshare_expr (*to_p
);
4627 case COMPOUND_LITERAL_EXPR
:
4629 tree complit
= TREE_OPERAND (*expr_p
, 1);
4630 tree decl_s
= COMPOUND_LITERAL_EXPR_DECL_EXPR (complit
);
4631 tree decl
= DECL_EXPR_DECL (decl_s
);
4632 tree init
= DECL_INITIAL (decl
);
4634 /* struct T x = (struct T) { 0, 1, 2 } can be optimized
4635 into struct T x = { 0, 1, 2 } if the address of the
4636 compound literal has never been taken. */
4637 if (!TREE_ADDRESSABLE (complit
)
4638 && !TREE_ADDRESSABLE (decl
)
4641 *expr_p
= copy_node (*expr_p
);
4642 TREE_OPERAND (*expr_p
, 1) = init
;
4657 /* Return true if T looks like a valid GIMPLE statement. */
4660 is_gimple_stmt (tree t
)
4662 const enum tree_code code
= TREE_CODE (t
);
4667 /* The only valid NOP_EXPR is the empty statement. */
4668 return IS_EMPTY_STMT (t
);
4672 /* These are only valid if they're void. */
4673 return TREE_TYPE (t
) == NULL
|| VOID_TYPE_P (TREE_TYPE (t
));
4679 case CASE_LABEL_EXPR
:
4680 case TRY_CATCH_EXPR
:
4681 case TRY_FINALLY_EXPR
:
4682 case EH_FILTER_EXPR
:
4685 case STATEMENT_LIST
:
4695 /* These are always void. */
4701 /* These are valid regardless of their type. */
4710 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
4711 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
4712 DECL_GIMPLE_REG_P set.
4714 IMPORTANT NOTE: This promotion is performed by introducing a load of the
4715 other, unmodified part of the complex object just before the total store.
4716 As a consequence, if the object is still uninitialized, an undefined value
4717 will be loaded into a register, which may result in a spurious exception
4718 if the register is floating-point and the value happens to be a signaling
4719 NaN for example. Then the fully-fledged complex operations lowering pass
4720 followed by a DCE pass are necessary in order to fix things up. */
4722 static enum gimplify_status
4723 gimplify_modify_expr_complex_part (tree
*expr_p
, gimple_seq
*pre_p
,
4726 enum tree_code code
, ocode
;
4727 tree lhs
, rhs
, new_rhs
, other
, realpart
, imagpart
;
4729 lhs
= TREE_OPERAND (*expr_p
, 0);
4730 rhs
= TREE_OPERAND (*expr_p
, 1);
4731 code
= TREE_CODE (lhs
);
4732 lhs
= TREE_OPERAND (lhs
, 0);
4734 ocode
= code
== REALPART_EXPR
? IMAGPART_EXPR
: REALPART_EXPR
;
4735 other
= build1 (ocode
, TREE_TYPE (rhs
), lhs
);
4736 TREE_NO_WARNING (other
) = 1;
4737 other
= get_formal_tmp_var (other
, pre_p
);
4739 realpart
= code
== REALPART_EXPR
? rhs
: other
;
4740 imagpart
= code
== REALPART_EXPR
? other
: rhs
;
4742 if (TREE_CONSTANT (realpart
) && TREE_CONSTANT (imagpart
))
4743 new_rhs
= build_complex (TREE_TYPE (lhs
), realpart
, imagpart
);
4745 new_rhs
= build2 (COMPLEX_EXPR
, TREE_TYPE (lhs
), realpart
, imagpart
);
4747 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (lhs
, new_rhs
));
4748 *expr_p
= (want_value
) ? rhs
: NULL_TREE
;
4753 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
4759 PRE_P points to the list where side effects that must happen before
4760 *EXPR_P should be stored.
4762 POST_P points to the list where side effects that must happen after
4763 *EXPR_P should be stored.
4765 WANT_VALUE is nonzero iff we want to use the value of this expression
4766 in another expression. */
4768 static enum gimplify_status
4769 gimplify_modify_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
4772 tree
*from_p
= &TREE_OPERAND (*expr_p
, 1);
4773 tree
*to_p
= &TREE_OPERAND (*expr_p
, 0);
4774 enum gimplify_status ret
= GS_UNHANDLED
;
4776 location_t loc
= EXPR_LOCATION (*expr_p
);
4777 gimple_stmt_iterator gsi
;
4779 gcc_assert (TREE_CODE (*expr_p
) == MODIFY_EXPR
4780 || TREE_CODE (*expr_p
) == INIT_EXPR
);
4782 /* Trying to simplify a clobber using normal logic doesn't work,
4783 so handle it here. */
4784 if (TREE_CLOBBER_P (*from_p
))
4786 gcc_assert (!want_value
&& TREE_CODE (*to_p
) == VAR_DECL
);
4787 gimplify_seq_add_stmt (pre_p
, gimple_build_assign (*to_p
, *from_p
));
4792 /* Insert pointer conversions required by the middle-end that are not
4793 required by the frontend. This fixes middle-end type checking for
4794 for example gcc.dg/redecl-6.c. */
4795 if (POINTER_TYPE_P (TREE_TYPE (*to_p
)))
4797 STRIP_USELESS_TYPE_CONVERSION (*from_p
);
4798 if (!useless_type_conversion_p (TREE_TYPE (*to_p
), TREE_TYPE (*from_p
)))
4799 *from_p
= fold_convert_loc (loc
, TREE_TYPE (*to_p
), *from_p
);
4802 /* See if any simplifications can be done based on what the RHS is. */
4803 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
4805 if (ret
!= GS_UNHANDLED
)
4808 /* For zero sized types only gimplify the left hand side and right hand
4809 side as statements and throw away the assignment. Do this after
4810 gimplify_modify_expr_rhs so we handle TARGET_EXPRs of addressable
4812 if (zero_sized_type (TREE_TYPE (*from_p
)) && !want_value
)
4814 gimplify_stmt (from_p
, pre_p
);
4815 gimplify_stmt (to_p
, pre_p
);
4816 *expr_p
= NULL_TREE
;
4820 /* If the value being copied is of variable width, compute the length
4821 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
4822 before gimplifying any of the operands so that we can resolve any
4823 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
4824 the size of the expression to be copied, not of the destination, so
4825 that is what we must do here. */
4826 maybe_with_size_expr (from_p
);
4828 ret
= gimplify_expr (to_p
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
4829 if (ret
== GS_ERROR
)
4832 /* As a special case, we have to temporarily allow for assignments
4833 with a CALL_EXPR on the RHS. Since in GIMPLE a function call is
4834 a toplevel statement, when gimplifying the GENERIC expression
4835 MODIFY_EXPR <a, CALL_EXPR <foo>>, we cannot create the tuple
4836 GIMPLE_ASSIGN <a, GIMPLE_CALL <foo>>.
4838 Instead, we need to create the tuple GIMPLE_CALL <a, foo>. To
4839 prevent gimplify_expr from trying to create a new temporary for
4840 foo's LHS, we tell it that it should only gimplify until it
4841 reaches the CALL_EXPR. On return from gimplify_expr, the newly
4842 created GIMPLE_CALL <foo> will be the last statement in *PRE_P
4843 and all we need to do here is set 'a' to be its LHS. */
4844 ret
= gimplify_expr (from_p
, pre_p
, post_p
, rhs_predicate_for (*to_p
),
4846 if (ret
== GS_ERROR
)
4849 /* Now see if the above changed *from_p to something we handle specially. */
4850 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
4852 if (ret
!= GS_UNHANDLED
)
4855 /* If we've got a variable sized assignment between two lvalues (i.e. does
4856 not involve a call), then we can make things a bit more straightforward
4857 by converting the assignment to memcpy or memset. */
4858 if (TREE_CODE (*from_p
) == WITH_SIZE_EXPR
)
4860 tree from
= TREE_OPERAND (*from_p
, 0);
4861 tree size
= TREE_OPERAND (*from_p
, 1);
4863 if (TREE_CODE (from
) == CONSTRUCTOR
)
4864 return gimplify_modify_expr_to_memset (expr_p
, size
, want_value
, pre_p
);
4866 if (is_gimple_addressable (from
))
4869 return gimplify_modify_expr_to_memcpy (expr_p
, size
, want_value
,
4874 /* Transform partial stores to non-addressable complex variables into
4875 total stores. This allows us to use real instead of virtual operands
4876 for these variables, which improves optimization. */
4877 if ((TREE_CODE (*to_p
) == REALPART_EXPR
4878 || TREE_CODE (*to_p
) == IMAGPART_EXPR
)
4879 && is_gimple_reg (TREE_OPERAND (*to_p
, 0)))
4880 return gimplify_modify_expr_complex_part (expr_p
, pre_p
, want_value
);
4882 /* Try to alleviate the effects of the gimplification creating artificial
4883 temporaries (see for example is_gimple_reg_rhs) on the debug info. */
4884 if (!gimplify_ctxp
->into_ssa
4885 && TREE_CODE (*from_p
) == VAR_DECL
4886 && DECL_IGNORED_P (*from_p
)
4888 && !DECL_IGNORED_P (*to_p
))
4890 if (!DECL_NAME (*from_p
) && DECL_NAME (*to_p
))
4892 = create_tmp_var_name (IDENTIFIER_POINTER (DECL_NAME (*to_p
)));
4893 DECL_DEBUG_EXPR_IS_FROM (*from_p
) = 1;
4894 SET_DECL_DEBUG_EXPR (*from_p
, *to_p
);
4897 if (want_value
&& TREE_THIS_VOLATILE (*to_p
))
4898 *from_p
= get_initialized_tmp_var (*from_p
, pre_p
, post_p
);
4900 if (TREE_CODE (*from_p
) == CALL_EXPR
)
4902 /* Since the RHS is a CALL_EXPR, we need to create a GIMPLE_CALL
4903 instead of a GIMPLE_ASSIGN. */
4904 tree fnptrtype
= TREE_TYPE (CALL_EXPR_FN (*from_p
));
4905 CALL_EXPR_FN (*from_p
) = TREE_OPERAND (CALL_EXPR_FN (*from_p
), 0);
4906 STRIP_USELESS_TYPE_CONVERSION (CALL_EXPR_FN (*from_p
));
4907 assign
= gimple_build_call_from_tree (*from_p
);
4908 gimple_call_set_fntype (assign
, TREE_TYPE (fnptrtype
));
4909 if (!gimple_call_noreturn_p (assign
))
4910 gimple_call_set_lhs (assign
, *to_p
);
4914 assign
= gimple_build_assign (*to_p
, *from_p
);
4915 gimple_set_location (assign
, EXPR_LOCATION (*expr_p
));
4918 if (gimplify_ctxp
->into_ssa
&& is_gimple_reg (*to_p
))
4920 /* We should have got an SSA name from the start. */
4921 gcc_assert (TREE_CODE (*to_p
) == SSA_NAME
);
4924 gimplify_seq_add_stmt (pre_p
, assign
);
4925 gsi
= gsi_last (*pre_p
);
4930 *expr_p
= TREE_THIS_VOLATILE (*to_p
) ? *from_p
: unshare_expr (*to_p
);
4939 /* Gimplify a comparison between two variable-sized objects. Do this
4940 with a call to BUILT_IN_MEMCMP. */
4942 static enum gimplify_status
4943 gimplify_variable_sized_compare (tree
*expr_p
)
4945 location_t loc
= EXPR_LOCATION (*expr_p
);
4946 tree op0
= TREE_OPERAND (*expr_p
, 0);
4947 tree op1
= TREE_OPERAND (*expr_p
, 1);
4948 tree t
, arg
, dest
, src
, expr
;
4950 arg
= TYPE_SIZE_UNIT (TREE_TYPE (op0
));
4951 arg
= unshare_expr (arg
);
4952 arg
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (arg
, op0
);
4953 src
= build_fold_addr_expr_loc (loc
, op1
);
4954 dest
= build_fold_addr_expr_loc (loc
, op0
);
4955 t
= builtin_decl_implicit (BUILT_IN_MEMCMP
);
4956 t
= build_call_expr_loc (loc
, t
, 3, dest
, src
, arg
);
4959 = build2 (TREE_CODE (*expr_p
), TREE_TYPE (*expr_p
), t
, integer_zero_node
);
4960 SET_EXPR_LOCATION (expr
, loc
);
4966 /* Gimplify a comparison between two aggregate objects of integral scalar
4967 mode as a comparison between the bitwise equivalent scalar values. */
4969 static enum gimplify_status
4970 gimplify_scalar_mode_aggregate_compare (tree
*expr_p
)
4972 location_t loc
= EXPR_LOCATION (*expr_p
);
4973 tree op0
= TREE_OPERAND (*expr_p
, 0);
4974 tree op1
= TREE_OPERAND (*expr_p
, 1);
4976 tree type
= TREE_TYPE (op0
);
4977 tree scalar_type
= lang_hooks
.types
.type_for_mode (TYPE_MODE (type
), 1);
4979 op0
= fold_build1_loc (loc
, VIEW_CONVERT_EXPR
, scalar_type
, op0
);
4980 op1
= fold_build1_loc (loc
, VIEW_CONVERT_EXPR
, scalar_type
, op1
);
4983 = fold_build2_loc (loc
, TREE_CODE (*expr_p
), TREE_TYPE (*expr_p
), op0
, op1
);
4988 /* Gimplify an expression sequence. This function gimplifies each
4989 expression and rewrites the original expression with the last
4990 expression of the sequence in GIMPLE form.
4992 PRE_P points to the list where the side effects for all the
4993 expressions in the sequence will be emitted.
4995 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
4997 static enum gimplify_status
4998 gimplify_compound_expr (tree
*expr_p
, gimple_seq
*pre_p
, bool want_value
)
5004 tree
*sub_p
= &TREE_OPERAND (t
, 0);
5006 if (TREE_CODE (*sub_p
) == COMPOUND_EXPR
)
5007 gimplify_compound_expr (sub_p
, pre_p
, false);
5009 gimplify_stmt (sub_p
, pre_p
);
5011 t
= TREE_OPERAND (t
, 1);
5013 while (TREE_CODE (t
) == COMPOUND_EXPR
);
5020 gimplify_stmt (expr_p
, pre_p
);
5025 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
5026 gimplify. After gimplification, EXPR_P will point to a new temporary
5027 that holds the original value of the SAVE_EXPR node.
5029 PRE_P points to the list where side effects that must happen before
5030 *EXPR_P should be stored. */
5032 static enum gimplify_status
5033 gimplify_save_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
5035 enum gimplify_status ret
= GS_ALL_DONE
;
5038 gcc_assert (TREE_CODE (*expr_p
) == SAVE_EXPR
);
5039 val
= TREE_OPERAND (*expr_p
, 0);
5041 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
5042 if (!SAVE_EXPR_RESOLVED_P (*expr_p
))
5044 /* The operand may be a void-valued expression such as SAVE_EXPRs
5045 generated by the Java frontend for class initialization. It is
5046 being executed only for its side-effects. */
5047 if (TREE_TYPE (val
) == void_type_node
)
5049 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5050 is_gimple_stmt
, fb_none
);
5054 val
= get_initialized_tmp_var (val
, pre_p
, post_p
);
5056 TREE_OPERAND (*expr_p
, 0) = val
;
5057 SAVE_EXPR_RESOLVED_P (*expr_p
) = 1;
5065 /* Rewrite the ADDR_EXPR node pointed to by EXPR_P
5072 PRE_P points to the list where side effects that must happen before
5073 *EXPR_P should be stored.
5075 POST_P points to the list where side effects that must happen after
5076 *EXPR_P should be stored. */
5078 static enum gimplify_status
5079 gimplify_addr_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
5081 tree expr
= *expr_p
;
5082 tree op0
= TREE_OPERAND (expr
, 0);
5083 enum gimplify_status ret
;
5084 location_t loc
= EXPR_LOCATION (*expr_p
);
5086 switch (TREE_CODE (op0
))
5090 /* Check if we are dealing with an expression of the form '&*ptr'.
5091 While the front end folds away '&*ptr' into 'ptr', these
5092 expressions may be generated internally by the compiler (e.g.,
5093 builtins like __builtin_va_end). */
5094 /* Caution: the silent array decomposition semantics we allow for
5095 ADDR_EXPR means we can't always discard the pair. */
5096 /* Gimplification of the ADDR_EXPR operand may drop
5097 cv-qualification conversions, so make sure we add them if
5100 tree op00
= TREE_OPERAND (op0
, 0);
5101 tree t_expr
= TREE_TYPE (expr
);
5102 tree t_op00
= TREE_TYPE (op00
);
5104 if (!useless_type_conversion_p (t_expr
, t_op00
))
5105 op00
= fold_convert_loc (loc
, TREE_TYPE (expr
), op00
);
5111 case VIEW_CONVERT_EXPR
:
5112 /* Take the address of our operand and then convert it to the type of
5115 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
5116 all clear. The impact of this transformation is even less clear. */
5118 /* If the operand is a useless conversion, look through it. Doing so
5119 guarantees that the ADDR_EXPR and its operand will remain of the
5121 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0
, 0)))
5122 op0
= TREE_OPERAND (op0
, 0);
5124 *expr_p
= fold_convert_loc (loc
, TREE_TYPE (expr
),
5125 build_fold_addr_expr_loc (loc
,
5126 TREE_OPERAND (op0
, 0)));
5131 /* We use fb_either here because the C frontend sometimes takes
5132 the address of a call that returns a struct; see
5133 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
5134 the implied temporary explicit. */
5136 /* Make the operand addressable. */
5137 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, post_p
,
5138 is_gimple_addressable
, fb_either
);
5139 if (ret
== GS_ERROR
)
5142 /* Then mark it. Beware that it may not be possible to do so directly
5143 if a temporary has been created by the gimplification. */
5144 prepare_gimple_addressable (&TREE_OPERAND (expr
, 0), pre_p
);
5146 op0
= TREE_OPERAND (expr
, 0);
5148 /* For various reasons, the gimplification of the expression
5149 may have made a new INDIRECT_REF. */
5150 if (TREE_CODE (op0
) == INDIRECT_REF
)
5151 goto do_indirect_ref
;
5153 mark_addressable (TREE_OPERAND (expr
, 0));
5155 /* The FEs may end up building ADDR_EXPRs early on a decl with
5156 an incomplete type. Re-build ADDR_EXPRs in canonical form
5158 if (!types_compatible_p (TREE_TYPE (op0
), TREE_TYPE (TREE_TYPE (expr
))))
5159 *expr_p
= build_fold_addr_expr (op0
);
5161 /* Make sure TREE_CONSTANT and TREE_SIDE_EFFECTS are set properly. */
5162 recompute_tree_invariant_for_addr_expr (*expr_p
);
5164 /* If we re-built the ADDR_EXPR add a conversion to the original type
5166 if (!useless_type_conversion_p (TREE_TYPE (expr
), TREE_TYPE (*expr_p
)))
5167 *expr_p
= fold_convert (TREE_TYPE (expr
), *expr_p
);
5175 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
5176 value; output operands should be a gimple lvalue. */
5178 static enum gimplify_status
5179 gimplify_asm_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
5183 const char **oconstraints
;
5186 const char *constraint
;
5187 bool allows_mem
, allows_reg
, is_inout
;
5188 enum gimplify_status ret
, tret
;
5190 VEC(tree
, gc
) *inputs
;
5191 VEC(tree
, gc
) *outputs
;
5192 VEC(tree
, gc
) *clobbers
;
5193 VEC(tree
, gc
) *labels
;
5197 noutputs
= list_length (ASM_OUTPUTS (expr
));
5198 oconstraints
= (const char **) alloca ((noutputs
) * sizeof (const char *));
5200 inputs
= outputs
= clobbers
= labels
= NULL
;
5203 link_next
= NULL_TREE
;
5204 for (i
= 0, link
= ASM_OUTPUTS (expr
); link
; ++i
, link
= link_next
)
5207 size_t constraint_len
;
5209 link_next
= TREE_CHAIN (link
);
5213 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
5214 constraint_len
= strlen (constraint
);
5215 if (constraint_len
== 0)
5218 ok
= parse_output_constraint (&constraint
, i
, 0, 0,
5219 &allows_mem
, &allows_reg
, &is_inout
);
5226 if (!allows_reg
&& allows_mem
)
5227 mark_addressable (TREE_VALUE (link
));
5229 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
5230 is_inout
? is_gimple_min_lval
: is_gimple_lvalue
,
5231 fb_lvalue
| fb_mayfail
);
5232 if (tret
== GS_ERROR
)
5234 error ("invalid lvalue in asm output %d", i
);
5238 VEC_safe_push (tree
, gc
, outputs
, link
);
5239 TREE_CHAIN (link
) = NULL_TREE
;
5243 /* An input/output operand. To give the optimizers more
5244 flexibility, split it into separate input and output
5249 /* Turn the in/out constraint into an output constraint. */
5250 char *p
= xstrdup (constraint
);
5252 TREE_VALUE (TREE_PURPOSE (link
)) = build_string (constraint_len
, p
);
5254 /* And add a matching input constraint. */
5257 sprintf (buf
, "%d", i
);
5259 /* If there are multiple alternatives in the constraint,
5260 handle each of them individually. Those that allow register
5261 will be replaced with operand number, the others will stay
5263 if (strchr (p
, ',') != NULL
)
5265 size_t len
= 0, buflen
= strlen (buf
);
5266 char *beg
, *end
, *str
, *dst
;
5270 end
= strchr (beg
, ',');
5272 end
= strchr (beg
, '\0');
5273 if ((size_t) (end
- beg
) < buflen
)
5276 len
+= end
- beg
+ 1;
5283 str
= (char *) alloca (len
);
5284 for (beg
= p
+ 1, dst
= str
;;)
5287 bool mem_p
, reg_p
, inout_p
;
5289 end
= strchr (beg
, ',');
5294 parse_output_constraint (&tem
, i
, 0, 0,
5295 &mem_p
, ®_p
, &inout_p
);
5300 memcpy (dst
, buf
, buflen
);
5309 memcpy (dst
, beg
, len
);
5318 input
= build_string (dst
- str
, str
);
5321 input
= build_string (strlen (buf
), buf
);
5324 input
= build_string (constraint_len
- 1, constraint
+ 1);
5328 input
= build_tree_list (build_tree_list (NULL_TREE
, input
),
5329 unshare_expr (TREE_VALUE (link
)));
5330 ASM_INPUTS (expr
) = chainon (ASM_INPUTS (expr
), input
);
5334 link_next
= NULL_TREE
;
5335 for (link
= ASM_INPUTS (expr
); link
; ++i
, link
= link_next
)
5337 link_next
= TREE_CHAIN (link
);
5338 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
5339 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
5340 oconstraints
, &allows_mem
, &allows_reg
);
5342 /* If we can't make copies, we can only accept memory. */
5343 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (link
))))
5349 error ("impossible constraint in %<asm%>");
5350 error ("non-memory input %d must stay in memory", i
);
5355 /* If the operand is a memory input, it should be an lvalue. */
5356 if (!allows_reg
&& allows_mem
)
5358 tree inputv
= TREE_VALUE (link
);
5359 STRIP_NOPS (inputv
);
5360 if (TREE_CODE (inputv
) == PREDECREMENT_EXPR
5361 || TREE_CODE (inputv
) == PREINCREMENT_EXPR
5362 || TREE_CODE (inputv
) == POSTDECREMENT_EXPR
5363 || TREE_CODE (inputv
) == POSTINCREMENT_EXPR
)
5364 TREE_VALUE (link
) = error_mark_node
;
5365 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
5366 is_gimple_lvalue
, fb_lvalue
| fb_mayfail
);
5367 mark_addressable (TREE_VALUE (link
));
5368 if (tret
== GS_ERROR
)
5370 if (EXPR_HAS_LOCATION (TREE_VALUE (link
)))
5371 input_location
= EXPR_LOCATION (TREE_VALUE (link
));
5372 error ("memory input %d is not directly addressable", i
);
5378 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
5379 is_gimple_asm_val
, fb_rvalue
);
5380 if (tret
== GS_ERROR
)
5384 TREE_CHAIN (link
) = NULL_TREE
;
5385 VEC_safe_push (tree
, gc
, inputs
, link
);
5388 for (link
= ASM_CLOBBERS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
5389 VEC_safe_push (tree
, gc
, clobbers
, link
);
5391 for (link
= ASM_LABELS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
5392 VEC_safe_push (tree
, gc
, labels
, link
);
5394 /* Do not add ASMs with errors to the gimple IL stream. */
5395 if (ret
!= GS_ERROR
)
5397 stmt
= gimple_build_asm_vec (TREE_STRING_POINTER (ASM_STRING (expr
)),
5398 inputs
, outputs
, clobbers
, labels
);
5400 gimple_asm_set_volatile (stmt
, ASM_VOLATILE_P (expr
));
5401 gimple_asm_set_input (stmt
, ASM_INPUT_P (expr
));
5403 gimplify_seq_add_stmt (pre_p
, stmt
);
5409 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
5410 GIMPLE_WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
5411 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
5412 return to this function.
5414 FIXME should we complexify the prequeue handling instead? Or use flags
5415 for all the cleanups and let the optimizer tighten them up? The current
5416 code seems pretty fragile; it will break on a cleanup within any
5417 non-conditional nesting. But any such nesting would be broken, anyway;
5418 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
5419 and continues out of it. We can do that at the RTL level, though, so
5420 having an optimizer to tighten up try/finally regions would be a Good
5423 static enum gimplify_status
5424 gimplify_cleanup_point_expr (tree
*expr_p
, gimple_seq
*pre_p
)
5426 gimple_stmt_iterator iter
;
5427 gimple_seq body_sequence
= NULL
;
5429 tree temp
= voidify_wrapper_expr (*expr_p
, NULL
);
5431 /* We only care about the number of conditions between the innermost
5432 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
5433 any cleanups collected outside the CLEANUP_POINT_EXPR. */
5434 int old_conds
= gimplify_ctxp
->conditions
;
5435 gimple_seq old_cleanups
= gimplify_ctxp
->conditional_cleanups
;
5436 bool old_in_cleanup_point_expr
= gimplify_ctxp
->in_cleanup_point_expr
;
5437 gimplify_ctxp
->conditions
= 0;
5438 gimplify_ctxp
->conditional_cleanups
= NULL
;
5439 gimplify_ctxp
->in_cleanup_point_expr
= true;
5441 gimplify_stmt (&TREE_OPERAND (*expr_p
, 0), &body_sequence
);
5443 gimplify_ctxp
->conditions
= old_conds
;
5444 gimplify_ctxp
->conditional_cleanups
= old_cleanups
;
5445 gimplify_ctxp
->in_cleanup_point_expr
= old_in_cleanup_point_expr
;
5447 for (iter
= gsi_start (body_sequence
); !gsi_end_p (iter
); )
5449 gimple wce
= gsi_stmt (iter
);
5451 if (gimple_code (wce
) == GIMPLE_WITH_CLEANUP_EXPR
)
5453 if (gsi_one_before_end_p (iter
))
5455 /* Note that gsi_insert_seq_before and gsi_remove do not
5456 scan operands, unlike some other sequence mutators. */
5457 if (!gimple_wce_cleanup_eh_only (wce
))
5458 gsi_insert_seq_before_without_update (&iter
,
5459 gimple_wce_cleanup (wce
),
5461 gsi_remove (&iter
, true);
5468 enum gimple_try_flags kind
;
5470 if (gimple_wce_cleanup_eh_only (wce
))
5471 kind
= GIMPLE_TRY_CATCH
;
5473 kind
= GIMPLE_TRY_FINALLY
;
5474 seq
= gsi_split_seq_after (iter
);
5476 gtry
= gimple_build_try (seq
, gimple_wce_cleanup (wce
), kind
);
5477 /* Do not use gsi_replace here, as it may scan operands.
5478 We want to do a simple structural modification only. */
5479 gsi_set_stmt (&iter
, gtry
);
5480 iter
= gsi_start (gtry
->gimple_try
.eval
);
5487 gimplify_seq_add_seq (pre_p
, body_sequence
);
5500 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
5501 is the cleanup action required. EH_ONLY is true if the cleanup should
5502 only be executed if an exception is thrown, not on normal exit. */
5505 gimple_push_cleanup (tree var
, tree cleanup
, bool eh_only
, gimple_seq
*pre_p
)
5508 gimple_seq cleanup_stmts
= NULL
;
5510 /* Errors can result in improperly nested cleanups. Which results in
5511 confusion when trying to resolve the GIMPLE_WITH_CLEANUP_EXPR. */
5515 if (gimple_conditional_context ())
5517 /* If we're in a conditional context, this is more complex. We only
5518 want to run the cleanup if we actually ran the initialization that
5519 necessitates it, but we want to run it after the end of the
5520 conditional context. So we wrap the try/finally around the
5521 condition and use a flag to determine whether or not to actually
5522 run the destructor. Thus
5526 becomes (approximately)
5530 if (test) { A::A(temp); flag = 1; val = f(temp); }
5533 if (flag) A::~A(temp);
5537 tree flag
= create_tmp_var (boolean_type_node
, "cleanup");
5538 gimple ffalse
= gimple_build_assign (flag
, boolean_false_node
);
5539 gimple ftrue
= gimple_build_assign (flag
, boolean_true_node
);
5541 cleanup
= build3 (COND_EXPR
, void_type_node
, flag
, cleanup
, NULL
);
5542 gimplify_stmt (&cleanup
, &cleanup_stmts
);
5543 wce
= gimple_build_wce (cleanup_stmts
);
5545 gimplify_seq_add_stmt (&gimplify_ctxp
->conditional_cleanups
, ffalse
);
5546 gimplify_seq_add_stmt (&gimplify_ctxp
->conditional_cleanups
, wce
);
5547 gimplify_seq_add_stmt (pre_p
, ftrue
);
5549 /* Because of this manipulation, and the EH edges that jump
5550 threading cannot redirect, the temporary (VAR) will appear
5551 to be used uninitialized. Don't warn. */
5552 TREE_NO_WARNING (var
) = 1;
5556 gimplify_stmt (&cleanup
, &cleanup_stmts
);
5557 wce
= gimple_build_wce (cleanup_stmts
);
5558 gimple_wce_set_cleanup_eh_only (wce
, eh_only
);
5559 gimplify_seq_add_stmt (pre_p
, wce
);
5563 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
5565 static enum gimplify_status
5566 gimplify_target_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
)
5568 tree targ
= *expr_p
;
5569 tree temp
= TARGET_EXPR_SLOT (targ
);
5570 tree init
= TARGET_EXPR_INITIAL (targ
);
5571 enum gimplify_status ret
;
5575 tree cleanup
= NULL_TREE
;
5577 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
5578 to the temps list. Handle also variable length TARGET_EXPRs. */
5579 if (TREE_CODE (DECL_SIZE (temp
)) != INTEGER_CST
)
5581 if (!TYPE_SIZES_GIMPLIFIED (TREE_TYPE (temp
)))
5582 gimplify_type_sizes (TREE_TYPE (temp
), pre_p
);
5583 gimplify_vla_decl (temp
, pre_p
);
5586 gimple_add_tmp_var (temp
);
5588 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
5589 expression is supposed to initialize the slot. */
5590 if (VOID_TYPE_P (TREE_TYPE (init
)))
5591 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
, fb_none
);
5594 tree init_expr
= build2 (INIT_EXPR
, void_type_node
, temp
, init
);
5596 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
, fb_none
);
5598 ggc_free (init_expr
);
5600 if (ret
== GS_ERROR
)
5602 /* PR c++/28266 Make sure this is expanded only once. */
5603 TARGET_EXPR_INITIAL (targ
) = NULL_TREE
;
5607 gimplify_and_add (init
, pre_p
);
5609 /* If needed, push the cleanup for the temp. */
5610 if (TARGET_EXPR_CLEANUP (targ
))
5612 if (CLEANUP_EH_ONLY (targ
))
5613 gimple_push_cleanup (temp
, TARGET_EXPR_CLEANUP (targ
),
5614 CLEANUP_EH_ONLY (targ
), pre_p
);
5616 cleanup
= TARGET_EXPR_CLEANUP (targ
);
5619 /* Add a clobber for the temporary going out of scope, like
5620 gimplify_bind_expr. */
5621 if (gimplify_ctxp
->in_cleanup_point_expr
5622 && needs_to_live_in_memory (temp
)
5623 && flag_stack_reuse
== SR_ALL
)
5625 tree clobber
= build_constructor (TREE_TYPE (temp
), NULL
);
5626 TREE_THIS_VOLATILE (clobber
) = true;
5627 clobber
= build2 (MODIFY_EXPR
, TREE_TYPE (temp
), temp
, clobber
);
5629 cleanup
= build2 (COMPOUND_EXPR
, void_type_node
, cleanup
,
5636 gimple_push_cleanup (temp
, cleanup
, false, pre_p
);
5638 /* Only expand this once. */
5639 TREE_OPERAND (targ
, 3) = init
;
5640 TARGET_EXPR_INITIAL (targ
) = NULL_TREE
;
5643 /* We should have expanded this before. */
5644 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp
));
5650 /* Gimplification of expression trees. */
5652 /* Gimplify an expression which appears at statement context. The
5653 corresponding GIMPLE statements are added to *SEQ_P. If *SEQ_P is
5654 NULL, a new sequence is allocated.
5656 Return true if we actually added a statement to the queue. */
5659 gimplify_stmt (tree
*stmt_p
, gimple_seq
*seq_p
)
5661 gimple_seq_node last
;
5663 last
= gimple_seq_last (*seq_p
);
5664 gimplify_expr (stmt_p
, seq_p
, NULL
, is_gimple_stmt
, fb_none
);
5665 return last
!= gimple_seq_last (*seq_p
);
5668 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
5669 to CTX. If entries already exist, force them to be some flavor of private.
5670 If there is no enclosing parallel, do nothing. */
5673 omp_firstprivatize_variable (struct gimplify_omp_ctx
*ctx
, tree decl
)
5677 if (decl
== NULL
|| !DECL_P (decl
))
5682 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5685 if (n
->value
& GOVD_SHARED
)
5686 n
->value
= GOVD_FIRSTPRIVATE
| (n
->value
& GOVD_SEEN
);
5690 else if (ctx
->region_type
!= ORT_WORKSHARE
)
5691 omp_add_variable (ctx
, decl
, GOVD_FIRSTPRIVATE
);
5693 ctx
= ctx
->outer_context
;
5698 /* Similarly for each of the type sizes of TYPE. */
5701 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx
*ctx
, tree type
)
5703 if (type
== NULL
|| type
== error_mark_node
)
5705 type
= TYPE_MAIN_VARIANT (type
);
5707 if (pointer_set_insert (ctx
->privatized_types
, type
))
5710 switch (TREE_CODE (type
))
5716 case FIXED_POINT_TYPE
:
5717 omp_firstprivatize_variable (ctx
, TYPE_MIN_VALUE (type
));
5718 omp_firstprivatize_variable (ctx
, TYPE_MAX_VALUE (type
));
5722 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
5723 omp_firstprivatize_type_sizes (ctx
, TYPE_DOMAIN (type
));
5728 case QUAL_UNION_TYPE
:
5731 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
5732 if (TREE_CODE (field
) == FIELD_DECL
)
5734 omp_firstprivatize_variable (ctx
, DECL_FIELD_OFFSET (field
));
5735 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (field
));
5741 case REFERENCE_TYPE
:
5742 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
5749 omp_firstprivatize_variable (ctx
, TYPE_SIZE (type
));
5750 omp_firstprivatize_variable (ctx
, TYPE_SIZE_UNIT (type
));
5751 lang_hooks
.types
.omp_firstprivatize_type_sizes (ctx
, type
);
5754 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
5757 omp_add_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, unsigned int flags
)
5760 unsigned int nflags
;
5763 if (error_operand_p (decl
))
5766 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
5767 there are constructors involved somewhere. */
5768 if (TREE_ADDRESSABLE (TREE_TYPE (decl
))
5769 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
5772 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5775 /* We shouldn't be re-adding the decl with the same data
5777 gcc_assert ((n
->value
& GOVD_DATA_SHARE_CLASS
& flags
) == 0);
5778 /* The only combination of data sharing classes we should see is
5779 FIRSTPRIVATE and LASTPRIVATE. */
5780 nflags
= n
->value
| flags
;
5781 gcc_assert ((nflags
& GOVD_DATA_SHARE_CLASS
)
5782 == (GOVD_FIRSTPRIVATE
| GOVD_LASTPRIVATE
));
5787 /* When adding a variable-sized variable, we have to handle all sorts
5788 of additional bits of data: the pointer replacement variable, and
5789 the parameters of the type. */
5790 if (DECL_SIZE (decl
) && TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
5792 /* Add the pointer replacement variable as PRIVATE if the variable
5793 replacement is private, else FIRSTPRIVATE since we'll need the
5794 address of the original variable either for SHARED, or for the
5795 copy into or out of the context. */
5796 if (!(flags
& GOVD_LOCAL
))
5798 nflags
= flags
& GOVD_PRIVATE
? GOVD_PRIVATE
: GOVD_FIRSTPRIVATE
;
5799 nflags
|= flags
& GOVD_SEEN
;
5800 t
= DECL_VALUE_EXPR (decl
);
5801 gcc_assert (TREE_CODE (t
) == INDIRECT_REF
);
5802 t
= TREE_OPERAND (t
, 0);
5803 gcc_assert (DECL_P (t
));
5804 omp_add_variable (ctx
, t
, nflags
);
5807 /* Add all of the variable and type parameters (which should have
5808 been gimplified to a formal temporary) as FIRSTPRIVATE. */
5809 omp_firstprivatize_variable (ctx
, DECL_SIZE_UNIT (decl
));
5810 omp_firstprivatize_variable (ctx
, DECL_SIZE (decl
));
5811 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
5813 /* The variable-sized variable itself is never SHARED, only some form
5814 of PRIVATE. The sharing would take place via the pointer variable
5815 which we remapped above. */
5816 if (flags
& GOVD_SHARED
)
5817 flags
= GOVD_PRIVATE
| GOVD_DEBUG_PRIVATE
5818 | (flags
& (GOVD_SEEN
| GOVD_EXPLICIT
));
5820 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
5821 alloca statement we generate for the variable, so make sure it
5822 is available. This isn't automatically needed for the SHARED
5823 case, since we won't be allocating local storage then.
5824 For local variables TYPE_SIZE_UNIT might not be gimplified yet,
5825 in this case omp_notice_variable will be called later
5826 on when it is gimplified. */
5827 else if (! (flags
& GOVD_LOCAL
)
5828 && DECL_P (TYPE_SIZE_UNIT (TREE_TYPE (decl
))))
5829 omp_notice_variable (ctx
, TYPE_SIZE_UNIT (TREE_TYPE (decl
)), true);
5831 else if (lang_hooks
.decls
.omp_privatize_by_reference (decl
))
5833 gcc_assert ((flags
& GOVD_LOCAL
) == 0);
5834 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
5836 /* Similar to the direct variable sized case above, we'll need the
5837 size of references being privatized. */
5838 if ((flags
& GOVD_SHARED
) == 0)
5840 t
= TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl
)));
5841 if (TREE_CODE (t
) != INTEGER_CST
)
5842 omp_notice_variable (ctx
, t
, true);
5846 splay_tree_insert (ctx
->variables
, (splay_tree_key
)decl
, flags
);
5849 /* Notice a threadprivate variable DECL used in OpenMP context CTX.
5850 This just prints out diagnostics about threadprivate variable uses
5851 in untied tasks. If DECL2 is non-NULL, prevent this warning
5852 on that variable. */
5855 omp_notice_threadprivate_variable (struct gimplify_omp_ctx
*ctx
, tree decl
,
5860 if (ctx
->region_type
!= ORT_UNTIED_TASK
)
5862 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5865 error ("threadprivate variable %qE used in untied task",
5867 error_at (ctx
->location
, "enclosing task");
5868 splay_tree_insert (ctx
->variables
, (splay_tree_key
)decl
, 0);
5871 splay_tree_insert (ctx
->variables
, (splay_tree_key
)decl2
, 0);
5875 /* Record the fact that DECL was used within the OpenMP context CTX.
5876 IN_CODE is true when real code uses DECL, and false when we should
5877 merely emit default(none) errors. Return true if DECL is going to
5878 be remapped and thus DECL shouldn't be gimplified into its
5879 DECL_VALUE_EXPR (if any). */
5882 omp_notice_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, bool in_code
)
5885 unsigned flags
= in_code
? GOVD_SEEN
: 0;
5886 bool ret
= false, shared
;
5888 if (error_operand_p (decl
))
5891 /* Threadprivate variables are predetermined. */
5892 if (is_global_var (decl
))
5894 if (DECL_THREAD_LOCAL_P (decl
))
5895 return omp_notice_threadprivate_variable (ctx
, decl
, NULL_TREE
);
5897 if (DECL_HAS_VALUE_EXPR_P (decl
))
5899 tree value
= get_base_address (DECL_VALUE_EXPR (decl
));
5901 if (value
&& DECL_P (value
) && DECL_THREAD_LOCAL_P (value
))
5902 return omp_notice_threadprivate_variable (ctx
, decl
, value
);
5906 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
5909 enum omp_clause_default_kind default_kind
, kind
;
5910 struct gimplify_omp_ctx
*octx
;
5912 if (ctx
->region_type
== ORT_WORKSHARE
)
5915 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
5916 remapped firstprivate instead of shared. To some extent this is
5917 addressed in omp_firstprivatize_type_sizes, but not effectively. */
5918 default_kind
= ctx
->default_kind
;
5919 kind
= lang_hooks
.decls
.omp_predetermined_sharing (decl
);
5920 if (kind
!= OMP_CLAUSE_DEFAULT_UNSPECIFIED
)
5921 default_kind
= kind
;
5923 switch (default_kind
)
5925 case OMP_CLAUSE_DEFAULT_NONE
:
5926 error ("%qE not specified in enclosing parallel",
5927 DECL_NAME (lang_hooks
.decls
.omp_report_decl (decl
)));
5928 if ((ctx
->region_type
& ORT_TASK
) != 0)
5929 error_at (ctx
->location
, "enclosing task");
5931 error_at (ctx
->location
, "enclosing parallel");
5933 case OMP_CLAUSE_DEFAULT_SHARED
:
5934 flags
|= GOVD_SHARED
;
5936 case OMP_CLAUSE_DEFAULT_PRIVATE
:
5937 flags
|= GOVD_PRIVATE
;
5939 case OMP_CLAUSE_DEFAULT_FIRSTPRIVATE
:
5940 flags
|= GOVD_FIRSTPRIVATE
;
5942 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
5943 /* decl will be either GOVD_FIRSTPRIVATE or GOVD_SHARED. */
5944 gcc_assert ((ctx
->region_type
& ORT_TASK
) != 0);
5945 if (ctx
->outer_context
)
5946 omp_notice_variable (ctx
->outer_context
, decl
, in_code
);
5947 for (octx
= ctx
->outer_context
; octx
; octx
= octx
->outer_context
)
5951 n2
= splay_tree_lookup (octx
->variables
, (splay_tree_key
) decl
);
5952 if (n2
&& (n2
->value
& GOVD_DATA_SHARE_CLASS
) != GOVD_SHARED
)
5954 flags
|= GOVD_FIRSTPRIVATE
;
5957 if ((octx
->region_type
& ORT_PARALLEL
) != 0)
5960 if (flags
& GOVD_FIRSTPRIVATE
)
5963 && (TREE_CODE (decl
) == PARM_DECL
5964 || (!is_global_var (decl
)
5965 && DECL_CONTEXT (decl
) == current_function_decl
)))
5967 flags
|= GOVD_FIRSTPRIVATE
;
5970 flags
|= GOVD_SHARED
;
5976 if ((flags
& GOVD_PRIVATE
)
5977 && lang_hooks
.decls
.omp_private_outer_ref (decl
))
5978 flags
|= GOVD_PRIVATE_OUTER_REF
;
5980 omp_add_variable (ctx
, decl
, flags
);
5982 shared
= (flags
& GOVD_SHARED
) != 0;
5983 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
5987 if ((n
->value
& (GOVD_SEEN
| GOVD_LOCAL
)) == 0
5988 && (flags
& (GOVD_SEEN
| GOVD_LOCAL
)) == GOVD_SEEN
5990 && TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
5993 tree t
= DECL_VALUE_EXPR (decl
);
5994 gcc_assert (TREE_CODE (t
) == INDIRECT_REF
);
5995 t
= TREE_OPERAND (t
, 0);
5996 gcc_assert (DECL_P (t
));
5997 n2
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) t
);
5998 n2
->value
|= GOVD_SEEN
;
6001 shared
= ((flags
| n
->value
) & GOVD_SHARED
) != 0;
6002 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
6004 /* If nothing changed, there's nothing left to do. */
6005 if ((n
->value
& flags
) == flags
)
6011 /* If the variable is private in the current context, then we don't
6012 need to propagate anything to an outer context. */
6013 if ((flags
& GOVD_PRIVATE
) && !(flags
& GOVD_PRIVATE_OUTER_REF
))
6015 if (ctx
->outer_context
6016 && omp_notice_variable (ctx
->outer_context
, decl
, in_code
))
6021 /* Verify that DECL is private within CTX. If there's specific information
6022 to the contrary in the innermost scope, generate an error. */
6025 omp_is_private (struct gimplify_omp_ctx
*ctx
, tree decl
)
6029 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
6032 if (n
->value
& GOVD_SHARED
)
6034 if (ctx
== gimplify_omp_ctxp
)
6036 error ("iteration variable %qE should be private",
6038 n
->value
= GOVD_PRIVATE
;
6044 else if ((n
->value
& GOVD_EXPLICIT
) != 0
6045 && (ctx
== gimplify_omp_ctxp
6046 || (ctx
->region_type
== ORT_COMBINED_PARALLEL
6047 && gimplify_omp_ctxp
->outer_context
== ctx
)))
6049 if ((n
->value
& GOVD_FIRSTPRIVATE
) != 0)
6050 error ("iteration variable %qE should not be firstprivate",
6052 else if ((n
->value
& GOVD_REDUCTION
) != 0)
6053 error ("iteration variable %qE should not be reduction",
6056 return (ctx
== gimplify_omp_ctxp
6057 || (ctx
->region_type
== ORT_COMBINED_PARALLEL
6058 && gimplify_omp_ctxp
->outer_context
== ctx
));
6061 if (ctx
->region_type
!= ORT_WORKSHARE
)
6063 else if (ctx
->outer_context
)
6064 return omp_is_private (ctx
->outer_context
, decl
);
6068 /* Return true if DECL is private within a parallel region
6069 that binds to the current construct's context or in parallel
6070 region's REDUCTION clause. */
6073 omp_check_private (struct gimplify_omp_ctx
*ctx
, tree decl
)
6079 ctx
= ctx
->outer_context
;
6081 return !(is_global_var (decl
)
6082 /* References might be private, but might be shared too. */
6083 || lang_hooks
.decls
.omp_privatize_by_reference (decl
));
6085 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
6087 return (n
->value
& GOVD_SHARED
) == 0;
6089 while (ctx
->region_type
== ORT_WORKSHARE
);
6093 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
6094 and previous omp contexts. */
6097 gimplify_scan_omp_clauses (tree
*list_p
, gimple_seq
*pre_p
,
6098 enum omp_region_type region_type
)
6100 struct gimplify_omp_ctx
*ctx
, *outer_ctx
;
6101 struct gimplify_ctx gctx
;
6104 ctx
= new_omp_context (region_type
);
6105 outer_ctx
= ctx
->outer_context
;
6107 while ((c
= *list_p
) != NULL
)
6109 bool remove
= false;
6110 bool notice_outer
= true;
6111 const char *check_non_private
= NULL
;
6115 switch (OMP_CLAUSE_CODE (c
))
6117 case OMP_CLAUSE_PRIVATE
:
6118 flags
= GOVD_PRIVATE
| GOVD_EXPLICIT
;
6119 if (lang_hooks
.decls
.omp_private_outer_ref (OMP_CLAUSE_DECL (c
)))
6121 flags
|= GOVD_PRIVATE_OUTER_REF
;
6122 OMP_CLAUSE_PRIVATE_OUTER_REF (c
) = 1;
6125 notice_outer
= false;
6127 case OMP_CLAUSE_SHARED
:
6128 flags
= GOVD_SHARED
| GOVD_EXPLICIT
;
6130 case OMP_CLAUSE_FIRSTPRIVATE
:
6131 flags
= GOVD_FIRSTPRIVATE
| GOVD_EXPLICIT
;
6132 check_non_private
= "firstprivate";
6134 case OMP_CLAUSE_LASTPRIVATE
:
6135 flags
= GOVD_LASTPRIVATE
| GOVD_SEEN
| GOVD_EXPLICIT
;
6136 check_non_private
= "lastprivate";
6138 case OMP_CLAUSE_REDUCTION
:
6139 flags
= GOVD_REDUCTION
| GOVD_SEEN
| GOVD_EXPLICIT
;
6140 check_non_private
= "reduction";
6144 decl
= OMP_CLAUSE_DECL (c
);
6145 if (error_operand_p (decl
))
6150 omp_add_variable (ctx
, decl
, flags
);
6151 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
6152 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
))
6154 omp_add_variable (ctx
, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
),
6155 GOVD_LOCAL
| GOVD_SEEN
);
6156 gimplify_omp_ctxp
= ctx
;
6157 push_gimplify_context (&gctx
);
6159 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c
) = NULL
;
6160 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c
) = NULL
;
6162 gimplify_and_add (OMP_CLAUSE_REDUCTION_INIT (c
),
6163 &OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c
));
6164 pop_gimplify_context
6165 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_INIT (c
)));
6166 push_gimplify_context (&gctx
);
6167 gimplify_and_add (OMP_CLAUSE_REDUCTION_MERGE (c
),
6168 &OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c
));
6169 pop_gimplify_context
6170 (gimple_seq_first_stmt (OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (c
)));
6171 OMP_CLAUSE_REDUCTION_INIT (c
) = NULL_TREE
;
6172 OMP_CLAUSE_REDUCTION_MERGE (c
) = NULL_TREE
;
6174 gimplify_omp_ctxp
= outer_ctx
;
6176 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
6177 && OMP_CLAUSE_LASTPRIVATE_STMT (c
))
6179 gimplify_omp_ctxp
= ctx
;
6180 push_gimplify_context (&gctx
);
6181 if (TREE_CODE (OMP_CLAUSE_LASTPRIVATE_STMT (c
)) != BIND_EXPR
)
6183 tree bind
= build3 (BIND_EXPR
, void_type_node
, NULL
,
6185 TREE_SIDE_EFFECTS (bind
) = 1;
6186 BIND_EXPR_BODY (bind
) = OMP_CLAUSE_LASTPRIVATE_STMT (c
);
6187 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = bind
;
6189 gimplify_and_add (OMP_CLAUSE_LASTPRIVATE_STMT (c
),
6190 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
));
6191 pop_gimplify_context
6192 (gimple_seq_first_stmt (OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
)));
6193 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = NULL_TREE
;
6195 gimplify_omp_ctxp
= outer_ctx
;
6201 case OMP_CLAUSE_COPYIN
:
6202 case OMP_CLAUSE_COPYPRIVATE
:
6203 decl
= OMP_CLAUSE_DECL (c
);
6204 if (error_operand_p (decl
))
6211 omp_notice_variable (outer_ctx
, decl
, true);
6212 if (check_non_private
6213 && region_type
== ORT_WORKSHARE
6214 && omp_check_private (ctx
, decl
))
6216 error ("%s variable %qE is private in outer context",
6217 check_non_private
, DECL_NAME (decl
));
6222 case OMP_CLAUSE_FINAL
:
6224 OMP_CLAUSE_OPERAND (c
, 0)
6225 = gimple_boolify (OMP_CLAUSE_OPERAND (c
, 0));
6228 case OMP_CLAUSE_SCHEDULE
:
6229 case OMP_CLAUSE_NUM_THREADS
:
6230 if (gimplify_expr (&OMP_CLAUSE_OPERAND (c
, 0), pre_p
, NULL
,
6231 is_gimple_val
, fb_rvalue
) == GS_ERROR
)
6235 case OMP_CLAUSE_NOWAIT
:
6236 case OMP_CLAUSE_ORDERED
:
6237 case OMP_CLAUSE_UNTIED
:
6238 case OMP_CLAUSE_COLLAPSE
:
6239 case OMP_CLAUSE_MERGEABLE
:
6242 case OMP_CLAUSE_DEFAULT
:
6243 ctx
->default_kind
= OMP_CLAUSE_DEFAULT_KIND (c
);
6251 *list_p
= OMP_CLAUSE_CHAIN (c
);
6253 list_p
= &OMP_CLAUSE_CHAIN (c
);
6256 gimplify_omp_ctxp
= ctx
;
6259 /* For all variables that were not actually used within the context,
6260 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
6263 gimplify_adjust_omp_clauses_1 (splay_tree_node n
, void *data
)
6265 tree
*list_p
= (tree
*) data
;
6266 tree decl
= (tree
) n
->key
;
6267 unsigned flags
= n
->value
;
6268 enum omp_clause_code code
;
6272 if (flags
& (GOVD_EXPLICIT
| GOVD_LOCAL
))
6274 if ((flags
& GOVD_SEEN
) == 0)
6276 if (flags
& GOVD_DEBUG_PRIVATE
)
6278 gcc_assert ((flags
& GOVD_DATA_SHARE_CLASS
) == GOVD_PRIVATE
);
6279 private_debug
= true;
6283 = lang_hooks
.decls
.omp_private_debug_clause (decl
,
6284 !!(flags
& GOVD_SHARED
));
6286 code
= OMP_CLAUSE_PRIVATE
;
6287 else if (flags
& GOVD_SHARED
)
6289 if (is_global_var (decl
))
6291 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
->outer_context
;
6295 = splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
6296 if (on
&& (on
->value
& (GOVD_FIRSTPRIVATE
| GOVD_LASTPRIVATE
6297 | GOVD_PRIVATE
| GOVD_REDUCTION
)) != 0)
6299 ctx
= ctx
->outer_context
;
6304 code
= OMP_CLAUSE_SHARED
;
6306 else if (flags
& GOVD_PRIVATE
)
6307 code
= OMP_CLAUSE_PRIVATE
;
6308 else if (flags
& GOVD_FIRSTPRIVATE
)
6309 code
= OMP_CLAUSE_FIRSTPRIVATE
;
6313 clause
= build_omp_clause (input_location
, code
);
6314 OMP_CLAUSE_DECL (clause
) = decl
;
6315 OMP_CLAUSE_CHAIN (clause
) = *list_p
;
6317 OMP_CLAUSE_PRIVATE_DEBUG (clause
) = 1;
6318 else if (code
== OMP_CLAUSE_PRIVATE
&& (flags
& GOVD_PRIVATE_OUTER_REF
))
6319 OMP_CLAUSE_PRIVATE_OUTER_REF (clause
) = 1;
6321 lang_hooks
.decls
.omp_finish_clause (clause
);
6327 gimplify_adjust_omp_clauses (tree
*list_p
)
6329 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
6332 while ((c
= *list_p
) != NULL
)
6335 bool remove
= false;
6337 switch (OMP_CLAUSE_CODE (c
))
6339 case OMP_CLAUSE_PRIVATE
:
6340 case OMP_CLAUSE_SHARED
:
6341 case OMP_CLAUSE_FIRSTPRIVATE
:
6342 decl
= OMP_CLAUSE_DECL (c
);
6343 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
6344 remove
= !(n
->value
& GOVD_SEEN
);
6347 bool shared
= OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_SHARED
;
6348 if ((n
->value
& GOVD_DEBUG_PRIVATE
)
6349 || lang_hooks
.decls
.omp_private_debug_clause (decl
, shared
))
6351 gcc_assert ((n
->value
& GOVD_DEBUG_PRIVATE
) == 0
6352 || ((n
->value
& GOVD_DATA_SHARE_CLASS
)
6354 OMP_CLAUSE_SET_CODE (c
, OMP_CLAUSE_PRIVATE
);
6355 OMP_CLAUSE_PRIVATE_DEBUG (c
) = 1;
6360 case OMP_CLAUSE_LASTPRIVATE
:
6361 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
6362 accurately reflect the presence of a FIRSTPRIVATE clause. */
6363 decl
= OMP_CLAUSE_DECL (c
);
6364 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
6365 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c
)
6366 = (n
->value
& GOVD_FIRSTPRIVATE
) != 0;
6369 case OMP_CLAUSE_REDUCTION
:
6370 case OMP_CLAUSE_COPYIN
:
6371 case OMP_CLAUSE_COPYPRIVATE
:
6373 case OMP_CLAUSE_NUM_THREADS
:
6374 case OMP_CLAUSE_SCHEDULE
:
6375 case OMP_CLAUSE_NOWAIT
:
6376 case OMP_CLAUSE_ORDERED
:
6377 case OMP_CLAUSE_DEFAULT
:
6378 case OMP_CLAUSE_UNTIED
:
6379 case OMP_CLAUSE_COLLAPSE
:
6380 case OMP_CLAUSE_FINAL
:
6381 case OMP_CLAUSE_MERGEABLE
:
6389 *list_p
= OMP_CLAUSE_CHAIN (c
);
6391 list_p
= &OMP_CLAUSE_CHAIN (c
);
6394 /* Add in any implicit data sharing. */
6395 splay_tree_foreach (ctx
->variables
, gimplify_adjust_omp_clauses_1
, list_p
);
6397 gimplify_omp_ctxp
= ctx
->outer_context
;
6398 delete_omp_context (ctx
);
6401 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
6402 gimplification of the body, as well as scanning the body for used
6403 variables. We need to do this scan now, because variable-sized
6404 decls will be decomposed during gimplification. */
6407 gimplify_omp_parallel (tree
*expr_p
, gimple_seq
*pre_p
)
6409 tree expr
= *expr_p
;
6411 gimple_seq body
= NULL
;
6412 struct gimplify_ctx gctx
;
6414 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
), pre_p
,
6415 OMP_PARALLEL_COMBINED (expr
)
6416 ? ORT_COMBINED_PARALLEL
6419 push_gimplify_context (&gctx
);
6421 g
= gimplify_and_return_first (OMP_PARALLEL_BODY (expr
), &body
);
6422 if (gimple_code (g
) == GIMPLE_BIND
)
6423 pop_gimplify_context (g
);
6425 pop_gimplify_context (NULL
);
6427 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
));
6429 g
= gimple_build_omp_parallel (body
,
6430 OMP_PARALLEL_CLAUSES (expr
),
6431 NULL_TREE
, NULL_TREE
);
6432 if (OMP_PARALLEL_COMBINED (expr
))
6433 gimple_omp_set_subcode (g
, GF_OMP_PARALLEL_COMBINED
);
6434 gimplify_seq_add_stmt (pre_p
, g
);
6435 *expr_p
= NULL_TREE
;
6438 /* Gimplify the contents of an OMP_TASK statement. This involves
6439 gimplification of the body, as well as scanning the body for used
6440 variables. We need to do this scan now, because variable-sized
6441 decls will be decomposed during gimplification. */
6444 gimplify_omp_task (tree
*expr_p
, gimple_seq
*pre_p
)
6446 tree expr
= *expr_p
;
6448 gimple_seq body
= NULL
;
6449 struct gimplify_ctx gctx
;
6451 gimplify_scan_omp_clauses (&OMP_TASK_CLAUSES (expr
), pre_p
,
6452 find_omp_clause (OMP_TASK_CLAUSES (expr
),
6454 ? ORT_UNTIED_TASK
: ORT_TASK
);
6456 push_gimplify_context (&gctx
);
6458 g
= gimplify_and_return_first (OMP_TASK_BODY (expr
), &body
);
6459 if (gimple_code (g
) == GIMPLE_BIND
)
6460 pop_gimplify_context (g
);
6462 pop_gimplify_context (NULL
);
6464 gimplify_adjust_omp_clauses (&OMP_TASK_CLAUSES (expr
));
6466 g
= gimple_build_omp_task (body
,
6467 OMP_TASK_CLAUSES (expr
),
6468 NULL_TREE
, NULL_TREE
,
6469 NULL_TREE
, NULL_TREE
, NULL_TREE
);
6470 gimplify_seq_add_stmt (pre_p
, g
);
6471 *expr_p
= NULL_TREE
;
6474 /* Gimplify the gross structure of an OMP_FOR statement. */
6476 static enum gimplify_status
6477 gimplify_omp_for (tree
*expr_p
, gimple_seq
*pre_p
)
6479 tree for_stmt
, decl
, var
, t
;
6480 enum gimplify_status ret
= GS_ALL_DONE
;
6481 enum gimplify_status tret
;
6483 gimple_seq for_body
, for_pre_body
;
6488 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
), pre_p
,
6491 /* Handle OMP_FOR_INIT. */
6492 for_pre_body
= NULL
;
6493 gimplify_and_add (OMP_FOR_PRE_BODY (for_stmt
), &for_pre_body
);
6494 OMP_FOR_PRE_BODY (for_stmt
) = NULL_TREE
;
6497 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
))
6498 == TREE_VEC_LENGTH (OMP_FOR_COND (for_stmt
)));
6499 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
))
6500 == TREE_VEC_LENGTH (OMP_FOR_INCR (for_stmt
)));
6501 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)); i
++)
6503 t
= TREE_VEC_ELT (OMP_FOR_INIT (for_stmt
), i
);
6504 gcc_assert (TREE_CODE (t
) == MODIFY_EXPR
);
6505 decl
= TREE_OPERAND (t
, 0);
6506 gcc_assert (DECL_P (decl
));
6507 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl
))
6508 || POINTER_TYPE_P (TREE_TYPE (decl
)));
6510 /* Make sure the iteration variable is private. */
6511 if (omp_is_private (gimplify_omp_ctxp
, decl
))
6512 omp_notice_variable (gimplify_omp_ctxp
, decl
, true);
6514 omp_add_variable (gimplify_omp_ctxp
, decl
, GOVD_PRIVATE
| GOVD_SEEN
);
6516 /* If DECL is not a gimple register, create a temporary variable to act
6517 as an iteration counter. This is valid, since DECL cannot be
6518 modified in the body of the loop. */
6519 if (!is_gimple_reg (decl
))
6521 var
= create_tmp_var (TREE_TYPE (decl
), get_name (decl
));
6522 TREE_OPERAND (t
, 0) = var
;
6524 gimplify_seq_add_stmt (&for_body
, gimple_build_assign (decl
, var
));
6526 omp_add_variable (gimplify_omp_ctxp
, var
, GOVD_PRIVATE
| GOVD_SEEN
);
6531 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), &for_pre_body
, NULL
,
6532 is_gimple_val
, fb_rvalue
);
6533 ret
= MIN (ret
, tret
);
6534 if (ret
== GS_ERROR
)
6537 /* Handle OMP_FOR_COND. */
6538 t
= TREE_VEC_ELT (OMP_FOR_COND (for_stmt
), i
);
6539 gcc_assert (COMPARISON_CLASS_P (t
));
6540 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
6542 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), &for_pre_body
, NULL
,
6543 is_gimple_val
, fb_rvalue
);
6544 ret
= MIN (ret
, tret
);
6546 /* Handle OMP_FOR_INCR. */
6547 t
= TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
);
6548 switch (TREE_CODE (t
))
6550 case PREINCREMENT_EXPR
:
6551 case POSTINCREMENT_EXPR
:
6552 t
= build_int_cst (TREE_TYPE (decl
), 1);
6553 t
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), var
, t
);
6554 t
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, t
);
6555 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
) = t
;
6558 case PREDECREMENT_EXPR
:
6559 case POSTDECREMENT_EXPR
:
6560 t
= build_int_cst (TREE_TYPE (decl
), -1);
6561 t
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), var
, t
);
6562 t
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, t
);
6563 TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
) = t
;
6567 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
6568 TREE_OPERAND (t
, 0) = var
;
6570 t
= TREE_OPERAND (t
, 1);
6571 switch (TREE_CODE (t
))
6574 if (TREE_OPERAND (t
, 1) == decl
)
6576 TREE_OPERAND (t
, 1) = TREE_OPERAND (t
, 0);
6577 TREE_OPERAND (t
, 0) = var
;
6583 case POINTER_PLUS_EXPR
:
6584 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
6585 TREE_OPERAND (t
, 0) = var
;
6591 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), &for_pre_body
, NULL
,
6592 is_gimple_val
, fb_rvalue
);
6593 ret
= MIN (ret
, tret
);
6600 if (var
!= decl
|| TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)) > 1)
6603 for (c
= OMP_FOR_CLAUSES (for_stmt
); c
; c
= OMP_CLAUSE_CHAIN (c
))
6604 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
6605 && OMP_CLAUSE_DECL (c
) == decl
6606 && OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
) == NULL
)
6608 t
= TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
);
6609 gcc_assert (TREE_CODE (t
) == MODIFY_EXPR
);
6610 gcc_assert (TREE_OPERAND (t
, 0) == var
);
6611 t
= TREE_OPERAND (t
, 1);
6612 gcc_assert (TREE_CODE (t
) == PLUS_EXPR
6613 || TREE_CODE (t
) == MINUS_EXPR
6614 || TREE_CODE (t
) == POINTER_PLUS_EXPR
);
6615 gcc_assert (TREE_OPERAND (t
, 0) == var
);
6616 t
= build2 (TREE_CODE (t
), TREE_TYPE (decl
), decl
,
6617 TREE_OPERAND (t
, 1));
6618 gimplify_assign (decl
, t
,
6619 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (c
));
6624 gimplify_and_add (OMP_FOR_BODY (for_stmt
), &for_body
);
6626 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
));
6628 gfor
= gimple_build_omp_for (for_body
, OMP_FOR_CLAUSES (for_stmt
),
6629 TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)),
6632 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt
)); i
++)
6634 t
= TREE_VEC_ELT (OMP_FOR_INIT (for_stmt
), i
);
6635 gimple_omp_for_set_index (gfor
, i
, TREE_OPERAND (t
, 0));
6636 gimple_omp_for_set_initial (gfor
, i
, TREE_OPERAND (t
, 1));
6637 t
= TREE_VEC_ELT (OMP_FOR_COND (for_stmt
), i
);
6638 gimple_omp_for_set_cond (gfor
, i
, TREE_CODE (t
));
6639 gimple_omp_for_set_final (gfor
, i
, TREE_OPERAND (t
, 1));
6640 t
= TREE_VEC_ELT (OMP_FOR_INCR (for_stmt
), i
);
6641 gimple_omp_for_set_incr (gfor
, i
, TREE_OPERAND (t
, 1));
6644 gimplify_seq_add_stmt (pre_p
, gfor
);
6645 return ret
== GS_ALL_DONE
? GS_ALL_DONE
: GS_ERROR
;
6648 /* Gimplify the gross structure of other OpenMP worksharing constructs.
6649 In particular, OMP_SECTIONS and OMP_SINGLE. */
6652 gimplify_omp_workshare (tree
*expr_p
, gimple_seq
*pre_p
)
6654 tree expr
= *expr_p
;
6656 gimple_seq body
= NULL
;
6658 gimplify_scan_omp_clauses (&OMP_CLAUSES (expr
), pre_p
, ORT_WORKSHARE
);
6659 gimplify_and_add (OMP_BODY (expr
), &body
);
6660 gimplify_adjust_omp_clauses (&OMP_CLAUSES (expr
));
6662 if (TREE_CODE (expr
) == OMP_SECTIONS
)
6663 stmt
= gimple_build_omp_sections (body
, OMP_CLAUSES (expr
));
6664 else if (TREE_CODE (expr
) == OMP_SINGLE
)
6665 stmt
= gimple_build_omp_single (body
, OMP_CLAUSES (expr
));
6669 gimplify_seq_add_stmt (pre_p
, stmt
);
6672 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
6673 stabilized the lhs of the atomic operation as *ADDR. Return true if
6674 EXPR is this stabilized form. */
6677 goa_lhs_expr_p (tree expr
, tree addr
)
6679 /* Also include casts to other type variants. The C front end is fond
6680 of adding these for e.g. volatile variables. This is like
6681 STRIP_TYPE_NOPS but includes the main variant lookup. */
6682 STRIP_USELESS_TYPE_CONVERSION (expr
);
6684 if (TREE_CODE (expr
) == INDIRECT_REF
)
6686 expr
= TREE_OPERAND (expr
, 0);
6688 && (CONVERT_EXPR_P (expr
)
6689 || TREE_CODE (expr
) == NON_LVALUE_EXPR
)
6690 && TREE_CODE (expr
) == TREE_CODE (addr
)
6691 && types_compatible_p (TREE_TYPE (expr
), TREE_TYPE (addr
)))
6693 expr
= TREE_OPERAND (expr
, 0);
6694 addr
= TREE_OPERAND (addr
, 0);
6698 return (TREE_CODE (addr
) == ADDR_EXPR
6699 && TREE_CODE (expr
) == ADDR_EXPR
6700 && TREE_OPERAND (addr
, 0) == TREE_OPERAND (expr
, 0));
6702 if (TREE_CODE (addr
) == ADDR_EXPR
&& expr
== TREE_OPERAND (addr
, 0))
6707 /* Walk *EXPR_P and replace appearances of *LHS_ADDR with LHS_VAR. If an
6708 expression does not involve the lhs, evaluate it into a temporary.
6709 Return 1 if the lhs appeared as a subexpression, 0 if it did not,
6710 or -1 if an error was encountered. */
6713 goa_stabilize_expr (tree
*expr_p
, gimple_seq
*pre_p
, tree lhs_addr
,
6716 tree expr
= *expr_p
;
6719 if (goa_lhs_expr_p (expr
, lhs_addr
))
6724 if (is_gimple_val (expr
))
6728 switch (TREE_CODE_CLASS (TREE_CODE (expr
)))
6731 case tcc_comparison
:
6732 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 1), pre_p
, lhs_addr
,
6735 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 0), pre_p
, lhs_addr
,
6738 case tcc_expression
:
6739 switch (TREE_CODE (expr
))
6741 case TRUTH_ANDIF_EXPR
:
6742 case TRUTH_ORIF_EXPR
:
6743 case TRUTH_AND_EXPR
:
6745 case TRUTH_XOR_EXPR
:
6746 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 1), pre_p
,
6748 case TRUTH_NOT_EXPR
:
6749 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 0), pre_p
,
6753 /* Break out any preevaluations from cp_build_modify_expr. */
6754 for (; TREE_CODE (expr
) == COMPOUND_EXPR
;
6755 expr
= TREE_OPERAND (expr
, 1))
6756 gimplify_stmt (&TREE_OPERAND (expr
, 0), pre_p
);
6758 return goa_stabilize_expr (expr_p
, pre_p
, lhs_addr
, lhs_var
);
6769 enum gimplify_status gs
;
6770 gs
= gimplify_expr (expr_p
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
);
6771 if (gs
!= GS_ALL_DONE
)
6778 /* Gimplify an OMP_ATOMIC statement. */
6780 static enum gimplify_status
6781 gimplify_omp_atomic (tree
*expr_p
, gimple_seq
*pre_p
)
6783 tree addr
= TREE_OPERAND (*expr_p
, 0);
6784 tree rhs
= TREE_CODE (*expr_p
) == OMP_ATOMIC_READ
6785 ? NULL
: TREE_OPERAND (*expr_p
, 1);
6786 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr
)));
6788 gimple loadstmt
, storestmt
;
6790 tmp_load
= create_tmp_reg (type
, NULL
);
6791 if (rhs
&& goa_stabilize_expr (&rhs
, pre_p
, addr
, tmp_load
) < 0)
6794 if (gimplify_expr (&addr
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
)
6798 loadstmt
= gimple_build_omp_atomic_load (tmp_load
, addr
);
6799 gimplify_seq_add_stmt (pre_p
, loadstmt
);
6800 if (rhs
&& gimplify_expr (&rhs
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
)
6804 if (TREE_CODE (*expr_p
) == OMP_ATOMIC_READ
)
6806 storestmt
= gimple_build_omp_atomic_store (rhs
);
6807 gimplify_seq_add_stmt (pre_p
, storestmt
);
6808 switch (TREE_CODE (*expr_p
))
6810 case OMP_ATOMIC_READ
:
6811 case OMP_ATOMIC_CAPTURE_OLD
:
6813 gimple_omp_atomic_set_need_value (loadstmt
);
6815 case OMP_ATOMIC_CAPTURE_NEW
:
6817 gimple_omp_atomic_set_need_value (storestmt
);
6827 /* Gimplify a TRANSACTION_EXPR. This involves gimplification of the
6828 body, and adding some EH bits. */
6830 static enum gimplify_status
6831 gimplify_transaction (tree
*expr_p
, gimple_seq
*pre_p
)
6833 tree expr
= *expr_p
, temp
, tbody
= TRANSACTION_EXPR_BODY (expr
);
6835 gimple_seq body
= NULL
;
6836 struct gimplify_ctx gctx
;
6839 /* Wrap the transaction body in a BIND_EXPR so we have a context
6840 where to put decls for OpenMP. */
6841 if (TREE_CODE (tbody
) != BIND_EXPR
)
6843 tree bind
= build3 (BIND_EXPR
, void_type_node
, NULL
, tbody
, NULL
);
6844 TREE_SIDE_EFFECTS (bind
) = 1;
6845 SET_EXPR_LOCATION (bind
, EXPR_LOCATION (tbody
));
6846 TRANSACTION_EXPR_BODY (expr
) = bind
;
6849 push_gimplify_context (&gctx
);
6850 temp
= voidify_wrapper_expr (*expr_p
, NULL
);
6852 g
= gimplify_and_return_first (TRANSACTION_EXPR_BODY (expr
), &body
);
6853 pop_gimplify_context (g
);
6855 g
= gimple_build_transaction (body
, NULL
);
6856 if (TRANSACTION_EXPR_OUTER (expr
))
6857 subcode
= GTMA_IS_OUTER
;
6858 else if (TRANSACTION_EXPR_RELAXED (expr
))
6859 subcode
= GTMA_IS_RELAXED
;
6860 gimple_transaction_set_subcode (g
, subcode
);
6862 gimplify_seq_add_stmt (pre_p
, g
);
6870 *expr_p
= NULL_TREE
;
6874 /* Convert the GENERIC expression tree *EXPR_P to GIMPLE. If the
6875 expression produces a value to be used as an operand inside a GIMPLE
6876 statement, the value will be stored back in *EXPR_P. This value will
6877 be a tree of class tcc_declaration, tcc_constant, tcc_reference or
6878 an SSA_NAME. The corresponding sequence of GIMPLE statements is
6879 emitted in PRE_P and POST_P.
6881 Additionally, this process may overwrite parts of the input
6882 expression during gimplification. Ideally, it should be
6883 possible to do non-destructive gimplification.
6885 EXPR_P points to the GENERIC expression to convert to GIMPLE. If
6886 the expression needs to evaluate to a value to be used as
6887 an operand in a GIMPLE statement, this value will be stored in
6888 *EXPR_P on exit. This happens when the caller specifies one
6889 of fb_lvalue or fb_rvalue fallback flags.
6891 PRE_P will contain the sequence of GIMPLE statements corresponding
6892 to the evaluation of EXPR and all the side-effects that must
6893 be executed before the main expression. On exit, the last
6894 statement of PRE_P is the core statement being gimplified. For
6895 instance, when gimplifying 'if (++a)' the last statement in
6896 PRE_P will be 'if (t.1)' where t.1 is the result of
6897 pre-incrementing 'a'.
6899 POST_P will contain the sequence of GIMPLE statements corresponding
6900 to the evaluation of all the side-effects that must be executed
6901 after the main expression. If this is NULL, the post
6902 side-effects are stored at the end of PRE_P.
6904 The reason why the output is split in two is to handle post
6905 side-effects explicitly. In some cases, an expression may have
6906 inner and outer post side-effects which need to be emitted in
6907 an order different from the one given by the recursive
6908 traversal. For instance, for the expression (*p--)++ the post
6909 side-effects of '--' must actually occur *after* the post
6910 side-effects of '++'. However, gimplification will first visit
6911 the inner expression, so if a separate POST sequence was not
6912 used, the resulting sequence would be:
6919 However, the post-decrement operation in line #2 must not be
6920 evaluated until after the store to *p at line #4, so the
6921 correct sequence should be:
6928 So, by specifying a separate post queue, it is possible
6929 to emit the post side-effects in the correct order.
6930 If POST_P is NULL, an internal queue will be used. Before
6931 returning to the caller, the sequence POST_P is appended to
6932 the main output sequence PRE_P.
6934 GIMPLE_TEST_F points to a function that takes a tree T and
6935 returns nonzero if T is in the GIMPLE form requested by the
6936 caller. The GIMPLE predicates are in gimple.c.
6938 FALLBACK tells the function what sort of a temporary we want if
6939 gimplification cannot produce an expression that complies with
6942 fb_none means that no temporary should be generated
6943 fb_rvalue means that an rvalue is OK to generate
6944 fb_lvalue means that an lvalue is OK to generate
6945 fb_either means that either is OK, but an lvalue is preferable.
6946 fb_mayfail means that gimplification may fail (in which case
6947 GS_ERROR will be returned)
6949 The return value is either GS_ERROR or GS_ALL_DONE, since this
6950 function iterates until EXPR is completely gimplified or an error
6953 enum gimplify_status
6954 gimplify_expr (tree
*expr_p
, gimple_seq
*pre_p
, gimple_seq
*post_p
,
6955 bool (*gimple_test_f
) (tree
), fallback_t fallback
)
6958 gimple_seq internal_pre
= NULL
;
6959 gimple_seq internal_post
= NULL
;
6962 location_t saved_location
;
6963 enum gimplify_status ret
;
6964 gimple_stmt_iterator pre_last_gsi
, post_last_gsi
;
6966 save_expr
= *expr_p
;
6967 if (save_expr
== NULL_TREE
)
6970 /* If we are gimplifying a top-level statement, PRE_P must be valid. */
6971 is_statement
= gimple_test_f
== is_gimple_stmt
;
6975 /* Consistency checks. */
6976 if (gimple_test_f
== is_gimple_reg
)
6977 gcc_assert (fallback
& (fb_rvalue
| fb_lvalue
));
6978 else if (gimple_test_f
== is_gimple_val
6979 || gimple_test_f
== is_gimple_call_addr
6980 || gimple_test_f
== is_gimple_condexpr
6981 || gimple_test_f
== is_gimple_mem_rhs
6982 || gimple_test_f
== is_gimple_mem_rhs_or_call
6983 || gimple_test_f
== is_gimple_reg_rhs
6984 || gimple_test_f
== is_gimple_reg_rhs_or_call
6985 || gimple_test_f
== is_gimple_asm_val
6986 || gimple_test_f
== is_gimple_mem_ref_addr
)
6987 gcc_assert (fallback
& fb_rvalue
);
6988 else if (gimple_test_f
== is_gimple_min_lval
6989 || gimple_test_f
== is_gimple_lvalue
)
6990 gcc_assert (fallback
& fb_lvalue
);
6991 else if (gimple_test_f
== is_gimple_addressable
)
6992 gcc_assert (fallback
& fb_either
);
6993 else if (gimple_test_f
== is_gimple_stmt
)
6994 gcc_assert (fallback
== fb_none
);
6997 /* We should have recognized the GIMPLE_TEST_F predicate to
6998 know what kind of fallback to use in case a temporary is
6999 needed to hold the value or address of *EXPR_P. */
7003 /* We used to check the predicate here and return immediately if it
7004 succeeds. This is wrong; the design is for gimplification to be
7005 idempotent, and for the predicates to only test for valid forms, not
7006 whether they are fully simplified. */
7008 pre_p
= &internal_pre
;
7011 post_p
= &internal_post
;
7013 /* Remember the last statements added to PRE_P and POST_P. Every
7014 new statement added by the gimplification helpers needs to be
7015 annotated with location information. To centralize the
7016 responsibility, we remember the last statement that had been
7017 added to both queues before gimplifying *EXPR_P. If
7018 gimplification produces new statements in PRE_P and POST_P, those
7019 statements will be annotated with the same location information
7021 pre_last_gsi
= gsi_last (*pre_p
);
7022 post_last_gsi
= gsi_last (*post_p
);
7024 saved_location
= input_location
;
7025 if (save_expr
!= error_mark_node
7026 && EXPR_HAS_LOCATION (*expr_p
))
7027 input_location
= EXPR_LOCATION (*expr_p
);
7029 /* Loop over the specific gimplifiers until the toplevel node
7030 remains the same. */
7033 /* Strip away as many useless type conversions as possible
7035 STRIP_USELESS_TYPE_CONVERSION (*expr_p
);
7037 /* Remember the expr. */
7038 save_expr
= *expr_p
;
7040 /* Die, die, die, my darling. */
7041 if (save_expr
== error_mark_node
7042 || (TREE_TYPE (save_expr
)
7043 && TREE_TYPE (save_expr
) == error_mark_node
))
7049 /* Do any language-specific gimplification. */
7050 ret
= ((enum gimplify_status
)
7051 lang_hooks
.gimplify_expr (expr_p
, pre_p
, post_p
));
7054 if (*expr_p
== NULL_TREE
)
7056 if (*expr_p
!= save_expr
)
7059 else if (ret
!= GS_UNHANDLED
)
7062 /* Make sure that all the cases set 'ret' appropriately. */
7064 switch (TREE_CODE (*expr_p
))
7066 /* First deal with the special cases. */
7068 case POSTINCREMENT_EXPR
:
7069 case POSTDECREMENT_EXPR
:
7070 case PREINCREMENT_EXPR
:
7071 case PREDECREMENT_EXPR
:
7072 ret
= gimplify_self_mod_expr (expr_p
, pre_p
, post_p
,
7073 fallback
!= fb_none
);
7077 case ARRAY_RANGE_REF
:
7081 case VIEW_CONVERT_EXPR
:
7082 ret
= gimplify_compound_lval (expr_p
, pre_p
, post_p
,
7083 fallback
? fallback
: fb_rvalue
);
7087 ret
= gimplify_cond_expr (expr_p
, pre_p
, fallback
);
7089 /* C99 code may assign to an array in a structure value of a
7090 conditional expression, and this has undefined behavior
7091 only on execution, so create a temporary if an lvalue is
7093 if (fallback
== fb_lvalue
)
7095 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
7096 mark_addressable (*expr_p
);
7102 ret
= gimplify_call_expr (expr_p
, pre_p
, fallback
!= fb_none
);
7104 /* C99 code may assign to an array in a structure returned
7105 from a function, and this has undefined behavior only on
7106 execution, so create a temporary if an lvalue is
7108 if (fallback
== fb_lvalue
)
7110 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
7111 mark_addressable (*expr_p
);
7120 ret
= gimplify_compound_expr (expr_p
, pre_p
, fallback
!= fb_none
);
7123 case COMPOUND_LITERAL_EXPR
:
7124 ret
= gimplify_compound_literal_expr (expr_p
, pre_p
,
7125 gimple_test_f
, fallback
);
7130 ret
= gimplify_modify_expr (expr_p
, pre_p
, post_p
,
7131 fallback
!= fb_none
);
7134 case TRUTH_ANDIF_EXPR
:
7135 case TRUTH_ORIF_EXPR
:
7137 /* Preserve the original type of the expression and the
7138 source location of the outer expression. */
7139 tree org_type
= TREE_TYPE (*expr_p
);
7140 *expr_p
= gimple_boolify (*expr_p
);
7141 *expr_p
= build3_loc (input_location
, COND_EXPR
,
7145 org_type
, boolean_true_node
),
7148 org_type
, boolean_false_node
));
7153 case TRUTH_NOT_EXPR
:
7155 tree type
= TREE_TYPE (*expr_p
);
7156 /* The parsers are careful to generate TRUTH_NOT_EXPR
7157 only with operands that are always zero or one.
7158 We do not fold here but handle the only interesting case
7159 manually, as fold may re-introduce the TRUTH_NOT_EXPR. */
7160 *expr_p
= gimple_boolify (*expr_p
);
7161 if (TYPE_PRECISION (TREE_TYPE (*expr_p
)) == 1)
7162 *expr_p
= build1_loc (input_location
, BIT_NOT_EXPR
,
7163 TREE_TYPE (*expr_p
),
7164 TREE_OPERAND (*expr_p
, 0));
7166 *expr_p
= build2_loc (input_location
, BIT_XOR_EXPR
,
7167 TREE_TYPE (*expr_p
),
7168 TREE_OPERAND (*expr_p
, 0),
7169 build_int_cst (TREE_TYPE (*expr_p
), 1));
7170 if (!useless_type_conversion_p (type
, TREE_TYPE (*expr_p
)))
7171 *expr_p
= fold_convert_loc (input_location
, type
, *expr_p
);
7177 ret
= gimplify_addr_expr (expr_p
, pre_p
, post_p
);
7181 ret
= gimplify_va_arg_expr (expr_p
, pre_p
, post_p
);
7185 if (IS_EMPTY_STMT (*expr_p
))
7191 if (VOID_TYPE_P (TREE_TYPE (*expr_p
))
7192 || fallback
== fb_none
)
7194 /* Just strip a conversion to void (or in void context) and
7196 *expr_p
= TREE_OPERAND (*expr_p
, 0);
7201 ret
= gimplify_conversion (expr_p
);
7202 if (ret
== GS_ERROR
)
7204 if (*expr_p
!= save_expr
)
7208 case FIX_TRUNC_EXPR
:
7209 /* unary_expr: ... | '(' cast ')' val | ... */
7210 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
7211 is_gimple_val
, fb_rvalue
);
7212 recalculate_side_effects (*expr_p
);
7217 bool volatilep
= TREE_THIS_VOLATILE (*expr_p
);
7218 bool notrap
= TREE_THIS_NOTRAP (*expr_p
);
7219 tree saved_ptr_type
= TREE_TYPE (TREE_OPERAND (*expr_p
, 0));
7221 *expr_p
= fold_indirect_ref_loc (input_location
, *expr_p
);
7222 if (*expr_p
!= save_expr
)
7228 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
7229 is_gimple_reg
, fb_rvalue
);
7230 if (ret
== GS_ERROR
)
7233 recalculate_side_effects (*expr_p
);
7234 *expr_p
= fold_build2_loc (input_location
, MEM_REF
,
7235 TREE_TYPE (*expr_p
),
7236 TREE_OPERAND (*expr_p
, 0),
7237 build_int_cst (saved_ptr_type
, 0));
7238 TREE_THIS_VOLATILE (*expr_p
) = volatilep
;
7239 TREE_THIS_NOTRAP (*expr_p
) = notrap
;
7244 /* We arrive here through the various re-gimplifcation paths. */
7246 /* First try re-folding the whole thing. */
7247 tmp
= fold_binary (MEM_REF
, TREE_TYPE (*expr_p
),
7248 TREE_OPERAND (*expr_p
, 0),
7249 TREE_OPERAND (*expr_p
, 1));
7253 recalculate_side_effects (*expr_p
);
7257 /* Avoid re-gimplifying the address operand if it is already
7258 in suitable form. Re-gimplifying would mark the address
7259 operand addressable. Always gimplify when not in SSA form
7260 as we still may have to gimplify decls with value-exprs. */
7261 if (!gimplify_ctxp
|| !gimplify_ctxp
->into_ssa
7262 || !is_gimple_mem_ref_addr (TREE_OPERAND (*expr_p
, 0)))
7264 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
7265 is_gimple_mem_ref_addr
, fb_rvalue
);
7266 if (ret
== GS_ERROR
)
7269 recalculate_side_effects (*expr_p
);
7273 /* Constants need not be gimplified. */
7284 /* If we require an lvalue, such as for ADDR_EXPR, retain the
7285 CONST_DECL node. Otherwise the decl is replaceable by its
7287 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
7288 if (fallback
& fb_lvalue
)
7292 *expr_p
= DECL_INITIAL (*expr_p
);
7298 ret
= gimplify_decl_expr (expr_p
, pre_p
);
7302 ret
= gimplify_bind_expr (expr_p
, pre_p
);
7306 ret
= gimplify_loop_expr (expr_p
, pre_p
);
7310 ret
= gimplify_switch_expr (expr_p
, pre_p
);
7314 ret
= gimplify_exit_expr (expr_p
);
7318 /* If the target is not LABEL, then it is a computed jump
7319 and the target needs to be gimplified. */
7320 if (TREE_CODE (GOTO_DESTINATION (*expr_p
)) != LABEL_DECL
)
7322 ret
= gimplify_expr (&GOTO_DESTINATION (*expr_p
), pre_p
,
7323 NULL
, is_gimple_val
, fb_rvalue
);
7324 if (ret
== GS_ERROR
)
7327 gimplify_seq_add_stmt (pre_p
,
7328 gimple_build_goto (GOTO_DESTINATION (*expr_p
)));
7333 gimplify_seq_add_stmt (pre_p
,
7334 gimple_build_predict (PREDICT_EXPR_PREDICTOR (*expr_p
),
7335 PREDICT_EXPR_OUTCOME (*expr_p
)));
7341 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p
))
7342 == current_function_decl
);
7343 gimplify_seq_add_stmt (pre_p
,
7344 gimple_build_label (LABEL_EXPR_LABEL (*expr_p
)));
7347 case CASE_LABEL_EXPR
:
7348 ret
= gimplify_case_label_expr (expr_p
, pre_p
);
7352 ret
= gimplify_return_expr (*expr_p
, pre_p
);
7356 /* Don't reduce this in place; let gimplify_init_constructor work its
7357 magic. Buf if we're just elaborating this for side effects, just
7358 gimplify any element that has side-effects. */
7359 if (fallback
== fb_none
)
7361 unsigned HOST_WIDE_INT ix
;
7363 tree temp
= NULL_TREE
;
7364 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (*expr_p
), ix
, val
)
7365 if (TREE_SIDE_EFFECTS (val
))
7366 append_to_statement_list (val
, &temp
);
7369 ret
= temp
? GS_OK
: GS_ALL_DONE
;
7371 /* C99 code may assign to an array in a constructed
7372 structure or union, and this has undefined behavior only
7373 on execution, so create a temporary if an lvalue is
7375 else if (fallback
== fb_lvalue
)
7377 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
7378 mark_addressable (*expr_p
);
7385 /* The following are special cases that are not handled by the
7386 original GIMPLE grammar. */
7388 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
7391 ret
= gimplify_save_expr (expr_p
, pre_p
, post_p
);
7395 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
7396 post_p
, is_gimple_lvalue
, fb_either
);
7397 recalculate_side_effects (*expr_p
);
7400 case TARGET_MEM_REF
:
7402 enum gimplify_status r0
= GS_ALL_DONE
, r1
= GS_ALL_DONE
;
7404 if (TMR_BASE (*expr_p
))
7405 r0
= gimplify_expr (&TMR_BASE (*expr_p
), pre_p
,
7406 post_p
, is_gimple_mem_ref_addr
, fb_either
);
7407 if (TMR_INDEX (*expr_p
))
7408 r1
= gimplify_expr (&TMR_INDEX (*expr_p
), pre_p
,
7409 post_p
, is_gimple_val
, fb_rvalue
);
7410 if (TMR_INDEX2 (*expr_p
))
7411 r1
= gimplify_expr (&TMR_INDEX2 (*expr_p
), pre_p
,
7412 post_p
, is_gimple_val
, fb_rvalue
);
7413 /* TMR_STEP and TMR_OFFSET are always integer constants. */
7418 case NON_LVALUE_EXPR
:
7419 /* This should have been stripped above. */
7423 ret
= gimplify_asm_expr (expr_p
, pre_p
, post_p
);
7426 case TRY_FINALLY_EXPR
:
7427 case TRY_CATCH_EXPR
:
7429 gimple_seq eval
, cleanup
;
7432 eval
= cleanup
= NULL
;
7433 gimplify_and_add (TREE_OPERAND (*expr_p
, 0), &eval
);
7434 gimplify_and_add (TREE_OPERAND (*expr_p
, 1), &cleanup
);
7435 /* Don't create bogus GIMPLE_TRY with empty cleanup. */
7436 if (gimple_seq_empty_p (cleanup
))
7438 gimple_seq_add_seq (pre_p
, eval
);
7442 try_
= gimple_build_try (eval
, cleanup
,
7443 TREE_CODE (*expr_p
) == TRY_FINALLY_EXPR
7444 ? GIMPLE_TRY_FINALLY
7445 : GIMPLE_TRY_CATCH
);
7446 if (TREE_CODE (*expr_p
) == TRY_CATCH_EXPR
)
7447 gimple_try_set_catch_is_cleanup (try_
,
7448 TRY_CATCH_IS_CLEANUP (*expr_p
));
7449 gimplify_seq_add_stmt (pre_p
, try_
);
7454 case CLEANUP_POINT_EXPR
:
7455 ret
= gimplify_cleanup_point_expr (expr_p
, pre_p
);
7459 ret
= gimplify_target_expr (expr_p
, pre_p
, post_p
);
7465 gimple_seq handler
= NULL
;
7466 gimplify_and_add (CATCH_BODY (*expr_p
), &handler
);
7467 c
= gimple_build_catch (CATCH_TYPES (*expr_p
), handler
);
7468 gimplify_seq_add_stmt (pre_p
, c
);
7473 case EH_FILTER_EXPR
:
7476 gimple_seq failure
= NULL
;
7478 gimplify_and_add (EH_FILTER_FAILURE (*expr_p
), &failure
);
7479 ehf
= gimple_build_eh_filter (EH_FILTER_TYPES (*expr_p
), failure
);
7480 gimple_set_no_warning (ehf
, TREE_NO_WARNING (*expr_p
));
7481 gimplify_seq_add_stmt (pre_p
, ehf
);
7488 enum gimplify_status r0
, r1
;
7489 r0
= gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p
), pre_p
,
7490 post_p
, is_gimple_val
, fb_rvalue
);
7491 r1
= gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p
), pre_p
,
7492 post_p
, is_gimple_val
, fb_rvalue
);
7493 TREE_SIDE_EFFECTS (*expr_p
) = 0;
7499 /* We get here when taking the address of a label. We mark
7500 the label as "forced"; meaning it can never be removed and
7501 it is a potential target for any computed goto. */
7502 FORCED_LABEL (*expr_p
) = 1;
7506 case STATEMENT_LIST
:
7507 ret
= gimplify_statement_list (expr_p
, pre_p
);
7510 case WITH_SIZE_EXPR
:
7512 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
7513 post_p
== &internal_post
? NULL
: post_p
,
7514 gimple_test_f
, fallback
);
7515 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
7516 is_gimple_val
, fb_rvalue
);
7523 ret
= gimplify_var_or_parm_decl (expr_p
);
7527 /* When within an OpenMP context, notice uses of variables. */
7528 if (gimplify_omp_ctxp
)
7529 omp_notice_variable (gimplify_omp_ctxp
, *expr_p
, true);
7534 /* Allow callbacks into the gimplifier during optimization. */
7539 gimplify_omp_parallel (expr_p
, pre_p
);
7544 gimplify_omp_task (expr_p
, pre_p
);
7549 ret
= gimplify_omp_for (expr_p
, pre_p
);
7554 gimplify_omp_workshare (expr_p
, pre_p
);
7563 gimple_seq body
= NULL
;
7566 gimplify_and_add (OMP_BODY (*expr_p
), &body
);
7567 switch (TREE_CODE (*expr_p
))
7570 g
= gimple_build_omp_section (body
);
7573 g
= gimple_build_omp_master (body
);
7576 g
= gimple_build_omp_ordered (body
);
7579 g
= gimple_build_omp_critical (body
,
7580 OMP_CRITICAL_NAME (*expr_p
));
7585 gimplify_seq_add_stmt (pre_p
, g
);
7591 case OMP_ATOMIC_READ
:
7592 case OMP_ATOMIC_CAPTURE_OLD
:
7593 case OMP_ATOMIC_CAPTURE_NEW
:
7594 ret
= gimplify_omp_atomic (expr_p
, pre_p
);
7597 case TRANSACTION_EXPR
:
7598 ret
= gimplify_transaction (expr_p
, pre_p
);
7601 case TRUTH_AND_EXPR
:
7603 case TRUTH_XOR_EXPR
:
7605 tree orig_type
= TREE_TYPE (*expr_p
);
7606 tree new_type
, xop0
, xop1
;
7607 *expr_p
= gimple_boolify (*expr_p
);
7608 new_type
= TREE_TYPE (*expr_p
);
7609 if (!useless_type_conversion_p (orig_type
, new_type
))
7611 *expr_p
= fold_convert_loc (input_location
, orig_type
, *expr_p
);
7616 /* Boolified binary truth expressions are semantically equivalent
7617 to bitwise binary expressions. Canonicalize them to the
7619 switch (TREE_CODE (*expr_p
))
7621 case TRUTH_AND_EXPR
:
7622 TREE_SET_CODE (*expr_p
, BIT_AND_EXPR
);
7625 TREE_SET_CODE (*expr_p
, BIT_IOR_EXPR
);
7627 case TRUTH_XOR_EXPR
:
7628 TREE_SET_CODE (*expr_p
, BIT_XOR_EXPR
);
7633 /* Now make sure that operands have compatible type to
7634 expression's new_type. */
7635 xop0
= TREE_OPERAND (*expr_p
, 0);
7636 xop1
= TREE_OPERAND (*expr_p
, 1);
7637 if (!useless_type_conversion_p (new_type
, TREE_TYPE (xop0
)))
7638 TREE_OPERAND (*expr_p
, 0) = fold_convert_loc (input_location
,
7641 if (!useless_type_conversion_p (new_type
, TREE_TYPE (xop1
)))
7642 TREE_OPERAND (*expr_p
, 1) = fold_convert_loc (input_location
,
7645 /* Continue classified as tcc_binary. */
7651 /* Classified as tcc_expression. */
7654 case POINTER_PLUS_EXPR
:
7656 enum gimplify_status r0
, r1
;
7657 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
7658 post_p
, is_gimple_val
, fb_rvalue
);
7659 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
,
7660 post_p
, is_gimple_val
, fb_rvalue
);
7661 recalculate_side_effects (*expr_p
);
7663 /* Convert &X + CST to invariant &MEM[&X, CST]. Do this
7664 after gimplifying operands - this is similar to how
7665 it would be folding all gimplified stmts on creation
7666 to have them canonicalized, which is what we eventually
7667 should do anyway. */
7668 if (TREE_CODE (TREE_OPERAND (*expr_p
, 1)) == INTEGER_CST
7669 && is_gimple_min_invariant (TREE_OPERAND (*expr_p
, 0)))
7671 *expr_p
= build_fold_addr_expr_with_type_loc
7673 fold_build2 (MEM_REF
, TREE_TYPE (TREE_TYPE (*expr_p
)),
7674 TREE_OPERAND (*expr_p
, 0),
7675 fold_convert (ptr_type_node
,
7676 TREE_OPERAND (*expr_p
, 1))),
7677 TREE_TYPE (*expr_p
));
7678 ret
= MIN (ret
, GS_OK
);
7684 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p
)))
7686 case tcc_comparison
:
7687 /* Handle comparison of objects of non scalar mode aggregates
7688 with a call to memcmp. It would be nice to only have to do
7689 this for variable-sized objects, but then we'd have to allow
7690 the same nest of reference nodes we allow for MODIFY_EXPR and
7693 Compare scalar mode aggregates as scalar mode values. Using
7694 memcmp for them would be very inefficient at best, and is
7695 plain wrong if bitfields are involved. */
7697 tree type
= TREE_TYPE (TREE_OPERAND (*expr_p
, 1));
7699 /* Vector comparisons need no boolification. */
7700 if (TREE_CODE (type
) == VECTOR_TYPE
)
7702 else if (!AGGREGATE_TYPE_P (type
))
7704 tree org_type
= TREE_TYPE (*expr_p
);
7705 *expr_p
= gimple_boolify (*expr_p
);
7706 if (!useless_type_conversion_p (org_type
,
7707 TREE_TYPE (*expr_p
)))
7709 *expr_p
= fold_convert_loc (input_location
,
7716 else if (TYPE_MODE (type
) != BLKmode
)
7717 ret
= gimplify_scalar_mode_aggregate_compare (expr_p
);
7719 ret
= gimplify_variable_sized_compare (expr_p
);
7724 /* If *EXPR_P does not need to be special-cased, handle it
7725 according to its class. */
7727 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
7728 post_p
, is_gimple_val
, fb_rvalue
);
7734 enum gimplify_status r0
, r1
;
7736 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
7737 post_p
, is_gimple_val
, fb_rvalue
);
7738 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
,
7739 post_p
, is_gimple_val
, fb_rvalue
);
7747 enum gimplify_status r0
, r1
, r2
;
7749 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
7750 post_p
, is_gimple_val
, fb_rvalue
);
7751 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
,
7752 post_p
, is_gimple_val
, fb_rvalue
);
7753 r2
= gimplify_expr (&TREE_OPERAND (*expr_p
, 2), pre_p
,
7754 post_p
, is_gimple_val
, fb_rvalue
);
7756 ret
= MIN (MIN (r0
, r1
), r2
);
7760 case tcc_declaration
:
7763 goto dont_recalculate
;
7769 recalculate_side_effects (*expr_p
);
7775 gcc_assert (*expr_p
|| ret
!= GS_OK
);
7777 while (ret
== GS_OK
);
7779 /* If we encountered an error_mark somewhere nested inside, either
7780 stub out the statement or propagate the error back out. */
7781 if (ret
== GS_ERROR
)
7788 /* This was only valid as a return value from the langhook, which
7789 we handled. Make sure it doesn't escape from any other context. */
7790 gcc_assert (ret
!= GS_UNHANDLED
);
7792 if (fallback
== fb_none
&& *expr_p
&& !is_gimple_stmt (*expr_p
))
7794 /* We aren't looking for a value, and we don't have a valid
7795 statement. If it doesn't have side-effects, throw it away. */
7796 if (!TREE_SIDE_EFFECTS (*expr_p
))
7798 else if (!TREE_THIS_VOLATILE (*expr_p
))
7800 /* This is probably a _REF that contains something nested that
7801 has side effects. Recurse through the operands to find it. */
7802 enum tree_code code
= TREE_CODE (*expr_p
);
7809 case VIEW_CONVERT_EXPR
:
7810 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
7811 gimple_test_f
, fallback
);
7815 case ARRAY_RANGE_REF
:
7816 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
7817 gimple_test_f
, fallback
);
7818 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
7819 gimple_test_f
, fallback
);
7823 /* Anything else with side-effects must be converted to
7824 a valid statement before we get here. */
7830 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p
))
7831 && TYPE_MODE (TREE_TYPE (*expr_p
)) != BLKmode
)
7833 /* Historically, the compiler has treated a bare reference
7834 to a non-BLKmode volatile lvalue as forcing a load. */
7835 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p
));
7837 /* Normally, we do not want to create a temporary for a
7838 TREE_ADDRESSABLE type because such a type should not be
7839 copied by bitwise-assignment. However, we make an
7840 exception here, as all we are doing here is ensuring that
7841 we read the bytes that make up the type. We use
7842 create_tmp_var_raw because create_tmp_var will abort when
7843 given a TREE_ADDRESSABLE type. */
7844 tree tmp
= create_tmp_var_raw (type
, "vol");
7845 gimple_add_tmp_var (tmp
);
7846 gimplify_assign (tmp
, *expr_p
, pre_p
);
7850 /* We can't do anything useful with a volatile reference to
7851 an incomplete type, so just throw it away. Likewise for
7852 a BLKmode type, since any implicit inner load should
7853 already have been turned into an explicit one by the
7854 gimplification process. */
7858 /* If we are gimplifying at the statement level, we're done. Tack
7859 everything together and return. */
7860 if (fallback
== fb_none
|| is_statement
)
7862 /* Since *EXPR_P has been converted into a GIMPLE tuple, clear
7863 it out for GC to reclaim it. */
7864 *expr_p
= NULL_TREE
;
7866 if (!gimple_seq_empty_p (internal_pre
)
7867 || !gimple_seq_empty_p (internal_post
))
7869 gimplify_seq_add_seq (&internal_pre
, internal_post
);
7870 gimplify_seq_add_seq (pre_p
, internal_pre
);
7873 /* The result of gimplifying *EXPR_P is going to be the last few
7874 statements in *PRE_P and *POST_P. Add location information
7875 to all the statements that were added by the gimplification
7877 if (!gimple_seq_empty_p (*pre_p
))
7878 annotate_all_with_location_after (*pre_p
, pre_last_gsi
, input_location
);
7880 if (!gimple_seq_empty_p (*post_p
))
7881 annotate_all_with_location_after (*post_p
, post_last_gsi
,
7887 #ifdef ENABLE_GIMPLE_CHECKING
7890 enum tree_code code
= TREE_CODE (*expr_p
);
7891 /* These expressions should already be in gimple IR form. */
7892 gcc_assert (code
!= MODIFY_EXPR
7894 && code
!= BIND_EXPR
7895 && code
!= CATCH_EXPR
7896 && (code
!= COND_EXPR
|| gimplify_ctxp
->allow_rhs_cond_expr
)
7897 && code
!= EH_FILTER_EXPR
7898 && code
!= GOTO_EXPR
7899 && code
!= LABEL_EXPR
7900 && code
!= LOOP_EXPR
7901 && code
!= SWITCH_EXPR
7902 && code
!= TRY_FINALLY_EXPR
7903 && code
!= OMP_CRITICAL
7905 && code
!= OMP_MASTER
7906 && code
!= OMP_ORDERED
7907 && code
!= OMP_PARALLEL
7908 && code
!= OMP_SECTIONS
7909 && code
!= OMP_SECTION
7910 && code
!= OMP_SINGLE
);
7914 /* Otherwise we're gimplifying a subexpression, so the resulting
7915 value is interesting. If it's a valid operand that matches
7916 GIMPLE_TEST_F, we're done. Unless we are handling some
7917 post-effects internally; if that's the case, we need to copy into
7918 a temporary before adding the post-effects to POST_P. */
7919 if (gimple_seq_empty_p (internal_post
) && (*gimple_test_f
) (*expr_p
))
7922 /* Otherwise, we need to create a new temporary for the gimplified
7925 /* We can't return an lvalue if we have an internal postqueue. The
7926 object the lvalue refers to would (probably) be modified by the
7927 postqueue; we need to copy the value out first, which means an
7929 if ((fallback
& fb_lvalue
)
7930 && gimple_seq_empty_p (internal_post
)
7931 && is_gimple_addressable (*expr_p
))
7933 /* An lvalue will do. Take the address of the expression, store it
7934 in a temporary, and replace the expression with an INDIRECT_REF of
7936 tmp
= build_fold_addr_expr_loc (input_location
, *expr_p
);
7937 gimplify_expr (&tmp
, pre_p
, post_p
, is_gimple_reg
, fb_rvalue
);
7938 *expr_p
= build_simple_mem_ref (tmp
);
7940 else if ((fallback
& fb_rvalue
) && is_gimple_reg_rhs_or_call (*expr_p
))
7942 /* An rvalue will do. Assign the gimplified expression into a
7943 new temporary TMP and replace the original expression with
7944 TMP. First, make sure that the expression has a type so that
7945 it can be assigned into a temporary. */
7946 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p
)));
7947 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
7951 #ifdef ENABLE_GIMPLE_CHECKING
7952 if (!(fallback
& fb_mayfail
))
7954 fprintf (stderr
, "gimplification failed:\n");
7955 print_generic_expr (stderr
, *expr_p
, 0);
7956 debug_tree (*expr_p
);
7957 internal_error ("gimplification failed");
7960 gcc_assert (fallback
& fb_mayfail
);
7962 /* If this is an asm statement, and the user asked for the
7963 impossible, don't die. Fail and let gimplify_asm_expr
7969 /* Make sure the temporary matches our predicate. */
7970 gcc_assert ((*gimple_test_f
) (*expr_p
));
7972 if (!gimple_seq_empty_p (internal_post
))
7974 annotate_all_with_location (internal_post
, input_location
);
7975 gimplify_seq_add_seq (pre_p
, internal_post
);
7979 input_location
= saved_location
;
7983 /* Look through TYPE for variable-sized objects and gimplify each such
7984 size that we find. Add to LIST_P any statements generated. */
7987 gimplify_type_sizes (tree type
, gimple_seq
*list_p
)
7991 if (type
== NULL
|| type
== error_mark_node
)
7994 /* We first do the main variant, then copy into any other variants. */
7995 type
= TYPE_MAIN_VARIANT (type
);
7997 /* Avoid infinite recursion. */
7998 if (TYPE_SIZES_GIMPLIFIED (type
))
8001 TYPE_SIZES_GIMPLIFIED (type
) = 1;
8003 switch (TREE_CODE (type
))
8009 case FIXED_POINT_TYPE
:
8010 gimplify_one_sizepos (&TYPE_MIN_VALUE (type
), list_p
);
8011 gimplify_one_sizepos (&TYPE_MAX_VALUE (type
), list_p
);
8013 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
8015 TYPE_MIN_VALUE (t
) = TYPE_MIN_VALUE (type
);
8016 TYPE_MAX_VALUE (t
) = TYPE_MAX_VALUE (type
);
8021 /* These types may not have declarations, so handle them here. */
8022 gimplify_type_sizes (TREE_TYPE (type
), list_p
);
8023 gimplify_type_sizes (TYPE_DOMAIN (type
), list_p
);
8024 /* Ensure VLA bounds aren't removed, for -O0 they should be variables
8025 with assigned stack slots, for -O1+ -g they should be tracked
8027 if (!(TYPE_NAME (type
)
8028 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
8029 && DECL_IGNORED_P (TYPE_NAME (type
)))
8030 && TYPE_DOMAIN (type
)
8031 && INTEGRAL_TYPE_P (TYPE_DOMAIN (type
)))
8033 t
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
8034 if (t
&& TREE_CODE (t
) == VAR_DECL
&& DECL_ARTIFICIAL (t
))
8035 DECL_IGNORED_P (t
) = 0;
8036 t
= TYPE_MAX_VALUE (TYPE_DOMAIN (type
));
8037 if (t
&& TREE_CODE (t
) == VAR_DECL
&& DECL_ARTIFICIAL (t
))
8038 DECL_IGNORED_P (t
) = 0;
8044 case QUAL_UNION_TYPE
:
8045 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
8046 if (TREE_CODE (field
) == FIELD_DECL
)
8048 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field
), list_p
);
8049 gimplify_one_sizepos (&DECL_SIZE (field
), list_p
);
8050 gimplify_one_sizepos (&DECL_SIZE_UNIT (field
), list_p
);
8051 gimplify_type_sizes (TREE_TYPE (field
), list_p
);
8056 case REFERENCE_TYPE
:
8057 /* We used to recurse on the pointed-to type here, which turned out to
8058 be incorrect because its definition might refer to variables not
8059 yet initialized at this point if a forward declaration is involved.
8061 It was actually useful for anonymous pointed-to types to ensure
8062 that the sizes evaluation dominates every possible later use of the
8063 values. Restricting to such types here would be safe since there
8064 is no possible forward declaration around, but would introduce an
8065 undesirable middle-end semantic to anonymity. We then defer to
8066 front-ends the responsibility of ensuring that the sizes are
8067 evaluated both early and late enough, e.g. by attaching artificial
8068 type declarations to the tree. */
8075 gimplify_one_sizepos (&TYPE_SIZE (type
), list_p
);
8076 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type
), list_p
);
8078 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
8080 TYPE_SIZE (t
) = TYPE_SIZE (type
);
8081 TYPE_SIZE_UNIT (t
) = TYPE_SIZE_UNIT (type
);
8082 TYPE_SIZES_GIMPLIFIED (t
) = 1;
8086 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
8087 a size or position, has had all of its SAVE_EXPRs evaluated.
8088 We add any required statements to *STMT_P. */
8091 gimplify_one_sizepos (tree
*expr_p
, gimple_seq
*stmt_p
)
8093 tree expr
= *expr_p
;
8095 /* We don't do anything if the value isn't there, is constant, or contains
8096 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
8097 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
8098 will want to replace it with a new variable, but that will cause problems
8099 if this type is from outside the function. It's OK to have that here. */
8100 if (expr
== NULL_TREE
|| TREE_CONSTANT (expr
)
8101 || TREE_CODE (expr
) == VAR_DECL
8102 || CONTAINS_PLACEHOLDER_P (expr
))
8105 *expr_p
= unshare_expr (expr
);
8107 gimplify_expr (expr_p
, stmt_p
, NULL
, is_gimple_val
, fb_rvalue
);
8111 /* Gimplify the body of statements of FNDECL and return a GIMPLE_BIND node
8112 containing the sequence of corresponding GIMPLE statements. If DO_PARMS
8113 is true, also gimplify the parameters. */
8116 gimplify_body (tree fndecl
, bool do_parms
)
8118 location_t saved_location
= input_location
;
8119 gimple_seq parm_stmts
, seq
;
8121 struct gimplify_ctx gctx
;
8122 struct cgraph_node
*cgn
;
8124 timevar_push (TV_TREE_GIMPLIFY
);
8126 /* Initialize for optimize_insn_for_s{ize,peed}_p possibly called during
8128 default_rtl_profile ();
8130 gcc_assert (gimplify_ctxp
== NULL
);
8131 push_gimplify_context (&gctx
);
8133 /* Unshare most shared trees in the body and in that of any nested functions.
8134 It would seem we don't have to do this for nested functions because
8135 they are supposed to be output and then the outer function gimplified
8136 first, but the g++ front end doesn't always do it that way. */
8137 unshare_body (fndecl
);
8138 unvisit_body (fndecl
);
8140 cgn
= cgraph_get_node (fndecl
);
8141 if (cgn
&& cgn
->origin
)
8142 nonlocal_vlas
= pointer_set_create ();
8144 /* Make sure input_location isn't set to something weird. */
8145 input_location
= DECL_SOURCE_LOCATION (fndecl
);
8147 /* Resolve callee-copies. This has to be done before processing
8148 the body so that DECL_VALUE_EXPR gets processed correctly. */
8149 parm_stmts
= do_parms
? gimplify_parameters () : NULL
;
8151 /* Gimplify the function's body. */
8153 gimplify_stmt (&DECL_SAVED_TREE (fndecl
), &seq
);
8154 outer_bind
= gimple_seq_first_stmt (seq
);
8157 outer_bind
= gimple_build_nop ();
8158 gimplify_seq_add_stmt (&seq
, outer_bind
);
8161 /* The body must contain exactly one statement, a GIMPLE_BIND. If this is
8162 not the case, wrap everything in a GIMPLE_BIND to make it so. */
8163 if (gimple_code (outer_bind
) == GIMPLE_BIND
8164 && gimple_seq_first (seq
) == gimple_seq_last (seq
))
8167 outer_bind
= gimple_build_bind (NULL_TREE
, seq
, NULL
);
8169 DECL_SAVED_TREE (fndecl
) = NULL_TREE
;
8171 /* If we had callee-copies statements, insert them at the beginning
8172 of the function and clear DECL_VALUE_EXPR_P on the parameters. */
8173 if (!gimple_seq_empty_p (parm_stmts
))
8177 gimplify_seq_add_seq (&parm_stmts
, gimple_bind_body (outer_bind
));
8178 gimple_bind_set_body (outer_bind
, parm_stmts
);
8180 for (parm
= DECL_ARGUMENTS (current_function_decl
);
8181 parm
; parm
= DECL_CHAIN (parm
))
8182 if (DECL_HAS_VALUE_EXPR_P (parm
))
8184 DECL_HAS_VALUE_EXPR_P (parm
) = 0;
8185 DECL_IGNORED_P (parm
) = 0;
8191 pointer_set_destroy (nonlocal_vlas
);
8192 nonlocal_vlas
= NULL
;
8195 pop_gimplify_context (outer_bind
);
8196 gcc_assert (gimplify_ctxp
== NULL
);
8198 #ifdef ENABLE_CHECKING
8200 verify_gimple_in_seq (gimple_bind_body (outer_bind
));
8203 timevar_pop (TV_TREE_GIMPLIFY
);
8204 input_location
= saved_location
;
8209 typedef char *char_p
; /* For DEF_VEC_P. */
8211 DEF_VEC_ALLOC_P(char_p
,heap
);
8213 /* Return whether we should exclude FNDECL from instrumentation. */
8216 flag_instrument_functions_exclude_p (tree fndecl
)
8218 VEC(char_p
,heap
) *vec
;
8220 vec
= (VEC(char_p
,heap
) *) flag_instrument_functions_exclude_functions
;
8221 if (VEC_length (char_p
, vec
) > 0)
8227 name
= lang_hooks
.decl_printable_name (fndecl
, 0);
8228 FOR_EACH_VEC_ELT (char_p
, vec
, i
, s
)
8229 if (strstr (name
, s
) != NULL
)
8233 vec
= (VEC(char_p
,heap
) *) flag_instrument_functions_exclude_files
;
8234 if (VEC_length (char_p
, vec
) > 0)
8240 name
= DECL_SOURCE_FILE (fndecl
);
8241 FOR_EACH_VEC_ELT (char_p
, vec
, i
, s
)
8242 if (strstr (name
, s
) != NULL
)
8249 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
8250 node for the function we want to gimplify.
8252 Return the sequence of GIMPLE statements corresponding to the body
8256 gimplify_function_tree (tree fndecl
)
8258 tree oldfn
, parm
, ret
;
8262 gcc_assert (!gimple_body (fndecl
));
8264 oldfn
= current_function_decl
;
8265 current_function_decl
= fndecl
;
8266 if (DECL_STRUCT_FUNCTION (fndecl
))
8267 push_cfun (DECL_STRUCT_FUNCTION (fndecl
));
8269 push_struct_function (fndecl
);
8271 for (parm
= DECL_ARGUMENTS (fndecl
); parm
; parm
= DECL_CHAIN (parm
))
8273 /* Preliminarily mark non-addressed complex variables as eligible
8274 for promotion to gimple registers. We'll transform their uses
8276 if ((TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
8277 || TREE_CODE (TREE_TYPE (parm
)) == VECTOR_TYPE
)
8278 && !TREE_THIS_VOLATILE (parm
)
8279 && !needs_to_live_in_memory (parm
))
8280 DECL_GIMPLE_REG_P (parm
) = 1;
8283 ret
= DECL_RESULT (fndecl
);
8284 if ((TREE_CODE (TREE_TYPE (ret
)) == COMPLEX_TYPE
8285 || TREE_CODE (TREE_TYPE (ret
)) == VECTOR_TYPE
)
8286 && !needs_to_live_in_memory (ret
))
8287 DECL_GIMPLE_REG_P (ret
) = 1;
8289 bind
= gimplify_body (fndecl
, true);
8291 /* The tree body of the function is no longer needed, replace it
8292 with the new GIMPLE body. */
8294 gimple_seq_add_stmt (&seq
, bind
);
8295 gimple_set_body (fndecl
, seq
);
8297 /* If we're instrumenting function entry/exit, then prepend the call to
8298 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
8299 catch the exit hook. */
8300 /* ??? Add some way to ignore exceptions for this TFE. */
8301 if (flag_instrument_function_entry_exit
8302 && !DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl
)
8303 && !flag_instrument_functions_exclude_p (fndecl
))
8308 gimple_seq cleanup
= NULL
, body
= NULL
;
8312 x
= builtin_decl_implicit (BUILT_IN_RETURN_ADDRESS
);
8313 call
= gimple_build_call (x
, 1, integer_zero_node
);
8314 tmp_var
= create_tmp_var (ptr_type_node
, "return_addr");
8315 gimple_call_set_lhs (call
, tmp_var
);
8316 gimplify_seq_add_stmt (&cleanup
, call
);
8317 x
= builtin_decl_implicit (BUILT_IN_PROFILE_FUNC_EXIT
);
8318 call
= gimple_build_call (x
, 2,
8319 build_fold_addr_expr (current_function_decl
),
8321 gimplify_seq_add_stmt (&cleanup
, call
);
8322 tf
= gimple_build_try (seq
, cleanup
, GIMPLE_TRY_FINALLY
);
8324 x
= builtin_decl_implicit (BUILT_IN_RETURN_ADDRESS
);
8325 call
= gimple_build_call (x
, 1, integer_zero_node
);
8326 tmp_var
= create_tmp_var (ptr_type_node
, "return_addr");
8327 gimple_call_set_lhs (call
, tmp_var
);
8328 gimplify_seq_add_stmt (&body
, call
);
8329 x
= builtin_decl_implicit (BUILT_IN_PROFILE_FUNC_ENTER
);
8330 call
= gimple_build_call (x
, 2,
8331 build_fold_addr_expr (current_function_decl
),
8333 gimplify_seq_add_stmt (&body
, call
);
8334 gimplify_seq_add_stmt (&body
, tf
);
8335 new_bind
= gimple_build_bind (NULL
, body
, gimple_bind_block (bind
));
8336 /* Clear the block for BIND, since it is no longer directly inside
8337 the function, but within a try block. */
8338 gimple_bind_set_block (bind
, NULL
);
8340 /* Replace the current function body with the body
8341 wrapped in the try/finally TF. */
8343 gimple_seq_add_stmt (&seq
, new_bind
);
8344 gimple_set_body (fndecl
, seq
);
8347 DECL_SAVED_TREE (fndecl
) = NULL_TREE
;
8348 cfun
->curr_properties
= PROP_gimple_any
;
8350 current_function_decl
= oldfn
;
8354 /* Some transformations like inlining may invalidate the GIMPLE form
8355 for operands. This function traverses all the operands in STMT and
8356 gimplifies anything that is not a valid gimple operand. Any new
8357 GIMPLE statements are inserted before *GSI_P. */
8360 gimple_regimplify_operands (gimple stmt
, gimple_stmt_iterator
*gsi_p
)
8364 gimple_seq pre
= NULL
;
8365 gimple post_stmt
= NULL
;
8366 struct gimplify_ctx gctx
;
8368 push_gimplify_context (&gctx
);
8369 gimplify_ctxp
->into_ssa
= gimple_in_ssa_p (cfun
);
8371 switch (gimple_code (stmt
))
8374 gimplify_expr (gimple_cond_lhs_ptr (stmt
), &pre
, NULL
,
8375 is_gimple_val
, fb_rvalue
);
8376 gimplify_expr (gimple_cond_rhs_ptr (stmt
), &pre
, NULL
,
8377 is_gimple_val
, fb_rvalue
);
8380 gimplify_expr (gimple_switch_index_ptr (stmt
), &pre
, NULL
,
8381 is_gimple_val
, fb_rvalue
);
8383 case GIMPLE_OMP_ATOMIC_LOAD
:
8384 gimplify_expr (gimple_omp_atomic_load_rhs_ptr (stmt
), &pre
, NULL
,
8385 is_gimple_val
, fb_rvalue
);
8389 size_t i
, noutputs
= gimple_asm_noutputs (stmt
);
8390 const char *constraint
, **oconstraints
;
8391 bool allows_mem
, allows_reg
, is_inout
;
8394 = (const char **) alloca ((noutputs
) * sizeof (const char *));
8395 for (i
= 0; i
< noutputs
; i
++)
8397 tree op
= gimple_asm_output_op (stmt
, i
);
8398 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op
)));
8399 oconstraints
[i
] = constraint
;
8400 parse_output_constraint (&constraint
, i
, 0, 0, &allows_mem
,
8401 &allows_reg
, &is_inout
);
8402 gimplify_expr (&TREE_VALUE (op
), &pre
, NULL
,
8403 is_inout
? is_gimple_min_lval
: is_gimple_lvalue
,
8404 fb_lvalue
| fb_mayfail
);
8406 for (i
= 0; i
< gimple_asm_ninputs (stmt
); i
++)
8408 tree op
= gimple_asm_input_op (stmt
, i
);
8409 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op
)));
8410 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
8411 oconstraints
, &allows_mem
, &allows_reg
);
8412 if (TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (op
))) && allows_mem
)
8414 if (!allows_reg
&& allows_mem
)
8415 gimplify_expr (&TREE_VALUE (op
), &pre
, NULL
,
8416 is_gimple_lvalue
, fb_lvalue
| fb_mayfail
);
8418 gimplify_expr (&TREE_VALUE (op
), &pre
, NULL
,
8419 is_gimple_asm_val
, fb_rvalue
);
8424 /* NOTE: We start gimplifying operands from last to first to
8425 make sure that side-effects on the RHS of calls, assignments
8426 and ASMs are executed before the LHS. The ordering is not
8427 important for other statements. */
8428 num_ops
= gimple_num_ops (stmt
);
8429 for (i
= num_ops
; i
> 0; i
--)
8431 tree op
= gimple_op (stmt
, i
- 1);
8432 if (op
== NULL_TREE
)
8434 if (i
== 1 && (is_gimple_call (stmt
) || is_gimple_assign (stmt
)))
8435 gimplify_expr (&op
, &pre
, NULL
, is_gimple_lvalue
, fb_lvalue
);
8437 && is_gimple_assign (stmt
)
8439 && get_gimple_rhs_class (gimple_expr_code (stmt
))
8440 == GIMPLE_SINGLE_RHS
)
8441 gimplify_expr (&op
, &pre
, NULL
,
8442 rhs_predicate_for (gimple_assign_lhs (stmt
)),
8444 else if (i
== 2 && is_gimple_call (stmt
))
8446 if (TREE_CODE (op
) == FUNCTION_DECL
)
8448 gimplify_expr (&op
, &pre
, NULL
, is_gimple_call_addr
, fb_rvalue
);
8451 gimplify_expr (&op
, &pre
, NULL
, is_gimple_val
, fb_rvalue
);
8452 gimple_set_op (stmt
, i
- 1, op
);
8455 lhs
= gimple_get_lhs (stmt
);
8456 /* If the LHS changed it in a way that requires a simple RHS,
8457 create temporary. */
8458 if (lhs
&& !is_gimple_reg (lhs
))
8460 bool need_temp
= false;
8462 if (is_gimple_assign (stmt
)
8464 && get_gimple_rhs_class (gimple_expr_code (stmt
))
8465 == GIMPLE_SINGLE_RHS
)
8466 gimplify_expr (gimple_assign_rhs1_ptr (stmt
), &pre
, NULL
,
8467 rhs_predicate_for (gimple_assign_lhs (stmt
)),
8469 else if (is_gimple_reg (lhs
))
8471 if (is_gimple_reg_type (TREE_TYPE (lhs
)))
8473 if (is_gimple_call (stmt
))
8475 i
= gimple_call_flags (stmt
);
8476 if ((i
& ECF_LOOPING_CONST_OR_PURE
)
8477 || !(i
& (ECF_CONST
| ECF_PURE
)))
8480 if (stmt_can_throw_internal (stmt
))
8486 if (is_gimple_reg_type (TREE_TYPE (lhs
)))
8488 else if (TYPE_MODE (TREE_TYPE (lhs
)) != BLKmode
)
8490 if (is_gimple_call (stmt
))
8492 tree fndecl
= gimple_call_fndecl (stmt
);
8494 if (!aggregate_value_p (TREE_TYPE (lhs
), fndecl
)
8495 && !(fndecl
&& DECL_RESULT (fndecl
)
8496 && DECL_BY_REFERENCE (DECL_RESULT (fndecl
))))
8505 tree temp
= create_tmp_reg (TREE_TYPE (lhs
), NULL
);
8506 if (gimple_in_ssa_p (cfun
))
8507 temp
= make_ssa_name (temp
, NULL
);
8508 gimple_set_lhs (stmt
, temp
);
8509 post_stmt
= gimple_build_assign (lhs
, temp
);
8510 if (TREE_CODE (lhs
) == SSA_NAME
)
8511 SSA_NAME_DEF_STMT (lhs
) = post_stmt
;
8517 if (!gimple_seq_empty_p (pre
))
8518 gsi_insert_seq_before (gsi_p
, pre
, GSI_SAME_STMT
);
8520 gsi_insert_after (gsi_p
, post_stmt
, GSI_NEW_STMT
);
8522 pop_gimplify_context (NULL
);
8525 /* Expand EXPR to list of gimple statements STMTS. GIMPLE_TEST_F specifies
8526 the predicate that will hold for the result. If VAR is not NULL, make the
8527 base variable of the final destination be VAR if suitable. */
8530 force_gimple_operand_1 (tree expr
, gimple_seq
*stmts
,
8531 gimple_predicate gimple_test_f
, tree var
)
8533 enum gimplify_status ret
;
8534 struct gimplify_ctx gctx
;
8538 /* gimple_test_f might be more strict than is_gimple_val, make
8539 sure we pass both. Just checking gimple_test_f doesn't work
8540 because most gimple predicates do not work recursively. */
8541 if (is_gimple_val (expr
)
8542 && (*gimple_test_f
) (expr
))
8545 push_gimplify_context (&gctx
);
8546 gimplify_ctxp
->into_ssa
= gimple_in_ssa_p (cfun
);
8547 gimplify_ctxp
->allow_rhs_cond_expr
= true;
8551 if (gimplify_ctxp
->into_ssa
8552 && is_gimple_reg (var
))
8553 var
= make_ssa_name (var
, NULL
);
8554 expr
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, expr
);
8557 if (TREE_CODE (expr
) != MODIFY_EXPR
8558 && TREE_TYPE (expr
) == void_type_node
)
8560 gimplify_and_add (expr
, stmts
);
8565 ret
= gimplify_expr (&expr
, stmts
, NULL
, gimple_test_f
, fb_rvalue
);
8566 gcc_assert (ret
!= GS_ERROR
);
8569 pop_gimplify_context (NULL
);
8574 /* Expand EXPR to list of gimple statements STMTS. If SIMPLE is true,
8575 force the result to be either ssa_name or an invariant, otherwise
8576 just force it to be a rhs expression. If VAR is not NULL, make the
8577 base variable of the final destination be VAR if suitable. */
8580 force_gimple_operand (tree expr
, gimple_seq
*stmts
, bool simple
, tree var
)
8582 return force_gimple_operand_1 (expr
, stmts
,
8583 simple
? is_gimple_val
: is_gimple_reg_rhs
,
8587 /* Invoke force_gimple_operand_1 for EXPR with parameters GIMPLE_TEST_F
8588 and VAR. If some statements are produced, emits them at GSI.
8589 If BEFORE is true. the statements are appended before GSI, otherwise
8590 they are appended after it. M specifies the way GSI moves after
8591 insertion (GSI_SAME_STMT or GSI_CONTINUE_LINKING are the usual values). */
8594 force_gimple_operand_gsi_1 (gimple_stmt_iterator
*gsi
, tree expr
,
8595 gimple_predicate gimple_test_f
,
8596 tree var
, bool before
,
8597 enum gsi_iterator_update m
)
8601 expr
= force_gimple_operand_1 (expr
, &stmts
, gimple_test_f
, var
);
8603 if (!gimple_seq_empty_p (stmts
))
8606 gsi_insert_seq_before (gsi
, stmts
, m
);
8608 gsi_insert_seq_after (gsi
, stmts
, m
);
8614 /* Invoke force_gimple_operand_1 for EXPR with parameter VAR.
8615 If SIMPLE is true, force the result to be either ssa_name or an invariant,
8616 otherwise just force it to be a rhs expression. If some statements are
8617 produced, emits them at GSI. If BEFORE is true, the statements are
8618 appended before GSI, otherwise they are appended after it. M specifies
8619 the way GSI moves after insertion (GSI_SAME_STMT or GSI_CONTINUE_LINKING
8620 are the usual values). */
8623 force_gimple_operand_gsi (gimple_stmt_iterator
*gsi
, tree expr
,
8624 bool simple_p
, tree var
, bool before
,
8625 enum gsi_iterator_update m
)
8627 return force_gimple_operand_gsi_1 (gsi
, expr
,
8629 ? is_gimple_val
: is_gimple_reg_rhs
,
8634 #include "gt-gimplify.h"