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 tree type
= TREE_TYPE (wrapper
);
959 if (type
&& !VOID_TYPE_P (type
))
963 /* Set p to point to the body of the wrapper. Loop until we find
964 something that isn't a wrapper. */
965 for (p
= &wrapper
; p
&& *p
; )
967 switch (TREE_CODE (*p
))
970 TREE_SIDE_EFFECTS (*p
) = 1;
971 TREE_TYPE (*p
) = void_type_node
;
972 /* For a BIND_EXPR, the body is operand 1. */
973 p
= &BIND_EXPR_BODY (*p
);
976 case CLEANUP_POINT_EXPR
:
977 case TRY_FINALLY_EXPR
:
979 TREE_SIDE_EFFECTS (*p
) = 1;
980 TREE_TYPE (*p
) = void_type_node
;
981 p
= &TREE_OPERAND (*p
, 0);
986 tree_stmt_iterator i
= tsi_last (*p
);
987 TREE_SIDE_EFFECTS (*p
) = 1;
988 TREE_TYPE (*p
) = void_type_node
;
989 p
= tsi_end_p (i
) ? NULL
: tsi_stmt_ptr (i
);
994 /* Advance to the last statement. Set all container types to void. */
995 for (; TREE_CODE (*p
) == COMPOUND_EXPR
; p
= &TREE_OPERAND (*p
, 1))
997 TREE_SIDE_EFFECTS (*p
) = 1;
998 TREE_TYPE (*p
) = void_type_node
;
1008 if (p
== NULL
|| IS_EMPTY_STMT (*p
))
1012 /* The wrapper is on the RHS of an assignment that we're pushing
1014 gcc_assert (TREE_CODE (temp
) == INIT_EXPR
1015 || TREE_CODE (temp
) == MODIFY_EXPR
);
1016 TREE_OPERAND (temp
, 1) = *p
;
1021 temp
= create_tmp_var (type
, "retval");
1022 *p
= build2 (INIT_EXPR
, type
, temp
, *p
);
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
*pre_p
)
1055 tree bind_expr
= *expr_p
;
1056 bool old_save_stack
= gimplify_ctxp
->save_stack
;
1059 tree temp
= voidify_wrapper_expr (bind_expr
, NULL
);
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_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
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
, post
= NULL
, *orig_post_p
= post_p
;
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 /* For postfix, make sure the inner expression's post side effects
1917 are executed after side effects from this expression. */
1921 /* Add or subtract? */
1922 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
1923 arith_code
= PLUS_EXPR
;
1925 arith_code
= MINUS_EXPR
;
1927 /* Gimplify the LHS into a GIMPLE lvalue. */
1928 lvalue
= TREE_OPERAND (*expr_p
, 0);
1929 ret
= gimplify_expr (&lvalue
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
1930 if (ret
== GS_ERROR
)
1933 /* Extract the operands to the arithmetic operation. */
1935 rhs
= TREE_OPERAND (*expr_p
, 1);
1937 /* For postfix operator, we evaluate the LHS to an rvalue and then use
1938 that as the result value and in the postqueue operation. */
1941 ret
= gimplify_expr (&lhs
, pre_p
, post_p
, is_gimple_val
, fb_rvalue
);
1942 if (ret
== GS_ERROR
)
1946 t1
= build2 (arith_code
, TREE_TYPE (*expr_p
), lhs
, rhs
);
1947 t1
= build2 (MODIFY_EXPR
, TREE_TYPE (lvalue
), lvalue
, t1
);
1951 gimplify_and_add (t1
, orig_post_p
);
1952 append_to_statement_list (post
, orig_post_p
);
1963 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
1966 maybe_with_size_expr (tree
*expr_p
)
1968 tree expr
= *expr_p
;
1969 tree type
= TREE_TYPE (expr
);
1972 /* If we've already wrapped this or the type is error_mark_node, we can't do
1974 if (TREE_CODE (expr
) == WITH_SIZE_EXPR
1975 || type
== error_mark_node
)
1978 /* If the size isn't known or is a constant, we have nothing to do. */
1979 size
= TYPE_SIZE_UNIT (type
);
1980 if (!size
|| TREE_CODE (size
) == INTEGER_CST
)
1983 /* Otherwise, make a WITH_SIZE_EXPR. */
1984 size
= unshare_expr (size
);
1985 size
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (size
, expr
);
1986 *expr_p
= build2 (WITH_SIZE_EXPR
, type
, expr
, size
);
1989 /* Subroutine of gimplify_call_expr: Gimplify a single argument. */
1991 static enum gimplify_status
1992 gimplify_arg (tree
*expr_p
, tree
*pre_p
)
1994 bool (*test
) (tree
);
1997 /* In general, we allow lvalues for function arguments to avoid
1998 extra overhead of copying large aggregates out of even larger
1999 aggregates into temporaries only to copy the temporaries to
2000 the argument list. Make optimizers happy by pulling out to
2001 temporaries those types that fit in registers. */
2002 if (is_gimple_reg_type (TREE_TYPE (*expr_p
)))
2003 test
= is_gimple_val
, fb
= fb_rvalue
;
2005 test
= is_gimple_lvalue
, fb
= fb_either
;
2007 /* If this is a variable sized type, we must remember the size. */
2008 maybe_with_size_expr (expr_p
);
2010 /* There is a sequence point before a function call. Side effects in
2011 the argument list must occur before the actual call. So, when
2012 gimplifying arguments, force gimplify_expr to use an internal
2013 post queue which is then appended to the end of PRE_P. */
2014 return gimplify_expr (expr_p
, pre_p
, NULL
, test
, fb
);
2017 /* Gimplify the CALL_EXPR node pointed to by EXPR_P. PRE_P points to the
2018 list where side effects that must happen before *EXPR_P should be stored.
2019 WANT_VALUE is true if the result of the call is desired. */
2021 static enum gimplify_status
2022 gimplify_call_expr (tree
*expr_p
, tree
*pre_p
, bool want_value
)
2026 enum gimplify_status ret
;
2028 gcc_assert (TREE_CODE (*expr_p
) == CALL_EXPR
);
2030 /* For reliable diagnostics during inlining, it is necessary that
2031 every call_expr be annotated with file and line. */
2032 if (! EXPR_HAS_LOCATION (*expr_p
))
2033 SET_EXPR_LOCATION (*expr_p
, input_location
);
2035 /* This may be a call to a builtin function.
2037 Builtin function calls may be transformed into different
2038 (and more efficient) builtin function calls under certain
2039 circumstances. Unfortunately, gimplification can muck things
2040 up enough that the builtin expanders are not aware that certain
2041 transformations are still valid.
2043 So we attempt transformation/gimplification of the call before
2044 we gimplify the CALL_EXPR. At this time we do not manage to
2045 transform all calls in the same manner as the expanders do, but
2046 we do transform most of them. */
2047 decl
= get_callee_fndecl (*expr_p
);
2048 if (decl
&& DECL_BUILT_IN (decl
))
2050 tree arglist
= TREE_OPERAND (*expr_p
, 1);
2051 tree
new = fold_builtin (decl
, arglist
, !want_value
);
2053 if (new && new != *expr_p
)
2055 /* There was a transformation of this call which computes the
2056 same value, but in a more efficient way. Return and try
2062 if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
2063 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_START
)
2065 if (!arglist
|| !TREE_CHAIN (arglist
))
2067 error ("too few arguments to function %<va_start%>");
2068 *expr_p
= build_empty_stmt ();
2072 if (fold_builtin_next_arg (TREE_CHAIN (arglist
)))
2074 *expr_p
= build_empty_stmt ();
2077 /* Avoid gimplifying the second argument to va_start, which needs
2078 to be the plain PARM_DECL. */
2079 return gimplify_arg (&TREE_VALUE (TREE_OPERAND (*expr_p
, 1)), pre_p
);
2083 /* There is a sequence point before the call, so any side effects in
2084 the calling expression must occur before the actual call. Force
2085 gimplify_expr to use an internal post queue. */
2086 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, NULL
,
2087 is_gimple_call_addr
, fb_rvalue
);
2089 if (PUSH_ARGS_REVERSED
)
2090 TREE_OPERAND (*expr_p
, 1) = nreverse (TREE_OPERAND (*expr_p
, 1));
2091 for (arglist
= TREE_OPERAND (*expr_p
, 1); arglist
;
2092 arglist
= TREE_CHAIN (arglist
))
2094 enum gimplify_status t
;
2096 t
= gimplify_arg (&TREE_VALUE (arglist
), pre_p
);
2101 if (PUSH_ARGS_REVERSED
)
2102 TREE_OPERAND (*expr_p
, 1) = nreverse (TREE_OPERAND (*expr_p
, 1));
2104 /* Try this again in case gimplification exposed something. */
2105 if (ret
!= GS_ERROR
)
2107 decl
= get_callee_fndecl (*expr_p
);
2108 if (decl
&& DECL_BUILT_IN (decl
))
2110 tree arglist
= TREE_OPERAND (*expr_p
, 1);
2111 tree
new = fold_builtin (decl
, arglist
, !want_value
);
2113 if (new && new != *expr_p
)
2115 /* There was a transformation of this call which computes the
2116 same value, but in a more efficient way. Return and try
2124 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2125 decl. This allows us to eliminate redundant or useless
2126 calls to "const" functions. */
2127 if (TREE_CODE (*expr_p
) == CALL_EXPR
2128 && (call_expr_flags (*expr_p
) & (ECF_CONST
| ECF_PURE
)))
2129 TREE_SIDE_EFFECTS (*expr_p
) = 0;
2134 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2135 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2137 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2138 condition is true or false, respectively. If null, we should generate
2139 our own to skip over the evaluation of this specific expression.
2141 This function is the tree equivalent of do_jump.
2143 shortcut_cond_r should only be called by shortcut_cond_expr. */
2146 shortcut_cond_r (tree pred
, tree
*true_label_p
, tree
*false_label_p
)
2148 tree local_label
= NULL_TREE
;
2149 tree t
, expr
= NULL
;
2151 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2152 retain the shortcut semantics. Just insert the gotos here;
2153 shortcut_cond_expr will append the real blocks later. */
2154 if (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2156 /* Turn if (a && b) into
2158 if (a); else goto no;
2159 if (b) goto yes; else goto no;
2162 if (false_label_p
== NULL
)
2163 false_label_p
= &local_label
;
2165 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), NULL
, false_label_p
);
2166 append_to_statement_list (t
, &expr
);
2168 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2170 append_to_statement_list (t
, &expr
);
2172 else if (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2174 /* Turn if (a || b) into
2177 if (b) goto yes; else goto no;
2180 if (true_label_p
== NULL
)
2181 true_label_p
= &local_label
;
2183 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), true_label_p
, NULL
);
2184 append_to_statement_list (t
, &expr
);
2186 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2188 append_to_statement_list (t
, &expr
);
2190 else if (TREE_CODE (pred
) == COND_EXPR
)
2192 /* As long as we're messing with gotos, turn if (a ? b : c) into
2194 if (b) goto yes; else goto no;
2196 if (c) goto yes; else goto no; */
2197 expr
= build3 (COND_EXPR
, void_type_node
, TREE_OPERAND (pred
, 0),
2198 shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2200 shortcut_cond_r (TREE_OPERAND (pred
, 2), true_label_p
,
2205 expr
= build3 (COND_EXPR
, void_type_node
, pred
,
2206 build_and_jump (true_label_p
),
2207 build_and_jump (false_label_p
));
2212 t
= build1 (LABEL_EXPR
, void_type_node
, local_label
);
2213 append_to_statement_list (t
, &expr
);
2220 shortcut_cond_expr (tree expr
)
2222 tree pred
= TREE_OPERAND (expr
, 0);
2223 tree then_
= TREE_OPERAND (expr
, 1);
2224 tree else_
= TREE_OPERAND (expr
, 2);
2225 tree true_label
, false_label
, end_label
, t
;
2227 tree
*false_label_p
;
2228 bool emit_end
, emit_false
, jump_over_else
;
2229 bool then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2230 bool else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2232 /* First do simple transformations. */
2235 /* If there is no 'else', turn (a && b) into if (a) if (b). */
2236 while (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2238 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2239 then_
= shortcut_cond_expr (expr
);
2240 then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2241 pred
= TREE_OPERAND (pred
, 0);
2242 expr
= build3 (COND_EXPR
, void_type_node
, pred
, then_
, NULL_TREE
);
2247 /* If there is no 'then', turn
2250 if (a); else if (b); else d. */
2251 while (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2253 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2254 else_
= shortcut_cond_expr (expr
);
2255 else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2256 pred
= TREE_OPERAND (pred
, 0);
2257 expr
= build3 (COND_EXPR
, void_type_node
, pred
, NULL_TREE
, else_
);
2261 /* If we're done, great. */
2262 if (TREE_CODE (pred
) != TRUTH_ANDIF_EXPR
2263 && TREE_CODE (pred
) != TRUTH_ORIF_EXPR
)
2266 /* Otherwise we need to mess with gotos. Change
2269 if (a); else goto no;
2272 and recursively gimplify the condition. */
2274 true_label
= false_label
= end_label
= NULL_TREE
;
2276 /* If our arms just jump somewhere, hijack those labels so we don't
2277 generate jumps to jumps. */
2280 && TREE_CODE (then_
) == GOTO_EXPR
2281 && TREE_CODE (GOTO_DESTINATION (then_
)) == LABEL_DECL
)
2283 true_label
= GOTO_DESTINATION (then_
);
2289 && TREE_CODE (else_
) == GOTO_EXPR
2290 && TREE_CODE (GOTO_DESTINATION (else_
)) == LABEL_DECL
)
2292 false_label
= GOTO_DESTINATION (else_
);
2297 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2299 true_label_p
= &true_label
;
2301 true_label_p
= NULL
;
2303 /* The 'else' branch also needs a label if it contains interesting code. */
2304 if (false_label
|| else_se
)
2305 false_label_p
= &false_label
;
2307 false_label_p
= NULL
;
2309 /* If there was nothing else in our arms, just forward the label(s). */
2310 if (!then_se
&& !else_se
)
2311 return shortcut_cond_r (pred
, true_label_p
, false_label_p
);
2313 /* If our last subexpression already has a terminal label, reuse it. */
2315 expr
= expr_last (else_
);
2317 expr
= expr_last (then_
);
2320 if (expr
&& TREE_CODE (expr
) == LABEL_EXPR
)
2321 end_label
= LABEL_EXPR_LABEL (expr
);
2323 /* If we don't care about jumping to the 'else' branch, jump to the end
2324 if the condition is false. */
2326 false_label_p
= &end_label
;
2328 /* We only want to emit these labels if we aren't hijacking them. */
2329 emit_end
= (end_label
== NULL_TREE
);
2330 emit_false
= (false_label
== NULL_TREE
);
2332 /* We only emit the jump over the else clause if we have to--if the
2333 then clause may fall through. Otherwise we can wind up with a
2334 useless jump and a useless label at the end of gimplified code,
2335 which will cause us to think that this conditional as a whole
2336 falls through even if it doesn't. If we then inline a function
2337 which ends with such a condition, that can cause us to issue an
2338 inappropriate warning about control reaching the end of a
2339 non-void function. */
2340 jump_over_else
= block_may_fallthru (then_
);
2342 pred
= shortcut_cond_r (pred
, true_label_p
, false_label_p
);
2345 append_to_statement_list (pred
, &expr
);
2347 append_to_statement_list (then_
, &expr
);
2352 t
= build_and_jump (&end_label
);
2353 append_to_statement_list (t
, &expr
);
2357 t
= build1 (LABEL_EXPR
, void_type_node
, false_label
);
2358 append_to_statement_list (t
, &expr
);
2360 append_to_statement_list (else_
, &expr
);
2362 if (emit_end
&& end_label
)
2364 t
= build1 (LABEL_EXPR
, void_type_node
, end_label
);
2365 append_to_statement_list (t
, &expr
);
2371 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2374 gimple_boolify (tree expr
)
2376 tree type
= TREE_TYPE (expr
);
2378 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
2381 switch (TREE_CODE (expr
))
2383 case TRUTH_AND_EXPR
:
2385 case TRUTH_XOR_EXPR
:
2386 case TRUTH_ANDIF_EXPR
:
2387 case TRUTH_ORIF_EXPR
:
2388 /* Also boolify the arguments of truth exprs. */
2389 TREE_OPERAND (expr
, 1) = gimple_boolify (TREE_OPERAND (expr
, 1));
2392 case TRUTH_NOT_EXPR
:
2393 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
2396 case EQ_EXPR
: case NE_EXPR
:
2397 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
2398 /* These expressions always produce boolean results. */
2399 TREE_TYPE (expr
) = boolean_type_node
;
2403 /* Other expressions that get here must have boolean values, but
2404 might need to be converted to the appropriate mode. */
2405 return fold_convert (boolean_type_node
, expr
);
2409 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2418 The second form is used when *EXPR_P is of type void.
2420 TARGET is the tree for T1 above.
2422 PRE_P points to the list where side effects that must happen before
2423 *EXPR_P should be stored. */
2425 static enum gimplify_status
2426 gimplify_cond_expr (tree
*expr_p
, tree
*pre_p
, fallback_t fallback
)
2428 tree expr
= *expr_p
;
2429 tree tmp
, tmp2
, type
;
2430 enum gimplify_status ret
;
2432 type
= TREE_TYPE (expr
);
2434 /* If this COND_EXPR has a value, copy the values into a temporary within
2436 if (! VOID_TYPE_P (type
))
2440 if ((fallback
& fb_lvalue
) == 0)
2442 result
= tmp2
= tmp
= create_tmp_var (TREE_TYPE (expr
), "iftmp");
2447 tree type
= build_pointer_type (TREE_TYPE (expr
));
2449 if (TREE_TYPE (TREE_OPERAND (expr
, 1)) != void_type_node
)
2450 TREE_OPERAND (expr
, 1) =
2451 build_fold_addr_expr (TREE_OPERAND (expr
, 1));
2453 if (TREE_TYPE (TREE_OPERAND (expr
, 2)) != void_type_node
)
2454 TREE_OPERAND (expr
, 2) =
2455 build_fold_addr_expr (TREE_OPERAND (expr
, 2));
2457 tmp2
= tmp
= create_tmp_var (type
, "iftmp");
2459 expr
= build3 (COND_EXPR
, void_type_node
, TREE_OPERAND (expr
, 0),
2460 TREE_OPERAND (expr
, 1), TREE_OPERAND (expr
, 2));
2462 result
= build_fold_indirect_ref (tmp
);
2466 /* Build the then clause, 't1 = a;'. But don't build an assignment
2467 if this branch is void; in C++ it can be, if it's a throw. */
2468 if (TREE_TYPE (TREE_OPERAND (expr
, 1)) != void_type_node
)
2469 TREE_OPERAND (expr
, 1)
2470 = build2 (MODIFY_EXPR
, void_type_node
, tmp
, TREE_OPERAND (expr
, 1));
2472 /* Build the else clause, 't1 = b;'. */
2473 if (TREE_TYPE (TREE_OPERAND (expr
, 2)) != void_type_node
)
2474 TREE_OPERAND (expr
, 2)
2475 = build2 (MODIFY_EXPR
, void_type_node
, tmp2
, TREE_OPERAND (expr
, 2));
2477 TREE_TYPE (expr
) = void_type_node
;
2478 recalculate_side_effects (expr
);
2480 /* Move the COND_EXPR to the prequeue. */
2481 gimplify_and_add (expr
, pre_p
);
2487 /* Make sure the condition has BOOLEAN_TYPE. */
2488 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
2490 /* Break apart && and || conditions. */
2491 if (TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ANDIF_EXPR
2492 || TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ORIF_EXPR
)
2494 expr
= shortcut_cond_expr (expr
);
2496 if (expr
!= *expr_p
)
2500 /* We can't rely on gimplify_expr to re-gimplify the expanded
2501 form properly, as cleanups might cause the target labels to be
2502 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2503 set up a conditional context. */
2504 gimple_push_condition ();
2505 gimplify_stmt (expr_p
);
2506 gimple_pop_condition (pre_p
);
2512 /* Now do the normal gimplification. */
2513 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, NULL
,
2514 is_gimple_condexpr
, fb_rvalue
);
2516 gimple_push_condition ();
2518 gimplify_to_stmt_list (&TREE_OPERAND (expr
, 1));
2519 gimplify_to_stmt_list (&TREE_OPERAND (expr
, 2));
2520 recalculate_side_effects (expr
);
2522 gimple_pop_condition (pre_p
);
2524 if (ret
== GS_ERROR
)
2526 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
2528 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 2)))
2529 /* Rewrite "if (a); else b" to "if (!a) b" */
2531 TREE_OPERAND (expr
, 0) = invert_truthvalue (TREE_OPERAND (expr
, 0));
2532 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, NULL
,
2533 is_gimple_condexpr
, fb_rvalue
);
2535 tmp
= TREE_OPERAND (expr
, 1);
2536 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 2);
2537 TREE_OPERAND (expr
, 2) = tmp
;
2540 /* Both arms are empty; replace the COND_EXPR with its predicate. */
2541 expr
= TREE_OPERAND (expr
, 0);
2547 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2548 a call to __builtin_memcpy. */
2550 static enum gimplify_status
2551 gimplify_modify_expr_to_memcpy (tree
*expr_p
, tree size
, bool want_value
)
2553 tree args
, t
, to
, to_ptr
, from
;
2555 to
= TREE_OPERAND (*expr_p
, 0);
2556 from
= TREE_OPERAND (*expr_p
, 1);
2558 args
= tree_cons (NULL
, size
, NULL
);
2560 t
= build_fold_addr_expr (from
);
2561 args
= tree_cons (NULL
, t
, args
);
2563 to_ptr
= build_fold_addr_expr (to
);
2564 args
= tree_cons (NULL
, to_ptr
, args
);
2565 t
= implicit_built_in_decls
[BUILT_IN_MEMCPY
];
2566 t
= build_function_call_expr (t
, args
);
2570 t
= build1 (NOP_EXPR
, TREE_TYPE (to_ptr
), t
);
2571 t
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
2578 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2579 a call to __builtin_memset. In this case we know that the RHS is
2580 a CONSTRUCTOR with an empty element list. */
2582 static enum gimplify_status
2583 gimplify_modify_expr_to_memset (tree
*expr_p
, tree size
, bool want_value
)
2585 tree args
, t
, to
, to_ptr
;
2587 to
= TREE_OPERAND (*expr_p
, 0);
2589 args
= tree_cons (NULL
, size
, NULL
);
2591 args
= tree_cons (NULL
, integer_zero_node
, args
);
2593 to_ptr
= build_fold_addr_expr (to
);
2594 args
= tree_cons (NULL
, to_ptr
, args
);
2595 t
= implicit_built_in_decls
[BUILT_IN_MEMSET
];
2596 t
= build_function_call_expr (t
, args
);
2600 t
= build1 (NOP_EXPR
, TREE_TYPE (to_ptr
), t
);
2601 t
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
2608 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
2609 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
2610 assignment. Returns non-null if we detect a potential overlap. */
2612 struct gimplify_init_ctor_preeval_data
2614 /* The base decl of the lhs object. May be NULL, in which case we
2615 have to assume the lhs is indirect. */
2618 /* The alias set of the lhs object. */
2623 gimplify_init_ctor_preeval_1 (tree
*tp
, int *walk_subtrees
, void *xdata
)
2625 struct gimplify_init_ctor_preeval_data
*data
2626 = (struct gimplify_init_ctor_preeval_data
*) xdata
;
2629 /* If we find the base object, obviously we have overlap. */
2630 if (data
->lhs_base_decl
== t
)
2633 /* If the constructor component is indirect, determine if we have a
2634 potential overlap with the lhs. The only bits of information we
2635 have to go on at this point are addressability and alias sets. */
2636 if (TREE_CODE (t
) == INDIRECT_REF
2637 && (!data
->lhs_base_decl
|| TREE_ADDRESSABLE (data
->lhs_base_decl
))
2638 && alias_sets_conflict_p (data
->lhs_alias_set
, get_alias_set (t
)))
2641 if (IS_TYPE_OR_DECL_P (t
))
2646 /* A subroutine of gimplify_init_constructor. Pre-evaluate *EXPR_P,
2647 force values that overlap with the lhs (as described by *DATA)
2648 into temporaries. */
2651 gimplify_init_ctor_preeval (tree
*expr_p
, tree
*pre_p
, tree
*post_p
,
2652 struct gimplify_init_ctor_preeval_data
*data
)
2654 enum gimplify_status one
;
2656 /* If the value is invariant, then there's nothing to pre-evaluate.
2657 But ensure it doesn't have any side-effects since a SAVE_EXPR is
2658 invariant but has side effects and might contain a reference to
2659 the object we're initializing. */
2660 if (TREE_INVARIANT (*expr_p
) && !TREE_SIDE_EFFECTS (*expr_p
))
2663 /* If the type has non-trivial constructors, we can't pre-evaluate. */
2664 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p
)))
2667 /* Recurse for nested constructors. */
2668 if (TREE_CODE (*expr_p
) == CONSTRUCTOR
)
2670 unsigned HOST_WIDE_INT ix
;
2671 constructor_elt
*ce
;
2672 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (*expr_p
);
2674 for (ix
= 0; VEC_iterate (constructor_elt
, v
, ix
, ce
); ix
++)
2675 gimplify_init_ctor_preeval (&ce
->value
, pre_p
, post_p
, data
);
2679 /* If this is a variable sized type, we must remember the size. */
2680 maybe_with_size_expr (expr_p
);
2682 /* Gimplify the constructor element to something appropriate for the rhs
2683 of a MODIFY_EXPR. Given that we know the lhs is an aggregate, we know
2684 the gimplifier will consider this a store to memory. Doing this
2685 gimplification now means that we won't have to deal with complicated
2686 language-specific trees, nor trees like SAVE_EXPR that can induce
2687 exponential search behavior. */
2688 one
= gimplify_expr (expr_p
, pre_p
, post_p
, is_gimple_mem_rhs
, fb_rvalue
);
2689 if (one
== GS_ERROR
)
2695 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
2696 with the lhs, since "a = { .x=a }" doesn't make sense. This will
2697 always be true for all scalars, since is_gimple_mem_rhs insists on a
2698 temporary variable for them. */
2699 if (DECL_P (*expr_p
))
2702 /* If this is of variable size, we have no choice but to assume it doesn't
2703 overlap since we can't make a temporary for it. */
2704 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (*expr_p
))) != INTEGER_CST
)
2707 /* Otherwise, we must search for overlap ... */
2708 if (!walk_tree (expr_p
, gimplify_init_ctor_preeval_1
, data
, NULL
))
2711 /* ... and if found, force the value into a temporary. */
2712 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
2715 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
2716 a RANGE_EXPR in a CONSTRUCTOR for an array.
2720 object[var] = value;
2727 We increment var _after_ the loop exit check because we might otherwise
2728 fail if upper == TYPE_MAX_VALUE (type for upper).
2730 Note that we never have to deal with SAVE_EXPRs here, because this has
2731 already been taken care of for us, in gimplify_init_ctor_preeval(). */
2733 static void gimplify_init_ctor_eval (tree
, VEC(constructor_elt
,gc
) *,
2737 gimplify_init_ctor_eval_range (tree object
, tree lower
, tree upper
,
2738 tree value
, tree array_elt_type
,
2739 tree
*pre_p
, bool cleared
)
2741 tree loop_entry_label
, loop_exit_label
;
2742 tree var
, var_type
, cref
;
2744 loop_entry_label
= create_artificial_label ();
2745 loop_exit_label
= create_artificial_label ();
2747 /* Create and initialize the index variable. */
2748 var_type
= TREE_TYPE (upper
);
2749 var
= create_tmp_var (var_type
, NULL
);
2750 append_to_statement_list (build2 (MODIFY_EXPR
, var_type
, var
, lower
), pre_p
);
2752 /* Add the loop entry label. */
2753 append_to_statement_list (build1 (LABEL_EXPR
,
2758 /* Build the reference. */
2759 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
2760 var
, NULL_TREE
, NULL_TREE
);
2762 /* If we are a constructor, just call gimplify_init_ctor_eval to do
2763 the store. Otherwise just assign value to the reference. */
2765 if (TREE_CODE (value
) == CONSTRUCTOR
)
2766 /* NB we might have to call ourself recursively through
2767 gimplify_init_ctor_eval if the value is a constructor. */
2768 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
2771 append_to_statement_list (build2 (MODIFY_EXPR
, TREE_TYPE (cref
),
2775 /* We exit the loop when the index var is equal to the upper bound. */
2776 gimplify_and_add (build3 (COND_EXPR
, void_type_node
,
2777 build2 (EQ_EXPR
, boolean_type_node
,
2785 /* Otherwise, increment the index var... */
2786 append_to_statement_list (build2 (MODIFY_EXPR
, var_type
, var
,
2787 build2 (PLUS_EXPR
, var_type
, var
,
2788 fold_convert (var_type
,
2789 integer_one_node
))),
2792 /* ...and jump back to the loop entry. */
2793 append_to_statement_list (build1 (GOTO_EXPR
,
2798 /* Add the loop exit label. */
2799 append_to_statement_list (build1 (LABEL_EXPR
,
2805 /* Return true if FDECL is accessing a field that is zero sized. */
2808 zero_sized_field_decl (tree fdecl
)
2810 if (TREE_CODE (fdecl
) == FIELD_DECL
&& DECL_SIZE (fdecl
)
2811 && integer_zerop (DECL_SIZE (fdecl
)))
2816 /* Return true if TYPE is zero sized. */
2819 zero_sized_type (tree type
)
2821 if (AGGREGATE_TYPE_P (type
) && TYPE_SIZE (type
)
2822 && integer_zerop (TYPE_SIZE (type
)))
2827 /* A subroutine of gimplify_init_constructor. Generate individual
2828 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
2829 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
2830 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
2834 gimplify_init_ctor_eval (tree object
, VEC(constructor_elt
,gc
) *elts
,
2835 tree
*pre_p
, bool cleared
)
2837 tree array_elt_type
= NULL
;
2838 unsigned HOST_WIDE_INT ix
;
2839 tree purpose
, value
;
2841 if (TREE_CODE (TREE_TYPE (object
)) == ARRAY_TYPE
)
2842 array_elt_type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object
)));
2844 FOR_EACH_CONSTRUCTOR_ELT (elts
, ix
, purpose
, value
)
2848 /* NULL values are created above for gimplification errors. */
2852 if (cleared
&& initializer_zerop (value
))
2855 /* ??? Here's to hoping the front end fills in all of the indices,
2856 so we don't have to figure out what's missing ourselves. */
2857 gcc_assert (purpose
);
2859 /* Skip zero-sized fields, unless value has side-effects. This can
2860 happen with calls to functions returning a zero-sized type, which
2861 we shouldn't discard. As a number of downstream passes don't
2862 expect sets of zero-sized fields, we rely on the gimplification of
2863 the MODIFY_EXPR we make below to drop the assignment statement. */
2864 if (! TREE_SIDE_EFFECTS (value
) && zero_sized_field_decl (purpose
))
2867 /* If we have a RANGE_EXPR, we have to build a loop to assign the
2869 if (TREE_CODE (purpose
) == RANGE_EXPR
)
2871 tree lower
= TREE_OPERAND (purpose
, 0);
2872 tree upper
= TREE_OPERAND (purpose
, 1);
2874 /* If the lower bound is equal to upper, just treat it as if
2875 upper was the index. */
2876 if (simple_cst_equal (lower
, upper
))
2880 gimplify_init_ctor_eval_range (object
, lower
, upper
, value
,
2881 array_elt_type
, pre_p
, cleared
);
2888 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
2889 purpose
, NULL_TREE
, NULL_TREE
);
2893 gcc_assert (TREE_CODE (purpose
) == FIELD_DECL
);
2894 cref
= build3 (COMPONENT_REF
, TREE_TYPE (purpose
),
2895 unshare_expr (object
), purpose
, NULL_TREE
);
2898 if (TREE_CODE (value
) == CONSTRUCTOR
2899 && TREE_CODE (TREE_TYPE (value
)) != VECTOR_TYPE
)
2900 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
2904 init
= build2 (INIT_EXPR
, TREE_TYPE (cref
), cref
, value
);
2905 gimplify_and_add (init
, pre_p
);
2910 /* A subroutine of gimplify_modify_expr. Break out elements of a
2911 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
2913 Note that we still need to clear any elements that don't have explicit
2914 initializers, so if not all elements are initialized we keep the
2915 original MODIFY_EXPR, we just remove all of the constructor elements. */
2917 static enum gimplify_status
2918 gimplify_init_constructor (tree
*expr_p
, tree
*pre_p
,
2919 tree
*post_p
, bool want_value
)
2922 tree ctor
= TREE_OPERAND (*expr_p
, 1);
2923 tree type
= TREE_TYPE (ctor
);
2924 enum gimplify_status ret
;
2925 VEC(constructor_elt
,gc
) *elts
;
2927 if (TREE_CODE (ctor
) != CONSTRUCTOR
)
2928 return GS_UNHANDLED
;
2930 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
2931 is_gimple_lvalue
, fb_lvalue
);
2932 if (ret
== GS_ERROR
)
2934 object
= TREE_OPERAND (*expr_p
, 0);
2936 elts
= CONSTRUCTOR_ELTS (ctor
);
2939 switch (TREE_CODE (type
))
2943 case QUAL_UNION_TYPE
:
2946 struct gimplify_init_ctor_preeval_data preeval_data
;
2947 HOST_WIDE_INT num_type_elements
, num_ctor_elements
;
2948 HOST_WIDE_INT num_nonzero_elements
;
2949 bool cleared
, valid_const_initializer
;
2951 /* Aggregate types must lower constructors to initialization of
2952 individual elements. The exception is that a CONSTRUCTOR node
2953 with no elements indicates zero-initialization of the whole. */
2954 if (VEC_empty (constructor_elt
, elts
))
2957 /* Fetch information about the constructor to direct later processing.
2958 We might want to make static versions of it in various cases, and
2959 can only do so if it known to be a valid constant initializer. */
2960 valid_const_initializer
2961 = categorize_ctor_elements (ctor
, &num_nonzero_elements
,
2962 &num_ctor_elements
, &cleared
);
2964 /* If a const aggregate variable is being initialized, then it
2965 should never be a lose to promote the variable to be static. */
2966 if (valid_const_initializer
2967 && num_nonzero_elements
> 1
2968 && TREE_READONLY (object
)
2969 && TREE_CODE (object
) == VAR_DECL
)
2971 DECL_INITIAL (object
) = ctor
;
2972 TREE_STATIC (object
) = 1;
2973 if (!DECL_NAME (object
))
2974 DECL_NAME (object
) = create_tmp_var_name ("C");
2975 walk_tree (&DECL_INITIAL (object
), force_labels_r
, NULL
, NULL
);
2977 /* ??? C++ doesn't automatically append a .<number> to the
2978 assembler name, and even when it does, it looks a FE private
2979 data structures to figure out what that number should be,
2980 which are not set for this variable. I suppose this is
2981 important for local statics for inline functions, which aren't
2982 "local" in the object file sense. So in order to get a unique
2983 TU-local symbol, we must invoke the lhd version now. */
2984 lhd_set_decl_assembler_name (object
);
2986 *expr_p
= NULL_TREE
;
2990 /* If there are "lots" of initialized elements, even discounting
2991 those that are not address constants (and thus *must* be
2992 computed at runtime), then partition the constructor into
2993 constant and non-constant parts. Block copy the constant
2994 parts in, then generate code for the non-constant parts. */
2995 /* TODO. There's code in cp/typeck.c to do this. */
2997 num_type_elements
= count_type_elements (type
, true);
2999 /* If count_type_elements could not determine number of type elements
3000 for a constant-sized object, assume clearing is needed.
3001 Don't do this for variable-sized objects, as store_constructor
3002 will ignore the clearing of variable-sized objects. */
3003 if (num_type_elements
< 0 && int_size_in_bytes (type
) >= 0)
3005 /* If there are "lots" of zeros, then block clear the object first. */
3006 else if (num_type_elements
- num_nonzero_elements
> CLEAR_RATIO
3007 && num_nonzero_elements
< num_type_elements
/4)
3009 /* ??? This bit ought not be needed. For any element not present
3010 in the initializer, we should simply set them to zero. Except
3011 we'd need to *find* the elements that are not present, and that
3012 requires trickery to avoid quadratic compile-time behavior in
3013 large cases or excessive memory use in small cases. */
3014 else if (num_ctor_elements
< num_type_elements
)
3017 /* If there are "lots" of initialized elements, and all of them
3018 are valid address constants, then the entire initializer can
3019 be dropped to memory, and then memcpy'd out. Don't do this
3020 for sparse arrays, though, as it's more efficient to follow
3021 the standard CONSTRUCTOR behavior of memset followed by
3022 individual element initialization. */
3023 if (valid_const_initializer
&& !cleared
)
3025 HOST_WIDE_INT size
= int_size_in_bytes (type
);
3028 /* ??? We can still get unbounded array types, at least
3029 from the C++ front end. This seems wrong, but attempt
3030 to work around it for now. */
3033 size
= int_size_in_bytes (TREE_TYPE (object
));
3035 TREE_TYPE (ctor
) = type
= TREE_TYPE (object
);
3038 /* Find the maximum alignment we can assume for the object. */
3039 /* ??? Make use of DECL_OFFSET_ALIGN. */
3040 if (DECL_P (object
))
3041 align
= DECL_ALIGN (object
);
3043 align
= TYPE_ALIGN (type
);
3045 if (size
> 0 && !can_move_by_pieces (size
, align
))
3047 tree
new = create_tmp_var_raw (type
, "C");
3049 gimple_add_tmp_var (new);
3050 TREE_STATIC (new) = 1;
3051 TREE_READONLY (new) = 1;
3052 DECL_INITIAL (new) = ctor
;
3053 if (align
> DECL_ALIGN (new))
3055 DECL_ALIGN (new) = align
;
3056 DECL_USER_ALIGN (new) = 1;
3058 walk_tree (&DECL_INITIAL (new), force_labels_r
, NULL
, NULL
);
3060 TREE_OPERAND (*expr_p
, 1) = new;
3062 /* This is no longer an assignment of a CONSTRUCTOR, but
3063 we still may have processing to do on the LHS. So
3064 pretend we didn't do anything here to let that happen. */
3065 return GS_UNHANDLED
;
3069 /* If there are nonzero elements, pre-evaluate to capture elements
3070 overlapping with the lhs into temporaries. We must do this before
3071 clearing to fetch the values before they are zeroed-out. */
3072 if (num_nonzero_elements
> 0)
3074 preeval_data
.lhs_base_decl
= get_base_address (object
);
3075 if (!DECL_P (preeval_data
.lhs_base_decl
))
3076 preeval_data
.lhs_base_decl
= NULL
;
3077 preeval_data
.lhs_alias_set
= get_alias_set (object
);
3079 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p
, 1),
3080 pre_p
, post_p
, &preeval_data
);
3085 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3086 Note that we still have to gimplify, in order to handle the
3087 case of variable sized types. Avoid shared tree structures. */
3088 CONSTRUCTOR_ELTS (ctor
) = NULL
;
3089 object
= unshare_expr (object
);
3090 gimplify_stmt (expr_p
);
3091 append_to_statement_list (*expr_p
, pre_p
);
3094 /* If we have not block cleared the object, or if there are nonzero
3095 elements in the constructor, add assignments to the individual
3096 scalar fields of the object. */
3097 if (!cleared
|| num_nonzero_elements
> 0)
3098 gimplify_init_ctor_eval (object
, elts
, pre_p
, cleared
);
3100 *expr_p
= NULL_TREE
;
3108 /* Extract the real and imaginary parts out of the ctor. */
3109 gcc_assert (VEC_length (constructor_elt
, elts
) == 2);
3110 r
= VEC_index (constructor_elt
, elts
, 0)->value
;
3111 i
= VEC_index (constructor_elt
, elts
, 1)->value
;
3112 if (r
== NULL
|| i
== NULL
)
3114 tree zero
= fold_convert (TREE_TYPE (type
), integer_zero_node
);
3121 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3122 represent creation of a complex value. */
3123 if (TREE_CONSTANT (r
) && TREE_CONSTANT (i
))
3125 ctor
= build_complex (type
, r
, i
);
3126 TREE_OPERAND (*expr_p
, 1) = ctor
;
3130 ctor
= build2 (COMPLEX_EXPR
, type
, r
, i
);
3131 TREE_OPERAND (*expr_p
, 1) = ctor
;
3132 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
3133 rhs_predicate_for (TREE_OPERAND (*expr_p
, 0)),
3141 unsigned HOST_WIDE_INT ix
;
3142 constructor_elt
*ce
;
3144 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3145 if (TREE_CONSTANT (ctor
))
3147 bool constant_p
= true;
3150 /* Even when ctor is constant, it might contain non-*_CST
3151 elements (e.g. { 1.0/0.0 - 1.0/0.0, 0.0 }) and those don't
3152 belong into VECTOR_CST nodes. */
3153 FOR_EACH_CONSTRUCTOR_VALUE (elts
, ix
, value
)
3154 if (!CONSTANT_CLASS_P (value
))
3162 TREE_OPERAND (*expr_p
, 1) = build_vector_from_ctor (type
, elts
);
3166 /* Don't reduce a TREE_CONSTANT vector ctor even if we can't
3167 make a VECTOR_CST. It won't do anything for us, and it'll
3168 prevent us from representing it as a single constant. */
3172 /* Vector types use CONSTRUCTOR all the way through gimple
3173 compilation as a general initializer. */
3174 for (ix
= 0; VEC_iterate (constructor_elt
, elts
, ix
, ce
); ix
++)
3176 enum gimplify_status tret
;
3177 tret
= gimplify_expr (&ce
->value
, pre_p
, post_p
,
3178 is_gimple_val
, fb_rvalue
);
3179 if (tret
== GS_ERROR
)
3186 /* So how did we get a CONSTRUCTOR for a scalar type? */
3190 if (ret
== GS_ERROR
)
3192 else if (want_value
)
3194 append_to_statement_list (*expr_p
, pre_p
);
3202 /* Given a pointer value OP0, return a simplified version of an
3203 indirection through OP0, or NULL_TREE if no simplification is
3204 possible. This may only be applied to a rhs of an expression.
3205 Note that the resulting type may be different from the type pointed
3206 to in the sense that it is still compatible from the langhooks
3210 fold_indirect_ref_rhs (tree t
)
3212 tree type
= TREE_TYPE (TREE_TYPE (t
));
3216 STRIP_USELESS_TYPE_CONVERSION (sub
);
3217 subtype
= TREE_TYPE (sub
);
3218 if (!POINTER_TYPE_P (subtype
))
3221 if (TREE_CODE (sub
) == ADDR_EXPR
)
3223 tree op
= TREE_OPERAND (sub
, 0);
3224 tree optype
= TREE_TYPE (op
);
3226 if (lang_hooks
.types_compatible_p (type
, optype
))
3228 /* *(foo *)&fooarray => fooarray[0] */
3229 else if (TREE_CODE (optype
) == ARRAY_TYPE
3230 && lang_hooks
.types_compatible_p (type
, TREE_TYPE (optype
)))
3232 tree type_domain
= TYPE_DOMAIN (optype
);
3233 tree min_val
= size_zero_node
;
3234 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
3235 min_val
= TYPE_MIN_VALUE (type_domain
);
3236 return build4 (ARRAY_REF
, type
, op
, min_val
, NULL_TREE
, NULL_TREE
);
3240 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
3241 if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
3242 && lang_hooks
.types_compatible_p (type
, TREE_TYPE (TREE_TYPE (subtype
))))
3245 tree min_val
= size_zero_node
;
3247 sub
= fold_indirect_ref_rhs (sub
);
3249 sub
= build1 (INDIRECT_REF
, TREE_TYPE (subtype
), osub
);
3250 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
3251 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
3252 min_val
= TYPE_MIN_VALUE (type_domain
);
3253 return build4 (ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
, NULL_TREE
);
3259 /* Subroutine of gimplify_modify_expr to do simplifications of MODIFY_EXPRs
3260 based on the code of the RHS. We loop for as long as something changes. */
3262 static enum gimplify_status
3263 gimplify_modify_expr_rhs (tree
*expr_p
, tree
*from_p
, tree
*to_p
, tree
*pre_p
,
3264 tree
*post_p
, bool want_value
)
3266 enum gimplify_status ret
= GS_OK
;
3268 while (ret
!= GS_UNHANDLED
)
3269 switch (TREE_CODE (*from_p
))
3273 /* If we have code like
3277 where the type of "x" is a (possibly cv-qualified variant
3278 of "A"), treat the entire expression as identical to "x".
3279 This kind of code arises in C++ when an object is bound
3280 to a const reference, and if "x" is a TARGET_EXPR we want
3281 to take advantage of the optimization below. */
3282 tree t
= fold_indirect_ref_rhs (TREE_OPERAND (*from_p
, 0));
3295 /* If we are initializing something from a TARGET_EXPR, strip the
3296 TARGET_EXPR and initialize it directly, if possible. This can't
3297 be done if the initializer is void, since that implies that the
3298 temporary is set in some non-trivial way.
3300 ??? What about code that pulls out the temp and uses it
3301 elsewhere? I think that such code never uses the TARGET_EXPR as
3302 an initializer. If I'm wrong, we'll die because the temp won't
3303 have any RTL. In that case, I guess we'll need to replace
3304 references somehow. */
3305 tree init
= TARGET_EXPR_INITIAL (*from_p
);
3307 if (!VOID_TYPE_P (TREE_TYPE (init
)))
3318 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
3320 gimplify_compound_expr (from_p
, pre_p
, true);
3325 /* If we're initializing from a CONSTRUCTOR, break this into
3326 individual MODIFY_EXPRs. */
3327 return gimplify_init_constructor (expr_p
, pre_p
, post_p
, want_value
);
3330 /* If we're assigning to a non-register type, push the assignment
3331 down into the branches. This is mandatory for ADDRESSABLE types,
3332 since we cannot generate temporaries for such, but it saves a
3333 copy in other cases as well. */
3334 if (!is_gimple_reg_type (TREE_TYPE (*from_p
)))
3336 /* This code should mirror the code in gimplify_cond_expr. */
3337 enum tree_code code
= TREE_CODE (*expr_p
);
3338 tree cond
= *from_p
;
3339 tree result
= *to_p
;
3341 ret
= gimplify_expr (&result
, pre_p
, post_p
,
3342 is_gimple_min_lval
, fb_lvalue
);
3343 if (ret
!= GS_ERROR
)
3346 if (TREE_TYPE (TREE_OPERAND (cond
, 1)) != void_type_node
)
3347 TREE_OPERAND (cond
, 1)
3348 = build2 (code
, void_type_node
, result
,
3349 TREE_OPERAND (cond
, 1));
3350 if (TREE_TYPE (TREE_OPERAND (cond
, 2)) != void_type_node
)
3351 TREE_OPERAND (cond
, 2)
3352 = build2 (code
, void_type_node
, unshare_expr (result
),
3353 TREE_OPERAND (cond
, 2));
3355 TREE_TYPE (cond
) = void_type_node
;
3356 recalculate_side_effects (cond
);
3360 gimplify_and_add (cond
, pre_p
);
3361 *expr_p
= unshare_expr (result
);
3372 /* For calls that return in memory, give *to_p as the CALL_EXPR's
3373 return slot so that we don't generate a temporary. */
3374 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p
)
3375 && aggregate_value_p (*from_p
, *from_p
))
3379 if (!(rhs_predicate_for (*to_p
))(*from_p
))
3380 /* If we need a temporary, *to_p isn't accurate. */
3382 else if (TREE_CODE (*to_p
) == RESULT_DECL
3383 && DECL_NAME (*to_p
) == NULL_TREE
3384 && needs_to_live_in_memory (*to_p
))
3385 /* It's OK to use the return slot directly unless it's an NRV. */
3387 else if (is_gimple_reg_type (TREE_TYPE (*to_p
))
3388 || (DECL_P (*to_p
) && DECL_REGISTER (*to_p
)))
3389 /* Don't force regs into memory. */
3391 else if (TREE_CODE (*to_p
) == VAR_DECL
3392 && DECL_GIMPLE_FORMAL_TEMP_P (*to_p
))
3393 /* Don't use the original target if it's a formal temp; we
3394 don't want to take their addresses. */
3396 else if (TREE_CODE (*expr_p
) == INIT_EXPR
)
3397 /* It's OK to use the target directly if it's being
3400 else if (!is_gimple_non_addressable (*to_p
))
3401 /* Don't use the original target if it's already addressable;
3402 if its address escapes, and the called function uses the
3403 NRV optimization, a conforming program could see *to_p
3404 change before the called function returns; see c++/19317.
3405 When optimizing, the return_slot pass marks more functions
3406 as safe after we have escape info. */
3413 CALL_EXPR_RETURN_SLOT_OPT (*from_p
) = 1;
3414 lang_hooks
.mark_addressable (*to_p
);
3421 /* If we're initializing from a container, push the initialization
3423 case CLEANUP_POINT_EXPR
:
3425 case STATEMENT_LIST
:
3427 tree wrap
= *from_p
;
3430 ret
= gimplify_expr (to_p
, pre_p
, post_p
,
3431 is_gimple_min_lval
, fb_lvalue
);
3432 if (ret
!= GS_ERROR
)
3435 t
= voidify_wrapper_expr (wrap
, *expr_p
);
3436 gcc_assert (t
== *expr_p
);
3440 gimplify_and_add (wrap
, pre_p
);
3441 *expr_p
= unshare_expr (*to_p
);
3456 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
3457 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
3458 DECL_COMPLEX_GIMPLE_REG_P set. */
3460 static enum gimplify_status
3461 gimplify_modify_expr_complex_part (tree
*expr_p
, tree
*pre_p
, bool want_value
)
3463 enum tree_code code
, ocode
;
3464 tree lhs
, rhs
, new_rhs
, other
, realpart
, imagpart
;
3466 lhs
= TREE_OPERAND (*expr_p
, 0);
3467 rhs
= TREE_OPERAND (*expr_p
, 1);
3468 code
= TREE_CODE (lhs
);
3469 lhs
= TREE_OPERAND (lhs
, 0);
3471 ocode
= code
== REALPART_EXPR
? IMAGPART_EXPR
: REALPART_EXPR
;
3472 other
= build1 (ocode
, TREE_TYPE (rhs
), lhs
);
3473 other
= get_formal_tmp_var (other
, pre_p
);
3475 realpart
= code
== REALPART_EXPR
? rhs
: other
;
3476 imagpart
= code
== REALPART_EXPR
? other
: rhs
;
3478 if (TREE_CONSTANT (realpart
) && TREE_CONSTANT (imagpart
))
3479 new_rhs
= build_complex (TREE_TYPE (lhs
), realpart
, imagpart
);
3481 new_rhs
= build2 (COMPLEX_EXPR
, TREE_TYPE (lhs
), realpart
, imagpart
);
3483 TREE_OPERAND (*expr_p
, 0) = lhs
;
3484 TREE_OPERAND (*expr_p
, 1) = new_rhs
;
3488 append_to_statement_list (*expr_p
, pre_p
);
3495 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
3501 PRE_P points to the list where side effects that must happen before
3502 *EXPR_P should be stored.
3504 POST_P points to the list where side effects that must happen after
3505 *EXPR_P should be stored.
3507 WANT_VALUE is nonzero iff we want to use the value of this expression
3508 in another expression. */
3510 static enum gimplify_status
3511 gimplify_modify_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
, bool want_value
)
3513 tree
*from_p
= &TREE_OPERAND (*expr_p
, 1);
3514 tree
*to_p
= &TREE_OPERAND (*expr_p
, 0);
3515 enum gimplify_status ret
= GS_UNHANDLED
;
3517 gcc_assert (TREE_CODE (*expr_p
) == MODIFY_EXPR
3518 || TREE_CODE (*expr_p
) == INIT_EXPR
);
3520 /* For zero sized types only gimplify the left hand side and right hand side
3521 as statements and throw away the assignment. */
3522 if (zero_sized_type (TREE_TYPE (*from_p
)))
3524 gimplify_stmt (from_p
);
3525 gimplify_stmt (to_p
);
3526 append_to_statement_list (*from_p
, pre_p
);
3527 append_to_statement_list (*to_p
, pre_p
);
3528 *expr_p
= NULL_TREE
;
3532 /* See if any simplifications can be done based on what the RHS is. */
3533 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
3535 if (ret
!= GS_UNHANDLED
)
3538 /* If the value being copied is of variable width, compute the length
3539 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
3540 before gimplifying any of the operands so that we can resolve any
3541 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
3542 the size of the expression to be copied, not of the destination, so
3543 that is what we must here. */
3544 maybe_with_size_expr (from_p
);
3546 ret
= gimplify_expr (to_p
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
3547 if (ret
== GS_ERROR
)
3550 ret
= gimplify_expr (from_p
, pre_p
, post_p
,
3551 rhs_predicate_for (*to_p
), fb_rvalue
);
3552 if (ret
== GS_ERROR
)
3555 /* Now see if the above changed *from_p to something we handle specially. */
3556 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
3558 if (ret
!= GS_UNHANDLED
)
3561 /* If we've got a variable sized assignment between two lvalues (i.e. does
3562 not involve a call), then we can make things a bit more straightforward
3563 by converting the assignment to memcpy or memset. */
3564 if (TREE_CODE (*from_p
) == WITH_SIZE_EXPR
)
3566 tree from
= TREE_OPERAND (*from_p
, 0);
3567 tree size
= TREE_OPERAND (*from_p
, 1);
3569 if (TREE_CODE (from
) == CONSTRUCTOR
)
3570 return gimplify_modify_expr_to_memset (expr_p
, size
, want_value
);
3571 if (is_gimple_addressable (from
))
3574 return gimplify_modify_expr_to_memcpy (expr_p
, size
, want_value
);
3578 /* Transform partial stores to non-addressable complex variables into
3579 total stores. This allows us to use real instead of virtual operands
3580 for these variables, which improves optimization. */
3581 if ((TREE_CODE (*to_p
) == REALPART_EXPR
3582 || TREE_CODE (*to_p
) == IMAGPART_EXPR
)
3583 && is_gimple_reg (TREE_OPERAND (*to_p
, 0)))
3584 return gimplify_modify_expr_complex_part (expr_p
, pre_p
, want_value
);
3586 if (gimplify_ctxp
->into_ssa
&& is_gimple_reg (*to_p
))
3588 /* If we've somehow already got an SSA_NAME on the LHS, then
3589 we're probably modified it twice. Not good. */
3590 gcc_assert (TREE_CODE (*to_p
) != SSA_NAME
);
3591 *to_p
= make_ssa_name (*to_p
, *expr_p
);
3596 append_to_statement_list (*expr_p
, pre_p
);
3604 /* Gimplify a comparison between two variable-sized objects. Do this
3605 with a call to BUILT_IN_MEMCMP. */
3607 static enum gimplify_status
3608 gimplify_variable_sized_compare (tree
*expr_p
)
3610 tree op0
= TREE_OPERAND (*expr_p
, 0);
3611 tree op1
= TREE_OPERAND (*expr_p
, 1);
3614 t
= TYPE_SIZE_UNIT (TREE_TYPE (op0
));
3615 t
= unshare_expr (t
);
3616 t
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (t
, op0
);
3617 args
= tree_cons (NULL
, t
, NULL
);
3618 t
= build_fold_addr_expr (op1
);
3619 args
= tree_cons (NULL
, t
, args
);
3620 dest
= build_fold_addr_expr (op0
);
3621 args
= tree_cons (NULL
, dest
, args
);
3622 t
= implicit_built_in_decls
[BUILT_IN_MEMCMP
];
3623 t
= build_function_call_expr (t
, args
);
3625 = build2 (TREE_CODE (*expr_p
), TREE_TYPE (*expr_p
), t
, integer_zero_node
);
3630 /* Gimplify a comparison between two aggregate objects of integral scalar
3631 mode as a comparison between the bitwise equivalent scalar values. */
3633 static enum gimplify_status
3634 gimplify_scalar_mode_aggregate_compare (tree
*expr_p
)
3636 tree op0
= TREE_OPERAND (*expr_p
, 0);
3637 tree op1
= TREE_OPERAND (*expr_p
, 1);
3639 tree type
= TREE_TYPE (op0
);
3640 tree scalar_type
= lang_hooks
.types
.type_for_mode (TYPE_MODE (type
), 1);
3642 op0
= fold_build1 (VIEW_CONVERT_EXPR
, scalar_type
, op0
);
3643 op1
= fold_build1 (VIEW_CONVERT_EXPR
, scalar_type
, op1
);
3646 = fold_build2 (TREE_CODE (*expr_p
), TREE_TYPE (*expr_p
), op0
, op1
);
3651 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
3652 points to the expression to gimplify.
3654 Expressions of the form 'a && b' are gimplified to:
3656 a && b ? true : false
3658 gimplify_cond_expr will do the rest.
3660 PRE_P points to the list where side effects that must happen before
3661 *EXPR_P should be stored. */
3663 static enum gimplify_status
3664 gimplify_boolean_expr (tree
*expr_p
)
3666 /* Preserve the original type of the expression. */
3667 tree type
= TREE_TYPE (*expr_p
);
3669 *expr_p
= build3 (COND_EXPR
, type
, *expr_p
,
3670 fold_convert (type
, boolean_true_node
),
3671 fold_convert (type
, boolean_false_node
));
3676 /* Gimplifies an expression sequence. This function gimplifies each
3677 expression and re-writes the original expression with the last
3678 expression of the sequence in GIMPLE form.
3680 PRE_P points to the list where the side effects for all the
3681 expressions in the sequence will be emitted.
3683 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
3684 /* ??? Should rearrange to share the pre-queue with all the indirect
3685 invocations of gimplify_expr. Would probably save on creations
3686 of statement_list nodes. */
3688 static enum gimplify_status
3689 gimplify_compound_expr (tree
*expr_p
, tree
*pre_p
, bool want_value
)
3695 tree
*sub_p
= &TREE_OPERAND (t
, 0);
3697 if (TREE_CODE (*sub_p
) == COMPOUND_EXPR
)
3698 gimplify_compound_expr (sub_p
, pre_p
, false);
3700 gimplify_stmt (sub_p
);
3701 append_to_statement_list (*sub_p
, pre_p
);
3703 t
= TREE_OPERAND (t
, 1);
3705 while (TREE_CODE (t
) == COMPOUND_EXPR
);
3712 gimplify_stmt (expr_p
);
3717 /* Gimplifies a statement list. These may be created either by an
3718 enlightened front-end, or by shortcut_cond_expr. */
3720 static enum gimplify_status
3721 gimplify_statement_list (tree
*expr_p
, tree
*pre_p
)
3723 tree temp
= voidify_wrapper_expr (*expr_p
, NULL
);
3725 tree_stmt_iterator i
= tsi_start (*expr_p
);
3727 while (!tsi_end_p (i
))
3731 gimplify_stmt (tsi_stmt_ptr (i
));
3736 else if (TREE_CODE (t
) == STATEMENT_LIST
)
3738 tsi_link_before (&i
, t
, TSI_SAME_STMT
);
3747 append_to_statement_list (*expr_p
, pre_p
);
3755 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
3756 gimplify. After gimplification, EXPR_P will point to a new temporary
3757 that holds the original value of the SAVE_EXPR node.
3759 PRE_P points to the list where side effects that must happen before
3760 *EXPR_P should be stored. */
3762 static enum gimplify_status
3763 gimplify_save_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
3765 enum gimplify_status ret
= GS_ALL_DONE
;
3768 gcc_assert (TREE_CODE (*expr_p
) == SAVE_EXPR
);
3769 val
= TREE_OPERAND (*expr_p
, 0);
3771 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
3772 if (!SAVE_EXPR_RESOLVED_P (*expr_p
))
3774 /* The operand may be a void-valued expression such as SAVE_EXPRs
3775 generated by the Java frontend for class initialization. It is
3776 being executed only for its side-effects. */
3777 if (TREE_TYPE (val
) == void_type_node
)
3779 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
3780 is_gimple_stmt
, fb_none
);
3781 append_to_statement_list (TREE_OPERAND (*expr_p
, 0), pre_p
);
3785 val
= get_initialized_tmp_var (val
, pre_p
, post_p
);
3787 TREE_OPERAND (*expr_p
, 0) = val
;
3788 SAVE_EXPR_RESOLVED_P (*expr_p
) = 1;
3796 /* Re-write the ADDR_EXPR node pointed to by EXPR_P
3803 PRE_P points to the list where side effects that must happen before
3804 *EXPR_P should be stored.
3806 POST_P points to the list where side effects that must happen after
3807 *EXPR_P should be stored. */
3809 static enum gimplify_status
3810 gimplify_addr_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
3812 tree expr
= *expr_p
;
3813 tree op0
= TREE_OPERAND (expr
, 0);
3814 enum gimplify_status ret
;
3816 switch (TREE_CODE (op0
))
3819 case MISALIGNED_INDIRECT_REF
:
3821 /* Check if we are dealing with an expression of the form '&*ptr'.
3822 While the front end folds away '&*ptr' into 'ptr', these
3823 expressions may be generated internally by the compiler (e.g.,
3824 builtins like __builtin_va_end). */
3825 /* Caution: the silent array decomposition semantics we allow for
3826 ADDR_EXPR means we can't always discard the pair. */
3827 /* Gimplification of the ADDR_EXPR operand may drop
3828 cv-qualification conversions, so make sure we add them if
3831 tree op00
= TREE_OPERAND (op0
, 0);
3832 tree t_expr
= TREE_TYPE (expr
);
3833 tree t_op00
= TREE_TYPE (op00
);
3835 if (!lang_hooks
.types_compatible_p (t_expr
, t_op00
))
3837 #ifdef ENABLE_CHECKING
3838 tree t_op0
= TREE_TYPE (op0
);
3839 gcc_assert (POINTER_TYPE_P (t_expr
)
3840 && cpt_same_type (TREE_CODE (t_op0
) == ARRAY_TYPE
3841 ? TREE_TYPE (t_op0
) : t_op0
,
3843 && POINTER_TYPE_P (t_op00
)
3844 && cpt_same_type (t_op0
, TREE_TYPE (t_op00
)));
3846 op00
= fold_convert (TREE_TYPE (expr
), op00
);
3853 case VIEW_CONVERT_EXPR
:
3854 /* Take the address of our operand and then convert it to the type of
3857 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
3858 all clear. The impact of this transformation is even less clear. */
3860 /* If the operand is a useless conversion, look through it. Doing so
3861 guarantees that the ADDR_EXPR and its operand will remain of the
3863 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0
, 0)))
3864 op0
= TREE_OPERAND (op0
, 0);
3866 *expr_p
= fold_convert (TREE_TYPE (expr
),
3867 build_fold_addr_expr (TREE_OPERAND (op0
, 0)));
3872 /* We use fb_either here because the C frontend sometimes takes
3873 the address of a call that returns a struct; see
3874 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
3875 the implied temporary explicit. */
3876 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, post_p
,
3877 is_gimple_addressable
, fb_either
);
3878 if (ret
!= GS_ERROR
)
3880 op0
= TREE_OPERAND (expr
, 0);
3882 /* For various reasons, the gimplification of the expression
3883 may have made a new INDIRECT_REF. */
3884 if (TREE_CODE (op0
) == INDIRECT_REF
)
3885 goto do_indirect_ref
;
3887 /* Make sure TREE_INVARIANT, TREE_CONSTANT, and TREE_SIDE_EFFECTS
3889 recompute_tree_invariant_for_addr_expr (expr
);
3891 /* Mark the RHS addressable. */
3892 lang_hooks
.mark_addressable (TREE_OPERAND (expr
, 0));
3900 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
3901 value; output operands should be a gimple lvalue. */
3903 static enum gimplify_status
3904 gimplify_asm_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
3906 tree expr
= *expr_p
;
3907 int noutputs
= list_length (ASM_OUTPUTS (expr
));
3908 const char **oconstraints
3909 = (const char **) alloca ((noutputs
) * sizeof (const char *));
3912 const char *constraint
;
3913 bool allows_mem
, allows_reg
, is_inout
;
3914 enum gimplify_status ret
, tret
;
3917 for (i
= 0, link
= ASM_OUTPUTS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
3919 size_t constraint_len
;
3920 oconstraints
[i
] = constraint
3921 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
3922 constraint_len
= strlen (constraint
);
3923 if (constraint_len
== 0)
3926 parse_output_constraint (&constraint
, i
, 0, 0,
3927 &allows_mem
, &allows_reg
, &is_inout
);
3929 if (!allows_reg
&& allows_mem
)
3930 lang_hooks
.mark_addressable (TREE_VALUE (link
));
3932 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
3933 is_inout
? is_gimple_min_lval
: is_gimple_lvalue
,
3934 fb_lvalue
| fb_mayfail
);
3935 if (tret
== GS_ERROR
)
3937 error ("invalid lvalue in asm output %d", i
);
3943 /* An input/output operand. To give the optimizers more
3944 flexibility, split it into separate input and output
3949 /* Turn the in/out constraint into an output constraint. */
3950 char *p
= xstrdup (constraint
);
3952 TREE_VALUE (TREE_PURPOSE (link
)) = build_string (constraint_len
, p
);
3954 /* And add a matching input constraint. */
3957 sprintf (buf
, "%d", i
);
3959 /* If there are multiple alternatives in the constraint,
3960 handle each of them individually. Those that allow register
3961 will be replaced with operand number, the others will stay
3963 if (strchr (p
, ',') != NULL
)
3965 size_t len
= 0, buflen
= strlen (buf
);
3966 char *beg
, *end
, *str
, *dst
;
3970 end
= strchr (beg
, ',');
3972 end
= strchr (beg
, '\0');
3973 if ((size_t) (end
- beg
) < buflen
)
3976 len
+= end
- beg
+ 1;
3983 str
= (char *) alloca (len
);
3984 for (beg
= p
+ 1, dst
= str
;;)
3987 bool mem_p
, reg_p
, inout_p
;
3989 end
= strchr (beg
, ',');
3994 parse_output_constraint (&tem
, i
, 0, 0,
3995 &mem_p
, ®_p
, &inout_p
);
4000 memcpy (dst
, buf
, buflen
);
4009 memcpy (dst
, beg
, len
);
4018 input
= build_string (dst
- str
, str
);
4021 input
= build_string (strlen (buf
), buf
);
4024 input
= build_string (constraint_len
- 1, constraint
+ 1);
4028 input
= build_tree_list (build_tree_list (NULL_TREE
, input
),
4029 unshare_expr (TREE_VALUE (link
)));
4030 ASM_INPUTS (expr
) = chainon (ASM_INPUTS (expr
), input
);
4034 for (link
= ASM_INPUTS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
4037 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
4038 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
4039 oconstraints
, &allows_mem
, &allows_reg
);
4041 /* If the operand is a memory input, it should be an lvalue. */
4042 if (!allows_reg
&& allows_mem
)
4044 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
4045 is_gimple_lvalue
, fb_lvalue
| fb_mayfail
);
4046 lang_hooks
.mark_addressable (TREE_VALUE (link
));
4047 if (tret
== GS_ERROR
)
4049 error ("memory input %d is not directly addressable", i
);
4055 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
4056 is_gimple_asm_val
, fb_rvalue
);
4057 if (tret
== GS_ERROR
)
4065 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
4066 WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
4067 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
4068 return to this function.
4070 FIXME should we complexify the prequeue handling instead? Or use flags
4071 for all the cleanups and let the optimizer tighten them up? The current
4072 code seems pretty fragile; it will break on a cleanup within any
4073 non-conditional nesting. But any such nesting would be broken, anyway;
4074 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
4075 and continues out of it. We can do that at the RTL level, though, so
4076 having an optimizer to tighten up try/finally regions would be a Good
4079 static enum gimplify_status
4080 gimplify_cleanup_point_expr (tree
*expr_p
, tree
*pre_p
)
4082 tree_stmt_iterator iter
;
4085 tree temp
= voidify_wrapper_expr (*expr_p
, NULL
);
4087 /* We only care about the number of conditions between the innermost
4088 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
4089 any cleanups collected outside the CLEANUP_POINT_EXPR. */
4090 int old_conds
= gimplify_ctxp
->conditions
;
4091 tree old_cleanups
= gimplify_ctxp
->conditional_cleanups
;
4092 gimplify_ctxp
->conditions
= 0;
4093 gimplify_ctxp
->conditional_cleanups
= NULL_TREE
;
4095 body
= TREE_OPERAND (*expr_p
, 0);
4096 gimplify_to_stmt_list (&body
);
4098 gimplify_ctxp
->conditions
= old_conds
;
4099 gimplify_ctxp
->conditional_cleanups
= old_cleanups
;
4101 for (iter
= tsi_start (body
); !tsi_end_p (iter
); )
4103 tree
*wce_p
= tsi_stmt_ptr (iter
);
4106 if (TREE_CODE (wce
) == WITH_CLEANUP_EXPR
)
4108 if (tsi_one_before_end_p (iter
))
4110 tsi_link_before (&iter
, TREE_OPERAND (wce
, 0), TSI_SAME_STMT
);
4117 enum tree_code code
;
4119 if (CLEANUP_EH_ONLY (wce
))
4120 code
= TRY_CATCH_EXPR
;
4122 code
= TRY_FINALLY_EXPR
;
4124 sl
= tsi_split_statement_list_after (&iter
);
4125 tfe
= build2 (code
, void_type_node
, sl
, NULL_TREE
);
4126 append_to_statement_list (TREE_OPERAND (wce
, 0),
4127 &TREE_OPERAND (tfe
, 1));
4129 iter
= tsi_start (sl
);
4139 append_to_statement_list (body
, pre_p
);
4149 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
4150 is the cleanup action required. */
4153 gimple_push_cleanup (tree var
, tree cleanup
, bool eh_only
, tree
*pre_p
)
4157 /* Errors can result in improperly nested cleanups. Which results in
4158 confusion when trying to resolve the WITH_CLEANUP_EXPR. */
4159 if (errorcount
|| sorrycount
)
4162 if (gimple_conditional_context ())
4164 /* If we're in a conditional context, this is more complex. We only
4165 want to run the cleanup if we actually ran the initialization that
4166 necessitates it, but we want to run it after the end of the
4167 conditional context. So we wrap the try/finally around the
4168 condition and use a flag to determine whether or not to actually
4169 run the destructor. Thus
4173 becomes (approximately)
4177 if (test) { A::A(temp); flag = 1; val = f(temp); }
4180 if (flag) A::~A(temp);
4185 tree flag
= create_tmp_var (boolean_type_node
, "cleanup");
4186 tree ffalse
= build2 (MODIFY_EXPR
, void_type_node
, flag
,
4187 boolean_false_node
);
4188 tree ftrue
= build2 (MODIFY_EXPR
, void_type_node
, flag
,
4190 cleanup
= build3 (COND_EXPR
, void_type_node
, flag
, cleanup
, NULL
);
4191 wce
= build1 (WITH_CLEANUP_EXPR
, void_type_node
, cleanup
);
4192 append_to_statement_list (ffalse
, &gimplify_ctxp
->conditional_cleanups
);
4193 append_to_statement_list (wce
, &gimplify_ctxp
->conditional_cleanups
);
4194 append_to_statement_list (ftrue
, pre_p
);
4196 /* Because of this manipulation, and the EH edges that jump
4197 threading cannot redirect, the temporary (VAR) will appear
4198 to be used uninitialized. Don't warn. */
4199 TREE_NO_WARNING (var
) = 1;
4203 wce
= build1 (WITH_CLEANUP_EXPR
, void_type_node
, cleanup
);
4204 CLEANUP_EH_ONLY (wce
) = eh_only
;
4205 append_to_statement_list (wce
, pre_p
);
4208 gimplify_stmt (&TREE_OPERAND (wce
, 0));
4211 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
4213 static enum gimplify_status
4214 gimplify_target_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
4216 tree targ
= *expr_p
;
4217 tree temp
= TARGET_EXPR_SLOT (targ
);
4218 tree init
= TARGET_EXPR_INITIAL (targ
);
4219 enum gimplify_status ret
;
4223 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
4224 to the temps list. */
4225 gimple_add_tmp_var (temp
);
4227 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
4228 expression is supposed to initialize the slot. */
4229 if (VOID_TYPE_P (TREE_TYPE (init
)))
4230 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
, fb_none
);
4233 init
= build2 (INIT_EXPR
, void_type_node
, temp
, init
);
4234 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
,
4237 if (ret
== GS_ERROR
)
4239 append_to_statement_list (init
, pre_p
);
4241 /* If needed, push the cleanup for the temp. */
4242 if (TARGET_EXPR_CLEANUP (targ
))
4244 gimplify_stmt (&TARGET_EXPR_CLEANUP (targ
));
4245 gimple_push_cleanup (temp
, TARGET_EXPR_CLEANUP (targ
),
4246 CLEANUP_EH_ONLY (targ
), pre_p
);
4249 /* Only expand this once. */
4250 TREE_OPERAND (targ
, 3) = init
;
4251 TARGET_EXPR_INITIAL (targ
) = NULL_TREE
;
4254 /* We should have expanded this before. */
4255 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp
));
4261 /* Gimplification of expression trees. */
4263 /* Gimplify an expression which appears at statement context; usually, this
4264 means replacing it with a suitably gimple STATEMENT_LIST. */
4267 gimplify_stmt (tree
*stmt_p
)
4269 gimplify_expr (stmt_p
, NULL
, NULL
, is_gimple_stmt
, fb_none
);
4272 /* Similarly, but force the result to be a STATEMENT_LIST. */
4275 gimplify_to_stmt_list (tree
*stmt_p
)
4277 gimplify_stmt (stmt_p
);
4279 *stmt_p
= alloc_stmt_list ();
4280 else if (TREE_CODE (*stmt_p
) != STATEMENT_LIST
)
4283 *stmt_p
= alloc_stmt_list ();
4284 append_to_statement_list (t
, stmt_p
);
4289 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
4290 to CTX. If entries already exist, force them to be some flavor of private.
4291 If there is no enclosing parallel, do nothing. */
4294 omp_firstprivatize_variable (struct gimplify_omp_ctx
*ctx
, tree decl
)
4298 if (decl
== NULL
|| !DECL_P (decl
))
4303 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
4306 if (n
->value
& GOVD_SHARED
)
4307 n
->value
= GOVD_FIRSTPRIVATE
| (n
->value
& GOVD_SEEN
);
4311 else if (ctx
->is_parallel
)
4312 omp_add_variable (ctx
, decl
, GOVD_FIRSTPRIVATE
);
4314 ctx
= ctx
->outer_context
;
4319 /* Similarly for each of the type sizes of TYPE. */
4322 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx
*ctx
, tree type
)
4324 if (type
== NULL
|| type
== error_mark_node
)
4326 type
= TYPE_MAIN_VARIANT (type
);
4328 if (pointer_set_insert (ctx
->privatized_types
, type
))
4331 switch (TREE_CODE (type
))
4337 omp_firstprivatize_variable (ctx
, TYPE_MIN_VALUE (type
));
4338 omp_firstprivatize_variable (ctx
, TYPE_MAX_VALUE (type
));
4342 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
4343 omp_firstprivatize_type_sizes (ctx
, TYPE_DOMAIN (type
));
4348 case QUAL_UNION_TYPE
:
4351 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
4352 if (TREE_CODE (field
) == FIELD_DECL
)
4354 omp_firstprivatize_variable (ctx
, DECL_FIELD_OFFSET (field
));
4355 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (field
));
4361 case REFERENCE_TYPE
:
4362 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
4369 omp_firstprivatize_variable (ctx
, TYPE_SIZE (type
));
4370 omp_firstprivatize_variable (ctx
, TYPE_SIZE_UNIT (type
));
4371 lang_hooks
.types
.omp_firstprivatize_type_sizes (ctx
, type
);
4374 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
4377 omp_add_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, unsigned int flags
)
4380 unsigned int nflags
;
4383 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
4386 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
4387 there are constructors involved somewhere. */
4388 if (TREE_ADDRESSABLE (TREE_TYPE (decl
))
4389 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
4392 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
4395 /* We shouldn't be re-adding the decl with the same data
4397 gcc_assert ((n
->value
& GOVD_DATA_SHARE_CLASS
& flags
) == 0);
4398 /* The only combination of data sharing classes we should see is
4399 FIRSTPRIVATE and LASTPRIVATE. */
4400 nflags
= n
->value
| flags
;
4401 gcc_assert ((nflags
& GOVD_DATA_SHARE_CLASS
)
4402 == (GOVD_FIRSTPRIVATE
| GOVD_LASTPRIVATE
));
4407 /* When adding a variable-sized variable, we have to handle all sorts
4408 of additional bits of data: the pointer replacement variable, and
4409 the parameters of the type. */
4410 if (DECL_SIZE (decl
) && TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
4412 /* Add the pointer replacement variable as PRIVATE if the variable
4413 replacement is private, else FIRSTPRIVATE since we'll need the
4414 address of the original variable either for SHARED, or for the
4415 copy into or out of the context. */
4416 if (!(flags
& GOVD_LOCAL
))
4418 nflags
= flags
& GOVD_PRIVATE
? GOVD_PRIVATE
: GOVD_FIRSTPRIVATE
;
4419 nflags
|= flags
& GOVD_SEEN
;
4420 t
= DECL_VALUE_EXPR (decl
);
4421 gcc_assert (TREE_CODE (t
) == INDIRECT_REF
);
4422 t
= TREE_OPERAND (t
, 0);
4423 gcc_assert (DECL_P (t
));
4424 omp_add_variable (ctx
, t
, nflags
);
4427 /* Add all of the variable and type parameters (which should have
4428 been gimplified to a formal temporary) as FIRSTPRIVATE. */
4429 omp_firstprivatize_variable (ctx
, DECL_SIZE_UNIT (decl
));
4430 omp_firstprivatize_variable (ctx
, DECL_SIZE (decl
));
4431 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
4433 /* The variable-sized variable itself is never SHARED, only some form
4434 of PRIVATE. The sharing would take place via the pointer variable
4435 which we remapped above. */
4436 if (flags
& GOVD_SHARED
)
4437 flags
= GOVD_PRIVATE
| GOVD_DEBUG_PRIVATE
4438 | (flags
& (GOVD_SEEN
| GOVD_EXPLICIT
));
4440 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
4441 alloca statement we generate for the variable, so make sure it
4442 is available. This isn't automatically needed for the SHARED
4443 case, since we won't be allocating local storage then. */
4445 omp_notice_variable (ctx
, TYPE_SIZE_UNIT (TREE_TYPE (decl
)), true);
4447 else if (lang_hooks
.decls
.omp_privatize_by_reference (decl
))
4449 gcc_assert ((flags
& GOVD_LOCAL
) == 0);
4450 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
4452 /* Similar to the direct variable sized case above, we'll need the
4453 size of references being privatized. */
4454 if ((flags
& GOVD_SHARED
) == 0)
4456 t
= TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl
)));
4457 if (TREE_CODE (t
) != INTEGER_CST
)
4458 omp_notice_variable (ctx
, t
, true);
4462 splay_tree_insert (ctx
->variables
, (splay_tree_key
)decl
, flags
);
4465 /* Record the fact that DECL was used within the OpenMP context CTX.
4466 IN_CODE is true when real code uses DECL, and false when we should
4467 merely emit default(none) errors. Return true if DECL is going to
4468 be remapped and thus DECL shouldn't be gimplified into its
4469 DECL_VALUE_EXPR (if any). */
4472 omp_notice_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, bool in_code
)
4475 unsigned flags
= in_code
? GOVD_SEEN
: 0;
4476 bool ret
= false, shared
;
4478 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
4481 /* Threadprivate variables are predetermined. */
4482 if (is_global_var (decl
))
4484 if (DECL_THREAD_LOCAL_P (decl
))
4487 if (DECL_HAS_VALUE_EXPR_P (decl
))
4489 tree value
= get_base_address (DECL_VALUE_EXPR (decl
));
4491 if (value
&& DECL_P (value
) && DECL_THREAD_LOCAL_P (value
))
4496 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
4499 enum omp_clause_default_kind default_kind
, kind
;
4501 if (!ctx
->is_parallel
)
4504 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
4505 remapped firstprivate instead of shared. To some extent this is
4506 addressed in omp_firstprivatize_type_sizes, but not effectively. */
4507 default_kind
= ctx
->default_kind
;
4508 kind
= lang_hooks
.decls
.omp_predetermined_sharing (decl
);
4509 if (kind
!= OMP_CLAUSE_DEFAULT_UNSPECIFIED
)
4510 default_kind
= kind
;
4512 switch (default_kind
)
4514 case OMP_CLAUSE_DEFAULT_NONE
:
4515 error ("%qs not specified in enclosing parallel",
4516 IDENTIFIER_POINTER (DECL_NAME (decl
)));
4517 error ("%Henclosing parallel", &ctx
->location
);
4519 case OMP_CLAUSE_DEFAULT_SHARED
:
4520 flags
|= GOVD_SHARED
;
4522 case OMP_CLAUSE_DEFAULT_PRIVATE
:
4523 flags
|= GOVD_PRIVATE
;
4529 omp_add_variable (ctx
, decl
, flags
);
4531 shared
= (flags
& GOVD_SHARED
) != 0;
4532 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
4536 shared
= ((flags
| n
->value
) & GOVD_SHARED
) != 0;
4537 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
4539 /* If nothing changed, there's nothing left to do. */
4540 if ((n
->value
& flags
) == flags
)
4546 /* If the variable is private in the current context, then we don't
4547 need to propagate anything to an outer context. */
4548 if (flags
& GOVD_PRIVATE
)
4550 if (ctx
->outer_context
4551 && omp_notice_variable (ctx
->outer_context
, decl
, in_code
))
4556 /* Verify that DECL is private within CTX. If there's specific information
4557 to the contrary in the innermost scope, generate an error. */
4560 omp_is_private (struct gimplify_omp_ctx
*ctx
, tree decl
)
4564 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
4567 if (n
->value
& GOVD_SHARED
)
4569 if (ctx
== gimplify_omp_ctxp
)
4571 error ("iteration variable %qs should be private",
4572 IDENTIFIER_POINTER (DECL_NAME (decl
)));
4573 n
->value
= GOVD_PRIVATE
;
4579 else if ((n
->value
& GOVD_EXPLICIT
) != 0
4580 && (ctx
== gimplify_omp_ctxp
4581 || (ctx
->is_combined_parallel
4582 && gimplify_omp_ctxp
->outer_context
== ctx
)))
4584 if ((n
->value
& GOVD_FIRSTPRIVATE
) != 0)
4585 error ("iteration variable %qs should not be firstprivate",
4586 IDENTIFIER_POINTER (DECL_NAME (decl
)));
4587 else if ((n
->value
& GOVD_REDUCTION
) != 0)
4588 error ("iteration variable %qs should not be reduction",
4589 IDENTIFIER_POINTER (DECL_NAME (decl
)));
4594 if (ctx
->is_parallel
)
4596 else if (ctx
->outer_context
)
4597 return omp_is_private (ctx
->outer_context
, decl
);
4599 return !is_global_var (decl
);
4602 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
4603 and previous omp contexts. */
4606 gimplify_scan_omp_clauses (tree
*list_p
, tree
*pre_p
, bool in_parallel
,
4607 bool in_combined_parallel
)
4609 struct gimplify_omp_ctx
*ctx
, *outer_ctx
;
4612 ctx
= new_omp_context (in_parallel
, in_combined_parallel
);
4613 outer_ctx
= ctx
->outer_context
;
4615 while ((c
= *list_p
) != NULL
)
4617 enum gimplify_status gs
;
4618 bool remove
= false;
4619 bool notice_outer
= true;
4623 switch (OMP_CLAUSE_CODE (c
))
4625 case OMP_CLAUSE_PRIVATE
:
4626 flags
= GOVD_PRIVATE
| GOVD_EXPLICIT
;
4627 notice_outer
= false;
4629 case OMP_CLAUSE_SHARED
:
4630 flags
= GOVD_SHARED
| GOVD_EXPLICIT
;
4632 case OMP_CLAUSE_FIRSTPRIVATE
:
4633 flags
= GOVD_FIRSTPRIVATE
| GOVD_EXPLICIT
;
4635 case OMP_CLAUSE_LASTPRIVATE
:
4636 flags
= GOVD_LASTPRIVATE
| GOVD_SEEN
| GOVD_EXPLICIT
;
4638 case OMP_CLAUSE_REDUCTION
:
4639 flags
= GOVD_REDUCTION
| GOVD_SEEN
| GOVD_EXPLICIT
;
4643 decl
= OMP_CLAUSE_DECL (c
);
4644 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
4649 /* Handle NRV results passed by reference. */
4650 if (TREE_CODE (decl
) == INDIRECT_REF
4651 && TREE_CODE (TREE_OPERAND (decl
, 0)) == RESULT_DECL
4652 && DECL_BY_REFERENCE (TREE_OPERAND (decl
, 0)))
4653 OMP_CLAUSE_DECL (c
) = decl
= TREE_OPERAND (decl
, 0);
4654 omp_add_variable (ctx
, decl
, flags
);
4655 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
4656 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
))
4658 omp_add_variable (ctx
, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
),
4659 GOVD_LOCAL
| GOVD_SEEN
);
4660 gimplify_omp_ctxp
= ctx
;
4661 push_gimplify_context ();
4662 gimplify_stmt (&OMP_CLAUSE_REDUCTION_INIT (c
));
4663 pop_gimplify_context (OMP_CLAUSE_REDUCTION_INIT (c
));
4664 push_gimplify_context ();
4665 gimplify_stmt (&OMP_CLAUSE_REDUCTION_MERGE (c
));
4666 pop_gimplify_context (OMP_CLAUSE_REDUCTION_MERGE (c
));
4667 gimplify_omp_ctxp
= outer_ctx
;
4673 case OMP_CLAUSE_COPYIN
:
4674 case OMP_CLAUSE_COPYPRIVATE
:
4675 decl
= OMP_CLAUSE_DECL (c
);
4676 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
4681 /* Handle NRV results passed by reference. */
4682 if (TREE_CODE (decl
) == INDIRECT_REF
4683 && TREE_CODE (TREE_OPERAND (decl
, 0)) == RESULT_DECL
4684 && DECL_BY_REFERENCE (TREE_OPERAND (decl
, 0)))
4685 OMP_CLAUSE_DECL (c
) = decl
= TREE_OPERAND (decl
, 0);
4688 omp_notice_variable (outer_ctx
, decl
, true);
4692 OMP_CLAUSE_OPERAND (c
, 0)
4693 = gimple_boolify (OMP_CLAUSE_OPERAND (c
, 0));
4696 case OMP_CLAUSE_SCHEDULE
:
4697 case OMP_CLAUSE_NUM_THREADS
:
4698 gs
= gimplify_expr (&OMP_CLAUSE_OPERAND (c
, 0), pre_p
, NULL
,
4699 is_gimple_val
, fb_rvalue
);
4704 case OMP_CLAUSE_NOWAIT
:
4705 case OMP_CLAUSE_ORDERED
:
4708 case OMP_CLAUSE_DEFAULT
:
4709 ctx
->default_kind
= OMP_CLAUSE_DEFAULT_KIND (c
);
4717 *list_p
= OMP_CLAUSE_CHAIN (c
);
4719 list_p
= &OMP_CLAUSE_CHAIN (c
);
4722 gimplify_omp_ctxp
= ctx
;
4725 /* For all variables that were not actually used within the context,
4726 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
4729 gimplify_adjust_omp_clauses_1 (splay_tree_node n
, void *data
)
4731 tree
*list_p
= (tree
*) data
;
4732 tree decl
= (tree
) n
->key
;
4733 unsigned flags
= n
->value
;
4734 enum omp_clause_code code
;
4738 if (flags
& (GOVD_EXPLICIT
| GOVD_LOCAL
))
4740 if ((flags
& GOVD_SEEN
) == 0)
4742 if (flags
& GOVD_DEBUG_PRIVATE
)
4744 gcc_assert ((flags
& GOVD_DATA_SHARE_CLASS
) == GOVD_PRIVATE
);
4745 private_debug
= true;
4749 = lang_hooks
.decls
.omp_private_debug_clause (decl
,
4750 !!(flags
& GOVD_SHARED
));
4752 code
= OMP_CLAUSE_PRIVATE
;
4753 else if (flags
& GOVD_SHARED
)
4755 if (is_global_var (decl
))
4757 code
= OMP_CLAUSE_SHARED
;
4759 else if (flags
& GOVD_PRIVATE
)
4760 code
= OMP_CLAUSE_PRIVATE
;
4761 else if (flags
& GOVD_FIRSTPRIVATE
)
4762 code
= OMP_CLAUSE_FIRSTPRIVATE
;
4766 clause
= build_omp_clause (code
);
4767 OMP_CLAUSE_DECL (clause
) = decl
;
4768 OMP_CLAUSE_CHAIN (clause
) = *list_p
;
4770 OMP_CLAUSE_PRIVATE_DEBUG (clause
) = 1;
4777 gimplify_adjust_omp_clauses (tree
*list_p
)
4779 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
4782 while ((c
= *list_p
) != NULL
)
4785 bool remove
= false;
4787 switch (OMP_CLAUSE_CODE (c
))
4789 case OMP_CLAUSE_PRIVATE
:
4790 case OMP_CLAUSE_SHARED
:
4791 case OMP_CLAUSE_FIRSTPRIVATE
:
4792 decl
= OMP_CLAUSE_DECL (c
);
4793 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
4794 remove
= !(n
->value
& GOVD_SEEN
);
4797 bool shared
= OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_SHARED
;
4798 if ((n
->value
& GOVD_DEBUG_PRIVATE
)
4799 || lang_hooks
.decls
.omp_private_debug_clause (decl
, shared
))
4801 gcc_assert ((n
->value
& GOVD_DEBUG_PRIVATE
) == 0
4802 || ((n
->value
& GOVD_DATA_SHARE_CLASS
)
4804 OMP_CLAUSE_SET_CODE (c
, OMP_CLAUSE_PRIVATE
);
4805 OMP_CLAUSE_PRIVATE_DEBUG (c
) = 1;
4810 case OMP_CLAUSE_LASTPRIVATE
:
4811 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
4812 accurately reflect the presence of a FIRSTPRIVATE clause. */
4813 decl
= OMP_CLAUSE_DECL (c
);
4814 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
4815 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c
)
4816 = (n
->value
& GOVD_FIRSTPRIVATE
) != 0;
4819 case OMP_CLAUSE_REDUCTION
:
4820 case OMP_CLAUSE_COPYIN
:
4821 case OMP_CLAUSE_COPYPRIVATE
:
4823 case OMP_CLAUSE_NUM_THREADS
:
4824 case OMP_CLAUSE_SCHEDULE
:
4825 case OMP_CLAUSE_NOWAIT
:
4826 case OMP_CLAUSE_ORDERED
:
4827 case OMP_CLAUSE_DEFAULT
:
4835 *list_p
= OMP_CLAUSE_CHAIN (c
);
4837 list_p
= &OMP_CLAUSE_CHAIN (c
);
4840 /* Add in any implicit data sharing. */
4841 splay_tree_foreach (ctx
->variables
, gimplify_adjust_omp_clauses_1
, list_p
);
4843 gimplify_omp_ctxp
= ctx
->outer_context
;
4844 delete_omp_context (ctx
);
4847 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
4848 gimplification of the body, as well as scanning the body for used
4849 variables. We need to do this scan now, because variable-sized
4850 decls will be decomposed during gimplification. */
4852 static enum gimplify_status
4853 gimplify_omp_parallel (tree
*expr_p
, tree
*pre_p
)
4855 tree expr
= *expr_p
;
4857 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
), pre_p
, true,
4858 OMP_PARALLEL_COMBINED (expr
));
4860 push_gimplify_context ();
4862 gimplify_stmt (&OMP_PARALLEL_BODY (expr
));
4864 if (TREE_CODE (OMP_PARALLEL_BODY (expr
)) == BIND_EXPR
)
4865 pop_gimplify_context (OMP_PARALLEL_BODY (expr
));
4867 pop_gimplify_context (NULL_TREE
);
4869 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
));
4874 /* Gimplify the gross structure of an OMP_FOR statement. */
4876 static enum gimplify_status
4877 gimplify_omp_for (tree
*expr_p
, tree
*pre_p
)
4879 tree for_stmt
, decl
, t
;
4880 enum gimplify_status ret
= 0;
4884 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
), pre_p
, false, false);
4886 t
= OMP_FOR_INIT (for_stmt
);
4887 gcc_assert (TREE_CODE (t
) == MODIFY_EXPR
);
4888 decl
= TREE_OPERAND (t
, 0);
4889 gcc_assert (DECL_P (decl
));
4890 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl
)));
4892 /* Make sure the iteration variable is private. */
4893 if (omp_is_private (gimplify_omp_ctxp
, decl
))
4894 omp_notice_variable (gimplify_omp_ctxp
, decl
, true);
4896 omp_add_variable (gimplify_omp_ctxp
, decl
, GOVD_PRIVATE
| GOVD_SEEN
);
4898 ret
|= gimplify_expr (&TREE_OPERAND (t
, 1), &OMP_FOR_PRE_BODY (for_stmt
),
4899 NULL
, is_gimple_val
, fb_rvalue
);
4901 t
= OMP_FOR_COND (for_stmt
);
4902 gcc_assert (COMPARISON_CLASS_P (t
));
4903 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
);
4908 t
= OMP_FOR_INCR (for_stmt
);
4909 switch (TREE_CODE (t
))
4911 case PREINCREMENT_EXPR
:
4912 case POSTINCREMENT_EXPR
:
4913 t
= build_int_cst (TREE_TYPE (decl
), 1);
4915 case PREDECREMENT_EXPR
:
4916 case POSTDECREMENT_EXPR
:
4917 t
= build_int_cst (TREE_TYPE (decl
), -1);
4920 t
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), decl
, t
);
4921 t
= build2 (MODIFY_EXPR
, void_type_node
, decl
, t
);
4922 OMP_FOR_INCR (for_stmt
) = t
;
4926 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
4927 t
= TREE_OPERAND (t
, 1);
4928 switch (TREE_CODE (t
))
4931 if (TREE_OPERAND (t
, 1) == decl
)
4933 TREE_OPERAND (t
, 1) = TREE_OPERAND (t
, 0);
4934 TREE_OPERAND (t
, 0) = decl
;
4938 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
4944 ret
|= gimplify_expr (&TREE_OPERAND (t
, 1), &OMP_FOR_PRE_BODY (for_stmt
),
4945 NULL
, is_gimple_val
, fb_rvalue
);
4952 gimplify_to_stmt_list (&OMP_FOR_BODY (for_stmt
));
4953 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
));
4955 return ret
== GS_ALL_DONE
? GS_ALL_DONE
: GS_ERROR
;
4958 /* Gimplify the gross structure of other OpenMP worksharing constructs.
4959 In particular, OMP_SECTIONS and OMP_SINGLE. */
4961 static enum gimplify_status
4962 gimplify_omp_workshare (tree
*expr_p
, tree
*pre_p
)
4964 tree stmt
= *expr_p
;
4966 gimplify_scan_omp_clauses (&OMP_CLAUSES (stmt
), pre_p
, false, false);
4967 gimplify_to_stmt_list (&OMP_BODY (stmt
));
4968 gimplify_adjust_omp_clauses (&OMP_CLAUSES (stmt
));
4973 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
4974 stabilized the lhs of the atomic operation as *ADDR. Return true if
4975 EXPR is this stabilized form. */
4978 goa_lhs_expr_p (tree expr
, tree addr
)
4980 /* Also include casts to other type variants. The C front end is fond
4981 of adding these for e.g. volatile variables. This is like
4982 STRIP_TYPE_NOPS but includes the main variant lookup. */
4983 while ((TREE_CODE (expr
) == NOP_EXPR
4984 || TREE_CODE (expr
) == CONVERT_EXPR
4985 || TREE_CODE (expr
) == NON_LVALUE_EXPR
)
4986 && TREE_OPERAND (expr
, 0) != error_mark_node
4987 && (TYPE_MAIN_VARIANT (TREE_TYPE (expr
))
4988 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (expr
, 0)))))
4989 expr
= TREE_OPERAND (expr
, 0);
4991 if (TREE_CODE (expr
) == INDIRECT_REF
&& TREE_OPERAND (expr
, 0) == addr
)
4993 if (TREE_CODE (addr
) == ADDR_EXPR
&& expr
== TREE_OPERAND (addr
, 0))
4998 /* A subroutine of gimplify_omp_atomic. Attempt to implement the atomic
4999 operation as a __sync_fetch_and_op builtin. INDEX is log2 of the
5000 size of the data type, and thus usable to find the index of the builtin
5001 decl. Returns GS_UNHANDLED if the expression is not of the proper form. */
5003 static enum gimplify_status
5004 gimplify_omp_atomic_fetch_op (tree
*expr_p
, tree addr
, tree rhs
, int index
)
5006 enum built_in_function base
;
5007 tree decl
, args
, itype
;
5008 enum insn_code
*optab
;
5010 /* Check for one of the supported fetch-op operations. */
5011 switch (TREE_CODE (rhs
))
5014 base
= BUILT_IN_FETCH_AND_ADD_N
;
5015 optab
= sync_add_optab
;
5018 base
= BUILT_IN_FETCH_AND_SUB_N
;
5019 optab
= sync_add_optab
;
5022 base
= BUILT_IN_FETCH_AND_AND_N
;
5023 optab
= sync_and_optab
;
5026 base
= BUILT_IN_FETCH_AND_OR_N
;
5027 optab
= sync_ior_optab
;
5030 base
= BUILT_IN_FETCH_AND_XOR_N
;
5031 optab
= sync_xor_optab
;
5034 return GS_UNHANDLED
;
5037 /* Make sure the expression is of the proper form. */
5038 if (goa_lhs_expr_p (TREE_OPERAND (rhs
, 0), addr
))
5039 rhs
= TREE_OPERAND (rhs
, 1);
5040 else if (commutative_tree_code (TREE_CODE (rhs
))
5041 && goa_lhs_expr_p (TREE_OPERAND (rhs
, 1), addr
))
5042 rhs
= TREE_OPERAND (rhs
, 0);
5044 return GS_UNHANDLED
;
5046 decl
= built_in_decls
[base
+ index
+ 1];
5047 itype
= TREE_TYPE (TREE_TYPE (decl
));
5049 if (optab
[TYPE_MODE (itype
)] == CODE_FOR_nothing
)
5050 return GS_UNHANDLED
;
5052 args
= tree_cons (NULL
, fold_convert (itype
, rhs
), NULL
);
5053 args
= tree_cons (NULL
, addr
, args
);
5054 *expr_p
= build_function_call_expr (decl
, args
);
5058 /* A subroutine of gimplify_omp_atomic_pipeline. Walk *EXPR_P and replace
5059 appearances of *LHS_ADDR with LHS_VAR. If an expression does not involve
5060 the lhs, evaluate it into a temporary. Return 1 if the lhs appeared as
5061 a subexpression, 0 if it did not, or -1 if an error was encountered. */
5064 goa_stabilize_expr (tree
*expr_p
, tree
*pre_p
, tree lhs_addr
, tree lhs_var
)
5066 tree expr
= *expr_p
;
5069 if (goa_lhs_expr_p (expr
, lhs_addr
))
5074 if (is_gimple_val (expr
))
5078 switch (TREE_CODE_CLASS (TREE_CODE (expr
)))
5081 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 1), pre_p
,
5084 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 0), pre_p
,
5093 enum gimplify_status gs
;
5094 gs
= gimplify_expr (expr_p
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
);
5095 if (gs
!= GS_ALL_DONE
)
5102 /* A subroutine of gimplify_omp_atomic. Implement the atomic operation as:
5106 newval = rhs; // with oldval replacing *addr in rhs
5107 oldval = __sync_val_compare_and_swap (addr, oldval, newval);
5108 if (oldval != newval)
5111 INDEX is log2 of the size of the data type, and thus usable to find the
5112 index of the builtin decl. */
5114 static enum gimplify_status
5115 gimplify_omp_atomic_pipeline (tree
*expr_p
, tree
*pre_p
, tree addr
,
5116 tree rhs
, int index
)
5118 tree oldval
, oldival
, oldival2
, newval
, newival
, label
;
5119 tree type
, itype
, cmpxchg
, args
, x
, iaddr
;
5121 cmpxchg
= built_in_decls
[BUILT_IN_VAL_COMPARE_AND_SWAP_N
+ index
+ 1];
5122 type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr
)));
5123 itype
= TREE_TYPE (TREE_TYPE (cmpxchg
));
5125 if (sync_compare_and_swap
[TYPE_MODE (itype
)] == CODE_FOR_nothing
)
5126 return GS_UNHANDLED
;
5128 oldval
= create_tmp_var (type
, NULL
);
5129 newval
= create_tmp_var (type
, NULL
);
5131 /* Precompute as much of RHS as possible. In the same walk, replace
5132 occurrences of the lhs value with our temporary. */
5133 if (goa_stabilize_expr (&rhs
, pre_p
, addr
, oldval
) < 0)
5136 x
= build_fold_indirect_ref (addr
);
5137 x
= build2 (MODIFY_EXPR
, void_type_node
, oldval
, x
);
5138 gimplify_and_add (x
, pre_p
);
5140 /* For floating-point values, we'll need to view-convert them to integers
5141 so that we can perform the atomic compare and swap. Simplify the
5142 following code by always setting up the "i"ntegral variables. */
5143 if (INTEGRAL_TYPE_P (type
) || POINTER_TYPE_P (type
))
5151 oldival
= create_tmp_var (itype
, NULL
);
5152 newival
= create_tmp_var (itype
, NULL
);
5154 x
= build1 (VIEW_CONVERT_EXPR
, itype
, oldval
);
5155 x
= build2 (MODIFY_EXPR
, void_type_node
, oldival
, x
);
5156 gimplify_and_add (x
, pre_p
);
5157 iaddr
= fold_convert (build_pointer_type (itype
), addr
);
5160 oldival2
= create_tmp_var (itype
, NULL
);
5162 label
= create_artificial_label ();
5163 x
= build1 (LABEL_EXPR
, void_type_node
, label
);
5164 gimplify_and_add (x
, pre_p
);
5166 x
= build2 (MODIFY_EXPR
, void_type_node
, newval
, rhs
);
5167 gimplify_and_add (x
, pre_p
);
5169 if (newval
!= newival
)
5171 x
= build1 (VIEW_CONVERT_EXPR
, itype
, newval
);
5172 x
= build2 (MODIFY_EXPR
, void_type_node
, newival
, x
);
5173 gimplify_and_add (x
, pre_p
);
5176 x
= build2 (MODIFY_EXPR
, void_type_node
, oldival2
,
5177 fold_convert (itype
, oldival
));
5178 gimplify_and_add (x
, pre_p
);
5180 args
= tree_cons (NULL
, fold_convert (itype
, newival
), NULL
);
5181 args
= tree_cons (NULL
, fold_convert (itype
, oldival
), args
);
5182 args
= tree_cons (NULL
, iaddr
, args
);
5183 x
= build_function_call_expr (cmpxchg
, args
);
5184 if (oldval
== oldival
)
5185 x
= fold_convert (type
, x
);
5186 x
= build2 (MODIFY_EXPR
, void_type_node
, oldival
, x
);
5187 gimplify_and_add (x
, pre_p
);
5189 /* For floating point, be prepared for the loop backedge. */
5190 if (oldval
!= oldival
)
5192 x
= build1 (VIEW_CONVERT_EXPR
, type
, oldival
);
5193 x
= build2 (MODIFY_EXPR
, void_type_node
, oldval
, x
);
5194 gimplify_and_add (x
, pre_p
);
5197 /* Note that we always perform the comparison as an integer, even for
5198 floating point. This allows the atomic operation to properly
5199 succeed even with NaNs and -0.0. */
5200 x
= build3 (COND_EXPR
, void_type_node
,
5201 build2 (NE_EXPR
, boolean_type_node
, oldival
, oldival2
),
5202 build1 (GOTO_EXPR
, void_type_node
, label
), NULL
);
5203 gimplify_and_add (x
, pre_p
);
5209 /* A subroutine of gimplify_omp_atomic. Implement the atomic operation as:
5211 GOMP_atomic_start ();
5215 The result is not globally atomic, but works so long as all parallel
5216 references are within #pragma omp atomic directives. According to
5217 responses received from omp@openmp.org, appears to be within spec.
5218 Which makes sense, since that's how several other compilers handle
5219 this situation as well. */
5221 static enum gimplify_status
5222 gimplify_omp_atomic_mutex (tree
*expr_p
, tree
*pre_p
, tree addr
, tree rhs
)
5226 t
= built_in_decls
[BUILT_IN_GOMP_ATOMIC_START
];
5227 t
= build_function_call_expr (t
, NULL
);
5228 gimplify_and_add (t
, pre_p
);
5230 t
= build_fold_indirect_ref (addr
);
5231 t
= build2 (MODIFY_EXPR
, void_type_node
, t
, rhs
);
5232 gimplify_and_add (t
, pre_p
);
5234 t
= built_in_decls
[BUILT_IN_GOMP_ATOMIC_END
];
5235 t
= build_function_call_expr (t
, NULL
);
5236 gimplify_and_add (t
, pre_p
);
5242 /* Gimplify an OMP_ATOMIC statement. */
5244 static enum gimplify_status
5245 gimplify_omp_atomic (tree
*expr_p
, tree
*pre_p
)
5247 tree addr
= TREE_OPERAND (*expr_p
, 0);
5248 tree rhs
= TREE_OPERAND (*expr_p
, 1);
5249 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr
)));
5250 HOST_WIDE_INT index
;
5252 /* Make sure the type is one of the supported sizes. */
5253 index
= tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
5254 index
= exact_log2 (index
);
5255 if (index
>= 0 && index
<= 4)
5257 enum gimplify_status gs
;
5260 if (DECL_P (TREE_OPERAND (addr
, 0)))
5261 align
= DECL_ALIGN_UNIT (TREE_OPERAND (addr
, 0));
5262 else if (TREE_CODE (TREE_OPERAND (addr
, 0)) == COMPONENT_REF
5263 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (addr
, 0), 1))
5265 align
= DECL_ALIGN_UNIT (TREE_OPERAND (TREE_OPERAND (addr
, 0), 1));
5267 align
= TYPE_ALIGN_UNIT (type
);
5269 /* __sync builtins require strict data alignment. */
5270 if (exact_log2 (align
) >= index
)
5272 /* When possible, use specialized atomic update functions. */
5273 if (INTEGRAL_TYPE_P (type
) || POINTER_TYPE_P (type
))
5275 gs
= gimplify_omp_atomic_fetch_op (expr_p
, addr
, rhs
, index
);
5276 if (gs
!= GS_UNHANDLED
)
5280 /* If we don't have specialized __sync builtins, try and implement
5281 as a compare and swap loop. */
5282 gs
= gimplify_omp_atomic_pipeline (expr_p
, pre_p
, addr
, rhs
, index
);
5283 if (gs
!= GS_UNHANDLED
)
5288 /* The ultimate fallback is wrapping the operation in a mutex. */
5289 return gimplify_omp_atomic_mutex (expr_p
, pre_p
, addr
, rhs
);
5292 /* Gimplifies the expression tree pointed to by EXPR_P. Return 0 if
5293 gimplification failed.
5295 PRE_P points to the list where side effects that must happen before
5296 EXPR should be stored.
5298 POST_P points to the list where side effects that must happen after
5299 EXPR should be stored, or NULL if there is no suitable list. In
5300 that case, we copy the result to a temporary, emit the
5301 post-effects, and then return the temporary.
5303 GIMPLE_TEST_F points to a function that takes a tree T and
5304 returns nonzero if T is in the GIMPLE form requested by the
5305 caller. The GIMPLE predicates are in tree-gimple.c.
5307 This test is used twice. Before gimplification, the test is
5308 invoked to determine whether *EXPR_P is already gimple enough. If
5309 that fails, *EXPR_P is gimplified according to its code and
5310 GIMPLE_TEST_F is called again. If the test still fails, then a new
5311 temporary variable is created and assigned the value of the
5312 gimplified expression.
5314 FALLBACK tells the function what sort of a temporary we want. If the 1
5315 bit is set, an rvalue is OK. If the 2 bit is set, an lvalue is OK.
5316 If both are set, either is OK, but an lvalue is preferable.
5318 The return value is either GS_ERROR or GS_ALL_DONE, since this function
5319 iterates until solution. */
5321 enum gimplify_status
5322 gimplify_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
,
5323 bool (* gimple_test_f
) (tree
), fallback_t fallback
)
5326 tree internal_pre
= NULL_TREE
;
5327 tree internal_post
= NULL_TREE
;
5329 int is_statement
= (pre_p
== NULL
);
5330 location_t saved_location
;
5331 enum gimplify_status ret
;
5333 save_expr
= *expr_p
;
5334 if (save_expr
== NULL_TREE
)
5337 /* We used to check the predicate here and return immediately if it
5338 succeeds. This is wrong; the design is for gimplification to be
5339 idempotent, and for the predicates to only test for valid forms, not
5340 whether they are fully simplified. */
5342 /* Set up our internal queues if needed. */
5344 pre_p
= &internal_pre
;
5346 post_p
= &internal_post
;
5348 saved_location
= input_location
;
5349 if (save_expr
!= error_mark_node
5350 && EXPR_HAS_LOCATION (*expr_p
))
5351 input_location
= EXPR_LOCATION (*expr_p
);
5353 /* Loop over the specific gimplifiers until the toplevel node
5354 remains the same. */
5357 /* Strip away as many useless type conversions as possible
5359 STRIP_USELESS_TYPE_CONVERSION (*expr_p
);
5361 /* Remember the expr. */
5362 save_expr
= *expr_p
;
5364 /* Die, die, die, my darling. */
5365 if (save_expr
== error_mark_node
5366 || (TREE_TYPE (save_expr
)
5367 && TREE_TYPE (save_expr
) == error_mark_node
))
5373 /* Do any language-specific gimplification. */
5374 ret
= lang_hooks
.gimplify_expr (expr_p
, pre_p
, post_p
);
5377 if (*expr_p
== NULL_TREE
)
5379 if (*expr_p
!= save_expr
)
5382 else if (ret
!= GS_UNHANDLED
)
5386 switch (TREE_CODE (*expr_p
))
5388 /* First deal with the special cases. */
5390 case POSTINCREMENT_EXPR
:
5391 case POSTDECREMENT_EXPR
:
5392 case PREINCREMENT_EXPR
:
5393 case PREDECREMENT_EXPR
:
5394 ret
= gimplify_self_mod_expr (expr_p
, pre_p
, post_p
,
5395 fallback
!= fb_none
);
5399 case ARRAY_RANGE_REF
:
5403 case VIEW_CONVERT_EXPR
:
5404 ret
= gimplify_compound_lval (expr_p
, pre_p
, post_p
,
5405 fallback
? fallback
: fb_rvalue
);
5409 ret
= gimplify_cond_expr (expr_p
, pre_p
, fallback
);
5410 /* C99 code may assign to an array in a structure value of a
5411 conditional expression, and this has undefined behavior
5412 only on execution, so create a temporary if an lvalue is
5414 if (fallback
== fb_lvalue
)
5416 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
5417 lang_hooks
.mark_addressable (*expr_p
);
5422 ret
= gimplify_call_expr (expr_p
, pre_p
, fallback
!= fb_none
);
5423 /* C99 code may assign to an array in a structure returned
5424 from a function, and this has undefined behavior only on
5425 execution, so create a temporary if an lvalue is
5427 if (fallback
== fb_lvalue
)
5429 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
5430 lang_hooks
.mark_addressable (*expr_p
);
5438 ret
= gimplify_compound_expr (expr_p
, pre_p
, fallback
!= fb_none
);
5443 ret
= gimplify_modify_expr (expr_p
, pre_p
, post_p
,
5444 fallback
!= fb_none
);
5446 /* The distinction between MODIFY_EXPR and INIT_EXPR is no longer
5448 if (*expr_p
&& TREE_CODE (*expr_p
) == INIT_EXPR
)
5449 TREE_SET_CODE (*expr_p
, MODIFY_EXPR
);
5452 case TRUTH_ANDIF_EXPR
:
5453 case TRUTH_ORIF_EXPR
:
5454 ret
= gimplify_boolean_expr (expr_p
);
5457 case TRUTH_NOT_EXPR
:
5458 TREE_OPERAND (*expr_p
, 0)
5459 = gimple_boolify (TREE_OPERAND (*expr_p
, 0));
5460 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5461 is_gimple_val
, fb_rvalue
);
5462 recalculate_side_effects (*expr_p
);
5466 ret
= gimplify_addr_expr (expr_p
, pre_p
, post_p
);
5470 ret
= gimplify_va_arg_expr (expr_p
, pre_p
, post_p
);
5475 if (IS_EMPTY_STMT (*expr_p
))
5481 if (VOID_TYPE_P (TREE_TYPE (*expr_p
))
5482 || fallback
== fb_none
)
5484 /* Just strip a conversion to void (or in void context) and
5486 *expr_p
= TREE_OPERAND (*expr_p
, 0);
5490 ret
= gimplify_conversion (expr_p
);
5491 if (ret
== GS_ERROR
)
5493 if (*expr_p
!= save_expr
)
5497 case FIX_TRUNC_EXPR
:
5499 case FIX_FLOOR_EXPR
:
5500 case FIX_ROUND_EXPR
:
5501 /* unary_expr: ... | '(' cast ')' val | ... */
5502 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5503 is_gimple_val
, fb_rvalue
);
5504 recalculate_side_effects (*expr_p
);
5508 *expr_p
= fold_indirect_ref (*expr_p
);
5509 if (*expr_p
!= save_expr
)
5511 /* else fall through. */
5512 case ALIGN_INDIRECT_REF
:
5513 case MISALIGNED_INDIRECT_REF
:
5514 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5515 is_gimple_reg
, fb_rvalue
);
5516 recalculate_side_effects (*expr_p
);
5519 /* Constants need not be gimplified. */
5529 /* If we require an lvalue, such as for ADDR_EXPR, retain the
5530 CONST_DECL node. Otherwise the decl is replaceable by its
5532 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
5533 if (fallback
& fb_lvalue
)
5536 *expr_p
= DECL_INITIAL (*expr_p
);
5540 ret
= gimplify_decl_expr (expr_p
);
5544 /* FIXME make this a decl. */
5549 ret
= gimplify_bind_expr (expr_p
, pre_p
);
5553 ret
= gimplify_loop_expr (expr_p
, pre_p
);
5557 ret
= gimplify_switch_expr (expr_p
, pre_p
);
5561 ret
= gimplify_exit_expr (expr_p
);
5565 /* If the target is not LABEL, then it is a computed jump
5566 and the target needs to be gimplified. */
5567 if (TREE_CODE (GOTO_DESTINATION (*expr_p
)) != LABEL_DECL
)
5568 ret
= gimplify_expr (&GOTO_DESTINATION (*expr_p
), pre_p
,
5569 NULL
, is_gimple_val
, fb_rvalue
);
5574 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p
))
5575 == current_function_decl
);
5578 case CASE_LABEL_EXPR
:
5579 ret
= gimplify_case_label_expr (expr_p
);
5583 ret
= gimplify_return_expr (*expr_p
, pre_p
);
5587 /* Don't reduce this in place; let gimplify_init_constructor work its
5588 magic. Buf if we're just elaborating this for side effects, just
5589 gimplify any element that has side-effects. */
5590 if (fallback
== fb_none
)
5592 unsigned HOST_WIDE_INT ix
;
5593 constructor_elt
*ce
;
5594 tree temp
= NULL_TREE
;
5596 VEC_iterate (constructor_elt
, CONSTRUCTOR_ELTS (*expr_p
),
5599 if (TREE_SIDE_EFFECTS (ce
->value
))
5600 append_to_statement_list (ce
->value
, &temp
);
5605 /* C99 code may assign to an array in a constructed
5606 structure or union, and this has undefined behavior only
5607 on execution, so create a temporary if an lvalue is
5609 else if (fallback
== fb_lvalue
)
5611 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
5612 lang_hooks
.mark_addressable (*expr_p
);
5618 /* The following are special cases that are not handled by the
5619 original GIMPLE grammar. */
5621 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
5624 ret
= gimplify_save_expr (expr_p
, pre_p
, post_p
);
5629 enum gimplify_status r0
, r1
, r2
;
5631 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5632 is_gimple_lvalue
, fb_either
);
5633 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
5634 is_gimple_val
, fb_rvalue
);
5635 r2
= gimplify_expr (&TREE_OPERAND (*expr_p
, 2), pre_p
, post_p
,
5636 is_gimple_val
, fb_rvalue
);
5637 recalculate_side_effects (*expr_p
);
5639 ret
= MIN (r0
, MIN (r1
, r2
));
5643 case NON_LVALUE_EXPR
:
5644 /* This should have been stripped above. */
5648 ret
= gimplify_asm_expr (expr_p
, pre_p
, post_p
);
5651 case TRY_FINALLY_EXPR
:
5652 case TRY_CATCH_EXPR
:
5653 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p
, 0));
5654 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p
, 1));
5658 case CLEANUP_POINT_EXPR
:
5659 ret
= gimplify_cleanup_point_expr (expr_p
, pre_p
);
5663 ret
= gimplify_target_expr (expr_p
, pre_p
, post_p
);
5667 gimplify_to_stmt_list (&CATCH_BODY (*expr_p
));
5671 case EH_FILTER_EXPR
:
5672 gimplify_to_stmt_list (&EH_FILTER_FAILURE (*expr_p
));
5678 enum gimplify_status r0
, r1
;
5679 r0
= gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p
), pre_p
, post_p
,
5680 is_gimple_val
, fb_rvalue
);
5681 r1
= gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p
), pre_p
, post_p
,
5682 is_gimple_val
, fb_rvalue
);
5688 /* We get here when taking the address of a label. We mark
5689 the label as "forced"; meaning it can never be removed and
5690 it is a potential target for any computed goto. */
5691 FORCED_LABEL (*expr_p
) = 1;
5695 case STATEMENT_LIST
:
5696 ret
= gimplify_statement_list (expr_p
, pre_p
);
5699 case WITH_SIZE_EXPR
:
5701 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
5702 post_p
== &internal_post
? NULL
: post_p
,
5703 gimple_test_f
, fallback
);
5704 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
5705 is_gimple_val
, fb_rvalue
);
5711 ret
= gimplify_var_or_parm_decl (expr_p
);
5715 /* When within an OpenMP context, notice uses of variables. */
5716 if (gimplify_omp_ctxp
)
5717 omp_notice_variable (gimplify_omp_ctxp
, *expr_p
, true);
5722 /* Allow callbacks into the gimplifier during optimization. */
5727 ret
= gimplify_omp_parallel (expr_p
, pre_p
);
5731 ret
= gimplify_omp_for (expr_p
, pre_p
);
5736 ret
= gimplify_omp_workshare (expr_p
, pre_p
);
5743 gimplify_to_stmt_list (&OMP_BODY (*expr_p
));
5747 ret
= gimplify_omp_atomic (expr_p
, pre_p
);
5756 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p
)))
5758 case tcc_comparison
:
5759 /* Handle comparison of objects of non scalar mode aggregates
5760 with a call to memcmp. It would be nice to only have to do
5761 this for variable-sized objects, but then we'd have to allow
5762 the same nest of reference nodes we allow for MODIFY_EXPR and
5765 Compare scalar mode aggregates as scalar mode values. Using
5766 memcmp for them would be very inefficient at best, and is
5767 plain wrong if bitfields are involved. */
5770 tree type
= TREE_TYPE (TREE_OPERAND (*expr_p
, 1));
5772 if (!AGGREGATE_TYPE_P (type
))
5774 else if (TYPE_MODE (type
) != BLKmode
)
5775 ret
= gimplify_scalar_mode_aggregate_compare (expr_p
);
5777 ret
= gimplify_variable_sized_compare (expr_p
);
5782 /* If *EXPR_P does not need to be special-cased, handle it
5783 according to its class. */
5785 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
5786 post_p
, is_gimple_val
, fb_rvalue
);
5792 enum gimplify_status r0
, r1
;
5794 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
5795 post_p
, is_gimple_val
, fb_rvalue
);
5796 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
,
5797 post_p
, is_gimple_val
, fb_rvalue
);
5803 case tcc_declaration
:
5806 goto dont_recalculate
;
5809 gcc_assert (TREE_CODE (*expr_p
) == TRUTH_AND_EXPR
5810 || TREE_CODE (*expr_p
) == TRUTH_OR_EXPR
5811 || TREE_CODE (*expr_p
) == TRUTH_XOR_EXPR
);
5815 recalculate_side_effects (*expr_p
);
5820 /* If we replaced *expr_p, gimplify again. */
5821 if (ret
== GS_OK
&& (*expr_p
== NULL
|| *expr_p
== save_expr
))
5824 while (ret
== GS_OK
);
5826 /* If we encountered an error_mark somewhere nested inside, either
5827 stub out the statement or propagate the error back out. */
5828 if (ret
== GS_ERROR
)
5835 /* This was only valid as a return value from the langhook, which
5836 we handled. Make sure it doesn't escape from any other context. */
5837 gcc_assert (ret
!= GS_UNHANDLED
);
5839 if (fallback
== fb_none
&& *expr_p
&& !is_gimple_stmt (*expr_p
))
5841 /* We aren't looking for a value, and we don't have a valid
5842 statement. If it doesn't have side-effects, throw it away. */
5843 if (!TREE_SIDE_EFFECTS (*expr_p
))
5845 else if (!TREE_THIS_VOLATILE (*expr_p
))
5847 /* This is probably a _REF that contains something nested that
5848 has side effects. Recurse through the operands to find it. */
5849 enum tree_code code
= TREE_CODE (*expr_p
);
5856 case VIEW_CONVERT_EXPR
:
5857 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5858 gimple_test_f
, fallback
);
5862 case ARRAY_RANGE_REF
:
5863 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5864 gimple_test_f
, fallback
);
5865 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
5866 gimple_test_f
, fallback
);
5870 /* Anything else with side-effects must be converted to
5871 a valid statement before we get here. */
5877 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p
))
5878 && TYPE_MODE (TREE_TYPE (*expr_p
)) != BLKmode
)
5880 /* Historically, the compiler has treated a bare reference
5881 to a non-BLKmode volatile lvalue as forcing a load. */
5882 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p
));
5883 /* Normally, we do not want to create a temporary for a
5884 TREE_ADDRESSABLE type because such a type should not be
5885 copied by bitwise-assignment. However, we make an
5886 exception here, as all we are doing here is ensuring that
5887 we read the bytes that make up the type. We use
5888 create_tmp_var_raw because create_tmp_var will abort when
5889 given a TREE_ADDRESSABLE type. */
5890 tree tmp
= create_tmp_var_raw (type
, "vol");
5891 gimple_add_tmp_var (tmp
);
5892 *expr_p
= build2 (MODIFY_EXPR
, type
, tmp
, *expr_p
);
5895 /* We can't do anything useful with a volatile reference to
5896 an incomplete type, so just throw it away. Likewise for
5897 a BLKmode type, since any implicit inner load should
5898 already have been turned into an explicit one by the
5899 gimplification process. */
5903 /* If we are gimplifying at the statement level, we're done. Tack
5904 everything together and replace the original statement with the
5906 if (fallback
== fb_none
|| is_statement
)
5908 if (internal_pre
|| internal_post
)
5910 append_to_statement_list (*expr_p
, &internal_pre
);
5911 append_to_statement_list (internal_post
, &internal_pre
);
5912 annotate_all_with_locus (&internal_pre
, input_location
);
5913 *expr_p
= internal_pre
;
5917 else if (TREE_CODE (*expr_p
) == STATEMENT_LIST
)
5918 annotate_all_with_locus (expr_p
, input_location
);
5920 annotate_one_with_locus (*expr_p
, input_location
);
5924 /* Otherwise we're gimplifying a subexpression, so the resulting value is
5927 /* If it's sufficiently simple already, we're done. Unless we are
5928 handling some post-effects internally; if that's the case, we need to
5929 copy into a temp before adding the post-effects to the tree. */
5930 if (!internal_post
&& (*gimple_test_f
) (*expr_p
))
5933 /* Otherwise, we need to create a new temporary for the gimplified
5936 /* We can't return an lvalue if we have an internal postqueue. The
5937 object the lvalue refers to would (probably) be modified by the
5938 postqueue; we need to copy the value out first, which means an
5940 if ((fallback
& fb_lvalue
) && !internal_post
5941 && is_gimple_addressable (*expr_p
))
5943 /* An lvalue will do. Take the address of the expression, store it
5944 in a temporary, and replace the expression with an INDIRECT_REF of
5946 tmp
= build_fold_addr_expr (*expr_p
);
5947 gimplify_expr (&tmp
, pre_p
, post_p
, is_gimple_reg
, fb_rvalue
);
5948 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (tmp
)), tmp
);
5950 else if ((fallback
& fb_rvalue
) && is_gimple_formal_tmp_rhs (*expr_p
))
5952 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p
)));
5954 /* An rvalue will do. Assign the gimplified expression into a new
5955 temporary TMP and replace the original expression with TMP. */
5957 if (internal_post
|| (fallback
& fb_lvalue
))
5958 /* The postqueue might change the value of the expression between
5959 the initialization and use of the temporary, so we can't use a
5960 formal temp. FIXME do we care? */
5961 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
5963 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
5965 if (TREE_CODE (*expr_p
) != SSA_NAME
)
5966 DECL_GIMPLE_FORMAL_TEMP_P (*expr_p
) = 1;
5970 #ifdef ENABLE_CHECKING
5971 if (!(fallback
& fb_mayfail
))
5973 fprintf (stderr
, "gimplification failed:\n");
5974 print_generic_expr (stderr
, *expr_p
, 0);
5975 debug_tree (*expr_p
);
5976 internal_error ("gimplification failed");
5979 gcc_assert (fallback
& fb_mayfail
);
5980 /* If this is an asm statement, and the user asked for the
5981 impossible, don't die. Fail and let gimplify_asm_expr
5987 /* Make sure the temporary matches our predicate. */
5988 gcc_assert ((*gimple_test_f
) (*expr_p
));
5992 annotate_all_with_locus (&internal_post
, input_location
);
5993 append_to_statement_list (internal_post
, pre_p
);
5997 input_location
= saved_location
;
6001 /* Look through TYPE for variable-sized objects and gimplify each such
6002 size that we find. Add to LIST_P any statements generated. */
6005 gimplify_type_sizes (tree type
, tree
*list_p
)
6009 if (type
== NULL
|| type
== error_mark_node
)
6012 /* We first do the main variant, then copy into any other variants. */
6013 type
= TYPE_MAIN_VARIANT (type
);
6015 /* Avoid infinite recursion. */
6016 if (TYPE_SIZES_GIMPLIFIED (type
))
6019 TYPE_SIZES_GIMPLIFIED (type
) = 1;
6021 switch (TREE_CODE (type
))
6027 gimplify_one_sizepos (&TYPE_MIN_VALUE (type
), list_p
);
6028 gimplify_one_sizepos (&TYPE_MAX_VALUE (type
), list_p
);
6030 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6032 TYPE_MIN_VALUE (t
) = TYPE_MIN_VALUE (type
);
6033 TYPE_MAX_VALUE (t
) = TYPE_MAX_VALUE (type
);
6038 /* These types may not have declarations, so handle them here. */
6039 gimplify_type_sizes (TREE_TYPE (type
), list_p
);
6040 gimplify_type_sizes (TYPE_DOMAIN (type
), list_p
);
6045 case QUAL_UNION_TYPE
:
6046 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
6047 if (TREE_CODE (field
) == FIELD_DECL
)
6049 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field
), list_p
);
6050 gimplify_type_sizes (TREE_TYPE (field
), list_p
);
6055 case REFERENCE_TYPE
:
6056 /* We used to recurse on the pointed-to type here, which turned out to
6057 be incorrect because its definition might refer to variables not
6058 yet initialized at this point if a forward declaration is involved.
6060 It was actually useful for anonymous pointed-to types to ensure
6061 that the sizes evaluation dominates every possible later use of the
6062 values. Restricting to such types here would be safe since there
6063 is no possible forward declaration around, but would introduce an
6064 undesirable middle-end semantic to anonymity. We then defer to
6065 front-ends the responsibility of ensuring that the sizes are
6066 evaluated both early and late enough, e.g. by attaching artificial
6067 type declarations to the tree. */
6074 gimplify_one_sizepos (&TYPE_SIZE (type
), list_p
);
6075 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type
), list_p
);
6077 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6079 TYPE_SIZE (t
) = TYPE_SIZE (type
);
6080 TYPE_SIZE_UNIT (t
) = TYPE_SIZE_UNIT (type
);
6081 TYPE_SIZES_GIMPLIFIED (t
) = 1;
6085 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
6086 a size or position, has had all of its SAVE_EXPRs evaluated.
6087 We add any required statements to STMT_P. */
6090 gimplify_one_sizepos (tree
*expr_p
, tree
*stmt_p
)
6092 tree type
, expr
= *expr_p
;
6094 /* We don't do anything if the value isn't there, is constant, or contains
6095 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
6096 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
6097 will want to replace it with a new variable, but that will cause problems
6098 if this type is from outside the function. It's OK to have that here. */
6099 if (expr
== NULL_TREE
|| TREE_CONSTANT (expr
)
6100 || TREE_CODE (expr
) == VAR_DECL
6101 || CONTAINS_PLACEHOLDER_P (expr
))
6104 type
= TREE_TYPE (expr
);
6105 *expr_p
= unshare_expr (expr
);
6107 gimplify_expr (expr_p
, stmt_p
, NULL
, is_gimple_val
, fb_rvalue
);
6110 /* Verify that we've an exact type match with the original expression.
6111 In particular, we do not wish to drop a "sizetype" in favour of a
6112 type of similar dimensions. We don't want to pollute the generic
6113 type-stripping code with this knowledge because it doesn't matter
6114 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
6115 and friends retain their "sizetype-ness". */
6116 if (TREE_TYPE (expr
) != type
6117 && TREE_CODE (type
) == INTEGER_TYPE
6118 && TYPE_IS_SIZETYPE (type
))
6122 *expr_p
= create_tmp_var (type
, NULL
);
6123 tmp
= build1 (NOP_EXPR
, type
, expr
);
6124 tmp
= build2 (MODIFY_EXPR
, type
, *expr_p
, tmp
);
6125 if (EXPR_HAS_LOCATION (expr
))
6126 SET_EXPR_LOCUS (tmp
, EXPR_LOCUS (expr
));
6128 SET_EXPR_LOCATION (tmp
, input_location
);
6130 gimplify_and_add (tmp
, stmt_p
);
6134 #ifdef ENABLE_CHECKING
6135 /* Compare types A and B for a "close enough" match. */
6138 cpt_same_type (tree a
, tree b
)
6140 if (lang_hooks
.types_compatible_p (a
, b
))
6143 /* ??? The C++ FE decomposes METHOD_TYPES to FUNCTION_TYPES and doesn't
6144 link them together. This routine is intended to catch type errors
6145 that will affect the optimizers, and the optimizers don't add new
6146 dereferences of function pointers, so ignore it. */
6147 if ((TREE_CODE (a
) == FUNCTION_TYPE
|| TREE_CODE (a
) == METHOD_TYPE
)
6148 && (TREE_CODE (b
) == FUNCTION_TYPE
|| TREE_CODE (b
) == METHOD_TYPE
))
6151 /* ??? The C FE pushes type qualifiers after the fact into the type of
6152 the element from the type of the array. See build_unary_op's handling
6153 of ADDR_EXPR. This seems wrong -- if we were going to do this, we
6154 should have done it when creating the variable in the first place.
6155 Alternately, why aren't the two array types made variants? */
6156 if (TREE_CODE (a
) == ARRAY_TYPE
&& TREE_CODE (b
) == ARRAY_TYPE
)
6157 return cpt_same_type (TREE_TYPE (a
), TREE_TYPE (b
));
6159 /* And because of those, we have to recurse down through pointers. */
6160 if (POINTER_TYPE_P (a
) && POINTER_TYPE_P (b
))
6161 return cpt_same_type (TREE_TYPE (a
), TREE_TYPE (b
));
6166 /* Check for some cases of the front end missing cast expressions.
6167 The type of a dereference should correspond to the pointer type;
6168 similarly the type of an address should match its object. */
6171 check_pointer_types_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
6172 void *data ATTRIBUTE_UNUSED
)
6175 tree ptype
, otype
, dtype
;
6177 switch (TREE_CODE (t
))
6181 otype
= TREE_TYPE (t
);
6182 ptype
= TREE_TYPE (TREE_OPERAND (t
, 0));
6183 dtype
= TREE_TYPE (ptype
);
6184 gcc_assert (cpt_same_type (otype
, dtype
));
6188 ptype
= TREE_TYPE (t
);
6189 otype
= TREE_TYPE (TREE_OPERAND (t
, 0));
6190 dtype
= TREE_TYPE (ptype
);
6191 if (!cpt_same_type (otype
, dtype
))
6193 /* &array is allowed to produce a pointer to the element, rather than
6194 a pointer to the array type. We must allow this in order to
6195 properly represent assigning the address of an array in C into
6196 pointer to the element type. */
6197 gcc_assert (TREE_CODE (otype
) == ARRAY_TYPE
6198 && POINTER_TYPE_P (ptype
)
6199 && cpt_same_type (TREE_TYPE (otype
), dtype
));
6213 /* Gimplify the body of statements pointed to by BODY_P. FNDECL is the
6214 function decl containing BODY. */
6217 gimplify_body (tree
*body_p
, tree fndecl
, bool do_parms
)
6219 location_t saved_location
= input_location
;
6220 tree body
, parm_stmts
;
6222 timevar_push (TV_TREE_GIMPLIFY
);
6224 gcc_assert (gimplify_ctxp
== NULL
);
6225 push_gimplify_context ();
6227 /* Unshare most shared trees in the body and in that of any nested functions.
6228 It would seem we don't have to do this for nested functions because
6229 they are supposed to be output and then the outer function gimplified
6230 first, but the g++ front end doesn't always do it that way. */
6231 unshare_body (body_p
, fndecl
);
6232 unvisit_body (body_p
, fndecl
);
6234 /* Make sure input_location isn't set to something wierd. */
6235 input_location
= DECL_SOURCE_LOCATION (fndecl
);
6237 /* Resolve callee-copies. This has to be done before processing
6238 the body so that DECL_VALUE_EXPR gets processed correctly. */
6239 parm_stmts
= do_parms
? gimplify_parameters () : NULL
;
6241 /* Gimplify the function's body. */
6242 gimplify_stmt (body_p
);
6246 body
= alloc_stmt_list ();
6247 else if (TREE_CODE (body
) == STATEMENT_LIST
)
6249 tree t
= expr_only (*body_p
);
6254 /* If there isn't an outer BIND_EXPR, add one. */
6255 if (TREE_CODE (body
) != BIND_EXPR
)
6257 tree b
= build3 (BIND_EXPR
, void_type_node
, NULL_TREE
,
6258 NULL_TREE
, NULL_TREE
);
6259 TREE_SIDE_EFFECTS (b
) = 1;
6260 append_to_statement_list_force (body
, &BIND_EXPR_BODY (b
));
6264 /* If we had callee-copies statements, insert them at the beginning
6268 append_to_statement_list_force (BIND_EXPR_BODY (body
), &parm_stmts
);
6269 BIND_EXPR_BODY (body
) = parm_stmts
;
6272 /* Unshare again, in case gimplification was sloppy. */
6273 unshare_all_trees (body
);
6277 pop_gimplify_context (body
);
6278 gcc_assert (gimplify_ctxp
== NULL
);
6280 #ifdef ENABLE_CHECKING
6281 walk_tree (body_p
, check_pointer_types_r
, NULL
, NULL
);
6284 timevar_pop (TV_TREE_GIMPLIFY
);
6285 input_location
= saved_location
;
6288 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
6289 node for the function we want to gimplify. */
6292 gimplify_function_tree (tree fndecl
)
6294 tree oldfn
, parm
, ret
;
6296 oldfn
= current_function_decl
;
6297 current_function_decl
= fndecl
;
6298 cfun
= DECL_STRUCT_FUNCTION (fndecl
);
6300 allocate_struct_function (fndecl
);
6302 for (parm
= DECL_ARGUMENTS (fndecl
); parm
; parm
= TREE_CHAIN (parm
))
6304 /* Preliminarily mark non-addressed complex variables as eligible
6305 for promotion to gimple registers. We'll transform their uses
6307 if (TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
6308 && !TREE_THIS_VOLATILE (parm
)
6309 && !needs_to_live_in_memory (parm
))
6310 DECL_COMPLEX_GIMPLE_REG_P (parm
) = 1;
6313 ret
= DECL_RESULT (fndecl
);
6314 if (TREE_CODE (TREE_TYPE (ret
)) == COMPLEX_TYPE
6315 && !needs_to_live_in_memory (ret
))
6316 DECL_COMPLEX_GIMPLE_REG_P (ret
) = 1;
6318 gimplify_body (&DECL_SAVED_TREE (fndecl
), fndecl
, true);
6320 /* If we're instrumenting function entry/exit, then prepend the call to
6321 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
6322 catch the exit hook. */
6323 /* ??? Add some way to ignore exceptions for this TFE. */
6324 if (flag_instrument_function_entry_exit
6325 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl
))
6329 tf
= build2 (TRY_FINALLY_EXPR
, void_type_node
, NULL
, NULL
);
6330 TREE_SIDE_EFFECTS (tf
) = 1;
6331 x
= DECL_SAVED_TREE (fndecl
);
6332 append_to_statement_list (x
, &TREE_OPERAND (tf
, 0));
6333 x
= implicit_built_in_decls
[BUILT_IN_PROFILE_FUNC_EXIT
];
6334 x
= build_function_call_expr (x
, NULL
);
6335 append_to_statement_list (x
, &TREE_OPERAND (tf
, 1));
6337 bind
= build3 (BIND_EXPR
, void_type_node
, NULL
, NULL
, NULL
);
6338 TREE_SIDE_EFFECTS (bind
) = 1;
6339 x
= implicit_built_in_decls
[BUILT_IN_PROFILE_FUNC_ENTER
];
6340 x
= build_function_call_expr (x
, NULL
);
6341 append_to_statement_list (x
, &BIND_EXPR_BODY (bind
));
6342 append_to_statement_list (tf
, &BIND_EXPR_BODY (bind
));
6344 DECL_SAVED_TREE (fndecl
) = bind
;
6347 current_function_decl
= oldfn
;
6348 cfun
= oldfn
? DECL_STRUCT_FUNCTION (oldfn
) : NULL
;
6352 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
6353 force the result to be either ssa_name or an invariant, otherwise
6354 just force it to be a rhs expression. If VAR is not NULL, make the
6355 base variable of the final destination be VAR if suitable. */
6358 force_gimple_operand (tree expr
, tree
*stmts
, bool simple
, tree var
)
6361 enum gimplify_status ret
;
6362 gimple_predicate gimple_test_f
;
6366 if (is_gimple_val (expr
))
6369 gimple_test_f
= simple
? is_gimple_val
: is_gimple_reg_rhs
;
6371 push_gimplify_context ();
6372 gimplify_ctxp
->into_ssa
= in_ssa_p
;
6375 expr
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, expr
);
6377 ret
= gimplify_expr (&expr
, stmts
, NULL
,
6378 gimple_test_f
, fb_rvalue
);
6379 gcc_assert (ret
!= GS_ERROR
);
6381 if (referenced_vars
)
6383 for (t
= gimplify_ctxp
->temps
; t
; t
= TREE_CHAIN (t
))
6384 add_referenced_var (t
);
6387 pop_gimplify_context (NULL
);
6392 /* Invokes force_gimple_operand for EXPR with parameters SIMPLE_P and VAR. If
6393 some statements are produced, emits them before BSI. */
6396 force_gimple_operand_bsi (block_stmt_iterator
*bsi
, tree expr
,
6397 bool simple_p
, tree var
)
6401 expr
= force_gimple_operand (expr
, &stmts
, simple_p
, var
);
6403 bsi_insert_before (bsi
, stmts
, BSI_SAME_STMT
);
6408 #include "gt-gimplify.h"