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_tmp_vars (c
->temps
, body
);
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 incomplete, or of variable size. */
483 gcc_assert (!TREE_ADDRESSABLE (type
)
484 && COMPLETE_TYPE_P (type
)
485 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
);
487 tmp_var
= create_tmp_var_raw (type
, prefix
);
488 gimple_add_tmp_var (tmp_var
);
492 /* Given a tree, try to return a useful variable name that we can use
493 to prefix a temporary that is being assigned the value of the tree.
494 I.E. given <temp> = &A, return A. */
502 STRIP_NOPS (stripped_decl
);
503 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
504 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
507 switch (TREE_CODE (stripped_decl
))
510 return get_name (TREE_OPERAND (stripped_decl
, 0));
518 /* Create a temporary with a name derived from VAL. Subroutine of
519 lookup_tmp_var; nobody else should call this function. */
522 create_tmp_from_val (tree val
)
524 return create_tmp_var (TYPE_MAIN_VARIANT (TREE_TYPE (val
)), get_name (val
));
527 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
528 an existing expression temporary. */
531 lookup_tmp_var (tree val
, bool is_formal
)
535 /* If not optimizing, never really reuse a temporary. local-alloc
536 won't allocate any variable that is used in more than one basic
537 block, which means it will go into memory, causing much extra
538 work in reload and final and poorer code generation, outweighing
539 the extra memory allocation here. */
540 if (!optimize
|| !is_formal
|| TREE_SIDE_EFFECTS (val
))
541 ret
= create_tmp_from_val (val
);
548 slot
= htab_find_slot (gimplify_ctxp
->temp_htab
, (void *)&elt
, INSERT
);
551 elt_p
= XNEW (elt_t
);
553 elt_p
->temp
= ret
= create_tmp_from_val (val
);
554 *slot
= (void *) elt_p
;
558 elt_p
= (elt_t
*) *slot
;
564 DECL_GIMPLE_FORMAL_TEMP_P (ret
) = 1;
569 /* Returns a formal temporary variable initialized with VAL. PRE_P is as
570 in gimplify_expr. Only use this function if:
572 1) The value of the unfactored expression represented by VAL will not
573 change between the initialization and use of the temporary, and
574 2) The temporary will not be otherwise modified.
576 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
577 and #2 means it is inappropriate for && temps.
579 For other cases, use get_initialized_tmp_var instead. */
582 internal_get_tmp_var (tree val
, tree
*pre_p
, tree
*post_p
, bool is_formal
)
586 gimplify_expr (&val
, pre_p
, post_p
, is_gimple_formal_tmp_rhs
, fb_rvalue
);
588 t
= lookup_tmp_var (val
, is_formal
);
592 tree u
= find_single_pointer_decl (val
);
594 if (u
&& TREE_CODE (u
) == VAR_DECL
&& DECL_BASED_ON_RESTRICT_P (u
))
595 u
= DECL_GET_RESTRICT_BASE (u
);
596 if (u
&& TYPE_RESTRICT (TREE_TYPE (u
)))
598 if (DECL_BASED_ON_RESTRICT_P (t
))
599 gcc_assert (u
== DECL_GET_RESTRICT_BASE (t
));
602 DECL_BASED_ON_RESTRICT_P (t
) = 1;
603 SET_DECL_RESTRICT_BASE (t
, u
);
608 if (TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
)
609 DECL_COMPLEX_GIMPLE_REG_P (t
) = 1;
611 mod
= build2 (INIT_EXPR
, TREE_TYPE (t
), t
, val
);
613 if (EXPR_HAS_LOCATION (val
))
614 SET_EXPR_LOCUS (mod
, EXPR_LOCUS (val
));
616 SET_EXPR_LOCATION (mod
, input_location
);
618 /* gimplify_modify_expr might want to reduce this further. */
619 gimplify_and_add (mod
, pre_p
);
621 /* If we're gimplifying into ssa, gimplify_modify_expr will have
622 given our temporary an ssa name. Find and return it. */
623 if (gimplify_ctxp
->into_ssa
)
624 t
= TREE_OPERAND (mod
, 0);
629 /* Returns a formal temporary variable initialized with VAL. PRE_P
630 points to a statement list where side-effects needed to compute VAL
634 get_formal_tmp_var (tree val
, tree
*pre_p
)
636 return internal_get_tmp_var (val
, pre_p
, NULL
, true);
639 /* Returns a temporary variable initialized with VAL. PRE_P and POST_P
640 are as in gimplify_expr. */
643 get_initialized_tmp_var (tree val
, tree
*pre_p
, tree
*post_p
)
645 return internal_get_tmp_var (val
, pre_p
, post_p
, false);
648 /* Declares all the variables in VARS in SCOPE. */
651 declare_tmp_vars (tree vars
, tree scope
)
658 /* C99 mode puts the default 'return 0;' for main outside the outer
659 braces. So drill down until we find an actual scope. */
660 while (TREE_CODE (scope
) == COMPOUND_EXPR
)
661 scope
= TREE_OPERAND (scope
, 0);
663 gcc_assert (TREE_CODE (scope
) == BIND_EXPR
);
665 temps
= nreverse (last
);
666 TREE_CHAIN (last
) = BIND_EXPR_VARS (scope
);
667 BIND_EXPR_VARS (scope
) = temps
;
672 gimple_add_tmp_var (tree tmp
)
674 gcc_assert (!TREE_CHAIN (tmp
) && !DECL_SEEN_IN_BIND_EXPR_P (tmp
));
676 DECL_CONTEXT (tmp
) = current_function_decl
;
677 DECL_SEEN_IN_BIND_EXPR_P (tmp
) = 1;
681 TREE_CHAIN (tmp
) = gimplify_ctxp
->temps
;
682 gimplify_ctxp
->temps
= tmp
;
684 /* Mark temporaries local within the nearest enclosing parallel. */
685 if (gimplify_omp_ctxp
)
687 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
688 while (ctx
&& !ctx
->is_parallel
)
689 ctx
= ctx
->outer_context
;
691 omp_add_variable (ctx
, tmp
, GOVD_LOCAL
| GOVD_SEEN
);
697 declare_tmp_vars (tmp
, DECL_SAVED_TREE (current_function_decl
));
700 /* Determines whether to assign a locus to the statement STMT. */
703 should_carry_locus_p (tree stmt
)
705 /* Don't emit a line note for a label. We particularly don't want to
706 emit one for the break label, since it doesn't actually correspond
707 to the beginning of the loop/switch. */
708 if (TREE_CODE (stmt
) == LABEL_EXPR
)
711 /* Do not annotate empty statements, since it confuses gcov. */
712 if (!TREE_SIDE_EFFECTS (stmt
))
719 annotate_one_with_locus (tree t
, location_t locus
)
721 if (EXPR_P (t
) && ! EXPR_HAS_LOCATION (t
) && should_carry_locus_p (t
))
722 SET_EXPR_LOCATION (t
, locus
);
726 annotate_all_with_locus (tree
*stmt_p
, location_t locus
)
728 tree_stmt_iterator i
;
733 for (i
= tsi_start (*stmt_p
); !tsi_end_p (i
); tsi_next (&i
))
735 tree t
= tsi_stmt (i
);
737 /* Assuming we've already been gimplified, we shouldn't
738 see nested chaining constructs anymore. */
739 gcc_assert (TREE_CODE (t
) != STATEMENT_LIST
740 && TREE_CODE (t
) != COMPOUND_EXPR
);
742 annotate_one_with_locus (t
, locus
);
746 /* Similar to copy_tree_r() but do not copy SAVE_EXPR or TARGET_EXPR nodes.
747 These nodes model computations that should only be done once. If we
748 were to unshare something like SAVE_EXPR(i++), the gimplification
749 process would create wrong code. */
752 mostly_copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data
)
754 enum tree_code code
= TREE_CODE (*tp
);
755 /* Don't unshare types, decls, constants and SAVE_EXPR nodes. */
756 if (TREE_CODE_CLASS (code
) == tcc_type
757 || TREE_CODE_CLASS (code
) == tcc_declaration
758 || TREE_CODE_CLASS (code
) == tcc_constant
759 || code
== SAVE_EXPR
|| code
== TARGET_EXPR
760 /* We can't do anything sensible with a BLOCK used as an expression,
761 but we also can't just die when we see it because of non-expression
762 uses. So just avert our eyes and cross our fingers. Silly Java. */
767 gcc_assert (code
!= BIND_EXPR
);
768 copy_tree_r (tp
, walk_subtrees
, data
);
774 /* Callback for walk_tree to unshare most of the shared trees rooted at
775 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
776 then *TP is deep copied by calling copy_tree_r.
778 This unshares the same trees as copy_tree_r with the exception of
779 SAVE_EXPR nodes. These nodes model computations that should only be
780 done once. If we were to unshare something like SAVE_EXPR(i++), the
781 gimplification process would create wrong code. */
784 copy_if_shared_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
785 void *data ATTRIBUTE_UNUSED
)
788 enum tree_code code
= TREE_CODE (t
);
790 /* Skip types, decls, and constants. But we do want to look at their
791 types and the bounds of types. Mark them as visited so we properly
792 unmark their subtrees on the unmark pass. If we've already seen them,
793 don't look down further. */
794 if (TREE_CODE_CLASS (code
) == tcc_type
795 || TREE_CODE_CLASS (code
) == tcc_declaration
796 || TREE_CODE_CLASS (code
) == tcc_constant
)
798 if (TREE_VISITED (t
))
801 TREE_VISITED (t
) = 1;
804 /* If this node has been visited already, unshare it and don't look
806 else if (TREE_VISITED (t
))
808 walk_tree (tp
, mostly_copy_tree_r
, NULL
, NULL
);
812 /* Otherwise, mark the tree as visited and keep looking. */
814 TREE_VISITED (t
) = 1;
820 unmark_visited_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
821 void *data ATTRIBUTE_UNUSED
)
823 if (TREE_VISITED (*tp
))
824 TREE_VISITED (*tp
) = 0;
831 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
832 bodies of any nested functions if we are unsharing the entire body of
836 unshare_body (tree
*body_p
, tree fndecl
)
838 struct cgraph_node
*cgn
= cgraph_node (fndecl
);
840 walk_tree (body_p
, copy_if_shared_r
, NULL
, NULL
);
841 if (body_p
== &DECL_SAVED_TREE (fndecl
))
842 for (cgn
= cgn
->nested
; cgn
; cgn
= cgn
->next_nested
)
843 unshare_body (&DECL_SAVED_TREE (cgn
->decl
), cgn
->decl
);
846 /* Likewise, but mark all trees as not visited. */
849 unvisit_body (tree
*body_p
, tree fndecl
)
851 struct cgraph_node
*cgn
= cgraph_node (fndecl
);
853 walk_tree (body_p
, unmark_visited_r
, NULL
, NULL
);
854 if (body_p
== &DECL_SAVED_TREE (fndecl
))
855 for (cgn
= cgn
->nested
; cgn
; cgn
= cgn
->next_nested
)
856 unvisit_body (&DECL_SAVED_TREE (cgn
->decl
), cgn
->decl
);
859 /* Unshare T and all the trees reached from T via TREE_CHAIN. */
862 unshare_all_trees (tree t
)
864 walk_tree (&t
, copy_if_shared_r
, NULL
, NULL
);
865 walk_tree (&t
, unmark_visited_r
, NULL
, NULL
);
868 /* Unconditionally make an unshared copy of EXPR. This is used when using
869 stored expressions which span multiple functions, such as BINFO_VTABLE,
870 as the normal unsharing process can't tell that they're shared. */
873 unshare_expr (tree expr
)
875 walk_tree (&expr
, mostly_copy_tree_r
, NULL
, NULL
);
879 /* A terser interface for building a representation of an exception
883 gimple_build_eh_filter (tree body
, tree allowed
, tree failure
)
887 /* FIXME should the allowed types go in TREE_TYPE? */
888 t
= build2 (EH_FILTER_EXPR
, void_type_node
, allowed
, NULL_TREE
);
889 append_to_statement_list (failure
, &EH_FILTER_FAILURE (t
));
891 t
= build2 (TRY_CATCH_EXPR
, void_type_node
, NULL_TREE
, t
);
892 append_to_statement_list (body
, &TREE_OPERAND (t
, 0));
898 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
899 contain statements and have a value. Assign its value to a temporary
900 and give it void_type_node. Returns the temporary, or NULL_TREE if
901 WRAPPER was already void. */
904 voidify_wrapper_expr (tree wrapper
, tree temp
)
906 if (!VOID_TYPE_P (TREE_TYPE (wrapper
)))
908 tree
*p
, sub
= wrapper
;
911 /* Set p to point to the body of the wrapper. */
912 switch (TREE_CODE (sub
))
915 /* For a BIND_EXPR, the body is operand 1. */
916 p
= &BIND_EXPR_BODY (sub
);
920 p
= &TREE_OPERAND (sub
, 0);
924 /* Advance to the last statement. Set all container types to void. */
925 if (TREE_CODE (*p
) == STATEMENT_LIST
)
927 tree_stmt_iterator i
= tsi_last (*p
);
928 p
= tsi_end_p (i
) ? NULL
: tsi_stmt_ptr (i
);
932 for (; TREE_CODE (*p
) == COMPOUND_EXPR
; p
= &TREE_OPERAND (*p
, 1))
934 TREE_SIDE_EFFECTS (*p
) = 1;
935 TREE_TYPE (*p
) = void_type_node
;
939 if (p
== NULL
|| IS_EMPTY_STMT (*p
))
941 /* Look through exception handling. */
942 else if (TREE_CODE (*p
) == TRY_FINALLY_EXPR
943 || TREE_CODE (*p
) == TRY_CATCH_EXPR
)
948 /* The C++ frontend already did this for us. */
949 else if (TREE_CODE (*p
) == INIT_EXPR
950 || TREE_CODE (*p
) == TARGET_EXPR
)
951 temp
= TREE_OPERAND (*p
, 0);
952 /* If we're returning a dereference, move the dereference
953 outside the wrapper. */
954 else if (TREE_CODE (*p
) == INDIRECT_REF
)
956 tree ptr
= TREE_OPERAND (*p
, 0);
957 temp
= create_tmp_var (TREE_TYPE (ptr
), "retval");
958 *p
= build2 (MODIFY_EXPR
, TREE_TYPE (ptr
), temp
, ptr
);
959 temp
= build1 (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (temp
)), temp
);
960 /* If this is a BIND_EXPR for a const inline function, it might not
961 have TREE_SIDE_EFFECTS set. That is no longer accurate. */
962 TREE_SIDE_EFFECTS (wrapper
) = 1;
967 temp
= create_tmp_var (TREE_TYPE (wrapper
), "retval");
968 *p
= build2 (MODIFY_EXPR
, TREE_TYPE (temp
), temp
, *p
);
969 TREE_SIDE_EFFECTS (wrapper
) = 1;
972 TREE_TYPE (wrapper
) = void_type_node
;
979 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
980 a temporary through which they communicate. */
983 build_stack_save_restore (tree
*save
, tree
*restore
)
985 tree save_call
, tmp_var
;
988 build_function_call_expr (implicit_built_in_decls
[BUILT_IN_STACK_SAVE
],
990 tmp_var
= create_tmp_var (ptr_type_node
, "saved_stack");
992 *save
= build2 (MODIFY_EXPR
, ptr_type_node
, tmp_var
, save_call
);
994 build_function_call_expr (implicit_built_in_decls
[BUILT_IN_STACK_RESTORE
],
995 tree_cons (NULL_TREE
, tmp_var
, NULL_TREE
));
998 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
1000 static enum gimplify_status
1001 gimplify_bind_expr (tree
*expr_p
, tree temp
, tree
*pre_p
)
1003 tree bind_expr
= *expr_p
;
1004 bool old_save_stack
= gimplify_ctxp
->save_stack
;
1007 temp
= voidify_wrapper_expr (bind_expr
, temp
);
1009 /* Mark variables seen in this bind expr. */
1010 for (t
= BIND_EXPR_VARS (bind_expr
); t
; t
= TREE_CHAIN (t
))
1012 if (TREE_CODE (t
) == VAR_DECL
)
1014 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
1016 /* Mark variable as local. */
1017 if (ctx
&& !is_global_var (t
)
1018 && (! DECL_SEEN_IN_BIND_EXPR_P (t
)
1019 || splay_tree_lookup (ctx
->variables
,
1020 (splay_tree_key
) t
) == NULL
))
1021 omp_add_variable (gimplify_omp_ctxp
, t
, GOVD_LOCAL
| GOVD_SEEN
);
1023 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
1026 /* Preliminarily mark non-addressed complex variables as eligible
1027 for promotion to gimple registers. We'll transform their uses
1029 if (TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
1030 && !TREE_THIS_VOLATILE (t
)
1031 && (TREE_CODE (t
) == VAR_DECL
&& !DECL_HARD_REGISTER (t
))
1032 && !needs_to_live_in_memory (t
))
1033 DECL_COMPLEX_GIMPLE_REG_P (t
) = 1;
1036 gimple_push_bind_expr (bind_expr
);
1037 gimplify_ctxp
->save_stack
= false;
1039 gimplify_to_stmt_list (&BIND_EXPR_BODY (bind_expr
));
1041 if (gimplify_ctxp
->save_stack
)
1043 tree stack_save
, stack_restore
;
1045 /* Save stack on entry and restore it on exit. Add a try_finally
1046 block to achieve this. Note that mudflap depends on the
1047 format of the emitted code: see mx_register_decls(). */
1048 build_stack_save_restore (&stack_save
, &stack_restore
);
1050 t
= build2 (TRY_FINALLY_EXPR
, void_type_node
,
1051 BIND_EXPR_BODY (bind_expr
), NULL_TREE
);
1052 append_to_statement_list (stack_restore
, &TREE_OPERAND (t
, 1));
1054 BIND_EXPR_BODY (bind_expr
) = NULL_TREE
;
1055 append_to_statement_list (stack_save
, &BIND_EXPR_BODY (bind_expr
));
1056 append_to_statement_list (t
, &BIND_EXPR_BODY (bind_expr
));
1059 gimplify_ctxp
->save_stack
= old_save_stack
;
1060 gimple_pop_bind_expr ();
1065 append_to_statement_list (bind_expr
, pre_p
);
1072 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1073 GIMPLE value, it is assigned to a new temporary and the statement is
1074 re-written to return the temporary.
1076 PRE_P points to the list where side effects that must happen before
1077 STMT should be stored. */
1079 static enum gimplify_status
1080 gimplify_return_expr (tree stmt
, tree
*pre_p
)
1082 tree ret_expr
= TREE_OPERAND (stmt
, 0);
1083 tree result_decl
, result
;
1085 if (!ret_expr
|| TREE_CODE (ret_expr
) == RESULT_DECL
1086 || ret_expr
== error_mark_node
)
1089 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
1090 result_decl
= NULL_TREE
;
1093 result_decl
= TREE_OPERAND (ret_expr
, 0);
1094 if (TREE_CODE (result_decl
) == INDIRECT_REF
)
1095 /* See through a return by reference. */
1096 result_decl
= TREE_OPERAND (result_decl
, 0);
1098 gcc_assert ((TREE_CODE (ret_expr
) == MODIFY_EXPR
1099 || TREE_CODE (ret_expr
) == INIT_EXPR
)
1100 && TREE_CODE (result_decl
) == RESULT_DECL
);
1103 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1104 Recall that aggregate_value_p is FALSE for any aggregate type that is
1105 returned in registers. If we're returning values in registers, then
1106 we don't want to extend the lifetime of the RESULT_DECL, particularly
1107 across another call. In addition, for those aggregates for which
1108 hard_function_value generates a PARALLEL, we'll die during normal
1109 expansion of structure assignments; there's special code in expand_return
1110 to handle this case that does not exist in expand_expr. */
1112 || aggregate_value_p (result_decl
, TREE_TYPE (current_function_decl
)))
1113 result
= result_decl
;
1114 else if (gimplify_ctxp
->return_temp
)
1115 result
= gimplify_ctxp
->return_temp
;
1118 result
= create_tmp_var (TREE_TYPE (result_decl
), NULL
);
1120 /* ??? With complex control flow (usually involving abnormal edges),
1121 we can wind up warning about an uninitialized value for this. Due
1122 to how this variable is constructed and initialized, this is never
1123 true. Give up and never warn. */
1124 TREE_NO_WARNING (result
) = 1;
1126 gimplify_ctxp
->return_temp
= result
;
1129 /* Smash the lhs of the MODIFY_EXPR to the temporary we plan to use.
1130 Then gimplify the whole thing. */
1131 if (result
!= result_decl
)
1132 TREE_OPERAND (ret_expr
, 0) = result
;
1134 gimplify_and_add (TREE_OPERAND (stmt
, 0), pre_p
);
1136 /* If we didn't use a temporary, then the result is just the result_decl.
1137 Otherwise we need a simple copy. This should already be gimple. */
1138 if (result
== result_decl
)
1141 ret_expr
= build2 (MODIFY_EXPR
, TREE_TYPE (result
), result_decl
, result
);
1142 TREE_OPERAND (stmt
, 0) = ret_expr
;
1147 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
1148 and initialization explicit. */
1150 static enum gimplify_status
1151 gimplify_decl_expr (tree
*stmt_p
)
1153 tree stmt
= *stmt_p
;
1154 tree decl
= DECL_EXPR_DECL (stmt
);
1156 *stmt_p
= NULL_TREE
;
1158 if (TREE_TYPE (decl
) == error_mark_node
)
1161 if ((TREE_CODE (decl
) == TYPE_DECL
1162 || TREE_CODE (decl
) == VAR_DECL
)
1163 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl
)))
1164 gimplify_type_sizes (TREE_TYPE (decl
), stmt_p
);
1166 if (TREE_CODE (decl
) == VAR_DECL
&& !DECL_EXTERNAL (decl
))
1168 tree init
= DECL_INITIAL (decl
);
1170 if (!TREE_CONSTANT (DECL_SIZE (decl
)))
1172 /* This is a variable-sized decl. Simplify its size and mark it
1173 for deferred expansion. Note that mudflap depends on the format
1174 of the emitted code: see mx_register_decls(). */
1175 tree t
, args
, addr
, ptr_type
;
1177 gimplify_one_sizepos (&DECL_SIZE (decl
), stmt_p
);
1178 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl
), stmt_p
);
1180 /* All occurrences of this decl in final gimplified code will be
1181 replaced by indirection. Setting DECL_VALUE_EXPR does two
1182 things: First, it lets the rest of the gimplifier know what
1183 replacement to use. Second, it lets the debug info know
1184 where to find the value. */
1185 ptr_type
= build_pointer_type (TREE_TYPE (decl
));
1186 addr
= create_tmp_var (ptr_type
, get_name (decl
));
1187 DECL_IGNORED_P (addr
) = 0;
1188 t
= build_fold_indirect_ref (addr
);
1189 SET_DECL_VALUE_EXPR (decl
, t
);
1190 DECL_HAS_VALUE_EXPR_P (decl
) = 1;
1192 args
= tree_cons (NULL
, DECL_SIZE_UNIT (decl
), NULL
);
1193 t
= built_in_decls
[BUILT_IN_ALLOCA
];
1194 t
= build_function_call_expr (t
, args
);
1195 t
= fold_convert (ptr_type
, t
);
1196 t
= build2 (MODIFY_EXPR
, void_type_node
, addr
, t
);
1198 gimplify_and_add (t
, stmt_p
);
1200 /* Indicate that we need to restore the stack level when the
1201 enclosing BIND_EXPR is exited. */
1202 gimplify_ctxp
->save_stack
= true;
1205 if (init
&& init
!= error_mark_node
)
1207 if (!TREE_STATIC (decl
))
1209 DECL_INITIAL (decl
) = NULL_TREE
;
1210 init
= build2 (INIT_EXPR
, void_type_node
, decl
, init
);
1211 gimplify_and_add (init
, stmt_p
);
1214 /* We must still examine initializers for static variables
1215 as they may contain a label address. */
1216 walk_tree (&init
, force_labels_r
, NULL
, NULL
);
1219 /* Some front ends do not explicitly declare all anonymous
1220 artificial variables. We compensate here by declaring the
1221 variables, though it would be better if the front ends would
1222 explicitly declare them. */
1223 if (!DECL_SEEN_IN_BIND_EXPR_P (decl
)
1224 && DECL_ARTIFICIAL (decl
) && DECL_NAME (decl
) == NULL_TREE
)
1225 gimple_add_tmp_var (decl
);
1231 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1232 and replacing the LOOP_EXPR with goto, but if the loop contains an
1233 EXIT_EXPR, we need to append a label for it to jump to. */
1235 static enum gimplify_status
1236 gimplify_loop_expr (tree
*expr_p
, tree
*pre_p
)
1238 tree saved_label
= gimplify_ctxp
->exit_label
;
1239 tree start_label
= build1 (LABEL_EXPR
, void_type_node
, NULL_TREE
);
1240 tree jump_stmt
= build_and_jump (&LABEL_EXPR_LABEL (start_label
));
1242 append_to_statement_list (start_label
, pre_p
);
1244 gimplify_ctxp
->exit_label
= NULL_TREE
;
1246 gimplify_and_add (LOOP_EXPR_BODY (*expr_p
), pre_p
);
1248 if (gimplify_ctxp
->exit_label
)
1250 append_to_statement_list (jump_stmt
, pre_p
);
1251 *expr_p
= build1 (LABEL_EXPR
, void_type_node
, gimplify_ctxp
->exit_label
);
1254 *expr_p
= jump_stmt
;
1256 gimplify_ctxp
->exit_label
= saved_label
;
1261 /* Compare two case labels. Because the front end should already have
1262 made sure that case ranges do not overlap, it is enough to only compare
1263 the CASE_LOW values of each case label. */
1266 compare_case_labels (const void *p1
, const void *p2
)
1268 tree case1
= *(tree
*)p1
;
1269 tree case2
= *(tree
*)p2
;
1271 return tree_int_cst_compare (CASE_LOW (case1
), CASE_LOW (case2
));
1274 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1277 sort_case_labels (tree label_vec
)
1279 size_t len
= TREE_VEC_LENGTH (label_vec
);
1280 tree default_case
= TREE_VEC_ELT (label_vec
, len
- 1);
1282 if (CASE_LOW (default_case
))
1286 /* The last label in the vector should be the default case
1288 for (i
= 0; i
< len
; ++i
)
1290 tree t
= TREE_VEC_ELT (label_vec
, i
);
1294 TREE_VEC_ELT (label_vec
, i
) = TREE_VEC_ELT (label_vec
, len
- 1);
1295 TREE_VEC_ELT (label_vec
, len
- 1) = default_case
;
1301 qsort (&TREE_VEC_ELT (label_vec
, 0), len
- 1, sizeof (tree
),
1302 compare_case_labels
);
1305 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1308 static enum gimplify_status
1309 gimplify_switch_expr (tree
*expr_p
, tree
*pre_p
)
1311 tree switch_expr
= *expr_p
;
1312 enum gimplify_status ret
;
1314 ret
= gimplify_expr (&SWITCH_COND (switch_expr
), pre_p
, NULL
,
1315 is_gimple_val
, fb_rvalue
);
1317 if (SWITCH_BODY (switch_expr
))
1319 VEC(tree
,heap
) *labels
, *saved_labels
;
1320 tree label_vec
, default_case
= NULL_TREE
;
1323 /* If someone can be bothered to fill in the labels, they can
1324 be bothered to null out the body too. */
1325 gcc_assert (!SWITCH_LABELS (switch_expr
));
1327 saved_labels
= gimplify_ctxp
->case_labels
;
1328 gimplify_ctxp
->case_labels
= VEC_alloc (tree
, heap
, 8);
1330 gimplify_to_stmt_list (&SWITCH_BODY (switch_expr
));
1332 labels
= gimplify_ctxp
->case_labels
;
1333 gimplify_ctxp
->case_labels
= saved_labels
;
1336 while (i
< VEC_length (tree
, labels
))
1338 tree elt
= VEC_index (tree
, labels
, i
);
1339 tree low
= CASE_LOW (elt
);
1340 bool remove_element
= FALSE
;
1344 /* Discard empty ranges. */
1345 tree high
= CASE_HIGH (elt
);
1346 if (high
&& INT_CST_LT (high
, low
))
1347 remove_element
= TRUE
;
1351 /* The default case must be the last label in the list. */
1352 gcc_assert (!default_case
);
1354 remove_element
= TRUE
;
1358 VEC_ordered_remove (tree
, labels
, i
);
1364 label_vec
= make_tree_vec (len
+ 1);
1365 SWITCH_LABELS (*expr_p
) = label_vec
;
1366 append_to_statement_list (switch_expr
, pre_p
);
1370 /* If the switch has no default label, add one, so that we jump
1371 around the switch body. */
1372 default_case
= build3 (CASE_LABEL_EXPR
, void_type_node
, NULL_TREE
,
1373 NULL_TREE
, create_artificial_label ());
1374 append_to_statement_list (SWITCH_BODY (switch_expr
), pre_p
);
1375 *expr_p
= build1 (LABEL_EXPR
, void_type_node
,
1376 CASE_LABEL (default_case
));
1379 *expr_p
= SWITCH_BODY (switch_expr
);
1381 for (i
= 0; i
< len
; ++i
)
1382 TREE_VEC_ELT (label_vec
, i
) = VEC_index (tree
, labels
, i
);
1383 TREE_VEC_ELT (label_vec
, len
) = default_case
;
1385 VEC_free (tree
, heap
, labels
);
1387 sort_case_labels (label_vec
);
1389 SWITCH_BODY (switch_expr
) = NULL
;
1392 gcc_assert (SWITCH_LABELS (switch_expr
));
1397 static enum gimplify_status
1398 gimplify_case_label_expr (tree
*expr_p
)
1400 tree expr
= *expr_p
;
1401 struct gimplify_ctx
*ctxp
;
1403 /* Invalid OpenMP programs can play Duff's Device type games with
1404 #pragma omp parallel. At least in the C front end, we don't
1405 detect such invalid branches until after gimplification. */
1406 for (ctxp
= gimplify_ctxp
; ; ctxp
= ctxp
->prev_context
)
1407 if (ctxp
->case_labels
)
1410 VEC_safe_push (tree
, heap
, ctxp
->case_labels
, expr
);
1411 *expr_p
= build1 (LABEL_EXPR
, void_type_node
, CASE_LABEL (expr
));
1415 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1419 build_and_jump (tree
*label_p
)
1421 if (label_p
== NULL
)
1422 /* If there's nowhere to jump, just fall through. */
1425 if (*label_p
== NULL_TREE
)
1427 tree label
= create_artificial_label ();
1431 return build1 (GOTO_EXPR
, void_type_node
, *label_p
);
1434 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1435 This also involves building a label to jump to and communicating it to
1436 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1438 static enum gimplify_status
1439 gimplify_exit_expr (tree
*expr_p
)
1441 tree cond
= TREE_OPERAND (*expr_p
, 0);
1444 expr
= build_and_jump (&gimplify_ctxp
->exit_label
);
1445 expr
= build3 (COND_EXPR
, void_type_node
, cond
, expr
, NULL_TREE
);
1451 /* A helper function to be called via walk_tree. Mark all labels under *TP
1452 as being forced. To be called for DECL_INITIAL of static variables. */
1455 force_labels_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
1459 if (TREE_CODE (*tp
) == LABEL_DECL
)
1460 FORCED_LABEL (*tp
) = 1;
1465 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1466 different from its canonical type, wrap the whole thing inside a
1467 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1470 The canonical type of a COMPONENT_REF is the type of the field being
1471 referenced--unless the field is a bit-field which can be read directly
1472 in a smaller mode, in which case the canonical type is the
1473 sign-appropriate type corresponding to that mode. */
1476 canonicalize_component_ref (tree
*expr_p
)
1478 tree expr
= *expr_p
;
1481 gcc_assert (TREE_CODE (expr
) == COMPONENT_REF
);
1483 if (INTEGRAL_TYPE_P (TREE_TYPE (expr
)))
1484 type
= TREE_TYPE (get_unwidened (expr
, NULL_TREE
));
1486 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
1488 if (TREE_TYPE (expr
) != type
)
1490 tree old_type
= TREE_TYPE (expr
);
1492 /* Set the type of the COMPONENT_REF to the underlying type. */
1493 TREE_TYPE (expr
) = type
;
1495 /* And wrap the whole thing inside a NOP_EXPR. */
1496 expr
= build1 (NOP_EXPR
, old_type
, expr
);
1502 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1503 to foo, embed that change in the ADDR_EXPR by converting
1508 where L is the lower bound. For simplicity, only do this for constant
1512 canonicalize_addr_expr (tree
*expr_p
)
1514 tree expr
= *expr_p
;
1515 tree ctype
= TREE_TYPE (expr
);
1516 tree addr_expr
= TREE_OPERAND (expr
, 0);
1517 tree atype
= TREE_TYPE (addr_expr
);
1518 tree dctype
, datype
, ddatype
, otype
, obj_expr
;
1520 /* Both cast and addr_expr types should be pointers. */
1521 if (!POINTER_TYPE_P (ctype
) || !POINTER_TYPE_P (atype
))
1524 /* The addr_expr type should be a pointer to an array. */
1525 datype
= TREE_TYPE (atype
);
1526 if (TREE_CODE (datype
) != ARRAY_TYPE
)
1529 /* Both cast and addr_expr types should address the same object type. */
1530 dctype
= TREE_TYPE (ctype
);
1531 ddatype
= TREE_TYPE (datype
);
1532 if (!lang_hooks
.types_compatible_p (ddatype
, dctype
))
1535 /* The addr_expr and the object type should match. */
1536 obj_expr
= TREE_OPERAND (addr_expr
, 0);
1537 otype
= TREE_TYPE (obj_expr
);
1538 if (!lang_hooks
.types_compatible_p (otype
, datype
))
1541 /* The lower bound and element sizes must be constant. */
1542 if (!TYPE_SIZE_UNIT (dctype
)
1543 || TREE_CODE (TYPE_SIZE_UNIT (dctype
)) != INTEGER_CST
1544 || !TYPE_DOMAIN (datype
) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))
1545 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))) != INTEGER_CST
)
1548 /* All checks succeeded. Build a new node to merge the cast. */
1549 *expr_p
= build4 (ARRAY_REF
, dctype
, obj_expr
,
1550 TYPE_MIN_VALUE (TYPE_DOMAIN (datype
)),
1551 TYPE_MIN_VALUE (TYPE_DOMAIN (datype
)),
1552 size_binop (EXACT_DIV_EXPR
, TYPE_SIZE_UNIT (dctype
),
1553 size_int (TYPE_ALIGN_UNIT (dctype
))));
1554 *expr_p
= build1 (ADDR_EXPR
, ctype
, *expr_p
);
1557 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1558 underneath as appropriate. */
1560 static enum gimplify_status
1561 gimplify_conversion (tree
*expr_p
)
1563 gcc_assert (TREE_CODE (*expr_p
) == NOP_EXPR
1564 || TREE_CODE (*expr_p
) == CONVERT_EXPR
);
1566 /* Then strip away all but the outermost conversion. */
1567 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p
, 0));
1569 /* And remove the outermost conversion if it's useless. */
1570 if (tree_ssa_useless_type_conversion (*expr_p
))
1571 *expr_p
= TREE_OPERAND (*expr_p
, 0);
1573 /* If we still have a conversion at the toplevel,
1574 then canonicalize some constructs. */
1575 if (TREE_CODE (*expr_p
) == NOP_EXPR
|| TREE_CODE (*expr_p
) == CONVERT_EXPR
)
1577 tree sub
= TREE_OPERAND (*expr_p
, 0);
1579 /* If a NOP conversion is changing the type of a COMPONENT_REF
1580 expression, then canonicalize its type now in order to expose more
1581 redundant conversions. */
1582 if (TREE_CODE (sub
) == COMPONENT_REF
)
1583 canonicalize_component_ref (&TREE_OPERAND (*expr_p
, 0));
1585 /* If a NOP conversion is changing a pointer to array of foo
1586 to a pointer to foo, embed that change in the ADDR_EXPR. */
1587 else if (TREE_CODE (sub
) == ADDR_EXPR
)
1588 canonicalize_addr_expr (expr_p
);
1594 /* Gimplify a VAR_DECL or PARM_DECL. Returns GS_OK if we expanded a
1595 DECL_VALUE_EXPR, and it's worth re-examining things. */
1597 static enum gimplify_status
1598 gimplify_var_or_parm_decl (tree
*expr_p
)
1600 tree decl
= *expr_p
;
1602 /* ??? If this is a local variable, and it has not been seen in any
1603 outer BIND_EXPR, then it's probably the result of a duplicate
1604 declaration, for which we've already issued an error. It would
1605 be really nice if the front end wouldn't leak these at all.
1606 Currently the only known culprit is C++ destructors, as seen
1607 in g++.old-deja/g++.jason/binding.C. */
1608 if (TREE_CODE (decl
) == VAR_DECL
1609 && !DECL_SEEN_IN_BIND_EXPR_P (decl
)
1610 && !TREE_STATIC (decl
) && !DECL_EXTERNAL (decl
)
1611 && decl_function_context (decl
) == current_function_decl
)
1613 gcc_assert (errorcount
|| sorrycount
);
1617 /* When within an OpenMP context, notice uses of variables. */
1618 if (gimplify_omp_ctxp
&& omp_notice_variable (gimplify_omp_ctxp
, decl
, true))
1621 /* If the decl is an alias for another expression, substitute it now. */
1622 if (DECL_HAS_VALUE_EXPR_P (decl
))
1624 *expr_p
= unshare_expr (DECL_VALUE_EXPR (decl
));
1632 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1633 node pointed to by EXPR_P.
1636 : min_lval '[' val ']'
1638 | compound_lval '[' val ']'
1639 | compound_lval '.' ID
1641 This is not part of the original SIMPLE definition, which separates
1642 array and member references, but it seems reasonable to handle them
1643 together. Also, this way we don't run into problems with union
1644 aliasing; gcc requires that for accesses through a union to alias, the
1645 union reference must be explicit, which was not always the case when we
1646 were splitting up array and member refs.
1648 PRE_P points to the list where side effects that must happen before
1649 *EXPR_P should be stored.
1651 POST_P points to the list where side effects that must happen after
1652 *EXPR_P should be stored. */
1654 static enum gimplify_status
1655 gimplify_compound_lval (tree
*expr_p
, tree
*pre_p
,
1656 tree
*post_p
, fallback_t fallback
)
1659 VEC(tree
,heap
) *stack
;
1660 enum gimplify_status ret
= GS_OK
, tret
;
1663 /* Create a stack of the subexpressions so later we can walk them in
1664 order from inner to outer. */
1665 stack
= VEC_alloc (tree
, heap
, 10);
1667 /* We can handle anything that get_inner_reference can deal with. */
1668 for (p
= expr_p
; ; p
= &TREE_OPERAND (*p
, 0))
1671 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1672 if (TREE_CODE (*p
) == INDIRECT_REF
)
1673 *p
= fold_indirect_ref (*p
);
1675 if (handled_component_p (*p
))
1677 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
1678 additional COMPONENT_REFs. */
1679 else if ((TREE_CODE (*p
) == VAR_DECL
|| TREE_CODE (*p
) == PARM_DECL
)
1680 && gimplify_var_or_parm_decl (p
) == GS_OK
)
1685 VEC_safe_push (tree
, heap
, stack
, *p
);
1688 gcc_assert (VEC_length (tree
, stack
));
1690 /* Now STACK is a stack of pointers to all the refs we've walked through
1691 and P points to the innermost expression.
1693 Java requires that we elaborated nodes in source order. That
1694 means we must gimplify the inner expression followed by each of
1695 the indices, in order. But we can't gimplify the inner
1696 expression until we deal with any variable bounds, sizes, or
1697 positions in order to deal with PLACEHOLDER_EXPRs.
1699 So we do this in three steps. First we deal with the annotations
1700 for any variables in the components, then we gimplify the base,
1701 then we gimplify any indices, from left to right. */
1702 for (i
= VEC_length (tree
, stack
) - 1; i
>= 0; i
--)
1704 tree t
= VEC_index (tree
, stack
, i
);
1706 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
1708 /* Gimplify the low bound and element type size and put them into
1709 the ARRAY_REF. If these values are set, they have already been
1711 if (!TREE_OPERAND (t
, 2))
1713 tree low
= unshare_expr (array_ref_low_bound (t
));
1714 if (!is_gimple_min_invariant (low
))
1716 TREE_OPERAND (t
, 2) = low
;
1717 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
1718 is_gimple_formal_tmp_reg
, fb_rvalue
);
1719 ret
= MIN (ret
, tret
);
1723 if (!TREE_OPERAND (t
, 3))
1725 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (t
, 0)));
1726 tree elmt_size
= unshare_expr (array_ref_element_size (t
));
1727 tree factor
= size_int (TYPE_ALIGN_UNIT (elmt_type
));
1729 /* Divide the element size by the alignment of the element
1731 elmt_size
= size_binop (EXACT_DIV_EXPR
, elmt_size
, factor
);
1733 if (!is_gimple_min_invariant (elmt_size
))
1735 TREE_OPERAND (t
, 3) = elmt_size
;
1736 tret
= gimplify_expr (&TREE_OPERAND (t
, 3), pre_p
, post_p
,
1737 is_gimple_formal_tmp_reg
, fb_rvalue
);
1738 ret
= MIN (ret
, tret
);
1742 else if (TREE_CODE (t
) == COMPONENT_REF
)
1744 /* Set the field offset into T and gimplify it. */
1745 if (!TREE_OPERAND (t
, 2))
1747 tree offset
= unshare_expr (component_ref_field_offset (t
));
1748 tree field
= TREE_OPERAND (t
, 1);
1750 = size_int (DECL_OFFSET_ALIGN (field
) / BITS_PER_UNIT
);
1752 /* Divide the offset by its alignment. */
1753 offset
= size_binop (EXACT_DIV_EXPR
, offset
, factor
);
1755 if (!is_gimple_min_invariant (offset
))
1757 TREE_OPERAND (t
, 2) = offset
;
1758 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
1759 is_gimple_formal_tmp_reg
, fb_rvalue
);
1760 ret
= MIN (ret
, tret
);
1766 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
1767 so as to match the min_lval predicate. Failure to do so may result
1768 in the creation of large aggregate temporaries. */
1769 tret
= gimplify_expr (p
, pre_p
, post_p
, is_gimple_min_lval
,
1770 fallback
| fb_lvalue
);
1771 ret
= MIN (ret
, tret
);
1773 /* And finally, the indices and operands to BIT_FIELD_REF. During this
1774 loop we also remove any useless conversions. */
1775 for (; VEC_length (tree
, stack
) > 0; )
1777 tree t
= VEC_pop (tree
, stack
);
1779 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
1781 /* Gimplify the dimension.
1782 Temporary fix for gcc.c-torture/execute/20040313-1.c.
1783 Gimplify non-constant array indices into a temporary
1785 FIXME - The real fix is to gimplify post-modify
1786 expressions into a minimal gimple lvalue. However, that
1787 exposes bugs in alias analysis. The alias analyzer does
1788 not handle &PTR->FIELD very well. Will fix after the
1789 branch is merged into mainline (dnovillo 2004-05-03). */
1790 if (!is_gimple_min_invariant (TREE_OPERAND (t
, 1)))
1792 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), pre_p
, post_p
,
1793 is_gimple_formal_tmp_reg
, fb_rvalue
);
1794 ret
= MIN (ret
, tret
);
1797 else if (TREE_CODE (t
) == BIT_FIELD_REF
)
1799 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), pre_p
, post_p
,
1800 is_gimple_val
, fb_rvalue
);
1801 ret
= MIN (ret
, tret
);
1802 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
1803 is_gimple_val
, fb_rvalue
);
1804 ret
= MIN (ret
, tret
);
1807 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t
, 0));
1809 /* The innermost expression P may have originally had TREE_SIDE_EFFECTS
1810 set which would have caused all the outer expressions in EXPR_P
1811 leading to P to also have had TREE_SIDE_EFFECTS set. */
1812 recalculate_side_effects (t
);
1815 tret
= gimplify_expr (p
, pre_p
, post_p
, is_gimple_min_lval
, fallback
);
1816 ret
= MIN (ret
, tret
);
1818 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
1819 if ((fallback
& fb_rvalue
) && TREE_CODE (*expr_p
) == COMPONENT_REF
)
1821 canonicalize_component_ref (expr_p
);
1822 ret
= MIN (ret
, GS_OK
);
1825 VEC_free (tree
, heap
, stack
);
1830 /* Gimplify the self modifying expression pointed to by EXPR_P
1833 PRE_P points to the list where side effects that must happen before
1834 *EXPR_P should be stored.
1836 POST_P points to the list where side effects that must happen after
1837 *EXPR_P should be stored.
1839 WANT_VALUE is nonzero iff we want to use the value of this expression
1840 in another expression. */
1842 static enum gimplify_status
1843 gimplify_self_mod_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
,
1846 enum tree_code code
;
1847 tree lhs
, lvalue
, rhs
, t1
;
1849 enum tree_code arith_code
;
1850 enum gimplify_status ret
;
1852 code
= TREE_CODE (*expr_p
);
1854 gcc_assert (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
1855 || code
== PREINCREMENT_EXPR
|| code
== PREDECREMENT_EXPR
);
1857 /* Prefix or postfix? */
1858 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
1859 /* Faster to treat as prefix if result is not used. */
1860 postfix
= want_value
;
1864 /* Add or subtract? */
1865 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
1866 arith_code
= PLUS_EXPR
;
1868 arith_code
= MINUS_EXPR
;
1870 /* Gimplify the LHS into a GIMPLE lvalue. */
1871 lvalue
= TREE_OPERAND (*expr_p
, 0);
1872 ret
= gimplify_expr (&lvalue
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
1873 if (ret
== GS_ERROR
)
1876 /* Extract the operands to the arithmetic operation. */
1878 rhs
= TREE_OPERAND (*expr_p
, 1);
1880 /* For postfix operator, we evaluate the LHS to an rvalue and then use
1881 that as the result value and in the postqueue operation. */
1884 ret
= gimplify_expr (&lhs
, pre_p
, post_p
, is_gimple_val
, fb_rvalue
);
1885 if (ret
== GS_ERROR
)
1889 t1
= build2 (arith_code
, TREE_TYPE (*expr_p
), lhs
, rhs
);
1890 t1
= build2 (MODIFY_EXPR
, TREE_TYPE (lvalue
), lvalue
, t1
);
1894 gimplify_and_add (t1
, post_p
);
1905 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
1908 maybe_with_size_expr (tree
*expr_p
)
1910 tree expr
= *expr_p
;
1911 tree type
= TREE_TYPE (expr
);
1914 /* If we've already wrapped this or the type is error_mark_node, we can't do
1916 if (TREE_CODE (expr
) == WITH_SIZE_EXPR
1917 || type
== error_mark_node
)
1920 /* If the size isn't known or is a constant, we have nothing to do. */
1921 size
= TYPE_SIZE_UNIT (type
);
1922 if (!size
|| TREE_CODE (size
) == INTEGER_CST
)
1925 /* Otherwise, make a WITH_SIZE_EXPR. */
1926 size
= unshare_expr (size
);
1927 size
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (size
, expr
);
1928 *expr_p
= build2 (WITH_SIZE_EXPR
, type
, expr
, size
);
1931 /* Subroutine of gimplify_call_expr: Gimplify a single argument. */
1933 static enum gimplify_status
1934 gimplify_arg (tree
*expr_p
, tree
*pre_p
)
1936 bool (*test
) (tree
);
1939 /* In general, we allow lvalues for function arguments to avoid
1940 extra overhead of copying large aggregates out of even larger
1941 aggregates into temporaries only to copy the temporaries to
1942 the argument list. Make optimizers happy by pulling out to
1943 temporaries those types that fit in registers. */
1944 if (is_gimple_reg_type (TREE_TYPE (*expr_p
)))
1945 test
= is_gimple_val
, fb
= fb_rvalue
;
1947 test
= is_gimple_lvalue
, fb
= fb_either
;
1949 /* If this is a variable sized type, we must remember the size. */
1950 maybe_with_size_expr (expr_p
);
1952 /* There is a sequence point before a function call. Side effects in
1953 the argument list must occur before the actual call. So, when
1954 gimplifying arguments, force gimplify_expr to use an internal
1955 post queue which is then appended to the end of PRE_P. */
1956 return gimplify_expr (expr_p
, pre_p
, NULL
, test
, fb
);
1959 /* Gimplify the CALL_EXPR node pointed to by EXPR_P. PRE_P points to the
1960 list where side effects that must happen before *EXPR_P should be stored.
1961 WANT_VALUE is true if the result of the call is desired. */
1963 static enum gimplify_status
1964 gimplify_call_expr (tree
*expr_p
, tree
*pre_p
, bool want_value
)
1968 enum gimplify_status ret
;
1970 gcc_assert (TREE_CODE (*expr_p
) == CALL_EXPR
);
1972 /* For reliable diagnostics during inlining, it is necessary that
1973 every call_expr be annotated with file and line. */
1974 if (! EXPR_HAS_LOCATION (*expr_p
))
1975 SET_EXPR_LOCATION (*expr_p
, input_location
);
1977 /* This may be a call to a builtin function.
1979 Builtin function calls may be transformed into different
1980 (and more efficient) builtin function calls under certain
1981 circumstances. Unfortunately, gimplification can muck things
1982 up enough that the builtin expanders are not aware that certain
1983 transformations are still valid.
1985 So we attempt transformation/gimplification of the call before
1986 we gimplify the CALL_EXPR. At this time we do not manage to
1987 transform all calls in the same manner as the expanders do, but
1988 we do transform most of them. */
1989 decl
= get_callee_fndecl (*expr_p
);
1990 if (decl
&& DECL_BUILT_IN (decl
))
1992 tree arglist
= TREE_OPERAND (*expr_p
, 1);
1993 tree
new = fold_builtin (decl
, arglist
, !want_value
);
1995 if (new && new != *expr_p
)
1997 /* There was a transformation of this call which computes the
1998 same value, but in a more efficient way. Return and try
2004 if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
2005 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_START
)
2007 if (!arglist
|| !TREE_CHAIN (arglist
))
2009 error ("too few arguments to function %<va_start%>");
2010 *expr_p
= build_empty_stmt ();
2014 if (fold_builtin_next_arg (TREE_CHAIN (arglist
)))
2016 *expr_p
= build_empty_stmt ();
2019 /* Avoid gimplifying the second argument to va_start, which needs
2020 to be the plain PARM_DECL. */
2021 return gimplify_arg (&TREE_VALUE (TREE_OPERAND (*expr_p
, 1)), pre_p
);
2025 /* There is a sequence point before the call, so any side effects in
2026 the calling expression must occur before the actual call. Force
2027 gimplify_expr to use an internal post queue. */
2028 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, NULL
,
2029 is_gimple_call_addr
, fb_rvalue
);
2031 if (PUSH_ARGS_REVERSED
)
2032 TREE_OPERAND (*expr_p
, 1) = nreverse (TREE_OPERAND (*expr_p
, 1));
2033 for (arglist
= TREE_OPERAND (*expr_p
, 1); arglist
;
2034 arglist
= TREE_CHAIN (arglist
))
2036 enum gimplify_status t
;
2038 t
= gimplify_arg (&TREE_VALUE (arglist
), pre_p
);
2043 if (PUSH_ARGS_REVERSED
)
2044 TREE_OPERAND (*expr_p
, 1) = nreverse (TREE_OPERAND (*expr_p
, 1));
2046 /* Try this again in case gimplification exposed something. */
2047 if (ret
!= GS_ERROR
)
2049 decl
= get_callee_fndecl (*expr_p
);
2050 if (decl
&& DECL_BUILT_IN (decl
))
2052 tree arglist
= TREE_OPERAND (*expr_p
, 1);
2053 tree
new = fold_builtin (decl
, arglist
, !want_value
);
2055 if (new && new != *expr_p
)
2057 /* There was a transformation of this call which computes the
2058 same value, but in a more efficient way. Return and try
2066 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2067 decl. This allows us to eliminate redundant or useless
2068 calls to "const" functions. */
2069 if (TREE_CODE (*expr_p
) == CALL_EXPR
2070 && (call_expr_flags (*expr_p
) & (ECF_CONST
| ECF_PURE
)))
2071 TREE_SIDE_EFFECTS (*expr_p
) = 0;
2076 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2077 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2079 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2080 condition is true or false, respectively. If null, we should generate
2081 our own to skip over the evaluation of this specific expression.
2083 This function is the tree equivalent of do_jump.
2085 shortcut_cond_r should only be called by shortcut_cond_expr. */
2088 shortcut_cond_r (tree pred
, tree
*true_label_p
, tree
*false_label_p
)
2090 tree local_label
= NULL_TREE
;
2091 tree t
, expr
= NULL
;
2093 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2094 retain the shortcut semantics. Just insert the gotos here;
2095 shortcut_cond_expr will append the real blocks later. */
2096 if (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2098 /* Turn if (a && b) into
2100 if (a); else goto no;
2101 if (b) goto yes; else goto no;
2104 if (false_label_p
== NULL
)
2105 false_label_p
= &local_label
;
2107 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), NULL
, false_label_p
);
2108 append_to_statement_list (t
, &expr
);
2110 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2112 append_to_statement_list (t
, &expr
);
2114 else if (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2116 /* Turn if (a || b) into
2119 if (b) goto yes; else goto no;
2122 if (true_label_p
== NULL
)
2123 true_label_p
= &local_label
;
2125 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), true_label_p
, NULL
);
2126 append_to_statement_list (t
, &expr
);
2128 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2130 append_to_statement_list (t
, &expr
);
2132 else if (TREE_CODE (pred
) == COND_EXPR
)
2134 /* As long as we're messing with gotos, turn if (a ? b : c) into
2136 if (b) goto yes; else goto no;
2138 if (c) goto yes; else goto no; */
2139 expr
= build3 (COND_EXPR
, void_type_node
, TREE_OPERAND (pred
, 0),
2140 shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2142 shortcut_cond_r (TREE_OPERAND (pred
, 2), true_label_p
,
2147 expr
= build3 (COND_EXPR
, void_type_node
, pred
,
2148 build_and_jump (true_label_p
),
2149 build_and_jump (false_label_p
));
2154 t
= build1 (LABEL_EXPR
, void_type_node
, local_label
);
2155 append_to_statement_list (t
, &expr
);
2162 shortcut_cond_expr (tree expr
)
2164 tree pred
= TREE_OPERAND (expr
, 0);
2165 tree then_
= TREE_OPERAND (expr
, 1);
2166 tree else_
= TREE_OPERAND (expr
, 2);
2167 tree true_label
, false_label
, end_label
, t
;
2169 tree
*false_label_p
;
2170 bool emit_end
, emit_false
, jump_over_else
;
2171 bool then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2172 bool else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2174 /* First do simple transformations. */
2177 /* If there is no 'else', turn (a && b) into if (a) if (b). */
2178 while (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2180 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2181 then_
= shortcut_cond_expr (expr
);
2182 then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2183 pred
= TREE_OPERAND (pred
, 0);
2184 expr
= build3 (COND_EXPR
, void_type_node
, pred
, then_
, NULL_TREE
);
2189 /* If there is no 'then', turn
2192 if (a); else if (b); else d. */
2193 while (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2195 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2196 else_
= shortcut_cond_expr (expr
);
2197 else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2198 pred
= TREE_OPERAND (pred
, 0);
2199 expr
= build3 (COND_EXPR
, void_type_node
, pred
, NULL_TREE
, else_
);
2203 /* If we're done, great. */
2204 if (TREE_CODE (pred
) != TRUTH_ANDIF_EXPR
2205 && TREE_CODE (pred
) != TRUTH_ORIF_EXPR
)
2208 /* Otherwise we need to mess with gotos. Change
2211 if (a); else goto no;
2214 and recursively gimplify the condition. */
2216 true_label
= false_label
= end_label
= NULL_TREE
;
2218 /* If our arms just jump somewhere, hijack those labels so we don't
2219 generate jumps to jumps. */
2222 && TREE_CODE (then_
) == GOTO_EXPR
2223 && TREE_CODE (GOTO_DESTINATION (then_
)) == LABEL_DECL
)
2225 true_label
= GOTO_DESTINATION (then_
);
2231 && TREE_CODE (else_
) == GOTO_EXPR
2232 && TREE_CODE (GOTO_DESTINATION (else_
)) == LABEL_DECL
)
2234 false_label
= GOTO_DESTINATION (else_
);
2239 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2241 true_label_p
= &true_label
;
2243 true_label_p
= NULL
;
2245 /* The 'else' branch also needs a label if it contains interesting code. */
2246 if (false_label
|| else_se
)
2247 false_label_p
= &false_label
;
2249 false_label_p
= NULL
;
2251 /* If there was nothing else in our arms, just forward the label(s). */
2252 if (!then_se
&& !else_se
)
2253 return shortcut_cond_r (pred
, true_label_p
, false_label_p
);
2255 /* If our last subexpression already has a terminal label, reuse it. */
2257 expr
= expr_last (else_
);
2259 expr
= expr_last (then_
);
2262 if (expr
&& TREE_CODE (expr
) == LABEL_EXPR
)
2263 end_label
= LABEL_EXPR_LABEL (expr
);
2265 /* If we don't care about jumping to the 'else' branch, jump to the end
2266 if the condition is false. */
2268 false_label_p
= &end_label
;
2270 /* We only want to emit these labels if we aren't hijacking them. */
2271 emit_end
= (end_label
== NULL_TREE
);
2272 emit_false
= (false_label
== NULL_TREE
);
2274 /* We only emit the jump over the else clause if we have to--if the
2275 then clause may fall through. Otherwise we can wind up with a
2276 useless jump and a useless label at the end of gimplified code,
2277 which will cause us to think that this conditional as a whole
2278 falls through even if it doesn't. If we then inline a function
2279 which ends with such a condition, that can cause us to issue an
2280 inappropriate warning about control reaching the end of a
2281 non-void function. */
2282 jump_over_else
= block_may_fallthru (then_
);
2284 pred
= shortcut_cond_r (pred
, true_label_p
, false_label_p
);
2287 append_to_statement_list (pred
, &expr
);
2289 append_to_statement_list (then_
, &expr
);
2294 t
= build_and_jump (&end_label
);
2295 append_to_statement_list (t
, &expr
);
2299 t
= build1 (LABEL_EXPR
, void_type_node
, false_label
);
2300 append_to_statement_list (t
, &expr
);
2302 append_to_statement_list (else_
, &expr
);
2304 if (emit_end
&& end_label
)
2306 t
= build1 (LABEL_EXPR
, void_type_node
, end_label
);
2307 append_to_statement_list (t
, &expr
);
2313 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2316 gimple_boolify (tree expr
)
2318 tree type
= TREE_TYPE (expr
);
2320 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
2323 switch (TREE_CODE (expr
))
2325 case TRUTH_AND_EXPR
:
2327 case TRUTH_XOR_EXPR
:
2328 case TRUTH_ANDIF_EXPR
:
2329 case TRUTH_ORIF_EXPR
:
2330 /* Also boolify the arguments of truth exprs. */
2331 TREE_OPERAND (expr
, 1) = gimple_boolify (TREE_OPERAND (expr
, 1));
2334 case TRUTH_NOT_EXPR
:
2335 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
2338 case EQ_EXPR
: case NE_EXPR
:
2339 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
2340 /* These expressions always produce boolean results. */
2341 TREE_TYPE (expr
) = boolean_type_node
;
2345 /* Other expressions that get here must have boolean values, but
2346 might need to be converted to the appropriate mode. */
2347 return fold_convert (boolean_type_node
, expr
);
2351 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2360 The second form is used when *EXPR_P is of type void.
2362 TARGET is the tree for T1 above.
2364 PRE_P points to the list where side effects that must happen before
2365 *EXPR_P should be stored. */
2367 static enum gimplify_status
2368 gimplify_cond_expr (tree
*expr_p
, tree
*pre_p
, fallback_t fallback
)
2370 tree expr
= *expr_p
;
2371 tree tmp
, tmp2
, type
;
2372 enum gimplify_status ret
;
2374 type
= TREE_TYPE (expr
);
2376 /* If this COND_EXPR has a value, copy the values into a temporary within
2378 if (! VOID_TYPE_P (type
))
2382 if ((fallback
& fb_lvalue
) == 0)
2384 result
= tmp2
= tmp
= create_tmp_var (TREE_TYPE (expr
), "iftmp");
2389 tree type
= build_pointer_type (TREE_TYPE (expr
));
2391 if (TREE_TYPE (TREE_OPERAND (expr
, 1)) != void_type_node
)
2392 TREE_OPERAND (expr
, 1) =
2393 build_fold_addr_expr (TREE_OPERAND (expr
, 1));
2395 if (TREE_TYPE (TREE_OPERAND (expr
, 2)) != void_type_node
)
2396 TREE_OPERAND (expr
, 2) =
2397 build_fold_addr_expr (TREE_OPERAND (expr
, 2));
2399 tmp2
= tmp
= create_tmp_var (type
, "iftmp");
2401 expr
= build3 (COND_EXPR
, void_type_node
, TREE_OPERAND (expr
, 0),
2402 TREE_OPERAND (expr
, 1), TREE_OPERAND (expr
, 2));
2404 result
= build_fold_indirect_ref (tmp
);
2408 /* Build the then clause, 't1 = a;'. But don't build an assignment
2409 if this branch is void; in C++ it can be, if it's a throw. */
2410 if (TREE_TYPE (TREE_OPERAND (expr
, 1)) != void_type_node
)
2411 TREE_OPERAND (expr
, 1)
2412 = build2 (MODIFY_EXPR
, void_type_node
, tmp
, TREE_OPERAND (expr
, 1));
2414 /* Build the else clause, 't1 = b;'. */
2415 if (TREE_TYPE (TREE_OPERAND (expr
, 2)) != void_type_node
)
2416 TREE_OPERAND (expr
, 2)
2417 = build2 (MODIFY_EXPR
, void_type_node
, tmp2
, TREE_OPERAND (expr
, 2));
2419 TREE_TYPE (expr
) = void_type_node
;
2420 recalculate_side_effects (expr
);
2422 /* Move the COND_EXPR to the prequeue. */
2423 gimplify_and_add (expr
, pre_p
);
2429 /* Make sure the condition has BOOLEAN_TYPE. */
2430 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
2432 /* Break apart && and || conditions. */
2433 if (TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ANDIF_EXPR
2434 || TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ORIF_EXPR
)
2436 expr
= shortcut_cond_expr (expr
);
2438 if (expr
!= *expr_p
)
2442 /* We can't rely on gimplify_expr to re-gimplify the expanded
2443 form properly, as cleanups might cause the target labels to be
2444 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2445 set up a conditional context. */
2446 gimple_push_condition ();
2447 gimplify_stmt (expr_p
);
2448 gimple_pop_condition (pre_p
);
2454 /* Now do the normal gimplification. */
2455 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, NULL
,
2456 is_gimple_condexpr
, fb_rvalue
);
2458 gimple_push_condition ();
2460 gimplify_to_stmt_list (&TREE_OPERAND (expr
, 1));
2461 gimplify_to_stmt_list (&TREE_OPERAND (expr
, 2));
2462 recalculate_side_effects (expr
);
2464 gimple_pop_condition (pre_p
);
2466 if (ret
== GS_ERROR
)
2468 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
2470 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 2)))
2471 /* Rewrite "if (a); else b" to "if (!a) b" */
2473 TREE_OPERAND (expr
, 0) = invert_truthvalue (TREE_OPERAND (expr
, 0));
2474 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, NULL
,
2475 is_gimple_condexpr
, fb_rvalue
);
2477 tmp
= TREE_OPERAND (expr
, 1);
2478 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 2);
2479 TREE_OPERAND (expr
, 2) = tmp
;
2482 /* Both arms are empty; replace the COND_EXPR with its predicate. */
2483 expr
= TREE_OPERAND (expr
, 0);
2489 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2490 a call to __builtin_memcpy. */
2492 static enum gimplify_status
2493 gimplify_modify_expr_to_memcpy (tree
*expr_p
, tree size
, bool want_value
)
2495 tree args
, t
, to
, to_ptr
, from
;
2497 to
= TREE_OPERAND (*expr_p
, 0);
2498 from
= TREE_OPERAND (*expr_p
, 1);
2500 args
= tree_cons (NULL
, size
, NULL
);
2502 t
= build_fold_addr_expr (from
);
2503 args
= tree_cons (NULL
, t
, args
);
2505 to_ptr
= build_fold_addr_expr (to
);
2506 args
= tree_cons (NULL
, to_ptr
, args
);
2507 t
= implicit_built_in_decls
[BUILT_IN_MEMCPY
];
2508 t
= build_function_call_expr (t
, args
);
2512 t
= build1 (NOP_EXPR
, TREE_TYPE (to_ptr
), t
);
2513 t
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
2520 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2521 a call to __builtin_memset. In this case we know that the RHS is
2522 a CONSTRUCTOR with an empty element list. */
2524 static enum gimplify_status
2525 gimplify_modify_expr_to_memset (tree
*expr_p
, tree size
, bool want_value
)
2527 tree args
, t
, to
, to_ptr
;
2529 to
= TREE_OPERAND (*expr_p
, 0);
2531 args
= tree_cons (NULL
, size
, NULL
);
2533 args
= tree_cons (NULL
, integer_zero_node
, args
);
2535 to_ptr
= build_fold_addr_expr (to
);
2536 args
= tree_cons (NULL
, to_ptr
, args
);
2537 t
= implicit_built_in_decls
[BUILT_IN_MEMSET
];
2538 t
= build_function_call_expr (t
, args
);
2542 t
= build1 (NOP_EXPR
, TREE_TYPE (to_ptr
), t
);
2543 t
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
2550 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
2551 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
2552 assignment. Returns non-null if we detect a potential overlap. */
2554 struct gimplify_init_ctor_preeval_data
2556 /* The base decl of the lhs object. May be NULL, in which case we
2557 have to assume the lhs is indirect. */
2560 /* The alias set of the lhs object. */
2565 gimplify_init_ctor_preeval_1 (tree
*tp
, int *walk_subtrees
, void *xdata
)
2567 struct gimplify_init_ctor_preeval_data
*data
2568 = (struct gimplify_init_ctor_preeval_data
*) xdata
;
2571 /* If we find the base object, obviously we have overlap. */
2572 if (data
->lhs_base_decl
== t
)
2575 /* If the constructor component is indirect, determine if we have a
2576 potential overlap with the lhs. The only bits of information we
2577 have to go on at this point are addressability and alias sets. */
2578 if (TREE_CODE (t
) == INDIRECT_REF
2579 && (!data
->lhs_base_decl
|| TREE_ADDRESSABLE (data
->lhs_base_decl
))
2580 && alias_sets_conflict_p (data
->lhs_alias_set
, get_alias_set (t
)))
2583 if (IS_TYPE_OR_DECL_P (t
))
2588 /* A subroutine of gimplify_init_constructor. Pre-evaluate *EXPR_P,
2589 force values that overlap with the lhs (as described by *DATA)
2590 into temporaries. */
2593 gimplify_init_ctor_preeval (tree
*expr_p
, tree
*pre_p
, tree
*post_p
,
2594 struct gimplify_init_ctor_preeval_data
*data
)
2596 enum gimplify_status one
;
2598 /* If the value is invariant, then there's nothing to pre-evaluate.
2599 But ensure it doesn't have any side-effects since a SAVE_EXPR is
2600 invariant but has side effects and might contain a reference to
2601 the object we're initializing. */
2602 if (TREE_INVARIANT (*expr_p
) && !TREE_SIDE_EFFECTS (*expr_p
))
2605 /* If the type has non-trivial constructors, we can't pre-evaluate. */
2606 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p
)))
2609 /* Recurse for nested constructors. */
2610 if (TREE_CODE (*expr_p
) == CONSTRUCTOR
)
2612 unsigned HOST_WIDE_INT ix
;
2613 constructor_elt
*ce
;
2614 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (*expr_p
);
2616 for (ix
= 0; VEC_iterate (constructor_elt
, v
, ix
, ce
); ix
++)
2617 gimplify_init_ctor_preeval (&ce
->value
, pre_p
, post_p
, data
);
2621 /* We can't preevaluate if the type contains a placeholder. */
2622 if (type_contains_placeholder_p (TREE_TYPE (*expr_p
)))
2625 /* Gimplify the constructor element to something appropriate for the rhs
2626 of a MODIFY_EXPR. Given that we know the lhs is an aggregate, we know
2627 the gimplifier will consider this a store to memory. Doing this
2628 gimplification now means that we won't have to deal with complicated
2629 language-specific trees, nor trees like SAVE_EXPR that can induce
2630 exponential search behavior. */
2631 one
= gimplify_expr (expr_p
, pre_p
, post_p
, is_gimple_mem_rhs
, fb_rvalue
);
2632 if (one
== GS_ERROR
)
2638 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
2639 with the lhs, since "a = { .x=a }" doesn't make sense. This will
2640 always be true for all scalars, since is_gimple_mem_rhs insists on a
2641 temporary variable for them. */
2642 if (DECL_P (*expr_p
))
2645 /* If this is of variable size, we have no choice but to assume it doesn't
2646 overlap since we can't make a temporary for it. */
2647 if (!TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (*expr_p
))))
2650 /* Otherwise, we must search for overlap ... */
2651 if (!walk_tree (expr_p
, gimplify_init_ctor_preeval_1
, data
, NULL
))
2654 /* ... and if found, force the value into a temporary. */
2655 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
2658 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
2659 a RANGE_EXPR in a CONSTRUCTOR for an array.
2663 object[var] = value;
2670 We increment var _after_ the loop exit check because we might otherwise
2671 fail if upper == TYPE_MAX_VALUE (type for upper).
2673 Note that we never have to deal with SAVE_EXPRs here, because this has
2674 already been taken care of for us, in gimplify_init_ctor_preeval(). */
2676 static void gimplify_init_ctor_eval (tree
, VEC(constructor_elt
,gc
) *,
2680 gimplify_init_ctor_eval_range (tree object
, tree lower
, tree upper
,
2681 tree value
, tree array_elt_type
,
2682 tree
*pre_p
, bool cleared
)
2684 tree loop_entry_label
, loop_exit_label
;
2685 tree var
, var_type
, cref
;
2687 loop_entry_label
= create_artificial_label ();
2688 loop_exit_label
= create_artificial_label ();
2690 /* Create and initialize the index variable. */
2691 var_type
= TREE_TYPE (upper
);
2692 var
= create_tmp_var (var_type
, NULL
);
2693 append_to_statement_list (build2 (MODIFY_EXPR
, var_type
, var
, lower
), pre_p
);
2695 /* Add the loop entry label. */
2696 append_to_statement_list (build1 (LABEL_EXPR
,
2701 /* Build the reference. */
2702 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
2703 var
, NULL_TREE
, NULL_TREE
);
2705 /* If we are a constructor, just call gimplify_init_ctor_eval to do
2706 the store. Otherwise just assign value to the reference. */
2708 if (TREE_CODE (value
) == CONSTRUCTOR
)
2709 /* NB we might have to call ourself recursively through
2710 gimplify_init_ctor_eval if the value is a constructor. */
2711 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
2714 append_to_statement_list (build2 (MODIFY_EXPR
, TREE_TYPE (cref
),
2718 /* We exit the loop when the index var is equal to the upper bound. */
2719 gimplify_and_add (build3 (COND_EXPR
, void_type_node
,
2720 build2 (EQ_EXPR
, boolean_type_node
,
2728 /* Otherwise, increment the index var... */
2729 append_to_statement_list (build2 (MODIFY_EXPR
, var_type
, var
,
2730 build2 (PLUS_EXPR
, var_type
, var
,
2731 fold_convert (var_type
,
2732 integer_one_node
))),
2735 /* ...and jump back to the loop entry. */
2736 append_to_statement_list (build1 (GOTO_EXPR
,
2741 /* Add the loop exit label. */
2742 append_to_statement_list (build1 (LABEL_EXPR
,
2748 /* Return true if FDECL is accessing a field that is zero sized. */
2751 zero_sized_field_decl (tree fdecl
)
2753 if (TREE_CODE (fdecl
) == FIELD_DECL
&& DECL_SIZE (fdecl
)
2754 && integer_zerop (DECL_SIZE (fdecl
)))
2759 /* Return true if TYPE is zero sized. */
2762 zero_sized_type (tree type
)
2764 if (AGGREGATE_TYPE_P (type
) && TYPE_SIZE (type
)
2765 && integer_zerop (TYPE_SIZE (type
)))
2770 /* A subroutine of gimplify_init_constructor. Generate individual
2771 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
2772 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
2773 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
2777 gimplify_init_ctor_eval (tree object
, VEC(constructor_elt
,gc
) *elts
,
2778 tree
*pre_p
, bool cleared
)
2780 tree array_elt_type
= NULL
;
2781 unsigned HOST_WIDE_INT ix
;
2782 tree purpose
, value
;
2784 if (TREE_CODE (TREE_TYPE (object
)) == ARRAY_TYPE
)
2785 array_elt_type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object
)));
2787 FOR_EACH_CONSTRUCTOR_ELT (elts
, ix
, purpose
, value
)
2791 /* NULL values are created above for gimplification errors. */
2795 if (cleared
&& initializer_zerop (value
))
2798 /* ??? Here's to hoping the front end fills in all of the indices,
2799 so we don't have to figure out what's missing ourselves. */
2800 gcc_assert (purpose
);
2802 /* Skip zero-sized fields, unless value has side-effects. This can
2803 happen with calls to functions returning a zero-sized type, which
2804 we shouldn't discard. As a number of downstream passes don't
2805 expect sets of zero-sized fields, we rely on the gimplification of
2806 the MODIFY_EXPR we make below to drop the assignment statement. */
2807 if (! TREE_SIDE_EFFECTS (value
) && zero_sized_field_decl (purpose
))
2810 /* If we have a RANGE_EXPR, we have to build a loop to assign the
2812 if (TREE_CODE (purpose
) == RANGE_EXPR
)
2814 tree lower
= TREE_OPERAND (purpose
, 0);
2815 tree upper
= TREE_OPERAND (purpose
, 1);
2817 /* If the lower bound is equal to upper, just treat it as if
2818 upper was the index. */
2819 if (simple_cst_equal (lower
, upper
))
2823 gimplify_init_ctor_eval_range (object
, lower
, upper
, value
,
2824 array_elt_type
, pre_p
, cleared
);
2831 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
2832 purpose
, NULL_TREE
, NULL_TREE
);
2836 gcc_assert (TREE_CODE (purpose
) == FIELD_DECL
);
2837 cref
= build3 (COMPONENT_REF
, TREE_TYPE (purpose
),
2838 unshare_expr (object
), purpose
, NULL_TREE
);
2841 if (TREE_CODE (value
) == CONSTRUCTOR
2842 && TREE_CODE (TREE_TYPE (value
)) != VECTOR_TYPE
)
2843 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
2847 init
= build2 (INIT_EXPR
, TREE_TYPE (cref
), cref
, value
);
2848 gimplify_and_add (init
, pre_p
);
2853 /* A subroutine of gimplify_modify_expr. Break out elements of a
2854 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
2856 Note that we still need to clear any elements that don't have explicit
2857 initializers, so if not all elements are initialized we keep the
2858 original MODIFY_EXPR, we just remove all of the constructor elements. */
2860 static enum gimplify_status
2861 gimplify_init_constructor (tree
*expr_p
, tree
*pre_p
,
2862 tree
*post_p
, bool want_value
)
2865 tree ctor
= TREE_OPERAND (*expr_p
, 1);
2866 tree type
= TREE_TYPE (ctor
);
2867 enum gimplify_status ret
;
2868 VEC(constructor_elt
,gc
) *elts
;
2870 if (TREE_CODE (ctor
) != CONSTRUCTOR
)
2871 return GS_UNHANDLED
;
2873 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
2874 is_gimple_lvalue
, fb_lvalue
);
2875 if (ret
== GS_ERROR
)
2877 object
= TREE_OPERAND (*expr_p
, 0);
2879 elts
= CONSTRUCTOR_ELTS (ctor
);
2882 switch (TREE_CODE (type
))
2886 case QUAL_UNION_TYPE
:
2889 struct gimplify_init_ctor_preeval_data preeval_data
;
2890 HOST_WIDE_INT num_type_elements
, num_ctor_elements
;
2891 HOST_WIDE_INT num_nonzero_elements
, num_nonconstant_elements
;
2894 /* Aggregate types must lower constructors to initialization of
2895 individual elements. The exception is that a CONSTRUCTOR node
2896 with no elements indicates zero-initialization of the whole. */
2897 if (VEC_empty (constructor_elt
, elts
))
2900 categorize_ctor_elements (ctor
, &num_nonzero_elements
,
2901 &num_nonconstant_elements
,
2902 &num_ctor_elements
, &cleared
);
2904 /* If a const aggregate variable is being initialized, then it
2905 should never be a lose to promote the variable to be static. */
2906 if (num_nonconstant_elements
== 0
2907 && num_nonzero_elements
> 1
2908 && TREE_READONLY (object
)
2909 && TREE_CODE (object
) == VAR_DECL
)
2911 DECL_INITIAL (object
) = ctor
;
2912 TREE_STATIC (object
) = 1;
2913 if (!DECL_NAME (object
))
2914 DECL_NAME (object
) = create_tmp_var_name ("C");
2915 walk_tree (&DECL_INITIAL (object
), force_labels_r
, NULL
, NULL
);
2917 /* ??? C++ doesn't automatically append a .<number> to the
2918 assembler name, and even when it does, it looks a FE private
2919 data structures to figure out what that number should be,
2920 which are not set for this variable. I suppose this is
2921 important for local statics for inline functions, which aren't
2922 "local" in the object file sense. So in order to get a unique
2923 TU-local symbol, we must invoke the lhd version now. */
2924 lhd_set_decl_assembler_name (object
);
2926 *expr_p
= NULL_TREE
;
2930 /* If there are "lots" of initialized elements, even discounting
2931 those that are not address constants (and thus *must* be
2932 computed at runtime), then partition the constructor into
2933 constant and non-constant parts. Block copy the constant
2934 parts in, then generate code for the non-constant parts. */
2935 /* TODO. There's code in cp/typeck.c to do this. */
2937 num_type_elements
= count_type_elements (type
, true);
2939 /* If count_type_elements could not determine number of type elements
2940 for a constant-sized object, assume clearing is needed.
2941 Don't do this for variable-sized objects, as store_constructor
2942 will ignore the clearing of variable-sized objects. */
2943 if (num_type_elements
< 0 && int_size_in_bytes (type
) >= 0)
2945 /* If there are "lots" of zeros, then block clear the object first. */
2946 else if (num_type_elements
- num_nonzero_elements
> CLEAR_RATIO
2947 && num_nonzero_elements
< num_type_elements
/4)
2949 /* ??? This bit ought not be needed. For any element not present
2950 in the initializer, we should simply set them to zero. Except
2951 we'd need to *find* the elements that are not present, and that
2952 requires trickery to avoid quadratic compile-time behavior in
2953 large cases or excessive memory use in small cases. */
2954 else if (num_ctor_elements
< num_type_elements
)
2957 /* If there are "lots" of initialized elements, and all of them
2958 are valid address constants, then the entire initializer can
2959 be dropped to memory, and then memcpy'd out. Don't do this
2960 for sparse arrays, though, as it's more efficient to follow
2961 the standard CONSTRUCTOR behavior of memset followed by
2962 individual element initialization. */
2963 if (num_nonconstant_elements
== 0 && !cleared
)
2965 HOST_WIDE_INT size
= int_size_in_bytes (type
);
2968 /* ??? We can still get unbounded array types, at least
2969 from the C++ front end. This seems wrong, but attempt
2970 to work around it for now. */
2973 size
= int_size_in_bytes (TREE_TYPE (object
));
2975 TREE_TYPE (ctor
) = type
= TREE_TYPE (object
);
2978 /* Find the maximum alignment we can assume for the object. */
2979 /* ??? Make use of DECL_OFFSET_ALIGN. */
2980 if (DECL_P (object
))
2981 align
= DECL_ALIGN (object
);
2983 align
= TYPE_ALIGN (type
);
2985 if (size
> 0 && !can_move_by_pieces (size
, align
))
2987 tree
new = create_tmp_var_raw (type
, "C");
2989 gimple_add_tmp_var (new);
2990 TREE_STATIC (new) = 1;
2991 TREE_READONLY (new) = 1;
2992 DECL_INITIAL (new) = ctor
;
2993 if (align
> DECL_ALIGN (new))
2995 DECL_ALIGN (new) = align
;
2996 DECL_USER_ALIGN (new) = 1;
2998 walk_tree (&DECL_INITIAL (new), force_labels_r
, NULL
, NULL
);
3000 TREE_OPERAND (*expr_p
, 1) = new;
3002 /* This is no longer an assignment of a CONSTRUCTOR, but
3003 we still may have processing to do on the LHS. So
3004 pretend we didn't do anything here to let that happen. */
3005 return GS_UNHANDLED
;
3011 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3012 Note that we still have to gimplify, in order to handle the
3013 case of variable sized types. Avoid shared tree structures. */
3014 CONSTRUCTOR_ELTS (ctor
) = NULL
;
3015 object
= unshare_expr (object
);
3016 gimplify_stmt (expr_p
);
3017 append_to_statement_list (*expr_p
, pre_p
);
3020 /* If we have not block cleared the object, or if there are nonzero
3021 elements in the constructor, add assignments to the individual
3022 scalar fields of the object. */
3023 if (!cleared
|| num_nonzero_elements
> 0)
3025 preeval_data
.lhs_base_decl
= get_base_address (object
);
3026 if (!DECL_P (preeval_data
.lhs_base_decl
))
3027 preeval_data
.lhs_base_decl
= NULL
;
3028 preeval_data
.lhs_alias_set
= get_alias_set (object
);
3030 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p
, 1),
3031 pre_p
, post_p
, &preeval_data
);
3032 gimplify_init_ctor_eval (object
, elts
, pre_p
, cleared
);
3035 *expr_p
= NULL_TREE
;
3043 /* Extract the real and imaginary parts out of the ctor. */
3044 gcc_assert (VEC_length (constructor_elt
, elts
) == 2);
3045 r
= VEC_index (constructor_elt
, elts
, 0)->value
;
3046 i
= VEC_index (constructor_elt
, elts
, 1)->value
;
3047 if (r
== NULL
|| i
== NULL
)
3049 tree zero
= fold_convert (TREE_TYPE (type
), integer_zero_node
);
3056 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3057 represent creation of a complex value. */
3058 if (TREE_CONSTANT (r
) && TREE_CONSTANT (i
))
3060 ctor
= build_complex (type
, r
, i
);
3061 TREE_OPERAND (*expr_p
, 1) = ctor
;
3065 ctor
= build2 (COMPLEX_EXPR
, type
, r
, i
);
3066 TREE_OPERAND (*expr_p
, 1) = ctor
;
3067 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
3068 rhs_predicate_for (TREE_OPERAND (*expr_p
, 0)),
3076 unsigned HOST_WIDE_INT ix
;
3077 constructor_elt
*ce
;
3079 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3080 if (TREE_CONSTANT (ctor
))
3082 bool constant_p
= true;
3085 /* Even when ctor is constant, it might contain non-*_CST
3086 elements (e.g. { 1.0/0.0 - 1.0/0.0, 0.0 }) and those don't
3087 belong into VECTOR_CST nodes. */
3088 FOR_EACH_CONSTRUCTOR_VALUE (elts
, ix
, value
)
3089 if (!CONSTANT_CLASS_P (value
))
3097 TREE_OPERAND (*expr_p
, 1) = build_vector_from_ctor (type
, elts
);
3102 /* Vector types use CONSTRUCTOR all the way through gimple
3103 compilation as a general initializer. */
3104 for (ix
= 0; VEC_iterate (constructor_elt
, elts
, ix
, ce
); ix
++)
3106 enum gimplify_status tret
;
3107 tret
= gimplify_expr (&ce
->value
, pre_p
, post_p
,
3108 is_gimple_val
, fb_rvalue
);
3109 if (tret
== GS_ERROR
)
3116 /* So how did we get a CONSTRUCTOR for a scalar type? */
3120 if (ret
== GS_ERROR
)
3122 else if (want_value
)
3124 append_to_statement_list (*expr_p
, pre_p
);
3132 /* Given a pointer value OP0, return a simplified version of an
3133 indirection through OP0, or NULL_TREE if no simplification is
3134 possible. This may only be applied to a rhs of an expression.
3135 Note that the resulting type may be different from the type pointed
3136 to in the sense that it is still compatible from the langhooks
3140 fold_indirect_ref_rhs (tree t
)
3142 tree type
= TREE_TYPE (TREE_TYPE (t
));
3147 subtype
= TREE_TYPE (sub
);
3148 if (!POINTER_TYPE_P (subtype
))
3151 if (TREE_CODE (sub
) == ADDR_EXPR
)
3153 tree op
= TREE_OPERAND (sub
, 0);
3154 tree optype
= TREE_TYPE (op
);
3156 if (lang_hooks
.types_compatible_p (type
, optype
))
3158 /* *(foo *)&fooarray => fooarray[0] */
3159 else if (TREE_CODE (optype
) == ARRAY_TYPE
3160 && lang_hooks
.types_compatible_p (type
, TREE_TYPE (optype
)))
3162 tree type_domain
= TYPE_DOMAIN (optype
);
3163 tree min_val
= size_zero_node
;
3164 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
3165 min_val
= TYPE_MIN_VALUE (type_domain
);
3166 return build4 (ARRAY_REF
, type
, op
, min_val
, NULL_TREE
, NULL_TREE
);
3170 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
3171 if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
3172 && lang_hooks
.types_compatible_p (type
, TREE_TYPE (TREE_TYPE (subtype
))))
3175 tree min_val
= size_zero_node
;
3177 sub
= fold_indirect_ref_rhs (sub
);
3179 sub
= build1 (INDIRECT_REF
, TREE_TYPE (subtype
), osub
);
3180 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
3181 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
3182 min_val
= TYPE_MIN_VALUE (type_domain
);
3183 return build4 (ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
, NULL_TREE
);
3189 /* Subroutine of gimplify_modify_expr to do simplifications of MODIFY_EXPRs
3190 based on the code of the RHS. We loop for as long as something changes. */
3192 static enum gimplify_status
3193 gimplify_modify_expr_rhs (tree
*expr_p
, tree
*from_p
, tree
*to_p
, tree
*pre_p
,
3194 tree
*post_p
, bool want_value
)
3196 enum gimplify_status ret
= GS_OK
;
3198 while (ret
!= GS_UNHANDLED
)
3199 switch (TREE_CODE (*from_p
))
3203 /* If we have code like
3207 where the type of "x" is a (possibly cv-qualified variant
3208 of "A"), treat the entire expression as identical to "x".
3209 This kind of code arises in C++ when an object is bound
3210 to a const reference, and if "x" is a TARGET_EXPR we want
3211 to take advantage of the optimization below. */
3212 tree t
= fold_indirect_ref_rhs (TREE_OPERAND (*from_p
, 0));
3225 /* If we are initializing something from a TARGET_EXPR, strip the
3226 TARGET_EXPR and initialize it directly, if possible. This can't
3227 be done if the initializer is void, since that implies that the
3228 temporary is set in some non-trivial way.
3230 ??? What about code that pulls out the temp and uses it
3231 elsewhere? I think that such code never uses the TARGET_EXPR as
3232 an initializer. If I'm wrong, we'll die because the temp won't
3233 have any RTL. In that case, I guess we'll need to replace
3234 references somehow. */
3235 tree init
= TARGET_EXPR_INITIAL (*from_p
);
3237 if (!VOID_TYPE_P (TREE_TYPE (init
)))
3248 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
3250 gimplify_compound_expr (from_p
, pre_p
, true);
3255 /* If we're initializing from a CONSTRUCTOR, break this into
3256 individual MODIFY_EXPRs. */
3257 return gimplify_init_constructor (expr_p
, pre_p
, post_p
, want_value
);
3260 /* If we're assigning to a non-register type, push the assignment
3261 down into the branches. This is mandatory for ADDRESSABLE types,
3262 since we cannot generate temporaries for such, but it saves a
3263 copy in other cases as well. */
3264 if (!is_gimple_reg_type (TREE_TYPE (*from_p
)))
3266 /* This code should mirror the code in gimplify_cond_expr. */
3267 enum tree_code code
= TREE_CODE (*expr_p
);
3268 tree cond
= *from_p
;
3269 tree result
= *to_p
;
3271 ret
= gimplify_expr (&result
, pre_p
, post_p
,
3272 is_gimple_min_lval
, fb_lvalue
);
3273 if (ret
!= GS_ERROR
)
3276 if (TREE_TYPE (TREE_OPERAND (cond
, 1)) != void_type_node
)
3277 TREE_OPERAND (cond
, 1)
3278 = build2 (code
, void_type_node
, result
,
3279 TREE_OPERAND (cond
, 1));
3280 if (TREE_TYPE (TREE_OPERAND (cond
, 2)) != void_type_node
)
3281 TREE_OPERAND (cond
, 2)
3282 = build2 (code
, void_type_node
, unshare_expr (result
),
3283 TREE_OPERAND (cond
, 2));
3285 TREE_TYPE (cond
) = void_type_node
;
3286 recalculate_side_effects (cond
);
3290 gimplify_and_add (cond
, pre_p
);
3291 *expr_p
= unshare_expr (result
);
3302 /* For calls that return in memory, give *to_p as the CALL_EXPR's
3303 return slot so that we don't generate a temporary. */
3304 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p
)
3305 && aggregate_value_p (*from_p
, *from_p
))
3309 if (!(rhs_predicate_for (*to_p
))(*from_p
))
3310 /* If we need a temporary, *to_p isn't accurate. */
3312 else if (TREE_CODE (*to_p
) == RESULT_DECL
3313 && DECL_NAME (*to_p
) == NULL_TREE
3314 && needs_to_live_in_memory (*to_p
))
3315 /* It's OK to use the return slot directly unless it's an NRV. */
3317 else if (is_gimple_reg_type (TREE_TYPE (*to_p
))
3318 || (DECL_P (*to_p
) && DECL_REGISTER (*to_p
)))
3319 /* Don't force regs into memory. */
3321 else if (TREE_CODE (*to_p
) == VAR_DECL
3322 && DECL_GIMPLE_FORMAL_TEMP_P (*to_p
))
3323 /* Don't use the original target if it's a formal temp; we
3324 don't want to take their addresses. */
3326 else if (TREE_CODE (*expr_p
) == INIT_EXPR
)
3327 /* It's OK to use the target directly if it's being
3330 else if (!is_gimple_non_addressable (*to_p
))
3331 /* Don't use the original target if it's already addressable;
3332 if its address escapes, and the called function uses the
3333 NRV optimization, a conforming program could see *to_p
3334 change before the called function returns; see c++/19317.
3335 When optimizing, the return_slot pass marks more functions
3336 as safe after we have escape info. */
3343 CALL_EXPR_RETURN_SLOT_OPT (*from_p
) = 1;
3344 lang_hooks
.mark_addressable (*to_p
);
3359 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
3360 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
3361 DECL_COMPLEX_GIMPLE_REG_P set. */
3363 static enum gimplify_status
3364 gimplify_modify_expr_complex_part (tree
*expr_p
, tree
*pre_p
, bool want_value
)
3366 enum tree_code code
, ocode
;
3367 tree lhs
, rhs
, new_rhs
, other
, realpart
, imagpart
;
3369 lhs
= TREE_OPERAND (*expr_p
, 0);
3370 rhs
= TREE_OPERAND (*expr_p
, 1);
3371 code
= TREE_CODE (lhs
);
3372 lhs
= TREE_OPERAND (lhs
, 0);
3374 ocode
= code
== REALPART_EXPR
? IMAGPART_EXPR
: REALPART_EXPR
;
3375 other
= build1 (ocode
, TREE_TYPE (rhs
), lhs
);
3376 other
= get_formal_tmp_var (other
, pre_p
);
3378 realpart
= code
== REALPART_EXPR
? rhs
: other
;
3379 imagpart
= code
== REALPART_EXPR
? other
: rhs
;
3381 if (TREE_CONSTANT (realpart
) && TREE_CONSTANT (imagpart
))
3382 new_rhs
= build_complex (TREE_TYPE (lhs
), realpart
, imagpart
);
3384 new_rhs
= build2 (COMPLEX_EXPR
, TREE_TYPE (lhs
), realpart
, imagpart
);
3386 TREE_OPERAND (*expr_p
, 0) = lhs
;
3387 TREE_OPERAND (*expr_p
, 1) = new_rhs
;
3391 append_to_statement_list (*expr_p
, pre_p
);
3398 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
3404 PRE_P points to the list where side effects that must happen before
3405 *EXPR_P should be stored.
3407 POST_P points to the list where side effects that must happen after
3408 *EXPR_P should be stored.
3410 WANT_VALUE is nonzero iff we want to use the value of this expression
3411 in another expression. */
3413 static enum gimplify_status
3414 gimplify_modify_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
, bool want_value
)
3416 tree
*from_p
= &TREE_OPERAND (*expr_p
, 1);
3417 tree
*to_p
= &TREE_OPERAND (*expr_p
, 0);
3418 enum gimplify_status ret
= GS_UNHANDLED
;
3420 gcc_assert (TREE_CODE (*expr_p
) == MODIFY_EXPR
3421 || TREE_CODE (*expr_p
) == INIT_EXPR
);
3423 /* For zero sized types only gimplify the left hand side and right hand side
3424 as statements and throw away the assignment. */
3425 if (zero_sized_type (TREE_TYPE (*from_p
)))
3427 gimplify_stmt (from_p
);
3428 gimplify_stmt (to_p
);
3429 append_to_statement_list (*from_p
, pre_p
);
3430 append_to_statement_list (*to_p
, pre_p
);
3431 *expr_p
= NULL_TREE
;
3435 /* See if any simplifications can be done based on what the RHS is. */
3436 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
3438 if (ret
!= GS_UNHANDLED
)
3441 /* If the value being copied is of variable width, compute the length
3442 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
3443 before gimplifying any of the operands so that we can resolve any
3444 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
3445 the size of the expression to be copied, not of the destination, so
3446 that is what we must here. */
3447 maybe_with_size_expr (from_p
);
3449 ret
= gimplify_expr (to_p
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
3450 if (ret
== GS_ERROR
)
3453 ret
= gimplify_expr (from_p
, pre_p
, post_p
,
3454 rhs_predicate_for (*to_p
), fb_rvalue
);
3455 if (ret
== GS_ERROR
)
3458 /* Now see if the above changed *from_p to something we handle specially. */
3459 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
3461 if (ret
!= GS_UNHANDLED
)
3464 /* If we've got a variable sized assignment between two lvalues (i.e. does
3465 not involve a call), then we can make things a bit more straightforward
3466 by converting the assignment to memcpy or memset. */
3467 if (TREE_CODE (*from_p
) == WITH_SIZE_EXPR
)
3469 tree from
= TREE_OPERAND (*from_p
, 0);
3470 tree size
= TREE_OPERAND (*from_p
, 1);
3472 if (TREE_CODE (from
) == CONSTRUCTOR
)
3473 return gimplify_modify_expr_to_memset (expr_p
, size
, want_value
);
3474 if (is_gimple_addressable (from
))
3477 return gimplify_modify_expr_to_memcpy (expr_p
, size
, want_value
);
3481 /* Transform partial stores to non-addressable complex variables into
3482 total stores. This allows us to use real instead of virtual operands
3483 for these variables, which improves optimization. */
3484 if ((TREE_CODE (*to_p
) == REALPART_EXPR
3485 || TREE_CODE (*to_p
) == IMAGPART_EXPR
)
3486 && is_gimple_reg (TREE_OPERAND (*to_p
, 0)))
3487 return gimplify_modify_expr_complex_part (expr_p
, pre_p
, want_value
);
3489 if (gimplify_ctxp
->into_ssa
&& is_gimple_reg (*to_p
))
3491 /* If we've somehow already got an SSA_NAME on the LHS, then
3492 we're probably modified it twice. Not good. */
3493 gcc_assert (TREE_CODE (*to_p
) != SSA_NAME
);
3494 *to_p
= make_ssa_name (*to_p
, *expr_p
);
3499 append_to_statement_list (*expr_p
, pre_p
);
3507 /* Gimplify a comparison between two variable-sized objects. Do this
3508 with a call to BUILT_IN_MEMCMP. */
3510 static enum gimplify_status
3511 gimplify_variable_sized_compare (tree
*expr_p
)
3513 tree op0
= TREE_OPERAND (*expr_p
, 0);
3514 tree op1
= TREE_OPERAND (*expr_p
, 1);
3517 t
= TYPE_SIZE_UNIT (TREE_TYPE (op0
));
3518 t
= unshare_expr (t
);
3519 t
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (t
, op0
);
3520 args
= tree_cons (NULL
, t
, NULL
);
3521 t
= build_fold_addr_expr (op1
);
3522 args
= tree_cons (NULL
, t
, args
);
3523 dest
= build_fold_addr_expr (op0
);
3524 args
= tree_cons (NULL
, dest
, args
);
3525 t
= implicit_built_in_decls
[BUILT_IN_MEMCMP
];
3526 t
= build_function_call_expr (t
, args
);
3528 = build2 (TREE_CODE (*expr_p
), TREE_TYPE (*expr_p
), t
, integer_zero_node
);
3533 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
3534 points to the expression to gimplify.
3536 Expressions of the form 'a && b' are gimplified to:
3538 a && b ? true : false
3540 gimplify_cond_expr will do the rest.
3542 PRE_P points to the list where side effects that must happen before
3543 *EXPR_P should be stored. */
3545 static enum gimplify_status
3546 gimplify_boolean_expr (tree
*expr_p
)
3548 /* Preserve the original type of the expression. */
3549 tree type
= TREE_TYPE (*expr_p
);
3551 *expr_p
= build3 (COND_EXPR
, type
, *expr_p
,
3552 fold_convert (type
, boolean_true_node
),
3553 fold_convert (type
, boolean_false_node
));
3558 /* Gimplifies an expression sequence. This function gimplifies each
3559 expression and re-writes the original expression with the last
3560 expression of the sequence in GIMPLE form.
3562 PRE_P points to the list where the side effects for all the
3563 expressions in the sequence will be emitted.
3565 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
3566 /* ??? Should rearrange to share the pre-queue with all the indirect
3567 invocations of gimplify_expr. Would probably save on creations
3568 of statement_list nodes. */
3570 static enum gimplify_status
3571 gimplify_compound_expr (tree
*expr_p
, tree
*pre_p
, bool want_value
)
3577 tree
*sub_p
= &TREE_OPERAND (t
, 0);
3579 if (TREE_CODE (*sub_p
) == COMPOUND_EXPR
)
3580 gimplify_compound_expr (sub_p
, pre_p
, false);
3582 gimplify_stmt (sub_p
);
3583 append_to_statement_list (*sub_p
, pre_p
);
3585 t
= TREE_OPERAND (t
, 1);
3587 while (TREE_CODE (t
) == COMPOUND_EXPR
);
3594 gimplify_stmt (expr_p
);
3599 /* Gimplifies a statement list. These may be created either by an
3600 enlightened front-end, or by shortcut_cond_expr. */
3602 static enum gimplify_status
3603 gimplify_statement_list (tree
*expr_p
)
3605 tree_stmt_iterator i
= tsi_start (*expr_p
);
3607 while (!tsi_end_p (i
))
3611 gimplify_stmt (tsi_stmt_ptr (i
));
3616 else if (TREE_CODE (t
) == STATEMENT_LIST
)
3618 tsi_link_before (&i
, t
, TSI_SAME_STMT
);
3628 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
3629 gimplify. After gimplification, EXPR_P will point to a new temporary
3630 that holds the original value of the SAVE_EXPR node.
3632 PRE_P points to the list where side effects that must happen before
3633 *EXPR_P should be stored. */
3635 static enum gimplify_status
3636 gimplify_save_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
3638 enum gimplify_status ret
= GS_ALL_DONE
;
3641 gcc_assert (TREE_CODE (*expr_p
) == SAVE_EXPR
);
3642 val
= TREE_OPERAND (*expr_p
, 0);
3644 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
3645 if (!SAVE_EXPR_RESOLVED_P (*expr_p
))
3647 /* The operand may be a void-valued expression such as SAVE_EXPRs
3648 generated by the Java frontend for class initialization. It is
3649 being executed only for its side-effects. */
3650 if (TREE_TYPE (val
) == void_type_node
)
3652 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
3653 is_gimple_stmt
, fb_none
);
3654 append_to_statement_list (TREE_OPERAND (*expr_p
, 0), pre_p
);
3658 val
= get_initialized_tmp_var (val
, pre_p
, post_p
);
3660 TREE_OPERAND (*expr_p
, 0) = val
;
3661 SAVE_EXPR_RESOLVED_P (*expr_p
) = 1;
3669 /* Re-write the ADDR_EXPR node pointed to by EXPR_P
3676 PRE_P points to the list where side effects that must happen before
3677 *EXPR_P should be stored.
3679 POST_P points to the list where side effects that must happen after
3680 *EXPR_P should be stored. */
3682 static enum gimplify_status
3683 gimplify_addr_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
3685 tree expr
= *expr_p
;
3686 tree op0
= TREE_OPERAND (expr
, 0);
3687 enum gimplify_status ret
;
3689 switch (TREE_CODE (op0
))
3692 case MISALIGNED_INDIRECT_REF
:
3694 /* Check if we are dealing with an expression of the form '&*ptr'.
3695 While the front end folds away '&*ptr' into 'ptr', these
3696 expressions may be generated internally by the compiler (e.g.,
3697 builtins like __builtin_va_end). */
3698 /* Caution: the silent array decomposition semantics we allow for
3699 ADDR_EXPR means we can't always discard the pair. */
3700 /* Gimplification of the ADDR_EXPR operand may drop
3701 cv-qualification conversions, so make sure we add them if
3704 tree op00
= TREE_OPERAND (op0
, 0);
3705 tree t_expr
= TREE_TYPE (expr
);
3706 tree t_op00
= TREE_TYPE (op00
);
3708 if (!lang_hooks
.types_compatible_p (t_expr
, t_op00
))
3710 #ifdef ENABLE_CHECKING
3711 tree t_op0
= TREE_TYPE (op0
);
3712 gcc_assert (POINTER_TYPE_P (t_expr
)
3713 && cpt_same_type (TREE_CODE (t_op0
) == ARRAY_TYPE
3714 ? TREE_TYPE (t_op0
) : t_op0
,
3716 && POINTER_TYPE_P (t_op00
)
3717 && cpt_same_type (t_op0
, TREE_TYPE (t_op00
)));
3719 op00
= fold_convert (TREE_TYPE (expr
), op00
);
3726 case VIEW_CONVERT_EXPR
:
3727 /* Take the address of our operand and then convert it to the type of
3730 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
3731 all clear. The impact of this transformation is even less clear. */
3733 /* If the operand is a useless conversion, look through it. Doing so
3734 guarantees that the ADDR_EXPR and its operand will remain of the
3736 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0
, 0)))
3737 op0
= TREE_OPERAND (op0
, 0);
3739 *expr_p
= fold_convert (TREE_TYPE (expr
),
3740 build_fold_addr_expr (TREE_OPERAND (op0
, 0)));
3745 /* We use fb_either here because the C frontend sometimes takes
3746 the address of a call that returns a struct; see
3747 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
3748 the implied temporary explicit. */
3749 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, post_p
,
3750 is_gimple_addressable
, fb_either
);
3751 if (ret
!= GS_ERROR
)
3753 op0
= TREE_OPERAND (expr
, 0);
3755 /* For various reasons, the gimplification of the expression
3756 may have made a new INDIRECT_REF. */
3757 if (TREE_CODE (op0
) == INDIRECT_REF
)
3758 goto do_indirect_ref
;
3760 /* Make sure TREE_INVARIANT, TREE_CONSTANT, and TREE_SIDE_EFFECTS
3762 recompute_tree_invariant_for_addr_expr (expr
);
3764 /* Mark the RHS addressable. */
3765 lang_hooks
.mark_addressable (TREE_OPERAND (expr
, 0));
3773 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
3774 value; output operands should be a gimple lvalue. */
3776 static enum gimplify_status
3777 gimplify_asm_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
3779 tree expr
= *expr_p
;
3780 int noutputs
= list_length (ASM_OUTPUTS (expr
));
3781 const char **oconstraints
3782 = (const char **) alloca ((noutputs
) * sizeof (const char *));
3785 const char *constraint
;
3786 bool allows_mem
, allows_reg
, is_inout
;
3787 enum gimplify_status ret
, tret
;
3790 for (i
= 0, link
= ASM_OUTPUTS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
3792 size_t constraint_len
;
3793 oconstraints
[i
] = constraint
3794 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
3795 constraint_len
= strlen (constraint
);
3796 if (constraint_len
== 0)
3799 parse_output_constraint (&constraint
, i
, 0, 0,
3800 &allows_mem
, &allows_reg
, &is_inout
);
3802 if (!allows_reg
&& allows_mem
)
3803 lang_hooks
.mark_addressable (TREE_VALUE (link
));
3805 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
3806 is_inout
? is_gimple_min_lval
: is_gimple_lvalue
,
3807 fb_lvalue
| fb_mayfail
);
3808 if (tret
== GS_ERROR
)
3810 error ("invalid lvalue in asm output %d", i
);
3816 /* An input/output operand. To give the optimizers more
3817 flexibility, split it into separate input and output
3822 /* Turn the in/out constraint into an output constraint. */
3823 char *p
= xstrdup (constraint
);
3825 TREE_VALUE (TREE_PURPOSE (link
)) = build_string (constraint_len
, p
);
3827 /* And add a matching input constraint. */
3830 sprintf (buf
, "%d", i
);
3832 /* If there are multiple alternatives in the constraint,
3833 handle each of them individually. Those that allow register
3834 will be replaced with operand number, the others will stay
3836 if (strchr (p
, ',') != NULL
)
3838 size_t len
= 0, buflen
= strlen (buf
);
3839 char *beg
, *end
, *str
, *dst
;
3843 end
= strchr (beg
, ',');
3845 end
= strchr (beg
, '\0');
3846 if ((size_t) (end
- beg
) < buflen
)
3849 len
+= end
- beg
+ 1;
3856 str
= (char *) alloca (len
);
3857 for (beg
= p
+ 1, dst
= str
;;)
3860 bool mem_p
, reg_p
, inout_p
;
3862 end
= strchr (beg
, ',');
3867 parse_output_constraint (&tem
, i
, 0, 0,
3868 &mem_p
, ®_p
, &inout_p
);
3873 memcpy (dst
, buf
, buflen
);
3882 memcpy (dst
, beg
, len
);
3891 input
= build_string (dst
- str
, str
);
3894 input
= build_string (strlen (buf
), buf
);
3897 input
= build_string (constraint_len
- 1, constraint
+ 1);
3901 input
= build_tree_list (build_tree_list (NULL_TREE
, input
),
3902 unshare_expr (TREE_VALUE (link
)));
3903 ASM_INPUTS (expr
) = chainon (ASM_INPUTS (expr
), input
);
3907 for (link
= ASM_INPUTS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
3910 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
3911 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
3912 oconstraints
, &allows_mem
, &allows_reg
);
3914 /* If the operand is a memory input, it should be an lvalue. */
3915 if (!allows_reg
&& allows_mem
)
3917 lang_hooks
.mark_addressable (TREE_VALUE (link
));
3918 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
3919 is_gimple_lvalue
, fb_lvalue
| fb_mayfail
);
3920 if (tret
== GS_ERROR
)
3922 error ("memory input %d is not directly addressable", i
);
3928 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
3929 is_gimple_asm_val
, fb_rvalue
);
3930 if (tret
== GS_ERROR
)
3938 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
3939 WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
3940 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
3941 return to this function.
3943 FIXME should we complexify the prequeue handling instead? Or use flags
3944 for all the cleanups and let the optimizer tighten them up? The current
3945 code seems pretty fragile; it will break on a cleanup within any
3946 non-conditional nesting. But any such nesting would be broken, anyway;
3947 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
3948 and continues out of it. We can do that at the RTL level, though, so
3949 having an optimizer to tighten up try/finally regions would be a Good
3952 static enum gimplify_status
3953 gimplify_cleanup_point_expr (tree
*expr_p
, tree
*pre_p
)
3955 tree_stmt_iterator iter
;
3958 tree temp
= voidify_wrapper_expr (*expr_p
, NULL
);
3960 /* We only care about the number of conditions between the innermost
3961 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
3962 any cleanups collected outside the CLEANUP_POINT_EXPR. */
3963 int old_conds
= gimplify_ctxp
->conditions
;
3964 tree old_cleanups
= gimplify_ctxp
->conditional_cleanups
;
3965 gimplify_ctxp
->conditions
= 0;
3966 gimplify_ctxp
->conditional_cleanups
= NULL_TREE
;
3968 body
= TREE_OPERAND (*expr_p
, 0);
3969 gimplify_to_stmt_list (&body
);
3971 gimplify_ctxp
->conditions
= old_conds
;
3972 gimplify_ctxp
->conditional_cleanups
= old_cleanups
;
3974 for (iter
= tsi_start (body
); !tsi_end_p (iter
); )
3976 tree
*wce_p
= tsi_stmt_ptr (iter
);
3979 if (TREE_CODE (wce
) == WITH_CLEANUP_EXPR
)
3981 if (tsi_one_before_end_p (iter
))
3983 tsi_link_before (&iter
, TREE_OPERAND (wce
, 0), TSI_SAME_STMT
);
3990 enum tree_code code
;
3992 if (CLEANUP_EH_ONLY (wce
))
3993 code
= TRY_CATCH_EXPR
;
3995 code
= TRY_FINALLY_EXPR
;
3997 sl
= tsi_split_statement_list_after (&iter
);
3998 tfe
= build2 (code
, void_type_node
, sl
, NULL_TREE
);
3999 append_to_statement_list (TREE_OPERAND (wce
, 0),
4000 &TREE_OPERAND (tfe
, 1));
4002 iter
= tsi_start (sl
);
4012 append_to_statement_list (body
, pre_p
);
4022 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
4023 is the cleanup action required. */
4026 gimple_push_cleanup (tree var
, tree cleanup
, bool eh_only
, tree
*pre_p
)
4030 /* Errors can result in improperly nested cleanups. Which results in
4031 confusion when trying to resolve the WITH_CLEANUP_EXPR. */
4032 if (errorcount
|| sorrycount
)
4035 if (gimple_conditional_context ())
4037 /* If we're in a conditional context, this is more complex. We only
4038 want to run the cleanup if we actually ran the initialization that
4039 necessitates it, but we want to run it after the end of the
4040 conditional context. So we wrap the try/finally around the
4041 condition and use a flag to determine whether or not to actually
4042 run the destructor. Thus
4046 becomes (approximately)
4050 if (test) { A::A(temp); flag = 1; val = f(temp); }
4053 if (flag) A::~A(temp);
4058 tree flag
= create_tmp_var (boolean_type_node
, "cleanup");
4059 tree ffalse
= build2 (MODIFY_EXPR
, void_type_node
, flag
,
4060 boolean_false_node
);
4061 tree ftrue
= build2 (MODIFY_EXPR
, void_type_node
, flag
,
4063 cleanup
= build3 (COND_EXPR
, void_type_node
, flag
, cleanup
, NULL
);
4064 wce
= build1 (WITH_CLEANUP_EXPR
, void_type_node
, cleanup
);
4065 append_to_statement_list (ffalse
, &gimplify_ctxp
->conditional_cleanups
);
4066 append_to_statement_list (wce
, &gimplify_ctxp
->conditional_cleanups
);
4067 append_to_statement_list (ftrue
, pre_p
);
4069 /* Because of this manipulation, and the EH edges that jump
4070 threading cannot redirect, the temporary (VAR) will appear
4071 to be used uninitialized. Don't warn. */
4072 TREE_NO_WARNING (var
) = 1;
4076 wce
= build1 (WITH_CLEANUP_EXPR
, void_type_node
, cleanup
);
4077 CLEANUP_EH_ONLY (wce
) = eh_only
;
4078 append_to_statement_list (wce
, pre_p
);
4081 gimplify_stmt (&TREE_OPERAND (wce
, 0));
4084 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
4086 static enum gimplify_status
4087 gimplify_target_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
4089 tree targ
= *expr_p
;
4090 tree temp
= TARGET_EXPR_SLOT (targ
);
4091 tree init
= TARGET_EXPR_INITIAL (targ
);
4092 enum gimplify_status ret
;
4096 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
4097 to the temps list. */
4098 gimple_add_tmp_var (temp
);
4100 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
4101 expression is supposed to initialize the slot. */
4102 if (VOID_TYPE_P (TREE_TYPE (init
)))
4103 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
, fb_none
);
4106 /* Special handling for BIND_EXPR can result in fewer temps. */
4108 if (TREE_CODE (init
) == BIND_EXPR
)
4109 gimplify_bind_expr (&init
, temp
, pre_p
);
4112 init
= build2 (INIT_EXPR
, void_type_node
, temp
, init
);
4113 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
,
4117 if (ret
== GS_ERROR
)
4119 append_to_statement_list (init
, pre_p
);
4121 /* If needed, push the cleanup for the temp. */
4122 if (TARGET_EXPR_CLEANUP (targ
))
4124 gimplify_stmt (&TARGET_EXPR_CLEANUP (targ
));
4125 gimple_push_cleanup (temp
, TARGET_EXPR_CLEANUP (targ
),
4126 CLEANUP_EH_ONLY (targ
), pre_p
);
4129 /* Only expand this once. */
4130 TREE_OPERAND (targ
, 3) = init
;
4131 TARGET_EXPR_INITIAL (targ
) = NULL_TREE
;
4134 /* We should have expanded this before. */
4135 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp
));
4141 /* Gimplification of expression trees. */
4143 /* Gimplify an expression which appears at statement context; usually, this
4144 means replacing it with a suitably gimple STATEMENT_LIST. */
4147 gimplify_stmt (tree
*stmt_p
)
4149 gimplify_expr (stmt_p
, NULL
, NULL
, is_gimple_stmt
, fb_none
);
4152 /* Similarly, but force the result to be a STATEMENT_LIST. */
4155 gimplify_to_stmt_list (tree
*stmt_p
)
4157 gimplify_stmt (stmt_p
);
4159 *stmt_p
= alloc_stmt_list ();
4160 else if (TREE_CODE (*stmt_p
) != STATEMENT_LIST
)
4163 *stmt_p
= alloc_stmt_list ();
4164 append_to_statement_list (t
, stmt_p
);
4169 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
4170 to CTX. If entries already exist, force them to be some flavor of private.
4171 If there is no enclosing parallel, do nothing. */
4174 omp_firstprivatize_variable (struct gimplify_omp_ctx
*ctx
, tree decl
)
4178 if (decl
== NULL
|| !DECL_P (decl
))
4183 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
4186 if (n
->value
& GOVD_SHARED
)
4187 n
->value
= GOVD_FIRSTPRIVATE
| (n
->value
& GOVD_SEEN
);
4191 else if (ctx
->is_parallel
)
4192 omp_add_variable (ctx
, decl
, GOVD_FIRSTPRIVATE
);
4194 ctx
= ctx
->outer_context
;
4199 /* Similarly for each of the type sizes of TYPE. */
4202 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx
*ctx
, tree type
)
4204 if (type
== NULL
|| type
== error_mark_node
)
4206 type
= TYPE_MAIN_VARIANT (type
);
4208 if (pointer_set_insert (ctx
->privatized_types
, type
))
4211 switch (TREE_CODE (type
))
4217 omp_firstprivatize_variable (ctx
, TYPE_MIN_VALUE (type
));
4218 omp_firstprivatize_variable (ctx
, TYPE_MAX_VALUE (type
));
4222 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
4223 omp_firstprivatize_type_sizes (ctx
, TYPE_DOMAIN (type
));
4228 case QUAL_UNION_TYPE
:
4231 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
4232 if (TREE_CODE (field
) == FIELD_DECL
)
4234 omp_firstprivatize_variable (ctx
, DECL_FIELD_OFFSET (field
));
4235 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (field
));
4241 case REFERENCE_TYPE
:
4242 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
4249 omp_firstprivatize_variable (ctx
, TYPE_SIZE (type
));
4250 omp_firstprivatize_variable (ctx
, TYPE_SIZE_UNIT (type
));
4251 lang_hooks
.types
.omp_firstprivatize_type_sizes (ctx
, type
);
4254 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
4257 omp_add_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, unsigned int flags
)
4260 unsigned int nflags
;
4263 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
4266 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
4267 there are constructors involved somewhere. */
4268 if (TREE_ADDRESSABLE (TREE_TYPE (decl
))
4269 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
4272 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
4275 /* We shouldn't be re-adding the decl with the same data
4277 gcc_assert ((n
->value
& GOVD_DATA_SHARE_CLASS
& flags
) == 0);
4278 /* The only combination of data sharing classes we should see is
4279 FIRSTPRIVATE and LASTPRIVATE. */
4280 nflags
= n
->value
| flags
;
4281 gcc_assert ((nflags
& GOVD_DATA_SHARE_CLASS
)
4282 == (GOVD_FIRSTPRIVATE
| GOVD_LASTPRIVATE
));
4287 /* When adding a variable-sized variable, we have to handle all sorts
4288 of additional bits of data: the pointer replacement variable, and
4289 the parameters of the type. */
4290 if (DECL_SIZE (decl
) && !TREE_CONSTANT (DECL_SIZE (decl
)))
4292 /* Add the pointer replacement variable as PRIVATE if the variable
4293 replacement is private, else FIRSTPRIVATE since we'll need the
4294 address of the original variable either for SHARED, or for the
4295 copy into or out of the context. */
4296 if (!(flags
& GOVD_LOCAL
))
4298 nflags
= flags
& GOVD_PRIVATE
? GOVD_PRIVATE
: GOVD_FIRSTPRIVATE
;
4299 nflags
|= flags
& GOVD_SEEN
;
4300 t
= DECL_VALUE_EXPR (decl
);
4301 gcc_assert (TREE_CODE (t
) == INDIRECT_REF
);
4302 t
= TREE_OPERAND (t
, 0);
4303 gcc_assert (DECL_P (t
));
4304 omp_add_variable (ctx
, t
, nflags
);
4307 /* Add all of the variable and type parameters (which should have
4308 been gimplified to a formal temporary) as FIRSTPRIVATE. */
4309 omp_firstprivatize_variable (ctx
, DECL_SIZE_UNIT (decl
));
4310 omp_firstprivatize_variable (ctx
, DECL_SIZE (decl
));
4311 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
4313 /* The variable-sized variable itself is never SHARED, only some form
4314 of PRIVATE. The sharing would take place via the pointer variable
4315 which we remapped above. */
4316 if (flags
& GOVD_SHARED
)
4317 flags
= GOVD_PRIVATE
| GOVD_DEBUG_PRIVATE
4318 | (flags
& (GOVD_SEEN
| GOVD_EXPLICIT
));
4320 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
4321 alloca statement we generate for the variable, so make sure it
4322 is available. This isn't automatically needed for the SHARED
4323 case, since we won't be allocating local storage then. */
4325 omp_notice_variable (ctx
, TYPE_SIZE_UNIT (TREE_TYPE (decl
)), true);
4327 else if (lang_hooks
.decls
.omp_privatize_by_reference (decl
))
4329 gcc_assert ((flags
& GOVD_LOCAL
) == 0);
4330 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
4332 /* Similar to the direct variable sized case above, we'll need the
4333 size of references being privatized. */
4334 if ((flags
& GOVD_SHARED
) == 0)
4336 t
= TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl
)));
4337 if (!TREE_CONSTANT (t
))
4338 omp_notice_variable (ctx
, t
, true);
4342 splay_tree_insert (ctx
->variables
, (splay_tree_key
)decl
, flags
);
4345 /* Record the fact that DECL was used within the OpenMP context CTX.
4346 IN_CODE is true when real code uses DECL, and false when we should
4347 merely emit default(none) errors. Return true if DECL is going to
4348 be remapped and thus DECL shouldn't be gimplified into its
4349 DECL_VALUE_EXPR (if any). */
4352 omp_notice_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, bool in_code
)
4355 unsigned flags
= in_code
? GOVD_SEEN
: 0;
4356 bool ret
= false, shared
;
4358 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
4361 /* Threadprivate variables are predetermined. */
4362 if (is_global_var (decl
))
4364 if (DECL_THREAD_LOCAL_P (decl
))
4367 if (DECL_HAS_VALUE_EXPR_P (decl
))
4369 tree value
= get_base_address (DECL_VALUE_EXPR (decl
));
4371 if (value
&& DECL_P (value
) && DECL_THREAD_LOCAL_P (value
))
4376 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
4379 enum omp_clause_default_kind default_kind
, kind
;
4381 if (!ctx
->is_parallel
)
4384 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
4385 remapped firstprivate instead of shared. To some extent this is
4386 addressed in omp_firstprivatize_type_sizes, but not effectively. */
4387 default_kind
= ctx
->default_kind
;
4388 kind
= lang_hooks
.decls
.omp_predetermined_sharing (decl
);
4389 if (kind
!= OMP_CLAUSE_DEFAULT_UNSPECIFIED
)
4390 default_kind
= kind
;
4392 switch (default_kind
)
4394 case OMP_CLAUSE_DEFAULT_NONE
:
4395 error ("%qs not specified in enclosing parallel",
4396 IDENTIFIER_POINTER (DECL_NAME (decl
)));
4397 error ("%Henclosing parallel", &ctx
->location
);
4399 case OMP_CLAUSE_DEFAULT_SHARED
:
4400 flags
|= GOVD_SHARED
;
4402 case OMP_CLAUSE_DEFAULT_PRIVATE
:
4403 flags
|= GOVD_PRIVATE
;
4409 omp_add_variable (ctx
, decl
, flags
);
4411 shared
= (flags
& GOVD_SHARED
) != 0;
4412 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
4416 shared
= ((flags
| n
->value
) & GOVD_SHARED
) != 0;
4417 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
4419 /* If nothing changed, there's nothing left to do. */
4420 if ((n
->value
& flags
) == flags
)
4426 /* If the variable is private in the current context, then we don't
4427 need to propagate anything to an outer context. */
4428 if (flags
& GOVD_PRIVATE
)
4430 if (ctx
->outer_context
4431 && omp_notice_variable (ctx
->outer_context
, decl
, in_code
))
4436 /* Verify that DECL is private within CTX. If there's specific information
4437 to the contrary in the innermost scope, generate an error. */
4440 omp_is_private (struct gimplify_omp_ctx
*ctx
, tree decl
)
4444 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
4447 if (n
->value
& GOVD_SHARED
)
4449 if (ctx
== gimplify_omp_ctxp
)
4451 error ("iteration variable %qs should be private",
4452 IDENTIFIER_POINTER (DECL_NAME (decl
)));
4453 n
->value
= GOVD_PRIVATE
;
4459 else if ((n
->value
& GOVD_EXPLICIT
) != 0
4460 && (ctx
== gimplify_omp_ctxp
4461 || (ctx
->is_combined_parallel
4462 && gimplify_omp_ctxp
->outer_context
== ctx
)))
4464 if ((n
->value
& GOVD_FIRSTPRIVATE
) != 0)
4465 error ("iteration variable %qs should not be firstprivate",
4466 IDENTIFIER_POINTER (DECL_NAME (decl
)));
4467 else if ((n
->value
& GOVD_REDUCTION
) != 0)
4468 error ("iteration variable %qs should not be reduction",
4469 IDENTIFIER_POINTER (DECL_NAME (decl
)));
4474 if (ctx
->is_parallel
)
4476 else if (ctx
->outer_context
)
4477 return omp_is_private (ctx
->outer_context
, decl
);
4479 return !is_global_var (decl
);
4482 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
4483 and previous omp contexts. */
4486 gimplify_scan_omp_clauses (tree
*list_p
, tree
*pre_p
, bool in_parallel
,
4487 bool in_combined_parallel
)
4489 struct gimplify_omp_ctx
*ctx
, *outer_ctx
;
4492 ctx
= new_omp_context (in_parallel
, in_combined_parallel
);
4493 outer_ctx
= ctx
->outer_context
;
4495 while ((c
= *list_p
) != NULL
)
4497 enum gimplify_status gs
;
4498 bool remove
= false;
4499 bool notice_outer
= true;
4503 switch (OMP_CLAUSE_CODE (c
))
4505 case OMP_CLAUSE_PRIVATE
:
4506 flags
= GOVD_PRIVATE
| GOVD_EXPLICIT
;
4507 notice_outer
= false;
4509 case OMP_CLAUSE_SHARED
:
4510 flags
= GOVD_SHARED
| GOVD_EXPLICIT
;
4512 case OMP_CLAUSE_FIRSTPRIVATE
:
4513 flags
= GOVD_FIRSTPRIVATE
| GOVD_EXPLICIT
;
4515 case OMP_CLAUSE_LASTPRIVATE
:
4516 flags
= GOVD_LASTPRIVATE
| GOVD_SEEN
| GOVD_EXPLICIT
;
4518 case OMP_CLAUSE_REDUCTION
:
4519 flags
= GOVD_REDUCTION
| GOVD_SEEN
| GOVD_EXPLICIT
;
4523 decl
= OMP_CLAUSE_DECL (c
);
4524 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
4529 /* Handle NRV results passed by reference. */
4530 if (TREE_CODE (decl
) == INDIRECT_REF
4531 && TREE_CODE (TREE_OPERAND (decl
, 0)) == RESULT_DECL
4532 && DECL_BY_REFERENCE (TREE_OPERAND (decl
, 0)))
4533 OMP_CLAUSE_DECL (c
) = decl
= TREE_OPERAND (decl
, 0);
4534 omp_add_variable (ctx
, decl
, flags
);
4535 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
4536 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
))
4538 omp_add_variable (ctx
, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
),
4539 GOVD_LOCAL
| GOVD_SEEN
);
4540 gimplify_omp_ctxp
= ctx
;
4541 push_gimplify_context ();
4542 gimplify_stmt (&OMP_CLAUSE_REDUCTION_INIT (c
));
4543 pop_gimplify_context (OMP_CLAUSE_REDUCTION_INIT (c
));
4544 push_gimplify_context ();
4545 gimplify_stmt (&OMP_CLAUSE_REDUCTION_MERGE (c
));
4546 pop_gimplify_context (OMP_CLAUSE_REDUCTION_MERGE (c
));
4547 gimplify_omp_ctxp
= outer_ctx
;
4553 case OMP_CLAUSE_COPYIN
:
4554 case OMP_CLAUSE_COPYPRIVATE
:
4555 decl
= OMP_CLAUSE_DECL (c
);
4556 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
4561 /* Handle NRV results passed by reference. */
4562 if (TREE_CODE (decl
) == INDIRECT_REF
4563 && TREE_CODE (TREE_OPERAND (decl
, 0)) == RESULT_DECL
4564 && DECL_BY_REFERENCE (TREE_OPERAND (decl
, 0)))
4565 OMP_CLAUSE_DECL (c
) = decl
= TREE_OPERAND (decl
, 0);
4568 omp_notice_variable (outer_ctx
, decl
, true);
4572 OMP_CLAUSE_OPERAND (c
, 0)
4573 = gimple_boolify (OMP_CLAUSE_OPERAND (c
, 0));
4576 case OMP_CLAUSE_SCHEDULE
:
4577 case OMP_CLAUSE_NUM_THREADS
:
4578 gs
= gimplify_expr (&OMP_CLAUSE_OPERAND (c
, 0), pre_p
, NULL
,
4579 is_gimple_val
, fb_rvalue
);
4584 case OMP_CLAUSE_NOWAIT
:
4585 case OMP_CLAUSE_ORDERED
:
4588 case OMP_CLAUSE_DEFAULT
:
4589 ctx
->default_kind
= OMP_CLAUSE_DEFAULT_KIND (c
);
4597 *list_p
= OMP_CLAUSE_CHAIN (c
);
4599 list_p
= &OMP_CLAUSE_CHAIN (c
);
4602 gimplify_omp_ctxp
= ctx
;
4605 /* For all variables that were not actually used within the context,
4606 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
4609 gimplify_adjust_omp_clauses_1 (splay_tree_node n
, void *data
)
4611 tree
*list_p
= (tree
*) data
;
4612 tree decl
= (tree
) n
->key
;
4613 unsigned flags
= n
->value
;
4614 enum omp_clause_code code
;
4618 if (flags
& (GOVD_EXPLICIT
| GOVD_LOCAL
))
4620 if ((flags
& GOVD_SEEN
) == 0)
4622 if (flags
& GOVD_DEBUG_PRIVATE
)
4624 gcc_assert ((flags
& GOVD_DATA_SHARE_CLASS
) == GOVD_PRIVATE
);
4625 private_debug
= true;
4629 = lang_hooks
.decls
.omp_private_debug_clause (decl
,
4630 !!(flags
& GOVD_SHARED
));
4632 code
= OMP_CLAUSE_PRIVATE
;
4633 else if (flags
& GOVD_SHARED
)
4635 if (is_global_var (decl
))
4637 code
= OMP_CLAUSE_SHARED
;
4639 else if (flags
& GOVD_PRIVATE
)
4640 code
= OMP_CLAUSE_PRIVATE
;
4641 else if (flags
& GOVD_FIRSTPRIVATE
)
4642 code
= OMP_CLAUSE_FIRSTPRIVATE
;
4646 clause
= build_omp_clause (code
);
4647 OMP_CLAUSE_DECL (clause
) = decl
;
4648 OMP_CLAUSE_CHAIN (clause
) = *list_p
;
4650 OMP_CLAUSE_PRIVATE_DEBUG (clause
) = 1;
4657 gimplify_adjust_omp_clauses (tree
*list_p
)
4659 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
4662 while ((c
= *list_p
) != NULL
)
4665 bool remove
= false;
4667 switch (OMP_CLAUSE_CODE (c
))
4669 case OMP_CLAUSE_PRIVATE
:
4670 case OMP_CLAUSE_SHARED
:
4671 case OMP_CLAUSE_FIRSTPRIVATE
:
4672 decl
= OMP_CLAUSE_DECL (c
);
4673 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
4674 remove
= !(n
->value
& GOVD_SEEN
);
4677 bool shared
= OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_SHARED
;
4678 if ((n
->value
& GOVD_DEBUG_PRIVATE
)
4679 || lang_hooks
.decls
.omp_private_debug_clause (decl
, shared
))
4681 gcc_assert ((n
->value
& GOVD_DEBUG_PRIVATE
) == 0
4682 || ((n
->value
& GOVD_DATA_SHARE_CLASS
)
4684 OMP_CLAUSE_SET_CODE (c
, OMP_CLAUSE_PRIVATE
);
4685 OMP_CLAUSE_PRIVATE_DEBUG (c
) = 1;
4690 case OMP_CLAUSE_LASTPRIVATE
:
4691 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
4692 accurately reflect the presence of a FIRSTPRIVATE clause. */
4693 decl
= OMP_CLAUSE_DECL (c
);
4694 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
4695 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c
)
4696 = (n
->value
& GOVD_FIRSTPRIVATE
) != 0;
4699 case OMP_CLAUSE_REDUCTION
:
4700 case OMP_CLAUSE_COPYIN
:
4701 case OMP_CLAUSE_COPYPRIVATE
:
4703 case OMP_CLAUSE_NUM_THREADS
:
4704 case OMP_CLAUSE_SCHEDULE
:
4705 case OMP_CLAUSE_NOWAIT
:
4706 case OMP_CLAUSE_ORDERED
:
4707 case OMP_CLAUSE_DEFAULT
:
4715 *list_p
= OMP_CLAUSE_CHAIN (c
);
4717 list_p
= &OMP_CLAUSE_CHAIN (c
);
4720 /* Add in any implicit data sharing. */
4721 splay_tree_foreach (ctx
->variables
, gimplify_adjust_omp_clauses_1
, list_p
);
4723 gimplify_omp_ctxp
= ctx
->outer_context
;
4724 delete_omp_context (ctx
);
4727 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
4728 gimplification of the body, as well as scanning the body for used
4729 variables. We need to do this scan now, because variable-sized
4730 decls will be decomposed during gimplification. */
4732 static enum gimplify_status
4733 gimplify_omp_parallel (tree
*expr_p
, tree
*pre_p
)
4735 tree expr
= *expr_p
;
4737 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
), pre_p
, true,
4738 OMP_PARALLEL_COMBINED (expr
));
4740 push_gimplify_context ();
4742 gimplify_stmt (&OMP_PARALLEL_BODY (expr
));
4744 if (TREE_CODE (OMP_PARALLEL_BODY (expr
)) == BIND_EXPR
)
4745 pop_gimplify_context (OMP_PARALLEL_BODY (expr
));
4747 pop_gimplify_context (NULL_TREE
);
4749 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
));
4754 /* Gimplify the gross structure of an OMP_FOR statement. */
4756 static enum gimplify_status
4757 gimplify_omp_for (tree
*expr_p
, tree
*pre_p
)
4759 tree for_stmt
, decl
, t
;
4760 enum gimplify_status ret
= 0;
4764 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
), pre_p
, false, false);
4766 t
= OMP_FOR_INIT (for_stmt
);
4767 gcc_assert (TREE_CODE (t
) == MODIFY_EXPR
);
4768 decl
= TREE_OPERAND (t
, 0);
4769 gcc_assert (DECL_P (decl
));
4770 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl
)));
4772 /* Make sure the iteration variable is private. */
4773 if (omp_is_private (gimplify_omp_ctxp
, decl
))
4774 omp_notice_variable (gimplify_omp_ctxp
, decl
, true);
4776 omp_add_variable (gimplify_omp_ctxp
, decl
, GOVD_PRIVATE
| GOVD_SEEN
);
4778 ret
|= gimplify_expr (&TREE_OPERAND (t
, 1), &OMP_FOR_PRE_BODY (for_stmt
),
4779 NULL
, is_gimple_val
, fb_rvalue
);
4781 t
= OMP_FOR_COND (for_stmt
);
4782 gcc_assert (COMPARISON_CLASS_P (t
));
4783 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
4785 ret
|= gimplify_expr (&TREE_OPERAND (t
, 1), &OMP_FOR_PRE_BODY (for_stmt
),
4786 NULL
, is_gimple_val
, fb_rvalue
);
4788 t
= OMP_FOR_INCR (for_stmt
);
4789 switch (TREE_CODE (t
))
4791 case PREINCREMENT_EXPR
:
4792 case POSTINCREMENT_EXPR
:
4793 t
= build_int_cst (TREE_TYPE (decl
), 1);
4795 case PREDECREMENT_EXPR
:
4796 case POSTDECREMENT_EXPR
:
4797 t
= build_int_cst (TREE_TYPE (decl
), -1);
4800 t
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), decl
, t
);
4801 t
= build2 (MODIFY_EXPR
, void_type_node
, decl
, t
);
4802 OMP_FOR_INCR (for_stmt
) = t
;
4806 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
4807 t
= TREE_OPERAND (t
, 1);
4808 switch (TREE_CODE (t
))
4811 if (TREE_OPERAND (t
, 1) == decl
)
4813 TREE_OPERAND (t
, 1) = TREE_OPERAND (t
, 0);
4814 TREE_OPERAND (t
, 0) = decl
;
4818 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
4824 ret
|= gimplify_expr (&TREE_OPERAND (t
, 1), &OMP_FOR_PRE_BODY (for_stmt
),
4825 NULL
, is_gimple_val
, fb_rvalue
);
4832 gimplify_to_stmt_list (&OMP_FOR_BODY (for_stmt
));
4833 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
));
4835 return ret
== GS_ALL_DONE
? GS_ALL_DONE
: GS_ERROR
;
4838 /* Gimplify the gross structure of other OpenMP worksharing constructs.
4839 In particular, OMP_SECTIONS and OMP_SINGLE. */
4841 static enum gimplify_status
4842 gimplify_omp_workshare (tree
*expr_p
, tree
*pre_p
)
4844 tree stmt
= *expr_p
;
4846 gimplify_scan_omp_clauses (&OMP_CLAUSES (stmt
), pre_p
, false, false);
4847 gimplify_to_stmt_list (&OMP_BODY (stmt
));
4848 gimplify_adjust_omp_clauses (&OMP_CLAUSES (stmt
));
4853 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
4854 stabilized the lhs of the atomic operation as *ADDR. Return true if
4855 EXPR is this stabilized form. */
4858 goa_lhs_expr_p (tree expr
, tree addr
)
4860 /* Also include casts to other type variants. The C front end is fond
4861 of adding these for e.g. volatile variables. This is like
4862 STRIP_TYPE_NOPS but includes the main variant lookup. */
4863 while ((TREE_CODE (expr
) == NOP_EXPR
4864 || TREE_CODE (expr
) == CONVERT_EXPR
4865 || TREE_CODE (expr
) == NON_LVALUE_EXPR
)
4866 && TREE_OPERAND (expr
, 0) != error_mark_node
4867 && (TYPE_MAIN_VARIANT (TREE_TYPE (expr
))
4868 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (expr
, 0)))))
4869 expr
= TREE_OPERAND (expr
, 0);
4871 if (TREE_CODE (expr
) == INDIRECT_REF
&& TREE_OPERAND (expr
, 0) == addr
)
4873 if (TREE_CODE (addr
) == ADDR_EXPR
&& expr
== TREE_OPERAND (addr
, 0))
4878 /* A subroutine of gimplify_omp_atomic. Attempt to implement the atomic
4879 operation as a __sync_fetch_and_op builtin. INDEX is log2 of the
4880 size of the data type, and thus usable to find the index of the builtin
4881 decl. Returns GS_UNHANDLED if the expression is not of the proper form. */
4883 static enum gimplify_status
4884 gimplify_omp_atomic_fetch_op (tree
*expr_p
, tree addr
, tree rhs
, int index
)
4886 enum built_in_function base
;
4887 tree decl
, args
, itype
;
4888 enum insn_code
*optab
;
4890 /* Check for one of the supported fetch-op operations. */
4891 switch (TREE_CODE (rhs
))
4894 base
= BUILT_IN_FETCH_AND_ADD_N
;
4895 optab
= sync_add_optab
;
4898 base
= BUILT_IN_FETCH_AND_SUB_N
;
4899 optab
= sync_add_optab
;
4902 base
= BUILT_IN_FETCH_AND_AND_N
;
4903 optab
= sync_and_optab
;
4906 base
= BUILT_IN_FETCH_AND_OR_N
;
4907 optab
= sync_ior_optab
;
4910 base
= BUILT_IN_FETCH_AND_XOR_N
;
4911 optab
= sync_xor_optab
;
4914 return GS_UNHANDLED
;
4917 /* Make sure the expression is of the proper form. */
4918 if (goa_lhs_expr_p (TREE_OPERAND (rhs
, 0), addr
))
4919 rhs
= TREE_OPERAND (rhs
, 1);
4920 else if (commutative_tree_code (TREE_CODE (rhs
))
4921 && goa_lhs_expr_p (TREE_OPERAND (rhs
, 1), addr
))
4922 rhs
= TREE_OPERAND (rhs
, 0);
4924 return GS_UNHANDLED
;
4926 decl
= built_in_decls
[base
+ index
+ 1];
4927 itype
= TREE_TYPE (TREE_TYPE (decl
));
4929 if (optab
[TYPE_MODE (itype
)] == CODE_FOR_nothing
)
4930 return GS_UNHANDLED
;
4932 args
= tree_cons (NULL
, fold_convert (itype
, rhs
), NULL
);
4933 args
= tree_cons (NULL
, addr
, args
);
4934 *expr_p
= build_function_call_expr (decl
, args
);
4938 /* A subroutine of gimplify_omp_atomic_pipeline. Walk *EXPR_P and replace
4939 appearances of *LHS_ADDR with LHS_VAR. If an expression does not involve
4940 the lhs, evaluate it into a temporary. Return 1 if the lhs appeared as
4941 a subexpression, 0 if it did not, or -1 if an error was encountered. */
4944 goa_stabilize_expr (tree
*expr_p
, tree
*pre_p
, tree lhs_addr
, tree lhs_var
)
4946 tree expr
= *expr_p
;
4949 if (goa_lhs_expr_p (expr
, lhs_addr
))
4954 if (is_gimple_val (expr
))
4958 switch (TREE_CODE_CLASS (TREE_CODE (expr
)))
4961 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 1), pre_p
,
4964 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 0), pre_p
,
4973 enum gimplify_status gs
;
4974 gs
= gimplify_expr (expr_p
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
);
4975 if (gs
!= GS_ALL_DONE
)
4982 /* A subroutine of gimplify_omp_atomic. Implement the atomic operation as:
4986 newval = rhs; // with oldval replacing *addr in rhs
4987 oldval = __sync_val_compare_and_swap (addr, oldval, newval);
4988 if (oldval != newval)
4991 INDEX is log2 of the size of the data type, and thus usable to find the
4992 index of the builtin decl. */
4994 static enum gimplify_status
4995 gimplify_omp_atomic_pipeline (tree
*expr_p
, tree
*pre_p
, tree addr
,
4996 tree rhs
, int index
)
4998 tree oldval
, oldival
, oldival2
, newval
, newival
, label
;
4999 tree type
, itype
, cmpxchg
, args
, x
, iaddr
;
5001 cmpxchg
= built_in_decls
[BUILT_IN_VAL_COMPARE_AND_SWAP_N
+ index
+ 1];
5002 type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr
)));
5003 itype
= TREE_TYPE (TREE_TYPE (cmpxchg
));
5005 if (sync_compare_and_swap
[TYPE_MODE (itype
)] == CODE_FOR_nothing
)
5006 return GS_UNHANDLED
;
5008 oldval
= create_tmp_var (type
, NULL
);
5009 newval
= create_tmp_var (type
, NULL
);
5011 /* Precompute as much of RHS as possible. In the same walk, replace
5012 occurrences of the lhs value with our temporary. */
5013 if (goa_stabilize_expr (&rhs
, pre_p
, addr
, oldval
) < 0)
5016 x
= build_fold_indirect_ref (addr
);
5017 x
= build2 (MODIFY_EXPR
, void_type_node
, oldval
, x
);
5018 gimplify_and_add (x
, pre_p
);
5020 /* For floating-point values, we'll need to view-convert them to integers
5021 so that we can perform the atomic compare and swap. Simplify the
5022 following code by always setting up the "i"ntegral variables. */
5023 if (INTEGRAL_TYPE_P (type
) || POINTER_TYPE_P (type
))
5031 oldival
= create_tmp_var (itype
, NULL
);
5032 newival
= create_tmp_var (itype
, NULL
);
5034 x
= build1 (VIEW_CONVERT_EXPR
, itype
, oldval
);
5035 x
= build2 (MODIFY_EXPR
, void_type_node
, oldival
, x
);
5036 gimplify_and_add (x
, pre_p
);
5037 iaddr
= fold_convert (build_pointer_type (itype
), addr
);
5040 oldival2
= create_tmp_var (itype
, NULL
);
5042 label
= create_artificial_label ();
5043 x
= build1 (LABEL_EXPR
, void_type_node
, label
);
5044 gimplify_and_add (x
, pre_p
);
5046 x
= build2 (MODIFY_EXPR
, void_type_node
, newval
, rhs
);
5047 gimplify_and_add (x
, pre_p
);
5049 if (newval
!= newival
)
5051 x
= build1 (VIEW_CONVERT_EXPR
, itype
, newval
);
5052 x
= build2 (MODIFY_EXPR
, void_type_node
, newival
, x
);
5053 gimplify_and_add (x
, pre_p
);
5056 x
= build2 (MODIFY_EXPR
, void_type_node
, oldival2
, oldival
);
5057 gimplify_and_add (x
, pre_p
);
5059 args
= tree_cons (NULL
, fold_convert (itype
, newival
), NULL
);
5060 args
= tree_cons (NULL
, fold_convert (itype
, oldival
), args
);
5061 args
= tree_cons (NULL
, iaddr
, args
);
5062 x
= build_function_call_expr (cmpxchg
, args
);
5063 if (oldval
== oldival
)
5064 x
= fold_convert (type
, x
);
5065 x
= build2 (MODIFY_EXPR
, void_type_node
, oldival
, x
);
5066 gimplify_and_add (x
, pre_p
);
5068 /* For floating point, be prepared for the loop backedge. */
5069 if (oldval
!= oldival
)
5071 x
= build1 (VIEW_CONVERT_EXPR
, type
, oldival
);
5072 x
= build2 (MODIFY_EXPR
, void_type_node
, oldval
, x
);
5073 gimplify_and_add (x
, pre_p
);
5076 /* Note that we always perform the comparison as an integer, even for
5077 floating point. This allows the atomic operation to properly
5078 succeed even with NaNs and -0.0. */
5079 x
= build3 (COND_EXPR
, void_type_node
,
5080 build2 (NE_EXPR
, boolean_type_node
, oldival
, oldival2
),
5081 build1 (GOTO_EXPR
, void_type_node
, label
), NULL
);
5082 gimplify_and_add (x
, pre_p
);
5088 /* A subroutine of gimplify_omp_atomic. Implement the atomic operation as:
5090 GOMP_atomic_start ();
5094 The result is not globally atomic, but works so long as all parallel
5095 references are within #pragma omp atomic directives. According to
5096 responses received from omp@openmp.org, appears to be within spec.
5097 Which makes sense, since that's how several other compilers handle
5098 this situation as well. */
5100 static enum gimplify_status
5101 gimplify_omp_atomic_mutex (tree
*expr_p
, tree
*pre_p
, tree addr
, tree rhs
)
5105 t
= built_in_decls
[BUILT_IN_GOMP_ATOMIC_START
];
5106 t
= build_function_call_expr (t
, NULL
);
5107 gimplify_and_add (t
, pre_p
);
5109 t
= build_fold_indirect_ref (addr
);
5110 t
= build2 (MODIFY_EXPR
, void_type_node
, t
, rhs
);
5111 gimplify_and_add (t
, pre_p
);
5113 t
= built_in_decls
[BUILT_IN_GOMP_ATOMIC_END
];
5114 t
= build_function_call_expr (t
, NULL
);
5115 gimplify_and_add (t
, pre_p
);
5121 /* Gimplify an OMP_ATOMIC statement. */
5123 static enum gimplify_status
5124 gimplify_omp_atomic (tree
*expr_p
, tree
*pre_p
)
5126 tree addr
= TREE_OPERAND (*expr_p
, 0);
5127 tree rhs
= TREE_OPERAND (*expr_p
, 1);
5128 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr
)));
5129 HOST_WIDE_INT index
;
5131 /* Make sure the type is one of the supported sizes. */
5132 index
= tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
5133 index
= exact_log2 (index
);
5134 if (index
>= 0 && index
<= 4)
5136 enum gimplify_status gs
;
5139 if (DECL_P (TREE_OPERAND (addr
, 0)))
5140 align
= DECL_ALIGN_UNIT (TREE_OPERAND (addr
, 0));
5141 else if (TREE_CODE (TREE_OPERAND (addr
, 0)) == COMPONENT_REF
5142 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (addr
, 0), 1))
5144 align
= DECL_ALIGN_UNIT (TREE_OPERAND (TREE_OPERAND (addr
, 0), 1));
5146 align
= TYPE_ALIGN_UNIT (type
);
5148 /* __sync builtins require strict data alignment. */
5149 if (exact_log2 (align
) >= index
)
5151 /* When possible, use specialized atomic update functions. */
5152 if (INTEGRAL_TYPE_P (type
) || POINTER_TYPE_P (type
))
5154 gs
= gimplify_omp_atomic_fetch_op (expr_p
, addr
, rhs
, index
);
5155 if (gs
!= GS_UNHANDLED
)
5159 /* If we don't have specialized __sync builtins, try and implement
5160 as a compare and swap loop. */
5161 gs
= gimplify_omp_atomic_pipeline (expr_p
, pre_p
, addr
, rhs
, index
);
5162 if (gs
!= GS_UNHANDLED
)
5167 /* The ultimate fallback is wrapping the operation in a mutex. */
5168 return gimplify_omp_atomic_mutex (expr_p
, pre_p
, addr
, rhs
);
5171 /* Gimplifies the expression tree pointed to by EXPR_P. Return 0 if
5172 gimplification failed.
5174 PRE_P points to the list where side effects that must happen before
5175 EXPR should be stored.
5177 POST_P points to the list where side effects that must happen after
5178 EXPR should be stored, or NULL if there is no suitable list. In
5179 that case, we copy the result to a temporary, emit the
5180 post-effects, and then return the temporary.
5182 GIMPLE_TEST_F points to a function that takes a tree T and
5183 returns nonzero if T is in the GIMPLE form requested by the
5184 caller. The GIMPLE predicates are in tree-gimple.c.
5186 This test is used twice. Before gimplification, the test is
5187 invoked to determine whether *EXPR_P is already gimple enough. If
5188 that fails, *EXPR_P is gimplified according to its code and
5189 GIMPLE_TEST_F is called again. If the test still fails, then a new
5190 temporary variable is created and assigned the value of the
5191 gimplified expression.
5193 FALLBACK tells the function what sort of a temporary we want. If the 1
5194 bit is set, an rvalue is OK. If the 2 bit is set, an lvalue is OK.
5195 If both are set, either is OK, but an lvalue is preferable.
5197 The return value is either GS_ERROR or GS_ALL_DONE, since this function
5198 iterates until solution. */
5200 enum gimplify_status
5201 gimplify_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
,
5202 bool (* gimple_test_f
) (tree
), fallback_t fallback
)
5205 tree internal_pre
= NULL_TREE
;
5206 tree internal_post
= NULL_TREE
;
5208 int is_statement
= (pre_p
== NULL
);
5209 location_t saved_location
;
5210 enum gimplify_status ret
;
5212 save_expr
= *expr_p
;
5213 if (save_expr
== NULL_TREE
)
5216 /* We used to check the predicate here and return immediately if it
5217 succeeds. This is wrong; the design is for gimplification to be
5218 idempotent, and for the predicates to only test for valid forms, not
5219 whether they are fully simplified. */
5221 /* Set up our internal queues if needed. */
5223 pre_p
= &internal_pre
;
5225 post_p
= &internal_post
;
5227 saved_location
= input_location
;
5228 if (save_expr
!= error_mark_node
5229 && EXPR_HAS_LOCATION (*expr_p
))
5230 input_location
= EXPR_LOCATION (*expr_p
);
5232 /* Loop over the specific gimplifiers until the toplevel node
5233 remains the same. */
5236 /* Strip away as many useless type conversions as possible
5238 STRIP_USELESS_TYPE_CONVERSION (*expr_p
);
5240 /* Remember the expr. */
5241 save_expr
= *expr_p
;
5243 /* Die, die, die, my darling. */
5244 if (save_expr
== error_mark_node
5245 || (TREE_TYPE (save_expr
)
5246 && TREE_TYPE (save_expr
) == error_mark_node
))
5252 /* Do any language-specific gimplification. */
5253 ret
= lang_hooks
.gimplify_expr (expr_p
, pre_p
, post_p
);
5256 if (*expr_p
== NULL_TREE
)
5258 if (*expr_p
!= save_expr
)
5261 else if (ret
!= GS_UNHANDLED
)
5265 switch (TREE_CODE (*expr_p
))
5267 /* First deal with the special cases. */
5269 case POSTINCREMENT_EXPR
:
5270 case POSTDECREMENT_EXPR
:
5271 case PREINCREMENT_EXPR
:
5272 case PREDECREMENT_EXPR
:
5273 ret
= gimplify_self_mod_expr (expr_p
, pre_p
, post_p
,
5274 fallback
!= fb_none
);
5278 case ARRAY_RANGE_REF
:
5282 case VIEW_CONVERT_EXPR
:
5283 ret
= gimplify_compound_lval (expr_p
, pre_p
, post_p
,
5284 fallback
? fallback
: fb_rvalue
);
5288 ret
= gimplify_cond_expr (expr_p
, pre_p
, fallback
);
5289 /* C99 code may assign to an array in a structure value of a
5290 conditional expression, and this has undefined behavior
5291 only on execution, so create a temporary if an lvalue is
5293 if (fallback
== fb_lvalue
)
5295 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
5296 lang_hooks
.mark_addressable (*expr_p
);
5301 ret
= gimplify_call_expr (expr_p
, pre_p
, fallback
!= fb_none
);
5302 /* C99 code may assign to an array in a structure returned
5303 from a function, and this has undefined behavior only on
5304 execution, so create a temporary if an lvalue is
5306 if (fallback
== fb_lvalue
)
5308 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
5309 lang_hooks
.mark_addressable (*expr_p
);
5317 ret
= gimplify_compound_expr (expr_p
, pre_p
, fallback
!= fb_none
);
5322 ret
= gimplify_modify_expr (expr_p
, pre_p
, post_p
,
5323 fallback
!= fb_none
);
5325 /* The distinction between MODIFY_EXPR and INIT_EXPR is no longer
5327 if (*expr_p
&& TREE_CODE (*expr_p
) == INIT_EXPR
)
5328 TREE_SET_CODE (*expr_p
, MODIFY_EXPR
);
5331 case TRUTH_ANDIF_EXPR
:
5332 case TRUTH_ORIF_EXPR
:
5333 ret
= gimplify_boolean_expr (expr_p
);
5336 case TRUTH_NOT_EXPR
:
5337 TREE_OPERAND (*expr_p
, 0)
5338 = gimple_boolify (TREE_OPERAND (*expr_p
, 0));
5339 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5340 is_gimple_val
, fb_rvalue
);
5341 recalculate_side_effects (*expr_p
);
5345 ret
= gimplify_addr_expr (expr_p
, pre_p
, post_p
);
5349 ret
= gimplify_va_arg_expr (expr_p
, pre_p
, post_p
);
5354 if (IS_EMPTY_STMT (*expr_p
))
5360 if (VOID_TYPE_P (TREE_TYPE (*expr_p
))
5361 || fallback
== fb_none
)
5363 /* Just strip a conversion to void (or in void context) and
5365 *expr_p
= TREE_OPERAND (*expr_p
, 0);
5369 ret
= gimplify_conversion (expr_p
);
5370 if (ret
== GS_ERROR
)
5372 if (*expr_p
!= save_expr
)
5376 case FIX_TRUNC_EXPR
:
5378 case FIX_FLOOR_EXPR
:
5379 case FIX_ROUND_EXPR
:
5380 /* unary_expr: ... | '(' cast ')' val | ... */
5381 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5382 is_gimple_val
, fb_rvalue
);
5383 recalculate_side_effects (*expr_p
);
5387 *expr_p
= fold_indirect_ref (*expr_p
);
5388 if (*expr_p
!= save_expr
)
5390 /* else fall through. */
5391 case ALIGN_INDIRECT_REF
:
5392 case MISALIGNED_INDIRECT_REF
:
5393 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5394 is_gimple_reg
, fb_rvalue
);
5395 recalculate_side_effects (*expr_p
);
5398 /* Constants need not be gimplified. */
5408 /* If we require an lvalue, such as for ADDR_EXPR, retain the
5409 CONST_DECL node. Otherwise the decl is replaceable by its
5411 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
5412 if (fallback
& fb_lvalue
)
5415 *expr_p
= DECL_INITIAL (*expr_p
);
5419 ret
= gimplify_decl_expr (expr_p
);
5423 /* FIXME make this a decl. */
5428 ret
= gimplify_bind_expr (expr_p
, NULL
, pre_p
);
5432 ret
= gimplify_loop_expr (expr_p
, pre_p
);
5436 ret
= gimplify_switch_expr (expr_p
, pre_p
);
5440 ret
= gimplify_exit_expr (expr_p
);
5444 /* If the target is not LABEL, then it is a computed jump
5445 and the target needs to be gimplified. */
5446 if (TREE_CODE (GOTO_DESTINATION (*expr_p
)) != LABEL_DECL
)
5447 ret
= gimplify_expr (&GOTO_DESTINATION (*expr_p
), pre_p
,
5448 NULL
, is_gimple_val
, fb_rvalue
);
5453 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p
))
5454 == current_function_decl
);
5457 case CASE_LABEL_EXPR
:
5458 ret
= gimplify_case_label_expr (expr_p
);
5462 ret
= gimplify_return_expr (*expr_p
, pre_p
);
5466 /* Don't reduce this in place; let gimplify_init_constructor work its
5467 magic. Buf if we're just elaborating this for side effects, just
5468 gimplify any element that has side-effects. */
5469 if (fallback
== fb_none
)
5471 unsigned HOST_WIDE_INT ix
;
5472 constructor_elt
*ce
;
5473 tree temp
= NULL_TREE
;
5475 VEC_iterate (constructor_elt
, CONSTRUCTOR_ELTS (*expr_p
),
5478 if (TREE_SIDE_EFFECTS (ce
->value
))
5479 append_to_statement_list (ce
->value
, &temp
);
5484 /* C99 code may assign to an array in a constructed
5485 structure or union, and this has undefined behavior only
5486 on execution, so create a temporary if an lvalue is
5488 else if (fallback
== fb_lvalue
)
5490 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
5491 lang_hooks
.mark_addressable (*expr_p
);
5497 /* The following are special cases that are not handled by the
5498 original GIMPLE grammar. */
5500 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
5503 ret
= gimplify_save_expr (expr_p
, pre_p
, post_p
);
5508 enum gimplify_status r0
, r1
, r2
;
5510 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5511 is_gimple_lvalue
, fb_either
);
5512 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
5513 is_gimple_val
, fb_rvalue
);
5514 r2
= gimplify_expr (&TREE_OPERAND (*expr_p
, 2), pre_p
, post_p
,
5515 is_gimple_val
, fb_rvalue
);
5516 recalculate_side_effects (*expr_p
);
5518 ret
= MIN (r0
, MIN (r1
, r2
));
5522 case NON_LVALUE_EXPR
:
5523 /* This should have been stripped above. */
5527 ret
= gimplify_asm_expr (expr_p
, pre_p
, post_p
);
5530 case TRY_FINALLY_EXPR
:
5531 case TRY_CATCH_EXPR
:
5532 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p
, 0));
5533 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p
, 1));
5537 case CLEANUP_POINT_EXPR
:
5538 ret
= gimplify_cleanup_point_expr (expr_p
, pre_p
);
5542 ret
= gimplify_target_expr (expr_p
, pre_p
, post_p
);
5546 gimplify_to_stmt_list (&CATCH_BODY (*expr_p
));
5550 case EH_FILTER_EXPR
:
5551 gimplify_to_stmt_list (&EH_FILTER_FAILURE (*expr_p
));
5557 enum gimplify_status r0
, r1
;
5558 r0
= gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p
), pre_p
, post_p
,
5559 is_gimple_val
, fb_rvalue
);
5560 r1
= gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p
), pre_p
, post_p
,
5561 is_gimple_val
, fb_rvalue
);
5567 /* We get here when taking the address of a label. We mark
5568 the label as "forced"; meaning it can never be removed and
5569 it is a potential target for any computed goto. */
5570 FORCED_LABEL (*expr_p
) = 1;
5574 case STATEMENT_LIST
:
5575 ret
= gimplify_statement_list (expr_p
);
5578 case WITH_SIZE_EXPR
:
5580 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
5581 post_p
== &internal_post
? NULL
: post_p
,
5582 gimple_test_f
, fallback
);
5583 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
5584 is_gimple_val
, fb_rvalue
);
5590 ret
= gimplify_var_or_parm_decl (expr_p
);
5594 /* When within an OpenMP context, notice uses of variables. */
5595 if (gimplify_omp_ctxp
)
5596 omp_notice_variable (gimplify_omp_ctxp
, *expr_p
, true);
5601 /* Allow callbacks into the gimplifier during optimization. */
5606 ret
= gimplify_omp_parallel (expr_p
, pre_p
);
5610 ret
= gimplify_omp_for (expr_p
, pre_p
);
5615 ret
= gimplify_omp_workshare (expr_p
, pre_p
);
5622 gimplify_to_stmt_list (&OMP_BODY (*expr_p
));
5626 ret
= gimplify_omp_atomic (expr_p
, pre_p
);
5635 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p
)))
5637 case tcc_comparison
:
5638 /* If this is a comparison of objects of aggregate type,
5639 handle it specially (by converting to a call to
5640 memcmp). It would be nice to only have to do this
5641 for variable-sized objects, but then we'd have to
5642 allow the same nest of reference nodes we allow for
5643 MODIFY_EXPR and that's too complex. */
5644 if (!AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p
, 1))))
5646 ret
= gimplify_variable_sized_compare (expr_p
);
5649 /* If *EXPR_P does not need to be special-cased, handle it
5650 according to its class. */
5652 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
5653 post_p
, is_gimple_val
, fb_rvalue
);
5659 enum gimplify_status r0
, r1
;
5661 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
5662 post_p
, is_gimple_val
, fb_rvalue
);
5663 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
,
5664 post_p
, is_gimple_val
, fb_rvalue
);
5670 case tcc_declaration
:
5673 goto dont_recalculate
;
5676 gcc_assert (TREE_CODE (*expr_p
) == TRUTH_AND_EXPR
5677 || TREE_CODE (*expr_p
) == TRUTH_OR_EXPR
5678 || TREE_CODE (*expr_p
) == TRUTH_XOR_EXPR
);
5682 recalculate_side_effects (*expr_p
);
5687 /* If we replaced *expr_p, gimplify again. */
5688 if (ret
== GS_OK
&& (*expr_p
== NULL
|| *expr_p
== save_expr
))
5691 while (ret
== GS_OK
);
5693 /* If we encountered an error_mark somewhere nested inside, either
5694 stub out the statement or propagate the error back out. */
5695 if (ret
== GS_ERROR
)
5702 /* This was only valid as a return value from the langhook, which
5703 we handled. Make sure it doesn't escape from any other context. */
5704 gcc_assert (ret
!= GS_UNHANDLED
);
5706 if (fallback
== fb_none
&& *expr_p
&& !is_gimple_stmt (*expr_p
))
5708 /* We aren't looking for a value, and we don't have a valid
5709 statement. If it doesn't have side-effects, throw it away. */
5710 if (!TREE_SIDE_EFFECTS (*expr_p
))
5712 else if (!TREE_THIS_VOLATILE (*expr_p
))
5714 /* This is probably a _REF that contains something nested that
5715 has side effects. Recurse through the operands to find it. */
5716 enum tree_code code
= TREE_CODE (*expr_p
);
5723 case VIEW_CONVERT_EXPR
:
5724 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5725 gimple_test_f
, fallback
);
5728 case ARRAY_REF
: case ARRAY_RANGE_REF
:
5729 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5730 gimple_test_f
, fallback
);
5731 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
5732 gimple_test_f
, fallback
);
5736 /* Anything else with side-effects must be converted to
5737 a valid statement before we get here. */
5743 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p
)))
5745 /* Historically, the compiler has treated a bare
5746 reference to a volatile lvalue as forcing a load. */
5747 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p
));
5748 /* Normally, we do not want to create a temporary for a
5749 TREE_ADDRESSABLE type because such a type should not be
5750 copied by bitwise-assignment. However, we make an
5751 exception here, as all we are doing here is ensuring that
5752 we read the bytes that make up the type. We use
5753 create_tmp_var_raw because create_tmp_var will abort when
5754 given a TREE_ADDRESSABLE type. */
5755 tree tmp
= create_tmp_var_raw (type
, "vol");
5756 gimple_add_tmp_var (tmp
);
5757 *expr_p
= build2 (MODIFY_EXPR
, type
, tmp
, *expr_p
);
5760 /* We can't do anything useful with a volatile reference to
5761 incomplete type, so just throw it away. */
5765 /* If we are gimplifying at the statement level, we're done. Tack
5766 everything together and replace the original statement with the
5768 if (fallback
== fb_none
|| is_statement
)
5770 if (internal_pre
|| internal_post
)
5772 append_to_statement_list (*expr_p
, &internal_pre
);
5773 append_to_statement_list (internal_post
, &internal_pre
);
5774 annotate_all_with_locus (&internal_pre
, input_location
);
5775 *expr_p
= internal_pre
;
5779 else if (TREE_CODE (*expr_p
) == STATEMENT_LIST
)
5780 annotate_all_with_locus (expr_p
, input_location
);
5782 annotate_one_with_locus (*expr_p
, input_location
);
5786 /* Otherwise we're gimplifying a subexpression, so the resulting value is
5789 /* If it's sufficiently simple already, we're done. Unless we are
5790 handling some post-effects internally; if that's the case, we need to
5791 copy into a temp before adding the post-effects to the tree. */
5792 if (!internal_post
&& (*gimple_test_f
) (*expr_p
))
5795 /* Otherwise, we need to create a new temporary for the gimplified
5798 /* We can't return an lvalue if we have an internal postqueue. The
5799 object the lvalue refers to would (probably) be modified by the
5800 postqueue; we need to copy the value out first, which means an
5802 if ((fallback
& fb_lvalue
) && !internal_post
5803 && is_gimple_addressable (*expr_p
))
5805 /* An lvalue will do. Take the address of the expression, store it
5806 in a temporary, and replace the expression with an INDIRECT_REF of
5808 tmp
= build_fold_addr_expr (*expr_p
);
5809 gimplify_expr (&tmp
, pre_p
, post_p
, is_gimple_reg
, fb_rvalue
);
5810 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (tmp
)), tmp
);
5812 else if ((fallback
& fb_rvalue
) && is_gimple_formal_tmp_rhs (*expr_p
))
5814 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p
)));
5816 /* An rvalue will do. Assign the gimplified expression into a new
5817 temporary TMP and replace the original expression with TMP. */
5819 if (internal_post
|| (fallback
& fb_lvalue
))
5820 /* The postqueue might change the value of the expression between
5821 the initialization and use of the temporary, so we can't use a
5822 formal temp. FIXME do we care? */
5823 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
5825 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
5827 if (TREE_CODE (*expr_p
) != SSA_NAME
)
5828 DECL_GIMPLE_FORMAL_TEMP_P (*expr_p
) = 1;
5832 #ifdef ENABLE_CHECKING
5833 if (!(fallback
& fb_mayfail
))
5835 fprintf (stderr
, "gimplification failed:\n");
5836 print_generic_expr (stderr
, *expr_p
, 0);
5837 debug_tree (*expr_p
);
5838 internal_error ("gimplification failed");
5841 gcc_assert (fallback
& fb_mayfail
);
5842 /* If this is an asm statement, and the user asked for the
5843 impossible, don't die. Fail and let gimplify_asm_expr
5849 /* Make sure the temporary matches our predicate. */
5850 gcc_assert ((*gimple_test_f
) (*expr_p
));
5854 annotate_all_with_locus (&internal_post
, input_location
);
5855 append_to_statement_list (internal_post
, pre_p
);
5859 input_location
= saved_location
;
5863 /* Look through TYPE for variable-sized objects and gimplify each such
5864 size that we find. Add to LIST_P any statements generated. */
5867 gimplify_type_sizes (tree type
, tree
*list_p
)
5871 if (type
== NULL
|| type
== error_mark_node
)
5874 /* We first do the main variant, then copy into any other variants. */
5875 type
= TYPE_MAIN_VARIANT (type
);
5877 /* Avoid infinite recursion. */
5878 if (TYPE_SIZES_GIMPLIFIED (type
))
5881 TYPE_SIZES_GIMPLIFIED (type
) = 1;
5883 switch (TREE_CODE (type
))
5889 gimplify_one_sizepos (&TYPE_MIN_VALUE (type
), list_p
);
5890 gimplify_one_sizepos (&TYPE_MAX_VALUE (type
), list_p
);
5892 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5894 TYPE_MIN_VALUE (t
) = TYPE_MIN_VALUE (type
);
5895 TYPE_MAX_VALUE (t
) = TYPE_MAX_VALUE (type
);
5900 /* These types may not have declarations, so handle them here. */
5901 gimplify_type_sizes (TREE_TYPE (type
), list_p
);
5902 gimplify_type_sizes (TYPE_DOMAIN (type
), list_p
);
5907 case QUAL_UNION_TYPE
:
5908 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
5909 if (TREE_CODE (field
) == FIELD_DECL
)
5911 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field
), list_p
);
5912 gimplify_type_sizes (TREE_TYPE (field
), list_p
);
5917 case REFERENCE_TYPE
:
5918 gimplify_type_sizes (TREE_TYPE (type
), list_p
);
5925 gimplify_one_sizepos (&TYPE_SIZE (type
), list_p
);
5926 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type
), list_p
);
5928 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5930 TYPE_SIZE (t
) = TYPE_SIZE (type
);
5931 TYPE_SIZE_UNIT (t
) = TYPE_SIZE_UNIT (type
);
5932 TYPE_SIZES_GIMPLIFIED (t
) = 1;
5936 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
5937 a size or position, has had all of its SAVE_EXPRs evaluated.
5938 We add any required statements to STMT_P. */
5941 gimplify_one_sizepos (tree
*expr_p
, tree
*stmt_p
)
5943 tree type
, expr
= *expr_p
;
5945 /* We don't do anything if the value isn't there, is constant, or contains
5946 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
5947 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
5948 will want to replace it with a new variable, but that will cause problems
5949 if this type is from outside the function. It's OK to have that here. */
5950 if (expr
== NULL_TREE
|| TREE_CONSTANT (expr
)
5951 || TREE_CODE (expr
) == VAR_DECL
5952 || CONTAINS_PLACEHOLDER_P (expr
))
5955 type
= TREE_TYPE (expr
);
5956 *expr_p
= unshare_expr (expr
);
5958 gimplify_expr (expr_p
, stmt_p
, NULL
, is_gimple_val
, fb_rvalue
);
5961 /* Verify that we've an exact type match with the original expression.
5962 In particular, we do not wish to drop a "sizetype" in favour of a
5963 type of similar dimensions. We don't want to pollute the generic
5964 type-stripping code with this knowledge because it doesn't matter
5965 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
5966 and friends retain their "sizetype-ness". */
5967 if (TREE_TYPE (expr
) != type
5968 && TREE_CODE (type
) == INTEGER_TYPE
5969 && TYPE_IS_SIZETYPE (type
))
5973 *expr_p
= create_tmp_var (type
, NULL
);
5974 tmp
= build1 (NOP_EXPR
, type
, expr
);
5975 tmp
= build2 (MODIFY_EXPR
, type
, *expr_p
, tmp
);
5976 if (EXPR_HAS_LOCATION (expr
))
5977 SET_EXPR_LOCUS (tmp
, EXPR_LOCUS (expr
));
5979 SET_EXPR_LOCATION (tmp
, input_location
);
5981 gimplify_and_add (tmp
, stmt_p
);
5985 #ifdef ENABLE_CHECKING
5986 /* Compare types A and B for a "close enough" match. */
5989 cpt_same_type (tree a
, tree b
)
5991 if (lang_hooks
.types_compatible_p (a
, b
))
5994 /* ??? The C++ FE decomposes METHOD_TYPES to FUNCTION_TYPES and doesn't
5995 link them together. This routine is intended to catch type errors
5996 that will affect the optimizers, and the optimizers don't add new
5997 dereferences of function pointers, so ignore it. */
5998 if ((TREE_CODE (a
) == FUNCTION_TYPE
|| TREE_CODE (a
) == METHOD_TYPE
)
5999 && (TREE_CODE (b
) == FUNCTION_TYPE
|| TREE_CODE (b
) == METHOD_TYPE
))
6002 /* ??? The C FE pushes type qualifiers after the fact into the type of
6003 the element from the type of the array. See build_unary_op's handling
6004 of ADDR_EXPR. This seems wrong -- if we were going to do this, we
6005 should have done it when creating the variable in the first place.
6006 Alternately, why aren't the two array types made variants? */
6007 if (TREE_CODE (a
) == ARRAY_TYPE
&& TREE_CODE (b
) == ARRAY_TYPE
)
6008 return cpt_same_type (TREE_TYPE (a
), TREE_TYPE (b
));
6010 /* And because of those, we have to recurse down through pointers. */
6011 if (POINTER_TYPE_P (a
) && POINTER_TYPE_P (b
))
6012 return cpt_same_type (TREE_TYPE (a
), TREE_TYPE (b
));
6017 /* Check for some cases of the front end missing cast expressions.
6018 The type of a dereference should correspond to the pointer type;
6019 similarly the type of an address should match its object. */
6022 check_pointer_types_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
6023 void *data ATTRIBUTE_UNUSED
)
6026 tree ptype
, otype
, dtype
;
6028 switch (TREE_CODE (t
))
6032 otype
= TREE_TYPE (t
);
6033 ptype
= TREE_TYPE (TREE_OPERAND (t
, 0));
6034 dtype
= TREE_TYPE (ptype
);
6035 gcc_assert (cpt_same_type (otype
, dtype
));
6039 ptype
= TREE_TYPE (t
);
6040 otype
= TREE_TYPE (TREE_OPERAND (t
, 0));
6041 dtype
= TREE_TYPE (ptype
);
6042 if (!cpt_same_type (otype
, dtype
))
6044 /* &array is allowed to produce a pointer to the element, rather than
6045 a pointer to the array type. We must allow this in order to
6046 properly represent assigning the address of an array in C into
6047 pointer to the element type. */
6048 gcc_assert (TREE_CODE (otype
) == ARRAY_TYPE
6049 && POINTER_TYPE_P (ptype
)
6050 && cpt_same_type (TREE_TYPE (otype
), dtype
));
6064 /* Gimplify the body of statements pointed to by BODY_P. FNDECL is the
6065 function decl containing BODY. */
6068 gimplify_body (tree
*body_p
, tree fndecl
, bool do_parms
)
6070 location_t saved_location
= input_location
;
6071 tree body
, parm_stmts
;
6073 timevar_push (TV_TREE_GIMPLIFY
);
6075 gcc_assert (gimplify_ctxp
== NULL
);
6076 push_gimplify_context ();
6078 /* Unshare most shared trees in the body and in that of any nested functions.
6079 It would seem we don't have to do this for nested functions because
6080 they are supposed to be output and then the outer function gimplified
6081 first, but the g++ front end doesn't always do it that way. */
6082 unshare_body (body_p
, fndecl
);
6083 unvisit_body (body_p
, fndecl
);
6085 /* Make sure input_location isn't set to something wierd. */
6086 input_location
= DECL_SOURCE_LOCATION (fndecl
);
6088 /* Resolve callee-copies. This has to be done before processing
6089 the body so that DECL_VALUE_EXPR gets processed correctly. */
6090 parm_stmts
= do_parms
? gimplify_parameters () : NULL
;
6092 /* Gimplify the function's body. */
6093 gimplify_stmt (body_p
);
6097 body
= alloc_stmt_list ();
6098 else if (TREE_CODE (body
) == STATEMENT_LIST
)
6100 tree t
= expr_only (*body_p
);
6105 /* If there isn't an outer BIND_EXPR, add one. */
6106 if (TREE_CODE (body
) != BIND_EXPR
)
6108 tree b
= build3 (BIND_EXPR
, void_type_node
, NULL_TREE
,
6109 NULL_TREE
, NULL_TREE
);
6110 TREE_SIDE_EFFECTS (b
) = 1;
6111 append_to_statement_list_force (body
, &BIND_EXPR_BODY (b
));
6115 /* If we had callee-copies statements, insert them at the beginning
6119 append_to_statement_list_force (BIND_EXPR_BODY (body
), &parm_stmts
);
6120 BIND_EXPR_BODY (body
) = parm_stmts
;
6123 /* Unshare again, in case gimplification was sloppy. */
6124 unshare_all_trees (body
);
6128 pop_gimplify_context (body
);
6129 gcc_assert (gimplify_ctxp
== NULL
);
6131 #ifdef ENABLE_CHECKING
6132 walk_tree (body_p
, check_pointer_types_r
, NULL
, NULL
);
6135 timevar_pop (TV_TREE_GIMPLIFY
);
6136 input_location
= saved_location
;
6139 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
6140 node for the function we want to gimplify. */
6143 gimplify_function_tree (tree fndecl
)
6145 tree oldfn
, parm
, ret
;
6147 oldfn
= current_function_decl
;
6148 current_function_decl
= fndecl
;
6149 cfun
= DECL_STRUCT_FUNCTION (fndecl
);
6151 allocate_struct_function (fndecl
);
6153 for (parm
= DECL_ARGUMENTS (fndecl
); parm
; parm
= TREE_CHAIN (parm
))
6155 /* Preliminarily mark non-addressed complex variables as eligible
6156 for promotion to gimple registers. We'll transform their uses
6158 if (TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
6159 && !TREE_THIS_VOLATILE (parm
)
6160 && !needs_to_live_in_memory (parm
))
6161 DECL_COMPLEX_GIMPLE_REG_P (parm
) = 1;
6164 ret
= DECL_RESULT (fndecl
);
6165 if (TREE_CODE (TREE_TYPE (ret
)) == COMPLEX_TYPE
6166 && !needs_to_live_in_memory (ret
))
6167 DECL_COMPLEX_GIMPLE_REG_P (ret
) = 1;
6169 gimplify_body (&DECL_SAVED_TREE (fndecl
), fndecl
, true);
6171 /* If we're instrumenting function entry/exit, then prepend the call to
6172 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
6173 catch the exit hook. */
6174 /* ??? Add some way to ignore exceptions for this TFE. */
6175 if (flag_instrument_function_entry_exit
6176 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl
))
6180 tf
= build2 (TRY_FINALLY_EXPR
, void_type_node
, NULL
, NULL
);
6181 TREE_SIDE_EFFECTS (tf
) = 1;
6182 x
= DECL_SAVED_TREE (fndecl
);
6183 append_to_statement_list (x
, &TREE_OPERAND (tf
, 0));
6184 x
= implicit_built_in_decls
[BUILT_IN_PROFILE_FUNC_EXIT
];
6185 x
= build_function_call_expr (x
, NULL
);
6186 append_to_statement_list (x
, &TREE_OPERAND (tf
, 1));
6188 bind
= build3 (BIND_EXPR
, void_type_node
, NULL
, NULL
, NULL
);
6189 TREE_SIDE_EFFECTS (bind
) = 1;
6190 x
= implicit_built_in_decls
[BUILT_IN_PROFILE_FUNC_ENTER
];
6191 x
= build_function_call_expr (x
, NULL
);
6192 append_to_statement_list (x
, &BIND_EXPR_BODY (bind
));
6193 append_to_statement_list (tf
, &BIND_EXPR_BODY (bind
));
6195 DECL_SAVED_TREE (fndecl
) = bind
;
6198 current_function_decl
= oldfn
;
6199 cfun
= oldfn
? DECL_STRUCT_FUNCTION (oldfn
) : NULL
;
6203 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
6204 force the result to be either ssa_name or an invariant, otherwise
6205 just force it to be a rhs expression. If VAR is not NULL, make the
6206 base variable of the final destination be VAR if suitable. */
6209 force_gimple_operand (tree expr
, tree
*stmts
, bool simple
, tree var
)
6212 enum gimplify_status ret
;
6213 gimple_predicate gimple_test_f
;
6217 if (is_gimple_val (expr
))
6220 gimple_test_f
= simple
? is_gimple_val
: is_gimple_reg_rhs
;
6222 push_gimplify_context ();
6223 gimplify_ctxp
->into_ssa
= in_ssa_p
;
6226 expr
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, expr
);
6228 ret
= gimplify_expr (&expr
, stmts
, NULL
,
6229 gimple_test_f
, fb_rvalue
);
6230 gcc_assert (ret
!= GS_ERROR
);
6232 if (referenced_vars
)
6234 for (t
= gimplify_ctxp
->temps
; t
; t
= TREE_CHAIN (t
))
6235 add_referenced_var (t
);
6238 pop_gimplify_context (NULL
);
6243 /* Invokes force_gimple_operand for EXPR with parameters SIMPLE_P and VAR. If
6244 some statements are produced, emits them before BSI. */
6247 force_gimple_operand_bsi (block_stmt_iterator
*bsi
, tree expr
,
6248 bool simple_p
, tree var
)
6252 expr
= force_gimple_operand (expr
, &stmts
, simple_p
, var
);
6254 bsi_insert_before (bsi
, stmts
, BSI_SAME_STMT
);
6259 #include "gt-gimplify.h"