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 Free Software Foundation, Inc.
4 Major work done by Sebastian Pop <s.pop@laposte.net>,
5 Diego Novillo <dnovillo@redhat.com> and Jason Merrill <jason@redhat.com>.
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify it under
10 the terms of the GNU General Public License as published by the Free
11 Software Foundation; either version 2, or (at your option) any later
14 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
15 WARRANTY; without even the implied warranty of MERCHANTABILITY or
16 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING. If not, write to the Free
21 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
26 #include "coretypes.h"
31 #include "tree-gimple.h"
32 #include "tree-inline.h"
33 #include "diagnostic.h"
34 #include "langhooks.h"
35 #include "langhooks-def.h"
36 #include "tree-flow.h"
50 #include "pointer-set.h"
53 enum gimplify_omp_var_data
59 GOVD_FIRSTPRIVATE
= 16,
60 GOVD_LASTPRIVATE
= 32,
63 GOVD_DEBUG_PRIVATE
= 256,
64 GOVD_DATA_SHARE_CLASS
= (GOVD_SHARED
| GOVD_PRIVATE
| GOVD_FIRSTPRIVATE
65 | GOVD_LASTPRIVATE
| GOVD_REDUCTION
| GOVD_LOCAL
)
68 struct gimplify_omp_ctx
70 struct gimplify_omp_ctx
*outer_context
;
72 struct pointer_set_t
*privatized_types
;
74 enum omp_clause_default_kind default_kind
;
76 bool is_combined_parallel
;
81 struct gimplify_ctx
*prev_context
;
83 tree current_bind_expr
;
85 tree conditional_cleanups
;
89 VEC(tree
,heap
) *case_labels
;
90 /* The formal temporary table. Should this be persistent? */
98 static struct gimplify_ctx
*gimplify_ctxp
;
99 static struct gimplify_omp_ctx
*gimplify_omp_ctxp
;
103 /* Formal (expression) temporary table handling: Multiple occurrences of
104 the same scalar expression are evaluated into the same temporary. */
106 typedef struct gimple_temp_hash_elt
109 tree temp
; /* Value */
112 /* Forward declarations. */
113 static enum gimplify_status
gimplify_compound_expr (tree
*, tree
*, bool);
114 #ifdef ENABLE_CHECKING
115 static bool cpt_same_type (tree a
, tree b
);
119 /* Return a hash value for a formal temporary table entry. */
122 gimple_tree_hash (const void *p
)
124 tree t
= ((const elt_t
*) p
)->val
;
125 return iterative_hash_expr (t
, 0);
128 /* Compare two formal temporary table entries. */
131 gimple_tree_eq (const void *p1
, const void *p2
)
133 tree t1
= ((const elt_t
*) p1
)->val
;
134 tree t2
= ((const elt_t
*) p2
)->val
;
135 enum tree_code code
= TREE_CODE (t1
);
137 if (TREE_CODE (t2
) != code
138 || TREE_TYPE (t1
) != TREE_TYPE (t2
))
141 if (!operand_equal_p (t1
, t2
, 0))
144 /* Only allow them to compare equal if they also hash equal; otherwise
145 results are nondeterminate, and we fail bootstrap comparison. */
146 gcc_assert (gimple_tree_hash (p1
) == gimple_tree_hash (p2
));
151 /* Set up a context for the gimplifier. */
154 push_gimplify_context (void)
156 struct gimplify_ctx
*c
;
158 c
= (struct gimplify_ctx
*) xcalloc (1, sizeof (struct gimplify_ctx
));
159 c
->prev_context
= gimplify_ctxp
;
161 c
->temp_htab
= htab_create (1000, gimple_tree_hash
, gimple_tree_eq
, free
);
166 /* Tear down a context for the gimplifier. If BODY is non-null, then
167 put the temporaries into the outer BIND_EXPR. Otherwise, put them
168 in the unexpanded_var_list. */
171 pop_gimplify_context (tree body
)
173 struct gimplify_ctx
*c
= gimplify_ctxp
;
176 gcc_assert (c
&& !c
->current_bind_expr
);
177 gimplify_ctxp
= c
->prev_context
;
179 for (t
= c
->temps
; t
; t
= TREE_CHAIN (t
))
180 DECL_GIMPLE_FORMAL_TEMP_P (t
) = 0;
183 declare_vars (c
->temps
, body
, false);
185 record_vars (c
->temps
);
188 htab_delete (c
->temp_htab
);
193 gimple_push_bind_expr (tree bind
)
195 TREE_CHAIN (bind
) = gimplify_ctxp
->current_bind_expr
;
196 gimplify_ctxp
->current_bind_expr
= bind
;
200 gimple_pop_bind_expr (void)
202 gimplify_ctxp
->current_bind_expr
203 = TREE_CHAIN (gimplify_ctxp
->current_bind_expr
);
207 gimple_current_bind_expr (void)
209 return gimplify_ctxp
->current_bind_expr
;
212 /* Returns true iff there is a COND_EXPR between us and the innermost
213 CLEANUP_POINT_EXPR. This info is used by gimple_push_cleanup. */
216 gimple_conditional_context (void)
218 return gimplify_ctxp
->conditions
> 0;
221 /* Note that we've entered a COND_EXPR. */
224 gimple_push_condition (void)
226 #ifdef ENABLE_CHECKING
227 if (gimplify_ctxp
->conditions
== 0)
228 gcc_assert (!gimplify_ctxp
->conditional_cleanups
);
230 ++(gimplify_ctxp
->conditions
);
233 /* Note that we've left a COND_EXPR. If we're back at unconditional scope
234 now, add any conditional cleanups we've seen to the prequeue. */
237 gimple_pop_condition (tree
*pre_p
)
239 int conds
= --(gimplify_ctxp
->conditions
);
241 gcc_assert (conds
>= 0);
244 append_to_statement_list (gimplify_ctxp
->conditional_cleanups
, pre_p
);
245 gimplify_ctxp
->conditional_cleanups
= NULL_TREE
;
249 /* A stable comparison routine for use with splay trees and DECLs. */
252 splay_tree_compare_decl_uid (splay_tree_key xa
, splay_tree_key xb
)
257 return DECL_UID (a
) - DECL_UID (b
);
260 /* Create a new omp construct that deals with variable remapping. */
262 static struct gimplify_omp_ctx
*
263 new_omp_context (bool is_parallel
, bool is_combined_parallel
)
265 struct gimplify_omp_ctx
*c
;
267 c
= XCNEW (struct gimplify_omp_ctx
);
268 c
->outer_context
= gimplify_omp_ctxp
;
269 c
->variables
= splay_tree_new (splay_tree_compare_decl_uid
, 0, 0);
270 c
->privatized_types
= pointer_set_create ();
271 c
->location
= input_location
;
272 c
->is_parallel
= is_parallel
;
273 c
->is_combined_parallel
= is_combined_parallel
;
274 c
->default_kind
= OMP_CLAUSE_DEFAULT_SHARED
;
279 /* Destroy an omp construct that deals with variable remapping. */
282 delete_omp_context (struct gimplify_omp_ctx
*c
)
284 splay_tree_delete (c
->variables
);
285 pointer_set_destroy (c
->privatized_types
);
289 static void omp_add_variable (struct gimplify_omp_ctx
*, tree
, unsigned int);
290 static bool omp_notice_variable (struct gimplify_omp_ctx
*, tree
, bool);
292 /* A subroutine of append_to_statement_list{,_force}. T is not NULL. */
295 append_to_statement_list_1 (tree t
, tree
*list_p
)
298 tree_stmt_iterator i
;
302 if (t
&& TREE_CODE (t
) == STATEMENT_LIST
)
307 *list_p
= list
= alloc_stmt_list ();
311 tsi_link_after (&i
, t
, TSI_CONTINUE_LINKING
);
314 /* Add T to the end of the list container pointed to by LIST_P.
315 If T is an expression with no effects, it is ignored. */
318 append_to_statement_list (tree t
, tree
*list_p
)
320 if (t
&& TREE_SIDE_EFFECTS (t
))
321 append_to_statement_list_1 (t
, list_p
);
324 /* Similar, but the statement is always added, regardless of side effects. */
327 append_to_statement_list_force (tree t
, tree
*list_p
)
330 append_to_statement_list_1 (t
, list_p
);
333 /* Both gimplify the statement T and append it to LIST_P. */
336 gimplify_and_add (tree t
, tree
*list_p
)
339 append_to_statement_list (t
, list_p
);
342 /* Strip off a legitimate source ending from the input string NAME of
343 length LEN. Rather than having to know the names used by all of
344 our front ends, we strip off an ending of a period followed by
345 up to five characters. (Java uses ".class".) */
348 remove_suffix (char *name
, int len
)
352 for (i
= 2; i
< 8 && len
> i
; i
++)
354 if (name
[len
- i
] == '.')
356 name
[len
- i
] = '\0';
362 /* Create a nameless artificial label and put it in the current function
363 context. Returns the newly created label. */
366 create_artificial_label (void)
368 tree lab
= build_decl (LABEL_DECL
, NULL_TREE
, void_type_node
);
370 DECL_ARTIFICIAL (lab
) = 1;
371 DECL_IGNORED_P (lab
) = 1;
372 DECL_CONTEXT (lab
) = current_function_decl
;
376 /* Subroutine for find_single_pointer_decl. */
379 find_single_pointer_decl_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
382 tree
*pdecl
= (tree
*) data
;
384 if (DECL_P (*tp
) && POINTER_TYPE_P (TREE_TYPE (*tp
)))
388 /* We already found a pointer decl; return anything other
389 than NULL_TREE to unwind from walk_tree signalling that
390 we have a duplicate. */
399 /* Find the single DECL of pointer type in the tree T and return it.
400 If there are zero or more than one such DECLs, return NULL. */
403 find_single_pointer_decl (tree t
)
405 tree decl
= NULL_TREE
;
407 if (walk_tree (&t
, find_single_pointer_decl_1
, &decl
, NULL
))
409 /* find_single_pointer_decl_1 returns a nonzero value, causing
410 walk_tree to return a nonzero value, to indicate that it
411 found more than one pointer DECL. */
418 /* Create a new temporary name with PREFIX. Returns an identifier. */
420 static GTY(()) unsigned int tmp_var_id_num
;
423 create_tmp_var_name (const char *prefix
)
429 char *preftmp
= ASTRDUP (prefix
);
431 remove_suffix (preftmp
, strlen (preftmp
));
435 ASM_FORMAT_PRIVATE_NAME (tmp_name
, prefix
? prefix
: "T", tmp_var_id_num
++);
436 return get_identifier (tmp_name
);
440 /* Create a new temporary variable declaration of type TYPE.
441 Does NOT push it into the current binding. */
444 create_tmp_var_raw (tree type
, const char *prefix
)
449 /* Make the type of the variable writable. */
450 new_type
= build_type_variant (type
, 0, 0);
451 TYPE_ATTRIBUTES (new_type
) = TYPE_ATTRIBUTES (type
);
453 tmp_var
= build_decl (VAR_DECL
, prefix
? create_tmp_var_name (prefix
) : NULL
,
456 /* The variable was declared by the compiler. */
457 DECL_ARTIFICIAL (tmp_var
) = 1;
458 /* And we don't want debug info for it. */
459 DECL_IGNORED_P (tmp_var
) = 1;
461 /* Make the variable writable. */
462 TREE_READONLY (tmp_var
) = 0;
464 DECL_EXTERNAL (tmp_var
) = 0;
465 TREE_STATIC (tmp_var
) = 0;
466 TREE_USED (tmp_var
) = 1;
471 /* Create a new temporary variable declaration of type TYPE. DOES push the
472 variable into the current binding. Further, assume that this is called
473 only from gimplification or optimization, at which point the creation of
474 certain types are bugs. */
477 create_tmp_var (tree type
, const char *prefix
)
481 /* We don't allow types that are addressable (meaning we can't make copies),
482 or incomplete. We also used to reject every variable size objects here,
483 but now support those for which a constant upper bound can be obtained.
484 The processing for variable sizes is performed in gimple_add_tmp_var,
485 point at which it really matters and possibly reached via paths not going
486 through this function, e.g. after direct calls to create_tmp_var_raw. */
487 gcc_assert (!TREE_ADDRESSABLE (type
) && COMPLETE_TYPE_P (type
));
489 tmp_var
= create_tmp_var_raw (type
, prefix
);
490 gimple_add_tmp_var (tmp_var
);
494 /* Given a tree, try to return a useful variable name that we can use
495 to prefix a temporary that is being assigned the value of the tree.
496 I.E. given <temp> = &A, return A. */
504 STRIP_NOPS (stripped_decl
);
505 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
506 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
509 switch (TREE_CODE (stripped_decl
))
512 return get_name (TREE_OPERAND (stripped_decl
, 0));
520 /* Create a temporary with a name derived from VAL. Subroutine of
521 lookup_tmp_var; nobody else should call this function. */
524 create_tmp_from_val (tree val
)
526 return create_tmp_var (TYPE_MAIN_VARIANT (TREE_TYPE (val
)), get_name (val
));
529 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
530 an existing expression temporary. */
533 lookup_tmp_var (tree val
, bool is_formal
)
537 /* If not optimizing, never really reuse a temporary. local-alloc
538 won't allocate any variable that is used in more than one basic
539 block, which means it will go into memory, causing much extra
540 work in reload and final and poorer code generation, outweighing
541 the extra memory allocation here. */
542 if (!optimize
|| !is_formal
|| TREE_SIDE_EFFECTS (val
))
543 ret
= create_tmp_from_val (val
);
550 slot
= htab_find_slot (gimplify_ctxp
->temp_htab
, (void *)&elt
, INSERT
);
553 elt_p
= XNEW (elt_t
);
555 elt_p
->temp
= ret
= create_tmp_from_val (val
);
556 *slot
= (void *) elt_p
;
560 elt_p
= (elt_t
*) *slot
;
566 DECL_GIMPLE_FORMAL_TEMP_P (ret
) = 1;
571 /* Returns a formal temporary variable initialized with VAL. PRE_P is as
572 in gimplify_expr. Only use this function if:
574 1) The value of the unfactored expression represented by VAL will not
575 change between the initialization and use of the temporary, and
576 2) The temporary will not be otherwise modified.
578 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
579 and #2 means it is inappropriate for && temps.
581 For other cases, use get_initialized_tmp_var instead. */
584 internal_get_tmp_var (tree val
, tree
*pre_p
, tree
*post_p
, bool is_formal
)
588 gimplify_expr (&val
, pre_p
, post_p
, is_gimple_formal_tmp_rhs
, fb_rvalue
);
590 t
= lookup_tmp_var (val
, is_formal
);
594 tree u
= find_single_pointer_decl (val
);
596 if (u
&& TREE_CODE (u
) == VAR_DECL
&& DECL_BASED_ON_RESTRICT_P (u
))
597 u
= DECL_GET_RESTRICT_BASE (u
);
598 if (u
&& TYPE_RESTRICT (TREE_TYPE (u
)))
600 if (DECL_BASED_ON_RESTRICT_P (t
))
601 gcc_assert (u
== DECL_GET_RESTRICT_BASE (t
));
604 DECL_BASED_ON_RESTRICT_P (t
) = 1;
605 SET_DECL_RESTRICT_BASE (t
, u
);
610 if (TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
)
611 DECL_COMPLEX_GIMPLE_REG_P (t
) = 1;
613 mod
= build2 (INIT_EXPR
, TREE_TYPE (t
), t
, val
);
615 if (EXPR_HAS_LOCATION (val
))
616 SET_EXPR_LOCUS (mod
, EXPR_LOCUS (val
));
618 SET_EXPR_LOCATION (mod
, input_location
);
620 /* gimplify_modify_expr might want to reduce this further. */
621 gimplify_and_add (mod
, pre_p
);
623 /* If we're gimplifying into ssa, gimplify_modify_expr will have
624 given our temporary an ssa name. Find and return it. */
625 if (gimplify_ctxp
->into_ssa
)
626 t
= TREE_OPERAND (mod
, 0);
631 /* Returns a formal temporary variable initialized with VAL. PRE_P
632 points to a statement list where side-effects needed to compute VAL
636 get_formal_tmp_var (tree val
, tree
*pre_p
)
638 return internal_get_tmp_var (val
, pre_p
, NULL
, true);
641 /* Returns a temporary variable initialized with VAL. PRE_P and POST_P
642 are as in gimplify_expr. */
645 get_initialized_tmp_var (tree val
, tree
*pre_p
, tree
*post_p
)
647 return internal_get_tmp_var (val
, pre_p
, post_p
, false);
650 /* Declares all the variables in VARS in SCOPE. If DEBUG_INFO is
651 true, generate debug info for them; otherwise don't. */
654 declare_vars (tree vars
, tree scope
, bool debug_info
)
661 /* C99 mode puts the default 'return 0;' for main outside the outer
662 braces. So drill down until we find an actual scope. */
663 while (TREE_CODE (scope
) == COMPOUND_EXPR
)
664 scope
= TREE_OPERAND (scope
, 0);
666 gcc_assert (TREE_CODE (scope
) == BIND_EXPR
);
668 temps
= nreverse (last
);
670 block
= BIND_EXPR_BLOCK (scope
);
671 if (!block
|| !debug_info
)
673 TREE_CHAIN (last
) = BIND_EXPR_VARS (scope
);
674 BIND_EXPR_VARS (scope
) = temps
;
678 /* We need to attach the nodes both to the BIND_EXPR and to its
679 associated BLOCK for debugging purposes. The key point here
680 is that the BLOCK_VARS of the BIND_EXPR_BLOCK of a BIND_EXPR
681 is a subchain of the BIND_EXPR_VARS of the BIND_EXPR. */
682 if (BLOCK_VARS (block
))
683 BLOCK_VARS (block
) = chainon (BLOCK_VARS (block
), temps
);
686 BIND_EXPR_VARS (scope
) = chainon (BIND_EXPR_VARS (scope
), temps
);
687 BLOCK_VARS (block
) = temps
;
693 /* For VAR a VAR_DECL of variable size, try to find a constant upper bound
694 for the size and adjust DECL_SIZE/DECL_SIZE_UNIT accordingly. Abort if
695 no such upper bound can be obtained. */
698 force_constant_size (tree var
)
700 /* The only attempt we make is by querying the maximum size of objects
701 of the variable's type. */
703 HOST_WIDE_INT max_size
;
705 gcc_assert (TREE_CODE (var
) == VAR_DECL
);
707 max_size
= max_int_size_in_bytes (TREE_TYPE (var
));
709 gcc_assert (max_size
>= 0);
712 = build_int_cst (TREE_TYPE (DECL_SIZE_UNIT (var
)), max_size
);
714 = build_int_cst (TREE_TYPE (DECL_SIZE (var
)), max_size
* BITS_PER_UNIT
);
718 gimple_add_tmp_var (tree tmp
)
720 gcc_assert (!TREE_CHAIN (tmp
) && !DECL_SEEN_IN_BIND_EXPR_P (tmp
));
722 /* Later processing assumes that the object size is constant, which might
723 not be true at this point. Force the use of a constant upper bound in
725 if (!host_integerp (DECL_SIZE_UNIT (tmp
), 1))
726 force_constant_size (tmp
);
728 DECL_CONTEXT (tmp
) = current_function_decl
;
729 DECL_SEEN_IN_BIND_EXPR_P (tmp
) = 1;
733 TREE_CHAIN (tmp
) = gimplify_ctxp
->temps
;
734 gimplify_ctxp
->temps
= tmp
;
736 /* Mark temporaries local within the nearest enclosing parallel. */
737 if (gimplify_omp_ctxp
)
739 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
740 while (ctx
&& !ctx
->is_parallel
)
741 ctx
= ctx
->outer_context
;
743 omp_add_variable (ctx
, tmp
, GOVD_LOCAL
| GOVD_SEEN
);
749 declare_vars (tmp
, DECL_SAVED_TREE (current_function_decl
), false);
752 /* Determines whether to assign a locus to the statement STMT. */
755 should_carry_locus_p (tree stmt
)
757 /* Don't emit a line note for a label. We particularly don't want to
758 emit one for the break label, since it doesn't actually correspond
759 to the beginning of the loop/switch. */
760 if (TREE_CODE (stmt
) == LABEL_EXPR
)
763 /* Do not annotate empty statements, since it confuses gcov. */
764 if (!TREE_SIDE_EFFECTS (stmt
))
771 annotate_one_with_locus (tree t
, location_t locus
)
773 if (EXPR_P (t
) && ! EXPR_HAS_LOCATION (t
) && should_carry_locus_p (t
))
774 SET_EXPR_LOCATION (t
, locus
);
778 annotate_all_with_locus (tree
*stmt_p
, location_t locus
)
780 tree_stmt_iterator i
;
785 for (i
= tsi_start (*stmt_p
); !tsi_end_p (i
); tsi_next (&i
))
787 tree t
= tsi_stmt (i
);
789 /* Assuming we've already been gimplified, we shouldn't
790 see nested chaining constructs anymore. */
791 gcc_assert (TREE_CODE (t
) != STATEMENT_LIST
792 && TREE_CODE (t
) != COMPOUND_EXPR
);
794 annotate_one_with_locus (t
, locus
);
798 /* Similar to copy_tree_r() but do not copy SAVE_EXPR or TARGET_EXPR nodes.
799 These nodes model computations that should only be done once. If we
800 were to unshare something like SAVE_EXPR(i++), the gimplification
801 process would create wrong code. */
804 mostly_copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data
)
806 enum tree_code code
= TREE_CODE (*tp
);
807 /* Don't unshare types, decls, constants and SAVE_EXPR nodes. */
808 if (TREE_CODE_CLASS (code
) == tcc_type
809 || TREE_CODE_CLASS (code
) == tcc_declaration
810 || TREE_CODE_CLASS (code
) == tcc_constant
811 || code
== SAVE_EXPR
|| code
== TARGET_EXPR
812 /* We can't do anything sensible with a BLOCK used as an expression,
813 but we also can't just die when we see it because of non-expression
814 uses. So just avert our eyes and cross our fingers. Silly Java. */
819 gcc_assert (code
!= BIND_EXPR
);
820 copy_tree_r (tp
, walk_subtrees
, data
);
826 /* Callback for walk_tree to unshare most of the shared trees rooted at
827 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
828 then *TP is deep copied by calling copy_tree_r.
830 This unshares the same trees as copy_tree_r with the exception of
831 SAVE_EXPR nodes. These nodes model computations that should only be
832 done once. If we were to unshare something like SAVE_EXPR(i++), the
833 gimplification process would create wrong code. */
836 copy_if_shared_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
837 void *data ATTRIBUTE_UNUSED
)
840 enum tree_code code
= TREE_CODE (t
);
842 /* Skip types, decls, and constants. But we do want to look at their
843 types and the bounds of types. Mark them as visited so we properly
844 unmark their subtrees on the unmark pass. If we've already seen them,
845 don't look down further. */
846 if (TREE_CODE_CLASS (code
) == tcc_type
847 || TREE_CODE_CLASS (code
) == tcc_declaration
848 || TREE_CODE_CLASS (code
) == tcc_constant
)
850 if (TREE_VISITED (t
))
853 TREE_VISITED (t
) = 1;
856 /* If this node has been visited already, unshare it and don't look
858 else if (TREE_VISITED (t
))
860 walk_tree (tp
, mostly_copy_tree_r
, NULL
, NULL
);
864 /* Otherwise, mark the tree as visited and keep looking. */
866 TREE_VISITED (t
) = 1;
872 unmark_visited_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
873 void *data ATTRIBUTE_UNUSED
)
875 if (TREE_VISITED (*tp
))
876 TREE_VISITED (*tp
) = 0;
883 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
884 bodies of any nested functions if we are unsharing the entire body of
888 unshare_body (tree
*body_p
, tree fndecl
)
890 struct cgraph_node
*cgn
= cgraph_node (fndecl
);
892 walk_tree (body_p
, copy_if_shared_r
, NULL
, NULL
);
893 if (body_p
== &DECL_SAVED_TREE (fndecl
))
894 for (cgn
= cgn
->nested
; cgn
; cgn
= cgn
->next_nested
)
895 unshare_body (&DECL_SAVED_TREE (cgn
->decl
), cgn
->decl
);
898 /* Likewise, but mark all trees as not visited. */
901 unvisit_body (tree
*body_p
, tree fndecl
)
903 struct cgraph_node
*cgn
= cgraph_node (fndecl
);
905 walk_tree (body_p
, unmark_visited_r
, NULL
, NULL
);
906 if (body_p
== &DECL_SAVED_TREE (fndecl
))
907 for (cgn
= cgn
->nested
; cgn
; cgn
= cgn
->next_nested
)
908 unvisit_body (&DECL_SAVED_TREE (cgn
->decl
), cgn
->decl
);
911 /* Unshare T and all the trees reached from T via TREE_CHAIN. */
914 unshare_all_trees (tree t
)
916 walk_tree (&t
, copy_if_shared_r
, NULL
, NULL
);
917 walk_tree (&t
, unmark_visited_r
, NULL
, NULL
);
920 /* Unconditionally make an unshared copy of EXPR. This is used when using
921 stored expressions which span multiple functions, such as BINFO_VTABLE,
922 as the normal unsharing process can't tell that they're shared. */
925 unshare_expr (tree expr
)
927 walk_tree (&expr
, mostly_copy_tree_r
, NULL
, NULL
);
931 /* A terser interface for building a representation of an exception
935 gimple_build_eh_filter (tree body
, tree allowed
, tree failure
)
939 /* FIXME should the allowed types go in TREE_TYPE? */
940 t
= build2 (EH_FILTER_EXPR
, void_type_node
, allowed
, NULL_TREE
);
941 append_to_statement_list (failure
, &EH_FILTER_FAILURE (t
));
943 t
= build2 (TRY_CATCH_EXPR
, void_type_node
, NULL_TREE
, t
);
944 append_to_statement_list (body
, &TREE_OPERAND (t
, 0));
950 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
951 contain statements and have a value. Assign its value to a temporary
952 and give it void_type_node. Returns the temporary, or NULL_TREE if
953 WRAPPER was already void. */
956 voidify_wrapper_expr (tree wrapper
, tree temp
)
958 if (!VOID_TYPE_P (TREE_TYPE (wrapper
)))
960 tree
*p
, sub
= wrapper
;
963 /* Set p to point to the body of the wrapper. */
964 switch (TREE_CODE (sub
))
967 /* For a BIND_EXPR, the body is operand 1. */
968 p
= &BIND_EXPR_BODY (sub
);
972 p
= &TREE_OPERAND (sub
, 0);
976 /* Advance to the last statement. Set all container types to void. */
977 if (TREE_CODE (*p
) == STATEMENT_LIST
)
979 tree_stmt_iterator i
= tsi_last (*p
);
980 p
= tsi_end_p (i
) ? NULL
: tsi_stmt_ptr (i
);
984 for (; TREE_CODE (*p
) == COMPOUND_EXPR
; p
= &TREE_OPERAND (*p
, 1))
986 TREE_SIDE_EFFECTS (*p
) = 1;
987 TREE_TYPE (*p
) = void_type_node
;
991 if (p
== NULL
|| IS_EMPTY_STMT (*p
))
993 /* Look through exception handling. */
994 else if (TREE_CODE (*p
) == TRY_FINALLY_EXPR
995 || TREE_CODE (*p
) == TRY_CATCH_EXPR
)
1000 /* The C++ frontend already did this for us. */
1001 else if (TREE_CODE (*p
) == INIT_EXPR
1002 || TREE_CODE (*p
) == TARGET_EXPR
)
1003 temp
= TREE_OPERAND (*p
, 0);
1004 /* If we're returning a dereference, move the dereference
1005 outside the wrapper. */
1006 else if (TREE_CODE (*p
) == INDIRECT_REF
)
1008 tree ptr
= TREE_OPERAND (*p
, 0);
1009 temp
= create_tmp_var (TREE_TYPE (ptr
), "retval");
1010 *p
= build2 (MODIFY_EXPR
, TREE_TYPE (ptr
), temp
, ptr
);
1011 temp
= build1 (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (temp
)), temp
);
1012 /* If this is a BIND_EXPR for a const inline function, it might not
1013 have TREE_SIDE_EFFECTS set. That is no longer accurate. */
1014 TREE_SIDE_EFFECTS (wrapper
) = 1;
1019 temp
= create_tmp_var (TREE_TYPE (wrapper
), "retval");
1020 *p
= build2 (MODIFY_EXPR
, TREE_TYPE (temp
), temp
, *p
);
1021 TREE_SIDE_EFFECTS (wrapper
) = 1;
1024 TREE_TYPE (wrapper
) = void_type_node
;
1031 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
1032 a temporary through which they communicate. */
1035 build_stack_save_restore (tree
*save
, tree
*restore
)
1037 tree save_call
, tmp_var
;
1040 build_function_call_expr (implicit_built_in_decls
[BUILT_IN_STACK_SAVE
],
1042 tmp_var
= create_tmp_var (ptr_type_node
, "saved_stack");
1044 *save
= build2 (MODIFY_EXPR
, ptr_type_node
, tmp_var
, save_call
);
1046 build_function_call_expr (implicit_built_in_decls
[BUILT_IN_STACK_RESTORE
],
1047 tree_cons (NULL_TREE
, tmp_var
, NULL_TREE
));
1050 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
1052 static enum gimplify_status
1053 gimplify_bind_expr (tree
*expr_p
, tree temp
, tree
*pre_p
)
1055 tree bind_expr
= *expr_p
;
1056 bool old_save_stack
= gimplify_ctxp
->save_stack
;
1059 temp
= voidify_wrapper_expr (bind_expr
, temp
);
1061 /* Mark variables seen in this bind expr. */
1062 for (t
= BIND_EXPR_VARS (bind_expr
); t
; t
= TREE_CHAIN (t
))
1064 if (TREE_CODE (t
) == VAR_DECL
)
1066 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
1068 /* Mark variable as local. */
1069 if (ctx
&& !is_global_var (t
)
1070 && (! DECL_SEEN_IN_BIND_EXPR_P (t
)
1071 || splay_tree_lookup (ctx
->variables
,
1072 (splay_tree_key
) t
) == NULL
))
1073 omp_add_variable (gimplify_omp_ctxp
, t
, GOVD_LOCAL
| GOVD_SEEN
);
1075 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
1078 /* Preliminarily mark non-addressed complex variables as eligible
1079 for promotion to gimple registers. We'll transform their uses
1081 if (TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
1082 && !TREE_THIS_VOLATILE (t
)
1083 && (TREE_CODE (t
) == VAR_DECL
&& !DECL_HARD_REGISTER (t
))
1084 && !needs_to_live_in_memory (t
))
1085 DECL_COMPLEX_GIMPLE_REG_P (t
) = 1;
1088 gimple_push_bind_expr (bind_expr
);
1089 gimplify_ctxp
->save_stack
= false;
1091 gimplify_to_stmt_list (&BIND_EXPR_BODY (bind_expr
));
1093 if (gimplify_ctxp
->save_stack
)
1095 tree stack_save
, stack_restore
;
1097 /* Save stack on entry and restore it on exit. Add a try_finally
1098 block to achieve this. Note that mudflap depends on the
1099 format of the emitted code: see mx_register_decls(). */
1100 build_stack_save_restore (&stack_save
, &stack_restore
);
1102 t
= build2 (TRY_FINALLY_EXPR
, void_type_node
,
1103 BIND_EXPR_BODY (bind_expr
), NULL_TREE
);
1104 append_to_statement_list (stack_restore
, &TREE_OPERAND (t
, 1));
1106 BIND_EXPR_BODY (bind_expr
) = NULL_TREE
;
1107 append_to_statement_list (stack_save
, &BIND_EXPR_BODY (bind_expr
));
1108 append_to_statement_list (t
, &BIND_EXPR_BODY (bind_expr
));
1111 gimplify_ctxp
->save_stack
= old_save_stack
;
1112 gimple_pop_bind_expr ();
1117 append_to_statement_list (bind_expr
, pre_p
);
1124 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1125 GIMPLE value, it is assigned to a new temporary and the statement is
1126 re-written to return the temporary.
1128 PRE_P points to the list where side effects that must happen before
1129 STMT should be stored. */
1131 static enum gimplify_status
1132 gimplify_return_expr (tree stmt
, tree
*pre_p
)
1134 tree ret_expr
= TREE_OPERAND (stmt
, 0);
1135 tree result_decl
, result
;
1137 if (!ret_expr
|| TREE_CODE (ret_expr
) == RESULT_DECL
1138 || ret_expr
== error_mark_node
)
1141 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
1142 result_decl
= NULL_TREE
;
1145 result_decl
= TREE_OPERAND (ret_expr
, 0);
1146 if (TREE_CODE (result_decl
) == INDIRECT_REF
)
1147 /* See through a return by reference. */
1148 result_decl
= TREE_OPERAND (result_decl
, 0);
1150 gcc_assert ((TREE_CODE (ret_expr
) == MODIFY_EXPR
1151 || TREE_CODE (ret_expr
) == INIT_EXPR
)
1152 && TREE_CODE (result_decl
) == RESULT_DECL
);
1155 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1156 Recall that aggregate_value_p is FALSE for any aggregate type that is
1157 returned in registers. If we're returning values in registers, then
1158 we don't want to extend the lifetime of the RESULT_DECL, particularly
1159 across another call. In addition, for those aggregates for which
1160 hard_function_value generates a PARALLEL, we'll die during normal
1161 expansion of structure assignments; there's special code in expand_return
1162 to handle this case that does not exist in expand_expr. */
1164 || aggregate_value_p (result_decl
, TREE_TYPE (current_function_decl
)))
1165 result
= result_decl
;
1166 else if (gimplify_ctxp
->return_temp
)
1167 result
= gimplify_ctxp
->return_temp
;
1170 result
= create_tmp_var (TREE_TYPE (result_decl
), NULL
);
1172 /* ??? With complex control flow (usually involving abnormal edges),
1173 we can wind up warning about an uninitialized value for this. Due
1174 to how this variable is constructed and initialized, this is never
1175 true. Give up and never warn. */
1176 TREE_NO_WARNING (result
) = 1;
1178 gimplify_ctxp
->return_temp
= result
;
1181 /* Smash the lhs of the MODIFY_EXPR to the temporary we plan to use.
1182 Then gimplify the whole thing. */
1183 if (result
!= result_decl
)
1184 TREE_OPERAND (ret_expr
, 0) = result
;
1186 gimplify_and_add (TREE_OPERAND (stmt
, 0), pre_p
);
1188 /* If we didn't use a temporary, then the result is just the result_decl.
1189 Otherwise we need a simple copy. This should already be gimple. */
1190 if (result
== result_decl
)
1193 ret_expr
= build2 (MODIFY_EXPR
, TREE_TYPE (result
), result_decl
, result
);
1194 TREE_OPERAND (stmt
, 0) = ret_expr
;
1199 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
1200 and initialization explicit. */
1202 static enum gimplify_status
1203 gimplify_decl_expr (tree
*stmt_p
)
1205 tree stmt
= *stmt_p
;
1206 tree decl
= DECL_EXPR_DECL (stmt
);
1208 *stmt_p
= NULL_TREE
;
1210 if (TREE_TYPE (decl
) == error_mark_node
)
1213 if ((TREE_CODE (decl
) == TYPE_DECL
1214 || TREE_CODE (decl
) == VAR_DECL
)
1215 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl
)))
1216 gimplify_type_sizes (TREE_TYPE (decl
), stmt_p
);
1218 if (TREE_CODE (decl
) == VAR_DECL
&& !DECL_EXTERNAL (decl
))
1220 tree init
= DECL_INITIAL (decl
);
1222 if (!TREE_CONSTANT (DECL_SIZE (decl
)))
1224 /* This is a variable-sized decl. Simplify its size and mark it
1225 for deferred expansion. Note that mudflap depends on the format
1226 of the emitted code: see mx_register_decls(). */
1227 tree t
, args
, addr
, ptr_type
;
1229 gimplify_one_sizepos (&DECL_SIZE (decl
), stmt_p
);
1230 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl
), stmt_p
);
1232 /* All occurrences of this decl in final gimplified code will be
1233 replaced by indirection. Setting DECL_VALUE_EXPR does two
1234 things: First, it lets the rest of the gimplifier know what
1235 replacement to use. Second, it lets the debug info know
1236 where to find the value. */
1237 ptr_type
= build_pointer_type (TREE_TYPE (decl
));
1238 addr
= create_tmp_var (ptr_type
, get_name (decl
));
1239 DECL_IGNORED_P (addr
) = 0;
1240 t
= build_fold_indirect_ref (addr
);
1241 SET_DECL_VALUE_EXPR (decl
, t
);
1242 DECL_HAS_VALUE_EXPR_P (decl
) = 1;
1244 args
= tree_cons (NULL
, DECL_SIZE_UNIT (decl
), NULL
);
1245 t
= built_in_decls
[BUILT_IN_ALLOCA
];
1246 t
= build_function_call_expr (t
, args
);
1247 t
= fold_convert (ptr_type
, t
);
1248 t
= build2 (MODIFY_EXPR
, void_type_node
, addr
, t
);
1250 gimplify_and_add (t
, stmt_p
);
1252 /* Indicate that we need to restore the stack level when the
1253 enclosing BIND_EXPR is exited. */
1254 gimplify_ctxp
->save_stack
= true;
1257 if (init
&& init
!= error_mark_node
)
1259 if (!TREE_STATIC (decl
))
1261 DECL_INITIAL (decl
) = NULL_TREE
;
1262 init
= build2 (INIT_EXPR
, void_type_node
, decl
, init
);
1263 gimplify_and_add (init
, stmt_p
);
1266 /* We must still examine initializers for static variables
1267 as they may contain a label address. */
1268 walk_tree (&init
, force_labels_r
, NULL
, NULL
);
1271 /* Some front ends do not explicitly declare all anonymous
1272 artificial variables. We compensate here by declaring the
1273 variables, though it would be better if the front ends would
1274 explicitly declare them. */
1275 if (!DECL_SEEN_IN_BIND_EXPR_P (decl
)
1276 && DECL_ARTIFICIAL (decl
) && DECL_NAME (decl
) == NULL_TREE
)
1277 gimple_add_tmp_var (decl
);
1283 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1284 and replacing the LOOP_EXPR with goto, but if the loop contains an
1285 EXIT_EXPR, we need to append a label for it to jump to. */
1287 static enum gimplify_status
1288 gimplify_loop_expr (tree
*expr_p
, tree
*pre_p
)
1290 tree saved_label
= gimplify_ctxp
->exit_label
;
1291 tree start_label
= build1 (LABEL_EXPR
, void_type_node
, NULL_TREE
);
1292 tree jump_stmt
= build_and_jump (&LABEL_EXPR_LABEL (start_label
));
1294 append_to_statement_list (start_label
, pre_p
);
1296 gimplify_ctxp
->exit_label
= NULL_TREE
;
1298 gimplify_and_add (LOOP_EXPR_BODY (*expr_p
), pre_p
);
1300 if (gimplify_ctxp
->exit_label
)
1302 append_to_statement_list (jump_stmt
, pre_p
);
1303 *expr_p
= build1 (LABEL_EXPR
, void_type_node
, gimplify_ctxp
->exit_label
);
1306 *expr_p
= jump_stmt
;
1308 gimplify_ctxp
->exit_label
= saved_label
;
1313 /* Compare two case labels. Because the front end should already have
1314 made sure that case ranges do not overlap, it is enough to only compare
1315 the CASE_LOW values of each case label. */
1318 compare_case_labels (const void *p1
, const void *p2
)
1320 tree case1
= *(tree
*)p1
;
1321 tree case2
= *(tree
*)p2
;
1323 return tree_int_cst_compare (CASE_LOW (case1
), CASE_LOW (case2
));
1326 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1329 sort_case_labels (tree label_vec
)
1331 size_t len
= TREE_VEC_LENGTH (label_vec
);
1332 tree default_case
= TREE_VEC_ELT (label_vec
, len
- 1);
1334 if (CASE_LOW (default_case
))
1338 /* The last label in the vector should be the default case
1340 for (i
= 0; i
< len
; ++i
)
1342 tree t
= TREE_VEC_ELT (label_vec
, i
);
1346 TREE_VEC_ELT (label_vec
, i
) = TREE_VEC_ELT (label_vec
, len
- 1);
1347 TREE_VEC_ELT (label_vec
, len
- 1) = default_case
;
1353 qsort (&TREE_VEC_ELT (label_vec
, 0), len
- 1, sizeof (tree
),
1354 compare_case_labels
);
1357 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1360 static enum gimplify_status
1361 gimplify_switch_expr (tree
*expr_p
, tree
*pre_p
)
1363 tree switch_expr
= *expr_p
;
1364 enum gimplify_status ret
;
1366 ret
= gimplify_expr (&SWITCH_COND (switch_expr
), pre_p
, NULL
,
1367 is_gimple_val
, fb_rvalue
);
1369 if (SWITCH_BODY (switch_expr
))
1371 VEC(tree
,heap
) *labels
, *saved_labels
;
1372 tree label_vec
, default_case
= NULL_TREE
;
1375 /* If someone can be bothered to fill in the labels, they can
1376 be bothered to null out the body too. */
1377 gcc_assert (!SWITCH_LABELS (switch_expr
));
1379 saved_labels
= gimplify_ctxp
->case_labels
;
1380 gimplify_ctxp
->case_labels
= VEC_alloc (tree
, heap
, 8);
1382 gimplify_to_stmt_list (&SWITCH_BODY (switch_expr
));
1384 labels
= gimplify_ctxp
->case_labels
;
1385 gimplify_ctxp
->case_labels
= saved_labels
;
1388 while (i
< VEC_length (tree
, labels
))
1390 tree elt
= VEC_index (tree
, labels
, i
);
1391 tree low
= CASE_LOW (elt
);
1392 bool remove_element
= FALSE
;
1396 /* Discard empty ranges. */
1397 tree high
= CASE_HIGH (elt
);
1398 if (high
&& INT_CST_LT (high
, low
))
1399 remove_element
= TRUE
;
1403 /* The default case must be the last label in the list. */
1404 gcc_assert (!default_case
);
1406 remove_element
= TRUE
;
1410 VEC_ordered_remove (tree
, labels
, i
);
1416 label_vec
= make_tree_vec (len
+ 1);
1417 SWITCH_LABELS (*expr_p
) = label_vec
;
1418 append_to_statement_list (switch_expr
, pre_p
);
1422 /* If the switch has no default label, add one, so that we jump
1423 around the switch body. */
1424 default_case
= build3 (CASE_LABEL_EXPR
, void_type_node
, NULL_TREE
,
1425 NULL_TREE
, create_artificial_label ());
1426 append_to_statement_list (SWITCH_BODY (switch_expr
), pre_p
);
1427 *expr_p
= build1 (LABEL_EXPR
, void_type_node
,
1428 CASE_LABEL (default_case
));
1431 *expr_p
= SWITCH_BODY (switch_expr
);
1433 for (i
= 0; i
< len
; ++i
)
1434 TREE_VEC_ELT (label_vec
, i
) = VEC_index (tree
, labels
, i
);
1435 TREE_VEC_ELT (label_vec
, len
) = default_case
;
1437 VEC_free (tree
, heap
, labels
);
1439 sort_case_labels (label_vec
);
1441 SWITCH_BODY (switch_expr
) = NULL
;
1444 gcc_assert (SWITCH_LABELS (switch_expr
));
1449 static enum gimplify_status
1450 gimplify_case_label_expr (tree
*expr_p
)
1452 tree expr
= *expr_p
;
1453 struct gimplify_ctx
*ctxp
;
1455 /* Invalid OpenMP programs can play Duff's Device type games with
1456 #pragma omp parallel. At least in the C front end, we don't
1457 detect such invalid branches until after gimplification. */
1458 for (ctxp
= gimplify_ctxp
; ; ctxp
= ctxp
->prev_context
)
1459 if (ctxp
->case_labels
)
1462 VEC_safe_push (tree
, heap
, ctxp
->case_labels
, expr
);
1463 *expr_p
= build1 (LABEL_EXPR
, void_type_node
, CASE_LABEL (expr
));
1467 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1471 build_and_jump (tree
*label_p
)
1473 if (label_p
== NULL
)
1474 /* If there's nowhere to jump, just fall through. */
1477 if (*label_p
== NULL_TREE
)
1479 tree label
= create_artificial_label ();
1483 return build1 (GOTO_EXPR
, void_type_node
, *label_p
);
1486 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1487 This also involves building a label to jump to and communicating it to
1488 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1490 static enum gimplify_status
1491 gimplify_exit_expr (tree
*expr_p
)
1493 tree cond
= TREE_OPERAND (*expr_p
, 0);
1496 expr
= build_and_jump (&gimplify_ctxp
->exit_label
);
1497 expr
= build3 (COND_EXPR
, void_type_node
, cond
, expr
, NULL_TREE
);
1503 /* A helper function to be called via walk_tree. Mark all labels under *TP
1504 as being forced. To be called for DECL_INITIAL of static variables. */
1507 force_labels_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
1511 if (TREE_CODE (*tp
) == LABEL_DECL
)
1512 FORCED_LABEL (*tp
) = 1;
1517 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1518 different from its canonical type, wrap the whole thing inside a
1519 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1522 The canonical type of a COMPONENT_REF is the type of the field being
1523 referenced--unless the field is a bit-field which can be read directly
1524 in a smaller mode, in which case the canonical type is the
1525 sign-appropriate type corresponding to that mode. */
1528 canonicalize_component_ref (tree
*expr_p
)
1530 tree expr
= *expr_p
;
1533 gcc_assert (TREE_CODE (expr
) == COMPONENT_REF
);
1535 if (INTEGRAL_TYPE_P (TREE_TYPE (expr
)))
1536 type
= TREE_TYPE (get_unwidened (expr
, NULL_TREE
));
1538 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
1540 if (TREE_TYPE (expr
) != type
)
1542 tree old_type
= TREE_TYPE (expr
);
1544 /* Set the type of the COMPONENT_REF to the underlying type. */
1545 TREE_TYPE (expr
) = type
;
1547 /* And wrap the whole thing inside a NOP_EXPR. */
1548 expr
= build1 (NOP_EXPR
, old_type
, expr
);
1554 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1555 to foo, embed that change in the ADDR_EXPR by converting
1560 where L is the lower bound. For simplicity, only do this for constant
1564 canonicalize_addr_expr (tree
*expr_p
)
1566 tree expr
= *expr_p
;
1567 tree ctype
= TREE_TYPE (expr
);
1568 tree addr_expr
= TREE_OPERAND (expr
, 0);
1569 tree atype
= TREE_TYPE (addr_expr
);
1570 tree dctype
, datype
, ddatype
, otype
, obj_expr
;
1572 /* Both cast and addr_expr types should be pointers. */
1573 if (!POINTER_TYPE_P (ctype
) || !POINTER_TYPE_P (atype
))
1576 /* The addr_expr type should be a pointer to an array. */
1577 datype
= TREE_TYPE (atype
);
1578 if (TREE_CODE (datype
) != ARRAY_TYPE
)
1581 /* Both cast and addr_expr types should address the same object type. */
1582 dctype
= TREE_TYPE (ctype
);
1583 ddatype
= TREE_TYPE (datype
);
1584 if (!lang_hooks
.types_compatible_p (ddatype
, dctype
))
1587 /* The addr_expr and the object type should match. */
1588 obj_expr
= TREE_OPERAND (addr_expr
, 0);
1589 otype
= TREE_TYPE (obj_expr
);
1590 if (!lang_hooks
.types_compatible_p (otype
, datype
))
1593 /* The lower bound and element sizes must be constant. */
1594 if (!TYPE_SIZE_UNIT (dctype
)
1595 || TREE_CODE (TYPE_SIZE_UNIT (dctype
)) != INTEGER_CST
1596 || !TYPE_DOMAIN (datype
) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))
1597 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))) != INTEGER_CST
)
1600 /* All checks succeeded. Build a new node to merge the cast. */
1601 *expr_p
= build4 (ARRAY_REF
, dctype
, obj_expr
,
1602 TYPE_MIN_VALUE (TYPE_DOMAIN (datype
)),
1603 TYPE_MIN_VALUE (TYPE_DOMAIN (datype
)),
1604 size_binop (EXACT_DIV_EXPR
, TYPE_SIZE_UNIT (dctype
),
1605 size_int (TYPE_ALIGN_UNIT (dctype
))));
1606 *expr_p
= build1 (ADDR_EXPR
, ctype
, *expr_p
);
1609 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1610 underneath as appropriate. */
1612 static enum gimplify_status
1613 gimplify_conversion (tree
*expr_p
)
1615 gcc_assert (TREE_CODE (*expr_p
) == NOP_EXPR
1616 || TREE_CODE (*expr_p
) == CONVERT_EXPR
);
1618 /* Then strip away all but the outermost conversion. */
1619 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p
, 0));
1621 /* And remove the outermost conversion if it's useless. */
1622 if (tree_ssa_useless_type_conversion (*expr_p
))
1623 *expr_p
= TREE_OPERAND (*expr_p
, 0);
1625 /* If we still have a conversion at the toplevel,
1626 then canonicalize some constructs. */
1627 if (TREE_CODE (*expr_p
) == NOP_EXPR
|| TREE_CODE (*expr_p
) == CONVERT_EXPR
)
1629 tree sub
= TREE_OPERAND (*expr_p
, 0);
1631 /* If a NOP conversion is changing the type of a COMPONENT_REF
1632 expression, then canonicalize its type now in order to expose more
1633 redundant conversions. */
1634 if (TREE_CODE (sub
) == COMPONENT_REF
)
1635 canonicalize_component_ref (&TREE_OPERAND (*expr_p
, 0));
1637 /* If a NOP conversion is changing a pointer to array of foo
1638 to a pointer to foo, embed that change in the ADDR_EXPR. */
1639 else if (TREE_CODE (sub
) == ADDR_EXPR
)
1640 canonicalize_addr_expr (expr_p
);
1646 /* Gimplify a VAR_DECL or PARM_DECL. Returns GS_OK if we expanded a
1647 DECL_VALUE_EXPR, and it's worth re-examining things. */
1649 static enum gimplify_status
1650 gimplify_var_or_parm_decl (tree
*expr_p
)
1652 tree decl
= *expr_p
;
1654 /* ??? If this is a local variable, and it has not been seen in any
1655 outer BIND_EXPR, then it's probably the result of a duplicate
1656 declaration, for which we've already issued an error. It would
1657 be really nice if the front end wouldn't leak these at all.
1658 Currently the only known culprit is C++ destructors, as seen
1659 in g++.old-deja/g++.jason/binding.C. */
1660 if (TREE_CODE (decl
) == VAR_DECL
1661 && !DECL_SEEN_IN_BIND_EXPR_P (decl
)
1662 && !TREE_STATIC (decl
) && !DECL_EXTERNAL (decl
)
1663 && decl_function_context (decl
) == current_function_decl
)
1665 gcc_assert (errorcount
|| sorrycount
);
1669 /* When within an OpenMP context, notice uses of variables. */
1670 if (gimplify_omp_ctxp
&& omp_notice_variable (gimplify_omp_ctxp
, decl
, true))
1673 /* If the decl is an alias for another expression, substitute it now. */
1674 if (DECL_HAS_VALUE_EXPR_P (decl
))
1676 *expr_p
= unshare_expr (DECL_VALUE_EXPR (decl
));
1684 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1685 node pointed to by EXPR_P.
1688 : min_lval '[' val ']'
1690 | compound_lval '[' val ']'
1691 | compound_lval '.' ID
1693 This is not part of the original SIMPLE definition, which separates
1694 array and member references, but it seems reasonable to handle them
1695 together. Also, this way we don't run into problems with union
1696 aliasing; gcc requires that for accesses through a union to alias, the
1697 union reference must be explicit, which was not always the case when we
1698 were splitting up array and member refs.
1700 PRE_P points to the list where side effects that must happen before
1701 *EXPR_P should be stored.
1703 POST_P points to the list where side effects that must happen after
1704 *EXPR_P should be stored. */
1706 static enum gimplify_status
1707 gimplify_compound_lval (tree
*expr_p
, tree
*pre_p
,
1708 tree
*post_p
, fallback_t fallback
)
1711 VEC(tree
,heap
) *stack
;
1712 enum gimplify_status ret
= GS_OK
, tret
;
1715 /* Create a stack of the subexpressions so later we can walk them in
1716 order from inner to outer. */
1717 stack
= VEC_alloc (tree
, heap
, 10);
1719 /* We can handle anything that get_inner_reference can deal with. */
1720 for (p
= expr_p
; ; p
= &TREE_OPERAND (*p
, 0))
1723 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1724 if (TREE_CODE (*p
) == INDIRECT_REF
)
1725 *p
= fold_indirect_ref (*p
);
1727 if (handled_component_p (*p
))
1729 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
1730 additional COMPONENT_REFs. */
1731 else if ((TREE_CODE (*p
) == VAR_DECL
|| TREE_CODE (*p
) == PARM_DECL
)
1732 && gimplify_var_or_parm_decl (p
) == GS_OK
)
1737 VEC_safe_push (tree
, heap
, stack
, *p
);
1740 gcc_assert (VEC_length (tree
, stack
));
1742 /* Now STACK is a stack of pointers to all the refs we've walked through
1743 and P points to the innermost expression.
1745 Java requires that we elaborated nodes in source order. That
1746 means we must gimplify the inner expression followed by each of
1747 the indices, in order. But we can't gimplify the inner
1748 expression until we deal with any variable bounds, sizes, or
1749 positions in order to deal with PLACEHOLDER_EXPRs.
1751 So we do this in three steps. First we deal with the annotations
1752 for any variables in the components, then we gimplify the base,
1753 then we gimplify any indices, from left to right. */
1754 for (i
= VEC_length (tree
, stack
) - 1; i
>= 0; i
--)
1756 tree t
= VEC_index (tree
, stack
, i
);
1758 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
1760 /* Gimplify the low bound and element type size and put them into
1761 the ARRAY_REF. If these values are set, they have already been
1763 if (!TREE_OPERAND (t
, 2))
1765 tree low
= unshare_expr (array_ref_low_bound (t
));
1766 if (!is_gimple_min_invariant (low
))
1768 TREE_OPERAND (t
, 2) = low
;
1769 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
1770 is_gimple_formal_tmp_reg
, fb_rvalue
);
1771 ret
= MIN (ret
, tret
);
1775 if (!TREE_OPERAND (t
, 3))
1777 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (t
, 0)));
1778 tree elmt_size
= unshare_expr (array_ref_element_size (t
));
1779 tree factor
= size_int (TYPE_ALIGN_UNIT (elmt_type
));
1781 /* Divide the element size by the alignment of the element
1783 elmt_size
= size_binop (EXACT_DIV_EXPR
, elmt_size
, factor
);
1785 if (!is_gimple_min_invariant (elmt_size
))
1787 TREE_OPERAND (t
, 3) = elmt_size
;
1788 tret
= gimplify_expr (&TREE_OPERAND (t
, 3), pre_p
, post_p
,
1789 is_gimple_formal_tmp_reg
, fb_rvalue
);
1790 ret
= MIN (ret
, tret
);
1794 else if (TREE_CODE (t
) == COMPONENT_REF
)
1796 /* Set the field offset into T and gimplify it. */
1797 if (!TREE_OPERAND (t
, 2))
1799 tree offset
= unshare_expr (component_ref_field_offset (t
));
1800 tree field
= TREE_OPERAND (t
, 1);
1802 = size_int (DECL_OFFSET_ALIGN (field
) / BITS_PER_UNIT
);
1804 /* Divide the offset by its alignment. */
1805 offset
= size_binop (EXACT_DIV_EXPR
, offset
, factor
);
1807 if (!is_gimple_min_invariant (offset
))
1809 TREE_OPERAND (t
, 2) = offset
;
1810 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
1811 is_gimple_formal_tmp_reg
, fb_rvalue
);
1812 ret
= MIN (ret
, tret
);
1818 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
1819 so as to match the min_lval predicate. Failure to do so may result
1820 in the creation of large aggregate temporaries. */
1821 tret
= gimplify_expr (p
, pre_p
, post_p
, is_gimple_min_lval
,
1822 fallback
| fb_lvalue
);
1823 ret
= MIN (ret
, tret
);
1825 /* And finally, the indices and operands to BIT_FIELD_REF. During this
1826 loop we also remove any useless conversions. */
1827 for (; VEC_length (tree
, stack
) > 0; )
1829 tree t
= VEC_pop (tree
, stack
);
1831 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
1833 /* Gimplify the dimension.
1834 Temporary fix for gcc.c-torture/execute/20040313-1.c.
1835 Gimplify non-constant array indices into a temporary
1837 FIXME - The real fix is to gimplify post-modify
1838 expressions into a minimal gimple lvalue. However, that
1839 exposes bugs in alias analysis. The alias analyzer does
1840 not handle &PTR->FIELD very well. Will fix after the
1841 branch is merged into mainline (dnovillo 2004-05-03). */
1842 if (!is_gimple_min_invariant (TREE_OPERAND (t
, 1)))
1844 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), pre_p
, post_p
,
1845 is_gimple_formal_tmp_reg
, fb_rvalue
);
1846 ret
= MIN (ret
, tret
);
1849 else if (TREE_CODE (t
) == BIT_FIELD_REF
)
1851 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), pre_p
, post_p
,
1852 is_gimple_val
, fb_rvalue
);
1853 ret
= MIN (ret
, tret
);
1854 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
1855 is_gimple_val
, fb_rvalue
);
1856 ret
= MIN (ret
, tret
);
1859 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t
, 0));
1861 /* The innermost expression P may have originally had TREE_SIDE_EFFECTS
1862 set which would have caused all the outer expressions in EXPR_P
1863 leading to P to also have had TREE_SIDE_EFFECTS set. */
1864 recalculate_side_effects (t
);
1867 tret
= gimplify_expr (p
, pre_p
, post_p
, is_gimple_min_lval
, fallback
);
1868 ret
= MIN (ret
, tret
);
1870 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
1871 if ((fallback
& fb_rvalue
) && TREE_CODE (*expr_p
) == COMPONENT_REF
)
1873 canonicalize_component_ref (expr_p
);
1874 ret
= MIN (ret
, GS_OK
);
1877 VEC_free (tree
, heap
, stack
);
1882 /* Gimplify the self modifying expression pointed to by EXPR_P
1885 PRE_P points to the list where side effects that must happen before
1886 *EXPR_P should be stored.
1888 POST_P points to the list where side effects that must happen after
1889 *EXPR_P should be stored.
1891 WANT_VALUE is nonzero iff we want to use the value of this expression
1892 in another expression. */
1894 static enum gimplify_status
1895 gimplify_self_mod_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
,
1898 enum tree_code code
;
1899 tree lhs
, lvalue
, rhs
, t1
;
1901 enum tree_code arith_code
;
1902 enum gimplify_status ret
;
1904 code
= TREE_CODE (*expr_p
);
1906 gcc_assert (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
1907 || code
== PREINCREMENT_EXPR
|| code
== PREDECREMENT_EXPR
);
1909 /* Prefix or postfix? */
1910 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
1911 /* Faster to treat as prefix if result is not used. */
1912 postfix
= want_value
;
1916 /* Add or subtract? */
1917 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
1918 arith_code
= PLUS_EXPR
;
1920 arith_code
= MINUS_EXPR
;
1922 /* Gimplify the LHS into a GIMPLE lvalue. */
1923 lvalue
= TREE_OPERAND (*expr_p
, 0);
1924 ret
= gimplify_expr (&lvalue
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
1925 if (ret
== GS_ERROR
)
1928 /* Extract the operands to the arithmetic operation. */
1930 rhs
= TREE_OPERAND (*expr_p
, 1);
1932 /* For postfix operator, we evaluate the LHS to an rvalue and then use
1933 that as the result value and in the postqueue operation. */
1936 ret
= gimplify_expr (&lhs
, pre_p
, post_p
, is_gimple_val
, fb_rvalue
);
1937 if (ret
== GS_ERROR
)
1941 t1
= build2 (arith_code
, TREE_TYPE (*expr_p
), lhs
, rhs
);
1942 t1
= build2 (MODIFY_EXPR
, TREE_TYPE (lvalue
), lvalue
, t1
);
1946 gimplify_and_add (t1
, post_p
);
1957 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
1960 maybe_with_size_expr (tree
*expr_p
)
1962 tree expr
= *expr_p
;
1963 tree type
= TREE_TYPE (expr
);
1966 /* If we've already wrapped this or the type is error_mark_node, we can't do
1968 if (TREE_CODE (expr
) == WITH_SIZE_EXPR
1969 || type
== error_mark_node
)
1972 /* If the size isn't known or is a constant, we have nothing to do. */
1973 size
= TYPE_SIZE_UNIT (type
);
1974 if (!size
|| TREE_CODE (size
) == INTEGER_CST
)
1977 /* Otherwise, make a WITH_SIZE_EXPR. */
1978 size
= unshare_expr (size
);
1979 size
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (size
, expr
);
1980 *expr_p
= build2 (WITH_SIZE_EXPR
, type
, expr
, size
);
1983 /* Subroutine of gimplify_call_expr: Gimplify a single argument. */
1985 static enum gimplify_status
1986 gimplify_arg (tree
*expr_p
, tree
*pre_p
)
1988 bool (*test
) (tree
);
1991 /* In general, we allow lvalues for function arguments to avoid
1992 extra overhead of copying large aggregates out of even larger
1993 aggregates into temporaries only to copy the temporaries to
1994 the argument list. Make optimizers happy by pulling out to
1995 temporaries those types that fit in registers. */
1996 if (is_gimple_reg_type (TREE_TYPE (*expr_p
)))
1997 test
= is_gimple_val
, fb
= fb_rvalue
;
1999 test
= is_gimple_lvalue
, fb
= fb_either
;
2001 /* If this is a variable sized type, we must remember the size. */
2002 maybe_with_size_expr (expr_p
);
2004 /* There is a sequence point before a function call. Side effects in
2005 the argument list must occur before the actual call. So, when
2006 gimplifying arguments, force gimplify_expr to use an internal
2007 post queue which is then appended to the end of PRE_P. */
2008 return gimplify_expr (expr_p
, pre_p
, NULL
, test
, fb
);
2011 /* Gimplify the CALL_EXPR node pointed to by EXPR_P. PRE_P points to the
2012 list where side effects that must happen before *EXPR_P should be stored.
2013 WANT_VALUE is true if the result of the call is desired. */
2015 static enum gimplify_status
2016 gimplify_call_expr (tree
*expr_p
, tree
*pre_p
, bool want_value
)
2020 enum gimplify_status ret
;
2022 gcc_assert (TREE_CODE (*expr_p
) == CALL_EXPR
);
2024 /* For reliable diagnostics during inlining, it is necessary that
2025 every call_expr be annotated with file and line. */
2026 if (! EXPR_HAS_LOCATION (*expr_p
))
2027 SET_EXPR_LOCATION (*expr_p
, input_location
);
2029 /* This may be a call to a builtin function.
2031 Builtin function calls may be transformed into different
2032 (and more efficient) builtin function calls under certain
2033 circumstances. Unfortunately, gimplification can muck things
2034 up enough that the builtin expanders are not aware that certain
2035 transformations are still valid.
2037 So we attempt transformation/gimplification of the call before
2038 we gimplify the CALL_EXPR. At this time we do not manage to
2039 transform all calls in the same manner as the expanders do, but
2040 we do transform most of them. */
2041 decl
= get_callee_fndecl (*expr_p
);
2042 if (decl
&& DECL_BUILT_IN (decl
))
2044 tree arglist
= TREE_OPERAND (*expr_p
, 1);
2045 tree
new = fold_builtin (decl
, arglist
, !want_value
);
2047 if (new && new != *expr_p
)
2049 /* There was a transformation of this call which computes the
2050 same value, but in a more efficient way. Return and try
2056 if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
2057 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_START
)
2059 if (!arglist
|| !TREE_CHAIN (arglist
))
2061 error ("too few arguments to function %<va_start%>");
2062 *expr_p
= build_empty_stmt ();
2066 if (fold_builtin_next_arg (TREE_CHAIN (arglist
)))
2068 *expr_p
= build_empty_stmt ();
2071 /* Avoid gimplifying the second argument to va_start, which needs
2072 to be the plain PARM_DECL. */
2073 return gimplify_arg (&TREE_VALUE (TREE_OPERAND (*expr_p
, 1)), pre_p
);
2077 /* There is a sequence point before the call, so any side effects in
2078 the calling expression must occur before the actual call. Force
2079 gimplify_expr to use an internal post queue. */
2080 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, NULL
,
2081 is_gimple_call_addr
, fb_rvalue
);
2083 if (PUSH_ARGS_REVERSED
)
2084 TREE_OPERAND (*expr_p
, 1) = nreverse (TREE_OPERAND (*expr_p
, 1));
2085 for (arglist
= TREE_OPERAND (*expr_p
, 1); arglist
;
2086 arglist
= TREE_CHAIN (arglist
))
2088 enum gimplify_status t
;
2090 t
= gimplify_arg (&TREE_VALUE (arglist
), pre_p
);
2095 if (PUSH_ARGS_REVERSED
)
2096 TREE_OPERAND (*expr_p
, 1) = nreverse (TREE_OPERAND (*expr_p
, 1));
2098 /* Try this again in case gimplification exposed something. */
2099 if (ret
!= GS_ERROR
)
2101 decl
= get_callee_fndecl (*expr_p
);
2102 if (decl
&& DECL_BUILT_IN (decl
))
2104 tree arglist
= TREE_OPERAND (*expr_p
, 1);
2105 tree
new = fold_builtin (decl
, arglist
, !want_value
);
2107 if (new && new != *expr_p
)
2109 /* There was a transformation of this call which computes the
2110 same value, but in a more efficient way. Return and try
2118 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2119 decl. This allows us to eliminate redundant or useless
2120 calls to "const" functions. */
2121 if (TREE_CODE (*expr_p
) == CALL_EXPR
2122 && (call_expr_flags (*expr_p
) & (ECF_CONST
| ECF_PURE
)))
2123 TREE_SIDE_EFFECTS (*expr_p
) = 0;
2128 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2129 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2131 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2132 condition is true or false, respectively. If null, we should generate
2133 our own to skip over the evaluation of this specific expression.
2135 This function is the tree equivalent of do_jump.
2137 shortcut_cond_r should only be called by shortcut_cond_expr. */
2140 shortcut_cond_r (tree pred
, tree
*true_label_p
, tree
*false_label_p
)
2142 tree local_label
= NULL_TREE
;
2143 tree t
, expr
= NULL
;
2145 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2146 retain the shortcut semantics. Just insert the gotos here;
2147 shortcut_cond_expr will append the real blocks later. */
2148 if (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2150 /* Turn if (a && b) into
2152 if (a); else goto no;
2153 if (b) goto yes; else goto no;
2156 if (false_label_p
== NULL
)
2157 false_label_p
= &local_label
;
2159 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), NULL
, false_label_p
);
2160 append_to_statement_list (t
, &expr
);
2162 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2164 append_to_statement_list (t
, &expr
);
2166 else if (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2168 /* Turn if (a || b) into
2171 if (b) goto yes; else goto no;
2174 if (true_label_p
== NULL
)
2175 true_label_p
= &local_label
;
2177 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), true_label_p
, NULL
);
2178 append_to_statement_list (t
, &expr
);
2180 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2182 append_to_statement_list (t
, &expr
);
2184 else if (TREE_CODE (pred
) == COND_EXPR
)
2186 /* As long as we're messing with gotos, turn if (a ? b : c) into
2188 if (b) goto yes; else goto no;
2190 if (c) goto yes; else goto no; */
2191 expr
= build3 (COND_EXPR
, void_type_node
, TREE_OPERAND (pred
, 0),
2192 shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2194 shortcut_cond_r (TREE_OPERAND (pred
, 2), true_label_p
,
2199 expr
= build3 (COND_EXPR
, void_type_node
, pred
,
2200 build_and_jump (true_label_p
),
2201 build_and_jump (false_label_p
));
2206 t
= build1 (LABEL_EXPR
, void_type_node
, local_label
);
2207 append_to_statement_list (t
, &expr
);
2214 shortcut_cond_expr (tree expr
)
2216 tree pred
= TREE_OPERAND (expr
, 0);
2217 tree then_
= TREE_OPERAND (expr
, 1);
2218 tree else_
= TREE_OPERAND (expr
, 2);
2219 tree true_label
, false_label
, end_label
, t
;
2221 tree
*false_label_p
;
2222 bool emit_end
, emit_false
, jump_over_else
;
2223 bool then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2224 bool else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2226 /* First do simple transformations. */
2229 /* If there is no 'else', turn (a && b) into if (a) if (b). */
2230 while (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2232 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2233 then_
= shortcut_cond_expr (expr
);
2234 then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2235 pred
= TREE_OPERAND (pred
, 0);
2236 expr
= build3 (COND_EXPR
, void_type_node
, pred
, then_
, NULL_TREE
);
2241 /* If there is no 'then', turn
2244 if (a); else if (b); else d. */
2245 while (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2247 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2248 else_
= shortcut_cond_expr (expr
);
2249 else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2250 pred
= TREE_OPERAND (pred
, 0);
2251 expr
= build3 (COND_EXPR
, void_type_node
, pred
, NULL_TREE
, else_
);
2255 /* If we're done, great. */
2256 if (TREE_CODE (pred
) != TRUTH_ANDIF_EXPR
2257 && TREE_CODE (pred
) != TRUTH_ORIF_EXPR
)
2260 /* Otherwise we need to mess with gotos. Change
2263 if (a); else goto no;
2266 and recursively gimplify the condition. */
2268 true_label
= false_label
= end_label
= NULL_TREE
;
2270 /* If our arms just jump somewhere, hijack those labels so we don't
2271 generate jumps to jumps. */
2274 && TREE_CODE (then_
) == GOTO_EXPR
2275 && TREE_CODE (GOTO_DESTINATION (then_
)) == LABEL_DECL
)
2277 true_label
= GOTO_DESTINATION (then_
);
2283 && TREE_CODE (else_
) == GOTO_EXPR
2284 && TREE_CODE (GOTO_DESTINATION (else_
)) == LABEL_DECL
)
2286 false_label
= GOTO_DESTINATION (else_
);
2291 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2293 true_label_p
= &true_label
;
2295 true_label_p
= NULL
;
2297 /* The 'else' branch also needs a label if it contains interesting code. */
2298 if (false_label
|| else_se
)
2299 false_label_p
= &false_label
;
2301 false_label_p
= NULL
;
2303 /* If there was nothing else in our arms, just forward the label(s). */
2304 if (!then_se
&& !else_se
)
2305 return shortcut_cond_r (pred
, true_label_p
, false_label_p
);
2307 /* If our last subexpression already has a terminal label, reuse it. */
2309 expr
= expr_last (else_
);
2311 expr
= expr_last (then_
);
2314 if (expr
&& TREE_CODE (expr
) == LABEL_EXPR
)
2315 end_label
= LABEL_EXPR_LABEL (expr
);
2317 /* If we don't care about jumping to the 'else' branch, jump to the end
2318 if the condition is false. */
2320 false_label_p
= &end_label
;
2322 /* We only want to emit these labels if we aren't hijacking them. */
2323 emit_end
= (end_label
== NULL_TREE
);
2324 emit_false
= (false_label
== NULL_TREE
);
2326 /* We only emit the jump over the else clause if we have to--if the
2327 then clause may fall through. Otherwise we can wind up with a
2328 useless jump and a useless label at the end of gimplified code,
2329 which will cause us to think that this conditional as a whole
2330 falls through even if it doesn't. If we then inline a function
2331 which ends with such a condition, that can cause us to issue an
2332 inappropriate warning about control reaching the end of a
2333 non-void function. */
2334 jump_over_else
= block_may_fallthru (then_
);
2336 pred
= shortcut_cond_r (pred
, true_label_p
, false_label_p
);
2339 append_to_statement_list (pred
, &expr
);
2341 append_to_statement_list (then_
, &expr
);
2346 t
= build_and_jump (&end_label
);
2347 append_to_statement_list (t
, &expr
);
2351 t
= build1 (LABEL_EXPR
, void_type_node
, false_label
);
2352 append_to_statement_list (t
, &expr
);
2354 append_to_statement_list (else_
, &expr
);
2356 if (emit_end
&& end_label
)
2358 t
= build1 (LABEL_EXPR
, void_type_node
, end_label
);
2359 append_to_statement_list (t
, &expr
);
2365 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2368 gimple_boolify (tree expr
)
2370 tree type
= TREE_TYPE (expr
);
2372 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
2375 switch (TREE_CODE (expr
))
2377 case TRUTH_AND_EXPR
:
2379 case TRUTH_XOR_EXPR
:
2380 case TRUTH_ANDIF_EXPR
:
2381 case TRUTH_ORIF_EXPR
:
2382 /* Also boolify the arguments of truth exprs. */
2383 TREE_OPERAND (expr
, 1) = gimple_boolify (TREE_OPERAND (expr
, 1));
2386 case TRUTH_NOT_EXPR
:
2387 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
2390 case EQ_EXPR
: case NE_EXPR
:
2391 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
2392 /* These expressions always produce boolean results. */
2393 TREE_TYPE (expr
) = boolean_type_node
;
2397 /* Other expressions that get here must have boolean values, but
2398 might need to be converted to the appropriate mode. */
2399 return fold_convert (boolean_type_node
, expr
);
2403 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2412 The second form is used when *EXPR_P is of type void.
2414 TARGET is the tree for T1 above.
2416 PRE_P points to the list where side effects that must happen before
2417 *EXPR_P should be stored. */
2419 static enum gimplify_status
2420 gimplify_cond_expr (tree
*expr_p
, tree
*pre_p
, fallback_t fallback
)
2422 tree expr
= *expr_p
;
2423 tree tmp
, tmp2
, type
;
2424 enum gimplify_status ret
;
2426 type
= TREE_TYPE (expr
);
2428 /* If this COND_EXPR has a value, copy the values into a temporary within
2430 if (! VOID_TYPE_P (type
))
2434 if ((fallback
& fb_lvalue
) == 0)
2436 result
= tmp2
= tmp
= create_tmp_var (TREE_TYPE (expr
), "iftmp");
2441 tree type
= build_pointer_type (TREE_TYPE (expr
));
2443 if (TREE_TYPE (TREE_OPERAND (expr
, 1)) != void_type_node
)
2444 TREE_OPERAND (expr
, 1) =
2445 build_fold_addr_expr (TREE_OPERAND (expr
, 1));
2447 if (TREE_TYPE (TREE_OPERAND (expr
, 2)) != void_type_node
)
2448 TREE_OPERAND (expr
, 2) =
2449 build_fold_addr_expr (TREE_OPERAND (expr
, 2));
2451 tmp2
= tmp
= create_tmp_var (type
, "iftmp");
2453 expr
= build3 (COND_EXPR
, void_type_node
, TREE_OPERAND (expr
, 0),
2454 TREE_OPERAND (expr
, 1), TREE_OPERAND (expr
, 2));
2456 result
= build_fold_indirect_ref (tmp
);
2460 /* Build the then clause, 't1 = a;'. But don't build an assignment
2461 if this branch is void; in C++ it can be, if it's a throw. */
2462 if (TREE_TYPE (TREE_OPERAND (expr
, 1)) != void_type_node
)
2463 TREE_OPERAND (expr
, 1)
2464 = build2 (MODIFY_EXPR
, void_type_node
, tmp
, TREE_OPERAND (expr
, 1));
2466 /* Build the else clause, 't1 = b;'. */
2467 if (TREE_TYPE (TREE_OPERAND (expr
, 2)) != void_type_node
)
2468 TREE_OPERAND (expr
, 2)
2469 = build2 (MODIFY_EXPR
, void_type_node
, tmp2
, TREE_OPERAND (expr
, 2));
2471 TREE_TYPE (expr
) = void_type_node
;
2472 recalculate_side_effects (expr
);
2474 /* Move the COND_EXPR to the prequeue. */
2475 gimplify_and_add (expr
, pre_p
);
2481 /* Make sure the condition has BOOLEAN_TYPE. */
2482 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
2484 /* Break apart && and || conditions. */
2485 if (TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ANDIF_EXPR
2486 || TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ORIF_EXPR
)
2488 expr
= shortcut_cond_expr (expr
);
2490 if (expr
!= *expr_p
)
2494 /* We can't rely on gimplify_expr to re-gimplify the expanded
2495 form properly, as cleanups might cause the target labels to be
2496 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2497 set up a conditional context. */
2498 gimple_push_condition ();
2499 gimplify_stmt (expr_p
);
2500 gimple_pop_condition (pre_p
);
2506 /* Now do the normal gimplification. */
2507 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, NULL
,
2508 is_gimple_condexpr
, fb_rvalue
);
2510 gimple_push_condition ();
2512 gimplify_to_stmt_list (&TREE_OPERAND (expr
, 1));
2513 gimplify_to_stmt_list (&TREE_OPERAND (expr
, 2));
2514 recalculate_side_effects (expr
);
2516 gimple_pop_condition (pre_p
);
2518 if (ret
== GS_ERROR
)
2520 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
2522 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 2)))
2523 /* Rewrite "if (a); else b" to "if (!a) b" */
2525 TREE_OPERAND (expr
, 0) = invert_truthvalue (TREE_OPERAND (expr
, 0));
2526 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, NULL
,
2527 is_gimple_condexpr
, fb_rvalue
);
2529 tmp
= TREE_OPERAND (expr
, 1);
2530 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 2);
2531 TREE_OPERAND (expr
, 2) = tmp
;
2534 /* Both arms are empty; replace the COND_EXPR with its predicate. */
2535 expr
= TREE_OPERAND (expr
, 0);
2541 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2542 a call to __builtin_memcpy. */
2544 static enum gimplify_status
2545 gimplify_modify_expr_to_memcpy (tree
*expr_p
, tree size
, bool want_value
)
2547 tree args
, t
, to
, to_ptr
, from
;
2549 to
= TREE_OPERAND (*expr_p
, 0);
2550 from
= TREE_OPERAND (*expr_p
, 1);
2552 args
= tree_cons (NULL
, size
, NULL
);
2554 t
= build_fold_addr_expr (from
);
2555 args
= tree_cons (NULL
, t
, args
);
2557 to_ptr
= build_fold_addr_expr (to
);
2558 args
= tree_cons (NULL
, to_ptr
, args
);
2559 t
= implicit_built_in_decls
[BUILT_IN_MEMCPY
];
2560 t
= build_function_call_expr (t
, args
);
2564 t
= build1 (NOP_EXPR
, TREE_TYPE (to_ptr
), t
);
2565 t
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
2572 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2573 a call to __builtin_memset. In this case we know that the RHS is
2574 a CONSTRUCTOR with an empty element list. */
2576 static enum gimplify_status
2577 gimplify_modify_expr_to_memset (tree
*expr_p
, tree size
, bool want_value
)
2579 tree args
, t
, to
, to_ptr
;
2581 to
= TREE_OPERAND (*expr_p
, 0);
2583 args
= tree_cons (NULL
, size
, NULL
);
2585 args
= tree_cons (NULL
, integer_zero_node
, args
);
2587 to_ptr
= build_fold_addr_expr (to
);
2588 args
= tree_cons (NULL
, to_ptr
, args
);
2589 t
= implicit_built_in_decls
[BUILT_IN_MEMSET
];
2590 t
= build_function_call_expr (t
, args
);
2594 t
= build1 (NOP_EXPR
, TREE_TYPE (to_ptr
), t
);
2595 t
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
2602 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
2603 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
2604 assignment. Returns non-null if we detect a potential overlap. */
2606 struct gimplify_init_ctor_preeval_data
2608 /* The base decl of the lhs object. May be NULL, in which case we
2609 have to assume the lhs is indirect. */
2612 /* The alias set of the lhs object. */
2617 gimplify_init_ctor_preeval_1 (tree
*tp
, int *walk_subtrees
, void *xdata
)
2619 struct gimplify_init_ctor_preeval_data
*data
2620 = (struct gimplify_init_ctor_preeval_data
*) xdata
;
2623 /* If we find the base object, obviously we have overlap. */
2624 if (data
->lhs_base_decl
== t
)
2627 /* If the constructor component is indirect, determine if we have a
2628 potential overlap with the lhs. The only bits of information we
2629 have to go on at this point are addressability and alias sets. */
2630 if (TREE_CODE (t
) == INDIRECT_REF
2631 && (!data
->lhs_base_decl
|| TREE_ADDRESSABLE (data
->lhs_base_decl
))
2632 && alias_sets_conflict_p (data
->lhs_alias_set
, get_alias_set (t
)))
2635 if (IS_TYPE_OR_DECL_P (t
))
2640 /* A subroutine of gimplify_init_constructor. Pre-evaluate *EXPR_P,
2641 force values that overlap with the lhs (as described by *DATA)
2642 into temporaries. */
2645 gimplify_init_ctor_preeval (tree
*expr_p
, tree
*pre_p
, tree
*post_p
,
2646 struct gimplify_init_ctor_preeval_data
*data
)
2648 enum gimplify_status one
;
2650 /* If the value is invariant, then there's nothing to pre-evaluate.
2651 But ensure it doesn't have any side-effects since a SAVE_EXPR is
2652 invariant but has side effects and might contain a reference to
2653 the object we're initializing. */
2654 if (TREE_INVARIANT (*expr_p
) && !TREE_SIDE_EFFECTS (*expr_p
))
2657 /* If the type has non-trivial constructors, we can't pre-evaluate. */
2658 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p
)))
2661 /* Recurse for nested constructors. */
2662 if (TREE_CODE (*expr_p
) == CONSTRUCTOR
)
2664 unsigned HOST_WIDE_INT ix
;
2665 constructor_elt
*ce
;
2666 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (*expr_p
);
2668 for (ix
= 0; VEC_iterate (constructor_elt
, v
, ix
, ce
); ix
++)
2669 gimplify_init_ctor_preeval (&ce
->value
, pre_p
, post_p
, data
);
2673 /* We can't preevaluate if the type contains a placeholder. */
2674 if (type_contains_placeholder_p (TREE_TYPE (*expr_p
)))
2677 /* Gimplify the constructor element to something appropriate for the rhs
2678 of a MODIFY_EXPR. Given that we know the lhs is an aggregate, we know
2679 the gimplifier will consider this a store to memory. Doing this
2680 gimplification now means that we won't have to deal with complicated
2681 language-specific trees, nor trees like SAVE_EXPR that can induce
2682 exponential search behavior. */
2683 one
= gimplify_expr (expr_p
, pre_p
, post_p
, is_gimple_mem_rhs
, fb_rvalue
);
2684 if (one
== GS_ERROR
)
2690 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
2691 with the lhs, since "a = { .x=a }" doesn't make sense. This will
2692 always be true for all scalars, since is_gimple_mem_rhs insists on a
2693 temporary variable for them. */
2694 if (DECL_P (*expr_p
))
2697 /* If this is of variable size, we have no choice but to assume it doesn't
2698 overlap since we can't make a temporary for it. */
2699 if (!TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (*expr_p
))))
2702 /* Otherwise, we must search for overlap ... */
2703 if (!walk_tree (expr_p
, gimplify_init_ctor_preeval_1
, data
, NULL
))
2706 /* ... and if found, force the value into a temporary. */
2707 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
2710 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
2711 a RANGE_EXPR in a CONSTRUCTOR for an array.
2715 object[var] = value;
2722 We increment var _after_ the loop exit check because we might otherwise
2723 fail if upper == TYPE_MAX_VALUE (type for upper).
2725 Note that we never have to deal with SAVE_EXPRs here, because this has
2726 already been taken care of for us, in gimplify_init_ctor_preeval(). */
2728 static void gimplify_init_ctor_eval (tree
, VEC(constructor_elt
,gc
) *,
2732 gimplify_init_ctor_eval_range (tree object
, tree lower
, tree upper
,
2733 tree value
, tree array_elt_type
,
2734 tree
*pre_p
, bool cleared
)
2736 tree loop_entry_label
, loop_exit_label
;
2737 tree var
, var_type
, cref
;
2739 loop_entry_label
= create_artificial_label ();
2740 loop_exit_label
= create_artificial_label ();
2742 /* Create and initialize the index variable. */
2743 var_type
= TREE_TYPE (upper
);
2744 var
= create_tmp_var (var_type
, NULL
);
2745 append_to_statement_list (build2 (MODIFY_EXPR
, var_type
, var
, lower
), pre_p
);
2747 /* Add the loop entry label. */
2748 append_to_statement_list (build1 (LABEL_EXPR
,
2753 /* Build the reference. */
2754 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
2755 var
, NULL_TREE
, NULL_TREE
);
2757 /* If we are a constructor, just call gimplify_init_ctor_eval to do
2758 the store. Otherwise just assign value to the reference. */
2760 if (TREE_CODE (value
) == CONSTRUCTOR
)
2761 /* NB we might have to call ourself recursively through
2762 gimplify_init_ctor_eval if the value is a constructor. */
2763 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
2766 append_to_statement_list (build2 (MODIFY_EXPR
, TREE_TYPE (cref
),
2770 /* We exit the loop when the index var is equal to the upper bound. */
2771 gimplify_and_add (build3 (COND_EXPR
, void_type_node
,
2772 build2 (EQ_EXPR
, boolean_type_node
,
2780 /* Otherwise, increment the index var... */
2781 append_to_statement_list (build2 (MODIFY_EXPR
, var_type
, var
,
2782 build2 (PLUS_EXPR
, var_type
, var
,
2783 fold_convert (var_type
,
2784 integer_one_node
))),
2787 /* ...and jump back to the loop entry. */
2788 append_to_statement_list (build1 (GOTO_EXPR
,
2793 /* Add the loop exit label. */
2794 append_to_statement_list (build1 (LABEL_EXPR
,
2800 /* Return true if FDECL is accessing a field that is zero sized. */
2803 zero_sized_field_decl (tree fdecl
)
2805 if (TREE_CODE (fdecl
) == FIELD_DECL
&& DECL_SIZE (fdecl
)
2806 && integer_zerop (DECL_SIZE (fdecl
)))
2811 /* Return true if TYPE is zero sized. */
2814 zero_sized_type (tree type
)
2816 if (AGGREGATE_TYPE_P (type
) && TYPE_SIZE (type
)
2817 && integer_zerop (TYPE_SIZE (type
)))
2822 /* A subroutine of gimplify_init_constructor. Generate individual
2823 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
2824 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
2825 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
2829 gimplify_init_ctor_eval (tree object
, VEC(constructor_elt
,gc
) *elts
,
2830 tree
*pre_p
, bool cleared
)
2832 tree array_elt_type
= NULL
;
2833 unsigned HOST_WIDE_INT ix
;
2834 tree purpose
, value
;
2836 if (TREE_CODE (TREE_TYPE (object
)) == ARRAY_TYPE
)
2837 array_elt_type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object
)));
2839 FOR_EACH_CONSTRUCTOR_ELT (elts
, ix
, purpose
, value
)
2843 /* NULL values are created above for gimplification errors. */
2847 if (cleared
&& initializer_zerop (value
))
2850 /* ??? Here's to hoping the front end fills in all of the indices,
2851 so we don't have to figure out what's missing ourselves. */
2852 gcc_assert (purpose
);
2854 /* Skip zero-sized fields, unless value has side-effects. This can
2855 happen with calls to functions returning a zero-sized type, which
2856 we shouldn't discard. As a number of downstream passes don't
2857 expect sets of zero-sized fields, we rely on the gimplification of
2858 the MODIFY_EXPR we make below to drop the assignment statement. */
2859 if (! TREE_SIDE_EFFECTS (value
) && zero_sized_field_decl (purpose
))
2862 /* If we have a RANGE_EXPR, we have to build a loop to assign the
2864 if (TREE_CODE (purpose
) == RANGE_EXPR
)
2866 tree lower
= TREE_OPERAND (purpose
, 0);
2867 tree upper
= TREE_OPERAND (purpose
, 1);
2869 /* If the lower bound is equal to upper, just treat it as if
2870 upper was the index. */
2871 if (simple_cst_equal (lower
, upper
))
2875 gimplify_init_ctor_eval_range (object
, lower
, upper
, value
,
2876 array_elt_type
, pre_p
, cleared
);
2883 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
2884 purpose
, NULL_TREE
, NULL_TREE
);
2888 gcc_assert (TREE_CODE (purpose
) == FIELD_DECL
);
2889 cref
= build3 (COMPONENT_REF
, TREE_TYPE (purpose
),
2890 unshare_expr (object
), purpose
, NULL_TREE
);
2893 if (TREE_CODE (value
) == CONSTRUCTOR
2894 && TREE_CODE (TREE_TYPE (value
)) != VECTOR_TYPE
)
2895 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
2899 init
= build2 (INIT_EXPR
, TREE_TYPE (cref
), cref
, value
);
2900 gimplify_and_add (init
, pre_p
);
2905 /* A subroutine of gimplify_modify_expr. Break out elements of a
2906 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
2908 Note that we still need to clear any elements that don't have explicit
2909 initializers, so if not all elements are initialized we keep the
2910 original MODIFY_EXPR, we just remove all of the constructor elements. */
2912 static enum gimplify_status
2913 gimplify_init_constructor (tree
*expr_p
, tree
*pre_p
,
2914 tree
*post_p
, bool want_value
)
2917 tree ctor
= TREE_OPERAND (*expr_p
, 1);
2918 tree type
= TREE_TYPE (ctor
);
2919 enum gimplify_status ret
;
2920 VEC(constructor_elt
,gc
) *elts
;
2922 if (TREE_CODE (ctor
) != CONSTRUCTOR
)
2923 return GS_UNHANDLED
;
2925 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
2926 is_gimple_lvalue
, fb_lvalue
);
2927 if (ret
== GS_ERROR
)
2929 object
= TREE_OPERAND (*expr_p
, 0);
2931 elts
= CONSTRUCTOR_ELTS (ctor
);
2934 switch (TREE_CODE (type
))
2938 case QUAL_UNION_TYPE
:
2941 struct gimplify_init_ctor_preeval_data preeval_data
;
2942 HOST_WIDE_INT num_type_elements
, num_ctor_elements
;
2943 HOST_WIDE_INT num_nonzero_elements
;
2944 bool cleared
, valid_const_initializer
;
2946 /* Aggregate types must lower constructors to initialization of
2947 individual elements. The exception is that a CONSTRUCTOR node
2948 with no elements indicates zero-initialization of the whole. */
2949 if (VEC_empty (constructor_elt
, elts
))
2952 /* Fetch information about the constructor to direct later processing.
2953 We might want to make static versions of it in various cases, and
2954 can only do so if it known to be a valid constant initializer. */
2955 valid_const_initializer
2956 = categorize_ctor_elements (ctor
, &num_nonzero_elements
,
2957 &num_ctor_elements
, &cleared
);
2959 /* If a const aggregate variable is being initialized, then it
2960 should never be a lose to promote the variable to be static. */
2961 if (valid_const_initializer
2962 && num_nonzero_elements
> 1
2963 && TREE_READONLY (object
)
2964 && TREE_CODE (object
) == VAR_DECL
)
2966 DECL_INITIAL (object
) = ctor
;
2967 TREE_STATIC (object
) = 1;
2968 if (!DECL_NAME (object
))
2969 DECL_NAME (object
) = create_tmp_var_name ("C");
2970 walk_tree (&DECL_INITIAL (object
), force_labels_r
, NULL
, NULL
);
2972 /* ??? C++ doesn't automatically append a .<number> to the
2973 assembler name, and even when it does, it looks a FE private
2974 data structures to figure out what that number should be,
2975 which are not set for this variable. I suppose this is
2976 important for local statics for inline functions, which aren't
2977 "local" in the object file sense. So in order to get a unique
2978 TU-local symbol, we must invoke the lhd version now. */
2979 lhd_set_decl_assembler_name (object
);
2981 *expr_p
= NULL_TREE
;
2985 /* If there are "lots" of initialized elements, even discounting
2986 those that are not address constants (and thus *must* be
2987 computed at runtime), then partition the constructor into
2988 constant and non-constant parts. Block copy the constant
2989 parts in, then generate code for the non-constant parts. */
2990 /* TODO. There's code in cp/typeck.c to do this. */
2992 num_type_elements
= count_type_elements (type
, true);
2994 /* If count_type_elements could not determine number of type elements
2995 for a constant-sized object, assume clearing is needed.
2996 Don't do this for variable-sized objects, as store_constructor
2997 will ignore the clearing of variable-sized objects. */
2998 if (num_type_elements
< 0 && int_size_in_bytes (type
) >= 0)
3000 /* If there are "lots" of zeros, then block clear the object first. */
3001 else if (num_type_elements
- num_nonzero_elements
> CLEAR_RATIO
3002 && num_nonzero_elements
< num_type_elements
/4)
3004 /* ??? This bit ought not be needed. For any element not present
3005 in the initializer, we should simply set them to zero. Except
3006 we'd need to *find* the elements that are not present, and that
3007 requires trickery to avoid quadratic compile-time behavior in
3008 large cases or excessive memory use in small cases. */
3009 else if (num_ctor_elements
< num_type_elements
)
3012 /* If there are "lots" of initialized elements, and all of them
3013 are valid address constants, then the entire initializer can
3014 be dropped to memory, and then memcpy'd out. Don't do this
3015 for sparse arrays, though, as it's more efficient to follow
3016 the standard CONSTRUCTOR behavior of memset followed by
3017 individual element initialization. */
3018 if (valid_const_initializer
&& !cleared
)
3020 HOST_WIDE_INT size
= int_size_in_bytes (type
);
3023 /* ??? We can still get unbounded array types, at least
3024 from the C++ front end. This seems wrong, but attempt
3025 to work around it for now. */
3028 size
= int_size_in_bytes (TREE_TYPE (object
));
3030 TREE_TYPE (ctor
) = type
= TREE_TYPE (object
);
3033 /* Find the maximum alignment we can assume for the object. */
3034 /* ??? Make use of DECL_OFFSET_ALIGN. */
3035 if (DECL_P (object
))
3036 align
= DECL_ALIGN (object
);
3038 align
= TYPE_ALIGN (type
);
3040 if (size
> 0 && !can_move_by_pieces (size
, align
))
3042 tree
new = create_tmp_var_raw (type
, "C");
3044 gimple_add_tmp_var (new);
3045 TREE_STATIC (new) = 1;
3046 TREE_READONLY (new) = 1;
3047 DECL_INITIAL (new) = ctor
;
3048 if (align
> DECL_ALIGN (new))
3050 DECL_ALIGN (new) = align
;
3051 DECL_USER_ALIGN (new) = 1;
3053 walk_tree (&DECL_INITIAL (new), force_labels_r
, NULL
, NULL
);
3055 TREE_OPERAND (*expr_p
, 1) = new;
3057 /* This is no longer an assignment of a CONSTRUCTOR, but
3058 we still may have processing to do on the LHS. So
3059 pretend we didn't do anything here to let that happen. */
3060 return GS_UNHANDLED
;
3064 /* If there are nonzero elements, pre-evaluate to capture elements
3065 overlapping with the lhs into temporaries. We must do this before
3066 clearing to fetch the values before they are zeroed-out. */
3067 if (num_nonzero_elements
> 0)
3069 preeval_data
.lhs_base_decl
= get_base_address (object
);
3070 if (!DECL_P (preeval_data
.lhs_base_decl
))
3071 preeval_data
.lhs_base_decl
= NULL
;
3072 preeval_data
.lhs_alias_set
= get_alias_set (object
);
3074 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p
, 1),
3075 pre_p
, post_p
, &preeval_data
);
3080 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3081 Note that we still have to gimplify, in order to handle the
3082 case of variable sized types. Avoid shared tree structures. */
3083 CONSTRUCTOR_ELTS (ctor
) = NULL
;
3084 object
= unshare_expr (object
);
3085 gimplify_stmt (expr_p
);
3086 append_to_statement_list (*expr_p
, pre_p
);
3089 /* If we have not block cleared the object, or if there are nonzero
3090 elements in the constructor, add assignments to the individual
3091 scalar fields of the object. */
3092 if (!cleared
|| num_nonzero_elements
> 0)
3093 gimplify_init_ctor_eval (object
, elts
, pre_p
, cleared
);
3095 *expr_p
= NULL_TREE
;
3103 /* Extract the real and imaginary parts out of the ctor. */
3104 gcc_assert (VEC_length (constructor_elt
, elts
) == 2);
3105 r
= VEC_index (constructor_elt
, elts
, 0)->value
;
3106 i
= VEC_index (constructor_elt
, elts
, 1)->value
;
3107 if (r
== NULL
|| i
== NULL
)
3109 tree zero
= fold_convert (TREE_TYPE (type
), integer_zero_node
);
3116 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3117 represent creation of a complex value. */
3118 if (TREE_CONSTANT (r
) && TREE_CONSTANT (i
))
3120 ctor
= build_complex (type
, r
, i
);
3121 TREE_OPERAND (*expr_p
, 1) = ctor
;
3125 ctor
= build2 (COMPLEX_EXPR
, type
, r
, i
);
3126 TREE_OPERAND (*expr_p
, 1) = ctor
;
3127 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
3128 rhs_predicate_for (TREE_OPERAND (*expr_p
, 0)),
3136 unsigned HOST_WIDE_INT ix
;
3137 constructor_elt
*ce
;
3139 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3140 if (TREE_CONSTANT (ctor
))
3142 bool constant_p
= true;
3145 /* Even when ctor is constant, it might contain non-*_CST
3146 elements (e.g. { 1.0/0.0 - 1.0/0.0, 0.0 }) and those don't
3147 belong into VECTOR_CST nodes. */
3148 FOR_EACH_CONSTRUCTOR_VALUE (elts
, ix
, value
)
3149 if (!CONSTANT_CLASS_P (value
))
3157 TREE_OPERAND (*expr_p
, 1) = build_vector_from_ctor (type
, elts
);
3162 /* Vector types use CONSTRUCTOR all the way through gimple
3163 compilation as a general initializer. */
3164 for (ix
= 0; VEC_iterate (constructor_elt
, elts
, ix
, ce
); ix
++)
3166 enum gimplify_status tret
;
3167 tret
= gimplify_expr (&ce
->value
, pre_p
, post_p
,
3168 is_gimple_val
, fb_rvalue
);
3169 if (tret
== GS_ERROR
)
3176 /* So how did we get a CONSTRUCTOR for a scalar type? */
3180 if (ret
== GS_ERROR
)
3182 else if (want_value
)
3184 append_to_statement_list (*expr_p
, pre_p
);
3192 /* Given a pointer value OP0, return a simplified version of an
3193 indirection through OP0, or NULL_TREE if no simplification is
3194 possible. This may only be applied to a rhs of an expression.
3195 Note that the resulting type may be different from the type pointed
3196 to in the sense that it is still compatible from the langhooks
3200 fold_indirect_ref_rhs (tree t
)
3202 tree type
= TREE_TYPE (TREE_TYPE (t
));
3207 subtype
= TREE_TYPE (sub
);
3208 if (!POINTER_TYPE_P (subtype
))
3211 if (TREE_CODE (sub
) == ADDR_EXPR
)
3213 tree op
= TREE_OPERAND (sub
, 0);
3214 tree optype
= TREE_TYPE (op
);
3216 if (lang_hooks
.types_compatible_p (type
, optype
))
3218 /* *(foo *)&fooarray => fooarray[0] */
3219 else if (TREE_CODE (optype
) == ARRAY_TYPE
3220 && lang_hooks
.types_compatible_p (type
, TREE_TYPE (optype
)))
3222 tree type_domain
= TYPE_DOMAIN (optype
);
3223 tree min_val
= size_zero_node
;
3224 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
3225 min_val
= TYPE_MIN_VALUE (type_domain
);
3226 return build4 (ARRAY_REF
, type
, op
, min_val
, NULL_TREE
, NULL_TREE
);
3230 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
3231 if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
3232 && lang_hooks
.types_compatible_p (type
, TREE_TYPE (TREE_TYPE (subtype
))))
3235 tree min_val
= size_zero_node
;
3237 sub
= fold_indirect_ref_rhs (sub
);
3239 sub
= build1 (INDIRECT_REF
, TREE_TYPE (subtype
), osub
);
3240 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
3241 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
3242 min_val
= TYPE_MIN_VALUE (type_domain
);
3243 return build4 (ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
, NULL_TREE
);
3249 /* Subroutine of gimplify_modify_expr to do simplifications of MODIFY_EXPRs
3250 based on the code of the RHS. We loop for as long as something changes. */
3252 static enum gimplify_status
3253 gimplify_modify_expr_rhs (tree
*expr_p
, tree
*from_p
, tree
*to_p
, tree
*pre_p
,
3254 tree
*post_p
, bool want_value
)
3256 enum gimplify_status ret
= GS_OK
;
3258 while (ret
!= GS_UNHANDLED
)
3259 switch (TREE_CODE (*from_p
))
3263 /* If we have code like
3267 where the type of "x" is a (possibly cv-qualified variant
3268 of "A"), treat the entire expression as identical to "x".
3269 This kind of code arises in C++ when an object is bound
3270 to a const reference, and if "x" is a TARGET_EXPR we want
3271 to take advantage of the optimization below. */
3272 tree t
= fold_indirect_ref_rhs (TREE_OPERAND (*from_p
, 0));
3285 /* If we are initializing something from a TARGET_EXPR, strip the
3286 TARGET_EXPR and initialize it directly, if possible. This can't
3287 be done if the initializer is void, since that implies that the
3288 temporary is set in some non-trivial way.
3290 ??? What about code that pulls out the temp and uses it
3291 elsewhere? I think that such code never uses the TARGET_EXPR as
3292 an initializer. If I'm wrong, we'll die because the temp won't
3293 have any RTL. In that case, I guess we'll need to replace
3294 references somehow. */
3295 tree init
= TARGET_EXPR_INITIAL (*from_p
);
3297 if (!VOID_TYPE_P (TREE_TYPE (init
)))
3308 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
3310 gimplify_compound_expr (from_p
, pre_p
, true);
3315 /* If we're initializing from a CONSTRUCTOR, break this into
3316 individual MODIFY_EXPRs. */
3317 return gimplify_init_constructor (expr_p
, pre_p
, post_p
, want_value
);
3320 /* If we're assigning to a non-register type, push the assignment
3321 down into the branches. This is mandatory for ADDRESSABLE types,
3322 since we cannot generate temporaries for such, but it saves a
3323 copy in other cases as well. */
3324 if (!is_gimple_reg_type (TREE_TYPE (*from_p
)))
3326 /* This code should mirror the code in gimplify_cond_expr. */
3327 enum tree_code code
= TREE_CODE (*expr_p
);
3328 tree cond
= *from_p
;
3329 tree result
= *to_p
;
3331 ret
= gimplify_expr (&result
, pre_p
, post_p
,
3332 is_gimple_min_lval
, fb_lvalue
);
3333 if (ret
!= GS_ERROR
)
3336 if (TREE_TYPE (TREE_OPERAND (cond
, 1)) != void_type_node
)
3337 TREE_OPERAND (cond
, 1)
3338 = build2 (code
, void_type_node
, result
,
3339 TREE_OPERAND (cond
, 1));
3340 if (TREE_TYPE (TREE_OPERAND (cond
, 2)) != void_type_node
)
3341 TREE_OPERAND (cond
, 2)
3342 = build2 (code
, void_type_node
, unshare_expr (result
),
3343 TREE_OPERAND (cond
, 2));
3345 TREE_TYPE (cond
) = void_type_node
;
3346 recalculate_side_effects (cond
);
3350 gimplify_and_add (cond
, pre_p
);
3351 *expr_p
= unshare_expr (result
);
3362 /* For calls that return in memory, give *to_p as the CALL_EXPR's
3363 return slot so that we don't generate a temporary. */
3364 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p
)
3365 && aggregate_value_p (*from_p
, *from_p
))
3369 if (!(rhs_predicate_for (*to_p
))(*from_p
))
3370 /* If we need a temporary, *to_p isn't accurate. */
3372 else if (TREE_CODE (*to_p
) == RESULT_DECL
3373 && DECL_NAME (*to_p
) == NULL_TREE
3374 && needs_to_live_in_memory (*to_p
))
3375 /* It's OK to use the return slot directly unless it's an NRV. */
3377 else if (is_gimple_reg_type (TREE_TYPE (*to_p
))
3378 || (DECL_P (*to_p
) && DECL_REGISTER (*to_p
)))
3379 /* Don't force regs into memory. */
3381 else if (TREE_CODE (*to_p
) == VAR_DECL
3382 && DECL_GIMPLE_FORMAL_TEMP_P (*to_p
))
3383 /* Don't use the original target if it's a formal temp; we
3384 don't want to take their addresses. */
3386 else if (TREE_CODE (*expr_p
) == INIT_EXPR
)
3387 /* It's OK to use the target directly if it's being
3390 else if (!is_gimple_non_addressable (*to_p
))
3391 /* Don't use the original target if it's already addressable;
3392 if its address escapes, and the called function uses the
3393 NRV optimization, a conforming program could see *to_p
3394 change before the called function returns; see c++/19317.
3395 When optimizing, the return_slot pass marks more functions
3396 as safe after we have escape info. */
3403 CALL_EXPR_RETURN_SLOT_OPT (*from_p
) = 1;
3404 lang_hooks
.mark_addressable (*to_p
);
3419 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
3420 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
3421 DECL_COMPLEX_GIMPLE_REG_P set. */
3423 static enum gimplify_status
3424 gimplify_modify_expr_complex_part (tree
*expr_p
, tree
*pre_p
, bool want_value
)
3426 enum tree_code code
, ocode
;
3427 tree lhs
, rhs
, new_rhs
, other
, realpart
, imagpart
;
3429 lhs
= TREE_OPERAND (*expr_p
, 0);
3430 rhs
= TREE_OPERAND (*expr_p
, 1);
3431 code
= TREE_CODE (lhs
);
3432 lhs
= TREE_OPERAND (lhs
, 0);
3434 ocode
= code
== REALPART_EXPR
? IMAGPART_EXPR
: REALPART_EXPR
;
3435 other
= build1 (ocode
, TREE_TYPE (rhs
), lhs
);
3436 other
= get_formal_tmp_var (other
, pre_p
);
3438 realpart
= code
== REALPART_EXPR
? rhs
: other
;
3439 imagpart
= code
== REALPART_EXPR
? other
: rhs
;
3441 if (TREE_CONSTANT (realpart
) && TREE_CONSTANT (imagpart
))
3442 new_rhs
= build_complex (TREE_TYPE (lhs
), realpart
, imagpart
);
3444 new_rhs
= build2 (COMPLEX_EXPR
, TREE_TYPE (lhs
), realpart
, imagpart
);
3446 TREE_OPERAND (*expr_p
, 0) = lhs
;
3447 TREE_OPERAND (*expr_p
, 1) = new_rhs
;
3451 append_to_statement_list (*expr_p
, pre_p
);
3458 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
3464 PRE_P points to the list where side effects that must happen before
3465 *EXPR_P should be stored.
3467 POST_P points to the list where side effects that must happen after
3468 *EXPR_P should be stored.
3470 WANT_VALUE is nonzero iff we want to use the value of this expression
3471 in another expression. */
3473 static enum gimplify_status
3474 gimplify_modify_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
, bool want_value
)
3476 tree
*from_p
= &TREE_OPERAND (*expr_p
, 1);
3477 tree
*to_p
= &TREE_OPERAND (*expr_p
, 0);
3478 enum gimplify_status ret
= GS_UNHANDLED
;
3480 gcc_assert (TREE_CODE (*expr_p
) == MODIFY_EXPR
3481 || TREE_CODE (*expr_p
) == INIT_EXPR
);
3483 /* For zero sized types only gimplify the left hand side and right hand side
3484 as statements and throw away the assignment. */
3485 if (zero_sized_type (TREE_TYPE (*from_p
)))
3487 gimplify_stmt (from_p
);
3488 gimplify_stmt (to_p
);
3489 append_to_statement_list (*from_p
, pre_p
);
3490 append_to_statement_list (*to_p
, pre_p
);
3491 *expr_p
= NULL_TREE
;
3495 /* See if any simplifications can be done based on what the RHS is. */
3496 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
3498 if (ret
!= GS_UNHANDLED
)
3501 /* If the value being copied is of variable width, compute the length
3502 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
3503 before gimplifying any of the operands so that we can resolve any
3504 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
3505 the size of the expression to be copied, not of the destination, so
3506 that is what we must here. */
3507 maybe_with_size_expr (from_p
);
3509 ret
= gimplify_expr (to_p
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
3510 if (ret
== GS_ERROR
)
3513 ret
= gimplify_expr (from_p
, pre_p
, post_p
,
3514 rhs_predicate_for (*to_p
), fb_rvalue
);
3515 if (ret
== GS_ERROR
)
3518 /* Now see if the above changed *from_p to something we handle specially. */
3519 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
3521 if (ret
!= GS_UNHANDLED
)
3524 /* If we've got a variable sized assignment between two lvalues (i.e. does
3525 not involve a call), then we can make things a bit more straightforward
3526 by converting the assignment to memcpy or memset. */
3527 if (TREE_CODE (*from_p
) == WITH_SIZE_EXPR
)
3529 tree from
= TREE_OPERAND (*from_p
, 0);
3530 tree size
= TREE_OPERAND (*from_p
, 1);
3532 if (TREE_CODE (from
) == CONSTRUCTOR
)
3533 return gimplify_modify_expr_to_memset (expr_p
, size
, want_value
);
3534 if (is_gimple_addressable (from
))
3537 return gimplify_modify_expr_to_memcpy (expr_p
, size
, want_value
);
3541 /* Transform partial stores to non-addressable complex variables into
3542 total stores. This allows us to use real instead of virtual operands
3543 for these variables, which improves optimization. */
3544 if ((TREE_CODE (*to_p
) == REALPART_EXPR
3545 || TREE_CODE (*to_p
) == IMAGPART_EXPR
)
3546 && is_gimple_reg (TREE_OPERAND (*to_p
, 0)))
3547 return gimplify_modify_expr_complex_part (expr_p
, pre_p
, want_value
);
3549 if (gimplify_ctxp
->into_ssa
&& is_gimple_reg (*to_p
))
3551 /* If we've somehow already got an SSA_NAME on the LHS, then
3552 we're probably modified it twice. Not good. */
3553 gcc_assert (TREE_CODE (*to_p
) != SSA_NAME
);
3554 *to_p
= make_ssa_name (*to_p
, *expr_p
);
3559 append_to_statement_list (*expr_p
, pre_p
);
3567 /* Gimplify a comparison between two variable-sized objects. Do this
3568 with a call to BUILT_IN_MEMCMP. */
3570 static enum gimplify_status
3571 gimplify_variable_sized_compare (tree
*expr_p
)
3573 tree op0
= TREE_OPERAND (*expr_p
, 0);
3574 tree op1
= TREE_OPERAND (*expr_p
, 1);
3577 t
= TYPE_SIZE_UNIT (TREE_TYPE (op0
));
3578 t
= unshare_expr (t
);
3579 t
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (t
, op0
);
3580 args
= tree_cons (NULL
, t
, NULL
);
3581 t
= build_fold_addr_expr (op1
);
3582 args
= tree_cons (NULL
, t
, args
);
3583 dest
= build_fold_addr_expr (op0
);
3584 args
= tree_cons (NULL
, dest
, args
);
3585 t
= implicit_built_in_decls
[BUILT_IN_MEMCMP
];
3586 t
= build_function_call_expr (t
, args
);
3588 = build2 (TREE_CODE (*expr_p
), TREE_TYPE (*expr_p
), t
, integer_zero_node
);
3593 /* Gimplify a comparison between two aggregate objects of integral scalar
3594 mode as a comparison between the bitwise equivalent scalar values. */
3596 static enum gimplify_status
3597 gimplify_scalar_mode_aggregate_compare (tree
*expr_p
)
3599 tree op0
= TREE_OPERAND (*expr_p
, 0);
3600 tree op1
= TREE_OPERAND (*expr_p
, 1);
3602 tree type
= TREE_TYPE (op0
);
3603 tree scalar_type
= lang_hooks
.types
.type_for_mode (TYPE_MODE (type
), 1);
3605 op0
= fold_build1 (VIEW_CONVERT_EXPR
, scalar_type
, op0
);
3606 op1
= fold_build1 (VIEW_CONVERT_EXPR
, scalar_type
, op1
);
3609 = fold_build2 (TREE_CODE (*expr_p
), TREE_TYPE (*expr_p
), op0
, op1
);
3614 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
3615 points to the expression to gimplify.
3617 Expressions of the form 'a && b' are gimplified to:
3619 a && b ? true : false
3621 gimplify_cond_expr will do the rest.
3623 PRE_P points to the list where side effects that must happen before
3624 *EXPR_P should be stored. */
3626 static enum gimplify_status
3627 gimplify_boolean_expr (tree
*expr_p
)
3629 /* Preserve the original type of the expression. */
3630 tree type
= TREE_TYPE (*expr_p
);
3632 *expr_p
= build3 (COND_EXPR
, type
, *expr_p
,
3633 fold_convert (type
, boolean_true_node
),
3634 fold_convert (type
, boolean_false_node
));
3639 /* Gimplifies an expression sequence. This function gimplifies each
3640 expression and re-writes the original expression with the last
3641 expression of the sequence in GIMPLE form.
3643 PRE_P points to the list where the side effects for all the
3644 expressions in the sequence will be emitted.
3646 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
3647 /* ??? Should rearrange to share the pre-queue with all the indirect
3648 invocations of gimplify_expr. Would probably save on creations
3649 of statement_list nodes. */
3651 static enum gimplify_status
3652 gimplify_compound_expr (tree
*expr_p
, tree
*pre_p
, bool want_value
)
3658 tree
*sub_p
= &TREE_OPERAND (t
, 0);
3660 if (TREE_CODE (*sub_p
) == COMPOUND_EXPR
)
3661 gimplify_compound_expr (sub_p
, pre_p
, false);
3663 gimplify_stmt (sub_p
);
3664 append_to_statement_list (*sub_p
, pre_p
);
3666 t
= TREE_OPERAND (t
, 1);
3668 while (TREE_CODE (t
) == COMPOUND_EXPR
);
3675 gimplify_stmt (expr_p
);
3680 /* Gimplifies a statement list. These may be created either by an
3681 enlightened front-end, or by shortcut_cond_expr. */
3683 static enum gimplify_status
3684 gimplify_statement_list (tree
*expr_p
)
3686 tree_stmt_iterator i
= tsi_start (*expr_p
);
3688 while (!tsi_end_p (i
))
3692 gimplify_stmt (tsi_stmt_ptr (i
));
3697 else if (TREE_CODE (t
) == STATEMENT_LIST
)
3699 tsi_link_before (&i
, t
, TSI_SAME_STMT
);
3709 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
3710 gimplify. After gimplification, EXPR_P will point to a new temporary
3711 that holds the original value of the SAVE_EXPR node.
3713 PRE_P points to the list where side effects that must happen before
3714 *EXPR_P should be stored. */
3716 static enum gimplify_status
3717 gimplify_save_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
3719 enum gimplify_status ret
= GS_ALL_DONE
;
3722 gcc_assert (TREE_CODE (*expr_p
) == SAVE_EXPR
);
3723 val
= TREE_OPERAND (*expr_p
, 0);
3725 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
3726 if (!SAVE_EXPR_RESOLVED_P (*expr_p
))
3728 /* The operand may be a void-valued expression such as SAVE_EXPRs
3729 generated by the Java frontend for class initialization. It is
3730 being executed only for its side-effects. */
3731 if (TREE_TYPE (val
) == void_type_node
)
3733 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
3734 is_gimple_stmt
, fb_none
);
3735 append_to_statement_list (TREE_OPERAND (*expr_p
, 0), pre_p
);
3739 val
= get_initialized_tmp_var (val
, pre_p
, post_p
);
3741 TREE_OPERAND (*expr_p
, 0) = val
;
3742 SAVE_EXPR_RESOLVED_P (*expr_p
) = 1;
3750 /* Re-write the ADDR_EXPR node pointed to by EXPR_P
3757 PRE_P points to the list where side effects that must happen before
3758 *EXPR_P should be stored.
3760 POST_P points to the list where side effects that must happen after
3761 *EXPR_P should be stored. */
3763 static enum gimplify_status
3764 gimplify_addr_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
3766 tree expr
= *expr_p
;
3767 tree op0
= TREE_OPERAND (expr
, 0);
3768 enum gimplify_status ret
;
3770 switch (TREE_CODE (op0
))
3773 case MISALIGNED_INDIRECT_REF
:
3775 /* Check if we are dealing with an expression of the form '&*ptr'.
3776 While the front end folds away '&*ptr' into 'ptr', these
3777 expressions may be generated internally by the compiler (e.g.,
3778 builtins like __builtin_va_end). */
3779 /* Caution: the silent array decomposition semantics we allow for
3780 ADDR_EXPR means we can't always discard the pair. */
3781 /* Gimplification of the ADDR_EXPR operand may drop
3782 cv-qualification conversions, so make sure we add them if
3785 tree op00
= TREE_OPERAND (op0
, 0);
3786 tree t_expr
= TREE_TYPE (expr
);
3787 tree t_op00
= TREE_TYPE (op00
);
3789 if (!lang_hooks
.types_compatible_p (t_expr
, t_op00
))
3791 #ifdef ENABLE_CHECKING
3792 tree t_op0
= TREE_TYPE (op0
);
3793 gcc_assert (POINTER_TYPE_P (t_expr
)
3794 && cpt_same_type (TREE_CODE (t_op0
) == ARRAY_TYPE
3795 ? TREE_TYPE (t_op0
) : t_op0
,
3797 && POINTER_TYPE_P (t_op00
)
3798 && cpt_same_type (t_op0
, TREE_TYPE (t_op00
)));
3800 op00
= fold_convert (TREE_TYPE (expr
), op00
);
3807 case VIEW_CONVERT_EXPR
:
3808 /* Take the address of our operand and then convert it to the type of
3811 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
3812 all clear. The impact of this transformation is even less clear. */
3814 /* If the operand is a useless conversion, look through it. Doing so
3815 guarantees that the ADDR_EXPR and its operand will remain of the
3817 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0
, 0)))
3818 op0
= TREE_OPERAND (op0
, 0);
3820 *expr_p
= fold_convert (TREE_TYPE (expr
),
3821 build_fold_addr_expr (TREE_OPERAND (op0
, 0)));
3826 /* We use fb_either here because the C frontend sometimes takes
3827 the address of a call that returns a struct; see
3828 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
3829 the implied temporary explicit. */
3830 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, post_p
,
3831 is_gimple_addressable
, fb_either
);
3832 if (ret
!= GS_ERROR
)
3834 op0
= TREE_OPERAND (expr
, 0);
3836 /* For various reasons, the gimplification of the expression
3837 may have made a new INDIRECT_REF. */
3838 if (TREE_CODE (op0
) == INDIRECT_REF
)
3839 goto do_indirect_ref
;
3841 /* Make sure TREE_INVARIANT, TREE_CONSTANT, and TREE_SIDE_EFFECTS
3843 recompute_tree_invariant_for_addr_expr (expr
);
3845 /* Mark the RHS addressable. */
3846 lang_hooks
.mark_addressable (TREE_OPERAND (expr
, 0));
3854 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
3855 value; output operands should be a gimple lvalue. */
3857 static enum gimplify_status
3858 gimplify_asm_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
3860 tree expr
= *expr_p
;
3861 int noutputs
= list_length (ASM_OUTPUTS (expr
));
3862 const char **oconstraints
3863 = (const char **) alloca ((noutputs
) * sizeof (const char *));
3866 const char *constraint
;
3867 bool allows_mem
, allows_reg
, is_inout
;
3868 enum gimplify_status ret
, tret
;
3871 for (i
= 0, link
= ASM_OUTPUTS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
3873 size_t constraint_len
;
3874 oconstraints
[i
] = constraint
3875 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
3876 constraint_len
= strlen (constraint
);
3877 if (constraint_len
== 0)
3880 parse_output_constraint (&constraint
, i
, 0, 0,
3881 &allows_mem
, &allows_reg
, &is_inout
);
3883 if (!allows_reg
&& allows_mem
)
3884 lang_hooks
.mark_addressable (TREE_VALUE (link
));
3886 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
3887 is_inout
? is_gimple_min_lval
: is_gimple_lvalue
,
3888 fb_lvalue
| fb_mayfail
);
3889 if (tret
== GS_ERROR
)
3891 error ("invalid lvalue in asm output %d", i
);
3897 /* An input/output operand. To give the optimizers more
3898 flexibility, split it into separate input and output
3903 /* Turn the in/out constraint into an output constraint. */
3904 char *p
= xstrdup (constraint
);
3906 TREE_VALUE (TREE_PURPOSE (link
)) = build_string (constraint_len
, p
);
3908 /* And add a matching input constraint. */
3911 sprintf (buf
, "%d", i
);
3913 /* If there are multiple alternatives in the constraint,
3914 handle each of them individually. Those that allow register
3915 will be replaced with operand number, the others will stay
3917 if (strchr (p
, ',') != NULL
)
3919 size_t len
= 0, buflen
= strlen (buf
);
3920 char *beg
, *end
, *str
, *dst
;
3924 end
= strchr (beg
, ',');
3926 end
= strchr (beg
, '\0');
3927 if ((size_t) (end
- beg
) < buflen
)
3930 len
+= end
- beg
+ 1;
3937 str
= (char *) alloca (len
);
3938 for (beg
= p
+ 1, dst
= str
;;)
3941 bool mem_p
, reg_p
, inout_p
;
3943 end
= strchr (beg
, ',');
3948 parse_output_constraint (&tem
, i
, 0, 0,
3949 &mem_p
, ®_p
, &inout_p
);
3954 memcpy (dst
, buf
, buflen
);
3963 memcpy (dst
, beg
, len
);
3972 input
= build_string (dst
- str
, str
);
3975 input
= build_string (strlen (buf
), buf
);
3978 input
= build_string (constraint_len
- 1, constraint
+ 1);
3982 input
= build_tree_list (build_tree_list (NULL_TREE
, input
),
3983 unshare_expr (TREE_VALUE (link
)));
3984 ASM_INPUTS (expr
) = chainon (ASM_INPUTS (expr
), input
);
3988 for (link
= ASM_INPUTS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
3991 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
3992 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
3993 oconstraints
, &allows_mem
, &allows_reg
);
3995 /* If the operand is a memory input, it should be an lvalue. */
3996 if (!allows_reg
&& allows_mem
)
3998 lang_hooks
.mark_addressable (TREE_VALUE (link
));
3999 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
4000 is_gimple_lvalue
, fb_lvalue
| fb_mayfail
);
4001 if (tret
== GS_ERROR
)
4003 error ("memory input %d is not directly addressable", i
);
4009 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
4010 is_gimple_asm_val
, fb_rvalue
);
4011 if (tret
== GS_ERROR
)
4019 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
4020 WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
4021 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
4022 return to this function.
4024 FIXME should we complexify the prequeue handling instead? Or use flags
4025 for all the cleanups and let the optimizer tighten them up? The current
4026 code seems pretty fragile; it will break on a cleanup within any
4027 non-conditional nesting. But any such nesting would be broken, anyway;
4028 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
4029 and continues out of it. We can do that at the RTL level, though, so
4030 having an optimizer to tighten up try/finally regions would be a Good
4033 static enum gimplify_status
4034 gimplify_cleanup_point_expr (tree
*expr_p
, tree
*pre_p
)
4036 tree_stmt_iterator iter
;
4039 tree temp
= voidify_wrapper_expr (*expr_p
, NULL
);
4041 /* We only care about the number of conditions between the innermost
4042 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
4043 any cleanups collected outside the CLEANUP_POINT_EXPR. */
4044 int old_conds
= gimplify_ctxp
->conditions
;
4045 tree old_cleanups
= gimplify_ctxp
->conditional_cleanups
;
4046 gimplify_ctxp
->conditions
= 0;
4047 gimplify_ctxp
->conditional_cleanups
= NULL_TREE
;
4049 body
= TREE_OPERAND (*expr_p
, 0);
4050 gimplify_to_stmt_list (&body
);
4052 gimplify_ctxp
->conditions
= old_conds
;
4053 gimplify_ctxp
->conditional_cleanups
= old_cleanups
;
4055 for (iter
= tsi_start (body
); !tsi_end_p (iter
); )
4057 tree
*wce_p
= tsi_stmt_ptr (iter
);
4060 if (TREE_CODE (wce
) == WITH_CLEANUP_EXPR
)
4062 if (tsi_one_before_end_p (iter
))
4064 tsi_link_before (&iter
, TREE_OPERAND (wce
, 0), TSI_SAME_STMT
);
4071 enum tree_code code
;
4073 if (CLEANUP_EH_ONLY (wce
))
4074 code
= TRY_CATCH_EXPR
;
4076 code
= TRY_FINALLY_EXPR
;
4078 sl
= tsi_split_statement_list_after (&iter
);
4079 tfe
= build2 (code
, void_type_node
, sl
, NULL_TREE
);
4080 append_to_statement_list (TREE_OPERAND (wce
, 0),
4081 &TREE_OPERAND (tfe
, 1));
4083 iter
= tsi_start (sl
);
4093 append_to_statement_list (body
, pre_p
);
4103 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
4104 is the cleanup action required. */
4107 gimple_push_cleanup (tree var
, tree cleanup
, bool eh_only
, tree
*pre_p
)
4111 /* Errors can result in improperly nested cleanups. Which results in
4112 confusion when trying to resolve the WITH_CLEANUP_EXPR. */
4113 if (errorcount
|| sorrycount
)
4116 if (gimple_conditional_context ())
4118 /* If we're in a conditional context, this is more complex. We only
4119 want to run the cleanup if we actually ran the initialization that
4120 necessitates it, but we want to run it after the end of the
4121 conditional context. So we wrap the try/finally around the
4122 condition and use a flag to determine whether or not to actually
4123 run the destructor. Thus
4127 becomes (approximately)
4131 if (test) { A::A(temp); flag = 1; val = f(temp); }
4134 if (flag) A::~A(temp);
4139 tree flag
= create_tmp_var (boolean_type_node
, "cleanup");
4140 tree ffalse
= build2 (MODIFY_EXPR
, void_type_node
, flag
,
4141 boolean_false_node
);
4142 tree ftrue
= build2 (MODIFY_EXPR
, void_type_node
, flag
,
4144 cleanup
= build3 (COND_EXPR
, void_type_node
, flag
, cleanup
, NULL
);
4145 wce
= build1 (WITH_CLEANUP_EXPR
, void_type_node
, cleanup
);
4146 append_to_statement_list (ffalse
, &gimplify_ctxp
->conditional_cleanups
);
4147 append_to_statement_list (wce
, &gimplify_ctxp
->conditional_cleanups
);
4148 append_to_statement_list (ftrue
, pre_p
);
4150 /* Because of this manipulation, and the EH edges that jump
4151 threading cannot redirect, the temporary (VAR) will appear
4152 to be used uninitialized. Don't warn. */
4153 TREE_NO_WARNING (var
) = 1;
4157 wce
= build1 (WITH_CLEANUP_EXPR
, void_type_node
, cleanup
);
4158 CLEANUP_EH_ONLY (wce
) = eh_only
;
4159 append_to_statement_list (wce
, pre_p
);
4162 gimplify_stmt (&TREE_OPERAND (wce
, 0));
4165 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
4167 static enum gimplify_status
4168 gimplify_target_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
4170 tree targ
= *expr_p
;
4171 tree temp
= TARGET_EXPR_SLOT (targ
);
4172 tree init
= TARGET_EXPR_INITIAL (targ
);
4173 enum gimplify_status ret
;
4177 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
4178 to the temps list. */
4179 gimple_add_tmp_var (temp
);
4181 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
4182 expression is supposed to initialize the slot. */
4183 if (VOID_TYPE_P (TREE_TYPE (init
)))
4184 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
, fb_none
);
4187 /* Special handling for BIND_EXPR can result in fewer temps. */
4189 if (TREE_CODE (init
) == BIND_EXPR
)
4190 gimplify_bind_expr (&init
, temp
, pre_p
);
4193 init
= build2 (INIT_EXPR
, void_type_node
, temp
, init
);
4194 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
,
4198 if (ret
== GS_ERROR
)
4200 append_to_statement_list (init
, pre_p
);
4202 /* If needed, push the cleanup for the temp. */
4203 if (TARGET_EXPR_CLEANUP (targ
))
4205 gimplify_stmt (&TARGET_EXPR_CLEANUP (targ
));
4206 gimple_push_cleanup (temp
, TARGET_EXPR_CLEANUP (targ
),
4207 CLEANUP_EH_ONLY (targ
), pre_p
);
4210 /* Only expand this once. */
4211 TREE_OPERAND (targ
, 3) = init
;
4212 TARGET_EXPR_INITIAL (targ
) = NULL_TREE
;
4215 /* We should have expanded this before. */
4216 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp
));
4222 /* Gimplification of expression trees. */
4224 /* Gimplify an expression which appears at statement context; usually, this
4225 means replacing it with a suitably gimple STATEMENT_LIST. */
4228 gimplify_stmt (tree
*stmt_p
)
4230 gimplify_expr (stmt_p
, NULL
, NULL
, is_gimple_stmt
, fb_none
);
4233 /* Similarly, but force the result to be a STATEMENT_LIST. */
4236 gimplify_to_stmt_list (tree
*stmt_p
)
4238 gimplify_stmt (stmt_p
);
4240 *stmt_p
= alloc_stmt_list ();
4241 else if (TREE_CODE (*stmt_p
) != STATEMENT_LIST
)
4244 *stmt_p
= alloc_stmt_list ();
4245 append_to_statement_list (t
, stmt_p
);
4250 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
4251 to CTX. If entries already exist, force them to be some flavor of private.
4252 If there is no enclosing parallel, do nothing. */
4255 omp_firstprivatize_variable (struct gimplify_omp_ctx
*ctx
, tree decl
)
4259 if (decl
== NULL
|| !DECL_P (decl
))
4264 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
4267 if (n
->value
& GOVD_SHARED
)
4268 n
->value
= GOVD_FIRSTPRIVATE
| (n
->value
& GOVD_SEEN
);
4272 else if (ctx
->is_parallel
)
4273 omp_add_variable (ctx
, decl
, GOVD_FIRSTPRIVATE
);
4275 ctx
= ctx
->outer_context
;
4280 /* Similarly for each of the type sizes of TYPE. */
4283 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx
*ctx
, tree type
)
4285 if (type
== NULL
|| type
== error_mark_node
)
4287 type
= TYPE_MAIN_VARIANT (type
);
4289 if (pointer_set_insert (ctx
->privatized_types
, type
))
4292 switch (TREE_CODE (type
))
4298 omp_firstprivatize_variable (ctx
, TYPE_MIN_VALUE (type
));
4299 omp_firstprivatize_variable (ctx
, TYPE_MAX_VALUE (type
));
4303 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
4304 omp_firstprivatize_type_sizes (ctx
, TYPE_DOMAIN (type
));
4309 case QUAL_UNION_TYPE
:
4312 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
4313 if (TREE_CODE (field
) == FIELD_DECL
)
4315 omp_firstprivatize_variable (ctx
, DECL_FIELD_OFFSET (field
));
4316 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (field
));
4322 case REFERENCE_TYPE
:
4323 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
4330 omp_firstprivatize_variable (ctx
, TYPE_SIZE (type
));
4331 omp_firstprivatize_variable (ctx
, TYPE_SIZE_UNIT (type
));
4332 lang_hooks
.types
.omp_firstprivatize_type_sizes (ctx
, type
);
4335 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
4338 omp_add_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, unsigned int flags
)
4341 unsigned int nflags
;
4344 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
4347 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
4348 there are constructors involved somewhere. */
4349 if (TREE_ADDRESSABLE (TREE_TYPE (decl
))
4350 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
4353 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
4356 /* We shouldn't be re-adding the decl with the same data
4358 gcc_assert ((n
->value
& GOVD_DATA_SHARE_CLASS
& flags
) == 0);
4359 /* The only combination of data sharing classes we should see is
4360 FIRSTPRIVATE and LASTPRIVATE. */
4361 nflags
= n
->value
| flags
;
4362 gcc_assert ((nflags
& GOVD_DATA_SHARE_CLASS
)
4363 == (GOVD_FIRSTPRIVATE
| GOVD_LASTPRIVATE
));
4368 /* When adding a variable-sized variable, we have to handle all sorts
4369 of additional bits of data: the pointer replacement variable, and
4370 the parameters of the type. */
4371 if (DECL_SIZE (decl
) && !TREE_CONSTANT (DECL_SIZE (decl
)))
4373 /* Add the pointer replacement variable as PRIVATE if the variable
4374 replacement is private, else FIRSTPRIVATE since we'll need the
4375 address of the original variable either for SHARED, or for the
4376 copy into or out of the context. */
4377 if (!(flags
& GOVD_LOCAL
))
4379 nflags
= flags
& GOVD_PRIVATE
? GOVD_PRIVATE
: GOVD_FIRSTPRIVATE
;
4380 nflags
|= flags
& GOVD_SEEN
;
4381 t
= DECL_VALUE_EXPR (decl
);
4382 gcc_assert (TREE_CODE (t
) == INDIRECT_REF
);
4383 t
= TREE_OPERAND (t
, 0);
4384 gcc_assert (DECL_P (t
));
4385 omp_add_variable (ctx
, t
, nflags
);
4388 /* Add all of the variable and type parameters (which should have
4389 been gimplified to a formal temporary) as FIRSTPRIVATE. */
4390 omp_firstprivatize_variable (ctx
, DECL_SIZE_UNIT (decl
));
4391 omp_firstprivatize_variable (ctx
, DECL_SIZE (decl
));
4392 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
4394 /* The variable-sized variable itself is never SHARED, only some form
4395 of PRIVATE. The sharing would take place via the pointer variable
4396 which we remapped above. */
4397 if (flags
& GOVD_SHARED
)
4398 flags
= GOVD_PRIVATE
| GOVD_DEBUG_PRIVATE
4399 | (flags
& (GOVD_SEEN
| GOVD_EXPLICIT
));
4401 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
4402 alloca statement we generate for the variable, so make sure it
4403 is available. This isn't automatically needed for the SHARED
4404 case, since we won't be allocating local storage then. */
4406 omp_notice_variable (ctx
, TYPE_SIZE_UNIT (TREE_TYPE (decl
)), true);
4408 else if (lang_hooks
.decls
.omp_privatize_by_reference (decl
))
4410 gcc_assert ((flags
& GOVD_LOCAL
) == 0);
4411 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
4413 /* Similar to the direct variable sized case above, we'll need the
4414 size of references being privatized. */
4415 if ((flags
& GOVD_SHARED
) == 0)
4417 t
= TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl
)));
4418 if (!TREE_CONSTANT (t
))
4419 omp_notice_variable (ctx
, t
, true);
4423 splay_tree_insert (ctx
->variables
, (splay_tree_key
)decl
, flags
);
4426 /* Record the fact that DECL was used within the OpenMP context CTX.
4427 IN_CODE is true when real code uses DECL, and false when we should
4428 merely emit default(none) errors. Return true if DECL is going to
4429 be remapped and thus DECL shouldn't be gimplified into its
4430 DECL_VALUE_EXPR (if any). */
4433 omp_notice_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, bool in_code
)
4436 unsigned flags
= in_code
? GOVD_SEEN
: 0;
4437 bool ret
= false, shared
;
4439 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
4442 /* Threadprivate variables are predetermined. */
4443 if (is_global_var (decl
))
4445 if (DECL_THREAD_LOCAL_P (decl
))
4448 if (DECL_HAS_VALUE_EXPR_P (decl
))
4450 tree value
= get_base_address (DECL_VALUE_EXPR (decl
));
4452 if (value
&& DECL_P (value
) && DECL_THREAD_LOCAL_P (value
))
4457 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
4460 enum omp_clause_default_kind default_kind
, kind
;
4462 if (!ctx
->is_parallel
)
4465 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
4466 remapped firstprivate instead of shared. To some extent this is
4467 addressed in omp_firstprivatize_type_sizes, but not effectively. */
4468 default_kind
= ctx
->default_kind
;
4469 kind
= lang_hooks
.decls
.omp_predetermined_sharing (decl
);
4470 if (kind
!= OMP_CLAUSE_DEFAULT_UNSPECIFIED
)
4471 default_kind
= kind
;
4473 switch (default_kind
)
4475 case OMP_CLAUSE_DEFAULT_NONE
:
4476 error ("%qs not specified in enclosing parallel",
4477 IDENTIFIER_POINTER (DECL_NAME (decl
)));
4478 error ("%Henclosing parallel", &ctx
->location
);
4480 case OMP_CLAUSE_DEFAULT_SHARED
:
4481 flags
|= GOVD_SHARED
;
4483 case OMP_CLAUSE_DEFAULT_PRIVATE
:
4484 flags
|= GOVD_PRIVATE
;
4490 omp_add_variable (ctx
, decl
, flags
);
4492 shared
= (flags
& GOVD_SHARED
) != 0;
4493 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
4497 shared
= ((flags
| n
->value
) & GOVD_SHARED
) != 0;
4498 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
4500 /* If nothing changed, there's nothing left to do. */
4501 if ((n
->value
& flags
) == flags
)
4507 /* If the variable is private in the current context, then we don't
4508 need to propagate anything to an outer context. */
4509 if (flags
& GOVD_PRIVATE
)
4511 if (ctx
->outer_context
4512 && omp_notice_variable (ctx
->outer_context
, decl
, in_code
))
4517 /* Verify that DECL is private within CTX. If there's specific information
4518 to the contrary in the innermost scope, generate an error. */
4521 omp_is_private (struct gimplify_omp_ctx
*ctx
, tree decl
)
4525 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
4528 if (n
->value
& GOVD_SHARED
)
4530 if (ctx
== gimplify_omp_ctxp
)
4532 error ("iteration variable %qs should be private",
4533 IDENTIFIER_POINTER (DECL_NAME (decl
)));
4534 n
->value
= GOVD_PRIVATE
;
4540 else if ((n
->value
& GOVD_EXPLICIT
) != 0
4541 && (ctx
== gimplify_omp_ctxp
4542 || (ctx
->is_combined_parallel
4543 && gimplify_omp_ctxp
->outer_context
== ctx
)))
4545 if ((n
->value
& GOVD_FIRSTPRIVATE
) != 0)
4546 error ("iteration variable %qs should not be firstprivate",
4547 IDENTIFIER_POINTER (DECL_NAME (decl
)));
4548 else if ((n
->value
& GOVD_REDUCTION
) != 0)
4549 error ("iteration variable %qs should not be reduction",
4550 IDENTIFIER_POINTER (DECL_NAME (decl
)));
4555 if (ctx
->is_parallel
)
4557 else if (ctx
->outer_context
)
4558 return omp_is_private (ctx
->outer_context
, decl
);
4560 return !is_global_var (decl
);
4563 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
4564 and previous omp contexts. */
4567 gimplify_scan_omp_clauses (tree
*list_p
, tree
*pre_p
, bool in_parallel
,
4568 bool in_combined_parallel
)
4570 struct gimplify_omp_ctx
*ctx
, *outer_ctx
;
4573 ctx
= new_omp_context (in_parallel
, in_combined_parallel
);
4574 outer_ctx
= ctx
->outer_context
;
4576 while ((c
= *list_p
) != NULL
)
4578 enum gimplify_status gs
;
4579 bool remove
= false;
4580 bool notice_outer
= true;
4584 switch (OMP_CLAUSE_CODE (c
))
4586 case OMP_CLAUSE_PRIVATE
:
4587 flags
= GOVD_PRIVATE
| GOVD_EXPLICIT
;
4588 notice_outer
= false;
4590 case OMP_CLAUSE_SHARED
:
4591 flags
= GOVD_SHARED
| GOVD_EXPLICIT
;
4593 case OMP_CLAUSE_FIRSTPRIVATE
:
4594 flags
= GOVD_FIRSTPRIVATE
| GOVD_EXPLICIT
;
4596 case OMP_CLAUSE_LASTPRIVATE
:
4597 flags
= GOVD_LASTPRIVATE
| GOVD_SEEN
| GOVD_EXPLICIT
;
4599 case OMP_CLAUSE_REDUCTION
:
4600 flags
= GOVD_REDUCTION
| GOVD_SEEN
| GOVD_EXPLICIT
;
4604 decl
= OMP_CLAUSE_DECL (c
);
4605 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
4610 /* Handle NRV results passed by reference. */
4611 if (TREE_CODE (decl
) == INDIRECT_REF
4612 && TREE_CODE (TREE_OPERAND (decl
, 0)) == RESULT_DECL
4613 && DECL_BY_REFERENCE (TREE_OPERAND (decl
, 0)))
4614 OMP_CLAUSE_DECL (c
) = decl
= TREE_OPERAND (decl
, 0);
4615 omp_add_variable (ctx
, decl
, flags
);
4616 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
4617 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
))
4619 omp_add_variable (ctx
, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
),
4620 GOVD_LOCAL
| GOVD_SEEN
);
4621 gimplify_omp_ctxp
= ctx
;
4622 push_gimplify_context ();
4623 gimplify_stmt (&OMP_CLAUSE_REDUCTION_INIT (c
));
4624 pop_gimplify_context (OMP_CLAUSE_REDUCTION_INIT (c
));
4625 push_gimplify_context ();
4626 gimplify_stmt (&OMP_CLAUSE_REDUCTION_MERGE (c
));
4627 pop_gimplify_context (OMP_CLAUSE_REDUCTION_MERGE (c
));
4628 gimplify_omp_ctxp
= outer_ctx
;
4634 case OMP_CLAUSE_COPYIN
:
4635 case OMP_CLAUSE_COPYPRIVATE
:
4636 decl
= OMP_CLAUSE_DECL (c
);
4637 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
4642 /* Handle NRV results passed by reference. */
4643 if (TREE_CODE (decl
) == INDIRECT_REF
4644 && TREE_CODE (TREE_OPERAND (decl
, 0)) == RESULT_DECL
4645 && DECL_BY_REFERENCE (TREE_OPERAND (decl
, 0)))
4646 OMP_CLAUSE_DECL (c
) = decl
= TREE_OPERAND (decl
, 0);
4649 omp_notice_variable (outer_ctx
, decl
, true);
4653 OMP_CLAUSE_OPERAND (c
, 0)
4654 = gimple_boolify (OMP_CLAUSE_OPERAND (c
, 0));
4657 case OMP_CLAUSE_SCHEDULE
:
4658 case OMP_CLAUSE_NUM_THREADS
:
4659 gs
= gimplify_expr (&OMP_CLAUSE_OPERAND (c
, 0), pre_p
, NULL
,
4660 is_gimple_val
, fb_rvalue
);
4665 case OMP_CLAUSE_NOWAIT
:
4666 case OMP_CLAUSE_ORDERED
:
4669 case OMP_CLAUSE_DEFAULT
:
4670 ctx
->default_kind
= OMP_CLAUSE_DEFAULT_KIND (c
);
4678 *list_p
= OMP_CLAUSE_CHAIN (c
);
4680 list_p
= &OMP_CLAUSE_CHAIN (c
);
4683 gimplify_omp_ctxp
= ctx
;
4686 /* For all variables that were not actually used within the context,
4687 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
4690 gimplify_adjust_omp_clauses_1 (splay_tree_node n
, void *data
)
4692 tree
*list_p
= (tree
*) data
;
4693 tree decl
= (tree
) n
->key
;
4694 unsigned flags
= n
->value
;
4695 enum omp_clause_code code
;
4699 if (flags
& (GOVD_EXPLICIT
| GOVD_LOCAL
))
4701 if ((flags
& GOVD_SEEN
) == 0)
4703 if (flags
& GOVD_DEBUG_PRIVATE
)
4705 gcc_assert ((flags
& GOVD_DATA_SHARE_CLASS
) == GOVD_PRIVATE
);
4706 private_debug
= true;
4710 = lang_hooks
.decls
.omp_private_debug_clause (decl
,
4711 !!(flags
& GOVD_SHARED
));
4713 code
= OMP_CLAUSE_PRIVATE
;
4714 else if (flags
& GOVD_SHARED
)
4716 if (is_global_var (decl
))
4718 code
= OMP_CLAUSE_SHARED
;
4720 else if (flags
& GOVD_PRIVATE
)
4721 code
= OMP_CLAUSE_PRIVATE
;
4722 else if (flags
& GOVD_FIRSTPRIVATE
)
4723 code
= OMP_CLAUSE_FIRSTPRIVATE
;
4727 clause
= build_omp_clause (code
);
4728 OMP_CLAUSE_DECL (clause
) = decl
;
4729 OMP_CLAUSE_CHAIN (clause
) = *list_p
;
4731 OMP_CLAUSE_PRIVATE_DEBUG (clause
) = 1;
4738 gimplify_adjust_omp_clauses (tree
*list_p
)
4740 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
4743 while ((c
= *list_p
) != NULL
)
4746 bool remove
= false;
4748 switch (OMP_CLAUSE_CODE (c
))
4750 case OMP_CLAUSE_PRIVATE
:
4751 case OMP_CLAUSE_SHARED
:
4752 case OMP_CLAUSE_FIRSTPRIVATE
:
4753 decl
= OMP_CLAUSE_DECL (c
);
4754 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
4755 remove
= !(n
->value
& GOVD_SEEN
);
4758 bool shared
= OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_SHARED
;
4759 if ((n
->value
& GOVD_DEBUG_PRIVATE
)
4760 || lang_hooks
.decls
.omp_private_debug_clause (decl
, shared
))
4762 gcc_assert ((n
->value
& GOVD_DEBUG_PRIVATE
) == 0
4763 || ((n
->value
& GOVD_DATA_SHARE_CLASS
)
4765 OMP_CLAUSE_SET_CODE (c
, OMP_CLAUSE_PRIVATE
);
4766 OMP_CLAUSE_PRIVATE_DEBUG (c
) = 1;
4771 case OMP_CLAUSE_LASTPRIVATE
:
4772 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
4773 accurately reflect the presence of a FIRSTPRIVATE clause. */
4774 decl
= OMP_CLAUSE_DECL (c
);
4775 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
4776 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c
)
4777 = (n
->value
& GOVD_FIRSTPRIVATE
) != 0;
4780 case OMP_CLAUSE_REDUCTION
:
4781 case OMP_CLAUSE_COPYIN
:
4782 case OMP_CLAUSE_COPYPRIVATE
:
4784 case OMP_CLAUSE_NUM_THREADS
:
4785 case OMP_CLAUSE_SCHEDULE
:
4786 case OMP_CLAUSE_NOWAIT
:
4787 case OMP_CLAUSE_ORDERED
:
4788 case OMP_CLAUSE_DEFAULT
:
4796 *list_p
= OMP_CLAUSE_CHAIN (c
);
4798 list_p
= &OMP_CLAUSE_CHAIN (c
);
4801 /* Add in any implicit data sharing. */
4802 splay_tree_foreach (ctx
->variables
, gimplify_adjust_omp_clauses_1
, list_p
);
4804 gimplify_omp_ctxp
= ctx
->outer_context
;
4805 delete_omp_context (ctx
);
4808 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
4809 gimplification of the body, as well as scanning the body for used
4810 variables. We need to do this scan now, because variable-sized
4811 decls will be decomposed during gimplification. */
4813 static enum gimplify_status
4814 gimplify_omp_parallel (tree
*expr_p
, tree
*pre_p
)
4816 tree expr
= *expr_p
;
4818 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
), pre_p
, true,
4819 OMP_PARALLEL_COMBINED (expr
));
4821 push_gimplify_context ();
4823 gimplify_stmt (&OMP_PARALLEL_BODY (expr
));
4825 if (TREE_CODE (OMP_PARALLEL_BODY (expr
)) == BIND_EXPR
)
4826 pop_gimplify_context (OMP_PARALLEL_BODY (expr
));
4828 pop_gimplify_context (NULL_TREE
);
4830 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
));
4835 /* Gimplify the gross structure of an OMP_FOR statement. */
4837 static enum gimplify_status
4838 gimplify_omp_for (tree
*expr_p
, tree
*pre_p
)
4840 tree for_stmt
, decl
, t
;
4841 enum gimplify_status ret
= 0;
4845 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
), pre_p
, false, false);
4847 t
= OMP_FOR_INIT (for_stmt
);
4848 gcc_assert (TREE_CODE (t
) == MODIFY_EXPR
);
4849 decl
= TREE_OPERAND (t
, 0);
4850 gcc_assert (DECL_P (decl
));
4851 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl
)));
4853 /* Make sure the iteration variable is private. */
4854 if (omp_is_private (gimplify_omp_ctxp
, decl
))
4855 omp_notice_variable (gimplify_omp_ctxp
, decl
, true);
4857 omp_add_variable (gimplify_omp_ctxp
, decl
, GOVD_PRIVATE
| GOVD_SEEN
);
4859 ret
|= gimplify_expr (&TREE_OPERAND (t
, 1), &OMP_FOR_PRE_BODY (for_stmt
),
4860 NULL
, is_gimple_val
, fb_rvalue
);
4862 t
= OMP_FOR_COND (for_stmt
);
4863 gcc_assert (COMPARISON_CLASS_P (t
));
4864 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
4866 ret
|= gimplify_expr (&TREE_OPERAND (t
, 1), &OMP_FOR_PRE_BODY (for_stmt
),
4867 NULL
, is_gimple_val
, fb_rvalue
);
4869 t
= OMP_FOR_INCR (for_stmt
);
4870 switch (TREE_CODE (t
))
4872 case PREINCREMENT_EXPR
:
4873 case POSTINCREMENT_EXPR
:
4874 t
= build_int_cst (TREE_TYPE (decl
), 1);
4876 case PREDECREMENT_EXPR
:
4877 case POSTDECREMENT_EXPR
:
4878 t
= build_int_cst (TREE_TYPE (decl
), -1);
4881 t
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), decl
, t
);
4882 t
= build2 (MODIFY_EXPR
, void_type_node
, decl
, t
);
4883 OMP_FOR_INCR (for_stmt
) = t
;
4887 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
4888 t
= TREE_OPERAND (t
, 1);
4889 switch (TREE_CODE (t
))
4892 if (TREE_OPERAND (t
, 1) == decl
)
4894 TREE_OPERAND (t
, 1) = TREE_OPERAND (t
, 0);
4895 TREE_OPERAND (t
, 0) = decl
;
4899 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
4905 ret
|= gimplify_expr (&TREE_OPERAND (t
, 1), &OMP_FOR_PRE_BODY (for_stmt
),
4906 NULL
, is_gimple_val
, fb_rvalue
);
4913 gimplify_to_stmt_list (&OMP_FOR_BODY (for_stmt
));
4914 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
));
4916 return ret
== GS_ALL_DONE
? GS_ALL_DONE
: GS_ERROR
;
4919 /* Gimplify the gross structure of other OpenMP worksharing constructs.
4920 In particular, OMP_SECTIONS and OMP_SINGLE. */
4922 static enum gimplify_status
4923 gimplify_omp_workshare (tree
*expr_p
, tree
*pre_p
)
4925 tree stmt
= *expr_p
;
4927 gimplify_scan_omp_clauses (&OMP_CLAUSES (stmt
), pre_p
, false, false);
4928 gimplify_to_stmt_list (&OMP_BODY (stmt
));
4929 gimplify_adjust_omp_clauses (&OMP_CLAUSES (stmt
));
4934 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
4935 stabilized the lhs of the atomic operation as *ADDR. Return true if
4936 EXPR is this stabilized form. */
4939 goa_lhs_expr_p (tree expr
, tree addr
)
4941 /* Also include casts to other type variants. The C front end is fond
4942 of adding these for e.g. volatile variables. This is like
4943 STRIP_TYPE_NOPS but includes the main variant lookup. */
4944 while ((TREE_CODE (expr
) == NOP_EXPR
4945 || TREE_CODE (expr
) == CONVERT_EXPR
4946 || TREE_CODE (expr
) == NON_LVALUE_EXPR
)
4947 && TREE_OPERAND (expr
, 0) != error_mark_node
4948 && (TYPE_MAIN_VARIANT (TREE_TYPE (expr
))
4949 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (expr
, 0)))))
4950 expr
= TREE_OPERAND (expr
, 0);
4952 if (TREE_CODE (expr
) == INDIRECT_REF
&& TREE_OPERAND (expr
, 0) == addr
)
4954 if (TREE_CODE (addr
) == ADDR_EXPR
&& expr
== TREE_OPERAND (addr
, 0))
4959 /* A subroutine of gimplify_omp_atomic. Attempt to implement the atomic
4960 operation as a __sync_fetch_and_op builtin. INDEX is log2 of the
4961 size of the data type, and thus usable to find the index of the builtin
4962 decl. Returns GS_UNHANDLED if the expression is not of the proper form. */
4964 static enum gimplify_status
4965 gimplify_omp_atomic_fetch_op (tree
*expr_p
, tree addr
, tree rhs
, int index
)
4967 enum built_in_function base
;
4968 tree decl
, args
, itype
;
4969 enum insn_code
*optab
;
4971 /* Check for one of the supported fetch-op operations. */
4972 switch (TREE_CODE (rhs
))
4975 base
= BUILT_IN_FETCH_AND_ADD_N
;
4976 optab
= sync_add_optab
;
4979 base
= BUILT_IN_FETCH_AND_SUB_N
;
4980 optab
= sync_add_optab
;
4983 base
= BUILT_IN_FETCH_AND_AND_N
;
4984 optab
= sync_and_optab
;
4987 base
= BUILT_IN_FETCH_AND_OR_N
;
4988 optab
= sync_ior_optab
;
4991 base
= BUILT_IN_FETCH_AND_XOR_N
;
4992 optab
= sync_xor_optab
;
4995 return GS_UNHANDLED
;
4998 /* Make sure the expression is of the proper form. */
4999 if (goa_lhs_expr_p (TREE_OPERAND (rhs
, 0), addr
))
5000 rhs
= TREE_OPERAND (rhs
, 1);
5001 else if (commutative_tree_code (TREE_CODE (rhs
))
5002 && goa_lhs_expr_p (TREE_OPERAND (rhs
, 1), addr
))
5003 rhs
= TREE_OPERAND (rhs
, 0);
5005 return GS_UNHANDLED
;
5007 decl
= built_in_decls
[base
+ index
+ 1];
5008 itype
= TREE_TYPE (TREE_TYPE (decl
));
5010 if (optab
[TYPE_MODE (itype
)] == CODE_FOR_nothing
)
5011 return GS_UNHANDLED
;
5013 args
= tree_cons (NULL
, fold_convert (itype
, rhs
), NULL
);
5014 args
= tree_cons (NULL
, addr
, args
);
5015 *expr_p
= build_function_call_expr (decl
, args
);
5019 /* A subroutine of gimplify_omp_atomic_pipeline. Walk *EXPR_P and replace
5020 appearances of *LHS_ADDR with LHS_VAR. If an expression does not involve
5021 the lhs, evaluate it into a temporary. Return 1 if the lhs appeared as
5022 a subexpression, 0 if it did not, or -1 if an error was encountered. */
5025 goa_stabilize_expr (tree
*expr_p
, tree
*pre_p
, tree lhs_addr
, tree lhs_var
)
5027 tree expr
= *expr_p
;
5030 if (goa_lhs_expr_p (expr
, lhs_addr
))
5035 if (is_gimple_val (expr
))
5039 switch (TREE_CODE_CLASS (TREE_CODE (expr
)))
5042 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 1), pre_p
,
5045 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 0), pre_p
,
5054 enum gimplify_status gs
;
5055 gs
= gimplify_expr (expr_p
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
);
5056 if (gs
!= GS_ALL_DONE
)
5063 /* A subroutine of gimplify_omp_atomic. Implement the atomic operation as:
5067 newval = rhs; // with oldval replacing *addr in rhs
5068 oldval = __sync_val_compare_and_swap (addr, oldval, newval);
5069 if (oldval != newval)
5072 INDEX is log2 of the size of the data type, and thus usable to find the
5073 index of the builtin decl. */
5075 static enum gimplify_status
5076 gimplify_omp_atomic_pipeline (tree
*expr_p
, tree
*pre_p
, tree addr
,
5077 tree rhs
, int index
)
5079 tree oldval
, oldival
, oldival2
, newval
, newival
, label
;
5080 tree type
, itype
, cmpxchg
, args
, x
, iaddr
;
5082 cmpxchg
= built_in_decls
[BUILT_IN_VAL_COMPARE_AND_SWAP_N
+ index
+ 1];
5083 type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr
)));
5084 itype
= TREE_TYPE (TREE_TYPE (cmpxchg
));
5086 if (sync_compare_and_swap
[TYPE_MODE (itype
)] == CODE_FOR_nothing
)
5087 return GS_UNHANDLED
;
5089 oldval
= create_tmp_var (type
, NULL
);
5090 newval
= create_tmp_var (type
, NULL
);
5092 /* Precompute as much of RHS as possible. In the same walk, replace
5093 occurrences of the lhs value with our temporary. */
5094 if (goa_stabilize_expr (&rhs
, pre_p
, addr
, oldval
) < 0)
5097 x
= build_fold_indirect_ref (addr
);
5098 x
= build2 (MODIFY_EXPR
, void_type_node
, oldval
, x
);
5099 gimplify_and_add (x
, pre_p
);
5101 /* For floating-point values, we'll need to view-convert them to integers
5102 so that we can perform the atomic compare and swap. Simplify the
5103 following code by always setting up the "i"ntegral variables. */
5104 if (INTEGRAL_TYPE_P (type
) || POINTER_TYPE_P (type
))
5112 oldival
= create_tmp_var (itype
, NULL
);
5113 newival
= create_tmp_var (itype
, NULL
);
5115 x
= build1 (VIEW_CONVERT_EXPR
, itype
, oldval
);
5116 x
= build2 (MODIFY_EXPR
, void_type_node
, oldival
, x
);
5117 gimplify_and_add (x
, pre_p
);
5118 iaddr
= fold_convert (build_pointer_type (itype
), addr
);
5121 oldival2
= create_tmp_var (itype
, NULL
);
5123 label
= create_artificial_label ();
5124 x
= build1 (LABEL_EXPR
, void_type_node
, label
);
5125 gimplify_and_add (x
, pre_p
);
5127 x
= build2 (MODIFY_EXPR
, void_type_node
, newval
, rhs
);
5128 gimplify_and_add (x
, pre_p
);
5130 if (newval
!= newival
)
5132 x
= build1 (VIEW_CONVERT_EXPR
, itype
, newval
);
5133 x
= build2 (MODIFY_EXPR
, void_type_node
, newival
, x
);
5134 gimplify_and_add (x
, pre_p
);
5137 x
= build2 (MODIFY_EXPR
, void_type_node
, oldival2
,
5138 fold_convert (itype
, oldival
));
5139 gimplify_and_add (x
, pre_p
);
5141 args
= tree_cons (NULL
, fold_convert (itype
, newival
), NULL
);
5142 args
= tree_cons (NULL
, fold_convert (itype
, oldival
), args
);
5143 args
= tree_cons (NULL
, iaddr
, args
);
5144 x
= build_function_call_expr (cmpxchg
, args
);
5145 if (oldval
== oldival
)
5146 x
= fold_convert (type
, x
);
5147 x
= build2 (MODIFY_EXPR
, void_type_node
, oldival
, x
);
5148 gimplify_and_add (x
, pre_p
);
5150 /* For floating point, be prepared for the loop backedge. */
5151 if (oldval
!= oldival
)
5153 x
= build1 (VIEW_CONVERT_EXPR
, type
, oldival
);
5154 x
= build2 (MODIFY_EXPR
, void_type_node
, oldval
, x
);
5155 gimplify_and_add (x
, pre_p
);
5158 /* Note that we always perform the comparison as an integer, even for
5159 floating point. This allows the atomic operation to properly
5160 succeed even with NaNs and -0.0. */
5161 x
= build3 (COND_EXPR
, void_type_node
,
5162 build2 (NE_EXPR
, boolean_type_node
, oldival
, oldival2
),
5163 build1 (GOTO_EXPR
, void_type_node
, label
), NULL
);
5164 gimplify_and_add (x
, pre_p
);
5170 /* A subroutine of gimplify_omp_atomic. Implement the atomic operation as:
5172 GOMP_atomic_start ();
5176 The result is not globally atomic, but works so long as all parallel
5177 references are within #pragma omp atomic directives. According to
5178 responses received from omp@openmp.org, appears to be within spec.
5179 Which makes sense, since that's how several other compilers handle
5180 this situation as well. */
5182 static enum gimplify_status
5183 gimplify_omp_atomic_mutex (tree
*expr_p
, tree
*pre_p
, tree addr
, tree rhs
)
5187 t
= built_in_decls
[BUILT_IN_GOMP_ATOMIC_START
];
5188 t
= build_function_call_expr (t
, NULL
);
5189 gimplify_and_add (t
, pre_p
);
5191 t
= build_fold_indirect_ref (addr
);
5192 t
= build2 (MODIFY_EXPR
, void_type_node
, t
, rhs
);
5193 gimplify_and_add (t
, pre_p
);
5195 t
= built_in_decls
[BUILT_IN_GOMP_ATOMIC_END
];
5196 t
= build_function_call_expr (t
, NULL
);
5197 gimplify_and_add (t
, pre_p
);
5203 /* Gimplify an OMP_ATOMIC statement. */
5205 static enum gimplify_status
5206 gimplify_omp_atomic (tree
*expr_p
, tree
*pre_p
)
5208 tree addr
= TREE_OPERAND (*expr_p
, 0);
5209 tree rhs
= TREE_OPERAND (*expr_p
, 1);
5210 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr
)));
5211 HOST_WIDE_INT index
;
5213 /* Make sure the type is one of the supported sizes. */
5214 index
= tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
5215 index
= exact_log2 (index
);
5216 if (index
>= 0 && index
<= 4)
5218 enum gimplify_status gs
;
5221 if (DECL_P (TREE_OPERAND (addr
, 0)))
5222 align
= DECL_ALIGN_UNIT (TREE_OPERAND (addr
, 0));
5223 else if (TREE_CODE (TREE_OPERAND (addr
, 0)) == COMPONENT_REF
5224 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (addr
, 0), 1))
5226 align
= DECL_ALIGN_UNIT (TREE_OPERAND (TREE_OPERAND (addr
, 0), 1));
5228 align
= TYPE_ALIGN_UNIT (type
);
5230 /* __sync builtins require strict data alignment. */
5231 if (exact_log2 (align
) >= index
)
5233 /* When possible, use specialized atomic update functions. */
5234 if (INTEGRAL_TYPE_P (type
) || POINTER_TYPE_P (type
))
5236 gs
= gimplify_omp_atomic_fetch_op (expr_p
, addr
, rhs
, index
);
5237 if (gs
!= GS_UNHANDLED
)
5241 /* If we don't have specialized __sync builtins, try and implement
5242 as a compare and swap loop. */
5243 gs
= gimplify_omp_atomic_pipeline (expr_p
, pre_p
, addr
, rhs
, index
);
5244 if (gs
!= GS_UNHANDLED
)
5249 /* The ultimate fallback is wrapping the operation in a mutex. */
5250 return gimplify_omp_atomic_mutex (expr_p
, pre_p
, addr
, rhs
);
5253 /* Gimplifies the expression tree pointed to by EXPR_P. Return 0 if
5254 gimplification failed.
5256 PRE_P points to the list where side effects that must happen before
5257 EXPR should be stored.
5259 POST_P points to the list where side effects that must happen after
5260 EXPR should be stored, or NULL if there is no suitable list. In
5261 that case, we copy the result to a temporary, emit the
5262 post-effects, and then return the temporary.
5264 GIMPLE_TEST_F points to a function that takes a tree T and
5265 returns nonzero if T is in the GIMPLE form requested by the
5266 caller. The GIMPLE predicates are in tree-gimple.c.
5268 This test is used twice. Before gimplification, the test is
5269 invoked to determine whether *EXPR_P is already gimple enough. If
5270 that fails, *EXPR_P is gimplified according to its code and
5271 GIMPLE_TEST_F is called again. If the test still fails, then a new
5272 temporary variable is created and assigned the value of the
5273 gimplified expression.
5275 FALLBACK tells the function what sort of a temporary we want. If the 1
5276 bit is set, an rvalue is OK. If the 2 bit is set, an lvalue is OK.
5277 If both are set, either is OK, but an lvalue is preferable.
5279 The return value is either GS_ERROR or GS_ALL_DONE, since this function
5280 iterates until solution. */
5282 enum gimplify_status
5283 gimplify_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
,
5284 bool (* gimple_test_f
) (tree
), fallback_t fallback
)
5287 tree internal_pre
= NULL_TREE
;
5288 tree internal_post
= NULL_TREE
;
5290 int is_statement
= (pre_p
== NULL
);
5291 location_t saved_location
;
5292 enum gimplify_status ret
;
5294 save_expr
= *expr_p
;
5295 if (save_expr
== NULL_TREE
)
5298 /* We used to check the predicate here and return immediately if it
5299 succeeds. This is wrong; the design is for gimplification to be
5300 idempotent, and for the predicates to only test for valid forms, not
5301 whether they are fully simplified. */
5303 /* Set up our internal queues if needed. */
5305 pre_p
= &internal_pre
;
5307 post_p
= &internal_post
;
5309 saved_location
= input_location
;
5310 if (save_expr
!= error_mark_node
5311 && EXPR_HAS_LOCATION (*expr_p
))
5312 input_location
= EXPR_LOCATION (*expr_p
);
5314 /* Loop over the specific gimplifiers until the toplevel node
5315 remains the same. */
5318 /* Strip away as many useless type conversions as possible
5320 STRIP_USELESS_TYPE_CONVERSION (*expr_p
);
5322 /* Remember the expr. */
5323 save_expr
= *expr_p
;
5325 /* Die, die, die, my darling. */
5326 if (save_expr
== error_mark_node
5327 || (TREE_TYPE (save_expr
)
5328 && TREE_TYPE (save_expr
) == error_mark_node
))
5334 /* Do any language-specific gimplification. */
5335 ret
= lang_hooks
.gimplify_expr (expr_p
, pre_p
, post_p
);
5338 if (*expr_p
== NULL_TREE
)
5340 if (*expr_p
!= save_expr
)
5343 else if (ret
!= GS_UNHANDLED
)
5347 switch (TREE_CODE (*expr_p
))
5349 /* First deal with the special cases. */
5351 case POSTINCREMENT_EXPR
:
5352 case POSTDECREMENT_EXPR
:
5353 case PREINCREMENT_EXPR
:
5354 case PREDECREMENT_EXPR
:
5355 ret
= gimplify_self_mod_expr (expr_p
, pre_p
, post_p
,
5356 fallback
!= fb_none
);
5360 case ARRAY_RANGE_REF
:
5364 case VIEW_CONVERT_EXPR
:
5365 ret
= gimplify_compound_lval (expr_p
, pre_p
, post_p
,
5366 fallback
? fallback
: fb_rvalue
);
5370 ret
= gimplify_cond_expr (expr_p
, pre_p
, fallback
);
5371 /* C99 code may assign to an array in a structure value of a
5372 conditional expression, and this has undefined behavior
5373 only on execution, so create a temporary if an lvalue is
5375 if (fallback
== fb_lvalue
)
5377 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
5378 lang_hooks
.mark_addressable (*expr_p
);
5383 ret
= gimplify_call_expr (expr_p
, pre_p
, fallback
!= fb_none
);
5384 /* C99 code may assign to an array in a structure returned
5385 from a function, and this has undefined behavior only on
5386 execution, so create a temporary if an lvalue is
5388 if (fallback
== fb_lvalue
)
5390 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
5391 lang_hooks
.mark_addressable (*expr_p
);
5399 ret
= gimplify_compound_expr (expr_p
, pre_p
, fallback
!= fb_none
);
5404 ret
= gimplify_modify_expr (expr_p
, pre_p
, post_p
,
5405 fallback
!= fb_none
);
5407 /* The distinction between MODIFY_EXPR and INIT_EXPR is no longer
5409 if (*expr_p
&& TREE_CODE (*expr_p
) == INIT_EXPR
)
5410 TREE_SET_CODE (*expr_p
, MODIFY_EXPR
);
5413 case TRUTH_ANDIF_EXPR
:
5414 case TRUTH_ORIF_EXPR
:
5415 ret
= gimplify_boolean_expr (expr_p
);
5418 case TRUTH_NOT_EXPR
:
5419 TREE_OPERAND (*expr_p
, 0)
5420 = gimple_boolify (TREE_OPERAND (*expr_p
, 0));
5421 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5422 is_gimple_val
, fb_rvalue
);
5423 recalculate_side_effects (*expr_p
);
5427 ret
= gimplify_addr_expr (expr_p
, pre_p
, post_p
);
5431 ret
= gimplify_va_arg_expr (expr_p
, pre_p
, post_p
);
5436 if (IS_EMPTY_STMT (*expr_p
))
5442 if (VOID_TYPE_P (TREE_TYPE (*expr_p
))
5443 || fallback
== fb_none
)
5445 /* Just strip a conversion to void (or in void context) and
5447 *expr_p
= TREE_OPERAND (*expr_p
, 0);
5451 ret
= gimplify_conversion (expr_p
);
5452 if (ret
== GS_ERROR
)
5454 if (*expr_p
!= save_expr
)
5458 case FIX_TRUNC_EXPR
:
5460 case FIX_FLOOR_EXPR
:
5461 case FIX_ROUND_EXPR
:
5462 /* unary_expr: ... | '(' cast ')' val | ... */
5463 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5464 is_gimple_val
, fb_rvalue
);
5465 recalculate_side_effects (*expr_p
);
5469 *expr_p
= fold_indirect_ref (*expr_p
);
5470 if (*expr_p
!= save_expr
)
5472 /* else fall through. */
5473 case ALIGN_INDIRECT_REF
:
5474 case MISALIGNED_INDIRECT_REF
:
5475 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5476 is_gimple_reg
, fb_rvalue
);
5477 recalculate_side_effects (*expr_p
);
5480 /* Constants need not be gimplified. */
5490 /* If we require an lvalue, such as for ADDR_EXPR, retain the
5491 CONST_DECL node. Otherwise the decl is replaceable by its
5493 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
5494 if (fallback
& fb_lvalue
)
5497 *expr_p
= DECL_INITIAL (*expr_p
);
5501 ret
= gimplify_decl_expr (expr_p
);
5505 /* FIXME make this a decl. */
5510 ret
= gimplify_bind_expr (expr_p
, NULL
, pre_p
);
5514 ret
= gimplify_loop_expr (expr_p
, pre_p
);
5518 ret
= gimplify_switch_expr (expr_p
, pre_p
);
5522 ret
= gimplify_exit_expr (expr_p
);
5526 /* If the target is not LABEL, then it is a computed jump
5527 and the target needs to be gimplified. */
5528 if (TREE_CODE (GOTO_DESTINATION (*expr_p
)) != LABEL_DECL
)
5529 ret
= gimplify_expr (&GOTO_DESTINATION (*expr_p
), pre_p
,
5530 NULL
, is_gimple_val
, fb_rvalue
);
5535 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p
))
5536 == current_function_decl
);
5539 case CASE_LABEL_EXPR
:
5540 ret
= gimplify_case_label_expr (expr_p
);
5544 ret
= gimplify_return_expr (*expr_p
, pre_p
);
5548 /* Don't reduce this in place; let gimplify_init_constructor work its
5549 magic. Buf if we're just elaborating this for side effects, just
5550 gimplify any element that has side-effects. */
5551 if (fallback
== fb_none
)
5553 unsigned HOST_WIDE_INT ix
;
5554 constructor_elt
*ce
;
5555 tree temp
= NULL_TREE
;
5557 VEC_iterate (constructor_elt
, CONSTRUCTOR_ELTS (*expr_p
),
5560 if (TREE_SIDE_EFFECTS (ce
->value
))
5561 append_to_statement_list (ce
->value
, &temp
);
5566 /* C99 code may assign to an array in a constructed
5567 structure or union, and this has undefined behavior only
5568 on execution, so create a temporary if an lvalue is
5570 else if (fallback
== fb_lvalue
)
5572 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
5573 lang_hooks
.mark_addressable (*expr_p
);
5579 /* The following are special cases that are not handled by the
5580 original GIMPLE grammar. */
5582 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
5585 ret
= gimplify_save_expr (expr_p
, pre_p
, post_p
);
5590 enum gimplify_status r0
, r1
, r2
;
5592 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5593 is_gimple_lvalue
, fb_either
);
5594 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
5595 is_gimple_val
, fb_rvalue
);
5596 r2
= gimplify_expr (&TREE_OPERAND (*expr_p
, 2), pre_p
, post_p
,
5597 is_gimple_val
, fb_rvalue
);
5598 recalculate_side_effects (*expr_p
);
5600 ret
= MIN (r0
, MIN (r1
, r2
));
5604 case NON_LVALUE_EXPR
:
5605 /* This should have been stripped above. */
5609 ret
= gimplify_asm_expr (expr_p
, pre_p
, post_p
);
5612 case TRY_FINALLY_EXPR
:
5613 case TRY_CATCH_EXPR
:
5614 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p
, 0));
5615 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p
, 1));
5619 case CLEANUP_POINT_EXPR
:
5620 ret
= gimplify_cleanup_point_expr (expr_p
, pre_p
);
5624 ret
= gimplify_target_expr (expr_p
, pre_p
, post_p
);
5628 gimplify_to_stmt_list (&CATCH_BODY (*expr_p
));
5632 case EH_FILTER_EXPR
:
5633 gimplify_to_stmt_list (&EH_FILTER_FAILURE (*expr_p
));
5639 enum gimplify_status r0
, r1
;
5640 r0
= gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p
), pre_p
, post_p
,
5641 is_gimple_val
, fb_rvalue
);
5642 r1
= gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p
), pre_p
, post_p
,
5643 is_gimple_val
, fb_rvalue
);
5649 /* We get here when taking the address of a label. We mark
5650 the label as "forced"; meaning it can never be removed and
5651 it is a potential target for any computed goto. */
5652 FORCED_LABEL (*expr_p
) = 1;
5656 case STATEMENT_LIST
:
5657 ret
= gimplify_statement_list (expr_p
);
5660 case WITH_SIZE_EXPR
:
5662 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
5663 post_p
== &internal_post
? NULL
: post_p
,
5664 gimple_test_f
, fallback
);
5665 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
5666 is_gimple_val
, fb_rvalue
);
5672 ret
= gimplify_var_or_parm_decl (expr_p
);
5676 /* When within an OpenMP context, notice uses of variables. */
5677 if (gimplify_omp_ctxp
)
5678 omp_notice_variable (gimplify_omp_ctxp
, *expr_p
, true);
5683 /* Allow callbacks into the gimplifier during optimization. */
5688 ret
= gimplify_omp_parallel (expr_p
, pre_p
);
5692 ret
= gimplify_omp_for (expr_p
, pre_p
);
5697 ret
= gimplify_omp_workshare (expr_p
, pre_p
);
5704 gimplify_to_stmt_list (&OMP_BODY (*expr_p
));
5708 ret
= gimplify_omp_atomic (expr_p
, pre_p
);
5717 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p
)))
5719 case tcc_comparison
:
5720 /* Handle comparison of objects of non scalar mode aggregates
5721 with a call to memcmp. It would be nice to only have to do
5722 this for variable-sized objects, but then we'd have to allow
5723 the same nest of reference nodes we allow for MODIFY_EXPR and
5726 Compare scalar mode aggregates as scalar mode values. Using
5727 memcmp for them would be very inefficient at best, and is
5728 plain wrong if bitfields are involved. */
5731 tree type
= TREE_TYPE (TREE_OPERAND (*expr_p
, 1));
5733 if (!AGGREGATE_TYPE_P (type
))
5735 else if (TYPE_MODE (type
) != BLKmode
)
5736 ret
= gimplify_scalar_mode_aggregate_compare (expr_p
);
5738 ret
= gimplify_variable_sized_compare (expr_p
);
5743 /* If *EXPR_P does not need to be special-cased, handle it
5744 according to its class. */
5746 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
5747 post_p
, is_gimple_val
, fb_rvalue
);
5753 enum gimplify_status r0
, r1
;
5755 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
5756 post_p
, is_gimple_val
, fb_rvalue
);
5757 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
,
5758 post_p
, is_gimple_val
, fb_rvalue
);
5764 case tcc_declaration
:
5767 goto dont_recalculate
;
5770 gcc_assert (TREE_CODE (*expr_p
) == TRUTH_AND_EXPR
5771 || TREE_CODE (*expr_p
) == TRUTH_OR_EXPR
5772 || TREE_CODE (*expr_p
) == TRUTH_XOR_EXPR
);
5776 recalculate_side_effects (*expr_p
);
5781 /* If we replaced *expr_p, gimplify again. */
5782 if (ret
== GS_OK
&& (*expr_p
== NULL
|| *expr_p
== save_expr
))
5785 while (ret
== GS_OK
);
5787 /* If we encountered an error_mark somewhere nested inside, either
5788 stub out the statement or propagate the error back out. */
5789 if (ret
== GS_ERROR
)
5796 /* This was only valid as a return value from the langhook, which
5797 we handled. Make sure it doesn't escape from any other context. */
5798 gcc_assert (ret
!= GS_UNHANDLED
);
5800 if (fallback
== fb_none
&& *expr_p
&& !is_gimple_stmt (*expr_p
))
5802 /* We aren't looking for a value, and we don't have a valid
5803 statement. If it doesn't have side-effects, throw it away. */
5804 if (!TREE_SIDE_EFFECTS (*expr_p
))
5806 else if (!TREE_THIS_VOLATILE (*expr_p
))
5808 /* This is probably a _REF that contains something nested that
5809 has side effects. Recurse through the operands to find it. */
5810 enum tree_code code
= TREE_CODE (*expr_p
);
5817 case VIEW_CONVERT_EXPR
:
5818 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5819 gimple_test_f
, fallback
);
5822 case ARRAY_REF
: case ARRAY_RANGE_REF
:
5823 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5824 gimple_test_f
, fallback
);
5825 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
5826 gimple_test_f
, fallback
);
5830 /* Anything else with side-effects must be converted to
5831 a valid statement before we get here. */
5837 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p
)))
5839 /* Historically, the compiler has treated a bare
5840 reference to a volatile lvalue as forcing a load. */
5841 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p
));
5842 /* Normally, we do not want to create a temporary for a
5843 TREE_ADDRESSABLE type because such a type should not be
5844 copied by bitwise-assignment. However, we make an
5845 exception here, as all we are doing here is ensuring that
5846 we read the bytes that make up the type. We use
5847 create_tmp_var_raw because create_tmp_var will abort when
5848 given a TREE_ADDRESSABLE type. */
5849 tree tmp
= create_tmp_var_raw (type
, "vol");
5850 gimple_add_tmp_var (tmp
);
5851 *expr_p
= build2 (MODIFY_EXPR
, type
, tmp
, *expr_p
);
5854 /* We can't do anything useful with a volatile reference to
5855 incomplete type, so just throw it away. */
5859 /* If we are gimplifying at the statement level, we're done. Tack
5860 everything together and replace the original statement with the
5862 if (fallback
== fb_none
|| is_statement
)
5864 if (internal_pre
|| internal_post
)
5866 append_to_statement_list (*expr_p
, &internal_pre
);
5867 append_to_statement_list (internal_post
, &internal_pre
);
5868 annotate_all_with_locus (&internal_pre
, input_location
);
5869 *expr_p
= internal_pre
;
5873 else if (TREE_CODE (*expr_p
) == STATEMENT_LIST
)
5874 annotate_all_with_locus (expr_p
, input_location
);
5876 annotate_one_with_locus (*expr_p
, input_location
);
5880 /* Otherwise we're gimplifying a subexpression, so the resulting value is
5883 /* If it's sufficiently simple already, we're done. Unless we are
5884 handling some post-effects internally; if that's the case, we need to
5885 copy into a temp before adding the post-effects to the tree. */
5886 if (!internal_post
&& (*gimple_test_f
) (*expr_p
))
5889 /* Otherwise, we need to create a new temporary for the gimplified
5892 /* We can't return an lvalue if we have an internal postqueue. The
5893 object the lvalue refers to would (probably) be modified by the
5894 postqueue; we need to copy the value out first, which means an
5896 if ((fallback
& fb_lvalue
) && !internal_post
5897 && is_gimple_addressable (*expr_p
))
5899 /* An lvalue will do. Take the address of the expression, store it
5900 in a temporary, and replace the expression with an INDIRECT_REF of
5902 tmp
= build_fold_addr_expr (*expr_p
);
5903 gimplify_expr (&tmp
, pre_p
, post_p
, is_gimple_reg
, fb_rvalue
);
5904 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (tmp
)), tmp
);
5906 else if ((fallback
& fb_rvalue
) && is_gimple_formal_tmp_rhs (*expr_p
))
5908 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p
)));
5910 /* An rvalue will do. Assign the gimplified expression into a new
5911 temporary TMP and replace the original expression with TMP. */
5913 if (internal_post
|| (fallback
& fb_lvalue
))
5914 /* The postqueue might change the value of the expression between
5915 the initialization and use of the temporary, so we can't use a
5916 formal temp. FIXME do we care? */
5917 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
5919 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
5921 if (TREE_CODE (*expr_p
) != SSA_NAME
)
5922 DECL_GIMPLE_FORMAL_TEMP_P (*expr_p
) = 1;
5926 #ifdef ENABLE_CHECKING
5927 if (!(fallback
& fb_mayfail
))
5929 fprintf (stderr
, "gimplification failed:\n");
5930 print_generic_expr (stderr
, *expr_p
, 0);
5931 debug_tree (*expr_p
);
5932 internal_error ("gimplification failed");
5935 gcc_assert (fallback
& fb_mayfail
);
5936 /* If this is an asm statement, and the user asked for the
5937 impossible, don't die. Fail and let gimplify_asm_expr
5943 /* Make sure the temporary matches our predicate. */
5944 gcc_assert ((*gimple_test_f
) (*expr_p
));
5948 annotate_all_with_locus (&internal_post
, input_location
);
5949 append_to_statement_list (internal_post
, pre_p
);
5953 input_location
= saved_location
;
5957 /* Look through TYPE for variable-sized objects and gimplify each such
5958 size that we find. Add to LIST_P any statements generated. */
5961 gimplify_type_sizes (tree type
, tree
*list_p
)
5965 if (type
== NULL
|| type
== error_mark_node
)
5968 /* We first do the main variant, then copy into any other variants. */
5969 type
= TYPE_MAIN_VARIANT (type
);
5971 /* Avoid infinite recursion. */
5972 if (TYPE_SIZES_GIMPLIFIED (type
))
5975 TYPE_SIZES_GIMPLIFIED (type
) = 1;
5977 switch (TREE_CODE (type
))
5983 gimplify_one_sizepos (&TYPE_MIN_VALUE (type
), list_p
);
5984 gimplify_one_sizepos (&TYPE_MAX_VALUE (type
), list_p
);
5986 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5988 TYPE_MIN_VALUE (t
) = TYPE_MIN_VALUE (type
);
5989 TYPE_MAX_VALUE (t
) = TYPE_MAX_VALUE (type
);
5994 /* These types may not have declarations, so handle them here. */
5995 gimplify_type_sizes (TREE_TYPE (type
), list_p
);
5996 gimplify_type_sizes (TYPE_DOMAIN (type
), list_p
);
6001 case QUAL_UNION_TYPE
:
6002 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
6003 if (TREE_CODE (field
) == FIELD_DECL
)
6005 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field
), list_p
);
6006 gimplify_type_sizes (TREE_TYPE (field
), list_p
);
6011 case REFERENCE_TYPE
:
6012 gimplify_type_sizes (TREE_TYPE (type
), list_p
);
6019 gimplify_one_sizepos (&TYPE_SIZE (type
), list_p
);
6020 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type
), list_p
);
6022 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6024 TYPE_SIZE (t
) = TYPE_SIZE (type
);
6025 TYPE_SIZE_UNIT (t
) = TYPE_SIZE_UNIT (type
);
6026 TYPE_SIZES_GIMPLIFIED (t
) = 1;
6030 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
6031 a size or position, has had all of its SAVE_EXPRs evaluated.
6032 We add any required statements to STMT_P. */
6035 gimplify_one_sizepos (tree
*expr_p
, tree
*stmt_p
)
6037 tree type
, expr
= *expr_p
;
6039 /* We don't do anything if the value isn't there, is constant, or contains
6040 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
6041 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
6042 will want to replace it with a new variable, but that will cause problems
6043 if this type is from outside the function. It's OK to have that here. */
6044 if (expr
== NULL_TREE
|| TREE_CONSTANT (expr
)
6045 || TREE_CODE (expr
) == VAR_DECL
6046 || CONTAINS_PLACEHOLDER_P (expr
))
6049 type
= TREE_TYPE (expr
);
6050 *expr_p
= unshare_expr (expr
);
6052 gimplify_expr (expr_p
, stmt_p
, NULL
, is_gimple_val
, fb_rvalue
);
6055 /* Verify that we've an exact type match with the original expression.
6056 In particular, we do not wish to drop a "sizetype" in favour of a
6057 type of similar dimensions. We don't want to pollute the generic
6058 type-stripping code with this knowledge because it doesn't matter
6059 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
6060 and friends retain their "sizetype-ness". */
6061 if (TREE_TYPE (expr
) != type
6062 && TREE_CODE (type
) == INTEGER_TYPE
6063 && TYPE_IS_SIZETYPE (type
))
6067 *expr_p
= create_tmp_var (type
, NULL
);
6068 tmp
= build1 (NOP_EXPR
, type
, expr
);
6069 tmp
= build2 (MODIFY_EXPR
, type
, *expr_p
, tmp
);
6070 if (EXPR_HAS_LOCATION (expr
))
6071 SET_EXPR_LOCUS (tmp
, EXPR_LOCUS (expr
));
6073 SET_EXPR_LOCATION (tmp
, input_location
);
6075 gimplify_and_add (tmp
, stmt_p
);
6079 #ifdef ENABLE_CHECKING
6080 /* Compare types A and B for a "close enough" match. */
6083 cpt_same_type (tree a
, tree b
)
6085 if (lang_hooks
.types_compatible_p (a
, b
))
6088 /* ??? The C++ FE decomposes METHOD_TYPES to FUNCTION_TYPES and doesn't
6089 link them together. This routine is intended to catch type errors
6090 that will affect the optimizers, and the optimizers don't add new
6091 dereferences of function pointers, so ignore it. */
6092 if ((TREE_CODE (a
) == FUNCTION_TYPE
|| TREE_CODE (a
) == METHOD_TYPE
)
6093 && (TREE_CODE (b
) == FUNCTION_TYPE
|| TREE_CODE (b
) == METHOD_TYPE
))
6096 /* ??? The C FE pushes type qualifiers after the fact into the type of
6097 the element from the type of the array. See build_unary_op's handling
6098 of ADDR_EXPR. This seems wrong -- if we were going to do this, we
6099 should have done it when creating the variable in the first place.
6100 Alternately, why aren't the two array types made variants? */
6101 if (TREE_CODE (a
) == ARRAY_TYPE
&& TREE_CODE (b
) == ARRAY_TYPE
)
6102 return cpt_same_type (TREE_TYPE (a
), TREE_TYPE (b
));
6104 /* And because of those, we have to recurse down through pointers. */
6105 if (POINTER_TYPE_P (a
) && POINTER_TYPE_P (b
))
6106 return cpt_same_type (TREE_TYPE (a
), TREE_TYPE (b
));
6111 /* Check for some cases of the front end missing cast expressions.
6112 The type of a dereference should correspond to the pointer type;
6113 similarly the type of an address should match its object. */
6116 check_pointer_types_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
6117 void *data ATTRIBUTE_UNUSED
)
6120 tree ptype
, otype
, dtype
;
6122 switch (TREE_CODE (t
))
6126 otype
= TREE_TYPE (t
);
6127 ptype
= TREE_TYPE (TREE_OPERAND (t
, 0));
6128 dtype
= TREE_TYPE (ptype
);
6129 gcc_assert (cpt_same_type (otype
, dtype
));
6133 ptype
= TREE_TYPE (t
);
6134 otype
= TREE_TYPE (TREE_OPERAND (t
, 0));
6135 dtype
= TREE_TYPE (ptype
);
6136 if (!cpt_same_type (otype
, dtype
))
6138 /* &array is allowed to produce a pointer to the element, rather than
6139 a pointer to the array type. We must allow this in order to
6140 properly represent assigning the address of an array in C into
6141 pointer to the element type. */
6142 gcc_assert (TREE_CODE (otype
) == ARRAY_TYPE
6143 && POINTER_TYPE_P (ptype
)
6144 && cpt_same_type (TREE_TYPE (otype
), dtype
));
6158 /* Gimplify the body of statements pointed to by BODY_P. FNDECL is the
6159 function decl containing BODY. */
6162 gimplify_body (tree
*body_p
, tree fndecl
, bool do_parms
)
6164 location_t saved_location
= input_location
;
6165 tree body
, parm_stmts
;
6167 timevar_push (TV_TREE_GIMPLIFY
);
6169 gcc_assert (gimplify_ctxp
== NULL
);
6170 push_gimplify_context ();
6172 /* Unshare most shared trees in the body and in that of any nested functions.
6173 It would seem we don't have to do this for nested functions because
6174 they are supposed to be output and then the outer function gimplified
6175 first, but the g++ front end doesn't always do it that way. */
6176 unshare_body (body_p
, fndecl
);
6177 unvisit_body (body_p
, fndecl
);
6179 /* Make sure input_location isn't set to something wierd. */
6180 input_location
= DECL_SOURCE_LOCATION (fndecl
);
6182 /* Resolve callee-copies. This has to be done before processing
6183 the body so that DECL_VALUE_EXPR gets processed correctly. */
6184 parm_stmts
= do_parms
? gimplify_parameters () : NULL
;
6186 /* Gimplify the function's body. */
6187 gimplify_stmt (body_p
);
6191 body
= alloc_stmt_list ();
6192 else if (TREE_CODE (body
) == STATEMENT_LIST
)
6194 tree t
= expr_only (*body_p
);
6199 /* If there isn't an outer BIND_EXPR, add one. */
6200 if (TREE_CODE (body
) != BIND_EXPR
)
6202 tree b
= build3 (BIND_EXPR
, void_type_node
, NULL_TREE
,
6203 NULL_TREE
, NULL_TREE
);
6204 TREE_SIDE_EFFECTS (b
) = 1;
6205 append_to_statement_list_force (body
, &BIND_EXPR_BODY (b
));
6209 /* If we had callee-copies statements, insert them at the beginning
6213 append_to_statement_list_force (BIND_EXPR_BODY (body
), &parm_stmts
);
6214 BIND_EXPR_BODY (body
) = parm_stmts
;
6217 /* Unshare again, in case gimplification was sloppy. */
6218 unshare_all_trees (body
);
6222 pop_gimplify_context (body
);
6223 gcc_assert (gimplify_ctxp
== NULL
);
6225 #ifdef ENABLE_CHECKING
6226 walk_tree (body_p
, check_pointer_types_r
, NULL
, NULL
);
6229 timevar_pop (TV_TREE_GIMPLIFY
);
6230 input_location
= saved_location
;
6233 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
6234 node for the function we want to gimplify. */
6237 gimplify_function_tree (tree fndecl
)
6239 tree oldfn
, parm
, ret
;
6241 oldfn
= current_function_decl
;
6242 current_function_decl
= fndecl
;
6243 cfun
= DECL_STRUCT_FUNCTION (fndecl
);
6245 allocate_struct_function (fndecl
);
6247 for (parm
= DECL_ARGUMENTS (fndecl
); parm
; parm
= TREE_CHAIN (parm
))
6249 /* Preliminarily mark non-addressed complex variables as eligible
6250 for promotion to gimple registers. We'll transform their uses
6252 if (TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
6253 && !TREE_THIS_VOLATILE (parm
)
6254 && !needs_to_live_in_memory (parm
))
6255 DECL_COMPLEX_GIMPLE_REG_P (parm
) = 1;
6258 ret
= DECL_RESULT (fndecl
);
6259 if (TREE_CODE (TREE_TYPE (ret
)) == COMPLEX_TYPE
6260 && !needs_to_live_in_memory (ret
))
6261 DECL_COMPLEX_GIMPLE_REG_P (ret
) = 1;
6263 gimplify_body (&DECL_SAVED_TREE (fndecl
), fndecl
, true);
6265 /* If we're instrumenting function entry/exit, then prepend the call to
6266 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
6267 catch the exit hook. */
6268 /* ??? Add some way to ignore exceptions for this TFE. */
6269 if (flag_instrument_function_entry_exit
6270 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl
))
6274 tf
= build2 (TRY_FINALLY_EXPR
, void_type_node
, NULL
, NULL
);
6275 TREE_SIDE_EFFECTS (tf
) = 1;
6276 x
= DECL_SAVED_TREE (fndecl
);
6277 append_to_statement_list (x
, &TREE_OPERAND (tf
, 0));
6278 x
= implicit_built_in_decls
[BUILT_IN_PROFILE_FUNC_EXIT
];
6279 x
= build_function_call_expr (x
, NULL
);
6280 append_to_statement_list (x
, &TREE_OPERAND (tf
, 1));
6282 bind
= build3 (BIND_EXPR
, void_type_node
, NULL
, NULL
, NULL
);
6283 TREE_SIDE_EFFECTS (bind
) = 1;
6284 x
= implicit_built_in_decls
[BUILT_IN_PROFILE_FUNC_ENTER
];
6285 x
= build_function_call_expr (x
, NULL
);
6286 append_to_statement_list (x
, &BIND_EXPR_BODY (bind
));
6287 append_to_statement_list (tf
, &BIND_EXPR_BODY (bind
));
6289 DECL_SAVED_TREE (fndecl
) = bind
;
6292 current_function_decl
= oldfn
;
6293 cfun
= oldfn
? DECL_STRUCT_FUNCTION (oldfn
) : NULL
;
6297 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
6298 force the result to be either ssa_name or an invariant, otherwise
6299 just force it to be a rhs expression. If VAR is not NULL, make the
6300 base variable of the final destination be VAR if suitable. */
6303 force_gimple_operand (tree expr
, tree
*stmts
, bool simple
, tree var
)
6306 enum gimplify_status ret
;
6307 gimple_predicate gimple_test_f
;
6311 if (is_gimple_val (expr
))
6314 gimple_test_f
= simple
? is_gimple_val
: is_gimple_reg_rhs
;
6316 push_gimplify_context ();
6317 gimplify_ctxp
->into_ssa
= in_ssa_p
;
6320 expr
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, expr
);
6322 ret
= gimplify_expr (&expr
, stmts
, NULL
,
6323 gimple_test_f
, fb_rvalue
);
6324 gcc_assert (ret
!= GS_ERROR
);
6326 if (referenced_vars
)
6328 for (t
= gimplify_ctxp
->temps
; t
; t
= TREE_CHAIN (t
))
6329 add_referenced_var (t
);
6332 pop_gimplify_context (NULL
);
6337 /* Invokes force_gimple_operand for EXPR with parameters SIMPLE_P and VAR. If
6338 some statements are produced, emits them before BSI. */
6341 force_gimple_operand_bsi (block_stmt_iterator
*bsi
, tree expr
,
6342 bool simple_p
, tree var
)
6346 expr
= force_gimple_operand (expr
, &stmts
, simple_p
, var
);
6348 bsi_insert_before (bsi
, stmts
, BSI_SAME_STMT
);
6353 #include "gt-gimplify.h"