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 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
;
80 struct gimplify_ctx
*prev_context
;
82 tree current_bind_expr
;
84 tree conditional_cleanups
;
88 VEC(tree
,heap
) *case_labels
;
89 /* The formal temporary table. Should this be persistent? */
97 static struct gimplify_ctx
*gimplify_ctxp
;
98 static struct gimplify_omp_ctx
*gimplify_omp_ctxp
;
102 /* Formal (expression) temporary table handling: Multiple occurrences of
103 the same scalar expression are evaluated into the same temporary. */
105 typedef struct gimple_temp_hash_elt
108 tree temp
; /* Value */
111 /* Forward declarations. */
112 static enum gimplify_status
gimplify_compound_expr (tree
*, tree
*, bool);
113 #ifdef ENABLE_CHECKING
114 static bool cpt_same_type (tree a
, tree b
);
118 /* Return a hash value for a formal temporary table entry. */
121 gimple_tree_hash (const void *p
)
123 tree t
= ((const elt_t
*) p
)->val
;
124 return iterative_hash_expr (t
, 0);
127 /* Compare two formal temporary table entries. */
130 gimple_tree_eq (const void *p1
, const void *p2
)
132 tree t1
= ((const elt_t
*) p1
)->val
;
133 tree t2
= ((const elt_t
*) p2
)->val
;
134 enum tree_code code
= TREE_CODE (t1
);
136 if (TREE_CODE (t2
) != code
137 || TREE_TYPE (t1
) != TREE_TYPE (t2
))
140 if (!operand_equal_p (t1
, t2
, 0))
143 /* Only allow them to compare equal if they also hash equal; otherwise
144 results are nondeterminate, and we fail bootstrap comparison. */
145 gcc_assert (gimple_tree_hash (p1
) == gimple_tree_hash (p2
));
150 /* Set up a context for the gimplifier. */
153 push_gimplify_context (void)
155 struct gimplify_ctx
*c
;
157 c
= (struct gimplify_ctx
*) xcalloc (1, sizeof (struct gimplify_ctx
));
158 c
->prev_context
= gimplify_ctxp
;
160 c
->temp_htab
= htab_create (1000, gimple_tree_hash
, gimple_tree_eq
, free
);
165 /* Tear down a context for the gimplifier. If BODY is non-null, then
166 put the temporaries into the outer BIND_EXPR. Otherwise, put them
167 in the unexpanded_var_list. */
170 pop_gimplify_context (tree body
)
172 struct gimplify_ctx
*c
= gimplify_ctxp
;
175 gcc_assert (c
&& !c
->current_bind_expr
);
176 gimplify_ctxp
= c
->prev_context
;
178 for (t
= c
->temps
; t
; t
= TREE_CHAIN (t
))
179 DECL_GIMPLE_FORMAL_TEMP_P (t
) = 0;
182 declare_tmp_vars (c
->temps
, body
);
184 record_vars (c
->temps
);
187 htab_delete (c
->temp_htab
);
192 gimple_push_bind_expr (tree bind
)
194 TREE_CHAIN (bind
) = gimplify_ctxp
->current_bind_expr
;
195 gimplify_ctxp
->current_bind_expr
= bind
;
199 gimple_pop_bind_expr (void)
201 gimplify_ctxp
->current_bind_expr
202 = TREE_CHAIN (gimplify_ctxp
->current_bind_expr
);
206 gimple_current_bind_expr (void)
208 return gimplify_ctxp
->current_bind_expr
;
211 /* Returns true iff there is a COND_EXPR between us and the innermost
212 CLEANUP_POINT_EXPR. This info is used by gimple_push_cleanup. */
215 gimple_conditional_context (void)
217 return gimplify_ctxp
->conditions
> 0;
220 /* Note that we've entered a COND_EXPR. */
223 gimple_push_condition (void)
225 #ifdef ENABLE_CHECKING
226 if (gimplify_ctxp
->conditions
== 0)
227 gcc_assert (!gimplify_ctxp
->conditional_cleanups
);
229 ++(gimplify_ctxp
->conditions
);
232 /* Note that we've left a COND_EXPR. If we're back at unconditional scope
233 now, add any conditional cleanups we've seen to the prequeue. */
236 gimple_pop_condition (tree
*pre_p
)
238 int conds
= --(gimplify_ctxp
->conditions
);
240 gcc_assert (conds
>= 0);
243 append_to_statement_list (gimplify_ctxp
->conditional_cleanups
, pre_p
);
244 gimplify_ctxp
->conditional_cleanups
= NULL_TREE
;
248 /* A stable comparison routine for use with splay trees and DECLs. */
251 splay_tree_compare_decl_uid (splay_tree_key xa
, splay_tree_key xb
)
256 return DECL_UID (a
) - DECL_UID (b
);
259 /* Create a new omp construct that deals with variable remapping. */
261 static struct gimplify_omp_ctx
*
262 new_omp_context (bool is_parallel
)
264 struct gimplify_omp_ctx
*c
;
266 c
= XCNEW (struct gimplify_omp_ctx
);
267 c
->outer_context
= gimplify_omp_ctxp
;
268 c
->variables
= splay_tree_new (splay_tree_compare_decl_uid
, 0, 0);
269 c
->privatized_types
= pointer_set_create ();
270 c
->location
= input_location
;
271 c
->is_parallel
= is_parallel
;
272 c
->default_kind
= OMP_CLAUSE_DEFAULT_SHARED
;
277 /* Destroy an omp construct that deals with variable remapping. */
280 delete_omp_context (struct gimplify_omp_ctx
*c
)
282 splay_tree_delete (c
->variables
);
283 pointer_set_destroy (c
->privatized_types
);
287 static void omp_add_variable (struct gimplify_omp_ctx
*, tree
, unsigned int);
288 static bool omp_notice_variable (struct gimplify_omp_ctx
*, tree
, bool);
290 /* A subroutine of append_to_statement_list{,_force}. T is not NULL. */
293 append_to_statement_list_1 (tree t
, tree
*list_p
)
296 tree_stmt_iterator i
;
300 if (t
&& TREE_CODE (t
) == STATEMENT_LIST
)
305 *list_p
= list
= alloc_stmt_list ();
309 tsi_link_after (&i
, t
, TSI_CONTINUE_LINKING
);
312 /* Add T to the end of the list container pointed to by LIST_P.
313 If T is an expression with no effects, it is ignored. */
316 append_to_statement_list (tree t
, tree
*list_p
)
318 if (t
&& TREE_SIDE_EFFECTS (t
))
319 append_to_statement_list_1 (t
, list_p
);
322 /* Similar, but the statement is always added, regardless of side effects. */
325 append_to_statement_list_force (tree t
, tree
*list_p
)
328 append_to_statement_list_1 (t
, list_p
);
331 /* Both gimplify the statement T and append it to LIST_P. */
334 gimplify_and_add (tree t
, tree
*list_p
)
337 append_to_statement_list (t
, list_p
);
340 /* Strip off a legitimate source ending from the input string NAME of
341 length LEN. Rather than having to know the names used by all of
342 our front ends, we strip off an ending of a period followed by
343 up to five characters. (Java uses ".class".) */
346 remove_suffix (char *name
, int len
)
350 for (i
= 2; i
< 8 && len
> i
; i
++)
352 if (name
[len
- i
] == '.')
354 name
[len
- i
] = '\0';
360 /* Create a nameless artificial label and put it in the current function
361 context. Returns the newly created label. */
364 create_artificial_label (void)
366 tree lab
= build_decl (LABEL_DECL
, NULL_TREE
, void_type_node
);
368 DECL_ARTIFICIAL (lab
) = 1;
369 DECL_IGNORED_P (lab
) = 1;
370 DECL_CONTEXT (lab
) = current_function_decl
;
374 /* Subroutine for find_single_pointer_decl. */
377 find_single_pointer_decl_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
380 tree
*pdecl
= (tree
*) data
;
382 if (DECL_P (*tp
) && POINTER_TYPE_P (TREE_TYPE (*tp
)))
386 /* We already found a pointer decl; return anything other
387 than NULL_TREE to unwind from walk_tree signalling that
388 we have a duplicate. */
397 /* Find the single DECL of pointer type in the tree T and return it.
398 If there are zero or more than one such DECLs, return NULL. */
401 find_single_pointer_decl (tree t
)
403 tree decl
= NULL_TREE
;
405 if (walk_tree (&t
, find_single_pointer_decl_1
, &decl
, NULL
))
407 /* find_single_pointer_decl_1 returns a non-zero value, causing
408 walk_tree to return a non-zero value, to indicate that it
409 found more than one pointer DECL. */
416 /* Create a new temporary name with PREFIX. Returns an identifier. */
418 static GTY(()) unsigned int tmp_var_id_num
;
421 create_tmp_var_name (const char *prefix
)
427 char *preftmp
= ASTRDUP (prefix
);
429 remove_suffix (preftmp
, strlen (preftmp
));
433 ASM_FORMAT_PRIVATE_NAME (tmp_name
, prefix
? prefix
: "T", tmp_var_id_num
++);
434 return get_identifier (tmp_name
);
438 /* Create a new temporary variable declaration of type TYPE.
439 Does NOT push it into the current binding. */
442 create_tmp_var_raw (tree type
, const char *prefix
)
447 /* Make the type of the variable writable. */
448 new_type
= build_type_variant (type
, 0, 0);
449 TYPE_ATTRIBUTES (new_type
) = TYPE_ATTRIBUTES (type
);
451 tmp_var
= build_decl (VAR_DECL
, prefix
? create_tmp_var_name (prefix
) : NULL
,
454 /* The variable was declared by the compiler. */
455 DECL_ARTIFICIAL (tmp_var
) = 1;
456 /* And we don't want debug info for it. */
457 DECL_IGNORED_P (tmp_var
) = 1;
459 /* Make the variable writable. */
460 TREE_READONLY (tmp_var
) = 0;
462 DECL_EXTERNAL (tmp_var
) = 0;
463 TREE_STATIC (tmp_var
) = 0;
464 TREE_USED (tmp_var
) = 1;
469 /* Create a new temporary variable declaration of type TYPE. DOES push the
470 variable into the current binding. Further, assume that this is called
471 only from gimplification or optimization, at which point the creation of
472 certain types are bugs. */
475 create_tmp_var (tree type
, const char *prefix
)
479 /* We don't allow types that are addressable (meaning we can't make copies),
480 incomplete, or of variable size. */
481 gcc_assert (!TREE_ADDRESSABLE (type
)
482 && COMPLETE_TYPE_P (type
)
483 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
);
485 tmp_var
= create_tmp_var_raw (type
, prefix
);
486 gimple_add_tmp_var (tmp_var
);
490 /* Given a tree, try to return a useful variable name that we can use
491 to prefix a temporary that is being assigned the value of the tree.
492 I.E. given <temp> = &A, return A. */
500 STRIP_NOPS (stripped_decl
);
501 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
502 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
505 switch (TREE_CODE (stripped_decl
))
508 return get_name (TREE_OPERAND (stripped_decl
, 0));
516 /* Create a temporary with a name derived from VAL. Subroutine of
517 lookup_tmp_var; nobody else should call this function. */
520 create_tmp_from_val (tree val
)
522 return create_tmp_var (TYPE_MAIN_VARIANT (TREE_TYPE (val
)), get_name (val
));
525 /* Create a temporary to hold the value of VAL. If IS_FORMAL, try to reuse
526 an existing expression temporary. */
529 lookup_tmp_var (tree val
, bool is_formal
)
533 /* If not optimizing, never really reuse a temporary. local-alloc
534 won't allocate any variable that is used in more than one basic
535 block, which means it will go into memory, causing much extra
536 work in reload and final and poorer code generation, outweighing
537 the extra memory allocation here. */
538 if (!optimize
|| !is_formal
|| TREE_SIDE_EFFECTS (val
))
539 ret
= create_tmp_from_val (val
);
546 slot
= htab_find_slot (gimplify_ctxp
->temp_htab
, (void *)&elt
, INSERT
);
549 elt_p
= XNEW (elt_t
);
551 elt_p
->temp
= ret
= create_tmp_from_val (val
);
552 *slot
= (void *) elt_p
;
556 elt_p
= (elt_t
*) *slot
;
562 DECL_GIMPLE_FORMAL_TEMP_P (ret
) = 1;
567 /* Returns a formal temporary variable initialized with VAL. PRE_P is as
568 in gimplify_expr. Only use this function if:
570 1) The value of the unfactored expression represented by VAL will not
571 change between the initialization and use of the temporary, and
572 2) The temporary will not be otherwise modified.
574 For instance, #1 means that this is inappropriate for SAVE_EXPR temps,
575 and #2 means it is inappropriate for && temps.
577 For other cases, use get_initialized_tmp_var instead. */
580 internal_get_tmp_var (tree val
, tree
*pre_p
, tree
*post_p
, bool is_formal
)
584 gimplify_expr (&val
, pre_p
, post_p
, is_gimple_formal_tmp_rhs
, fb_rvalue
);
586 t
= lookup_tmp_var (val
, is_formal
);
590 tree u
= find_single_pointer_decl (val
);
592 if (u
&& TREE_CODE (u
) == VAR_DECL
&& DECL_BASED_ON_RESTRICT_P (u
))
593 u
= DECL_GET_RESTRICT_BASE (u
);
594 if (u
&& TYPE_RESTRICT (TREE_TYPE (u
)))
596 if (DECL_BASED_ON_RESTRICT_P (t
))
597 gcc_assert (u
== DECL_GET_RESTRICT_BASE (t
));
600 DECL_BASED_ON_RESTRICT_P (t
) = 1;
601 SET_DECL_RESTRICT_BASE (t
, u
);
606 if (TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
)
607 DECL_COMPLEX_GIMPLE_REG_P (t
) = 1;
609 mod
= build2 (MODIFY_EXPR
, TREE_TYPE (t
), t
, val
);
611 if (EXPR_HAS_LOCATION (val
))
612 SET_EXPR_LOCUS (mod
, EXPR_LOCUS (val
));
614 SET_EXPR_LOCATION (mod
, input_location
);
616 /* gimplify_modify_expr might want to reduce this further. */
617 gimplify_and_add (mod
, pre_p
);
619 /* If we're gimplifying into ssa, gimplify_modify_expr will have
620 given our temporary an ssa name. Find and return it. */
621 if (gimplify_ctxp
->into_ssa
)
622 t
= TREE_OPERAND (mod
, 0);
627 /* Returns a formal temporary variable initialized with VAL. PRE_P
628 points to a statement list where side-effects needed to compute VAL
632 get_formal_tmp_var (tree val
, tree
*pre_p
)
634 return internal_get_tmp_var (val
, pre_p
, NULL
, true);
637 /* Returns a temporary variable initialized with VAL. PRE_P and POST_P
638 are as in gimplify_expr. */
641 get_initialized_tmp_var (tree val
, tree
*pre_p
, tree
*post_p
)
643 return internal_get_tmp_var (val
, pre_p
, post_p
, false);
646 /* Declares all the variables in VARS in SCOPE. */
649 declare_tmp_vars (tree vars
, tree scope
)
656 /* C99 mode puts the default 'return 0;' for main outside the outer
657 braces. So drill down until we find an actual scope. */
658 while (TREE_CODE (scope
) == COMPOUND_EXPR
)
659 scope
= TREE_OPERAND (scope
, 0);
661 gcc_assert (TREE_CODE (scope
) == BIND_EXPR
);
663 temps
= nreverse (last
);
664 TREE_CHAIN (last
) = BIND_EXPR_VARS (scope
);
665 BIND_EXPR_VARS (scope
) = temps
;
670 gimple_add_tmp_var (tree tmp
)
672 gcc_assert (!TREE_CHAIN (tmp
) && !DECL_SEEN_IN_BIND_EXPR_P (tmp
));
674 DECL_CONTEXT (tmp
) = current_function_decl
;
675 DECL_SEEN_IN_BIND_EXPR_P (tmp
) = 1;
679 TREE_CHAIN (tmp
) = gimplify_ctxp
->temps
;
680 gimplify_ctxp
->temps
= tmp
;
682 /* Mark temporaries local within the nearest enclosing parallel. */
683 if (gimplify_omp_ctxp
)
685 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
686 while (ctx
&& !ctx
->is_parallel
)
687 ctx
= ctx
->outer_context
;
689 omp_add_variable (ctx
, tmp
, GOVD_LOCAL
| GOVD_SEEN
);
695 declare_tmp_vars (tmp
, DECL_SAVED_TREE (current_function_decl
));
698 /* Determines whether to assign a locus to the statement STMT. */
701 should_carry_locus_p (tree stmt
)
703 /* Don't emit a line note for a label. We particularly don't want to
704 emit one for the break label, since it doesn't actually correspond
705 to the beginning of the loop/switch. */
706 if (TREE_CODE (stmt
) == LABEL_EXPR
)
709 /* Do not annotate empty statements, since it confuses gcov. */
710 if (!TREE_SIDE_EFFECTS (stmt
))
717 annotate_one_with_locus (tree t
, location_t locus
)
719 if (EXPR_P (t
) && ! EXPR_HAS_LOCATION (t
) && should_carry_locus_p (t
))
720 SET_EXPR_LOCATION (t
, locus
);
724 annotate_all_with_locus (tree
*stmt_p
, location_t locus
)
726 tree_stmt_iterator i
;
731 for (i
= tsi_start (*stmt_p
); !tsi_end_p (i
); tsi_next (&i
))
733 tree t
= tsi_stmt (i
);
735 /* Assuming we've already been gimplified, we shouldn't
736 see nested chaining constructs anymore. */
737 gcc_assert (TREE_CODE (t
) != STATEMENT_LIST
738 && TREE_CODE (t
) != COMPOUND_EXPR
);
740 annotate_one_with_locus (t
, locus
);
744 /* Similar to copy_tree_r() but do not copy SAVE_EXPR or TARGET_EXPR nodes.
745 These nodes model computations that should only be done once. If we
746 were to unshare something like SAVE_EXPR(i++), the gimplification
747 process would create wrong code. */
750 mostly_copy_tree_r (tree
*tp
, int *walk_subtrees
, void *data
)
752 enum tree_code code
= TREE_CODE (*tp
);
753 /* Don't unshare types, decls, constants and SAVE_EXPR nodes. */
754 if (TREE_CODE_CLASS (code
) == tcc_type
755 || TREE_CODE_CLASS (code
) == tcc_declaration
756 || TREE_CODE_CLASS (code
) == tcc_constant
757 || code
== SAVE_EXPR
|| code
== TARGET_EXPR
758 /* We can't do anything sensible with a BLOCK used as an expression,
759 but we also can't just die when we see it because of non-expression
760 uses. So just avert our eyes and cross our fingers. Silly Java. */
765 gcc_assert (code
!= BIND_EXPR
);
766 copy_tree_r (tp
, walk_subtrees
, data
);
772 /* Callback for walk_tree to unshare most of the shared trees rooted at
773 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
774 then *TP is deep copied by calling copy_tree_r.
776 This unshares the same trees as copy_tree_r with the exception of
777 SAVE_EXPR nodes. These nodes model computations that should only be
778 done once. If we were to unshare something like SAVE_EXPR(i++), the
779 gimplification process would create wrong code. */
782 copy_if_shared_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
783 void *data ATTRIBUTE_UNUSED
)
786 enum tree_code code
= TREE_CODE (t
);
788 /* Skip types, decls, and constants. But we do want to look at their
789 types and the bounds of types. Mark them as visited so we properly
790 unmark their subtrees on the unmark pass. If we've already seen them,
791 don't look down further. */
792 if (TREE_CODE_CLASS (code
) == tcc_type
793 || TREE_CODE_CLASS (code
) == tcc_declaration
794 || TREE_CODE_CLASS (code
) == tcc_constant
)
796 if (TREE_VISITED (t
))
799 TREE_VISITED (t
) = 1;
802 /* If this node has been visited already, unshare it and don't look
804 else if (TREE_VISITED (t
))
806 walk_tree (tp
, mostly_copy_tree_r
, NULL
, NULL
);
810 /* Otherwise, mark the tree as visited and keep looking. */
812 TREE_VISITED (t
) = 1;
818 unmark_visited_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
819 void *data ATTRIBUTE_UNUSED
)
821 if (TREE_VISITED (*tp
))
822 TREE_VISITED (*tp
) = 0;
829 /* Unshare all the trees in BODY_P, a pointer into the body of FNDECL, and the
830 bodies of any nested functions if we are unsharing the entire body of
834 unshare_body (tree
*body_p
, tree fndecl
)
836 struct cgraph_node
*cgn
= cgraph_node (fndecl
);
838 walk_tree (body_p
, copy_if_shared_r
, NULL
, NULL
);
839 if (body_p
== &DECL_SAVED_TREE (fndecl
))
840 for (cgn
= cgn
->nested
; cgn
; cgn
= cgn
->next_nested
)
841 unshare_body (&DECL_SAVED_TREE (cgn
->decl
), cgn
->decl
);
844 /* Likewise, but mark all trees as not visited. */
847 unvisit_body (tree
*body_p
, tree fndecl
)
849 struct cgraph_node
*cgn
= cgraph_node (fndecl
);
851 walk_tree (body_p
, unmark_visited_r
, NULL
, NULL
);
852 if (body_p
== &DECL_SAVED_TREE (fndecl
))
853 for (cgn
= cgn
->nested
; cgn
; cgn
= cgn
->next_nested
)
854 unvisit_body (&DECL_SAVED_TREE (cgn
->decl
), cgn
->decl
);
857 /* Unshare T and all the trees reached from T via TREE_CHAIN. */
860 unshare_all_trees (tree t
)
862 walk_tree (&t
, copy_if_shared_r
, NULL
, NULL
);
863 walk_tree (&t
, unmark_visited_r
, NULL
, NULL
);
866 /* Unconditionally make an unshared copy of EXPR. This is used when using
867 stored expressions which span multiple functions, such as BINFO_VTABLE,
868 as the normal unsharing process can't tell that they're shared. */
871 unshare_expr (tree expr
)
873 walk_tree (&expr
, mostly_copy_tree_r
, NULL
, NULL
);
877 /* A terser interface for building a representation of an exception
881 gimple_build_eh_filter (tree body
, tree allowed
, tree failure
)
885 /* FIXME should the allowed types go in TREE_TYPE? */
886 t
= build2 (EH_FILTER_EXPR
, void_type_node
, allowed
, NULL_TREE
);
887 append_to_statement_list (failure
, &EH_FILTER_FAILURE (t
));
889 t
= build2 (TRY_CATCH_EXPR
, void_type_node
, NULL_TREE
, t
);
890 append_to_statement_list (body
, &TREE_OPERAND (t
, 0));
896 /* WRAPPER is a code such as BIND_EXPR or CLEANUP_POINT_EXPR which can both
897 contain statements and have a value. Assign its value to a temporary
898 and give it void_type_node. Returns the temporary, or NULL_TREE if
899 WRAPPER was already void. */
902 voidify_wrapper_expr (tree wrapper
, tree temp
)
904 if (!VOID_TYPE_P (TREE_TYPE (wrapper
)))
906 tree
*p
, sub
= wrapper
;
909 /* Set p to point to the body of the wrapper. */
910 switch (TREE_CODE (sub
))
913 /* For a BIND_EXPR, the body is operand 1. */
914 p
= &BIND_EXPR_BODY (sub
);
918 p
= &TREE_OPERAND (sub
, 0);
922 /* Advance to the last statement. Set all container types to void. */
923 if (TREE_CODE (*p
) == STATEMENT_LIST
)
925 tree_stmt_iterator i
= tsi_last (*p
);
926 p
= tsi_end_p (i
) ? NULL
: tsi_stmt_ptr (i
);
930 for (; TREE_CODE (*p
) == COMPOUND_EXPR
; p
= &TREE_OPERAND (*p
, 1))
932 TREE_SIDE_EFFECTS (*p
) = 1;
933 TREE_TYPE (*p
) = void_type_node
;
937 if (p
== NULL
|| IS_EMPTY_STMT (*p
))
939 /* Look through exception handling. */
940 else if (TREE_CODE (*p
) == TRY_FINALLY_EXPR
941 || TREE_CODE (*p
) == TRY_CATCH_EXPR
)
946 /* The C++ frontend already did this for us. */
947 else if (TREE_CODE (*p
) == INIT_EXPR
948 || TREE_CODE (*p
) == TARGET_EXPR
)
949 temp
= TREE_OPERAND (*p
, 0);
950 /* If we're returning a dereference, move the dereference
951 outside the wrapper. */
952 else if (TREE_CODE (*p
) == INDIRECT_REF
)
954 tree ptr
= TREE_OPERAND (*p
, 0);
955 temp
= create_tmp_var (TREE_TYPE (ptr
), "retval");
956 *p
= build2 (MODIFY_EXPR
, TREE_TYPE (ptr
), temp
, ptr
);
957 temp
= build1 (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (temp
)), temp
);
958 /* If this is a BIND_EXPR for a const inline function, it might not
959 have TREE_SIDE_EFFECTS set. That is no longer accurate. */
960 TREE_SIDE_EFFECTS (wrapper
) = 1;
965 temp
= create_tmp_var (TREE_TYPE (wrapper
), "retval");
966 *p
= build2 (MODIFY_EXPR
, TREE_TYPE (temp
), temp
, *p
);
967 TREE_SIDE_EFFECTS (wrapper
) = 1;
970 TREE_TYPE (wrapper
) = void_type_node
;
977 /* Prepare calls to builtins to SAVE and RESTORE the stack as well as
978 a temporary through which they communicate. */
981 build_stack_save_restore (tree
*save
, tree
*restore
)
983 tree save_call
, tmp_var
;
986 build_function_call_expr (implicit_built_in_decls
[BUILT_IN_STACK_SAVE
],
988 tmp_var
= create_tmp_var (ptr_type_node
, "saved_stack");
990 *save
= build2 (MODIFY_EXPR
, ptr_type_node
, tmp_var
, save_call
);
992 build_function_call_expr (implicit_built_in_decls
[BUILT_IN_STACK_RESTORE
],
993 tree_cons (NULL_TREE
, tmp_var
, NULL_TREE
));
996 /* Gimplify a BIND_EXPR. Just voidify and recurse. */
998 static enum gimplify_status
999 gimplify_bind_expr (tree
*expr_p
, tree temp
, tree
*pre_p
)
1001 tree bind_expr
= *expr_p
;
1002 bool old_save_stack
= gimplify_ctxp
->save_stack
;
1005 temp
= voidify_wrapper_expr (bind_expr
, temp
);
1007 /* Mark variables seen in this bind expr. */
1008 for (t
= BIND_EXPR_VARS (bind_expr
); t
; t
= TREE_CHAIN (t
))
1010 if (TREE_CODE (t
) == VAR_DECL
)
1011 DECL_SEEN_IN_BIND_EXPR_P (t
) = 1;
1013 /* Preliminarily mark non-addressed complex variables as eligible
1014 for promotion to gimple registers. We'll transform their uses
1016 if (TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
1017 && !TREE_THIS_VOLATILE (t
)
1018 && (TREE_CODE (t
) == VAR_DECL
&& !DECL_HARD_REGISTER (t
))
1019 && !needs_to_live_in_memory (t
))
1020 DECL_COMPLEX_GIMPLE_REG_P (t
) = 1;
1023 /* Mark variables seen in this bind expr as locals. */
1024 if (gimplify_omp_ctxp
)
1026 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
1028 for (t
= BIND_EXPR_VARS (bind_expr
); t
; t
= TREE_CHAIN (t
))
1029 if (TREE_CODE (t
) == VAR_DECL
&& !is_global_var (t
))
1030 omp_add_variable (ctx
, t
, GOVD_LOCAL
| GOVD_SEEN
);
1033 gimple_push_bind_expr (bind_expr
);
1034 gimplify_ctxp
->save_stack
= false;
1036 gimplify_to_stmt_list (&BIND_EXPR_BODY (bind_expr
));
1038 if (gimplify_ctxp
->save_stack
)
1040 tree stack_save
, stack_restore
;
1042 /* Save stack on entry and restore it on exit. Add a try_finally
1043 block to achieve this. Note that mudflap depends on the
1044 format of the emitted code: see mx_register_decls(). */
1045 build_stack_save_restore (&stack_save
, &stack_restore
);
1047 t
= build2 (TRY_FINALLY_EXPR
, void_type_node
,
1048 BIND_EXPR_BODY (bind_expr
), NULL_TREE
);
1049 append_to_statement_list (stack_restore
, &TREE_OPERAND (t
, 1));
1051 BIND_EXPR_BODY (bind_expr
) = NULL_TREE
;
1052 append_to_statement_list (stack_save
, &BIND_EXPR_BODY (bind_expr
));
1053 append_to_statement_list (t
, &BIND_EXPR_BODY (bind_expr
));
1056 gimplify_ctxp
->save_stack
= old_save_stack
;
1057 gimple_pop_bind_expr ();
1062 append_to_statement_list (bind_expr
, pre_p
);
1069 /* Gimplify a RETURN_EXPR. If the expression to be returned is not a
1070 GIMPLE value, it is assigned to a new temporary and the statement is
1071 re-written to return the temporary.
1073 PRE_P points to the list where side effects that must happen before
1074 STMT should be stored. */
1076 static enum gimplify_status
1077 gimplify_return_expr (tree stmt
, tree
*pre_p
)
1079 tree ret_expr
= TREE_OPERAND (stmt
, 0);
1080 tree result_decl
, result
;
1082 if (!ret_expr
|| TREE_CODE (ret_expr
) == RESULT_DECL
1083 || ret_expr
== error_mark_node
)
1086 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
1087 result_decl
= NULL_TREE
;
1090 result_decl
= TREE_OPERAND (ret_expr
, 0);
1091 if (TREE_CODE (result_decl
) == INDIRECT_REF
)
1092 /* See through a return by reference. */
1093 result_decl
= TREE_OPERAND (result_decl
, 0);
1095 gcc_assert ((TREE_CODE (ret_expr
) == MODIFY_EXPR
1096 || TREE_CODE (ret_expr
) == INIT_EXPR
)
1097 && TREE_CODE (result_decl
) == RESULT_DECL
);
1100 /* If aggregate_value_p is true, then we can return the bare RESULT_DECL.
1101 Recall that aggregate_value_p is FALSE for any aggregate type that is
1102 returned in registers. If we're returning values in registers, then
1103 we don't want to extend the lifetime of the RESULT_DECL, particularly
1104 across another call. In addition, for those aggregates for which
1105 hard_function_value generates a PARALLEL, we'll die during normal
1106 expansion of structure assignments; there's special code in expand_return
1107 to handle this case that does not exist in expand_expr. */
1109 || aggregate_value_p (result_decl
, TREE_TYPE (current_function_decl
)))
1110 result
= result_decl
;
1111 else if (gimplify_ctxp
->return_temp
)
1112 result
= gimplify_ctxp
->return_temp
;
1115 result
= create_tmp_var (TREE_TYPE (result_decl
), NULL
);
1117 /* ??? With complex control flow (usually involving abnormal edges),
1118 we can wind up warning about an uninitialized value for this. Due
1119 to how this variable is constructed and initialized, this is never
1120 true. Give up and never warn. */
1121 TREE_NO_WARNING (result
) = 1;
1123 gimplify_ctxp
->return_temp
= result
;
1126 /* Smash the lhs of the MODIFY_EXPR to the temporary we plan to use.
1127 Then gimplify the whole thing. */
1128 if (result
!= result_decl
)
1129 TREE_OPERAND (ret_expr
, 0) = result
;
1131 gimplify_and_add (TREE_OPERAND (stmt
, 0), pre_p
);
1133 /* If we didn't use a temporary, then the result is just the result_decl.
1134 Otherwise we need a simple copy. This should already be gimple. */
1135 if (result
== result_decl
)
1138 ret_expr
= build2 (MODIFY_EXPR
, TREE_TYPE (result
), result_decl
, result
);
1139 TREE_OPERAND (stmt
, 0) = ret_expr
;
1144 /* Gimplifies a DECL_EXPR node *STMT_P by making any necessary allocation
1145 and initialization explicit. */
1147 static enum gimplify_status
1148 gimplify_decl_expr (tree
*stmt_p
)
1150 tree stmt
= *stmt_p
;
1151 tree decl
= DECL_EXPR_DECL (stmt
);
1153 *stmt_p
= NULL_TREE
;
1155 if (TREE_TYPE (decl
) == error_mark_node
)
1158 if ((TREE_CODE (decl
) == TYPE_DECL
1159 || TREE_CODE (decl
) == VAR_DECL
)
1160 && !TYPE_SIZES_GIMPLIFIED (TREE_TYPE (decl
)))
1161 gimplify_type_sizes (TREE_TYPE (decl
), stmt_p
);
1163 if (TREE_CODE (decl
) == VAR_DECL
&& !DECL_EXTERNAL (decl
))
1165 tree init
= DECL_INITIAL (decl
);
1167 if (!TREE_CONSTANT (DECL_SIZE (decl
)))
1169 /* This is a variable-sized decl. Simplify its size and mark it
1170 for deferred expansion. Note that mudflap depends on the format
1171 of the emitted code: see mx_register_decls(). */
1172 tree t
, args
, addr
, ptr_type
;
1174 gimplify_one_sizepos (&DECL_SIZE (decl
), stmt_p
);
1175 gimplify_one_sizepos (&DECL_SIZE_UNIT (decl
), stmt_p
);
1177 /* All occurrences of this decl in final gimplified code will be
1178 replaced by indirection. Setting DECL_VALUE_EXPR does two
1179 things: First, it lets the rest of the gimplifier know what
1180 replacement to use. Second, it lets the debug info know
1181 where to find the value. */
1182 ptr_type
= build_pointer_type (TREE_TYPE (decl
));
1183 addr
= create_tmp_var (ptr_type
, get_name (decl
));
1184 DECL_IGNORED_P (addr
) = 0;
1185 t
= build_fold_indirect_ref (addr
);
1186 SET_DECL_VALUE_EXPR (decl
, t
);
1187 DECL_HAS_VALUE_EXPR_P (decl
) = 1;
1189 args
= tree_cons (NULL
, DECL_SIZE_UNIT (decl
), NULL
);
1190 t
= built_in_decls
[BUILT_IN_ALLOCA
];
1191 t
= build_function_call_expr (t
, args
);
1192 t
= fold_convert (ptr_type
, t
);
1193 t
= build2 (MODIFY_EXPR
, void_type_node
, addr
, t
);
1195 gimplify_and_add (t
, stmt_p
);
1197 /* Indicate that we need to restore the stack level when the
1198 enclosing BIND_EXPR is exited. */
1199 gimplify_ctxp
->save_stack
= true;
1202 if (init
&& init
!= error_mark_node
)
1204 if (!TREE_STATIC (decl
))
1206 DECL_INITIAL (decl
) = NULL_TREE
;
1207 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
1208 gimplify_and_add (init
, stmt_p
);
1211 /* We must still examine initializers for static variables
1212 as they may contain a label address. */
1213 walk_tree (&init
, force_labels_r
, NULL
, NULL
);
1216 /* This decl isn't mentioned in the enclosing block, so add it to the
1217 list of temps. FIXME it seems a bit of a kludge to say that
1218 anonymous artificial vars aren't pushed, but everything else is. */
1219 if (DECL_ARTIFICIAL (decl
) && DECL_NAME (decl
) == NULL_TREE
)
1220 gimple_add_tmp_var (decl
);
1226 /* Gimplify a LOOP_EXPR. Normally this just involves gimplifying the body
1227 and replacing the LOOP_EXPR with goto, but if the loop contains an
1228 EXIT_EXPR, we need to append a label for it to jump to. */
1230 static enum gimplify_status
1231 gimplify_loop_expr (tree
*expr_p
, tree
*pre_p
)
1233 tree saved_label
= gimplify_ctxp
->exit_label
;
1234 tree start_label
= build1 (LABEL_EXPR
, void_type_node
, NULL_TREE
);
1235 tree jump_stmt
= build_and_jump (&LABEL_EXPR_LABEL (start_label
));
1237 append_to_statement_list (start_label
, pre_p
);
1239 gimplify_ctxp
->exit_label
= NULL_TREE
;
1241 gimplify_and_add (LOOP_EXPR_BODY (*expr_p
), pre_p
);
1243 if (gimplify_ctxp
->exit_label
)
1245 append_to_statement_list (jump_stmt
, pre_p
);
1246 *expr_p
= build1 (LABEL_EXPR
, void_type_node
, gimplify_ctxp
->exit_label
);
1249 *expr_p
= jump_stmt
;
1251 gimplify_ctxp
->exit_label
= saved_label
;
1256 /* Compare two case labels. Because the front end should already have
1257 made sure that case ranges do not overlap, it is enough to only compare
1258 the CASE_LOW values of each case label. */
1261 compare_case_labels (const void *p1
, const void *p2
)
1263 tree case1
= *(tree
*)p1
;
1264 tree case2
= *(tree
*)p2
;
1266 return tree_int_cst_compare (CASE_LOW (case1
), CASE_LOW (case2
));
1269 /* Sort the case labels in LABEL_VEC in place in ascending order. */
1272 sort_case_labels (tree label_vec
)
1274 size_t len
= TREE_VEC_LENGTH (label_vec
);
1275 tree default_case
= TREE_VEC_ELT (label_vec
, len
- 1);
1277 if (CASE_LOW (default_case
))
1281 /* The last label in the vector should be the default case
1283 for (i
= 0; i
< len
; ++i
)
1285 tree t
= TREE_VEC_ELT (label_vec
, i
);
1289 TREE_VEC_ELT (label_vec
, i
) = TREE_VEC_ELT (label_vec
, len
- 1);
1290 TREE_VEC_ELT (label_vec
, len
- 1) = default_case
;
1296 qsort (&TREE_VEC_ELT (label_vec
, 0), len
- 1, sizeof (tree
),
1297 compare_case_labels
);
1300 /* Gimplify a SWITCH_EXPR, and collect a TREE_VEC of the labels it can
1303 static enum gimplify_status
1304 gimplify_switch_expr (tree
*expr_p
, tree
*pre_p
)
1306 tree switch_expr
= *expr_p
;
1307 enum gimplify_status ret
;
1309 ret
= gimplify_expr (&SWITCH_COND (switch_expr
), pre_p
, NULL
,
1310 is_gimple_val
, fb_rvalue
);
1312 if (SWITCH_BODY (switch_expr
))
1314 VEC(tree
,heap
) *labels
, *saved_labels
;
1315 tree label_vec
, default_case
= NULL_TREE
;
1318 /* If someone can be bothered to fill in the labels, they can
1319 be bothered to null out the body too. */
1320 gcc_assert (!SWITCH_LABELS (switch_expr
));
1322 saved_labels
= gimplify_ctxp
->case_labels
;
1323 gimplify_ctxp
->case_labels
= VEC_alloc (tree
, heap
, 8);
1325 gimplify_to_stmt_list (&SWITCH_BODY (switch_expr
));
1327 labels
= gimplify_ctxp
->case_labels
;
1328 gimplify_ctxp
->case_labels
= saved_labels
;
1330 len
= VEC_length (tree
, labels
);
1332 for (i
= 0; i
< len
; ++i
)
1334 tree t
= VEC_index (tree
, labels
, i
);
1337 /* The default case must be the last label in the list. */
1339 VEC_replace (tree
, labels
, i
, VEC_index (tree
, labels
, len
- 1));
1345 label_vec
= make_tree_vec (len
+ 1);
1346 SWITCH_LABELS (*expr_p
) = label_vec
;
1347 append_to_statement_list (switch_expr
, pre_p
);
1351 /* If the switch has no default label, add one, so that we jump
1352 around the switch body. */
1353 default_case
= build3 (CASE_LABEL_EXPR
, void_type_node
, NULL_TREE
,
1354 NULL_TREE
, create_artificial_label ());
1355 append_to_statement_list (SWITCH_BODY (switch_expr
), pre_p
);
1356 *expr_p
= build1 (LABEL_EXPR
, void_type_node
,
1357 CASE_LABEL (default_case
));
1360 *expr_p
= SWITCH_BODY (switch_expr
);
1362 for (i
= 0; i
< len
; ++i
)
1363 TREE_VEC_ELT (label_vec
, i
) = VEC_index (tree
, labels
, i
);
1364 TREE_VEC_ELT (label_vec
, len
) = default_case
;
1366 VEC_free (tree
, heap
, labels
);
1368 sort_case_labels (label_vec
);
1370 SWITCH_BODY (switch_expr
) = NULL
;
1373 gcc_assert (SWITCH_LABELS (switch_expr
));
1378 static enum gimplify_status
1379 gimplify_case_label_expr (tree
*expr_p
)
1381 tree expr
= *expr_p
;
1382 struct gimplify_ctx
*ctxp
;
1384 /* Invalid OpenMP programs can play Duff's Device type games with
1385 #pragma omp parallel. At least in the C front end, we don't
1386 detect such invalid branches until after gimplification. */
1387 for (ctxp
= gimplify_ctxp
; ; ctxp
= ctxp
->prev_context
)
1388 if (ctxp
->case_labels
)
1391 VEC_safe_push (tree
, heap
, ctxp
->case_labels
, expr
);
1392 *expr_p
= build1 (LABEL_EXPR
, void_type_node
, CASE_LABEL (expr
));
1396 /* Build a GOTO to the LABEL_DECL pointed to by LABEL_P, building it first
1400 build_and_jump (tree
*label_p
)
1402 if (label_p
== NULL
)
1403 /* If there's nowhere to jump, just fall through. */
1406 if (*label_p
== NULL_TREE
)
1408 tree label
= create_artificial_label ();
1412 return build1 (GOTO_EXPR
, void_type_node
, *label_p
);
1415 /* Gimplify an EXIT_EXPR by converting to a GOTO_EXPR inside a COND_EXPR.
1416 This also involves building a label to jump to and communicating it to
1417 gimplify_loop_expr through gimplify_ctxp->exit_label. */
1419 static enum gimplify_status
1420 gimplify_exit_expr (tree
*expr_p
)
1422 tree cond
= TREE_OPERAND (*expr_p
, 0);
1425 expr
= build_and_jump (&gimplify_ctxp
->exit_label
);
1426 expr
= build3 (COND_EXPR
, void_type_node
, cond
, expr
, NULL_TREE
);
1432 /* A helper function to be called via walk_tree. Mark all labels under *TP
1433 as being forced. To be called for DECL_INITIAL of static variables. */
1436 force_labels_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
1440 if (TREE_CODE (*tp
) == LABEL_DECL
)
1441 FORCED_LABEL (*tp
) = 1;
1446 /* *EXPR_P is a COMPONENT_REF being used as an rvalue. If its type is
1447 different from its canonical type, wrap the whole thing inside a
1448 NOP_EXPR and force the type of the COMPONENT_REF to be the canonical
1451 The canonical type of a COMPONENT_REF is the type of the field being
1452 referenced--unless the field is a bit-field which can be read directly
1453 in a smaller mode, in which case the canonical type is the
1454 sign-appropriate type corresponding to that mode. */
1457 canonicalize_component_ref (tree
*expr_p
)
1459 tree expr
= *expr_p
;
1462 gcc_assert (TREE_CODE (expr
) == COMPONENT_REF
);
1464 if (INTEGRAL_TYPE_P (TREE_TYPE (expr
)))
1465 type
= TREE_TYPE (get_unwidened (expr
, NULL_TREE
));
1467 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
1469 if (TREE_TYPE (expr
) != type
)
1471 tree old_type
= TREE_TYPE (expr
);
1473 /* Set the type of the COMPONENT_REF to the underlying type. */
1474 TREE_TYPE (expr
) = type
;
1476 /* And wrap the whole thing inside a NOP_EXPR. */
1477 expr
= build1 (NOP_EXPR
, old_type
, expr
);
1483 /* If a NOP conversion is changing a pointer to array of foo to a pointer
1484 to foo, embed that change in the ADDR_EXPR by converting
1489 where L is the lower bound. For simplicity, only do this for constant
1493 canonicalize_addr_expr (tree
*expr_p
)
1495 tree expr
= *expr_p
;
1496 tree ctype
= TREE_TYPE (expr
);
1497 tree addr_expr
= TREE_OPERAND (expr
, 0);
1498 tree atype
= TREE_TYPE (addr_expr
);
1499 tree dctype
, datype
, ddatype
, otype
, obj_expr
;
1501 /* Both cast and addr_expr types should be pointers. */
1502 if (!POINTER_TYPE_P (ctype
) || !POINTER_TYPE_P (atype
))
1505 /* The addr_expr type should be a pointer to an array. */
1506 datype
= TREE_TYPE (atype
);
1507 if (TREE_CODE (datype
) != ARRAY_TYPE
)
1510 /* Both cast and addr_expr types should address the same object type. */
1511 dctype
= TREE_TYPE (ctype
);
1512 ddatype
= TREE_TYPE (datype
);
1513 if (!lang_hooks
.types_compatible_p (ddatype
, dctype
))
1516 /* The addr_expr and the object type should match. */
1517 obj_expr
= TREE_OPERAND (addr_expr
, 0);
1518 otype
= TREE_TYPE (obj_expr
);
1519 if (!lang_hooks
.types_compatible_p (otype
, datype
))
1522 /* The lower bound and element sizes must be constant. */
1523 if (!TYPE_SIZE_UNIT (dctype
)
1524 || TREE_CODE (TYPE_SIZE_UNIT (dctype
)) != INTEGER_CST
1525 || !TYPE_DOMAIN (datype
) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))
1526 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype
))) != INTEGER_CST
)
1529 /* All checks succeeded. Build a new node to merge the cast. */
1530 *expr_p
= build4 (ARRAY_REF
, dctype
, obj_expr
,
1531 TYPE_MIN_VALUE (TYPE_DOMAIN (datype
)),
1532 TYPE_MIN_VALUE (TYPE_DOMAIN (datype
)),
1533 size_binop (EXACT_DIV_EXPR
, TYPE_SIZE_UNIT (dctype
),
1534 size_int (TYPE_ALIGN_UNIT (dctype
))));
1535 *expr_p
= build1 (ADDR_EXPR
, ctype
, *expr_p
);
1538 /* *EXPR_P is a NOP_EXPR or CONVERT_EXPR. Remove it and/or other conversions
1539 underneath as appropriate. */
1541 static enum gimplify_status
1542 gimplify_conversion (tree
*expr_p
)
1544 gcc_assert (TREE_CODE (*expr_p
) == NOP_EXPR
1545 || TREE_CODE (*expr_p
) == CONVERT_EXPR
);
1547 /* Then strip away all but the outermost conversion. */
1548 STRIP_SIGN_NOPS (TREE_OPERAND (*expr_p
, 0));
1550 /* And remove the outermost conversion if it's useless. */
1551 if (tree_ssa_useless_type_conversion (*expr_p
))
1552 *expr_p
= TREE_OPERAND (*expr_p
, 0);
1554 /* If we still have a conversion at the toplevel,
1555 then canonicalize some constructs. */
1556 if (TREE_CODE (*expr_p
) == NOP_EXPR
|| TREE_CODE (*expr_p
) == CONVERT_EXPR
)
1558 tree sub
= TREE_OPERAND (*expr_p
, 0);
1560 /* If a NOP conversion is changing the type of a COMPONENT_REF
1561 expression, then canonicalize its type now in order to expose more
1562 redundant conversions. */
1563 if (TREE_CODE (sub
) == COMPONENT_REF
)
1564 canonicalize_component_ref (&TREE_OPERAND (*expr_p
, 0));
1566 /* If a NOP conversion is changing a pointer to array of foo
1567 to a pointer to foo, embed that change in the ADDR_EXPR. */
1568 else if (TREE_CODE (sub
) == ADDR_EXPR
)
1569 canonicalize_addr_expr (expr_p
);
1575 /* Gimplify a VAR_DECL or PARM_DECL. Returns GS_OK if we expanded a
1576 DECL_VALUE_EXPR, and it's worth re-examining things. */
1578 static enum gimplify_status
1579 gimplify_var_or_parm_decl (tree
*expr_p
)
1581 tree decl
= *expr_p
;
1583 /* ??? If this is a local variable, and it has not been seen in any
1584 outer BIND_EXPR, then it's probably the result of a duplicate
1585 declaration, for which we've already issued an error. It would
1586 be really nice if the front end wouldn't leak these at all.
1587 Currently the only known culprit is C++ destructors, as seen
1588 in g++.old-deja/g++.jason/binding.C. */
1589 if (TREE_CODE (decl
) == VAR_DECL
1590 && !DECL_SEEN_IN_BIND_EXPR_P (decl
)
1591 && !TREE_STATIC (decl
) && !DECL_EXTERNAL (decl
)
1592 && decl_function_context (decl
) == current_function_decl
)
1594 gcc_assert (errorcount
|| sorrycount
);
1598 /* When within an OpenMP context, notice uses of variables. */
1599 if (gimplify_omp_ctxp
&& omp_notice_variable (gimplify_omp_ctxp
, decl
, true))
1602 /* If the decl is an alias for another expression, substitute it now. */
1603 if (DECL_HAS_VALUE_EXPR_P (decl
))
1605 *expr_p
= unshare_expr (DECL_VALUE_EXPR (decl
));
1613 /* Gimplify the COMPONENT_REF, ARRAY_REF, REALPART_EXPR or IMAGPART_EXPR
1614 node pointed to by EXPR_P.
1617 : min_lval '[' val ']'
1619 | compound_lval '[' val ']'
1620 | compound_lval '.' ID
1622 This is not part of the original SIMPLE definition, which separates
1623 array and member references, but it seems reasonable to handle them
1624 together. Also, this way we don't run into problems with union
1625 aliasing; gcc requires that for accesses through a union to alias, the
1626 union reference must be explicit, which was not always the case when we
1627 were splitting up array and member refs.
1629 PRE_P points to the list where side effects that must happen before
1630 *EXPR_P should be stored.
1632 POST_P points to the list where side effects that must happen after
1633 *EXPR_P should be stored. */
1635 static enum gimplify_status
1636 gimplify_compound_lval (tree
*expr_p
, tree
*pre_p
,
1637 tree
*post_p
, fallback_t fallback
)
1640 VEC(tree
,heap
) *stack
;
1641 enum gimplify_status ret
= GS_OK
, tret
;
1644 /* Create a stack of the subexpressions so later we can walk them in
1645 order from inner to outer. */
1646 stack
= VEC_alloc (tree
, heap
, 10);
1648 /* We can handle anything that get_inner_reference can deal with. */
1649 for (p
= expr_p
; ; p
= &TREE_OPERAND (*p
, 0))
1652 /* Fold INDIRECT_REFs now to turn them into ARRAY_REFs. */
1653 if (TREE_CODE (*p
) == INDIRECT_REF
)
1654 *p
= fold_indirect_ref (*p
);
1656 if (handled_component_p (*p
))
1658 /* Expand DECL_VALUE_EXPR now. In some cases that may expose
1659 additional COMPONENT_REFs. */
1660 else if ((TREE_CODE (*p
) == VAR_DECL
|| TREE_CODE (*p
) == PARM_DECL
)
1661 && gimplify_var_or_parm_decl (p
) == GS_OK
)
1666 VEC_safe_push (tree
, heap
, stack
, *p
);
1669 gcc_assert (VEC_length (tree
, stack
));
1671 /* Now STACK is a stack of pointers to all the refs we've walked through
1672 and P points to the innermost expression.
1674 Java requires that we elaborated nodes in source order. That
1675 means we must gimplify the inner expression followed by each of
1676 the indices, in order. But we can't gimplify the inner
1677 expression until we deal with any variable bounds, sizes, or
1678 positions in order to deal with PLACEHOLDER_EXPRs.
1680 So we do this in three steps. First we deal with the annotations
1681 for any variables in the components, then we gimplify the base,
1682 then we gimplify any indices, from left to right. */
1683 for (i
= VEC_length (tree
, stack
) - 1; i
>= 0; i
--)
1685 tree t
= VEC_index (tree
, stack
, i
);
1687 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
1689 /* Gimplify the low bound and element type size and put them into
1690 the ARRAY_REF. If these values are set, they have already been
1692 if (!TREE_OPERAND (t
, 2))
1694 tree low
= unshare_expr (array_ref_low_bound (t
));
1695 if (!is_gimple_min_invariant (low
))
1697 TREE_OPERAND (t
, 2) = low
;
1698 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
1699 is_gimple_formal_tmp_reg
, fb_rvalue
);
1700 ret
= MIN (ret
, tret
);
1704 if (!TREE_OPERAND (t
, 3))
1706 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (t
, 0)));
1707 tree elmt_size
= unshare_expr (array_ref_element_size (t
));
1708 tree factor
= size_int (TYPE_ALIGN_UNIT (elmt_type
));
1710 /* Divide the element size by the alignment of the element
1712 elmt_size
= size_binop (EXACT_DIV_EXPR
, elmt_size
, factor
);
1714 if (!is_gimple_min_invariant (elmt_size
))
1716 TREE_OPERAND (t
, 3) = elmt_size
;
1717 tret
= gimplify_expr (&TREE_OPERAND (t
, 3), pre_p
, post_p
,
1718 is_gimple_formal_tmp_reg
, fb_rvalue
);
1719 ret
= MIN (ret
, tret
);
1723 else if (TREE_CODE (t
) == COMPONENT_REF
)
1725 /* Set the field offset into T and gimplify it. */
1726 if (!TREE_OPERAND (t
, 2))
1728 tree offset
= unshare_expr (component_ref_field_offset (t
));
1729 tree field
= TREE_OPERAND (t
, 1);
1731 = size_int (DECL_OFFSET_ALIGN (field
) / BITS_PER_UNIT
);
1733 /* Divide the offset by its alignment. */
1734 offset
= size_binop (EXACT_DIV_EXPR
, offset
, factor
);
1736 if (!is_gimple_min_invariant (offset
))
1738 TREE_OPERAND (t
, 2) = offset
;
1739 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
1740 is_gimple_formal_tmp_reg
, fb_rvalue
);
1741 ret
= MIN (ret
, tret
);
1747 /* Step 2 is to gimplify the base expression. Make sure lvalue is set
1748 so as to match the min_lval predicate. Failure to do so may result
1749 in the creation of large aggregate temporaries. */
1750 tret
= gimplify_expr (p
, pre_p
, post_p
, is_gimple_min_lval
,
1751 fallback
| fb_lvalue
);
1752 ret
= MIN (ret
, tret
);
1754 /* And finally, the indices and operands to BIT_FIELD_REF. During this
1755 loop we also remove any useless conversions. */
1756 for (; VEC_length (tree
, stack
) > 0; )
1758 tree t
= VEC_pop (tree
, stack
);
1760 if (TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
1762 /* Gimplify the dimension.
1763 Temporary fix for gcc.c-torture/execute/20040313-1.c.
1764 Gimplify non-constant array indices into a temporary
1766 FIXME - The real fix is to gimplify post-modify
1767 expressions into a minimal gimple lvalue. However, that
1768 exposes bugs in alias analysis. The alias analyzer does
1769 not handle &PTR->FIELD very well. Will fix after the
1770 branch is merged into mainline (dnovillo 2004-05-03). */
1771 if (!is_gimple_min_invariant (TREE_OPERAND (t
, 1)))
1773 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), pre_p
, post_p
,
1774 is_gimple_formal_tmp_reg
, fb_rvalue
);
1775 ret
= MIN (ret
, tret
);
1778 else if (TREE_CODE (t
) == BIT_FIELD_REF
)
1780 tret
= gimplify_expr (&TREE_OPERAND (t
, 1), pre_p
, post_p
,
1781 is_gimple_val
, fb_rvalue
);
1782 ret
= MIN (ret
, tret
);
1783 tret
= gimplify_expr (&TREE_OPERAND (t
, 2), pre_p
, post_p
,
1784 is_gimple_val
, fb_rvalue
);
1785 ret
= MIN (ret
, tret
);
1788 STRIP_USELESS_TYPE_CONVERSION (TREE_OPERAND (t
, 0));
1790 /* The innermost expression P may have originally had TREE_SIDE_EFFECTS
1791 set which would have caused all the outer expressions in EXPR_P
1792 leading to P to also have had TREE_SIDE_EFFECTS set. */
1793 recalculate_side_effects (t
);
1796 tret
= gimplify_expr (p
, pre_p
, post_p
, is_gimple_min_lval
, fallback
);
1797 ret
= MIN (ret
, tret
);
1799 /* If the outermost expression is a COMPONENT_REF, canonicalize its type. */
1800 if ((fallback
& fb_rvalue
) && TREE_CODE (*expr_p
) == COMPONENT_REF
)
1802 canonicalize_component_ref (expr_p
);
1803 ret
= MIN (ret
, GS_OK
);
1806 VEC_free (tree
, heap
, stack
);
1811 /* Gimplify the self modifying expression pointed to by EXPR_P
1814 PRE_P points to the list where side effects that must happen before
1815 *EXPR_P should be stored.
1817 POST_P points to the list where side effects that must happen after
1818 *EXPR_P should be stored.
1820 WANT_VALUE is nonzero iff we want to use the value of this expression
1821 in another expression. */
1823 static enum gimplify_status
1824 gimplify_self_mod_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
,
1827 enum tree_code code
;
1828 tree lhs
, lvalue
, rhs
, t1
;
1830 enum tree_code arith_code
;
1831 enum gimplify_status ret
;
1833 code
= TREE_CODE (*expr_p
);
1835 gcc_assert (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
1836 || code
== PREINCREMENT_EXPR
|| code
== PREDECREMENT_EXPR
);
1838 /* Prefix or postfix? */
1839 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
1840 /* Faster to treat as prefix if result is not used. */
1841 postfix
= want_value
;
1845 /* Add or subtract? */
1846 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
1847 arith_code
= PLUS_EXPR
;
1849 arith_code
= MINUS_EXPR
;
1851 /* Gimplify the LHS into a GIMPLE lvalue. */
1852 lvalue
= TREE_OPERAND (*expr_p
, 0);
1853 ret
= gimplify_expr (&lvalue
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
1854 if (ret
== GS_ERROR
)
1857 /* Extract the operands to the arithmetic operation. */
1859 rhs
= TREE_OPERAND (*expr_p
, 1);
1861 /* For postfix operator, we evaluate the LHS to an rvalue and then use
1862 that as the result value and in the postqueue operation. */
1865 ret
= gimplify_expr (&lhs
, pre_p
, post_p
, is_gimple_val
, fb_rvalue
);
1866 if (ret
== GS_ERROR
)
1870 t1
= build2 (arith_code
, TREE_TYPE (*expr_p
), lhs
, rhs
);
1871 t1
= build2 (MODIFY_EXPR
, TREE_TYPE (lvalue
), lvalue
, t1
);
1875 gimplify_and_add (t1
, post_p
);
1886 /* If *EXPR_P has a variable sized type, wrap it in a WITH_SIZE_EXPR. */
1889 maybe_with_size_expr (tree
*expr_p
)
1891 tree expr
= *expr_p
;
1892 tree type
= TREE_TYPE (expr
);
1895 /* If we've already wrapped this or the type is error_mark_node, we can't do
1897 if (TREE_CODE (expr
) == WITH_SIZE_EXPR
1898 || type
== error_mark_node
)
1901 /* If the size isn't known or is a constant, we have nothing to do. */
1902 size
= TYPE_SIZE_UNIT (type
);
1903 if (!size
|| TREE_CODE (size
) == INTEGER_CST
)
1906 /* Otherwise, make a WITH_SIZE_EXPR. */
1907 size
= unshare_expr (size
);
1908 size
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (size
, expr
);
1909 *expr_p
= build2 (WITH_SIZE_EXPR
, type
, expr
, size
);
1912 /* Subroutine of gimplify_call_expr: Gimplify a single argument. */
1914 static enum gimplify_status
1915 gimplify_arg (tree
*expr_p
, tree
*pre_p
)
1917 bool (*test
) (tree
);
1920 /* In general, we allow lvalues for function arguments to avoid
1921 extra overhead of copying large aggregates out of even larger
1922 aggregates into temporaries only to copy the temporaries to
1923 the argument list. Make optimizers happy by pulling out to
1924 temporaries those types that fit in registers. */
1925 if (is_gimple_reg_type (TREE_TYPE (*expr_p
)))
1926 test
= is_gimple_val
, fb
= fb_rvalue
;
1928 test
= is_gimple_lvalue
, fb
= fb_either
;
1930 /* If this is a variable sized type, we must remember the size. */
1931 maybe_with_size_expr (expr_p
);
1933 /* There is a sequence point before a function call. Side effects in
1934 the argument list must occur before the actual call. So, when
1935 gimplifying arguments, force gimplify_expr to use an internal
1936 post queue which is then appended to the end of PRE_P. */
1937 return gimplify_expr (expr_p
, pre_p
, NULL
, test
, fb
);
1940 /* Gimplify the CALL_EXPR node pointed to by EXPR_P. PRE_P points to the
1941 list where side effects that must happen before *EXPR_P should be stored.
1942 WANT_VALUE is true if the result of the call is desired. */
1944 static enum gimplify_status
1945 gimplify_call_expr (tree
*expr_p
, tree
*pre_p
, bool want_value
)
1949 enum gimplify_status ret
;
1951 gcc_assert (TREE_CODE (*expr_p
) == CALL_EXPR
);
1953 /* For reliable diagnostics during inlining, it is necessary that
1954 every call_expr be annotated with file and line. */
1955 if (! EXPR_HAS_LOCATION (*expr_p
))
1956 SET_EXPR_LOCATION (*expr_p
, input_location
);
1958 /* This may be a call to a builtin function.
1960 Builtin function calls may be transformed into different
1961 (and more efficient) builtin function calls under certain
1962 circumstances. Unfortunately, gimplification can muck things
1963 up enough that the builtin expanders are not aware that certain
1964 transformations are still valid.
1966 So we attempt transformation/gimplification of the call before
1967 we gimplify the CALL_EXPR. At this time we do not manage to
1968 transform all calls in the same manner as the expanders do, but
1969 we do transform most of them. */
1970 decl
= get_callee_fndecl (*expr_p
);
1971 if (decl
&& DECL_BUILT_IN (decl
))
1973 tree fndecl
= get_callee_fndecl (*expr_p
);
1974 tree arglist
= TREE_OPERAND (*expr_p
, 1);
1975 tree
new = fold_builtin (fndecl
, arglist
, !want_value
);
1977 if (new && new != *expr_p
)
1979 /* There was a transformation of this call which computes the
1980 same value, but in a more efficient way. Return and try
1986 if (DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
1987 && DECL_FUNCTION_CODE (decl
) == BUILT_IN_VA_START
)
1989 if (!arglist
|| !TREE_CHAIN (arglist
))
1991 error ("too few arguments to function %<va_start%>");
1992 *expr_p
= build_empty_stmt ();
1996 if (fold_builtin_next_arg (TREE_CHAIN (arglist
)))
1998 *expr_p
= build_empty_stmt ();
2001 /* Avoid gimplifying the second argument to va_start, which needs
2002 to be the plain PARM_DECL. */
2003 return gimplify_arg (&TREE_VALUE (TREE_OPERAND (*expr_p
, 1)), pre_p
);
2007 /* There is a sequence point before the call, so any side effects in
2008 the calling expression must occur before the actual call. Force
2009 gimplify_expr to use an internal post queue. */
2010 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, NULL
,
2011 is_gimple_call_addr
, fb_rvalue
);
2013 if (PUSH_ARGS_REVERSED
)
2014 TREE_OPERAND (*expr_p
, 1) = nreverse (TREE_OPERAND (*expr_p
, 1));
2015 for (arglist
= TREE_OPERAND (*expr_p
, 1); arglist
;
2016 arglist
= TREE_CHAIN (arglist
))
2018 enum gimplify_status t
;
2020 t
= gimplify_arg (&TREE_VALUE (arglist
), pre_p
);
2025 if (PUSH_ARGS_REVERSED
)
2026 TREE_OPERAND (*expr_p
, 1) = nreverse (TREE_OPERAND (*expr_p
, 1));
2028 /* Try this again in case gimplification exposed something. */
2029 if (ret
!= GS_ERROR
&& decl
&& DECL_BUILT_IN (decl
))
2031 tree fndecl
= get_callee_fndecl (*expr_p
);
2032 tree arglist
= TREE_OPERAND (*expr_p
, 1);
2033 tree
new = fold_builtin (fndecl
, arglist
, !want_value
);
2035 if (new && new != *expr_p
)
2037 /* There was a transformation of this call which computes the
2038 same value, but in a more efficient way. Return and try
2045 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
2046 decl. This allows us to eliminate redundant or useless
2047 calls to "const" functions. */
2048 if (TREE_CODE (*expr_p
) == CALL_EXPR
2049 && (call_expr_flags (*expr_p
) & (ECF_CONST
| ECF_PURE
)))
2050 TREE_SIDE_EFFECTS (*expr_p
) = 0;
2055 /* Handle shortcut semantics in the predicate operand of a COND_EXPR by
2056 rewriting it into multiple COND_EXPRs, and possibly GOTO_EXPRs.
2058 TRUE_LABEL_P and FALSE_LABEL_P point to the labels to jump to if the
2059 condition is true or false, respectively. If null, we should generate
2060 our own to skip over the evaluation of this specific expression.
2062 This function is the tree equivalent of do_jump.
2064 shortcut_cond_r should only be called by shortcut_cond_expr. */
2067 shortcut_cond_r (tree pred
, tree
*true_label_p
, tree
*false_label_p
)
2069 tree local_label
= NULL_TREE
;
2070 tree t
, expr
= NULL
;
2072 /* OK, it's not a simple case; we need to pull apart the COND_EXPR to
2073 retain the shortcut semantics. Just insert the gotos here;
2074 shortcut_cond_expr will append the real blocks later. */
2075 if (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2077 /* Turn if (a && b) into
2079 if (a); else goto no;
2080 if (b) goto yes; else goto no;
2083 if (false_label_p
== NULL
)
2084 false_label_p
= &local_label
;
2086 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), NULL
, false_label_p
);
2087 append_to_statement_list (t
, &expr
);
2089 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2091 append_to_statement_list (t
, &expr
);
2093 else if (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2095 /* Turn if (a || b) into
2098 if (b) goto yes; else goto no;
2101 if (true_label_p
== NULL
)
2102 true_label_p
= &local_label
;
2104 t
= shortcut_cond_r (TREE_OPERAND (pred
, 0), true_label_p
, NULL
);
2105 append_to_statement_list (t
, &expr
);
2107 t
= shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2109 append_to_statement_list (t
, &expr
);
2111 else if (TREE_CODE (pred
) == COND_EXPR
)
2113 /* As long as we're messing with gotos, turn if (a ? b : c) into
2115 if (b) goto yes; else goto no;
2117 if (c) goto yes; else goto no; */
2118 expr
= build3 (COND_EXPR
, void_type_node
, TREE_OPERAND (pred
, 0),
2119 shortcut_cond_r (TREE_OPERAND (pred
, 1), true_label_p
,
2121 shortcut_cond_r (TREE_OPERAND (pred
, 2), true_label_p
,
2126 expr
= build3 (COND_EXPR
, void_type_node
, pred
,
2127 build_and_jump (true_label_p
),
2128 build_and_jump (false_label_p
));
2133 t
= build1 (LABEL_EXPR
, void_type_node
, local_label
);
2134 append_to_statement_list (t
, &expr
);
2141 shortcut_cond_expr (tree expr
)
2143 tree pred
= TREE_OPERAND (expr
, 0);
2144 tree then_
= TREE_OPERAND (expr
, 1);
2145 tree else_
= TREE_OPERAND (expr
, 2);
2146 tree true_label
, false_label
, end_label
, t
;
2148 tree
*false_label_p
;
2149 bool emit_end
, emit_false
, jump_over_else
;
2150 bool then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2151 bool else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2153 /* First do simple transformations. */
2156 /* If there is no 'else', turn (a && b) into if (a) if (b). */
2157 while (TREE_CODE (pred
) == TRUTH_ANDIF_EXPR
)
2159 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2160 then_
= shortcut_cond_expr (expr
);
2161 then_se
= then_
&& TREE_SIDE_EFFECTS (then_
);
2162 pred
= TREE_OPERAND (pred
, 0);
2163 expr
= build3 (COND_EXPR
, void_type_node
, pred
, then_
, NULL_TREE
);
2168 /* If there is no 'then', turn
2171 if (a); else if (b); else d. */
2172 while (TREE_CODE (pred
) == TRUTH_ORIF_EXPR
)
2174 TREE_OPERAND (expr
, 0) = TREE_OPERAND (pred
, 1);
2175 else_
= shortcut_cond_expr (expr
);
2176 else_se
= else_
&& TREE_SIDE_EFFECTS (else_
);
2177 pred
= TREE_OPERAND (pred
, 0);
2178 expr
= build3 (COND_EXPR
, void_type_node
, pred
, NULL_TREE
, else_
);
2182 /* If we're done, great. */
2183 if (TREE_CODE (pred
) != TRUTH_ANDIF_EXPR
2184 && TREE_CODE (pred
) != TRUTH_ORIF_EXPR
)
2187 /* Otherwise we need to mess with gotos. Change
2190 if (a); else goto no;
2193 and recursively gimplify the condition. */
2195 true_label
= false_label
= end_label
= NULL_TREE
;
2197 /* If our arms just jump somewhere, hijack those labels so we don't
2198 generate jumps to jumps. */
2201 && TREE_CODE (then_
) == GOTO_EXPR
2202 && TREE_CODE (GOTO_DESTINATION (then_
)) == LABEL_DECL
)
2204 true_label
= GOTO_DESTINATION (then_
);
2210 && TREE_CODE (else_
) == GOTO_EXPR
2211 && TREE_CODE (GOTO_DESTINATION (else_
)) == LABEL_DECL
)
2213 false_label
= GOTO_DESTINATION (else_
);
2218 /* If we aren't hijacking a label for the 'then' branch, it falls through. */
2220 true_label_p
= &true_label
;
2222 true_label_p
= NULL
;
2224 /* The 'else' branch also needs a label if it contains interesting code. */
2225 if (false_label
|| else_se
)
2226 false_label_p
= &false_label
;
2228 false_label_p
= NULL
;
2230 /* If there was nothing else in our arms, just forward the label(s). */
2231 if (!then_se
&& !else_se
)
2232 return shortcut_cond_r (pred
, true_label_p
, false_label_p
);
2234 /* If our last subexpression already has a terminal label, reuse it. */
2236 expr
= expr_last (else_
);
2238 expr
= expr_last (then_
);
2241 if (expr
&& TREE_CODE (expr
) == LABEL_EXPR
)
2242 end_label
= LABEL_EXPR_LABEL (expr
);
2244 /* If we don't care about jumping to the 'else' branch, jump to the end
2245 if the condition is false. */
2247 false_label_p
= &end_label
;
2249 /* We only want to emit these labels if we aren't hijacking them. */
2250 emit_end
= (end_label
== NULL_TREE
);
2251 emit_false
= (false_label
== NULL_TREE
);
2253 /* We only emit the jump over the else clause if we have to--if the
2254 then clause may fall through. Otherwise we can wind up with a
2255 useless jump and a useless label at the end of gimplified code,
2256 which will cause us to think that this conditional as a whole
2257 falls through even if it doesn't. If we then inline a function
2258 which ends with such a condition, that can cause us to issue an
2259 inappropriate warning about control reaching the end of a
2260 non-void function. */
2261 jump_over_else
= block_may_fallthru (then_
);
2263 pred
= shortcut_cond_r (pred
, true_label_p
, false_label_p
);
2266 append_to_statement_list (pred
, &expr
);
2268 append_to_statement_list (then_
, &expr
);
2273 t
= build_and_jump (&end_label
);
2274 append_to_statement_list (t
, &expr
);
2278 t
= build1 (LABEL_EXPR
, void_type_node
, false_label
);
2279 append_to_statement_list (t
, &expr
);
2281 append_to_statement_list (else_
, &expr
);
2283 if (emit_end
&& end_label
)
2285 t
= build1 (LABEL_EXPR
, void_type_node
, end_label
);
2286 append_to_statement_list (t
, &expr
);
2292 /* EXPR is used in a boolean context; make sure it has BOOLEAN_TYPE. */
2295 gimple_boolify (tree expr
)
2297 tree type
= TREE_TYPE (expr
);
2299 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
2302 switch (TREE_CODE (expr
))
2304 case TRUTH_AND_EXPR
:
2306 case TRUTH_XOR_EXPR
:
2307 case TRUTH_ANDIF_EXPR
:
2308 case TRUTH_ORIF_EXPR
:
2309 /* Also boolify the arguments of truth exprs. */
2310 TREE_OPERAND (expr
, 1) = gimple_boolify (TREE_OPERAND (expr
, 1));
2313 case TRUTH_NOT_EXPR
:
2314 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
2317 case EQ_EXPR
: case NE_EXPR
:
2318 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
2319 /* These expressions always produce boolean results. */
2320 TREE_TYPE (expr
) = boolean_type_node
;
2324 /* Other expressions that get here must have boolean values, but
2325 might need to be converted to the appropriate mode. */
2326 return convert (boolean_type_node
, expr
);
2330 /* Convert the conditional expression pointed to by EXPR_P '(p) ? a : b;'
2339 The second form is used when *EXPR_P is of type void.
2341 TARGET is the tree for T1 above.
2343 PRE_P points to the list where side effects that must happen before
2344 *EXPR_P should be stored.
2346 POST_P points to the list where side effects that must happen after
2347 *EXPR_P should be stored. */
2349 static enum gimplify_status
2350 gimplify_cond_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
, tree target
,
2351 fallback_t fallback
)
2353 tree expr
= *expr_p
;
2354 tree tmp
, tmp2
, type
;
2355 enum gimplify_status ret
;
2357 type
= TREE_TYPE (expr
);
2359 /* If this COND_EXPR has a value, copy the values into a temporary within
2361 if (! VOID_TYPE_P (type
))
2367 ret
= gimplify_expr (&target
, pre_p
, post_p
,
2368 is_gimple_min_lval
, fb_lvalue
);
2369 if (ret
!= GS_ERROR
)
2371 result
= tmp
= target
;
2372 tmp2
= unshare_expr (target
);
2374 else if ((fallback
& fb_lvalue
) == 0)
2376 result
= tmp2
= tmp
= create_tmp_var (TREE_TYPE (expr
), "iftmp");
2381 tree type
= build_pointer_type (TREE_TYPE (expr
));
2383 if (TREE_TYPE (TREE_OPERAND (expr
, 1)) != void_type_node
)
2384 TREE_OPERAND (expr
, 1) =
2385 build_fold_addr_expr (TREE_OPERAND (expr
, 1));
2387 if (TREE_TYPE (TREE_OPERAND (expr
, 2)) != void_type_node
)
2388 TREE_OPERAND (expr
, 2) =
2389 build_fold_addr_expr (TREE_OPERAND (expr
, 2));
2391 tmp2
= tmp
= create_tmp_var (type
, "iftmp");
2393 expr
= build3 (COND_EXPR
, void_type_node
, TREE_OPERAND (expr
, 0),
2394 TREE_OPERAND (expr
, 1), TREE_OPERAND (expr
, 2));
2396 result
= build_fold_indirect_ref (tmp
);
2400 /* Build the then clause, 't1 = a;'. But don't build an assignment
2401 if this branch is void; in C++ it can be, if it's a throw. */
2402 if (TREE_TYPE (TREE_OPERAND (expr
, 1)) != void_type_node
)
2403 TREE_OPERAND (expr
, 1)
2404 = build2 (MODIFY_EXPR
, void_type_node
, tmp
, TREE_OPERAND (expr
, 1));
2406 /* Build the else clause, 't1 = b;'. */
2407 if (TREE_TYPE (TREE_OPERAND (expr
, 2)) != void_type_node
)
2408 TREE_OPERAND (expr
, 2)
2409 = build2 (MODIFY_EXPR
, void_type_node
, tmp2
, TREE_OPERAND (expr
, 2));
2411 TREE_TYPE (expr
) = void_type_node
;
2412 recalculate_side_effects (expr
);
2414 /* Move the COND_EXPR to the prequeue. */
2415 gimplify_and_add (expr
, pre_p
);
2421 /* Make sure the condition has BOOLEAN_TYPE. */
2422 TREE_OPERAND (expr
, 0) = gimple_boolify (TREE_OPERAND (expr
, 0));
2424 /* Break apart && and || conditions. */
2425 if (TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ANDIF_EXPR
2426 || TREE_CODE (TREE_OPERAND (expr
, 0)) == TRUTH_ORIF_EXPR
)
2428 expr
= shortcut_cond_expr (expr
);
2430 if (expr
!= *expr_p
)
2434 /* We can't rely on gimplify_expr to re-gimplify the expanded
2435 form properly, as cleanups might cause the target labels to be
2436 wrapped in a TRY_FINALLY_EXPR. To prevent that, we need to
2437 set up a conditional context. */
2438 gimple_push_condition ();
2439 gimplify_stmt (expr_p
);
2440 gimple_pop_condition (pre_p
);
2446 /* Now do the normal gimplification. */
2447 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, NULL
,
2448 is_gimple_condexpr
, fb_rvalue
);
2450 gimple_push_condition ();
2452 gimplify_to_stmt_list (&TREE_OPERAND (expr
, 1));
2453 gimplify_to_stmt_list (&TREE_OPERAND (expr
, 2));
2454 recalculate_side_effects (expr
);
2456 gimple_pop_condition (pre_p
);
2458 if (ret
== GS_ERROR
)
2460 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
2462 else if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 2)))
2463 /* Rewrite "if (a); else b" to "if (!a) b" */
2465 TREE_OPERAND (expr
, 0) = invert_truthvalue (TREE_OPERAND (expr
, 0));
2466 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, NULL
,
2467 is_gimple_condexpr
, fb_rvalue
);
2469 tmp
= TREE_OPERAND (expr
, 1);
2470 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 2);
2471 TREE_OPERAND (expr
, 2) = tmp
;
2474 /* Both arms are empty; replace the COND_EXPR with its predicate. */
2475 expr
= TREE_OPERAND (expr
, 0);
2481 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2482 a call to __builtin_memcpy. */
2484 static enum gimplify_status
2485 gimplify_modify_expr_to_memcpy (tree
*expr_p
, tree size
, bool want_value
)
2487 tree args
, t
, to
, to_ptr
, from
;
2489 to
= TREE_OPERAND (*expr_p
, 0);
2490 from
= TREE_OPERAND (*expr_p
, 1);
2492 args
= tree_cons (NULL
, size
, NULL
);
2494 t
= build_fold_addr_expr (from
);
2495 args
= tree_cons (NULL
, t
, args
);
2497 to_ptr
= build_fold_addr_expr (to
);
2498 args
= tree_cons (NULL
, to_ptr
, args
);
2499 t
= implicit_built_in_decls
[BUILT_IN_MEMCPY
];
2500 t
= build_function_call_expr (t
, args
);
2504 t
= build1 (NOP_EXPR
, TREE_TYPE (to_ptr
), t
);
2505 t
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
2512 /* A subroutine of gimplify_modify_expr. Replace a MODIFY_EXPR with
2513 a call to __builtin_memset. In this case we know that the RHS is
2514 a CONSTRUCTOR with an empty element list. */
2516 static enum gimplify_status
2517 gimplify_modify_expr_to_memset (tree
*expr_p
, tree size
, bool want_value
)
2519 tree args
, t
, to
, to_ptr
;
2521 to
= TREE_OPERAND (*expr_p
, 0);
2523 args
= tree_cons (NULL
, size
, NULL
);
2525 args
= tree_cons (NULL
, integer_zero_node
, args
);
2527 to_ptr
= build_fold_addr_expr (to
);
2528 args
= tree_cons (NULL
, to_ptr
, args
);
2529 t
= implicit_built_in_decls
[BUILT_IN_MEMSET
];
2530 t
= build_function_call_expr (t
, args
);
2534 t
= build1 (NOP_EXPR
, TREE_TYPE (to_ptr
), t
);
2535 t
= build1 (INDIRECT_REF
, TREE_TYPE (to
), t
);
2542 /* A subroutine of gimplify_init_ctor_preeval. Called via walk_tree,
2543 determine, cautiously, if a CONSTRUCTOR overlaps the lhs of an
2544 assignment. Returns non-null if we detect a potential overlap. */
2546 struct gimplify_init_ctor_preeval_data
2548 /* The base decl of the lhs object. May be NULL, in which case we
2549 have to assume the lhs is indirect. */
2552 /* The alias set of the lhs object. */
2557 gimplify_init_ctor_preeval_1 (tree
*tp
, int *walk_subtrees
, void *xdata
)
2559 struct gimplify_init_ctor_preeval_data
*data
2560 = (struct gimplify_init_ctor_preeval_data
*) xdata
;
2563 /* If we find the base object, obviously we have overlap. */
2564 if (data
->lhs_base_decl
== t
)
2567 /* If the constructor component is indirect, determine if we have a
2568 potential overlap with the lhs. The only bits of information we
2569 have to go on at this point are addressability and alias sets. */
2570 if (TREE_CODE (t
) == INDIRECT_REF
2571 && (!data
->lhs_base_decl
|| TREE_ADDRESSABLE (data
->lhs_base_decl
))
2572 && alias_sets_conflict_p (data
->lhs_alias_set
, get_alias_set (t
)))
2575 if (IS_TYPE_OR_DECL_P (t
))
2580 /* A subroutine of gimplify_init_constructor. Pre-evaluate *EXPR_P,
2581 force values that overlap with the lhs (as described by *DATA)
2582 into temporaries. */
2585 gimplify_init_ctor_preeval (tree
*expr_p
, tree
*pre_p
, tree
*post_p
,
2586 struct gimplify_init_ctor_preeval_data
*data
)
2588 enum gimplify_status one
;
2590 /* If the value is invariant, then there's nothing to pre-evaluate.
2591 But ensure it doesn't have any side-effects since a SAVE_EXPR is
2592 invariant but has side effects and might contain a reference to
2593 the object we're initializing. */
2594 if (TREE_INVARIANT (*expr_p
) && !TREE_SIDE_EFFECTS (*expr_p
))
2597 /* If the type has non-trivial constructors, we can't pre-evaluate. */
2598 if (TREE_ADDRESSABLE (TREE_TYPE (*expr_p
)))
2601 /* Recurse for nested constructors. */
2602 if (TREE_CODE (*expr_p
) == CONSTRUCTOR
)
2604 unsigned HOST_WIDE_INT ix
;
2605 constructor_elt
*ce
;
2606 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (*expr_p
);
2608 for (ix
= 0; VEC_iterate (constructor_elt
, v
, ix
, ce
); ix
++)
2609 gimplify_init_ctor_preeval (&ce
->value
, pre_p
, post_p
, data
);
2613 /* We can't preevaluate if the type contains a placeholder. */
2614 if (type_contains_placeholder_p (TREE_TYPE (*expr_p
)))
2617 /* Gimplify the constructor element to something appropriate for the rhs
2618 of a MODIFY_EXPR. Given that we know the lhs is an aggregate, we know
2619 the gimplifier will consider this a store to memory. Doing this
2620 gimplification now means that we won't have to deal with complicated
2621 language-specific trees, nor trees like SAVE_EXPR that can induce
2622 exponential search behavior. */
2623 one
= gimplify_expr (expr_p
, pre_p
, post_p
, is_gimple_mem_rhs
, fb_rvalue
);
2624 if (one
== GS_ERROR
)
2630 /* If we gimplified to a bare decl, we can be sure that it doesn't overlap
2631 with the lhs, since "a = { .x=a }" doesn't make sense. This will
2632 always be true for all scalars, since is_gimple_mem_rhs insists on a
2633 temporary variable for them. */
2634 if (DECL_P (*expr_p
))
2637 /* If this is of variable size, we have no choice but to assume it doesn't
2638 overlap since we can't make a temporary for it. */
2639 if (!TREE_CONSTANT (TYPE_SIZE (TREE_TYPE (*expr_p
))))
2642 /* Otherwise, we must search for overlap ... */
2643 if (!walk_tree (expr_p
, gimplify_init_ctor_preeval_1
, data
, NULL
))
2646 /* ... and if found, force the value into a temporary. */
2647 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
2650 /* A subroutine of gimplify_init_ctor_eval. Create a loop for
2651 a RANGE_EXPR in a CONSTRUCTOR for an array.
2655 object[var] = value;
2662 We increment var _after_ the loop exit check because we might otherwise
2663 fail if upper == TYPE_MAX_VALUE (type for upper).
2665 Note that we never have to deal with SAVE_EXPRs here, because this has
2666 already been taken care of for us, in gimplify_init_ctor_preeval(). */
2668 static void gimplify_init_ctor_eval (tree
, VEC(constructor_elt
,gc
) *,
2672 gimplify_init_ctor_eval_range (tree object
, tree lower
, tree upper
,
2673 tree value
, tree array_elt_type
,
2674 tree
*pre_p
, bool cleared
)
2676 tree loop_entry_label
, loop_exit_label
;
2677 tree var
, var_type
, cref
;
2679 loop_entry_label
= create_artificial_label ();
2680 loop_exit_label
= create_artificial_label ();
2682 /* Create and initialize the index variable. */
2683 var_type
= TREE_TYPE (upper
);
2684 var
= create_tmp_var (var_type
, NULL
);
2685 append_to_statement_list (build2 (MODIFY_EXPR
, var_type
, var
, lower
), pre_p
);
2687 /* Add the loop entry label. */
2688 append_to_statement_list (build1 (LABEL_EXPR
,
2693 /* Build the reference. */
2694 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
2695 var
, NULL_TREE
, NULL_TREE
);
2697 /* If we are a constructor, just call gimplify_init_ctor_eval to do
2698 the store. Otherwise just assign value to the reference. */
2700 if (TREE_CODE (value
) == CONSTRUCTOR
)
2701 /* NB we might have to call ourself recursively through
2702 gimplify_init_ctor_eval if the value is a constructor. */
2703 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
2706 append_to_statement_list (build2 (MODIFY_EXPR
, TREE_TYPE (cref
),
2710 /* We exit the loop when the index var is equal to the upper bound. */
2711 gimplify_and_add (build3 (COND_EXPR
, void_type_node
,
2712 build2 (EQ_EXPR
, boolean_type_node
,
2720 /* Otherwise, increment the index var... */
2721 append_to_statement_list (build2 (MODIFY_EXPR
, var_type
, var
,
2722 build2 (PLUS_EXPR
, var_type
, var
,
2723 fold_convert (var_type
,
2724 integer_one_node
))),
2727 /* ...and jump back to the loop entry. */
2728 append_to_statement_list (build1 (GOTO_EXPR
,
2733 /* Add the loop exit label. */
2734 append_to_statement_list (build1 (LABEL_EXPR
,
2740 /* Return true if FDECL is accessing a field that is zero sized. */
2743 zero_sized_field_decl (tree fdecl
)
2745 if (TREE_CODE (fdecl
) == FIELD_DECL
&& DECL_SIZE (fdecl
)
2746 && integer_zerop (DECL_SIZE (fdecl
)))
2751 /* Return true if TYPE is zero sized. */
2754 zero_sized_type (tree type
)
2756 if (AGGREGATE_TYPE_P (type
) && TYPE_SIZE (type
)
2757 && integer_zerop (TYPE_SIZE (type
)))
2762 /* A subroutine of gimplify_init_constructor. Generate individual
2763 MODIFY_EXPRs for a CONSTRUCTOR. OBJECT is the LHS against which the
2764 assignments should happen. ELTS is the CONSTRUCTOR_ELTS of the
2765 CONSTRUCTOR. CLEARED is true if the entire LHS object has been
2769 gimplify_init_ctor_eval (tree object
, VEC(constructor_elt
,gc
) *elts
,
2770 tree
*pre_p
, bool cleared
)
2772 tree array_elt_type
= NULL
;
2773 unsigned HOST_WIDE_INT ix
;
2774 tree purpose
, value
;
2776 if (TREE_CODE (TREE_TYPE (object
)) == ARRAY_TYPE
)
2777 array_elt_type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (object
)));
2779 FOR_EACH_CONSTRUCTOR_ELT (elts
, ix
, purpose
, value
)
2783 /* NULL values are created above for gimplification errors. */
2787 if (cleared
&& initializer_zerop (value
))
2790 /* ??? Here's to hoping the front end fills in all of the indices,
2791 so we don't have to figure out what's missing ourselves. */
2792 gcc_assert (purpose
);
2794 /* Skip zero-sized fields, unless value has side-effects. This can
2795 happen with calls to functions returning a zero-sized type, which
2796 we shouldn't discard. As a number of downstream passes don't
2797 expect sets of zero-sized fields, we rely on the gimplification of
2798 the MODIFY_EXPR we make below to drop the assignment statement. */
2799 if (! TREE_SIDE_EFFECTS (value
) && zero_sized_field_decl (purpose
))
2802 /* If we have a RANGE_EXPR, we have to build a loop to assign the
2804 if (TREE_CODE (purpose
) == RANGE_EXPR
)
2806 tree lower
= TREE_OPERAND (purpose
, 0);
2807 tree upper
= TREE_OPERAND (purpose
, 1);
2809 /* If the lower bound is equal to upper, just treat it as if
2810 upper was the index. */
2811 if (simple_cst_equal (lower
, upper
))
2815 gimplify_init_ctor_eval_range (object
, lower
, upper
, value
,
2816 array_elt_type
, pre_p
, cleared
);
2823 cref
= build4 (ARRAY_REF
, array_elt_type
, unshare_expr (object
),
2824 purpose
, NULL_TREE
, NULL_TREE
);
2828 gcc_assert (TREE_CODE (purpose
) == FIELD_DECL
);
2829 cref
= build3 (COMPONENT_REF
, TREE_TYPE (purpose
),
2830 unshare_expr (object
), purpose
, NULL_TREE
);
2833 if (TREE_CODE (value
) == CONSTRUCTOR
2834 && TREE_CODE (TREE_TYPE (value
)) != VECTOR_TYPE
)
2835 gimplify_init_ctor_eval (cref
, CONSTRUCTOR_ELTS (value
),
2839 init
= build2 (MODIFY_EXPR
, TREE_TYPE (cref
), cref
, value
);
2840 gimplify_and_add (init
, pre_p
);
2845 /* A subroutine of gimplify_modify_expr. Break out elements of a
2846 CONSTRUCTOR used as an initializer into separate MODIFY_EXPRs.
2848 Note that we still need to clear any elements that don't have explicit
2849 initializers, so if not all elements are initialized we keep the
2850 original MODIFY_EXPR, we just remove all of the constructor elements. */
2852 static enum gimplify_status
2853 gimplify_init_constructor (tree
*expr_p
, tree
*pre_p
,
2854 tree
*post_p
, bool want_value
)
2857 tree ctor
= TREE_OPERAND (*expr_p
, 1);
2858 tree type
= TREE_TYPE (ctor
);
2859 enum gimplify_status ret
;
2860 VEC(constructor_elt
,gc
) *elts
;
2862 if (TREE_CODE (ctor
) != CONSTRUCTOR
)
2863 return GS_UNHANDLED
;
2865 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
2866 is_gimple_lvalue
, fb_lvalue
);
2867 if (ret
== GS_ERROR
)
2869 object
= TREE_OPERAND (*expr_p
, 0);
2871 elts
= CONSTRUCTOR_ELTS (ctor
);
2874 switch (TREE_CODE (type
))
2878 case QUAL_UNION_TYPE
:
2881 struct gimplify_init_ctor_preeval_data preeval_data
;
2882 HOST_WIDE_INT num_type_elements
, num_ctor_elements
;
2883 HOST_WIDE_INT num_nonzero_elements
, num_nonconstant_elements
;
2886 /* Aggregate types must lower constructors to initialization of
2887 individual elements. The exception is that a CONSTRUCTOR node
2888 with no elements indicates zero-initialization of the whole. */
2889 if (VEC_empty (constructor_elt
, elts
))
2892 categorize_ctor_elements (ctor
, &num_nonzero_elements
,
2893 &num_nonconstant_elements
,
2894 &num_ctor_elements
, &cleared
);
2896 /* If a const aggregate variable is being initialized, then it
2897 should never be a lose to promote the variable to be static. */
2898 if (num_nonconstant_elements
== 0
2899 && num_nonzero_elements
> 1
2900 && TREE_READONLY (object
)
2901 && TREE_CODE (object
) == VAR_DECL
)
2903 DECL_INITIAL (object
) = ctor
;
2904 TREE_STATIC (object
) = 1;
2905 if (!DECL_NAME (object
))
2906 DECL_NAME (object
) = create_tmp_var_name ("C");
2907 walk_tree (&DECL_INITIAL (object
), force_labels_r
, NULL
, NULL
);
2909 /* ??? C++ doesn't automatically append a .<number> to the
2910 assembler name, and even when it does, it looks a FE private
2911 data structures to figure out what that number should be,
2912 which are not set for this variable. I suppose this is
2913 important for local statics for inline functions, which aren't
2914 "local" in the object file sense. So in order to get a unique
2915 TU-local symbol, we must invoke the lhd version now. */
2916 lhd_set_decl_assembler_name (object
);
2918 *expr_p
= NULL_TREE
;
2922 /* If there are "lots" of initialized elements, even discounting
2923 those that are not address constants (and thus *must* be
2924 computed at runtime), then partition the constructor into
2925 constant and non-constant parts. Block copy the constant
2926 parts in, then generate code for the non-constant parts. */
2927 /* TODO. There's code in cp/typeck.c to do this. */
2929 num_type_elements
= count_type_elements (type
, true);
2931 /* If count_type_elements could not determine number of type elements
2932 for a constant-sized object, assume clearing is needed.
2933 Don't do this for variable-sized objects, as store_constructor
2934 will ignore the clearing of variable-sized objects. */
2935 if (num_type_elements
< 0 && int_size_in_bytes (type
) >= 0)
2937 /* If there are "lots" of zeros, then block clear the object first. */
2938 else if (num_type_elements
- num_nonzero_elements
> CLEAR_RATIO
2939 && num_nonzero_elements
< num_type_elements
/4)
2941 /* ??? This bit ought not be needed. For any element not present
2942 in the initializer, we should simply set them to zero. Except
2943 we'd need to *find* the elements that are not present, and that
2944 requires trickery to avoid quadratic compile-time behavior in
2945 large cases or excessive memory use in small cases. */
2946 else if (num_ctor_elements
< num_type_elements
)
2949 /* If there are "lots" of initialized elements, and all of them
2950 are valid address constants, then the entire initializer can
2951 be dropped to memory, and then memcpy'd out. Don't do this
2952 for sparse arrays, though, as it's more efficient to follow
2953 the standard CONSTRUCTOR behavior of memset followed by
2954 individual element initialization. */
2955 if (num_nonconstant_elements
== 0 && !cleared
)
2957 HOST_WIDE_INT size
= int_size_in_bytes (type
);
2960 /* ??? We can still get unbounded array types, at least
2961 from the C++ front end. This seems wrong, but attempt
2962 to work around it for now. */
2965 size
= int_size_in_bytes (TREE_TYPE (object
));
2967 TREE_TYPE (ctor
) = type
= TREE_TYPE (object
);
2970 /* Find the maximum alignment we can assume for the object. */
2971 /* ??? Make use of DECL_OFFSET_ALIGN. */
2972 if (DECL_P (object
))
2973 align
= DECL_ALIGN (object
);
2975 align
= TYPE_ALIGN (type
);
2977 if (size
> 0 && !can_move_by_pieces (size
, align
))
2979 tree
new = create_tmp_var_raw (type
, "C");
2981 gimple_add_tmp_var (new);
2982 TREE_STATIC (new) = 1;
2983 TREE_READONLY (new) = 1;
2984 DECL_INITIAL (new) = ctor
;
2985 if (align
> DECL_ALIGN (new))
2987 DECL_ALIGN (new) = align
;
2988 DECL_USER_ALIGN (new) = 1;
2990 walk_tree (&DECL_INITIAL (new), force_labels_r
, NULL
, NULL
);
2992 TREE_OPERAND (*expr_p
, 1) = new;
2994 /* This is no longer an assignment of a CONSTRUCTOR, but
2995 we still may have processing to do on the LHS. So
2996 pretend we didn't do anything here to let that happen. */
2997 return GS_UNHANDLED
;
3003 /* Zap the CONSTRUCTOR element list, which simplifies this case.
3004 Note that we still have to gimplify, in order to handle the
3005 case of variable sized types. Avoid shared tree structures. */
3006 CONSTRUCTOR_ELTS (ctor
) = NULL
;
3007 object
= unshare_expr (object
);
3008 gimplify_stmt (expr_p
);
3009 append_to_statement_list (*expr_p
, pre_p
);
3012 /* If we have not block cleared the object, or if there are nonzero
3013 elements in the constructor, add assignments to the individual
3014 scalar fields of the object. */
3015 if (!cleared
|| num_nonzero_elements
> 0)
3017 preeval_data
.lhs_base_decl
= get_base_address (object
);
3018 if (!DECL_P (preeval_data
.lhs_base_decl
))
3019 preeval_data
.lhs_base_decl
= NULL
;
3020 preeval_data
.lhs_alias_set
= get_alias_set (object
);
3022 gimplify_init_ctor_preeval (&TREE_OPERAND (*expr_p
, 1),
3023 pre_p
, post_p
, &preeval_data
);
3024 gimplify_init_ctor_eval (object
, elts
, pre_p
, cleared
);
3027 *expr_p
= NULL_TREE
;
3035 /* Extract the real and imaginary parts out of the ctor. */
3036 gcc_assert (VEC_length (constructor_elt
, elts
) == 2);
3037 r
= VEC_index (constructor_elt
, elts
, 0)->value
;
3038 i
= VEC_index (constructor_elt
, elts
, 1)->value
;
3039 if (r
== NULL
|| i
== NULL
)
3041 tree zero
= convert (TREE_TYPE (type
), integer_zero_node
);
3048 /* Complex types have either COMPLEX_CST or COMPLEX_EXPR to
3049 represent creation of a complex value. */
3050 if (TREE_CONSTANT (r
) && TREE_CONSTANT (i
))
3052 ctor
= build_complex (type
, r
, i
);
3053 TREE_OPERAND (*expr_p
, 1) = ctor
;
3057 ctor
= build2 (COMPLEX_EXPR
, type
, r
, i
);
3058 TREE_OPERAND (*expr_p
, 1) = ctor
;
3059 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
3060 rhs_predicate_for (TREE_OPERAND (*expr_p
, 0)),
3068 unsigned HOST_WIDE_INT ix
;
3069 constructor_elt
*ce
;
3071 /* Go ahead and simplify constant constructors to VECTOR_CST. */
3072 if (TREE_CONSTANT (ctor
))
3074 bool constant_p
= true;
3077 /* Even when ctor is constant, it might contain non-*_CST
3078 elements (e.g. { 1.0/0.0 - 1.0/0.0, 0.0 }) and those don't
3079 belong into VECTOR_CST nodes. */
3080 FOR_EACH_CONSTRUCTOR_VALUE (elts
, ix
, value
)
3081 if (!CONSTANT_CLASS_P (value
))
3089 TREE_OPERAND (*expr_p
, 1) = build_vector_from_ctor (type
, elts
);
3094 /* Vector types use CONSTRUCTOR all the way through gimple
3095 compilation as a general initializer. */
3096 for (ix
= 0; VEC_iterate (constructor_elt
, elts
, ix
, ce
); ix
++)
3098 enum gimplify_status tret
;
3099 tret
= gimplify_expr (&ce
->value
, pre_p
, post_p
,
3100 is_gimple_val
, fb_rvalue
);
3101 if (tret
== GS_ERROR
)
3108 /* So how did we get a CONSTRUCTOR for a scalar type? */
3112 if (ret
== GS_ERROR
)
3114 else if (want_value
)
3116 append_to_statement_list (*expr_p
, pre_p
);
3124 /* Given a pointer value OP0, return a simplified version of an
3125 indirection through OP0, or NULL_TREE if no simplification is
3126 possible. This may only be applied to a rhs of an expression.
3127 Note that the resulting type may be different from the type pointed
3128 to in the sense that it is still compatible from the langhooks
3132 fold_indirect_ref_rhs (tree t
)
3134 tree type
= TREE_TYPE (TREE_TYPE (t
));
3139 subtype
= TREE_TYPE (sub
);
3140 if (!POINTER_TYPE_P (subtype
))
3143 if (TREE_CODE (sub
) == ADDR_EXPR
)
3145 tree op
= TREE_OPERAND (sub
, 0);
3146 tree optype
= TREE_TYPE (op
);
3148 if (lang_hooks
.types_compatible_p (type
, optype
))
3150 /* *(foo *)&fooarray => fooarray[0] */
3151 else if (TREE_CODE (optype
) == ARRAY_TYPE
3152 && lang_hooks
.types_compatible_p (type
, TREE_TYPE (optype
)))
3154 tree type_domain
= TYPE_DOMAIN (optype
);
3155 tree min_val
= size_zero_node
;
3156 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
3157 min_val
= TYPE_MIN_VALUE (type_domain
);
3158 return build4 (ARRAY_REF
, type
, op
, min_val
, NULL_TREE
, NULL_TREE
);
3162 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
3163 if (TREE_CODE (TREE_TYPE (subtype
)) == ARRAY_TYPE
3164 && lang_hooks
.types_compatible_p (type
, TREE_TYPE (TREE_TYPE (subtype
))))
3167 tree min_val
= size_zero_node
;
3169 sub
= fold_indirect_ref_rhs (sub
);
3171 sub
= build1 (INDIRECT_REF
, TREE_TYPE (subtype
), osub
);
3172 type_domain
= TYPE_DOMAIN (TREE_TYPE (sub
));
3173 if (type_domain
&& TYPE_MIN_VALUE (type_domain
))
3174 min_val
= TYPE_MIN_VALUE (type_domain
);
3175 return build4 (ARRAY_REF
, type
, sub
, min_val
, NULL_TREE
, NULL_TREE
);
3181 /* Subroutine of gimplify_modify_expr to do simplifications of MODIFY_EXPRs
3182 based on the code of the RHS. We loop for as long as something changes. */
3184 static enum gimplify_status
3185 gimplify_modify_expr_rhs (tree
*expr_p
, tree
*from_p
, tree
*to_p
, tree
*pre_p
,
3186 tree
*post_p
, bool want_value
)
3188 enum gimplify_status ret
= GS_OK
;
3190 while (ret
!= GS_UNHANDLED
)
3191 switch (TREE_CODE (*from_p
))
3196 /* If we have code like
3200 where the type of "x" is a (possibly cv-qualified variant
3201 of "A"), treat the entire expression as identical to "x".
3202 This kind of code arises in C++ when an object is bound
3203 to a const reference, and if "x" is a TARGET_EXPR we want
3204 to take advantage of the optimization below. */
3205 tree t
= fold_indirect_ref_rhs (TREE_OPERAND (*from_p
, 0));
3219 /* If we are initializing something from a TARGET_EXPR, strip the
3220 TARGET_EXPR and initialize it directly, if possible. This can't
3221 be done if the initializer is void, since that implies that the
3222 temporary is set in some non-trivial way.
3224 ??? What about code that pulls out the temp and uses it
3225 elsewhere? I think that such code never uses the TARGET_EXPR as
3226 an initializer. If I'm wrong, we'll die because the temp won't
3227 have any RTL. In that case, I guess we'll need to replace
3228 references somehow. */
3229 tree init
= TARGET_EXPR_INITIAL (*from_p
);
3231 if (!VOID_TYPE_P (TREE_TYPE (init
)))
3242 /* Remove any COMPOUND_EXPR in the RHS so the following cases will be
3244 gimplify_compound_expr (from_p
, pre_p
, true);
3249 /* If we're initializing from a CONSTRUCTOR, break this into
3250 individual MODIFY_EXPRs. */
3251 return gimplify_init_constructor (expr_p
, pre_p
, post_p
, want_value
);
3254 /* If we're assigning to a non-register type, push the assignment
3255 down into the branches. This is mandatory for ADDRESSABLE types,
3256 since we cannot generate temporaries for such, but it saves a
3257 copy in other cases as well. */
3258 if (!is_gimple_reg_type (TREE_TYPE (*from_p
)))
3261 return gimplify_cond_expr (expr_p
, pre_p
, post_p
, *to_p
,
3269 /* For calls that return in memory, give *to_p as the CALL_EXPR's
3270 return slot so that we don't generate a temporary. */
3271 if (!CALL_EXPR_RETURN_SLOT_OPT (*from_p
)
3272 && aggregate_value_p (*from_p
, *from_p
))
3276 if (TREE_CODE (*to_p
) == RESULT_DECL
3277 && DECL_NAME (*to_p
) == NULL_TREE
3278 && needs_to_live_in_memory (*to_p
))
3279 /* It's OK to use the return slot directly unless it's an NRV. */
3281 else if (!is_gimple_non_addressable (*to_p
))
3282 /* Don't use the original target if it's already addressable;
3283 if its address escapes, and the called function uses the
3284 NRV optimization, a conforming program could see *to_p
3285 change before the called function returns; see c++/19317.
3286 When optimizing, the return_slot pass marks more functions
3287 as safe after we have escape info. */
3289 else if (TREE_CODE (*to_p
) != PARM_DECL
3290 && DECL_GIMPLE_FORMAL_TEMP_P (*to_p
))
3291 /* Don't use the original target if it's a formal temp; we
3292 don't want to take their addresses. */
3294 else if (is_gimple_reg_type (TREE_TYPE (*to_p
)))
3295 /* Also don't force regs into memory. */
3302 CALL_EXPR_RETURN_SLOT_OPT (*from_p
) = 1;
3303 lang_hooks
.mark_addressable (*to_p
);
3318 /* Promote partial stores to COMPLEX variables to total stores. *EXPR_P is
3319 a MODIFY_EXPR with a lhs of a REAL/IMAGPART_EXPR of a variable with
3320 DECL_COMPLEX_GIMPLE_REG_P set. */
3322 static enum gimplify_status
3323 gimplify_modify_expr_complex_part (tree
*expr_p
, tree
*pre_p
, bool want_value
)
3325 enum tree_code code
, ocode
;
3326 tree lhs
, rhs
, new_rhs
, other
, realpart
, imagpart
;
3328 lhs
= TREE_OPERAND (*expr_p
, 0);
3329 rhs
= TREE_OPERAND (*expr_p
, 1);
3330 code
= TREE_CODE (lhs
);
3331 lhs
= TREE_OPERAND (lhs
, 0);
3333 ocode
= code
== REALPART_EXPR
? IMAGPART_EXPR
: REALPART_EXPR
;
3334 other
= build1 (ocode
, TREE_TYPE (rhs
), lhs
);
3335 other
= get_formal_tmp_var (other
, pre_p
);
3337 realpart
= code
== REALPART_EXPR
? rhs
: other
;
3338 imagpart
= code
== REALPART_EXPR
? other
: rhs
;
3340 if (TREE_CONSTANT (realpart
) && TREE_CONSTANT (imagpart
))
3341 new_rhs
= build_complex (TREE_TYPE (lhs
), realpart
, imagpart
);
3343 new_rhs
= build2 (COMPLEX_EXPR
, TREE_TYPE (lhs
), realpart
, imagpart
);
3345 TREE_OPERAND (*expr_p
, 0) = lhs
;
3346 TREE_OPERAND (*expr_p
, 1) = new_rhs
;
3350 append_to_statement_list (*expr_p
, pre_p
);
3357 /* Gimplify the MODIFY_EXPR node pointed to by EXPR_P.
3363 PRE_P points to the list where side effects that must happen before
3364 *EXPR_P should be stored.
3366 POST_P points to the list where side effects that must happen after
3367 *EXPR_P should be stored.
3369 WANT_VALUE is nonzero iff we want to use the value of this expression
3370 in another expression. */
3372 static enum gimplify_status
3373 gimplify_modify_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
, bool want_value
)
3375 tree
*from_p
= &TREE_OPERAND (*expr_p
, 1);
3376 tree
*to_p
= &TREE_OPERAND (*expr_p
, 0);
3377 enum gimplify_status ret
= GS_UNHANDLED
;
3379 gcc_assert (TREE_CODE (*expr_p
) == MODIFY_EXPR
3380 || TREE_CODE (*expr_p
) == INIT_EXPR
);
3382 /* The distinction between MODIFY_EXPR and INIT_EXPR is no longer useful. */
3383 if (TREE_CODE (*expr_p
) == INIT_EXPR
)
3384 TREE_SET_CODE (*expr_p
, MODIFY_EXPR
);
3386 /* For zero sized types only gimplify the left hand side and right hand side
3387 as statements and throw away the assignment. */
3388 if (zero_sized_type (TREE_TYPE (*from_p
)))
3390 gimplify_stmt (from_p
);
3391 gimplify_stmt (to_p
);
3392 append_to_statement_list (*from_p
, pre_p
);
3393 append_to_statement_list (*to_p
, pre_p
);
3394 *expr_p
= NULL_TREE
;
3398 /* See if any simplifications can be done based on what the RHS is. */
3399 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
3401 if (ret
!= GS_UNHANDLED
)
3404 /* If the value being copied is of variable width, compute the length
3405 of the copy into a WITH_SIZE_EXPR. Note that we need to do this
3406 before gimplifying any of the operands so that we can resolve any
3407 PLACEHOLDER_EXPRs in the size. Also note that the RTL expander uses
3408 the size of the expression to be copied, not of the destination, so
3409 that is what we must here. */
3410 maybe_with_size_expr (from_p
);
3412 ret
= gimplify_expr (to_p
, pre_p
, post_p
, is_gimple_lvalue
, fb_lvalue
);
3413 if (ret
== GS_ERROR
)
3416 ret
= gimplify_expr (from_p
, pre_p
, post_p
,
3417 rhs_predicate_for (*to_p
), fb_rvalue
);
3418 if (ret
== GS_ERROR
)
3421 /* Now see if the above changed *from_p to something we handle specially. */
3422 ret
= gimplify_modify_expr_rhs (expr_p
, from_p
, to_p
, pre_p
, post_p
,
3424 if (ret
!= GS_UNHANDLED
)
3427 /* If we've got a variable sized assignment between two lvalues (i.e. does
3428 not involve a call), then we can make things a bit more straightforward
3429 by converting the assignment to memcpy or memset. */
3430 if (TREE_CODE (*from_p
) == WITH_SIZE_EXPR
)
3432 tree from
= TREE_OPERAND (*from_p
, 0);
3433 tree size
= TREE_OPERAND (*from_p
, 1);
3435 if (TREE_CODE (from
) == CONSTRUCTOR
)
3436 return gimplify_modify_expr_to_memset (expr_p
, size
, want_value
);
3437 if (is_gimple_addressable (from
))
3440 return gimplify_modify_expr_to_memcpy (expr_p
, size
, want_value
);
3444 /* Transform partial stores to non-addressable complex variables into
3445 total stores. This allows us to use real instead of virtual operands
3446 for these variables, which improves optimization. */
3447 if ((TREE_CODE (*to_p
) == REALPART_EXPR
3448 || TREE_CODE (*to_p
) == IMAGPART_EXPR
)
3449 && is_gimple_reg (TREE_OPERAND (*to_p
, 0)))
3450 return gimplify_modify_expr_complex_part (expr_p
, pre_p
, want_value
);
3452 if (gimplify_ctxp
->into_ssa
&& is_gimple_reg (*to_p
))
3454 /* If we've somehow already got an SSA_NAME on the LHS, then
3455 we're probably modified it twice. Not good. */
3456 gcc_assert (TREE_CODE (*to_p
) != SSA_NAME
);
3457 *to_p
= make_ssa_name (*to_p
, *expr_p
);
3462 append_to_statement_list (*expr_p
, pre_p
);
3470 /* Gimplify a comparison between two variable-sized objects. Do this
3471 with a call to BUILT_IN_MEMCMP. */
3473 static enum gimplify_status
3474 gimplify_variable_sized_compare (tree
*expr_p
)
3476 tree op0
= TREE_OPERAND (*expr_p
, 0);
3477 tree op1
= TREE_OPERAND (*expr_p
, 1);
3480 t
= TYPE_SIZE_UNIT (TREE_TYPE (op0
));
3481 t
= unshare_expr (t
);
3482 t
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (t
, op0
);
3483 args
= tree_cons (NULL
, t
, NULL
);
3484 t
= build_fold_addr_expr (op1
);
3485 args
= tree_cons (NULL
, t
, args
);
3486 dest
= build_fold_addr_expr (op0
);
3487 args
= tree_cons (NULL
, dest
, args
);
3488 t
= implicit_built_in_decls
[BUILT_IN_MEMCMP
];
3489 t
= build_function_call_expr (t
, args
);
3491 = build2 (TREE_CODE (*expr_p
), TREE_TYPE (*expr_p
), t
, integer_zero_node
);
3496 /* Gimplify TRUTH_ANDIF_EXPR and TRUTH_ORIF_EXPR expressions. EXPR_P
3497 points to the expression to gimplify.
3499 Expressions of the form 'a && b' are gimplified to:
3501 a && b ? true : false
3503 gimplify_cond_expr will do the rest.
3505 PRE_P points to the list where side effects that must happen before
3506 *EXPR_P should be stored. */
3508 static enum gimplify_status
3509 gimplify_boolean_expr (tree
*expr_p
)
3511 /* Preserve the original type of the expression. */
3512 tree type
= TREE_TYPE (*expr_p
);
3514 *expr_p
= build3 (COND_EXPR
, type
, *expr_p
,
3515 convert (type
, boolean_true_node
),
3516 convert (type
, boolean_false_node
));
3521 /* Gimplifies an expression sequence. This function gimplifies each
3522 expression and re-writes the original expression with the last
3523 expression of the sequence in GIMPLE form.
3525 PRE_P points to the list where the side effects for all the
3526 expressions in the sequence will be emitted.
3528 WANT_VALUE is true when the result of the last COMPOUND_EXPR is used. */
3529 /* ??? Should rearrange to share the pre-queue with all the indirect
3530 invocations of gimplify_expr. Would probably save on creations
3531 of statement_list nodes. */
3533 static enum gimplify_status
3534 gimplify_compound_expr (tree
*expr_p
, tree
*pre_p
, bool want_value
)
3540 tree
*sub_p
= &TREE_OPERAND (t
, 0);
3542 if (TREE_CODE (*sub_p
) == COMPOUND_EXPR
)
3543 gimplify_compound_expr (sub_p
, pre_p
, false);
3545 gimplify_stmt (sub_p
);
3546 append_to_statement_list (*sub_p
, pre_p
);
3548 t
= TREE_OPERAND (t
, 1);
3550 while (TREE_CODE (t
) == COMPOUND_EXPR
);
3557 gimplify_stmt (expr_p
);
3562 /* Gimplifies a statement list. These may be created either by an
3563 enlightened front-end, or by shortcut_cond_expr. */
3565 static enum gimplify_status
3566 gimplify_statement_list (tree
*expr_p
)
3568 tree_stmt_iterator i
= tsi_start (*expr_p
);
3570 while (!tsi_end_p (i
))
3574 gimplify_stmt (tsi_stmt_ptr (i
));
3579 else if (TREE_CODE (t
) == STATEMENT_LIST
)
3581 tsi_link_before (&i
, t
, TSI_SAME_STMT
);
3591 /* Gimplify a SAVE_EXPR node. EXPR_P points to the expression to
3592 gimplify. After gimplification, EXPR_P will point to a new temporary
3593 that holds the original value of the SAVE_EXPR node.
3595 PRE_P points to the list where side effects that must happen before
3596 *EXPR_P should be stored. */
3598 static enum gimplify_status
3599 gimplify_save_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
3601 enum gimplify_status ret
= GS_ALL_DONE
;
3604 gcc_assert (TREE_CODE (*expr_p
) == SAVE_EXPR
);
3605 val
= TREE_OPERAND (*expr_p
, 0);
3607 /* If the SAVE_EXPR has not been resolved, then evaluate it once. */
3608 if (!SAVE_EXPR_RESOLVED_P (*expr_p
))
3610 /* The operand may be a void-valued expression such as SAVE_EXPRs
3611 generated by the Java frontend for class initialization. It is
3612 being executed only for its side-effects. */
3613 if (TREE_TYPE (val
) == void_type_node
)
3615 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
3616 is_gimple_stmt
, fb_none
);
3617 append_to_statement_list (TREE_OPERAND (*expr_p
, 0), pre_p
);
3621 val
= get_initialized_tmp_var (val
, pre_p
, post_p
);
3623 TREE_OPERAND (*expr_p
, 0) = val
;
3624 SAVE_EXPR_RESOLVED_P (*expr_p
) = 1;
3632 /* Re-write the ADDR_EXPR node pointed to by EXPR_P
3639 PRE_P points to the list where side effects that must happen before
3640 *EXPR_P should be stored.
3642 POST_P points to the list where side effects that must happen after
3643 *EXPR_P should be stored. */
3645 static enum gimplify_status
3646 gimplify_addr_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
3648 tree expr
= *expr_p
;
3649 tree op0
= TREE_OPERAND (expr
, 0);
3650 enum gimplify_status ret
;
3652 switch (TREE_CODE (op0
))
3655 case MISALIGNED_INDIRECT_REF
:
3657 /* Check if we are dealing with an expression of the form '&*ptr'.
3658 While the front end folds away '&*ptr' into 'ptr', these
3659 expressions may be generated internally by the compiler (e.g.,
3660 builtins like __builtin_va_end). */
3661 /* Caution: the silent array decomposition semantics we allow for
3662 ADDR_EXPR means we can't always discard the pair. */
3663 /* Gimplification of the ADDR_EXPR operand may drop
3664 cv-qualification conversions, so make sure we add them if
3667 tree op00
= TREE_OPERAND (op0
, 0);
3668 tree t_expr
= TREE_TYPE (expr
);
3669 tree t_op00
= TREE_TYPE (op00
);
3671 if (!lang_hooks
.types_compatible_p (t_expr
, t_op00
))
3673 #ifdef ENABLE_CHECKING
3674 tree t_op0
= TREE_TYPE (op0
);
3675 gcc_assert (POINTER_TYPE_P (t_expr
)
3676 && cpt_same_type (TREE_CODE (t_op0
) == ARRAY_TYPE
3677 ? TREE_TYPE (t_op0
) : t_op0
,
3679 && POINTER_TYPE_P (t_op00
)
3680 && cpt_same_type (t_op0
, TREE_TYPE (t_op00
)));
3682 op00
= fold_convert (TREE_TYPE (expr
), op00
);
3689 case VIEW_CONVERT_EXPR
:
3690 /* Take the address of our operand and then convert it to the type of
3693 ??? The interactions of VIEW_CONVERT_EXPR and aliasing is not at
3694 all clear. The impact of this transformation is even less clear. */
3696 /* If the operand is a useless conversion, look through it. Doing so
3697 guarantees that the ADDR_EXPR and its operand will remain of the
3699 if (tree_ssa_useless_type_conversion (TREE_OPERAND (op0
, 0)))
3700 op0
= TREE_OPERAND (op0
, 0);
3702 *expr_p
= fold_convert (TREE_TYPE (expr
),
3703 build_fold_addr_expr (TREE_OPERAND (op0
, 0)));
3708 /* We use fb_either here because the C frontend sometimes takes
3709 the address of a call that returns a struct; see
3710 gcc.dg/c99-array-lval-1.c. The gimplifier will correctly make
3711 the implied temporary explicit. */
3712 ret
= gimplify_expr (&TREE_OPERAND (expr
, 0), pre_p
, post_p
,
3713 is_gimple_addressable
, fb_either
);
3714 if (ret
!= GS_ERROR
)
3716 op0
= TREE_OPERAND (expr
, 0);
3718 /* For various reasons, the gimplification of the expression
3719 may have made a new INDIRECT_REF. */
3720 if (TREE_CODE (op0
) == INDIRECT_REF
)
3721 goto do_indirect_ref
;
3723 /* Make sure TREE_INVARIANT, TREE_CONSTANT, and TREE_SIDE_EFFECTS
3725 recompute_tree_invariant_for_addr_expr (expr
);
3727 /* Mark the RHS addressable. */
3728 lang_hooks
.mark_addressable (TREE_OPERAND (expr
, 0));
3736 /* Gimplify the operands of an ASM_EXPR. Input operands should be a gimple
3737 value; output operands should be a gimple lvalue. */
3739 static enum gimplify_status
3740 gimplify_asm_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
3742 tree expr
= *expr_p
;
3743 int noutputs
= list_length (ASM_OUTPUTS (expr
));
3744 const char **oconstraints
3745 = (const char **) alloca ((noutputs
) * sizeof (const char *));
3748 const char *constraint
;
3749 bool allows_mem
, allows_reg
, is_inout
;
3750 enum gimplify_status ret
, tret
;
3753 for (i
= 0, link
= ASM_OUTPUTS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
3755 size_t constraint_len
;
3756 oconstraints
[i
] = constraint
3757 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
3758 constraint_len
= strlen (constraint
);
3759 if (constraint_len
== 0)
3762 parse_output_constraint (&constraint
, i
, 0, 0,
3763 &allows_mem
, &allows_reg
, &is_inout
);
3765 if (!allows_reg
&& allows_mem
)
3766 lang_hooks
.mark_addressable (TREE_VALUE (link
));
3768 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
3769 is_inout
? is_gimple_min_lval
: is_gimple_lvalue
,
3770 fb_lvalue
| fb_mayfail
);
3771 if (tret
== GS_ERROR
)
3773 error ("invalid lvalue in asm output %d", i
);
3779 /* An input/output operand. To give the optimizers more
3780 flexibility, split it into separate input and output
3785 /* Turn the in/out constraint into an output constraint. */
3786 char *p
= xstrdup (constraint
);
3788 TREE_VALUE (TREE_PURPOSE (link
)) = build_string (constraint_len
, p
);
3790 /* And add a matching input constraint. */
3793 sprintf (buf
, "%d", i
);
3795 /* If there are multiple alternatives in the constraint,
3796 handle each of them individually. Those that allow register
3797 will be replaced with operand number, the others will stay
3799 if (strchr (p
, ',') != NULL
)
3801 size_t len
= 0, buflen
= strlen (buf
);
3802 char *beg
, *end
, *str
, *dst
;
3806 end
= strchr (beg
, ',');
3808 end
= strchr (beg
, '\0');
3809 if ((size_t) (end
- beg
) < buflen
)
3812 len
+= end
- beg
+ 1;
3819 str
= (char *) alloca (len
);
3820 for (beg
= p
+ 1, dst
= str
;;)
3823 bool mem_p
, reg_p
, inout_p
;
3825 end
= strchr (beg
, ',');
3830 parse_output_constraint (&tem
, i
, 0, 0,
3831 &mem_p
, ®_p
, &inout_p
);
3836 memcpy (dst
, buf
, buflen
);
3845 memcpy (dst
, beg
, len
);
3854 input
= build_string (dst
- str
, str
);
3857 input
= build_string (strlen (buf
), buf
);
3860 input
= build_string (constraint_len
- 1, constraint
+ 1);
3864 input
= build_tree_list (build_tree_list (NULL_TREE
, input
),
3865 unshare_expr (TREE_VALUE (link
)));
3866 ASM_INPUTS (expr
) = chainon (ASM_INPUTS (expr
), input
);
3870 for (link
= ASM_INPUTS (expr
); link
; ++i
, link
= TREE_CHAIN (link
))
3873 = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link
)));
3874 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
3875 oconstraints
, &allows_mem
, &allows_reg
);
3877 /* If the operand is a memory input, it should be an lvalue. */
3878 if (!allows_reg
&& allows_mem
)
3880 lang_hooks
.mark_addressable (TREE_VALUE (link
));
3881 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
3882 is_gimple_lvalue
, fb_lvalue
| fb_mayfail
);
3883 if (tret
== GS_ERROR
)
3885 error ("memory input %d is not directly addressable", i
);
3891 tret
= gimplify_expr (&TREE_VALUE (link
), pre_p
, post_p
,
3892 is_gimple_asm_val
, fb_rvalue
);
3893 if (tret
== GS_ERROR
)
3901 /* Gimplify a CLEANUP_POINT_EXPR. Currently this works by adding
3902 WITH_CLEANUP_EXPRs to the prequeue as we encounter cleanups while
3903 gimplifying the body, and converting them to TRY_FINALLY_EXPRs when we
3904 return to this function.
3906 FIXME should we complexify the prequeue handling instead? Or use flags
3907 for all the cleanups and let the optimizer tighten them up? The current
3908 code seems pretty fragile; it will break on a cleanup within any
3909 non-conditional nesting. But any such nesting would be broken, anyway;
3910 we can't write a TRY_FINALLY_EXPR that starts inside a nesting construct
3911 and continues out of it. We can do that at the RTL level, though, so
3912 having an optimizer to tighten up try/finally regions would be a Good
3915 static enum gimplify_status
3916 gimplify_cleanup_point_expr (tree
*expr_p
, tree
*pre_p
)
3918 tree_stmt_iterator iter
;
3921 tree temp
= voidify_wrapper_expr (*expr_p
, NULL
);
3923 /* We only care about the number of conditions between the innermost
3924 CLEANUP_POINT_EXPR and the cleanup. So save and reset the count and
3925 any cleanups collected outside the CLEANUP_POINT_EXPR. */
3926 int old_conds
= gimplify_ctxp
->conditions
;
3927 tree old_cleanups
= gimplify_ctxp
->conditional_cleanups
;
3928 gimplify_ctxp
->conditions
= 0;
3929 gimplify_ctxp
->conditional_cleanups
= NULL_TREE
;
3931 body
= TREE_OPERAND (*expr_p
, 0);
3932 gimplify_to_stmt_list (&body
);
3934 gimplify_ctxp
->conditions
= old_conds
;
3935 gimplify_ctxp
->conditional_cleanups
= old_cleanups
;
3937 for (iter
= tsi_start (body
); !tsi_end_p (iter
); )
3939 tree
*wce_p
= tsi_stmt_ptr (iter
);
3942 if (TREE_CODE (wce
) == WITH_CLEANUP_EXPR
)
3944 if (tsi_one_before_end_p (iter
))
3946 tsi_link_before (&iter
, TREE_OPERAND (wce
, 0), TSI_SAME_STMT
);
3953 enum tree_code code
;
3955 if (CLEANUP_EH_ONLY (wce
))
3956 code
= TRY_CATCH_EXPR
;
3958 code
= TRY_FINALLY_EXPR
;
3960 sl
= tsi_split_statement_list_after (&iter
);
3961 tfe
= build2 (code
, void_type_node
, sl
, NULL_TREE
);
3962 append_to_statement_list (TREE_OPERAND (wce
, 0),
3963 &TREE_OPERAND (tfe
, 1));
3965 iter
= tsi_start (sl
);
3975 append_to_statement_list (body
, pre_p
);
3985 /* Insert a cleanup marker for gimplify_cleanup_point_expr. CLEANUP
3986 is the cleanup action required. */
3989 gimple_push_cleanup (tree var
, tree cleanup
, bool eh_only
, tree
*pre_p
)
3993 /* Errors can result in improperly nested cleanups. Which results in
3994 confusion when trying to resolve the WITH_CLEANUP_EXPR. */
3995 if (errorcount
|| sorrycount
)
3998 if (gimple_conditional_context ())
4000 /* If we're in a conditional context, this is more complex. We only
4001 want to run the cleanup if we actually ran the initialization that
4002 necessitates it, but we want to run it after the end of the
4003 conditional context. So we wrap the try/finally around the
4004 condition and use a flag to determine whether or not to actually
4005 run the destructor. Thus
4009 becomes (approximately)
4013 if (test) { A::A(temp); flag = 1; val = f(temp); }
4016 if (flag) A::~A(temp);
4021 tree flag
= create_tmp_var (boolean_type_node
, "cleanup");
4022 tree ffalse
= build2 (MODIFY_EXPR
, void_type_node
, flag
,
4023 boolean_false_node
);
4024 tree ftrue
= build2 (MODIFY_EXPR
, void_type_node
, flag
,
4026 cleanup
= build3 (COND_EXPR
, void_type_node
, flag
, cleanup
, NULL
);
4027 wce
= build1 (WITH_CLEANUP_EXPR
, void_type_node
, cleanup
);
4028 append_to_statement_list (ffalse
, &gimplify_ctxp
->conditional_cleanups
);
4029 append_to_statement_list (wce
, &gimplify_ctxp
->conditional_cleanups
);
4030 append_to_statement_list (ftrue
, pre_p
);
4032 /* Because of this manipulation, and the EH edges that jump
4033 threading cannot redirect, the temporary (VAR) will appear
4034 to be used uninitialized. Don't warn. */
4035 TREE_NO_WARNING (var
) = 1;
4039 wce
= build1 (WITH_CLEANUP_EXPR
, void_type_node
, cleanup
);
4040 CLEANUP_EH_ONLY (wce
) = eh_only
;
4041 append_to_statement_list (wce
, pre_p
);
4044 gimplify_stmt (&TREE_OPERAND (wce
, 0));
4047 /* Gimplify a TARGET_EXPR which doesn't appear on the rhs of an INIT_EXPR. */
4049 static enum gimplify_status
4050 gimplify_target_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
)
4052 tree targ
= *expr_p
;
4053 tree temp
= TARGET_EXPR_SLOT (targ
);
4054 tree init
= TARGET_EXPR_INITIAL (targ
);
4055 enum gimplify_status ret
;
4059 /* TARGET_EXPR temps aren't part of the enclosing block, so add it
4060 to the temps list. */
4061 gimple_add_tmp_var (temp
);
4063 /* If TARGET_EXPR_INITIAL is void, then the mere evaluation of the
4064 expression is supposed to initialize the slot. */
4065 if (VOID_TYPE_P (TREE_TYPE (init
)))
4066 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
, fb_none
);
4069 /* Special handling for BIND_EXPR can result in fewer temps. */
4071 if (TREE_CODE (init
) == BIND_EXPR
)
4072 gimplify_bind_expr (&init
, temp
, pre_p
);
4075 init
= build2 (MODIFY_EXPR
, void_type_node
, temp
, init
);
4076 ret
= gimplify_expr (&init
, pre_p
, post_p
, is_gimple_stmt
,
4080 if (ret
== GS_ERROR
)
4082 append_to_statement_list (init
, pre_p
);
4084 /* If needed, push the cleanup for the temp. */
4085 if (TARGET_EXPR_CLEANUP (targ
))
4087 gimplify_stmt (&TARGET_EXPR_CLEANUP (targ
));
4088 gimple_push_cleanup (temp
, TARGET_EXPR_CLEANUP (targ
),
4089 CLEANUP_EH_ONLY (targ
), pre_p
);
4092 /* Only expand this once. */
4093 TREE_OPERAND (targ
, 3) = init
;
4094 TARGET_EXPR_INITIAL (targ
) = NULL_TREE
;
4097 /* We should have expanded this before. */
4098 gcc_assert (DECL_SEEN_IN_BIND_EXPR_P (temp
));
4104 /* Gimplification of expression trees. */
4106 /* Gimplify an expression which appears at statement context; usually, this
4107 means replacing it with a suitably gimple STATEMENT_LIST. */
4110 gimplify_stmt (tree
*stmt_p
)
4112 gimplify_expr (stmt_p
, NULL
, NULL
, is_gimple_stmt
, fb_none
);
4115 /* Similarly, but force the result to be a STATEMENT_LIST. */
4118 gimplify_to_stmt_list (tree
*stmt_p
)
4120 gimplify_stmt (stmt_p
);
4122 *stmt_p
= alloc_stmt_list ();
4123 else if (TREE_CODE (*stmt_p
) != STATEMENT_LIST
)
4126 *stmt_p
= alloc_stmt_list ();
4127 append_to_statement_list (t
, stmt_p
);
4132 /* Add FIRSTPRIVATE entries for DECL in the OpenMP the surrounding parallels
4133 to CTX. If entries already exist, force them to be some flavor of private.
4134 If there is no enclosing parallel, do nothing. */
4137 omp_firstprivatize_variable (struct gimplify_omp_ctx
*ctx
, tree decl
)
4141 if (decl
== NULL
|| !DECL_P (decl
))
4146 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
4149 if (n
->value
& GOVD_SHARED
)
4150 n
->value
= GOVD_FIRSTPRIVATE
| (n
->value
& GOVD_SEEN
);
4154 else if (ctx
->is_parallel
)
4155 omp_add_variable (ctx
, decl
, GOVD_FIRSTPRIVATE
);
4157 ctx
= ctx
->outer_context
;
4162 /* Similarly for each of the type sizes of TYPE. */
4165 omp_firstprivatize_type_sizes (struct gimplify_omp_ctx
*ctx
, tree type
)
4167 if (type
== NULL
|| type
== error_mark_node
)
4169 type
= TYPE_MAIN_VARIANT (type
);
4171 if (pointer_set_insert (ctx
->privatized_types
, type
))
4174 switch (TREE_CODE (type
))
4181 omp_firstprivatize_variable (ctx
, TYPE_MIN_VALUE (type
));
4182 omp_firstprivatize_variable (ctx
, TYPE_MAX_VALUE (type
));
4186 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
4187 omp_firstprivatize_type_sizes (ctx
, TYPE_DOMAIN (type
));
4192 case QUAL_UNION_TYPE
:
4195 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
4196 if (TREE_CODE (field
) == FIELD_DECL
)
4198 omp_firstprivatize_variable (ctx
, DECL_FIELD_OFFSET (field
));
4199 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (field
));
4205 case REFERENCE_TYPE
:
4206 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (type
));
4213 omp_firstprivatize_variable (ctx
, TYPE_SIZE (type
));
4214 omp_firstprivatize_variable (ctx
, TYPE_SIZE_UNIT (type
));
4215 lang_hooks
.types
.omp_firstprivatize_type_sizes (ctx
, type
);
4218 /* Add an entry for DECL in the OpenMP context CTX with FLAGS. */
4221 omp_add_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, unsigned int flags
)
4224 unsigned int nflags
;
4227 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
4230 /* Never elide decls whose type has TREE_ADDRESSABLE set. This means
4231 there are constructors involved somewhere. */
4232 if (TREE_ADDRESSABLE (TREE_TYPE (decl
))
4233 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
4236 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
4239 /* We shouldn't be re-adding the decl with the same data
4241 gcc_assert ((n
->value
& GOVD_DATA_SHARE_CLASS
& flags
) == 0);
4242 /* The only combination of data sharing classes we should see is
4243 FIRSTPRIVATE and LASTPRIVATE. */
4244 nflags
= n
->value
| flags
;
4245 gcc_assert ((nflags
& GOVD_DATA_SHARE_CLASS
)
4246 == (GOVD_FIRSTPRIVATE
| GOVD_LASTPRIVATE
));
4251 /* When adding a variable-sized variable, we have to handle all sorts
4252 of additional bits of data: the pointer replacement variable, and
4253 the parameters of the type. */
4254 if (!TREE_CONSTANT (DECL_SIZE (decl
)))
4256 /* Add the pointer replacement variable as PRIVATE if the variable
4257 replacement is private, else FIRSTPRIVATE since we'll need the
4258 address of the original variable either for SHARED, or for the
4259 copy into or out of the context. */
4260 if (!(flags
& GOVD_LOCAL
))
4262 nflags
= flags
& GOVD_PRIVATE
? GOVD_PRIVATE
: GOVD_FIRSTPRIVATE
;
4263 nflags
|= flags
& GOVD_SEEN
;
4264 t
= DECL_VALUE_EXPR (decl
);
4265 gcc_assert (TREE_CODE (t
) == INDIRECT_REF
);
4266 t
= TREE_OPERAND (t
, 0);
4267 gcc_assert (DECL_P (t
));
4268 omp_add_variable (ctx
, t
, nflags
);
4271 /* Add all of the variable and type parameters (which should have
4272 been gimplified to a formal temporary) as FIRSTPRIVATE. */
4273 omp_firstprivatize_variable (ctx
, DECL_SIZE_UNIT (decl
));
4274 omp_firstprivatize_variable (ctx
, DECL_SIZE (decl
));
4275 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
4277 /* The variable-sized variable itself is never SHARED, only some form
4278 of PRIVATE. The sharing would take place via the pointer variable
4279 which we remapped above. */
4280 if (flags
& GOVD_SHARED
)
4281 flags
= GOVD_PRIVATE
| GOVD_DEBUG_PRIVATE
4282 | (flags
& (GOVD_SEEN
| GOVD_EXPLICIT
));
4284 /* We're going to make use of the TYPE_SIZE_UNIT at least in the
4285 alloca statement we generate for the variable, so make sure it
4286 is available. This isn't automatically needed for the SHARED
4287 case, since we won't be allocating local storage then. */
4289 omp_notice_variable (ctx
, TYPE_SIZE_UNIT (TREE_TYPE (decl
)), true);
4291 else if (lang_hooks
.decls
.omp_privatize_by_reference (decl
))
4293 gcc_assert ((flags
& GOVD_LOCAL
) == 0);
4294 omp_firstprivatize_type_sizes (ctx
, TREE_TYPE (decl
));
4296 /* Similar to the direct variable sized case above, we'll need the
4297 size of references being privatized. */
4298 if ((flags
& GOVD_SHARED
) == 0)
4300 t
= TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (decl
)));
4301 if (!TREE_CONSTANT (t
))
4302 omp_notice_variable (ctx
, t
, true);
4306 splay_tree_insert (ctx
->variables
, (splay_tree_key
)decl
, flags
);
4309 /* Record the fact that DECL was used within the OpenMP context CTX.
4310 IN_CODE is true when real code uses DECL, and false when we should
4311 merely emit default(none) errors. Return true if DECL is going to
4312 be remapped and thus DECL shouldn't be gimplified into its
4313 DECL_VALUE_EXPR (if any). */
4316 omp_notice_variable (struct gimplify_omp_ctx
*ctx
, tree decl
, bool in_code
)
4319 unsigned flags
= in_code
? GOVD_SEEN
: 0;
4320 bool ret
= false, shared
;
4322 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
4325 /* Threadprivate variables are predetermined. */
4326 if (is_global_var (decl
))
4328 if (DECL_THREAD_LOCAL_P (decl
))
4331 if (DECL_HAS_VALUE_EXPR_P (decl
))
4333 tree value
= get_base_address (DECL_VALUE_EXPR (decl
));
4335 if (value
&& DECL_P (value
) && DECL_THREAD_LOCAL_P (value
))
4340 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
4343 enum omp_clause_default_kind default_kind
, kind
;
4345 if (!ctx
->is_parallel
)
4348 /* ??? Some compiler-generated variables (like SAVE_EXPRs) could be
4349 remapped firstprivate instead of shared. To some extent this is
4350 addressed in omp_firstprivatize_type_sizes, but not effectively. */
4351 default_kind
= ctx
->default_kind
;
4352 kind
= lang_hooks
.decls
.omp_predetermined_sharing (decl
);
4353 if (kind
!= OMP_CLAUSE_DEFAULT_UNSPECIFIED
)
4354 default_kind
= kind
;
4356 switch (default_kind
)
4358 case OMP_CLAUSE_DEFAULT_NONE
:
4359 error ("%qs not specified in enclosing parallel",
4360 IDENTIFIER_POINTER (DECL_NAME (decl
)));
4361 error ("%Henclosing parallel", &ctx
->location
);
4363 case OMP_CLAUSE_DEFAULT_SHARED
:
4364 flags
|= GOVD_SHARED
;
4366 case OMP_CLAUSE_DEFAULT_PRIVATE
:
4367 flags
|= GOVD_PRIVATE
;
4373 omp_add_variable (ctx
, decl
, flags
);
4375 shared
= (flags
& GOVD_SHARED
) != 0;
4376 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
4380 shared
= ((flags
| n
->value
) & GOVD_SHARED
) != 0;
4381 ret
= lang_hooks
.decls
.omp_disregard_value_expr (decl
, shared
);
4383 /* If nothing changed, there's nothing left to do. */
4384 if ((n
->value
& flags
) == flags
)
4390 /* If the variable is private in the current context, then we don't
4391 need to propagate anything to an outer context. */
4392 if (flags
& GOVD_PRIVATE
)
4394 if (ctx
->outer_context
4395 && omp_notice_variable (ctx
->outer_context
, decl
, in_code
))
4400 /* Verify that DECL is private within CTX. If there's specific information
4401 to the contrary in the innermost scope, generate an error. */
4404 omp_is_private (struct gimplify_omp_ctx
*ctx
, tree decl
)
4408 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
)decl
);
4411 if (n
->value
& GOVD_SHARED
)
4413 if (ctx
== gimplify_omp_ctxp
)
4414 error ("iteration variable %qs should be private",
4415 IDENTIFIER_POINTER (DECL_NAME (decl
)));
4416 n
->value
= GOVD_PRIVATE
;
4421 if (ctx
->outer_context
)
4422 return omp_is_private (ctx
->outer_context
, decl
);
4423 else if (ctx
->is_parallel
)
4426 return !is_global_var (decl
);
4429 /* Scan the OpenMP clauses in *LIST_P, installing mappings into a new
4430 and previous omp contexts. */
4433 gimplify_scan_omp_clauses (tree
*list_p
, tree
*pre_p
, bool in_parallel
)
4435 struct gimplify_omp_ctx
*ctx
, *outer_ctx
;
4438 ctx
= new_omp_context (in_parallel
);
4439 outer_ctx
= ctx
->outer_context
;
4441 while ((c
= *list_p
) != NULL
)
4443 enum gimplify_status gs
;
4444 bool remove
= false;
4445 bool notice_outer
= true;
4449 switch (OMP_CLAUSE_CODE (c
))
4451 case OMP_CLAUSE_PRIVATE
:
4452 flags
= GOVD_PRIVATE
| GOVD_EXPLICIT
;
4453 notice_outer
= false;
4455 case OMP_CLAUSE_SHARED
:
4456 flags
= GOVD_SHARED
| GOVD_EXPLICIT
;
4458 case OMP_CLAUSE_FIRSTPRIVATE
:
4459 flags
= GOVD_FIRSTPRIVATE
| GOVD_EXPLICIT
;
4461 case OMP_CLAUSE_LASTPRIVATE
:
4462 flags
= GOVD_LASTPRIVATE
| GOVD_SEEN
| GOVD_EXPLICIT
;
4464 case OMP_CLAUSE_REDUCTION
:
4465 flags
= GOVD_REDUCTION
| GOVD_SEEN
| GOVD_EXPLICIT
;
4469 decl
= OMP_CLAUSE_DECL (c
);
4470 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
4475 omp_add_variable (ctx
, decl
, flags
);
4476 if (TREE_CODE (c
) == OMP_CLAUSE_REDUCTION
4477 && OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
))
4479 omp_add_variable (ctx
, OMP_CLAUSE_REDUCTION_PLACEHOLDER (c
),
4481 gimplify_omp_ctxp
= ctx
;
4482 push_gimplify_context ();
4483 gimplify_stmt (&OMP_CLAUSE_REDUCTION_INIT (c
));
4484 pop_gimplify_context (OMP_CLAUSE_REDUCTION_INIT (c
));
4485 push_gimplify_context ();
4486 gimplify_stmt (&OMP_CLAUSE_REDUCTION_MERGE (c
));
4487 pop_gimplify_context (OMP_CLAUSE_REDUCTION_MERGE (c
));
4488 gimplify_omp_ctxp
= outer_ctx
;
4494 case OMP_CLAUSE_COPYIN
:
4495 case OMP_CLAUSE_COPYPRIVATE
:
4496 decl
= OMP_CLAUSE_DECL (c
);
4497 if (decl
== error_mark_node
|| TREE_TYPE (decl
) == error_mark_node
)
4504 omp_notice_variable (outer_ctx
, decl
, true);
4507 case OMP_CLAUSE_SCHEDULE
:
4509 case OMP_CLAUSE_NUM_THREADS
:
4510 gs
= gimplify_expr (&OMP_CLAUSE_OPERAND (c
, 0), pre_p
, NULL
,
4511 is_gimple_val
, fb_rvalue
);
4516 case OMP_CLAUSE_NOWAIT
:
4517 case OMP_CLAUSE_ORDERED
:
4520 case OMP_CLAUSE_DEFAULT
:
4521 ctx
->default_kind
= OMP_CLAUSE_DEFAULT_KIND (c
);
4529 *list_p
= OMP_CLAUSE_CHAIN (c
);
4531 list_p
= &OMP_CLAUSE_CHAIN (c
);
4534 gimplify_omp_ctxp
= ctx
;
4537 /* For all variables that were not actually used within the context,
4538 remove PRIVATE, SHARED, and FIRSTPRIVATE clauses. */
4541 gimplify_adjust_omp_clauses_1 (splay_tree_node n
, void *data
)
4543 tree
*list_p
= (tree
*) data
;
4544 tree decl
= (tree
) n
->key
;
4545 unsigned flags
= n
->value
;
4546 enum omp_clause_code code
;
4550 if (flags
& (GOVD_EXPLICIT
| GOVD_LOCAL
))
4552 if ((flags
& GOVD_SEEN
) == 0)
4554 if (flags
& GOVD_DEBUG_PRIVATE
)
4556 gcc_assert ((flags
& GOVD_DATA_SHARE_CLASS
) == GOVD_PRIVATE
);
4557 private_debug
= true;
4561 = lang_hooks
.decls
.omp_private_debug_clause (decl
,
4562 !!(flags
& GOVD_SHARED
));
4564 code
= OMP_CLAUSE_PRIVATE
;
4565 else if (flags
& GOVD_SHARED
)
4567 if (is_global_var (decl
))
4569 code
= OMP_CLAUSE_SHARED
;
4571 else if (flags
& GOVD_PRIVATE
)
4572 code
= OMP_CLAUSE_PRIVATE
;
4573 else if (flags
& GOVD_FIRSTPRIVATE
)
4574 code
= OMP_CLAUSE_FIRSTPRIVATE
;
4578 clause
= build_omp_clause (code
);
4579 OMP_CLAUSE_DECL (clause
) = decl
;
4580 OMP_CLAUSE_CHAIN (clause
) = *list_p
;
4582 OMP_CLAUSE_PRIVATE_DEBUG (clause
) = 1;
4589 gimplify_adjust_omp_clauses (tree
*list_p
)
4591 struct gimplify_omp_ctx
*ctx
= gimplify_omp_ctxp
;
4594 while ((c
= *list_p
) != NULL
)
4597 bool remove
= false;
4599 switch (OMP_CLAUSE_CODE (c
))
4601 case OMP_CLAUSE_PRIVATE
:
4602 case OMP_CLAUSE_SHARED
:
4603 case OMP_CLAUSE_FIRSTPRIVATE
:
4604 decl
= OMP_CLAUSE_DECL (c
);
4605 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
4606 remove
= !(n
->value
& GOVD_SEEN
);
4609 bool shared
= OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_SHARED
;
4610 if ((n
->value
& GOVD_DEBUG_PRIVATE
)
4611 || lang_hooks
.decls
.omp_private_debug_clause (decl
, shared
))
4613 gcc_assert ((n
->value
& GOVD_DEBUG_PRIVATE
) == 0
4614 || ((n
->value
& GOVD_DATA_SHARE_CLASS
)
4616 OMP_CLAUSE_SET_CODE (c
, OMP_CLAUSE_PRIVATE
);
4617 OMP_CLAUSE_PRIVATE_DEBUG (c
) = 1;
4622 case OMP_CLAUSE_LASTPRIVATE
:
4623 /* Make sure OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE is set to
4624 accurately reflect the presence of a FIRSTPRIVATE clause. */
4625 decl
= OMP_CLAUSE_DECL (c
);
4626 n
= splay_tree_lookup (ctx
->variables
, (splay_tree_key
) decl
);
4627 OMP_CLAUSE_LASTPRIVATE_FIRSTPRIVATE (c
)
4628 = (n
->value
& GOVD_FIRSTPRIVATE
) != 0;
4631 case OMP_CLAUSE_REDUCTION
:
4632 case OMP_CLAUSE_COPYIN
:
4633 case OMP_CLAUSE_COPYPRIVATE
:
4635 case OMP_CLAUSE_NUM_THREADS
:
4636 case OMP_CLAUSE_SCHEDULE
:
4637 case OMP_CLAUSE_NOWAIT
:
4638 case OMP_CLAUSE_ORDERED
:
4639 case OMP_CLAUSE_DEFAULT
:
4647 *list_p
= OMP_CLAUSE_CHAIN (c
);
4649 list_p
= &OMP_CLAUSE_CHAIN (c
);
4652 /* Add in any implicit data sharing. */
4653 splay_tree_foreach (ctx
->variables
, gimplify_adjust_omp_clauses_1
, list_p
);
4655 gimplify_omp_ctxp
= ctx
->outer_context
;
4656 delete_omp_context (ctx
);
4659 /* Gimplify the contents of an OMP_PARALLEL statement. This involves
4660 gimplification of the body, as well as scanning the body for used
4661 variables. We need to do this scan now, because variable-sized
4662 decls will be decomposed during gimplification. */
4664 static enum gimplify_status
4665 gimplify_omp_parallel (tree
*expr_p
, tree
*pre_p
)
4667 tree expr
= *expr_p
;
4669 gimplify_scan_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
), pre_p
, true);
4671 push_gimplify_context ();
4673 gimplify_stmt (&OMP_PARALLEL_BODY (expr
));
4675 if (TREE_CODE (OMP_PARALLEL_BODY (expr
)) == BIND_EXPR
)
4676 pop_gimplify_context (OMP_PARALLEL_BODY (expr
));
4678 pop_gimplify_context (NULL_TREE
);
4680 gimplify_adjust_omp_clauses (&OMP_PARALLEL_CLAUSES (expr
));
4685 /* Gimplify the gross structure of an OMP_FOR statement. */
4687 static enum gimplify_status
4688 gimplify_omp_for (tree
*expr_p
, tree
*pre_p
)
4690 tree for_stmt
, decl
, t
;
4691 enum gimplify_status ret
= 0;
4695 gimplify_scan_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
), pre_p
, false);
4697 t
= OMP_FOR_INIT (for_stmt
);
4698 gcc_assert (TREE_CODE (t
) == MODIFY_EXPR
);
4699 decl
= TREE_OPERAND (t
, 0);
4700 gcc_assert (DECL_P (decl
));
4701 gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (decl
)));
4702 gcc_assert (!TYPE_UNSIGNED (TREE_TYPE (decl
)));
4704 /* Make sure the iteration variable is private. */
4705 if (omp_is_private (gimplify_omp_ctxp
, decl
))
4706 omp_notice_variable (gimplify_omp_ctxp
, decl
, true);
4708 omp_add_variable (gimplify_omp_ctxp
, decl
, GOVD_PRIVATE
| GOVD_SEEN
);
4710 ret
|= gimplify_expr (&TREE_OPERAND (t
, 1), &OMP_FOR_PRE_BODY (for_stmt
),
4711 NULL
, is_gimple_val
, fb_rvalue
);
4713 t
= OMP_FOR_COND (for_stmt
);
4714 gcc_assert (COMPARISON_CLASS_P (t
));
4715 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
4717 ret
|= gimplify_expr (&TREE_OPERAND (t
, 1), &OMP_FOR_PRE_BODY (for_stmt
),
4718 NULL
, is_gimple_val
, fb_rvalue
);
4720 t
= OMP_FOR_INCR (for_stmt
);
4721 switch (TREE_CODE (t
))
4723 case PREINCREMENT_EXPR
:
4724 case POSTINCREMENT_EXPR
:
4725 t
= build_int_cst (TREE_TYPE (decl
), 1);
4727 case PREDECREMENT_EXPR
:
4728 case POSTDECREMENT_EXPR
:
4729 t
= build_int_cst (TREE_TYPE (decl
), -1);
4732 t
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), decl
, t
);
4733 t
= build2 (MODIFY_EXPR
, void_type_node
, decl
, t
);
4734 OMP_FOR_INCR (for_stmt
) = t
;
4738 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
4739 t
= TREE_OPERAND (t
, 1);
4740 switch (TREE_CODE (t
))
4743 if (TREE_OPERAND (t
, 1) == decl
)
4745 TREE_OPERAND (t
, 1) = TREE_OPERAND (t
, 0);
4746 TREE_OPERAND (t
, 0) = decl
;
4750 gcc_assert (TREE_OPERAND (t
, 0) == decl
);
4756 ret
|= gimplify_expr (&TREE_OPERAND (t
, 1), &OMP_FOR_PRE_BODY (for_stmt
),
4757 NULL
, is_gimple_val
, fb_rvalue
);
4764 gimplify_to_stmt_list (&OMP_FOR_BODY (for_stmt
));
4765 gimplify_adjust_omp_clauses (&OMP_FOR_CLAUSES (for_stmt
));
4767 return ret
== GS_ALL_DONE
? GS_ALL_DONE
: GS_ERROR
;
4770 /* Gimplify the gross structure of other OpenMP worksharing constructs.
4771 In particular, OMP_SECTIONS and OMP_SINGLE. */
4773 static enum gimplify_status
4774 gimplify_omp_workshare (tree
*expr_p
, tree
*pre_p
)
4776 tree stmt
= *expr_p
;
4778 gimplify_scan_omp_clauses (&OMP_CLAUSES (stmt
), pre_p
, false);
4779 gimplify_to_stmt_list (&OMP_BODY (stmt
));
4780 gimplify_adjust_omp_clauses (&OMP_CLAUSES (stmt
));
4785 /* A subroutine of gimplify_omp_atomic. The front end is supposed to have
4786 stabilized the lhs of the atomic operation as *ADDR. Return true if
4787 EXPR is this stabilized form. */
4790 goa_lhs_expr_p (tree expr
, tree addr
)
4792 /* Also include casts to other type variants. The C front end is fond
4793 of adding these for e.g. volatile variables. This is like
4794 STRIP_TYPE_NOPS but includes the main variant lookup. */
4795 while ((TREE_CODE (expr
) == NOP_EXPR
4796 || TREE_CODE (expr
) == CONVERT_EXPR
4797 || TREE_CODE (expr
) == NON_LVALUE_EXPR
)
4798 && TREE_OPERAND (expr
, 0) != error_mark_node
4799 && (TYPE_MAIN_VARIANT (TREE_TYPE (expr
))
4800 == TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (expr
, 0)))))
4801 expr
= TREE_OPERAND (expr
, 0);
4803 if (TREE_CODE (expr
) == INDIRECT_REF
&& TREE_OPERAND (expr
, 0) == addr
)
4805 if (TREE_CODE (addr
) == ADDR_EXPR
&& expr
== TREE_OPERAND (addr
, 0))
4810 /* A subroutine of gimplify_omp_atomic. Attempt to implement the atomic
4811 operation as a __sync_fetch_and_op builtin. INDEX is log2 of the
4812 size of the data type, and thus usable to find the index of the builtin
4813 decl. Returns GS_UNHANDLED if the expression is not of the proper form. */
4815 static enum gimplify_status
4816 gimplify_omp_atomic_fetch_op (tree
*expr_p
, tree addr
, tree rhs
, int index
)
4818 enum built_in_function base
;
4819 tree decl
, args
, itype
;
4820 enum insn_code
*optab
;
4822 /* Check for one of the supported fetch-op operations. */
4823 switch (TREE_CODE (rhs
))
4826 base
= BUILT_IN_FETCH_AND_ADD_N
;
4827 optab
= sync_add_optab
;
4830 base
= BUILT_IN_FETCH_AND_SUB_N
;
4831 optab
= sync_add_optab
;
4834 base
= BUILT_IN_FETCH_AND_AND_N
;
4835 optab
= sync_and_optab
;
4838 base
= BUILT_IN_FETCH_AND_OR_N
;
4839 optab
= sync_ior_optab
;
4842 base
= BUILT_IN_FETCH_AND_XOR_N
;
4843 optab
= sync_xor_optab
;
4846 return GS_UNHANDLED
;
4849 /* Make sure the expression is of the proper form. */
4850 if (goa_lhs_expr_p (TREE_OPERAND (rhs
, 0), addr
))
4851 rhs
= TREE_OPERAND (rhs
, 1);
4852 else if (commutative_tree_code (TREE_CODE (rhs
))
4853 && goa_lhs_expr_p (TREE_OPERAND (rhs
, 1), addr
))
4854 rhs
= TREE_OPERAND (rhs
, 0);
4856 return GS_UNHANDLED
;
4858 decl
= built_in_decls
[base
+ index
+ 1];
4859 itype
= TREE_TYPE (TREE_TYPE (decl
));
4861 if (optab
[TYPE_MODE (itype
)] == CODE_FOR_nothing
)
4862 return GS_UNHANDLED
;
4864 args
= tree_cons (NULL
, fold_convert (itype
, rhs
), NULL
);
4865 args
= tree_cons (NULL
, addr
, args
);
4866 *expr_p
= build_function_call_expr (decl
, args
);
4870 /* A subroutine of gimplify_omp_atomic_pipeline. Walk *EXPR_P and replace
4871 appearences of *LHS_ADDR with LHS_VAR. If an expression does not involve
4872 the lhs, evaluate it into a temporary. Return 1 if the lhs appeared as
4873 a subexpression, 0 if it did not, or -1 if an error was encountered. */
4876 goa_stabilize_expr (tree
*expr_p
, tree
*pre_p
, tree lhs_addr
, tree lhs_var
)
4878 tree expr
= *expr_p
;
4881 if (goa_lhs_expr_p (expr
, lhs_addr
))
4886 if (is_gimple_val (expr
))
4890 switch (TREE_CODE_CLASS (TREE_CODE (expr
)))
4893 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 1), pre_p
,
4896 saw_lhs
|= goa_stabilize_expr (&TREE_OPERAND (expr
, 0), pre_p
,
4905 enum gimplify_status gs
;
4906 gs
= gimplify_expr (expr_p
, pre_p
, NULL
, is_gimple_val
, fb_rvalue
);
4907 if (gs
!= GS_ALL_DONE
)
4914 /* A subroutine of gimplify_omp_atomic. Implement the atomic operation as:
4918 newval = rhs; // with oldval replacing *addr in rhs
4919 oldval = __sync_val_compare_and_swap (addr, oldval, newval);
4920 if (oldval != newval)
4923 INDEX is log2 of the size of the data type, and thus usable to find the
4924 index of the builtin decl. */
4926 static enum gimplify_status
4927 gimplify_omp_atomic_pipeline (tree
*expr_p
, tree
*pre_p
, tree addr
,
4928 tree rhs
, int index
)
4930 tree oldval
, oldival
, oldival2
, newval
, newival
, label
;
4931 tree type
, itype
, cmpxchg
, args
, x
, iaddr
;
4933 cmpxchg
= built_in_decls
[BUILT_IN_VAL_COMPARE_AND_SWAP_N
+ index
+ 1];
4934 type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr
)));
4935 itype
= TREE_TYPE (TREE_TYPE (cmpxchg
));
4937 if (sync_compare_and_swap
[TYPE_MODE (itype
)] == CODE_FOR_nothing
)
4938 return GS_UNHANDLED
;
4940 oldval
= create_tmp_var (type
, NULL
);
4941 newval
= create_tmp_var (type
, NULL
);
4943 /* Precompute as much of RHS as possible. In the same walk, replace
4944 occurrences of the lhs value with our temporary. */
4945 if (goa_stabilize_expr (&rhs
, pre_p
, addr
, oldval
) < 0)
4948 x
= build_fold_indirect_ref (addr
);
4949 x
= build2 (MODIFY_EXPR
, void_type_node
, oldval
, x
);
4950 gimplify_and_add (x
, pre_p
);
4952 /* For floating-point values, we'll need to view-convert them to integers
4953 so that we can perform the atomic compare and swap. Simplify the
4954 following code by always setting up the "i"ntegral variables. */
4955 if (INTEGRAL_TYPE_P (type
) || POINTER_TYPE_P (type
))
4963 oldival
= create_tmp_var (itype
, NULL
);
4964 newival
= create_tmp_var (itype
, NULL
);
4966 x
= build1 (VIEW_CONVERT_EXPR
, itype
, oldval
);
4967 x
= build2 (MODIFY_EXPR
, void_type_node
, oldival
, x
);
4968 gimplify_and_add (x
, pre_p
);
4969 iaddr
= fold_convert (build_pointer_type (itype
), addr
);
4972 oldival2
= create_tmp_var (itype
, NULL
);
4974 label
= create_artificial_label ();
4975 x
= build1 (LABEL_EXPR
, void_type_node
, label
);
4976 gimplify_and_add (x
, pre_p
);
4978 x
= build2 (MODIFY_EXPR
, void_type_node
, newval
, rhs
);
4979 gimplify_and_add (x
, pre_p
);
4981 if (newval
!= newival
)
4983 x
= build1 (VIEW_CONVERT_EXPR
, itype
, newval
);
4984 x
= build2 (MODIFY_EXPR
, void_type_node
, newival
, x
);
4985 gimplify_and_add (x
, pre_p
);
4988 x
= build2 (MODIFY_EXPR
, void_type_node
, oldival2
, oldival
);
4989 gimplify_and_add (x
, pre_p
);
4991 args
= tree_cons (NULL
, fold_convert (itype
, newival
), NULL
);
4992 args
= tree_cons (NULL
, fold_convert (itype
, oldival
), args
);
4993 args
= tree_cons (NULL
, iaddr
, args
);
4994 x
= build_function_call_expr (cmpxchg
, args
);
4995 if (oldval
== oldival
)
4996 x
= fold_convert (type
, x
);
4997 x
= build2 (MODIFY_EXPR
, void_type_node
, oldival
, x
);
4998 gimplify_and_add (x
, pre_p
);
5000 /* For floating point, be prepared for the loop backedge. */
5001 if (oldval
!= oldival
)
5003 x
= build1 (VIEW_CONVERT_EXPR
, type
, oldival
);
5004 x
= build2 (MODIFY_EXPR
, void_type_node
, oldval
, x
);
5005 gimplify_and_add (x
, pre_p
);
5008 /* Note that we always perform the comparison as an integer, even for
5009 floating point. This allows the atomic operation to properly
5010 succeed even with NaNs and -0.0. */
5011 x
= build3 (COND_EXPR
, void_type_node
,
5012 build2 (NE_EXPR
, boolean_type_node
, oldival
, oldival2
),
5013 build1 (GOTO_EXPR
, void_type_node
, label
), NULL
);
5014 gimplify_and_add (x
, pre_p
);
5020 /* A subroutine of gimplify_omp_atomic. Implement the atomic operation as:
5022 GOMP_atomic_start ();
5026 The result is not globally atomic, but works so long as all parallel
5027 references are within #pragma omp atomic directives. According to
5028 responses received from omp@openmp.org, appears to be within spec.
5029 Which makes sense, since that's how several other compilers handle
5030 this situation as well. */
5032 static enum gimplify_status
5033 gimplify_omp_atomic_mutex (tree
*expr_p
, tree
*pre_p
, tree addr
, tree rhs
)
5037 t
= built_in_decls
[BUILT_IN_GOMP_ATOMIC_START
];
5038 t
= build_function_call_expr (t
, NULL
);
5039 gimplify_and_add (t
, pre_p
);
5041 t
= build_fold_indirect_ref (addr
);
5042 t
= build2 (MODIFY_EXPR
, void_type_node
, t
, rhs
);
5043 gimplify_and_add (t
, pre_p
);
5045 t
= built_in_decls
[BUILT_IN_GOMP_ATOMIC_END
];
5046 t
= build_function_call_expr (t
, NULL
);
5047 gimplify_and_add (t
, pre_p
);
5053 /* Gimplify an OMP_ATOMIC statement. */
5055 static enum gimplify_status
5056 gimplify_omp_atomic (tree
*expr_p
, tree
*pre_p
)
5058 tree addr
= TREE_OPERAND (*expr_p
, 0);
5059 tree rhs
= TREE_OPERAND (*expr_p
, 1);
5060 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (addr
)));
5061 HOST_WIDE_INT index
;
5063 /* Make sure the type is one of the supported sizes. */
5064 index
= tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
5065 index
= exact_log2 (index
);
5066 if (index
>= 0 && index
<= 4)
5068 enum gimplify_status gs
;
5071 if (DECL_P (TREE_OPERAND (addr
, 0)))
5072 align
= DECL_ALIGN_UNIT (TREE_OPERAND (addr
, 0));
5073 else if (TREE_CODE (TREE_OPERAND (addr
, 0)) == COMPONENT_REF
5074 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (addr
, 0), 1))
5076 align
= DECL_ALIGN_UNIT (TREE_OPERAND (TREE_OPERAND (addr
, 0), 1));
5078 align
= TYPE_ALIGN_UNIT (type
);
5080 /* __sync builtins require strict data alignment. */
5081 if (exact_log2 (align
) >= index
)
5083 /* When possible, use specialized atomic update functions. */
5084 if (INTEGRAL_TYPE_P (type
) || POINTER_TYPE_P (type
))
5086 gs
= gimplify_omp_atomic_fetch_op (expr_p
, addr
, rhs
, index
);
5087 if (gs
!= GS_UNHANDLED
)
5091 /* If we don't have specialized __sync builtins, try and implement
5092 as a compare and swap loop. */
5093 gs
= gimplify_omp_atomic_pipeline (expr_p
, pre_p
, addr
, rhs
, index
);
5094 if (gs
!= GS_UNHANDLED
)
5099 /* The ultimate fallback is wrapping the operation in a mutex. */
5100 return gimplify_omp_atomic_mutex (expr_p
, pre_p
, addr
, rhs
);
5103 /* Gimplifies the expression tree pointed to by EXPR_P. Return 0 if
5104 gimplification failed.
5106 PRE_P points to the list where side effects that must happen before
5107 EXPR should be stored.
5109 POST_P points to the list where side effects that must happen after
5110 EXPR should be stored, or NULL if there is no suitable list. In
5111 that case, we copy the result to a temporary, emit the
5112 post-effects, and then return the temporary.
5114 GIMPLE_TEST_F points to a function that takes a tree T and
5115 returns nonzero if T is in the GIMPLE form requested by the
5116 caller. The GIMPLE predicates are in tree-gimple.c.
5118 This test is used twice. Before gimplification, the test is
5119 invoked to determine whether *EXPR_P is already gimple enough. If
5120 that fails, *EXPR_P is gimplified according to its code and
5121 GIMPLE_TEST_F is called again. If the test still fails, then a new
5122 temporary variable is created and assigned the value of the
5123 gimplified expression.
5125 FALLBACK tells the function what sort of a temporary we want. If the 1
5126 bit is set, an rvalue is OK. If the 2 bit is set, an lvalue is OK.
5127 If both are set, either is OK, but an lvalue is preferable.
5129 The return value is either GS_ERROR or GS_ALL_DONE, since this function
5130 iterates until solution. */
5132 enum gimplify_status
5133 gimplify_expr (tree
*expr_p
, tree
*pre_p
, tree
*post_p
,
5134 bool (* gimple_test_f
) (tree
), fallback_t fallback
)
5137 tree internal_pre
= NULL_TREE
;
5138 tree internal_post
= NULL_TREE
;
5140 int is_statement
= (pre_p
== NULL
);
5141 location_t saved_location
;
5142 enum gimplify_status ret
;
5144 save_expr
= *expr_p
;
5145 if (save_expr
== NULL_TREE
)
5148 /* We used to check the predicate here and return immediately if it
5149 succeeds. This is wrong; the design is for gimplification to be
5150 idempotent, and for the predicates to only test for valid forms, not
5151 whether they are fully simplified. */
5153 /* Set up our internal queues if needed. */
5155 pre_p
= &internal_pre
;
5157 post_p
= &internal_post
;
5159 saved_location
= input_location
;
5160 if (save_expr
!= error_mark_node
5161 && EXPR_HAS_LOCATION (*expr_p
))
5162 input_location
= EXPR_LOCATION (*expr_p
);
5164 /* Loop over the specific gimplifiers until the toplevel node
5165 remains the same. */
5168 /* Strip away as many useless type conversions as possible
5170 STRIP_USELESS_TYPE_CONVERSION (*expr_p
);
5172 /* Remember the expr. */
5173 save_expr
= *expr_p
;
5175 /* Die, die, die, my darling. */
5176 if (save_expr
== error_mark_node
5177 || (TREE_TYPE (save_expr
)
5178 && TREE_TYPE (save_expr
) == error_mark_node
))
5184 /* Do any language-specific gimplification. */
5185 ret
= lang_hooks
.gimplify_expr (expr_p
, pre_p
, post_p
);
5188 if (*expr_p
== NULL_TREE
)
5190 if (*expr_p
!= save_expr
)
5193 else if (ret
!= GS_UNHANDLED
)
5197 switch (TREE_CODE (*expr_p
))
5199 /* First deal with the special cases. */
5201 case POSTINCREMENT_EXPR
:
5202 case POSTDECREMENT_EXPR
:
5203 case PREINCREMENT_EXPR
:
5204 case PREDECREMENT_EXPR
:
5205 ret
= gimplify_self_mod_expr (expr_p
, pre_p
, post_p
,
5206 fallback
!= fb_none
);
5210 case ARRAY_RANGE_REF
:
5214 case VIEW_CONVERT_EXPR
:
5215 ret
= gimplify_compound_lval (expr_p
, pre_p
, post_p
,
5216 fallback
? fallback
: fb_rvalue
);
5220 ret
= gimplify_cond_expr (expr_p
, pre_p
, post_p
, NULL_TREE
,
5222 /* C99 code may assign to an array in a structure value of a
5223 conditional expression, and this has undefined behavior
5224 only on execution, so create a temporary if an lvalue is
5226 if (fallback
== fb_lvalue
)
5228 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
5229 lang_hooks
.mark_addressable (*expr_p
);
5234 ret
= gimplify_call_expr (expr_p
, pre_p
, fallback
!= fb_none
);
5235 /* C99 code may assign to an array in a structure returned
5236 from a function, and this has undefined behavior only on
5237 execution, so create a temporary if an lvalue is
5239 if (fallback
== fb_lvalue
)
5241 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
5242 lang_hooks
.mark_addressable (*expr_p
);
5250 ret
= gimplify_compound_expr (expr_p
, pre_p
, fallback
!= fb_none
);
5255 ret
= gimplify_modify_expr (expr_p
, pre_p
, post_p
,
5256 fallback
!= fb_none
);
5259 case TRUTH_ANDIF_EXPR
:
5260 case TRUTH_ORIF_EXPR
:
5261 ret
= gimplify_boolean_expr (expr_p
);
5264 case TRUTH_NOT_EXPR
:
5265 TREE_OPERAND (*expr_p
, 0)
5266 = gimple_boolify (TREE_OPERAND (*expr_p
, 0));
5267 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5268 is_gimple_val
, fb_rvalue
);
5269 recalculate_side_effects (*expr_p
);
5273 ret
= gimplify_addr_expr (expr_p
, pre_p
, post_p
);
5277 ret
= gimplify_va_arg_expr (expr_p
, pre_p
, post_p
);
5282 if (IS_EMPTY_STMT (*expr_p
))
5288 if (VOID_TYPE_P (TREE_TYPE (*expr_p
))
5289 || fallback
== fb_none
)
5291 /* Just strip a conversion to void (or in void context) and
5293 *expr_p
= TREE_OPERAND (*expr_p
, 0);
5297 ret
= gimplify_conversion (expr_p
);
5298 if (ret
== GS_ERROR
)
5300 if (*expr_p
!= save_expr
)
5304 case FIX_TRUNC_EXPR
:
5306 case FIX_FLOOR_EXPR
:
5307 case FIX_ROUND_EXPR
:
5308 /* unary_expr: ... | '(' cast ')' val | ... */
5309 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5310 is_gimple_val
, fb_rvalue
);
5311 recalculate_side_effects (*expr_p
);
5315 *expr_p
= fold_indirect_ref (*expr_p
);
5316 if (*expr_p
!= save_expr
)
5318 /* else fall through. */
5319 case ALIGN_INDIRECT_REF
:
5320 case MISALIGNED_INDIRECT_REF
:
5321 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5322 is_gimple_reg
, fb_rvalue
);
5323 recalculate_side_effects (*expr_p
);
5326 /* Constants need not be gimplified. */
5336 /* If we require an lvalue, such as for ADDR_EXPR, retain the
5337 CONST_DECL node. Otherwise the decl is replaceable by its
5339 /* ??? Should be == fb_lvalue, but ADDR_EXPR passes fb_either. */
5340 if (fallback
& fb_lvalue
)
5343 *expr_p
= DECL_INITIAL (*expr_p
);
5347 ret
= gimplify_decl_expr (expr_p
);
5351 /* FIXME make this a decl. */
5356 ret
= gimplify_bind_expr (expr_p
, NULL
, pre_p
);
5360 ret
= gimplify_loop_expr (expr_p
, pre_p
);
5364 ret
= gimplify_switch_expr (expr_p
, pre_p
);
5368 ret
= gimplify_exit_expr (expr_p
);
5372 /* If the target is not LABEL, then it is a computed jump
5373 and the target needs to be gimplified. */
5374 if (TREE_CODE (GOTO_DESTINATION (*expr_p
)) != LABEL_DECL
)
5375 ret
= gimplify_expr (&GOTO_DESTINATION (*expr_p
), pre_p
,
5376 NULL
, is_gimple_val
, fb_rvalue
);
5381 gcc_assert (decl_function_context (LABEL_EXPR_LABEL (*expr_p
))
5382 == current_function_decl
);
5385 case CASE_LABEL_EXPR
:
5386 ret
= gimplify_case_label_expr (expr_p
);
5390 ret
= gimplify_return_expr (*expr_p
, pre_p
);
5394 /* Don't reduce this in place; let gimplify_init_constructor work its
5395 magic. Buf if we're just elaborating this for side effects, just
5396 gimplify any element that has side-effects. */
5397 if (fallback
== fb_none
)
5399 unsigned HOST_WIDE_INT ix
;
5400 constructor_elt
*ce
;
5401 tree temp
= NULL_TREE
;
5403 VEC_iterate (constructor_elt
, CONSTRUCTOR_ELTS (*expr_p
),
5406 if (TREE_SIDE_EFFECTS (ce
->value
))
5407 append_to_statement_list (ce
->value
, &temp
);
5412 /* C99 code may assign to an array in a constructed
5413 structure or union, and this has undefined behavior only
5414 on execution, so create a temporary if an lvalue is
5416 else if (fallback
== fb_lvalue
)
5418 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
5419 lang_hooks
.mark_addressable (*expr_p
);
5425 /* The following are special cases that are not handled by the
5426 original GIMPLE grammar. */
5428 /* SAVE_EXPR nodes are converted into a GIMPLE identifier and
5431 ret
= gimplify_save_expr (expr_p
, pre_p
, post_p
);
5436 enum gimplify_status r0
, r1
, r2
;
5438 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5439 is_gimple_lvalue
, fb_either
);
5440 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
5441 is_gimple_val
, fb_rvalue
);
5442 r2
= gimplify_expr (&TREE_OPERAND (*expr_p
, 2), pre_p
, post_p
,
5443 is_gimple_val
, fb_rvalue
);
5444 recalculate_side_effects (*expr_p
);
5446 ret
= MIN (r0
, MIN (r1
, r2
));
5450 case NON_LVALUE_EXPR
:
5451 /* This should have been stripped above. */
5455 ret
= gimplify_asm_expr (expr_p
, pre_p
, post_p
);
5458 case TRY_FINALLY_EXPR
:
5459 case TRY_CATCH_EXPR
:
5460 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p
, 0));
5461 gimplify_to_stmt_list (&TREE_OPERAND (*expr_p
, 1));
5465 case CLEANUP_POINT_EXPR
:
5466 ret
= gimplify_cleanup_point_expr (expr_p
, pre_p
);
5470 ret
= gimplify_target_expr (expr_p
, pre_p
, post_p
);
5474 gimplify_to_stmt_list (&CATCH_BODY (*expr_p
));
5478 case EH_FILTER_EXPR
:
5479 gimplify_to_stmt_list (&EH_FILTER_FAILURE (*expr_p
));
5485 enum gimplify_status r0
, r1
;
5486 r0
= gimplify_expr (&OBJ_TYPE_REF_OBJECT (*expr_p
), pre_p
, post_p
,
5487 is_gimple_val
, fb_rvalue
);
5488 r1
= gimplify_expr (&OBJ_TYPE_REF_EXPR (*expr_p
), pre_p
, post_p
,
5489 is_gimple_val
, fb_rvalue
);
5495 /* We get here when taking the address of a label. We mark
5496 the label as "forced"; meaning it can never be removed and
5497 it is a potential target for any computed goto. */
5498 FORCED_LABEL (*expr_p
) = 1;
5502 case STATEMENT_LIST
:
5503 ret
= gimplify_statement_list (expr_p
);
5506 case WITH_SIZE_EXPR
:
5508 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
5509 post_p
== &internal_post
? NULL
: post_p
,
5510 gimple_test_f
, fallback
);
5511 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
5512 is_gimple_val
, fb_rvalue
);
5518 ret
= gimplify_var_or_parm_decl (expr_p
);
5522 /* Allow callbacks into the gimplifier during optimization. */
5527 ret
= gimplify_omp_parallel (expr_p
, pre_p
);
5531 ret
= gimplify_omp_for (expr_p
, pre_p
);
5536 ret
= gimplify_omp_workshare (expr_p
, pre_p
);
5543 gimplify_to_stmt_list (&OMP_BODY (*expr_p
));
5547 ret
= gimplify_omp_atomic (expr_p
, pre_p
);
5550 case OMP_RETURN_EXPR
:
5555 switch (TREE_CODE_CLASS (TREE_CODE (*expr_p
)))
5557 case tcc_comparison
:
5558 /* If this is a comparison of objects of aggregate type,
5559 handle it specially (by converting to a call to
5560 memcmp). It would be nice to only have to do this
5561 for variable-sized objects, but then we'd have to
5562 allow the same nest of reference nodes we allow for
5563 MODIFY_EXPR and that's too complex. */
5564 if (!AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (*expr_p
, 1))))
5566 ret
= gimplify_variable_sized_compare (expr_p
);
5569 /* If *EXPR_P does not need to be special-cased, handle it
5570 according to its class. */
5572 ret
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
5573 post_p
, is_gimple_val
, fb_rvalue
);
5579 enum gimplify_status r0
, r1
;
5581 r0
= gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
,
5582 post_p
, is_gimple_val
, fb_rvalue
);
5583 r1
= gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
,
5584 post_p
, is_gimple_val
, fb_rvalue
);
5590 case tcc_declaration
:
5593 goto dont_recalculate
;
5596 gcc_assert (TREE_CODE (*expr_p
) == TRUTH_AND_EXPR
5597 || TREE_CODE (*expr_p
) == TRUTH_OR_EXPR
5598 || TREE_CODE (*expr_p
) == TRUTH_XOR_EXPR
);
5602 recalculate_side_effects (*expr_p
);
5607 /* If we replaced *expr_p, gimplify again. */
5608 if (ret
== GS_OK
&& (*expr_p
== NULL
|| *expr_p
== save_expr
))
5611 while (ret
== GS_OK
);
5613 /* If we encountered an error_mark somewhere nested inside, either
5614 stub out the statement or propagate the error back out. */
5615 if (ret
== GS_ERROR
)
5622 /* This was only valid as a return value from the langhook, which
5623 we handled. Make sure it doesn't escape from any other context. */
5624 gcc_assert (ret
!= GS_UNHANDLED
);
5626 if (fallback
== fb_none
&& *expr_p
&& !is_gimple_stmt (*expr_p
))
5628 /* We aren't looking for a value, and we don't have a valid
5629 statement. If it doesn't have side-effects, throw it away. */
5630 if (!TREE_SIDE_EFFECTS (*expr_p
))
5632 else if (!TREE_THIS_VOLATILE (*expr_p
))
5634 /* This is probably a _REF that contains something nested that
5635 has side effects. Recurse through the operands to find it. */
5636 enum tree_code code
= TREE_CODE (*expr_p
);
5641 case REALPART_EXPR
: case IMAGPART_EXPR
:
5642 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5643 gimple_test_f
, fallback
);
5646 case ARRAY_REF
: case ARRAY_RANGE_REF
:
5647 gimplify_expr (&TREE_OPERAND (*expr_p
, 0), pre_p
, post_p
,
5648 gimple_test_f
, fallback
);
5649 gimplify_expr (&TREE_OPERAND (*expr_p
, 1), pre_p
, post_p
,
5650 gimple_test_f
, fallback
);
5654 /* Anything else with side-effects must be converted to
5655 a valid statement before we get here. */
5661 else if (COMPLETE_TYPE_P (TREE_TYPE (*expr_p
)))
5663 /* Historically, the compiler has treated a bare
5664 reference to a volatile lvalue as forcing a load. */
5665 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (*expr_p
));
5666 /* Normally, we do want to create a temporary for a
5667 TREE_ADDRESSABLE type because such a type should not be
5668 copied by bitwise-assignment. However, we make an
5669 exception here, as all we are doing here is ensuring that
5670 we read the bytes that make up the type. We use
5671 create_tmp_var_raw because create_tmp_var will abort when
5672 given a TREE_ADDRESSABLE type. */
5673 tree tmp
= create_tmp_var_raw (type
, "vol");
5674 gimple_add_tmp_var (tmp
);
5675 *expr_p
= build2 (MODIFY_EXPR
, type
, tmp
, *expr_p
);
5678 /* We can't do anything useful with a volatile reference to
5679 incomplete type, so just throw it away. */
5683 /* If we are gimplifying at the statement level, we're done. Tack
5684 everything together and replace the original statement with the
5686 if (fallback
== fb_none
|| is_statement
)
5688 if (internal_pre
|| internal_post
)
5690 append_to_statement_list (*expr_p
, &internal_pre
);
5691 append_to_statement_list (internal_post
, &internal_pre
);
5692 annotate_all_with_locus (&internal_pre
, input_location
);
5693 *expr_p
= internal_pre
;
5697 else if (TREE_CODE (*expr_p
) == STATEMENT_LIST
)
5698 annotate_all_with_locus (expr_p
, input_location
);
5700 annotate_one_with_locus (*expr_p
, input_location
);
5704 /* Otherwise we're gimplifying a subexpression, so the resulting value is
5707 /* If it's sufficiently simple already, we're done. Unless we are
5708 handling some post-effects internally; if that's the case, we need to
5709 copy into a temp before adding the post-effects to the tree. */
5710 if (!internal_post
&& (*gimple_test_f
) (*expr_p
))
5713 /* Otherwise, we need to create a new temporary for the gimplified
5716 /* We can't return an lvalue if we have an internal postqueue. The
5717 object the lvalue refers to would (probably) be modified by the
5718 postqueue; we need to copy the value out first, which means an
5720 if ((fallback
& fb_lvalue
) && !internal_post
5721 && is_gimple_addressable (*expr_p
))
5723 /* An lvalue will do. Take the address of the expression, store it
5724 in a temporary, and replace the expression with an INDIRECT_REF of
5726 tmp
= build_fold_addr_expr (*expr_p
);
5727 gimplify_expr (&tmp
, pre_p
, post_p
, is_gimple_reg
, fb_rvalue
);
5728 *expr_p
= build1 (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (tmp
)), tmp
);
5730 else if ((fallback
& fb_rvalue
) && is_gimple_formal_tmp_rhs (*expr_p
))
5732 gcc_assert (!VOID_TYPE_P (TREE_TYPE (*expr_p
)));
5734 /* An rvalue will do. Assign the gimplified expression into a new
5735 temporary TMP and replace the original expression with TMP. */
5737 if (internal_post
|| (fallback
& fb_lvalue
))
5738 /* The postqueue might change the value of the expression between
5739 the initialization and use of the temporary, so we can't use a
5740 formal temp. FIXME do we care? */
5741 *expr_p
= get_initialized_tmp_var (*expr_p
, pre_p
, post_p
);
5743 *expr_p
= get_formal_tmp_var (*expr_p
, pre_p
);
5745 if (TREE_CODE (*expr_p
) != SSA_NAME
)
5746 DECL_GIMPLE_FORMAL_TEMP_P (*expr_p
) = 1;
5750 #ifdef ENABLE_CHECKING
5751 if (!(fallback
& fb_mayfail
))
5753 fprintf (stderr
, "gimplification failed:\n");
5754 print_generic_expr (stderr
, *expr_p
, 0);
5755 debug_tree (*expr_p
);
5756 internal_error ("gimplification failed");
5759 gcc_assert (fallback
& fb_mayfail
);
5760 /* If this is an asm statement, and the user asked for the
5761 impossible, don't die. Fail and let gimplify_asm_expr
5767 /* Make sure the temporary matches our predicate. */
5768 gcc_assert ((*gimple_test_f
) (*expr_p
));
5772 annotate_all_with_locus (&internal_post
, input_location
);
5773 append_to_statement_list (internal_post
, pre_p
);
5777 input_location
= saved_location
;
5781 /* Look through TYPE for variable-sized objects and gimplify each such
5782 size that we find. Add to LIST_P any statements generated. */
5785 gimplify_type_sizes (tree type
, tree
*list_p
)
5789 if (type
== NULL
|| type
== error_mark_node
)
5792 /* We first do the main variant, then copy into any other variants. */
5793 type
= TYPE_MAIN_VARIANT (type
);
5795 /* Avoid infinite recursion. */
5796 if (TYPE_SIZES_GIMPLIFIED (type
))
5799 TYPE_SIZES_GIMPLIFIED (type
) = 1;
5801 switch (TREE_CODE (type
))
5808 gimplify_one_sizepos (&TYPE_MIN_VALUE (type
), list_p
);
5809 gimplify_one_sizepos (&TYPE_MAX_VALUE (type
), list_p
);
5811 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5813 TYPE_MIN_VALUE (t
) = TYPE_MIN_VALUE (type
);
5814 TYPE_MAX_VALUE (t
) = TYPE_MAX_VALUE (type
);
5819 /* These types may not have declarations, so handle them here. */
5820 gimplify_type_sizes (TREE_TYPE (type
), list_p
);
5821 gimplify_type_sizes (TYPE_DOMAIN (type
), list_p
);
5826 case QUAL_UNION_TYPE
:
5827 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
5828 if (TREE_CODE (field
) == FIELD_DECL
)
5830 gimplify_one_sizepos (&DECL_FIELD_OFFSET (field
), list_p
);
5831 gimplify_type_sizes (TREE_TYPE (field
), list_p
);
5836 case REFERENCE_TYPE
:
5837 gimplify_type_sizes (TREE_TYPE (type
), list_p
);
5844 gimplify_one_sizepos (&TYPE_SIZE (type
), list_p
);
5845 gimplify_one_sizepos (&TYPE_SIZE_UNIT (type
), list_p
);
5847 for (t
= TYPE_NEXT_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5849 TYPE_SIZE (t
) = TYPE_SIZE (type
);
5850 TYPE_SIZE_UNIT (t
) = TYPE_SIZE_UNIT (type
);
5851 TYPE_SIZES_GIMPLIFIED (t
) = 1;
5855 /* A subroutine of gimplify_type_sizes to make sure that *EXPR_P,
5856 a size or position, has had all of its SAVE_EXPRs evaluated.
5857 We add any required statements to STMT_P. */
5860 gimplify_one_sizepos (tree
*expr_p
, tree
*stmt_p
)
5862 tree type
, expr
= *expr_p
;
5864 /* We don't do anything if the value isn't there, is constant, or contains
5865 A PLACEHOLDER_EXPR. We also don't want to do anything if it's already
5866 a VAR_DECL. If it's a VAR_DECL from another function, the gimplifier
5867 will want to replace it with a new variable, but that will cause problems
5868 if this type is from outside the function. It's OK to have that here. */
5869 if (expr
== NULL_TREE
|| TREE_CONSTANT (expr
)
5870 || TREE_CODE (expr
) == VAR_DECL
5871 || CONTAINS_PLACEHOLDER_P (expr
))
5874 type
= TREE_TYPE (expr
);
5875 *expr_p
= unshare_expr (expr
);
5877 gimplify_expr (expr_p
, stmt_p
, NULL
, is_gimple_val
, fb_rvalue
);
5880 /* Verify that we've an exact type match with the original expression.
5881 In particular, we do not wish to drop a "sizetype" in favour of a
5882 type of similar dimensions. We don't want to pollute the generic
5883 type-stripping code with this knowledge because it doesn't matter
5884 for the bulk of GENERIC/GIMPLE. It only matters that TYPE_SIZE_UNIT
5885 and friends retain their "sizetype-ness". */
5886 if (TREE_TYPE (expr
) != type
5887 && TREE_CODE (type
) == INTEGER_TYPE
5888 && TYPE_IS_SIZETYPE (type
))
5892 *expr_p
= create_tmp_var (type
, NULL
);
5893 tmp
= build1 (NOP_EXPR
, type
, expr
);
5894 tmp
= build2 (MODIFY_EXPR
, type
, *expr_p
, expr
);
5895 if (EXPR_HAS_LOCATION (expr
))
5896 SET_EXPR_LOCUS (tmp
, EXPR_LOCUS (expr
));
5898 SET_EXPR_LOCATION (tmp
, input_location
);
5900 gimplify_and_add (tmp
, stmt_p
);
5904 #ifdef ENABLE_CHECKING
5905 /* Compare types A and B for a "close enough" match. */
5908 cpt_same_type (tree a
, tree b
)
5910 if (lang_hooks
.types_compatible_p (a
, b
))
5913 /* ??? The C++ FE decomposes METHOD_TYPES to FUNCTION_TYPES and doesn't
5914 link them together. This routine is intended to catch type errors
5915 that will affect the optimizers, and the optimizers don't add new
5916 dereferences of function pointers, so ignore it. */
5917 if ((TREE_CODE (a
) == FUNCTION_TYPE
|| TREE_CODE (a
) == METHOD_TYPE
)
5918 && (TREE_CODE (b
) == FUNCTION_TYPE
|| TREE_CODE (b
) == METHOD_TYPE
))
5921 /* ??? The C FE pushes type qualifiers after the fact into the type of
5922 the element from the type of the array. See build_unary_op's handling
5923 of ADDR_EXPR. This seems wrong -- if we were going to do this, we
5924 should have done it when creating the variable in the first place.
5925 Alternately, why aren't the two array types made variants? */
5926 if (TREE_CODE (a
) == ARRAY_TYPE
&& TREE_CODE (b
) == ARRAY_TYPE
)
5927 return cpt_same_type (TREE_TYPE (a
), TREE_TYPE (b
));
5929 /* And because of those, we have to recurse down through pointers. */
5930 if (POINTER_TYPE_P (a
) && POINTER_TYPE_P (b
))
5931 return cpt_same_type (TREE_TYPE (a
), TREE_TYPE (b
));
5936 /* Check for some cases of the front end missing cast expressions.
5937 The type of a dereference should correspond to the pointer type;
5938 similarly the type of an address should match its object. */
5941 check_pointer_types_r (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
5942 void *data ATTRIBUTE_UNUSED
)
5945 tree ptype
, otype
, dtype
;
5947 switch (TREE_CODE (t
))
5951 otype
= TREE_TYPE (t
);
5952 ptype
= TREE_TYPE (TREE_OPERAND (t
, 0));
5953 dtype
= TREE_TYPE (ptype
);
5954 gcc_assert (cpt_same_type (otype
, dtype
));
5958 ptype
= TREE_TYPE (t
);
5959 otype
= TREE_TYPE (TREE_OPERAND (t
, 0));
5960 dtype
= TREE_TYPE (ptype
);
5961 if (!cpt_same_type (otype
, dtype
))
5963 /* &array is allowed to produce a pointer to the element, rather than
5964 a pointer to the array type. We must allow this in order to
5965 properly represent assigning the address of an array in C into
5966 pointer to the element type. */
5967 gcc_assert (TREE_CODE (otype
) == ARRAY_TYPE
5968 && POINTER_TYPE_P (ptype
)
5969 && cpt_same_type (TREE_TYPE (otype
), dtype
));
5983 /* Gimplify the body of statements pointed to by BODY_P. FNDECL is the
5984 function decl containing BODY. */
5987 gimplify_body (tree
*body_p
, tree fndecl
, bool do_parms
)
5989 location_t saved_location
= input_location
;
5990 tree body
, parm_stmts
;
5992 timevar_push (TV_TREE_GIMPLIFY
);
5994 gcc_assert (gimplify_ctxp
== NULL
);
5995 push_gimplify_context ();
5997 /* Unshare most shared trees in the body and in that of any nested functions.
5998 It would seem we don't have to do this for nested functions because
5999 they are supposed to be output and then the outer function gimplified
6000 first, but the g++ front end doesn't always do it that way. */
6001 unshare_body (body_p
, fndecl
);
6002 unvisit_body (body_p
, fndecl
);
6004 /* Make sure input_location isn't set to something wierd. */
6005 input_location
= DECL_SOURCE_LOCATION (fndecl
);
6007 /* Resolve callee-copies. This has to be done before processing
6008 the body so that DECL_VALUE_EXPR gets processed correctly. */
6009 parm_stmts
= do_parms
? gimplify_parameters () : NULL
;
6011 /* Gimplify the function's body. */
6012 gimplify_stmt (body_p
);
6016 body
= alloc_stmt_list ();
6017 else if (TREE_CODE (body
) == STATEMENT_LIST
)
6019 tree t
= expr_only (*body_p
);
6024 /* If there isn't an outer BIND_EXPR, add one. */
6025 if (TREE_CODE (body
) != BIND_EXPR
)
6027 tree b
= build3 (BIND_EXPR
, void_type_node
, NULL_TREE
,
6028 NULL_TREE
, NULL_TREE
);
6029 TREE_SIDE_EFFECTS (b
) = 1;
6030 append_to_statement_list_force (body
, &BIND_EXPR_BODY (b
));
6034 /* If we had callee-copies statements, insert them at the beginning
6038 append_to_statement_list_force (BIND_EXPR_BODY (body
), &parm_stmts
);
6039 BIND_EXPR_BODY (body
) = parm_stmts
;
6042 /* Unshare again, in case gimplification was sloppy. */
6043 unshare_all_trees (body
);
6047 pop_gimplify_context (body
);
6048 gcc_assert (gimplify_ctxp
== NULL
);
6050 #ifdef ENABLE_CHECKING
6051 walk_tree (body_p
, check_pointer_types_r
, NULL
, NULL
);
6054 timevar_pop (TV_TREE_GIMPLIFY
);
6055 input_location
= saved_location
;
6058 /* Entry point to the gimplification pass. FNDECL is the FUNCTION_DECL
6059 node for the function we want to gimplify. */
6062 gimplify_function_tree (tree fndecl
)
6064 tree oldfn
, parm
, ret
;
6066 oldfn
= current_function_decl
;
6067 current_function_decl
= fndecl
;
6068 cfun
= DECL_STRUCT_FUNCTION (fndecl
);
6070 allocate_struct_function (fndecl
);
6072 for (parm
= DECL_ARGUMENTS (fndecl
); parm
; parm
= TREE_CHAIN (parm
))
6074 /* Preliminarily mark non-addressed complex variables as eligible
6075 for promotion to gimple registers. We'll transform their uses
6077 if (TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
6078 && !TREE_THIS_VOLATILE (parm
)
6079 && !needs_to_live_in_memory (parm
))
6080 DECL_COMPLEX_GIMPLE_REG_P (parm
) = 1;
6083 ret
= DECL_RESULT (fndecl
);
6084 if (TREE_CODE (TREE_TYPE (ret
)) == COMPLEX_TYPE
6085 && !needs_to_live_in_memory (ret
))
6086 DECL_COMPLEX_GIMPLE_REG_P (ret
) = 1;
6088 gimplify_body (&DECL_SAVED_TREE (fndecl
), fndecl
, true);
6090 /* If we're instrumenting function entry/exit, then prepend the call to
6091 the entry hook and wrap the whole function in a TRY_FINALLY_EXPR to
6092 catch the exit hook. */
6093 /* ??? Add some way to ignore exceptions for this TFE. */
6094 if (flag_instrument_function_entry_exit
6095 && ! DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (fndecl
))
6099 tf
= build2 (TRY_FINALLY_EXPR
, void_type_node
, NULL
, NULL
);
6100 TREE_SIDE_EFFECTS (tf
) = 1;
6101 x
= DECL_SAVED_TREE (fndecl
);
6102 append_to_statement_list (x
, &TREE_OPERAND (tf
, 0));
6103 x
= implicit_built_in_decls
[BUILT_IN_PROFILE_FUNC_EXIT
];
6104 x
= build_function_call_expr (x
, NULL
);
6105 append_to_statement_list (x
, &TREE_OPERAND (tf
, 1));
6107 bind
= build3 (BIND_EXPR
, void_type_node
, NULL
, NULL
, NULL
);
6108 TREE_SIDE_EFFECTS (bind
) = 1;
6109 x
= implicit_built_in_decls
[BUILT_IN_PROFILE_FUNC_ENTER
];
6110 x
= build_function_call_expr (x
, NULL
);
6111 append_to_statement_list (x
, &BIND_EXPR_BODY (bind
));
6112 append_to_statement_list (tf
, &BIND_EXPR_BODY (bind
));
6114 DECL_SAVED_TREE (fndecl
) = bind
;
6117 current_function_decl
= oldfn
;
6118 cfun
= oldfn
? DECL_STRUCT_FUNCTION (oldfn
) : NULL
;
6122 /* Expands EXPR to list of gimple statements STMTS. If SIMPLE is true,
6123 force the result to be either ssa_name or an invariant, otherwise
6124 just force it to be a rhs expression. If VAR is not NULL, make the
6125 base variable of the final destination be VAR if suitable. */
6128 force_gimple_operand (tree expr
, tree
*stmts
, bool simple
, tree var
)
6131 enum gimplify_status ret
;
6132 gimple_predicate gimple_test_f
;
6136 if (is_gimple_val (expr
))
6139 gimple_test_f
= simple
? is_gimple_val
: is_gimple_reg_rhs
;
6141 push_gimplify_context ();
6142 gimplify_ctxp
->into_ssa
= in_ssa_p
;
6145 expr
= build2 (MODIFY_EXPR
, TREE_TYPE (var
), var
, expr
);
6147 ret
= gimplify_expr (&expr
, stmts
, NULL
,
6148 gimple_test_f
, fb_rvalue
);
6149 gcc_assert (ret
!= GS_ERROR
);
6151 if (referenced_vars
)
6153 for (t
= gimplify_ctxp
->temps
; t
; t
= TREE_CHAIN (t
))
6154 add_referenced_tmp_var (t
);
6157 pop_gimplify_context (NULL
);
6162 /* Invokes force_gimple_operand for EXPR with parameters SIMPLE_P and VAR. If
6163 some statements are produced, emits them before BSI. */
6166 force_gimple_operand_bsi (block_stmt_iterator
*bsi
, tree expr
,
6167 bool simple_p
, tree var
)
6171 expr
= force_gimple_operand (expr
, &stmts
, simple_p
, var
);
6173 bsi_insert_before (bsi
, stmts
, BSI_SAME_STMT
);
6178 #include "gt-gimplify.h"